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-shortest-path-count-l2-s6 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 2 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 58, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 376. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; the j-t... | {"K": 376, "n_max": 57, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 27, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNN", "NNNNYYNNYYNNNNNNNNNNNYNNNNN", "NNNNYYNNYYNNNNNNNNNNNYNNNNN", "NNNNNNYYNNYYNNNNNNNNNNYNNNN", "NNNNNNYYNNYYNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l2-s7 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 2 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 52, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 228. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; the j-t... | {"K": 228, "n_max": 51, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 24, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNYNNNNN", "NNYYNNYYNNNNNNNNNNYNNNNN", "NNNNYYNNYYNNNNNNNNNNNNNN", "NNNNYYNNYYNNNNNNNNNNNNNN", "NNNNNNYYNNYYNNNNNNNNNNNN", "NNNNNNYYNNYYNNNNNNNNNNNN", "NNNNNNNNYYNNYYNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l2-s8 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 2 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 52, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 240. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; the j-t... | {"K": 240, "n_max": 51, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 24, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNN", "NNNNYYNNYYNNNNNNNNNNNNNN", "NNNNYYNNYYNNNNNNNNNNNNNN", "NNNNNNYYNNYYNNNNNNNNYNNN", "NNNNNNYYNNYYNNNNNNNNYNNN", "NNNNNNNNYYNNYYNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l2-s9 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 2 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 58, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 380. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; the j-t... | {"K": 380, "n_max": 57, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 27, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNYNNNNNN", "NNYYNNYYNNNNNNNNNNNNYNNNNNN", "NNNNYYNNYYNNNNNNNNNNNYNNNNN", "NNNNYYNNYYNNNNNNNNNNNYNNNNN", "NNNNNNYYNNYYNNNNNNNNNNYNNNN", "NNNNNNYYNNYYNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l3-s0 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 3 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 106, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 67567. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; the ... | {"K": 67567, "n_max": 105, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 51, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l3-s1 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 3 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 94, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 31100. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; the j... | {"K": 31100, "n_max": 93, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 45, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNN", "NNNNYYN... | 1 |
construct-rlve-shortest-path-count-l3-s2 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 3 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 106, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 91760. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; the ... | {"K": 91760, "n_max": 105, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 51, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l3-s3 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 3 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 94, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 20443. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; the j... | {"K": 20443, "n_max": 93, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 45, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNYYN... | 1 |
construct-rlve-shortest-path-count-l3-s4 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 3 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 106, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 95415. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; the ... | {"K": 95415, "n_max": 105, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 51, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l3-s5 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 3 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 106, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 79878. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; the ... | {"K": 79878, "n_max": 105, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 51, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l3-s6 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 3 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 94, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 21517. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; the j... | {"K": 21517, "n_max": 93, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 45, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNN", "NNNNYYN... | 1 |
construct-rlve-shortest-path-count-l3-s7 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 3 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 94, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 16763. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; the j... | {"K": 16763, "n_max": 93, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 45, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNYYN... | 1 |
construct-rlve-shortest-path-count-l3-s8 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 3 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 106, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 97002. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; the ... | {"K": 97002, "n_max": 105, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 51, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l3-s9 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 3 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 100, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 45662. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; the ... | {"K": 45662, "n_max": 99, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 48, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNN... | 1 |
construct-rlve-shortest-path-count-l4-s0 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 4 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 166, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 80742759. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; t... | {"K": 80742759, "n_max": 165, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 81, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l4-s1 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 4 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 178, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 275631826. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; ... | {"K": 275631826, "n_max": 177, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 87, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l4-s2 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 4 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 184, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 828250231. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; ... | {"K": 828250231, "n_max": 183, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 90, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l4-s3 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 4 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 184, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 740396027. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; ... | {"K": 740396027, "n_max": 183, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 90, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l4-s4 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 4 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 178, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 387300533. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; ... | {"K": 387300533, "n_max": 177, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 87, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l4-s5 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 4 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 166, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 72380104. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; t... | {"K": 72380104, "n_max": 165, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 81, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l4-s6 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 4 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 172, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 245582523. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; ... | {"K": 245582523, "n_max": 171, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 84, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l4-s7 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 4 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 184, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 666699566. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; ... | {"K": 666699566, "n_max": 183, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 90, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l4-s8 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 4 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 154, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 19523096. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; t... | {"K": 19523096, "n_max": 153, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 75, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l4-s9 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 4 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 184, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 566126618. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'}; ... | {"K": 566126618, "n_max": 183, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 90, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l5-s0 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 5 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 286, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 87089332955214. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','... | {"K": 87089332955214, "n_max": 285, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 141, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNN... | 1 |
construct-rlve-shortest-path-count-l5-s1 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 5 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 262, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 5786229304640. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N... | {"K": 5786229304640, "n_max": 261, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 129, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l5-s2 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 5 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 274, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 21995696772858. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','... | {"K": 21995696772858, "n_max": 273, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 135, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l5-s3 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 5 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 280, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 65311362926762. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','... | {"K": 65311362926762, "n_max": 279, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 138, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l5-s4 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 5 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 286, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 71025861618756. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','... | {"K": 71025861618756, "n_max": 285, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 141, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNN... | 1 |
construct-rlve-shortest-path-count-l5-s5 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 5 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 286, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 91589818790713. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','... | {"K": 91589818790713, "n_max": 285, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 141, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNN... | 1 |
construct-rlve-shortest-path-count-l5-s6 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 5 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 274, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 29301420376247. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','... | {"K": 29301420376247, "n_max": 273, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 135, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l5-s7 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 5 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 274, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 20668341463800. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','... | {"K": 20668341463800, "n_max": 273, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 135, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l5-s8 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 5 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 232, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 149274712750. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N'... | {"K": 149274712750, "n_max": 231, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 114, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l5-s9 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 5 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 256, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 3025324468125. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y','N... | {"K": 3025324468125, "n_max": 255, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 126, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l6-s0 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 6 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 364, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 681091269143539577. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'... | {"K": 681091269143539577, "n_max": 363, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 180, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l6-s1 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 6 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 364, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 586828300174062601. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'... | {"K": 586828300174062601, "n_max": 363, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 180, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l6-s2 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 6 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 364, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 713669029456444787. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'... | {"K": 713669029456444787, "n_max": 363, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 180, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l6-s3 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 6 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 352, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 229668606702905079. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'... | {"K": 229668606702905079, "n_max": 351, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 174, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l6-s4 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 6 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 352, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 187789265141101595. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'... | {"K": 187789265141101595, "n_max": 351, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 174, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l6-s5 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 6 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 352, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 163750090544363596. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'... | {"K": 163750090544363596, "n_max": 351, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 174, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l6-s6 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 6 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 334, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 20843904301087559. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'Y... | {"K": 20843904301087559, "n_max": 333, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 165, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l6-s7 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 6 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 358, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 304361666097914654. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'... | {"K": 304361666097914654, "n_max": 357, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 177, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l6-s8 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 6 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 358, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 346367314648891555. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'... | {"K": 346367314648891555, "n_max": 357, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 177, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l6-s9 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 6 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 358, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 557650159044146215. (Vertex 2 must be reachable from vertex 1.)
Answer format: {"n": N, "adj": [row_1, ..., row_N]} where row_i is a string of length N over {'... | {"K": 557650159044146215, "n_max": 357, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 177, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN... | 1 |
construct-rlve-smallest-enclosing-circle-l1-s0 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 1 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 4 lattice points in the plane:
(2, 8)
(5, 8)
(6, 3)
(8, 3)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the minimum possible radius by at most ... | {"points": [[2, 8], [5, 8], [6, 3], [8, 3]], "r_opt": 3.905124837953327, "r2_num": 61, "r2_den": 4, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 5.0, "y": 5.5, "r": 3.905124838953327} | 1 |
construct-rlve-smallest-enclosing-circle-l1-s1 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 1 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 4 lattice points in the plane:
(0, 7)
(1, 7)
(4, 6)
(6, 0)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the minimum possible radius by at most ... | {"points": [[0, 7], [1, 7], [4, 6], [6, 0]], "r_opt": 4.6097722286464435, "r2_num": 85, "r2_den": 4, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 3.0, "y": 3.5, "r": 4.609772229646444} | 1 |
construct-rlve-smallest-enclosing-circle-l1-s2 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 1 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 4 lattice points in the plane:
(3, 1)
(3, 3)
(6, 6)
(7, 0)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the minimum possible radius by at most ... | {"points": [[3, 1], [3, 3], [6, 6], [7, 0]], "r_opt": 3.1791202073853184, "r2_num": 10693, "r2_den": 1058, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 5.586956521739131, "y": 2.847826086956522, "r": 3.1791202083853185} | 1 |
construct-rlve-smallest-enclosing-circle-l1-s3 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 1 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 4 lattice points in the plane:
(0, 6)
(0, 7)
(2, 0)
(3, 8)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the minimum possible radius by at most ... | {"points": [[0, 6], [0, 7], [2, 0], [3, 8]], "r_opt": 4.031128874149275, "r2_num": 65, "r2_den": 4, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 2.5, "y": 4.0, "r": 4.031128875149275} | 1 |
construct-rlve-smallest-enclosing-circle-l1-s4 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 1 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 4 lattice points in the plane:
(1, 1)
(2, 5)
(3, 4)
(4, 2)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the minimum possible radius by at most ... | {"points": [[1, 1], [2, 5], [3, 4], [4, 2]], "r_opt": 2.1368471406442104, "r2_num": 1105, "r2_den": 242, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 2.0454545454545454, "y": 2.8636363636363638, "r": 2.1368471416442105} | 1 |
construct-rlve-smallest-enclosing-circle-l1-s5 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 1 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 4 lattice points in the plane:
(2, 3)
(5, 5)
(7, 1)
(8, 3)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the minimum possible radius by at most ... | {"points": [[2, 3], [5, 5], [7, 1], [8, 3]], "r_opt": 3.0, "r2_num": 9, "r2_den": 1, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 5.0, "y": 3.0, "r": 3.000000001} | 1 |
construct-rlve-smallest-enclosing-circle-l1-s6 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 1 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 4 lattice points in the plane:
(1, 5)
(2, 8)
(5, 3)
(7, 7)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the minimum possible radius by at most ... | {"points": [[1, 5], [2, 8], [5, 3], [7, 7]], "r_opt": 3.1622776601683795, "r2_num": 10, "r2_den": 1, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 4.0, "y": 6.0, "r": 3.1622776611683796} | 1 |
construct-rlve-smallest-enclosing-circle-l1-s7 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 1 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 4 lattice points in the plane:
(5, 3)
(7, 4)
(7, 5)
(8, 4)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the minimum possible radius by at most ... | {"points": [[5, 3], [7, 4], [7, 5], [8, 4]], "r_opt": 1.5811388300841898, "r2_num": 5, "r2_den": 2, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 6.5, "y": 3.5, "r": 1.5811388310841898} | 1 |
construct-rlve-smallest-enclosing-circle-l1-s8 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 1 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 4 lattice points in the plane:
(1, 0)
(2, 0)
(4, 6)
(6, 3)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the minimum possible radius by at most ... | {"points": [[1, 0], [2, 0], [4, 6], [6, 3]], "r_opt": 3.3579026495837594, "r2_num": 1105, "r2_den": 98, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 2.642857142857143, "y": 2.9285714285714284, "r": 3.3579026505837595} | 1 |
construct-rlve-smallest-enclosing-circle-l1-s9 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 1 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 4 lattice points in the plane:
(0, 3)
(0, 8)
(3, 4)
(7, 4)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the minimum possible radius by at most ... | {"points": [[0, 3], [0, 8], [3, 4], [7, 4]], "r_opt": 4.072055089639778, "r2_num": 1625, "r2_den": 98, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 3.2142857142857144, "y": 5.5, "r": 4.072055090639778} | 1 |
construct-rlve-smallest-enclosing-circle-l2-s0 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 2 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 8 lattice points in the plane:
(3, 8)
(3, 9)
(6, 1)
(6, 15)
(7, 5)
(9, 5)
(16, 4)
(16, 10)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the min... | {"points": [[3, 8], [3, 9], [6, 1], [6, 15], [7, 5], [9, 5], [16, 4], [16, 10]], "r_opt": 7.760315715227055, "r2_num": 24089, "r2_den": 400, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 9.35, "y": 8.0, "r": 7.760315716227055} | 1 |
construct-rlve-smallest-enclosing-circle-l2-s1 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 2 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 8 lattice points in the plane:
(0, 16)
(4, 13)
(5, 10)
(6, 8)
(9, 5)
(9, 10)
(13, 2)
(14, 9)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the m... | {"points": [[0, 16], [4, 13], [5, 10], [6, 8], [9, 5], [9, 10], [13, 2], [14, 9]], "r_opt": 9.5524865872714, "r2_num": 365, "r2_den": 4, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 6.5, "y": 9.0, "r": 9.5524865882714} | 1 |
construct-rlve-smallest-enclosing-circle-l2-s2 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 2 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 8 lattice points in the plane:
(3, 9)
(3, 12)
(4, 10)
(9, 1)
(12, 7)
(15, 6)
(15, 8)
(16, 10)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the ... | {"points": [[3, 9], [3, 12], [4, 10], [9, 1], [12, 7], [15, 6], [15, 8], [16, 10]], "r_opt": 7.172049240588253, "r2_num": 1765465, "r2_den": 34322, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 9.064885496183207, "y": 8.17175572519084, "r": 7.172049241588253} | 1 |
construct-rlve-smallest-enclosing-circle-l2-s3 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 2 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 8 lattice points in the plane:
(1, 7)
(4, 12)
(7, 3)
(7, 13)
(8, 15)
(13, 5)
(13, 14)
(15, 5)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the ... | {"points": [[1, 7], [4, 12], [7, 3], [7, 13], [8, 15], [13, 5], [13, 14], [15, 5]], "r_opt": 7.423578218865922, "r2_num": 410125, "r2_den": 7442, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 8.319672131147541, "y": 8.237704918032787, "r": 7.423578219865922} | 1 |
construct-rlve-smallest-enclosing-circle-l2-s4 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 2 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 8 lattice points in the plane:
(5, 15)
(8, 1)
(9, 0)
(9, 13)
(12, 4)
(14, 7)
(14, 15)
(15, 2)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the ... | {"points": [[5, 15], [8, 1], [9, 0], [9, 13], [12, 4], [14, 7], [14, 15], [15, 2]], "r_opt": 8.215965096422899, "r2_num": 324145, "r2_den": 4802, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 9.60204081632653, "y": 8.193877551020408, "r": 8.215965097422899} | 1 |
construct-rlve-smallest-enclosing-circle-l2-s5 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 2 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 8 lattice points in the plane:
(0, 11)
(3, 9)
(6, 4)
(7, 5)
(7, 14)
(13, 10)
(15, 4)
(15, 10)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the ... | {"points": [[0, 11], [3, 9], [6, 4], [7, 5], [7, 14], [13, 10], [15, 4], [15, 10]], "r_opt": 8.276472678623424, "r2_num": 137, "r2_den": 2, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 7.5, "y": 7.5, "r": 8.276472679623424} | 1 |
construct-rlve-smallest-enclosing-circle-l2-s6 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 2 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 8 lattice points in the plane:
(0, 7)
(0, 8)
(1, 7)
(3, 13)
(4, 9)
(5, 6)
(7, 16)
(16, 6)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the mini... | {"points": [[0, 7], [0, 8], [1, 7], [3, 13], [4, 9], [5, 6], [7, 16], [16, 6]], "r_opt": 8.142740270522989, "r2_num": 3023605, "r2_den": 45602, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 8.089403973509933, "y": 7.930463576158941, "r": 8.142740271522989} | 1 |
construct-rlve-smallest-enclosing-circle-l2-s7 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 2 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 8 lattice points in the plane:
(1, 11)
(3, 4)
(3, 12)
(4, 0)
(4, 2)
(10, 0)
(12, 7)
(13, 6)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the mi... | {"points": [[1, 11], [3, 4], [3, 12], [4, 0], [4, 2], [10, 0], [12, 7], [13, 6]], "r_opt": 7.123214881617901, "r2_num": 85345, "r2_den": 1682, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 5.879310344827586, "y": 5.810344827586207, "r": 7.123214882617901} | 1 |
construct-rlve-smallest-enclosing-circle-l2-s8 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 2 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 8 lattice points in the plane:
(1, 13)
(3, 9)
(5, 14)
(6, 12)
(10, 5)
(11, 8)
(15, 0)
(15, 9)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds the ... | {"points": [[1, 13], [3, 9], [5, 14], [6, 12], [10, 5], [11, 8], [15, 0], [15, 9]], "r_opt": 9.5524865872714, "r2_num": 365, "r2_den": 4, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 8.0, "y": 6.5, "r": 9.5524865882714} | 1 |
construct-rlve-smallest-enclosing-circle-l2-s9 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 2 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 8 lattice points in the plane:
(0, 1)
(7, 15)
(7, 16)
(11, 15)
(12, 9)
(14, 8)
(15, 16)
(16, 1)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is within distance r + 1e-6 of the centre and r exceeds th... | {"points": [[0, 1], [7, 15], [7, 16], [11, 15], [12, 9], [14, 8], [15, 16], [16, 1]], "r_opt": 10.63014581273465, "r2_num": 113, "r2_den": 1, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 8.0, "y": 8.0, "r": 10.63014581373465} | 1 |
construct-rlve-smallest-enclosing-circle-l3-s0 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 3 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 15 lattice points in the plane:
(0, 17)
(2, 5)
(2, 7)
(5, 2)
(6, 22)
(12, 10)
(15, 6)
(15, 10)
(23, 20)
(24, 4)
(24, 28)
(25, 5)
(26, 7)
(28, 9)
(29, 21)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point ... | {"points": [[0, 17], [2, 5], [2, 7], [5, 2], [6, 22], [12, 10], [15, 6], [15, 10], [23, 20], [24, 4], [24, 28], [25, 5], [26, 7], [28, 9], [29, 21]], "r_opt": 16.101242188104617, "r2_num": 1037, "r2_den": 4, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 14.5, "y": 15.0, "r": 16.101242189104617} | 1 |
construct-rlve-smallest-enclosing-circle-l3-s1 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 3 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 15 lattice points in the plane:
(0, 19)
(1, 29)
(4, 7)
(5, 3)
(7, 2)
(8, 4)
(8, 6)
(9, 17)
(10, 3)
(10, 21)
(16, 16)
(21, 0)
(22, 5)
(26, 5)
(28, 20)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point is w... | {"points": [[0, 19], [1, 29], [4, 7], [5, 3], [7, 2], [8, 4], [8, 6], [9, 17], [10, 3], [10, 21], [16, 16], [21, 0], [22, 5], [26, 5], [28, 20]], "r_opt": 17.61758260922649, "r2_num": 1490441, "r2_den": 4802, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 11.295918367346939, "y": 14.704081632653061, "r": 17.61758261022649} | 1 |
construct-rlve-smallest-enclosing-circle-l3-s2 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 3 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 15 lattice points in the plane:
(0, 7)
(0, 26)
(1, 3)
(5, 1)
(11, 27)
(12, 20)
(21, 0)
(21, 24)
(22, 1)
(27, 7)
(27, 16)
(28, 24)
(29, 20)
(30, 6)
(30, 8)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point... | {"points": [[0, 7], [0, 26], [1, 3], [5, 1], [11, 27], [12, 20], [21, 0], [21, 24], [22, 1], [27, 7], [27, 16], [28, 24], [29, 20], [30, 6], [30, 8]], "r_opt": 18.059855679618106, "r2_num": 1464125, "r2_den": 4489, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 14.402985074626866, "y": 15.104477611940299, "r": 18.059855680618107} | 1 |
construct-rlve-smallest-enclosing-circle-l3-s3 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 3 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 15 lattice points in the plane:
(0, 14)
(4, 18)
(6, 8)
(7, 25)
(8, 2)
(12, 3)
(14, 4)
(15, 7)
(16, 12)
(19, 29)
(23, 24)
(25, 30)
(27, 6)
(29, 15)
(30, 30)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every poin... | {"points": [[0, 14], [4, 18], [6, 8], [7, 25], [8, 2], [12, 3], [14, 4], [15, 7], [16, 12], [19, 29], [23, 24], [25, 30], [27, 6], [29, 15], [30, 30]], "r_opt": 17.890414123079907, "r2_num": 1190969, "r2_den": 3721, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 17.62295081967213, "y": 17.081967213114755, "r": 17.890414124079907} | 1 |
construct-rlve-smallest-enclosing-circle-l3-s4 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 3 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 15 lattice points in the plane:
(0, 6)
(2, 3)
(5, 30)
(6, 22)
(7, 6)
(7, 23)
(10, 5)
(18, 3)
(19, 15)
(21, 4)
(22, 20)
(25, 7)
(25, 17)
(27, 5)
(28, 28)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point i... | {"points": [[0, 6], [2, 3], [5, 30], [6, 22], [7, 6], [7, 23], [10, 5], [18, 3], [19, 15], [21, 4], [22, 20], [25, 7], [25, 17], [27, 5], [28, 28]], "r_opt": 18.034688796871432, "r2_num": 1301, "r2_den": 4, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 15.0, "y": 15.5, "r": 18.034688797871432} | 1 |
construct-rlve-smallest-enclosing-circle-l3-s5 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 3 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 15 lattice points in the plane:
(1, 28)
(3, 8)
(7, 12)
(9, 16)
(14, 5)
(14, 21)
(17, 6)
(20, 8)
(21, 22)
(21, 27)
(24, 15)
(24, 19)
(25, 5)
(27, 1)
(27, 9)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every poin... | {"points": [[1, 28], [3, 8], [7, 12], [9, 16], [14, 5], [14, 21], [17, 6], [20, 8], [21, 22], [21, 27], [24, 15], [24, 19], [25, 5], [27, 1], [27, 9]], "r_opt": 18.741664813991314, "r2_num": 1405, "r2_den": 4, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 14.0, "y": 14.5, "r": 18.741664814991314} | 1 |
construct-rlve-smallest-enclosing-circle-l3-s6 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 3 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 15 lattice points in the plane:
(0, 13)
(3, 5)
(3, 9)
(6, 15)
(7, 19)
(8, 4)
(8, 16)
(9, 18)
(10, 27)
(14, 7)
(17, 27)
(22, 1)
(25, 13)
(25, 22)
(30, 11)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point ... | {"points": [[0, 13], [3, 5], [3, 9], [6, 15], [7, 19], [8, 4], [8, 16], [9, 18], [10, 27], [14, 7], [17, 27], [22, 1], [25, 13], [25, 22], [30, 11]], "r_opt": 15.0556433503924, "r2_num": 685684, "r2_den": 3025, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 15.054545454545455, "y": 12.818181818181818, "r": 15.0556433513924} | 1 |
construct-rlve-smallest-enclosing-circle-l3-s7 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 3 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 15 lattice points in the plane:
(0, 14)
(1, 7)
(1, 28)
(2, 27)
(7, 26)
(8, 29)
(9, 11)
(10, 2)
(19, 26)
(21, 2)
(21, 3)
(23, 12)
(26, 5)
(27, 0)
(29, 5)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every point i... | {"points": [[0, 14], [1, 7], [1, 28], [2, 27], [7, 26], [8, 29], [9, 11], [10, 2], [19, 26], [21, 2], [21, 3], [23, 12], [26, 5], [27, 0], [29, 5]], "r_opt": 19.1049731745428, "r2_num": 365, "r2_den": 1, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 14.0, "y": 14.0, "r": 19.1049731755428} | 1 |
construct-rlve-smallest-enclosing-circle-l3-s8 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 3 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 15 lattice points in the plane:
(2, 22)
(3, 13)
(7, 28)
(9, 5)
(10, 9)
(14, 17)
(14, 28)
(15, 6)
(17, 4)
(18, 15)
(20, 20)
(27, 17)
(27, 30)
(29, 20)
(30, 23)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every p... | {"points": [[2, 22], [3, 13], [7, 28], [9, 5], [10, 9], [14, 17], [14, 28], [15, 6], [17, 4], [18, 15], [20, 20], [27, 17], [27, 30], [29, 20], [30, 23]], "r_opt": 15.453469355472444, "r2_num": 653861, "r2_den": 2738, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 16.986486486486488, "y": 18.22972972972973, "r": 15.453469356472445} | 1 |
construct-rlve-smallest-enclosing-circle-l3-s9 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 3 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 15 lattice points in the plane:
(0, 0)
(3, 11)
(5, 9)
(5, 28)
(7, 0)
(8, 30)
(11, 2)
(13, 14)
(23, 26)
(23, 30)
(24, 26)
(24, 29)
(26, 25)
(29, 15)
(29, 17)
Find a circle (centre (x, y), radius r) that contains all of these points and whose radius is minimum possible. Your answer is accepted if every poi... | {"points": [[0, 0], [3, 11], [5, 9], [5, 28], [7, 0], [8, 30], [11, 2], [13, 14], [23, 26], [23, 30], [24, 26], [24, 29], [26, 25], [29, 15], [29, 17]], "r_opt": 18.9010581714358, "r2_num": 1429, "r2_den": 4, "family": "rlve_smallest_enclosing_circle", "subset": "construct"} | null | null | null | {"x": 11.5, "y": 15.0, "r": 18.9010581724358} | 1 |
construct-rlve-smallest-enclosing-circle-l4-s0 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 4 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 30 lattice points in the plane:
(0, 27)
(1, 8)
(2, 23)
(2, 36)
(3, 44)
(4, 9)
(4, 39)
(6, 3)
(6, 10)
(13, 52)
(15, 41)
(17, 58)
(20, 22)
(20, 23)
(22, 39)
(28, 31)
(29, 13)
(30, 9)
(32, 46)
(35, 51)
(42, 49)
(43, 20)
(44, 57)
(45, 8)
(45, 13)
(46, 6)
(46, 16)
(50, 43)
(52, 5)
(57, 21)
Find a circle (cent... | {"points": [[0, 27], [1, 8], [2, 23], [2, 36], [3, 44], [4, 9], [4, 39], [6, 3], [6, 10], [13, 52], [15, 41], [17, 58], [20, 22], [20, 23], [22, 39], [28, 31], [29, 13], [30, 9], [32, 46], [35, 51], [42, 49], [43, 20], [44, 57], [45, 8], [45, 13], [46, 6], [46, 16], [50, 43], [52, 5], [57, 21]], "r_opt": 33.33821975818... | null | null | null | {"x": 27.75799086757991, "y": 27.885844748858446, "r": 33.33821975918731} | 1 |
construct-rlve-smallest-enclosing-circle-l4-s1 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 4 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 30 lattice points in the plane:
(4, 37)
(6, 0)
(7, 49)
(10, 53)
(12, 32)
(15, 49)
(16, 44)
(23, 13)
(23, 28)
(24, 37)
(25, 42)
(31, 16)
(33, 55)
(36, 50)
(37, 16)
(37, 21)
(39, 33)
(40, 5)
(40, 60)
(42, 15)
(42, 47)
(43, 15)
(44, 55)
(46, 46)
(48, 18)
(51, 22)
(51, 51)
(55, 51)
(56, 41)
(57, 46)
Find a c... | {"points": [[4, 37], [6, 0], [7, 49], [10, 53], [12, 32], [15, 49], [16, 44], [23, 13], [23, 28], [24, 37], [25, 42], [31, 16], [33, 55], [36, 50], [37, 16], [37, 21], [39, 33], [40, 5], [40, 60], [42, 15], [42, 47], [43, 15], [44, 55], [46, 46], [48, 18], [51, 22], [51, 51], [55, 51], [56, 41], [57, 46]], "r_opt": 35.... | null | null | null | {"x": 29.865671641791046, "y": 26.109452736318406, "r": 35.373348797853176} | 1 |
construct-rlve-smallest-enclosing-circle-l4-s2 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 4 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 30 lattice points in the plane:
(2, 37)
(3, 47)
(4, 42)
(8, 3)
(10, 53)
(12, 27)
(14, 30)
(15, 49)
(18, 44)
(19, 9)
(20, 10)
(20, 30)
(23, 36)
(27, 46)
(29, 44)
(29, 45)
(31, 54)
(35, 48)
(36, 1)
(39, 27)
(39, 48)
(40, 0)
(42, 43)
(46, 3)
(46, 28)
(48, 8)
(48, 41)
(52, 10)
(53, 55)
(57, 29)
Find a circle... | {"points": [[2, 37], [3, 47], [4, 42], [8, 3], [10, 53], [12, 27], [14, 30], [15, 49], [18, 44], [19, 9], [20, 10], [20, 30], [23, 36], [27, 46], [29, 44], [29, 45], [31, 54], [35, 48], [36, 1], [39, 27], [39, 48], [40, 0], [42, 43], [46, 3], [46, 28], [48, 8], [48, 41], [52, 10], [53, 55], [57, 29]], "r_opt": 34.38386... | null | null | null | {"x": 30.5, "y": 29.0, "r": 34.383862494908385} | 1 |
construct-rlve-smallest-enclosing-circle-l4-s3 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 4 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 30 lattice points in the plane:
(5, 10)
(7, 43)
(7, 49)
(8, 17)
(9, 40)
(11, 5)
(12, 24)
(13, 44)
(15, 19)
(15, 55)
(16, 45)
(20, 13)
(22, 40)
(24, 14)
(24, 22)
(27, 9)
(32, 11)
(35, 25)
(35, 36)
(37, 2)
(37, 25)
(38, 4)
(43, 31)
(43, 55)
(44, 42)
(45, 26)
(45, 39)
(46, 3)
(50, 17)
(50, 51)
Find a circle... | {"points": [[5, 10], [7, 43], [7, 49], [8, 17], [9, 40], [11, 5], [12, 24], [13, 44], [15, 19], [15, 55], [16, 45], [20, 13], [22, 40], [24, 14], [24, 22], [27, 9], [32, 11], [35, 25], [35, 36], [37, 2], [37, 25], [38, 4], [43, 31], [43, 55], [44, 42], [45, 26], [45, 39], [46, 3], [50, 17], [50, 51]], "r_opt": 30.55126... | null | null | null | {"x": 29.266533066132265, "y": 28.561122244488978, "r": 30.55126652179344} | 1 |
construct-rlve-smallest-enclosing-circle-l4-s4 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 4 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 30 lattice points in the plane:
(3, 40)
(9, 13)
(9, 24)
(12, 7)
(13, 53)
(13, 60)
(19, 3)
(19, 52)
(20, 14)
(20, 36)
(23, 59)
(24, 17)
(25, 52)
(26, 12)
(27, 23)
(27, 39)
(29, 22)
(31, 45)
(36, 4)
(36, 13)
(41, 31)
(43, 29)
(45, 55)
(48, 14)
(48, 38)
(50, 37)
(55, 57)
(56, 32)
(58, 22)
(58, 40)
Find a ci... | {"points": [[3, 40], [9, 13], [9, 24], [12, 7], [13, 53], [13, 60], [19, 3], [19, 52], [20, 14], [20, 36], [23, 59], [24, 17], [25, 52], [26, 12], [27, 23], [27, 39], [29, 22], [31, 45], [36, 4], [36, 13], [41, 31], [43, 29], [45, 55], [48, 14], [48, 38], [50, 37], [55, 57], [56, 32], [58, 22], [58, 40]], "r_opt": 33.0... | null | null | null | {"x": 32.187752355316285, "y": 33.128532974428, "r": 33.01886704024514} | 1 |
construct-rlve-smallest-enclosing-circle-l4-s5 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 4 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 30 lattice points in the plane:
(0, 8)
(1, 17)
(5, 9)
(5, 48)
(12, 47)
(13, 3)
(14, 0)
(18, 10)
(18, 52)
(19, 40)
(21, 59)
(23, 15)
(24, 47)
(26, 8)
(27, 28)
(29, 23)
(31, 44)
(33, 46)
(35, 29)
(37, 20)
(42, 60)
(43, 43)
(44, 31)
(48, 41)
(48, 55)
(55, 13)
(56, 27)
(56, 44)
(58, 58)
(60, 19)
Find a circl... | {"points": [[0, 8], [1, 17], [5, 9], [5, 48], [12, 47], [13, 3], [14, 0], [18, 10], [18, 52], [19, 40], [21, 59], [23, 15], [24, 47], [26, 8], [27, 28], [29, 23], [31, 44], [33, 46], [35, 29], [37, 20], [42, 60], [43, 43], [44, 31], [48, 41], [48, 55], [55, 13], [56, 27], [56, 44], [58, 58], [60, 19]], "r_opt": 38.2883... | null | null | null | {"x": 29.0, "y": 33.0, "r": 38.28837943915329} | 1 |
construct-rlve-smallest-enclosing-circle-l4-s6 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 4 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 30 lattice points in the plane:
(1, 5)
(3, 15)
(3, 27)
(7, 31)
(8, 20)
(10, 9)
(10, 51)
(11, 22)
(14, 45)
(22, 15)
(24, 59)
(26, 30)
(26, 34)
(27, 6)
(30, 18)
(31, 31)
(31, 52)
(45, 24)
(45, 60)
(46, 4)
(47, 8)
(48, 43)
(48, 46)
(49, 32)
(53, 53)
(54, 13)
(54, 47)
(56, 28)
(57, 42)
(59, 4)
Find a circle ... | {"points": [[1, 5], [3, 15], [3, 27], [7, 31], [8, 20], [10, 9], [10, 51], [11, 22], [14, 45], [22, 15], [24, 59], [26, 30], [26, 34], [27, 6], [30, 18], [31, 31], [31, 52], [45, 24], [45, 60], [46, 4], [47, 8], [48, 43], [48, 46], [49, 32], [53, 53], [54, 13], [54, 47], [56, 28], [57, 42], [59, 4]], "r_opt": 36.463607... | null | null | null | {"x": 30.38095238095238, "y": 26.595238095238095, "r": 36.46360749123352} | 1 |
construct-rlve-smallest-enclosing-circle-l4-s7 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 4 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 30 lattice points in the plane:
(0, 10)
(0, 33)
(1, 0)
(3, 54)
(6, 32)
(8, 14)
(9, 60)
(12, 40)
(13, 13)
(15, 38)
(16, 16)
(16, 26)
(18, 51)
(19, 14)
(23, 6)
(25, 5)
(28, 30)
(34, 49)
(39, 13)
(39, 45)
(40, 24)
(45, 34)
(48, 37)
(49, 11)
(51, 52)
(54, 19)
(55, 17)
(57, 39)
(59, 7)
(60, 24)
Find a circle ... | {"points": [[0, 10], [0, 33], [1, 0], [3, 54], [6, 32], [8, 14], [9, 60], [12, 40], [13, 13], [15, 38], [16, 16], [16, 26], [18, 51], [19, 14], [23, 6], [25, 5], [28, 30], [34, 49], [39, 13], [39, 45], [40, 24], [45, 34], [48, 37], [49, 11], [51, 52], [54, 19], [55, 17], [57, 39], [59, 7], [60, 24]], "r_opt": 37.626037... | null | null | null | {"x": 27.158294392523363, "y": 27.04556074766355, "r": 37.626037816341096} | 1 |
construct-rlve-smallest-enclosing-circle-l4-s8 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 4 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 30 lattice points in the plane:
(0, 56)
(3, 5)
(3, 8)
(4, 43)
(5, 18)
(8, 23)
(11, 37)
(15, 21)
(17, 4)
(19, 37)
(20, 18)
(20, 35)
(22, 52)
(26, 20)
(30, 1)
(30, 22)
(34, 16)
(40, 59)
(41, 45)
(42, 53)
(48, 27)
(49, 27)
(49, 38)
(50, 26)
(50, 54)
(51, 4)
(53, 22)
(53, 31)
(55, 28)
(60, 26)
Find a circle ... | {"points": [[0, 56], [3, 5], [3, 8], [4, 43], [5, 18], [8, 23], [11, 37], [15, 21], [17, 4], [19, 37], [20, 18], [20, 35], [22, 52], [26, 20], [30, 1], [30, 22], [34, 16], [40, 59], [41, 45], [42, 53], [48, 27], [49, 27], [49, 38], [50, 26], [50, 54], [51, 4], [53, 22], [53, 31], [55, 28], [60, 26]], "r_opt": 36.417715... | null | null | null | {"x": 25.5, "y": 30.0, "r": 36.41771547026028} | 1 |
construct-rlve-smallest-enclosing-circle-l4-s9 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 4 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 30 lattice points in the plane:
(1, 26)
(2, 42)
(4, 38)
(7, 52)
(9, 51)
(12, 14)
(13, 2)
(16, 59)
(20, 7)
(22, 4)
(23, 27)
(23, 30)
(24, 46)
(27, 17)
(27, 19)
(28, 11)
(31, 34)
(38, 42)
(42, 34)
(42, 38)
(43, 53)
(46, 21)
(46, 22)
(51, 6)
(52, 54)
(53, 20)
(53, 48)
(55, 24)
(56, 10)
(60, 45)
Find a circl... | {"points": [[1, 26], [2, 42], [4, 38], [7, 52], [9, 51], [12, 14], [13, 2], [16, 59], [20, 7], [22, 4], [23, 27], [23, 30], [24, 46], [27, 17], [27, 19], [28, 11], [31, 34], [38, 42], [42, 34], [42, 38], [43, 53], [46, 21], [46, 22], [51, 6], [52, 54], [53, 20], [53, 48], [55, 24], [56, 10], [60, 45]], "r_opt": 32.9196... | null | null | null | {"x": 30.88470588235294, "y": 29.63764705882353, "r": 32.919633040363706} | 1 |
construct-rlve-smallest-enclosing-circle-l5-s0 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 5 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 60 lattice points in the plane:
(0, 57)
(4, 36)
(4, 42)
(5, 69)
(10, 60)
(10, 75)
(13, 86)
(14, 32)
(16, 53)
(18, 66)
(19, 103)
(19, 113)
(20, 29)
(20, 116)
(25, 96)
(28, 92)
(29, 8)
(32, 9)
(34, 51)
(36, 87)
(37, 116)
(37, 120)
(41, 1)
(45, 11)
(45, 68)
(48, 72)
(50, 81)
(52, 97)
(52, 117)
(53, 42)
(56, ... | {"points": [[0, 57], [4, 36], [4, 42], [5, 69], [10, 60], [10, 75], [13, 86], [14, 32], [16, 53], [18, 66], [19, 103], [19, 113], [20, 29], [20, 116], [25, 96], [28, 92], [29, 8], [32, 9], [34, 51], [36, 87], [37, 116], [37, 120], [41, 1], [45, 11], [45, 68], [48, 72], [50, 81], [52, 97], [52, 117], [53, 42], [56, 50],... | null | null | null | {"x": 66.0, "y": 64.5, "r": 69.05251624769444} | 1 |
construct-rlve-smallest-enclosing-circle-l5-s1 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 5 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 60 lattice points in the plane:
(2, 90)
(4, 87)
(9, 12)
(9, 28)
(10, 34)
(10, 114)
(12, 45)
(13, 79)
(15, 20)
(18, 17)
(19, 63)
(21, 63)
(21, 73)
(30, 88)
(36, 43)
(37, 56)
(39, 112)
(40, 3)
(41, 75)
(43, 31)
(43, 66)
(45, 104)
(47, 94)
(48, 38)
(49, 116)
(50, 17)
(52, 38)
(55, 3)
(55, 79)
(58, 41)
(58, 5... | {"points": [[2, 90], [4, 87], [9, 12], [9, 28], [10, 34], [10, 114], [12, 45], [13, 79], [15, 20], [18, 17], [19, 63], [21, 63], [21, 73], [30, 88], [36, 43], [37, 56], [39, 112], [40, 3], [41, 75], [43, 31], [43, 66], [45, 104], [47, 94], [48, 38], [49, 116], [50, 17], [52, 38], [55, 3], [55, 79], [58, 41], [58, 53], ... | null | null | null | {"x": 64.0, "y": 62.0, "r": 74.96665925696526} | 1 |
construct-rlve-smallest-enclosing-circle-l5-s2 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 5 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 60 lattice points in the plane:
(0, 57)
(1, 91)
(4, 109)
(5, 11)
(5, 70)
(7, 45)
(15, 81)
(16, 98)
(20, 120)
(23, 42)
(24, 70)
(26, 12)
(26, 17)
(28, 45)
(30, 13)
(31, 25)
(32, 65)
(33, 25)
(34, 79)
(35, 38)
(35, 100)
(37, 92)
(37, 112)
(43, 21)
(44, 95)
(48, 66)
(50, 10)
(51, 65)
(57, 4)
(60, 36)
(60, 60... | {"points": [[0, 57], [1, 91], [4, 109], [5, 11], [5, 70], [7, 45], [15, 81], [16, 98], [20, 120], [23, 42], [24, 70], [26, 12], [26, 17], [28, 45], [30, 13], [31, 25], [32, 65], [33, 25], [34, 79], [35, 38], [35, 100], [37, 92], [37, 112], [43, 21], [44, 95], [48, 66], [50, 10], [51, 65], [57, 4], [60, 36], [60, 60], [... | null | null | null | {"x": 57.987030174695605, "y": 57.47300158814188, "r": 74.62996042185996} | 1 |
construct-rlve-smallest-enclosing-circle-l5-s3 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 5 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 60 lattice points in the plane:
(1, 40)
(6, 24)
(6, 61)
(11, 19)
(17, 79)
(19, 14)
(20, 23)
(20, 97)
(22, 102)
(23, 70)
(24, 3)
(25, 31)
(26, 14)
(26, 73)
(29, 109)
(33, 67)
(34, 84)
(37, 2)
(38, 96)
(41, 110)
(44, 36)
(46, 61)
(48, 56)
(51, 18)
(51, 29)
(54, 21)
(59, 64)
(62, 26)
(62, 106)
(64, 11)
(65, ... | {"points": [[1, 40], [6, 24], [6, 61], [11, 19], [17, 79], [19, 14], [20, 23], [20, 97], [22, 102], [23, 70], [24, 3], [25, 31], [26, 14], [26, 73], [29, 109], [33, 67], [34, 84], [37, 2], [38, 96], [41, 110], [44, 36], [46, 61], [48, 56], [51, 18], [51, 29], [54, 21], [59, 64], [62, 26], [62, 106], [64, 11], [65, 42],... | null | null | null | {"x": 70.085050416484, "y": 52.14664620780359, "r": 70.14474467332514} | 1 |
construct-rlve-smallest-enclosing-circle-l5-s4 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 5 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 60 lattice points in the plane:
(1, 58)
(2, 36)
(2, 59)
(3, 58)
(7, 9)
(10, 54)
(12, 19)
(12, 42)
(13, 14)
(15, 91)
(21, 55)
(21, 95)
(23, 52)
(24, 34)
(25, 114)
(26, 43)
(29, 116)
(30, 115)
(33, 78)
(35, 29)
(35, 36)
(36, 52)
(36, 98)
(38, 16)
(39, 93)
(41, 95)
(44, 9)
(44, 110)
(47, 46)
(48, 54)
(52, 18... | {"points": [[1, 58], [2, 36], [2, 59], [3, 58], [7, 9], [10, 54], [12, 19], [12, 42], [13, 14], [15, 91], [21, 55], [21, 95], [23, 52], [24, 34], [25, 114], [26, 43], [29, 116], [30, 115], [33, 78], [35, 29], [35, 36], [36, 52], [36, 98], [38, 16], [39, 93], [41, 95], [44, 9], [44, 110], [47, 46], [48, 54], [52, 18], [... | null | null | null | {"x": 63.0, "y": 62.5, "r": 77.44836989992041} | 1 |
construct-rlve-smallest-enclosing-circle-l5-s5 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 5 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 60 lattice points in the plane:
(1, 14)
(1, 48)
(2, 11)
(2, 22)
(4, 94)
(5, 8)
(6, 118)
(13, 88)
(14, 119)
(16, 67)
(17, 84)
(17, 103)
(21, 97)
(23, 106)
(27, 62)
(28, 47)
(31, 94)
(36, 6)
(36, 72)
(37, 30)
(37, 109)
(39, 90)
(40, 14)
(48, 97)
(49, 56)
(51, 95)
(54, 38)
(54, 84)
(57, 57)
(60, 25)
(62, 19)... | {"points": [[1, 14], [1, 48], [2, 11], [2, 22], [4, 94], [5, 8], [6, 118], [13, 88], [14, 119], [16, 67], [17, 84], [17, 103], [21, 97], [23, 106], [27, 62], [28, 47], [31, 94], [36, 6], [36, 72], [37, 30], [37, 109], [39, 90], [40, 14], [48, 97], [49, 56], [51, 95], [54, 38], [54, 84], [57, 57], [60, 25], [62, 19], [6... | null | null | null | {"x": 56.0, "y": 60.0, "r": 76.57675887730659} | 1 |
construct-rlve-smallest-enclosing-circle-l5-s6 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 5 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 60 lattice points in the plane:
(1, 2)
(1, 28)
(2, 105)
(4, 46)
(7, 104)
(9, 92)
(13, 60)
(15, 31)
(18, 112)
(27, 2)
(32, 40)
(32, 56)
(33, 95)
(34, 42)
(34, 50)
(38, 108)
(39, 80)
(40, 10)
(42, 62)
(45, 90)
(49, 120)
(50, 29)
(50, 83)
(52, 40)
(53, 90)
(54, 15)
(55, 118)
(56, 100)
(56, 103)
(58, 29)
(61,... | {"points": [[1, 2], [1, 28], [2, 105], [4, 46], [7, 104], [9, 92], [13, 60], [15, 31], [18, 112], [27, 2], [32, 40], [32, 56], [33, 95], [34, 42], [34, 50], [38, 108], [39, 80], [40, 10], [42, 62], [45, 90], [49, 120], [50, 29], [50, 83], [52, 40], [53, 90], [54, 15], [55, 118], [56, 100], [56, 103], [58, 29], [61, 82]... | null | null | null | {"x": 54.33955704352305, "y": 52.98699459181046, "r": 73.78876583364256} | 1 |
construct-rlve-smallest-enclosing-circle-l5-s7 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 5 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 60 lattice points in the plane:
(6, 85)
(8, 19)
(11, 62)
(11, 103)
(12, 113)
(15, 74)
(15, 97)
(20, 47)
(20, 106)
(23, 103)
(24, 46)
(25, 97)
(26, 90)
(27, 9)
(31, 75)
(32, 1)
(32, 88)
(34, 105)
(35, 14)
(36, 81)
(38, 59)
(39, 8)
(43, 95)
(47, 44)
(50, 62)
(51, 94)
(52, 111)
(52, 117)
(54, 1)
(60, 64)
(67... | {"points": [[6, 85], [8, 19], [11, 62], [11, 103], [12, 113], [15, 74], [15, 97], [20, 47], [20, 106], [23, 103], [24, 46], [25, 97], [26, 90], [27, 9], [31, 75], [32, 1], [32, 88], [34, 105], [35, 14], [36, 81], [38, 59], [39, 8], [43, 95], [47, 44], [50, 62], [51, 94], [52, 111], [52, 117], [54, 1], [60, 64], [67, 27... | null | null | null | {"x": 65.52871803360092, "y": 57.45588843830175, "r": 77.13930245765393} | 1 |
construct-rlve-smallest-enclosing-circle-l5-s8 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 5 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 60 lattice points in the plane:
(3, 77)
(3, 89)
(10, 8)
(17, 17)
(17, 83)
(19, 69)
(22, 102)
(28, 1)
(28, 111)
(29, 100)
(30, 41)
(31, 5)
(32, 58)
(33, 54)
(35, 99)
(37, 86)
(38, 59)
(41, 71)
(41, 110)
(45, 118)
(46, 43)
(48, 57)
(49, 99)
(49, 117)
(50, 56)
(55, 96)
(56, 101)
(58, 51)
(60, 0)
(61, 64)
(65... | {"points": [[3, 77], [3, 89], [10, 8], [17, 17], [17, 83], [19, 69], [22, 102], [28, 1], [28, 111], [29, 100], [30, 41], [31, 5], [32, 58], [33, 54], [35, 99], [37, 86], [38, 59], [41, 71], [41, 110], [45, 118], [46, 43], [48, 57], [49, 99], [49, 117], [50, 56], [55, 96], [56, 101], [58, 51], [60, 0], [61, 64], [65, 65... | null | null | null | {"x": 61.02074303405573, "y": 60.09504643962848, "r": 72.91783103905402} | 1 |
construct-rlve-smallest-enclosing-circle-l5-s9 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 5 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 60 lattice points in the plane:
(2, 73)
(2, 99)
(3, 95)
(5, 42)
(7, 100)
(12, 27)
(12, 111)
(13, 7)
(17, 35)
(23, 35)
(23, 115)
(24, 10)
(26, 89)
(29, 55)
(29, 70)
(31, 117)
(32, 27)
(32, 36)
(34, 20)
(39, 80)
(39, 96)
(41, 110)
(42, 71)
(42, 100)
(43, 31)
(44, 33)
(45, 83)
(49, 15)
(54, 107)
(60, 107)
(6... | {"points": [[2, 73], [2, 99], [3, 95], [5, 42], [7, 100], [12, 27], [12, 111], [13, 7], [17, 35], [23, 35], [23, 115], [24, 10], [26, 89], [29, 55], [29, 70], [31, 117], [32, 27], [32, 36], [34, 20], [39, 80], [39, 96], [41, 110], [42, 71], [42, 100], [43, 31], [44, 33], [45, 83], [49, 15], [54, 107], [60, 107], [61, 4... | null | null | null | {"x": 62.65079365079365, "y": 58.62433862433863, "r": 72.86091409074517} | 1 |
construct-rlve-smallest-enclosing-circle-l6-s0 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 6 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 120 lattice points in the plane:
(3, 114)
(3, 195)
(6, 22)
(10, 56)
(10, 175)
(13, 55)
(13, 116)
(15, 82)
(16, 231)
(19, 196)
(22, 115)
(23, 104)
(24, 119)
(27, 76)
(30, 46)
(31, 37)
(33, 14)
(35, 97)
(41, 44)
(44, 124)
(45, 125)
(46, 224)
(50, 101)
(50, 159)
(52, 87)
(52, 181)
(64, 56)
(67, 198)
(67, 240... | {"points": [[3, 114], [3, 195], [6, 22], [10, 56], [10, 175], [13, 55], [13, 116], [15, 82], [16, 231], [19, 196], [22, 115], [23, 104], [24, 119], [27, 76], [30, 46], [31, 37], [33, 14], [35, 97], [41, 44], [44, 124], [45, 125], [46, 224], [50, 101], [50, 159], [52, 87], [52, 181], [64, 56], [67, 198], [67, 240], [78,... | null | null | null | {"x": 120.0, "y": 121.5, "r": 151.31506864916867} | 1 |
construct-rlve-smallest-enclosing-circle-l6-s1 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 6 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 120 lattice points in the plane:
(3, 138)
(3, 161)
(7, 117)
(9, 160)
(10, 5)
(11, 18)
(12, 138)
(16, 210)
(18, 106)
(19, 119)
(25, 122)
(30, 26)
(32, 63)
(34, 156)
(34, 174)
(36, 171)
(42, 156)
(43, 133)
(43, 166)
(45, 166)
(51, 226)
(52, 40)
(52, 168)
(55, 25)
(56, 51)
(57, 225)
(61, 70)
(64, 6)
(65, 234... | {"points": [[3, 138], [3, 161], [7, 117], [9, 160], [10, 5], [11, 18], [12, 138], [16, 210], [18, 106], [19, 119], [25, 122], [30, 26], [32, 63], [34, 156], [34, 174], [36, 171], [42, 156], [43, 133], [43, 166], [45, 166], [51, 226], [52, 40], [52, 168], [55, 25], [56, 51], [57, 225], [61, 70], [64, 6], [65, 234], [67,... | null | null | null | {"x": 122.5, "y": 116.5, "r": 158.39349734227343} | 1 |
construct-rlve-smallest-enclosing-circle-l6-s2 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 6 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 120 lattice points in the plane:
(1, 49)
(3, 59)
(3, 67)
(4, 0)
(7, 35)
(15, 113)
(15, 209)
(18, 23)
(19, 170)
(27, 201)
(28, 186)
(28, 233)
(29, 4)
(29, 89)
(31, 182)
(33, 140)
(33, 213)
(42, 89)
(42, 227)
(44, 137)
(45, 63)
(47, 105)
(48, 38)
(51, 24)
(52, 67)
(52, 96)
(56, 164)
(58, 134)
(62, 155)
(71,... | {"points": [[1, 49], [3, 59], [3, 67], [4, 0], [7, 35], [15, 113], [15, 209], [18, 23], [19, 170], [27, 201], [28, 186], [28, 233], [29, 4], [29, 89], [31, 182], [33, 140], [33, 213], [42, 89], [42, 227], [44, 137], [45, 63], [47, 105], [48, 38], [51, 24], [52, 67], [52, 96], [56, 164], [58, 134], [62, 155], [71, 124],... | null | null | null | {"x": 115.5, "y": 120.0, "r": 163.80552493834756} | 1 |
construct-rlve-smallest-enclosing-circle-l6-s3 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 6 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 120 lattice points in the plane:
(0, 169)
(3, 142)
(7, 91)
(9, 35)
(10, 72)
(10, 138)
(13, 161)
(13, 223)
(15, 71)
(16, 67)
(18, 209)
(23, 123)
(23, 238)
(24, 61)
(24, 202)
(28, 228)
(32, 95)
(33, 169)
(35, 100)
(38, 166)
(40, 58)
(42, 50)
(44, 100)
(47, 3)
(49, 7)
(55, 54)
(55, 216)
(57, 118)
(60, 106)
(... | {"points": [[0, 169], [3, 142], [7, 91], [9, 35], [10, 72], [10, 138], [13, 161], [13, 223], [15, 71], [16, 67], [18, 209], [23, 123], [23, 238], [24, 61], [24, 202], [28, 228], [32, 95], [33, 169], [35, 100], [38, 166], [40, 58], [42, 50], [44, 100], [47, 3], [49, 7], [55, 54], [55, 216], [57, 118], [60, 106], [61, 10... | null | null | null | {"x": 130.5, "y": 119.0, "r": 160.3659876667142} | 1 |
construct-rlve-smallest-enclosing-circle-l6-s4 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 6 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 120 lattice points in the plane:
(2, 122)
(4, 90)
(5, 150)
(5, 232)
(7, 183)
(8, 110)
(10, 15)
(14, 28)
(14, 108)
(15, 13)
(17, 51)
(19, 72)
(19, 214)
(20, 7)
(21, 194)
(28, 233)
(28, 237)
(29, 209)
(31, 101)
(31, 114)
(39, 6)
(40, 118)
(40, 143)
(43, 146)
(45, 115)
(48, 5)
(51, 128)
(53, 40)
(56, 25)
(59... | {"points": [[2, 122], [4, 90], [5, 150], [5, 232], [7, 183], [8, 110], [10, 15], [14, 28], [14, 108], [15, 13], [17, 51], [19, 72], [19, 214], [20, 7], [21, 194], [28, 233], [28, 237], [29, 209], [31, 101], [31, 114], [39, 6], [40, 118], [40, 143], [43, 146], [45, 115], [48, 5], [51, 128], [53, 40], [56, 25], [59, 89],... | null | null | null | {"x": 115.70844021008917, "y": 125.99328203249054, "r": 153.27681816993896} | 1 |
construct-rlve-smallest-enclosing-circle-l6-s5 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 6 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 120 lattice points in the plane:
(5, 11)
(6, 150)
(8, 67)
(9, 158)
(11, 70)
(14, 177)
(16, 36)
(18, 20)
(20, 236)
(23, 187)
(24, 76)
(25, 195)
(28, 193)
(30, 167)
(31, 77)
(34, 129)
(40, 163)
(42, 62)
(42, 217)
(43, 57)
(43, 179)
(44, 140)
(44, 193)
(45, 110)
(48, 102)
(48, 234)
(50, 128)
(53, 184)
(54, 1... | {"points": [[5, 11], [6, 150], [8, 67], [9, 158], [11, 70], [14, 177], [16, 36], [18, 20], [20, 236], [23, 187], [24, 76], [25, 195], [28, 193], [30, 167], [31, 77], [34, 129], [40, 163], [42, 62], [42, 217], [43, 57], [43, 179], [44, 140], [44, 193], [45, 110], [48, 102], [48, 234], [50, 128], [53, 184], [54, 116], [5... | null | null | null | {"x": 121.36277372262774, "y": 116.24248175182481, "r": 156.89574587610855} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.