task_id stringlengths 23 52 | subset stringclasses 1
value | family stringclasses 80
values | problem_key stringclasses 75
values | domain stringclasses 8
values | tier stringclasses 2
values | level stringclasses 6
values | source stringclasses 80
values | license stringclasses 3
values | tags listlengths 0 4 | prompt stringlengths 308 37k | instance stringlengths 56 37.8k | direction null | baseline null | best_known null | reference_answer stringlengths 8 198k | reference_reward float64 1 1 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
construct-rlve-largest-convex-polygon-l4-s6 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 4 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 18 points in the plane, indexed 0..17 (distinct, no three collinear):
0: (0, 1)
1: (14, 7)
2: (5, 4)
3: (15, 17)
4: (10, 1)
5: (3, 16)
6: (7, 3)
7: (11, 12)
8: (12, 9)
9: (16, 2)
10: (7, 6)
11: (1, 13)
12: (6, 10)
13: (18, 6)
14: (12, 15)
15: (2, 9)
16: (0, 8)
17: (1, 3)
The largest subset of these point... | {"points": [[0, 1], [14, 7], [5, 4], [15, 17], [10, 1], [3, 16], [7, 3], [11, 12], [12, 9], [16, 2], [7, 6], [1, 13], [6, 10], [18, 6], [12, 15], [2, 9], [0, 8], [1, 3]], "k": 8, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [0, 16, 11, 5, 14, 7, 10, 2]} | 1 |
construct-rlve-largest-convex-polygon-l4-s7 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 4 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 18 points in the plane, indexed 0..17 (distinct, no three collinear):
0: (0, 1)
1: (1, 15)
2: (13, 1)
3: (1, 8)
4: (8, 10)
5: (6, 4)
6: (13, 13)
7: (7, 9)
8: (5, 13)
9: (8, 3)
10: (18, 6)
11: (15, 9)
12: (15, 15)
13: (18, 14)
14: (7, 5)
15: (2, 11)
16: (17, 14)
17: (2, 8)
The largest subset of these poin... | {"points": [[0, 1], [1, 15], [13, 1], [1, 8], [8, 10], [6, 4], [13, 13], [7, 9], [5, 13], [8, 3], [18, 6], [15, 9], [15, 15], [18, 14], [7, 5], [2, 11], [17, 14], [2, 8]], "k": 9, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [3, 15, 8, 12, 16, 10, 2, 9, 5]} | 1 |
construct-rlve-largest-convex-polygon-l4-s8 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 4 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 18 points in the plane, indexed 0..17 (distinct, no three collinear):
0: (11, 7)
1: (5, 5)
2: (16, 10)
3: (4, 13)
4: (5, 8)
5: (18, 10)
6: (15, 17)
7: (10, 17)
8: (2, 16)
9: (4, 2)
10: (16, 6)
11: (7, 9)
12: (9, 5)
13: (1, 4)
14: (6, 13)
15: (17, 2)
16: (0, 15)
17: (15, 0)
The largest subset of these poi... | {"points": [[11, 7], [5, 5], [16, 10], [4, 13], [5, 8], [18, 10], [15, 17], [10, 17], [2, 16], [4, 2], [16, 6], [7, 9], [9, 5], [1, 4], [6, 13], [17, 2], [0, 15], [15, 0]], "k": 9, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [16, 8, 7, 6, 2, 10, 17, 9, 13]} | 1 |
construct-rlve-largest-convex-polygon-l4-s9 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 4 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 18 points in the plane, indexed 0..17 (distinct, no three collinear):
0: (11, 1)
1: (4, 4)
2: (16, 11)
3: (14, 5)
4: (15, 14)
5: (0, 16)
6: (4, 9)
7: (16, 0)
8: (8, 1)
9: (0, 3)
10: (13, 9)
11: (5, 16)
12: (2, 18)
13: (3, 6)
14: (9, 17)
15: (15, 2)
16: (3, 5)
17: (11, 8)
The largest subset of these point... | {"points": [[11, 1], [4, 4], [16, 11], [14, 5], [15, 14], [0, 16], [4, 9], [16, 0], [8, 1], [0, 3], [13, 9], [5, 16], [2, 18], [3, 6], [9, 17], [15, 2], [3, 5], [11, 8]], "k": 10, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [5, 12, 14, 4, 2, 3, 0, 8, 1, 13]} | 1 |
construct-rlve-largest-convex-polygon-l5-s0 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 5 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 25 points in the plane, indexed 0..24 (distinct, no three collinear):
0: (4, 0)
1: (14, 7)
2: (3, 10)
3: (22, 17)
4: (21, 25)
5: (4, 24)
6: (19, 18)
7: (9, 20)
8: (16, 7)
9: (1, 12)
10: (16, 10)
11: (17, 2)
12: (14, 21)
13: (5, 15)
14: (2, 1)
15: (10, 14)
16: (1, 11)
17: (0, 22)
18: (21, 2)
19: (20, 21)
2... | {"points": [[4, 0], [14, 7], [3, 10], [22, 17], [21, 25], [4, 24], [19, 18], [9, 20], [16, 7], [1, 12], [16, 10], [17, 2], [14, 21], [5, 15], [2, 1], [10, 14], [1, 11], [0, 22], [21, 2], [20, 21], [23, 17], [5, 14], [9, 12], [24, 6], [10, 22]], "k": 11, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [16, 9, 13, 12, 4, 19, 6, 10, 1, 0, 14]} | 1 |
construct-rlve-largest-convex-polygon-l5-s1 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 5 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 25 points in the plane, indexed 0..24 (distinct, no three collinear):
0: (22, 11)
1: (4, 12)
2: (17, 3)
3: (22, 17)
4: (14, 19)
5: (5, 16)
6: (3, 22)
7: (2, 2)
8: (8, 15)
9: (0, 23)
10: (1, 24)
11: (16, 22)
12: (16, 25)
13: (5, 12)
14: (25, 9)
15: (9, 25)
16: (2, 19)
17: (21, 8)
18: (14, 14)
19: (11, 0)
2... | {"points": [[22, 11], [4, 12], [17, 3], [22, 17], [14, 19], [5, 16], [3, 22], [2, 2], [8, 15], [0, 23], [1, 24], [16, 22], [16, 25], [5, 12], [25, 9], [9, 25], [2, 19], [21, 8], [14, 14], [11, 0], [11, 9], [0, 6], [6, 0], [24, 21], [21, 7]], "k": 12, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [21, 16, 6, 15, 11, 3, 0, 17, 2, 19, 22, 7]} | 1 |
construct-rlve-largest-convex-polygon-l5-s2 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 5 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 25 points in the plane, indexed 0..24 (distinct, no three collinear):
0: (6, 18)
1: (12, 1)
2: (12, 16)
3: (5, 4)
4: (4, 15)
5: (17, 24)
6: (25, 4)
7: (0, 11)
8: (0, 23)
9: (2, 20)
10: (20, 13)
11: (3, 9)
12: (13, 7)
13: (1, 8)
14: (16, 12)
15: (20, 18)
16: (5, 2)
17: (4, 13)
18: (3, 23)
19: (25, 5)
20: (... | {"points": [[6, 18], [12, 1], [12, 16], [5, 4], [4, 15], [17, 24], [25, 4], [0, 11], [0, 23], [2, 20], [20, 13], [3, 9], [13, 7], [1, 8], [16, 12], [20, 18], [5, 2], [4, 13], [3, 23], [25, 5], [17, 25], [6, 0], [2, 15], [16, 14], [18, 11]], "k": 11, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [22, 9, 18, 2, 24, 19, 6, 1, 21, 16, 11]} | 1 |
construct-rlve-largest-convex-polygon-l5-s3 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 5 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 25 points in the plane, indexed 0..24 (distinct, no three collinear):
0: (20, 17)
1: (8, 0)
2: (9, 5)
3: (16, 4)
4: (1, 9)
5: (25, 19)
6: (7, 16)
7: (21, 21)
8: (20, 19)
9: (21, 18)
10: (5, 3)
11: (14, 18)
12: (25, 0)
13: (10, 8)
14: (2, 10)
15: (16, 9)
16: (9, 25)
17: (11, 22)
18: (6, 16)
19: (23, 11)
20... | {"points": [[20, 17], [8, 0], [9, 5], [16, 4], [1, 9], [25, 19], [7, 16], [21, 21], [20, 19], [21, 18], [5, 3], [14, 18], [25, 0], [10, 8], [2, 10], [16, 9], [9, 25], [11, 22], [6, 16], [23, 11], [19, 1], [0, 3], [8, 25], [2, 21], [13, 24]], "k": 11, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [4, 23, 22, 16, 24, 8, 9, 19, 12, 20, 2]} | 1 |
construct-rlve-largest-convex-polygon-l5-s4 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 5 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 25 points in the plane, indexed 0..24 (distinct, no three collinear):
0: (22, 14)
1: (22, 23)
2: (14, 19)
3: (12, 25)
4: (25, 1)
5: (17, 18)
6: (16, 4)
7: (25, 16)
8: (0, 23)
9: (2, 20)
10: (15, 17)
11: (23, 3)
12: (14, 0)
13: (20, 16)
14: (17, 20)
15: (5, 24)
16: (6, 1)
17: (16, 9)
18: (18, 12)
19: (3, 2... | {"points": [[22, 14], [22, 23], [14, 19], [12, 25], [25, 1], [17, 18], [16, 4], [25, 16], [0, 23], [2, 20], [15, 17], [23, 3], [14, 0], [20, 16], [17, 20], [5, 24], [6, 1], [16, 9], [18, 12], [3, 2], [11, 6], [1, 13], [13, 12], [1, 19], [18, 14]], "k": 11, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [8, 15, 3, 5, 24, 18, 6, 12, 16, 19, 21]} | 1 |
construct-rlve-largest-convex-polygon-l5-s5 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 5 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 25 points in the plane, indexed 0..24 (distinct, no three collinear):
0: (7, 17)
1: (23, 16)
2: (5, 1)
3: (22, 23)
4: (8, 12)
5: (8, 21)
6: (15, 5)
7: (1, 15)
8: (12, 9)
9: (16, 25)
10: (20, 19)
11: (3, 18)
12: (15, 7)
13: (0, 22)
14: (25, 21)
15: (12, 2)
16: (23, 11)
17: (20, 18)
18: (3, 5)
19: (19, 10)
... | {"points": [[7, 17], [23, 16], [5, 1], [22, 23], [8, 12], [8, 21], [15, 5], [1, 15], [12, 9], [16, 25], [20, 19], [3, 18], [15, 7], [0, 22], [25, 21], [12, 2], [23, 11], [20, 18], [3, 5], [19, 10], [13, 0], [2, 3], [2, 6], [24, 12], [10, 25]], "k": 12, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [7, 11, 5, 9, 3, 14, 1, 19, 6, 15, 2, 18]} | 1 |
construct-rlve-largest-convex-polygon-l5-s6 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 5 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 25 points in the plane, indexed 0..24 (distinct, no three collinear):
0: (25, 23)
1: (19, 6)
2: (4, 24)
3: (25, 13)
4: (7, 7)
5: (20, 7)
6: (18, 19)
7: (6, 17)
8: (14, 9)
9: (22, 16)
10: (14, 15)
11: (17, 14)
12: (3, 24)
13: (0, 4)
14: (1, 11)
15: (6, 4)
16: (24, 13)
17: (23, 8)
18: (12, 17)
19: (9, 9)
20... | {"points": [[25, 23], [19, 6], [4, 24], [25, 13], [7, 7], [20, 7], [18, 19], [6, 17], [14, 9], [22, 16], [14, 15], [17, 14], [3, 24], [0, 4], [1, 11], [6, 4], [24, 13], [23, 8], [12, 17], [9, 9], [8, 1], [13, 6], [24, 12], [7, 2], [8, 25]], "k": 11, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [2, 24, 6, 9, 16, 22, 17, 5, 21, 19, 7]} | 1 |
construct-rlve-largest-convex-polygon-l5-s7 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 5 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 25 points in the plane, indexed 0..24 (distinct, no three collinear):
0: (12, 4)
1: (17, 0)
2: (0, 2)
3: (19, 18)
4: (1, 3)
5: (1, 12)
6: (18, 4)
7: (7, 1)
8: (21, 3)
9: (6, 17)
10: (9, 1)
11: (9, 10)
12: (25, 9)
13: (8, 23)
14: (10, 20)
15: (24, 13)
16: (6, 13)
17: (20, 6)
18: (22, 6)
19: (3, 17)
20: (3,... | {"points": [[12, 4], [17, 0], [0, 2], [19, 18], [1, 3], [1, 12], [18, 4], [7, 1], [21, 3], [6, 17], [9, 1], [9, 10], [25, 9], [8, 23], [10, 20], [24, 13], [6, 13], [20, 6], [22, 6], [3, 17], [3, 20], [8, 16], [25, 8], [0, 15], [13, 18]], "k": 12, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [2, 16, 21, 24, 3, 15, 12, 22, 18, 6, 10, 7]} | 1 |
construct-rlve-largest-convex-polygon-l5-s8 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 5 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 25 points in the plane, indexed 0..24 (distinct, no three collinear):
0: (12, 4)
1: (9, 5)
2: (8, 9)
3: (3, 25)
4: (13, 5)
5: (1, 12)
6: (2, 17)
7: (10, 24)
8: (22, 1)
9: (23, 3)
10: (20, 16)
11: (7, 25)
12: (5, 18)
13: (0, 13)
14: (18, 9)
15: (15, 16)
16: (1, 23)
17: (12, 2)
18: (22, 6)
19: (17, 1)
20: (... | {"points": [[12, 4], [9, 5], [8, 9], [3, 25], [13, 5], [1, 12], [2, 17], [10, 24], [22, 1], [23, 3], [20, 16], [7, 25], [5, 18], [0, 13], [18, 9], [15, 16], [1, 23], [12, 2], [22, 6], [17, 1], [23, 23], [4, 13], [9, 18], [7, 2], [24, 15]], "k": 12, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [16, 3, 11, 7, 10, 18, 8, 19, 17, 1, 21, 6]} | 1 |
construct-rlve-largest-convex-polygon-l5-s9 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 5 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 25 points in the plane, indexed 0..24 (distinct, no three collinear):
0: (18, 23)
1: (14, 4)
2: (6, 24)
3: (21, 25)
4: (14, 13)
5: (2, 11)
6: (0, 23)
7: (25, 16)
8: (6, 2)
9: (7, 22)
10: (21, 21)
11: (17, 5)
12: (9, 19)
13: (0, 22)
14: (11, 25)
15: (7, 12)
16: (18, 18)
17: (20, 3)
18: (4, 1)
19: (23, 8)
2... | {"points": [[18, 23], [14, 4], [6, 24], [21, 25], [14, 13], [2, 11], [0, 23], [25, 16], [6, 2], [7, 22], [21, 21], [17, 5], [9, 19], [0, 22], [11, 25], [7, 12], [18, 18], [20, 3], [4, 1], [23, 8], [4, 16], [8, 4], [1, 13], [15, 3], [13, 24]], "k": 13, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [13, 6, 2, 24, 0, 10, 7, 19, 17, 23, 1, 15, 20]} | 1 |
construct-rlve-largest-convex-polygon-l6-s0 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 6 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 35 points in the plane, indexed 0..34 (distinct, no three collinear):
0: (6, 18)
1: (4, 0)
2: (20, 14)
3: (2, 30)
4: (4, 9)
5: (21, 31)
6: (0, 2)
7: (14, 25)
8: (2, 11)
9: (16, 1)
10: (27, 31)
11: (18, 7)
12: (20, 2)
13: (24, 32)
14: (3, 9)
15: (34, 12)
16: (27, 6)
17: (5, 6)
18: (9, 1)
19: (28, 26)
20: (... | {"points": [[6, 18], [4, 0], [20, 14], [2, 30], [4, 9], [21, 31], [0, 2], [14, 25], [2, 11], [16, 1], [27, 31], [18, 7], [20, 2], [24, 32], [3, 9], [34, 12], [27, 6], [5, 6], [9, 1], [28, 26], [28, 35], [31, 0], [21, 8], [23, 5], [13, 34], [34, 8], [14, 20], [5, 20], [8, 19], [3, 32], [24, 18], [33, 30], [1, 25], [16, ... | null | null | null | {"indices": [32, 3, 29, 24, 13, 10, 19, 23, 12, 9, 18, 17, 14, 8]} | 1 |
construct-rlve-largest-convex-polygon-l6-s1 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 6 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 35 points in the plane, indexed 0..34 (distinct, no three collinear):
0: (35, 33)
1: (4, 3)
2: (12, 10)
3: (34, 10)
4: (21, 22)
5: (6, 27)
6: (20, 32)
7: (31, 35)
8: (8, 12)
9: (24, 2)
10: (9, 11)
11: (11, 23)
12: (25, 13)
13: (2, 17)
14: (8, 27)
15: (1, 15)
16: (25, 28)
17: (20, 1)
18: (29, 16)
19: (13, ... | {"points": [[35, 33], [4, 3], [12, 10], [34, 10], [21, 22], [6, 27], [20, 32], [31, 35], [8, 12], [24, 2], [9, 11], [11, 23], [25, 13], [2, 17], [8, 27], [1, 15], [25, 28], [20, 1], [29, 16], [13, 29], [29, 31], [3, 12], [28, 8], [11, 4], [23, 30], [0, 1], [28, 23], [32, 11], [5, 30], [30, 20], [7, 3], [33, 0], [10, 4]... | null | null | null | {"indices": [15, 13, 14, 19, 24, 16, 26, 18, 22, 9, 17, 23, 21]} | 1 |
construct-rlve-largest-convex-polygon-l6-s2 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 6 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 35 points in the plane, indexed 0..34 (distinct, no three collinear):
0: (25, 35)
1: (26, 24)
2: (14, 1)
3: (31, 32)
4: (34, 31)
5: (1, 0)
6: (19, 12)
7: (2, 5)
8: (20, 1)
9: (23, 9)
10: (31, 16)
11: (18, 25)
12: (21, 33)
13: (8, 5)
14: (0, 7)
15: (30, 14)
16: (9, 19)
17: (10, 8)
18: (0, 19)
19: (17, 29)
... | {"points": [[25, 35], [26, 24], [14, 1], [31, 32], [34, 31], [1, 0], [19, 12], [2, 5], [20, 1], [23, 9], [31, 16], [18, 25], [21, 33], [8, 5], [0, 7], [30, 14], [9, 19], [10, 8], [0, 19], [17, 29], [1, 20], [28, 32], [26, 10], [25, 18], [18, 6], [35, 22], [29, 24], [3, 14], [8, 7], [32, 4], [24, 6], [19, 25], [33, 21],... | null | null | null | {"indices": [14, 18, 20, 19, 21, 3, 4, 32, 10, 15, 22, 9, 13, 7]} | 1 |
construct-rlve-largest-convex-polygon-l6-s3 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 6 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 35 points in the plane, indexed 0..34 (distinct, no three collinear):
0: (6, 18)
1: (25, 29)
2: (25, 23)
3: (32, 34)
4: (16, 32)
5: (12, 19)
6: (30, 3)
7: (28, 18)
8: (5, 22)
9: (10, 15)
10: (30, 27)
11: (7, 7)
12: (29, 1)
13: (6, 11)
14: (11, 29)
15: (2, 26)
16: (22, 4)
17: (33, 32)
18: (34, 3)
19: (34, ... | {"points": [[6, 18], [25, 29], [25, 23], [32, 34], [16, 32], [12, 19], [30, 3], [28, 18], [5, 22], [10, 15], [30, 27], [7, 7], [29, 1], [6, 11], [11, 29], [2, 26], [22, 4], [33, 32], [34, 3], [34, 12], [19, 11], [33, 1], [17, 23], [2, 4], [8, 17], [14, 33], [35, 16], [15, 19], [15, 28], [11, 0], [32, 13], [5, 26], [19,... | null | null | null | {"indices": [34, 11, 9, 5, 22, 1, 3, 17, 26, 19, 6, 12, 29]} | 1 |
construct-rlve-largest-convex-polygon-l6-s4 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 6 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 35 points in the plane, indexed 0..34 (distinct, no three collinear):
0: (6, 24)
1: (14, 7)
2: (22, 20)
3: (3, 34)
4: (10, 21)
5: (26, 11)
6: (9, 29)
7: (29, 4)
8: (19, 30)
9: (32, 27)
10: (12, 0)
11: (16, 28)
12: (22, 16)
13: (17, 5)
14: (34, 15)
15: (6, 29)
16: (3, 12)
17: (19, 5)
18: (34, 30)
19: (30, ... | {"points": [[6, 24], [14, 7], [22, 20], [3, 34], [10, 21], [26, 11], [9, 29], [29, 4], [19, 30], [32, 27], [12, 0], [16, 28], [22, 16], [17, 5], [34, 15], [6, 29], [3, 12], [19, 5], [34, 30], [30, 11], [5, 15], [0, 4], [8, 17], [33, 13], [29, 6], [11, 28], [35, 19], [20, 0], [1, 32], [21, 35], [23, 35], [10, 16], [9, 2... | null | null | null | {"indices": [0, 32, 25, 11, 9, 26, 14, 23, 19, 17, 13, 1, 22]} | 1 |
construct-rlve-largest-convex-polygon-l6-s5 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 6 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 35 points in the plane, indexed 0..34 (distinct, no three collinear):
0: (35, 30)
1: (2, 27)
2: (1, 31)
3: (31, 20)
4: (20, 17)
5: (9, 2)
6: (6, 33)
7: (22, 35)
8: (16, 1)
9: (10, 30)
10: (0, 32)
11: (16, 22)
12: (21, 12)
13: (5, 0)
14: (3, 12)
15: (25, 0)
16: (22, 31)
17: (27, 15)
18: (33, 7)
19: (30, 23... | {"points": [[35, 30], [2, 27], [1, 31], [31, 20], [20, 17], [9, 2], [6, 33], [22, 35], [16, 1], [10, 30], [0, 32], [16, 22], [21, 12], [5, 0], [3, 12], [25, 0], [22, 31], [27, 15], [33, 7], [30, 23], [35, 13], [8, 20], [30, 29], [8, 35], [7, 6], [7, 24], [12, 17], [23, 23], [33, 9], [15, 6], [4, 34], [18, 2], [17, 34],... | null | null | null | {"indices": [2, 30, 23, 32, 16, 19, 3, 28, 18, 15, 8, 5, 24, 33, 34]} | 1 |
construct-rlve-largest-convex-polygon-l6-s6 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 6 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 35 points in the plane, indexed 0..34 (distinct, no three collinear):
0: (7, 23)
1: (34, 1)
2: (34, 16)
3: (3, 13)
4: (14, 19)
5: (4, 21)
6: (22, 29)
7: (24, 2)
8: (30, 18)
9: (19, 15)
10: (28, 30)
11: (25, 4)
12: (24, 14)
13: (2, 23)
14: (26, 8)
15: (18, 28)
16: (20, 22)
17: (21, 30)
18: (8, 2)
19: (33, ... | {"points": [[7, 23], [34, 1], [34, 16], [3, 13], [14, 19], [4, 21], [22, 29], [24, 2], [30, 18], [19, 15], [28, 30], [25, 4], [24, 14], [2, 23], [26, 8], [18, 28], [20, 22], [21, 30], [8, 2], [33, 4], [33, 7], [14, 33], [17, 26], [35, 13], [15, 7], [28, 32], [11, 28], [7, 3], [1, 29], [6, 31], [8, 1], [35, 6], [2, 3], ... | null | null | null | {"indices": [3, 5, 0, 34, 16, 8, 2, 23, 31, 19, 7, 18, 27]} | 1 |
construct-rlve-largest-convex-polygon-l6-s7 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 6 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 35 points in the plane, indexed 0..34 (distinct, no three collinear):
0: (12, 10)
1: (15, 27)
2: (21, 31)
3: (28, 6)
4: (10, 0)
5: (5, 34)
6: (35, 20)
7: (24, 20)
8: (20, 1)
9: (34, 0)
10: (25, 34)
11: (3, 21)
12: (9, 19)
13: (0, 25)
14: (0, 31)
15: (35, 28)
16: (26, 28)
17: (22, 9)
18: (3, 8)
19: (23, 23... | {"points": [[12, 10], [15, 27], [21, 31], [28, 6], [10, 0], [5, 34], [35, 20], [24, 20], [20, 1], [34, 0], [25, 34], [3, 21], [9, 19], [0, 25], [0, 31], [35, 28], [26, 28], [22, 9], [3, 8], [23, 23], [19, 4], [8, 4], [5, 14], [21, 32], [23, 29], [34, 35], [9, 15], [32, 13], [19, 13], [18, 2], [8, 25], [16, 14], [24, 21... | null | null | null | {"indices": [11, 30, 23, 10, 25, 15, 6, 27, 3, 8, 29, 33, 22]} | 1 |
construct-rlve-largest-convex-polygon-l6-s8 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 6 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 35 points in the plane, indexed 0..34 (distinct, no three collinear):
0: (32, 31)
1: (1, 28)
2: (1, 31)
3: (21, 13)
4: (12, 16)
5: (18, 29)
6: (11, 2)
7: (23, 25)
8: (21, 34)
9: (5, 28)
10: (35, 8)
11: (9, 29)
12: (5, 3)
13: (31, 34)
14: (2, 1)
15: (35, 1)
16: (14, 33)
17: (4, 35)
18: (25, 12)
19: (24, 16... | {"points": [[32, 31], [1, 28], [1, 31], [21, 13], [12, 16], [18, 29], [11, 2], [23, 25], [21, 34], [5, 28], [35, 8], [9, 29], [5, 3], [31, 34], [2, 1], [35, 1], [14, 33], [4, 35], [25, 12], [24, 16], [28, 32], [30, 35], [8, 32], [31, 3], [16, 30], [6, 25], [17, 7], [34, 23], [34, 20], [3, 23], [24, 6], [9, 15], [10, 10... | null | null | null | {"indices": [1, 22, 16, 8, 21, 13, 0, 27, 28, 18, 3, 4, 29]} | 1 |
construct-rlve-largest-convex-polygon-l6-s9 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 6 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 35 points in the plane, indexed 0..34 (distinct, no three collinear):
0: (2, 27)
1: (7, 23)
2: (12, 10)
3: (28, 0)
4: (34, 16)
5: (16, 32)
6: (6, 33)
7: (22, 23)
8: (23, 25)
9: (15, 11)
10: (25, 13)
11: (21, 24)
12: (8, 2)
13: (6, 35)
14: (22, 28)
15: (5, 18)
16: (35, 1)
17: (24, 7)
18: (29, 6)
19: (7, 9)... | {"points": [[2, 27], [7, 23], [12, 10], [28, 0], [34, 16], [16, 32], [6, 33], [22, 23], [23, 25], [15, 11], [25, 13], [21, 24], [8, 2], [6, 35], [22, 28], [5, 18], [35, 1], [24, 7], [29, 6], [7, 9], [20, 6], [16, 15], [31, 21], [28, 7], [21, 32], [14, 26], [13, 0], [33, 9], [9, 15], [30, 22], [8, 28], [2, 21], [20, 2],... | null | null | null | {"indices": [31, 0, 6, 5, 14, 29, 22, 4, 27, 23, 17, 9, 28, 15]} | 1 |
construct-rlve-largest-rectangle-l1-s0 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 1 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 6 distinct lattice points, indexed 0..5:
0: (-5, -3)
1: (2, -1)
2: (-6, -1)
3: (3, -3)
4: (-3, -2)
5: (-4, 0)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 5; this is the largest area of any rectangle with vertices among these points.
... | {"points": [[-5, -3], [2, -1], [-6, -1], [3, -3], [-3, -2], [-4, 0]], "area": 5, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [0, 2, 5, 4]} | 1 |
construct-rlve-largest-rectangle-l1-s1 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 1 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 6 distinct lattice points, indexed 0..5:
0: (0, 1)
1: (4, 1)
2: (5, -1)
3: (-1, 0)
4: (0, -1)
5: (1, 0)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 2; this is the largest area of any rectangle with vertices among these points.
Answer... | {"points": [[0, 1], [4, 1], [5, -1], [-1, 0], [0, -1], [1, 0]], "area": 2, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [0, 3, 4, 5]} | 1 |
construct-rlve-largest-rectangle-l1-s2 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 1 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 6 distinct lattice points, indexed 0..5:
0: (-1, 3)
1: (2, 5)
2: (4, 2)
3: (1, 0)
4: (4, -1)
5: (-1, 2)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 13; this is the largest area of any rectangle with vertices among these points.
Answe... | {"points": [[-1, 3], [2, 5], [4, 2], [1, 0], [4, -1], [-1, 2]], "area": 13, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [0, 1, 2, 3]} | 1 |
construct-rlve-largest-rectangle-l1-s3 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 1 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 6 distinct lattice points, indexed 0..5:
0: (2, -6)
1: (1, -3)
2: (3, -4)
3: (0, -5)
4: (-3, 3)
5: (-2, -2)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 5; this is the largest area of any rectangle with vertices among these points.
An... | {"points": [[2, -6], [1, -3], [3, -4], [0, -5], [-3, 3], [-2, -2]], "area": 5, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [0, 2, 1, 3]} | 1 |
construct-rlve-largest-rectangle-l1-s4 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 1 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 6 distinct lattice points, indexed 0..5:
0: (4, 3)
1: (3, -3)
2: (0, 0)
3: (0, -3)
4: (3, 0)
5: (-6, 0)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 9; this is the largest area of any rectangle with vertices among these points.
Answer... | {"points": [[4, 3], [3, -3], [0, 0], [0, -3], [3, 0], [-6, 0]], "area": 9, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [1, 3, 2, 4]} | 1 |
construct-rlve-largest-rectangle-l1-s5 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 1 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 6 distinct lattice points, indexed 0..5:
0: (-2, -3)
1: (0, -1)
2: (-1, -4)
3: (-2, -1)
4: (-1, 1)
5: (0, -3)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 4; this is the largest area of any rectangle with vertices among these points.
... | {"points": [[-2, -3], [0, -1], [-1, -4], [-2, -1], [-1, 1], [0, -3]], "area": 4, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [0, 3, 1, 5]} | 1 |
construct-rlve-largest-rectangle-l1-s6 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 1 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 6 distinct lattice points, indexed 0..5:
0: (-1, 4)
1: (-3, -1)
2: (1, 0)
3: (-2, 1)
4: (-6, 0)
5: (2, 3)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 10; this is the largest area of any rectangle with vertices among these points.
Ans... | {"points": [[-1, 4], [-3, -1], [1, 0], [-2, 1], [-6, 0], [2, 3]], "area": 10, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [0, 3, 2, 5]} | 1 |
construct-rlve-largest-rectangle-l1-s7 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 1 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 6 distinct lattice points, indexed 0..5:
0: (-2, -3)
1: (3, 3)
2: (0, -3)
3: (-2, -1)
4: (-2, -5)
5: (0, -5)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 4; this is the largest area of any rectangle with vertices among these points.
A... | {"points": [[-2, -3], [3, 3], [0, -3], [-2, -1], [-2, -5], [0, -5]], "area": 4, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [0, 2, 5, 4]} | 1 |
construct-rlve-largest-rectangle-l1-s8 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 1 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 6 distinct lattice points, indexed 0..5:
0: (5, 4)
1: (-5, -1)
2: (8, 2)
3: (6, -1)
4: (3, 1)
5: (6, 4)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 13; this is the largest area of any rectangle with vertices among these points.
Answe... | {"points": [[5, 4], [-5, -1], [8, 2], [6, -1], [3, 1], [6, 4]], "area": 13, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [0, 2, 3, 4]} | 1 |
construct-rlve-largest-rectangle-l1-s9 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 1 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 6 distinct lattice points, indexed 0..5:
0: (2, 0)
1: (-1, -1)
2: (-2, 2)
3: (-6, 1)
4: (5, 5)
5: (1, 3)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 10; this is the largest area of any rectangle with vertices among these points.
Answ... | {"points": [[2, 0], [-1, -1], [-2, 2], [-6, 1], [5, 5], [1, 3]], "area": 10, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [0, 1, 2, 5]} | 1 |
construct-rlve-largest-rectangle-l2-s0 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 2 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 10 distinct lattice points, indexed 0..9:
0: (7, 6)
1: (4, 11)
2: (6, -7)
3: (-2, 8)
4: (2, 3)
5: (-8, 10)
6: (5, -9)
7: (-1, 8)
8: (-10, 9)
9: (6, -10)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 34; this is the largest area of any r... | {"points": [[7, 6], [4, 11], [6, -7], [-2, 8], [2, 3], [-8, 10], [5, -9], [-1, 8], [-10, 9], [6, -10]], "area": 34, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [0, 1, 7, 4]} | 1 |
construct-rlve-largest-rectangle-l2-s1 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 2 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 10 distinct lattice points, indexed 0..9:
0: (-3, -8)
1: (4, 3)
2: (3, 12)
3: (4, 1)
4: (1, -4)
5: (-9, -2)
6: (6, 5)
7: (7, -8)
8: (-1, 7)
9: (8, 8)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 41; this is the largest area of any rect... | {"points": [[-3, -8], [4, 3], [3, 12], [4, 1], [1, -4], [-9, -2], [6, 5], [7, -8], [-1, 7], [8, 8]], "area": 41, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [1, 8, 2, 9]} | 1 |
construct-rlve-largest-rectangle-l2-s2 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 2 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 10 distinct lattice points, indexed 0..9:
0: (-10, -2)
1: (0, -2)
2: (2, 0)
3: (-9, -8)
4: (-2, 0)
5: (-4, 7)
6: (6, 5)
7: (5, 9)
8: (0, 2)
9: (-5, -7)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 8; this is the largest area of any rec... | {"points": [[-10, -2], [0, -2], [2, 0], [-9, -8], [-2, 0], [-4, 7], [6, 5], [5, 9], [0, 2], [-5, -7]], "area": 8, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [1, 2, 8, 4]} | 1 |
construct-rlve-largest-rectangle-l2-s3 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 2 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 10 distinct lattice points, indexed 0..9:
0: (5, 5)
1: (2, 1)
2: (-5, 0)
3: (-8, -1)
4: (10, 5)
5: (7, 8)
6: (-8, 8)
7: (-2, 4)
8: (-1, -3)
9: (-8, -7)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 25; this is the largest area of any re... | {"points": [[5, 5], [2, 1], [-5, 0], [-8, -1], [10, 5], [7, 8], [-8, 8], [-2, 4], [-1, -3], [-8, -7]], "area": 25, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [1, 7, 2, 8]} | 1 |
construct-rlve-largest-rectangle-l2-s4 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 2 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 10 distinct lattice points, indexed 0..9:
0: (3, 0)
1: (-5, -2)
2: (-3, 2)
3: (-4, -5)
4: (8, 4)
5: (4, 9)
6: (-8, -3)
7: (10, 10)
8: (6, -9)
9: (-7, -6)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 10; this is the largest area of any ... | {"points": [[3, 0], [-5, -2], [-3, 2], [-4, -5], [8, 4], [4, 9], [-8, -3], [10, 10], [6, -9], [-7, -6]], "area": 10, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [1, 3, 9, 6]} | 1 |
construct-rlve-largest-rectangle-l2-s5 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 2 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 10 distinct lattice points, indexed 0..9:
0: (-7, 5)
1: (9, -5)
2: (5, -1)
3: (-10, -1)
4: (9, -1)
5: (3, -9)
6: (-7, -5)
7: (7, 7)
8: (5, -5)
9: (4, -8)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 16; this is the largest area of any ... | {"points": [[-7, 5], [9, -5], [5, -1], [-10, -1], [9, -1], [3, -9], [-7, -5], [7, 7], [5, -5], [4, -8]], "area": 16, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [1, 4, 2, 8]} | 1 |
construct-rlve-largest-rectangle-l2-s6 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 2 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 10 distinct lattice points, indexed 0..9:
0: (2, 1)
1: (-6, 3)
2: (-2, 5)
3: (2, 9)
4: (6, 5)
5: (5, 3)
6: (-8, 10)
7: (-4, 3)
8: (9, 7)
9: (6, -7)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 32; this is the largest area of any rectan... | {"points": [[2, 1], [-6, 3], [-2, 5], [2, 9], [6, 5], [5, 3], [-8, 10], [-4, 3], [9, 7], [6, -7]], "area": 32, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [0, 2, 3, 4]} | 1 |
construct-rlve-largest-rectangle-l2-s7 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 2 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 10 distinct lattice points, indexed 0..9:
0: (-5, -6)
1: (5, 7)
2: (9, -9)
3: (2, 6)
4: (-1, -8)
5: (2, -3)
6: (-6, -5)
7: (-3, 0)
8: (1, -5)
9: (9, -4)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 34; this is the largest area of any r... | {"points": [[-5, -6], [5, 7], [9, -9], [2, 6], [-1, -8], [2, -3], [-6, -5], [-3, 0], [1, -5], [9, -4]], "area": 34, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [4, 5, 7, 6]} | 1 |
construct-rlve-largest-rectangle-l2-s8 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 2 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 10 distinct lattice points, indexed 0..9:
0: (-3, -7)
1: (-1, -7)
2: (10, 5)
3: (0, -4)
4: (-7, 6)
5: (3, 0)
6: (6, 1)
7: (-4, -6)
8: (1, 10)
9: (-3, -3)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 10; this is the largest area of any ... | {"points": [[-3, -7], [-1, -7], [10, 5], [0, -4], [-7, 6], [3, 0], [6, 1], [-4, -6], [1, 10], [-3, -3]], "area": 10, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [1, 3, 9, 7]} | 1 |
construct-rlve-largest-rectangle-l2-s9 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 2 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 10 distinct lattice points, indexed 0..9:
0: (-4, 4)
1: (0, 0)
2: (-8, -7)
3: (-6, 10)
4: (0, 4)
5: (3, 7)
6: (-4, 6)
7: (-4, 0)
8: (-10, -3)
9: (1, 5)
Choose four distinct points that are the vertices of a rectangle (sides need not be axis-parallel) of area exactly 16; this is the largest area of any re... | {"points": [[-4, 4], [0, 0], [-8, -7], [-6, 10], [0, 4], [3, 7], [-4, 6], [-4, 0], [-10, -3], [1, 5]], "area": 16, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [0, 4, 1, 7]} | 1 |
construct-rlve-largest-rectangle-l3-s0 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 3 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 16 distinct lattice points, indexed 0..15:
0: (6, -7)
1: (11, -16)
2: (13, 0)
3: (-3, -5)
4: (13, -14)
5: (20, -7)
6: (0, -15)
7: (14, -7)
8: (3, 13)
9: (-7, 12)
10: (-5, 11)
11: (-8, 1)
12: (-2, 0)
13: (15, 9)
14: (0, 16)
15: (-7, 8)
Choose four distinct points that are the vertices of a rectangle (side... | {"points": [[6, -7], [11, -16], [13, 0], [-3, -5], [13, -14], [20, -7], [0, -15], [14, -7], [3, 13], [-7, 12], [-5, 11], [-8, 1], [-2, 0], [15, 9], [0, 16], [-7, 8]], "area": 98, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [0, 2, 5, 4]} | 1 |
construct-rlve-largest-rectangle-l3-s1 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 3 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 16 distinct lattice points, indexed 0..15:
0: (11, 12)
1: (1, 3)
2: (2, 3)
3: (1, 11)
4: (1, -1)
5: (16, -15)
6: (-10, 13)
7: (14, -9)
8: (8, -14)
9: (3, 0)
10: (-3, -1)
11: (-3, 3)
12: (15, 7)
13: (-3, -15)
14: (-6, -15)
15: (13, 5)
Choose four distinct points that are the vertices of a rectangle (sides... | {"points": [[11, 12], [1, 3], [2, 3], [1, 11], [1, -1], [16, -15], [-10, 13], [14, -9], [8, -14], [3, 0], [-3, -1], [-3, 3], [15, 7], [-3, -15], [-6, -15], [13, 5]], "area": 16, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [1, 4, 10, 11]} | 1 |
construct-rlve-largest-rectangle-l3-s2 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 3 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 16 distinct lattice points, indexed 0..15:
0: (-3, -7)
1: (-4, 10)
2: (-8, -6)
3: (5, -6)
4: (14, 15)
5: (8, -9)
6: (-13, -15)
7: (1, 0)
8: (-1, -2)
9: (6, -1)
10: (14, 16)
11: (-9, 15)
12: (0, -5)
13: (-5, 1)
14: (10, 11)
15: (-9, 0)
Choose four distinct points that are the vertices of a rectangle (side... | {"points": [[-3, -7], [-4, 10], [-8, -6], [5, -6], [14, 15], [8, -9], [-13, -15], [1, 0], [-1, -2], [6, -1], [14, 16], [-9, 15], [0, -5], [-5, 1], [10, 11], [-9, 0]], "area": 26, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [3, 9, 7, 12]} | 1 |
construct-rlve-largest-rectangle-l3-s3 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 3 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 16 distinct lattice points, indexed 0..15:
0: (-5, -15)
1: (3, 12)
2: (-14, 10)
3: (-11, -10)
4: (13, 16)
5: (-15, -11)
6: (-16, -2)
7: (-5, -10)
8: (4, -3)
9: (-9, -11)
10: (3, -3)
11: (5, -8)
12: (4, -10)
13: (7, -4)
14: (-1, -4)
15: (0, -9)
Choose four distinct points that are the vertices of a rectan... | {"points": [[-5, -15], [3, 12], [-14, 10], [-11, -10], [13, 16], [-15, -11], [-16, -2], [-5, -10], [4, -3], [-9, -11], [3, -3], [5, -8], [4, -10], [7, -4], [-1, -4], [0, -9]], "area": 26, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [8, 11, 15, 14]} | 1 |
construct-rlve-largest-rectangle-l3-s4 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 3 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 16 distinct lattice points, indexed 0..15:
0: (-5, -16)
1: (-1, -5)
2: (3, 2)
3: (15, -12)
4: (8, -5)
5: (1, -4)
6: (-4, 6)
7: (-12, 11)
8: (-3, -13)
9: (-13, 4)
10: (5, -14)
11: (-5, 16)
12: (-8, 7)
13: (9, -15)
14: (-8, -1)
15: (-8, 11)
Choose four distinct points that are the vertices of a rectangle (... | {"points": [[-5, -16], [-1, -5], [3, 2], [15, -12], [8, -5], [1, -4], [-4, 6], [-12, 11], [-3, -13], [-13, 4], [5, -14], [-5, 16], [-8, 7], [9, -15], [-8, -1], [-8, 11]], "area": 65, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [1, 2, 6, 14]} | 1 |
construct-rlve-largest-rectangle-l3-s5 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 3 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 16 distinct lattice points, indexed 0..15:
0: (-3, 12)
1: (-13, 2)
2: (1, 0)
3: (-1, 7)
4: (-2, -3)
5: (7, -1)
6: (-6, -2)
7: (-3, -6)
8: (12, -8)
9: (16, -3)
10: (-16, -8)
11: (12, 16)
12: (0, -12)
13: (13, 11)
14: (-8, 5)
15: (-8, 16)
Choose four distinct points that are the vertices of a rectangle (si... | {"points": [[-3, 12], [-13, 2], [1, 0], [-1, 7], [-2, -3], [7, -1], [-6, -2], [-3, -6], [12, -8], [16, -3], [-16, -8], [12, 16], [0, -12], [13, 11], [-8, 5], [-8, 16]], "area": 53, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [2, 3, 14, 6]} | 1 |
construct-rlve-largest-rectangle-l3-s6 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 3 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 16 distinct lattice points, indexed 0..15:
0: (-16, -5)
1: (-10, 4)
2: (15, 10)
3: (-6, 2)
4: (7, 11)
5: (14, -12)
6: (0, 2)
7: (-2, 2)
8: (13, -6)
9: (-4, 16)
10: (-16, 15)
11: (13, 9)
12: (-6, -4)
13: (9, 2)
14: (0, -4)
15: (-16, -13)
Choose four distinct points that are the vertices of a rectangle (si... | {"points": [[-16, -5], [-10, 4], [15, 10], [-6, 2], [7, 11], [14, -12], [0, 2], [-2, 2], [13, -6], [-4, 16], [-16, 15], [13, 9], [-6, -4], [9, 2], [0, -4], [-16, -13]], "area": 36, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [3, 6, 14, 12]} | 1 |
construct-rlve-largest-rectangle-l3-s7 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 3 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 16 distinct lattice points, indexed 0..15:
0: (0, -5)
1: (-5, -10)
2: (13, -9)
3: (-16, 9)
4: (-8, -4)
5: (-3, 12)
6: (-3, -6)
7: (-10, -9)
8: (-8, 2)
9: (-5, -11)
10: (8, 2)
11: (-11, 13)
12: (1, -7)
13: (-12, -1)
14: (4, 9)
15: (7, -7)
Choose four distinct points that are the vertices of a rectangle (s... | {"points": [[0, -5], [-5, -10], [13, -9], [-16, 9], [-8, -4], [-3, 12], [-3, -6], [-10, -9], [-8, 2], [-5, -11], [8, 2], [-11, 13], [1, -7], [-12, -1], [4, 9], [7, -7]], "area": 29, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [4, 6, 9, 7]} | 1 |
construct-rlve-largest-rectangle-l3-s8 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 3 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 16 distinct lattice points, indexed 0..15:
0: (0, 6)
1: (-13, -1)
2: (-3, 5)
3: (2, -7)
4: (-2, 8)
5: (4, -3)
6: (-13, -10)
7: (-10, 7)
8: (10, -6)
9: (16, 13)
10: (-9, -1)
11: (3, 11)
12: (-14, -5)
13: (5, 6)
14: (15, -4)
15: (-1, 0)
Choose four distinct points that are the vertices of a rectangle (side... | {"points": [[0, 6], [-13, -1], [-3, 5], [2, -7], [-2, 8], [4, -3], [-13, -10], [-10, 7], [10, -6], [16, 13], [-9, -1], [3, 11], [-14, -5], [5, 6], [15, -4], [-1, 0]], "area": 65, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [4, 7, 10, 15]} | 1 |
construct-rlve-largest-rectangle-l3-s9 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 3 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 16 distinct lattice points, indexed 0..15:
0: (7, 2)
1: (-7, -8)
2: (-12, -5)
3: (0, 6)
4: (6, 0)
5: (6, -6)
6: (7, 11)
7: (1, 8)
8: (3, 14)
9: (9, -8)
10: (9, -3)
11: (-3, 3)
12: (3, -3)
13: (16, 15)
14: (-1, 2)
15: (-13, -13)
Choose four distinct points that are the vertices of a rectangle (sides need ... | {"points": [[7, 2], [-7, -8], [-12, -5], [0, 6], [6, 0], [6, -6], [7, 11], [1, 8], [3, 14], [9, -8], [9, -3], [-3, 3], [3, -3], [16, 15], [-1, 2], [-13, -13]], "area": 54, "family": "rlve_largest_rectangle", "subset": "construct"} | null | null | null | {"indices": [3, 10, 5, 11]} | 1 |
construct-rlve-largest-rectangle-l4-s0 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 4 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 25 distinct lattice points, indexed 0..24:
0: (-23, -21)
1: (-18, 15)
2: (-21, -2)
3: (-8, -6)
4: (-20, -6)
5: (0, -7)
6: (-1, -12)
7: (25, 4)
8: (-2, -21)
9: (-10, -14)
10: (-19, 8)
11: (16, 4)
12: (9, -15)
13: (24, 23)
14: (4, -13)
15: (20, 5)
16: (6, -18)
17: (-14, -11)
18: (16, 6)
19: (17, -2)
20: (25... | {"points": [[-23, -21], [-18, 15], [-21, -2], [-8, -6], [-20, -6], [0, -7], [-1, -12], [25, 4], [-2, -21], [-10, -14], [-19, 8], [16, 4], [9, -15], [24, 23], [4, -13], [20, 5], [6, -18], [-14, -11], [16, 6], [17, -2], [25, 18], [-16, 3], [17, -9], [5, -8], [7, 4]], "area": 26, "family": "rlve_largest_rectangle", "subse... | null | null | null | {"indices": [5, 6, 14, 23]} | 1 |
construct-rlve-largest-rectangle-l4-s1 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 4 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 25 distinct lattice points, indexed 0..24:
0: (5, -7)
1: (-19, 16)
2: (-13, 20)
3: (-19, -13)
4: (18, -1)
5: (3, -3)
6: (3, -21)
7: (14, -17)
8: (-12, 21)
9: (13, -1)
10: (9, 4)
11: (-6, -7)
12: (8, 1)
13: (9, -13)
14: (3, -5)
15: (-7, 19)
16: (21, -3)
17: (-24, 4)
18: (7, -5)
19: (-5, 24)
20: (-19, 8)
21... | {"points": [[5, -7], [-19, 16], [-13, 20], [-19, -13], [18, -1], [3, -3], [3, -21], [14, -17], [-12, 21], [13, -1], [9, 4], [-6, -7], [8, 1], [9, -13], [3, -5], [-7, 19], [21, -3], [-24, 4], [7, -5], [-5, 24], [-19, 8], [23, -20], [-16, 4], [-4, 7], [-6, -11]], "area": 153, "family": "rlve_largest_rectangle", "subset":... | null | null | null | {"indices": [1, 15, 23, 22]} | 1 |
construct-rlve-largest-rectangle-l4-s2 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 4 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 25 distinct lattice points, indexed 0..24:
0: (-25, 20)
1: (1, -6)
2: (4, -5)
3: (-7, 6)
4: (22, -7)
5: (25, -5)
6: (-7, -13)
7: (-1, -5)
8: (14, 13)
9: (-19, 4)
10: (-8, -9)
11: (-11, 12)
12: (20, 22)
13: (-9, 11)
14: (16, 5)
15: (-20, -22)
16: (9, 4)
17: (5, 0)
18: (-23, 18)
19: (5, 4)
20: (24, 3)
21: (... | {"points": [[-25, 20], [1, -6], [4, -5], [-7, 6], [22, -7], [25, -5], [-7, -13], [-1, -5], [14, 13], [-19, 4], [-8, -9], [-11, 12], [20, 22], [-9, 11], [16, 5], [-20, -22], [9, 4], [5, 0], [-23, 18], [5, 4], [24, 3], [-14, 17], [24, -21], [7, -1], [9, 0]], "area": 16, "family": "rlve_largest_rectangle", "subset": "cons... | null | null | null | {"indices": [16, 19, 17, 24]} | 1 |
construct-rlve-largest-rectangle-l4-s3 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 4 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 25 distinct lattice points, indexed 0..24:
0: (-1, -1)
1: (-22, -9)
2: (-10, 24)
3: (22, 12)
4: (2, 12)
5: (21, -16)
6: (7, 4)
7: (-7, 25)
8: (12, -7)
9: (-19, 21)
10: (15, 8)
11: (-12, 23)
12: (8, 1)
13: (-17, 15)
14: (4, -6)
15: (9, 5)
16: (20, 7)
17: (-20, 3)
18: (-15, -14)
19: (-6, 7)
20: (-8, 23)
21:... | {"points": [[-1, -1], [-22, -9], [-10, 24], [22, 12], [2, 12], [21, -16], [7, 4], [-7, 25], [12, -7], [-19, 21], [15, 8], [-12, 23], [8, 1], [-17, 15], [4, -6], [9, 5], [20, 7], [-20, 3], [-15, -14], [-6, 7], [-8, 23], [18, -20], [21, 16], [14, 25], [10, -11]], "area": 89, "family": "rlve_largest_rectangle", "subset": ... | null | null | null | {"indices": [0, 6, 4, 19]} | 1 |
construct-rlve-largest-rectangle-l4-s4 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 4 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 25 distinct lattice points, indexed 0..24:
0: (-11, -23)
1: (-20, -10)
2: (20, 11)
3: (-6, -15)
4: (-14, -10)
5: (1, 4)
6: (-6, 11)
7: (-11, -25)
8: (-9, -2)
9: (9, 14)
10: (-1, -7)
11: (-23, 13)
12: (20, -11)
13: (0, 25)
14: (16, -20)
15: (23, -15)
16: (24, 23)
17: (-5, 18)
18: (-17, -17)
19: (-25, -12)
... | {"points": [[-11, -23], [-20, -10], [20, 11], [-6, -15], [-14, -10], [1, 4], [-6, 11], [-11, -25], [-9, -2], [9, 14], [-1, -7], [-23, 13], [20, -11], [0, 25], [16, -20], [23, -15], [24, 23], [-5, 18], [-17, -17], [-25, -12], [21, 3], [3, -2], [-9, -9], [-15, -18], [7, 2]], "area": 89, "family": "rlve_largest_rectangle"... | null | null | null | {"indices": [3, 4, 8, 10]} | 1 |
construct-rlve-largest-rectangle-l4-s5 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 4 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 25 distinct lattice points, indexed 0..24:
0: (-8, -12)
1: (0, 24)
2: (-6, -1)
3: (-4, 6)
4: (1, -4)
5: (5, 6)
6: (21, -11)
7: (9, 23)
8: (9, 0)
9: (24, 25)
10: (-2, 16)
11: (7, 4)
12: (-12, 22)
13: (18, 19)
14: (3, 4)
15: (7, -13)
16: (13, 14)
17: (-25, -25)
18: (-12, -12)
19: (5, -22)
20: (-15, 11)
21: ... | {"points": [[-8, -12], [0, 24], [-6, -1], [-4, 6], [1, -4], [5, 6], [21, -11], [9, 23], [9, 0], [24, 25], [-2, 16], [7, 4], [-12, 22], [18, 19], [3, 4], [7, -13], [13, 14], [-25, -25], [-12, -12], [5, -22], [-15, 11], [5, 2], [-5, -20], [-8, 18], [-1, -8]], "area": 8, "family": "rlve_largest_rectangle", "subset": "cons... | null | null | null | {"indices": [5, 11, 21, 14]} | 1 |
construct-rlve-largest-rectangle-l4-s6 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 4 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 25 distinct lattice points, indexed 0..24:
0: (1, -4)
1: (12, -9)
2: (12, 23)
3: (-17, -23)
4: (13, -10)
5: (4, -12)
6: (16, -14)
7: (16, 13)
8: (-10, -18)
9: (-19, 9)
10: (-8, -18)
11: (-8, -24)
12: (7, 24)
13: (-13, -9)
14: (11, -1)
15: (1, 15)
16: (14, -13)
17: (9, -1)
18: (-19, 13)
19: (6, 2)
20: (-2,... | {"points": [[1, -4], [12, -9], [12, 23], [-17, -23], [13, -10], [4, -12], [16, -14], [16, 13], [-10, -18], [-19, 9], [-8, -18], [-8, -24], [7, 24], [-13, -9], [11, -1], [1, 15], [14, -13], [9, -1], [-19, 13], [6, 2], [-2, 10], [-3, 23], [18, 1], [-11, -3], [-4, -13]], "area": 73, "family": "rlve_largest_rectangle", "su... | null | null | null | {"indices": [0, 5, 1, 17]} | 1 |
construct-rlve-largest-rectangle-l4-s7 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 4 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 25 distinct lattice points, indexed 0..24:
0: (8, 19)
1: (-7, -2)
2: (5, -18)
3: (24, -19)
4: (-1, -12)
5: (-16, 1)
6: (2, -20)
7: (3, -9)
8: (-20, -2)
9: (-16, 22)
10: (-21, -22)
11: (-21, 11)
12: (-17, -17)
13: (-24, -20)
14: (-2, -19)
15: (-2, -14)
16: (-1, -18)
17: (5, -12)
18: (-11, -21)
19: (13, -8)... | {"points": [[8, 19], [-7, -2], [5, -18], [24, -19], [-1, -12], [-16, 1], [2, -20], [3, -9], [-20, -2], [-16, 22], [-21, -22], [-21, 11], [-17, -17], [-24, -20], [-2, -19], [-2, -14], [-1, -18], [5, -12], [-11, -21], [13, -8], [23, 19], [22, -4], [-6, 24], [-23, -12], [-2, -23]], "area": 36, "family": "rlve_largest_rect... | null | null | null | {"indices": [2, 16, 4, 17]} | 1 |
construct-rlve-largest-rectangle-l4-s8 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 4 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 25 distinct lattice points, indexed 0..24:
0: (-25, -23)
1: (1, 6)
2: (14, -12)
3: (21, -10)
4: (22, -25)
5: (-18, 20)
6: (25, -10)
7: (17, 0)
8: (12, -11)
9: (15, -13)
10: (-10, 9)
11: (1, 19)
12: (15, 2)
13: (-1, 17)
14: (11, 8)
15: (5, -18)
16: (-10, -23)
17: (9, 10)
18: (-17, 3)
19: (24, 13)
20: (4, 1... | {"points": [[-25, -23], [1, 6], [14, -12], [21, -10], [22, -25], [-18, 20], [25, -10], [17, 0], [12, -11], [15, -13], [-10, 9], [1, 19], [15, 2], [-1, 17], [11, 8], [5, -18], [-10, -23], [9, 10], [-17, 3], [24, 13], [4, 15], [15, 13], [8, 10], [0, -2], [4, 13]], "area": 221, "family": "rlve_largest_rectangle", "subset"... | null | null | null | {"indices": [10, 11, 14, 23]} | 1 |
construct-rlve-largest-rectangle-l4-s9 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 4 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 25 distinct lattice points, indexed 0..24:
0: (-10, -1)
1: (16, -19)
2: (7, -17)
3: (-21, -16)
4: (-19, -19)
5: (-5, -18)
6: (1, -1)
7: (10, -7)
8: (19, -18)
9: (-2, -5)
10: (5, 16)
11: (-12, -5)
12: (12, -6)
13: (-11, 12)
14: (12, -25)
15: (-4, -12)
16: (20, 7)
17: (-23, -10)
18: (12, 6)
19: (-12, -12)
2... | {"points": [[-10, -1], [16, -19], [7, -17], [-21, -16], [-19, -19], [-5, -18], [1, -1], [10, -7], [19, -18], [-2, -5], [5, 16], [-12, -5], [12, -6], [-11, 12], [12, -25], [-4, -12], [20, 7], [-23, -10], [12, 6], [-12, -12], [-17, 8], [1, 23], [-23, 5], [14, -20], [9, 14]], "area": 146, "family": "rlve_largest_rectangle... | null | null | null | {"indices": [2, 12, 6, 15]} | 1 |
construct-rlve-largest-rectangle-l5-s0 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 5 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 40 distinct lattice points, indexed 0..39:
0: (-25, 14)
1: (-27, 23)
2: (8, -5)
3: (12, 15)
4: (-20, -7)
5: (-39, 22)
6: (-29, -31)
7: (2, -37)
8: (-32, 39)
9: (40, -23)
10: (38, 19)
11: (-16, -4)
12: (-28, -35)
13: (29, -14)
14: (-9, -40)
15: (12, 7)
16: (18, 31)
17: (-20, 20)
18: (-14, -16)
19: (-23, 34... | {"points": [[-25, 14], [-27, 23], [8, -5], [12, 15], [-20, -7], [-39, 22], [-29, -31], [2, -37], [-32, 39], [40, -23], [38, 19], [-16, -4], [-28, -35], [29, -14], [-9, -40], [12, 7], [18, 31], [-20, 20], [-14, -16], [-23, 34], [0, -23], [23, -29], [25, 35], [-49, -19], [33, 1], [12, 34], [23, 17], [-22, -39], [-26, 22]... | null | null | null | {"indices": [18, 29, 23, 38]} | 1 |
construct-rlve-largest-rectangle-l5-s1 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 5 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 40 distinct lattice points, indexed 0..39:
0: (-23, 21)
1: (0, -23)
2: (-25, 12)
3: (6, 19)
4: (17, 38)
5: (-21, -27)
6: (-6, 23)
7: (5, 17)
8: (6, 17)
9: (1, 29)
10: (-37, -7)
11: (-9, 36)
12: (12, -13)
13: (18, 25)
14: (15, 16)
15: (9, 28)
16: (10, -13)
17: (25, 25)
18: (15, -14)
19: (-6, -40)
20: (-31,... | {"points": [[-23, 21], [0, -23], [-25, 12], [6, 19], [17, 38], [-21, -27], [-6, 23], [5, 17], [6, 17], [1, 29], [-37, -7], [-9, 36], [12, -13], [18, 25], [15, 16], [9, 28], [10, -13], [25, 25], [15, -14], [-6, -40], [-31, 38], [-26, 32], [-39, -37], [-15, -15], [12, 8], [-11, 13], [18, 15], [-7, 36], [-7, -20], [-38, 1... | null | null | null | {"indices": [3, 14, 13, 15]} | 1 |
construct-rlve-largest-rectangle-l5-s2 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 5 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 40 distinct lattice points, indexed 0..39:
0: (1, -16)
1: (16, -11)
2: (25, -24)
3: (26, -40)
4: (34, -15)
5: (12, 11)
6: (-26, 2)
7: (31, -9)
8: (-3, -40)
9: (-28, 35)
10: (27, 33)
11: (-23, -12)
12: (25, -35)
13: (-33, -11)
14: (32, 8)
15: (-14, -19)
16: (-34, 1)
17: (-36, -35)
18: (-7, 3)
19: (8, -13)
... | {"points": [[1, -16], [16, -11], [25, -24], [26, -40], [34, -15], [12, 11], [-26, 2], [31, -9], [-3, -40], [-28, 35], [27, 33], [-23, -12], [25, -35], [-33, -11], [32, 8], [-14, -19], [-34, 1], [-36, -35], [-7, 3], [8, -13], [24, 25], [-3, -26], [35, 19], [-2, -39], [-8, -28], [-10, 10], [2, 12], [-3, -27], [30, 7], [2... | null | null | null | {"indices": [11, 18, 19, 24]} | 1 |
construct-rlve-largest-rectangle-l5-s3 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 5 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 40 distinct lattice points, indexed 0..39:
0: (-20, 37)
1: (36, -19)
2: (-9, -38)
3: (1, 2)
4: (28, -12)
5: (-3, -7)
6: (-7, -18)
7: (-11, 7)
8: (-12, 9)
9: (17, -14)
10: (3, 15)
11: (-31, -14)
12: (35, 20)
13: (0, -6)
14: (0, 36)
15: (-28, 6)
16: (31, 33)
17: (16, 30)
18: (-7, 3)
19: (-30, -12)
20: (2, 4... | {"points": [[-20, 37], [36, -19], [-9, -38], [1, 2], [28, -12], [-3, -7], [-7, -18], [-11, 7], [-12, 9], [17, -14], [3, 15], [-31, -14], [35, 20], [0, -6], [0, 36], [-28, 6], [31, 33], [16, 30], [-7, 3], [-30, -12], [2, 4], [11, 1], [-36, 24], [-39, -7], [-12, -16], [-37, -38], [19, -16], [26, -36], [14, 19], [21, 19],... | null | null | null | {"indices": [5, 7, 10, 21]} | 1 |
construct-rlve-largest-rectangle-l5-s4 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 5 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 40 distinct lattice points, indexed 0..39:
0: (-11, 14)
1: (25, 34)
2: (-20, 12)
3: (24, 30)
4: (-14, -1)
5: (-22, 16)
6: (-12, 18)
7: (-21, 13)
8: (-24, 29)
9: (38, 1)
10: (-4, 1)
11: (6, 16)
12: (-34, -35)
13: (-32, -14)
14: (15, -13)
15: (10, 9)
16: (32, -12)
17: (16, -30)
18: (-15, 8)
19: (-19, 15)
20... | {"points": [[-11, 14], [25, 34], [-20, 12], [24, 30], [-14, -1], [-22, 16], [-12, 18], [-21, 13], [-24, 29], [38, 1], [-4, 1], [6, 16], [-34, -35], [-32, -14], [15, -13], [10, 9], [32, -12], [16, -30], [-15, 8], [-19, 15], [5, -32], [31, 18], [8, 0], [-22, 5], [17, -2], [19, -15], [-27, -14], [-35, -31], [32, 9], [-1, ... | null | null | null | {"indices": [15, 22, 24, 39]} | 1 |
construct-rlve-largest-rectangle-l5-s5 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 5 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 40 distinct lattice points, indexed 0..39:
0: (-22, 36)
1: (35, 33)
2: (-32, -27)
3: (6, 34)
4: (27, -7)
5: (38, 5)
6: (12, -25)
7: (-22, -17)
8: (36, -33)
9: (-3, 17)
10: (34, 25)
11: (-33, -34)
12: (21, 24)
13: (25, 31)
14: (2, 9)
15: (7, -4)
16: (4, 29)
17: (39, -9)
18: (25, -27)
19: (-13, 24)
20: (-29... | {"points": [[-22, 36], [35, 33], [-32, -27], [6, 34], [27, -7], [38, 5], [12, -25], [-22, -17], [36, -33], [-3, 17], [34, 25], [-33, -34], [21, 24], [25, 31], [2, 9], [7, -4], [4, 29], [39, -9], [25, -27], [-13, 24], [-29, -14], [-17, 33], [12, -7], [5, 30], [13, 4], [14, 0], [40, -40], [-10, 26], [38, 8], [25, -5], [1... | null | null | null | {"indices": [12, 30, 22, 33]} | 1 |
construct-rlve-largest-rectangle-l5-s6 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 5 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 40 distinct lattice points, indexed 0..39:
0: (-32, 1)
1: (-27, -36)
2: (5, 18)
3: (20, 34)
4: (-30, -32)
5: (-26, -32)
6: (-39, 0)
7: (-12, 7)
8: (36, 14)
9: (-15, -8)
10: (-9, 36)
11: (36, -30)
12: (-32, -21)
13: (-4, 2)
14: (-2, -2)
15: (-37, 3)
16: (-12, 38)
17: (23, 19)
18: (1, 10)
19: (-12, -17)
20:... | {"points": [[-32, 1], [-27, -36], [5, 18], [20, 34], [-30, -32], [-26, -32], [-39, 0], [-12, 7], [36, 14], [-15, -8], [-9, 36], [36, -30], [-32, -21], [-4, 2], [-2, -2], [-37, 3], [-12, 38], [23, 19], [1, 10], [-12, -17], [20, -33], [-18, 18], [27, -17], [-7, 15], [21, -1], [-17, 27], [0, -4], [-5, 20], [-3, 30], [-31,... | null | null | null | {"indices": [7, 13, 18, 23]} | 1 |
construct-rlve-largest-rectangle-l5-s7 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 5 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 40 distinct lattice points, indexed 0..39:
0: (-6, -3)
1: (11, -36)
2: (31, 4)
3: (1, -22)
4: (10, 16)
5: (-23, 0)
6: (28, -14)
7: (2, -9)
8: (5, 23)
9: (30, 10)
10: (20, -22)
11: (-19, -2)
12: (-17, 37)
13: (30, -18)
14: (-14, -1)
15: (-13, -34)
16: (12, 26)
17: (39, -6)
18: (-5, -10)
19: (38, -8)
20: (3... | {"points": [[-6, -3], [11, -36], [31, 4], [1, -22], [10, 16], [-23, 0], [28, -14], [2, -9], [5, 23], [30, 10], [20, -22], [-19, -2], [-17, 37], [30, -18], [-14, -1], [-13, -34], [12, 26], [39, -6], [-5, -10], [38, -8], [32, 25], [-3, -25], [-14, -20], [9, 26], [35, -22], [5, -21], [1, -2], [-32, -23], [30, -8], [-14, -... | null | null | null | {"indices": [0, 18, 7, 26]} | 1 |
construct-rlve-largest-rectangle-l5-s8 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 5 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 40 distinct lattice points, indexed 0..39:
0: (24, -30)
1: (-39, -20)
2: (33, -35)
3: (-22, -26)
4: (-39, -40)
5: (-32, 26)
6: (-35, 19)
7: (-7, -28)
8: (27, -10)
9: (23, -24)
10: (3, -33)
11: (-28, 39)
12: (-6, 27)
13: (2, 38)
14: (-26, 9)
15: (-3, 33)
16: (-38, -1)
17: (-9, -22)
18: (-27, 6)
19: (8, -30... | {"points": [[24, -30], [-39, -20], [33, -35], [-22, -26], [-39, -40], [-32, 26], [-35, 19], [-7, -28], [27, -10], [23, -24], [3, -33], [-28, 39], [-6, 27], [2, 38], [-26, 9], [-3, 33], [-38, -1], [-9, -22], [-27, 6], [8, -30], [29, -4], [-34, -40], [-11, 14], [25, 28], [-1, -12], [21, 20], [20, -25], [37, 30], [28, -37... | null | null | null | {"indices": [30, 34, 31, 37]} | 1 |
construct-rlve-largest-rectangle-l5-s9 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 5 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 40 distinct lattice points, indexed 0..39:
0: (-13, 11)
1: (6, 19)
2: (15, 11)
3: (-8, 27)
4: (3, 2)
5: (-39, 21)
6: (-5, 16)
7: (-14, -19)
8: (31, 13)
9: (18, -40)
10: (39, -6)
11: (40, 5)
12: (-5, 27)
13: (-2, 10)
14: (4, 35)
15: (15, 1)
16: (-39, -15)
17: (33, 32)
18: (-27, 16)
19: (10, -5)
20: (-28, 8... | {"points": [[-13, 11], [6, 19], [15, 11], [-8, 27], [3, 2], [-39, 21], [-5, 16], [-14, -19], [31, 13], [18, -40], [39, -6], [40, 5], [-5, 27], [-2, 10], [4, 35], [15, 1], [-39, -15], [33, 32], [-27, 16], [10, -5], [-28, 8], [33, -16], [-1, -15], [21, 4], [-4, 34], [0, 28], [-9, -39], [20, -36], [-31, -33], [24, -16], [... | null | null | null | {"indices": [1, 2, 38, 13]} | 1 |
construct-rlve-largest-rectangle-l6-s0 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 6 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 60 distinct lattice points, indexed 0..59:
0: (59, -11)
1: (-51, -43)
2: (33, -40)
3: (21, 60)
4: (5, -54)
5: (-32, 24)
6: (20, 34)
7: (-44, 1)
8: (57, -16)
9: (-35, -16)
10: (-41, 42)
11: (52, 29)
12: (-38, -36)
13: (10, 18)
14: (35, -60)
15: (32, -16)
16: (38, 27)
17: (-50, 17)
18: (-39, 15)
19: (14, -1... | {"points": [[59, -11], [-51, -43], [33, -40], [21, 60], [5, -54], [-32, 24], [20, 34], [-44, 1], [57, -16], [-35, -16], [-41, 42], [52, 29], [-38, -36], [10, 18], [35, -60], [32, -16], [38, 27], [-50, 17], [-39, 15], [14, -18], [56, -32], [24, -26], [2, 43], [52, -47], [-12, 56], [16, -46], [-22, -34], [-54, 46], [-30,... | null | null | null | {"indices": [15, 21, 19, 57]} | 1 |
construct-rlve-largest-rectangle-l6-s1 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 6 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 60 distinct lattice points, indexed 0..59:
0: (57, -24)
1: (9, 32)
2: (55, -11)
3: (-38, -1)
4: (-22, 8)
5: (34, 54)
6: (-41, 55)
7: (15, 15)
8: (39, 57)
9: (28, -42)
10: (7, 48)
11: (6, 36)
12: (-23, -3)
13: (21, 49)
14: (33, -33)
15: (41, -53)
16: (-10, 20)
17: (16, 49)
18: (33, 42)
19: (-26, -51)
20: (... | {"points": [[57, -24], [9, 32], [55, -11], [-38, -1], [-22, 8], [34, 54], [-41, 55], [15, 15], [39, 57], [28, -42], [7, 48], [6, 36], [-23, -3], [21, 49], [33, -33], [41, -53], [-10, 20], [16, 49], [33, 42], [-26, -51], [-24, 0], [-4, -13], [-48, 47], [44, 18], [49, -3], [-14, 45], [30, -30], [-22, -31], [-34, -45], [-... | null | null | null | {"indices": [1, 17, 18, 47]} | 1 |
construct-rlve-largest-rectangle-l6-s2 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 6 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 60 distinct lattice points, indexed 0..59:
0: (-42, -3)
1: (-6, -7)
2: (4, -20)
3: (7, 3)
4: (55, -53)
5: (-49, 1)
6: (-31, 58)
7: (-13, 43)
8: (50, -59)
9: (-46, 22)
10: (17, -10)
11: (-40, 5)
12: (-46, 35)
13: (49, 50)
14: (31, -18)
15: (52, -17)
16: (-16, -3)
17: (57, 20)
18: (42, -22)
19: (-49, 49)
20... | {"points": [[-42, -3], [-6, -7], [4, -20], [7, 3], [55, -53], [-49, 1], [-31, 58], [-13, 43], [50, -59], [-46, 22], [17, -10], [-40, 5], [-46, 35], [49, 50], [31, -18], [52, -17], [-16, -3], [57, 20], [42, -22], [-49, 49], [-14, -4], [31, -4], [22, 25], [23, -54], [7, -45], [-41, -3], [-48, 58], [-33, -47], [60, 11], [... | null | null | null | {"indices": [1, 2, 10, 3]} | 1 |
construct-rlve-largest-rectangle-l6-s3 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 6 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 60 distinct lattice points, indexed 0..59:
0: (-7, -60)
1: (-4, 9)
2: (17, 6)
3: (47, -21)
4: (20, 52)
5: (-55, -40)
6: (-23, 59)
7: (23, 18)
8: (13, -46)
9: (-35, 54)
10: (-50, -22)
11: (54, -5)
12: (-3, -15)
13: (-54, -44)
14: (-9, -50)
15: (26, 25)
16: (44, 33)
17: (18, -21)
18: (-9, -45)
19: (37, -40)... | {"points": [[-7, -60], [-4, 9], [17, 6], [47, -21], [20, 52], [-55, -40], [-23, 59], [23, 18], [13, -46], [-35, 54], [-50, -22], [54, -5], [-3, -15], [-54, -44], [-9, -50], [26, 25], [44, 33], [18, -21], [-9, -45], [37, -40], [60, -43], [15, -24], [-49, 51], [-51, -23], [-12, 23], [19, -15], [19, 28], [12, -53], [-27, ... | null | null | null | {"indices": [7, 15, 26, 58]} | 1 |
construct-rlve-largest-rectangle-l6-s4 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 6 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 60 distinct lattice points, indexed 0..59:
0: (-47, 25)
1: (-11, -57)
2: (-11, -16)
3: (15, 1)
4: (59, 44)
5: (-34, 9)
6: (-16, -57)
7: (-54, -27)
8: (11, -48)
9: (54, 5)
10: (-38, 52)
11: (11, -18)
12: (-8, 11)
13: (-47, 57)
14: (43, -5)
15: (-1, -42)
16: (23, -39)
17: (39, 18)
18: (-59, 16)
19: (4, -27)... | {"points": [[-47, 25], [-11, -57], [-11, -16], [15, 1], [59, 44], [-34, 9], [-16, -57], [-54, -27], [11, -48], [54, 5], [-38, 52], [11, -18], [-8, 11], [-47, 57], [43, -5], [-1, -42], [23, -39], [39, 18], [-59, 16], [4, -27], [22, 24], [-20, -19], [9, 15], [43, 56], [-27, 12], [17, 46], [59, 60], [-23, -36], [50, -48],... | null | null | null | {"indices": [6, 8, 19, 27]} | 1 |
construct-rlve-largest-rectangle-l6-s5 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 6 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 60 distinct lattice points, indexed 0..59:
0: (12, 42)
1: (47, 43)
2: (3, -57)
3: (10, -10)
4: (35, 55)
5: (-4, 5)
6: (-18, 32)
7: (-38, 3)
8: (-21, -18)
9: (-17, 57)
10: (27, -53)
11: (-26, -20)
12: (20, -26)
13: (-6, -40)
14: (-18, -18)
15: (-20, 17)
16: (54, 53)
17: (60, 12)
18: (-43, -28)
19: (14, 5)
... | {"points": [[12, 42], [47, 43], [3, -57], [10, -10], [35, 55], [-4, 5], [-18, 32], [-38, 3], [-21, -18], [-17, 57], [27, -53], [-26, -20], [20, -26], [-6, -40], [-18, -18], [-20, 17], [54, 53], [60, 12], [-43, -28], [14, 5], [47, -53], [-50, 7], [-52, 35], [4, 26], [-30, -21], [-27, -3], [10, -46], [29, 1], [3, 34], [3... | null | null | null | {"indices": [8, 47, 24, 55]} | 1 |
construct-rlve-largest-rectangle-l6-s6 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 6 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 60 distinct lattice points, indexed 0..59:
0: (-50, 7)
1: (17, 0)
2: (59, 24)
3: (10, 17)
4: (5, 58)
5: (52, -36)
6: (-58, -18)
7: (-26, -35)
8: (-34, -23)
9: (-28, -3)
10: (47, 52)
11: (56, 8)
12: (-4, -40)
13: (-12, 14)
14: (-12, -44)
15: (-6, -18)
16: (-10, -28)
17: (59, 44)
18: (55, 45)
19: (-41, -3)
... | {"points": [[-50, 7], [17, 0], [59, 24], [10, 17], [5, 58], [52, -36], [-58, -18], [-26, -35], [-34, -23], [-28, -3], [47, 52], [56, 8], [-4, -40], [-12, 14], [-12, -44], [-6, -18], [-10, -28], [59, 44], [55, 45], [-41, -3], [22, 15], [2, 39], [-45, 33], [-22, 55], [2, 7], [-52, 21], [56, -29], [34, 7], [50, 37], [38, ... | null | null | null | {"indices": [1, 3, 53, 27]} | 1 |
construct-rlve-largest-rectangle-l6-s7 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 6 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 60 distinct lattice points, indexed 0..59:
0: (35, 7)
1: (7, 58)
2: (-30, -35)
3: (-43, 9)
4: (31, -21)
5: (40, 39)
6: (10, -57)
7: (30, 45)
8: (52, -53)
9: (-2, 43)
10: (60, -45)
11: (6, 24)
12: (-59, 3)
13: (-44, 43)
14: (44, 51)
15: (-16, 60)
16: (17, -46)
17: (-41, -34)
18: (8, 38)
19: (19, -58)
20: (... | {"points": [[35, 7], [7, 58], [-30, -35], [-43, 9], [31, -21], [40, 39], [10, -57], [30, 45], [52, -53], [-2, 43], [60, -45], [6, 24], [-59, 3], [-44, 43], [44, 51], [-16, 60], [17, -46], [-41, -34], [8, 38], [19, -58], [-17, -46], [19, 31], [-42, -7], [2, -12], [-19, -42], [18, -11], [-57, -8], [-30, -36], [-26, 21], ... | null | null | null | {"indices": [23, 34, 41, 49]} | 1 |
construct-rlve-largest-rectangle-l6-s8 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 6 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 60 distinct lattice points, indexed 0..59:
0: (41, -23)
1: (-15, 1)
2: (-22, -13)
3: (-5, -51)
4: (-33, 51)
5: (-58, 42)
6: (56, 27)
7: (3, 42)
8: (32, -34)
9: (22, 0)
10: (55, -10)
11: (33, 27)
12: (-45, -23)
13: (3, 32)
14: (31, 60)
15: (-41, -44)
16: (-45, -20)
17: (-49, -37)
18: (43, 52)
19: (60, 47)
... | {"points": [[41, -23], [-15, 1], [-22, -13], [-5, -51], [-33, 51], [-58, 42], [56, 27], [3, 42], [32, -34], [22, 0], [55, -10], [33, 27], [-45, -23], [3, 32], [31, 60], [-41, -44], [-45, -20], [-49, -37], [43, 52], [60, 47], [26, -20], [13, 3], [-21, 18], [-15, -37], [41, 45], [-57, -25], [3, 59], [6, -24], [23, -43], ... | null | null | null | {"indices": [9, 20, 27, 39]} | 1 |
construct-rlve-largest-rectangle-l6-s9 | construct | rlve_largest_rectangle | largest_rectangle_in_point_set | discrete_geometry | competition | 6 | RLVE-Gym/largest_rectangle_among_points | MIT | [
"agentic_trivial"
] | You are given 60 distinct lattice points, indexed 0..59:
0: (-31, 0)
1: (26, -31)
2: (-10, -15)
3: (-46, -27)
4: (-30, 42)
5: (-14, -56)
6: (29, -17)
7: (-39, 27)
8: (-13, -28)
9: (40, 30)
10: (30, 19)
11: (18, 26)
12: (-45, -50)
13: (16, 52)
14: (-56, 31)
15: (35, -47)
16: (-31, -30)
17: (44, -4)
18: (34, -21)
19: (3,... | {"points": [[-31, 0], [26, -31], [-10, -15], [-46, -27], [-30, 42], [-14, -56], [29, -17], [-39, 27], [-13, -28], [40, 30], [30, 19], [18, 26], [-45, -50], [16, 52], [-56, 31], [35, -47], [-31, -30], [44, -4], [34, -21], [3, -25], [48, -47], [52, -47], [16, 5], [55, -24], [13, -4], [55, 2], [52, 9], [-7, -27], [22, -31... | null | null | null | {"indices": [24, 47, 29, 55]} | 1 |
construct-rlve-matrix-permutation-equivalence-l1-s0 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 1 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 3 x 2 binary matrices (0-indexed, one row per line).
A:
01
00
10
B:
10
00
01
Find a permutation a of 0..2 and a permutation b of 0..1 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 3, 0 <= j < 2.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answer.jso... | {"A": ["01", "00", "10"], "B": ["10", "00", "01"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [2, 1, 0], "b": [0, 1]} | 1 |
construct-rlve-matrix-permutation-equivalence-l1-s1 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 1 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 2 x 2 binary matrices (0-indexed, one row per line).
A:
01
10
B:
10
01
Find a permutation a of 0..1 and a permutation b of 0..1 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 2, 0 <= j < 2.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answer.json`. Th... | {"A": ["01", "10"], "B": ["10", "01"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [1, 0], "b": [0, 1]} | 1 |
construct-rlve-matrix-permutation-equivalence-l1-s2 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 1 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 2 x 2 binary matrices (0-indexed, one row per line).
A:
01
01
B:
01
01
Find a permutation a of 0..1 and a permutation b of 0..1 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 2, 0 <= j < 2.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answer.json`. Th... | {"A": ["01", "01"], "B": ["01", "01"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [0, 1], "b": [0, 1]} | 1 |
construct-rlve-matrix-permutation-equivalence-l1-s3 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 1 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 3 x 2 binary matrices (0-indexed, one row per line).
A:
10
11
01
B:
01
10
11
Find a permutation a of 0..2 and a permutation b of 0..1 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 3, 0 <= j < 2.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answer.jso... | {"A": ["10", "11", "01"], "B": ["01", "10", "11"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [2, 0, 1], "b": [0, 1]} | 1 |
construct-rlve-matrix-permutation-equivalence-l1-s4 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 1 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 3 x 3 binary matrices (0-indexed, one row per line).
A:
000
100
000
B:
000
000
010
Find a permutation a of 0..2 and a permutation b of 0..2 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 3, 0 <= j < 3.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answ... | {"A": ["000", "100", "000"], "B": ["000", "000", "010"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [2, 0, 1], "b": [1, 0, 2]} | 1 |
construct-rlve-matrix-permutation-equivalence-l1-s5 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 1 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 3 x 3 binary matrices (0-indexed, one row per line).
A:
110
101
110
B:
110
101
110
Find a permutation a of 0..2 and a permutation b of 0..2 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 3, 0 <= j < 3.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answ... | {"A": ["110", "101", "110"], "B": ["110", "101", "110"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [2, 1, 0], "b": [0, 1, 2]} | 1 |
construct-rlve-matrix-permutation-equivalence-l1-s6 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 1 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 2 x 3 binary matrices (0-indexed, one row per line).
A:
110
011
B:
011
110
Find a permutation a of 0..1 and a permutation b of 0..2 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 2, 0 <= j < 3.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answer.json`... | {"A": ["110", "011"], "B": ["011", "110"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [0, 1], "b": [2, 1, 0]} | 1 |
construct-rlve-matrix-permutation-equivalence-l1-s7 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 1 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 2 x 3 binary matrices (0-indexed, one row per line).
A:
111
101
B:
110
111
Find a permutation a of 0..1 and a permutation b of 0..2 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 2, 0 <= j < 3.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answer.json`... | {"A": ["111", "101"], "B": ["110", "111"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [1, 0], "b": [2, 0, 1]} | 1 |
construct-rlve-matrix-permutation-equivalence-l1-s8 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 1 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 2 x 3 binary matrices (0-indexed, one row per line).
A:
100
000
B:
000
010
Find a permutation a of 0..1 and a permutation b of 0..2 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 2, 0 <= j < 3.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answer.json`... | {"A": ["100", "000"], "B": ["000", "010"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [1, 0], "b": [1, 0, 2]} | 1 |
construct-rlve-matrix-permutation-equivalence-l1-s9 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 1 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 3 x 3 binary matrices (0-indexed, one row per line).
A:
111
101
110
B:
111
011
110
Find a permutation a of 0..2 and a permutation b of 0..2 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 3, 0 <= j < 3.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answ... | {"A": ["111", "101", "110"], "B": ["111", "011", "110"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [0, 2, 1], "b": [2, 0, 1]} | 1 |
construct-rlve-matrix-permutation-equivalence-l2-s0 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 2 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 3 x 5 binary matrices (0-indexed, one row per line).
A:
00001
00000
00000
B:
00000
01000
00000
Find a permutation a of 0..2 and a permutation b of 0..4 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 3, 0 <= j < 5.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/... | {"A": ["00001", "00000", "00000"], "B": ["00000", "01000", "00000"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [1, 0, 2], "b": [0, 4, 2, 3, 1]} | 1 |
construct-rlve-matrix-permutation-equivalence-l2-s1 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 2 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 4 x 5 binary matrices (0-indexed, one row per line).
A:
00111
10001
00101
01100
B:
01010
11000
11100
10001
Find a permutation a of 0..3 and a permutation b of 0..4 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 4, 0 <= j < 5.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer a... | {"A": ["00111", "10001", "00101", "01100"], "B": ["01010", "11000", "11100", "10001"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [1, 2, 0, 3], "b": [2, 4, 3, 0, 1]} | 1 |
construct-rlve-matrix-permutation-equivalence-l2-s2 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 2 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 3 x 3 binary matrices (0-indexed, one row per line).
A:
010
111
011
B:
100
101
111
Find a permutation a of 0..2 and a permutation b of 0..2 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 3, 0 <= j < 3.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answ... | {"A": ["010", "111", "011"], "B": ["100", "101", "111"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [0, 2, 1], "b": [1, 0, 2]} | 1 |
construct-rlve-matrix-permutation-equivalence-l2-s3 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 2 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 4 x 2 binary matrices (0-indexed, one row per line).
A:
01
11
10
11
B:
10
11
01
11
Find a permutation a of 0..3 and a permutation b of 0..1 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 4, 0 <= j < 2.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answ... | {"A": ["01", "11", "10", "11"], "B": ["10", "11", "01", "11"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [2, 3, 0, 1], "b": [0, 1]} | 1 |
construct-rlve-matrix-permutation-equivalence-l2-s4 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 2 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 3 x 3 binary matrices (0-indexed, one row per line).
A:
001
010
010
B:
001
010
001
Find a permutation a of 0..2 and a permutation b of 0..2 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 3, 0 <= j < 3.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answ... | {"A": ["001", "010", "010"], "B": ["001", "010", "001"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [2, 0, 1], "b": [0, 2, 1]} | 1 |
construct-rlve-matrix-permutation-equivalence-l2-s5 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 2 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 3 x 4 binary matrices (0-indexed, one row per line).
A:
1100
0001
0001
B:
0001
0110
0001
Find a permutation a of 0..2 and a permutation b of 0..3 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 3, 0 <= j < 4.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdi... | {"A": ["1100", "0001", "0001"], "B": ["0001", "0110", "0001"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [2, 0, 1], "b": [2, 0, 1, 3]} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.