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-crt-l6-s6 | construct | rlve_crt | generalized_crt | number_theory | competition | 6 | RLVE-Gym/crt | MIT | [
"agentic_trivial"
] | Find any non-negative integer x satisfying all of the following 8 congruences (the moduli need not be pairwise coprime; the system is consistent):
x ≡ 9988691296789 (mod 184200192271908)
x ≡ 166393777804023 (mod 764595874852306)
x ≡ 222208150599496 (mod 708781502056833)
x ≡ 130763423136138 (mod 800226229520191)
x ≡ 442... | {"moduli": [184200192271908, 764595874852306, 708781502056833, 800226229520191, 488490670468920, 36428706766183, 414309450448446, 483001008778372], "residues": [9988691296789, 166393777804023, 222208150599496, 130763423136138, 442498982187409, 20271983501754, 102370751759437, 447988643877957], "family": "rlve_crt", "su... | null | null | null | {"x": 930989652656329} | 1 |
construct-rlve-crt-l6-s7 | construct | rlve_crt | generalized_crt | number_theory | competition | 6 | RLVE-Gym/crt | MIT | [
"agentic_trivial"
] | Find any non-negative integer x satisfying all of the following 8 congruences (the moduli need not be pairwise coprime; the system is consistent):
x ≡ 110614837867648 (mod 568789213172665)
x ≡ 166211461622618 (mod 513192589417695)
x ≡ 78302154794324 (mod 601101896245989)
x ≡ 15933314189977 (mod 82933842106292)
x ≡ 1503... | {"moduli": [568789213172665, 513192589417695, 601101896245989, 82933842106292, 66436829116139, 517199215462209, 400071579241132, 44681588137481], "residues": [110614837867648, 166211461622618, 78302154794324, 15933314189977, 15035759878923, 162204835578104, 279332471799181, 9180228978098], "family": "rlve_crt", "subset... | null | null | null | {"x": 679404051040313} | 1 |
construct-rlve-crt-l6-s8 | construct | rlve_crt | generalized_crt | number_theory | competition | 6 | RLVE-Gym/crt | MIT | [
"agentic_trivial"
] | Find any non-negative integer x satisfying all of the following 8 congruences (the moduli need not be pairwise coprime; the system is consistent):
x ≡ 64005538255882 (mod 758273739531656)
x ≡ 183032892773660 (mod 639246385013878)
x ≡ 188759004847193 (mod 633520272940345)
x ≡ 50415205387384 (mod 385932036200077)
x ≡ 666... | {"moduli": [758273739531656, 639246385013878, 633520272940345, 385932036200077, 815619138566358, 564562920330518, 206550933374662, 516073171203366], "residues": [64005538255882, 183032892773660, 188759004847193, 50415205387384, 6660139221180, 257716357457020, 202626477663552, 306206106584172], "family": "rlve_crt", "su... | null | null | null | {"x": 822279277787538} | 1 |
construct-rlve-crt-l6-s9 | construct | rlve_crt | generalized_crt | number_theory | competition | 6 | RLVE-Gym/crt | MIT | [
"agentic_trivial"
] | Find any non-negative integer x satisfying all of the following 8 congruences (the moduli need not be pairwise coprime; the system is consistent):
x ≡ 50825584869996 (mod 54294713611346)
x ≡ 36652115646092 (mod 468591800308393)
x ≡ 298573646804699 (mod 675262069458179)
x ≡ 388014047496109 (mod 585821668766769)
x ≡ 6383... | {"moduli": [54294713611346, 468591800308393, 675262069458179, 585821668766769, 101111323131242, 103491426206435, 832932486471626, 41041700362452], "residues": [50825584869996, 36652115646092, 298573646804699, 388014047496109, 63833808081700, 42412880404963, 140903229791252, 29876607926482], "family": "rlve_crt", "subse... | null | null | null | {"x": 973835716262878} | 1 |
construct-rlve-distinct-subset-sum-permutation-l1-s0 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 1 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 4 distinct integers: A = [1, 5, 2, 4] (positions 1..4).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 4}, 0 < |S| < 4) the sums of A and of B over the positions in S are different.
Answer format: {"B": [B_1, ... | {"A": [1, 5, 2, 4], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [2, 1, 4, 5]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l1-s1 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 1 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 4 distinct integers: A = [4, 7, 6, 2] (positions 1..4).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 4}, 0 < |S| < 4) the sums of A and of B over the positions in S are different.
Answer format: {"B": [B_1, ... | {"A": [4, 7, 6, 2], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [6, 2, 7, 4]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l1-s2 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 1 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 4 distinct integers: A = [2, 3, 0, 4] (positions 1..4).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 4}, 0 < |S| < 4) the sums of A and of B over the positions in S are different.
Answer format: {"B": [B_1, ... | {"A": [2, 3, 0, 4], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [3, 4, 2, 0]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l1-s3 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 1 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 4 distinct integers: A = [0, 1, 7, 4] (positions 1..4).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 4}, 0 < |S| < 4) the sums of A and of B over the positions in S are different.
Answer format: {"B": [B_1, ... | {"A": [0, 1, 7, 4], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [1, 4, 0, 7]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l1-s4 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 1 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 4 distinct integers: A = [7, 0, 6, 2] (positions 1..4).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 4}, 0 < |S| < 4) the sums of A and of B over the positions in S are different.
Answer format: {"B": [B_1, ... | {"A": [7, 0, 6, 2], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [0, 2, 7, 6]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l1-s5 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 1 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 4 distinct integers: A = [0, 4, 7, 5] (positions 1..4).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 4}, 0 < |S| < 4) the sums of A and of B over the positions in S are different.
Answer format: {"B": [B_1, ... | {"A": [0, 4, 7, 5], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [4, 5, 0, 7]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l1-s6 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 1 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 4 distinct integers: A = [2, 7, 4, 1] (positions 1..4).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 4}, 0 < |S| < 4) the sums of A and of B over the positions in S are different.
Answer format: {"B": [B_1, ... | {"A": [2, 7, 4, 1], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [4, 1, 7, 2]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l1-s7 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 1 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 4 distinct integers: A = [5, 1, 4, 2] (positions 1..4).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 4}, 0 < |S| < 4) the sums of A and of B over the positions in S are different.
Answer format: {"B": [B_1, ... | {"A": [5, 1, 4, 2], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [1, 2, 5, 4]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l1-s8 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 1 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 4 distinct integers: A = [4, 2, 6, 3] (positions 1..4).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 4}, 0 < |S| < 4) the sums of A and of B over the positions in S are different.
Answer format: {"B": [B_1, ... | {"A": [4, 2, 6, 3], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [6, 3, 2, 4]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l1-s9 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 1 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 4 distinct integers: A = [7, 0, 1, 4] (positions 1..4).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 4}, 0 < |S| < 4) the sums of A and of B over the positions in S are different.
Answer format: {"B": [B_1, ... | {"A": [7, 0, 1, 4], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [0, 1, 4, 7]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l2-s0 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 2 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 7 distinct integers: A = [12, 0, 13, 11, 2, 3, 4] (positions 1..7).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 7}, 0 < |S| < 7) the sums of A and of B over the positions in S are different.
Answer format: ... | {"A": [12, 0, 13, 11, 2, 3, 4], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [13, 2, 0, 12, 3, 4, 11]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l2-s1 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 2 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 7 distinct integers: A = [11, 1, 6, 10, 9, 2, 5] (positions 1..7).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 7}, 0 < |S| < 7) the sums of A and of B over the positions in S are different.
Answer format: {... | {"A": [11, 1, 6, 10, 9, 2, 5], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [1, 2, 9, 11, 10, 5, 6]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l2-s2 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 2 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 7 distinct integers: A = [7, 8, 5, 1, 10, 13, 12] (positions 1..7).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 7}, 0 < |S| < 7) the sums of A and of B over the positions in S are different.
Answer format: ... | {"A": [7, 8, 5, 1, 10, 13, 12], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [8, 10, 7, 5, 12, 1, 13]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l2-s3 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 2 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 7 distinct integers: A = [4, 1, 5, 9, 0, 11, 6] (positions 1..7).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 7}, 0 < |S| < 7) the sums of A and of B over the positions in S are different.
Answer format: {"... | {"A": [4, 1, 5, 9, 0, 11, 6], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [5, 4, 6, 11, 1, 0, 9]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l2-s4 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 2 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 7 distinct integers: A = [5, 7, 9, 13, 3, 8, 2] (positions 1..7).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 7}, 0 < |S| < 7) the sums of A and of B over the positions in S are different.
Answer format: {"... | {"A": [5, 7, 9, 13, 3, 8, 2], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [7, 8, 13, 2, 5, 9, 3]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l2-s5 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 2 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 7 distinct integers: A = [13, 12, 10, 2, 6, 0, 5] (positions 1..7).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 7}, 0 < |S| < 7) the sums of A and of B over the positions in S are different.
Answer format: ... | {"A": [13, 12, 10, 2, 6, 0, 5], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [0, 13, 12, 5, 10, 2, 6]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l2-s6 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 2 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 7 distinct integers: A = [1, 2, 8, 0, 4, 7, 9] (positions 1..7).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 7}, 0 < |S| < 7) the sums of A and of B over the positions in S are different.
Answer format: {"B... | {"A": [1, 2, 8, 0, 4, 7, 9], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [2, 4, 9, 1, 7, 8, 0]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l2-s7 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 2 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 7 distinct integers: A = [5, 10, 0, 12, 2, 4, 8] (positions 1..7).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 7}, 0 < |S| < 7) the sums of A and of B over the positions in S are different.
Answer format: {... | {"A": [5, 10, 0, 12, 2, 4, 8], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [8, 12, 2, 0, 4, 5, 10]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l2-s8 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 2 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 7 distinct integers: A = [5, 0, 2, 11, 12, 4, 13] (positions 1..7).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 7}, 0 < |S| < 7) the sums of A and of B over the positions in S are different.
Answer format: ... | {"A": [5, 0, 2, 11, 12, 4, 13], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [11, 2, 4, 12, 13, 5, 0]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l2-s9 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 2 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 7 distinct integers: A = [7, 13, 2, 6, 1, 3, 10] (positions 1..7).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 7}, 0 < |S| < 7) the sums of A and of B over the positions in S are different.
Answer format: {... | {"A": [7, 13, 2, 6, 1, 3, 10], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [10, 1, 3, 7, 2, 6, 13]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l3-s0 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 3 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 10 distinct integers: A = [6, 14, 1, 0, 12, 10, 5, 11, 7, 4] (positions 1..10).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 10}, 0 < |S| < 10) the sums of A and of B over the positions in S are different.
A... | {"A": [6, 14, 1, 0, 12, 10, 5, 11, 7, 4], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [7, 0, 4, 1, 14, 11, 6, 12, 10, 5]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l3-s1 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 3 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 10 distinct integers: A = [15, 5, 17, 18, 19, 12, 4, 7, 8, 6] (positions 1..10).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 10}, 0 < |S| < 10) the sums of A and of B over the positions in S are different.
... | {"A": [15, 5, 17, 18, 19, 12, 4, 7, 8, 6], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [17, 6, 18, 19, 4, 15, 5, 8, 12, 7]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l3-s2 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 3 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 10 distinct integers: A = [0, 1, 14, 15, 6, 12, 2, 3, 19, 10] (positions 1..10).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 10}, 0 < |S| < 10) the sums of A and of B over the positions in S are different.
... | {"A": [0, 1, 14, 15, 6, 12, 2, 3, 19, 10], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [1, 2, 15, 19, 10, 14, 3, 6, 0, 12]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l3-s3 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 3 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 10 distinct integers: A = [9, 13, 12, 16, 3, 18, 11, 10, 15, 0] (positions 1..10).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 10}, 0 < |S| < 10) the sums of A and of B over the positions in S are different.... | {"A": [9, 13, 12, 16, 3, 18, 11, 10, 15, 0], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [10, 15, 13, 18, 9, 0, 12, 11, 16, 3]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l3-s4 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 3 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 10 distinct integers: A = [17, 14, 3, 11, 0, 15, 9, 6, 1, 7] (positions 1..10).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 10}, 0 < |S| < 10) the sums of A and of B over the positions in S are different.
A... | {"A": [17, 14, 3, 11, 0, 15, 9, 6, 1, 7], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [0, 15, 6, 14, 1, 17, 11, 7, 3, 9]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l3-s5 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 3 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 10 distinct integers: A = [17, 0, 2, 12, 3, 4, 19, 7, 8, 14] (positions 1..10).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 10}, 0 < |S| < 10) the sums of A and of B over the positions in S are different.
A... | {"A": [17, 0, 2, 12, 3, 4, 19, 7, 8, 14], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [19, 2, 3, 14, 4, 7, 0, 8, 12, 17]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l3-s6 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 3 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 10 distinct integers: A = [8, 7, 15, 16, 10, 6, 14, 13, 2, 1] (positions 1..10).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 10}, 0 < |S| < 10) the sums of A and of B over the positions in S are different.
... | {"A": [8, 7, 15, 16, 10, 6, 14, 13, 2, 1], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [10, 8, 16, 1, 13, 7, 15, 14, 6, 2]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l3-s7 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 3 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 10 distinct integers: A = [1, 10, 9, 11, 4, 18, 2, 15, 7, 0] (positions 1..10).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 10}, 0 < |S| < 10) the sums of A and of B over the positions in S are different.
A... | {"A": [1, 10, 9, 11, 4, 18, 2, 15, 7, 0], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [2, 11, 10, 15, 7, 0, 4, 18, 9, 1]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l3-s8 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 3 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 10 distinct integers: A = [6, 0, 13, 7, 4, 14, 17, 5, 15, 11] (positions 1..10).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 10}, 0 < |S| < 10) the sums of A and of B over the positions in S are different.
... | {"A": [6, 0, 13, 7, 4, 14, 17, 5, 15, 11], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [7, 4, 14, 11, 5, 15, 0, 6, 17, 13]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l3-s9 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 3 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 10 distinct integers: A = [4, 6, 9, 0, 2, 10, 8, 17, 13, 12] (positions 1..10).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 10}, 0 < |S| < 10) the sums of A and of B over the positions in S are different.
A... | {"A": [4, 6, 9, 0, 2, 10, 8, 17, 13, 12], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [6, 8, 10, 2, 4, 12, 9, 0, 17, 13]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l4-s0 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 4 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 14 distinct integers: A = [4, 16, 10, 6, 23, 1, 19, 11, 13, 20, 3, 24, 9, 26] (positions 1..14).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 14}, 0 < |S| < 14) the sums of A and of B over the positions in S ... | {"A": [4, 16, 10, 6, 23, 1, 19, 11, 13, 20, 3, 24, 9, 26], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [6, 19, 11, 9, 24, 3, 20, 13, 16, 23, 4, 26, 10, 1]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l4-s1 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 4 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 14 distinct integers: A = [7, 22, 24, 3, 11, 14, 23, 5, 10, 8, 21, 0, 26, 20] (positions 1..14).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 14}, 0 < |S| < 14) the sums of A and of B over the positions in S ... | {"A": [7, 22, 24, 3, 11, 14, 23, 5, 10, 8, 21, 0, 26, 20], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [8, 23, 26, 5, 14, 20, 24, 7, 11, 10, 22, 3, 0, 21]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l4-s2 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 4 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 14 distinct integers: A = [27, 24, 2, 14, 4, 7, 5, 1, 6, 26, 16, 13, 0, 25] (positions 1..14).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 14}, 0 < |S| < 14) the sums of A and of B over the positions in S ar... | {"A": [27, 24, 2, 14, 4, 7, 5, 1, 6, 26, 16, 13, 0, 25], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [0, 25, 4, 16, 5, 13, 6, 2, 7, 27, 24, 14, 1, 26]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l4-s3 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 4 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 14 distinct integers: A = [25, 6, 21, 22, 7, 4, 15, 11, 27, 10, 5, 18, 0, 16] (positions 1..14).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 14}, 0 < |S| < 14) the sums of A and of B over the positions in S ... | {"A": [25, 6, 21, 22, 7, 4, 15, 11, 27, 10, 5, 18, 0, 16], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [27, 7, 22, 25, 10, 5, 16, 15, 0, 11, 6, 21, 4, 18]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l4-s4 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 4 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 14 distinct integers: A = [22, 15, 9, 21, 8, 3, 25, 20, 27, 23, 5, 16, 11, 26] (positions 1..14).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 14}, 0 < |S| < 14) the sums of A and of B over the positions in S... | {"A": [22, 15, 9, 21, 8, 3, 25, 20, 27, 23, 5, 16, 11, 26], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [23, 16, 11, 22, 9, 5, 26, 21, 3, 25, 8, 20, 15, 27]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l4-s5 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 4 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 14 distinct integers: A = [4, 17, 12, 13, 5, 25, 18, 7, 9, 15, 14, 27, 21, 1] (positions 1..14).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 14}, 0 < |S| < 14) the sums of A and of B over the positions in S ... | {"A": [4, 17, 12, 13, 5, 25, 18, 7, 9, 15, 14, 27, 21, 1], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [5, 18, 13, 14, 7, 27, 21, 9, 12, 17, 15, 1, 25, 4]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l4-s6 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 4 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 14 distinct integers: A = [15, 11, 25, 4, 0, 10, 17, 16, 19, 3, 24, 9, 21, 22] (positions 1..14).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 14}, 0 < |S| < 14) the sums of A and of B over the positions in S... | {"A": [15, 11, 25, 4, 0, 10, 17, 16, 19, 3, 24, 9, 21, 22], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [16, 15, 0, 9, 3, 11, 19, 17, 21, 4, 25, 10, 22, 24]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l4-s7 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 4 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 14 distinct integers: A = [23, 17, 27, 18, 7, 12, 26, 11, 0, 3, 16, 9, 13, 2] (positions 1..14).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 14}, 0 < |S| < 14) the sums of A and of B over the positions in S ... | {"A": [23, 17, 27, 18, 7, 12, 26, 11, 0, 3, 16, 9, 13, 2], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [26, 18, 0, 23, 9, 13, 27, 12, 2, 7, 17, 11, 16, 3]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l4-s8 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 4 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 14 distinct integers: A = [0, 24, 6, 26, 21, 7, 2, 16, 27, 18, 4, 22, 13, 25] (positions 1..14).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 14}, 0 < |S| < 14) the sums of A and of B over the positions in S ... | {"A": [0, 24, 6, 26, 21, 7, 2, 16, 27, 18, 4, 22, 13, 25], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [2, 25, 7, 27, 22, 13, 4, 18, 0, 21, 6, 24, 16, 26]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l4-s9 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 4 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 14 distinct integers: A = [21, 7, 8, 17, 13, 2, 19, 14, 4, 27, 10, 20, 26, 6] (positions 1..14).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 14}, 0 < |S| < 14) the sums of A and of B over the positions in S ... | {"A": [21, 7, 8, 17, 13, 2, 19, 14, 4, 27, 10, 20, 26, 6], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [26, 8, 10, 19, 14, 4, 20, 17, 6, 2, 13, 21, 27, 7]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l5-s0 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 5 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 18 distinct integers: A = [19, 1, 26, 25, 33, 0, 20, 34, 11, 32, 31, 9, 35, 2, 30, 8, 16, 27] (positions 1..18).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 18}, 0 < |S| < 18) the sums of A and of B over the... | {"A": [19, 1, 26, 25, 33, 0, 20, 34, 11, 32, 31, 9, 35, 2, 30, 8, 16, 27], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [20, 2, 27, 26, 34, 1, 25, 35, 16, 33, 32, 11, 0, 8, 31, 9, 19, 30]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l5-s1 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 5 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 18 distinct integers: A = [5, 1, 12, 25, 16, 15, 11, 24, 34, 6, 4, 7, 21, 0, 32, 19, 28, 13] (positions 1..18).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 18}, 0 < |S| < 18) the sums of A and of B over the ... | {"A": [5, 1, 12, 25, 16, 15, 11, 24, 34, 6, 4, 7, 21, 0, 32, 19, 28, 13], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [6, 4, 13, 28, 19, 16, 12, 25, 0, 7, 5, 11, 24, 1, 34, 21, 32, 15]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l5-s2 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 5 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 18 distinct integers: A = [20, 35, 11, 14, 7, 13, 12, 23, 9, 8, 21, 1, 0, 28, 29, 32, 27, 24] (positions 1..18).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 18}, 0 < |S| < 18) the sums of A and of B over the... | {"A": [20, 35, 11, 14, 7, 13, 12, 23, 9, 8, 21, 1, 0, 28, 29, 32, 27, 24], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [21, 0, 12, 20, 8, 14, 13, 24, 11, 9, 23, 7, 1, 29, 32, 35, 28, 27]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l5-s3 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 5 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 18 distinct integers: A = [21, 1, 5, 22, 29, 19, 28, 7, 4, 18, 20, 16, 15, 32, 8, 23, 0, 26] (positions 1..18).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 18}, 0 < |S| < 18) the sums of A and of B over the ... | {"A": [21, 1, 5, 22, 29, 19, 28, 7, 4, 18, 20, 16, 15, 32, 8, 23, 0, 26], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [22, 4, 7, 23, 32, 20, 29, 8, 5, 19, 21, 18, 16, 0, 15, 26, 1, 28]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l5-s4 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 5 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 18 distinct integers: A = [6, 26, 10, 14, 3, 21, 24, 30, 35, 5, 33, 11, 4, 32, 7, 12, 25, 31] (positions 1..18).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 18}, 0 < |S| < 18) the sums of A and of B over the... | {"A": [6, 26, 10, 14, 3, 21, 24, 30, 35, 5, 33, 11, 4, 32, 7, 12, 25, 31], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [7, 30, 11, 21, 4, 24, 25, 31, 3, 6, 35, 12, 5, 33, 10, 14, 26, 32]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l5-s5 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 5 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 18 distinct integers: A = [35, 30, 29, 6, 26, 1, 5, 8, 2, 7, 3, 34, 0, 4, 28, 31, 17, 21] (positions 1..18).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 18}, 0 < |S| < 18) the sums of A and of B over the pos... | {"A": [35, 30, 29, 6, 26, 1, 5, 8, 2, 7, 3, 34, 0, 4, 28, 31, 17, 21], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [0, 31, 30, 7, 28, 2, 6, 17, 3, 8, 4, 35, 1, 5, 29, 34, 21, 26]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l5-s6 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 5 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 18 distinct integers: A = [19, 24, 5, 21, 35, 17, 2, 11, 23, 27, 30, 9, 32, 25, 10, 33, 20, 22] (positions 1..18).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 18}, 0 < |S| < 18) the sums of A and of B over t... | {"A": [19, 24, 5, 21, 35, 17, 2, 11, 23, 27, 30, 9, 32, 25, 10, 33, 20, 22], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [20, 25, 9, 22, 2, 19, 5, 17, 24, 30, 32, 10, 33, 27, 11, 35, 21, 23]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l5-s7 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 5 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 18 distinct integers: A = [17, 30, 24, 2, 13, 35, 25, 26, 7, 28, 6, 29, 22, 1, 3, 10, 34, 5] (positions 1..18).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 18}, 0 < |S| < 18) the sums of A and of B over the ... | {"A": [17, 30, 24, 2, 13, 35, 25, 26, 7, 28, 6, 29, 22, 1, 3, 10, 34, 5], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [22, 34, 25, 3, 17, 1, 26, 28, 10, 29, 7, 30, 24, 2, 5, 13, 35, 6]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l5-s8 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 5 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 18 distinct integers: A = [26, 0, 17, 23, 18, 27, 1, 19, 8, 32, 22, 7, 2, 31, 6, 29, 11, 34] (positions 1..18).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 18}, 0 < |S| < 18) the sums of A and of B over the ... | {"A": [26, 0, 17, 23, 18, 27, 1, 19, 8, 32, 22, 7, 2, 31, 6, 29, 11, 34], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [27, 1, 18, 26, 19, 29, 2, 22, 11, 34, 23, 8, 6, 32, 7, 31, 17, 0]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l5-s9 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 5 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 18 distinct integers: A = [5, 22, 26, 17, 24, 35, 3, 6, 7, 28, 33, 13, 27, 2, 30, 18, 34, 31] (positions 1..18).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 18}, 0 < |S| < 18) the sums of A and of B over the... | {"A": [5, 22, 26, 17, 24, 35, 3, 6, 7, 28, 33, 13, 27, 2, 30, 18, 34, 31], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [6, 24, 27, 18, 26, 2, 5, 7, 13, 30, 34, 17, 28, 3, 31, 22, 35, 33]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l6-s0 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 6 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 22 distinct integers: A = [24, 5, 32, 33, 2, 14, 25, 19, 39, 28, 9, 4, 29, 11, 12, 43, 6, 27, 40, 7, 10, 26] (positions 1..22).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 22}, 0 < |S| < 22) the sums of A an... | {"A": [24, 5, 32, 33, 2, 14, 25, 19, 39, 28, 9, 4, 29, 11, 12, 43, 6, 27, 40, 7, 10, 26], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [25, 6, 33, 39, 4, 19, 26, 24, 40, 29, 10, 5, 32, 12, 14, 2, 7, 28, 43, 9, 11, 27]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l6-s1 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 6 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 22 distinct integers: A = [33, 0, 9, 12, 20, 25, 41, 31, 5, 7, 42, 13, 3, 22, 35, 26, 17, 4, 15, 1, 30, 38] (positions 1..22).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 22}, 0 < |S| < 22) the sums of A and... | {"A": [33, 0, 9, 12, 20, 25, 41, 31, 5, 7, 42, 13, 3, 22, 35, 26, 17, 4, 15, 1, 30, 38], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [35, 1, 12, 13, 22, 26, 42, 33, 7, 9, 0, 15, 4, 25, 38, 30, 20, 5, 17, 3, 31, 41]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l6-s2 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 6 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 22 distinct integers: A = [20, 43, 34, 15, 5, 14, 2, 30, 35, 33, 41, 27, 29, 21, 26, 38, 28, 32, 9, 17, 42, 40] (positions 1..22).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 22}, 0 < |S| < 22) the sums of A... | {"A": [20, 43, 34, 15, 5, 14, 2, 30, 35, 33, 41, 27, 29, 21, 26, 38, 28, 32, 9, 17, 42, 40], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [21, 2, 35, 17, 9, 15, 5, 32, 38, 34, 42, 28, 30, 26, 27, 40, 29, 33, 14, 20, 43, 41]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l6-s3 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 6 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 22 distinct integers: A = [16, 36, 2, 8, 37, 28, 42, 35, 31, 30, 33, 20, 18, 40, 25, 19, 6, 39, 27, 13, 12, 4] (positions 1..22).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 22}, 0 < |S| < 22) the sums of A ... | {"A": [16, 36, 2, 8, 37, 28, 42, 35, 31, 30, 33, 20, 18, 40, 25, 19, 6, 39, 27, 13, 12, 4], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [18, 37, 4, 12, 39, 30, 2, 36, 33, 31, 35, 25, 19, 42, 27, 20, 8, 40, 28, 16, 13, 6]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l6-s4 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 6 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 22 distinct integers: A = [7, 17, 38, 26, 3, 24, 33, 2, 28, 8, 6, 41, 25, 1, 14, 35, 18, 21, 43, 36, 5, 16] (positions 1..22).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 22}, 0 < |S| < 22) the sums of A and... | {"A": [7, 17, 38, 26, 3, 24, 33, 2, 28, 8, 6, 41, 25, 1, 14, 35, 18, 21, 43, 36, 5, 16], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [8, 18, 41, 28, 5, 25, 35, 3, 33, 14, 7, 43, 26, 2, 16, 36, 21, 24, 1, 38, 6, 17]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l6-s5 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 6 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 22 distinct integers: A = [37, 2, 24, 7, 35, 20, 40, 25, 19, 4, 34, 38, 12, 15, 18, 10, 13, 8, 43, 14, 3, 39] (positions 1..22).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 22}, 0 < |S| < 22) the sums of A a... | {"A": [37, 2, 24, 7, 35, 20, 40, 25, 19, 4, 34, 38, 12, 15, 18, 10, 13, 8, 43, 14, 3, 39], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [38, 3, 25, 8, 37, 24, 43, 34, 20, 7, 35, 39, 13, 18, 19, 12, 14, 10, 2, 15, 4, 40]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l6-s6 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 6 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 22 distinct integers: A = [34, 30, 3, 25, 35, 14, 39, 11, 15, 9, 1, 16, 17, 5, 0, 21, 23, 32, 43, 36, 40, 7] (positions 1..22).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 22}, 0 < |S| < 22) the sums of A an... | {"A": [34, 30, 3, 25, 35, 14, 39, 11, 15, 9, 1, 16, 17, 5, 0, 21, 23, 32, 43, 36, 40, 7], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [35, 32, 5, 30, 36, 15, 40, 14, 16, 11, 3, 17, 21, 7, 1, 23, 25, 34, 0, 39, 43, 9]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l6-s7 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 6 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 22 distinct integers: A = [33, 13, 14, 26, 19, 41, 34, 36, 28, 2, 31, 0, 16, 17, 11, 38, 18, 15, 10, 23, 5, 30] (positions 1..22).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 22}, 0 < |S| < 22) the sums of A... | {"A": [33, 13, 14, 26, 19, 41, 34, 36, 28, 2, 31, 0, 16, 17, 11, 38, 18, 15, 10, 23, 5, 30], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [34, 14, 15, 28, 23, 0, 36, 38, 30, 5, 33, 2, 17, 18, 13, 41, 19, 16, 11, 26, 10, 31]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l6-s8 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 6 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 22 distinct integers: A = [1, 9, 16, 43, 12, 0, 25, 8, 7, 5, 10, 34, 38, 39, 13, 24, 19, 42, 6, 14, 27, 37] (positions 1..22).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 22}, 0 < |S| < 22) the sums of A and... | {"A": [1, 9, 16, 43, 12, 0, 25, 8, 7, 5, 10, 34, 38, 39, 13, 24, 19, 42, 6, 14, 27, 37], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [5, 10, 19, 0, 13, 1, 27, 9, 8, 6, 12, 37, 39, 42, 14, 25, 24, 43, 7, 16, 34, 38]} | 1 |
construct-rlve-distinct-subset-sum-permutation-l6-s9 | construct | rlve_distinct_subset_sum_permutation | cf892d_gluttony | combinatorics | competition | 6 | RLVE-Gym/distinct_array_permutation | MIT | [
"agentic_trivial"
] | You are given an array A of 22 distinct integers: A = [36, 7, 13, 1, 12, 3, 21, 22, 8, 40, 25, 30, 31, 29, 15, 37, 24, 11, 2, 28, 4, 41] (positions 1..22).
Output an array B that is a permutation of A such that for every non-empty proper subset S of positions (S a subset of {1, ..., 22}, 0 < |S| < 22) the sums of A an... | {"A": [36, 7, 13, 1, 12, 3, 21, 22, 8, 40, 25, 30, 31, 29, 15, 37, 24, 11, 2, 28, 4, 41], "family": "rlve_distinct_subset_sum_permutation", "subset": "construct"} | null | null | null | {"B": [37, 8, 15, 2, 13, 4, 22, 24, 11, 41, 28, 31, 36, 30, 21, 40, 25, 12, 3, 29, 7, 1]} | 1 |
construct-rlve-even-degree-partition-l1-s0 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 1 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 5 vertices labelled 0..4 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [1, 2], [1, 3], [1, 4], [2, 3], [2, 4]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero counts as even). One of the grou... | {"n": 5, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [1, 2], [1, 3], [1, 4], [2, 3], [2, 4]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [2, 2, 2, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l1-s1 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 1 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 5 vertices labelled 0..4 and edge list
[[1, 4], [2, 4]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero counts as even). One of the groups may be empty.
Answer format: {"groups": [g_0, ..., g... | {"n": 5, "edges": [[1, 4], [2, 4]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [2, 1, 1, 1, 2]} | 1 |
construct-rlve-even-degree-partition-l1-s2 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 1 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 5 vertices labelled 0..4 and edge list
[[0, 2], [0, 3], [1, 2], [1, 3], [2, 3], [2, 4], [3, 4]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero counts as even). One of the groups may be empty.... | {"n": 5, "edges": [[0, 2], [0, 3], [1, 2], [1, 3], [2, 3], [2, 4], [3, 4]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [1, 1, 1, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l1-s3 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 1 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 5 vertices labelled 0..4 and edge list
[[0, 1], [0, 4], [1, 2], [1, 3], [2, 4], [3, 4]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero counts as even). One of the groups may be empty.
Answer... | {"n": 5, "edges": [[0, 1], [0, 4], [1, 2], [1, 3], [2, 4], [3, 4]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [1, 2, 2, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l1-s4 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 1 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 5 vertices labelled 0..4 and edge list
[[0, 1], [1, 4], [2, 3], [2, 4], [3, 4]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero counts as even). One of the groups may be empty.
Answer format:... | {"n": 5, "edges": [[0, 1], [1, 4], [2, 3], [2, 4], [3, 4]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [1, 2, 1, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l1-s5 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 1 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 5 vertices labelled 0..4 and edge list
[[0, 3], [0, 4], [1, 3], [1, 4], [2, 3], [2, 4]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero counts as even). One of the groups may be empty.
Answer... | {"n": 5, "edges": [[0, 3], [0, 4], [1, 3], [1, 4], [2, 3], [2, 4]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [2, 2, 2, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l1-s6 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 1 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 5 vertices labelled 0..4 and edge list
[[0, 1], [0, 2], [0, 3], [1, 4], [2, 4], [3, 4]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero counts as even). One of the groups may be empty.
Answer... | {"n": 5, "edges": [[0, 1], [0, 2], [0, 3], [1, 4], [2, 4], [3, 4]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [2, 2, 2, 1, 2]} | 1 |
construct-rlve-even-degree-partition-l1-s7 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 1 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 5 vertices labelled 0..4 and edge list
[[0, 2], [0, 3], [0, 4], [2, 3]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero counts as even). One of the groups may be empty.
Answer format: {"group... | {"n": 5, "edges": [[0, 2], [0, 3], [0, 4], [2, 3]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [2, 2, 2, 2, 1]} | 1 |
construct-rlve-even-degree-partition-l1-s8 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 1 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 5 vertices labelled 0..4 and edge list
[[0, 1], [2, 3]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero counts as even). One of the groups may be empty.
Answer format: {"groups": [g_0, ..., g... | {"n": 5, "edges": [[0, 1], [2, 3]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [1, 2, 1, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l1-s9 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 1 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 5 vertices labelled 0..4 and edge list
[[0, 2], [0, 4], [1, 3], [1, 4], [2, 3]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero counts as even). One of the groups may be empty.
Answer format:... | {"n": 5, "edges": [[0, 2], [0, 4], [1, 3], [1, 4], [2, 3]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [2, 2, 2, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l2-s0 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 2 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [1, 4], [1, 7], [2, 3], [2, 6], [2, 7], [4, 5], [5, 7]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero counts a... | {"n": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [1, 4], [1, 7], [2, 3], [2, 6], [2, 7], [4, 5], [5, 7]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [1, 2, 1, 1, 1, 1, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l2-s1 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 2 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [0, 7], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [2, 3], [2, 4], [2, 6], [2, 7], [3, 6], [3, 7], [4, 5], [4, 7], [5, 6], [6, 7]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the numbe... | {"n": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [0, 7], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [2, 3], [2, 4], [2, 6], [2, 7], [3, 6], [3, 7], [4, 5], [4, 7], [5, 6], [6, 7]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [1, 1, 1, 1, 2, 1, 2, 1]} | 1 |
construct-rlve-even-degree-partition-l2-s2 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 2 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 4], [0, 5], [1, 4], [1, 5], [1, 6], [1, 7], [3, 5], [3, 7], [4, 6], [6, 7]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero counts as even).... | {"n": 8, "edges": [[0, 1], [0, 4], [0, 5], [1, 4], [1, 5], [1, 6], [1, 7], [3, 5], [3, 7], [4, 6], [6, 7]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [2, 1, 1, 2, 2, 2, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l2-s3 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 2 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 3], [0, 5], [0, 6], [0, 7], [1, 2], [1, 4], [1, 5], [2, 3], [2, 4], [2, 5], [3, 5], [4, 6], [6, 7]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero ... | {"n": 8, "edges": [[0, 3], [0, 5], [0, 6], [0, 7], [1, 2], [1, 4], [1, 5], [2, 3], [2, 4], [2, 5], [3, 5], [4, 6], [6, 7]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [1, 2, 2, 1, 2, 1, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l2-s4 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 2 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 4], [0, 5], [1, 3], [1, 7], [2, 4], [2, 5], [3, 7]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero counts as even). One of the groups may b... | {"n": 8, "edges": [[0, 1], [0, 4], [0, 5], [1, 3], [1, 7], [2, 4], [2, 5], [3, 7]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [1, 2, 1, 2, 1, 1, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l2-s5 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 2 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 2], [0, 3], [0, 6], [0, 7], [1, 2], [1, 6], [2, 3], [2, 5], [2, 6], [3, 4], [4, 5], [5, 6], [5, 7], [6, 7]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as ... | {"n": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 6], [0, 7], [1, 2], [1, 6], [2, 3], [2, 5], [2, 6], [3, 4], [4, 5], [5, 6], [5, 7], [6, 7]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [2, 1, 1, 1, 1, 1, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l2-s6 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 2 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 2], [0, 5], [1, 3], [1, 4], [1, 5], [1, 7], [3, 4], [3, 5], [4, 5], [4, 6], [5, 7], [6, 7]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero counts a... | {"n": 8, "edges": [[0, 2], [0, 5], [1, 3], [1, 4], [1, 5], [1, 7], [3, 4], [3, 5], [4, 5], [4, 6], [5, 7], [6, 7]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [2, 1, 1, 1, 2, 1, 1, 2]} | 1 |
construct-rlve-even-degree-partition-l2-s7 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 2 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 4], [0, 5], [0, 6], [0, 7], [1, 4], [1, 5], [1, 6], [1, 7], [2, 7], [3, 7], [4, 7], [5, 7], [6, 7]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is eve... | {"n": 8, "edges": [[0, 1], [0, 4], [0, 5], [0, 6], [0, 7], [1, 4], [1, 5], [1, 6], [1, 7], [2, 7], [3, 7], [4, 7], [5, 7], [6, 7]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [1, 1, 1, 1, 1, 1, 1, 2]} | 1 |
construct-rlve-even-degree-partition-l2-s8 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 2 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 2], [0, 3], [0, 5], [0, 6], [1, 2], [1, 6], [2, 3], [2, 4], [4, 6], [5, 6]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is even (zero counts as even). One of ... | {"n": 8, "edges": [[0, 2], [0, 3], [0, 5], [0, 6], [1, 2], [1, 6], [2, 3], [2, 4], [4, 6], [5, 6]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [1, 1, 1, 1, 1, 1, 1, 2]} | 1 |
construct-rlve-even-degree-partition-l2-s9 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 2 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 2], [0, 4], [0, 6], [0, 7], [1, 2], [1, 3], [1, 4], [1, 5], [2, 4], [2, 6], [3, 6], [4, 6], [5, 6], [6, 7]]
Assign every vertex to group 1 or group 2 so that, for every vertex v, the number of neighbours of v lying in the same group as v is eve... | {"n": 8, "edges": [[0, 2], [0, 4], [0, 6], [0, 7], [1, 2], [1, 3], [1, 4], [1, 5], [2, 4], [2, 6], [3, 6], [4, 6], [5, 6], [6, 7]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [2, 2, 2, 2, 2, 2, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l3-s0 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 3 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 1], [0, 5], [0, 6], [0, 8], [0, 9], [0, 11], [1, 2], [1, 3], [1, 5], [1, 6], [1, 10], [2, 5], [2, 7], [2, 8], [2, 9], [3, 4], [3, 5], [3, 7], [3, 9], [4, 10], [5, 6], [5, 9], [6, 7], [6, 9], [7, 8], [7, 9], [8, 9]]
Assign every vertex to grou... | {"n": 12, "edges": [[0, 1], [0, 5], [0, 6], [0, 8], [0, 9], [0, 11], [1, 2], [1, 3], [1, 5], [1, 6], [1, 10], [2, 5], [2, 7], [2, 8], [2, 9], [3, 4], [3, 5], [3, 7], [3, 9], [4, 10], [5, 6], [5, 9], [6, 7], [6, 9], [7, 8], [7, 9], [8, 9]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [1, 2, 1, 2, 2, 1, 1, 1, 1, 1, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l3-s1 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 3 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 1], [0, 3], [0, 4], [0, 8], [0, 9], [0, 10], [0, 11], [1, 3], [1, 5], [1, 6], [1, 8], [1, 9], [2, 3], [2, 7], [2, 10], [2, 11], [3, 5], [3, 7], [3, 8], [3, 9], [3, 10], [4, 6], [4, 10], [5, 6], [5, 8], [5, 10], [5, 11], [6, 7], [6, 8], [6, 9],... | {"n": 12, "edges": [[0, 1], [0, 3], [0, 4], [0, 8], [0, 9], [0, 10], [0, 11], [1, 3], [1, 5], [1, 6], [1, 8], [1, 9], [2, 3], [2, 7], [2, 10], [2, 11], [3, 5], [3, 7], [3, 8], [3, 9], [3, 10], [4, 6], [4, 10], [5, 6], [5, 8], [5, 10], [5, 11], [6, 7], [6, 8], [6, 9], [6, 10], [7, 10], [8, 10], [9, 11]], "family": "rlve... | null | null | null | {"groups": [1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l3-s2 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 3 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 2], [0, 3], [0, 9], [0, 11], [1, 2], [1, 3], [1, 5], [1, 6], [1, 8], [2, 3], [2, 5], [2, 8], [2, 9], [3, 4], [3, 5], [3, 7], [3, 8], [3, 10], [3, 11], [4, 6], [4, 7], [4, 9], [5, 6], [5, 7], [5, 8], [5, 11], [6, 8], [6, 9], [6, 10], [6, 11], [... | {"n": 12, "edges": [[0, 2], [0, 3], [0, 9], [0, 11], [1, 2], [1, 3], [1, 5], [1, 6], [1, 8], [2, 3], [2, 5], [2, 8], [2, 9], [3, 4], [3, 5], [3, 7], [3, 8], [3, 10], [3, 11], [4, 6], [4, 7], [4, 9], [5, 6], [5, 7], [5, 8], [5, 11], [6, 8], [6, 9], [6, 10], [6, 11], [7, 8], [7, 9], [7, 11], [8, 9], [8, 11], [9, 10], [9,... | null | null | null | {"groups": [1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l3-s3 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 3 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 2], [0, 3], [0, 8], [0, 9], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [1, 9], [2, 3], [2, 4], [2, 6], [2, 11], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 11], [4, 6], [4, 7], [4, 9], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [6, 7], [6, ... | {"n": 12, "edges": [[0, 2], [0, 3], [0, 8], [0, 9], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [1, 9], [2, 3], [2, 4], [2, 6], [2, 11], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 11], [4, 6], [4, 7], [4, 9], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [6, 7], [6, 8], [6, 10], [7, 9], [8, 10], [8, 11], [9, 10], [9, 1... | null | null | null | {"groups": [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l3-s4 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 3 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 1], [0, 4], [0, 7], [0, 8], [0, 9], [0, 11], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [1, 8], [1, 11], [2, 4], [2, 7], [2, 8], [2, 10], [3, 5], [3, 6], [3, 9], [3, 10], [3, 11], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [5, 6], [5, 9], [6, 8], [... | {"n": 12, "edges": [[0, 1], [0, 4], [0, 7], [0, 8], [0, 9], [0, 11], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [1, 8], [1, 11], [2, 4], [2, 7], [2, 8], [2, 10], [3, 5], [3, 6], [3, 9], [3, 10], [3, 11], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [5, 6], [5, 9], [6, 8], [6, 9], [7, 8], [7, 9], [7, 10], [7, 11], [8, 9], [8, ... | null | null | null | {"groups": [2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l3-s5 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 3 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [1, 4], [1, 6], [1, 7], [1, 8], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [3, 4], [3, 5], [3, 6], [3, 10], [4, 5], [4, 7], [4, 8], [4... | {"n": 12, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [1, 4], [1, 6], [1, 7], [1, 8], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [3, 4], [3, 5], [3, 6], [3, 10], [4, 5], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [5, 6], [5, 7], [5, 8], [5, 1... | null | null | null | {"groups": [1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l3-s6 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 3 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 2], [0, 4], [0, 5], [0, 9], [0, 10], [1, 2], [1, 3], [1, 6], [1, 9], [1, 10], [1, 11], [2, 5], [2, 6], [2, 7], [2, 10], [2, 11], [3, 4], [3, 5], [3, 8], [3, 10], [4, 5], [4, 6], [4, 7], [5, 6], [5, 10], [5, 11], [6, 7], [6, 10], [6, 11], [7, 9... | {"n": 12, "edges": [[0, 2], [0, 4], [0, 5], [0, 9], [0, 10], [1, 2], [1, 3], [1, 6], [1, 9], [1, 10], [1, 11], [2, 5], [2, 6], [2, 7], [2, 10], [2, 11], [3, 4], [3, 5], [3, 8], [3, 10], [4, 5], [4, 6], [4, 7], [5, 6], [5, 10], [5, 11], [6, 7], [6, 10], [6, 11], [7, 9], [7, 10], [7, 11], [8, 9], [9, 11], [10, 11]], "fam... | null | null | null | {"groups": [1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l3-s7 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 3 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 1], [0, 2], [0, 4], [0, 6], [0, 7], [0, 10], [1, 2], [1, 6], [1, 7], [1, 10], [1, 11], [2, 3], [2, 4], [2, 7], [2, 10], [3, 4], [3, 6], [3, 10], [4, 9], [4, 10], [4, 11], [6, 10], [7, 9], [8, 10], [9, 10], [9, 11], [10, 11]]
Assign every vert... | {"n": 12, "edges": [[0, 1], [0, 2], [0, 4], [0, 6], [0, 7], [0, 10], [1, 2], [1, 6], [1, 7], [1, 10], [1, 11], [2, 3], [2, 4], [2, 7], [2, 10], [3, 4], [3, 6], [3, 10], [4, 9], [4, 10], [4, 11], [6, 10], [7, 9], [8, 10], [9, 10], [9, 11], [10, 11]], "family": "rlve_even_degree_partition", "subset": "construct"} | null | null | null | {"groups": [1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l3-s8 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 3 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 1], [0, 2], [0, 4], [0, 5], [0, 7], [1, 5], [1, 6], [1, 9], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [2, 10], [2, 11], [3, 4], [3, 6], [3, 7], [3, 9], [3, 11], [4, 5], [4, 8], [4, 9], [5, 6], [5, 7], [5, 10], [6, 7], [6, 9], [8, 11], [10, 11]]
... | {"n": 12, "edges": [[0, 1], [0, 2], [0, 4], [0, 5], [0, 7], [1, 5], [1, 6], [1, 9], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [2, 10], [2, 11], [3, 4], [3, 6], [3, 7], [3, 9], [3, 11], [4, 5], [4, 8], [4, 9], [5, 6], [5, 7], [5, 10], [6, 7], [6, 9], [8, 11], [10, 11]], "family": "rlve_even_degree_partition", "subset": "c... | null | null | null | {"groups": [2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1]} | 1 |
construct-rlve-even-degree-partition-l3-s9 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 3 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 1], [0, 2], [0, 4], [0, 5], [0, 7], [0, 8], [0, 9], [0, 11], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [3, 4], [3, 6], [3, 7], [3, 8], [3, 10], [4, 5], [4, 9], [4, 11], [5, 6], [5, 7], [5, ... | {"n": 12, "edges": [[0, 1], [0, 2], [0, 4], [0, 5], [0, 7], [0, 8], [0, 9], [0, 11], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [3, 4], [3, 6], [3, 7], [3, 8], [3, 10], [4, 5], [4, 9], [4, 11], [5, 6], [5, 7], [5, 8], [5, 9], [5, 11], [6, 7], [6, 8], [6, 9], [6, 10],... | null | null | null | {"groups": [2, 2, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2]} | 1 |
construct-rlve-even-degree-partition-l4-s0 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 4 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[0, 3], [0, 6], [0, 9], [0, 15], [0, 16], [0, 17], [1, 2], [1, 3], [1, 6], [1, 8], [1, 12], [1, 16], [1, 17], [2, 3], [2, 5], [2, 8], [2, 9], [2, 13], [2, 16], [2, 17], [3, 4], [3, 6], [3, 7], [3, 8], [3, 9], [3, 11], [3, 12], [3, 13], [3, 15], [3... | {"n": 18, "edges": [[0, 3], [0, 6], [0, 9], [0, 15], [0, 16], [0, 17], [1, 2], [1, 3], [1, 6], [1, 8], [1, 12], [1, 16], [1, 17], [2, 3], [2, 5], [2, 8], [2, 9], [2, 13], [2, 16], [2, 17], [3, 4], [3, 6], [3, 7], [3, 8], [3, 9], [3, 11], [3, 12], [3, 13], [3, 15], [3, 16], [3, 17], [4, 6], [4, 8], [4, 9], [4, 13], [4, ... | null | null | null | {"groups": [2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l4-s1 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 4 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[0, 1], [0, 3], [0, 4], [0, 9], [0, 14], [0, 15], [0, 16], [0, 17], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 12], [1, 15], [2, 4], [2, 5], [2, 12], [2, 16], [3, 7], [3, 9], [3, 11], [3, 12], [3, 14], [3, 15], [3, 17], [4, 8], [4, 10], [5, 6], [... | {"n": 18, "edges": [[0, 1], [0, 3], [0, 4], [0, 9], [0, 14], [0, 15], [0, 16], [0, 17], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 12], [1, 15], [2, 4], [2, 5], [2, 12], [2, 16], [3, 7], [3, 9], [3, 11], [3, 12], [3, 14], [3, 15], [3, 17], [4, 8], [4, 10], [5, 6], [5, 8], [5, 11], [5, 12], [5, 14], [5, 15], [6, 7], [6... | null | null | null | {"groups": [2, 1, 2, 1, 1, 2, 1, 1, 1, 2, 2, 2, 2, 1, 1, 2, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l4-s2 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 4 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[0, 4], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 14], [0, 15], [0, 16], [0, 17], [1, 2], [1, 4], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 14], [1, 15], [1, 16], [1, 17], [2, 3], [2, 4], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], ... | {"n": 18, "edges": [[0, 4], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 14], [0, 15], [0, 16], [0, 17], [1, 2], [1, 4], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 14], [1, 15], [1, 16], [1, 17], [2, 3], [2, 4], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 14], [2, 16], [2, 17], [3, 4], ... | null | null | null | {"groups": [1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l4-s3 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 4 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [1, 14], [1, 15], [2, 4], [2, 10], [2, 16], [3, 6], [3, 7], [3, 9], [3, 11], [3, 14], [3, 15], [4, 16], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 15], [6, 7], [6, 8], [6, 9], [6, 10], [... | {"n": 18, "edges": [[1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [1, 14], [1, 15], [2, 4], [2, 10], [2, 16], [3, 6], [3, 7], [3, 9], [3, 11], [3, 14], [3, 15], [4, 16], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 15], [6, 7], [6, 8], [6, 9], [6, 10], [6, 14], [7, 8], [7, 9], [7, 10], [7, 15], [8, 9], [8,... | null | null | null | {"groups": [2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l4-s4 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 4 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [1, 3], [1, 6], [1, 7], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 17], [2, 6], [2, 11], [2, 12], [3, 7],... | {"n": 18, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [1, 3], [1, 6], [1, 7], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 17], [2, 6], [2, 11], [2, 12], [3, 7], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15]... | null | null | null | {"groups": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l4-s5 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 4 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[0, 1], [0, 3], [0, 8], [0, 9], [0, 11], [0, 14], [0, 17], [1, 4], [1, 8], [1, 11], [1, 15], [1, 16], [1, 17], [2, 8], [2, 13], [2, 14], [2, 15], [3, 4], [3, 5], [3, 15], [3, 16], [4, 6], [4, 9], [4, 11], [4, 15], [4, 17], [5, 15], [6, 7], [6, 13]... | {"n": 18, "edges": [[0, 1], [0, 3], [0, 8], [0, 9], [0, 11], [0, 14], [0, 17], [1, 4], [1, 8], [1, 11], [1, 15], [1, 16], [1, 17], [2, 8], [2, 13], [2, 14], [2, 15], [3, 4], [3, 5], [3, 15], [3, 16], [4, 6], [4, 9], [4, 11], [4, 15], [4, 17], [5, 15], [6, 7], [6, 13], [7, 8], [7, 9], [7, 12], [8, 10], [8, 13], [10, 11]... | null | null | null | {"groups": [1, 1, 2, 1, 1, 2, 2, 2, 2, 1, 2, 1, 1, 2, 1, 1, 1, 1]} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.