id stringlengths 36 36 | task_type stringclasses 1 value | prompt stringlengths 378 560 | verification_info stringlengths 699 1.84k | metadata dict |
|---|---|---|---|---|
reasoning_gym_binary_matrix_bBNxiQXm | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0 1 1 1
1 1 0 1 0 1
1 1 1 0 1 1
1 1 1 1 1 1
0 1 1 1 0 1
1 1 1 1 0 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 0 1 1 2\n2 1 0 1 0 1\n2 2 1 0 1 2\n1 2 2 1 1 2\n0 1 2 1 0 1\n1 2 2 1 0 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0 1 1 1\n1 1 0 1 0 1\n1 1 1 0 1 1\n1 1 1 1 1 1\n0 1 1 1 0 1\n1 1 1 1 0 1\n", "answer": "2 1 0 1 1 2\n2 1 0 1 0 1\n2 2 1 0 1 2\n1 2 2 1 1 2\n0 1 2 1 0 1\n1 2 2 1 0 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 0, "matrix": [[1, 1, 0, 1, 1, 1], [1, 1, 0, 1, 0, 1], [1, 1, 1, 0, 1, 1], [1, 1, 1, 1, 1, 1], [0, 1, 1, 1, 0, 1], [1, 1, 1, 1, 0, 1]], "solution": [[2, 1, 0, 1, 1, 2], [2, 1, 0, 1, 0, 1], [2, 2, 1, 0, 1, 2], [1, 2, 2, 1, 1, 2], [0, 1, 2, 1, 0, 1], [1, 2, 2, 1, 0, 1]], "n": 6, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0,
1,
1,
1
],
[
1,
1,
0,
1,
0,
1
],
[
1,
1,
1,
0,
1,
1
],
[
1,
1,
1,
1,
1,
1
],
[
0,
1,
1,
1,
0,
1
],
[
1,
1,
1,
1,
0,
1
]
],
"n": 6,
"solution": [
[
2,
1,
0,
1,
1,
2
],
[
2,
1,
0,
1,
0,
1
],
[
2,
2,
1,
0,
1,
2
],
[
1,
2,
2,
1,
1,
2
],
[
0,
1,
2,
1,
0,
1
],
[
1,
2,
2,
1,
0,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 0
} |
reasoning_gym_binary_matrix_3q6rBT7t | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 1 1 1 1 1 0 0
0 0 0 1 1 1 1 1 0 1
1 1 1 1 1 1 0 0 1 1
1 1 1 1 1 0 1 1 1 1
1 1 1 1 1 1 1 1 1 1
0 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 0 1 0 1
1 1 0 1 1 1 1 1 1 0
1 0 0 0 1 0 1 1 1 1
0 1 1 1 1 1 1 1 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 1 1 2 3 3 2 1 0 0\n0 0 0 1 2 2 1 1 0 1\n1 1 1 2 2 1 0 0 1 2\n2 2 2 2 1 0 1 1 2 3\n1 2 3 3 2 1 2 2 2 3\n0 1 2 3 3 2 1 2 1 2\n1 2 1 2 2 1 0 1 0 1\n2 1 0 1 2 1 1 2 1 0\n1 0 0 0 1 0 1 2 2 1\n0 1 1 1 2 1 2 2 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 1 1 1 1 1 0 0\n0 0 0 1 1 1 1 1 0 1\n1 1 1 1 1 1 0 0 1 1\n1 1 1 1 1 0 1 1 1 1\n1 1 1 1 1 1 1 1 1 1\n0 1 1 1 1 1 1 1 1 1\n1 1 1 1 1 1 0 1 0 1\n1 1 0 1 1 1 1 1 1 0\n1 0 0 0 1 0 1 1 1 1\n0 1 1 1 1 1 1 1 1 0\n", "answer": "1 1 1 2 3 3 2 1 0 0\n0 0 0 1 2 2 1 1 0 1\n1 1 1 2 2 1 0 0 1 2\n2 2 2 2 1 0 1 1 2 3\n1 2 3 3 2 1 2 2 2 3\n0 1 2 3 3 2 1 2 1 2\n1 2 1 2 2 1 0 1 0 1\n2 1 0 1 2 1 1 2 1 0\n1 0 0 0 1 0 1 2 2 1\n0 1 1 1 2 1 2 2 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 1, "matrix": [[1, 1, 1, 1, 1, 1, 1, 1, 0, 0], [0, 0, 0, 1, 1, 1, 1, 1, 0, 1], [1, 1, 1, 1, 1, 1, 0, 0, 1, 1], [1, 1, 1, 1, 1, 0, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 0, 1, 0, 1], [1, 1, 0, 1, 1, 1, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 1, 1, 1, 1], [0, 1, 1, 1, 1, 1, 1, 1, 1, 0]], "solution": [[1, 1, 1, 2, 3, 3, 2, 1, 0, 0], [0, 0, 0, 1, 2, 2, 1, 1, 0, 1], [1, 1, 1, 2, 2, 1, 0, 0, 1, 2], [2, 2, 2, 2, 1, 0, 1, 1, 2, 3], [1, 2, 3, 3, 2, 1, 2, 2, 2, 3], [0, 1, 2, 3, 3, 2, 1, 2, 1, 2], [1, 2, 1, 2, 2, 1, 0, 1, 0, 1], [2, 1, 0, 1, 2, 1, 1, 2, 1, 0], [1, 0, 0, 0, 1, 0, 1, 2, 2, 1], [0, 1, 1, 1, 2, 1, 2, 2, 1, 0]], "n": 10, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
1,
1,
1,
1,
1,
0,
0
],
[
0,
0,
0,
1,
1,
1,
1,
1,
0,
1
],
[
1,
1,
1,
1,
1,
1,
0,
0,
1,
1
],
[
1,
1,
1,
1,
1,
0,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
0,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
0,
1,
0,
1
],
[
1,
1,
0,
1,
1,
1,
1,
1,
1,
0
],
[
1,
0,
0,
0,
1,
0,
1,
1,
1,
1
],
[
0,
1,
1,
1,
1,
1,
1,
1,
1,
0
]
],
"n": 10,
"solution": [
[
1,
1,
1,
2,
3,
3,
2,
1,
0,
0
],
[
0,
0,
0,
1,
2,
2,
1,
1,
0,
1
],
[
1,
1,
1,
2,
2,
1,
0,
0,
1,
2
],
[
2,
2,
2,
2,
1,
0,
1,
1,
2,
3
],
[
1,
2,
3,
3,
2,
1,
2,
2,
2,
3
],
[
0,
1,
2,
3,
3,
2,
1,
2,
1,
2
],
[
1,
2,
1,
2,
2,
1,
0,
1,
0,
1
],
[
2,
1,
0,
1,
2,
1,
1,
2,
1,
0
],
[
1,
0,
0,
0,
1,
0,
1,
2,
2,
1
],
[
0,
1,
1,
1,
2,
1,
2,
2,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 1
} |
reasoning_gym_binary_matrix_PvVd7eZF | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 1 1 0 1 0 1 1
1 0 1 1 0 1 1 1 1 1
0 0 1 0 0 0 1 1 1 1
0 1 0 1 1 0 1 1 0 0
1 1 1 0 1 1 1 1 0 1
1 1 0 1 1 0 1 1 1 0
1 0 1 1 1 0 0 1 1 1
1 0 1 1 1 1 1 1 1 1
1 1 1 1 0 0 1 1 1 1
1 1 1 1 1 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 2 2 1 0 1 0 1 2\n1 0 1 1 0 1 2 1 2 2\n0 0 1 0 0 0 1 2 1 1\n0 1 0 1 1 0 1 1 0 0\n1 2 1 0 1 1 2 1 0 1\n2 1 0 1 1 0 1 2 1 0\n1 0 1 2 1 0 0 1 2 1\n1 0 1 2 1 1 1 2 3 2\n2 1 2 1 0 0 1 2 3 3\n3 2 3 2 1 1 2 3 4 4", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 1 1 0 1 0 1 1\n1 0 1 1 0 1 1 1 1 1\n0 0 1 0 0 0 1 1 1 1\n0 1 0 1 1 0 1 1 0 0\n1 1 1 0 1 1 1 1 0 1\n1 1 0 1 1 0 1 1 1 0\n1 0 1 1 1 0 0 1 1 1\n1 0 1 1 1 1 1 1 1 1\n1 1 1 1 0 0 1 1 1 1\n1 1 1 1 1 1 1 1 1 1\n", "answer": "2 1 2 2 1 0 1 0 1 2\n1 0 1 1 0 1 2 1 2 2\n0 0 1 0 0 0 1 2 1 1\n0 1 0 1 1 0 1 1 0 0\n1 2 1 0 1 1 2 1 0 1\n2 1 0 1 1 0 1 2 1 0\n1 0 1 2 1 0 0 1 2 1\n1 0 1 2 1 1 1 2 3 2\n2 1 2 1 0 0 1 2 3 3\n3 2 3 2 1 1 2 3 4 4", "metadata": {"source_dataset": "binary_matrix", "source_index": 2, "matrix": [[1, 1, 1, 1, 1, 0, 1, 0, 1, 1], [1, 0, 1, 1, 0, 1, 1, 1, 1, 1], [0, 0, 1, 0, 0, 0, 1, 1, 1, 1], [0, 1, 0, 1, 1, 0, 1, 1, 0, 0], [1, 1, 1, 0, 1, 1, 1, 1, 0, 1], [1, 1, 0, 1, 1, 0, 1, 1, 1, 0], [1, 0, 1, 1, 1, 0, 0, 1, 1, 1], [1, 0, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 0, 0, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], "solution": [[2, 1, 2, 2, 1, 0, 1, 0, 1, 2], [1, 0, 1, 1, 0, 1, 2, 1, 2, 2], [0, 0, 1, 0, 0, 0, 1, 2, 1, 1], [0, 1, 0, 1, 1, 0, 1, 1, 0, 0], [1, 2, 1, 0, 1, 1, 2, 1, 0, 1], [2, 1, 0, 1, 1, 0, 1, 2, 1, 0], [1, 0, 1, 2, 1, 0, 0, 1, 2, 1], [1, 0, 1, 2, 1, 1, 1, 2, 3, 2], [2, 1, 2, 1, 0, 0, 1, 2, 3, 3], [3, 2, 3, 2, 1, 1, 2, 3, 4, 4]], "n": 10, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
1,
1,
0,
1,
0,
1,
1
],
[
1,
0,
1,
1,
0,
1,
1,
1,
1,
1
],
[
0,
0,
1,
0,
0,
0,
1,
1,
1,
1
],
[
0,
1,
0,
1,
1,
0,
1,
1,
0,
0
],
[
1,
1,
1,
0,
1,
1,
1,
1,
0,
1
],
[
1,
1,
0,
1,
1,
0,
1,
1,
1,
0
],
[
1,
0,
1,
1,
1,
0,
0,
1,
1,
1
],
[
1,
0,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
0,
0,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
]
],
"n": 10,
"solution": [
[
2,
1,
2,
2,
1,
0,
1,
0,
1,
2
],
[
1,
0,
1,
1,
0,
1,
2,
1,
2,
2
],
[
0,
0,
1,
0,
0,
0,
1,
2,
1,
1
],
[
0,
1,
0,
1,
1,
0,
1,
1,
0,
0
],
[
1,
2,
1,
0,
1,
1,
2,
1,
0,
1
],
[
2,
1,
0,
1,
1,
0,
1,
2,
1,
0
],
[
1,
0,
1,
2,
1,
0,
0,
1,
2,
1
],
[
1,
0,
1,
2,
1,
1,
1,
2,
3,
2
],
[
2,
1,
2,
1,
0,
0,
1,
2,
3,
3
],
[
3,
2,
3,
2,
1,
1,
2,
3,
4,
4
]
],
"source_dataset": "binary_matrix",
"source_index": 2
} |
reasoning_gym_binary_matrix_deoSdFyD | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 0
1 1 1 0
1 0 1 1
1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "3 2 1 0\n2 1 1 0\n1 0 1 1\n2 1 2 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 0\n1 1 1 0\n1 0 1 1\n1 1 1 1\n", "answer": "3 2 1 0\n2 1 1 0\n1 0 1 1\n2 1 2 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 3, "matrix": [[1, 1, 1, 0], [1, 1, 1, 0], [1, 0, 1, 1], [1, 1, 1, 1]], "solution": [[3, 2, 1, 0], [2, 1, 1, 0], [1, 0, 1, 1], [2, 1, 2, 2]], "n": 4, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
0
],
[
1,
1,
1,
0
],
[
1,
0,
1,
1
],
[
1,
1,
1,
1
]
],
"n": 4,
"solution": [
[
3,
2,
1,
0
],
[
2,
1,
1,
0
],
[
1,
0,
1,
1
],
[
2,
1,
2,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 3
} |
reasoning_gym_binary_matrix_Hgbq0ok8 | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 1 1 1 1 1
0 1 1 1 1 0 0
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 0 1 0 1 0 1
1 1 0 1 1 0 1
1 0 0 1 1 0 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 2 3 2 1 1\n0 1 2 2 1 0 0\n1 2 3 2 2 1 1\n2 1 2 1 2 1 2\n1 0 1 0 1 0 1\n2 1 0 1 1 0 1\n1 0 0 1 1 0 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 1 1 1 1 1\n0 1 1 1 1 0 0\n1 1 1 1 1 1 1\n1 1 1 1 1 1 1\n1 0 1 0 1 0 1\n1 1 0 1 1 0 1\n1 0 0 1 1 0 0\n", "answer": "0 1 2 3 2 1 1\n0 1 2 2 1 0 0\n1 2 3 2 2 1 1\n2 1 2 1 2 1 2\n1 0 1 0 1 0 1\n2 1 0 1 1 0 1\n1 0 0 1 1 0 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 4, "matrix": [[0, 1, 1, 1, 1, 1, 1], [0, 1, 1, 1, 1, 0, 0], [1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1], [1, 0, 1, 0, 1, 0, 1], [1, 1, 0, 1, 1, 0, 1], [1, 0, 0, 1, 1, 0, 0]], "solution": [[0, 1, 2, 3, 2, 1, 1], [0, 1, 2, 2, 1, 0, 0], [1, 2, 3, 2, 2, 1, 1], [2, 1, 2, 1, 2, 1, 2], [1, 0, 1, 0, 1, 0, 1], [2, 1, 0, 1, 1, 0, 1], [1, 0, 0, 1, 1, 0, 0]], "n": 7, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
1,
1,
1,
1,
1
],
[
0,
1,
1,
1,
1,
0,
0
],
[
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1
],
[
1,
0,
1,
0,
1,
0,
1
],
[
1,
1,
0,
1,
1,
0,
1
],
[
1,
0,
0,
1,
1,
0,
0
]
],
"n": 7,
"solution": [
[
0,
1,
2,
3,
2,
1,
1
],
[
0,
1,
2,
2,
1,
0,
0
],
[
1,
2,
3,
2,
2,
1,
1
],
[
2,
1,
2,
1,
2,
1,
2
],
[
1,
0,
1,
0,
1,
0,
1
],
[
2,
1,
0,
1,
1,
0,
1
],
[
1,
0,
0,
1,
1,
0,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 4
} |
reasoning_gym_binary_matrix_aZ07sNZb | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 0 0 1 0 0 0
0 1 1 1 1 1 1
1 0 0 1 0 1 1
0 0 1 1 0 1 0
0 1 0 0 1 1 1
0 1 1 1 0 1 1
1 1 0 1 0 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 0 0 1 0 0 0\n0 1 1 2 1 1 1\n1 0 0 1 0 1 1\n0 0 1 1 0 1 0\n0 1 0 0 1 2 1\n0 1 1 1 0 1 1\n1 1 0 1 0 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 0 0 1 0 0 0\n0 1 1 1 1 1 1\n1 0 0 1 0 1 1\n0 0 1 1 0 1 0\n0 1 0 0 1 1 1\n0 1 1 1 0 1 1\n1 1 0 1 0 1 0\n", "answer": "0 0 0 1 0 0 0\n0 1 1 2 1 1 1\n1 0 0 1 0 1 1\n0 0 1 1 0 1 0\n0 1 0 0 1 2 1\n0 1 1 1 0 1 1\n1 1 0 1 0 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 5, "matrix": [[0, 0, 0, 1, 0, 0, 0], [0, 1, 1, 1, 1, 1, 1], [1, 0, 0, 1, 0, 1, 1], [0, 0, 1, 1, 0, 1, 0], [0, 1, 0, 0, 1, 1, 1], [0, 1, 1, 1, 0, 1, 1], [1, 1, 0, 1, 0, 1, 0]], "solution": [[0, 0, 0, 1, 0, 0, 0], [0, 1, 1, 2, 1, 1, 1], [1, 0, 0, 1, 0, 1, 1], [0, 0, 1, 1, 0, 1, 0], [0, 1, 0, 0, 1, 2, 1], [0, 1, 1, 1, 0, 1, 1], [1, 1, 0, 1, 0, 1, 0]], "n": 7, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
0,
0,
1,
0,
0,
0
],
[
0,
1,
1,
1,
1,
1,
1
],
[
1,
0,
0,
1,
0,
1,
1
],
[
0,
0,
1,
1,
0,
1,
0
],
[
0,
1,
0,
0,
1,
1,
1
],
[
0,
1,
1,
1,
0,
1,
1
],
[
1,
1,
0,
1,
0,
1,
0
]
],
"n": 7,
"solution": [
[
0,
0,
0,
1,
0,
0,
0
],
[
0,
1,
1,
2,
1,
1,
1
],
[
1,
0,
0,
1,
0,
1,
1
],
[
0,
0,
1,
1,
0,
1,
0
],
[
0,
1,
0,
0,
1,
2,
1
],
[
0,
1,
1,
1,
0,
1,
1
],
[
1,
1,
0,
1,
0,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 5
} |
reasoning_gym_binary_matrix_eM03HQeR | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 0 1 1 1 1 0 1
0 1 1 1 1 1 1 0
1 0 1 1 0 1 1 1
1 1 1 1 1 1 1 1
1 1 1 0 1 1 1 1
0 0 1 1 1 1 1 1
1 1 0 1 0 1 1 1
1 1 1 0 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 0 1 2 2 1 0 1\n0 1 2 2 1 2 1 0\n1 0 1 1 0 1 2 1\n2 1 2 1 1 2 3 2\n1 1 1 0 1 2 3 3\n0 0 1 1 1 2 3 4\n1 1 0 1 0 1 2 3\n2 2 1 0 1 2 3 4", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 0 1 1 1 1 0 1\n0 1 1 1 1 1 1 0\n1 0 1 1 0 1 1 1\n1 1 1 1 1 1 1 1\n1 1 1 0 1 1 1 1\n0 0 1 1 1 1 1 1\n1 1 0 1 0 1 1 1\n1 1 1 0 1 1 1 1\n", "answer": "0 0 1 2 2 1 0 1\n0 1 2 2 1 2 1 0\n1 0 1 1 0 1 2 1\n2 1 2 1 1 2 3 2\n1 1 1 0 1 2 3 3\n0 0 1 1 1 2 3 4\n1 1 0 1 0 1 2 3\n2 2 1 0 1 2 3 4", "metadata": {"source_dataset": "binary_matrix", "source_index": 6, "matrix": [[0, 0, 1, 1, 1, 1, 0, 1], [0, 1, 1, 1, 1, 1, 1, 0], [1, 0, 1, 1, 0, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 0, 1, 1, 1, 1], [0, 0, 1, 1, 1, 1, 1, 1], [1, 1, 0, 1, 0, 1, 1, 1], [1, 1, 1, 0, 1, 1, 1, 1]], "solution": [[0, 0, 1, 2, 2, 1, 0, 1], [0, 1, 2, 2, 1, 2, 1, 0], [1, 0, 1, 1, 0, 1, 2, 1], [2, 1, 2, 1, 1, 2, 3, 2], [1, 1, 1, 0, 1, 2, 3, 3], [0, 0, 1, 1, 1, 2, 3, 4], [1, 1, 0, 1, 0, 1, 2, 3], [2, 2, 1, 0, 1, 2, 3, 4]], "n": 8, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
0,
1,
1,
1,
1,
0,
1
],
[
0,
1,
1,
1,
1,
1,
1,
0
],
[
1,
0,
1,
1,
0,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
0,
1,
1,
1,
1
],
[
0,
0,
1,
1,
1,
1,
1,
1
],
[
1,
1,
0,
1,
0,
1,
1,
1
],
[
1,
1,
1,
0,
1,
1,
1,
1
]
],
"n": 8,
"solution": [
[
0,
0,
1,
2,
2,
1,
0,
1
],
[
0,
1,
2,
2,
1,
2,
1,
0
],
[
1,
0,
1,
1,
0,
1,
2,
1
],
[
2,
1,
2,
1,
1,
2,
3,
2
],
[
1,
1,
1,
0,
1,
2,
3,
3
],
[
0,
0,
1,
1,
1,
2,
3,
4
],
[
1,
1,
0,
1,
0,
1,
2,
3
],
[
2,
2,
1,
0,
1,
2,
3,
4
]
],
"source_dataset": "binary_matrix",
"source_index": 6
} |
reasoning_gym_binary_matrix_5Ntx3hex | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 1 0
0 1 0 1 0
1 1 1 1 0
1 0 1 0 1
0 1 0 0 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 2 1 1 0\n0 1 0 1 0\n1 1 1 1 0\n1 0 1 0 1\n0 1 0 0 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 1 0\n0 1 0 1 0\n1 1 1 1 0\n1 0 1 0 1\n0 1 0 0 0\n", "answer": "1 2 1 1 0\n0 1 0 1 0\n1 1 1 1 0\n1 0 1 0 1\n0 1 0 0 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 7, "matrix": [[1, 1, 1, 1, 0], [0, 1, 0, 1, 0], [1, 1, 1, 1, 0], [1, 0, 1, 0, 1], [0, 1, 0, 0, 0]], "solution": [[1, 2, 1, 1, 0], [0, 1, 0, 1, 0], [1, 1, 1, 1, 0], [1, 0, 1, 0, 1], [0, 1, 0, 0, 0]], "n": 5, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
1,
0
],
[
0,
1,
0,
1,
0
],
[
1,
1,
1,
1,
0
],
[
1,
0,
1,
0,
1
],
[
0,
1,
0,
0,
0
]
],
"n": 5,
"solution": [
[
1,
2,
1,
1,
0
],
[
0,
1,
0,
1,
0
],
[
1,
1,
1,
1,
0
],
[
1,
0,
1,
0,
1
],
[
0,
1,
0,
0,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 7
} |
reasoning_gym_binary_matrix_Na43cSOr | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1
0 1 1
1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 2 3\n0 1 2\n1 2 3", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1\n0 1 1\n1 1 1\n", "answer": "1 2 3\n0 1 2\n1 2 3", "metadata": {"source_dataset": "binary_matrix", "source_index": 8, "matrix": [[1, 1, 1], [0, 1, 1], [1, 1, 1]], "solution": [[1, 2, 3], [0, 1, 2], [1, 2, 3]], "n": 3, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1
],
[
0,
1,
1
],
[
1,
1,
1
]
],
"n": 3,
"solution": [
[
1,
2,
3
],
[
0,
1,
2
],
[
1,
2,
3
]
],
"source_dataset": "binary_matrix",
"source_index": 8
} |
reasoning_gym_binary_matrix_mP86NIqp | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 0 1 1 1 1 1 1
1 1 1 0 0 1 1 1
1 1 0 0 1 1 1 1
1 1 1 1 1 0 1 1
1 1 0 0 1 1 1 1
0 1 1 1 0 0 1 1
1 1 1 1 1 1 1 0
1 1 1 0 0 1 0 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 0 1 1 1 2 3 4\n1 1 1 0 0 1 2 3\n2 1 0 0 1 1 2 3\n2 2 1 1 1 0 1 2\n1 1 0 0 1 1 2 2\n0 1 1 1 0 0 1 1\n1 2 2 1 1 1 1 0\n2 2 1 0 0 1 0 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 0 1 1 1 1 1 1\n1 1 1 0 0 1 1 1\n1 1 0 0 1 1 1 1\n1 1 1 1 1 0 1 1\n1 1 0 0 1 1 1 1\n0 1 1 1 0 0 1 1\n1 1 1 1 1 1 1 0\n1 1 1 0 0 1 0 1\n", "answer": "0 0 1 1 1 2 3 4\n1 1 1 0 0 1 2 3\n2 1 0 0 1 1 2 3\n2 2 1 1 1 0 1 2\n1 1 0 0 1 1 2 2\n0 1 1 1 0 0 1 1\n1 2 2 1 1 1 1 0\n2 2 1 0 0 1 0 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 9, "matrix": [[0, 0, 1, 1, 1, 1, 1, 1], [1, 1, 1, 0, 0, 1, 1, 1], [1, 1, 0, 0, 1, 1, 1, 1], [1, 1, 1, 1, 1, 0, 1, 1], [1, 1, 0, 0, 1, 1, 1, 1], [0, 1, 1, 1, 0, 0, 1, 1], [1, 1, 1, 1, 1, 1, 1, 0], [1, 1, 1, 0, 0, 1, 0, 1]], "solution": [[0, 0, 1, 1, 1, 2, 3, 4], [1, 1, 1, 0, 0, 1, 2, 3], [2, 1, 0, 0, 1, 1, 2, 3], [2, 2, 1, 1, 1, 0, 1, 2], [1, 1, 0, 0, 1, 1, 2, 2], [0, 1, 1, 1, 0, 0, 1, 1], [1, 2, 2, 1, 1, 1, 1, 0], [2, 2, 1, 0, 0, 1, 0, 1]], "n": 8, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
0,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
0,
0,
1,
1,
1
],
[
1,
1,
0,
0,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
0,
1,
1
],
[
1,
1,
0,
0,
1,
1,
1,
1
],
[
0,
1,
1,
1,
0,
0,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
0
],
[
1,
1,
1,
0,
0,
1,
0,
1
]
],
"n": 8,
"solution": [
[
0,
0,
1,
1,
1,
2,
3,
4
],
[
1,
1,
1,
0,
0,
1,
2,
3
],
[
2,
1,
0,
0,
1,
1,
2,
3
],
[
2,
2,
1,
1,
1,
0,
1,
2
],
[
1,
1,
0,
0,
1,
1,
2,
2
],
[
0,
1,
1,
1,
0,
0,
1,
1
],
[
1,
2,
2,
1,
1,
1,
1,
0
],
[
2,
2,
1,
0,
0,
1,
0,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 9
} |
reasoning_gym_binary_matrix_MxqSBu1o | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 0 1 1
1 1 1 1
1 1 1 1
0 1 0 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 0 1 2\n1 1 2 2\n1 2 1 1\n0 1 0 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 0 1 1\n1 1 1 1\n1 1 1 1\n0 1 0 0\n", "answer": "0 0 1 2\n1 1 2 2\n1 2 1 1\n0 1 0 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 10, "matrix": [[0, 0, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1], [0, 1, 0, 0]], "solution": [[0, 0, 1, 2], [1, 1, 2, 2], [1, 2, 1, 1], [0, 1, 0, 0]], "n": 4, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
0,
1,
1
],
[
1,
1,
1,
1
],
[
1,
1,
1,
1
],
[
0,
1,
0,
0
]
],
"n": 4,
"solution": [
[
0,
0,
1,
2
],
[
1,
1,
2,
2
],
[
1,
2,
1,
1
],
[
0,
1,
0,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 10
} |
reasoning_gym_binary_matrix_hyTx6PgZ | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 0 1 0 0 1 1 1
1 0 1 0 0 1 1 1 1 1
0 1 0 1 1 0 1 1 0 0
1 1 0 1 1 1 0 1 1 1
1 1 1 1 1 1 0 1 1 1
1 1 0 1 0 1 1 1 1 1
0 1 1 1 1 1 1 1 1 1
1 1 0 0 1 1 1 1 1 0
1 1 1 1 1 1 1 1 1 1
1 1 1 1 0 0 1 0 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 1 0 1 0 0 1 2 2\n1 0 1 0 0 1 1 2 1 1\n0 1 0 1 1 0 1 1 0 0\n1 1 0 1 2 1 0 1 1 1\n2 2 1 2 1 1 0 1 2 2\n1 1 0 1 0 1 1 2 3 2\n0 1 1 1 1 2 2 3 2 1\n1 1 0 0 1 2 3 2 1 0\n2 2 1 1 1 1 2 1 2 1\n3 3 2 1 0 0 1 0 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 0 1 0 0 1 1 1\n1 0 1 0 0 1 1 1 1 1\n0 1 0 1 1 0 1 1 0 0\n1 1 0 1 1 1 0 1 1 1\n1 1 1 1 1 1 0 1 1 1\n1 1 0 1 0 1 1 1 1 1\n0 1 1 1 1 1 1 1 1 1\n1 1 0 0 1 1 1 1 1 0\n1 1 1 1 1 1 1 1 1 1\n1 1 1 1 0 0 1 0 1 0\n", "answer": "2 1 1 0 1 0 0 1 2 2\n1 0 1 0 0 1 1 2 1 1\n0 1 0 1 1 0 1 1 0 0\n1 1 0 1 2 1 0 1 1 1\n2 2 1 2 1 1 0 1 2 2\n1 1 0 1 0 1 1 2 3 2\n0 1 1 1 1 2 2 3 2 1\n1 1 0 0 1 2 3 2 1 0\n2 2 1 1 1 1 2 1 2 1\n3 3 2 1 0 0 1 0 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 11, "matrix": [[1, 1, 1, 0, 1, 0, 0, 1, 1, 1], [1, 0, 1, 0, 0, 1, 1, 1, 1, 1], [0, 1, 0, 1, 1, 0, 1, 1, 0, 0], [1, 1, 0, 1, 1, 1, 0, 1, 1, 1], [1, 1, 1, 1, 1, 1, 0, 1, 1, 1], [1, 1, 0, 1, 0, 1, 1, 1, 1, 1], [0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 0, 0, 1, 1, 1, 1, 1, 0], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 0, 0, 1, 0, 1, 0]], "solution": [[2, 1, 1, 0, 1, 0, 0, 1, 2, 2], [1, 0, 1, 0, 0, 1, 1, 2, 1, 1], [0, 1, 0, 1, 1, 0, 1, 1, 0, 0], [1, 1, 0, 1, 2, 1, 0, 1, 1, 1], [2, 2, 1, 2, 1, 1, 0, 1, 2, 2], [1, 1, 0, 1, 0, 1, 1, 2, 3, 2], [0, 1, 1, 1, 1, 2, 2, 3, 2, 1], [1, 1, 0, 0, 1, 2, 3, 2, 1, 0], [2, 2, 1, 1, 1, 1, 2, 1, 2, 1], [3, 3, 2, 1, 0, 0, 1, 0, 1, 0]], "n": 10, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
0,
1,
0,
0,
1,
1,
1
],
[
1,
0,
1,
0,
0,
1,
1,
1,
1,
1
],
[
0,
1,
0,
1,
1,
0,
1,
1,
0,
0
],
[
1,
1,
0,
1,
1,
1,
0,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
0,
1,
1,
1
],
[
1,
1,
0,
1,
0,
1,
1,
1,
1,
1
],
[
0,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
0,
0,
1,
1,
1,
1,
1,
0
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
0,
0,
1,
0,
1,
0
]
],
"n": 10,
"solution": [
[
2,
1,
1,
0,
1,
0,
0,
1,
2,
2
],
[
1,
0,
1,
0,
0,
1,
1,
2,
1,
1
],
[
0,
1,
0,
1,
1,
0,
1,
1,
0,
0
],
[
1,
1,
0,
1,
2,
1,
0,
1,
1,
1
],
[
2,
2,
1,
2,
1,
1,
0,
1,
2,
2
],
[
1,
1,
0,
1,
0,
1,
1,
2,
3,
2
],
[
0,
1,
1,
1,
1,
2,
2,
3,
2,
1
],
[
1,
1,
0,
0,
1,
2,
3,
2,
1,
0
],
[
2,
2,
1,
1,
1,
1,
2,
1,
2,
1
],
[
3,
3,
2,
1,
0,
0,
1,
0,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 11
} |
reasoning_gym_binary_matrix_P0jeNNIE | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1
1 0 0
0 0 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 1\n1 0 0\n0 0 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1\n1 0 0\n0 0 1\n", "answer": "2 1 1\n1 0 0\n0 0 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 12, "matrix": [[1, 1, 1], [1, 0, 0], [0, 0, 1]], "solution": [[2, 1, 1], [1, 0, 0], [0, 0, 1]], "n": 3, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1
],
[
1,
0,
0
],
[
0,
0,
1
]
],
"n": 3,
"solution": [
[
2,
1,
1
],
[
1,
0,
0
],
[
0,
0,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 12
} |
reasoning_gym_binary_matrix_x3DV55cU | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0 1 0 1 1 1 1
0 1 1 1 1 1 1 1 1
1 0 0 1 0 1 1 0 1
0 1 1 0 0 0 0 1 1
1 1 0 1 0 1 1 1 1
1 1 1 1 1 1 1 1 1
1 1 1 0 0 1 1 1 1
0 0 1 1 1 1 1 1 1
1 1 1 1 1 0 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 1 0 1 0 1 2 2 3\n0 1 1 2 1 2 2 1 2\n1 0 0 1 0 1 1 0 1\n0 1 1 0 0 0 0 1 2\n1 1 0 1 0 1 1 2 3\n2 2 1 1 1 2 2 3 4\n1 1 1 0 0 1 2 3 4\n0 0 1 1 1 1 2 3 4\n1 1 2 2 1 0 1 2 3", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0 1 0 1 1 1 1\n0 1 1 1 1 1 1 1 1\n1 0 0 1 0 1 1 0 1\n0 1 1 0 0 0 0 1 1\n1 1 0 1 0 1 1 1 1\n1 1 1 1 1 1 1 1 1\n1 1 1 0 0 1 1 1 1\n0 0 1 1 1 1 1 1 1\n1 1 1 1 1 0 1 1 1\n", "answer": "1 1 0 1 0 1 2 2 3\n0 1 1 2 1 2 2 1 2\n1 0 0 1 0 1 1 0 1\n0 1 1 0 0 0 0 1 2\n1 1 0 1 0 1 1 2 3\n2 2 1 1 1 2 2 3 4\n1 1 1 0 0 1 2 3 4\n0 0 1 1 1 1 2 3 4\n1 1 2 2 1 0 1 2 3", "metadata": {"source_dataset": "binary_matrix", "source_index": 13, "matrix": [[1, 1, 0, 1, 0, 1, 1, 1, 1], [0, 1, 1, 1, 1, 1, 1, 1, 1], [1, 0, 0, 1, 0, 1, 1, 0, 1], [0, 1, 1, 0, 0, 0, 0, 1, 1], [1, 1, 0, 1, 0, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 0, 0, 1, 1, 1, 1], [0, 0, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 0, 1, 1, 1]], "solution": [[1, 1, 0, 1, 0, 1, 2, 2, 3], [0, 1, 1, 2, 1, 2, 2, 1, 2], [1, 0, 0, 1, 0, 1, 1, 0, 1], [0, 1, 1, 0, 0, 0, 0, 1, 2], [1, 1, 0, 1, 0, 1, 1, 2, 3], [2, 2, 1, 1, 1, 2, 2, 3, 4], [1, 1, 1, 0, 0, 1, 2, 3, 4], [0, 0, 1, 1, 1, 1, 2, 3, 4], [1, 1, 2, 2, 1, 0, 1, 2, 3]], "n": 9, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0,
1,
0,
1,
1,
1,
1
],
[
0,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
0,
0,
1,
0,
1,
1,
0,
1
],
[
0,
1,
1,
0,
0,
0,
0,
1,
1
],
[
1,
1,
0,
1,
0,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
0,
0,
1,
1,
1,
1
],
[
0,
0,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
0,
1,
1,
1
]
],
"n": 9,
"solution": [
[
1,
1,
0,
1,
0,
1,
2,
2,
3
],
[
0,
1,
1,
2,
1,
2,
2,
1,
2
],
[
1,
0,
0,
1,
0,
1,
1,
0,
1
],
[
0,
1,
1,
0,
0,
0,
0,
1,
2
],
[
1,
1,
0,
1,
0,
1,
1,
2,
3
],
[
2,
2,
1,
1,
1,
2,
2,
3,
4
],
[
1,
1,
1,
0,
0,
1,
2,
3,
4
],
[
0,
0,
1,
1,
1,
1,
2,
3,
4
],
[
1,
1,
2,
2,
1,
0,
1,
2,
3
]
],
"source_dataset": "binary_matrix",
"source_index": 13
} |
reasoning_gym_binary_matrix_kxqZdB0N | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 1 0 1 1
1 1 1 0 0 0 1
1 1 1 1 1 0 1
1 1 0 0 1 1 1
0 1 0 1 1 1 1
1 1 0 0 0 0 0
0 1 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 1 0 1 2\n2 1 1 0 0 0 1\n2 2 1 1 1 0 1\n1 1 0 0 1 1 2\n0 1 0 1 1 1 1\n1 1 0 0 0 0 0\n0 1 1 1 1 1 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 1 0 1 1\n1 1 1 0 0 0 1\n1 1 1 1 1 0 1\n1 1 0 0 1 1 1\n0 1 0 1 1 1 1\n1 1 0 0 0 0 0\n0 1 1 1 1 1 1\n", "answer": "1 0 1 1 0 1 2\n2 1 1 0 0 0 1\n2 2 1 1 1 0 1\n1 1 0 0 1 1 2\n0 1 0 1 1 1 1\n1 1 0 0 0 0 0\n0 1 1 1 1 1 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 14, "matrix": [[1, 0, 1, 1, 0, 1, 1], [1, 1, 1, 0, 0, 0, 1], [1, 1, 1, 1, 1, 0, 1], [1, 1, 0, 0, 1, 1, 1], [0, 1, 0, 1, 1, 1, 1], [1, 1, 0, 0, 0, 0, 0], [0, 1, 1, 1, 1, 1, 1]], "solution": [[1, 0, 1, 1, 0, 1, 2], [2, 1, 1, 0, 0, 0, 1], [2, 2, 1, 1, 1, 0, 1], [1, 1, 0, 0, 1, 1, 2], [0, 1, 0, 1, 1, 1, 1], [1, 1, 0, 0, 0, 0, 0], [0, 1, 1, 1, 1, 1, 1]], "n": 7, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
1,
0,
1,
1
],
[
1,
1,
1,
0,
0,
0,
1
],
[
1,
1,
1,
1,
1,
0,
1
],
[
1,
1,
0,
0,
1,
1,
1
],
[
0,
1,
0,
1,
1,
1,
1
],
[
1,
1,
0,
0,
0,
0,
0
],
[
0,
1,
1,
1,
1,
1,
1
]
],
"n": 7,
"solution": [
[
1,
0,
1,
1,
0,
1,
2
],
[
2,
1,
1,
0,
0,
0,
1
],
[
2,
2,
1,
1,
1,
0,
1
],
[
1,
1,
0,
0,
1,
1,
2
],
[
0,
1,
0,
1,
1,
1,
1
],
[
1,
1,
0,
0,
0,
0,
0
],
[
0,
1,
1,
1,
1,
1,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 14
} |
reasoning_gym_binary_matrix_gPhxebhM | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0 1 0 1
1 1 1 1 1 0
1 1 1 1 1 1
1 1 1 0 1 1
1 1 1 1 1 1
1 0 1 1 0 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 0 1 0 1\n3 2 1 2 1 0\n4 3 2 1 2 1\n3 2 1 0 1 2\n2 1 2 1 1 2\n1 0 1 1 0 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0 1 0 1\n1 1 1 1 1 0\n1 1 1 1 1 1\n1 1 1 0 1 1\n1 1 1 1 1 1\n1 0 1 1 0 1\n", "answer": "2 1 0 1 0 1\n3 2 1 2 1 0\n4 3 2 1 2 1\n3 2 1 0 1 2\n2 1 2 1 1 2\n1 0 1 1 0 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 15, "matrix": [[1, 1, 0, 1, 0, 1], [1, 1, 1, 1, 1, 0], [1, 1, 1, 1, 1, 1], [1, 1, 1, 0, 1, 1], [1, 1, 1, 1, 1, 1], [1, 0, 1, 1, 0, 1]], "solution": [[2, 1, 0, 1, 0, 1], [3, 2, 1, 2, 1, 0], [4, 3, 2, 1, 2, 1], [3, 2, 1, 0, 1, 2], [2, 1, 2, 1, 1, 2], [1, 0, 1, 1, 0, 1]], "n": 6, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0,
1,
0,
1
],
[
1,
1,
1,
1,
1,
0
],
[
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
0,
1,
1
],
[
1,
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
0,
1
]
],
"n": 6,
"solution": [
[
2,
1,
0,
1,
0,
1
],
[
3,
2,
1,
2,
1,
0
],
[
4,
3,
2,
1,
2,
1
],
[
3,
2,
1,
0,
1,
2
],
[
2,
1,
2,
1,
1,
2
],
[
1,
0,
1,
1,
0,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 15
} |
reasoning_gym_binary_matrix_lpPO2kLw | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1
1 0 1
1 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 2\n1 0 1\n2 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1\n1 0 1\n1 1 0\n", "answer": "2 1 2\n1 0 1\n2 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 16, "matrix": [[1, 1, 1], [1, 0, 1], [1, 1, 0]], "solution": [[2, 1, 2], [1, 0, 1], [2, 1, 0]], "n": 3, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1
],
[
1,
0,
1
],
[
1,
1,
0
]
],
"n": 3,
"solution": [
[
2,
1,
2
],
[
1,
0,
1
],
[
2,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 16
} |
reasoning_gym_binary_matrix_WayjBtfc | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 0 1 0 0 1 1
1 1 1 1 1 0 1 1 0
0 0 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1
0 1 0 0 0 1 0 0 0
1 1 1 1 1 1 0 1 1
1 0 0 1 0 1 1 1 1
1 1 0 1 1 0 0 1 1
1 1 1 0 1 0 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 0 1 0 0 1 1\n1 1 2 1 1 0 1 1 0\n0 0 1 2 2 1 2 2 1\n1 1 1 1 1 2 1 1 1\n0 1 0 0 0 1 0 0 0\n1 1 1 1 1 1 0 1 1\n1 0 0 1 0 1 1 2 2\n2 1 0 1 1 0 0 1 2\n3 2 1 0 1 0 1 2 3", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 0 1 0 0 1 1\n1 1 1 1 1 0 1 1 0\n0 0 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 1\n0 1 0 0 0 1 0 0 0\n1 1 1 1 1 1 0 1 1\n1 0 0 1 0 1 1 1 1\n1 1 0 1 1 0 0 1 1\n1 1 1 0 1 0 1 1 1\n", "answer": "1 0 1 0 1 0 0 1 1\n1 1 2 1 1 0 1 1 0\n0 0 1 2 2 1 2 2 1\n1 1 1 1 1 2 1 1 1\n0 1 0 0 0 1 0 0 0\n1 1 1 1 1 1 0 1 1\n1 0 0 1 0 1 1 2 2\n2 1 0 1 1 0 0 1 2\n3 2 1 0 1 0 1 2 3", "metadata": {"source_dataset": "binary_matrix", "source_index": 17, "matrix": [[1, 0, 1, 0, 1, 0, 0, 1, 1], [1, 1, 1, 1, 1, 0, 1, 1, 0], [0, 0, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 1, 0, 0, 0, 1, 0, 0, 0], [1, 1, 1, 1, 1, 1, 0, 1, 1], [1, 0, 0, 1, 0, 1, 1, 1, 1], [1, 1, 0, 1, 1, 0, 0, 1, 1], [1, 1, 1, 0, 1, 0, 1, 1, 1]], "solution": [[1, 0, 1, 0, 1, 0, 0, 1, 1], [1, 1, 2, 1, 1, 0, 1, 1, 0], [0, 0, 1, 2, 2, 1, 2, 2, 1], [1, 1, 1, 1, 1, 2, 1, 1, 1], [0, 1, 0, 0, 0, 1, 0, 0, 0], [1, 1, 1, 1, 1, 1, 0, 1, 1], [1, 0, 0, 1, 0, 1, 1, 2, 2], [2, 1, 0, 1, 1, 0, 0, 1, 2], [3, 2, 1, 0, 1, 0, 1, 2, 3]], "n": 9, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
0,
1,
0,
0,
1,
1
],
[
1,
1,
1,
1,
1,
0,
1,
1,
0
],
[
0,
0,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
0,
1,
0,
0,
0,
1,
0,
0,
0
],
[
1,
1,
1,
1,
1,
1,
0,
1,
1
],
[
1,
0,
0,
1,
0,
1,
1,
1,
1
],
[
1,
1,
0,
1,
1,
0,
0,
1,
1
],
[
1,
1,
1,
0,
1,
0,
1,
1,
1
]
],
"n": 9,
"solution": [
[
1,
0,
1,
0,
1,
0,
0,
1,
1
],
[
1,
1,
2,
1,
1,
0,
1,
1,
0
],
[
0,
0,
1,
2,
2,
1,
2,
2,
1
],
[
1,
1,
1,
1,
1,
2,
1,
1,
1
],
[
0,
1,
0,
0,
0,
1,
0,
0,
0
],
[
1,
1,
1,
1,
1,
1,
0,
1,
1
],
[
1,
0,
0,
1,
0,
1,
1,
2,
2
],
[
2,
1,
0,
1,
1,
0,
0,
1,
2
],
[
3,
2,
1,
0,
1,
0,
1,
2,
3
]
],
"source_dataset": "binary_matrix",
"source_index": 17
} |
reasoning_gym_binary_matrix_XI3oYvXV | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0 1 1 1 0 1
1 0 1 1 1 1 1 1
1 0 1 1 1 1 1 1
1 1 1 1 0 0 1 1
1 1 1 0 1 1 1 1
1 0 1 0 1 1 0 1
1 1 1 1 1 1 0 0
1 1 1 0 1 0 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 0 1 2 1 0 1\n1 0 1 2 2 2 1 2\n1 0 1 2 1 1 2 3\n2 1 2 1 0 0 1 2\n2 1 1 0 1 1 1 2\n1 0 1 0 1 1 0 1\n2 1 2 1 2 1 0 0\n3 2 1 0 1 0 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0 1 1 1 0 1\n1 0 1 1 1 1 1 1\n1 0 1 1 1 1 1 1\n1 1 1 1 0 0 1 1\n1 1 1 0 1 1 1 1\n1 0 1 0 1 1 0 1\n1 1 1 1 1 1 0 0\n1 1 1 0 1 0 1 0\n", "answer": "2 1 0 1 2 1 0 1\n1 0 1 2 2 2 1 2\n1 0 1 2 1 1 2 3\n2 1 2 1 0 0 1 2\n2 1 1 0 1 1 1 2\n1 0 1 0 1 1 0 1\n2 1 2 1 2 1 0 0\n3 2 1 0 1 0 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 18, "matrix": [[1, 1, 0, 1, 1, 1, 0, 1], [1, 0, 1, 1, 1, 1, 1, 1], [1, 0, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 0, 0, 1, 1], [1, 1, 1, 0, 1, 1, 1, 1], [1, 0, 1, 0, 1, 1, 0, 1], [1, 1, 1, 1, 1, 1, 0, 0], [1, 1, 1, 0, 1, 0, 1, 0]], "solution": [[2, 1, 0, 1, 2, 1, 0, 1], [1, 0, 1, 2, 2, 2, 1, 2], [1, 0, 1, 2, 1, 1, 2, 3], [2, 1, 2, 1, 0, 0, 1, 2], [2, 1, 1, 0, 1, 1, 1, 2], [1, 0, 1, 0, 1, 1, 0, 1], [2, 1, 2, 1, 2, 1, 0, 0], [3, 2, 1, 0, 1, 0, 1, 0]], "n": 8, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0,
1,
1,
1,
0,
1
],
[
1,
0,
1,
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
0,
0,
1,
1
],
[
1,
1,
1,
0,
1,
1,
1,
1
],
[
1,
0,
1,
0,
1,
1,
0,
1
],
[
1,
1,
1,
1,
1,
1,
0,
0
],
[
1,
1,
1,
0,
1,
0,
1,
0
]
],
"n": 8,
"solution": [
[
2,
1,
0,
1,
2,
1,
0,
1
],
[
1,
0,
1,
2,
2,
2,
1,
2
],
[
1,
0,
1,
2,
1,
1,
2,
3
],
[
2,
1,
2,
1,
0,
0,
1,
2
],
[
2,
1,
1,
0,
1,
1,
1,
2
],
[
1,
0,
1,
0,
1,
1,
0,
1
],
[
2,
1,
2,
1,
2,
1,
0,
0
],
[
3,
2,
1,
0,
1,
0,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 18
} |
reasoning_gym_binary_matrix_zMhRe6YO | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 1 0 1 1
0 1 1 1 1 1 0
0 1 0 1 1 1 0
0 1 1 0 0 1 1
0 1 0 1 1 1 1
1 1 1 1 1 1 1
1 0 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 2 2 1 0 1 1\n0 1 1 2 1 1 0\n0 1 0 1 1 1 0\n0 1 1 0 0 1 1\n0 1 0 1 1 2 2\n1 1 1 2 2 3 3\n1 0 1 2 3 4 4", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 1 0 1 1\n0 1 1 1 1 1 0\n0 1 0 1 1 1 0\n0 1 1 0 0 1 1\n0 1 0 1 1 1 1\n1 1 1 1 1 1 1\n1 0 1 1 1 1 1\n", "answer": "1 2 2 1 0 1 1\n0 1 1 2 1 1 0\n0 1 0 1 1 1 0\n0 1 1 0 0 1 1\n0 1 0 1 1 2 2\n1 1 1 2 2 3 3\n1 0 1 2 3 4 4", "metadata": {"source_dataset": "binary_matrix", "source_index": 19, "matrix": [[1, 1, 1, 1, 0, 1, 1], [0, 1, 1, 1, 1, 1, 0], [0, 1, 0, 1, 1, 1, 0], [0, 1, 1, 0, 0, 1, 1], [0, 1, 0, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1], [1, 0, 1, 1, 1, 1, 1]], "solution": [[1, 2, 2, 1, 0, 1, 1], [0, 1, 1, 2, 1, 1, 0], [0, 1, 0, 1, 1, 1, 0], [0, 1, 1, 0, 0, 1, 1], [0, 1, 0, 1, 1, 2, 2], [1, 1, 1, 2, 2, 3, 3], [1, 0, 1, 2, 3, 4, 4]], "n": 7, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
1,
0,
1,
1
],
[
0,
1,
1,
1,
1,
1,
0
],
[
0,
1,
0,
1,
1,
1,
0
],
[
0,
1,
1,
0,
0,
1,
1
],
[
0,
1,
0,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
1,
1,
1
]
],
"n": 7,
"solution": [
[
1,
2,
2,
1,
0,
1,
1
],
[
0,
1,
1,
2,
1,
1,
0
],
[
0,
1,
0,
1,
1,
1,
0
],
[
0,
1,
1,
0,
0,
1,
1
],
[
0,
1,
0,
1,
1,
2,
2
],
[
1,
1,
1,
2,
2,
3,
3
],
[
1,
0,
1,
2,
3,
4,
4
]
],
"source_dataset": "binary_matrix",
"source_index": 19
} |
reasoning_gym_binary_matrix_DIy6lAVd | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 0 0 1 1 1 1
1 1 1 1 1 0 1 1
1 1 0 0 1 0 0 1
1 1 1 1 1 0 1 1
1 1 1 1 1 1 0 0
1 1 1 1 0 1 1 0
1 1 0 1 0 1 1 1
1 1 0 1 1 1 0 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 0 0 1 1 2 3\n2 1 1 1 1 0 1 2\n2 1 0 0 1 0 0 1\n3 2 1 1 1 0 1 1\n4 3 2 2 1 1 0 0\n3 2 1 1 0 1 1 0\n2 1 0 1 0 1 1 1\n2 1 0 1 1 1 0 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 0 0 1 1 1 1\n1 1 1 1 1 0 1 1\n1 1 0 0 1 0 0 1\n1 1 1 1 1 0 1 1\n1 1 1 1 1 1 0 0\n1 1 1 1 0 1 1 0\n1 1 0 1 0 1 1 1\n1 1 0 1 1 1 0 1\n", "answer": "1 0 0 0 1 1 2 3\n2 1 1 1 1 0 1 2\n2 1 0 0 1 0 0 1\n3 2 1 1 1 0 1 1\n4 3 2 2 1 1 0 0\n3 2 1 1 0 1 1 0\n2 1 0 1 0 1 1 1\n2 1 0 1 1 1 0 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 20, "matrix": [[1, 0, 0, 0, 1, 1, 1, 1], [1, 1, 1, 1, 1, 0, 1, 1], [1, 1, 0, 0, 1, 0, 0, 1], [1, 1, 1, 1, 1, 0, 1, 1], [1, 1, 1, 1, 1, 1, 0, 0], [1, 1, 1, 1, 0, 1, 1, 0], [1, 1, 0, 1, 0, 1, 1, 1], [1, 1, 0, 1, 1, 1, 0, 1]], "solution": [[1, 0, 0, 0, 1, 1, 2, 3], [2, 1, 1, 1, 1, 0, 1, 2], [2, 1, 0, 0, 1, 0, 0, 1], [3, 2, 1, 1, 1, 0, 1, 1], [4, 3, 2, 2, 1, 1, 0, 0], [3, 2, 1, 1, 0, 1, 1, 0], [2, 1, 0, 1, 0, 1, 1, 1], [2, 1, 0, 1, 1, 1, 0, 1]], "n": 8, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
0,
0,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
0,
1,
1
],
[
1,
1,
0,
0,
1,
0,
0,
1
],
[
1,
1,
1,
1,
1,
0,
1,
1
],
[
1,
1,
1,
1,
1,
1,
0,
0
],
[
1,
1,
1,
1,
0,
1,
1,
0
],
[
1,
1,
0,
1,
0,
1,
1,
1
],
[
1,
1,
0,
1,
1,
1,
0,
1
]
],
"n": 8,
"solution": [
[
1,
0,
0,
0,
1,
1,
2,
3
],
[
2,
1,
1,
1,
1,
0,
1,
2
],
[
2,
1,
0,
0,
1,
0,
0,
1
],
[
3,
2,
1,
1,
1,
0,
1,
1
],
[
4,
3,
2,
2,
1,
1,
0,
0
],
[
3,
2,
1,
1,
0,
1,
1,
0
],
[
2,
1,
0,
1,
0,
1,
1,
1
],
[
2,
1,
0,
1,
1,
1,
0,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 20
} |
reasoning_gym_binary_matrix_cDcdcHuh | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 1 0 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
0 1 0 1 1 0 1 1 0 1
1 1 1 1 1 1 1 1 1 0
1 1 1 0 1 1 1 1 1 1
0 1 1 1 1 1 1 1 1 1
1 1 1 1 0 1 1 0 1 0
1 0 0 0 1 1 0 1 0 1
1 1 1 1 0 0 1 1 0 0
0 0 1 1 0 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 1 0 1 2 3 2 3\n1 1 1 2 1 1 2 2 1 2\n0 1 0 1 1 0 1 1 0 1\n1 2 1 1 2 1 2 2 1 0\n1 2 1 0 1 2 3 2 2 1\n0 1 2 1 1 2 2 1 2 1\n1 1 1 1 0 1 1 0 1 0\n1 0 0 0 1 1 0 1 0 1\n1 1 1 1 0 0 1 1 0 0\n0 0 1 1 0 1 2 2 1 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 1 0 1 1 1 1 1\n1 1 1 1 1 1 1 1 1 1\n0 1 0 1 1 0 1 1 0 1\n1 1 1 1 1 1 1 1 1 0\n1 1 1 0 1 1 1 1 1 1\n0 1 1 1 1 1 1 1 1 1\n1 1 1 1 0 1 1 0 1 0\n1 0 0 0 1 1 0 1 0 1\n1 1 1 1 0 0 1 1 0 0\n0 0 1 1 0 1 1 1 1 1\n", "answer": "1 0 1 1 0 1 2 3 2 3\n1 1 1 2 1 1 2 2 1 2\n0 1 0 1 1 0 1 1 0 1\n1 2 1 1 2 1 2 2 1 0\n1 2 1 0 1 2 3 2 2 1\n0 1 2 1 1 2 2 1 2 1\n1 1 1 1 0 1 1 0 1 0\n1 0 0 0 1 1 0 1 0 1\n1 1 1 1 0 0 1 1 0 0\n0 0 1 1 0 1 2 2 1 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 21, "matrix": [[1, 0, 1, 1, 0, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 1, 0, 1, 1, 0, 1, 1, 0, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 0], [1, 1, 1, 0, 1, 1, 1, 1, 1, 1], [0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 0, 1, 1, 0, 1, 0], [1, 0, 0, 0, 1, 1, 0, 1, 0, 1], [1, 1, 1, 1, 0, 0, 1, 1, 0, 0], [0, 0, 1, 1, 0, 1, 1, 1, 1, 1]], "solution": [[1, 0, 1, 1, 0, 1, 2, 3, 2, 3], [1, 1, 1, 2, 1, 1, 2, 2, 1, 2], [0, 1, 0, 1, 1, 0, 1, 1, 0, 1], [1, 2, 1, 1, 2, 1, 2, 2, 1, 0], [1, 2, 1, 0, 1, 2, 3, 2, 2, 1], [0, 1, 2, 1, 1, 2, 2, 1, 2, 1], [1, 1, 1, 1, 0, 1, 1, 0, 1, 0], [1, 0, 0, 0, 1, 1, 0, 1, 0, 1], [1, 1, 1, 1, 0, 0, 1, 1, 0, 0], [0, 0, 1, 1, 0, 1, 2, 2, 1, 1]], "n": 10, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
1,
0,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
0,
1,
0,
1,
1,
0,
1,
1,
0,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1,
0
],
[
1,
1,
1,
0,
1,
1,
1,
1,
1,
1
],
[
0,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
0,
1,
1,
0,
1,
0
],
[
1,
0,
0,
0,
1,
1,
0,
1,
0,
1
],
[
1,
1,
1,
1,
0,
0,
1,
1,
0,
0
],
[
0,
0,
1,
1,
0,
1,
1,
1,
1,
1
]
],
"n": 10,
"solution": [
[
1,
0,
1,
1,
0,
1,
2,
3,
2,
3
],
[
1,
1,
1,
2,
1,
1,
2,
2,
1,
2
],
[
0,
1,
0,
1,
1,
0,
1,
1,
0,
1
],
[
1,
2,
1,
1,
2,
1,
2,
2,
1,
0
],
[
1,
2,
1,
0,
1,
2,
3,
2,
2,
1
],
[
0,
1,
2,
1,
1,
2,
2,
1,
2,
1
],
[
1,
1,
1,
1,
0,
1,
1,
0,
1,
0
],
[
1,
0,
0,
0,
1,
1,
0,
1,
0,
1
],
[
1,
1,
1,
1,
0,
0,
1,
1,
0,
0
],
[
0,
0,
1,
1,
0,
1,
2,
2,
1,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 21
} |
reasoning_gym_binary_matrix_9MzdYXBQ | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 1 1
1 1 0 0 1
0 0 1 1 1
1 1 1 0 0
1 0 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 1 2\n1 1 0 0 1\n0 0 1 1 1\n1 1 1 0 0\n1 0 1 1 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 1 1\n1 1 0 0 1\n0 0 1 1 1\n1 1 1 0 0\n1 0 1 1 1\n", "answer": "1 0 1 1 2\n1 1 0 0 1\n0 0 1 1 1\n1 1 1 0 0\n1 0 1 1 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 22, "matrix": [[1, 0, 1, 1, 1], [1, 1, 0, 0, 1], [0, 0, 1, 1, 1], [1, 1, 1, 0, 0], [1, 0, 1, 1, 1]], "solution": [[1, 0, 1, 1, 2], [1, 1, 0, 0, 1], [0, 0, 1, 1, 1], [1, 1, 1, 0, 0], [1, 0, 1, 1, 1]], "n": 5, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
1,
1
],
[
1,
1,
0,
0,
1
],
[
0,
0,
1,
1,
1
],
[
1,
1,
1,
0,
0
],
[
1,
0,
1,
1,
1
]
],
"n": 5,
"solution": [
[
1,
0,
1,
1,
2
],
[
1,
1,
0,
0,
1
],
[
0,
0,
1,
1,
1
],
[
1,
1,
1,
0,
0
],
[
1,
0,
1,
1,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 22
} |
reasoning_gym_binary_matrix_ND6VXP7t | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0 1 0 0 1 0
1 1 1 1 1 1 0 0
1 1 1 0 1 1 1 1
0 1 1 1 1 1 1 1
1 1 1 1 0 1 1 1
0 1 1 1 1 1 0 1
0 1 1 1 1 1 0 0
1 1 1 1 1 0 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 0 1 0 0 1 0\n2 2 1 1 1 1 0 0\n1 2 1 0 1 2 1 1\n0 1 2 1 1 2 2 2\n1 2 2 1 0 1 1 2\n0 1 2 2 1 1 0 1\n0 1 2 3 2 1 0 0\n1 2 3 2 1 0 1 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0 1 0 0 1 0\n1 1 1 1 1 1 0 0\n1 1 1 0 1 1 1 1\n0 1 1 1 1 1 1 1\n1 1 1 1 0 1 1 1\n0 1 1 1 1 1 0 1\n0 1 1 1 1 1 0 0\n1 1 1 1 1 0 1 1\n", "answer": "2 1 0 1 0 0 1 0\n2 2 1 1 1 1 0 0\n1 2 1 0 1 2 1 1\n0 1 2 1 1 2 2 2\n1 2 2 1 0 1 1 2\n0 1 2 2 1 1 0 1\n0 1 2 3 2 1 0 0\n1 2 3 2 1 0 1 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 23, "matrix": [[1, 1, 0, 1, 0, 0, 1, 0], [1, 1, 1, 1, 1, 1, 0, 0], [1, 1, 1, 0, 1, 1, 1, 1], [0, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 0, 1, 1, 1], [0, 1, 1, 1, 1, 1, 0, 1], [0, 1, 1, 1, 1, 1, 0, 0], [1, 1, 1, 1, 1, 0, 1, 1]], "solution": [[2, 1, 0, 1, 0, 0, 1, 0], [2, 2, 1, 1, 1, 1, 0, 0], [1, 2, 1, 0, 1, 2, 1, 1], [0, 1, 2, 1, 1, 2, 2, 2], [1, 2, 2, 1, 0, 1, 1, 2], [0, 1, 2, 2, 1, 1, 0, 1], [0, 1, 2, 3, 2, 1, 0, 0], [1, 2, 3, 2, 1, 0, 1, 1]], "n": 8, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0,
1,
0,
0,
1,
0
],
[
1,
1,
1,
1,
1,
1,
0,
0
],
[
1,
1,
1,
0,
1,
1,
1,
1
],
[
0,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
0,
1,
1,
1
],
[
0,
1,
1,
1,
1,
1,
0,
1
],
[
0,
1,
1,
1,
1,
1,
0,
0
],
[
1,
1,
1,
1,
1,
0,
1,
1
]
],
"n": 8,
"solution": [
[
2,
1,
0,
1,
0,
0,
1,
0
],
[
2,
2,
1,
1,
1,
1,
0,
0
],
[
1,
2,
1,
0,
1,
2,
1,
1
],
[
0,
1,
2,
1,
1,
2,
2,
2
],
[
1,
2,
2,
1,
0,
1,
1,
2
],
[
0,
1,
2,
2,
1,
1,
0,
1
],
[
0,
1,
2,
3,
2,
1,
0,
0
],
[
1,
2,
3,
2,
1,
0,
1,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 23
} |
reasoning_gym_binary_matrix_GVIehrB7 | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 1 1
1 1 1 1
0 1 1 1
1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 2 3\n1 2 3 4\n0 1 2 3\n1 2 3 4", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 1 1\n1 1 1 1\n0 1 1 1\n1 1 1 1\n", "answer": "0 1 2 3\n1 2 3 4\n0 1 2 3\n1 2 3 4", "metadata": {"source_dataset": "binary_matrix", "source_index": 24, "matrix": [[0, 1, 1, 1], [1, 1, 1, 1], [0, 1, 1, 1], [1, 1, 1, 1]], "solution": [[0, 1, 2, 3], [1, 2, 3, 4], [0, 1, 2, 3], [1, 2, 3, 4]], "n": 4, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
1,
1
],
[
1,
1,
1,
1
],
[
0,
1,
1,
1
],
[
1,
1,
1,
1
]
],
"n": 4,
"solution": [
[
0,
1,
2,
3
],
[
1,
2,
3,
4
],
[
0,
1,
2,
3
],
[
1,
2,
3,
4
]
],
"source_dataset": "binary_matrix",
"source_index": 24
} |
reasoning_gym_binary_matrix_mHZieiOV | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0 1 1 1 1 1
1 1 1 0 0 1 1 1
1 0 1 1 1 1 1 1
1 1 1 1 1 1 1 1
0 1 0 1 1 1 1 0
1 1 1 1 0 1 1 0
0 1 0 1 0 1 1 1
1 0 0 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 0 1 1 2 3 4\n2 1 1 0 0 1 2 3\n1 0 1 1 1 2 3 2\n1 1 1 2 2 3 2 1\n0 1 0 1 1 2 1 0\n1 2 1 1 0 1 1 0\n0 1 0 1 0 1 2 1\n1 0 0 1 1 2 3 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0 1 1 1 1 1\n1 1 1 0 0 1 1 1\n1 0 1 1 1 1 1 1\n1 1 1 1 1 1 1 1\n0 1 0 1 1 1 1 0\n1 1 1 1 0 1 1 0\n0 1 0 1 0 1 1 1\n1 0 0 1 1 1 1 1\n", "answer": "2 1 0 1 1 2 3 4\n2 1 1 0 0 1 2 3\n1 0 1 1 1 2 3 2\n1 1 1 2 2 3 2 1\n0 1 0 1 1 2 1 0\n1 2 1 1 0 1 1 0\n0 1 0 1 0 1 2 1\n1 0 0 1 1 2 3 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 25, "matrix": [[1, 1, 0, 1, 1, 1, 1, 1], [1, 1, 1, 0, 0, 1, 1, 1], [1, 0, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1], [0, 1, 0, 1, 1, 1, 1, 0], [1, 1, 1, 1, 0, 1, 1, 0], [0, 1, 0, 1, 0, 1, 1, 1], [1, 0, 0, 1, 1, 1, 1, 1]], "solution": [[2, 1, 0, 1, 1, 2, 3, 4], [2, 1, 1, 0, 0, 1, 2, 3], [1, 0, 1, 1, 1, 2, 3, 2], [1, 1, 1, 2, 2, 3, 2, 1], [0, 1, 0, 1, 1, 2, 1, 0], [1, 2, 1, 1, 0, 1, 1, 0], [0, 1, 0, 1, 0, 1, 2, 1], [1, 0, 0, 1, 1, 2, 3, 2]], "n": 8, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0,
1,
1,
1,
1,
1
],
[
1,
1,
1,
0,
0,
1,
1,
1
],
[
1,
0,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1
],
[
0,
1,
0,
1,
1,
1,
1,
0
],
[
1,
1,
1,
1,
0,
1,
1,
0
],
[
0,
1,
0,
1,
0,
1,
1,
1
],
[
1,
0,
0,
1,
1,
1,
1,
1
]
],
"n": 8,
"solution": [
[
2,
1,
0,
1,
1,
2,
3,
4
],
[
2,
1,
1,
0,
0,
1,
2,
3
],
[
1,
0,
1,
1,
1,
2,
3,
2
],
[
1,
1,
1,
2,
2,
3,
2,
1
],
[
0,
1,
0,
1,
1,
2,
1,
0
],
[
1,
2,
1,
1,
0,
1,
1,
0
],
[
0,
1,
0,
1,
0,
1,
2,
1
],
[
1,
0,
0,
1,
1,
2,
3,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 25
} |
reasoning_gym_binary_matrix_Ehlhf53J | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 0 1
1 1 1 0
1 1 1 0
1 0 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 0 1\n2 1 1 0\n2 1 1 0\n1 0 1 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 0 1\n1 1 1 0\n1 1 1 0\n1 0 1 1\n", "answer": "1 0 0 1\n2 1 1 0\n2 1 1 0\n1 0 1 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 26, "matrix": [[1, 0, 0, 1], [1, 1, 1, 0], [1, 1, 1, 0], [1, 0, 1, 1]], "solution": [[1, 0, 0, 1], [2, 1, 1, 0], [2, 1, 1, 0], [1, 0, 1, 1]], "n": 4, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
0,
1
],
[
1,
1,
1,
0
],
[
1,
1,
1,
0
],
[
1,
0,
1,
1
]
],
"n": 4,
"solution": [
[
1,
0,
0,
1
],
[
2,
1,
1,
0
],
[
2,
1,
1,
0
],
[
1,
0,
1,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 26
} |
reasoning_gym_binary_matrix_Ha9kh2d8 | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 1 1 1 1 1
1 0 0 0 1 0 1 1
1 1 1 1 1 1 1 1
1 0 1 0 1 1 1 1
0 1 1 0 1 1 0 1
1 1 0 1 1 1 1 1
0 1 1 0 1 0 1 0
1 1 1 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 1 2 1 2 3\n1 0 0 0 1 0 1 2\n2 1 1 1 2 1 2 3\n1 0 1 0 1 2 1 2\n0 1 1 0 1 1 0 1\n1 1 0 1 2 1 1 1\n0 1 1 0 1 0 1 0\n1 2 2 1 2 1 2 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 1 1 1 1 1\n1 0 0 0 1 0 1 1\n1 1 1 1 1 1 1 1\n1 0 1 0 1 1 1 1\n0 1 1 0 1 1 0 1\n1 1 0 1 1 1 1 1\n0 1 1 0 1 0 1 0\n1 1 1 1 1 1 1 1\n", "answer": "1 0 1 1 2 1 2 3\n1 0 0 0 1 0 1 2\n2 1 1 1 2 1 2 3\n1 0 1 0 1 2 1 2\n0 1 1 0 1 1 0 1\n1 1 0 1 2 1 1 1\n0 1 1 0 1 0 1 0\n1 2 2 1 2 1 2 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 27, "matrix": [[1, 0, 1, 1, 1, 1, 1, 1], [1, 0, 0, 0, 1, 0, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1], [1, 0, 1, 0, 1, 1, 1, 1], [0, 1, 1, 0, 1, 1, 0, 1], [1, 1, 0, 1, 1, 1, 1, 1], [0, 1, 1, 0, 1, 0, 1, 0], [1, 1, 1, 1, 1, 1, 1, 1]], "solution": [[1, 0, 1, 1, 2, 1, 2, 3], [1, 0, 0, 0, 1, 0, 1, 2], [2, 1, 1, 1, 2, 1, 2, 3], [1, 0, 1, 0, 1, 2, 1, 2], [0, 1, 1, 0, 1, 1, 0, 1], [1, 1, 0, 1, 2, 1, 1, 1], [0, 1, 1, 0, 1, 0, 1, 0], [1, 2, 2, 1, 2, 1, 2, 1]], "n": 8, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
1,
1,
1,
1,
1
],
[
1,
0,
0,
0,
1,
0,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
0,
1,
0,
1,
1,
1,
1
],
[
0,
1,
1,
0,
1,
1,
0,
1
],
[
1,
1,
0,
1,
1,
1,
1,
1
],
[
0,
1,
1,
0,
1,
0,
1,
0
],
[
1,
1,
1,
1,
1,
1,
1,
1
]
],
"n": 8,
"solution": [
[
1,
0,
1,
1,
2,
1,
2,
3
],
[
1,
0,
0,
0,
1,
0,
1,
2
],
[
2,
1,
1,
1,
2,
1,
2,
3
],
[
1,
0,
1,
0,
1,
2,
1,
2
],
[
0,
1,
1,
0,
1,
1,
0,
1
],
[
1,
1,
0,
1,
2,
1,
1,
1
],
[
0,
1,
1,
0,
1,
0,
1,
0
],
[
1,
2,
2,
1,
2,
1,
2,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 27
} |
reasoning_gym_binary_matrix_R2aGEbV8 | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1
1 0 0
1 0 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1\n1 0 0\n1 0 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1\n1 0 0\n1 0 1\n", "answer": "1 0 1\n1 0 0\n1 0 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 28, "matrix": [[1, 0, 1], [1, 0, 0], [1, 0, 1]], "solution": [[1, 0, 1], [1, 0, 0], [1, 0, 1]], "n": 3, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1
],
[
1,
0,
0
],
[
1,
0,
1
]
],
"n": 3,
"solution": [
[
1,
0,
1
],
[
1,
0,
0
],
[
1,
0,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 28
} |
reasoning_gym_binary_matrix_aJesRl4B | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 0 1 1
1 1 0 0 0 0
1 1 1 1 0 1
1 0 1 0 1 1
1 0 1 1 1 1
1 1 1 1 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 0 1 1\n2 1 0 0 0 0\n2 1 1 1 0 1\n1 0 1 0 1 2\n1 0 1 1 2 1\n2 1 2 2 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 0 1 1\n1 1 0 0 0 0\n1 1 1 1 0 1\n1 0 1 0 1 1\n1 0 1 1 1 1\n1 1 1 1 1 0\n", "answer": "1 0 1 0 1 1\n2 1 0 0 0 0\n2 1 1 1 0 1\n1 0 1 0 1 2\n1 0 1 1 2 1\n2 1 2 2 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 29, "matrix": [[1, 0, 1, 0, 1, 1], [1, 1, 0, 0, 0, 0], [1, 1, 1, 1, 0, 1], [1, 0, 1, 0, 1, 1], [1, 0, 1, 1, 1, 1], [1, 1, 1, 1, 1, 0]], "solution": [[1, 0, 1, 0, 1, 1], [2, 1, 0, 0, 0, 0], [2, 1, 1, 1, 0, 1], [1, 0, 1, 0, 1, 2], [1, 0, 1, 1, 2, 1], [2, 1, 2, 2, 1, 0]], "n": 6, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
0,
1,
1
],
[
1,
1,
0,
0,
0,
0
],
[
1,
1,
1,
1,
0,
1
],
[
1,
0,
1,
0,
1,
1
],
[
1,
0,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
0
]
],
"n": 6,
"solution": [
[
1,
0,
1,
0,
1,
1
],
[
2,
1,
0,
0,
0,
0
],
[
2,
1,
1,
1,
0,
1
],
[
1,
0,
1,
0,
1,
2
],
[
1,
0,
1,
1,
2,
1
],
[
2,
1,
2,
2,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 29
} |
reasoning_gym_binary_matrix_bYn8VtSh | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 1 1
0 1 0 1
1 0 1 1
1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 1 2\n0 1 0 1\n1 0 1 2\n2 1 2 3", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 1 1\n0 1 0 1\n1 0 1 1\n1 1 1 1\n", "answer": "0 1 1 2\n0 1 0 1\n1 0 1 2\n2 1 2 3", "metadata": {"source_dataset": "binary_matrix", "source_index": 30, "matrix": [[0, 1, 1, 1], [0, 1, 0, 1], [1, 0, 1, 1], [1, 1, 1, 1]], "solution": [[0, 1, 1, 2], [0, 1, 0, 1], [1, 0, 1, 2], [2, 1, 2, 3]], "n": 4, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
1,
1
],
[
0,
1,
0,
1
],
[
1,
0,
1,
1
],
[
1,
1,
1,
1
]
],
"n": 4,
"solution": [
[
0,
1,
1,
2
],
[
0,
1,
0,
1
],
[
1,
0,
1,
2
],
[
2,
1,
2,
3
]
],
"source_dataset": "binary_matrix",
"source_index": 30
} |
reasoning_gym_binary_matrix_2EjVk8wu | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 1
1 1 0
1 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 1\n1 1 0\n2 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 1\n1 1 0\n1 1 0\n", "answer": "0 1 1\n1 1 0\n2 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 31, "matrix": [[0, 1, 1], [1, 1, 0], [1, 1, 0]], "solution": [[0, 1, 1], [1, 1, 0], [2, 1, 0]], "n": 3, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
1
],
[
1,
1,
0
],
[
1,
1,
0
]
],
"n": 3,
"solution": [
[
0,
1,
1
],
[
1,
1,
0
],
[
2,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 31
} |
reasoning_gym_binary_matrix_E3ywZSKT | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 1 1
1 1 1 1
1 1 1 0
0 0 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 2 2\n1 2 2 1\n1 1 1 0\n0 0 1 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 1 1\n1 1 1 1\n1 1 1 0\n0 0 1 1\n", "answer": "0 1 2 2\n1 2 2 1\n1 1 1 0\n0 0 1 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 32, "matrix": [[0, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 0], [0, 0, 1, 1]], "solution": [[0, 1, 2, 2], [1, 2, 2, 1], [1, 1, 1, 0], [0, 0, 1, 1]], "n": 4, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
1,
1
],
[
1,
1,
1,
1
],
[
1,
1,
1,
0
],
[
0,
0,
1,
1
]
],
"n": 4,
"solution": [
[
0,
1,
2,
2
],
[
1,
2,
2,
1
],
[
1,
1,
1,
0
],
[
0,
0,
1,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 32
} |
reasoning_gym_binary_matrix_9FMNr7DX | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0 1 1
1 1 1 0 1
1 0 1 1 0
0 1 1 0 1
1 0 1 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 0 1 2\n2 1 1 0 1\n1 0 1 1 0\n0 1 1 0 1\n1 0 1 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0 1 1\n1 1 1 0 1\n1 0 1 1 0\n0 1 1 0 1\n1 0 1 1 0\n", "answer": "2 1 0 1 2\n2 1 1 0 1\n1 0 1 1 0\n0 1 1 0 1\n1 0 1 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 33, "matrix": [[1, 1, 0, 1, 1], [1, 1, 1, 0, 1], [1, 0, 1, 1, 0], [0, 1, 1, 0, 1], [1, 0, 1, 1, 0]], "solution": [[2, 1, 0, 1, 2], [2, 1, 1, 0, 1], [1, 0, 1, 1, 0], [0, 1, 1, 0, 1], [1, 0, 1, 1, 0]], "n": 5, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0,
1,
1
],
[
1,
1,
1,
0,
1
],
[
1,
0,
1,
1,
0
],
[
0,
1,
1,
0,
1
],
[
1,
0,
1,
1,
0
]
],
"n": 5,
"solution": [
[
2,
1,
0,
1,
2
],
[
2,
1,
1,
0,
1
],
[
1,
0,
1,
1,
0
],
[
0,
1,
1,
0,
1
],
[
1,
0,
1,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 33
} |
reasoning_gym_binary_matrix_mntdgaTQ | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 1 1
1 1 1 1 1
1 0 0 1 0
1 1 1 0 1
1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "3 2 2 3 2\n2 1 1 2 1\n1 0 0 1 0\n2 1 1 0 1\n3 2 2 1 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 1 1\n1 1 1 1 1\n1 0 0 1 0\n1 1 1 0 1\n1 1 1 1 1\n", "answer": "3 2 2 3 2\n2 1 1 2 1\n1 0 0 1 0\n2 1 1 0 1\n3 2 2 1 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 34, "matrix": [[1, 1, 1, 1, 1], [1, 1, 1, 1, 1], [1, 0, 0, 1, 0], [1, 1, 1, 0, 1], [1, 1, 1, 1, 1]], "solution": [[3, 2, 2, 3, 2], [2, 1, 1, 2, 1], [1, 0, 0, 1, 0], [2, 1, 1, 0, 1], [3, 2, 2, 1, 2]], "n": 5, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1
],
[
1,
0,
0,
1,
0
],
[
1,
1,
1,
0,
1
],
[
1,
1,
1,
1,
1
]
],
"n": 5,
"solution": [
[
3,
2,
2,
3,
2
],
[
2,
1,
1,
2,
1
],
[
1,
0,
0,
1,
0
],
[
2,
1,
1,
0,
1
],
[
3,
2,
2,
1,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 34
} |
reasoning_gym_binary_matrix_Ybi5SuLT | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0 1 1 1 0
0 1 1 1 1 1 1
1 1 1 0 0 1 1
0 1 1 1 0 1 0
0 1 1 1 1 0 1
1 1 1 1 1 1 0
1 0 1 1 0 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 1 0 1 2 1 0\n0 1 1 1 1 2 1\n1 2 1 0 0 1 1\n0 1 2 1 0 1 0\n0 1 2 2 1 0 1\n1 1 2 2 1 1 0\n1 0 1 1 0 1 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0 1 1 1 0\n0 1 1 1 1 1 1\n1 1 1 0 0 1 1\n0 1 1 1 0 1 0\n0 1 1 1 1 0 1\n1 1 1 1 1 1 0\n1 0 1 1 0 1 1\n", "answer": "1 1 0 1 2 1 0\n0 1 1 1 1 2 1\n1 2 1 0 0 1 1\n0 1 2 1 0 1 0\n0 1 2 2 1 0 1\n1 1 2 2 1 1 0\n1 0 1 1 0 1 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 35, "matrix": [[1, 1, 0, 1, 1, 1, 0], [0, 1, 1, 1, 1, 1, 1], [1, 1, 1, 0, 0, 1, 1], [0, 1, 1, 1, 0, 1, 0], [0, 1, 1, 1, 1, 0, 1], [1, 1, 1, 1, 1, 1, 0], [1, 0, 1, 1, 0, 1, 1]], "solution": [[1, 1, 0, 1, 2, 1, 0], [0, 1, 1, 1, 1, 2, 1], [1, 2, 1, 0, 0, 1, 1], [0, 1, 2, 1, 0, 1, 0], [0, 1, 2, 2, 1, 0, 1], [1, 1, 2, 2, 1, 1, 0], [1, 0, 1, 1, 0, 1, 1]], "n": 7, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0,
1,
1,
1,
0
],
[
0,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
0,
0,
1,
1
],
[
0,
1,
1,
1,
0,
1,
0
],
[
0,
1,
1,
1,
1,
0,
1
],
[
1,
1,
1,
1,
1,
1,
0
],
[
1,
0,
1,
1,
0,
1,
1
]
],
"n": 7,
"solution": [
[
1,
1,
0,
1,
2,
1,
0
],
[
0,
1,
1,
1,
1,
2,
1
],
[
1,
2,
1,
0,
0,
1,
1
],
[
0,
1,
2,
1,
0,
1,
0
],
[
0,
1,
2,
2,
1,
0,
1
],
[
1,
1,
2,
2,
1,
1,
0
],
[
1,
0,
1,
1,
0,
1,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 35
} |
reasoning_gym_binary_matrix_9H3iBhO4 | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 1 0 0 1 1 1
0 1 1 1 1 1 0 0
1 1 1 0 1 0 1 1
1 1 0 1 0 1 1 1
0 1 0 0 1 1 1 1
1 1 0 1 0 0 1 1
0 0 1 1 1 1 0 1
1 1 1 1 0 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 1 0 0 1 1 1\n0 1 2 1 1 1 0 0\n1 2 1 0 1 0 1 1\n1 1 0 1 0 1 2 2\n0 1 0 0 1 1 2 3\n1 1 0 1 0 0 1 2\n0 0 1 2 1 1 0 1\n1 1 2 1 0 1 1 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 1 0 0 1 1 1\n0 1 1 1 1 1 0 0\n1 1 1 0 1 0 1 1\n1 1 0 1 0 1 1 1\n0 1 0 0 1 1 1 1\n1 1 0 1 0 0 1 1\n0 0 1 1 1 1 0 1\n1 1 1 1 0 1 1 1\n", "answer": "0 1 1 0 0 1 1 1\n0 1 2 1 1 1 0 0\n1 2 1 0 1 0 1 1\n1 1 0 1 0 1 2 2\n0 1 0 0 1 1 2 3\n1 1 0 1 0 0 1 2\n0 0 1 2 1 1 0 1\n1 1 2 1 0 1 1 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 36, "matrix": [[0, 1, 1, 0, 0, 1, 1, 1], [0, 1, 1, 1, 1, 1, 0, 0], [1, 1, 1, 0, 1, 0, 1, 1], [1, 1, 0, 1, 0, 1, 1, 1], [0, 1, 0, 0, 1, 1, 1, 1], [1, 1, 0, 1, 0, 0, 1, 1], [0, 0, 1, 1, 1, 1, 0, 1], [1, 1, 1, 1, 0, 1, 1, 1]], "solution": [[0, 1, 1, 0, 0, 1, 1, 1], [0, 1, 2, 1, 1, 1, 0, 0], [1, 2, 1, 0, 1, 0, 1, 1], [1, 1, 0, 1, 0, 1, 2, 2], [0, 1, 0, 0, 1, 1, 2, 3], [1, 1, 0, 1, 0, 0, 1, 2], [0, 0, 1, 2, 1, 1, 0, 1], [1, 1, 2, 1, 0, 1, 1, 2]], "n": 8, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
1,
0,
0,
1,
1,
1
],
[
0,
1,
1,
1,
1,
1,
0,
0
],
[
1,
1,
1,
0,
1,
0,
1,
1
],
[
1,
1,
0,
1,
0,
1,
1,
1
],
[
0,
1,
0,
0,
1,
1,
1,
1
],
[
1,
1,
0,
1,
0,
0,
1,
1
],
[
0,
0,
1,
1,
1,
1,
0,
1
],
[
1,
1,
1,
1,
0,
1,
1,
1
]
],
"n": 8,
"solution": [
[
0,
1,
1,
0,
0,
1,
1,
1
],
[
0,
1,
2,
1,
1,
1,
0,
0
],
[
1,
2,
1,
0,
1,
0,
1,
1
],
[
1,
1,
0,
1,
0,
1,
2,
2
],
[
0,
1,
0,
0,
1,
1,
2,
3
],
[
1,
1,
0,
1,
0,
0,
1,
2
],
[
0,
0,
1,
2,
1,
1,
0,
1
],
[
1,
1,
2,
1,
0,
1,
1,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 36
} |
reasoning_gym_binary_matrix_a9igEjOE | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 1
1 1 0
0 0 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 1\n1 1 0\n0 0 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 1\n1 1 0\n0 0 1\n", "answer": "0 1 1\n1 1 0\n0 0 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 37, "matrix": [[0, 1, 1], [1, 1, 0], [0, 0, 1]], "solution": [[0, 1, 1], [1, 1, 0], [0, 0, 1]], "n": 3, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
1
],
[
1,
1,
0
],
[
0,
0,
1
]
],
"n": 3,
"solution": [
[
0,
1,
1
],
[
1,
1,
0
],
[
0,
0,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 37
} |
reasoning_gym_binary_matrix_Jc2quc1M | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 0
1 0 1
1 0 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 0\n1 0 1\n1 0 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 0\n1 0 1\n1 0 1\n", "answer": "0 1 0\n1 0 1\n1 0 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 38, "matrix": [[0, 1, 0], [1, 0, 1], [1, 0, 1]], "solution": [[0, 1, 0], [1, 0, 1], [1, 0, 1]], "n": 3, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
0
],
[
1,
0,
1
],
[
1,
0,
1
]
],
"n": 3,
"solution": [
[
0,
1,
0
],
[
1,
0,
1
],
[
1,
0,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 38
} |
reasoning_gym_binary_matrix_0JCkEdAy | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 0 1 1 1 0 1 1 1 0
0 1 1 0 1 1 0 1 1 1
1 1 1 1 1 0 0 1 1 0
1 0 0 1 1 1 1 0 1 1
1 1 1 1 0 1 1 1 1 1
1 0 1 1 0 0 1 1 1 0
1 1 0 1 1 1 0 1 1 1
1 0 1 1 0 1 1 0 1 1
1 1 1 1 0 1 1 0 1 1
1 1 1 1 1 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 0 1 1 1 0 1 2 1 0\n0 1 1 0 1 1 0 1 2 1\n1 1 1 1 1 0 0 1 1 0\n1 0 0 1 1 1 1 0 1 1\n2 1 1 1 0 1 2 1 2 1\n1 0 1 1 0 0 1 2 1 0\n2 1 0 1 1 1 0 1 2 1\n1 0 1 1 0 1 1 0 1 2\n2 1 2 1 0 1 1 0 1 2\n3 2 3 2 1 2 2 1 2 3", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 0 1 1 1 0 1 1 1 0\n0 1 1 0 1 1 0 1 1 1\n1 1 1 1 1 0 0 1 1 0\n1 0 0 1 1 1 1 0 1 1\n1 1 1 1 0 1 1 1 1 1\n1 0 1 1 0 0 1 1 1 0\n1 1 0 1 1 1 0 1 1 1\n1 0 1 1 0 1 1 0 1 1\n1 1 1 1 0 1 1 0 1 1\n1 1 1 1 1 1 1 1 1 1\n", "answer": "0 0 1 1 1 0 1 2 1 0\n0 1 1 0 1 1 0 1 2 1\n1 1 1 1 1 0 0 1 1 0\n1 0 0 1 1 1 1 0 1 1\n2 1 1 1 0 1 2 1 2 1\n1 0 1 1 0 0 1 2 1 0\n2 1 0 1 1 1 0 1 2 1\n1 0 1 1 0 1 1 0 1 2\n2 1 2 1 0 1 1 0 1 2\n3 2 3 2 1 2 2 1 2 3", "metadata": {"source_dataset": "binary_matrix", "source_index": 39, "matrix": [[0, 0, 1, 1, 1, 0, 1, 1, 1, 0], [0, 1, 1, 0, 1, 1, 0, 1, 1, 1], [1, 1, 1, 1, 1, 0, 0, 1, 1, 0], [1, 0, 0, 1, 1, 1, 1, 0, 1, 1], [1, 1, 1, 1, 0, 1, 1, 1, 1, 1], [1, 0, 1, 1, 0, 0, 1, 1, 1, 0], [1, 1, 0, 1, 1, 1, 0, 1, 1, 1], [1, 0, 1, 1, 0, 1, 1, 0, 1, 1], [1, 1, 1, 1, 0, 1, 1, 0, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], "solution": [[0, 0, 1, 1, 1, 0, 1, 2, 1, 0], [0, 1, 1, 0, 1, 1, 0, 1, 2, 1], [1, 1, 1, 1, 1, 0, 0, 1, 1, 0], [1, 0, 0, 1, 1, 1, 1, 0, 1, 1], [2, 1, 1, 1, 0, 1, 2, 1, 2, 1], [1, 0, 1, 1, 0, 0, 1, 2, 1, 0], [2, 1, 0, 1, 1, 1, 0, 1, 2, 1], [1, 0, 1, 1, 0, 1, 1, 0, 1, 2], [2, 1, 2, 1, 0, 1, 1, 0, 1, 2], [3, 2, 3, 2, 1, 2, 2, 1, 2, 3]], "n": 10, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
0,
1,
1,
1,
0,
1,
1,
1,
0
],
[
0,
1,
1,
0,
1,
1,
0,
1,
1,
1
],
[
1,
1,
1,
1,
1,
0,
0,
1,
1,
0
],
[
1,
0,
0,
1,
1,
1,
1,
0,
1,
1
],
[
1,
1,
1,
1,
0,
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
0,
0,
1,
1,
1,
0
],
[
1,
1,
0,
1,
1,
1,
0,
1,
1,
1
],
[
1,
0,
1,
1,
0,
1,
1,
0,
1,
1
],
[
1,
1,
1,
1,
0,
1,
1,
0,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
]
],
"n": 10,
"solution": [
[
0,
0,
1,
1,
1,
0,
1,
2,
1,
0
],
[
0,
1,
1,
0,
1,
1,
0,
1,
2,
1
],
[
1,
1,
1,
1,
1,
0,
0,
1,
1,
0
],
[
1,
0,
0,
1,
1,
1,
1,
0,
1,
1
],
[
2,
1,
1,
1,
0,
1,
2,
1,
2,
1
],
[
1,
0,
1,
1,
0,
0,
1,
2,
1,
0
],
[
2,
1,
0,
1,
1,
1,
0,
1,
2,
1
],
[
1,
0,
1,
1,
0,
1,
1,
0,
1,
2
],
[
2,
1,
2,
1,
0,
1,
1,
0,
1,
2
],
[
3,
2,
3,
2,
1,
2,
2,
1,
2,
3
]
],
"source_dataset": "binary_matrix",
"source_index": 39
} |
reasoning_gym_binary_matrix_g9ZdH9Aq | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0
0 1 1
0 0 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 1 0\n0 1 1\n0 0 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0\n0 1 1\n0 0 1\n", "answer": "1 1 0\n0 1 1\n0 0 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 40, "matrix": [[1, 1, 0], [0, 1, 1], [0, 0, 1]], "solution": [[1, 1, 0], [0, 1, 1], [0, 0, 1]], "n": 3, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0
],
[
0,
1,
1
],
[
0,
0,
1
]
],
"n": 3,
"solution": [
[
1,
1,
0
],
[
0,
1,
1
],
[
0,
0,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 40
} |
reasoning_gym_binary_matrix_u2z5dTrV | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 0 1
1 0 1 0 1
1 0 1 0 1
1 0 1 1 1
1 1 1 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 1 0 1\n1 0 1 0 1\n1 0 1 0 1\n1 0 1 1 1\n2 1 2 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 0 1\n1 0 1 0 1\n1 0 1 0 1\n1 0 1 1 1\n1 1 1 1 0\n", "answer": "2 1 1 0 1\n1 0 1 0 1\n1 0 1 0 1\n1 0 1 1 1\n2 1 2 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 41, "matrix": [[1, 1, 1, 0, 1], [1, 0, 1, 0, 1], [1, 0, 1, 0, 1], [1, 0, 1, 1, 1], [1, 1, 1, 1, 0]], "solution": [[2, 1, 1, 0, 1], [1, 0, 1, 0, 1], [1, 0, 1, 0, 1], [1, 0, 1, 1, 1], [2, 1, 2, 1, 0]], "n": 5, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
0,
1
],
[
1,
0,
1,
0,
1
],
[
1,
0,
1,
0,
1
],
[
1,
0,
1,
1,
1
],
[
1,
1,
1,
1,
0
]
],
"n": 5,
"solution": [
[
2,
1,
1,
0,
1
],
[
1,
0,
1,
0,
1
],
[
1,
0,
1,
0,
1
],
[
1,
0,
1,
1,
1
],
[
2,
1,
2,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 41
} |
reasoning_gym_binary_matrix_jscZvkUG | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 1 0 0 1 1 1
1 1 0 1 1 1 0 0 0
1 1 0 1 1 1 1 1 1
1 0 1 1 1 1 1 0 1
1 1 0 1 1 0 0 0 1
0 1 1 1 1 1 1 0 1
1 0 1 1 0 1 1 0 0
1 1 0 1 1 1 0 1 1
0 1 1 1 1 1 0 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 1 0 0 1 1 1\n2 1 0 1 1 1 0 0 0\n2 1 0 1 2 2 1 1 1\n1 0 1 2 2 1 1 0 1\n1 1 0 1 1 0 0 0 1\n0 1 1 2 1 1 1 0 1\n1 0 1 1 0 1 1 0 0\n1 1 0 1 1 1 0 1 1\n0 1 1 2 2 1 0 1 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 1 0 0 1 1 1\n1 1 0 1 1 1 0 0 0\n1 1 0 1 1 1 1 1 1\n1 0 1 1 1 1 1 0 1\n1 1 0 1 1 0 0 0 1\n0 1 1 1 1 1 1 0 1\n1 0 1 1 0 1 1 0 0\n1 1 0 1 1 1 0 1 1\n0 1 1 1 1 1 0 1 1\n", "answer": "1 0 1 1 0 0 1 1 1\n2 1 0 1 1 1 0 0 0\n2 1 0 1 2 2 1 1 1\n1 0 1 2 2 1 1 0 1\n1 1 0 1 1 0 0 0 1\n0 1 1 2 1 1 1 0 1\n1 0 1 1 0 1 1 0 0\n1 1 0 1 1 1 0 1 1\n0 1 1 2 2 1 0 1 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 42, "matrix": [[1, 0, 1, 1, 0, 0, 1, 1, 1], [1, 1, 0, 1, 1, 1, 0, 0, 0], [1, 1, 0, 1, 1, 1, 1, 1, 1], [1, 0, 1, 1, 1, 1, 1, 0, 1], [1, 1, 0, 1, 1, 0, 0, 0, 1], [0, 1, 1, 1, 1, 1, 1, 0, 1], [1, 0, 1, 1, 0, 1, 1, 0, 0], [1, 1, 0, 1, 1, 1, 0, 1, 1], [0, 1, 1, 1, 1, 1, 0, 1, 1]], "solution": [[1, 0, 1, 1, 0, 0, 1, 1, 1], [2, 1, 0, 1, 1, 1, 0, 0, 0], [2, 1, 0, 1, 2, 2, 1, 1, 1], [1, 0, 1, 2, 2, 1, 1, 0, 1], [1, 1, 0, 1, 1, 0, 0, 0, 1], [0, 1, 1, 2, 1, 1, 1, 0, 1], [1, 0, 1, 1, 0, 1, 1, 0, 0], [1, 1, 0, 1, 1, 1, 0, 1, 1], [0, 1, 1, 2, 2, 1, 0, 1, 2]], "n": 9, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
1,
0,
0,
1,
1,
1
],
[
1,
1,
0,
1,
1,
1,
0,
0,
0
],
[
1,
1,
0,
1,
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
1,
1,
1,
0,
1
],
[
1,
1,
0,
1,
1,
0,
0,
0,
1
],
[
0,
1,
1,
1,
1,
1,
1,
0,
1
],
[
1,
0,
1,
1,
0,
1,
1,
0,
0
],
[
1,
1,
0,
1,
1,
1,
0,
1,
1
],
[
0,
1,
1,
1,
1,
1,
0,
1,
1
]
],
"n": 9,
"solution": [
[
1,
0,
1,
1,
0,
0,
1,
1,
1
],
[
2,
1,
0,
1,
1,
1,
0,
0,
0
],
[
2,
1,
0,
1,
2,
2,
1,
1,
1
],
[
1,
0,
1,
2,
2,
1,
1,
0,
1
],
[
1,
1,
0,
1,
1,
0,
0,
0,
1
],
[
0,
1,
1,
2,
1,
1,
1,
0,
1
],
[
1,
0,
1,
1,
0,
1,
1,
0,
0
],
[
1,
1,
0,
1,
1,
1,
0,
1,
1
],
[
0,
1,
1,
2,
2,
1,
0,
1,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 42
} |
reasoning_gym_binary_matrix_WZ5DZwQc | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 1 1
1 0 1 1 0
0 1 0 1 1
1 0 1 1 1
0 1 1 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 2 2 1\n1 0 1 1 0\n0 1 0 1 1\n1 0 1 2 1\n0 1 2 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 1 1\n1 0 1 1 0\n0 1 0 1 1\n1 0 1 1 1\n0 1 1 1 0\n", "answer": "2 1 2 2 1\n1 0 1 1 0\n0 1 0 1 1\n1 0 1 2 1\n0 1 2 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 43, "matrix": [[1, 1, 1, 1, 1], [1, 0, 1, 1, 0], [0, 1, 0, 1, 1], [1, 0, 1, 1, 1], [0, 1, 1, 1, 0]], "solution": [[2, 1, 2, 2, 1], [1, 0, 1, 1, 0], [0, 1, 0, 1, 1], [1, 0, 1, 2, 1], [0, 1, 2, 1, 0]], "n": 5, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
0
],
[
0,
1,
0,
1,
1
],
[
1,
0,
1,
1,
1
],
[
0,
1,
1,
1,
0
]
],
"n": 5,
"solution": [
[
2,
1,
2,
2,
1
],
[
1,
0,
1,
1,
0
],
[
0,
1,
0,
1,
1
],
[
1,
0,
1,
2,
1
],
[
0,
1,
2,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 43
} |
reasoning_gym_binary_matrix_qgHaW7Bm | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 1 1 1 1
1 0 1 1 0 1 1
0 1 1 1 0 1 0
1 1 0 1 1 1 0
1 1 0 0 1 0 1
0 1 1 1 1 0 1
1 1 0 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 2 1 2 2\n1 0 1 1 0 1 1\n0 1 1 1 0 1 0\n1 1 0 1 1 1 0\n1 1 0 0 1 0 1\n0 1 1 1 1 0 1\n1 1 0 1 2 1 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 1 1 1 1\n1 0 1 1 0 1 1\n0 1 1 1 0 1 0\n1 1 0 1 1 1 0\n1 1 0 0 1 0 1\n0 1 1 1 1 0 1\n1 1 0 1 1 1 1\n", "answer": "1 0 1 2 1 2 2\n1 0 1 1 0 1 1\n0 1 1 1 0 1 0\n1 1 0 1 1 1 0\n1 1 0 0 1 0 1\n0 1 1 1 1 0 1\n1 1 0 1 2 1 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 44, "matrix": [[1, 0, 1, 1, 1, 1, 1], [1, 0, 1, 1, 0, 1, 1], [0, 1, 1, 1, 0, 1, 0], [1, 1, 0, 1, 1, 1, 0], [1, 1, 0, 0, 1, 0, 1], [0, 1, 1, 1, 1, 0, 1], [1, 1, 0, 1, 1, 1, 1]], "solution": [[1, 0, 1, 2, 1, 2, 2], [1, 0, 1, 1, 0, 1, 1], [0, 1, 1, 1, 0, 1, 0], [1, 1, 0, 1, 1, 1, 0], [1, 1, 0, 0, 1, 0, 1], [0, 1, 1, 1, 1, 0, 1], [1, 1, 0, 1, 2, 1, 2]], "n": 7, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
0,
1,
1
],
[
0,
1,
1,
1,
0,
1,
0
],
[
1,
1,
0,
1,
1,
1,
0
],
[
1,
1,
0,
0,
1,
0,
1
],
[
0,
1,
1,
1,
1,
0,
1
],
[
1,
1,
0,
1,
1,
1,
1
]
],
"n": 7,
"solution": [
[
1,
0,
1,
2,
1,
2,
2
],
[
1,
0,
1,
1,
0,
1,
1
],
[
0,
1,
1,
1,
0,
1,
0
],
[
1,
1,
0,
1,
1,
1,
0
],
[
1,
1,
0,
0,
1,
0,
1
],
[
0,
1,
1,
1,
1,
0,
1
],
[
1,
1,
0,
1,
2,
1,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 44
} |
reasoning_gym_binary_matrix_P6gGzh7Z | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 0 1 1 1 1 1
1 1 1 1 0 1 0 1
0 0 1 1 0 0 1 1
1 1 1 1 1 0 1 1
1 1 1 0 0 1 1 1
1 1 0 1 0 1 1 1
1 1 1 1 1 1 1 1
0 1 0 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 0 1 1 2 1 2\n1 1 1 1 0 1 0 1\n0 0 1 1 0 0 1 2\n1 1 2 1 1 0 1 2\n2 2 1 0 0 1 2 3\n2 1 0 1 0 1 2 3\n1 2 1 2 1 2 3 4\n0 1 0 1 2 3 4 5", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 0 1 1 1 1 1\n1 1 1 1 0 1 0 1\n0 0 1 1 0 0 1 1\n1 1 1 1 1 0 1 1\n1 1 1 0 0 1 1 1\n1 1 0 1 0 1 1 1\n1 1 1 1 1 1 1 1\n0 1 0 1 1 1 1 1\n", "answer": "0 1 0 1 1 2 1 2\n1 1 1 1 0 1 0 1\n0 0 1 1 0 0 1 2\n1 1 2 1 1 0 1 2\n2 2 1 0 0 1 2 3\n2 1 0 1 0 1 2 3\n1 2 1 2 1 2 3 4\n0 1 0 1 2 3 4 5", "metadata": {"source_dataset": "binary_matrix", "source_index": 45, "matrix": [[0, 1, 0, 1, 1, 1, 1, 1], [1, 1, 1, 1, 0, 1, 0, 1], [0, 0, 1, 1, 0, 0, 1, 1], [1, 1, 1, 1, 1, 0, 1, 1], [1, 1, 1, 0, 0, 1, 1, 1], [1, 1, 0, 1, 0, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1], [0, 1, 0, 1, 1, 1, 1, 1]], "solution": [[0, 1, 0, 1, 1, 2, 1, 2], [1, 1, 1, 1, 0, 1, 0, 1], [0, 0, 1, 1, 0, 0, 1, 2], [1, 1, 2, 1, 1, 0, 1, 2], [2, 2, 1, 0, 0, 1, 2, 3], [2, 1, 0, 1, 0, 1, 2, 3], [1, 2, 1, 2, 1, 2, 3, 4], [0, 1, 0, 1, 2, 3, 4, 5]], "n": 8, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
0,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
0,
1,
0,
1
],
[
0,
0,
1,
1,
0,
0,
1,
1
],
[
1,
1,
1,
1,
1,
0,
1,
1
],
[
1,
1,
1,
0,
0,
1,
1,
1
],
[
1,
1,
0,
1,
0,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1
],
[
0,
1,
0,
1,
1,
1,
1,
1
]
],
"n": 8,
"solution": [
[
0,
1,
0,
1,
1,
2,
1,
2
],
[
1,
1,
1,
1,
0,
1,
0,
1
],
[
0,
0,
1,
1,
0,
0,
1,
2
],
[
1,
1,
2,
1,
1,
0,
1,
2
],
[
2,
2,
1,
0,
0,
1,
2,
3
],
[
2,
1,
0,
1,
0,
1,
2,
3
],
[
1,
2,
1,
2,
1,
2,
3,
4
],
[
0,
1,
0,
1,
2,
3,
4,
5
]
],
"source_dataset": "binary_matrix",
"source_index": 45
} |
reasoning_gym_binary_matrix_0ARyM6jc | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 1 0 1 1 1 1
0 0 1 1 1 0 0 1 0
1 1 0 0 1 1 1 1 1
0 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1
0 1 0 0 1 1 1 1 1
1 0 1 1 0 0 1 1 1
1 0 0 1 1 1 0 1 1
1 0 0 1 0 0 0 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 1 2 1 0 1 1 2 1\n0 0 1 1 1 0 0 1 0\n1 1 0 0 1 1 1 2 1\n0 1 1 1 2 2 2 3 2\n1 2 1 1 2 2 3 4 3\n0 1 0 0 1 1 2 3 4\n1 0 1 1 0 0 1 2 3\n1 0 0 1 1 1 0 1 2\n1 0 0 1 0 0 0 1 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 1 0 1 1 1 1\n0 0 1 1 1 0 0 1 0\n1 1 0 0 1 1 1 1 1\n0 1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 1\n0 1 0 0 1 1 1 1 1\n1 0 1 1 0 0 1 1 1\n1 0 0 1 1 1 0 1 1\n1 0 0 1 0 0 0 1 1\n", "answer": "1 1 2 1 0 1 1 2 1\n0 0 1 1 1 0 0 1 0\n1 1 0 0 1 1 1 2 1\n0 1 1 1 2 2 2 3 2\n1 2 1 1 2 2 3 4 3\n0 1 0 0 1 1 2 3 4\n1 0 1 1 0 0 1 2 3\n1 0 0 1 1 1 0 1 2\n1 0 0 1 0 0 0 1 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 46, "matrix": [[1, 1, 1, 1, 0, 1, 1, 1, 1], [0, 0, 1, 1, 1, 0, 0, 1, 0], [1, 1, 0, 0, 1, 1, 1, 1, 1], [0, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 1, 0, 0, 1, 1, 1, 1, 1], [1, 0, 1, 1, 0, 0, 1, 1, 1], [1, 0, 0, 1, 1, 1, 0, 1, 1], [1, 0, 0, 1, 0, 0, 0, 1, 1]], "solution": [[1, 1, 2, 1, 0, 1, 1, 2, 1], [0, 0, 1, 1, 1, 0, 0, 1, 0], [1, 1, 0, 0, 1, 1, 1, 2, 1], [0, 1, 1, 1, 2, 2, 2, 3, 2], [1, 2, 1, 1, 2, 2, 3, 4, 3], [0, 1, 0, 0, 1, 1, 2, 3, 4], [1, 0, 1, 1, 0, 0, 1, 2, 3], [1, 0, 0, 1, 1, 1, 0, 1, 2], [1, 0, 0, 1, 0, 0, 0, 1, 2]], "n": 9, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
1,
0,
1,
1,
1,
1
],
[
0,
0,
1,
1,
1,
0,
0,
1,
0
],
[
1,
1,
0,
0,
1,
1,
1,
1,
1
],
[
0,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
0,
1,
0,
0,
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
0,
0,
1,
1,
1
],
[
1,
0,
0,
1,
1,
1,
0,
1,
1
],
[
1,
0,
0,
1,
0,
0,
0,
1,
1
]
],
"n": 9,
"solution": [
[
1,
1,
2,
1,
0,
1,
1,
2,
1
],
[
0,
0,
1,
1,
1,
0,
0,
1,
0
],
[
1,
1,
0,
0,
1,
1,
1,
2,
1
],
[
0,
1,
1,
1,
2,
2,
2,
3,
2
],
[
1,
2,
1,
1,
2,
2,
3,
4,
3
],
[
0,
1,
0,
0,
1,
1,
2,
3,
4
],
[
1,
0,
1,
1,
0,
0,
1,
2,
3
],
[
1,
0,
0,
1,
1,
1,
0,
1,
2
],
[
1,
0,
0,
1,
0,
0,
0,
1,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 46
} |
reasoning_gym_binary_matrix_YbVW6K9M | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 1 0 1 1
1 1 1 1 1 1 1
1 0 1 1 0 0 1
1 0 1 0 1 1 1
1 1 1 0 1 1 1
1 1 0 1 0 0 1
1 0 1 1 0 0 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 1 0 1 2\n2 1 2 2 1 1 2\n1 0 1 1 0 0 1\n1 0 1 0 1 1 2\n2 1 1 0 1 1 2\n2 1 0 1 0 0 1\n1 0 1 1 0 0 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 1 0 1 1\n1 1 1 1 1 1 1\n1 0 1 1 0 0 1\n1 0 1 0 1 1 1\n1 1 1 0 1 1 1\n1 1 0 1 0 0 1\n1 0 1 1 0 0 0\n", "answer": "1 0 1 1 0 1 2\n2 1 2 2 1 1 2\n1 0 1 1 0 0 1\n1 0 1 0 1 1 2\n2 1 1 0 1 1 2\n2 1 0 1 0 0 1\n1 0 1 1 0 0 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 47, "matrix": [[1, 0, 1, 1, 0, 1, 1], [1, 1, 1, 1, 1, 1, 1], [1, 0, 1, 1, 0, 0, 1], [1, 0, 1, 0, 1, 1, 1], [1, 1, 1, 0, 1, 1, 1], [1, 1, 0, 1, 0, 0, 1], [1, 0, 1, 1, 0, 0, 0]], "solution": [[1, 0, 1, 1, 0, 1, 2], [2, 1, 2, 2, 1, 1, 2], [1, 0, 1, 1, 0, 0, 1], [1, 0, 1, 0, 1, 1, 2], [2, 1, 1, 0, 1, 1, 2], [2, 1, 0, 1, 0, 0, 1], [1, 0, 1, 1, 0, 0, 0]], "n": 7, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
1,
0,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
0,
0,
1
],
[
1,
0,
1,
0,
1,
1,
1
],
[
1,
1,
1,
0,
1,
1,
1
],
[
1,
1,
0,
1,
0,
0,
1
],
[
1,
0,
1,
1,
0,
0,
0
]
],
"n": 7,
"solution": [
[
1,
0,
1,
1,
0,
1,
2
],
[
2,
1,
2,
2,
1,
1,
2
],
[
1,
0,
1,
1,
0,
0,
1
],
[
1,
0,
1,
0,
1,
1,
2
],
[
2,
1,
1,
0,
1,
1,
2
],
[
2,
1,
0,
1,
0,
0,
1
],
[
1,
0,
1,
1,
0,
0,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 47
} |
reasoning_gym_binary_matrix_l8ky87Wr | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 0 1 1
0 1 0 1 1 1
1 1 0 0 0 1
1 1 1 1 0 1
0 0 0 0 1 1
0 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 2 1 0 1 2\n0 1 0 1 1 2\n1 1 0 0 0 1\n1 1 1 1 0 1\n0 0 0 0 1 2\n0 1 1 1 2 3", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 0 1 1\n0 1 0 1 1 1\n1 1 0 0 0 1\n1 1 1 1 0 1\n0 0 0 0 1 1\n0 1 1 1 1 1\n", "answer": "1 2 1 0 1 2\n0 1 0 1 1 2\n1 1 0 0 0 1\n1 1 1 1 0 1\n0 0 0 0 1 2\n0 1 1 1 2 3", "metadata": {"source_dataset": "binary_matrix", "source_index": 48, "matrix": [[1, 1, 1, 0, 1, 1], [0, 1, 0, 1, 1, 1], [1, 1, 0, 0, 0, 1], [1, 1, 1, 1, 0, 1], [0, 0, 0, 0, 1, 1], [0, 1, 1, 1, 1, 1]], "solution": [[1, 2, 1, 0, 1, 2], [0, 1, 0, 1, 1, 2], [1, 1, 0, 0, 0, 1], [1, 1, 1, 1, 0, 1], [0, 0, 0, 0, 1, 2], [0, 1, 1, 1, 2, 3]], "n": 6, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
0,
1,
1
],
[
0,
1,
0,
1,
1,
1
],
[
1,
1,
0,
0,
0,
1
],
[
1,
1,
1,
1,
0,
1
],
[
0,
0,
0,
0,
1,
1
],
[
0,
1,
1,
1,
1,
1
]
],
"n": 6,
"solution": [
[
1,
2,
1,
0,
1,
2
],
[
0,
1,
0,
1,
1,
2
],
[
1,
1,
0,
0,
0,
1
],
[
1,
1,
1,
1,
0,
1
],
[
0,
0,
0,
0,
1,
2
],
[
0,
1,
1,
1,
2,
3
]
],
"source_dataset": "binary_matrix",
"source_index": 48
} |
reasoning_gym_binary_matrix_rsnZBCdf | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 0 1 1 1 1 1
1 1 1 1 1 1 0
0 1 1 1 0 1 0
1 1 1 0 1 1 1
0 1 1 0 1 1 0
1 1 1 0 0 1 1
1 1 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 0 1 2 2 2 1\n1 1 2 2 1 1 0\n0 1 2 1 0 1 0\n1 2 1 0 1 2 1\n0 1 1 0 1 1 0\n1 2 1 0 0 1 1\n2 3 2 1 1 2 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 0 1 1 1 1 1\n1 1 1 1 1 1 0\n0 1 1 1 0 1 0\n1 1 1 0 1 1 1\n0 1 1 0 1 1 0\n1 1 1 0 0 1 1\n1 1 1 1 1 1 1\n", "answer": "0 0 1 2 2 2 1\n1 1 2 2 1 1 0\n0 1 2 1 0 1 0\n1 2 1 0 1 2 1\n0 1 1 0 1 1 0\n1 2 1 0 0 1 1\n2 3 2 1 1 2 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 49, "matrix": [[0, 0, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 0], [0, 1, 1, 1, 0, 1, 0], [1, 1, 1, 0, 1, 1, 1], [0, 1, 1, 0, 1, 1, 0], [1, 1, 1, 0, 0, 1, 1], [1, 1, 1, 1, 1, 1, 1]], "solution": [[0, 0, 1, 2, 2, 2, 1], [1, 1, 2, 2, 1, 1, 0], [0, 1, 2, 1, 0, 1, 0], [1, 2, 1, 0, 1, 2, 1], [0, 1, 1, 0, 1, 1, 0], [1, 2, 1, 0, 0, 1, 1], [2, 3, 2, 1, 1, 2, 2]], "n": 7, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
0,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
0
],
[
0,
1,
1,
1,
0,
1,
0
],
[
1,
1,
1,
0,
1,
1,
1
],
[
0,
1,
1,
0,
1,
1,
0
],
[
1,
1,
1,
0,
0,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1
]
],
"n": 7,
"solution": [
[
0,
0,
1,
2,
2,
2,
1
],
[
1,
1,
2,
2,
1,
1,
0
],
[
0,
1,
2,
1,
0,
1,
0
],
[
1,
2,
1,
0,
1,
2,
1
],
[
0,
1,
1,
0,
1,
1,
0
],
[
1,
2,
1,
0,
0,
1,
1
],
[
2,
3,
2,
1,
1,
2,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 49
} |
reasoning_gym_binary_matrix_96mJU7kn | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 1 0 0 1 1
1 1 1 0 1 1 1 1
0 0 0 1 0 1 1 1
0 0 0 1 0 0 1 1
1 1 1 1 0 1 1 0
1 1 1 0 1 1 0 1
1 1 0 0 0 1 1 1
1 1 0 0 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 1 0 0 1 2\n1 1 1 0 1 1 2 3\n0 0 0 1 0 1 2 2\n0 0 0 1 0 0 1 1\n1 1 1 1 0 1 1 0\n2 2 1 0 1 1 0 1\n2 1 0 0 0 1 1 2\n2 1 0 0 1 2 2 3", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 1 0 0 1 1\n1 1 1 0 1 1 1 1\n0 0 0 1 0 1 1 1\n0 0 0 1 0 0 1 1\n1 1 1 1 0 1 1 0\n1 1 1 0 1 1 0 1\n1 1 0 0 0 1 1 1\n1 1 0 0 1 1 1 1\n", "answer": "1 0 1 1 0 0 1 2\n1 1 1 0 1 1 2 3\n0 0 0 1 0 1 2 2\n0 0 0 1 0 0 1 1\n1 1 1 1 0 1 1 0\n2 2 1 0 1 1 0 1\n2 1 0 0 0 1 1 2\n2 1 0 0 1 2 2 3", "metadata": {"source_dataset": "binary_matrix", "source_index": 50, "matrix": [[1, 0, 1, 1, 0, 0, 1, 1], [1, 1, 1, 0, 1, 1, 1, 1], [0, 0, 0, 1, 0, 1, 1, 1], [0, 0, 0, 1, 0, 0, 1, 1], [1, 1, 1, 1, 0, 1, 1, 0], [1, 1, 1, 0, 1, 1, 0, 1], [1, 1, 0, 0, 0, 1, 1, 1], [1, 1, 0, 0, 1, 1, 1, 1]], "solution": [[1, 0, 1, 1, 0, 0, 1, 2], [1, 1, 1, 0, 1, 1, 2, 3], [0, 0, 0, 1, 0, 1, 2, 2], [0, 0, 0, 1, 0, 0, 1, 1], [1, 1, 1, 1, 0, 1, 1, 0], [2, 2, 1, 0, 1, 1, 0, 1], [2, 1, 0, 0, 0, 1, 1, 2], [2, 1, 0, 0, 1, 2, 2, 3]], "n": 8, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
1,
0,
0,
1,
1
],
[
1,
1,
1,
0,
1,
1,
1,
1
],
[
0,
0,
0,
1,
0,
1,
1,
1
],
[
0,
0,
0,
1,
0,
0,
1,
1
],
[
1,
1,
1,
1,
0,
1,
1,
0
],
[
1,
1,
1,
0,
1,
1,
0,
1
],
[
1,
1,
0,
0,
0,
1,
1,
1
],
[
1,
1,
0,
0,
1,
1,
1,
1
]
],
"n": 8,
"solution": [
[
1,
0,
1,
1,
0,
0,
1,
2
],
[
1,
1,
1,
0,
1,
1,
2,
3
],
[
0,
0,
0,
1,
0,
1,
2,
2
],
[
0,
0,
0,
1,
0,
0,
1,
1
],
[
1,
1,
1,
1,
0,
1,
1,
0
],
[
2,
2,
1,
0,
1,
1,
0,
1
],
[
2,
1,
0,
0,
0,
1,
1,
2
],
[
2,
1,
0,
0,
1,
2,
2,
3
]
],
"source_dataset": "binary_matrix",
"source_index": 50
} |
reasoning_gym_binary_matrix_CjM4Zyt9 | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 1 0 0
0 0 0 1 1 1
1 0 1 0 1 1
1 1 1 1 1 0
1 1 0 1 0 0
1 0 0 0 0 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 1 0 0\n0 0 0 1 1 1\n1 0 1 0 1 1\n2 1 1 1 1 0\n2 1 0 1 0 0\n1 0 0 0 0 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 1 0 0\n0 0 0 1 1 1\n1 0 1 0 1 1\n1 1 1 1 1 0\n1 1 0 1 0 0\n1 0 0 0 0 0\n", "answer": "1 0 1 1 0 0\n0 0 0 1 1 1\n1 0 1 0 1 1\n2 1 1 1 1 0\n2 1 0 1 0 0\n1 0 0 0 0 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 51, "matrix": [[1, 0, 1, 1, 0, 0], [0, 0, 0, 1, 1, 1], [1, 0, 1, 0, 1, 1], [1, 1, 1, 1, 1, 0], [1, 1, 0, 1, 0, 0], [1, 0, 0, 0, 0, 0]], "solution": [[1, 0, 1, 1, 0, 0], [0, 0, 0, 1, 1, 1], [1, 0, 1, 0, 1, 1], [2, 1, 1, 1, 1, 0], [2, 1, 0, 1, 0, 0], [1, 0, 0, 0, 0, 0]], "n": 6, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
1,
0,
0
],
[
0,
0,
0,
1,
1,
1
],
[
1,
0,
1,
0,
1,
1
],
[
1,
1,
1,
1,
1,
0
],
[
1,
1,
0,
1,
0,
0
],
[
1,
0,
0,
0,
0,
0
]
],
"n": 6,
"solution": [
[
1,
0,
1,
1,
0,
0
],
[
0,
0,
0,
1,
1,
1
],
[
1,
0,
1,
0,
1,
1
],
[
2,
1,
1,
1,
1,
0
],
[
2,
1,
0,
1,
0,
0
],
[
1,
0,
0,
0,
0,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 51
} |
reasoning_gym_binary_matrix_pbat6mNN | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 0 1 0
1 1 1 1 1 1
1 0 1 1 1 1
1 1 0 1 1 0
1 1 1 1 1 1
1 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "3 2 1 0 1 0\n2 1 2 1 2 1\n1 0 1 2 2 1\n2 1 0 1 1 0\n3 2 1 2 2 1\n4 3 2 3 3 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 0 1 0\n1 1 1 1 1 1\n1 0 1 1 1 1\n1 1 0 1 1 0\n1 1 1 1 1 1\n1 1 1 1 1 1\n", "answer": "3 2 1 0 1 0\n2 1 2 1 2 1\n1 0 1 2 2 1\n2 1 0 1 1 0\n3 2 1 2 2 1\n4 3 2 3 3 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 52, "matrix": [[1, 1, 1, 0, 1, 0], [1, 1, 1, 1, 1, 1], [1, 0, 1, 1, 1, 1], [1, 1, 0, 1, 1, 0], [1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1]], "solution": [[3, 2, 1, 0, 1, 0], [2, 1, 2, 1, 2, 1], [1, 0, 1, 2, 2, 1], [2, 1, 0, 1, 1, 0], [3, 2, 1, 2, 2, 1], [4, 3, 2, 3, 3, 2]], "n": 6, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
0,
1,
0
],
[
1,
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
1,
1
],
[
1,
1,
0,
1,
1,
0
],
[
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1
]
],
"n": 6,
"solution": [
[
3,
2,
1,
0,
1,
0
],
[
2,
1,
2,
1,
2,
1
],
[
1,
0,
1,
2,
2,
1
],
[
2,
1,
0,
1,
1,
0
],
[
3,
2,
1,
2,
2,
1
],
[
4,
3,
2,
3,
3,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 52
} |
reasoning_gym_binary_matrix_t7ZqtKCF | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0 1 1 0 1 1 1
1 1 1 1 1 0 1 0 1
1 1 1 1 1 1 1 1 1
1 1 1 0 1 1 1 1 1
1 0 0 1 1 1 1 1 1
1 1 1 1 1 1 1 1 0
1 1 1 1 1 1 1 1 0
1 1 1 1 0 1 0 1 1
1 0 0 1 1 1 0 0 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 0 1 1 0 1 1 2\n3 2 1 2 1 0 1 0 1\n3 2 2 1 2 1 2 1 2\n2 1 1 0 1 2 3 2 2\n1 0 0 1 2 3 3 2 1\n2 1 1 2 2 3 2 1 0\n3 2 2 2 1 2 1 1 0\n2 1 1 1 0 1 0 1 1\n1 0 0 1 1 1 0 0 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0 1 1 0 1 1 1\n1 1 1 1 1 0 1 0 1\n1 1 1 1 1 1 1 1 1\n1 1 1 0 1 1 1 1 1\n1 0 0 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 0\n1 1 1 1 1 1 1 1 0\n1 1 1 1 0 1 0 1 1\n1 0 0 1 1 1 0 0 1\n", "answer": "2 1 0 1 1 0 1 1 2\n3 2 1 2 1 0 1 0 1\n3 2 2 1 2 1 2 1 2\n2 1 1 0 1 2 3 2 2\n1 0 0 1 2 3 3 2 1\n2 1 1 2 2 3 2 1 0\n3 2 2 2 1 2 1 1 0\n2 1 1 1 0 1 0 1 1\n1 0 0 1 1 1 0 0 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 53, "matrix": [[1, 1, 0, 1, 1, 0, 1, 1, 1], [1, 1, 1, 1, 1, 0, 1, 0, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 0, 1, 1, 1, 1, 1], [1, 0, 0, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 0], [1, 1, 1, 1, 1, 1, 1, 1, 0], [1, 1, 1, 1, 0, 1, 0, 1, 1], [1, 0, 0, 1, 1, 1, 0, 0, 1]], "solution": [[2, 1, 0, 1, 1, 0, 1, 1, 2], [3, 2, 1, 2, 1, 0, 1, 0, 1], [3, 2, 2, 1, 2, 1, 2, 1, 2], [2, 1, 1, 0, 1, 2, 3, 2, 2], [1, 0, 0, 1, 2, 3, 3, 2, 1], [2, 1, 1, 2, 2, 3, 2, 1, 0], [3, 2, 2, 2, 1, 2, 1, 1, 0], [2, 1, 1, 1, 0, 1, 0, 1, 1], [1, 0, 0, 1, 1, 1, 0, 0, 1]], "n": 9, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0,
1,
1,
0,
1,
1,
1
],
[
1,
1,
1,
1,
1,
0,
1,
0,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
0,
1,
1,
1,
1,
1
],
[
1,
0,
0,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
0
],
[
1,
1,
1,
1,
1,
1,
1,
1,
0
],
[
1,
1,
1,
1,
0,
1,
0,
1,
1
],
[
1,
0,
0,
1,
1,
1,
0,
0,
1
]
],
"n": 9,
"solution": [
[
2,
1,
0,
1,
1,
0,
1,
1,
2
],
[
3,
2,
1,
2,
1,
0,
1,
0,
1
],
[
3,
2,
2,
1,
2,
1,
2,
1,
2
],
[
2,
1,
1,
0,
1,
2,
3,
2,
2
],
[
1,
0,
0,
1,
2,
3,
3,
2,
1
],
[
2,
1,
1,
2,
2,
3,
2,
1,
0
],
[
3,
2,
2,
2,
1,
2,
1,
1,
0
],
[
2,
1,
1,
1,
0,
1,
0,
1,
1
],
[
1,
0,
0,
1,
1,
1,
0,
0,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 53
} |
reasoning_gym_binary_matrix_Y27zwA8Z | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 0 0 1 1 1 1
0 1 1 1 1 1 1
0 1 1 1 0 0 1
1 1 0 1 1 1 1
1 0 0 1 1 0 0
1 0 1 1 0 1 0
1 1 0 0 1 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 0 0 1 2 2 3\n0 1 1 2 1 1 2\n0 1 1 1 0 0 1\n1 1 0 1 1 1 1\n1 0 0 1 1 0 0\n1 0 1 1 0 1 0\n2 1 0 0 1 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 0 0 1 1 1 1\n0 1 1 1 1 1 1\n0 1 1 1 0 0 1\n1 1 0 1 1 1 1\n1 0 0 1 1 0 0\n1 0 1 1 0 1 0\n1 1 0 0 1 1 0\n", "answer": "0 0 0 1 2 2 3\n0 1 1 2 1 1 2\n0 1 1 1 0 0 1\n1 1 0 1 1 1 1\n1 0 0 1 1 0 0\n1 0 1 1 0 1 0\n2 1 0 0 1 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 54, "matrix": [[0, 0, 0, 1, 1, 1, 1], [0, 1, 1, 1, 1, 1, 1], [0, 1, 1, 1, 0, 0, 1], [1, 1, 0, 1, 1, 1, 1], [1, 0, 0, 1, 1, 0, 0], [1, 0, 1, 1, 0, 1, 0], [1, 1, 0, 0, 1, 1, 0]], "solution": [[0, 0, 0, 1, 2, 2, 3], [0, 1, 1, 2, 1, 1, 2], [0, 1, 1, 1, 0, 0, 1], [1, 1, 0, 1, 1, 1, 1], [1, 0, 0, 1, 1, 0, 0], [1, 0, 1, 1, 0, 1, 0], [2, 1, 0, 0, 1, 1, 0]], "n": 7, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
0,
0,
1,
1,
1,
1
],
[
0,
1,
1,
1,
1,
1,
1
],
[
0,
1,
1,
1,
0,
0,
1
],
[
1,
1,
0,
1,
1,
1,
1
],
[
1,
0,
0,
1,
1,
0,
0
],
[
1,
0,
1,
1,
0,
1,
0
],
[
1,
1,
0,
0,
1,
1,
0
]
],
"n": 7,
"solution": [
[
0,
0,
0,
1,
2,
2,
3
],
[
0,
1,
1,
2,
1,
1,
2
],
[
0,
1,
1,
1,
0,
0,
1
],
[
1,
1,
0,
1,
1,
1,
1
],
[
1,
0,
0,
1,
1,
0,
0
],
[
1,
0,
1,
1,
0,
1,
0
],
[
2,
1,
0,
0,
1,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 54
} |
reasoning_gym_binary_matrix_pmMlcUD7 | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0 1 0
1 1 1 1 1
1 1 1 1 0
1 0 0 1 0
1 1 1 0 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 0 1 0\n3 2 1 2 1\n2 1 1 1 0\n1 0 0 1 0\n2 1 1 0 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0 1 0\n1 1 1 1 1\n1 1 1 1 0\n1 0 0 1 0\n1 1 1 0 1\n", "answer": "2 1 0 1 0\n3 2 1 2 1\n2 1 1 1 0\n1 0 0 1 0\n2 1 1 0 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 55, "matrix": [[1, 1, 0, 1, 0], [1, 1, 1, 1, 1], [1, 1, 1, 1, 0], [1, 0, 0, 1, 0], [1, 1, 1, 0, 1]], "solution": [[2, 1, 0, 1, 0], [3, 2, 1, 2, 1], [2, 1, 1, 1, 0], [1, 0, 0, 1, 0], [2, 1, 1, 0, 1]], "n": 5, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0,
1,
0
],
[
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
0
],
[
1,
0,
0,
1,
0
],
[
1,
1,
1,
0,
1
]
],
"n": 5,
"solution": [
[
2,
1,
0,
1,
0
],
[
3,
2,
1,
2,
1
],
[
2,
1,
1,
1,
0
],
[
1,
0,
0,
1,
0
],
[
2,
1,
1,
0,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 55
} |
reasoning_gym_binary_matrix_qwKPTv0F | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 0 1
0 1 0 1 1
1 0 1 1 1
1 1 0 0 1
1 1 1 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 2 1 0 1\n0 1 0 1 2\n1 0 1 1 2\n2 1 0 0 1\n3 2 1 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 0 1\n0 1 0 1 1\n1 0 1 1 1\n1 1 0 0 1\n1 1 1 1 0\n", "answer": "1 2 1 0 1\n0 1 0 1 2\n1 0 1 1 2\n2 1 0 0 1\n3 2 1 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 56, "matrix": [[1, 1, 1, 0, 1], [0, 1, 0, 1, 1], [1, 0, 1, 1, 1], [1, 1, 0, 0, 1], [1, 1, 1, 1, 0]], "solution": [[1, 2, 1, 0, 1], [0, 1, 0, 1, 2], [1, 0, 1, 1, 2], [2, 1, 0, 0, 1], [3, 2, 1, 1, 0]], "n": 5, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
0,
1
],
[
0,
1,
0,
1,
1
],
[
1,
0,
1,
1,
1
],
[
1,
1,
0,
0,
1
],
[
1,
1,
1,
1,
0
]
],
"n": 5,
"solution": [
[
1,
2,
1,
0,
1
],
[
0,
1,
0,
1,
2
],
[
1,
0,
1,
1,
2
],
[
2,
1,
0,
0,
1
],
[
3,
2,
1,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 56
} |
reasoning_gym_binary_matrix_bBENeMkX | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 1 1
0 1 0 1
1 1 0 1
0 1 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 1 2\n0 1 0 1\n1 1 0 1\n0 1 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 1 1\n0 1 0 1\n1 1 0 1\n0 1 1 0\n", "answer": "0 1 1 2\n0 1 0 1\n1 1 0 1\n0 1 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 57, "matrix": [[0, 1, 1, 1], [0, 1, 0, 1], [1, 1, 0, 1], [0, 1, 1, 0]], "solution": [[0, 1, 1, 2], [0, 1, 0, 1], [1, 1, 0, 1], [0, 1, 1, 0]], "n": 4, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
1,
1
],
[
0,
1,
0,
1
],
[
1,
1,
0,
1
],
[
0,
1,
1,
0
]
],
"n": 4,
"solution": [
[
0,
1,
1,
2
],
[
0,
1,
0,
1
],
[
1,
1,
0,
1
],
[
0,
1,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 57
} |
reasoning_gym_binary_matrix_g667kQWD | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 0 1 1 1 1 1 1 1
1 1 1 1 1 1 0 1 1
0 0 1 1 0 0 1 1 1
1 1 1 1 1 1 1 1 1
1 1 1 0 0 1 1 0 1
1 0 1 1 1 1 1 1 0
1 1 1 1 0 1 1 1 1
0 1 0 1 1 1 1 1 0
1 0 1 1 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 0 1 2 2 2 1 2 3\n1 1 2 2 1 1 0 1 2\n0 0 1 1 0 0 1 2 3\n1 1 2 1 1 1 2 1 2\n2 1 1 0 0 1 1 0 1\n1 0 1 1 1 2 2 1 0\n1 1 1 1 0 1 2 2 1\n0 1 0 1 1 2 2 1 0\n1 0 1 2 2 3 3 2 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 0 1 1 1 1 1 1 1\n1 1 1 1 1 1 0 1 1\n0 0 1 1 0 0 1 1 1\n1 1 1 1 1 1 1 1 1\n1 1 1 0 0 1 1 0 1\n1 0 1 1 1 1 1 1 0\n1 1 1 1 0 1 1 1 1\n0 1 0 1 1 1 1 1 0\n1 0 1 1 1 1 1 1 1\n", "answer": "0 0 1 2 2 2 1 2 3\n1 1 2 2 1 1 0 1 2\n0 0 1 1 0 0 1 2 3\n1 1 2 1 1 1 2 1 2\n2 1 1 0 0 1 1 0 1\n1 0 1 1 1 2 2 1 0\n1 1 1 1 0 1 2 2 1\n0 1 0 1 1 2 2 1 0\n1 0 1 2 2 3 3 2 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 58, "matrix": [[0, 0, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 0, 1, 1], [0, 0, 1, 1, 0, 0, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 0, 0, 1, 1, 0, 1], [1, 0, 1, 1, 1, 1, 1, 1, 0], [1, 1, 1, 1, 0, 1, 1, 1, 1], [0, 1, 0, 1, 1, 1, 1, 1, 0], [1, 0, 1, 1, 1, 1, 1, 1, 1]], "solution": [[0, 0, 1, 2, 2, 2, 1, 2, 3], [1, 1, 2, 2, 1, 1, 0, 1, 2], [0, 0, 1, 1, 0, 0, 1, 2, 3], [1, 1, 2, 1, 1, 1, 2, 1, 2], [2, 1, 1, 0, 0, 1, 1, 0, 1], [1, 0, 1, 1, 1, 2, 2, 1, 0], [1, 1, 1, 1, 0, 1, 2, 2, 1], [0, 1, 0, 1, 1, 2, 2, 1, 0], [1, 0, 1, 2, 2, 3, 3, 2, 1]], "n": 9, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
0,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
0,
1,
1
],
[
0,
0,
1,
1,
0,
0,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
0,
0,
1,
1,
0,
1
],
[
1,
0,
1,
1,
1,
1,
1,
1,
0
],
[
1,
1,
1,
1,
0,
1,
1,
1,
1
],
[
0,
1,
0,
1,
1,
1,
1,
1,
0
],
[
1,
0,
1,
1,
1,
1,
1,
1,
1
]
],
"n": 9,
"solution": [
[
0,
0,
1,
2,
2,
2,
1,
2,
3
],
[
1,
1,
2,
2,
1,
1,
0,
1,
2
],
[
0,
0,
1,
1,
0,
0,
1,
2,
3
],
[
1,
1,
2,
1,
1,
1,
2,
1,
2
],
[
2,
1,
1,
0,
0,
1,
1,
0,
1
],
[
1,
0,
1,
1,
1,
2,
2,
1,
0
],
[
1,
1,
1,
1,
0,
1,
2,
2,
1
],
[
0,
1,
0,
1,
1,
2,
2,
1,
0
],
[
1,
0,
1,
2,
2,
3,
3,
2,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 58
} |
reasoning_gym_binary_matrix_I5kiVz8K | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 1 1 1 1 1 1
1 1 1 1 1 0 0 1 1
0 1 1 1 1 1 1 0 1
1 1 0 1 1 1 1 1 0
1 1 0 1 1 0 0 1 1
1 1 1 0 1 1 1 1 1
1 1 1 0 1 1 1 1 0
1 1 1 1 1 1 1 1 1
0 0 1 1 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 3 3 3 2 1 1 2 3\n1 2 2 2 1 0 0 1 2\n0 1 1 2 2 1 1 0 1\n1 1 0 1 2 1 1 1 0\n2 1 0 1 1 0 0 1 1\n3 2 1 0 1 1 1 2 1\n2 2 1 0 1 2 2 1 0\n1 1 2 1 2 3 3 2 1\n0 0 1 2 3 4 4 3 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 1 1 1 1 1 1\n1 1 1 1 1 0 0 1 1\n0 1 1 1 1 1 1 0 1\n1 1 0 1 1 1 1 1 0\n1 1 0 1 1 0 0 1 1\n1 1 1 0 1 1 1 1 1\n1 1 1 0 1 1 1 1 0\n1 1 1 1 1 1 1 1 1\n0 0 1 1 1 1 1 1 1\n", "answer": "2 3 3 3 2 1 1 2 3\n1 2 2 2 1 0 0 1 2\n0 1 1 2 2 1 1 0 1\n1 1 0 1 2 1 1 1 0\n2 1 0 1 1 0 0 1 1\n3 2 1 0 1 1 1 2 1\n2 2 1 0 1 2 2 1 0\n1 1 2 1 2 3 3 2 1\n0 0 1 2 3 4 4 3 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 59, "matrix": [[1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 0, 0, 1, 1], [0, 1, 1, 1, 1, 1, 1, 0, 1], [1, 1, 0, 1, 1, 1, 1, 1, 0], [1, 1, 0, 1, 1, 0, 0, 1, 1], [1, 1, 1, 0, 1, 1, 1, 1, 1], [1, 1, 1, 0, 1, 1, 1, 1, 0], [1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 1, 1, 1, 1, 1, 1, 1]], "solution": [[2, 3, 3, 3, 2, 1, 1, 2, 3], [1, 2, 2, 2, 1, 0, 0, 1, 2], [0, 1, 1, 2, 2, 1, 1, 0, 1], [1, 1, 0, 1, 2, 1, 1, 1, 0], [2, 1, 0, 1, 1, 0, 0, 1, 1], [3, 2, 1, 0, 1, 1, 1, 2, 1], [2, 2, 1, 0, 1, 2, 2, 1, 0], [1, 1, 2, 1, 2, 3, 3, 2, 1], [0, 0, 1, 2, 3, 4, 4, 3, 2]], "n": 9, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
0,
0,
1,
1
],
[
0,
1,
1,
1,
1,
1,
1,
0,
1
],
[
1,
1,
0,
1,
1,
1,
1,
1,
0
],
[
1,
1,
0,
1,
1,
0,
0,
1,
1
],
[
1,
1,
1,
0,
1,
1,
1,
1,
1
],
[
1,
1,
1,
0,
1,
1,
1,
1,
0
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
0,
0,
1,
1,
1,
1,
1,
1,
1
]
],
"n": 9,
"solution": [
[
2,
3,
3,
3,
2,
1,
1,
2,
3
],
[
1,
2,
2,
2,
1,
0,
0,
1,
2
],
[
0,
1,
1,
2,
2,
1,
1,
0,
1
],
[
1,
1,
0,
1,
2,
1,
1,
1,
0
],
[
2,
1,
0,
1,
1,
0,
0,
1,
1
],
[
3,
2,
1,
0,
1,
1,
1,
2,
1
],
[
2,
2,
1,
0,
1,
2,
2,
1,
0
],
[
1,
1,
2,
1,
2,
3,
3,
2,
1
],
[
0,
0,
1,
2,
3,
4,
4,
3,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 59
} |
reasoning_gym_binary_matrix_2WCtqUKW | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 0 1 1 0 0 1 1 1
1 1 1 0 1 1 0 0 1 1
0 0 0 0 0 0 1 1 1 1
1 1 1 1 0 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
1 1 1 0 1 0 1 0 1 0
1 1 1 1 1 1 0 1 1 0
1 1 0 0 0 0 0 1 1 1
1 1 0 1 0 1 1 0 1 1
1 1 1 1 1 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 0 1 1 0 0 1 2 3\n1 1 1 0 1 1 0 0 1 2\n0 0 0 0 0 0 1 1 2 3\n1 1 1 1 0 1 2 2 3 2\n2 2 2 1 1 1 2 1 2 1\n3 2 1 0 1 0 1 0 1 0\n3 2 1 1 1 1 0 1 1 0\n2 1 0 0 0 0 0 1 2 1\n2 1 0 1 0 1 1 0 1 2\n3 2 1 2 1 2 2 1 2 3", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 0 1 1 0 0 1 1 1\n1 1 1 0 1 1 0 0 1 1\n0 0 0 0 0 0 1 1 1 1\n1 1 1 1 0 1 1 1 1 1\n1 1 1 1 1 1 1 1 1 1\n1 1 1 0 1 0 1 0 1 0\n1 1 1 1 1 1 0 1 1 0\n1 1 0 0 0 0 0 1 1 1\n1 1 0 1 0 1 1 0 1 1\n1 1 1 1 1 1 1 1 1 1\n", "answer": "0 1 0 1 1 0 0 1 2 3\n1 1 1 0 1 1 0 0 1 2\n0 0 0 0 0 0 1 1 2 3\n1 1 1 1 0 1 2 2 3 2\n2 2 2 1 1 1 2 1 2 1\n3 2 1 0 1 0 1 0 1 0\n3 2 1 1 1 1 0 1 1 0\n2 1 0 0 0 0 0 1 2 1\n2 1 0 1 0 1 1 0 1 2\n3 2 1 2 1 2 2 1 2 3", "metadata": {"source_dataset": "binary_matrix", "source_index": 60, "matrix": [[0, 1, 0, 1, 1, 0, 0, 1, 1, 1], [1, 1, 1, 0, 1, 1, 0, 0, 1, 1], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [1, 1, 1, 1, 0, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 0, 1, 0, 1, 0, 1, 0], [1, 1, 1, 1, 1, 1, 0, 1, 1, 0], [1, 1, 0, 0, 0, 0, 0, 1, 1, 1], [1, 1, 0, 1, 0, 1, 1, 0, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], "solution": [[0, 1, 0, 1, 1, 0, 0, 1, 2, 3], [1, 1, 1, 0, 1, 1, 0, 0, 1, 2], [0, 0, 0, 0, 0, 0, 1, 1, 2, 3], [1, 1, 1, 1, 0, 1, 2, 2, 3, 2], [2, 2, 2, 1, 1, 1, 2, 1, 2, 1], [3, 2, 1, 0, 1, 0, 1, 0, 1, 0], [3, 2, 1, 1, 1, 1, 0, 1, 1, 0], [2, 1, 0, 0, 0, 0, 0, 1, 2, 1], [2, 1, 0, 1, 0, 1, 1, 0, 1, 2], [3, 2, 1, 2, 1, 2, 2, 1, 2, 3]], "n": 10, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
0,
1,
1,
0,
0,
1,
1,
1
],
[
1,
1,
1,
0,
1,
1,
0,
0,
1,
1
],
[
0,
0,
0,
0,
0,
0,
1,
1,
1,
1
],
[
1,
1,
1,
1,
0,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
0,
1,
0,
1,
0,
1,
0
],
[
1,
1,
1,
1,
1,
1,
0,
1,
1,
0
],
[
1,
1,
0,
0,
0,
0,
0,
1,
1,
1
],
[
1,
1,
0,
1,
0,
1,
1,
0,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
]
],
"n": 10,
"solution": [
[
0,
1,
0,
1,
1,
0,
0,
1,
2,
3
],
[
1,
1,
1,
0,
1,
1,
0,
0,
1,
2
],
[
0,
0,
0,
0,
0,
0,
1,
1,
2,
3
],
[
1,
1,
1,
1,
0,
1,
2,
2,
3,
2
],
[
2,
2,
2,
1,
1,
1,
2,
1,
2,
1
],
[
3,
2,
1,
0,
1,
0,
1,
0,
1,
0
],
[
3,
2,
1,
1,
1,
1,
0,
1,
1,
0
],
[
2,
1,
0,
0,
0,
0,
0,
1,
2,
1
],
[
2,
1,
0,
1,
0,
1,
1,
0,
1,
2
],
[
3,
2,
1,
2,
1,
2,
2,
1,
2,
3
]
],
"source_dataset": "binary_matrix",
"source_index": 60
} |
reasoning_gym_binary_matrix_Y0IAeM0N | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 0 1 1 0 1 1 0 1
1 1 1 0 1 1 0 0 1 0
1 1 1 1 1 1 1 1 0 0
0 1 1 1 1 1 1 0 1 1
1 1 1 0 1 1 1 1 1 1
1 0 0 1 1 1 1 1 1 1
1 1 1 1 0 0 1 1 1 1
0 1 1 1 0 1 1 0 1 1
1 1 0 1 0 1 1 1 1 0
1 1 1 1 0 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 0 1 1 0 1 1 0 1\n2 1 1 0 1 1 0 0 1 0\n1 2 2 1 2 2 1 1 0 0\n0 1 2 1 2 2 1 0 1 1\n1 1 1 0 1 2 2 1 2 2\n1 0 0 1 1 1 2 2 3 3\n1 1 1 1 0 0 1 1 2 2\n0 1 1 1 0 1 1 0 1 1\n1 1 0 1 0 1 2 1 1 0\n2 2 1 1 0 1 2 2 2 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 0 1 1 0 1 1 0 1\n1 1 1 0 1 1 0 0 1 0\n1 1 1 1 1 1 1 1 0 0\n0 1 1 1 1 1 1 0 1 1\n1 1 1 0 1 1 1 1 1 1\n1 0 0 1 1 1 1 1 1 1\n1 1 1 1 0 0 1 1 1 1\n0 1 1 1 0 1 1 0 1 1\n1 1 0 1 0 1 1 1 1 0\n1 1 1 1 0 1 1 1 1 1\n", "answer": "1 0 0 1 1 0 1 1 0 1\n2 1 1 0 1 1 0 0 1 0\n1 2 2 1 2 2 1 1 0 0\n0 1 2 1 2 2 1 0 1 1\n1 1 1 0 1 2 2 1 2 2\n1 0 0 1 1 1 2 2 3 3\n1 1 1 1 0 0 1 1 2 2\n0 1 1 1 0 1 1 0 1 1\n1 1 0 1 0 1 2 1 1 0\n2 2 1 1 0 1 2 2 2 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 61, "matrix": [[1, 0, 0, 1, 1, 0, 1, 1, 0, 1], [1, 1, 1, 0, 1, 1, 0, 0, 1, 0], [1, 1, 1, 1, 1, 1, 1, 1, 0, 0], [0, 1, 1, 1, 1, 1, 1, 0, 1, 1], [1, 1, 1, 0, 1, 1, 1, 1, 1, 1], [1, 0, 0, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 0, 0, 1, 1, 1, 1], [0, 1, 1, 1, 0, 1, 1, 0, 1, 1], [1, 1, 0, 1, 0, 1, 1, 1, 1, 0], [1, 1, 1, 1, 0, 1, 1, 1, 1, 1]], "solution": [[1, 0, 0, 1, 1, 0, 1, 1, 0, 1], [2, 1, 1, 0, 1, 1, 0, 0, 1, 0], [1, 2, 2, 1, 2, 2, 1, 1, 0, 0], [0, 1, 2, 1, 2, 2, 1, 0, 1, 1], [1, 1, 1, 0, 1, 2, 2, 1, 2, 2], [1, 0, 0, 1, 1, 1, 2, 2, 3, 3], [1, 1, 1, 1, 0, 0, 1, 1, 2, 2], [0, 1, 1, 1, 0, 1, 1, 0, 1, 1], [1, 1, 0, 1, 0, 1, 2, 1, 1, 0], [2, 2, 1, 1, 0, 1, 2, 2, 2, 1]], "n": 10, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
0,
1,
1,
0,
1,
1,
0,
1
],
[
1,
1,
1,
0,
1,
1,
0,
0,
1,
0
],
[
1,
1,
1,
1,
1,
1,
1,
1,
0,
0
],
[
0,
1,
1,
1,
1,
1,
1,
0,
1,
1
],
[
1,
1,
1,
0,
1,
1,
1,
1,
1,
1
],
[
1,
0,
0,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
0,
0,
1,
1,
1,
1
],
[
0,
1,
1,
1,
0,
1,
1,
0,
1,
1
],
[
1,
1,
0,
1,
0,
1,
1,
1,
1,
0
],
[
1,
1,
1,
1,
0,
1,
1,
1,
1,
1
]
],
"n": 10,
"solution": [
[
1,
0,
0,
1,
1,
0,
1,
1,
0,
1
],
[
2,
1,
1,
0,
1,
1,
0,
0,
1,
0
],
[
1,
2,
2,
1,
2,
2,
1,
1,
0,
0
],
[
0,
1,
2,
1,
2,
2,
1,
0,
1,
1
],
[
1,
1,
1,
0,
1,
2,
2,
1,
2,
2
],
[
1,
0,
0,
1,
1,
1,
2,
2,
3,
3
],
[
1,
1,
1,
1,
0,
0,
1,
1,
2,
2
],
[
0,
1,
1,
1,
0,
1,
1,
0,
1,
1
],
[
1,
1,
0,
1,
0,
1,
2,
1,
1,
0
],
[
2,
2,
1,
1,
0,
1,
2,
2,
2,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 61
} |
reasoning_gym_binary_matrix_wpYvKdXT | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 1 1 0 0 1 1 1 0
1 1 0 1 1 1 1 0 0 0
0 1 0 1 1 1 1 0 0 1
0 1 1 1 1 1 0 1 0 1
1 1 1 1 1 1 1 1 1 0
0 1 1 1 1 0 1 1 1 0
1 1 1 1 1 1 1 1 0 1
1 0 1 0 1 1 1 1 1 1
0 0 1 1 0 1 1 1 0 1
0 1 1 1 0 0 1 0 0 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 1 1 0 0 1 1 1 0\n1 1 0 1 1 1 1 0 0 0\n0 1 0 1 2 2 1 0 0 1\n0 1 1 2 2 1 0 1 0 1\n1 2 2 3 2 1 1 2 1 0\n0 1 2 2 1 0 1 2 1 0\n1 1 2 1 2 1 2 1 0 1\n1 0 1 0 1 2 3 2 1 2\n0 0 1 1 0 1 2 1 0 1\n0 1 2 1 0 0 1 0 0 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 1 1 0 0 1 1 1 0\n1 1 0 1 1 1 1 0 0 0\n0 1 0 1 1 1 1 0 0 1\n0 1 1 1 1 1 0 1 0 1\n1 1 1 1 1 1 1 1 1 0\n0 1 1 1 1 0 1 1 1 0\n1 1 1 1 1 1 1 1 0 1\n1 0 1 0 1 1 1 1 1 1\n0 0 1 1 0 1 1 1 0 1\n0 1 1 1 0 0 1 0 0 1\n", "answer": "0 1 1 1 0 0 1 1 1 0\n1 1 0 1 1 1 1 0 0 0\n0 1 0 1 2 2 1 0 0 1\n0 1 1 2 2 1 0 1 0 1\n1 2 2 3 2 1 1 2 1 0\n0 1 2 2 1 0 1 2 1 0\n1 1 2 1 2 1 2 1 0 1\n1 0 1 0 1 2 3 2 1 2\n0 0 1 1 0 1 2 1 0 1\n0 1 2 1 0 0 1 0 0 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 62, "matrix": [[0, 1, 1, 1, 0, 0, 1, 1, 1, 0], [1, 1, 0, 1, 1, 1, 1, 0, 0, 0], [0, 1, 0, 1, 1, 1, 1, 0, 0, 1], [0, 1, 1, 1, 1, 1, 0, 1, 0, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 0], [0, 1, 1, 1, 1, 0, 1, 1, 1, 0], [1, 1, 1, 1, 1, 1, 1, 1, 0, 1], [1, 0, 1, 0, 1, 1, 1, 1, 1, 1], [0, 0, 1, 1, 0, 1, 1, 1, 0, 1], [0, 1, 1, 1, 0, 0, 1, 0, 0, 1]], "solution": [[0, 1, 1, 1, 0, 0, 1, 1, 1, 0], [1, 1, 0, 1, 1, 1, 1, 0, 0, 0], [0, 1, 0, 1, 2, 2, 1, 0, 0, 1], [0, 1, 1, 2, 2, 1, 0, 1, 0, 1], [1, 2, 2, 3, 2, 1, 1, 2, 1, 0], [0, 1, 2, 2, 1, 0, 1, 2, 1, 0], [1, 1, 2, 1, 2, 1, 2, 1, 0, 1], [1, 0, 1, 0, 1, 2, 3, 2, 1, 2], [0, 0, 1, 1, 0, 1, 2, 1, 0, 1], [0, 1, 2, 1, 0, 0, 1, 0, 0, 1]], "n": 10, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
1,
1,
0,
0,
1,
1,
1,
0
],
[
1,
1,
0,
1,
1,
1,
1,
0,
0,
0
],
[
0,
1,
0,
1,
1,
1,
1,
0,
0,
1
],
[
0,
1,
1,
1,
1,
1,
0,
1,
0,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1,
0
],
[
0,
1,
1,
1,
1,
0,
1,
1,
1,
0
],
[
1,
1,
1,
1,
1,
1,
1,
1,
0,
1
],
[
1,
0,
1,
0,
1,
1,
1,
1,
1,
1
],
[
0,
0,
1,
1,
0,
1,
1,
1,
0,
1
],
[
0,
1,
1,
1,
0,
0,
1,
0,
0,
1
]
],
"n": 10,
"solution": [
[
0,
1,
1,
1,
0,
0,
1,
1,
1,
0
],
[
1,
1,
0,
1,
1,
1,
1,
0,
0,
0
],
[
0,
1,
0,
1,
2,
2,
1,
0,
0,
1
],
[
0,
1,
1,
2,
2,
1,
0,
1,
0,
1
],
[
1,
2,
2,
3,
2,
1,
1,
2,
1,
0
],
[
0,
1,
2,
2,
1,
0,
1,
2,
1,
0
],
[
1,
1,
2,
1,
2,
1,
2,
1,
0,
1
],
[
1,
0,
1,
0,
1,
2,
3,
2,
1,
2
],
[
0,
0,
1,
1,
0,
1,
2,
1,
0,
1
],
[
0,
1,
2,
1,
0,
0,
1,
0,
0,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 62
} |
reasoning_gym_binary_matrix_ZxHPhavL | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 1 1 1 1 1
0 1 1 1 1 0 1 1
1 1 0 1 1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1 1 0 1 0
0 1 1 0 1 0 1 1
1 1 1 0 0 1 0 0
1 0 1 1 0 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 2 2 3 2 1 2 3\n0 1 1 2 1 0 1 2\n1 1 0 1 2 1 2 2\n2 2 1 2 2 1 2 1\n1 2 2 1 1 0 1 0\n0 1 1 0 1 0 1 1\n1 1 1 0 0 1 0 0\n1 0 1 1 0 1 1 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 1 1 1 1 1\n0 1 1 1 1 0 1 1\n1 1 0 1 1 1 1 1\n1 1 1 1 1 1 1 1\n1 1 1 1 1 0 1 0\n0 1 1 0 1 0 1 1\n1 1 1 0 0 1 0 0\n1 0 1 1 0 1 1 1\n", "answer": "1 2 2 3 2 1 2 3\n0 1 1 2 1 0 1 2\n1 1 0 1 2 1 2 2\n2 2 1 2 2 1 2 1\n1 2 2 1 1 0 1 0\n0 1 1 0 1 0 1 1\n1 1 1 0 0 1 0 0\n1 0 1 1 0 1 1 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 63, "matrix": [[1, 1, 1, 1, 1, 1, 1, 1], [0, 1, 1, 1, 1, 0, 1, 1], [1, 1, 0, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 0, 1, 0], [0, 1, 1, 0, 1, 0, 1, 1], [1, 1, 1, 0, 0, 1, 0, 0], [1, 0, 1, 1, 0, 1, 1, 1]], "solution": [[1, 2, 2, 3, 2, 1, 2, 3], [0, 1, 1, 2, 1, 0, 1, 2], [1, 1, 0, 1, 2, 1, 2, 2], [2, 2, 1, 2, 2, 1, 2, 1], [1, 2, 2, 1, 1, 0, 1, 0], [0, 1, 1, 0, 1, 0, 1, 1], [1, 1, 1, 0, 0, 1, 0, 0], [1, 0, 1, 1, 0, 1, 1, 1]], "n": 8, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
1,
1,
1,
1,
1
],
[
0,
1,
1,
1,
1,
0,
1,
1
],
[
1,
1,
0,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
0,
1,
0
],
[
0,
1,
1,
0,
1,
0,
1,
1
],
[
1,
1,
1,
0,
0,
1,
0,
0
],
[
1,
0,
1,
1,
0,
1,
1,
1
]
],
"n": 8,
"solution": [
[
1,
2,
2,
3,
2,
1,
2,
3
],
[
0,
1,
1,
2,
1,
0,
1,
2
],
[
1,
1,
0,
1,
2,
1,
2,
2
],
[
2,
2,
1,
2,
2,
1,
2,
1
],
[
1,
2,
2,
1,
1,
0,
1,
0
],
[
0,
1,
1,
0,
1,
0,
1,
1
],
[
1,
1,
1,
0,
0,
1,
0,
0
],
[
1,
0,
1,
1,
0,
1,
1,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 63
} |
reasoning_gym_binary_matrix_OuPoiAnz | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 0 0 1 1
1 1 1 1 1
0 1 0 1 0
0 1 1 1 0
1 1 0 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 0 0 1 2\n1 1 1 2 1\n0 1 0 1 0\n0 1 1 1 0\n1 1 0 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 0 0 1 1\n1 1 1 1 1\n0 1 0 1 0\n0 1 1 1 0\n1 1 0 1 0\n", "answer": "0 0 0 1 2\n1 1 1 2 1\n0 1 0 1 0\n0 1 1 1 0\n1 1 0 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 64, "matrix": [[0, 0, 0, 1, 1], [1, 1, 1, 1, 1], [0, 1, 0, 1, 0], [0, 1, 1, 1, 0], [1, 1, 0, 1, 0]], "solution": [[0, 0, 0, 1, 2], [1, 1, 1, 2, 1], [0, 1, 0, 1, 0], [0, 1, 1, 1, 0], [1, 1, 0, 1, 0]], "n": 5, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
0,
0,
1,
1
],
[
1,
1,
1,
1,
1
],
[
0,
1,
0,
1,
0
],
[
0,
1,
1,
1,
0
],
[
1,
1,
0,
1,
0
]
],
"n": 5,
"solution": [
[
0,
0,
0,
1,
2
],
[
1,
1,
1,
2,
1
],
[
0,
1,
0,
1,
0
],
[
0,
1,
1,
1,
0
],
[
1,
1,
0,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 64
} |
reasoning_gym_binary_matrix_A36q9rZV | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 1
1 1 1 0
0 1 1 1
0 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 1\n1 1 1 0\n0 1 2 1\n0 1 2 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 1\n1 1 1 0\n0 1 1 1\n0 1 1 1\n", "answer": "1 0 1 1\n1 1 1 0\n0 1 2 1\n0 1 2 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 65, "matrix": [[1, 0, 1, 1], [1, 1, 1, 0], [0, 1, 1, 1], [0, 1, 1, 1]], "solution": [[1, 0, 1, 1], [1, 1, 1, 0], [0, 1, 2, 1], [0, 1, 2, 2]], "n": 4, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
1
],
[
1,
1,
1,
0
],
[
0,
1,
1,
1
],
[
0,
1,
1,
1
]
],
"n": 4,
"solution": [
[
1,
0,
1,
1
],
[
1,
1,
1,
0
],
[
0,
1,
2,
1
],
[
0,
1,
2,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 65
} |
reasoning_gym_binary_matrix_bCm66YLS | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 1 1 1
1 1 1 1 1 0
1 0 1 1 0 1
1 0 0 1 1 1
1 1 1 1 1 1
0 1 0 0 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 2 2 1\n2 1 2 2 1 0\n1 0 1 1 0 1\n1 0 0 1 1 2\n1 1 1 1 2 3\n0 1 0 0 1 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 1 1 1\n1 1 1 1 1 0\n1 0 1 1 0 1\n1 0 0 1 1 1\n1 1 1 1 1 1\n0 1 0 0 1 1\n", "answer": "1 0 1 2 2 1\n2 1 2 2 1 0\n1 0 1 1 0 1\n1 0 0 1 1 2\n1 1 1 1 2 3\n0 1 0 0 1 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 66, "matrix": [[1, 0, 1, 1, 1, 1], [1, 1, 1, 1, 1, 0], [1, 0, 1, 1, 0, 1], [1, 0, 0, 1, 1, 1], [1, 1, 1, 1, 1, 1], [0, 1, 0, 0, 1, 1]], "solution": [[1, 0, 1, 2, 2, 1], [2, 1, 2, 2, 1, 0], [1, 0, 1, 1, 0, 1], [1, 0, 0, 1, 1, 2], [1, 1, 1, 1, 2, 3], [0, 1, 0, 0, 1, 2]], "n": 6, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
0
],
[
1,
0,
1,
1,
0,
1
],
[
1,
0,
0,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1
],
[
0,
1,
0,
0,
1,
1
]
],
"n": 6,
"solution": [
[
1,
0,
1,
2,
2,
1
],
[
2,
1,
2,
2,
1,
0
],
[
1,
0,
1,
1,
0,
1
],
[
1,
0,
0,
1,
1,
2
],
[
1,
1,
1,
1,
2,
3
],
[
0,
1,
0,
0,
1,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 66
} |
reasoning_gym_binary_matrix_668dgEl8 | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 0 1
1 1 1
1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 0 1\n1 1 2\n2 2 3", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 0 1\n1 1 1\n1 1 1\n", "answer": "0 0 1\n1 1 2\n2 2 3", "metadata": {"source_dataset": "binary_matrix", "source_index": 67, "matrix": [[0, 0, 1], [1, 1, 1], [1, 1, 1]], "solution": [[0, 0, 1], [1, 1, 2], [2, 2, 3]], "n": 3, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
0,
1
],
[
1,
1,
1
],
[
1,
1,
1
]
],
"n": 3,
"solution": [
[
0,
0,
1
],
[
1,
1,
2
],
[
2,
2,
3
]
],
"source_dataset": "binary_matrix",
"source_index": 67
} |
reasoning_gym_binary_matrix_FIQKI9x2 | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 0
0 1 0 1
0 1 1 1
1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 2 1 0\n0 1 0 1\n0 1 1 2\n1 2 2 3", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 0\n0 1 0 1\n0 1 1 1\n1 1 1 1\n", "answer": "1 2 1 0\n0 1 0 1\n0 1 1 2\n1 2 2 3", "metadata": {"source_dataset": "binary_matrix", "source_index": 68, "matrix": [[1, 1, 1, 0], [0, 1, 0, 1], [0, 1, 1, 1], [1, 1, 1, 1]], "solution": [[1, 2, 1, 0], [0, 1, 0, 1], [0, 1, 1, 2], [1, 2, 2, 3]], "n": 4, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
0
],
[
0,
1,
0,
1
],
[
0,
1,
1,
1
],
[
1,
1,
1,
1
]
],
"n": 4,
"solution": [
[
1,
2,
1,
0
],
[
0,
1,
0,
1
],
[
0,
1,
1,
2
],
[
1,
2,
2,
3
]
],
"source_dataset": "binary_matrix",
"source_index": 68
} |
reasoning_gym_binary_matrix_R0rICXqC | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 1 1 1 1 1 1 1 1
0 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 0
1 1 1 0 1 0 1 1 1 1
0 0 0 0 1 1 1 0 0 0
1 1 1 1 1 1 1 1 1 1
1 1 1 0 0 1 0 1 0 1
1 1 1 1 0 0 1 1 1 0
1 1 1 0 1 1 1 1 1 1
0 0 1 1 1 0 0 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 2 3 4 3 4 4 3 2\n0 1 2 2 3 2 3 3 2 1\n1 2 2 1 2 1 2 2 1 0\n1 1 1 0 1 0 1 1 1 1\n0 0 0 0 1 1 1 0 0 0\n1 1 1 1 1 2 1 1 1 1\n2 2 1 0 0 1 0 1 0 1\n2 2 2 1 0 0 1 2 1 0\n1 1 1 0 1 1 1 2 2 1\n0 0 1 1 1 0 0 1 2 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 1 1 1 1 1 1 1 1\n0 1 1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 1 0\n1 1 1 0 1 0 1 1 1 1\n0 0 0 0 1 1 1 0 0 0\n1 1 1 1 1 1 1 1 1 1\n1 1 1 0 0 1 0 1 0 1\n1 1 1 1 0 0 1 1 1 0\n1 1 1 0 1 1 1 1 1 1\n0 0 1 1 1 0 0 1 1 1\n", "answer": "0 1 2 3 4 3 4 4 3 2\n0 1 2 2 3 2 3 3 2 1\n1 2 2 1 2 1 2 2 1 0\n1 1 1 0 1 0 1 1 1 1\n0 0 0 0 1 1 1 0 0 0\n1 1 1 1 1 2 1 1 1 1\n2 2 1 0 0 1 0 1 0 1\n2 2 2 1 0 0 1 2 1 0\n1 1 1 0 1 1 1 2 2 1\n0 0 1 1 1 0 0 1 2 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 69, "matrix": [[0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 0], [1, 1, 1, 0, 1, 0, 1, 1, 1, 1], [0, 0, 0, 0, 1, 1, 1, 0, 0, 0], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 0, 0, 1, 0, 1, 0, 1], [1, 1, 1, 1, 0, 0, 1, 1, 1, 0], [1, 1, 1, 0, 1, 1, 1, 1, 1, 1], [0, 0, 1, 1, 1, 0, 0, 1, 1, 1]], "solution": [[0, 1, 2, 3, 4, 3, 4, 4, 3, 2], [0, 1, 2, 2, 3, 2, 3, 3, 2, 1], [1, 2, 2, 1, 2, 1, 2, 2, 1, 0], [1, 1, 1, 0, 1, 0, 1, 1, 1, 1], [0, 0, 0, 0, 1, 1, 1, 0, 0, 0], [1, 1, 1, 1, 1, 2, 1, 1, 1, 1], [2, 2, 1, 0, 0, 1, 0, 1, 0, 1], [2, 2, 2, 1, 0, 0, 1, 2, 1, 0], [1, 1, 1, 0, 1, 1, 1, 2, 2, 1], [0, 0, 1, 1, 1, 0, 0, 1, 2, 2]], "n": 10, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
0,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1,
0
],
[
1,
1,
1,
0,
1,
0,
1,
1,
1,
1
],
[
0,
0,
0,
0,
1,
1,
1,
0,
0,
0
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
0,
0,
1,
0,
1,
0,
1
],
[
1,
1,
1,
1,
0,
0,
1,
1,
1,
0
],
[
1,
1,
1,
0,
1,
1,
1,
1,
1,
1
],
[
0,
0,
1,
1,
1,
0,
0,
1,
1,
1
]
],
"n": 10,
"solution": [
[
0,
1,
2,
3,
4,
3,
4,
4,
3,
2
],
[
0,
1,
2,
2,
3,
2,
3,
3,
2,
1
],
[
1,
2,
2,
1,
2,
1,
2,
2,
1,
0
],
[
1,
1,
1,
0,
1,
0,
1,
1,
1,
1
],
[
0,
0,
0,
0,
1,
1,
1,
0,
0,
0
],
[
1,
1,
1,
1,
1,
2,
1,
1,
1,
1
],
[
2,
2,
1,
0,
0,
1,
0,
1,
0,
1
],
[
2,
2,
2,
1,
0,
0,
1,
2,
1,
0
],
[
1,
1,
1,
0,
1,
1,
1,
2,
2,
1
],
[
0,
0,
1,
1,
1,
0,
0,
1,
2,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 69
} |
reasoning_gym_binary_matrix_rRVcN1m2 | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0 0 1
1 1 1 1 1
1 1 1 0 1
0 0 0 0 1
1 0 0 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 0 0 1\n2 2 1 1 2\n1 1 1 0 1\n0 0 0 0 1\n1 0 0 1 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0 0 1\n1 1 1 1 1\n1 1 1 0 1\n0 0 0 0 1\n1 0 0 1 1\n", "answer": "2 1 0 0 1\n2 2 1 1 2\n1 1 1 0 1\n0 0 0 0 1\n1 0 0 1 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 70, "matrix": [[1, 1, 0, 0, 1], [1, 1, 1, 1, 1], [1, 1, 1, 0, 1], [0, 0, 0, 0, 1], [1, 0, 0, 1, 1]], "solution": [[2, 1, 0, 0, 1], [2, 2, 1, 1, 2], [1, 1, 1, 0, 1], [0, 0, 0, 0, 1], [1, 0, 0, 1, 2]], "n": 5, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0,
0,
1
],
[
1,
1,
1,
1,
1
],
[
1,
1,
1,
0,
1
],
[
0,
0,
0,
0,
1
],
[
1,
0,
0,
1,
1
]
],
"n": 5,
"solution": [
[
2,
1,
0,
0,
1
],
[
2,
2,
1,
1,
2
],
[
1,
1,
1,
0,
1
],
[
0,
0,
0,
0,
1
],
[
1,
0,
0,
1,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 70
} |
reasoning_gym_binary_matrix_RdALjrxt | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 0 1 1
1 1 0 1
1 1 1 1
1 1 0 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 0 1 2\n1 1 0 1\n2 2 1 1\n2 1 0 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 0 1 1\n1 1 0 1\n1 1 1 1\n1 1 0 0\n", "answer": "0 0 1 2\n1 1 0 1\n2 2 1 1\n2 1 0 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 71, "matrix": [[0, 0, 1, 1], [1, 1, 0, 1], [1, 1, 1, 1], [1, 1, 0, 0]], "solution": [[0, 0, 1, 2], [1, 1, 0, 1], [2, 2, 1, 1], [2, 1, 0, 0]], "n": 4, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
0,
1,
1
],
[
1,
1,
0,
1
],
[
1,
1,
1,
1
],
[
1,
1,
0,
0
]
],
"n": 4,
"solution": [
[
0,
0,
1,
2
],
[
1,
1,
0,
1
],
[
2,
2,
1,
1
],
[
2,
1,
0,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 71
} |
reasoning_gym_binary_matrix_5LKOIsdj | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 0 1 1 1 1 1 1
1 1 0 1 1 0 1 0 1 1
0 1 1 1 1 1 1 1 0 1
0 1 1 1 1 1 1 1 1 1
1 1 1 0 1 0 1 0 1 1
1 0 1 1 0 1 1 1 1 1
0 1 1 1 0 0 0 1 1 1
1 1 1 1 1 1 0 0 1 1
1 0 1 1 1 1 1 0 1 0
0 1 0 1 1 0 1 1 0 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 0 1 1 2 1 2 3\n1 1 0 1 1 0 1 0 1 2\n0 1 1 2 2 1 2 1 0 1\n0 1 2 1 2 1 2 1 1 2\n1 1 1 0 1 0 1 0 1 2\n1 0 1 1 0 1 1 1 2 3\n0 1 2 1 0 0 0 1 2 2\n1 1 2 2 1 1 0 0 1 1\n1 0 1 2 2 1 1 0 1 0\n0 1 0 1 1 0 1 1 0 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 0 1 1 1 1 1 1\n1 1 0 1 1 0 1 0 1 1\n0 1 1 1 1 1 1 1 0 1\n0 1 1 1 1 1 1 1 1 1\n1 1 1 0 1 0 1 0 1 1\n1 0 1 1 0 1 1 1 1 1\n0 1 1 1 0 0 0 1 1 1\n1 1 1 1 1 1 0 0 1 1\n1 0 1 1 1 1 1 0 1 0\n0 1 0 1 1 0 1 1 0 1\n", "answer": "1 0 1 0 1 1 2 1 2 3\n1 1 0 1 1 0 1 0 1 2\n0 1 1 2 2 1 2 1 0 1\n0 1 2 1 2 1 2 1 1 2\n1 1 1 0 1 0 1 0 1 2\n1 0 1 1 0 1 1 1 2 3\n0 1 2 1 0 0 0 1 2 2\n1 1 2 2 1 1 0 0 1 1\n1 0 1 2 2 1 1 0 1 0\n0 1 0 1 1 0 1 1 0 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 72, "matrix": [[1, 0, 1, 0, 1, 1, 1, 1, 1, 1], [1, 1, 0, 1, 1, 0, 1, 0, 1, 1], [0, 1, 1, 1, 1, 1, 1, 1, 0, 1], [0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 0, 1, 0, 1, 0, 1, 1], [1, 0, 1, 1, 0, 1, 1, 1, 1, 1], [0, 1, 1, 1, 0, 0, 0, 1, 1, 1], [1, 1, 1, 1, 1, 1, 0, 0, 1, 1], [1, 0, 1, 1, 1, 1, 1, 0, 1, 0], [0, 1, 0, 1, 1, 0, 1, 1, 0, 1]], "solution": [[1, 0, 1, 0, 1, 1, 2, 1, 2, 3], [1, 1, 0, 1, 1, 0, 1, 0, 1, 2], [0, 1, 1, 2, 2, 1, 2, 1, 0, 1], [0, 1, 2, 1, 2, 1, 2, 1, 1, 2], [1, 1, 1, 0, 1, 0, 1, 0, 1, 2], [1, 0, 1, 1, 0, 1, 1, 1, 2, 3], [0, 1, 2, 1, 0, 0, 0, 1, 2, 2], [1, 1, 2, 2, 1, 1, 0, 0, 1, 1], [1, 0, 1, 2, 2, 1, 1, 0, 1, 0], [0, 1, 0, 1, 1, 0, 1, 1, 0, 1]], "n": 10, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
0,
1,
1,
1,
1,
1,
1
],
[
1,
1,
0,
1,
1,
0,
1,
0,
1,
1
],
[
0,
1,
1,
1,
1,
1,
1,
1,
0,
1
],
[
0,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
0,
1,
0,
1,
0,
1,
1
],
[
1,
0,
1,
1,
0,
1,
1,
1,
1,
1
],
[
0,
1,
1,
1,
0,
0,
0,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
0,
0,
1,
1
],
[
1,
0,
1,
1,
1,
1,
1,
0,
1,
0
],
[
0,
1,
0,
1,
1,
0,
1,
1,
0,
1
]
],
"n": 10,
"solution": [
[
1,
0,
1,
0,
1,
1,
2,
1,
2,
3
],
[
1,
1,
0,
1,
1,
0,
1,
0,
1,
2
],
[
0,
1,
1,
2,
2,
1,
2,
1,
0,
1
],
[
0,
1,
2,
1,
2,
1,
2,
1,
1,
2
],
[
1,
1,
1,
0,
1,
0,
1,
0,
1,
2
],
[
1,
0,
1,
1,
0,
1,
1,
1,
2,
3
],
[
0,
1,
2,
1,
0,
0,
0,
1,
2,
2
],
[
1,
1,
2,
2,
1,
1,
0,
0,
1,
1
],
[
1,
0,
1,
2,
2,
1,
1,
0,
1,
0
],
[
0,
1,
0,
1,
1,
0,
1,
1,
0,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 72
} |
reasoning_gym_binary_matrix_RIULxAIy | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 1 1 0
0 1 0 0 1
0 1 1 0 1
1 1 1 1 1
1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 1 1 0\n0 1 0 0 1\n0 1 1 0 1\n1 2 2 1 2\n2 3 3 2 3", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 1 1 0\n0 1 0 0 1\n0 1 1 0 1\n1 1 1 1 1\n1 1 1 1 1\n", "answer": "0 1 1 1 0\n0 1 0 0 1\n0 1 1 0 1\n1 2 2 1 2\n2 3 3 2 3", "metadata": {"source_dataset": "binary_matrix", "source_index": 73, "matrix": [[0, 1, 1, 1, 0], [0, 1, 0, 0, 1], [0, 1, 1, 0, 1], [1, 1, 1, 1, 1], [1, 1, 1, 1, 1]], "solution": [[0, 1, 1, 1, 0], [0, 1, 0, 0, 1], [0, 1, 1, 0, 1], [1, 2, 2, 1, 2], [2, 3, 3, 2, 3]], "n": 5, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
1,
1,
0
],
[
0,
1,
0,
0,
1
],
[
0,
1,
1,
0,
1
],
[
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1
]
],
"n": 5,
"solution": [
[
0,
1,
1,
1,
0
],
[
0,
1,
0,
0,
1
],
[
0,
1,
1,
0,
1
],
[
1,
2,
2,
1,
2
],
[
2,
3,
3,
2,
3
]
],
"source_dataset": "binary_matrix",
"source_index": 73
} |
reasoning_gym_binary_matrix_egIAzrql | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 1 1 1
0 0 0 0 0 1
1 0 1 1 1 1
1 1 1 1 1 1
1 0 1 0 1 1
1 0 1 1 0 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 1 1 2\n0 0 0 0 0 1\n1 0 1 1 1 2\n2 1 2 1 2 3\n1 0 1 0 1 2\n1 0 1 1 0 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 1 1 1\n0 0 0 0 0 1\n1 0 1 1 1 1\n1 1 1 1 1 1\n1 0 1 0 1 1\n1 0 1 1 0 1\n", "answer": "1 0 1 1 1 2\n0 0 0 0 0 1\n1 0 1 1 1 2\n2 1 2 1 2 3\n1 0 1 0 1 2\n1 0 1 1 0 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 74, "matrix": [[1, 0, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1], [1, 0, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1], [1, 0, 1, 0, 1, 1], [1, 0, 1, 1, 0, 1]], "solution": [[1, 0, 1, 1, 1, 2], [0, 0, 0, 0, 0, 1], [1, 0, 1, 1, 1, 2], [2, 1, 2, 1, 2, 3], [1, 0, 1, 0, 1, 2], [1, 0, 1, 1, 0, 1]], "n": 6, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
1,
1,
1
],
[
0,
0,
0,
0,
0,
1
],
[
1,
0,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1
],
[
1,
0,
1,
0,
1,
1
],
[
1,
0,
1,
1,
0,
1
]
],
"n": 6,
"solution": [
[
1,
0,
1,
1,
1,
2
],
[
0,
0,
0,
0,
0,
1
],
[
1,
0,
1,
1,
1,
2
],
[
2,
1,
2,
1,
2,
3
],
[
1,
0,
1,
0,
1,
2
],
[
1,
0,
1,
1,
0,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 74
} |
reasoning_gym_binary_matrix_ATJBSrvv | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 0 1 1 1 1 1 0
1 1 1 0 0 1 0 1
1 1 1 1 0 1 1 1
1 1 1 1 0 0 1 1
1 1 1 1 1 1 0 1
1 0 1 0 1 1 1 1
1 1 1 0 0 0 0 0
1 1 1 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 0 1 1 1 2 1 0\n1 1 1 0 0 1 0 1\n2 2 2 1 0 1 1 2\n3 2 2 1 0 0 1 2\n2 1 2 1 1 1 0 1\n1 0 1 0 1 1 1 1\n2 1 1 0 0 0 0 0\n3 2 2 1 1 1 1 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 0 1 1 1 1 1 0\n1 1 1 0 0 1 0 1\n1 1 1 1 0 1 1 1\n1 1 1 1 0 0 1 1\n1 1 1 1 1 1 0 1\n1 0 1 0 1 1 1 1\n1 1 1 0 0 0 0 0\n1 1 1 1 1 1 1 1\n", "answer": "0 0 1 1 1 2 1 0\n1 1 1 0 0 1 0 1\n2 2 2 1 0 1 1 2\n3 2 2 1 0 0 1 2\n2 1 2 1 1 1 0 1\n1 0 1 0 1 1 1 1\n2 1 1 0 0 0 0 0\n3 2 2 1 1 1 1 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 75, "matrix": [[0, 0, 1, 1, 1, 1, 1, 0], [1, 1, 1, 0, 0, 1, 0, 1], [1, 1, 1, 1, 0, 1, 1, 1], [1, 1, 1, 1, 0, 0, 1, 1], [1, 1, 1, 1, 1, 1, 0, 1], [1, 0, 1, 0, 1, 1, 1, 1], [1, 1, 1, 0, 0, 0, 0, 0], [1, 1, 1, 1, 1, 1, 1, 1]], "solution": [[0, 0, 1, 1, 1, 2, 1, 0], [1, 1, 1, 0, 0, 1, 0, 1], [2, 2, 2, 1, 0, 1, 1, 2], [3, 2, 2, 1, 0, 0, 1, 2], [2, 1, 2, 1, 1, 1, 0, 1], [1, 0, 1, 0, 1, 1, 1, 1], [2, 1, 1, 0, 0, 0, 0, 0], [3, 2, 2, 1, 1, 1, 1, 1]], "n": 8, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
0,
1,
1,
1,
1,
1,
0
],
[
1,
1,
1,
0,
0,
1,
0,
1
],
[
1,
1,
1,
1,
0,
1,
1,
1
],
[
1,
1,
1,
1,
0,
0,
1,
1
],
[
1,
1,
1,
1,
1,
1,
0,
1
],
[
1,
0,
1,
0,
1,
1,
1,
1
],
[
1,
1,
1,
0,
0,
0,
0,
0
],
[
1,
1,
1,
1,
1,
1,
1,
1
]
],
"n": 8,
"solution": [
[
0,
0,
1,
1,
1,
2,
1,
0
],
[
1,
1,
1,
0,
0,
1,
0,
1
],
[
2,
2,
2,
1,
0,
1,
1,
2
],
[
3,
2,
2,
1,
0,
0,
1,
2
],
[
2,
1,
2,
1,
1,
1,
0,
1
],
[
1,
0,
1,
0,
1,
1,
1,
1
],
[
2,
1,
1,
0,
0,
0,
0,
0
],
[
3,
2,
2,
1,
1,
1,
1,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 75
} |
reasoning_gym_binary_matrix_lHj52NeZ | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 1 0 1 0 1
0 1 1 0 1 1 1
1 1 0 1 1 1 1
1 1 1 1 1 1 1
0 0 1 1 1 1 0
0 1 1 1 1 1 0
1 1 0 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 1 0 1 0 1\n0 1 1 0 1 1 2\n1 1 0 1 2 2 2\n1 1 1 2 3 2 1\n0 0 1 2 2 1 0\n0 1 1 2 2 1 0\n1 1 0 1 2 2 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 1 0 1 0 1\n0 1 1 0 1 1 1\n1 1 0 1 1 1 1\n1 1 1 1 1 1 1\n0 0 1 1 1 1 0\n0 1 1 1 1 1 0\n1 1 0 1 1 1 1\n", "answer": "0 1 1 0 1 0 1\n0 1 1 0 1 1 2\n1 1 0 1 2 2 2\n1 1 1 2 3 2 1\n0 0 1 2 2 1 0\n0 1 1 2 2 1 0\n1 1 0 1 2 2 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 76, "matrix": [[0, 1, 1, 0, 1, 0, 1], [0, 1, 1, 0, 1, 1, 1], [1, 1, 0, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1], [0, 0, 1, 1, 1, 1, 0], [0, 1, 1, 1, 1, 1, 0], [1, 1, 0, 1, 1, 1, 1]], "solution": [[0, 1, 1, 0, 1, 0, 1], [0, 1, 1, 0, 1, 1, 2], [1, 1, 0, 1, 2, 2, 2], [1, 1, 1, 2, 3, 2, 1], [0, 0, 1, 2, 2, 1, 0], [0, 1, 1, 2, 2, 1, 0], [1, 1, 0, 1, 2, 2, 1]], "n": 7, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
1,
0,
1,
0,
1
],
[
0,
1,
1,
0,
1,
1,
1
],
[
1,
1,
0,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1
],
[
0,
0,
1,
1,
1,
1,
0
],
[
0,
1,
1,
1,
1,
1,
0
],
[
1,
1,
0,
1,
1,
1,
1
]
],
"n": 7,
"solution": [
[
0,
1,
1,
0,
1,
0,
1
],
[
0,
1,
1,
0,
1,
1,
2
],
[
1,
1,
0,
1,
2,
2,
2
],
[
1,
1,
1,
2,
3,
2,
1
],
[
0,
0,
1,
2,
2,
1,
0
],
[
0,
1,
1,
2,
2,
1,
0
],
[
1,
1,
0,
1,
2,
2,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 76
} |
reasoning_gym_binary_matrix_tNzLKPTB | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0 0 1 0
1 1 1 1 1 1
1 1 1 1 1 1
1 1 0 1 1 0
1 0 1 1 1 1
1 1 1 0 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 0 0 1 0\n3 2 1 1 2 1\n3 2 1 2 2 1\n2 1 0 1 1 0\n1 0 1 1 2 1\n2 1 1 0 1 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0 0 1 0\n1 1 1 1 1 1\n1 1 1 1 1 1\n1 1 0 1 1 0\n1 0 1 1 1 1\n1 1 1 0 1 1\n", "answer": "2 1 0 0 1 0\n3 2 1 1 2 1\n3 2 1 2 2 1\n2 1 0 1 1 0\n1 0 1 1 2 1\n2 1 1 0 1 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 77, "matrix": [[1, 1, 0, 0, 1, 0], [1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1], [1, 1, 0, 1, 1, 0], [1, 0, 1, 1, 1, 1], [1, 1, 1, 0, 1, 1]], "solution": [[2, 1, 0, 0, 1, 0], [3, 2, 1, 1, 2, 1], [3, 2, 1, 2, 2, 1], [2, 1, 0, 1, 1, 0], [1, 0, 1, 1, 2, 1], [2, 1, 1, 0, 1, 2]], "n": 6, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0,
0,
1,
0
],
[
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1
],
[
1,
1,
0,
1,
1,
0
],
[
1,
0,
1,
1,
1,
1
],
[
1,
1,
1,
0,
1,
1
]
],
"n": 6,
"solution": [
[
2,
1,
0,
0,
1,
0
],
[
3,
2,
1,
1,
2,
1
],
[
3,
2,
1,
2,
2,
1
],
[
2,
1,
0,
1,
1,
0
],
[
1,
0,
1,
1,
2,
1
],
[
2,
1,
1,
0,
1,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 77
} |
reasoning_gym_binary_matrix_rwqW0Pg6 | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 1 1
1 1 1 0
1 0 1 1
1 1 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 2 1\n1 1 1 0\n1 0 1 1\n2 1 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 1 1\n1 1 1 0\n1 0 1 1\n1 1 1 0\n", "answer": "0 1 2 1\n1 1 1 0\n1 0 1 1\n2 1 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 78, "matrix": [[0, 1, 1, 1], [1, 1, 1, 0], [1, 0, 1, 1], [1, 1, 1, 0]], "solution": [[0, 1, 2, 1], [1, 1, 1, 0], [1, 0, 1, 1], [2, 1, 1, 0]], "n": 4, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
1,
1
],
[
1,
1,
1,
0
],
[
1,
0,
1,
1
],
[
1,
1,
1,
0
]
],
"n": 4,
"solution": [
[
0,
1,
2,
1
],
[
1,
1,
1,
0
],
[
1,
0,
1,
1
],
[
2,
1,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 78
} |
reasoning_gym_binary_matrix_OasMihGD | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 1 1 1 1
0 0 1 0 1 1 1
1 1 1 1 0 1 1
1 1 0 1 1 1 1
1 0 0 1 1 1 1
0 1 1 1 1 1 1
1 1 1 0 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 1 2 3 4\n0 0 1 0 1 2 3\n1 1 1 1 0 1 2\n2 1 0 1 1 2 3\n1 0 0 1 2 3 4\n0 1 1 1 2 3 4\n1 2 1 0 1 2 3", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 1 1 1 1\n0 0 1 0 1 1 1\n1 1 1 1 0 1 1\n1 1 0 1 1 1 1\n1 0 0 1 1 1 1\n0 1 1 1 1 1 1\n1 1 1 0 1 1 1\n", "answer": "1 0 1 1 2 3 4\n0 0 1 0 1 2 3\n1 1 1 1 0 1 2\n2 1 0 1 1 2 3\n1 0 0 1 2 3 4\n0 1 1 1 2 3 4\n1 2 1 0 1 2 3", "metadata": {"source_dataset": "binary_matrix", "source_index": 79, "matrix": [[1, 0, 1, 1, 1, 1, 1], [0, 0, 1, 0, 1, 1, 1], [1, 1, 1, 1, 0, 1, 1], [1, 1, 0, 1, 1, 1, 1], [1, 0, 0, 1, 1, 1, 1], [0, 1, 1, 1, 1, 1, 1], [1, 1, 1, 0, 1, 1, 1]], "solution": [[1, 0, 1, 1, 2, 3, 4], [0, 0, 1, 0, 1, 2, 3], [1, 1, 1, 1, 0, 1, 2], [2, 1, 0, 1, 1, 2, 3], [1, 0, 0, 1, 2, 3, 4], [0, 1, 1, 1, 2, 3, 4], [1, 2, 1, 0, 1, 2, 3]], "n": 7, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
1,
1,
1,
1
],
[
0,
0,
1,
0,
1,
1,
1
],
[
1,
1,
1,
1,
0,
1,
1
],
[
1,
1,
0,
1,
1,
1,
1
],
[
1,
0,
0,
1,
1,
1,
1
],
[
0,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
0,
1,
1,
1
]
],
"n": 7,
"solution": [
[
1,
0,
1,
1,
2,
3,
4
],
[
0,
0,
1,
0,
1,
2,
3
],
[
1,
1,
1,
1,
0,
1,
2
],
[
2,
1,
0,
1,
1,
2,
3
],
[
1,
0,
0,
1,
2,
3,
4
],
[
0,
1,
1,
1,
2,
3,
4
],
[
1,
2,
1,
0,
1,
2,
3
]
],
"source_dataset": "binary_matrix",
"source_index": 79
} |
reasoning_gym_binary_matrix_eI80gjWv | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 0 1 1 1 0 1
1 0 1 1 1 0 1 1
1 1 1 1 1 1 1 0
1 1 1 1 0 0 0 1
1 1 1 0 1 0 1 1
1 0 1 0 1 1 0 1
1 1 1 0 0 1 1 1
1 1 1 1 0 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 0 1 2 1 0 1\n1 0 1 2 1 0 1 1\n2 1 2 2 1 1 1 0\n3 2 2 1 0 0 0 1\n2 1 1 0 1 0 1 2\n1 0 1 0 1 1 0 1\n2 1 1 0 0 1 1 2\n3 2 2 1 0 1 2 3", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 0 1 1 1 0 1\n1 0 1 1 1 0 1 1\n1 1 1 1 1 1 1 0\n1 1 1 1 0 0 0 1\n1 1 1 0 1 0 1 1\n1 0 1 0 1 1 0 1\n1 1 1 0 0 1 1 1\n1 1 1 1 0 1 1 1\n", "answer": "1 0 0 1 2 1 0 1\n1 0 1 2 1 0 1 1\n2 1 2 2 1 1 1 0\n3 2 2 1 0 0 0 1\n2 1 1 0 1 0 1 2\n1 0 1 0 1 1 0 1\n2 1 1 0 0 1 1 2\n3 2 2 1 0 1 2 3", "metadata": {"source_dataset": "binary_matrix", "source_index": 80, "matrix": [[1, 0, 0, 1, 1, 1, 0, 1], [1, 0, 1, 1, 1, 0, 1, 1], [1, 1, 1, 1, 1, 1, 1, 0], [1, 1, 1, 1, 0, 0, 0, 1], [1, 1, 1, 0, 1, 0, 1, 1], [1, 0, 1, 0, 1, 1, 0, 1], [1, 1, 1, 0, 0, 1, 1, 1], [1, 1, 1, 1, 0, 1, 1, 1]], "solution": [[1, 0, 0, 1, 2, 1, 0, 1], [1, 0, 1, 2, 1, 0, 1, 1], [2, 1, 2, 2, 1, 1, 1, 0], [3, 2, 2, 1, 0, 0, 0, 1], [2, 1, 1, 0, 1, 0, 1, 2], [1, 0, 1, 0, 1, 1, 0, 1], [2, 1, 1, 0, 0, 1, 1, 2], [3, 2, 2, 1, 0, 1, 2, 3]], "n": 8, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
0,
1,
1,
1,
0,
1
],
[
1,
0,
1,
1,
1,
0,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
0
],
[
1,
1,
1,
1,
0,
0,
0,
1
],
[
1,
1,
1,
0,
1,
0,
1,
1
],
[
1,
0,
1,
0,
1,
1,
0,
1
],
[
1,
1,
1,
0,
0,
1,
1,
1
],
[
1,
1,
1,
1,
0,
1,
1,
1
]
],
"n": 8,
"solution": [
[
1,
0,
0,
1,
2,
1,
0,
1
],
[
1,
0,
1,
2,
1,
0,
1,
1
],
[
2,
1,
2,
2,
1,
1,
1,
0
],
[
3,
2,
2,
1,
0,
0,
0,
1
],
[
2,
1,
1,
0,
1,
0,
1,
2
],
[
1,
0,
1,
0,
1,
1,
0,
1
],
[
2,
1,
1,
0,
0,
1,
1,
2
],
[
3,
2,
2,
1,
0,
1,
2,
3
]
],
"source_dataset": "binary_matrix",
"source_index": 80
} |
reasoning_gym_binary_matrix_VgGiILi4 | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 1 0
1 1 1 1 1
1 0 1 1 1
1 1 1 1 1
1 0 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "3 2 2 1 0\n2 1 2 2 1\n1 0 1 2 2\n2 1 2 3 3\n1 0 1 2 3", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 1 0\n1 1 1 1 1\n1 0 1 1 1\n1 1 1 1 1\n1 0 1 1 1\n", "answer": "3 2 2 1 0\n2 1 2 2 1\n1 0 1 2 2\n2 1 2 3 3\n1 0 1 2 3", "metadata": {"source_dataset": "binary_matrix", "source_index": 81, "matrix": [[1, 1, 1, 1, 0], [1, 1, 1, 1, 1], [1, 0, 1, 1, 1], [1, 1, 1, 1, 1], [1, 0, 1, 1, 1]], "solution": [[3, 2, 2, 1, 0], [2, 1, 2, 2, 1], [1, 0, 1, 2, 2], [2, 1, 2, 3, 3], [1, 0, 1, 2, 3]], "n": 5, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
1,
0
],
[
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
1
],
[
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
1
]
],
"n": 5,
"solution": [
[
3,
2,
2,
1,
0
],
[
2,
1,
2,
2,
1
],
[
1,
0,
1,
2,
2
],
[
2,
1,
2,
3,
3
],
[
1,
0,
1,
2,
3
]
],
"source_dataset": "binary_matrix",
"source_index": 81
} |
reasoning_gym_binary_matrix_2NZIjOmz | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1 1 1 1 1 0 1
0 1 1 0 1 0 1 1 0
1 1 1 1 1 1 1 1 1
1 0 1 0 1 1 1 1 0
1 1 1 1 0 1 1 0 1
1 0 1 0 1 1 0 1 1
0 0 1 0 1 1 1 0 1
1 0 1 0 1 1 0 1 1
0 1 1 1 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1 1 2 1 1 0 1\n0 1 1 0 1 0 1 1 0\n1 1 2 1 2 1 2 2 1\n1 0 1 0 1 2 2 1 0\n2 1 2 1 0 1 1 0 1\n1 0 1 0 1 1 0 1 2\n0 0 1 0 1 2 1 0 1\n1 0 1 0 1 1 0 1 2\n0 1 2 1 2 2 1 2 3", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1 1 1 1 1 0 1\n0 1 1 0 1 0 1 1 0\n1 1 1 1 1 1 1 1 1\n1 0 1 0 1 1 1 1 0\n1 1 1 1 0 1 1 0 1\n1 0 1 0 1 1 0 1 1\n0 0 1 0 1 1 1 0 1\n1 0 1 0 1 1 0 1 1\n0 1 1 1 1 1 1 1 1\n", "answer": "1 0 1 1 2 1 1 0 1\n0 1 1 0 1 0 1 1 0\n1 1 2 1 2 1 2 2 1\n1 0 1 0 1 2 2 1 0\n2 1 2 1 0 1 1 0 1\n1 0 1 0 1 1 0 1 2\n0 0 1 0 1 2 1 0 1\n1 0 1 0 1 1 0 1 2\n0 1 2 1 2 2 1 2 3", "metadata": {"source_dataset": "binary_matrix", "source_index": 82, "matrix": [[1, 0, 1, 1, 1, 1, 1, 0, 1], [0, 1, 1, 0, 1, 0, 1, 1, 0], [1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 0, 1, 0, 1, 1, 1, 1, 0], [1, 1, 1, 1, 0, 1, 1, 0, 1], [1, 0, 1, 0, 1, 1, 0, 1, 1], [0, 0, 1, 0, 1, 1, 1, 0, 1], [1, 0, 1, 0, 1, 1, 0, 1, 1], [0, 1, 1, 1, 1, 1, 1, 1, 1]], "solution": [[1, 0, 1, 1, 2, 1, 1, 0, 1], [0, 1, 1, 0, 1, 0, 1, 1, 0], [1, 1, 2, 1, 2, 1, 2, 2, 1], [1, 0, 1, 0, 1, 2, 2, 1, 0], [2, 1, 2, 1, 0, 1, 1, 0, 1], [1, 0, 1, 0, 1, 1, 0, 1, 2], [0, 0, 1, 0, 1, 2, 1, 0, 1], [1, 0, 1, 0, 1, 1, 0, 1, 2], [0, 1, 2, 1, 2, 2, 1, 2, 3]], "n": 9, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1,
1,
1,
1,
1,
0,
1
],
[
0,
1,
1,
0,
1,
0,
1,
1,
0
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
0,
1,
0,
1,
1,
1,
1,
0
],
[
1,
1,
1,
1,
0,
1,
1,
0,
1
],
[
1,
0,
1,
0,
1,
1,
0,
1,
1
],
[
0,
0,
1,
0,
1,
1,
1,
0,
1
],
[
1,
0,
1,
0,
1,
1,
0,
1,
1
],
[
0,
1,
1,
1,
1,
1,
1,
1,
1
]
],
"n": 9,
"solution": [
[
1,
0,
1,
1,
2,
1,
1,
0,
1
],
[
0,
1,
1,
0,
1,
0,
1,
1,
0
],
[
1,
1,
2,
1,
2,
1,
2,
2,
1
],
[
1,
0,
1,
0,
1,
2,
2,
1,
0
],
[
2,
1,
2,
1,
0,
1,
1,
0,
1
],
[
1,
0,
1,
0,
1,
1,
0,
1,
2
],
[
0,
0,
1,
0,
1,
2,
1,
0,
1
],
[
1,
0,
1,
0,
1,
1,
0,
1,
2
],
[
0,
1,
2,
1,
2,
2,
1,
2,
3
]
],
"source_dataset": "binary_matrix",
"source_index": 82
} |
reasoning_gym_binary_matrix_gL02rY5M | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0 1 0
0 0 1 1 1
1 1 1 1 1
1 0 1 1 1
1 1 0 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 1 0 1 0\n0 0 1 2 1\n1 1 2 3 2\n1 0 1 2 1\n2 1 0 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0 1 0\n0 0 1 1 1\n1 1 1 1 1\n1 0 1 1 1\n1 1 0 1 0\n", "answer": "1 1 0 1 0\n0 0 1 2 1\n1 1 2 3 2\n1 0 1 2 1\n2 1 0 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 83, "matrix": [[1, 1, 0, 1, 0], [0, 0, 1, 1, 1], [1, 1, 1, 1, 1], [1, 0, 1, 1, 1], [1, 1, 0, 1, 0]], "solution": [[1, 1, 0, 1, 0], [0, 0, 1, 2, 1], [1, 1, 2, 3, 2], [1, 0, 1, 2, 1], [2, 1, 0, 1, 0]], "n": 5, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0,
1,
0
],
[
0,
0,
1,
1,
1
],
[
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
1
],
[
1,
1,
0,
1,
0
]
],
"n": 5,
"solution": [
[
1,
1,
0,
1,
0
],
[
0,
0,
1,
2,
1
],
[
1,
1,
2,
3,
2
],
[
1,
0,
1,
2,
1
],
[
2,
1,
0,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 83
} |
reasoning_gym_binary_matrix_bUZSvyE5 | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0 1 1 1 1 1 0 1
1 1 1 1 1 1 0 0 1 1
1 1 1 1 1 1 1 0 1 1
1 1 1 0 0 1 1 1 1 1
1 1 1 1 1 0 0 0 0 1
1 1 1 1 0 0 1 0 1 1
1 1 1 1 1 1 1 1 0 1
1 1 1 1 1 0 1 0 0 0
1 0 1 1 1 1 1 1 1 1
0 1 1 1 1 1 1 1 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 1 0 1 2 2 1 1 0 1\n3 2 1 2 2 1 0 0 1 2\n4 3 2 1 1 2 1 0 1 2\n3 2 1 0 0 1 1 1 1 2\n4 3 2 1 1 0 0 0 0 1\n4 3 2 1 0 0 1 0 1 2\n3 2 3 2 1 1 2 1 0 1\n2 1 2 2 1 0 1 0 0 0\n1 0 1 2 2 1 2 1 1 1\n0 1 2 3 3 2 3 2 2 2", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0 1 1 1 1 1 0 1\n1 1 1 1 1 1 0 0 1 1\n1 1 1 1 1 1 1 0 1 1\n1 1 1 0 0 1 1 1 1 1\n1 1 1 1 1 0 0 0 0 1\n1 1 1 1 0 0 1 0 1 1\n1 1 1 1 1 1 1 1 0 1\n1 1 1 1 1 0 1 0 0 0\n1 0 1 1 1 1 1 1 1 1\n0 1 1 1 1 1 1 1 1 1\n", "answer": "2 1 0 1 2 2 1 1 0 1\n3 2 1 2 2 1 0 0 1 2\n4 3 2 1 1 2 1 0 1 2\n3 2 1 0 0 1 1 1 1 2\n4 3 2 1 1 0 0 0 0 1\n4 3 2 1 0 0 1 0 1 2\n3 2 3 2 1 1 2 1 0 1\n2 1 2 2 1 0 1 0 0 0\n1 0 1 2 2 1 2 1 1 1\n0 1 2 3 3 2 3 2 2 2", "metadata": {"source_dataset": "binary_matrix", "source_index": 84, "matrix": [[1, 1, 0, 1, 1, 1, 1, 1, 0, 1], [1, 1, 1, 1, 1, 1, 0, 0, 1, 1], [1, 1, 1, 1, 1, 1, 1, 0, 1, 1], [1, 1, 1, 0, 0, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 0, 0, 0, 0, 1], [1, 1, 1, 1, 0, 0, 1, 0, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 0, 1], [1, 1, 1, 1, 1, 0, 1, 0, 0, 0], [1, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 1, 1, 1, 1, 1, 1, 1, 1, 1]], "solution": [[2, 1, 0, 1, 2, 2, 1, 1, 0, 1], [3, 2, 1, 2, 2, 1, 0, 0, 1, 2], [4, 3, 2, 1, 1, 2, 1, 0, 1, 2], [3, 2, 1, 0, 0, 1, 1, 1, 1, 2], [4, 3, 2, 1, 1, 0, 0, 0, 0, 1], [4, 3, 2, 1, 0, 0, 1, 0, 1, 2], [3, 2, 3, 2, 1, 1, 2, 1, 0, 1], [2, 1, 2, 2, 1, 0, 1, 0, 0, 0], [1, 0, 1, 2, 2, 1, 2, 1, 1, 1], [0, 1, 2, 3, 3, 2, 3, 2, 2, 2]], "n": 10, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0,
1,
1,
1,
1,
1,
0,
1
],
[
1,
1,
1,
1,
1,
1,
0,
0,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
0,
1,
1
],
[
1,
1,
1,
0,
0,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
0,
0,
0,
0,
1
],
[
1,
1,
1,
1,
0,
0,
1,
0,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
0,
1
],
[
1,
1,
1,
1,
1,
0,
1,
0,
0,
0
],
[
1,
0,
1,
1,
1,
1,
1,
1,
1,
1
],
[
0,
1,
1,
1,
1,
1,
1,
1,
1,
1
]
],
"n": 10,
"solution": [
[
2,
1,
0,
1,
2,
2,
1,
1,
0,
1
],
[
3,
2,
1,
2,
2,
1,
0,
0,
1,
2
],
[
4,
3,
2,
1,
1,
2,
1,
0,
1,
2
],
[
3,
2,
1,
0,
0,
1,
1,
1,
1,
2
],
[
4,
3,
2,
1,
1,
0,
0,
0,
0,
1
],
[
4,
3,
2,
1,
0,
0,
1,
0,
1,
2
],
[
3,
2,
3,
2,
1,
1,
2,
1,
0,
1
],
[
2,
1,
2,
2,
1,
0,
1,
0,
0,
0
],
[
1,
0,
1,
2,
2,
1,
2,
1,
1,
1
],
[
0,
1,
2,
3,
3,
2,
3,
2,
2,
2
]
],
"source_dataset": "binary_matrix",
"source_index": 84
} |
reasoning_gym_binary_matrix_PmAPZfGp | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 0 1 0 1
0 1 1 1 1 1
0 0 0 0 1 1
1 1 1 1 0 0
0 1 0 1 1 1
1 1 1 1 0 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 1 0 1 0 1\n0 1 1 1 1 2\n0 0 0 0 1 1\n1 1 1 1 0 0\n0 1 0 1 1 1\n1 2 1 1 0 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 0 1 0 1\n0 1 1 1 1 1\n0 0 0 0 1 1\n1 1 1 1 0 0\n0 1 0 1 1 1\n1 1 1 1 0 0\n", "answer": "1 1 0 1 0 1\n0 1 1 1 1 2\n0 0 0 0 1 1\n1 1 1 1 0 0\n0 1 0 1 1 1\n1 2 1 1 0 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 85, "matrix": [[1, 1, 0, 1, 0, 1], [0, 1, 1, 1, 1, 1], [0, 0, 0, 0, 1, 1], [1, 1, 1, 1, 0, 0], [0, 1, 0, 1, 1, 1], [1, 1, 1, 1, 0, 0]], "solution": [[1, 1, 0, 1, 0, 1], [0, 1, 1, 1, 1, 2], [0, 0, 0, 0, 1, 1], [1, 1, 1, 1, 0, 0], [0, 1, 0, 1, 1, 1], [1, 2, 1, 1, 0, 0]], "n": 6, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
0,
1,
0,
1
],
[
0,
1,
1,
1,
1,
1
],
[
0,
0,
0,
0,
1,
1
],
[
1,
1,
1,
1,
0,
0
],
[
0,
1,
0,
1,
1,
1
],
[
1,
1,
1,
1,
0,
0
]
],
"n": 6,
"solution": [
[
1,
1,
0,
1,
0,
1
],
[
0,
1,
1,
1,
1,
2
],
[
0,
0,
0,
0,
1,
1
],
[
1,
1,
1,
1,
0,
0
],
[
0,
1,
0,
1,
1,
1
],
[
1,
2,
1,
1,
0,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 85
} |
reasoning_gym_binary_matrix_eSsiaCMm | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 0 1
0 0 1
1 0 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "1 0 1\n0 0 1\n1 0 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 0 1\n0 0 1\n1 0 1\n", "answer": "1 0 1\n0 0 1\n1 0 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 86, "matrix": [[1, 0, 1], [0, 0, 1], [1, 0, 1]], "solution": [[1, 0, 1], [0, 0, 1], [1, 0, 1]], "n": 3, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
0,
1
],
[
0,
0,
1
],
[
1,
0,
1
]
],
"n": 3,
"solution": [
[
1,
0,
1
],
[
0,
0,
1
],
[
1,
0,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 86
} |
reasoning_gym_binary_matrix_yNnRhXzV | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 1 0 0 1 1
1 1 0 1 1 1 1 1
1 1 1 1 0 1 1 1
1 0 1 1 1 0 0 1
0 1 1 1 0 0 0 1
1 1 1 0 1 0 1 1
1 1 1 1 1 0 1 1
1 0 0 1 0 1 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "3 2 1 1 0 0 1 2\n2 1 0 1 1 1 2 3\n2 1 1 1 0 1 1 2\n1 0 1 2 1 0 0 1\n0 1 2 1 0 0 0 1\n1 2 1 0 1 0 1 2\n2 1 1 1 1 0 1 1\n1 0 0 1 0 1 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 1 0 0 1 1\n1 1 0 1 1 1 1 1\n1 1 1 1 0 1 1 1\n1 0 1 1 1 0 0 1\n0 1 1 1 0 0 0 1\n1 1 1 0 1 0 1 1\n1 1 1 1 1 0 1 1\n1 0 0 1 0 1 1 0\n", "answer": "3 2 1 1 0 0 1 2\n2 1 0 1 1 1 2 3\n2 1 1 1 0 1 1 2\n1 0 1 2 1 0 0 1\n0 1 2 1 0 0 0 1\n1 2 1 0 1 0 1 2\n2 1 1 1 1 0 1 1\n1 0 0 1 0 1 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 87, "matrix": [[1, 1, 1, 1, 0, 0, 1, 1], [1, 1, 0, 1, 1, 1, 1, 1], [1, 1, 1, 1, 0, 1, 1, 1], [1, 0, 1, 1, 1, 0, 0, 1], [0, 1, 1, 1, 0, 0, 0, 1], [1, 1, 1, 0, 1, 0, 1, 1], [1, 1, 1, 1, 1, 0, 1, 1], [1, 0, 0, 1, 0, 1, 1, 0]], "solution": [[3, 2, 1, 1, 0, 0, 1, 2], [2, 1, 0, 1, 1, 1, 2, 3], [2, 1, 1, 1, 0, 1, 1, 2], [1, 0, 1, 2, 1, 0, 0, 1], [0, 1, 2, 1, 0, 0, 0, 1], [1, 2, 1, 0, 1, 0, 1, 2], [2, 1, 1, 1, 1, 0, 1, 1], [1, 0, 0, 1, 0, 1, 1, 0]], "n": 8, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
1,
0,
0,
1,
1
],
[
1,
1,
0,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
0,
1,
1,
1
],
[
1,
0,
1,
1,
1,
0,
0,
1
],
[
0,
1,
1,
1,
0,
0,
0,
1
],
[
1,
1,
1,
0,
1,
0,
1,
1
],
[
1,
1,
1,
1,
1,
0,
1,
1
],
[
1,
0,
0,
1,
0,
1,
1,
0
]
],
"n": 8,
"solution": [
[
3,
2,
1,
1,
0,
0,
1,
2
],
[
2,
1,
0,
1,
1,
1,
2,
3
],
[
2,
1,
1,
1,
0,
1,
1,
2
],
[
1,
0,
1,
2,
1,
0,
0,
1
],
[
0,
1,
2,
1,
0,
0,
0,
1
],
[
1,
2,
1,
0,
1,
0,
1,
2
],
[
2,
1,
1,
1,
1,
0,
1,
1
],
[
1,
0,
0,
1,
0,
1,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 87
} |
reasoning_gym_binary_matrix_yP7bcZ4y | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
1 1 1 1 1 1 1 0
1 1 1 0 1 0 1 1
0 1 1 1 1 1 0 1
0 1 1 1 0 1 1 0
1 0 0 0 1 1 1 1
0 1 1 1 1 1 1 1
0 0 1 0 1 1 1 1
1 1 1 1 1 1 1 0
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "2 3 2 1 2 1 1 0\n1 2 1 0 1 0 1 1\n0 1 2 1 1 1 0 1\n0 1 1 1 0 1 1 0\n1 0 0 0 1 2 2 1\n0 1 1 1 2 3 3 2\n0 0 1 0 1 2 2 1\n1 1 2 1 2 2 1 0", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n1 1 1 1 1 1 1 0\n1 1 1 0 1 0 1 1\n0 1 1 1 1 1 0 1\n0 1 1 1 0 1 1 0\n1 0 0 0 1 1 1 1\n0 1 1 1 1 1 1 1\n0 0 1 0 1 1 1 1\n1 1 1 1 1 1 1 0\n", "answer": "2 3 2 1 2 1 1 0\n1 2 1 0 1 0 1 1\n0 1 2 1 1 1 0 1\n0 1 1 1 0 1 1 0\n1 0 0 0 1 2 2 1\n0 1 1 1 2 3 3 2\n0 0 1 0 1 2 2 1\n1 1 2 1 2 2 1 0", "metadata": {"source_dataset": "binary_matrix", "source_index": 88, "matrix": [[1, 1, 1, 1, 1, 1, 1, 0], [1, 1, 1, 0, 1, 0, 1, 1], [0, 1, 1, 1, 1, 1, 0, 1], [0, 1, 1, 1, 0, 1, 1, 0], [1, 0, 0, 0, 1, 1, 1, 1], [0, 1, 1, 1, 1, 1, 1, 1], [0, 0, 1, 0, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 0]], "solution": [[2, 3, 2, 1, 2, 1, 1, 0], [1, 2, 1, 0, 1, 0, 1, 1], [0, 1, 2, 1, 1, 1, 0, 1], [0, 1, 1, 1, 0, 1, 1, 0], [1, 0, 0, 0, 1, 2, 2, 1], [0, 1, 1, 1, 2, 3, 3, 2], [0, 0, 1, 0, 1, 2, 2, 1], [1, 1, 2, 1, 2, 2, 1, 0]], "n": 8, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
1,
1,
1,
1,
1,
1,
1,
0
],
[
1,
1,
1,
0,
1,
0,
1,
1
],
[
0,
1,
1,
1,
1,
1,
0,
1
],
[
0,
1,
1,
1,
0,
1,
1,
0
],
[
1,
0,
0,
0,
1,
1,
1,
1
],
[
0,
1,
1,
1,
1,
1,
1,
1
],
[
0,
0,
1,
0,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
0
]
],
"n": 8,
"solution": [
[
2,
3,
2,
1,
2,
1,
1,
0
],
[
1,
2,
1,
0,
1,
0,
1,
1
],
[
0,
1,
2,
1,
1,
1,
0,
1
],
[
0,
1,
1,
1,
0,
1,
1,
0
],
[
1,
0,
0,
0,
1,
2,
2,
1
],
[
0,
1,
1,
1,
2,
3,
3,
2
],
[
0,
0,
1,
0,
1,
2,
2,
1
],
[
1,
1,
2,
1,
2,
2,
1,
0
]
],
"source_dataset": "binary_matrix",
"source_index": 88
} |
reasoning_gym_binary_matrix_x56LYj8n | reasoning_gym | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below. Return the output distance matrix after "Final Answer".
0 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
0 0 1 1 1 1 0
1 1 1 1 1 1 0
1 0 1 1 1 0 0
0 1 1 0 0 1 1
| {"reasoning_gym_dataset": "binary_matrix", "ground_truth": "0 1 2 3 4 4 3\n1 2 3 4 4 3 2\n1 1 2 3 3 2 1\n0 0 1 2 2 1 0\n1 1 2 2 2 1 0\n1 0 1 1 1 0 0\n0 1 1 0 0 1 1", "reasoning_gym_entry": {"question": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matrix below:\n0 1 1 1 1 1 1\n1 1 1 1 1 1 1\n1 1 1 1 1 1 1\n0 0 1 1 1 1 0\n1 1 1 1 1 1 0\n1 0 1 1 1 0 0\n0 1 1 0 0 1 1\n", "answer": "0 1 2 3 4 4 3\n1 2 3 4 4 3 2\n1 1 2 3 3 2 1\n0 0 1 2 2 1 0\n1 1 2 2 2 1 0\n1 0 1 1 1 0 0\n0 1 1 0 0 1 1", "metadata": {"source_dataset": "binary_matrix", "source_index": 89, "matrix": [[0, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1], [0, 0, 1, 1, 1, 1, 0], [1, 1, 1, 1, 1, 1, 0], [1, 0, 1, 1, 1, 0, 0], [0, 1, 1, 0, 0, 1, 1]], "solution": [[0, 1, 2, 3, 4, 4, 3], [1, 2, 3, 4, 4, 3, 2], [1, 1, 2, 3, 3, 2, 1], [0, 0, 1, 2, 2, 1, 0], [1, 1, 2, 2, 2, 1, 0], [1, 0, 1, 1, 1, 0, 0], [0, 1, 1, 0, 0, 1, 1]], "n": 7, "difficulty": {"n": [3, 10], "p_zero": 0.25}}}} | {
"difficulty": {
"n": [
3,
10
],
"p_zero": 0.25
},
"matrix": [
[
0,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1
],
[
0,
0,
1,
1,
1,
1,
0
],
[
1,
1,
1,
1,
1,
1,
0
],
[
1,
0,
1,
1,
1,
0,
0
],
[
0,
1,
1,
0,
0,
1,
1
]
],
"n": 7,
"solution": [
[
0,
1,
2,
3,
4,
4,
3
],
[
1,
2,
3,
4,
4,
3,
2
],
[
1,
1,
2,
3,
3,
2,
1
],
[
0,
0,
1,
2,
2,
1,
0
],
[
1,
1,
2,
2,
2,
1,
0
],
[
1,
0,
1,
1,
1,
0,
0
],
[
0,
1,
1,
0,
0,
1,
1
]
],
"source_dataset": "binary_matrix",
"source_index": 89
} |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5