id stringlengths 37 37 | task_type stringclasses 1
value | prompt stringlengths 815 2.42k | verification_info stringlengths 1.32k 5.39k | metadata dict |
|---|---|---|---|---|
reasoning_gym_rotten_oranges_T2OqiC4g | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "8", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
2,
2,
1,
0,
1,
1,
1,
2,
2,
1,
1,
0,
1,
0,
1,
2,
1,
1,
1,
1,
1,
1,
1,
1,
... |
reasoning_gym_rotten_oranges_EXSDHzuv | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "6", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
0,
0,
1,
1,
1,
1,
2,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
1,
1,
1,
1,
... |
reasoning_gym_rotten_oranges_j8dMkIH3 | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "-1", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
0,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
2,
1,
0,
1
],
[
1,
1,
1,
0,
1,
1,
... |
reasoning_gym_rotten_oranges_HILfQO28 | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "8", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
1,
1,
1,
1,
2,
1,
1,
0,
0,
1,
1,
1,
1,
1,
1,
1,
1,
2,
1,
1,
1,
0
],
[
1,
... |
reasoning_gym_rotten_oranges_8ISkJU0O | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "7", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
0,
1,
2,
1,
1,
1,
1,
1,
1,
0,
1,
1,
0,
1,
1,
0,
1,
1,
1
],
[
1,
0,
1,
1,
1,
1,
... |
reasoning_gym_rotten_oranges_OvQJUexo | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "9", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
0,
1,
1,
2,
0,
1,
1,
1,
0,
2,
2,
1,
1,
0,
0
],
[
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
... |
reasoning_gym_rotten_oranges_0sPwXafB | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "-1", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
0,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1
],
[
1,
... |
reasoning_gym_rotten_oranges_lM8h6Yst | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "9", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
0,
0,
2,
2,
1,
1,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
0,
1,
1,
1,
... |
reasoning_gym_rotten_oranges_nQKAbEAo | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "-1", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1
],
[
1,
1,
1,
2,
1,
1,
0,
1,
0,
1,
1
],
[
1,
1,... |
reasoning_gym_rotten_oranges_8eGJDX4D | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "6", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
1,
1,
2,
1,
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
2,
1,... |
reasoning_gym_rotten_oranges_xuMh8Lha | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "10", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
1,
2,
1,
1,
1
],
[
1,
2,
1,
1,
2,
1,
1,
... |
reasoning_gym_rotten_oranges_cNqqUr4C | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "-1", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
0,
1,
1,
0,
1,
2,
1,
1,
0,
2,
1,
2,
2,
1,
1,
0,
1
],
[
0,
1,
0,
1,
1,
0,
... |
reasoning_gym_rotten_oranges_8bFvkxYu | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "8", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
2,
2,
1,
1,
1,
1,
0,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
2,
1,
1,
1,
1,
1,
1,
... |
reasoning_gym_rotten_oranges_gyLBn02t | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "6", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
0,
2,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,
1,
1,
0,
1,
1,
1,
... |
reasoning_gym_rotten_oranges_BadVSQkm | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "9", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
1,
1,
1,
1,
1,
1,
2,
1,
1
],
[
1,
1,
2,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
1,... |
reasoning_gym_rotten_oranges_cUN3xoDN | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "-1", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
0,
1,
0,
1,
2,
1,
1,
1,
1,
0,
1,
0,
1,
1,
1,
1,
2,
0,
2,
1
],
[
1,
1,
0,
... |
reasoning_gym_rotten_oranges_EMsGsTIJ | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "10", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
0
],
[
1,
1,
1,
1,
1,
1,
1,
0,
0,
1,
0,
... |
reasoning_gym_rotten_oranges_9UbKZVae | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "12", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
0,
2,
1,
1,
0,
0,
1,
1,
1,
1,
1,
1,
1,
2,
1,
1,
2,
1,
0,
1,
1
],
[
1,
1,
1,
... |
reasoning_gym_rotten_oranges_YwCQdry1 | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "6", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
0,
1,
2,
0,
1,
0,
0,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1,
2,
1,
1,
1,
0,
1,
1,
... |
reasoning_gym_rotten_oranges_5b7ig1y9 | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "-1", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
2,
1,
0,
2,
1,
1,
1,
1,
1,
0,
1,
0,
0,
1,
1,
1,
1,
1,
1,
0,
1,
1
],
[
1,
1,
... |
reasoning_gym_rotten_oranges_K50r5uUR | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "7", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
1,
1,
1,
2,
1,
1,
2,
1
],
[
1,
1,
1,
0,
1,
1,
0,
1,
1,
1
],
[
1,
1,
1,
1,... |
reasoning_gym_rotten_oranges_rrHSfYNU | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "-1", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
0,
1,
1,
0,
0,
1,
1
],
[
1,
1,
1,
... |
reasoning_gym_rotten_oranges_xOXNc5XB | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "6", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
2,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1
],
[
1,
1,
0,
2,
0,
0,
2,
0,
1,
1,
1,
1,
... |
reasoning_gym_rotten_oranges_LdD8dX8R | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "6", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
2,
1,
1,
0,
1,
2,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
[
0,
1,
1,
1,
1,
1,
2,
... |
reasoning_gym_rotten_oranges_YhW9u8Vn | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "7", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
1,
0,
1,
2,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0
],
[
1,
1,
1,
0,
1,
1,
1,
... |
reasoning_gym_rotten_oranges_7f9SLvOe | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "6", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
2,
1,
0,
0,
1,
0,
1,
1,
1,
1,
2,
1,
1,
0,
1,
2,
1
],
[
1,
1,
1,
1,
1,
1,
1,
... |
reasoning_gym_rotten_oranges_FuvCaj40 | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "-1", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
0,
1,
1,
1,
1,
2,
1,
1
],
[
1,
0,
1,
1,
1,
1,
1,
1,
1,
1
],
[
0,
1,
1,
0,... |
reasoning_gym_rotten_oranges_CpO270qy | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "-1", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
1,
1,
1,
1,
1,
1,
2,
1,
1,
1
],
[
1,
1,
1,
1,
2,
1,
1,
0,
1,
1,
0,
1
],
[... |
reasoning_gym_rotten_oranges_nnlnYIXz | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "-1", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
1,
2,
1,
1,
2,
1,
1,
1,
1,
1,
1
],
[
2,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
... |
reasoning_gym_rotten_oranges_Cru7tS3c | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "8", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
1,
2,
1,
1,
1,
0,
2,
1,
1,
1,
1,
1,
1,
1
],
[
0,
1,
1,
1,
0,
1,
0,
1,
1,
... |
reasoning_gym_rotten_oranges_7efTnR4T | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "5", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
2,
1,
1,
1,
1,
1,
1,
0,
2,
1,
0,
1,
1,
1,
0
],
[
1,
0,
1,
0,
0,
1,
1,
0,
... |
reasoning_gym_rotten_oranges_Tbbmh4XZ | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "7", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
... |
reasoning_gym_rotten_oranges_vk7fd2ag | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "8", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
0,
1,
1,
1,
0,
0,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1
],
[
1,
0,
1,
1,
1,
1,
1,
... |
reasoning_gym_rotten_oranges_9EyP8zAc | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "12", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
0,
0,
1,
0,
0,
1,
2,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
... |
reasoning_gym_rotten_oranges_8lnDtFlk | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "11", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
0,
0,
1,
1,
0,
1,
1,
1,
1,
1,
2,
1,
0,
0,
1,
1,
2,
1,
1
],
[
1,
0,
1,
1,
... |
reasoning_gym_rotten_oranges_Bd80FL95 | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "7", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
1,
1,
0,
1,
1,
0,
0,
1,
2,
0,
1,
1
],
[
0,
1,
0,
0,
1,
1,
0,
2,
0,
1,
1,
... |
reasoning_gym_rotten_oranges_9JLMuceK | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "-1", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
1,
1,
1,
2,
1,
1,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
2,
0,
1,
0,
1,
... |
reasoning_gym_rotten_oranges_RkKsqqTq | reasoning_gym | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | {"reasoning_gym_dataset": "rotten_oranges", "ground_truth": "5", "reasoning_gym_entry": {"question": "You are given an n x n grid where each cell can have one of three values:\n- 0 representing an empty cell\n- 1 representing a fresh orange\n- 2 representing a rotten orange\n\nEvery minute, any fresh orange that is 4-d... | {
"difficulty": {
"n": [
10,
30
]
},
"matrix": [
[
2,
0,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
2
],
[
2,
1,
1,
1,
0,
1,
0,
1,
0,
2,
... |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 3