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-prefix-product-permutation-l2-s6 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 2 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_47 of the integers 1, 2, ..., 47 such that the 47 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_47 are pairwise distinct modulo 47.
Answer format: {"perm": [p_1, ..., p_47]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.jso... | {"n": 47, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 25, 17, 13, 20, 9, 28, 7, 22, 34, 31, 5, 30, 38, 23, 4, 37, 35, 6, 41, 10, 16, 46, 3, 33, 39, 8, 43, 14, 12, 45, 26, 11, 19, 44, 18, 15, 27, 42, 21, 40, 29, 36, 32, 24, 47]} | 1 |
construct-rlve-prefix-product-permutation-l2-s7 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 2 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_71 of the integers 1, 2, ..., 71 such that the 71 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_71 are pairwise distinct modulo 71.
Answer format: {"perm": [p_1, ..., p_71]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.jso... | {"n": 71, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 37, 25, 19, 58, 13, 62, 10, 9, 65, 14, 7, 12, 67, 20, 41, 47, 5, 16, 33, 45, 43, 35, 4, 55, 42, 51, 34, 50, 46, 56, 21, 29, 24, 70, 3, 49, 44, 52, 17, 27, 23, 39, 22, 31, 18, 69, 38, 30, 28, 40, 57, 68, 26, 32, 53, 6, 61, 66, 59, 8, 64, 63, 11, 60, 15, 54, 48, 36, 71]} | 1 |
construct-rlve-prefix-product-permutation-l2-s8 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 2 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_79 of the integers 1, 2, ..., 79 such that the 79 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_79 are pairwise distinct modulo 79.
Answer format: {"perm": [p_1, ..., p_79]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.jso... | {"n": 79, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 41, 54, 21, 17, 67, 35, 11, 45, 9, 37, 34, 74, 18, 59, 6, 15, 23, 26, 5, 65, 19, 56, 57, 20, 77, 42, 49, 31, 30, 52, 43, 13, 8, 71, 12, 48, 53, 78, 3, 28, 33, 69, 10, 73, 68, 38, 29, 51, 50, 32, 39, 4, 61, 24, 25, 62, 16, 76, 55, 58, 66, 75, 22, 63, 7, 47, 44, 72, 36, 70, 46, 14, 64, 60, 27, 40, 79]} | 1 |
construct-rlve-prefix-product-permutation-l2-s9 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 2 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_53 of the integers 1, 2, ..., 53 such that the 53 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_53 are pairwise distinct modulo 53.
Answer format: {"perm": [p_1, ..., p_53]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.jso... | {"n": 53, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 28, 19, 41, 33, 10, 39, 21, 7, 17, 30, 32, 50, 20, 47, 11, 26, 4, 15, 9, 49, 42, 31, 43, 18, 52, 3, 37, 12, 24, 13, 6, 46, 40, 51, 29, 44, 8, 35, 5, 23, 25, 38, 48, 34, 16, 45, 22, 14, 36, 27, 53]} | 1 |
construct-rlve-prefix-product-permutation-l3-s0 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 3 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_281 of the integers 1, 2, ..., 281 such that the 281 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_281 are pairwise distinct modulo 281.
Answer format: {"perm": [p_1, ..., p_281]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instan... | {"n": 281, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 142, 95, 212, 226, 48, 242, 247, 126, 254, 231, 165, 174, 262, 76, 124, 249, 204, 75, 268, 175, 116, 111, 83, 46, 228, 230, 272, 127, 179, 137, 203, 265, 125, 274, 243, 39, 38, 246, 275, 49, 88, 184, 199, 26, 56, 7, 42, 196, 164, 271, 255, 229, 256, 47, 277, 213, 64, 182, 90, 130, 69, 59, 102, 148, 133,... | 1 |
construct-rlve-prefix-product-permutation-l3-s1 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 3 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_227 of the integers 1, 2, ..., 227 such that the 227 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_227 are pairwise distinct modulo 227.
Answer format: {"perm": [p_1, ..., p_227]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instan... | {"n": 227, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 115, 77, 58, 92, 39, 66, 143, 102, 160, 63, 20, 36, 147, 107, 72, 188, 165, 13, 194, 174, 32, 80, 124, 110, 132, 186, 74, 48, 54, 23, 150, 173, 208, 14, 83, 136, 7, 164, 211, 73, 201, 133, 130, 112, 154, 30, 176, 140, 169, 139, 180, 31, 207, 195, 151, 5, 138, 178, 141, 68, 12, 210, 189, 8, 87, 62, 218, ... | 1 |
construct-rlve-prefix-product-permutation-l3-s2 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 3 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_109 of the integers 1, 2, ..., 109 such that the 109 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_109 are pairwise distinct modulo 109.
Answer format: {"perm": [p_1, ..., p_109]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instan... | {"n": 109, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 56, 74, 83, 23, 92, 79, 42, 98, 12, 11, 101, 43, 40, 81, 76, 78, 104, 24, 61, 27, 6, 20, 51, 49, 22, 106, 75, 95, 41, 103, 93, 77, 94, 82, 107, 57, 67, 15, 31, 9, 14, 72, 58, 64, 65, 59, 26, 90, 25, 63, 66, 73, 108, 3, 38, 45, 48, 86, 21, 85, 52, 46, 47, 53, 39, 97, 102, 80, 96, 44, 54, 4, 29, 17, 34, 1... | 1 |
construct-rlve-prefix-product-permutation-l3-s3 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 3 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_229 of the integers 1, 2, ..., 229 such that the 229 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_229 are pairwise distinct modulo 229.
Answer format: {"perm": [p_1, ..., p_229]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instan... | {"n": 229, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 116, 154, 173, 47, 192, 132, 87, 52, 24, 126, 211, 142, 181, 169, 44, 28, 141, 218, 127, 121, 178, 11, 106, 56, 186, 18, 91, 80, 85, 134, 137, 119, 129, 73, 71, 131, 224, 48, 64, 163, 61, 17, 204, 57, 6, 40, 168, 216, 143, 10, 208, 122, 124, 26, 46, 226, 155, 67, 43, 215, 182, 41, 69, 75, 60, 189, 65, 1... | 1 |
construct-rlve-prefix-product-permutation-l3-s4 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 3 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_149 of the integers 1, 2, ..., 149 such that the 149 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_149 are pairwise distinct modulo 149.
Answer format: {"perm": [p_1, ..., p_149]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instan... | {"n": 149, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 76, 51, 113, 31, 26, 65, 57, 117, 16, 123, 88, 24, 33, 11, 29, 115, 59, 103, 83, 72, 62, 14, 119, 7, 87, 139, 17, 37, 6, 126, 15, 141, 58, 133, 30, 146, 52, 108, 42, 41, 111, 53, 106, 54, 82, 131, 60, 74, 4, 39, 44, 46, 70, 85, 9, 35, 19, 49, 78, 23, 138, 124, 8, 95, 71, 130, 104, 55, 67, 22, 90, 50, 14... | 1 |
construct-rlve-prefix-product-permutation-l3-s5 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 3 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_241 of the integers 1, 2, ..., 241 such that the 241 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_241 are pairwise distinct modulo 241.
Answer format: {"perm": [p_1, ..., p_241]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instan... | {"n": 241, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 122, 162, 182, 194, 202, 70, 212, 135, 218, 23, 222, 205, 156, 226, 227, 157, 68, 204, 230, 24, 12, 22, 232, 136, 103, 126, 199, 134, 234, 71, 114, 169, 79, 63, 155, 229, 223, 69, 236, 195, 133, 214, 127, 76, 132, 201, 237, 183, 189, 53, 52, 192, 184, 150, 100, 149, 188, 193, 238, 163, 36, 89, 178, 90, ... | 1 |
construct-rlve-prefix-product-permutation-l3-s6 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 3 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_211 of the integers 1, 2, ..., 211 such that the 211 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_211 are pairwise distinct modulo 211.
Answer format: {"perm": [p_1, ..., p_211]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instan... | {"n": 211, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 107, 142, 54, 170, 177, 182, 133, 48, 191, 97, 89, 66, 197, 198, 67, 150, 130, 101, 96, 202, 49, 157, 45, 77, 139, 87, 99, 132, 205, 178, 34, 33, 181, 206, 171, 155, 51, 93, 154, 176, 207, 55, 25, 137, 79, 10, 23, 57, 39, 121, 70, 5, 44, 189, 50, 175, 172, 94, 103, 129, 195, 68, 123, 14, 17, 64, 91, 53,... | 1 |
construct-rlve-prefix-product-permutation-l3-s7 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 3 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_191 of the integers 1, 2, ..., 191 such that the 191 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_191 are pairwise distinct modulo 191.
Answer format: {"perm": [p_1, ..., p_191]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instan... | {"n": 191, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 97, 65, 49, 154, 33, 83, 25, 86, 173, 140, 17, 148, 42, 52, 13, 46, 139, 182, 87, 92, 166, 109, 9, 108, 170, 93, 117, 113, 122, 38, 7, 111, 119, 132, 70, 32, 187, 50, 44, 15, 142, 41, 179, 18, 55, 127, 5, 40, 150, 16, 181, 174, 47, 67, 59, 125, 57, 69, 157, 120, 115, 95, 4, 145, 56, 135, 60, 37, 162, 11... | 1 |
construct-rlve-prefix-product-permutation-l3-s8 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 3 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_223 of the integers 1, 2, ..., 223 such that the 223 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_223 are pairwise distinct modulo 223.
Answer format: {"perm": [p_1, ..., p_223]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instan... | {"n": 223, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 113, 150, 57, 135, 187, 33, 29, 125, 68, 143, 94, 104, 17, 120, 15, 106, 63, 48, 146, 86, 72, 98, 159, 117, 164, 191, 9, 101, 172, 37, 8, 197, 165, 52, 32, 218, 136, 184, 185, 137, 155, 84, 148, 115, 161, 20, 80, 133, 59, 36, 194, 102, 96, 74, 5, 91, 51, 190, 198, 118, 19, 178, 116, 200, 99, 11, 83, 182... | 1 |
construct-rlve-prefix-product-permutation-l3-s9 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 3 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_197 of the integers 1, 2, ..., 197 such that the 197 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_197 are pairwise distinct modulo 197.
Answer format: {"perm": [p_1, ..., p_197]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instan... | {"n": 197, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 100, 67, 149, 80, 34, 170, 75, 23, 139, 19, 116, 92, 184, 93, 38, 59, 12, 84, 70, 123, 10, 61, 157, 135, 145, 74, 191, 35, 47, 90, 118, 7, 30, 153, 105, 17, 141, 97, 134, 174, 62, 56, 104, 163, 31, 110, 79, 194, 68, 86, 73, 172, 136, 44, 96, 160, 18, 188, 24, 43, 144, 173, 158, 98, 4, 51, 114, 21, 77, 1... | 1 |
construct-rlve-prefix-product-permutation-l4-s0 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 4 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_701 of the integers 1, 2, ..., 701 such that the 701 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_701 are pairwise distinct modulo 701.
Answer format: {"perm": [p_1, ..., p_701]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instan... | {"n": 701, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 352, 235, 527, 562, 118, 602, 264, 79, 632, 256, 410, 55, 652, 188, 483, 166, 40, 370, 667, 435, 479, 62, 556, 674, 28, 27, 677, 557, 445, 295, 242, 86, 434, 682, 371, 361, 536, 19, 334, 172, 218, 539, 240, 297, 382, 180, 629, 187, 688, 56, 365, 292, 14, 52, 339, 124, 279, 203, 223, 24, 148, 613, 472, 1... | 1 |
construct-rlve-prefix-product-permutation-l4-s1 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 4 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_457 of the integers 1, 2, ..., 457 such that the 457 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_457 are pairwise distinct modulo 457.
Answer format: {"perm": [p_1, ..., p_457]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instan... | {"n": 457, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 230, 306, 344, 184, 382, 197, 401, 255, 321, 375, 420, 212, 99, 62, 201, 243, 128, 434, 161, 371, 188, 160, 439, 129, 335, 238, 50, 395, 260, 60, 101, 278, 122, 223, 293, 211, 446, 376, 81, 380, 186, 373, 323, 326, 309, 283, 220, 29, 65, 234, 168, 70, 348, 350, 254, 450, 198, 32, 359, 16, 259, 429, 51, ... | 1 |
construct-rlve-prefix-product-permutation-l4-s2 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 4 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_1297 of the integers 1, 2, ..., 1297 such that the 1297 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_1297 are pairwise distinct modulo 1297.
Answer format: {"perm": [p_1, ..., p_1297]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 1297, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 650, 866, 974, 520, 1082, 557, 1136, 1154, 909, 119, 1190, 899, 279, 174, 1217, 764, 1226, 1025, 455, 1051, 60, 283, 1244, 883, 450, 1250, 140, 493, 736, 1047, 609, 905, 1031, 631, 1262, 632, 513, 1165, 228, 349, 526, 182, 679, 491, 142, 139, 1271, 451, 442, 1120, 874, 882, 1274, 284, 719, 1207, 247, 23... | 1 |
construct-rlve-prefix-product-permutation-l4-s3 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 4 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_1093 of the integers 1, 2, ..., 1093 such that the 1093 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_1093 are pairwise distinct modulo 1093.
Answer format: {"perm": [p_1, ..., p_1093]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 1093, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 548, 730, 821, 657, 912, 938, 411, 244, 329, 796, 1003, 1010, 1016, 584, 206, 644, 669, 979, 165, 1042, 945, 999, 502, 788, 1052, 82, 1055, 491, 839, 953, 650, 266, 869, 407, 335, 710, 490, 1066, 83, 81, 1068, 789, 473, 924, 500, 1001, 798, 291, 941, 944, 1073, 166, 588, 160, 528, 327, 246, 353, 420, 87... | 1 |
construct-rlve-prefix-product-permutation-l4-s4 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 4 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_1487 of the integers 1, 2, ..., 1487 such that the 1487 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_1487 are pairwise distinct modulo 1487.
Answer format: {"perm": [p_1, ..., p_1487]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 1487, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 745, 497, 373, 596, 249, 426, 187, 662, 1042, 677, 125, 573, 957, 695, 94, 176, 1075, 1175, 1265, 1134, 339, 195, 63, 120, 287, 717, 479, 924, 348, 49, 791, 722, 832, 86, 538, 845, 588, 1183, 633, 944, 1311, 416, 170, 728, 98, 1140, 32, 699, 804, 555, 144, 983, 359, 731, 240, 888, 1206, 1362, 918, 1293,... | 1 |
construct-rlve-prefix-product-permutation-l4-s5 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 4 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_733 of the integers 1, 2, ..., 733 such that the 733 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_733 are pairwise distinct modulo 733.
Answer format: {"perm": [p_1, ..., p_733]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instan... | {"n": 733, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 368, 490, 551, 441, 612, 420, 276, 164, 221, 201, 673, 283, 577, 392, 505, 346, 449, 464, 111, 385, 101, 256, 337, 89, 142, 544, 289, 456, 563, 403, 253, 312, 540, 378, 225, 318, 599, 95, 56, 591, 193, 359, 51, 620, 495, 79, 169, 375, 45, 116, 438, 84, 639, 41, 145, 644, 595, 411, 282, 722, 202, 129, 12... | 1 |
construct-rlve-prefix-product-permutation-l4-s6 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 4 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_1693 of the integers 1, 2, ..., 1693 such that the 1693 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_1693 are pairwise distinct modulo 1693.
Answer format: {"perm": [p_1, ..., p_1693]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 1693, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 848, 1130, 1271, 1017, 1412, 243, 636, 1506, 509, 155, 1553, 522, 122, 904, 1165, 499, 1600, 803, 255, 646, 78, 1326, 777, 1220, 1108, 1067, 908, 1227, 1299, 711, 583, 1181, 250, 388, 1647, 1511, 402, 739, 128, 703, 1170, 316, 886, 302, 1510, 1658, 389, 1003, 1457, 167, 1401, 576, 534, 709, 1301, 1397, ... | 1 |
construct-rlve-prefix-product-permutation-l4-s7 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 4 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_1013 of the integers 1, 2, ..., 1013 such that the 1013 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_1013 are pairwise distinct modulo 1013.
Answer format: {"perm": [p_1, ..., p_1013]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 1013, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 508, 339, 761, 609, 170, 580, 381, 789, 305, 922, 592, 79, 797, 879, 191, 299, 395, 161, 153, 194, 968, 970, 803, 933, 40, 939, 399, 525, 440, 916, 96, 308, 150, 522, 198, 795, 81, 27, 77, 594, 604, 802, 991, 969, 992, 195, 402, 952, 467, 438, 527, 842, 470, 793, 200, 392, 263, 911, 727, 466, 965, 403, ... | 1 |
construct-rlve-prefix-product-permutation-l4-s8 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 4 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_1871 of the integers 1, 2, ..., 1871 such that the 1871 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_1871 are pairwise distinct modulo 1871.
Answer format: {"perm": [p_1, ..., p_1871]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 1871, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 937, 625, 469, 1498, 313, 803, 235, 209, 1685, 1702, 157, 145, 402, 500, 118, 1762, 105, 198, 843, 892, 1787, 1628, 79, 1423, 73, 694, 1137, 1743, 1186, 846, 995, 568, 1817, 1284, 53, 355, 1035, 49, 422, 503, 1382, 1785, 894, 791, 1750, 837, 40, 1452, 712, 588, 37, 1519, 1283, 1838, 569, 1314, 872, 223,... | 1 |
construct-rlve-prefix-product-permutation-l4-s9 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 4 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_601 of the integers 1, 2, ..., 601 such that the 601 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_601 are pairwise distinct modulo 601.
Answer format: {"perm": [p_1, ..., p_601]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instan... | {"n": 601, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 302, 402, 452, 482, 502, 87, 527, 335, 542, 165, 552, 186, 44, 562, 264, 496, 168, 349, 572, 230, 83, 393, 577, 578, 394, 513, 323, 229, 582, 350, 433, 256, 549, 499, 385, 66, 175, 263, 587, 45, 416, 15, 42, 188, 197, 423, 289, 185, 590, 166, 498, 568, 257, 154, 162, 117, 115, 164, 592, 336, 476, 478, 2... | 1 |
construct-rlve-prefix-product-permutation-l5-s0 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 5 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_9463 of the integers 1, 2, ..., 9463 such that the 9463 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_9463 are pairwise distinct modulo 9463.
Answer format: {"perm": [p_1, ..., p_9463]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 9463, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 4733, 6310, 2367, 5679, 7887, 1353, 1184, 2104, 2840, 6023, 3944, 729, 677, 5048, 5324, 1671, 5784, 8966, 6152, 3606, 3012, 6584, 6704, 8707, 365, 702, 339, 5222, 7256, 8243, 7394, 8317, 836, 2164, 7624, 8441, 9215, 3398, 7808, 8310, 6535, 3082, 6238, 7992, 8024, 8860, 8084, 1546, 4354, 3712, 183, 7500,... | 1 |
construct-rlve-prefix-product-permutation-l5-s1 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 5 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_6469 of the integers 1, 2, ..., 6469 such that the 6469 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_6469 are pairwise distinct modulo 6469.
Answer format: {"perm": [p_1, ..., p_6469]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 6469, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 3236, 4314, 4853, 1295, 5392, 5546, 2427, 3595, 648, 5882, 5931, 3982, 6008, 4745, 1214, 5709, 1798, 682, 3559, 6162, 6176, 5345, 2966, 5435, 5226, 1199, 6239, 3124, 2373, 5844, 3842, 6274, 2855, 1110, 4134, 5421, 3576, 1328, 1780, 5050, 6316, 1355, 6323, 5895, 2673, 4956, 4718, 6338, 2718, 4060, 5848, ... | 1 |
construct-rlve-prefix-product-permutation-l5-s2 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 5 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_6277 of the integers 1, 2, ..., 6277 such that the 6277 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_6277 are pairwise distinct modulo 6277.
Answer format: {"perm": [p_1, ..., p_6277]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 6277, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 3140, 4186, 4709, 2512, 5232, 3588, 2355, 1396, 4395, 1713, 5755, 3381, 4933, 838, 1178, 1478, 3837, 2644, 2198, 3289, 857, 3276, 2878, 3014, 1691, 466, 2467, 4330, 3558, 406, 3728, 2664, 3878, 5740, 1919, 3394, 4461, 3220, 4238, 1532, 1645, 147, 429, 280, 4777, 1203, 4578, 4997, 4646, 4678, 846, 2725, ... | 1 |
construct-rlve-prefix-product-permutation-l5-s3 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 5 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_2237 of the integers 1, 2, ..., 2237 such that the 2237 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_2237 are pairwise distinct modulo 2237.
Answer format: {"perm": [p_1, ..., p_2237]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 2237, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 1120, 747, 1679, 896, 374, 1599, 840, 1741, 1567, 1628, 1306, 2066, 800, 1045, 1539, 659, 871, 472, 784, 2025, 1933, 1849, 1772, 180, 2152, 581, 1519, 541, 523, 434, 770, 1289, 330, 768, 436, 787, 1355, 1435, 1511, 874, 1013, 2186, 967, 349, 925, 239, 2005, 1188, 1209, 966, 2195, 1014, 291, 2116, 760, 1... | 1 |
construct-rlve-prefix-product-permutation-l5-s4 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 5 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_5009 of the integers 1, 2, ..., 5009 such that the 5009 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_5009 are pairwise distinct modulo 5009.
Answer format: {"perm": [p_1, ..., p_5009]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 5009, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 2506, 1671, 3758, 1003, 836, 3579, 4384, 3897, 502, 3644, 2923, 1157, 1790, 335, 4697, 885, 1949, 2901, 2756, 4533, 4327, 3050, 1462, 2205, 579, 4639, 3400, 1901, 168, 1940, 2349, 2885, 443, 3722, 975, 3927, 1451, 2056, 3883, 4277, 2267, 234, 2164, 1782, 4030, 4264, 3236, 4090, 1103, 3635, 290, 4821, 23... | 1 |
construct-rlve-prefix-product-permutation-l5-s5 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 5 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_5347 of the integers 1, 2, ..., 5347 such that the 5347 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_5347 are pairwise distinct modulo 5347.
Answer format: {"perm": [p_1, ..., p_5347]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 5347, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 2675, 3566, 1338, 2140, 4457, 765, 3343, 4754, 3744, 4862, 2229, 1235, 383, 714, 1672, 4719, 5051, 1971, 4546, 2038, 5105, 466, 1115, 3637, 618, 5150, 192, 3873, 3031, 346, 3510, 5186, 2360, 3362, 2526, 5059, 986, 3977, 4947, 1566, 3693, 2488, 2553, 2021, 2907, 3414, 558, 874, 1819, 3356, 2983, 909, 524... | 1 |
construct-rlve-prefix-product-permutation-l5-s6 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 5 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_4801 of the integers 1, 2, ..., 4801 such that the 4801 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_4801 are pairwise distinct modulo 4801.
Answer format: {"perm": [p_1, ..., p_4801]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 4801, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 2402, 3202, 3602, 3842, 4002, 687, 4202, 1068, 4322, 874, 4402, 1109, 344, 4482, 4502, 3390, 2935, 4044, 4562, 1830, 2838, 836, 4602, 4610, 555, 1957, 2573, 1491, 4642, 1240, 4652, 292, 4096, 3979, 1468, 4283, 4423, 3571, 4682, 1172, 3316, 2569, 3820, 3095, 2819, 2044, 4702, 99, 4706, 2731, 278, 3715, 9... | 1 |
construct-rlve-prefix-product-permutation-l5-s7 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 5 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_6373 of the integers 1, 2, ..., 6373 such that the 6373 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_6373 are pairwise distinct modulo 6373.
Answer format: {"perm": [p_1, ..., p_6373]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 6373, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 3188, 4250, 4781, 3825, 5312, 1822, 2391, 5666, 1913, 4636, 5843, 1962, 4098, 3400, 1196, 3375, 6020, 2349, 957, 608, 5505, 3049, 2922, 3315, 4168, 6138, 5236, 5495, 4887, 2468, 3785, 1546, 1688, 4189, 6197, 690, 1175, 2779, 479, 3887, 3491, 2817, 2753, 1134, 1525, 679, 4648, 2082, 1658, 3250, 5271, 482... | 1 |
construct-rlve-prefix-product-permutation-l5-s8 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 5 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_5717 of the integers 1, 2, ..., 5717 such that the 5717 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_5717 are pairwise distinct modulo 5717.
Answer format: {"perm": [p_1, ..., p_5717]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 5717, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 2860, 1907, 4289, 2288, 954, 3268, 2145, 2542, 4003, 2080, 3336, 3959, 4493, 2669, 1073, 3364, 4130, 3010, 2002, 1090, 3899, 1741, 4527, 5032, 1980, 848, 2247, 1381, 1335, 3505, 537, 694, 4541, 5228, 4924, 5409, 4364, 3226, 3860, 3487, 3404, 2926, 1950, 2796, 871, 4380, 2264, 5368, 5375, 1122, 3849, 410... | 1 |
construct-rlve-prefix-product-permutation-l5-s9 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 5 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_7883 of the integers 1, 2, ..., 7883 such that the 7883 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_7883 are pairwise distinct modulo 7883.
Answer format: {"perm": [p_1, ..., p_7883]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/... | {"n": 7883, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 3943, 2629, 1972, 4731, 1315, 6758, 4928, 877, 2366, 2151, 658, 3033, 7321, 6833, 6406, 3247, 439, 4150, 5125, 4881, 1076, 1372, 4271, 947, 1517, 293, 3661, 1632, 3417, 6104, 7145, 5973, 1624, 2929, 220, 3836, 6017, 6267, 2563, 5000, 2441, 551, 4480, 4906, 4628, 4865, 2136, 6597, 474, 1083, 759, 2827, 1... | 1 |
construct-rlve-prefix-product-permutation-l6-s0 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 6 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_26497 of the integers 1, 2, ..., 26497 such that the 26497 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_26497 are pairwise distinct modulo 26497.
Answer format: {"perm": [p_1, ..., p_26497]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/wo... | {"n": 26497, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 13250, 17666, 19874, 10600, 22082, 11357, 23186, 23554, 18549, 14454, 24290, 8154, 5679, 3534, 24842, 4677, 25026, 16736, 9275, 21451, 20476, 25346, 25394, 18019, 17326, 7852, 2840, 11879, 15016, 3420, 25670, 13651, 2339, 12871, 25762, 15756, 21617, 11551, 4638, 16804, 10726, 11709, 23487, 10011, 25922,... | 1 |
construct-rlve-prefix-product-permutation-l6-s1 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 6 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_18593 of the integers 1, 2, ..., 18593 such that the 18593 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_18593 are pairwise distinct modulo 18593.
Answer format: {"perm": [p_1, ..., p_18593]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/wo... | {"n": 18593, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 9298, 6199, 13946, 11157, 3100, 15938, 16270, 2067, 5579, 11833, 10847, 5722, 17266, 16115, 17432, 7657, 1034, 11744, 2790, 11511, 5917, 4043, 5424, 13388, 12158, 13085, 17930, 4489, 8058, 5399, 18013, 3945, 3829, 6907, 9814, 17589, 15169, 1908, 10692, 908, 5756, 2163, 2959, 11570, 2022, 1979, 12009, 75... | 1 |
construct-rlve-prefix-product-permutation-l6-s2 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 6 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_22621 of the integers 1, 2, ..., 22621 such that the 22621 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_22621 are pairwise distinct modulo 22621.
Answer format: {"perm": [p_1, ..., p_22621]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/wo... | {"n": 22621, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 11312, 15082, 16967, 18098, 18852, 16159, 8484, 5028, 20360, 4114, 20737, 20882, 8080, 21114, 15553, 3993, 13825, 14288, 21491, 5387, 13368, 20655, 10369, 17193, 21752, 9217, 15351, 21842, 21868, 5109, 7777, 1372, 1997, 12281, 6913, 17731, 18455, 22042, 10746, 8277, 2694, 7366, 17995, 14579, 10328, 4814... | 1 |
construct-rlve-prefix-product-permutation-l6-s3 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 6 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_12011 of the integers 1, 2, ..., 12011 such that the 12011 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_12011 are pairwise distinct modulo 12011.
Answer format: {"perm": [p_1, ..., p_12011]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/wo... | {"n": 12011, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 6007, 4005, 3004, 9610, 2003, 1717, 7508, 9343, 10811, 1093, 1002, 925, 859, 3204, 9760, 10599, 4672, 3794, 5406, 573, 547, 4701, 6507, 4325, 463, 3115, 430, 9527, 7608, 4263, 10886, 365, 5300, 9953, 8342, 2598, 7903, 309, 8709, 6153, 287, 839, 274, 9076, 2351, 2301, 3254, 1962, 2163, 11541, 232, 1814, ... | 1 |
construct-rlve-prefix-product-permutation-l6-s4 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 6 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_22391 of the integers 1, 2, ..., 22391 such that the 22391 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_22391 are pairwise distinct modulo 22391.
Answer format: {"perm": [p_1, ..., p_22391]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/wo... | {"n": 22391, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 11197, 7465, 5599, 17914, 3733, 12796, 2800, 2489, 20153, 18321, 1867, 8613, 17594, 5972, 12596, 10538, 1245, 2358, 10077, 4266, 9161, 20445, 934, 12540, 4307, 8294, 19993, 14671, 14182, 17336, 17494, 21035, 16465, 2560, 623, 3632, 12375, 17799, 5039, 4370, 13329, 9374, 4581, 9455, 10223, 20010, 11663, ... | 1 |
construct-rlve-prefix-product-permutation-l6-s5 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 6 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_29921 of the integers 1, 2, ..., 29921 such that the 29921 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_29921 are pairwise distinct modulo 29921.
Answer format: {"perm": [p_1, ..., p_29921]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/wo... | {"n": 29921, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 14962, 9975, 22442, 23938, 4988, 8550, 26182, 23273, 26930, 27202, 17455, 18414, 19236, 7980, 28052, 28162, 11637, 7875, 28426, 22798, 28562, 15612, 8728, 22741, 24168, 17732, 24579, 25795, 18951, 4827, 28987, 9068, 29042, 7695, 5819, 27496, 3938, 26086, 29174, 23354, 26360, 25747, 29242, 22608, 22767, ... | 1 |
construct-rlve-prefix-product-permutation-l6-s6 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 6 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_21247 of the integers 1, 2, ..., 21247 such that the 21247 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_21247 are pairwise distinct modulo 21247.
Answer format: {"perm": [p_1, ..., p_21247]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/wo... | {"n": 21247, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 10625, 14166, 5313, 8500, 17707, 9107, 2657, 11805, 14874, 17385, 8854, 8173, 4554, 2834, 1329, 7500, 5903, 16775, 18061, 17201, 8693, 12934, 15051, 14449, 4087, 11018, 12901, 2199, 12041, 12338, 665, 12878, 14374, 10321, 2952, 2298, 8388, 2725, 9031, 4665, 8601, 8401, 4347, 15110, 17091, 14015, 7526, 1... | 1 |
construct-rlve-prefix-product-permutation-l6-s7 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 6 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_19531 of the integers 1, 2, ..., 19531 such that the 19531 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_19531 are pairwise distinct modulo 19531.
Answer format: {"perm": [p_1, ..., p_19531]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/wo... | {"n": 19531, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 9767, 13022, 4884, 15626, 16277, 16742, 12208, 17362, 17579, 15981, 8139, 7513, 18137, 18230, 15870, 10341, 18447, 1029, 8790, 18602, 7991, 14437, 4070, 3126, 3757, 5788, 9069, 1348, 18881, 18902, 17701, 11838, 5171, 18974, 9224, 7919, 515, 2505, 14161, 14292, 19067, 8631, 3996, 19098, 7219, 3741, 11801... | 1 |
construct-rlve-prefix-product-permutation-l6-s8 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 6 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_12713 of the integers 1, 2, ..., 12713 such that the 12713 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_12713 are pairwise distinct modulo 12713.
Answer format: {"perm": [p_1, ..., p_12713]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/wo... | {"n": 12713, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 6358, 4239, 9536, 7629, 2120, 10898, 11125, 9889, 3815, 4624, 7417, 979, 11806, 11019, 5563, 4488, 4945, 6023, 1908, 7871, 8669, 2212, 3709, 11697, 490, 3297, 12260, 9207, 5510, 4102, 2782, 1542, 8601, 4723, 2473, 1719, 3012, 327, 7311, 8373, 3936, 6801, 4335, 12149, 7463, 542, 1855, 5190, 5849, 9972, 6... | 1 |
construct-rlve-prefix-product-permutation-l6-s9 | construct | rlve_prefix_product_permutation | cf487c_prefix_product_sequence | number_theory | competition | 6 | RLVE-Gym/prefix_product_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_27109 of the integers 1, 2, ..., 27109 such that the 27109 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_27109 are pairwise distinct modulo 27109.
Answer format: {"perm": [p_1, ..., p_27109]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/wo... | {"n": 27109, "family": "rlve_prefix_product_permutation", "subset": "construct"} | null | null | null | {"perm": [1, 2, 13556, 18074, 20333, 5423, 22592, 15492, 10167, 24098, 2712, 4930, 24851, 6257, 21301, 19881, 5084, 4785, 25604, 7135, 14911, 14201, 16020, 3537, 12426, 11929, 3129, 26106, 10651, 4675, 9941, 1750, 16097, 1644, 2393, 8521, 26357, 24912, 3568, 20159, 7456, 3307, 7101, 5675, 21565, 15664, 1769, 19035, 197... | 1 |
construct-rlve-prefix-sum-permutation-l1-s0 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 1 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_26 of the integers 1, 2, ..., 26 such that the 26 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_26 are pairwise distinct modulo 26.
Answer format: {"perm": [p_1, ..., p_26]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 26, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [26, 1, 24, 3, 22, 5, 20, 7, 18, 9, 16, 11, 14, 13, 12, 15, 10, 17, 8, 19, 6, 21, 4, 23, 2, 25]} | 1 |
construct-rlve-prefix-sum-permutation-l1-s1 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 1 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_20 of the integers 1, 2, ..., 20 such that the 20 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_20 are pairwise distinct modulo 20.
Answer format: {"perm": [p_1, ..., p_20]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 20, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [20, 1, 18, 3, 16, 5, 14, 7, 12, 9, 10, 11, 8, 13, 6, 15, 4, 17, 2, 19]} | 1 |
construct-rlve-prefix-sum-permutation-l1-s2 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 1 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_18 of the integers 1, 2, ..., 18 such that the 18 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_18 are pairwise distinct modulo 18.
Answer format: {"perm": [p_1, ..., p_18]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 18, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [18, 1, 16, 3, 14, 5, 12, 7, 10, 9, 8, 11, 6, 13, 4, 15, 2, 17]} | 1 |
construct-rlve-prefix-sum-permutation-l1-s3 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 1 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_22 of the integers 1, 2, ..., 22 such that the 22 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_22 are pairwise distinct modulo 22.
Answer format: {"perm": [p_1, ..., p_22]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 22, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [22, 1, 20, 3, 18, 5, 16, 7, 14, 9, 12, 11, 10, 13, 8, 15, 6, 17, 4, 19, 2, 21]} | 1 |
construct-rlve-prefix-sum-permutation-l1-s4 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 1 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_4 of the integers 1, 2, ..., 4 such that the 4 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_4 are pairwise distinct modulo 4.
Answer format: {"perm": [p_1, ..., p_4]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `... | {"n": 4, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [4, 1, 2, 3]} | 1 |
construct-rlve-prefix-sum-permutation-l1-s5 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 1 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_6 of the integers 1, 2, ..., 6 such that the 6 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_6 are pairwise distinct modulo 6.
Answer format: {"perm": [p_1, ..., p_6]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `... | {"n": 6, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [6, 1, 4, 3, 2, 5]} | 1 |
construct-rlve-prefix-sum-permutation-l1-s6 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 1 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_16 of the integers 1, 2, ..., 16 such that the 16 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_16 are pairwise distinct modulo 16.
Answer format: {"perm": [p_1, ..., p_16]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 16, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [16, 1, 14, 3, 12, 5, 10, 7, 8, 9, 6, 11, 4, 13, 2, 15]} | 1 |
construct-rlve-prefix-sum-permutation-l1-s7 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 1 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_14 of the integers 1, 2, ..., 14 such that the 14 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_14 are pairwise distinct modulo 14.
Answer format: {"perm": [p_1, ..., p_14]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 14, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [14, 1, 12, 3, 10, 5, 8, 7, 6, 9, 4, 11, 2, 13]} | 1 |
construct-rlve-prefix-sum-permutation-l1-s8 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 1 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_30 of the integers 1, 2, ..., 30 such that the 30 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_30 are pairwise distinct modulo 30.
Answer format: {"perm": [p_1, ..., p_30]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 30, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [30, 1, 28, 3, 26, 5, 24, 7, 22, 9, 20, 11, 18, 13, 16, 15, 14, 17, 12, 19, 10, 21, 8, 23, 6, 25, 4, 27, 2, 29]} | 1 |
construct-rlve-prefix-sum-permutation-l1-s9 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 1 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_28 of the integers 1, 2, ..., 28 such that the 28 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_28 are pairwise distinct modulo 28.
Answer format: {"perm": [p_1, ..., p_28]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 28, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [28, 1, 26, 3, 24, 5, 22, 7, 20, 9, 18, 11, 16, 13, 14, 15, 12, 17, 10, 19, 8, 21, 6, 23, 4, 25, 2, 27]} | 1 |
construct-rlve-prefix-sum-permutation-l2-s0 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 2 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_40 of the integers 1, 2, ..., 40 such that the 40 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_40 are pairwise distinct modulo 40.
Answer format: {"perm": [p_1, ..., p_40]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 40, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [40, 1, 38, 3, 36, 5, 34, 7, 32, 9, 30, 11, 28, 13, 26, 15, 24, 17, 22, 19, 20, 21, 18, 23, 16, 25, 14, 27, 12, 29, 10, 31, 8, 33, 6, 35, 4, 37, 2, 39]} | 1 |
construct-rlve-prefix-sum-permutation-l2-s1 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 2 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_94 of the integers 1, 2, ..., 94 such that the 94 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_94 are pairwise distinct modulo 94.
Answer format: {"perm": [p_1, ..., p_94]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 94, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [94, 1, 92, 3, 90, 5, 88, 7, 86, 9, 84, 11, 82, 13, 80, 15, 78, 17, 76, 19, 74, 21, 72, 23, 70, 25, 68, 27, 66, 29, 64, 31, 62, 33, 60, 35, 58, 37, 56, 39, 54, 41, 52, 43, 50, 45, 48, 47, 46, 49, 44, 51, 42, 53, 40, 55, 38, 57, 36, 59, 34, 61, 32, 63, 30, 65, 28, 67, 26, 69, 24, 71, 22, 73, 20, 75, 18, 77, 16,... | 1 |
construct-rlve-prefix-sum-permutation-l2-s2 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 2 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_70 of the integers 1, 2, ..., 70 such that the 70 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_70 are pairwise distinct modulo 70.
Answer format: {"perm": [p_1, ..., p_70]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 70, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [70, 1, 68, 3, 66, 5, 64, 7, 62, 9, 60, 11, 58, 13, 56, 15, 54, 17, 52, 19, 50, 21, 48, 23, 46, 25, 44, 27, 42, 29, 40, 31, 38, 33, 36, 35, 34, 37, 32, 39, 30, 41, 28, 43, 26, 45, 24, 47, 22, 49, 20, 51, 18, 53, 16, 55, 14, 57, 12, 59, 10, 61, 8, 63, 6, 65, 4, 67, 2, 69]} | 1 |
construct-rlve-prefix-sum-permutation-l2-s3 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 2 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_98 of the integers 1, 2, ..., 98 such that the 98 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_98 are pairwise distinct modulo 98.
Answer format: {"perm": [p_1, ..., p_98]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 98, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [98, 1, 96, 3, 94, 5, 92, 7, 90, 9, 88, 11, 86, 13, 84, 15, 82, 17, 80, 19, 78, 21, 76, 23, 74, 25, 72, 27, 70, 29, 68, 31, 66, 33, 64, 35, 62, 37, 60, 39, 58, 41, 56, 43, 54, 45, 52, 47, 50, 49, 48, 51, 46, 53, 44, 55, 42, 57, 40, 59, 38, 61, 36, 63, 34, 65, 32, 67, 30, 69, 28, 71, 26, 73, 24, 75, 22, 77, 20,... | 1 |
construct-rlve-prefix-sum-permutation-l2-s4 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 2 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_42 of the integers 1, 2, ..., 42 such that the 42 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_42 are pairwise distinct modulo 42.
Answer format: {"perm": [p_1, ..., p_42]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 42, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [42, 1, 40, 3, 38, 5, 36, 7, 34, 9, 32, 11, 30, 13, 28, 15, 26, 17, 24, 19, 22, 21, 20, 23, 18, 25, 16, 27, 14, 29, 12, 31, 10, 33, 8, 35, 6, 37, 4, 39, 2, 41]} | 1 |
construct-rlve-prefix-sum-permutation-l2-s5 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 2 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_36 of the integers 1, 2, ..., 36 such that the 36 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_36 are pairwise distinct modulo 36.
Answer format: {"perm": [p_1, ..., p_36]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 36, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [36, 1, 34, 3, 32, 5, 30, 7, 28, 9, 26, 11, 24, 13, 22, 15, 20, 17, 18, 19, 16, 21, 14, 23, 12, 25, 10, 27, 8, 29, 6, 31, 4, 33, 2, 35]} | 1 |
construct-rlve-prefix-sum-permutation-l2-s6 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 2 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_84 of the integers 1, 2, ..., 84 such that the 84 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_84 are pairwise distinct modulo 84.
Answer format: {"perm": [p_1, ..., p_84]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 84, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [84, 1, 82, 3, 80, 5, 78, 7, 76, 9, 74, 11, 72, 13, 70, 15, 68, 17, 66, 19, 64, 21, 62, 23, 60, 25, 58, 27, 56, 29, 54, 31, 52, 33, 50, 35, 48, 37, 46, 39, 44, 41, 42, 43, 40, 45, 38, 47, 36, 49, 34, 51, 32, 53, 30, 55, 28, 57, 26, 59, 24, 61, 22, 63, 20, 65, 18, 67, 16, 69, 14, 71, 12, 73, 10, 75, 8, 77, 6, 7... | 1 |
construct-rlve-prefix-sum-permutation-l2-s7 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 2 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_32 of the integers 1, 2, ..., 32 such that the 32 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_32 are pairwise distinct modulo 32.
Answer format: {"perm": [p_1, ..., p_32]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 32, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [32, 1, 30, 3, 28, 5, 26, 7, 24, 9, 22, 11, 20, 13, 18, 15, 16, 17, 14, 19, 12, 21, 10, 23, 8, 25, 6, 27, 4, 29, 2, 31]} | 1 |
construct-rlve-prefix-sum-permutation-l2-s8 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 2 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_38 of the integers 1, 2, ..., 38 such that the 38 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_38 are pairwise distinct modulo 38.
Answer format: {"perm": [p_1, ..., p_38]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 38, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [38, 1, 36, 3, 34, 5, 32, 7, 30, 9, 28, 11, 26, 13, 24, 15, 22, 17, 20, 19, 18, 21, 16, 23, 14, 25, 12, 27, 10, 29, 8, 31, 6, 33, 4, 35, 2, 37]} | 1 |
construct-rlve-prefix-sum-permutation-l2-s9 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 2 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_52 of the integers 1, 2, ..., 52 such that the 52 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_52 are pairwise distinct modulo 52.
Answer format: {"perm": [p_1, ..., p_52]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 52, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [52, 1, 50, 3, 48, 5, 46, 7, 44, 9, 42, 11, 40, 13, 38, 15, 36, 17, 34, 19, 32, 21, 30, 23, 28, 25, 26, 27, 24, 29, 22, 31, 20, 33, 18, 35, 16, 37, 14, 39, 12, 41, 10, 43, 8, 45, 6, 47, 4, 49, 2, 51]} | 1 |
construct-rlve-prefix-sum-permutation-l3-s0 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 3 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_78 of the integers 1, 2, ..., 78 such that the 78 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_78 are pairwise distinct modulo 78.
Answer format: {"perm": [p_1, ..., p_78]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 78, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [78, 1, 76, 3, 74, 5, 72, 7, 70, 9, 68, 11, 66, 13, 64, 15, 62, 17, 60, 19, 58, 21, 56, 23, 54, 25, 52, 27, 50, 29, 48, 31, 46, 33, 44, 35, 42, 37, 40, 39, 38, 41, 36, 43, 34, 45, 32, 47, 30, 49, 28, 51, 26, 53, 24, 55, 22, 57, 20, 59, 18, 61, 16, 63, 14, 65, 12, 67, 10, 69, 8, 71, 6, 73, 4, 75, 2, 77]} | 1 |
construct-rlve-prefix-sum-permutation-l3-s1 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 3 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_106 of the integers 1, 2, ..., 106 such that the 106 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_106 are pairwise distinct modulo 106.
Answer format: {"perm": [p_1, ..., p_106]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"n": 106, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [106, 1, 104, 3, 102, 5, 100, 7, 98, 9, 96, 11, 94, 13, 92, 15, 90, 17, 88, 19, 86, 21, 84, 23, 82, 25, 80, 27, 78, 29, 76, 31, 74, 33, 72, 35, 70, 37, 68, 39, 66, 41, 64, 43, 62, 45, 60, 47, 58, 49, 56, 51, 54, 53, 52, 55, 50, 57, 48, 59, 46, 61, 44, 63, 42, 65, 40, 67, 38, 69, 36, 71, 34, 73, 32, 75, 30, 77,... | 1 |
construct-rlve-prefix-sum-permutation-l3-s2 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 3 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_294 of the integers 1, 2, ..., 294 such that the 294 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_294 are pairwise distinct modulo 294.
Answer format: {"perm": [p_1, ..., p_294]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"n": 294, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [294, 1, 292, 3, 290, 5, 288, 7, 286, 9, 284, 11, 282, 13, 280, 15, 278, 17, 276, 19, 274, 21, 272, 23, 270, 25, 268, 27, 266, 29, 264, 31, 262, 33, 260, 35, 258, 37, 256, 39, 254, 41, 252, 43, 250, 45, 248, 47, 246, 49, 244, 51, 242, 53, 240, 55, 238, 57, 236, 59, 234, 61, 232, 63, 230, 65, 228, 67, 226, 69, ... | 1 |
construct-rlve-prefix-sum-permutation-l3-s3 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 3 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_80 of the integers 1, 2, ..., 80 such that the 80 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_80 are pairwise distinct modulo 80.
Answer format: {"perm": [p_1, ..., p_80]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. ... | {"n": 80, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [80, 1, 78, 3, 76, 5, 74, 7, 72, 9, 70, 11, 68, 13, 66, 15, 64, 17, 62, 19, 60, 21, 58, 23, 56, 25, 54, 27, 52, 29, 50, 31, 48, 33, 46, 35, 44, 37, 42, 39, 40, 41, 38, 43, 36, 45, 34, 47, 32, 49, 30, 51, 28, 53, 26, 55, 24, 57, 22, 59, 20, 61, 18, 63, 16, 65, 14, 67, 12, 69, 10, 71, 8, 73, 6, 75, 4, 77, 2, 79]... | 1 |
construct-rlve-prefix-sum-permutation-l3-s4 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 3 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_282 of the integers 1, 2, ..., 282 such that the 282 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_282 are pairwise distinct modulo 282.
Answer format: {"perm": [p_1, ..., p_282]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"n": 282, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [282, 1, 280, 3, 278, 5, 276, 7, 274, 9, 272, 11, 270, 13, 268, 15, 266, 17, 264, 19, 262, 21, 260, 23, 258, 25, 256, 27, 254, 29, 252, 31, 250, 33, 248, 35, 246, 37, 244, 39, 242, 41, 240, 43, 238, 45, 236, 47, 234, 49, 232, 51, 230, 53, 228, 55, 226, 57, 224, 59, 222, 61, 220, 63, 218, 65, 216, 67, 214, 69, ... | 1 |
construct-rlve-prefix-sum-permutation-l3-s5 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 3 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_116 of the integers 1, 2, ..., 116 such that the 116 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_116 are pairwise distinct modulo 116.
Answer format: {"perm": [p_1, ..., p_116]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"n": 116, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [116, 1, 114, 3, 112, 5, 110, 7, 108, 9, 106, 11, 104, 13, 102, 15, 100, 17, 98, 19, 96, 21, 94, 23, 92, 25, 90, 27, 88, 29, 86, 31, 84, 33, 82, 35, 80, 37, 78, 39, 76, 41, 74, 43, 72, 45, 70, 47, 68, 49, 66, 51, 64, 53, 62, 55, 60, 57, 58, 59, 56, 61, 54, 63, 52, 65, 50, 67, 48, 69, 46, 71, 44, 73, 42, 75, 40... | 1 |
construct-rlve-prefix-sum-permutation-l3-s6 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 3 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_182 of the integers 1, 2, ..., 182 such that the 182 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_182 are pairwise distinct modulo 182.
Answer format: {"perm": [p_1, ..., p_182]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"n": 182, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [182, 1, 180, 3, 178, 5, 176, 7, 174, 9, 172, 11, 170, 13, 168, 15, 166, 17, 164, 19, 162, 21, 160, 23, 158, 25, 156, 27, 154, 29, 152, 31, 150, 33, 148, 35, 146, 37, 144, 39, 142, 41, 140, 43, 138, 45, 136, 47, 134, 49, 132, 51, 130, 53, 128, 55, 126, 57, 124, 59, 122, 61, 120, 63, 118, 65, 116, 67, 114, 69, ... | 1 |
construct-rlve-prefix-sum-permutation-l3-s7 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 3 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_214 of the integers 1, 2, ..., 214 such that the 214 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_214 are pairwise distinct modulo 214.
Answer format: {"perm": [p_1, ..., p_214]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"n": 214, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [214, 1, 212, 3, 210, 5, 208, 7, 206, 9, 204, 11, 202, 13, 200, 15, 198, 17, 196, 19, 194, 21, 192, 23, 190, 25, 188, 27, 186, 29, 184, 31, 182, 33, 180, 35, 178, 37, 176, 39, 174, 41, 172, 43, 170, 45, 168, 47, 166, 49, 164, 51, 162, 53, 160, 55, 158, 57, 156, 59, 154, 61, 152, 63, 150, 65, 148, 67, 146, 69, ... | 1 |
construct-rlve-prefix-sum-permutation-l3-s8 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 3 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_262 of the integers 1, 2, ..., 262 such that the 262 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_262 are pairwise distinct modulo 262.
Answer format: {"perm": [p_1, ..., p_262]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"n": 262, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [262, 1, 260, 3, 258, 5, 256, 7, 254, 9, 252, 11, 250, 13, 248, 15, 246, 17, 244, 19, 242, 21, 240, 23, 238, 25, 236, 27, 234, 29, 232, 31, 230, 33, 228, 35, 226, 37, 224, 39, 222, 41, 220, 43, 218, 45, 216, 47, 214, 49, 212, 51, 210, 53, 208, 55, 206, 57, 204, 59, 202, 61, 200, 63, 198, 65, 196, 67, 194, 69, ... | 1 |
construct-rlve-prefix-sum-permutation-l3-s9 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 3 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_204 of the integers 1, 2, ..., 204 such that the 204 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_204 are pairwise distinct modulo 204.
Answer format: {"perm": [p_1, ..., p_204]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"n": 204, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [204, 1, 202, 3, 200, 5, 198, 7, 196, 9, 194, 11, 192, 13, 190, 15, 188, 17, 186, 19, 184, 21, 182, 23, 180, 25, 178, 27, 176, 29, 174, 31, 172, 33, 170, 35, 168, 37, 166, 39, 164, 41, 162, 43, 160, 45, 158, 47, 156, 49, 154, 51, 152, 53, 150, 55, 148, 57, 146, 59, 144, 61, 142, 63, 140, 65, 138, 67, 136, 69, ... | 1 |
construct-rlve-prefix-sum-permutation-l4-s0 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 4 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_1362 of the integers 1, 2, ..., 1362 such that the 1362 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_1362 are pairwise distinct modulo 1362.
Answer format: {"perm": [p_1, ..., p_1362]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"n": 1362, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [1362, 1, 1360, 3, 1358, 5, 1356, 7, 1354, 9, 1352, 11, 1350, 13, 1348, 15, 1346, 17, 1344, 19, 1342, 21, 1340, 23, 1338, 25, 1336, 27, 1334, 29, 1332, 31, 1330, 33, 1328, 35, 1326, 37, 1324, 39, 1322, 41, 1320, 43, 1318, 45, 1316, 47, 1314, 49, 1312, 51, 1310, 53, 1308, 55, 1306, 57, 1304, 59, 1302, 61, 1300,... | 1 |
construct-rlve-prefix-sum-permutation-l4-s1 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 4 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_1292 of the integers 1, 2, ..., 1292 such that the 1292 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_1292 are pairwise distinct modulo 1292.
Answer format: {"perm": [p_1, ..., p_1292]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"n": 1292, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [1292, 1, 1290, 3, 1288, 5, 1286, 7, 1284, 9, 1282, 11, 1280, 13, 1278, 15, 1276, 17, 1274, 19, 1272, 21, 1270, 23, 1268, 25, 1266, 27, 1264, 29, 1262, 31, 1260, 33, 1258, 35, 1256, 37, 1254, 39, 1252, 41, 1250, 43, 1248, 45, 1246, 47, 1244, 49, 1242, 51, 1240, 53, 1238, 55, 1236, 57, 1234, 59, 1232, 61, 1230,... | 1 |
construct-rlve-prefix-sum-permutation-l4-s2 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 4 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_1060 of the integers 1, 2, ..., 1060 such that the 1060 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_1060 are pairwise distinct modulo 1060.
Answer format: {"perm": [p_1, ..., p_1060]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"n": 1060, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [1060, 1, 1058, 3, 1056, 5, 1054, 7, 1052, 9, 1050, 11, 1048, 13, 1046, 15, 1044, 17, 1042, 19, 1040, 21, 1038, 23, 1036, 25, 1034, 27, 1032, 29, 1030, 31, 1028, 33, 1026, 35, 1024, 37, 1022, 39, 1020, 41, 1018, 43, 1016, 45, 1014, 47, 1012, 49, 1010, 51, 1008, 53, 1006, 55, 1004, 57, 1002, 59, 1000, 61, 998, ... | 1 |
construct-rlve-prefix-sum-permutation-l4-s3 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 4 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_572 of the integers 1, 2, ..., 572 such that the 572 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_572 are pairwise distinct modulo 572.
Answer format: {"perm": [p_1, ..., p_572]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"n": 572, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [572, 1, 570, 3, 568, 5, 566, 7, 564, 9, 562, 11, 560, 13, 558, 15, 556, 17, 554, 19, 552, 21, 550, 23, 548, 25, 546, 27, 544, 29, 542, 31, 540, 33, 538, 35, 536, 37, 534, 39, 532, 41, 530, 43, 528, 45, 526, 47, 524, 49, 522, 51, 520, 53, 518, 55, 516, 57, 514, 59, 512, 61, 510, 63, 508, 65, 506, 67, 504, 69, ... | 1 |
construct-rlve-prefix-sum-permutation-l4-s4 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 4 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_1084 of the integers 1, 2, ..., 1084 such that the 1084 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_1084 are pairwise distinct modulo 1084.
Answer format: {"perm": [p_1, ..., p_1084]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"n": 1084, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [1084, 1, 1082, 3, 1080, 5, 1078, 7, 1076, 9, 1074, 11, 1072, 13, 1070, 15, 1068, 17, 1066, 19, 1064, 21, 1062, 23, 1060, 25, 1058, 27, 1056, 29, 1054, 31, 1052, 33, 1050, 35, 1048, 37, 1046, 39, 1044, 41, 1042, 43, 1040, 45, 1038, 47, 1036, 49, 1034, 51, 1032, 53, 1030, 55, 1028, 57, 1026, 59, 1024, 61, 1022,... | 1 |
construct-rlve-prefix-sum-permutation-l4-s5 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 4 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_412 of the integers 1, 2, ..., 412 such that the 412 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_412 are pairwise distinct modulo 412.
Answer format: {"perm": [p_1, ..., p_412]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"n": 412, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [412, 1, 410, 3, 408, 5, 406, 7, 404, 9, 402, 11, 400, 13, 398, 15, 396, 17, 394, 19, 392, 21, 390, 23, 388, 25, 386, 27, 384, 29, 382, 31, 380, 33, 378, 35, 376, 37, 374, 39, 372, 41, 370, 43, 368, 45, 366, 47, 364, 49, 362, 51, 360, 53, 358, 55, 356, 57, 354, 59, 352, 61, 350, 63, 348, 65, 346, 67, 344, 69, ... | 1 |
construct-rlve-prefix-sum-permutation-l4-s6 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 4 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_1710 of the integers 1, 2, ..., 1710 such that the 1710 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_1710 are pairwise distinct modulo 1710.
Answer format: {"perm": [p_1, ..., p_1710]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"n": 1710, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [1710, 1, 1708, 3, 1706, 5, 1704, 7, 1702, 9, 1700, 11, 1698, 13, 1696, 15, 1694, 17, 1692, 19, 1690, 21, 1688, 23, 1686, 25, 1684, 27, 1682, 29, 1680, 31, 1678, 33, 1676, 35, 1674, 37, 1672, 39, 1670, 41, 1668, 43, 1666, 45, 1664, 47, 1662, 49, 1660, 51, 1658, 53, 1656, 55, 1654, 57, 1652, 59, 1650, 61, 1648,... | 1 |
construct-rlve-prefix-sum-permutation-l4-s7 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 4 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_512 of the integers 1, 2, ..., 512 such that the 512 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_512 are pairwise distinct modulo 512.
Answer format: {"perm": [p_1, ..., p_512]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"n": 512, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [512, 1, 510, 3, 508, 5, 506, 7, 504, 9, 502, 11, 500, 13, 498, 15, 496, 17, 494, 19, 492, 21, 490, 23, 488, 25, 486, 27, 484, 29, 482, 31, 480, 33, 478, 35, 476, 37, 474, 39, 472, 41, 470, 43, 468, 45, 466, 47, 464, 49, 462, 51, 460, 53, 458, 55, 456, 57, 454, 59, 452, 61, 450, 63, 448, 65, 446, 67, 444, 69, ... | 1 |
construct-rlve-prefix-sum-permutation-l4-s8 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 4 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_306 of the integers 1, 2, ..., 306 such that the 306 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_306 are pairwise distinct modulo 306.
Answer format: {"perm": [p_1, ..., p_306]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"n": 306, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [306, 1, 304, 3, 302, 5, 300, 7, 298, 9, 296, 11, 294, 13, 292, 15, 290, 17, 288, 19, 286, 21, 284, 23, 282, 25, 280, 27, 278, 29, 276, 31, 274, 33, 272, 35, 270, 37, 268, 39, 266, 41, 264, 43, 262, 45, 260, 47, 258, 49, 256, 51, 254, 53, 252, 55, 250, 57, 248, 59, 246, 61, 244, 63, 242, 65, 240, 67, 238, 69, ... | 1 |
construct-rlve-prefix-sum-permutation-l4-s9 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 4 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_602 of the integers 1, 2, ..., 602 such that the 602 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_602 are pairwise distinct modulo 602.
Answer format: {"perm": [p_1, ..., p_602]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.j... | {"n": 602, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [602, 1, 600, 3, 598, 5, 596, 7, 594, 9, 592, 11, 590, 13, 588, 15, 586, 17, 584, 19, 582, 21, 580, 23, 578, 25, 576, 27, 574, 29, 572, 31, 570, 33, 568, 35, 566, 37, 564, 39, 562, 41, 560, 43, 558, 45, 556, 47, 554, 49, 552, 51, 550, 53, 548, 55, 546, 57, 544, 59, 542, 61, 540, 63, 538, 65, 536, 67, 534, 69, ... | 1 |
construct-rlve-prefix-sum-permutation-l5-s0 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 5 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_8562 of the integers 1, 2, ..., 8562 such that the 8562 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_8562 are pairwise distinct modulo 8562.
Answer format: {"perm": [p_1, ..., p_8562]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"n": 8562, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [8562, 1, 8560, 3, 8558, 5, 8556, 7, 8554, 9, 8552, 11, 8550, 13, 8548, 15, 8546, 17, 8544, 19, 8542, 21, 8540, 23, 8538, 25, 8536, 27, 8534, 29, 8532, 31, 8530, 33, 8528, 35, 8526, 37, 8524, 39, 8522, 41, 8520, 43, 8518, 45, 8516, 47, 8514, 49, 8512, 51, 8510, 53, 8508, 55, 8506, 57, 8504, 59, 8502, 61, 8500,... | 1 |
construct-rlve-prefix-sum-permutation-l5-s1 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 5 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_8170 of the integers 1, 2, ..., 8170 such that the 8170 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_8170 are pairwise distinct modulo 8170.
Answer format: {"perm": [p_1, ..., p_8170]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"n": 8170, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [8170, 1, 8168, 3, 8166, 5, 8164, 7, 8162, 9, 8160, 11, 8158, 13, 8156, 15, 8154, 17, 8152, 19, 8150, 21, 8148, 23, 8146, 25, 8144, 27, 8142, 29, 8140, 31, 8138, 33, 8136, 35, 8134, 37, 8132, 39, 8130, 41, 8128, 43, 8126, 45, 8124, 47, 8122, 49, 8120, 51, 8118, 53, 8116, 55, 8114, 57, 8112, 59, 8110, 61, 8108,... | 1 |
construct-rlve-prefix-sum-permutation-l5-s2 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 5 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_2828 of the integers 1, 2, ..., 2828 such that the 2828 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_2828 are pairwise distinct modulo 2828.
Answer format: {"perm": [p_1, ..., p_2828]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"n": 2828, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [2828, 1, 2826, 3, 2824, 5, 2822, 7, 2820, 9, 2818, 11, 2816, 13, 2814, 15, 2812, 17, 2810, 19, 2808, 21, 2806, 23, 2804, 25, 2802, 27, 2800, 29, 2798, 31, 2796, 33, 2794, 35, 2792, 37, 2790, 39, 2788, 41, 2786, 43, 2784, 45, 2782, 47, 2780, 49, 2778, 51, 2776, 53, 2774, 55, 2772, 57, 2770, 59, 2768, 61, 2766,... | 1 |
construct-rlve-prefix-sum-permutation-l5-s3 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 5 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_6502 of the integers 1, 2, ..., 6502 such that the 6502 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_6502 are pairwise distinct modulo 6502.
Answer format: {"perm": [p_1, ..., p_6502]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"n": 6502, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [6502, 1, 6500, 3, 6498, 5, 6496, 7, 6494, 9, 6492, 11, 6490, 13, 6488, 15, 6486, 17, 6484, 19, 6482, 21, 6480, 23, 6478, 25, 6476, 27, 6474, 29, 6472, 31, 6470, 33, 6468, 35, 6466, 37, 6464, 39, 6462, 41, 6460, 43, 6458, 45, 6456, 47, 6454, 49, 6452, 51, 6450, 53, 6448, 55, 6446, 57, 6444, 59, 6442, 61, 6440,... | 1 |
construct-rlve-prefix-sum-permutation-l5-s4 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 5 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_6482 of the integers 1, 2, ..., 6482 such that the 6482 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_6482 are pairwise distinct modulo 6482.
Answer format: {"perm": [p_1, ..., p_6482]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"n": 6482, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [6482, 1, 6480, 3, 6478, 5, 6476, 7, 6474, 9, 6472, 11, 6470, 13, 6468, 15, 6466, 17, 6464, 19, 6462, 21, 6460, 23, 6458, 25, 6456, 27, 6454, 29, 6452, 31, 6450, 33, 6448, 35, 6446, 37, 6444, 39, 6442, 41, 6440, 43, 6438, 45, 6436, 47, 6434, 49, 6432, 51, 6430, 53, 6428, 55, 6426, 57, 6424, 59, 6422, 61, 6420,... | 1 |
construct-rlve-prefix-sum-permutation-l5-s5 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 5 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_8154 of the integers 1, 2, ..., 8154 such that the 8154 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_8154 are pairwise distinct modulo 8154.
Answer format: {"perm": [p_1, ..., p_8154]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"n": 8154, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [8154, 1, 8152, 3, 8150, 5, 8148, 7, 8146, 9, 8144, 11, 8142, 13, 8140, 15, 8138, 17, 8136, 19, 8134, 21, 8132, 23, 8130, 25, 8128, 27, 8126, 29, 8124, 31, 8122, 33, 8120, 35, 8118, 37, 8116, 39, 8114, 41, 8112, 43, 8110, 45, 8108, 47, 8106, 49, 8104, 51, 8102, 53, 8100, 55, 8098, 57, 8096, 59, 8094, 61, 8092,... | 1 |
construct-rlve-prefix-sum-permutation-l5-s6 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 5 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_2806 of the integers 1, 2, ..., 2806 such that the 2806 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_2806 are pairwise distinct modulo 2806.
Answer format: {"perm": [p_1, ..., p_2806]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"n": 2806, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [2806, 1, 2804, 3, 2802, 5, 2800, 7, 2798, 9, 2796, 11, 2794, 13, 2792, 15, 2790, 17, 2788, 19, 2786, 21, 2784, 23, 2782, 25, 2780, 27, 2778, 29, 2776, 31, 2774, 33, 2772, 35, 2770, 37, 2768, 39, 2766, 41, 2764, 43, 2762, 45, 2760, 47, 2758, 49, 2756, 51, 2754, 53, 2752, 55, 2750, 57, 2748, 59, 2746, 61, 2744,... | 1 |
construct-rlve-prefix-sum-permutation-l5-s7 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 5 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_3282 of the integers 1, 2, ..., 3282 such that the 3282 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_3282 are pairwise distinct modulo 3282.
Answer format: {"perm": [p_1, ..., p_3282]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"n": 3282, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [3282, 1, 3280, 3, 3278, 5, 3276, 7, 3274, 9, 3272, 11, 3270, 13, 3268, 15, 3266, 17, 3264, 19, 3262, 21, 3260, 23, 3258, 25, 3256, 27, 3254, 29, 3252, 31, 3250, 33, 3248, 35, 3246, 37, 3244, 39, 3242, 41, 3240, 43, 3238, 45, 3236, 47, 3234, 49, 3232, 51, 3230, 53, 3228, 55, 3226, 57, 3224, 59, 3222, 61, 3220,... | 1 |
construct-rlve-prefix-sum-permutation-l5-s8 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 5 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_2376 of the integers 1, 2, ..., 2376 such that the 2376 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_2376 are pairwise distinct modulo 2376.
Answer format: {"perm": [p_1, ..., p_2376]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"n": 2376, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [2376, 1, 2374, 3, 2372, 5, 2370, 7, 2368, 9, 2366, 11, 2364, 13, 2362, 15, 2360, 17, 2358, 19, 2356, 21, 2354, 23, 2352, 25, 2350, 27, 2348, 29, 2346, 31, 2344, 33, 2342, 35, 2340, 37, 2338, 39, 2336, 41, 2334, 43, 2332, 45, 2330, 47, 2328, 49, 2326, 51, 2324, 53, 2322, 55, 2320, 57, 2318, 59, 2316, 61, 2314,... | 1 |
construct-rlve-prefix-sum-permutation-l5-s9 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 5 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_8660 of the integers 1, 2, ..., 8660 such that the 8660 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_8660 are pairwise distinct modulo 8660.
Answer format: {"perm": [p_1, ..., p_8660]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/inst... | {"n": 8660, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [8660, 1, 8658, 3, 8656, 5, 8654, 7, 8652, 9, 8650, 11, 8648, 13, 8646, 15, 8644, 17, 8642, 19, 8640, 21, 8638, 23, 8636, 25, 8634, 27, 8632, 29, 8630, 31, 8628, 33, 8626, 35, 8624, 37, 8622, 39, 8620, 41, 8618, 43, 8616, 45, 8614, 47, 8612, 49, 8610, 51, 8608, 53, 8606, 55, 8604, 57, 8602, 59, 8600, 61, 8598,... | 1 |
construct-rlve-prefix-sum-permutation-l6-s0 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 6 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_10770 of the integers 1, 2, ..., 10770 such that the 10770 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_10770 are pairwise distinct modulo 10770.
Answer format: {"perm": [p_1, ..., p_10770]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdi... | {"n": 10770, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [10770, 1, 10768, 3, 10766, 5, 10764, 7, 10762, 9, 10760, 11, 10758, 13, 10756, 15, 10754, 17, 10752, 19, 10750, 21, 10748, 23, 10746, 25, 10744, 27, 10742, 29, 10740, 31, 10738, 33, 10736, 35, 10734, 37, 10732, 39, 10730, 41, 10728, 43, 10726, 45, 10724, 47, 10722, 49, 10720, 51, 10718, 53, 10716, 55, 10714, ... | 1 |
construct-rlve-prefix-sum-permutation-l6-s1 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 6 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_16894 of the integers 1, 2, ..., 16894 such that the 16894 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_16894 are pairwise distinct modulo 16894.
Answer format: {"perm": [p_1, ..., p_16894]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdi... | {"n": 16894, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [16894, 1, 16892, 3, 16890, 5, 16888, 7, 16886, 9, 16884, 11, 16882, 13, 16880, 15, 16878, 17, 16876, 19, 16874, 21, 16872, 23, 16870, 25, 16868, 27, 16866, 29, 16864, 31, 16862, 33, 16860, 35, 16858, 37, 16856, 39, 16854, 41, 16852, 43, 16850, 45, 16848, 47, 16846, 49, 16844, 51, 16842, 53, 16840, 55, 16838, ... | 1 |
construct-rlve-prefix-sum-permutation-l6-s2 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 6 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_27942 of the integers 1, 2, ..., 27942 such that the 27942 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_27942 are pairwise distinct modulo 27942.
Answer format: {"perm": [p_1, ..., p_27942]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdi... | {"n": 27942, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [27942, 1, 27940, 3, 27938, 5, 27936, 7, 27934, 9, 27932, 11, 27930, 13, 27928, 15, 27926, 17, 27924, 19, 27922, 21, 27920, 23, 27918, 25, 27916, 27, 27914, 29, 27912, 31, 27910, 33, 27908, 35, 27906, 37, 27904, 39, 27902, 41, 27900, 43, 27898, 45, 27896, 47, 27894, 49, 27892, 51, 27890, 53, 27888, 55, 27886, ... | 1 |
construct-rlve-prefix-sum-permutation-l6-s3 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 6 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_26738 of the integers 1, 2, ..., 26738 such that the 26738 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_26738 are pairwise distinct modulo 26738.
Answer format: {"perm": [p_1, ..., p_26738]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdi... | {"n": 26738, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [26738, 1, 26736, 3, 26734, 5, 26732, 7, 26730, 9, 26728, 11, 26726, 13, 26724, 15, 26722, 17, 26720, 19, 26718, 21, 26716, 23, 26714, 25, 26712, 27, 26710, 29, 26708, 31, 26706, 33, 26704, 35, 26702, 37, 26700, 39, 26698, 41, 26696, 43, 26694, 45, 26692, 47, 26690, 49, 26688, 51, 26686, 53, 26684, 55, 26682, ... | 1 |
construct-rlve-prefix-sum-permutation-l6-s4 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 6 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_16686 of the integers 1, 2, ..., 16686 such that the 16686 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_16686 are pairwise distinct modulo 16686.
Answer format: {"perm": [p_1, ..., p_16686]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdi... | {"n": 16686, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [16686, 1, 16684, 3, 16682, 5, 16680, 7, 16678, 9, 16676, 11, 16674, 13, 16672, 15, 16670, 17, 16668, 19, 16666, 21, 16664, 23, 16662, 25, 16660, 27, 16658, 29, 16656, 31, 16654, 33, 16652, 35, 16650, 37, 16648, 39, 16646, 41, 16644, 43, 16642, 45, 16640, 47, 16638, 49, 16636, 51, 16634, 53, 16632, 55, 16630, ... | 1 |
construct-rlve-prefix-sum-permutation-l6-s5 | construct | rlve_prefix_sum_permutation | prefix_sum_mod_distinct_permutation | number_theory | competition | 6 | RLVE-Gym/prefix_sum_mod_distinct_permutation | MIT | [] | Find a permutation p_1, ..., p_20570 of the integers 1, 2, ..., 20570 such that the 20570 prefix sums p_1, p_1+p_2, ..., p_1+p_2+...+p_20570 are pairwise distinct modulo 20570.
Answer format: {"perm": [p_1, ..., p_20570]}
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdi... | {"n": 20570, "family": "rlve_prefix_sum_permutation", "subset": "construct"} | null | null | null | {"perm": [20570, 1, 20568, 3, 20566, 5, 20564, 7, 20562, 9, 20560, 11, 20558, 13, 20556, 15, 20554, 17, 20552, 19, 20550, 21, 20548, 23, 20546, 25, 20544, 27, 20542, 29, 20540, 31, 20538, 33, 20536, 35, 20534, 37, 20532, 39, 20530, 41, 20528, 43, 20526, 45, 20524, 47, 20522, 49, 20520, 51, 20518, 53, 20516, 55, 20514, ... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.