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-nppc-independent-set-l2-s6 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 2 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 16 vertices labelled 0..15 and 54 edges:
[[0, 3], [0, 4], [0, 6], [0, 7], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 15], [1, 2], [1, 3], [1, 6], [1, 9], [1, 11], [1, 15], [2, 3], [2, 4], [2, 7], [2, 8], [2, 10], [2, 13], [2, 14], [3, 4], [3, 5], [3, 6], [3, 8], [3, 9], [3, 11], [3, 12], [3, ... | {"num_nodes": 16, "k": 8, "edges": [[0, 3], [0, 4], [0, 6], [0, 7], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 15], [1, 2], [1, 3], [1, 6], [1, 9], [1, 11], [1, 15], [2, 3], [2, 4], [2, 7], [2, 8], [2, 10], [2, 13], [2, 14], [3, 4], [3, 5], [3, 6], [3, 8], [3, 9], [3, 11], [3, 12], [3, 15], [4, 6], [4, 11], [4, 14... | null | null | null | {"independent_set": [1, 4, 5, 7, 8, 10, 12, 13]} | 1 |
construct-nppc-independent-set-l2-s7 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 2 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 16 vertices labelled 0..15 and 51 edges:
[[0, 2], [0, 5], [0, 8], [0, 9], [0, 12], [0, 13], [0, 14], [0, 15], [1, 2], [1, 3], [1, 4], [1, 8], [1, 12], [1, 14], [1, 15], [2, 3], [2, 7], [2, 14], [3, 5], [3, 6], [3, 7], [3, 9], [3, 10], [3, 13], [3, 14], [3, 15], [4, 11], [4, 15], [5, 11], [5, 15], ... | {"num_nodes": 16, "k": 8, "edges": [[0, 2], [0, 5], [0, 8], [0, 9], [0, 12], [0, 13], [0, 14], [0, 15], [1, 2], [1, 3], [1, 4], [1, 8], [1, 12], [1, 14], [1, 15], [2, 3], [2, 7], [2, 14], [3, 5], [3, 6], [3, 7], [3, 9], [3, 10], [3, 13], [3, 14], [3, 15], [4, 11], [4, 15], [5, 11], [5, 15], [6, 11], [6, 13], [6, 15], [... | null | null | null | {"independent_set": [2, 4, 5, 6, 8, 9, 10, 12]} | 1 |
construct-nppc-independent-set-l2-s8 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 2 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 16 vertices labelled 0..15 and 47 edges:
[[0, 1], [0, 8], [0, 9], [0, 10], [0, 13], [1, 5], [1, 8], [1, 9], [1, 10], [1, 12], [1, 14], [2, 4], [2, 5], [2, 6], [2, 7], [2, 9], [2, 10], [2, 12], [2, 13], [3, 9], [3, 10], [3, 12], [3, 13], [4, 12], [4, 15], [5, 8], [5, 9], [5, 15], [6, 8], [6, 10], [... | {"num_nodes": 16, "k": 8, "edges": [[0, 1], [0, 8], [0, 9], [0, 10], [0, 13], [1, 5], [1, 8], [1, 9], [1, 10], [1, 12], [1, 14], [2, 4], [2, 5], [2, 6], [2, 7], [2, 9], [2, 10], [2, 12], [2, 13], [3, 9], [3, 10], [3, 12], [3, 13], [4, 12], [4, 15], [5, 8], [5, 9], [5, 15], [6, 8], [6, 10], [6, 12], [7, 8], [7, 12], [7,... | null | null | null | {"independent_set": [0, 3, 4, 5, 6, 7, 11, 14]} | 1 |
construct-nppc-independent-set-l2-s9 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 2 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 16 vertices labelled 0..15 and 47 edges:
[[0, 5], [0, 6], [0, 14], [0, 15], [1, 2], [1, 3], [1, 7], [1, 8], [2, 3], [2, 6], [2, 7], [2, 12], [2, 13], [2, 14], [2, 15], [3, 4], [3, 5], [3, 6], [3, 7], [3, 9], [3, 10], [3, 13], [3, 14], [3, 15], [4, 7], [4, 9], [4, 10], [4, 13], [4, 14], [4, 15], [5... | {"num_nodes": 16, "k": 8, "edges": [[0, 5], [0, 6], [0, 14], [0, 15], [1, 2], [1, 3], [1, 7], [1, 8], [2, 3], [2, 6], [2, 7], [2, 12], [2, 13], [2, 14], [2, 15], [3, 4], [3, 5], [3, 6], [3, 7], [3, 9], [3, 10], [3, 13], [3, 14], [3, 15], [4, 7], [4, 9], [4, 10], [4, 13], [4, 14], [4, 15], [5, 7], [5, 13], [6, 7], [6, 8... | null | null | null | {"independent_set": [1, 5, 6, 9, 10, 11, 12, 14]} | 1 |
construct-nppc-independent-set-l3-s0 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 3 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 24 vertices labelled 0..23 and 98 edges:
[[0, 8], [0, 10], [0, 19], [0, 21], [0, 22], [0, 23], [1, 3], [1, 4], [1, 8], [1, 9], [1, 10], [1, 19], [2, 3], [2, 4], [2, 8], [2, 9], [2, 19], [2, 22], [3, 8], [3, 10], [3, 16], [3, 19], [3, 23], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 13], [... | {"num_nodes": 24, "k": 12, "edges": [[0, 8], [0, 10], [0, 19], [0, 21], [0, 22], [0, 23], [1, 3], [1, 4], [1, 8], [1, 9], [1, 10], [1, 19], [2, 3], [2, 4], [2, 8], [2, 9], [2, 19], [2, 22], [3, 8], [3, 10], [3, 16], [3, 19], [3, 23], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 13], [4, 20], [4, 21], [4, 22], [... | null | null | null | {"independent_set": [0, 1, 2, 5, 6, 7, 11, 12, 13, 14, 17, 20]} | 1 |
construct-nppc-independent-set-l3-s1 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 3 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 24 vertices labelled 0..23 and 105 edges:
[[0, 1], [0, 2], [0, 4], [0, 5], [0, 7], [0, 8], [0, 11], [0, 14], [0, 15], [0, 16], [0, 19], [0, 20], [0, 21], [0, 23], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 12], [1, 15], [1, 16], [1, 19], [2, 3], [2, 4], [2, 6], [2... | {"num_nodes": 24, "k": 12, "edges": [[0, 1], [0, 2], [0, 4], [0, 5], [0, 7], [0, 8], [0, 11], [0, 14], [0, 15], [0, 16], [0, 19], [0, 20], [0, 21], [0, 23], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 12], [1, 15], [1, 16], [1, 19], [2, 3], [2, 4], [2, 6], [2, 16], [2, 18], [2, 20], [2,... | null | null | null | {"independent_set": [2, 5, 7, 8, 9, 11, 12, 13, 14, 19, 21, 23]} | 1 |
construct-nppc-independent-set-l3-s2 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 3 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 24 vertices labelled 0..23 and 115 edges:
[[0, 2], [0, 7], [0, 9], [0, 11], [0, 12], [0, 16], [0, 20], [0, 23], [1, 2], [1, 9], [1, 12], [1, 20], [2, 5], [2, 7], [2, 8], [2, 9], [2, 13], [2, 14], [2, 15], [2, 16], [2, 19], [2, 20], [2, 21], [3, 6], [3, 7], [3, 14], [3, 20], [3, 23], [4, 7], [4, 12... | {"num_nodes": 24, "k": 12, "edges": [[0, 2], [0, 7], [0, 9], [0, 11], [0, 12], [0, 16], [0, 20], [0, 23], [1, 2], [1, 9], [1, 12], [1, 20], [2, 5], [2, 7], [2, 8], [2, 9], [2, 13], [2, 14], [2, 15], [2, 16], [2, 19], [2, 20], [2, 21], [3, 6], [3, 7], [3, 14], [3, 20], [3, 23], [4, 7], [4, 12], [4, 13], [4, 23], [5, 6],... | null | null | null | {"independent_set": [0, 1, 3, 4, 5, 8, 10, 15, 18, 19, 21, 22]} | 1 |
construct-nppc-independent-set-l3-s3 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 3 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 24 vertices labelled 0..23 and 98 edges:
[[0, 1], [0, 3], [0, 5], [0, 8], [0, 12], [0, 22], [1, 5], [1, 8], [1, 10], [1, 11], [1, 13], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 23], [2, 3], [2, 6], [2, 11], [2, 15], [2, 17], [3, 5], [3, 7], [3, 9], [3, 10], [3, 11], [3, 13], [3, 16], [3, 17... | {"num_nodes": 24, "k": 12, "edges": [[0, 1], [0, 3], [0, 5], [0, 8], [0, 12], [0, 22], [1, 5], [1, 8], [1, 10], [1, 11], [1, 13], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 23], [2, 3], [2, 6], [2, 11], [2, 15], [2, 17], [3, 5], [3, 7], [3, 9], [3, 10], [3, 11], [3, 13], [3, 16], [3, 17], [3, 20], [3, 22], [3, 23... | null | null | null | {"independent_set": [0, 2, 4, 7, 10, 13, 14, 16, 19, 20, 21, 23]} | 1 |
construct-nppc-independent-set-l3-s4 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 3 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 24 vertices labelled 0..23 and 109 edges:
[[0, 1], [0, 3], [0, 4], [0, 6], [0, 8], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 18], [0, 22], [1, 3], [1, 7], [1, 8], [1, 11], [1, 13], [1, 15], [1, 16], [1, 18], [1, 21], [2, 4], [2, 9], [2, 10], [2, 12], [2, 14], [2, 16], [2, 21], [2, ... | {"num_nodes": 24, "k": 12, "edges": [[0, 1], [0, 3], [0, 4], [0, 6], [0, 8], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 18], [0, 22], [1, 3], [1, 7], [1, 8], [1, 11], [1, 13], [1, 15], [1, 16], [1, 18], [1, 21], [2, 4], [2, 9], [2, 10], [2, 12], [2, 14], [2, 16], [2, 21], [2, 22], [3, 5], [3, 7], [3, 12]... | null | null | null | {"independent_set": [3, 6, 8, 9, 10, 13, 15, 18, 19, 20, 22, 23]} | 1 |
construct-nppc-independent-set-l3-s5 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 3 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 24 vertices labelled 0..23 and 101 edges:
[[0, 7], [0, 11], [0, 12], [0, 16], [0, 17], [0, 18], [1, 3], [1, 12], [1, 13], [2, 3], [2, 4], [2, 5], [2, 7], [2, 9], [2, 11], [2, 12], [2, 13], [2, 15], [2, 16], [2, 20], [2, 22], [3, 5], [3, 8], [3, 10], [3, 11], [3, 13], [3, 14], [3, 16], [3, 17], [3,... | {"num_nodes": 24, "k": 12, "edges": [[0, 7], [0, 11], [0, 12], [0, 16], [0, 17], [0, 18], [1, 3], [1, 12], [1, 13], [2, 3], [2, 4], [2, 5], [2, 7], [2, 9], [2, 11], [2, 12], [2, 13], [2, 15], [2, 16], [2, 20], [2, 22], [3, 5], [3, 8], [3, 10], [3, 11], [3, 13], [3, 14], [3, 16], [3, 17], [3, 18], [3, 19], [3, 21], [3, ... | null | null | null | {"independent_set": [0, 1, 4, 5, 6, 9, 15, 19, 20, 21, 22, 23]} | 1 |
construct-nppc-independent-set-l3-s6 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 3 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 24 vertices labelled 0..23 and 96 edges:
[[0, 1], [0, 6], [0, 8], [0, 9], [0, 11], [0, 14], [0, 21], [0, 22], [0, 23], [1, 3], [1, 7], [1, 10], [1, 11], [1, 12], [1, 16], [1, 17], [1, 19], [1, 20], [1, 21], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [2, 14], [2, 16], [2, 18], [2, 19], [2, 20], [2, 23... | {"num_nodes": 24, "k": 12, "edges": [[0, 1], [0, 6], [0, 8], [0, 9], [0, 11], [0, 14], [0, 21], [0, 22], [0, 23], [1, 3], [1, 7], [1, 10], [1, 11], [1, 12], [1, 16], [1, 17], [1, 19], [1, 20], [1, 21], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [2, 14], [2, 16], [2, 18], [2, 19], [2, 20], [2, 23], [3, 4], [3, 5], [3, 9], ... | null | null | null | {"independent_set": [3, 6, 7, 8, 12, 14, 15, 18, 19, 20, 22, 23]} | 1 |
construct-nppc-independent-set-l3-s7 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 3 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 24 vertices labelled 0..23 and 102 edges:
[[0, 2], [0, 5], [0, 6], [0, 9], [0, 10], [0, 11], [0, 13], [0, 16], [0, 17], [0, 18], [0, 21], [0, 23], [1, 2], [1, 4], [1, 16], [1, 18], [2, 3], [2, 8], [2, 11], [2, 12], [2, 14], [2, 15], [2, 17], [2, 21], [2, 22], [2, 23], [3, 10], [3, 11], [3, 16], [3... | {"num_nodes": 24, "k": 12, "edges": [[0, 2], [0, 5], [0, 6], [0, 9], [0, 10], [0, 11], [0, 13], [0, 16], [0, 17], [0, 18], [0, 21], [0, 23], [1, 2], [1, 4], [1, 16], [1, 18], [2, 3], [2, 8], [2, 11], [2, 12], [2, 14], [2, 15], [2, 17], [2, 21], [2, 22], [2, 23], [3, 10], [3, 11], [3, 16], [3, 17], [3, 19], [4, 5], [4, ... | null | null | null | {"independent_set": [1, 3, 5, 6, 7, 9, 13, 15, 20, 21, 22, 23]} | 1 |
construct-nppc-independent-set-l3-s8 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 3 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 24 vertices labelled 0..23 and 108 edges:
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 20], [0, 21], [0, 22], [0, 23], [1, 4], [1, 5], [1, 6], [1, 8], [1, 10], [1, 11], [1, 13], [1, 14], [1, 15], [1, 16], [1, 19], [1, 23], [2, 3], [2, 12], [2, 15], [2, 17], [2, 23], [3, 4], [3, 7], [3, 8],... | {"num_nodes": 24, "k": 12, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 20], [0, 21], [0, 22], [0, 23], [1, 4], [1, 5], [1, 6], [1, 8], [1, 10], [1, 11], [1, 13], [1, 14], [1, 15], [1, 16], [1, 19], [1, 23], [2, 3], [2, 12], [2, 15], [2, 17], [2, 23], [3, 4], [3, 7], [3, 8], [3, 9], [3, 11], [3, 13], [... | null | null | null | {"independent_set": [2, 4, 6, 7, 9, 11, 13, 14, 19, 20, 21, 22]} | 1 |
construct-nppc-independent-set-l3-s9 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 3 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 24 vertices labelled 0..23 and 108 edges:
[[0, 2], [0, 8], [0, 13], [0, 20], [0, 22], [1, 2], [1, 4], [1, 5], [1, 8], [1, 10], [2, 3], [2, 4], [2, 7], [2, 8], [2, 10], [2, 11], [2, 12], [2, 15], [2, 16], [2, 18], [2, 19], [2, 21], [2, 22], [3, 4], [3, 6], [3, 8], [3, 10], [3, 13], [3, 20], [3, 22]... | {"num_nodes": 24, "k": 12, "edges": [[0, 2], [0, 8], [0, 13], [0, 20], [0, 22], [1, 2], [1, 4], [1, 5], [1, 8], [1, 10], [2, 3], [2, 4], [2, 7], [2, 8], [2, 10], [2, 11], [2, 12], [2, 15], [2, 16], [2, 18], [2, 19], [2, 21], [2, 22], [3, 4], [3, 6], [3, 8], [3, 10], [3, 13], [3, 20], [3, 22], [3, 23], [4, 5], [4, 7], [... | null | null | null | {"independent_set": [0, 1, 3, 9, 12, 14, 15, 16, 17, 18, 19, 21]} | 1 |
construct-nppc-independent-set-l4-s0 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 4 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 32 vertices labelled 0..31 and 200 edges:
[[0, 2], [0, 9], [0, 11], [0, 21], [0, 22], [0, 25], [0, 26], [0, 31], [1, 2], [1, 3], [1, 9], [1, 11], [1, 12], [1, 20], [1, 26], [1, 30], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 9], [2, 10], [2, 11], [2, 12], [2, 14], [2, 17], [2, 18], [2, 19], [2, 2... | {"num_nodes": 32, "k": 16, "edges": [[0, 2], [0, 9], [0, 11], [0, 21], [0, 22], [0, 25], [0, 26], [0, 31], [1, 2], [1, 3], [1, 9], [1, 11], [1, 12], [1, 20], [1, 26], [1, 30], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 9], [2, 10], [2, 11], [2, 12], [2, 14], [2, 17], [2, 18], [2, 19], [2, 21], [2, 22], [2, 23], [2, 26... | null | null | null | {"independent_set": [0, 1, 5, 6, 7, 8, 10, 13, 14, 15, 16, 17, 18, 19, 28, 29]} | 1 |
construct-nppc-independent-set-l4-s1 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 4 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 32 vertices labelled 0..31 and 183 edges:
[[0, 8], [0, 9], [0, 15], [0, 16], [0, 17], [0, 19], [0, 23], [0, 24], [0, 25], [0, 28], [0, 29], [1, 8], [1, 13], [1, 16], [1, 21], [1, 23], [1, 29], [2, 3], [2, 8], [2, 9], [2, 12], [2, 16], [2, 17], [2, 21], [2, 28], [3, 5], [3, 8], [3, 10], [3, 14], [3... | {"num_nodes": 32, "k": 16, "edges": [[0, 8], [0, 9], [0, 15], [0, 16], [0, 17], [0, 19], [0, 23], [0, 24], [0, 25], [0, 28], [0, 29], [1, 8], [1, 13], [1, 16], [1, 21], [1, 23], [1, 29], [2, 3], [2, 8], [2, 9], [2, 12], [2, 16], [2, 17], [2, 21], [2, 28], [3, 5], [3, 8], [3, 10], [3, 14], [3, 15], [3, 16], [3, 18], [3,... | null | null | null | {"independent_set": [0, 1, 2, 4, 5, 6, 7, 10, 11, 14, 18, 20, 22, 26, 27, 31]} | 1 |
construct-nppc-independent-set-l4-s2 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 4 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 32 vertices labelled 0..31 and 196 edges:
[[0, 2], [0, 5], [0, 14], [0, 20], [0, 23], [0, 26], [0, 27], [1, 6], [1, 11], [1, 17], [1, 21], [1, 23], [1, 27], [1, 30], [2, 3], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 13], [2, 14], [2, 16], [2, 21], [2, 28], [2, 29], [2, 30], [2, 31], [3, 4], [3,... | {"num_nodes": 32, "k": 16, "edges": [[0, 2], [0, 5], [0, 14], [0, 20], [0, 23], [0, 26], [0, 27], [1, 6], [1, 11], [1, 17], [1, 21], [1, 23], [1, 27], [1, 30], [2, 3], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 13], [2, 14], [2, 16], [2, 21], [2, 28], [2, 29], [2, 30], [2, 31], [3, 4], [3, 6], [3, 11], [3, 12], [3, 2... | null | null | null | {"independent_set": [0, 1, 3, 7, 8, 9, 10, 13, 15, 16, 18, 19, 22, 24, 28, 31]} | 1 |
construct-nppc-independent-set-l4-s3 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 4 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 32 vertices labelled 0..31 and 200 edges:
[[0, 4], [0, 9], [0, 13], [0, 14], [0, 16], [0, 17], [0, 19], [0, 23], [0, 28], [0, 31], [1, 9], [1, 13], [1, 14], [1, 16], [1, 17], [1, 20], [1, 22], [1, 26], [1, 29], [2, 9], [2, 11], [2, 20], [2, 22], [2, 23], [2, 25], [2, 26], [2, 29], [2, 31], [3, 4],... | {"num_nodes": 32, "k": 16, "edges": [[0, 4], [0, 9], [0, 13], [0, 14], [0, 16], [0, 17], [0, 19], [0, 23], [0, 28], [0, 31], [1, 9], [1, 13], [1, 14], [1, 16], [1, 17], [1, 20], [1, 22], [1, 26], [1, 29], [2, 9], [2, 11], [2, 20], [2, 22], [2, 23], [2, 25], [2, 26], [2, 29], [2, 31], [3, 4], [3, 13], [3, 17], [3, 29], ... | null | null | null | {"independent_set": [0, 1, 2, 3, 5, 6, 7, 8, 10, 12, 15, 18, 21, 24, 27, 30]} | 1 |
construct-nppc-independent-set-l4-s4 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 4 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 32 vertices labelled 0..31 and 201 edges:
[[0, 1], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 13], [0, 14], [0, 16], [0, 18], [0, 21], [0, 23], [0, 24], [0, 25], [0, 26], [0, 31], [1, 4], [1, 7], [1, 8], [1, 11], [1, 13], [1, 15], [1, 16], [1, 17], [1, 21], [2, 11], [2, 13], [2, ... | {"num_nodes": 32, "k": 16, "edges": [[0, 1], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 13], [0, 14], [0, 16], [0, 18], [0, 21], [0, 23], [0, 24], [0, 25], [0, 26], [0, 31], [1, 4], [1, 7], [1, 8], [1, 11], [1, 13], [1, 15], [1, 16], [1, 17], [1, 21], [2, 11], [2, 13], [2, 17], [2, 18], [2, 25], [2, 2... | null | null | null | {"independent_set": [1, 2, 3, 5, 6, 9, 10, 12, 14, 19, 20, 22, 23, 24, 30, 31]} | 1 |
construct-nppc-independent-set-l4-s5 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 4 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 32 vertices labelled 0..31 and 200 edges:
[[0, 2], [0, 4], [0, 7], [0, 9], [0, 11], [0, 14], [0, 15], [0, 16], [0, 20], [0, 22], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [1, 2], [1, 7], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 18], [1, 19], [1, 20], [1, 21], ... | {"num_nodes": 32, "k": 16, "edges": [[0, 2], [0, 4], [0, 7], [0, 9], [0, 11], [0, 14], [0, 15], [0, 16], [0, 20], [0, 22], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [1, 2], [1, 7], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 24], [1, 25], [... | null | null | null | {"independent_set": [2, 3, 7, 10, 11, 13, 14, 18, 19, 20, 21, 22, 24, 27, 29, 31]} | 1 |
construct-nppc-independent-set-l4-s6 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 4 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 32 vertices labelled 0..31 and 185 edges:
[[0, 2], [0, 3], [0, 4], [0, 7], [0, 8], [0, 9], [0, 10], [0, 12], [0, 13], [0, 15], [0, 17], [0, 20], [0, 22], [0, 23], [0, 24], [0, 26], [0, 28], [0, 29], [0, 30], [0, 31], [1, 3], [1, 8], [1, 9], [1, 18], [1, 19], [1, 27], [1, 28], [2, 4], [2, 5], [2, 6... | {"num_nodes": 32, "k": 16, "edges": [[0, 2], [0, 3], [0, 4], [0, 7], [0, 8], [0, 9], [0, 10], [0, 12], [0, 13], [0, 15], [0, 17], [0, 20], [0, 22], [0, 23], [0, 24], [0, 26], [0, 28], [0, 29], [0, 30], [0, 31], [1, 3], [1, 8], [1, 9], [1, 18], [1, 19], [1, 27], [1, 28], [2, 4], [2, 5], [2, 6], [2, 9], [2, 11], [2, 12],... | null | null | null | {"independent_set": [1, 5, 7, 10, 11, 12, 14, 15, 16, 21, 23, 24, 25, 26, 29, 30]} | 1 |
construct-nppc-independent-set-l4-s7 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 4 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 32 vertices labelled 0..31 and 188 edges:
[[0, 2], [0, 11], [0, 14], [0, 15], [0, 16], [0, 17], [0, 19], [0, 20], [0, 28], [0, 30], [1, 2], [1, 13], [1, 17], [1, 19], [1, 20], [1, 28], [1, 30], [2, 4], [2, 5], [2, 6], [2, 7], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 20], [... | {"num_nodes": 32, "k": 16, "edges": [[0, 2], [0, 11], [0, 14], [0, 15], [0, 16], [0, 17], [0, 19], [0, 20], [0, 28], [0, 30], [1, 2], [1, 13], [1, 17], [1, 19], [1, 20], [1, 28], [1, 30], [2, 4], [2, 5], [2, 6], [2, 7], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 20], [2, 22], [2, 23], [2, 24], [2... | null | null | null | {"independent_set": [0, 1, 4, 5, 8, 9, 12, 18, 21, 22, 24, 25, 26, 27, 29, 31]} | 1 |
construct-nppc-independent-set-l4-s8 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 4 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 32 vertices labelled 0..31 and 195 edges:
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 10], [0, 12], [0, 14], [0, 15], [0, 16], [0, 20], [0, 23], [0, 28], [0, 29], [1, 3], [1, 4], [1, 5], [1, 6], [1, 10], [1, 11], [1, 14], [1, 16], [1, 17], [1, 18], [1, 22], [1, 24], [1, 26], [1, 29], [1, 30], [2, 3], [2,... | {"num_nodes": 32, "k": 16, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 10], [0, 12], [0, 14], [0, 15], [0, 16], [0, 20], [0, 23], [0, 28], [0, 29], [1, 3], [1, 4], [1, 5], [1, 6], [1, 10], [1, 11], [1, 14], [1, 16], [1, 17], [1, 18], [1, 22], [1, 24], [1, 26], [1, 29], [1, 30], [2, 3], [2, 4], [2, 10], [2, 11], [2, 1... | null | null | null | {"independent_set": [0, 2, 6, 7, 8, 9, 13, 17, 18, 19, 21, 22, 24, 25, 27, 30]} | 1 |
construct-nppc-independent-set-l4-s9 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 4 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 32 vertices labelled 0..31 and 170 edges:
[[0, 2], [0, 3], [0, 5], [0, 6], [0, 8], [0, 9], [0, 11], [0, 15], [0, 20], [0, 23], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 31], [1, 12], [1, 15], [1, 17], [1, 23], [1, 29], [2, 3], [2, 5], [2, 7], [2, 8], [2, 9], [2, 11], [2, 17], [2, 18], [2, 2... | {"num_nodes": 32, "k": 16, "edges": [[0, 2], [0, 3], [0, 5], [0, 6], [0, 8], [0, 9], [0, 11], [0, 15], [0, 20], [0, 23], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 31], [1, 12], [1, 15], [1, 17], [1, 23], [1, 29], [2, 3], [2, 5], [2, 7], [2, 8], [2, 9], [2, 11], [2, 17], [2, 18], [2, 20], [2, 23], [2, 26], [2, 30... | null | null | null | {"independent_set": [1, 3, 4, 5, 7, 9, 13, 14, 16, 21, 22, 24, 25, 27, 30, 31]} | 1 |
construct-nppc-independent-set-l5-s0 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 5 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 48 vertices labelled 0..47 and 424 edges:
[[0, 3], [0, 10], [0, 12], [0, 15], [0, 17], [0, 28], [0, 36], [0, 42], [0, 43], [1, 2], [1, 4], [1, 8], [1, 9], [1, 10], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 22], [1, 28], [1, 34], [1, 38], [1, 42], [1, 43], [1, 47], [2, 4], [2, 5], [2, 7], [2... | {"num_nodes": 48, "k": 24, "edges": [[0, 3], [0, 10], [0, 12], [0, 15], [0, 17], [0, 28], [0, 36], [0, 42], [0, 43], [1, 2], [1, 4], [1, 8], [1, 9], [1, 10], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 22], [1, 28], [1, 34], [1, 38], [1, 42], [1, 43], [1, 47], [2, 4], [2, 5], [2, 7], [2, 9], [2, 10], [2, 11], [2, ... | null | null | null | {"independent_set": [0, 1, 5, 6, 7, 11, 13, 14, 20, 21, 24, 25, 26, 29, 30, 31, 33, 35, 37, 39, 41, 44, 45, 46]} | 1 |
construct-nppc-independent-set-l5-s1 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 5 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 48 vertices labelled 0..47 and 411 edges:
[[0, 4], [0, 5], [0, 7], [0, 8], [0, 9], [0, 14], [0, 16], [0, 17], [0, 18], [0, 22], [0, 24], [0, 26], [0, 28], [0, 30], [0, 34], [0, 36], [0, 39], [0, 46], [1, 2], [1, 3], [1, 5], [1, 6], [1, 9], [1, 11], [1, 13], [1, 15], [1, 17], [1, 20], [1, 21], [1, ... | {"num_nodes": 48, "k": 24, "edges": [[0, 4], [0, 5], [0, 7], [0, 8], [0, 9], [0, 14], [0, 16], [0, 17], [0, 18], [0, 22], [0, 24], [0, 26], [0, 28], [0, 30], [0, 34], [0, 36], [0, 39], [0, 46], [1, 2], [1, 3], [1, 5], [1, 6], [1, 9], [1, 11], [1, 13], [1, 15], [1, 17], [1, 20], [1, 21], [1, 22], [1, 23], [1, 24], [1, 2... | null | null | null | {"independent_set": [2, 4, 6, 7, 9, 12, 14, 15, 16, 17, 18, 22, 23, 24, 28, 30, 32, 35, 36, 37, 39, 42, 45, 47]} | 1 |
construct-nppc-independent-set-l5-s2 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 5 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 48 vertices labelled 0..47 and 431 edges:
[[0, 1], [0, 5], [0, 6], [0, 7], [0, 8], [0, 13], [0, 17], [0, 28], [0, 29], [0, 39], [0, 43], [1, 2], [1, 3], [1, 5], [1, 7], [1, 8], [1, 9], [1, 10], [1, 13], [1, 16], [1, 19], [1, 20], [1, 21], [1, 22], [1, 26], [1, 27], [1, 28], [1, 39], [1, 40], [1, 4... | {"num_nodes": 48, "k": 24, "edges": [[0, 1], [0, 5], [0, 6], [0, 7], [0, 8], [0, 13], [0, 17], [0, 28], [0, 29], [0, 39], [0, 43], [1, 2], [1, 3], [1, 5], [1, 7], [1, 8], [1, 9], [1, 10], [1, 13], [1, 16], [1, 19], [1, 20], [1, 21], [1, 22], [1, 26], [1, 27], [1, 28], [1, 39], [1, 40], [1, 42], [1, 43], [1, 47], [2, 4]... | null | null | null | {"independent_set": [0, 3, 11, 14, 15, 16, 20, 22, 23, 24, 26, 31, 32, 33, 34, 35, 37, 38, 40, 42, 44, 45, 46, 47]} | 1 |
construct-nppc-independent-set-l5-s3 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 5 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 48 vertices labelled 0..47 and 424 edges:
[[0, 12], [0, 19], [0, 25], [0, 28], [0, 29], [0, 31], [0, 32], [0, 33], [0, 35], [0, 41], [0, 44], [0, 46], [0, 47], [1, 13], [1, 19], [1, 27], [1, 28], [1, 29], [1, 32], [1, 33], [1, 35], [1, 38], [1, 39], [1, 41], [1, 44], [1, 47], [2, 4], [2, 10], [2, ... | {"num_nodes": 48, "k": 24, "edges": [[0, 12], [0, 19], [0, 25], [0, 28], [0, 29], [0, 31], [0, 32], [0, 33], [0, 35], [0, 41], [0, 44], [0, 46], [0, 47], [1, 13], [1, 19], [1, 27], [1, 28], [1, 29], [1, 32], [1, 33], [1, 35], [1, 38], [1, 39], [1, 41], [1, 44], [1, 47], [2, 4], [2, 10], [2, 12], [2, 13], [2, 25], [2, 2... | null | null | null | {"independent_set": [0, 1, 2, 3, 5, 6, 7, 8, 9, 11, 14, 15, 16, 18, 21, 22, 23, 24, 26, 37, 40, 42, 43, 45]} | 1 |
construct-nppc-independent-set-l5-s4 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 5 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 48 vertices labelled 0..47 and 429 edges:
[[0, 1], [0, 3], [0, 4], [0, 12], [0, 15], [0, 16], [0, 19], [0, 21], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 35], [0, 38], [0, 42], [0, 44], [0, 45], [0, 46], [0, 47], [1, 2], [1, 5], [1, 8], [1, 20], [1, 22], [1, 24], ... | {"num_nodes": 48, "k": 24, "edges": [[0, 1], [0, 3], [0, 4], [0, 12], [0, 15], [0, 16], [0, 19], [0, 21], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 35], [0, 38], [0, 42], [0, 44], [0, 45], [0, 46], [0, 47], [1, 2], [1, 5], [1, 8], [1, 20], [1, 22], [1, 24], [1, 28], [1, 37], [1, 38], [... | null | null | null | {"independent_set": [1, 3, 4, 6, 9, 10, 11, 12, 14, 16, 17, 18, 19, 21, 23, 29, 31, 32, 33, 34, 35, 36, 42, 47]} | 1 |
construct-nppc-independent-set-l5-s5 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 5 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 48 vertices labelled 0..47 and 436 edges:
[[0, 3], [0, 5], [0, 7], [0, 12], [0, 14], [0, 17], [0, 30], [0, 34], [0, 36], [0, 44], [1, 2], [1, 4], [1, 6], [1, 8], [1, 12], [1, 15], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 24], [1, 26], [1, 31], [1, 32], [1, 33], [1, 35], [1, 37], [1, 38], [... | {"num_nodes": 48, "k": 24, "edges": [[0, 3], [0, 5], [0, 7], [0, 12], [0, 14], [0, 17], [0, 30], [0, 34], [0, 36], [0, 44], [1, 2], [1, 4], [1, 6], [1, 8], [1, 12], [1, 15], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 24], [1, 26], [1, 31], [1, 32], [1, 33], [1, 35], [1, 37], [1, 38], [1, 39], [1, 40], [1, 41], [1... | null | null | null | {"independent_set": [0, 2, 4, 6, 8, 9, 13, 15, 16, 18, 20, 21, 22, 23, 24, 25, 26, 31, 35, 38, 39, 42, 45, 47]} | 1 |
construct-nppc-independent-set-l5-s6 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 5 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 48 vertices labelled 0..47 and 411 edges:
[[0, 1], [0, 4], [0, 10], [0, 17], [0, 19], [0, 20], [0, 21], [0, 22], [0, 25], [0, 34], [0, 41], [0, 43], [0, 47], [1, 4], [1, 6], [1, 10], [1, 11], [1, 12], [1, 14], [1, 15], [1, 19], [1, 20], [1, 23], [1, 25], [1, 27], [1, 28], [1, 29], [1, 30], [1, 37]... | {"num_nodes": 48, "k": 24, "edges": [[0, 1], [0, 4], [0, 10], [0, 17], [0, 19], [0, 20], [0, 21], [0, 22], [0, 25], [0, 34], [0, 41], [0, 43], [0, 47], [1, 4], [1, 6], [1, 10], [1, 11], [1, 12], [1, 14], [1, 15], [1, 19], [1, 20], [1, 23], [1, 25], [1, 27], [1, 28], [1, 29], [1, 30], [1, 37], [1, 39], [1, 42], [1, 45],... | null | null | null | {"independent_set": [0, 2, 3, 5, 6, 8, 11, 12, 13, 14, 15, 16, 18, 23, 26, 27, 30, 31, 32, 35, 37, 38, 40, 44]} | 1 |
construct-nppc-independent-set-l5-s7 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 5 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 48 vertices labelled 0..47 and 419 edges:
[[0, 1], [0, 4], [0, 6], [0, 7], [0, 9], [0, 11], [0, 15], [0, 17], [0, 19], [0, 21], [0, 25], [0, 26], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 34], [0, 37], [0, 40], [1, 9], [1, 12], [1, 16], [1, 17], [1, 24], [1, 25], [1, 27], [1, 33], [1, 36], ... | {"num_nodes": 48, "k": 24, "edges": [[0, 1], [0, 4], [0, 6], [0, 7], [0, 9], [0, 11], [0, 15], [0, 17], [0, 19], [0, 21], [0, 25], [0, 26], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 34], [0, 37], [0, 40], [1, 9], [1, 12], [1, 16], [1, 17], [1, 24], [1, 25], [1, 27], [1, 33], [1, 36], [1, 38], [1, 39], [1, 40], [... | null | null | null | {"independent_set": [1, 2, 3, 7, 10, 13, 14, 15, 20, 21, 22, 23, 26, 28, 29, 30, 31, 32, 34, 35, 37, 41, 42, 43]} | 1 |
construct-nppc-independent-set-l5-s8 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 5 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 48 vertices labelled 0..47 and 413 edges:
[[0, 1], [0, 4], [0, 5], [0, 7], [0, 8], [0, 10], [0, 12], [0, 14], [0, 15], [0, 16], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 25], [0, 30], [0, 33], [0, 35], [0, 36], [0, 37], [0, 38], [0, 39], [0, 43], [0, 45], [1, 2], [1, 8], [1, 20], [1, 21], [... | {"num_nodes": 48, "k": 24, "edges": [[0, 1], [0, 4], [0, 5], [0, 7], [0, 8], [0, 10], [0, 12], [0, 14], [0, 15], [0, 16], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 25], [0, 30], [0, 33], [0, 35], [0, 36], [0, 37], [0, 38], [0, 39], [0, 43], [0, 45], [1, 2], [1, 8], [1, 20], [1, 21], [1, 22], [1, 23], [1, 32], [1... | null | null | null | {"independent_set": [1, 4, 5, 6, 9, 10, 13, 14, 17, 18, 19, 24, 25, 26, 27, 28, 30, 31, 35, 38, 39, 41, 42, 46]} | 1 |
construct-nppc-independent-set-l5-s9 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 5 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 48 vertices labelled 0..47 and 434 edges:
[[0, 1], [0, 2], [0, 7], [0, 8], [0, 11], [0, 14], [0, 15], [0, 16], [0, 19], [0, 21], [0, 23], [0, 27], [0, 30], [0, 31], [0, 33], [0, 36], [0, 43], [0, 46], [1, 4], [1, 6], [1, 7], [1, 9], [1, 11], [1, 12], [1, 13], [1, 15], [1, 16], [1, 18], [1, 19], [1... | {"num_nodes": 48, "k": 24, "edges": [[0, 1], [0, 2], [0, 7], [0, 8], [0, 11], [0, 14], [0, 15], [0, 16], [0, 19], [0, 21], [0, 23], [0, 27], [0, 30], [0, 31], [0, 33], [0, 36], [0, 43], [0, 46], [1, 4], [1, 6], [1, 7], [1, 9], [1, 11], [1, 12], [1, 13], [1, 15], [1, 16], [1, 18], [1, 19], [1, 21], [1, 23], [1, 24], [1,... | null | null | null | {"independent_set": [0, 3, 4, 9, 10, 12, 13, 17, 18, 22, 24, 25, 26, 28, 29, 32, 34, 37, 38, 39, 41, 42, 44, 45]} | 1 |
construct-nppc-independent-set-l6-s0 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 6 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 100 vertices labelled 0..99 and 1388 edges:
[[0, 1], [0, 4], [0, 7], [0, 10], [0, 12], [0, 13], [0, 22], [0, 26], [0, 36], [0, 37], [0, 38], [0, 40], [0, 41], [0, 50], [0, 52], [0, 53], [0, 54], [0, 56], [0, 64], [0, 70], [0, 80], [0, 85], [0, 92], [0, 99], [1, 6], [1, 13], [1, 15], [1, 19], [1, 2... | {"num_nodes": 100, "k": 30, "edges": [[0, 1], [0, 4], [0, 7], [0, 10], [0, 12], [0, 13], [0, 22], [0, 26], [0, 36], [0, 37], [0, 38], [0, 40], [0, 41], [0, 50], [0, 52], [0, 53], [0, 54], [0, 56], [0, 64], [0, 70], [0, 80], [0, 85], [0, 92], [0, 99], [1, 6], [1, 13], [1, 15], [1, 19], [1, 26], [1, 39], [1, 41], [1, 47]... | null | null | null | {"independent_set": [1, 2, 4, 16, 21, 22, 27, 31, 32, 34, 36, 42, 43, 44, 46, 49, 52, 55, 65, 67, 69, 79, 80, 82, 83, 86, 88, 90, 94, 96]} | 1 |
construct-nppc-independent-set-l6-s1 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 6 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 100 vertices labelled 0..99 and 1389 edges:
[[0, 4], [0, 5], [0, 7], [0, 12], [0, 15], [0, 17], [0, 18], [0, 20], [0, 24], [0, 26], [0, 27], [0, 30], [0, 31], [0, 32], [0, 35], [0, 37], [0, 43], [0, 46], [0, 48], [0, 49], [0, 51], [0, 53], [0, 59], [0, 63], [0, 65], [0, 78], [0, 80], [0, 87], [0, ... | {"num_nodes": 100, "k": 30, "edges": [[0, 4], [0, 5], [0, 7], [0, 12], [0, 15], [0, 17], [0, 18], [0, 20], [0, 24], [0, 26], [0, 27], [0, 30], [0, 31], [0, 32], [0, 35], [0, 37], [0, 43], [0, 46], [0, 48], [0, 49], [0, 51], [0, 53], [0, 59], [0, 63], [0, 65], [0, 78], [0, 80], [0, 87], [0, 92], [0, 93], [0, 95], [0, 96... | null | null | null | {"independent_set": [1, 4, 5, 9, 25, 31, 32, 33, 34, 36, 37, 42, 45, 48, 52, 53, 58, 60, 63, 70, 78, 82, 83, 84, 88, 89, 93, 95, 98, 99]} | 1 |
construct-nppc-independent-set-l6-s2 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 6 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 100 vertices labelled 0..99 and 1357 edges:
[[0, 11], [0, 14], [0, 19], [0, 22], [0, 24], [0, 25], [0, 27], [0, 28], [0, 32], [0, 43], [0, 44], [0, 47], [0, 48], [0, 54], [0, 58], [0, 65], [0, 71], [0, 72], [0, 73], [0, 74], [0, 75], [0, 77], [0, 79], [0, 80], [0, 82], [0, 83], [0, 87], [0, 89], [... | {"num_nodes": 100, "k": 30, "edges": [[0, 11], [0, 14], [0, 19], [0, 22], [0, 24], [0, 25], [0, 27], [0, 28], [0, 32], [0, 43], [0, 44], [0, 47], [0, 48], [0, 54], [0, 58], [0, 65], [0, 71], [0, 72], [0, 73], [0, 74], [0, 75], [0, 77], [0, 79], [0, 80], [0, 82], [0, 83], [0, 87], [0, 89], [0, 90], [0, 95], [1, 5], [1, ... | null | null | null | {"independent_set": [1, 6, 7, 9, 10, 14, 20, 26, 27, 29, 31, 33, 34, 36, 41, 47, 48, 53, 55, 57, 61, 63, 64, 69, 76, 80, 85, 86, 91, 92]} | 1 |
construct-nppc-independent-set-l6-s3 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 6 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 100 vertices labelled 0..99 and 1267 edges:
[[0, 3], [0, 4], [0, 11], [0, 26], [0, 30], [0, 33], [0, 38], [0, 51], [0, 53], [0, 58], [0, 62], [0, 63], [0, 64], [0, 65], [0, 67], [0, 86], [0, 89], [0, 94], [1, 4], [1, 5], [1, 14], [1, 17], [1, 19], [1, 22], [1, 28], [1, 29], [1, 40], [1, 41], [1, 4... | {"num_nodes": 100, "k": 30, "edges": [[0, 3], [0, 4], [0, 11], [0, 26], [0, 30], [0, 33], [0, 38], [0, 51], [0, 53], [0, 58], [0, 62], [0, 63], [0, 64], [0, 65], [0, 67], [0, 86], [0, 89], [0, 94], [1, 4], [1, 5], [1, 14], [1, 17], [1, 19], [1, 22], [1, 28], [1, 29], [1, 40], [1, 41], [1, 42], [1, 43], [1, 46], [1, 48]... | null | null | null | {"independent_set": [3, 6, 9, 14, 15, 19, 23, 25, 27, 29, 32, 35, 38, 41, 47, 48, 55, 56, 58, 61, 66, 67, 72, 81, 82, 83, 88, 93, 98, 99]} | 1 |
construct-nppc-independent-set-l6-s4 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 6 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 100 vertices labelled 0..99 and 1378 edges:
[[0, 4], [0, 9], [0, 12], [0, 14], [0, 17], [0, 27], [0, 31], [0, 33], [0, 46], [0, 47], [0, 56], [0, 57], [0, 58], [0, 68], [0, 72], [0, 73], [0, 74], [0, 75], [0, 84], [0, 85], [0, 92], [1, 3], [1, 4], [1, 5], [1, 11], [1, 16], [1, 36], [1, 37], [1, 46... | {"num_nodes": 100, "k": 30, "edges": [[0, 4], [0, 9], [0, 12], [0, 14], [0, 17], [0, 27], [0, 31], [0, 33], [0, 46], [0, 47], [0, 56], [0, 57], [0, 58], [0, 68], [0, 72], [0, 73], [0, 74], [0, 75], [0, 84], [0, 85], [0, 92], [1, 3], [1, 4], [1, 5], [1, 11], [1, 16], [1, 36], [1, 37], [1, 46], [1, 56], [1, 57], [1, 58],... | null | null | null | {"independent_set": [0, 1, 7, 8, 10, 20, 23, 25, 26, 30, 32, 35, 42, 51, 52, 55, 60, 62, 65, 70, 76, 77, 78, 80, 86, 89, 90, 91, 94, 95]} | 1 |
construct-nppc-independent-set-l6-s5 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 6 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 100 vertices labelled 0..99 and 1330 edges:
[[0, 4], [0, 7], [0, 8], [0, 12], [0, 15], [0, 20], [0, 22], [0, 24], [0, 25], [0, 34], [0, 42], [0, 45], [0, 47], [0, 50], [0, 51], [0, 55], [0, 60], [0, 62], [0, 67], [0, 69], [0, 73], [0, 76], [0, 79], [0, 82], [0, 88], [0, 94], [1, 2], [1, 4], [1, 11... | {"num_nodes": 100, "k": 30, "edges": [[0, 4], [0, 7], [0, 8], [0, 12], [0, 15], [0, 20], [0, 22], [0, 24], [0, 25], [0, 34], [0, 42], [0, 45], [0, 47], [0, 50], [0, 51], [0, 55], [0, 60], [0, 62], [0, 67], [0, 69], [0, 73], [0, 76], [0, 79], [0, 82], [0, 88], [0, 94], [1, 2], [1, 4], [1, 11], [1, 12], [1, 15], [1, 16],... | null | null | null | {"independent_set": [5, 9, 10, 13, 16, 21, 27, 31, 32, 33, 34, 43, 45, 48, 49, 54, 60, 66, 68, 69, 78, 79, 81, 84, 86, 88, 90, 91, 93, 94]} | 1 |
construct-nppc-independent-set-l6-s6 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 6 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 100 vertices labelled 0..99 and 1358 edges:
[[0, 1], [0, 9], [0, 11], [0, 14], [0, 16], [0, 21], [0, 24], [0, 28], [0, 30], [0, 39], [0, 42], [0, 44], [0, 45], [0, 46], [0, 51], [0, 54], [0, 58], [0, 65], [0, 69], [0, 70], [0, 71], [0, 72], [0, 73], [0, 80], [0, 82], [0, 84], [0, 87], [0, 96], [0,... | {"num_nodes": 100, "k": 30, "edges": [[0, 1], [0, 9], [0, 11], [0, 14], [0, 16], [0, 21], [0, 24], [0, 28], [0, 30], [0, 39], [0, 42], [0, 44], [0, 45], [0, 46], [0, 51], [0, 54], [0, 58], [0, 65], [0, 69], [0, 70], [0, 71], [0, 72], [0, 73], [0, 80], [0, 82], [0, 84], [0, 87], [0, 96], [0, 98], [1, 5], [1, 9], [1, 10]... | null | null | null | {"independent_set": [0, 3, 12, 13, 15, 22, 23, 32, 33, 35, 36, 38, 41, 47, 49, 56, 59, 60, 61, 74, 75, 81, 83, 88, 89, 91, 92, 93, 94, 97]} | 1 |
construct-nppc-independent-set-l6-s7 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 6 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 100 vertices labelled 0..99 and 1347 edges:
[[0, 2], [0, 5], [0, 9], [0, 10], [0, 11], [0, 12], [0, 16], [0, 18], [0, 24], [0, 26], [0, 28], [0, 29], [0, 31], [0, 32], [0, 33], [0, 34], [0, 41], [0, 42], [0, 43], [0, 47], [0, 50], [0, 52], [0, 56], [0, 61], [0, 69], [0, 72], [0, 74], [0, 76], [0, ... | {"num_nodes": 100, "k": 30, "edges": [[0, 2], [0, 5], [0, 9], [0, 10], [0, 11], [0, 12], [0, 16], [0, 18], [0, 24], [0, 26], [0, 28], [0, 29], [0, 31], [0, 32], [0, 33], [0, 34], [0, 41], [0, 42], [0, 43], [0, 47], [0, 50], [0, 52], [0, 56], [0, 61], [0, 69], [0, 72], [0, 74], [0, 76], [0, 77], [0, 85], [0, 89], [0, 90... | null | null | null | {"independent_set": [1, 5, 9, 16, 22, 25, 26, 27, 30, 31, 35, 37, 56, 57, 58, 61, 63, 68, 71, 72, 74, 80, 83, 84, 86, 88, 89, 93, 94, 98]} | 1 |
construct-nppc-independent-set-l6-s8 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 6 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 100 vertices labelled 0..99 and 1377 edges:
[[0, 4], [0, 13], [0, 15], [0, 21], [0, 26], [0, 28], [0, 43], [0, 49], [0, 54], [0, 62], [0, 73], [0, 74], [0, 75], [0, 90], [0, 91], [0, 96], [0, 97], [0, 99], [1, 10], [1, 11], [1, 21], [1, 32], [1, 37], [1, 39], [1, 42], [1, 45], [1, 52], [1, 53], [1... | {"num_nodes": 100, "k": 30, "edges": [[0, 4], [0, 13], [0, 15], [0, 21], [0, 26], [0, 28], [0, 43], [0, 49], [0, 54], [0, 62], [0, 73], [0, 74], [0, 75], [0, 90], [0, 91], [0, 96], [0, 97], [0, 99], [1, 10], [1, 11], [1, 21], [1, 32], [1, 37], [1, 39], [1, 42], [1, 45], [1, 52], [1, 53], [1, 61], [1, 72], [1, 74], [1, ... | null | null | null | {"independent_set": [0, 1, 2, 6, 7, 16, 19, 20, 22, 23, 29, 31, 33, 36, 44, 48, 50, 56, 59, 60, 64, 67, 69, 76, 78, 80, 84, 88, 92, 95]} | 1 |
construct-nppc-independent-set-l6-s9 | construct | nppc_independent_set | graph_independent_set | graph_theory | competition | 6 | NPPC/independent_set | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 100 vertices labelled 0..99 and 1322 edges:
[[0, 3], [0, 5], [0, 8], [0, 9], [0, 11], [0, 17], [0, 18], [0, 20], [0, 24], [0, 26], [0, 40], [0, 45], [0, 46], [0, 48], [0, 53], [0, 56], [0, 59], [0, 60], [0, 61], [0, 64], [0, 67], [0, 72], [0, 75], [0, 76], [0, 78], [0, 79], [0, 80], [0, 82], [0, 8... | {"num_nodes": 100, "k": 30, "edges": [[0, 3], [0, 5], [0, 8], [0, 9], [0, 11], [0, 17], [0, 18], [0, 20], [0, 24], [0, 26], [0, 40], [0, 45], [0, 46], [0, 48], [0, 53], [0, 56], [0, 59], [0, 60], [0, 61], [0, 64], [0, 67], [0, 72], [0, 75], [0, 76], [0, 78], [0, 79], [0, 80], [0, 82], [0, 84], [0, 92], [0, 98], [1, 5],... | null | null | null | {"independent_set": [6, 11, 20, 21, 25, 27, 28, 31, 34, 38, 40, 42, 45, 46, 49, 55, 56, 59, 61, 65, 66, 69, 70, 75, 79, 81, 86, 88, 93, 97]} | 1 |
construct-nppc-quad-diophantine-l1-s0 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 1 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
31 * x^2 + 49 * y = 75411
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded. Ther... | {"a": 31, "b": 49, "c": 75411, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 49, "y": 20} | 1 |
construct-nppc-quad-diophantine-l1-s1 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 1 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
35 * x^2 + 28 * y = 4263
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded. There... | {"a": 35, "b": 28, "c": 4263, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 11, "y": 1} | 1 |
construct-nppc-quad-diophantine-l1-s2 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 1 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
4 * x^2 + 37 * y = 2800
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded. There ... | {"a": 4, "b": 37, "c": 2800, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 16, "y": 48} | 1 |
construct-nppc-quad-diophantine-l1-s3 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 1 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
34 * x^2 + 45 * y = 83794
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded. Ther... | {"a": 34, "b": 45, "c": 83794, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 49, "y": 48} | 1 |
construct-nppc-quad-diophantine-l1-s4 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 1 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
17 * x^2 + 20 * y = 36572
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded. Ther... | {"a": 17, "b": 20, "c": 36572, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 46, "y": 30} | 1 |
construct-nppc-quad-diophantine-l1-s5 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 1 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
39 * x^2 + 42 * y = 16986
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded. Ther... | {"a": 39, "b": 42, "c": 16986, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 20, "y": 33} | 1 |
construct-nppc-quad-diophantine-l1-s6 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 1 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
39 * x^2 + 34 * y = 76728
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded. Ther... | {"a": 39, "b": 34, "c": 76728, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 44, "y": 36} | 1 |
construct-nppc-quad-diophantine-l1-s7 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 1 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
32 * x^2 + 15 * y = 2168
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded. There... | {"a": 32, "b": 15, "c": 2168, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 7, "y": 40} | 1 |
construct-nppc-quad-diophantine-l1-s8 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 1 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
33 * x^2 + 6 * y = 3534
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded. There ... | {"a": 33, "b": 6, "c": 3534, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 10, "y": 39} | 1 |
construct-nppc-quad-diophantine-l1-s9 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 1 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
33 * x^2 + 14 * y = 1399
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded. There... | {"a": 33, "b": 14, "c": 1399, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 5, "y": 41} | 1 |
construct-nppc-quad-diophantine-l2-s0 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 2 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
549 * x^2 + 298 * y = 388500505
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded... | {"a": 549, "b": 298, "c": 388500505, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 841, "y": 682} | 1 |
construct-nppc-quad-diophantine-l2-s1 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 2 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
859 * x^2 + 695 * y = 630079779
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded... | {"a": 859, "b": 695, "c": 630079779, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 856, "y": 949} | 1 |
construct-nppc-quad-diophantine-l2-s2 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 2 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
329 * x^2 + 976 * y = 782785
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded. T... | {"a": 329, "b": 976, "c": 782785, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 3, "y": 799} | 1 |
construct-nppc-quad-diophantine-l2-s3 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 2 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
600 * x^2 + 237 * y = 20676252
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded.... | {"a": 600, "b": 237, "c": 20676252, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 185, "y": 596} | 1 |
construct-nppc-quad-diophantine-l2-s4 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 2 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
698 * x^2 + 71 * y = 731295
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded. Th... | {"a": 698, "b": 71, "c": 731295, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 32, "y": 233} | 1 |
construct-nppc-quad-diophantine-l2-s5 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 2 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
606 * x^2 + 922 * y = 600521258
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded... | {"a": 606, "b": 922, "c": 600521258, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 995, "y": 614} | 1 |
construct-nppc-quad-diophantine-l2-s6 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 2 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
603 * x^2 + 963 * y = 2436381
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded. ... | {"a": 603, "b": 963, "c": 2436381, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 62, "y": 123} | 1 |
construct-nppc-quad-diophantine-l2-s7 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 2 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
826 * x^2 + 935 * y = 347643869
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded... | {"a": 826, "b": 935, "c": 347643869, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 648, "y": 859} | 1 |
construct-nppc-quad-diophantine-l2-s8 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 2 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
74 * x^2 + 830 * y = 217514
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded. Th... | {"a": 74, "b": 830, "c": 217514, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 34, "y": 159} | 1 |
construct-nppc-quad-diophantine-l2-s9 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 2 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
760 * x^2 + 418 * y = 187894458
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is graded... | {"a": 760, "b": 418, "c": 187894458, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 497, "y": 401} | 1 |
construct-nppc-quad-diophantine-l3-s0 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 3 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
5643 * x^2 + 2326 * y = 363873785268
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is g... | {"a": 5643, "b": 2326, "c": 363873785268, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 8030, "y": 3468} | 1 |
construct-nppc-quad-diophantine-l3-s1 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 3 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
7555 * x^2 + 9939 * y = 169692304042
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is g... | {"a": 7555, "b": 9939, "c": 169692304042, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 4739, "y": 2133} | 1 |
construct-nppc-quad-diophantine-l3-s2 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 3 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
1340 * x^2 + 1357 * y = 72985104990
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is gr... | {"a": 1340, "b": 1357, "c": 72985104990, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 7380, "y": 2070} | 1 |
construct-nppc-quad-diophantine-l3-s3 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 3 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
5129 * x^2 + 9237 * y = 8430438837
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is gra... | {"a": 5129, "b": 9237, "c": 8430438837, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 1278, "y": 5773} | 1 |
construct-nppc-quad-diophantine-l3-s4 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 3 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
1991 * x^2 + 7382 * y = 159310156430
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is g... | {"a": 1991, "b": 7382, "c": 159310156430, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 8944, "y": 5397} | 1 |
construct-nppc-quad-diophantine-l3-s5 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 3 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
6397 * x^2 + 1378 * y = 181462489146
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is g... | {"a": 6397, "b": 1378, "c": 181462489146, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 5326, "y": 2483} | 1 |
construct-nppc-quad-diophantine-l3-s6 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 3 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
8735 * x^2 + 344 * y = 280407895
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is grade... | {"a": 8735, "b": 344, "c": 280407895, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 179, "y": 1540} | 1 |
construct-nppc-quad-diophantine-l3-s7 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 3 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
4235 * x^2 + 1017 * y = 380434568
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is grad... | {"a": 4235, "b": 1017, "c": 380434568, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 296, "y": 9224} | 1 |
construct-nppc-quad-diophantine-l3-s8 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 3 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
8536 * x^2 + 6523 * y = 309502648565
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is g... | {"a": 8536, "b": 6523, "c": 309502648565, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 6021, "y": 7943} | 1 |
construct-nppc-quad-diophantine-l3-s9 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 3 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
4277 * x^2 + 8140 * y = 51949978765
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` is gr... | {"a": 4277, "b": 8140, "c": 51949978765, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 3485, "y": 596} | 1 |
construct-nppc-quad-diophantine-l4-s0 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 4 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
103907 * x^2 + 82853 * y = 214886170432637
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json... | {"a": 103907, "b": 82853, "c": 214886170432637, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 45475, "y": 108954} | 1 |
construct-nppc-quad-diophantine-l4-s1 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 4 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
76740 * x^2 + 92097 * y = 1667145434612901
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json... | {"a": 76740, "b": 92097, "c": 1667145434612901, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 147392, "y": 161253} | 1 |
construct-nppc-quad-diophantine-l4-s2 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 4 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
25872 * x^2 + 90714 * y = 607691258881800
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json`... | {"a": 25872, "b": 90714, "c": 607691258881800, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 153258, "y": 103028} | 1 |
construct-nppc-quad-diophantine-l4-s3 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 4 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
38713 * x^2 + 92878 * y = 202711195339846
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json`... | {"a": 38713, "b": 92878, "c": 202711195339846, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 72360, "y": 119557} | 1 |
construct-nppc-quad-diophantine-l4-s4 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 4 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
95238 * x^2 + 136504 * y = 339468950122904
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json... | {"a": 95238, "b": 136504, "c": 339468950122904, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 59702, "y": 68888} | 1 |
construct-nppc-quad-diophantine-l4-s5 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 4 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
110449 * x^2 + 118656 * y = 29596902067584
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json... | {"a": 110449, "b": 118656, "c": 29596902067584, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 16368, "y": 53543} | 1 |
construct-nppc-quad-diophantine-l4-s6 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 4 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
99724 * x^2 + 66616 * y = 58211444847164
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json` ... | {"a": 99724, "b": 66616, "c": 58211444847164, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 24159, "y": 102170} | 1 |
construct-nppc-quad-diophantine-l4-s7 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 4 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
72738 * x^2 + 157036 * y = 1490949905830426
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.jso... | {"a": 72738, "b": 157036, "c": 1490949905830426, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 143169, "y": 81178} | 1 |
construct-nppc-quad-diophantine-l4-s8 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 4 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
157334 * x^2 + 37155 * y = 2190872876984834
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.jso... | {"a": 157334, "b": 37155, "c": 2190872876984834, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 118004, "y": 154358} | 1 |
construct-nppc-quad-diophantine-l4-s9 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 4 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
130169 * x^2 + 175976 * y = 1830899032512
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answer.json`... | {"a": 130169, "b": 175976, "c": 1830899032512, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 3740, "y": 57662} | 1 |
construct-nppc-quad-diophantine-l5-s0 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 5 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
583055 * x^2 + 3680858 * y = 1957469919416979390
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answe... | {"a": 583055, "b": 3680858, "c": 1957469919416979390, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 1832282, "y": 1154165} | 1 |
construct-nppc-quad-diophantine-l5-s1 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 5 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
9015808 * x^2 + 9542840 * y = 22638661875400552160
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/ans... | {"a": 9015808, "b": 9542840, "c": 22638661875400552160, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 1584610, "y": 7177604} | 1 |
construct-nppc-quad-diophantine-l5-s2 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 5 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
4515263 * x^2 + 9192465 * y = 276498170473371156270
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/an... | {"a": 4515263, "b": 9192465, "c": 276498170473371156270, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 7825365, "y": 220983} | 1 |
construct-nppc-quad-diophantine-l5-s3 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 5 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
3901773 * x^2 + 6726142 * y = 88818575970623863070
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/ans... | {"a": 3901773, "b": 6726142, "c": 88818575970623863070, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 4771126, "y": 1060091} | 1 |
construct-nppc-quad-diophantine-l5-s4 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 5 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
1539454 * x^2 + 7093930 * y = 37388191491942086216
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/ans... | {"a": 1539454, "b": 7093930, "c": 37388191491942086216, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 4928147, "y": 5271961} | 1 |
construct-nppc-quad-diophantine-l5-s5 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 5 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
3939428 * x^2 + 1640053 * y = 369381084400461420467
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/an... | {"a": 3939428, "b": 1640053, "c": 369381084400461420467, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 9683241, "y": 1456883} | 1 |
construct-nppc-quad-diophantine-l5-s6 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 5 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
9630129 * x^2 + 5163375 * y = 38529836699386904199
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/ans... | {"a": 9630129, "b": 5163375, "c": 38529836699386904199, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 2000241, "y": 7106922} | 1 |
construct-nppc-quad-diophantine-l5-s7 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 5 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
6949487 * x^2 + 21270 * y = 145630116718375706600
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answ... | {"a": 6949487, "b": 21270, "c": 145630116718375706600, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 4577720, "y": 6180540} | 1 |
construct-nppc-quad-diophantine-l5-s8 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 5 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
5542964 * x^2 + 274398 * y = 81629428952291573792
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answ... | {"a": 5542964, "b": 274398, "c": 81629428952291573792, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 3837535, "y": 997354} | 1 |
construct-nppc-quad-diophantine-l5-s9 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 5 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
8800349 * x^2 + 6412954 * y = 2190197601323440210
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only `/workdir/answ... | {"a": 8800349, "b": 6412954, "c": 2190197601323440210, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 498868, "y": 9522821} | 1 |
construct-nppc-quad-diophantine-l6-s0 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 6 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
5877870180 * x^2 + 3987024243 * y = 166435860223745549608143329040
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. On... | {"a": 5877870180, "b": 3987024243, "c": 166435860223745549608143329040, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 5321247480, "y": 5743183280} | 1 |
construct-nppc-quad-diophantine-l6-s1 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 6 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
3308500998 * x^2 + 9524488904 * y = 5031832088770617016907664376
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only... | {"a": 3308500998, "b": 9524488904, "c": 5031832088770617016907664376, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 1233239524, "y": 582547307} | 1 |
construct-nppc-quad-diophantine-l6-s2 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 6 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
1237432915 * x^2 + 1095508825 * y = 67618899370475198423419290835
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Onl... | {"a": 1237432915, "b": 1095508825, "c": 67618899370475198423419290835, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 7392191632, "y": 4887119115} | 1 |
construct-nppc-quad-diophantine-l6-s3 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 6 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
4787828032 * x^2 + 8984156428 * y = 162393729631277195717677124568
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. On... | {"a": 4787828032, "b": 8984156428, "c": 162393729631277195717677124568, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 5823919407, "y": 5688842850} | 1 |
construct-nppc-quad-diophantine-l6-s4 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 6 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
6204434225 * x^2 + 5722084952 * y = 1251572483655086075961002985
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. Only... | {"a": 6204434225, "b": 5722084952, "c": 1251572483655086075961002985, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 449135011, "y": 265309130} | 1 |
construct-nppc-quad-diophantine-l6-s5 | construct | nppc_quad_diophantine | quadratic_diophantine_ax2_by_c | number_theory | competition | 6 | NPPC/quad_diop_equ | MIT | [
"agentic_trivial",
"np_search"
] | Find positive integers x and y (x >= 1, y >= 1) such that
9827784743 * x^2 + 1297521230 * y = 170925871072130354043696519463
Answer format: {"x": <integer>, "y": <integer>} (JSON integers, exact).
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.json`. On... | {"a": 9827784743, "b": 1297521230, "c": 170925871072130354043696519463, "family": "nppc_quad_diophantine", "subset": "construct"} | null | null | null | {"x": 4170384359, "y": 5716432456} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.