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-pairwise-sums-recovery-l2-s6 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 2 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 5 distinct positive integers whose 10 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
7, 12, 11, 13, 8, 17, 9, 14, 13, 12
Answer format: {"numbers": [x_1, ..., x_5]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only ... | {"n": 5, "sums": [7, 12, 11, 13, 8, 17, 9, 14, 13, 12], "family": "rlve_pairwise_sums_recovery", "subset": "construct"} | null | null | null | {"numbers": [3, 4, 5, 8, 9]} | 1 |
construct-rlve-pairwise-sums-recovery-l2-s7 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 2 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 5 distinct positive integers whose 10 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
15, 15, 19, 18, 14, 17, 13, 11, 16, 14
Answer format: {"numbers": [x_1, ..., x_5]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. On... | {"n": 5, "sums": [15, 15, 19, 18, 14, 17, 13, 11, 16, 14], "family": "rlve_pairwise_sums_recovery", "subset": "construct"} | null | null | null | {"numbers": [5, 6, 8, 9, 10]} | 1 |
construct-rlve-pairwise-sums-recovery-l2-s8 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 2 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 5 distinct positive integers whose 10 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
5, 13, 7, 15, 9, 14, 12, 6, 8, 7
Answer format: {"numbers": [x_1, ..., x_5]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/w... | {"n": 5, "sums": [5, 13, 7, 15, 9, 14, 12, 6, 8, 7], "family": "rlve_pairwise_sums_recovery", "subset": "construct"} | null | null | null | {"numbers": [2, 3, 4, 5, 10]} | 1 |
construct-rlve-pairwise-sums-recovery-l2-s9 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 2 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 5 distinct positive integers whose 10 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
10, 13, 11, 11, 8, 9, 12, 10, 9, 7
Answer format: {"numbers": [x_1, ..., x_5]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `... | {"n": 5, "sums": [10, 13, 11, 11, 8, 9, 12, 10, 9, 7], "family": "rlve_pairwise_sums_recovery", "subset": "construct"} | null | null | null | {"numbers": [3, 4, 5, 6, 7]} | 1 |
construct-rlve-pairwise-sums-recovery-l3-s0 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 3 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 8 distinct positive integers whose 28 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
9, 15, 17, 7, 18, 8, 20, 23, 10, 8, 17, 21, 5, 9, 3, 13, 4, 6, 18, 30, 19, 10, 22, 20, 11, 7, 5, 16
Answer format: {"numbers": [x_1, ..., x_8]}
Write your final answer as JSON to `/workdir/answer.jso... | {"n": 8, "sums": [9, 15, 17, 7, 18, 8, 20, 23, 10, 8, 17, 21, 5, 9, 3, 13, 4, 6, 18, 30, 19, 10, 22, 20, 11, 7, 5, 16], "family": "rlve_pairwise_sums_recovery", "subset": "construct"} | null | null | null | {"numbers": [1, 2, 3, 4, 6, 7, 14, 16]} | 1 |
construct-rlve-pairwise-sums-recovery-l3-s1 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 3 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 8 distinct positive integers whose 28 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
6, 29, 16, 18, 19, 21, 10, 22, 3, 16, 13, 24, 10, 15, 17, 28, 17, 11, 27, 23, 23, 5, 12, 14, 22, 9, 15, 17
Answer format: {"numbers": [x_1, ..., x_8]}
Write your final answer as JSON to `/workdir/ans... | {"n": 8, "sums": [6, 29, 16, 18, 19, 21, 10, 22, 3, 16, 13, 24, 10, 15, 17, 28, 17, 11, 27, 23, 23, 5, 12, 14, 22, 9, 15, 17], "family": "rlve_pairwise_sums_recovery", "subset": "construct"} | null | null | null | {"numbers": [1, 2, 4, 8, 9, 13, 14, 15]} | 1 |
construct-rlve-pairwise-sums-recovery-l3-s2 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 3 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 8 distinct positive integers whose 28 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
9, 17, 15, 13, 11, 17, 12, 22, 21, 10, 24, 18, 14, 19, 5, 12, 7, 11, 11, 14, 4, 18, 18, 15, 25, 8, 21, 15
Answer format: {"numbers": [x_1, ..., x_8]}
Write your final answer as JSON to `/workdir/answ... | {"n": 8, "sums": [9, 17, 15, 13, 11, 17, 12, 22, 21, 10, 24, 18, 14, 19, 5, 12, 7, 11, 11, 14, 4, 18, 18, 15, 25, 8, 21, 15], "family": "rlve_pairwise_sums_recovery", "subset": "construct"} | null | null | null | {"numbers": [1, 3, 4, 7, 8, 10, 11, 14]} | 1 |
construct-rlve-pairwise-sums-recovery-l3-s3 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 3 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 8 distinct positive integers whose 28 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
18, 24, 20, 27, 31, 25, 30, 23, 27, 20, 24, 18, 22, 12, 21, 16, 14, 28, 29, 17, 26, 19, 10, 29, 25, 23, 22, 16
Answer format: {"numbers": [x_1, ..., x_8]}
Write your final answer as JSON to `/workdir... | {"n": 8, "sums": [18, 24, 20, 27, 31, 25, 30, 23, 27, 20, 24, 18, 22, 12, 21, 16, 14, 28, 29, 17, 26, 19, 10, 29, 25, 23, 22, 16], "family": "rlve_pairwise_sums_recovery", "subset": "construct"} | null | null | null | {"numbers": [3, 7, 9, 11, 13, 14, 15, 16]} | 1 |
construct-rlve-pairwise-sums-recovery-l3-s4 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 3 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 8 distinct positive integers whose 28 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
16, 11, 15, 27, 12, 16, 21, 7, 12, 4, 16, 10, 10, 13, 11, 24, 19, 17, 18, 20, 13, 15, 22, 9, 23, 19, 5, 8
Answer format: {"numbers": [x_1, ..., x_8]}
Write your final answer as JSON to `/workdir/answ... | {"n": 8, "sums": [16, 11, 15, 27, 12, 16, 21, 7, 12, 4, 16, 10, 10, 13, 11, 24, 19, 17, 18, 20, 13, 15, 22, 9, 23, 19, 5, 8], "family": "rlve_pairwise_sums_recovery", "subset": "construct"} | null | null | null | {"numbers": [1, 3, 4, 7, 8, 9, 12, 15]} | 1 |
construct-rlve-pairwise-sums-recovery-l3-s5 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 3 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 8 distinct positive integers whose 28 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
22, 11, 21, 12, 18, 15, 17, 12, 21, 13, 23, 5, 25, 20, 15, 16, 19, 22, 10, 14, 9, 14, 18, 8, 19, 16, 11, 15
Answer format: {"numbers": [x_1, ..., x_8]}
Write your final answer as JSON to `/workdir/an... | {"n": 8, "sums": [22, 11, 21, 12, 18, 15, 17, 12, 21, 13, 23, 5, 25, 20, 15, 16, 19, 22, 10, 14, 9, 14, 18, 8, 19, 16, 11, 15], "family": "rlve_pairwise_sums_recovery", "subset": "construct"} | null | null | null | {"numbers": [2, 3, 6, 8, 9, 10, 12, 13]} | 1 |
construct-rlve-pairwise-sums-recovery-l3-s6 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 3 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 8 distinct positive integers whose 28 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
20, 25, 31, 25, 19, 14, 28, 12, 18, 13, 27, 29, 27, 30, 22, 15, 26, 16, 29, 24, 21, 7, 17, 23, 27, 17, 28, 26
Answer format: {"numbers": [x_1, ..., x_8]}
Write your final answer as JSON to `/workdir/... | {"n": 8, "sums": [20, 25, 31, 25, 19, 14, 28, 12, 18, 13, 27, 29, 27, 30, 22, 15, 26, 16, 29, 24, 21, 7, 17, 23, 27, 17, 28, 26], "family": "rlve_pairwise_sums_recovery", "subset": "construct"} | null | null | null | {"numbers": [1, 6, 11, 12, 13, 14, 15, 16]} | 1 |
construct-rlve-pairwise-sums-recovery-l3-s7 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 3 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 8 distinct positive integers whose 28 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
10, 22, 22, 17, 17, 31, 20, 19, 21, 30, 13, 26, 7, 15, 26, 28, 14, 19, 27, 25, 18, 29, 24, 19, 11, 23, 18, 16
Answer format: {"numbers": [x_1, ..., x_8]}
Write your final answer as JSON to `/workdir/... | {"n": 8, "sums": [10, 22, 22, 17, 17, 31, 20, 19, 21, 30, 13, 26, 7, 15, 26, 28, 14, 19, 27, 25, 18, 29, 24, 19, 11, 23, 18, 16], "family": "rlve_pairwise_sums_recovery", "subset": "construct"} | null | null | null | {"numbers": [3, 4, 7, 10, 12, 14, 15, 16]} | 1 |
construct-rlve-pairwise-sums-recovery-l3-s8 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 3 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 8 distinct positive integers whose 28 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
21, 22, 11, 12, 5, 13, 23, 23, 9, 24, 6, 16, 12, 14, 11, 9, 10, 13, 15, 17, 7, 8, 20, 20, 19, 31, 21, 22
Answer format: {"numbers": [x_1, ..., x_8]}
Write your final answer as JSON to `/workdir/answe... | {"n": 8, "sums": [21, 22, 11, 12, 5, 13, 23, 23, 9, 24, 6, 16, 12, 14, 11, 9, 10, 13, 15, 17, 7, 8, 20, 20, 19, 31, 21, 22], "family": "rlve_pairwise_sums_recovery", "subset": "construct"} | null | null | null | {"numbers": [1, 4, 5, 6, 7, 8, 15, 16]} | 1 |
construct-rlve-pairwise-sums-recovery-l3-s9 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 3 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 8 distinct positive integers whose 28 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
18, 19, 25, 29, 21, 14, 25, 22, 11, 27, 21, 30, 28, 13, 23, 18, 19, 20, 16, 26, 22, 21, 15, 23, 12, 19, 17, 20
Answer format: {"numbers": [x_1, ..., x_8]}
Write your final answer as JSON to `/workdir... | {"n": 8, "sums": [18, 19, 25, 29, 21, 14, 25, 22, 11, 27, 21, 30, 28, 13, 23, 18, 19, 20, 16, 26, 22, 21, 15, 23, 12, 19, 17, 20], "family": "rlve_pairwise_sums_recovery", "subset": "construct"} | null | null | null | {"numbers": [5, 6, 7, 9, 12, 13, 14, 16]} | 1 |
construct-rlve-pairwise-sums-recovery-l4-s0 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 4 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 12 distinct positive integers whose 66 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
33, 32, 32, 43, 15, 22, 29, 16, 27, 37, 7, 38, 30, 23, 11, 28, 40, 36, 34, 26, 37, 20, 23, 24, 23, 31, 20, 40, 19, 31, 24, 6, 28, 44, 11, 38, 15, 19, 41, 35, 27, 43, 21, 28, 42, 21, 26, 39, 39, 33, 32... | {"n": 12, "sums": [33, 32, 32, 43, 15, 22, 29, 16, 27, 37, 7, 38, 30, 23, 11, 28, 40, 36, 34, 26, 37, 20, 23, 24, 23, 31, 20, 40, 19, 31, 24, 6, 28, 44, 11, 38, 15, 19, 41, 35, 27, 43, 21, 28, 42, 21, 26, 39, 39, 33, 32, 35, 36, 27, 37, 35, 24, 45, 22, 29, 16, 25, 18, 25, 41, 38], "family": "rlve_pairwise_sums_recovery... | null | null | null | {"numbers": [1, 5, 6, 10, 14, 15, 17, 18, 20, 21, 22, 23]} | 1 |
construct-rlve-pairwise-sums-recovery-l4-s1 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 4 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 12 distinct positive integers whose 66 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
31, 27, 38, 26, 34, 34, 36, 28, 35, 19, 21, 43, 40, 7, 34, 20, 30, 38, 35, 41, 25, 42, 33, 21, 28, 18, 23, 18, 23, 9, 20, 44, 40, 32, 27, 29, 16, 27, 20, 22, 31, 33, 29, 24, 32, 29, 15, 29, 26, 35, 27... | {"n": 12, "sums": [31, 27, 38, 26, 34, 34, 36, 28, 35, 19, 21, 43, 40, 7, 34, 20, 30, 38, 35, 41, 25, 42, 33, 21, 28, 18, 23, 18, 23, 9, 20, 44, 40, 32, 27, 29, 16, 27, 20, 22, 31, 33, 29, 24, 32, 29, 15, 29, 26, 35, 27, 13, 25, 33, 37, 37, 36, 31, 22, 21, 32, 14, 25, 39, 36, 14], "family": "rlve_pairwise_sums_recovery... | null | null | null | {"numbers": [1, 6, 8, 12, 13, 14, 15, 17, 19, 20, 21, 23]} | 1 |
construct-rlve-pairwise-sums-recovery-l4-s2 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 4 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 12 distinct positive integers whose 66 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
37, 5, 27, 21, 39, 28, 29, 24, 32, 25, 21, 12, 27, 19, 40, 45, 8, 24, 16, 39, 14, 36, 33, 22, 37, 22, 18, 19, 7, 35, 9, 31, 34, 17, 16, 42, 24, 23, 6, 17, 34, 14, 32, 43, 34, 25, 16, 20, 19, 23, 18, 2... | {"n": 12, "sums": [37, 5, 27, 21, 39, 28, 29, 24, 32, 25, 21, 12, 27, 19, 40, 45, 8, 24, 16, 39, 14, 36, 33, 22, 37, 22, 18, 19, 7, 35, 9, 31, 34, 17, 16, 42, 24, 23, 6, 17, 34, 14, 32, 43, 34, 25, 16, 20, 19, 23, 18, 20, 28, 40, 29, 37, 31, 26, 4, 30, 15, 35, 26, 20, 22, 29], "family": "rlve_pairwise_sums_recovery", "... | null | null | null | {"numbers": [1, 3, 4, 5, 11, 13, 15, 16, 18, 19, 21, 24]} | 1 |
construct-rlve-pairwise-sums-recovery-l4-s3 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 4 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 12 distinct positive integers whose 66 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
11, 28, 25, 36, 21, 15, 17, 31, 31, 22, 16, 23, 12, 28, 21, 22, 24, 9, 31, 27, 19, 18, 23, 13, 26, 34, 25, 17, 20, 22, 21, 17, 25, 26, 24, 36, 32, 15, 29, 18, 24, 18, 19, 37, 33, 10, 15, 23, 29, 39, 2... | {"n": 12, "sums": [11, 28, 25, 36, 21, 15, 17, 31, 31, 22, 16, 23, 12, 28, 21, 22, 24, 9, 31, 27, 19, 18, 23, 13, 26, 34, 25, 17, 20, 22, 21, 17, 25, 26, 24, 36, 32, 15, 29, 18, 24, 18, 19, 37, 33, 10, 15, 23, 29, 39, 22, 34, 27, 30, 13, 41, 32, 26, 29, 27, 20, 16, 14, 25, 20, 29], "family": "rlve_pairwise_sums_recover... | null | null | null | {"numbers": [3, 6, 7, 8, 9, 10, 12, 14, 15, 17, 19, 22]} | 1 |
construct-rlve-pairwise-sums-recovery-l4-s4 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 4 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 12 distinct positive integers whose 66 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
46, 38, 27, 10, 17, 25, 47, 14, 22, 33, 35, 16, 17, 21, 28, 6, 23, 28, 45, 33, 23, 21, 14, 36, 31, 20, 26, 4, 13, 25, 16, 27, 21, 39, 34, 29, 35, 35, 37, 32, 19, 23, 13, 36, 19, 15, 34, 25, 12, 33, 40... | {"n": 12, "sums": [46, 38, 27, 10, 17, 25, 47, 14, 22, 33, 35, 16, 17, 21, 28, 6, 23, 28, 45, 33, 23, 21, 14, 36, 31, 20, 26, 4, 13, 25, 16, 27, 21, 39, 34, 29, 35, 35, 37, 32, 19, 23, 13, 36, 19, 15, 34, 25, 12, 33, 40, 15, 27, 26, 22, 11, 32, 25, 29, 18, 12, 34, 24, 8, 14, 24], "family": "rlve_pairwise_sums_recovery"... | null | null | null | {"numbers": [1, 3, 5, 9, 10, 11, 12, 13, 16, 22, 23, 24]} | 1 |
construct-rlve-pairwise-sums-recovery-l4-s5 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 4 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 12 distinct positive integers whose 66 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
23, 28, 16, 35, 28, 24, 23, 11, 41, 26, 19, 11, 24, 21, 22, 15, 38, 32, 27, 22, 14, 26, 40, 24, 33, 11, 25, 25, 26, 39, 21, 10, 12, 23, 20, 20, 30, 23, 24, 6, 13, 13, 18, 36, 25, 9, 31, 20, 21, 31, 9,... | {"n": 12, "sums": [23, 28, 16, 35, 28, 24, 23, 11, 41, 26, 19, 11, 24, 21, 22, 15, 38, 32, 27, 22, 14, 26, 40, 24, 33, 11, 25, 25, 26, 39, 21, 10, 12, 23, 20, 20, 30, 23, 24, 6, 13, 13, 18, 36, 25, 9, 31, 20, 21, 31, 9, 19, 27, 35, 16, 7, 34, 21, 33, 29, 22, 8, 23, 36, 37, 18], "family": "rlve_pairwise_sums_recovery", ... | null | null | null | {"numbers": [2, 4, 5, 6, 7, 9, 14, 16, 17, 18, 19, 22]} | 1 |
construct-rlve-pairwise-sums-recovery-l4-s6 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 4 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 12 distinct positive integers whose 66 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
20, 26, 34, 39, 6, 31, 15, 24, 21, 32, 18, 24, 9, 25, 22, 13, 36, 32, 17, 25, 32, 23, 34, 36, 30, 19, 25, 44, 16, 28, 15, 21, 29, 27, 26, 34, 34, 27, 28, 43, 26, 31, 42, 33, 35, 13, 28, 24, 38, 19, 33... | {"n": 12, "sums": [20, 26, 34, 39, 6, 31, 15, 24, 21, 32, 18, 24, 9, 25, 22, 13, 36, 32, 17, 25, 32, 23, 34, 36, 30, 19, 25, 44, 16, 28, 15, 21, 29, 27, 26, 34, 34, 27, 28, 43, 26, 31, 42, 33, 35, 13, 28, 24, 38, 19, 33, 11, 37, 35, 29, 38, 40, 22, 20, 23, 20, 39, 30, 29, 17, 30], "family": "rlve_pairwise_sums_recovery... | null | null | null | {"numbers": [1, 5, 8, 10, 12, 14, 15, 16, 18, 19, 20, 24]} | 1 |
construct-rlve-pairwise-sums-recovery-l4-s7 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 4 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 12 distinct positive integers whose 66 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
28, 31, 27, 25, 6, 9, 42, 26, 15, 31, 28, 18, 19, 23, 11, 5, 14, 26, 21, 15, 24, 35, 17, 16, 22, 40, 36, 10, 6, 4, 30, 20, 41, 9, 36, 24, 21, 32, 25, 16, 19, 14, 29, 7, 30, 5, 7, 29, 8, 17, 26, 20, 47... | {"n": 12, "sums": [28, 31, 27, 25, 6, 9, 42, 26, 15, 31, 28, 18, 19, 23, 11, 5, 14, 26, 21, 15, 24, 35, 17, 16, 22, 40, 36, 10, 6, 4, 30, 20, 41, 9, 36, 24, 21, 32, 25, 16, 19, 14, 29, 7, 30, 5, 7, 29, 8, 17, 26, 20, 47, 12, 20, 43, 24, 18, 22, 25, 27, 8, 37, 36, 13, 3], "family": "rlve_pairwise_sums_recovery", "subset... | null | null | null | {"numbers": [1, 2, 3, 4, 5, 7, 12, 13, 17, 19, 23, 24]} | 1 |
construct-rlve-pairwise-sums-recovery-l4-s8 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 4 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 12 distinct positive integers whose 66 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
38, 33, 32, 26, 27, 13, 19, 21, 29, 34, 43, 19, 25, 25, 25, 26, 27, 34, 20, 32, 39, 41, 20, 29, 26, 26, 17, 45, 24, 15, 21, 13, 30, 20, 33, 21, 35, 18, 28, 12, 46, 40, 39, 40, 24, 31, 31, 25, 32, 28, ... | {"n": 12, "sums": [38, 33, 32, 26, 27, 13, 19, 21, 29, 34, 43, 19, 25, 25, 25, 26, 27, 34, 20, 32, 39, 41, 20, 29, 26, 26, 17, 45, 24, 15, 21, 13, 30, 20, 33, 21, 35, 18, 28, 12, 46, 40, 39, 40, 24, 31, 31, 25, 32, 28, 19, 22, 12, 11, 27, 33, 28, 37, 42, 38, 27, 30, 14, 35, 7, 14], "family": "rlve_pairwise_sums_recover... | null | null | null | {"numbers": [3, 4, 8, 9, 10, 11, 16, 17, 18, 21, 22, 24]} | 1 |
construct-rlve-pairwise-sums-recovery-l4-s9 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 4 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 12 distinct positive integers whose 66 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
19, 24, 30, 28, 22, 20, 9, 22, 23, 31, 14, 25, 15, 37, 17, 24, 12, 16, 12, 32, 35, 21, 26, 23, 41, 38, 27, 29, 45, 39, 24, 16, 30, 31, 22, 7, 33, 44, 25, 8, 17, 27, 12, 11, 36, 29, 13, 41, 26, 20, 10,... | {"n": 12, "sums": [19, 24, 30, 28, 22, 20, 9, 22, 23, 31, 14, 25, 15, 37, 17, 24, 12, 16, 12, 32, 35, 21, 26, 23, 41, 38, 27, 29, 45, 39, 24, 16, 30, 31, 22, 7, 33, 44, 25, 8, 17, 27, 12, 11, 36, 29, 13, 41, 26, 20, 10, 23, 38, 19, 17, 26, 34, 24, 5, 18, 35, 27, 34, 29, 19, 31], "family": "rlve_pairwise_sums_recovery",... | null | null | null | {"numbers": [2, 3, 5, 7, 9, 10, 14, 15, 17, 20, 21, 24]} | 1 |
construct-rlve-pairwise-sums-recovery-l5-s0 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 5 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 18 distinct positive integers whose 153 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
28, 56, 52, 40, 59, 53, 26, 35, 60, 58, 45, 57, 39, 30, 12, 30, 31, 50, 47, 27, 20, 33, 35, 37, 54, 62, 42, 53, 38, 26, 32, 38, 19, 31, 14, 16, 41, 52, 45, 46, 48, 4, 51, 18, 46, 21, 59, 53, 39, 44, ... | {"n": 18, "sums": [28, 56, 52, 40, 59, 53, 26, 35, 60, 58, 45, 57, 39, 30, 12, 30, 31, 50, 47, 27, 20, 33, 35, 37, 54, 62, 42, 53, 38, 26, 32, 38, 19, 31, 14, 16, 41, 52, 45, 46, 48, 4, 51, 18, 46, 21, 59, 53, 39, 44, 46, 66, 49, 50, 50, 64, 46, 59, 58, 34, 42, 23, 52, 43, 22, 67, 11, 35, 28, 21, 45, 49, 40, 43, 48, 34... | null | null | null | {"numbers": [1, 3, 9, 10, 13, 17, 18, 20, 21, 22, 24, 25, 28, 29, 30, 32, 34, 35]} | 1 |
construct-rlve-pairwise-sums-recovery-l5-s1 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 5 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 18 distinct positive integers whose 153 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
41, 51, 32, 57, 35, 31, 7, 26, 9, 32, 56, 46, 45, 69, 38, 41, 17, 30, 42, 33, 42, 39, 40, 47, 3, 57, 6, 49, 26, 71, 25, 40, 23, 11, 25, 29, 38, 44, 61, 64, 60, 33, 34, 49, 54, 48, 58, 41, 29, 49, 51,... | {"n": 18, "sums": [41, 51, 32, 57, 35, 31, 7, 26, 9, 32, 56, 46, 45, 69, 38, 41, 17, 30, 42, 33, 42, 39, 40, 47, 3, 57, 6, 49, 26, 71, 25, 40, 23, 11, 25, 29, 38, 44, 61, 64, 60, 33, 34, 49, 54, 48, 58, 41, 29, 49, 51, 58, 23, 56, 47, 6, 52, 55, 27, 24, 37, 66, 16, 22, 52, 10, 28, 32, 37, 26, 35, 56, 34, 30, 20, 34, 65... | null | null | null | {"numbers": [1, 2, 4, 5, 7, 8, 15, 17, 21, 22, 24, 25, 30, 32, 33, 34, 35, 36]} | 1 |
construct-rlve-pairwise-sums-recovery-l5-s2 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 5 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 18 distinct positive integers whose 153 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
35, 32, 59, 28, 37, 46, 30, 57, 36, 23, 23, 34, 11, 25, 29, 46, 68, 60, 64, 30, 34, 65, 28, 38, 20, 13, 14, 7, 18, 11, 34, 42, 33, 50, 9, 14, 43, 16, 33, 31, 42, 3, 62, 49, 43, 40, 32, 8, 51, 56, 7, ... | {"n": 18, "sums": [35, 32, 59, 28, 37, 46, 30, 57, 36, 23, 23, 34, 11, 25, 29, 46, 68, 60, 64, 30, 34, 65, 28, 38, 20, 13, 14, 7, 18, 11, 34, 42, 33, 50, 9, 14, 43, 16, 33, 31, 42, 3, 62, 49, 43, 40, 32, 8, 51, 56, 7, 24, 40, 43, 29, 38, 37, 9, 10, 18, 27, 53, 29, 45, 8, 50, 53, 30, 37, 55, 52, 35, 22, 47, 39, 14, 54, ... | null | null | null | {"numbers": [1, 2, 5, 6, 7, 8, 9, 10, 13, 21, 22, 24, 25, 28, 29, 30, 33, 35]} | 1 |
construct-rlve-pairwise-sums-recovery-l5-s3 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 5 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 18 distinct positive integers whose 153 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
31, 40, 40, 22, 26, 27, 26, 19, 44, 39, 43, 11, 29, 34, 14, 5, 21, 32, 27, 41, 38, 16, 35, 51, 41, 48, 39, 37, 53, 36, 25, 35, 52, 55, 25, 21, 30, 45, 36, 18, 33, 39, 54, 41, 23, 9, 41, 57, 36, 27, 3... | {"n": 18, "sums": [31, 40, 40, 22, 26, 27, 26, 19, 44, 39, 43, 11, 29, 34, 14, 5, 21, 32, 27, 41, 38, 16, 35, 51, 41, 48, 39, 37, 53, 36, 25, 35, 52, 55, 25, 21, 30, 45, 36, 18, 33, 39, 54, 41, 23, 9, 41, 57, 36, 27, 34, 46, 54, 29, 38, 44, 43, 13, 30, 51, 41, 50, 32, 43, 34, 43, 37, 45, 56, 17, 20, 37, 40, 50, 34, 33,... | null | null | null | {"numbers": [1, 4, 5, 10, 12, 13, 14, 17, 19, 20, 21, 24, 25, 26, 27, 29, 30, 31]} | 1 |
construct-rlve-pairwise-sums-recovery-l5-s4 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 5 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 18 distinct positive integers whose 153 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
44, 39, 27, 40, 32, 59, 39, 38, 48, 55, 48, 54, 37, 28, 49, 46, 40, 35, 42, 49, 51, 44, 28, 56, 23, 52, 47, 46, 25, 49, 49, 51, 40, 49, 33, 36, 58, 51, 36, 46, 31, 43, 47, 58, 56, 60, 35, 43, 41, 43,... | {"n": 18, "sums": [44, 39, 27, 40, 32, 59, 39, 38, 48, 55, 48, 54, 37, 28, 49, 46, 40, 35, 42, 49, 51, 44, 28, 56, 23, 52, 47, 46, 25, 49, 49, 51, 40, 49, 33, 36, 58, 51, 36, 46, 31, 43, 47, 58, 56, 60, 35, 43, 41, 43, 27, 37, 38, 35, 30, 43, 29, 40, 44, 30, 49, 48, 47, 24, 44, 46, 46, 34, 24, 44, 51, 45, 53, 48, 32, 4... | null | null | null | {"numbers": [5, 10, 11, 14, 17, 18, 19, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 32]} | 1 |
construct-rlve-pairwise-sums-recovery-l5-s5 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 5 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 18 distinct positive integers whose 153 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
43, 37, 50, 33, 23, 33, 50, 51, 32, 13, 16, 41, 54, 39, 32, 30, 35, 18, 19, 14, 27, 47, 20, 44, 7, 21, 42, 47, 45, 24, 63, 49, 61, 17, 36, 61, 22, 31, 36, 38, 42, 34, 53, 35, 32, 57, 47, 15, 12, 46, ... | {"n": 18, "sums": [43, 37, 50, 33, 23, 33, 50, 51, 32, 13, 16, 41, 54, 39, 32, 30, 35, 18, 19, 14, 27, 47, 20, 44, 7, 21, 42, 47, 45, 24, 63, 49, 61, 17, 36, 61, 22, 31, 36, 38, 42, 34, 53, 35, 32, 57, 47, 15, 12, 46, 41, 53, 41, 17, 21, 22, 31, 67, 56, 48, 37, 46, 26, 38, 49, 48, 51, 35, 32, 4, 38, 24, 29, 49, 26, 28,... | null | null | null | {"numbers": [1, 2, 3, 6, 11, 12, 13, 14, 15, 18, 20, 21, 25, 29, 31, 32, 35, 36]} | 1 |
construct-rlve-pairwise-sums-recovery-l5-s6 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 5 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 18 distinct positive integers whose 153 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
29, 8, 43, 34, 29, 52, 35, 26, 21, 52, 20, 15, 18, 49, 48, 47, 37, 58, 22, 21, 15, 14, 7, 45, 41, 42, 41, 31, 48, 58, 68, 40, 38, 59, 5, 30, 71, 14, 13, 18, 7, 30, 62, 47, 41, 54, 21, 48, 55, 42, 38,... | {"n": 18, "sums": [29, 8, 43, 34, 29, 52, 35, 26, 21, 52, 20, 15, 18, 49, 48, 47, 37, 58, 22, 21, 15, 14, 7, 45, 41, 42, 41, 31, 48, 58, 68, 40, 38, 59, 5, 30, 71, 14, 13, 18, 7, 30, 62, 47, 41, 54, 21, 48, 55, 42, 38, 37, 42, 15, 57, 65, 25, 17, 11, 43, 19, 14, 51, 23, 45, 36, 40, 36, 38, 31, 17, 39, 36, 37, 61, 68, 2... | null | null | null | {"numbers": [2, 3, 4, 5, 8, 9, 10, 12, 13, 16, 20, 22, 26, 27, 32, 33, 35, 36]} | 1 |
construct-rlve-pairwise-sums-recovery-l5-s7 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 5 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 18 distinct positive integers whose 153 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
27, 36, 8, 14, 17, 32, 56, 52, 64, 10, 47, 25, 26, 24, 40, 45, 15, 5, 21, 33, 47, 56, 26, 37, 45, 35, 39, 33, 39, 33, 13, 49, 47, 9, 22, 50, 36, 61, 22, 44, 37, 11, 50, 54, 35, 36, 58, 29, 55, 35, 66... | {"n": 18, "sums": [27, 36, 8, 14, 17, 32, 56, 52, 64, 10, 47, 25, 26, 24, 40, 45, 15, 5, 21, 33, 47, 56, 26, 37, 45, 35, 39, 33, 39, 33, 13, 49, 47, 9, 22, 50, 36, 61, 22, 44, 37, 11, 50, 54, 35, 36, 58, 29, 55, 35, 66, 41, 37, 27, 37, 54, 46, 30, 52, 17, 20, 54, 36, 35, 45, 16, 52, 27, 31, 59, 68, 38, 43, 15, 28, 16, ... | null | null | null | {"numbers": [1, 2, 3, 4, 7, 12, 13, 14, 17, 19, 21, 22, 23, 24, 26, 31, 33, 35]} | 1 |
construct-rlve-pairwise-sums-recovery-l5-s8 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 5 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 18 distinct positive integers whose 153 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
37, 21, 15, 22, 12, 38, 32, 30, 33, 40, 61, 53, 50, 41, 25, 33, 35, 60, 23, 37, 43, 17, 63, 32, 42, 43, 28, 60, 39, 45, 10, 42, 48, 14, 45, 34, 28, 21, 48, 20, 44, 31, 65, 23, 47, 26, 54, 9, 16, 5, 4... | {"n": 18, "sums": [37, 21, 15, 22, 12, 38, 32, 30, 33, 40, 61, 53, 50, 41, 25, 33, 35, 60, 23, 37, 43, 17, 63, 32, 42, 43, 28, 60, 39, 45, 10, 42, 48, 14, 45, 34, 28, 21, 48, 20, 44, 31, 65, 23, 47, 26, 54, 9, 16, 5, 43, 47, 24, 47, 41, 49, 32, 64, 33, 29, 36, 23, 41, 61, 11, 46, 44, 46, 11, 30, 36, 58, 35, 59, 18, 69,... | null | null | null | {"numbers": [2, 3, 6, 8, 9, 10, 13, 15, 17, 20, 25, 26, 27, 28, 30, 33, 34, 35]} | 1 |
construct-rlve-pairwise-sums-recovery-l5-s9 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 5 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 18 distinct positive integers whose 153 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
32, 19, 51, 32, 43, 30, 42, 28, 49, 21, 47, 53, 43, 49, 47, 31, 22, 41, 49, 15, 19, 22, 47, 65, 55, 39, 29, 28, 59, 50, 35, 60, 15, 48, 62, 14, 48, 25, 13, 44, 66, 31, 31, 42, 64, 45, 64, 36, 34, 35,... | {"n": 18, "sums": [32, 19, 51, 32, 43, 30, 42, 28, 49, 21, 47, 53, 43, 49, 47, 31, 22, 41, 49, 15, 19, 22, 47, 65, 55, 39, 29, 28, 59, 50, 35, 60, 15, 48, 62, 14, 48, 25, 13, 44, 66, 31, 31, 42, 64, 45, 64, 36, 34, 35, 29, 57, 30, 41, 37, 38, 32, 25, 41, 51, 18, 52, 9, 36, 48, 26, 25, 26, 38, 63, 59, 58, 20, 29, 40, 44... | null | null | null | {"numbers": [1, 2, 6, 8, 11, 13, 14, 17, 20, 21, 23, 24, 27, 28, 29, 30, 34, 36]} | 1 |
construct-rlve-pairwise-sums-recovery-l6-s0 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 6 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 26 distinct positive integers whose 325 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
50, 81, 80, 38, 36, 68, 63, 64, 47, 61, 61, 31, 71, 36, 48, 64, 101, 48, 31, 77, 64, 74, 56, 69, 38, 10, 44, 78, 93, 74, 73, 44, 42, 60, 50, 43, 79, 54, 85, 86, 50, 39, 26, 83, 31, 24, 75, 51, 68, 38... | {"n": 26, "sums": [50, 81, 80, 38, 36, 68, 63, 64, 47, 61, 61, 31, 71, 36, 48, 64, 101, 48, 31, 77, 64, 74, 56, 69, 38, 10, 44, 78, 93, 74, 73, 44, 42, 60, 50, 43, 79, 54, 85, 86, 50, 39, 26, 83, 31, 24, 75, 51, 68, 38, 72, 65, 33, 48, 51, 32, 53, 65, 68, 40, 68, 79, 49, 76, 45, 47, 53, 71, 70, 71, 23, 51, 11, 78, 75, ... | null | null | null | {"numbers": [1, 5, 6, 9, 15, 16, 18, 19, 21, 22, 25, 27, 29, 30, 31, 32, 34, 35, 37, 39, 41, 44, 45, 46, 49, 52]} | 1 |
construct-rlve-pairwise-sums-recovery-l6-s1 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 6 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 26 distinct positive integers whose 325 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
77, 94, 70, 54, 73, 7, 62, 45, 24, 43, 70, 22, 31, 66, 90, 23, 88, 75, 103, 27, 49, 78, 7, 74, 41, 50, 25, 76, 63, 55, 56, 63, 62, 9, 67, 78, 26, 48, 45, 46, 69, 51, 40, 96, 81, 92, 46, 52, 41, 28, 1... | {"n": 26, "sums": [77, 94, 70, 54, 73, 7, 62, 45, 24, 43, 70, 22, 31, 66, 90, 23, 88, 75, 103, 27, 49, 78, 7, 74, 41, 50, 25, 76, 63, 55, 56, 63, 62, 9, 67, 78, 26, 48, 45, 46, 69, 51, 40, 96, 81, 92, 46, 52, 41, 28, 11, 25, 17, 71, 100, 37, 72, 49, 15, 46, 71, 41, 30, 68, 38, 88, 64, 73, 60, 44, 47, 57, 34, 80, 34, 51... | null | null | null | {"numbers": [2, 3, 4, 5, 6, 11, 12, 19, 20, 21, 22, 24, 26, 27, 28, 29, 38, 40, 41, 42, 45, 46, 49, 50, 51, 52]} | 1 |
construct-rlve-pairwise-sums-recovery-l6-s2 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 6 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 26 distinct positive integers whose 325 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
18, 77, 60, 94, 64, 61, 58, 39, 61, 39, 69, 27, 60, 46, 58, 18, 39, 45, 63, 26, 47, 57, 87, 59, 43, 25, 64, 62, 34, 55, 30, 14, 33, 29, 32, 31, 39, 65, 61, 44, 6, 21, 73, 71, 13, 60, 81, 32, 39, 54, ... | {"n": 26, "sums": [18, 77, 60, 94, 64, 61, 58, 39, 61, 39, 69, 27, 60, 46, 58, 18, 39, 45, 63, 26, 47, 57, 87, 59, 43, 25, 64, 62, 34, 55, 30, 14, 33, 29, 32, 31, 39, 65, 61, 44, 6, 21, 73, 71, 13, 60, 81, 32, 39, 54, 48, 23, 46, 48, 47, 85, 12, 45, 14, 61, 43, 53, 75, 54, 13, 36, 24, 79, 34, 68, 36, 62, 80, 59, 50, 29... | null | null | null | {"numbers": [1, 2, 3, 4, 8, 9, 11, 12, 13, 14, 15, 17, 22, 24, 26, 27, 30, 32, 33, 35, 38, 42, 45, 47, 48, 49]} | 1 |
construct-rlve-pairwise-sums-recovery-l6-s3 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 6 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 26 distinct positive integers whose 325 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
15, 56, 38, 71, 26, 53, 53, 59, 57, 65, 51, 58, 20, 74, 23, 52, 70, 52, 40, 58, 17, 34, 26, 54, 81, 71, 52, 43, 54, 44, 47, 72, 94, 80, 29, 28, 47, 51, 25, 83, 61, 53, 40, 92, 44, 65, 68, 75, 49, 85,... | {"n": 26, "sums": [15, 56, 38, 71, 26, 53, 53, 59, 57, 65, 51, 58, 20, 74, 23, 52, 70, 52, 40, 58, 17, 34, 26, 54, 81, 71, 52, 43, 54, 44, 47, 72, 94, 80, 29, 28, 47, 51, 25, 83, 61, 53, 40, 92, 44, 65, 68, 75, 49, 85, 28, 50, 64, 65, 35, 32, 18, 68, 52, 35, 52, 61, 34, 23, 23, 30, 62, 29, 33, 96, 59, 65, 81, 62, 69, 8... | null | null | null | {"numbers": [2, 4, 5, 6, 11, 12, 13, 15, 16, 18, 21, 22, 23, 24, 28, 31, 34, 37, 39, 40, 41, 42, 44, 47, 50, 52]} | 1 |
construct-rlve-pairwise-sums-recovery-l6-s4 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 6 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 26 distinct positive integers whose 325 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
74, 42, 64, 81, 53, 60, 17, 77, 21, 27, 80, 43, 96, 79, 39, 90, 42, 44, 38, 38, 95, 57, 70, 76, 45, 64, 74, 48, 64, 50, 39, 79, 99, 62, 64, 14, 41, 58, 54, 84, 48, 35, 41, 74, 81, 62, 72, 75, 46, 81,... | {"n": 26, "sums": [74, 42, 64, 81, 53, 60, 17, 77, 21, 27, 80, 43, 96, 79, 39, 90, 42, 44, 38, 38, 95, 57, 70, 76, 45, 64, 74, 48, 64, 50, 39, 79, 99, 62, 64, 14, 41, 58, 54, 84, 48, 35, 41, 74, 81, 62, 72, 75, 46, 81, 66, 80, 75, 27, 82, 45, 65, 79, 85, 26, 45, 46, 65, 55, 62, 88, 69, 88, 75, 83, 42, 84, 58, 82, 54, 5... | null | null | null | {"numbers": [3, 10, 11, 12, 13, 14, 15, 24, 27, 28, 29, 30, 32, 33, 34, 36, 37, 38, 42, 43, 46, 47, 49, 50, 51, 52]} | 1 |
construct-rlve-pairwise-sums-recovery-l6-s5 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 6 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 26 distinct positive integers whose 325 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
8, 52, 30, 51, 30, 39, 43, 46, 59, 83, 38, 86, 66, 56, 47, 74, 63, 41, 77, 36, 39, 43, 36, 53, 27, 40, 48, 46, 59, 46, 68, 59, 36, 53, 52, 38, 49, 75, 55, 56, 58, 47, 61, 29, 46, 50, 43, 65, 60, 41, ... | {"n": 26, "sums": [8, 52, 30, 51, 30, 39, 43, 46, 59, 83, 38, 86, 66, 56, 47, 74, 63, 41, 77, 36, 39, 43, 36, 53, 27, 40, 48, 46, 59, 46, 68, 59, 36, 53, 52, 38, 49, 75, 55, 56, 58, 47, 61, 29, 46, 50, 43, 65, 60, 41, 62, 54, 56, 60, 37, 31, 18, 35, 34, 41, 36, 49, 43, 69, 49, 68, 87, 28, 64, 81, 46, 76, 67, 51, 71, 61... | null | null | null | {"numbers": [1, 3, 5, 6, 10, 11, 13, 14, 15, 20, 21, 23, 24, 25, 26, 28, 30, 32, 33, 35, 36, 39, 40, 43, 46, 51]} | 1 |
construct-rlve-pairwise-sums-recovery-l6-s6 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 6 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 26 distinct positive integers whose 325 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
41, 74, 71, 43, 36, 71, 77, 67, 31, 47, 37, 60, 22, 36, 71, 42, 79, 44, 59, 64, 95, 59, 45, 42, 67, 37, 58, 65, 76, 50, 54, 45, 85, 63, 27, 33, 35, 65, 63, 63, 74, 48, 80, 40, 56, 33, 51, 62, 62, 41,... | {"n": 26, "sums": [41, 74, 71, 43, 36, 71, 77, 67, 31, 47, 37, 60, 22, 36, 71, 42, 79, 44, 59, 64, 95, 59, 45, 42, 67, 37, 58, 65, 76, 50, 54, 45, 85, 63, 27, 33, 35, 65, 63, 63, 74, 48, 80, 40, 56, 33, 51, 62, 62, 41, 26, 37, 61, 23, 44, 41, 16, 45, 92, 78, 58, 88, 38, 43, 59, 55, 49, 44, 44, 28, 73, 83, 45, 33, 68, 6... | null | null | null | {"numbers": [3, 5, 9, 13, 14, 15, 17, 18, 19, 20, 22, 23, 24, 26, 27, 30, 31, 32, 33, 36, 38, 41, 42, 45, 47, 50]} | 1 |
construct-rlve-pairwise-sums-recovery-l6-s7 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 6 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 26 distinct positive integers whose 325 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
45, 9, 70, 57, 46, 74, 44, 37, 78, 49, 48, 15, 49, 52, 75, 58, 34, 64, 14, 31, 59, 37, 43, 13, 35, 54, 47, 73, 70, 31, 69, 56, 66, 58, 44, 44, 22, 62, 43, 41, 25, 48, 21, 43, 39, 71, 37, 60, 8, 87, 6... | {"n": 26, "sums": [45, 9, 70, 57, 46, 74, 44, 37, 78, 49, 48, 15, 49, 52, 75, 58, 34, 64, 14, 31, 59, 37, 43, 13, 35, 54, 47, 73, 70, 31, 69, 56, 66, 58, 44, 44, 22, 62, 43, 41, 25, 48, 21, 43, 39, 71, 37, 60, 8, 87, 60, 44, 44, 8, 59, 32, 36, 48, 22, 75, 35, 35, 38, 32, 34, 67, 46, 18, 33, 4, 62, 10, 59, 54, 19, 94, 6... | null | null | null | {"numbers": [1, 2, 3, 5, 6, 7, 8, 10, 13, 14, 18, 19, 21, 24, 25, 28, 30, 31, 32, 35, 39, 41, 43, 45, 46, 48]} | 1 |
construct-rlve-pairwise-sums-recovery-l6-s8 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 6 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 26 distinct positive integers whose 325 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
65, 48, 99, 85, 73, 31, 69, 94, 39, 46, 40, 57, 79, 63, 56, 79, 44, 60, 14, 51, 78, 39, 68, 59, 36, 77, 56, 53, 83, 57, 66, 57, 17, 41, 57, 34, 42, 21, 50, 71, 86, 39, 77, 44, 45, 68, 71, 70, 50, 48,... | {"n": 26, "sums": [65, 48, 99, 85, 73, 31, 69, 94, 39, 46, 40, 57, 79, 63, 56, 79, 44, 60, 14, 51, 78, 39, 68, 59, 36, 77, 56, 53, 83, 57, 66, 57, 17, 41, 57, 34, 42, 21, 50, 71, 86, 39, 77, 44, 45, 68, 71, 70, 50, 48, 91, 20, 51, 79, 55, 78, 34, 43, 100, 9, 28, 42, 47, 82, 62, 82, 61, 71, 33, 59, 84, 51, 41, 69, 59, 6... | null | null | null | {"numbers": [1, 5, 8, 12, 13, 14, 15, 16, 20, 22, 23, 26, 27, 28, 29, 31, 33, 34, 35, 36, 37, 40, 43, 48, 49, 51]} | 1 |
construct-rlve-pairwise-sums-recovery-l6-s9 | construct | rlve_pairwise_sums_recovery | poi_squarks_pairwise_sums | combinatorics | competition | 6 | RLVE-Gym/squ_squarks | MIT | [
"agentic_trivial"
] | Find 26 distinct positive integers whose 325 pairwise sums (over all unordered pairs), taken as a multiset, are exactly:
47, 46, 34, 60, 78, 51, 19, 50, 58, 27, 48, 28, 18, 42, 19, 27, 16, 9, 54, 10, 66, 35, 50, 64, 15, 41, 19, 18, 57, 62, 54, 65, 18, 37, 54, 39, 29, 32, 13, 29, 33, 25, 17, 43, 76, 21, 76, 47, 61, 26, ... | {"n": 26, "sums": [47, 46, 34, 60, 78, 51, 19, 50, 58, 27, 48, 28, 18, 42, 19, 27, 16, 9, 54, 10, 66, 35, 50, 64, 15, 41, 19, 18, 57, 62, 54, 65, 18, 37, 54, 39, 29, 32, 13, 29, 33, 25, 17, 43, 76, 21, 76, 47, 61, 26, 56, 81, 24, 39, 20, 47, 57, 45, 63, 24, 61, 49, 15, 24, 58, 36, 49, 31, 45, 37, 63, 16, 63, 21, 40, 34... | null | null | null | {"numbers": [1, 4, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 20, 23, 25, 29, 30, 32, 33, 43, 45, 46, 49, 52]} | 1 |
construct-rlve-pan-solar-panels-l1-s0 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 1 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 5 <= X <= 19 and 23 <= Y <= 47 such that gcd(X, Y) >= 19.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 19.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.js... | {"A": 5, "B": 19, "C": 23, "D": 47, "target": 19, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 19, "Y": 38} | 1 |
construct-rlve-pan-solar-panels-l1-s1 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 1 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 21 <= X <= 37 and 15 <= Y <= 19 such that gcd(X, Y) >= 18.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 18.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"A": 21, "B": 37, "C": 15, "D": 19, "target": 18, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 36, "Y": 18} | 1 |
construct-rlve-pan-solar-panels-l1-s2 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 1 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 27 <= X <= 46 and 1 <= Y <= 20 such that gcd(X, Y) >= 20.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 20.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.js... | {"A": 27, "B": 46, "C": 1, "D": 20, "target": 20, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 40, "Y": 20} | 1 |
construct-rlve-pan-solar-panels-l1-s3 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 1 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 7 <= X <= 34 and 35 <= Y <= 38 such that gcd(X, Y) >= 19.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 19.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.js... | {"A": 7, "B": 34, "C": 35, "D": 38, "target": 19, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 19, "Y": 38} | 1 |
construct-rlve-pan-solar-panels-l1-s4 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 1 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 13 <= X <= 20 and 23 <= Y <= 30 such that gcd(X, Y) >= 15.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 15.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"A": 13, "B": 20, "C": 23, "D": 30, "target": 15, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 15, "Y": 30} | 1 |
construct-rlve-pan-solar-panels-l1-s5 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 1 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 36 <= X <= 37 and 40 <= Y <= 49 such that gcd(X, Y) >= 12.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 12.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"A": 36, "B": 37, "C": 40, "D": 49, "target": 12, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 36, "Y": 48} | 1 |
construct-rlve-pan-solar-panels-l1-s6 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 1 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 8 <= X <= 21 and 46 <= Y <= 47 such that gcd(X, Y) >= 2.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 2.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json... | {"A": 8, "B": 21, "C": 46, "D": 47, "target": 2, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 20, "Y": 46} | 1 |
construct-rlve-pan-solar-panels-l1-s7 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 1 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 47 <= X <= 48 and 13 <= Y <= 14 such that gcd(X, Y) >= 2.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 2.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.jso... | {"A": 47, "B": 48, "C": 13, "D": 14, "target": 2, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 48, "Y": 14} | 1 |
construct-rlve-pan-solar-panels-l1-s8 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 1 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 16 <= X <= 20 and 25 <= Y <= 42 such that gcd(X, Y) >= 20.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 20.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"A": 16, "B": 20, "C": 25, "D": 42, "target": 20, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 20, "Y": 40} | 1 |
construct-rlve-pan-solar-panels-l1-s9 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 1 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 10 <= X <= 20 and 30 <= Y <= 43 such that gcd(X, Y) >= 20.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 20.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"A": 10, "B": 20, "C": 30, "D": 43, "target": 20, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 20, "Y": 40} | 1 |
construct-rlve-pan-solar-panels-l2-s0 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 2 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 53 <= X <= 242 and 267 <= Y <= 634 such that gcd(X, Y) >= 242.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 242.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/insta... | {"A": 53, "B": 242, "C": 267, "D": 634, "target": 242, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 242, "Y": 484} | 1 |
construct-rlve-pan-solar-panels-l2-s1 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 2 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 39 <= X <= 106 and 604 <= Y <= 944 such that gcd(X, Y) >= 106.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 106.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/insta... | {"A": 39, "B": 106, "C": 604, "D": 944, "target": 106, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 106, "Y": 848} | 1 |
construct-rlve-pan-solar-panels-l2-s2 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 2 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 368 <= X <= 412 and 669 <= Y <= 864 such that gcd(X, Y) >= 412.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 412.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"A": 368, "B": 412, "C": 669, "D": 864, "target": 412, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 412, "Y": 824} | 1 |
construct-rlve-pan-solar-panels-l2-s3 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 2 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 791 <= X <= 822 and 119 <= Y <= 729 such that gcd(X, Y) >= 411.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 411.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"A": 791, "B": 822, "C": 119, "D": 729, "target": 411, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 822, "Y": 411} | 1 |
construct-rlve-pan-solar-panels-l2-s4 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 2 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 433 <= X <= 809 and 169 <= Y <= 339 such that gcd(X, Y) >= 339.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 339.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"A": 433, "B": 809, "C": 169, "D": 339, "target": 339, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 678, "Y": 339} | 1 |
construct-rlve-pan-solar-panels-l2-s5 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 2 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 663 <= X <= 736 and 476 <= Y <= 592 such that gcd(X, Y) >= 245.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 245.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"A": 663, "B": 736, "C": 476, "D": 592, "target": 245, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 735, "Y": 490} | 1 |
construct-rlve-pan-solar-panels-l2-s6 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 2 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 199 <= X <= 204 and 565 <= Y <= 788 such that gcd(X, Y) >= 204.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 204.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"A": 199, "B": 204, "C": 565, "D": 788, "target": 204, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 204, "Y": 612} | 1 |
construct-rlve-pan-solar-panels-l2-s7 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 2 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 6 <= X <= 23 and 220 <= Y <= 579 such that gcd(X, Y) >= 23.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 23.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.... | {"A": 6, "B": 23, "C": 220, "D": 579, "target": 23, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 23, "Y": 575} | 1 |
construct-rlve-pan-solar-panels-l2-s8 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 2 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 814 <= X <= 904 and 1 <= Y <= 201 such that gcd(X, Y) >= 180.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 180.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instan... | {"A": 814, "B": 904, "C": 1, "D": 201, "target": 180, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 900, "Y": 180} | 1 |
construct-rlve-pan-solar-panels-l2-s9 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 2 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 141 <= X <= 344 and 383 <= Y <= 759 such that gcd(X, Y) >= 344.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 344.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"A": 141, "B": 344, "C": 383, "D": 759, "target": 344, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 344, "Y": 688} | 1 |
construct-rlve-pan-solar-panels-l3-s0 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 3 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 25043 <= X <= 32163 and 68416 <= Y <= 73143 such that gcd(X, Y) >= 14628.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 14628.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/... | {"A": 25043, "B": 32163, "C": 68416, "D": 73143, "target": 14628, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 29256, "Y": 73140} | 1 |
construct-rlve-pan-solar-panels-l3-s1 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 3 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 84820 <= X <= 88690 and 15258 <= Y <= 22353 such that gcd(X, Y) >= 22172.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 22172.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/... | {"A": 84820, "B": 88690, "C": 15258, "D": 22353, "target": 22172, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 88688, "Y": 22172} | 1 |
construct-rlve-pan-solar-panels-l3-s2 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 3 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 879 <= X <= 48175 and 86223 <= Y <= 91145 such that gcd(X, Y) >= 45572.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 45572.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/wo... | {"A": 879, "B": 48175, "C": 86223, "D": 91145, "target": 45572, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 45572, "Y": 91144} | 1 |
construct-rlve-pan-solar-panels-l3-s3 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 3 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 61659 <= X <= 83716 and 39815 <= Y <= 51897 such that gcd(X, Y) >= 41858.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 41858.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/... | {"A": 61659, "B": 83716, "C": 39815, "D": 51897, "target": 41858, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 83716, "Y": 41858} | 1 |
construct-rlve-pan-solar-panels-l3-s4 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 3 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 3768 <= X <= 35631 and 47859 <= Y <= 72030 such that gcd(X, Y) >= 35631.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 35631.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/w... | {"A": 3768, "B": 35631, "C": 47859, "D": 72030, "target": 35631, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 35631, "Y": 71262} | 1 |
construct-rlve-pan-solar-panels-l3-s5 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 3 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 26084 <= X <= 54526 and 82746 <= Y <= 83710 such that gcd(X, Y) >= 41855.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 41855.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/... | {"A": 26084, "B": 54526, "C": 82746, "D": 83710, "target": 41855, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 41855, "Y": 83710} | 1 |
construct-rlve-pan-solar-panels-l3-s6 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 3 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 26804 <= X <= 63517 and 74163 <= Y <= 80659 such that gcd(X, Y) >= 40329.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 40329.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/... | {"A": 26804, "B": 63517, "C": 74163, "D": 80659, "target": 40329, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 40329, "Y": 80658} | 1 |
construct-rlve-pan-solar-panels-l3-s7 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 3 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 94570 <= X <= 96416 and 34086 <= Y <= 64189 such that gcd(X, Y) >= 48208.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 48208.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/... | {"A": 94570, "B": 96416, "C": 34086, "D": 64189, "target": 48208, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 96416, "Y": 48208} | 1 |
construct-rlve-pan-solar-panels-l3-s8 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 3 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 2862 <= X <= 20567 and 29606 <= Y <= 64020 such that gcd(X, Y) >= 20567.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 20567.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/w... | {"A": 2862, "B": 20567, "C": 29606, "D": 64020, "target": 20567, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 20567, "Y": 61701} | 1 |
construct-rlve-pan-solar-panels-l3-s9 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 3 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 19406 <= X <= 23839 and 74103 <= Y <= 76269 such that gcd(X, Y) >= 10895.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 10895.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/... | {"A": 19406, "B": 23839, "C": 74103, "D": 76269, "target": 10895, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 21790, "Y": 76265} | 1 |
construct-rlve-pan-solar-panels-l4-s0 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 4 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 2131042 <= X <= 5755140 and 6961510 <= Y <= 7520703 such that gcd(X, Y) >= 3760351.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 3760351.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data i... | {"A": 2131042, "B": 5755140, "C": 6961510, "D": 7520703, "target": 3760351, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 3760351, "Y": 7520702} | 1 |
construct-rlve-pan-solar-panels-l4-s1 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 4 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 3382548 <= X <= 3614436 and 4136188 <= Y <= 6305126 such that gcd(X, Y) >= 1807218.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 1807218.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data i... | {"A": 3382548, "B": 3614436, "C": 4136188, "D": 6305126, "target": 1807218, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 3614436, "Y": 5421654} | 1 |
construct-rlve-pan-solar-panels-l4-s2 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 4 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 7992730 <= X <= 8010563 and 9083026 <= Y <= 9990374 such that gcd(X, Y) >= 1602112.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 1602112.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data i... | {"A": 7992730, "B": 8010563, "C": 9083026, "D": 9990374, "target": 1602112, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 8010560, "Y": 9612672} | 1 |
construct-rlve-pan-solar-panels-l4-s3 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 4 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 3841404 <= X <= 5518858 and 425225 <= Y <= 1013121 such that gcd(X, Y) >= 1013121.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 1013121.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is... | {"A": 3841404, "B": 5518858, "C": 425225, "D": 1013121, "target": 1013121, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 5065605, "Y": 1013121} | 1 |
construct-rlve-pan-solar-panels-l4-s4 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 4 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 1377999 <= X <= 1476291 and 1689582 <= Y <= 2487136 such that gcd(X, Y) >= 738145.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 738145.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is ... | {"A": 1377999, "B": 1476291, "C": 1689582, "D": 2487136, "target": 738145, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 1476290, "Y": 2214435} | 1 |
construct-rlve-pan-solar-panels-l4-s5 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 4 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 3046746 <= X <= 3994125 and 4282691 <= Y <= 4738460 such that gcd(X, Y) >= 1579486.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 1579486.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data i... | {"A": 3046746, "B": 3994125, "C": 4282691, "D": 4738460, "target": 1579486, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 3158972, "Y": 4738458} | 1 |
construct-rlve-pan-solar-panels-l4-s6 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 4 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 2292520 <= X <= 2715538 and 4618191 <= Y <= 9325999 such that gcd(X, Y) >= 2715538.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 2715538.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data i... | {"A": 2292520, "B": 2715538, "C": 4618191, "D": 9325999, "target": 2715538, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 2715538, "Y": 8146614} | 1 |
construct-rlve-pan-solar-panels-l4-s7 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 4 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 8308601 <= X <= 9820980 and 5572394 <= Y <= 5585589 such that gcd(X, Y) >= 2792794.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 2792794.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data i... | {"A": 8308601, "B": 9820980, "C": 5572394, "D": 5585589, "target": 2792794, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 8378382, "Y": 5585588} | 1 |
construct-rlve-pan-solar-panels-l4-s8 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 4 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 4010461 <= X <= 6817760 and 7580073 <= Y <= 8983248 such that gcd(X, Y) >= 4491624.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 4491624.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data i... | {"A": 4010461, "B": 6817760, "C": 7580073, "D": 8983248, "target": 4491624, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 4491624, "Y": 8983248} | 1 |
construct-rlve-pan-solar-panels-l4-s9 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 4 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 6973908 <= X <= 8464741 and 389181 <= Y <= 4252966 such that gcd(X, Y) >= 4232370.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 4232370.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is... | {"A": 6973908, "B": 8464741, "C": 389181, "D": 4252966, "target": 4232370, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 8464740, "Y": 4232370} | 1 |
construct-rlve-pan-solar-panels-l5-s0 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 5 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 405078520 <= X <= 527105166 and 93130686 <= Y <= 247190695 such that gcd(X, Y) >= 247190695.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 247190695.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The inst... | {"A": 405078520, "B": 527105166, "C": 93130686, "D": 247190695, "target": 247190695, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 494381390, "Y": 247190695} | 1 |
construct-rlve-pan-solar-panels-l5-s1 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 5 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 530628814 <= X <= 552764264 and 48604901 <= Y <= 402446563 such that gcd(X, Y) >= 276382132.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 276382132.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The inst... | {"A": 530628814, "B": 552764264, "C": 48604901, "D": 402446563, "target": 276382132, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 552764264, "Y": 276382132} | 1 |
construct-rlve-pan-solar-panels-l5-s2 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 5 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 397903077 <= X <= 613586830 and 614063208 <= Y <= 644386145 such that gcd(X, Y) >= 214795381.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 214795381.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The ins... | {"A": 397903077, "B": 613586830, "C": 614063208, "D": 644386145, "target": 214795381, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 429590762, "Y": 644386143} | 1 |
construct-rlve-pan-solar-panels-l5-s3 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 5 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 42553964 <= X <= 257723116 and 501693358 <= Y <= 551265586 such that gcd(X, Y) >= 257723116.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 257723116.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The inst... | {"A": 42553964, "B": 257723116, "C": 501693358, "D": 551265586, "target": 257723116, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 257723116, "Y": 515446232} | 1 |
construct-rlve-pan-solar-panels-l5-s4 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 5 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 794675486 <= X <= 895288867 and 152346316 <= Y <= 485347160 such that gcd(X, Y) >= 447644433.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 447644433.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The ins... | {"A": 794675486, "B": 895288867, "C": 152346316, "D": 485347160, "target": 447644433, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 895288866, "Y": 447644433} | 1 |
construct-rlve-pan-solar-panels-l5-s5 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 5 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 454397313 <= X <= 674798904 and 675015801 <= Y <= 765269083 such that gcd(X, Y) >= 255089694.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 255089694.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The ins... | {"A": 454397313, "B": 674798904, "C": 675015801, "D": 765269083, "target": 255089694, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 510179388, "Y": 765269082} | 1 |
construct-rlve-pan-solar-panels-l5-s6 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 5 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 623690500 <= X <= 944166939 and 17135601 <= Y <= 60968488 such that gcd(X, Y) >= 60968488.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 60968488.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The instanc... | {"A": 623690500, "B": 944166939, "C": 17135601, "D": 60968488, "target": 60968488, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 914527320, "Y": 60968488} | 1 |
construct-rlve-pan-solar-panels-l5-s7 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 5 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 828859882 <= X <= 831889677 and 717251883 <= Y <= 766265554 such that gcd(X, Y) >= 103986209.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 103986209.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The ins... | {"A": 828859882, "B": 831889677, "C": 717251883, "D": 766265554, "target": 103986209, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 831889672, "Y": 727903463} | 1 |
construct-rlve-pan-solar-panels-l5-s8 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 5 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 548331659 <= X <= 884012473 and 250808177 <= Y <= 360530747 such that gcd(X, Y) >= 360530747.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 360530747.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The ins... | {"A": 548331659, "B": 884012473, "C": 250808177, "D": 360530747, "target": 360530747, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 721061494, "Y": 360530747} | 1 |
construct-rlve-pan-solar-panels-l5-s9 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 5 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 703491664 <= X <= 865253034 and 175676276 <= Y <= 175943928 such that gcd(X, Y) >= 175943928.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 175943928.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.json`. The ins... | {"A": 703491664, "B": 865253034, "C": 175676276, "D": 175943928, "target": 175943928, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 703775712, "Y": 175943928} | 1 |
construct-rlve-pan-solar-panels-l6-s0 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 6 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 28143709615 <= X <= 44258818276 and 63660013589 <= Y <= 72309747170 such that gcd(X, Y) >= 36154873585.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 36154873585.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.js... | {"A": 28143709615, "B": 44258818276, "C": 63660013589, "D": 72309747170, "target": 36154873585, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 36154873585, "Y": 72309747170} | 1 |
construct-rlve-pan-solar-panels-l6-s1 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 6 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 9915828182 <= X <= 23618272831 and 64936631330 <= Y <= 98483709841 such that gcd(X, Y) >= 23618272831.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 23618272831.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.jso... | {"A": 9915828182, "B": 23618272831, "C": 64936631330, "D": 98483709841, "target": 23618272831, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 23618272831, "Y": 94473091324} | 1 |
construct-rlve-pan-solar-panels-l6-s2 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 6 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 75902618468 <= X <= 93763097709 and 27284805205 <= Y <= 37650187878 such that gcd(X, Y) >= 31254365903.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 31254365903.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.js... | {"A": 75902618468, "B": 93763097709, "C": 27284805205, "D": 37650187878, "target": 31254365903, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 93763097709, "Y": 31254365903} | 1 |
construct-rlve-pan-solar-panels-l6-s3 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 6 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 53637784682 <= X <= 64678784162 and 7975294607 <= Y <= 38996404042 such that gcd(X, Y) >= 32339392081.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 32339392081.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.jso... | {"A": 53637784682, "B": 64678784162, "C": 7975294607, "D": 38996404042, "target": 32339392081, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 64678784162, "Y": 32339392081} | 1 |
construct-rlve-pan-solar-panels-l6-s4 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 6 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 8138612883 <= X <= 32217432600 and 80648584982 <= Y <= 92047726236 such that gcd(X, Y) >= 30682575412.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 30682575412.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.jso... | {"A": 8138612883, "B": 32217432600, "C": 80648584982, "D": 92047726236, "target": 30682575412, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 30682575412, "Y": 92047726236} | 1 |
construct-rlve-pan-solar-panels-l6-s5 | construct | rlve_pan_solar_panels | poi_solar_panels_max_gcd | number_theory | competition | 6 | RLVE-Gym/pan_solar_panels | MIT | [
"agentic_trivial"
] | Find integers X and Y with 63502323648 <= X <= 89787137638 and 35308634788 <= Y <= 38651163703 such that gcd(X, Y) >= 38651163703.
(The maximum possible value of gcd(X, Y) over these ranges is exactly 38651163703.)
Answer format: {"X": <integer>, "Y": <integer>}
Write your final answer as JSON to `/workdir/answer.js... | {"A": 63502323648, "B": 89787137638, "C": 35308634788, "D": 38651163703, "target": 38651163703, "family": "rlve_pan_solar_panels", "subset": "construct"} | null | null | null | {"X": 77302327406, "Y": 38651163703} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.