data_source stringclasses 10
values | prompt listlengths 1 1 | reward_model dict | extra_info dict |
|---|---|---|---|
bootcamp/NpSetCover | [
{
"content": "'Introduction': 'You are a great expert solving set-cover question. You should propose a solution to this question.', 'Task description': 'Given a universal set U and a collection of subsets S, the Set Cover Problem aims to find the smallest possible sub-collection of S whose union equals U. In o... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"U\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], \"S\": {\"0\": [6, 0], \"1\": [6, 3], \"2\": [5, 8, 3, 1], \"3\": [9, 7, 4, 6], \"4\": [9, 5, 2], \"5\": [9, 7]}}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 146,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [6, 10, 14], \"1\": [2, 15, 3, 6, 11, 12, 19], \"2\": [3, 1, 5, 10, 13, 14, 18], \"3\": [19, 2, 1, 11, 15, 17], \"4\": [5, 17, 7], \"5\": [4, 9, 2, 8, 13], \"6\": [7, 0, 1, 12], \"7\": [9, 6, 4, 8, 10], \"8\": [14, 11, 5, 7, 9], \"9\": [5, 7, 8, 10, ... | {
"generator_name": "easy",
"index": 136,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"2\": 9, \"3\": 10, \"4\": 10, \"6\": 9, \"7\": 8, \"9\": 8, \"10\": 10, \"12\": 8, \"13\": 10, \"41\": 6}, \"1\": {\"2\": 9, \"3\": 9, \"4\": 8, \"6\": 10, \"7\": 9, \"9\": 10, \"10\": 8, \"12\": 8, \"13\": 8, \"23\": 2, \"21\": 1, \"40\": 5}, \"2... | {
"generator_name": "easy",
"index": 103,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumSet | [
{
"content": "'Introduction': 'You are a great expert solving maximum-set question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Independent Set Problem aims to find the largest set of vertices where no two vertices are adjacent (i.e., no two vert... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"2\": 1, \"4\": 1, \"9\": 1, \"3\": 1}, \"1\": {\"2\": 1, \"7\": 1}, \"2\": {\"11\": 1, \"13\": 1, \"6\": 1, \"3\": 1, \"0\": 1, \"1\": 1, \"5\": 1, \"12\": 1}, \"3\": {\"2\": 1, \"10\": 1, \"4\": 1, \"7\": 1, \"13\": 1, \"16\": 1, \"0\": 1, \"5\":... | {
"generator_name": "easy",
"index": 66,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 171, \"items\": {\"2\": {\"weight\": 8, \"value\": 14}, \"4\": {\"weight\": 18, \"value\": 32}, \"6\": {\"weight\": 16, \"value\": 30}, \"9\": {\"weight\": 20, \"value\": 42}, \"10\": {\"weight\": 6, \"value\": 10}, \"14\": {\"weight\": 18, \"... | {
"generator_name": "easy",
"index": 3,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"1\": 9, \"2\": 9, \"4\": 10, \"5\": 8, \"6\": 8, \"7\": 9, \"8\": 10, \"9\": 10, \"11\": 10, \"13\": 10, \"10\": 1, \"19\": 3, \"27\": 2, \"12\": 6, \"14\": 2}, \"1\": {\"3\": 1, \"0\": 9, \"2\": 9, \"4\": 9, \"5\": 8, \"8\": 10, \"9\": 8, \"13\":... | {
"generator_name": "easy",
"index": 63,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [0, 3, 4], \"duration\": 60}, \"1\": {\"attendees\": [1, 3, 4], \"duration\": 90}, \"2\": {\"attendees\": [0, 1], \"duration\": 30}, \"3\": {\"attendees\": [1, 2], \"duration\": 90}}, \"attendee_availability\": {\"0\": ... | {
"generator_name": "easy",
"index": 12,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [1, 6], \"1\": [0], \"2\": [8, 3], \"3\": [2, 5, 8], \"4\": [11, 5], \"5\": [3, 4, 6, 7], \"6\": [11, 0, 5, 8], \"7\": [5], \"8\": [2, 10, 3, 6], \"9\": [], \"10\": [8], \"11\": [4, 6]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 68,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 51, \"2\": 80, \"3\": 73, \"4\": 34, \"5\": 74, \"6\": 81, \"7\": 34, \"8\": 59, \"9\": 77, \"10\": 51, \"11\": 77, \"12\": 36}, \"1\": {\"0\": 51, \"1\": 0, \"2\": 77, \"3\": 17, \"4\": 81, \"5\": 72, \"6\": 37, \"7\": 33, \"8\": 7... | {
"generator_name": "easy",
"index": 124,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumCliqueProblem | [
{
"content": "'Introduction': 'You are a great expert solving maximum-clique-problem question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Clique Problem aims to find a subset of vertices (a clique) where every two distinct vertices in the clique... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [], \"1\": [\"2\", \"4\", \"6\"], \"2\": [\"1\", \"3\", \"5\", \"6\", \"7\"], \"3\": [\"2\", \"6\"], \"4\": [\"1\", \"7\"], \"5\": [\"2\", \"6\"], \"6\": [\"1\", \"2\", \"3\", \"5\", \"7\"], \"7\": [\"2\", \"4\", \"6\"]}, \"ground_truth\": 3}",
"st... | {
"generator_name": "easy",
"index": 106,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [7, 8, 4], \"1\": [], \"2\": [7, 10, 5], \"3\": [7], \"4\": [9, 0], \"5\": [2], \"6\": [7], \"7\": [6, 0, 2, 3], \"8\": [0], \"9\": [4], \"10\": [2]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 4,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 15, \"numbers\": {\"0\": 4, \"1\": 4, \"2\": 3, \"3\": 5, \"4\": 4, \"5\": 4, \"6\": 3, \"7\": 1}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 138,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"2\": 1, \"12\": 1, \"9\": 1, \"1\": 10, \"3\": 8, \"4\": 9, \"5\": 10, \"6\": 10, \"7\": 9, \"8\": 10, \"10\": 8, \"11\": 10, \"13\": 9, \"25\": 5, \"39\": 5}, \"1\": {\"41\": 1, \"2\": 1, \"9\": 1, \"0\": 10, \"3\": 8, \"4\": 9, \"5\": 8, \"6\": ... | {
"generator_name": "easy",
"index": 22,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [2], \"1\": [], \"2\": [0], \"3\": [8], \"4\": [5], \"5\": [4, 10], \"6\": [], \"7\": [], \"8\": [3, 9], \"9\": [8, 10], \"10\": [5, 9]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 107,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 52, \"2\": 17, \"3\": 10, \"4\": 65, \"5\": 50, \"6\": 81, \"7\": 87, \"8\": 94, \"9\": 87, \"10\": 65, \"11\": 47, \"12\": 76, \"13\": 76, \"14\": 30}, \"1\": {\"0\": 52, \"1\": 0, \"2\": 21, \"3\": 15, \"4\": 15, \"5\": 75, \"6\":... | {
"generator_name": "easy",
"index": 19,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [10, 9, 1, 16], \"1\": [4, 14, 0, 3, 10, 11, 12], \"2\": [16, 5, 3, 8], \"3\": [9, 16, 1, 2, 5], \"4\": [11, 1, 6, 9], \"5\": [2, 13, 3, 9, 14], \"6\": [12, 7, 4, 9, 11], \"7\": [6, 15, 13], \"8\": [13, 11, 2], \"9\": [0, 3, 4, 5, 6, 12, 16], \"10\":... | {
"generator_name": "easy",
"index": 182,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [14, 10, 4, 12, 13], \"1\": [8, 9, 4, 6], \"2\": [13, 7, 6, 15], \"3\": [5, 6, 7, 12, 14], \"4\": [11, 15, 0, 1, 8, 10, 12], \"5\": [12, 3, 6, 13], \"6\": [3, 14, 1, 2, 5, 11, 13], \"7\": [2, 12, 3, 8], \"8\": [11, 1, 4, 7], \"9\": [1, 13], \"10\": [... | {
"generator_name": "easy",
"index": 123,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 20, \"numbers\": {\"0\": 1, \"1\": 5, \"2\": 4, \"3\": 5, \"4\": 4, \"5\": 3, \"6\": 2, \"7\": 5, \"8\": 4}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 205,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [0, 1, 2], \"duration\": 30}, \"1\": {\"attendees\": [0, 1, 2], \"duration\": 60}, \"2\": {\"attendees\": [0, 1, 2], \"duration\": 30}, \"3\": {\"attendees\": [1, 2], \"duration\": 90}}, \"attendee_availability\": {\"0\... | {
"generator_name": "easy",
"index": 196,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"23\": 2, \"28\": 1, \"36\": 2, \"2\": 9, \"4\": 10, \"5\": 10, \"7\": 8, \"8\": 9, \"10\": 9, \"11\": 9, \"13\": 8, \"35\": 6, \"1\": 3, \"30\": 2, \"34\": 6, \"12\": 3}, \"1\": {\"2\": 8, \"5\": 8, \"7\": 9, \"8\": 10, \"10\": 8, \"11\": 9, \"12\... | {
"generator_name": "easy",
"index": 65,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 56, \"2\": 97, \"3\": 28, \"4\": 95, \"5\": 63, \"6\": 39, \"7\": 68, \"8\": 39, \"9\": 52, \"10\": 31, \"11\": 82, \"12\": 48, \"13\": 83, \"14\": 61, \"15\": 89, \"16\": 87}, \"1\": {\"0\": 56, \"1\": 0, \"2\": 26, \"3\": 88, \"4\... | {
"generator_name": "easy",
"index": 109,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumCliqueProblem | [
{
"content": "'Introduction': 'You are a great expert solving maximum-clique-problem question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Clique Problem aims to find a subset of vertices (a clique) where every two distinct vertices in the clique... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [\"1\"], \"1\": [\"0\", \"2\", \"4\"], \"2\": [\"1\", \"3\", \"4\"], \"3\": [\"2\", \"4\"], \"4\": [\"1\", \"2\", \"3\"]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 14,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 12, \"2\": 77, \"3\": 27, \"4\": 68, \"5\": 13, \"6\": 27, \"7\": 82, \"8\": 82, \"9\": 36, \"10\": 90, \"11\": 91, \"12\": 89, \"13\": 81, \"14\": 46, \"15\": 36}, \"1\": {\"0\": 12, \"1\": 0, \"2\": 52, \"3\": 85, \"4\": 28, \"5\"... | {
"generator_name": "easy",
"index": 0,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 65, \"2\": 74, \"3\": 36, \"4\": 70, \"5\": 27, \"6\": 42, \"7\": 55, \"8\": 35, \"9\": 93, \"10\": 58, \"11\": 30, \"12\": 40, \"13\": 14, \"14\": 29, \"15\": 61, \"16\": 81, \"17\": 100, \"18\": 42, \"19\": 75}, \"1\": {\"0\": 65,... | {
"generator_name": "easy",
"index": 148,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"34\": 2, \"2\": 10, \"4\": 10, \"6\": 9, \"7\": 10, \"8\": 9, \"10\": 8, \"12\": 8, \"13\": 9}, \"1\": {\"5\": 2, \"6\": 3, \"9\": 2, \"12\": 2, \"24\": 10, \"25\": 9, \"14\": 9, \"32\": 9, \"34\": 10, \"41\": 10, \"31\": 1, \"26\": 5, \"10\": 6, ... | {
"generator_name": "easy",
"index": 153,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 14, \"numbers\": {\"0\": 2, \"1\": 2, \"2\": 1, \"3\": 1, \"4\": 3, \"5\": 1, \"6\": 4, \"7\": 5}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 123,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 16, \"numbers\": {\"0\": 1, \"1\": 4, \"2\": 1, \"3\": 3, \"4\": 2, \"5\": 2, \"6\": 3}}, \"ground_truth\": 7}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 193,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [], \"1\": [], \"2\": [9, 5, 11], \"3\": [], \"4\": [], \"5\": [2], \"6\": [], \"7\": [], \"8\": [11], \"9\": [2], \"10\": [], \"11\": [2, 8]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 96,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 47, \"2\": 72, \"3\": 37, \"4\": 30, \"5\": 15, \"6\": 60, \"7\": 65, \"8\": 74, \"9\": 46, \"10\": 35, \"11\": 58}, \"1\": {\"0\": 47, \"1\": 0, \"2\": 45, \"3\": 41, \"4\": 28, \"5\": 70, \"6\": 24, \"7\": 27, \"8\": 33, \"9\": 46... | {
"generator_name": "easy",
"index": 158,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [3, 15, 7, 11, 17], \"1\": [8, 14, 3, 10, 11], \"2\": [4, 7, 11, 12, 17], \"3\": [5, 0, 1, 4, 8, 14, 15], \"4\": [13, 2, 3, 5, 15], \"5\": [11, 3, 4, 7, 12, 16], \"6\": [7, 17, 9, 16], \"7\": [2, 6, 0, 5, 12], \"8\": [15, 1, 3], \"9\": [17, 16, 6], \... | {
"generator_name": "easy",
"index": 3,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 19, \"numbers\": {\"0\": 2, \"1\": 5, \"2\": 4, \"3\": 4, \"4\": 3, \"5\": 5, \"6\": 5, \"7\": 3, \"8\": 4, \"9\": 3}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 95,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 159, \"items\": {\"5\": {\"weight\": 15, \"value\": 32}, \"7\": {\"weight\": 16, \"value\": 38}, \"10\": {\"weight\": 20, \"value\": 46}, \"11\": {\"weight\": 18, \"value\": 36}, \"14\": {\"weight\": 6, \"value\": 11}, \"16\": {\"weight\": 21,... | {
"generator_name": "easy",
"index": 185,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumCliqueProblem | [
{
"content": "'Introduction': 'You are a great expert solving maximum-clique-problem question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Clique Problem aims to find a subset of vertices (a clique) where every two distinct vertices in the clique... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [\"5\"], \"1\": [\"3\", \"6\", \"7\"], \"2\": [\"5\"], \"3\": [\"1\", \"6\"], \"4\": [\"5\"], \"5\": [\"0\", \"2\", \"4\"], \"6\": [\"1\", \"3\", \"7\"], \"7\": [\"1\", \"6\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 98,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"1\": 8, \"2\": 10, \"3\": 9, \"5\": 9, \"6\": 9, \"9\": 8, \"10\": 10, \"12\": 9, \"37\": 4, \"36\": 5, \"24\": 1, \"32\": 2}, \"1\": {\"25\": 1, \"38\": 1, \"0\": 8, \"2\": 8, \"3\": 9, \"5\": 9, \"9\": 8, \"10\": 10, \"11\": 8, \"13\": 9, \"21\"... | {
"generator_name": "easy",
"index": 83,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSetCover | [
{
"content": "'Introduction': 'You are a great expert solving set-cover question. You should propose a solution to this question.', 'Task description': 'Given a universal set U and a collection of subsets S, the Set Cover Problem aims to find the smallest possible sub-collection of S whose union equals U. In o... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"U\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16], \"S\": {\"0\": [14, 3, 12, 6], \"1\": [3, 16, 11, 4, 14], \"2\": [0, 7], \"3\": [10, 16, 3, 11], \"4\": [7, 9, 8], \"5\": [11, 10, 5, 7, 4, 15], \"6\": [6, 2, 7, 14, 16, 1], \"7\": [13, 10, ... | {
"generator_name": "easy",
"index": 34,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [4, 15, 6, 16], \"1\": [12, 6, 3], \"2\": [15, 13, 16], \"3\": [14, 10, 1, 5, 7], \"4\": [6, 0, 7, 9, 12, 14, 15], \"5\": [8, 16, 3, 10, 14], \"6\": [1, 4, 0, 8, 9, 14], \"7\": [9, 16, 3, 4, 12, 13], \"8\": [10, 5, 6], \"9\": [7, 11, 4, 6, 12, 16], \... | {
"generator_name": "easy",
"index": 1,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [1, 2], \"duration\": 60}, \"1\": {\"attendees\": [0, 2], \"duration\": 30}, \"2\": {\"attendees\": [1, 2], \"duration\": 90}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 30}}, \"attendee_availability\": {\"0\": [[5... | {
"generator_name": "easy",
"index": 223,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 43, \"2\": 17, \"3\": 14, \"4\": 28, \"5\": 65, \"6\": 99, \"7\": 82, \"8\": 79, \"9\": 74, \"10\": 20, \"11\": 16, \"12\": 62, \"13\": 97, \"14\": 47, \"15\": 93, \"16\": 40, \"17\": 31, \"18\": 80}, \"1\": {\"0\": 43, \"1\": 0, \"... | {
"generator_name": "easy",
"index": 189,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [12, 4, 2, 10, 14, 15], \"1\": [7, 9, 2, 12, 15, 16, 17, 19], \"2\": [16, 7, 0, 1, 3, 17], \"3\": [10, 17, 2, 4, 13], \"4\": [0, 19, 3, 8, 10, 15], \"5\": [17, 11, 7, 12], \"6\": [19, 15, 7, 8, 12, 13, 14], \"7\": [1, 2, 5, 6, 13, 16, 19], \"8\": [14... | {
"generator_name": "easy",
"index": 68,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSetCover | [
{
"content": "'Introduction': 'You are a great expert solving set-cover question. You should propose a solution to this question.', 'Task description': 'Given a universal set U and a collection of subsets S, the Set Cover Problem aims to find the smallest possible sub-collection of S whose union equals U. In o... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"U\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], \"S\": {\"0\": [6, 0, 7], \"1\": [6, 8], \"2\": [4, 5, 1, 6], \"3\": [1], \"4\": [3, 2, 9]}}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 131,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 182, \"items\": {\"2\": {\"weight\": 6, \"value\": 14}, \"7\": {\"weight\": 17, \"value\": 37}, \"8\": {\"weight\": 16, \"value\": 39}, \"9\": {\"weight\": 24, \"value\": 56}, \"10\": {\"weight\": 13, \"value\": 26}, \"13\": {\"weight\": 25, \... | {
"generator_name": "easy",
"index": 62,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 88, \"2\": 54, \"3\": 11, \"4\": 97, \"5\": 49, \"6\": 21, \"7\": 52, \"8\": 99, \"9\": 79, \"10\": 84, \"11\": 69, \"12\": 61, \"13\": 75}, \"1\": {\"0\": 88, \"1\": 0, \"2\": 65, \"3\": 27, \"4\": 50, \"5\": 37, \"6\": 56, \"7\": ... | {
"generator_name": "easy",
"index": 185,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [0, 2, 3], \"duration\": 30}, \"1\": {\"attendees\": [1, 3], \"duration\": 60}, \"2\": {\"attendees\": [2, 3], \"duration\": 30}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 60}}, \"attendee_availability\": {\"0\": ... | {
"generator_name": "easy",
"index": 90,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 108, \"items\": {\"1\": {\"weight\": 17, \"value\": 39}, \"5\": {\"weight\": 16, \"value\": 29}, \"6\": {\"weight\": 15, \"value\": 32}, \"7\": {\"weight\": 15, \"value\": 30}, \"12\": {\"weight\": 7, \"value\": 16}, \"15\": {\"weight\": 25, \... | {
"generator_name": "easy",
"index": 213,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [1, 2, 4], \"duration\": 90}, \"1\": {\"attendees\": [1, 3, 4], \"duration\": 30}, \"2\": {\"attendees\": [0, 2, 3], \"duration\": 90}, \"3\": {\"attendees\": [0, 4], \"duration\": 60}}, \"attendee_availability\": {\"0\... | {
"generator_name": "easy",
"index": 18,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 28, \"numbers\": {\"0\": 2, \"1\": 1, \"2\": 5, \"3\": 5, \"4\": 5, \"5\": 2, \"6\": 3, \"7\": 4, \"8\": 3, \"9\": 4}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 46,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [7, 4], \"1\": [8], \"2\": [7], \"3\": [], \"4\": [0, 9], \"5\": [], \"6\": [7], \"7\": [0, 2, 6], \"8\": [1], \"9\": [4], \"10\": [], \"11\": []}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 208,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 23, \"numbers\": {\"0\": 4, \"1\": 1, \"2\": 4, \"3\": 2, \"4\": 5, \"5\": 5, \"6\": 2}}, \"ground_truth\": 7}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 163,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSetCover | [
{
"content": "'Introduction': 'You are a great expert solving set-cover question. You should propose a solution to this question.', 'Task description': 'Given a universal set U and a collection of subsets S, the Set Cover Problem aims to find the smallest possible sub-collection of S whose union equals U. In o... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"U\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13], \"S\": {\"0\": [13, 12], \"1\": [11, 13], \"2\": [7, 11, 10], \"3\": [10, 7, 5, 13, 0, 6], \"4\": [2, 0], \"5\": [7, 2, 9], \"6\": [4, 8, 2, 7, 3], \"7\": [10, 1, 4]}}, \"ground_truth\": 6}",
"style":... | {
"generator_name": "easy",
"index": 11,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 74, \"2\": 28, \"3\": 26, \"4\": 45, \"5\": 13, \"6\": 60, \"7\": 10, \"8\": 83, \"9\": 100, \"10\": 36, \"11\": 29}, \"1\": {\"0\": 74, \"1\": 0, \"2\": 87, \"3\": 93, \"4\": 45, \"5\": 29, \"6\": 68, \"7\": 77, \"8\": 85, \"9\": 8... | {
"generator_name": "easy",
"index": 128,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [9, 2, 4, 11, 16, 18], \"1\": [14, 8, 4, 11, 12, 17], \"2\": [0, 6, 3, 9, 10, 13, 16], \"3\": [12, 15, 2], \"4\": [7, 10, 0, 1, 8, 12, 19], \"5\": [11, 12], \"6\": [2, 16, 7, 8, 9, 12, 19], \"7\": [13, 4, 6, 16, 19], \"8\": [1, 19, 4, 6, 12, 14, 16, ... | {
"generator_name": "easy",
"index": 169,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [8], \"1\": [6, 4], \"2\": [], \"3\": [], \"4\": [1, 5], \"5\": [9, 6, 4, 8], \"6\": [1, 5], \"7\": [8], \"8\": [5, 7, 0], \"9\": [5], \"10\": []}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 133,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 58, \"2\": 63, \"3\": 30, \"4\": 47, \"5\": 68, \"6\": 22, \"7\": 93, \"8\": 86, \"9\": 35}, \"1\": {\"0\": 58, \"1\": 0, \"2\": 47, \"3\": 53, \"4\": 83, \"5\": 41, \"6\": 88, \"7\": 65, \"8\": 68, \"9\": 98}, \"2\": {\"0\": 63, \"... | {
"generator_name": "easy",
"index": 219,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 166, \"items\": {\"1\": {\"weight\": 9, \"value\": 19}, \"2\": {\"weight\": 9, \"value\": 20}, \"4\": {\"weight\": 18, \"value\": 40}, \"5\": {\"weight\": 12, \"value\": 22}, \"8\": {\"weight\": 20, \"value\": 41}, \"13\": {\"weight\": 21, \"v... | {
"generator_name": "easy",
"index": 9,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSetCover | [
{
"content": "'Introduction': 'You are a great expert solving set-cover question. You should propose a solution to this question.', 'Task description': 'Given a universal set U and a collection of subsets S, the Set Cover Problem aims to find the smallest possible sub-collection of S whose union equals U. In o... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"U\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17], \"S\": {\"0\": [8, 13], \"1\": [11, 17, 1], \"2\": [17, 12, 11, 4, 9, 2, 8, 15], \"3\": [17, 8, 0, 10, 12, 3, 5], \"4\": [16, 6, 7, 14]}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 190,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [1, 2], \"duration\": 30}, \"1\": {\"attendees\": [0, 1, 2], \"duration\": 30}, \"2\": {\"attendees\": [0, 1, 2], \"duration\": 60}, \"3\": {\"attendees\": [0, 2], \"duration\": 60}}, \"attendee_availability\": {\"0\": ... | {
"generator_name": "easy",
"index": 111,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [2, 3, 4], \"duration\": 90}, \"1\": {\"attendees\": [0, 1, 4], \"duration\": 60}, \"2\": {\"attendees\": [1, 2, 3], \"duration\": 30}, \"3\": {\"attendees\": [1, 3], \"duration\": 60}, \"4\": {\"attendees\": [0, 3], \"... | {
"generator_name": "easy",
"index": 113,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [2, 3], \"duration\": 60}, \"1\": {\"attendees\": [1, 3], \"duration\": 30}, \"2\": {\"attendees\": [0, 2], \"duration\": 60}, \"3\": {\"attendees\": [1, 3], \"duration\": 30}, \"4\": {\"attendees\": [0, 3], \"duration\... | {
"generator_name": "easy",
"index": 127,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 6, \"numbers\": {\"0\": 1, \"1\": 1, \"2\": 1, \"3\": 2, \"4\": 3}}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 20,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"19\": 2, \"40\": 2, \"1\": 8, \"2\": 8, \"4\": 9, \"5\": 8, \"8\": 10, \"9\": 10, \"11\": 9, \"12\": 9, \"13\": 10, \"35\": 4, \"24\": 1, \"33\": 2}, \"1\": {\"7\": 3, \"6\": 2, \"0\": 8, \"2\": 10, \"3\": 8, \"4\": 9, \"5\": 8, \"8\": 9, \"9\": 1... | {
"generator_name": "easy",
"index": 27,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"1\": 8, \"2\": 10, \"3\": 9, \"4\": 9, \"7\": 8, \"8\": 8, \"9\": 10, \"10\": 10, \"11\": 10, \"13\": 10, \"25\": 1}, \"1\": {\"6\": 3, \"5\": 2, \"0\": 8, \"2\": 8, \"3\": 9, \"7\": 10, \"8\": 9, \"9\": 8, \"10\": 9, \"11\": 10, \"40\": 5, \"13\"... | {
"generator_name": "easy",
"index": 101,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 29, \"numbers\": {\"0\": 3, \"1\": 3, \"2\": 1, \"3\": 4, \"4\": 4, \"5\": 3, \"6\": 1, \"7\": 5, \"8\": 5, \"9\": 4}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 217,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 114, \"items\": {\"7\": {\"weight\": 9, \"value\": 16}, \"11\": {\"weight\": 10, \"value\": 20}, \"14\": {\"weight\": 22, \"value\": 54}, \"16\": {\"weight\": 11, \"value\": 25}, \"17\": {\"weight\": 16, \"value\": 31}, \"18\": {\"weight\": 21... | {
"generator_name": "easy",
"index": 200,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"15\": 1, \"34\": 2, \"1\": 10, \"2\": 8, \"4\": 9, \"5\": 9, \"9\": 10, \"10\": 9, \"11\": 8, \"12\": 8, \"18\": 2, \"41\": 2}, \"1\": {\"6\": 3, \"0\": 10, \"2\": 9, \"4\": 9, \"5\": 10, \"9\": 9, \"10\": 9, \"11\": 8, \"12\": 10, \"25\": 2, \"29... | {
"generator_name": "easy",
"index": 218,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 135, \"items\": {\"1\": {\"weight\": 9, \"value\": 20}, \"2\": {\"weight\": 16, \"value\": 31}, \"3\": {\"weight\": 16, \"value\": 38}, \"8\": {\"weight\": 8, \"value\": 15}, \"9\": {\"weight\": 16, \"value\": 30}, \"17\": {\"weight\": 13, \"v... | {
"generator_name": "easy",
"index": 221,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [8, 3, 1, 5, 7, 9, 13], \"1\": [15, 7, 0, 5, 11], \"2\": [5, 11, 4, 6, 10, 13], \"3\": [0, 13, 5, 8, 11], \"4\": [17, 15, 2, 5, 14], \"5\": [9, 2, 0, 1, 3, 4, 15, 16], \"6\": [10, 8, 2, 7, 9, 17], \"7\": [1, 9, 0, 6, 10, 14], \"8\": [6, 0, 3, 11], \"... | {
"generator_name": "easy",
"index": 12,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 157, \"items\": {\"0\": {\"weight\": 21, \"value\": 49}, \"7\": {\"weight\": 19, \"value\": 44}, \"8\": {\"weight\": 17, \"value\": 37}, \"9\": {\"weight\": 11, \"value\": 22}, \"12\": {\"weight\": 20, \"value\": 40}, \"14\": {\"weight\": 10, ... | {
"generator_name": "easy",
"index": 65,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [1, 2], \"duration\": 90}, \"1\": {\"attendees\": [0, 2], \"duration\": 90}, \"2\": {\"attendees\": [0, 1], \"duration\": 60}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 90}}, \"attendee_availability\": {\"0\": [[5... | {
"generator_name": "easy",
"index": 155,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [15, 7, 13], \"1\": [6, 2, 5, 7, 11, 14, 16], \"2\": [1, 12, 5, 6, 9, 17], \"3\": [7, 13, 11, 15, 17], \"4\": [10, 6, 8, 15], \"5\": [13, 14, 1, 2, 8, 15], \"6\": [4, 1, 2, 7, 9, 11, 12, 14, 17], \"7\": [0, 3, 1, 6, 12, 16], \"8\": [11, 9, 4, 5], \"9... | {
"generator_name": "easy",
"index": 144,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 222, \"items\": {\"2\": {\"weight\": 22, \"value\": 54}, \"3\": {\"weight\": 17, \"value\": 38}, \"4\": {\"weight\": 14, \"value\": 30}, \"6\": {\"weight\": 23, \"value\": 41}, \"10\": {\"weight\": 22, \"value\": 39}, \"11\": {\"weight\": 11, ... | {
"generator_name": "easy",
"index": 11,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 23, \"numbers\": {\"0\": 2, \"1\": 5, \"2\": 3, \"3\": 3, \"4\": 3, \"5\": 4, \"6\": 3, \"7\": 4, \"8\": 4}}, \"ground_truth\": 7}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 128,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 138, \"items\": {\"1\": {\"weight\": 17, \"value\": 37}, \"2\": {\"weight\": 16, \"value\": 30}, \"8\": {\"weight\": 13, \"value\": 29}, \"9\": {\"weight\": 15, \"value\": 33}, \"10\": {\"weight\": 8, \"value\": 14}, \"11\": {\"weight\": 9, \"... | {
"generator_name": "easy",
"index": 132,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [3], \"1\": [4, 11], \"2\": [8], \"3\": [0], \"4\": [1], \"5\": [8], \"6\": [], \"7\": [11], \"8\": [5, 2], \"9\": [11], \"10\": [], \"11\": [1, 7, 9]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 142,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSetCover | [
{
"content": "'Introduction': 'You are a great expert solving set-cover question. You should propose a solution to this question.', 'Task description': 'Given a universal set U and a collection of subsets S, the Set Cover Problem aims to find the smallest possible sub-collection of S whose union equals U. In o... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"U\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], \"S\": {\"0\": [9], \"1\": [4, 1], \"2\": [5, 6], \"3\": [9, 1, 8, 0], \"4\": [2, 4, 3, 5], \"5\": [7, 5], \"6\": [6, 3, 5], \"7\": [4]}}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 75,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"22\": 1, \"39\": 2, \"1\": 9, \"2\": 9, \"3\": 10, \"6\": 10, \"7\": 9, \"8\": 10, \"10\": 10, \"11\": 10, \"13\": 8, \"19\": 5, \"5\": 3, \"41\": 6, \"34\": 3, \"26\": 5}, \"1\": {\"0\": 9, \"2\": 8, \"3\": 10, \"4\": 10, \"6\": 10, \"7\": 8, \"8... | {
"generator_name": "easy",
"index": 46,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 236, \"items\": {\"0\": {\"weight\": 23, \"value\": 47}, \"2\": {\"weight\": 24, \"value\": 56}, \"6\": {\"weight\": 18, \"value\": 43}, \"7\": {\"weight\": 18, \"value\": 33}, \"8\": {\"weight\": 19, \"value\": 45}, \"13\": {\"weight\": 14, \... | {
"generator_name": "easy",
"index": 129,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSetCover | [
{
"content": "'Introduction': 'You are a great expert solving set-cover question. You should propose a solution to this question.', 'Task description': 'Given a universal set U and a collection of subsets S, the Set Cover Problem aims to find the smallest possible sub-collection of S whose union equals U. In o... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"U\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], \"S\": {\"0\": [6, 11], \"1\": [8, 7, 10, 5], \"2\": [0, 1, 4, 3], \"3\": [6, 7, 2, 9], \"4\": [8, 6, 1, 9]}}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 217,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 94, \"2\": 61, \"3\": 58, \"4\": 51, \"5\": 37, \"6\": 30, \"7\": 62, \"8\": 64, \"9\": 25, \"10\": 28, \"11\": 18, \"12\": 61, \"13\": 46, \"14\": 37, \"15\": 38, \"16\": 33}, \"1\": {\"0\": 94, \"1\": 0, \"2\": 97, \"3\": 29, \"4\... | {
"generator_name": "easy",
"index": 77,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [2, 5], \"1\": [3, 6, 5], \"2\": [0, 5], \"3\": [1], \"4\": [6], \"5\": [1, 2, 0, 6], \"6\": [1, 4, 5], \"7\": []}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 54,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumCliqueProblem | [
{
"content": "'Introduction': 'You are a great expert solving maximum-clique-problem question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Clique Problem aims to find a subset of vertices (a clique) where every two distinct vertices in the clique... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [\"3\", \"6\"], \"1\": [\"4\", \"6\", \"7\"], \"2\": [\"6\", \"7\"], \"3\": [\"0\", \"5\"], \"4\": [\"1\"], \"5\": [\"3\"], \"6\": [\"0\", \"1\", \"2\"], \"7\": [\"1\", \"2\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 180,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"34\": 2, \"9\": 2, \"13\": 1, \"1\": 9, \"2\": 9, \"3\": 10, \"4\": 9, \"5\": 8, \"8\": 10, \"10\": 9, \"11\": 9, \"12\": 8, \"33\": 5, \"39\": 4, \"24\": 5, \"15\": 5, \"35\": 1, \"16\": 2, \"17\": 5}, \"1\": {\"0\": 9, \"2\": 9, \"3\": 10, \"4\"... | {
"generator_name": "easy",
"index": 197,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [1, 2], \"duration\": 90}, \"1\": {\"attendees\": [0, 1, 2], \"duration\": 30}, \"2\": {\"attendees\": [0, 1, 2], \"duration\": 30}, \"3\": {\"attendees\": [1, 2], \"duration\": 30}, \"4\": {\"attendees\": [0, 1, 2], \"... | {
"generator_name": "easy",
"index": 210,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 12, \"numbers\": {\"0\": 4, \"1\": 2, \"2\": 2, \"3\": 5, \"4\": 3, \"5\": 4, \"6\": 5, \"7\": 2, \"8\": 1}}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 96,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 141, \"items\": {\"0\": {\"weight\": 19, \"value\": 46}, \"3\": {\"weight\": 10, \"value\": 24}, \"8\": {\"weight\": 23, \"value\": 54}, \"9\": {\"weight\": 18, \"value\": 40}, \"10\": {\"weight\": 17, \"value\": 30}, \"13\": {\"weight\": 8, \... | {
"generator_name": "easy",
"index": 24,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 67, \"2\": 30, \"3\": 44, \"4\": 33, \"5\": 64, \"6\": 80, \"7\": 73, \"8\": 44, \"9\": 39}, \"1\": {\"0\": 67, \"1\": 0, \"2\": 38, \"3\": 51, \"4\": 17, \"5\": 73, \"6\": 10, \"7\": 47, \"8\": 70, \"9\": 69}, \"2\": {\"0\": 30, \"... | {
"generator_name": "easy",
"index": 41,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSetCover | [
{
"content": "'Introduction': 'You are a great expert solving set-cover question. You should propose a solution to this question.', 'Task description': 'Given a universal set U and a collection of subsets S, the Set Cover Problem aims to find the smallest possible sub-collection of S whose union equals U. In o... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"U\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12], \"S\": {\"0\": [11, 9], \"1\": [2, 8], \"2\": [12, 6, 7], \"3\": [12, 7], \"4\": [6, 10, 5], \"5\": [9, 4], \"6\": [6, 2, 3, 1], \"7\": [10], \"8\": [7, 0]}}, \"ground_truth\": 7}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 101,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 63, \"items\": {\"2\": {\"weight\": 7, \"value\": 13}, \"5\": {\"weight\": 6, \"value\": 14}, \"11\": {\"weight\": 12, \"value\": 29}, \"13\": {\"weight\": 8, \"value\": 14}, \"14\": {\"weight\": 18, \"value\": 33}, \"15\": {\"weight\": 5, \"v... | {
"generator_name": "easy",
"index": 141,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSetCover | [
{
"content": "'Introduction': 'You are a great expert solving set-cover question. You should propose a solution to this question.', 'Task description': 'Given a universal set U and a collection of subsets S, the Set Cover Problem aims to find the smallest possible sub-collection of S whose union equals U. In o... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"U\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15], \"S\": {\"0\": [10], \"1\": [9, 6, 15], \"2\": [0, 15, 5], \"3\": [12, 10, 9, 0, 14], \"4\": [15, 1, 7, 10], \"5\": [4, 10, 13, 8, 3, 11], \"6\": [8, 0, 2], \"7\": [8, 12]}}, \"ground_truth\": 6... | {
"generator_name": "easy",
"index": 191,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 15, \"numbers\": {\"0\": 4, \"1\": 1, \"2\": 5, \"3\": 1, \"4\": 4, \"5\": 4}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 73,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [8], \"1\": [3], \"2\": [3], \"3\": [1, 2, 6], \"4\": [], \"5\": [6], \"6\": [3, 5], \"7\": [9], \"8\": [0], \"9\": [7], \"10\": []}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 219,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [4, 5], \"1\": [5], \"2\": [], \"3\": [5], \"4\": [6, 0], \"5\": [6, 0, 1, 3, 9], \"6\": [4, 5, 7, 10], \"7\": [6, 8], \"8\": [7], \"9\": [5], \"10\": [6], \"11\": []}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 132,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"20\": 1, \"1\": 9, \"4\": 9, \"5\": 8, \"7\": 9, \"8\": 8, \"9\": 8, \"11\": 8, \"12\": 9, \"13\": 8, \"24\": 6, \"28\": 4, \"38\": 5, \"37\": 3, \"14\": 5, \"29\": 4}, \"1\": {\"0\": 9, \"4\": 9, \"5\": 9, \"7\": 10, \"8\": 8, \"9\": 10, \"10\": ... | {
"generator_name": "easy",
"index": 181,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 14, \"2\": 67, \"3\": 70, \"4\": 46, \"5\": 15, \"6\": 77, \"7\": 39, \"8\": 31, \"9\": 77, \"10\": 89, \"11\": 96, \"12\": 48, \"13\": 75, \"14\": 99, \"15\": 87, \"16\": 46}, \"1\": {\"0\": 14, \"1\": 0, \"2\": 32, \"3\": 64, \"4\... | {
"generator_name": "easy",
"index": 45,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [4, 13, 5, 6], \"1\": [3, 6, 8], \"2\": [7, 14], \"3\": [1, 16, 12], \"4\": [8, 0, 6, 13], \"5\": [14, 12, 0, 10, 13, 15], \"6\": [1, 15, 0, 4, 8, 9, 12], \"7\": [13, 2, 8, 11, 16], \"8\": [10, 4, 1, 6, 7], \"9\": [11, 10, 6, 16], \"10\": [9, 8, 5, 1... | {
"generator_name": "easy",
"index": 107,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 129, \"items\": {\"0\": {\"weight\": 15, \"value\": 35}, \"3\": {\"weight\": 21, \"value\": 48}, \"4\": {\"weight\": 5, \"value\": 11}, \"9\": {\"weight\": 6, \"value\": 10}, \"10\": {\"weight\": 10, \"value\": 22}, \"11\": {\"weight\": 19, \"... | {
"generator_name": "easy",
"index": 104,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 35, \"2\": 20, \"3\": 29, \"4\": 83, \"5\": 26, \"6\": 84, \"7\": 87, \"8\": 97, \"9\": 66, \"10\": 87, \"11\": 21, \"12\": 86, \"13\": 55, \"14\": 74, \"15\": 80, \"16\": 84, \"17\": 44, \"18\": 65}, \"1\": {\"0\": 35, \"1\": 0, \"... | {
"generator_name": "easy",
"index": 199,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 32, \"2\": 19, \"3\": 28, \"4\": 87, \"5\": 92, \"6\": 27, \"7\": 82, \"8\": 13, \"9\": 97, \"10\": 24, \"11\": 68, \"12\": 80, \"13\": 44, \"14\": 52, \"15\": 93, \"16\": 67}, \"1\": {\"0\": 32, \"1\": 0, \"2\": 50, \"3\": 36, \"4\... | {
"generator_name": "easy",
"index": 152,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [15, 3, 1, 7, 8, 11, 14], \"1\": [7, 4, 0, 9, 17], \"2\": [10, 9, 8, 12, 13, 19], \"3\": [0, 12, 4, 7, 8, 11, 16, 18], \"4\": [1, 15, 3, 9, 19], \"5\": [19, 16], \"6\": [9, 18, 8, 14, 15], \"7\": [16, 1, 0, 3, 10, 13], \"8\": [11, 12, 0, 2, 3, 6, 10,... | {
"generator_name": "easy",
"index": 32,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumCliqueProblem | [
{
"content": "'Introduction': 'You are a great expert solving maximum-clique-problem question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Clique Problem aims to find a subset of vertices (a clique) where every two distinct vertices in the clique... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [\"1\", \"2\", \"5\"], \"1\": [\"0\", \"2\", \"6\"], \"2\": [\"0\", \"1\", \"3\", \"5\"], \"3\": [\"2\", \"4\", \"5\", \"6\"], \"4\": [\"3\", \"7\"], \"5\": [\"0\", \"2\", \"3\", \"7\"], \"6\": [\"1\", \"3\"], \"7\": [\"4\", \"5\"]}, \"ground_truth\"... | {
"generator_name": "easy",
"index": 83,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumSet | [
{
"content": "'Introduction': 'You are a great expert solving maximum-set question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Independent Set Problem aims to find the largest set of vertices where no two vertices are adjacent (i.e., no two vert... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"12\": 1, \"7\": 1, \"8\": 1}, \"1\": {\"12\": 1, \"11\": 1, \"7\": 1, \"6\": 1, \"4\": 1, \"8\": 1}, \"2\": {\"13\": 1, \"10\": 1, \"6\": 1, \"4\": 1, \"8\": 1}, \"3\": {\"12\": 1, \"11\": 1, \"7\": 1}, \"4\": {\"13\": 1, \"1\": 1, \"2\": 1, \"5\"... | {
"generator_name": "easy",
"index": 133,
"need_tools_kwargs": false,
"split": "train"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.