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-recursive-sequence-sum-l4-s6 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 4 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 75 and F(n) = 16 * F(n - 1) + 12276 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 1152057949059957018327980160.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer as... | {"F0": 75, "A": 16, "B": 12276, "S": 1152057949059957018327980160, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]} | 1 |
construct-rlve-recursive-sequence-sum-l4-s7 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 4 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 9 and F(n) = 7 * F(n - 1) + 3633 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 57181065149912192853.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer as JSON to `/... | {"F0": 9, "A": 7, "B": 3633, "S": 57181065149912192853, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 2, 3, 5, 12, 13, 14, 17, 18, 19, 20]} | 1 |
construct-rlve-recursive-sequence-sum-l4-s8 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 4 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 122 and F(n) = 16 * F(n - 1) + 14510 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 1317266136675743597567070966.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer a... | {"F0": 122, "A": 16, "B": 14510, "S": 1317266136675743597567070966, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 3, 4, 5, 9, 10, 11, 12, 14, 15, 16, 17, 20]} | 1 |
construct-rlve-recursive-sequence-sum-l4-s9 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 4 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 10 and F(n) = 4 * F(n - 1) + 2254 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 1116125671820130.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer as JSON to `/wor... | {"F0": 10, "A": 4, "B": 2254, "S": 1116125671820130, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]} | 1 |
construct-rlve-recursive-sequence-sum-l5-s0 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 5 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 89 and F(n) = 16 * F(n - 1) + 7430 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 212094218386632933849346945292941662992420.
Answer format: {"indices": [n_1, ..., n_k]}
Write your fi... | {"F0": 89, "A": 16, "B": 7430, "S": 212094218386632933849346945292941662992420, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32]} | 1 |
construct-rlve-recursive-sequence-sum-l5-s1 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 5 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 62 and F(n) = 1 * F(n - 1) + 4197 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 1823172.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer as JSON to `/workdir/answ... | {"F0": 62, "A": 1, "B": 4197, "S": 1823172, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 2, 3, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 24, 26, 27, 28, 29, 30, 31]} | 1 |
construct-rlve-recursive-sequence-sum-l5-s2 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 5 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 37 and F(n) = 16 * F(n - 1) + 3753 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 104219017961490983349818169994538658321432.
Answer format: {"indices": [n_1, ..., n_k]}
Write your fi... | {"F0": 37, "A": 16, "B": 3753, "S": 104219017961490983349818169994538658321432, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 3, 4, 5, 6, 7, 11, 12, 13, 14, 15, 17, 19, 20, 21, 22, 23, 24, 25, 26, 27, 30, 31, 32]} | 1 |
construct-rlve-recursive-sequence-sum-l5-s3 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 5 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 27 and F(n) = 13 * F(n - 1) + 8580 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 353976626698897852087699828143575637015.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final... | {"F0": 27, "A": 13, "B": 8580, "S": 353976626698897852087699828143575637015, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 31, 32]} | 1 |
construct-rlve-recursive-sequence-sum-l5-s4 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 5 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 50 and F(n) = 7 * F(n - 1) + 9065 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 1970105697997884436771222379785.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer a... | {"F0": 50, "A": 7, "B": 9065, "S": 1970105697997884436771222379785, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 2, 4, 7, 8, 10, 14, 15, 16, 18, 20, 21, 22, 23, 24, 25, 26, 31, 32]} | 1 |
construct-rlve-recursive-sequence-sum-l5-s5 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 5 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 59 and F(n) = 2 * F(n - 1) + 4657 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 20261247114260.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer as JSON to `/workd... | {"F0": 59, "A": 2, "B": 4657, "S": 20261247114260, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 18, 20, 32]} | 1 |
construct-rlve-recursive-sequence-sum-l5-s6 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 5 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 47 and F(n) = 1 * F(n - 1) + 10647 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 3833907.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer as JSON to `/workdir/ans... | {"F0": 47, "A": 1, "B": 10647, "S": 3833907, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 2, 4, 8, 9, 10, 12, 14, 15, 17, 18, 19, 21, 22, 23, 24, 25, 26, 27, 31, 32]} | 1 |
construct-rlve-recursive-sequence-sum-l5-s7 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 5 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 124 and F(n) = 2 * F(n - 1) + 4904 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 43187534256648.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer as JSON to `/work... | {"F0": 124, "A": 2, "B": 4904, "S": 43187534256648, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32]} | 1 |
construct-rlve-recursive-sequence-sum-l5-s8 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 5 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 125 and F(n) = 1 * F(n - 1) + 14868 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 1353613.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer as JSON to `/workdir/an... | {"F0": 125, "A": 1, "B": 14868, "S": 1353613, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [3, 8, 22, 26, 32]} | 1 |
construct-rlve-recursive-sequence-sum-l5-s9 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 5 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 70 and F(n) = 5 * F(n - 1) + 2648 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 681728124730224609373676.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer as JSON ... | {"F0": 70, "A": 5, "B": 2648, "S": 681728124730224609373676, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [16, 30]} | 1 |
construct-rlve-recursive-sequence-sum-l6-s0 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 6 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 87 and F(n) = 1 * F(n - 1) + 5482 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 1118937.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer as JSON to `/workdir/answ... | {"F0": 87, "A": 1, "B": 5482, "S": 1118937, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [9, 12, 13, 23, 41, 48, 58]} | 1 |
construct-rlve-recursive-sequence-sum-l6-s1 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 6 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 28 and F(n) = 1 * F(n - 1) + 8055 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 7218176.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer as JSON to `/workdir/answ... | {"F0": 28, "A": 1, "B": 8055, "S": 7218176, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 3, 4, 5, 6, 9, 10, 12, 13, 15, 16, 19, 20, 23, 24, 26, 27, 30, 31, 32, 37, 38, 39, 42, 44, 49, 50, 51, 52, 54, 56, 58]} | 1 |
construct-rlve-recursive-sequence-sum-l6-s2 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 6 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 13 and F(n) = 3 * F(n - 1) + 3346 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 2760927464939313508928960025942.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer a... | {"F0": 13, "A": 3, "B": 3346, "S": 2760927464939313508928960025942, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [4, 5, 6, 7, 11, 21, 23, 25, 26, 36, 40, 46, 47, 50, 51, 52, 54, 57]} | 1 |
construct-rlve-recursive-sequence-sum-l6-s3 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 6 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 88 and F(n) = 1 * F(n - 1) + 2172 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 3240592.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer as JSON to `/workdir/answ... | {"F0": 88, "A": 1, "B": 2172, "S": 3240592, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 2, 3, 4, 5, 7, 8, 10, 11, 13, 15, 16, 17, 18, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 49, 51, 52, 53, 54, 56, 58, 59, 60]} | 1 |
construct-rlve-recursive-sequence-sum-l6-s4 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 6 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 93 and F(n) = 6 * F(n - 1) + 4593 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 57726287021072070499166522174508502366615992440421.
Answer format: {"indices": [n_1, ..., n_k]}
Write ... | {"F0": 93, "A": 6, "B": 4593, "S": 57726287021072070499166522174508502366615992440421, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 2, 4, 6, 7, 10, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 33, 34, 36, 37, 38, 40, 41, 43, 44, 45, 49, 50, 51, 54, 55, 56, 59, 60]} | 1 |
construct-rlve-recursive-sequence-sum-l6-s5 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 6 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 82 and F(n) = 1 * F(n - 1) + 12233 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 1296944.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer as JSON to `/workdir/ans... | {"F0": 82, "A": 1, "B": 12233, "S": 1296944, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [13, 36, 57]} | 1 |
construct-rlve-recursive-sequence-sum-l6-s6 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 6 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 121 and F(n) = 14 * F(n - 1) + 3298 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 236342378210210665113249592011061048114378379331220912999513385202334756.
Answer format: {"indices": ... | {"F0": 121, "A": 14, "B": 3298, "S": 236342378210210665113249592011061048114378379331220912999513385202334756, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]} | 1 |
construct-rlve-recursive-sequence-sum-l6-s7 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 6 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 49 and F(n) = 5 * F(n - 1) + 11019 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 587538698265592840222051534802238378738808477.
Answer format: {"indices": [n_1, ..., n_k]}
Write your... | {"F0": 49, "A": 5, "B": 11019, "S": 587538698265592840222051534802238378738808477, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [2, 3, 6, 7, 8, 13, 15, 16, 27, 32, 34, 36, 39, 42, 44, 56, 58, 59]} | 1 |
construct-rlve-recursive-sequence-sum-l6-s8 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 6 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 35 and F(n) = 1 * F(n - 1) + 11947 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 11040043.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer as JSON to `/workdir/an... | {"F0": 35, "A": 1, "B": 11947, "S": 11040043, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [2, 8, 9, 10, 13, 15, 16, 17, 18, 20, 21, 23, 27, 28, 29, 34, 35, 39, 44, 45, 46, 47, 48, 49, 51, 53, 58, 59, 60]} | 1 |
construct-rlve-recursive-sequence-sum-l6-s9 | construct | rlve_recursive_sequence_sum | linear_recurrence_subset_sum | number_theory | competition | 6 | RLVE-Gym/recursive_sequence_sum_construction | MIT | [
"agentic_trivial"
] | Define the sequence F by F(0) = 113 and F(n) = 1 * F(n - 1) + 8655 for every integer n >= 1.
Find a non-empty set of distinct positive indices n_1, ..., n_k (index 0 is not allowed) such that F(n_1) + ... + F(n_k) = 7203898.
Answer format: {"indices": [n_1, ..., n_k]}
Write your final answer as JSON to `/workdir/ans... | {"F0": 113, "A": 1, "B": 8655, "S": 7203898, "family": "rlve_recursive_sequence_sum", "subset": "construct"} | null | null | null | {"indices": [1, 4, 6, 8, 12, 13, 16, 18, 23, 24, 25, 28, 30, 31, 35, 40, 43, 47, 48, 49, 51, 52, 54, 55, 59, 60]} | 1 |
construct-rlve-round-robin-scores-l1-s0 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 1 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 4 x 4 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [3, 2, 4, 5] (W[0], ..., W[3])
Answer format: {"A": [row_0, ..., row... | {"W": [3, 2, 4, 5], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0111", "1001", "1200", "1120"]} | 1 |
construct-rlve-round-robin-scores-l1-s1 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 1 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 4 x 4 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [5, 1, 5, 4] (W[0], ..., W[3])
Answer format: {"A": [row_0, ..., row... | {"W": [5, 1, 5, 4], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0112", "1000", "1201", "0210"]} | 1 |
construct-rlve-round-robin-scores-l1-s2 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 1 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 4 x 4 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [3, 5, 2, 3] (W[0], ..., W[3])
Answer format: {"A": [row_0, ..., row... | {"W": [3, 5, 2, 3], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0111", "1021", "1001", "1110"]} | 1 |
construct-rlve-round-robin-scores-l1-s3 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 1 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 4 x 4 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [5, 5, 4, 1] (W[0], ..., W[3])
Answer format: {"A": [row_0, ..., row... | {"W": [5, 5, 4, 1], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0112", "1021", "1002", "0100"]} | 1 |
construct-rlve-round-robin-scores-l1-s4 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 1 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 4 x 4 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [3, 9, 3, 3] (W[0], ..., W[3])
Answer format: {"A": [row_0, ..., row... | {"W": [3, 9, 3, 3], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0020", "2022", "0002", "2000"]} | 1 |
construct-rlve-round-robin-scores-l1-s5 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 1 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 4 x 4 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [4, 4, 4, 4] (W[0], ..., W[3])
Answer format: {"A": [row_0, ..., row... | {"W": [4, 4, 4, 4], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0012", "2001", "1200", "0120"]} | 1 |
construct-rlve-round-robin-scores-l1-s6 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 1 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 4 x 4 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [4, 0, 7, 6] (W[0], ..., W[3])
Answer format: {"A": [row_0, ..., row... | {"W": [4, 0, 7, 6], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0210", "0000", "1202", "2200"]} | 1 |
construct-rlve-round-robin-scores-l1-s7 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 1 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 4 x 4 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [2, 3, 7, 2] (W[0], ..., W[3])
Answer format: {"A": [row_0, ..., row... | {"W": [2, 3, 7, 2], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0101", "1011", "2102", "1100"]} | 1 |
construct-rlve-round-robin-scores-l1-s8 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 1 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 4 x 4 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [6, 6, 6, 0] (W[0], ..., W[3])
Answer format: {"A": [row_0, ..., row... | {"W": [6, 6, 6, 0], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0202", "0022", "2002", "0000"]} | 1 |
construct-rlve-round-robin-scores-l1-s9 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 1 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 4 x 4 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [9, 2, 2, 2] (W[0], ..., W[3])
Answer format: {"A": [row_0, ..., row... | {"W": [9, 2, 2, 2], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0222", "0011", "0101", "0110"]} | 1 |
construct-rlve-round-robin-scores-l2-s0 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 2 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 6 x 6 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [3, 9, 5, 5, 9, 4] (W[0], ..., W[5])
Answer format: {"A": [row_0, ..... | {"W": [3, 9, 5, 5, 9, 4], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["001011", "201211", "110111", "201001", "111202", "111100"]} | 1 |
construct-rlve-round-robin-scores-l2-s1 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 2 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 6 x 6 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [7, 12, 6, 6, 10, 3] (W[0], ..., W[5])
Answer format: {"A": [row_0, ... | {"W": [7, 12, 6, 6, 10, 3], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["002210", "202022", "000202", "020002", "102202", "200000"]} | 1 |
construct-rlve-round-robin-scores-l2-s2 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 2 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 6 x 6 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [5, 4, 9, 4, 5, 5] (W[0], ..., W[5])
Answer format: {"A": [row_0, ..... | {"W": [5, 4, 9, 4, 5, 5], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["011111", "100111", "120211", "110011", "111101", "111110"]} | 1 |
construct-rlve-round-robin-scores-l2-s3 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 2 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 6 x 6 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [3, 4, 9, 9, 6, 5] (W[0], ..., W[5])
Answer format: {"A": [row_0, ..... | {"W": [3, 4, 9, 9, 6, 5], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["011010", "100111", "120121", "211012", "110102", "211000"]} | 1 |
construct-rlve-round-robin-scores-l2-s4 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 2 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 6 x 6 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [7, 5, 7, 4, 4, 5] (W[0], ..., W[5])
Answer format: {"A": [row_0, ..... | {"W": [7, 5, 7, 4, 4, 5], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["011211", "101111", "110121", "011011", "110101", "111110"]} | 1 |
construct-rlve-round-robin-scores-l2-s5 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 2 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 6 x 6 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [5, 5, 5, 5, 5, 5] (W[0], ..., W[5])
Answer format: {"A": [row_0, ..... | {"W": [5, 5, 5, 5, 5, 5], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["011111", "101111", "110111", "111011", "111101", "111110"]} | 1 |
construct-rlve-round-robin-scores-l2-s6 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 2 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 6 x 6 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [7, 3, 9, 7, 6, 12] (W[0], ..., W[5])
Answer format: {"A": [row_0, .... | {"W": [7, 3, 9, 7, 6, 12], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["020120", "000002", "220200", "120020", "022000", "202220"]} | 1 |
construct-rlve-round-robin-scores-l2-s7 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 2 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 6 x 6 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [9, 7, 12, 0, 9, 7] (W[0], ..., W[5])
Answer format: {"A": [row_0, .... | {"W": [9, 7, 12, 0, 9, 7], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["020202", "002201", "200222", "000000", "220200", "010220"]} | 1 |
construct-rlve-round-robin-scores-l2-s8 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 2 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 6 x 6 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [7, 7, 4, 7, 5, 4] (W[0], ..., W[5])
Answer format: {"A": [row_0, ..... | {"W": [7, 7, 4, 7, 5, 4], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["011112", "101112", "110110", "111012", "111101", "002010"]} | 1 |
construct-rlve-round-robin-scores-l2-s9 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 2 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 6 x 6 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [9, 4, 5, 9, 7, 6] (W[0], ..., W[5])
Answer format: {"A": [row_0, ..... | {"W": [9, 4, 5, 9, 7, 6], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["021211", "002001", "100201", "020022", "122000", "111020"]} | 1 |
construct-rlve-round-robin-scores-l3-s0 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 3 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 9 x 9 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [9, 12, 15, 6, 12, 3, 9, 17, 16] (W[0], ..., W[8])
Answer format: {"... | {"W": [9, 12, 15, 6, 12, 3, 9, 17, 16], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["010210102", "102112200", "200202220", "010002101", "112202010", "200000000", "100122010", "220212102", "022122200"]} | 1 |
construct-rlve-round-robin-scores-l3-s1 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 3 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 9 x 9 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [9, 12, 11, 12, 12, 11, 8, 18, 10] (W[0], ..., W[8])
Answer format: ... | {"W": [9, 12, 11, 12, 12, 11, 8, 18, 10], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["022000020", "002002022", "000122102", "221001102", "220200200", "200120201", "221100000", "002222202", "200021200"]} | 1 |
construct-rlve-round-robin-scores-l3-s2 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 3 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 9 x 9 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [10, 8, 8, 10, 10, 9, 7, 9, 6] (W[0], ..., W[8])
Answer format: {"A"... | {"W": [10, 8, 8, 10, 10, 9, 7, 9, 6], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["011111211", "101111111", "110111111", "111012111", "111101112", "111010121", "011111011", "111110102", "111101100"]} | 1 |
construct-rlve-round-robin-scores-l3-s3 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 3 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 9 x 9 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [10, 3, 12, 10, 10, 14, 16, 8, 10] (W[0], ..., W[8])
Answer format: ... | {"W": [10, 3, 12, 10, 10, 14, 16, 8, 10], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["021101021", "000200000", "120112111", "101010122", "221100101", "120220012", "221112021", "021021000", "121010120"]} | 1 |
construct-rlve-round-robin-scores-l3-s4 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 3 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 9 x 9 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [14, 10, 13, 9, 3, 11, 8, 14, 8] (W[0], ..., W[8])
Answer format: {"... | {"W": [14, 10, 13, 9, 3, 11, 8, 14, 8], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["020121202", "000112121", "220121101", "111011120", "010100001", "101120211", "011120011", "202021102", "011211100"]} | 1 |
construct-rlve-round-robin-scores-l3-s5 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 3 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 9 x 9 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [8, 12, 6, 11, 9, 7, 10, 9, 8] (W[0], ..., W[8])
Answer format: {"A"... | {"W": [8, 12, 6, 11, 9, 7, 10, 9, 8], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["011111111", "102121111", "100111110", "111002112", "101201111", "111010111", "111111021", "111111002", "112011100"]} | 1 |
construct-rlve-round-robin-scores-l3-s6 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 3 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 9 x 9 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [10, 10, 7, 10, 7, 10, 8, 8, 6] (W[0], ..., W[8])
Answer format: {"A... | {"W": [10, 10, 7, 10, 7, 10, 8, 8, 6], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["011111112", "101121111", "110110111", "111011112", "101101111", "112110111", "111111011", "111111101", "011011110"]} | 1 |
construct-rlve-round-robin-scores-l3-s7 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 3 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 9 x 9 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [8, 8, 10, 7, 8, 8, 8, 7, 10] (W[0], ..., W[8])
Answer format: {"A":... | {"W": [8, 8, 10, 7, 8, 8, 8, 7, 10], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["011111111", "101111111", "110111121", "111011110", "111101111", "111110111", "111111011", "110111101", "111211110"]} | 1 |
construct-rlve-round-robin-scores-l3-s8 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 3 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 9 x 9 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [14, 9, 10, 8, 9, 17, 13, 6, 7] (W[0], ..., W[8])
Answer format: {"A... | {"W": [14, 9, 10, 8, 9, 17, 13, 6, 7], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["022020121", "001120012", "010211021", "210000210", "001200112", "221220012", "122012011", "010111101", "101200110"]} | 1 |
construct-rlve-round-robin-scores-l3-s9 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 3 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 9 x 9 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [15, 9, 7, 4, 13, 7, 17, 6, 15] (W[0], ..., W[8])
Answer format: {"A... | {"W": [15, 9, 7, 4, 13, 7, 17, 6, 15], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["012122012", "100201120", "020110011", "101011000", "021102121", "012100011", "212212020", "101201000", "021211220"]} | 1 |
construct-rlve-round-robin-scores-l4-s0 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 4 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 13 x 13 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [22, 20, 11, 20, 22, 13, 13, 12, 10, 15, 11, 13, 14] (W[0], ..., W[... | {"W": [22, 20, 11, 20, 22, 13, 13, 12, 10, 15, 11, 13, 14], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0020211211222", "2021011221102", "0000011011221", "2120121002121", "0221001222112", "1110200021111", "1111120110111", "0022021010100", "1012001101110", "1110012210210", "0101111110012", "0200111211101", "0011011222010"]} | 1 |
construct-rlve-round-robin-scores-l4-s1 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 4 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 13 x 13 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [13, 12, 17, 22, 19, 7, 16, 12, 16, 12, 14, 13, 15] (W[0], ..., W[1... | {"W": [13, 12, 17, 22, 19, 7, 16, 12, 16, 12, 14, 13, 15], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0111111210111", "1011110121101", "1101122102111", "1110111122222", "1111021211220", "1101000111010", "1201120110112", "0111011002201", "1020111201112", "2100112010011", "1110021012020", "1210011211001", "1110220101210"]} | 1 |
construct-rlve-round-robin-scores-l4-s2 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 4 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 13 x 13 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [14, 12, 12, 10, 12, 12, 14, 11, 14, 13, 17, 21, 13] (W[0], ..., W[... | {"W": [14, 12, 12, 10, 12, 12, 14, 11, 14, 13, 17, 21, 13], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0112111111111", "1001110111121", "1201111110101", "0110111210100", "1111021111001", "1111001112011", "1211110111111", "1110111011111", "1111111101112", "1122101110001", "1111221112001", "1022211112201", "1112111101110"]} | 1 |
construct-rlve-round-robin-scores-l4-s3 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 4 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 13 x 13 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [8, 14, 12, 11, 17, 19, 17, 17, 15, 15, 10, 17, 14] (W[0], ..., W[1... | {"W": [8, 14, 12, 11, 17, 19, 17, 17, 15, 15, 10, 17, 14], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0101001111110", "1011111201102", "2100100121101", "1120021000101", "2112001211111", "2120201111121", "1121110210211", "1012010012122", "1202111101111", "1112112010111", "1111110111001", "1222101011200", "2011111011120"]} | 1 |
construct-rlve-round-robin-scores-l4-s4 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 4 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 13 x 13 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [15, 20, 15, 13, 22, 17, 17, 21, 11, 12, 15, 23, 11] (W[0], ..., W[... | {"W": [15, 20, 15, 13, 22, 17, 17, 21, 11, 12, 15, 23, 11], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0011100022202", "2020012220102", "1001020022102", "1210102010020", "1221000222112", "2102202012000", "2020200111211", "2022021021012", "0001011002211", "0202001100210", "0112120200002", "2220121111202", "0002021012000"]} | 1 |
construct-rlve-round-robin-scores-l4-s5 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 4 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 13 x 13 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [19, 19, 18, 9, 13, 9, 20, 17, 15, 22, 15, 16, 21] (W[0], ..., W[12... | {"W": [19, 19, 18, 9, 13, 9, 20, 17, 15, 22, 15, 16, 21], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0122221010201", "1020122121020", "0002212120012", "0200021001100", "0102020201101", "0010002020011", "1001200222220", "2112020000022", "1002200201210", "2121120210202", "0221120200010", "2012210012100", "1202112020220"]} | 1 |
construct-rlve-round-robin-scores-l4-s6 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 4 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 13 x 13 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [14, 17, 14, 7, 15, 18, 13, 16, 13, 17, 11, 13, 14] (W[0], ..., W[1... | {"W": [14, 17, 14, 7, 15, 18, 13, 16, 13, 17, 11, 13, 14], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0121111111111", "1022112111110", "0001111121121", "1010110100101", "1111011021211", "1111101111222", "1012110010121", "1111212021001", "1102011001112", "1112112110210", "1111001210011", "1102100211101", "1211101102110"]} | 1 |
construct-rlve-round-robin-scores-l4-s7 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 4 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 13 x 13 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [14, 17, 12, 26, 12, 20, 11, 13, 11, 18, 13, 19, 12] (W[0], ..., W[... | {"W": [14, 17, 12, 26, 12, 20, 11, 13, 11, 18, 13, 19, 12], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0121001120012", "1021212121000", "0000212100210", "1120111222222", "2001001112011", "2111201211112", "1001110110112", "1110101021201", "0020111001102", "2120012110112", "2200211011000", "1210111221201", "0220100100210"]} | 1 |
construct-rlve-round-robin-scores-l4-s8 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 4 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 13 x 13 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [13, 11, 14, 12, 14, 12, 14, 12, 11, 12, 12, 12, 11] (W[0], ..., W[... | {"W": [13, 11, 14, 12, 14, 12, 14, 12, 11, 12, 12, 12, 11], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0101111111112", "1011110111111", "2101111111111", "1110111111111", "1111011121111", "1111101111111", "1211110111111", "1111111011111", "1111011101111", "1111111110111", "1111111111011", "1111111111101", "0111111111110"]} | 1 |
construct-rlve-round-robin-scores-l4-s9 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 4 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 13 x 13 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [10, 12, 12, 12, 12, 12, 12, 14, 12, 12, 16, 12, 11] (W[0], ..., W[... | {"W": [10, 12, 12, 12, 12, 12, 12, 14, 12, 12, 16, 12, 11], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0111111011011", "1011111111111", "1101111111111", "1110111111111", "1111011111111", "1111101111111", "1111110111111", "2111111011111", "1111111101111", "1111111110111", "2111111111012", "1111111111101", "1111111111010"]} | 1 |
construct-rlve-round-robin-scores-l5-s0 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 5 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 18 x 18 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [16, 17, 22, 20, 20, 19, 17, 23, 16, 27, 20, 19, 19, 16, 19, 17, 21,... | {"W": [16, 17, 22, 20, 20, 19, 17, 23, 16, 27, 20, 19, 19, 16, 19, 17, 21, 20], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["011111101011111210", "101111111211011011", "110101121211121111", "111011110121111121", "112101211111111011", "111110111021111201", "111101011110111211", "210111101011211221", "111211110011101110", "200112122021221100", "111010111002121112", "111111211100111012", "121111101011011112", "110111112001101111", "1111... | 1 |
construct-rlve-round-robin-scores-l5-s1 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 5 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 18 x 18 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [17, 14, 18, 31, 27, 18, 18, 22, 19, 17, 21, 19, 30, 19, 20, 22, 27,... | {"W": [17, 14, 18, 31, 27, 18, 18, 22, 19, 17, 21, 19, 30, 19, 20, 22, 27, 27], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["011101112120011110", "101012101121000001", "110110211101111210", "121021112222021102", "211002010110212222", "102100011101011212", "110122002201010001", "121111201210012101", "011021010201100212", "111011000012221010", "002012212101201010", "211021121010011110", "221202221002012200", "121011112021101001", "1211... | 1 |
construct-rlve-round-robin-scores-l5-s2 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 5 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 18 x 18 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [16, 16, 21, 18, 18, 22, 17, 23, 27, 14, 24, 14, 12, 20, 21, 22, 19,... | {"W": [16, 16, 21, 18, 18, 22, 17, 23, 27, 14, 24, 14, 12, 20, 21, 22, 19, 24], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["011011101111111021", "101111111111101111", "110120111111212011", "211001200112111010", "110200011111211111", "112120111111121011", "111021010111111111", "211211101111111211", "111211210121111122", "111111111001101110", "111111110201221211", "111011111110200100", "110101111100010111", "121110111202100111", "1101... | 1 |
construct-rlve-round-robin-scores-l5-s3 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 5 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 18 x 18 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [16, 21, 20, 19, 17, 19, 18, 23, 17, 15, 20, 16, 18, 19, 24, 15, 15,... | {"W": [16, 21, 20, 19, 17, 19, 18, 23, 17, 15, 20, 16, 18, 19, 24, 15, 15, 18], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["001111111111111111", "201111111111111211", "110011111121111121", "112011111201110111", "111101111101110121", "111110101111120211", "111111011211110111", "111112101112121111", "111111110111111111", "111011011011111111", "110221111101002111", "111111101110111111", "111111111121011110", "111110101121101112", "1112... | 1 |
construct-rlve-round-robin-scores-l5-s4 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 5 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 18 x 18 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [28, 18, 17, 30, 20, 20, 19, 21, 24, 24, 21, 20, 22, 24, 22, 14, 33,... | {"W": [28, 18, 17, 30, 20, 20, 19, 21, 24, 24, 21, 20, 22, 24, 22, 14, 33, 16], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["021121121001222201", "000020101211201120", "120111011120001111", "121011111212122202", "001101110201120221", "121110110002120102", "112111001211110002", "021111201112201001", "111122110011122200", "201002012022111102", "210122111000001220", "112010101020102211", "002111101121021211", "022000120122002201", "0110... | 1 |
construct-rlve-round-robin-scores-l5-s5 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 5 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 18 x 18 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [16, 12, 30, 28, 26, 20, 13, 24, 32, 17, 28, 26, 18, 21, 33, 20, 20,... | {"W": [16, 12, 30, 28, 26, 20, 13, 24, 32, 17, 28, 26, 18, 21, 33, 20, 20, 30], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["020100100210200201", "000101000210100112", "220021200100222221", "112022220000022211", "220002202202210010", "211000000222111020", "120002020100000110", "222022001001112110", "222202210021210112", "001200122001120001", "112220220202111110", "222200211100120021", "010201210111000220", "220011211010201200", "2200... | 1 |
construct-rlve-round-robin-scores-l5-s6 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 5 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 18 x 18 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [24, 23, 19, 22, 13, 24, 13, 18, 21, 18, 17, 19, 19, 18, 17, 22, 15,... | {"W": [24, 23, 19, 22, 13, 24, 13, 18, 21, 18, 17, 19, 19, 18, 17, 22, 15, 20], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["012120112111211111", "102111211111112111", "000111121112111111", "111021212111111011", "011001111110011111", "211110110122121111", "101011011101110111", "110111100111012121", "011012120221111010", "111111110011111121", "111110210101111111", "110120111110111211", "011121121111010111", "111110111111102111", "1011... | 1 |
construct-rlve-round-robin-scores-l5-s7 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 5 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 18 x 18 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [17, 15, 19, 23, 15, 16, 18, 16, 16, 19, 20, 19, 19, 16, 17, 19, 16,... | {"W": [17, 15, 19, 23, 15, 16, 18, 16, 16, 19, 20, 19, 19, 16, 17, 19, 16, 19], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["011111111111111111", "101101111101111111", "110121111111111111", "111011112121111121", "120101111011011110", "111110111101111111", "111111021111111011", "111111001111111111", "111011110111111111", "111121111011111111", "121012111101111111", "111111111110121111", "111121111111011111", "111111111110101111", "1111... | 1 |
construct-rlve-round-robin-scores-l5-s8 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 5 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 18 x 18 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [21, 25, 17, 20, 17, 17, 29, 20, 16, 18, 20, 17, 18, 15, 19, 26, 15,... | {"W": [21, 25, 17, 20, 17, 17, 29, 20, 16, 18, 20, 17, 18, 15, 19, 26, 15, 21], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["001111102112111112", "201112021120112111", "110201110111111111", "110020121011112111", "112001211101111010", "101210021110110111", "121102012121221012", "201010101121112111", "012111010111111110", "111211111011111011", "101121001102112111", "021112111100010111", "111111011112011111", "111111011111101011", "1010... | 1 |
construct-rlve-round-robin-scores-l5-s9 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 5 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 18 x 18 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [20, 19, 21, 19, 14, 23, 16, 17, 21, 19, 23, 27, 19, 23, 20, 25, 22,... | {"W": [20, 19, 21, 19, 14, 23, 16, 17, 21, 19, 23, 27, 19, 23, 20, 25, 22, 17], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["021111121020111110", "001110111212120110", "110111110101121212", "111022101101011102", "111001111111011110", "121010111201211112", "111111021110100111", "011211002010110012", "112111100120001221", "201110121011101012", "012212110101121111", "201111222110211102", "111220112110001011", "100111212201202011", "1211... | 1 |
construct-rlve-round-robin-scores-l6-s0 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 6 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 25 x 25 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [38, 20, 35, 27, 38, 33, 41, 39, 22, 37, 38, 33, 42, 28, 30, 28, 30,... | {"W": [38, 20, 35, 27, 38, 33, 41, 39, 22, 37, 38, 33, 42, 28, 30, 28, 30, 26, 31, 34, 31, 29, 36, 32, 29], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0221210022011110022221021", "0011101020000112102002001", "0100220202120201022020121", "1120010220000212110002020", "0102011122220121220211111", "1201101111100021220022022", "2122110221020111022221111", "2200110011200201222212022", "0020010101022201102110000", "0202011110221201210202202", "2212012020021110221121... | 1 |
construct-rlve-round-robin-scores-l6-s1 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 6 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 25 x 25 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [14, 41, 29, 33, 44, 36, 32, 38, 41, 45, 44, 27, 41, 33, 30, 24, 36,... | {"W": [14, 41, 29, 33, 44, 36, 32, 38, 41, 45, 44, 27, 41, 33, 30, 24, 36, 28, 44, 36, 36, 35, 40, 29, 37], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0000000002002010022000001", "2010020202102220222220200", "2100200200222201002020000", "2220200110200022020010022", "2200012220020222022002212", "2022100002000022212202120", "2222020000000102021022200", "2001022002222222000002210", "2221022200022002220202010", "0022202020022022220222020", "2100222022022102020220... | 1 |
construct-rlve-round-robin-scores-l6-s2 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 6 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 25 x 25 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [28, 31, 26, 24, 29, 26, 24, 26, 24, 26, 24, 27, 22, 27, 21, 25, 30,... | {"W": [28, 31, 26, 24, 29, 26, 24, 26, 24, 26, 24, 27, 22, 27, 21, 25, 30, 26, 26, 27, 30, 26, 25, 28, 24], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0121112121111111101101111", "1011001221111121121111201", "0101012111112111111111111", "1110121111111111000021111", "1221010111112111111111111", "1210102111101111111111111", "0101200011111111111211111", "1011112011011211111111111", "0011111101111111121111111", "1111111110111111211111111", "1111111211011111111110... | 1 |
construct-rlve-round-robin-scores-l6-s3 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 6 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 25 x 25 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [32, 36, 27, 31, 35, 32, 40, 17, 37, 39, 34, 37, 24, 35, 38, 45, 45,... | {"W": [32, 36, 27, 31, 35, 32, 40, 17, 37, 39, 34, 37, 24, 35, 38, 45, 45, 25, 38, 41, 38, 35, 33, 35, 35], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0002200120022021020020022", "2000221200202102010020222", "2202001200102220002000100", "0200221200220000020022002", "0020022220220221010200200", "2020000002202111021220021", "2111020220020021022002222", "1000020020000020002201000", "0222020002202200200212020", "2222202200222021100021000", "2010002200022201222100... | 1 |
construct-rlve-round-robin-scores-l6-s4 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 6 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 25 x 25 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [36, 33, 26, 36, 46, 32, 41, 25, 37, 32, 28, 37, 31, 28, 22, 33, 33,... | {"W": [36, 33, 26, 36, 46, 32, 41, 25, 37, 32, 28, 37, 31, 28, 22, 33, 33, 30, 42, 53, 29, 47, 27, 36, 41], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0200022021002220120201220", "0000122210212011000122022", "2202000000100022122000200", "2200202200211120220000220", "2120021122202220022022102", "0022000202021222000100202", "0020120220220222210220200", "2020100002000012202012001", "0122020200200222220020020", "1222002020220002010002200", "2010020200001220120202... | 1 |
construct-rlve-round-robin-scores-l6-s5 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 6 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 25 x 25 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [38, 36, 31, 48, 37, 20, 20, 34, 29, 43, 35, 25, 40, 40, 30, 30, 25,... | {"W": [38, 36, 31, 48, 37, 20, 20, 34, 29, 43, 35, 25, 40, 40, 30, 30, 25, 26, 21, 36, 29, 21, 27, 38, 31], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0011221011210022222111121", "2021011112021201102022201", "1000222020020111110222010", "1120012221121020222222202", "0202022220212101012211100", "0101001100100110210201112", "1100010010000001212001122", "2120012001021121021121102", "1100021201200122001120012", "1021222110122002212022210", "0221012201020012220102... | 1 |
construct-rlve-round-robin-scores-l6-s6 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 6 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 25 x 25 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [21, 27, 25, 31, 28, 26, 25, 28, 15, 24, 24, 35, 32, 29, 23, 25, 26,... | {"W": [21, 27, 25, 31, 28, 26, 25, 28, 15, 24, 24, 35, 32, 29, 23, 25, 26, 32, 34, 28, 25, 34, 31, 26, 22], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0010111011111011101211111", "2011111111111120111111111", "1101111010122111010012111", "2110022111111111212111001", "1112011111111112111111111", "1110101111200111112110112", "1110110111100111111122111", "2121111021110011110110211", "1111111001110100100000111", "1121111110111111011110111", "1111101111011121111110... | 1 |
construct-rlve-round-robin-scores-l6-s7 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 6 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 25 x 25 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [28, 26, 24, 26, 26, 29, 29, 22, 25, 27, 25, 24, 26, 20, 32, 27, 33,... | {"W": [28, 26, 24, 26, 26, 29, 29, 22, 25, 27, 25, 24, 26, 20, 32, 27, 33, 31, 27, 27, 30, 31, 27, 24, 19], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0111011121122111110011201", "1011101111121211111110111", "1100110111112111111111111", "1120101211011111111111111", "2111011110110111111111121", "1212102211101111001111111", "1121100111111211112110012", "1110101011120111111111011", "0111111100211111111011112", "1111211120011111101110121", "1112111102011111010111... | 1 |
construct-rlve-round-robin-scores-l6-s8 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 6 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 25 x 25 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [32, 25, 24, 35, 24, 30, 30, 25, 24, 26, 27, 21, 25, 28, 30, 23, 30,... | {"W": [32, 25, 24, 35, 24, 30, 30, 25, 24, 26, 27, 21, 25, 28, 30, 23, 30, 24, 33, 23, 24, 25, 26, 25, 24], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0111112212112111111120011", "1021111111111111111011111", "1000111110111112110112111", "1120202111021211101211112", "1110021111110101121110111", "1112001121011111111121121", "0110110111111211112211112", "0111111011111111211111111", "1111101101111111111111201", "0121111110211111011111111", "1112121110011111111111... | 1 |
construct-rlve-round-robin-scores-l6-s9 | construct | rlve_round_robin_scores | tournament_score_realisation_3_1_0 | combinatorics | competition | 6 | RLVE-Gym/round_robin | MIT | [
"agentic_trivial"
] | Construct an 25 x 25 matrix A (0-indexed) with entries in {0, 1, 2} such that
1. A[i][i] = 0 for all i;
2. A[i][j] + A[j][i] = 2 for all i != j;
3. W[i] = 3 * #{j : A[i][j] = 2} + 1 * #{j : A[i][j] = 1} equals the target below for every i.
Target W = [27, 34, 25, 33, 23, 38, 33, 29, 37, 26, 28, 43, 31, 23, 29, 26, 33,... | {"W": [27, 34, 25, 33, 23, 38, 33, 29, 37, 26, 28, 43, 31, 23, 29, 26, 33, 36, 29, 31, 32, 24, 34, 33, 27], "family": "rlve_round_robin_scores", "subset": "construct"} | null | null | null | {"A": ["0111101102220011011101022", "1020200021012122120112002", "1001000211000122201111210", "1210111011201102001212221", "1021000111201221110011000", "2221201012121101101122102", "1221210000110122201111112", "1202122001210102100100210", "2011112202221100201021121", "0111102100001210111211121", "0220011002012212111010... | 1 |
construct-rlve-shortest-path-count-l1-s0 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 1 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 25, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 23. (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-th... | {"K": 23, "n_max": 24, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 15, "adj": ["NNYYNNNNNNYNNNN", "NNNNNNNNNNNNNNY", "YNNNYYNNNNNYNNN", "YNNNYYNNNNNYNNN", "NNYYNNYYNNNNYNN", "NNYYNNYYNNNNYNN", "NNNNYYNNYYNNNNN", "NNNNYYNNYYNNNNN", "NNNNNNYYNNNNNNY", "NNNNNNYYNNNNNNY", "YNNNNNNNNNNYNNN", "NNYYNNNNNNYNYNN", "NNNNYYNNNNNYNYN", "NNNNNNNNNNNNYNY", "NYNNNNNNYYNNNYN"]} | 1 |
construct-rlve-shortest-path-count-l1-s1 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 1 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 15, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 13. (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-th... | {"K": 13, "n_max": 14, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 12, "adj": ["NNYYNNNNYNNN", "NNNNNNNNNNNY", "YNNNYYNNNNNN", "YNNNYYNNNNNN", "NNYYNNYYNNYN", "NNYYNNYYNNYN", "NNNNYYNNNNNY", "NNNNYYNNNNNY", "YNNNNNNNNYNN", "NNNNNNNNYNYN", "NNNNYYNNNYNY", "NYNNNNYYNNYN"]} | 1 |
construct-rlve-shortest-path-count-l1-s2 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 1 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 24, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 22. (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-th... | {"K": 22, "n_max": 23, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 15, "adj": ["NNYYNNNNNNNNNNN", "NNNNNNNNNNNNNNY", "YNNNYYNNNNNYNNN", "YNNNYYNNNNNYNNN", "NNYYNNYYNNNNYNN", "NNYYNNYYNNNNYNN", "NNNNYYNNYYNNNNN", "NNNNYYNNYYNNNNN", "NNNNNNYYNNNNNNY", "NNNNNNYYNNNNNNY", "NNNNNNNNNNNYNNN", "NNYYNNNNNNYNYNN", "NNNNYYNNNNNYNYN", "NNNNNNNNNNNNYNY", "NYNNNNNNYYNNNYN"]} | 1 |
construct-rlve-shortest-path-count-l1-s3 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 1 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 37, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 35. (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-th... | {"K": 35, "n_max": 36, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 18, "adj": ["NNYYNNNNNNNNYNNNNN", "NNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNYNNNN", "YNNNYYNNNNNNNYNNNN", "NNYYNNYYNNNNNNNNNN", "NNYYNNYYNNNNNNNNNN", "NNNNYYNNYYNNNNNNNN", "NNNNYYNNYYNNNNNNNN", "NNNNNNYYNNYYNNNNNN", "NNNNNNYYNNYYNNNNNN", "NNNNNNNNYYNNNNNNNY", "NNNNNNNNYYNNNNNNNY", "YNNNNNNNNNNNNYNNNN", "NNYYNNNNNNNNYNY... | 1 |
construct-rlve-shortest-path-count-l1-s4 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 1 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 38, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 36. (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-th... | {"K": 36, "n_max": 37, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 18, "adj": ["NNYYNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNN", "NNYYNNYYNNNNNNYNNN", "NNYYNNYYNNNNNNYNNN", "NNNNYYNNYYNNNNNNNN", "NNNNYYNNYYNNNNNNNN", "NNNNNNYYNNYYNNNNNN", "NNNNNNYYNNYYNNNNNN", "NNNNNNNNYYNNNNNNNY", "NNNNNNNNYYNNNNNNNY", "NNNNNNNNNNNNNYNNNN", "NNNNNNNNNNNNYNY... | 1 |
construct-rlve-shortest-path-count-l1-s5 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 1 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 34, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 32. (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-th... | {"K": 32, "n_max": 33, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 18, "adj": ["NNYYNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNN", "NNYYNNYYNNNNNNNNNN", "NNNNYYNNYYNNNNNNNN", "NNNNYYNNYYNNNNNNNN", "NNNNNNYYNNYYNNNNNN", "NNNNNNYYNNYYNNNNNN", "NNNNNNNNYYNNNNNNNY", "NNNNNNNNYYNNNNNNNY", "NNNNNNNNNNNNNYNNNN", "NNNNNNNNNNNNYNY... | 1 |
construct-rlve-shortest-path-count-l1-s6 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 1 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 19, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 17. (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-th... | {"K": 17, "n_max": 18, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 15, "adj": ["NNYYNNNNNNYNNNN", "NNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNN", "YNNNYYNNNNNNNNN", "NNYYNNYYNNNNNNN", "NNYYNNYYNNNNNNN", "NNNNYYNNYYNNNNN", "NNNNYYNNYYNNNNN", "NNNNNNYYNNNNNNY", "NNNNNNYYNNNNNNY", "YNNNNNNNNNNYNNN", "NNNNNNNNNNYNYNN", "NNNNNNNNNNNYNYN", "NNNNNNNNNNNNYNY", "NYNNNNNNYYNNNYN"]} | 1 |
construct-rlve-shortest-path-count-l1-s7 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 1 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 40, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 40. (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-th... | {"K": 40, "n_max": 39, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 18, "adj": ["NNYYNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNN", "NNYYNNYYNNNNNNNNNN", "NNNNYYNNYYNNNNNYNN", "NNNNYYNNYYNNNNNYNN", "NNNNNNYYNNYYNNNNNN", "NNNNNNYYNNYYNNNNNN", "NNNNNNNNYYNNNNNNNY", "NNNNNNNNYYNNNNNNNY", "NNNNNNNNNNNNNYNNNN", "NNNNNNNNNNNNYNY... | 1 |
construct-rlve-shortest-path-count-l1-s8 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 1 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 18, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 16. (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-th... | {"K": 16, "n_max": 17, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 15, "adj": ["NNYYNNNNNNNNNNN", "NNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNN", "YNNNYYNNNNNNNNN", "NNYYNNYYNNNNNNN", "NNYYNNYYNNNNNNN", "NNNNYYNNYYNNNNN", "NNNNYYNNYYNNNNN", "NNNNNNYYNNNNNNY", "NNNNNNYYNNNNNNY", "NNNNNNNNNNNYNNN", "NNNNNNNNNNYNYNN", "NNNNNNNNNNNYNYN", "NNNNNNNNNNNNYNY", "NYNNNNNNYYNNNYN"]} | 1 |
construct-rlve-shortest-path-count-l1-s9 | construct | rlve_shortest_path_count | cf388b_shortest_path_count | combinatorics | competition | 1 | RLVE-Gym/shortest_path_count_construction | MIT | [] | Construct a simple undirected graph on N vertices, numbered 1..N, with N < 35, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 33. (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-th... | {"K": 33, "n_max": 34, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 18, "adj": ["NNYYNNNNNNNNYNNNNN", "NNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNN", "NNYYNNYYNNNNNNNNNN", "NNNNYYNNYYNNNNNNNN", "NNNNYYNNYYNNNNNNNN", "NNNNNNYYNNYYNNNNNN", "NNNNNNYYNNYYNNNNNN", "NNNNNNNNYYNNNNNNNY", "NNNNNNNNYYNNNNNNNY", "YNNNNNNNNNNNNYNNNN", "NNNNNNNNNNNNYNY... | 1 |
construct-rlve-shortest-path-count-l2-s0 | 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 381. (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": 381, "n_max": 57, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 27, "adj": ["NNYYNNNNNNNNNNNNNNYNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNYNNNNNN", "NNYYNNYYNNNNNNNNNNNNYNNNNNN", "NNNNYYNNYYNNNNNNNNNNNYNNNNN", "NNNNYYNNYYNNNNNNNNNNNYNNNNN", "NNNNNNYYNNYYNNNNNNNNNNYNNNN", "NNNNNNYYNNYYNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l2-s1 | 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 236. (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": 236, "n_max": 51, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 24, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNYNNNNN", "NNYYNNYYNNNNNNNNNNYNNNNN", "NNNNYYNNYYNNNNNNNNNYNNNN", "NNNNYYNNYYNNNNNNNNNYNNNN", "NNNNNNYYNNYYNNNNNNNNNNNN", "NNNNNNYYNNYYNNNNNNNNNNNN", "NNNNNNNNYYNNYYNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l2-s2 | 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 396. (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": 396, "n_max": 57, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 27, "adj": ["NNYYNNNNNNNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNYNNNNNN", "NNYYNNYYNNNNNNNNNNNNYNNNNNN", "NNNNYYNNYYNNNNNNNNNNNYNNNNN", "NNNNYYNNYYNNNNNNNNNNNYNNNNN", "NNNNNNYYNNYYNNNNNNNNNNNNNNN", "NNNNNNYYNNYYNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l2-s3 | 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 393. (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": 393, "n_max": 57, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 27, "adj": ["NNYYNNNNNNNNNNNNNNYNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNNNNNNNN", "NNNNYYNNYYNNNNNNNNNNNYNNNNN", "NNNNYYNNYYNNNNNNNNNNNYNNNNN", "NNNNNNYYNNYYNNNNNNNNNNNNNNN", "NNNNNNYYNNYYNNNNNNNNNN... | 1 |
construct-rlve-shortest-path-count-l2-s4 | 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 < 40, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 58. (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-th... | {"K": 58, "n_max": 39, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 18, "adj": ["NNYYNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNYNNNN", "YNNNYYNNNNNNNYNNNN", "NNYYNNYYNNNNNNNNNN", "NNYYNNYYNNNNNNNNNN", "NNNNYYNNYYNNNNNYNN", "NNNNYYNNYYNNNNNYNN", "NNNNNNYYNNYYNNNNYN", "NNNNNNYYNNYYNNNNYN", "NNNNNNNNYYNNNNNNNY", "NNNNNNNNYYNNNNNNNY", "NNNNNNNNNNNNNYNNNN", "NNYYNNNNNNNNYNY... | 1 |
construct-rlve-shortest-path-count-l2-s5 | 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 < 46, such that the number of shortest paths between vertex 1 and vertex 2 is exactly 112. (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": 112, "n_max": 45, "family": "rlve_shortest_path_count", "subset": "construct"} | null | null | null | {"n": 21, "adj": ["NNYYNNNNNNNNNNNNNNNNN", "NNNNNNNNNNNNNNNNNNNNY", "YNNNYYNNNNNNNNNNNNNNN", "YNNNYYNNNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNN", "NNYYNNYYNNNNNNNNNNNNN", "NNNNYYNNYYNNNNNNNNNNN", "NNNNYYNNYYNNNNNNNNNNN", "NNNNNNYYNNYYNNNNNNYNN", "NNNNNNYYNNYYNNNNNNYNN", "NNNNNNNNYYNNYYNNNNNYN", "NNNNNNNNYYNNYYNNNNNYN", "N... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.