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, 10, 11, 12, 13, 14, 15, 16, 17, 18], \"S\": {\"0\": [9, 14, 10, 2], \"1\": [14, 16, 0, 9, 6, 11, 13], \"2\": [7], \"3\": [3, 13], \"4\": [16, 15, 13, 0, 10], \"5\": [9, 15, 6, 1, 5], \"6\": [13, 11], \"7\": [5, 14, 8, 1... | {
"generator_name": "easy",
"index": 7,
"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\": 25, \"numbers\": {\"0\": 5, \"1\": 2, \"2\": 2, \"3\": 5, \"4\": 5, \"5\": 5, \"6\": 1}}, \"ground_truth\": 7}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 147,
"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], \"duration\": 90}, \"2\": {\"attendees\": [0, 1], \"duration\": 60}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 90}, \"4\": {\"attendees\": [0, 1], \"dur... | {
"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, 10, 11], \"S\": {\"0\": [8], \"1\": [8, 9, 10, 3], \"2\": [4, 0], \"3\": [7, 4, 2, 6], \"4\": [1, 9, 4, 8, 11, 5], \"5\": [1, 4]}}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 181,
"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, 3, 4], \"duration\": 90}, \"1\": {\"attendees\": [1, 2, 4], \"duration\": 60}, \"2\": {\"attendees\": [1, 2, 4], \"duration\": 60}, \"3\": {\"attendees\": [1, 2, 3], \"duration\": 30}, \"4\": {\"attendees\": [1, 4],... | {
"generator_name": "easy",
"index": 86,
"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\": 63, \"2\": 46, \"3\": 46, \"4\": 55, \"5\": 95, \"6\": 11, \"7\": 34, \"8\": 72, \"9\": 80, \"10\": 82, \"11\": 23, \"12\": 16, \"13\": 92, \"14\": 88, \"15\": 16}, \"1\": {\"0\": 63, \"1\": 0, \"2\": 94, \"3\": 54, \"4\": 37, \"5\"... | {
"generator_name": "easy",
"index": 108,
"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\": 10, \"numbers\": {\"0\": 4, \"1\": 1, \"2\": 1, \"3\": 1, \"4\": 3, \"5\": 4, \"6\": 1, \"7\": 4, \"8\": 2}}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 47,
"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\", \"7\"], \"1\": [\"0\", \"3\", \"6\"], \"2\": [\"0\", \"3\", \"4\", \"7\"], \"3\": [\"1\", \"2\", \"4\", \"6\"], \"4\": [\"0\", \"2\", \"3\", \"6\", \"7\"], \"5\": [\"6\"], \"6\": [\"0\", \"1\", \"3\", \"4\", \"5\", \"7\"]... | {
"generator_name": "easy",
"index": 183,
"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\": [], \"3\": [], \"4\": [], \"5\": [], \"6\": [], \"7\": [], \"8\": [], \"9\": [], \"10\": []}, \"ground_truth\": 1}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 203,
"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\": {\"1\": 1, \"9\": 1, \"10\": 1, \"6\": 1, \"3\": 1, \"15\": 1, \"7\": 1, \"5\": 1}, \"1\": {\"9\": 1, \"10\": 1, \"0\": 1, \"17\": 1, \"3\": 1, \"7\": 1, \"4\": 1, \"5\": 1}, \"2\": {\"16\": 1, \"12\": 1, \"10\": 1, \"19\": 1, \"4\": 1, \"18\": 1}, \... | {
"generator_name": "easy",
"index": 91,
"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, 6, 9], \"1\": [6], \"2\": [], \"3\": [0, 5], \"4\": [9], \"5\": [3, 8], \"6\": [1, 0], \"7\": [], \"8\": [5], \"9\": [4, 0]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 18,
"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\", \"3\"], \"1\": [\"0\", \"2\", \"3\"], \"2\": [\"0\", \"1\", \"3\"], \"3\": [\"0\", \"1\", \"2\"]}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 145,
"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\": [4], \"1\": [0, 5, 8, 3], \"2\": [5, 0, 8], \"3\": [4, 2, 3], \"4\": [8, 1, 2, 0], \"5\": [2, 1, 5, 3], \"6\": [3, 4, 6, 8], \"7\": [9, 4], \"8\": [4, 7, 1, 9], \"9\": [0]}}, \"ground_truth\": 4}",
"st... | {
"generator_name": "easy",
"index": 126,
"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\": [2, 3, 4, 9, 10, 11, 15], \"1\": [7, 14, 6, 10, 16], \"2\": [4, 0, 8, 13], \"3\": [0, 12, 5, 9, 14], \"4\": [5, 2, 0], \"5\": [13, 4, 3, 7], \"6\": [15, 16, 1, 12], \"7\": [12, 1, 5, 8, 15], \"8\": [9, 11, 2, 7, 10], \"9\": [14, 8, 0, 3, 13], \"10\":... | {
"generator_name": "easy",
"index": 117,
"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\": {\"5\": 3, \"10\": 3, \"11\": 1, \"15\": 9, \"20\": 9, \"21\": 10, \"29\": 10, \"30\": 10, \"36\": 10, \"39\": 5, \"28\": 4, \"4\": 5, \"1\": 3}, \"1\": {\"16\": 2, \"6\": 1, \"2\": 10, \"3\": 10, \"4\": 8, \"5\": 9, \"8\": 9, \"9\": 9, \"10\": 10, \... | {
"generator_name": "easy",
"index": 188,
"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\": {\"9\": 1, \"5\": 1, \"10\": 1, \"11\": 1}, \"1\": {\"9\": 1, \"5\": 1, \"8\": 1, \"10\": 1, \"11\": 1, \"7\": 1}, \"2\": {\"9\": 1, \"5\": 1, \"13\": 1, \"10\": 1}, \"3\": {\"4\": 1, \"8\": 1, \"13\": 1, \"11\": 1}, \"4\": {\"11\": 1, \"3\": 1, \"12... | {
"generator_name": "easy",
"index": 116,
"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, 3], \"duration\": 60}, \"1\": {\"attendees\": [0, 2], \"duration\": 90}, \"2\": {\"attendees\": [0, 1, 2], \"duration\": 60}, \"3\": {\"attendees\": [1, 3], \"duration\": 60}}, \"attendee_availability\": {\"0\": ... | {
"generator_name": "easy",
"index": 182,
"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, 3], \"duration\": 90}, \"1\": {\"attendees\": [0, 1, 2], \"duration\": 30}, \"2\": {\"attendees\": [0, 1, 2], \"duration\": 90}, \"3\": {\"attendees\": [1, 3], \"duration\": 30}}, \"attendee_availability\": {\"0\": ... | {
"generator_name": "easy",
"index": 122,
"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\": [7, 2], \"1\": [7, 8, 4], \"2\": [6, 7, 9], \"3\": [0], \"4\": [1, 4, 9, 3], \"5\": [7, 6, 1, 2, 5], \"6\": [0], \"7\": [0, 3], \"8\": [3, 1], \"9\": [8, 6, 9, 0]}}, \"ground_truth\": 3}",
"style": "ru... | {
"generator_name": "easy",
"index": 168,
"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\": [12, 2, 0], \"1\": [11, 1, 5, 0, 9, 10], \"2\": [12, 3], \"3\": [2, 0, 12], \"4\": [5], \"5\": [1], \"6\": [9, 5, 1, 8, 6], \"7\": [6], \"8\": [8, 4, 5, 7]}}, \"ground_truth\": 5}",
"style"... | {
"generator_name": "easy",
"index": 3,
"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, 3, 9], \"1\": [0, 10, 5], \"2\": [3], \"3\": [0, 10, 2], \"4\": [], \"5\": [1], \"6\": [], \"7\": [10], \"8\": [], \"9\": [0], \"10\": [7, 1, 3]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 124,
"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], \"S\": {\"0\": [10], \"1\": [2, 6, 4], \"2\": [9], \"3\": [1, 6, 3], \"4\": [7, 5], \"5\": [0], \"6\": [7, 4, 8]}}, \"ground_truth\": 7}",
"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\": 93, \"2\": 26, \"3\": 87, \"4\": 90, \"5\": 25, \"6\": 48, \"7\": 56, \"8\": 69, \"9\": 64, \"10\": 16, \"11\": 40, \"12\": 57, \"13\": 73, \"14\": 20}, \"1\": {\"0\": 93, \"1\": 0, \"2\": 43, \"3\": 51, \"4\": 53, \"5\": 45, \"6\":... | {
"generator_name": "easy",
"index": 188,
"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\": [8, 9, 7, 12, 6], \"1\": [8, 4, 6, 3], \"2\": [13], \"3\": [10, 12, 8], \"4\": [9, 5, 4, 11, 8], \"5\": [9], \"6\": [4, 12, 8, 13, 0], \"7\": [7, 2, 1, 9]}}, \"ground_truth\": 5}",
"sty... | {
"generator_name": "easy",
"index": 119,
"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\"], \"2\": [\"1\", \"4\"], \"3\": [\"4\"], \"4\": [\"2\", \"3\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 45,
"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\": 30, \"numbers\": {\"0\": 5, \"1\": 5, \"2\": 5, \"3\": 4, \"4\": 3, \"5\": 5, \"6\": 3, \"7\": 1, \"8\": 4}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 93,
"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], \"1\": [0, 2], \"2\": [7, 1, 4], \"3\": [], \"4\": [2, 9], \"5\": [8, 6], \"6\": [7, 5, 10], \"7\": [2, 6, 9], \"8\": [5], \"9\": [7, 4], \"10\": [6]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 144,
"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, 4], \"duration\": 90}, \"1\": {\"attendees\": [0, 1, 3], \"duration\": 30}, \"2\": {\"attendees\": [2, 3, 4], \"duration\": 30}, \"3\": {\"attendees\": [1, 2, 4], \"duration\": 60}, \"4\": {\"attendees\": [0, 3],... | {
"generator_name": "easy",
"index": 28,
"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\": 195, \"items\": {\"1\": {\"weight\": 16, \"value\": 37}, \"2\": {\"weight\": 23, \"value\": 53}, \"4\": {\"weight\": 10, \"value\": 21}, \"5\": {\"weight\": 25, \"value\": 47}, \"6\": {\"weight\": 16, \"value\": 39}, \"10\": {\"weight\": 21, \... | {
"generator_name": "easy",
"index": 21,
"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, 6], \"1\": [5], \"2\": [7], \"3\": [], \"4\": [9, 6], \"5\": [1], \"6\": [0, 4, 7, 9], \"7\": [0, 2, 6], \"8\": [], \"9\": [4, 6], \"10\": []}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 198,
"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\": 60}, \"1\": {\"attendees\": [0, 2], \"duration\": 30}, \"2\": {\"attendees\": [0, 1, 2], \"duration\": 90}, \"3\": {\"attendees\": [0, 1], \"duration\": 60}, \"4\": {\"attendees\": [0, 1, 2], \"... | {
"generator_name": "easy",
"index": 45,
"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, 4], \"duration\": 90}, \"1\": {\"attendees\": [0, 2, 4], \"duration\": 90}, \"2\": {\"attendees\": [2, 4], \"duration\": 60}, \"3\": {\"attendees\": [0, 3], \"duration\": 90}}, \"attendee_availability\": {\"0\": ... | {
"generator_name": "easy",
"index": 35,
"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, \"3\": 8, \"4\": 8, \"5\": 9, \"7\": 9, \"8\": 10, \"9\": 10, \"11\": 10, \"13\": 8, \"1\": 4, \"15\": 5}, \"1\": {\"39\": 1, \"9\": 2, \"11\": 1, \"13\": 2, \"17\": 9, \"14\": 10, \"16\": 9, \"32\": 10, \"40\": 9, \"41\": 10, \"0\": 4, \... | {
"generator_name": "easy",
"index": 15,
"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\", \"3\"], \"1\": [\"0\", \"2\", \"3\"], \"2\": [\"0\", \"1\", \"3\"], \"3\": [\"0\", \"1\", \"2\"]}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 75,
"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\": {\"13\": 1, \"2\": 1, \"10\": 1, \"6\": 1, \"5\": 1, \"4\": 1, \"11\": 1, \"12\": 1, \"14\": 1}, \"1\": {\"7\": 1, \"13\": 1, \"2\": 1, \"10\": 1, \"6\": 1, \"8\": 1}, \"2\": {\"0\": 1, \"6\": 1, \"8\": 1, \"12\": 1, \"1\": 1, \"11\": 1}, \"3\": {\"7... | {
"generator_name": "easy",
"index": 168,
"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\": {\"38\": 1, \"1\": 2, \"2\": 10, \"3\": 8, \"6\": 10, \"7\": 8, \"8\": 9, \"9\": 10, \"11\": 8, \"12\": 10, \"13\": 10, \"26\": 5, \"41\": 2, \"10\": 3, \"23\": 5}, \"1\": {\"0\": 2, \"3\": 2, \"26\": 9, \"14\": 10, \"16\": 10, \"35\": 9, \"38\": 9, ... | {
"generator_name": "easy",
"index": 52,
"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\": {\"12\": 3, \"22\": 9, \"17\": 9, \"18\": 9, \"37\": 9, \"29\": 9, \"23\": 3, \"35\": 6}, \"1\": {\"11\": 2, \"3\": 8, \"4\": 9, \"5\": 10, \"7\": 9, \"8\": 10, \"9\": 9, \"10\": 8, \"12\": 9, \"13\": 10, \"33\": 4, \"38\": 3, \"24\": 6}, \"2\": {\"2... | {
"generator_name": "easy",
"index": 163,
"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\", \"7\"], \"1\": [\"3\", \"4\", \"5\", \"6\", \"7\"], \"2\": [\"4\"], \"3\": [\"0\", \"1\", \"4\", \"5\", \"6\", \"7\"], \"4\": [\"1\", \"2\", \"3\", \"6\"], \"5\": [\"1\", \"3\"], \"6\": [\"0\", \"1\", \"3\", \"4\", \"7\"], \"7\": [\"0\... | {
"generator_name": "easy",
"index": 177,
"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\": {\"5\": 1, \"1\": 1, \"6\": 1, \"9\": 1}, \"1\": {\"0\": 1, \"3\": 1}, \"2\": {}, \"3\": {\"8\": 1, \"7\": 1, \"1\": 1, \"5\": 1, \"6\": 1, \"9\": 1, \"10\": 1, \"11\": 1}, \"4\": {\"8\": 1, \"7\": 1}, \"5\": {\"0\": 1, \"3\": 1}, \"6\": {\"0\": 1, \... | {
"generator_name": "easy",
"index": 46,
"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\": 22, \"numbers\": {\"0\": 5, \"1\": 4, \"2\": 4, \"3\": 1, \"4\": 2, \"5\": 3, \"6\": 4, \"7\": 2, \"8\": 1}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 143,
"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\": 8, \"3\": 9, \"4\": 8, \"6\": 8, \"7\": 8, \"9\": 8, \"10\": 9, \"11\": 9, \"13\": 8}, \"1\": {\"3\": 3, \"10\": 1, \"24\": 9, \"14\": 9, \"17\": 10, \"34\": 9, \"36\": 10, \"37\": 3, \"27\": 1, \"28\": 1}, \"2\": {\"0\": 8, \"3\": 10, \"4\":... | {
"generator_name": "easy",
"index": 69,
"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\": [\"2\", \"3\", \"4\"], \"1\": [\"3\", \"4\"], \"2\": [\"0\"], \"3\": [\"0\", \"1\", \"5\"], \"4\": [\"0\", \"1\"], \"5\": [\"3\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 202,
"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\": 21, \"numbers\": {\"0\": 1, \"1\": 5, \"2\": 3, \"3\": 2, \"4\": 4, \"5\": 5, \"6\": 1}}, \"ground_truth\": 7}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 110,
"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\": [8, 0, 11], \"1\": [0, 4, 10, 5, 2], \"2\": [7, 5, 8, 0], \"3\": [6, 3], \"4\": [1, 9]}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 57,
"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\": [\"3\"], \"2\": [\"3\"], \"3\": [\"1\", \"2\", \"4\"], \"4\": [\"3\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 190,
"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\": 24, \"numbers\": {\"0\": 5, \"1\": 3, \"2\": 3, \"3\": 3, \"4\": 5, \"5\": 5}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 36,
"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\": 22, \"numbers\": {\"0\": 4, \"1\": 5, \"2\": 3, \"3\": 5, \"4\": 4, \"5\": 2, \"6\": 1}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 137,
"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], \"duration\": 90}, \"1\": {\"attendees\": [2, 3], \"duration\": 90}, \"2\": {\"attendees\": [0, 1, 4], \"duration\": 30}, \"3\": {\"attendees\": [0, 2], \"duration\": 30}}, \"attendee_availability\": {\"0\": [[5... | {
"generator_name": "easy",
"index": 192,
"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\": 119, \"items\": {\"1\": {\"weight\": 22, \"value\": 50}, \"2\": {\"weight\": 14, \"value\": 34}, \"8\": {\"weight\": 7, \"value\": 16}, \"10\": {\"weight\": 18, \"value\": 37}, \"11\": {\"weight\": 10, \"value\": 21}, \"12\": {\"weight\": 24, ... | {
"generator_name": "easy",
"index": 47,
"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, \"8\": 1, \"10\": 1}, \"1\": {\"9\": 1, \"4\": 1, \"8\": 1, \"12\": 1, \"7\": 1, \"13\": 1, \"3\": 1}, \"2\": {\"4\": 1, \"8\": 1, \"6\": 1, \"5\": 1, \"13\": 1, \"3\": 1, \"0\": 1, \"14\": 1}, \"3\": {\"2\": 1, \"6\": 1, \"5\": ... | {
"generator_name": "easy",
"index": 158,
"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\": 90}, \"1\": {\"attendees\": [0, 1], \"duration\": 30}, \"2\": {\"attendees\": [2, 3], \"duration\": 30}, \"3\": {\"attendees\": [3, 4], \"duration\": 60}}, \"attendee_availability\": {\"0\": [[5... | {
"generator_name": "easy",
"index": 50,
"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\"], \"1\": [\"0\", \"3\", \"4\"], \"2\": [\"0\", \"3\", \"4\"], \"3\": [\"1\", \"2\"], \"4\": [\"1\", \"2\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 99,
"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\", \"3\", \"4\", \"5\", \"6\", \"7\"], \"1\": [\"0\", \"4\", \"5\", \"6\", \"7\"], \"2\": [\"0\", \"3\", \"4\"], \"3\": [\"0\", \"2\", \"4\", \"7\"], \"4\": [\"0\", \"1\", \"2\", \"3\", \"5\"], \"5\": [\"0\", \"1\", \"4\"], \"6\": [\"0\",... | {
"generator_name": "easy",
"index": 136,
"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\", \"3\"], \"1\": [\"0\", \"2\", \"3\"], \"2\": [\"0\", \"1\", \"3\"], \"3\": [\"0\", \"1\", \"2\"]}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 82,
"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\": 39, \"2\": 79, \"3\": 83, \"4\": 71, \"5\": 61, \"6\": 100, \"7\": 11, \"8\": 49, \"9\": 91, \"10\": 22, \"11\": 48, \"12\": 12, \"13\": 100, \"14\": 69, \"15\": 80, \"16\": 24, \"17\": 28, \"18\": 49, \"19\": 93}, \"1\": {\"0\": 39... | {
"generator_name": "easy",
"index": 93,
"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\": {\"14\": 1, \"13\": 1, \"15\": 1, \"2\": 1, \"1\": 1, \"9\": 1, \"16\": 1}, \"1\": {\"12\": 1, \"11\": 1, \"6\": 1, \"8\": 1, \"0\": 1, \"5\": 1, \"3\": 1, \"10\": 1, \"15\": 1}, \"2\": {\"14\": 1, \"11\": 1, \"8\": 1, \"0\": 1, \"5\": 1, \"3\": 1, \... | {
"generator_name": "easy",
"index": 138,
"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\": [5, 8, 1, 3, 6, 7, 16], \"1\": [8, 16, 0, 13], \"2\": [13, 10, 3, 15], \"3\": [4, 7, 0, 2, 6, 14], \"4\": [3, 16, 6, 10, 15], \"5\": [9, 0, 8], \"6\": [12, 14, 0, 3, 4, 8, 13, 15], \"7\": [3, 11, 0, 9, 16], \"8\": [0, 1, 5, 6, 11, 14], \"9\": [14, 5,... | {
"generator_name": "easy",
"index": 63,
"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\": 197, \"items\": {\"0\": {\"weight\": 10, \"value\": 24}, \"1\": {\"weight\": 23, \"value\": 55}, \"4\": {\"weight\": 19, \"value\": 37}, \"5\": {\"weight\": 7, \"value\": 13}, \"7\": {\"weight\": 17, \"value\": 42}, \"8\": {\"weight\": 13, \"v... | {
"generator_name": "easy",
"index": 19,
"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\": {\"36\": 1, \"11\": 3, \"1\": 9, \"2\": 9, \"4\": 9, \"5\": 9, \"6\": 10, \"7\": 10, \"9\": 9, \"10\": 8, \"13\": 9}, \"1\": {\"0\": 9, \"2\": 8, \"3\": 8, \"4\": 9, \"5\": 8, \"6\": 9, \"7\": 8, \"9\": 9, \"13\": 10, \"37\": 6, \"24\": 1, \"34\": 1}... | {
"generator_name": "easy",
"index": 45,
"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], \"duration\": 30}, \"1\": {\"attendees\": [2, 3], \"duration\": 90}, \"2\": {\"attendees\": [1, 2], \"duration\": 90}, \"3\": {\"attendees\": [1, 2], \"duration\": 60}}, \"attendee_availability\": {\"0\": [[540,... | {
"generator_name": "easy",
"index": 212,
"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\": 42, \"2\": 28, \"3\": 85, \"4\": 42, \"5\": 37, \"6\": 76, \"7\": 64, \"8\": 59, \"9\": 66, \"10\": 38, \"11\": 61, \"12\": 92, \"13\": 40}, \"1\": {\"0\": 42, \"1\": 0, \"2\": 33, \"3\": 78, \"4\": 13, \"5\": 52, \"6\": 71, \"7\": ... | {
"generator_name": "easy",
"index": 88,
"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\": {\"7\": 1, \"4\": 1, \"12\": 1, \"8\": 1, \"17\": 1, \"9\": 1, \"3\": 1, \"11\": 1, \"15\": 1}, \"1\": {\"13\": 1, \"2\": 1, \"4\": 1, \"10\": 1, \"8\": 1, \"17\": 1, \"9\": 1}, \"2\": {\"13\": 1, \"6\": 1, \"17\": 1, \"1\": 1, \"3\": 1}, \"3\": {\"1... | {
"generator_name": "easy",
"index": 216,
"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, \"13\": 1, \"11\": 1, \"8\": 1, \"12\": 1}, \"1\": {\"3\": 1, \"7\": 1}, \"2\": {\"3\": 1, \"8\": 1, \"12\": 1, \"0\": 1, \"4\": 1}, \"3\": {\"6\": 1, \"2\": 1, \"11\": 1, \"12\": 1, \"1\": 1}, \"4\": {\"6\": 1, \"2\": 1, \"7\": 1, \"8\": ... | {
"generator_name": "easy",
"index": 171,
"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, 18], \"S\": {\"0\": [11, 18, 9, 7, 0], \"1\": [1, 12, 10, 4, 0, 8], \"2\": [14, 5], \"3\": [9, 18, 10, 1, 6, 7, 13], \"4\": [14, 11, 0, 13, 6], \"5\": [16, 2], \"6\": [17, 15], \"7\": [14... | {
"generator_name": "easy",
"index": 44,
"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, 5, 4, 11, 13, 14], \"1\": [15, 11, 3, 6, 7, 9, 10, 13, 14], \"2\": [17, 14, 9, 13], \"3\": [10, 9, 1, 8, 18], \"4\": [13, 17, 0, 11], \"5\": [11, 0, 10, 12, 17], \"6\": [8, 13, 1, 9, 10, 12, 18], \"7\": [12, 18, 1, 9], \"8\": [16, 6, 3, 11, 18],... | {
"generator_name": "easy",
"index": 152,
"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\": 209, \"items\": {\"0\": {\"weight\": 10, \"value\": 23}, \"7\": {\"weight\": 24, \"value\": 46}, \"10\": {\"weight\": 19, \"value\": 44}, \"11\": {\"weight\": 22, \"value\": 49}, \"12\": {\"weight\": 25, \"value\": 48}, \"15\": {\"weight\": 14... | {
"generator_name": "easy",
"index": 51,
"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\", \"4\", \"7\"], \"1\": [\"0\", \"6\", \"7\"], \"2\": [\"4\", \"6\", \"7\"], \"3\": [\"7\"], \"4\": [\"0\", \"2\", \"5\"], \"5\": [\"4\"], \"6\": [\"1\", \"2\"], \"7\": [\"0\", \"1\", \"2\", \"3\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 219,
"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\": [13, 16, 2, 5, 8, 11, 15], \"1\": [8, 10, 5, 9, 12, 15, 17], \"2\": [17, 18, 0, 3, 6, 8, 15], \"3\": [10, 7, 2, 5, 14, 18], \"4\": [12, 6, 8, 15], \"5\": [18, 8, 0, 1, 3, 13], \"6\": [4, 13, 2, 7, 8, 9, 11, 12], \"7\": [3, 15, 6, 13], \"8\": [5, 1, 0... | {
"generator_name": "easy",
"index": 186,
"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], \"1\": [], \"2\": [9], \"3\": [5], \"4\": [0], \"5\": [3], \"6\": [8], \"7\": [], \"8\": [6, 10], \"9\": [2, 10], \"10\": [8, 9]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 1,
"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\": {\"11\": 1, \"14\": 1, \"9\": 1, \"17\": 1, \"6\": 1, \"10\": 1, \"8\": 1, \"3\": 1, \"5\": 1, \"16\": 1}, \"1\": {\"15\": 1, \"12\": 1, \"16\": 1, \"5\": 1}, \"2\": {\"11\": 1, \"15\": 1, \"13\": 1, \"9\": 1, \"12\": 1, \"6\": 1, \"4\": 1}, \"3\": {... | {
"generator_name": "easy",
"index": 103,
"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\": 1, \"1\": 2, \"2\": 8, \"5\": 10, \"6\": 9, \"7\": 10, \"9\": 9, \"10\": 10, \"11\": 9, \"12\": 9, \"13\": 8, \"40\": 3}, \"1\": {\"0\": 2, \"3\": 3, \"9\": 1, \"10\": 1, \"16\": 9, \"15\": 10, \"17\": 9, \"41\": 9, \"38\": 9, \"32\": 10}, \... | {
"generator_name": "easy",
"index": 125,
"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\": 13, \"2\": 90, \"3\": 44, \"4\": 33, \"5\": 79, \"6\": 100, \"7\": 28, \"8\": 74, \"9\": 44, \"10\": 62, \"11\": 85, \"12\": 67, \"13\": 36, \"14\": 78, \"15\": 27}, \"1\": {\"0\": 13, \"1\": 0, \"2\": 70, \"3\": 79, \"4\": 71, \"5\... | {
"generator_name": "easy",
"index": 92,
"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\": 3, \"1\": 5, \"2\": 4, \"3\": 1, \"4\": 1, \"5\": 1}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 168,
"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, 10], \"1\": [1, 12, 7], \"2\": [2, 3, 9], \"3\": [9, 1, 5], \"4\": [6], \"5\": [4, 3, 5, 8, 0]}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 173,
"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\": {\"10\": 1, \"5\": 1, \"11\": 1, \"16\": 1, \"12\": 1, \"13\": 1, \"2\": 1}, \"1\": {\"6\": 1, \"10\": 1, \"9\": 1, \"3\": 1, \"12\": 1, \"14\": 1, \"2\": 1}, \"2\": {\"6\": 1, \"10\": 1, \"5\": 1, \"1\": 1, \"0\": 1, \"11\": 1, \"13\": 1}, \"3\": {\... | {
"generator_name": "easy",
"index": 153,
"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\": {\"4\": 1, \"2\": 9, \"5\": 10, \"6\": 8, \"8\": 8, \"11\": 9, \"12\": 8, \"13\": 9, \"36\": 5, \"32\": 3, \"38\": 1, \"22\": 1}, \"1\": {\"4\": 1, \"3\": 10, \"5\": 9, \"6\": 10, \"8\": 8, \"11\": 8, \"12\": 10, \"13\": 9, \"32\": 1, \"37\": 5, \"31... | {
"generator_name": "easy",
"index": 147,
"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\": 18, \"2\": 64, \"3\": 17, \"4\": 32, \"5\": 89, \"6\": 48, \"7\": 37, \"8\": 24, \"9\": 71, \"10\": 68, \"11\": 53, \"12\": 50, \"13\": 11, \"14\": 30, \"15\": 58, \"16\": 24, \"17\": 100, \"18\": 67, \"19\": 100}, \"1\": {\"0\": 18... | {
"generator_name": "easy",
"index": 3,
"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\": 206, \"items\": {\"1\": {\"weight\": 8, \"value\": 16}, \"2\": {\"weight\": 21, \"value\": 42}, \"4\": {\"weight\": 25, \"value\": 56}, \"5\": {\"weight\": 19, \"value\": 41}, \"10\": {\"weight\": 21, \"value\": 45}, \"13\": {\"weight\": 18, \... | {
"generator_name": "easy",
"index": 220,
"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\": [16, 4, 1, 8, 9, 10, 11], \"1\": [11, 2, 0, 3, 6, 7, 10], \"2\": [1, 15, 10], \"3\": [7, 10, 1, 4, 8, 11, 14], \"4\": [0, 7, 3, 11, 12], \"5\": [14, 6, 11, 13], \"6\": [5, 12, 1, 7, 10, 11, 13, 15], \"7\": [4, 3, 1, 6, 13], \"8\": [15, 16, 0, 3, 10, ... | {
"generator_name": "easy",
"index": 108,
"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\": 60}, \"1\": {\"attendees\": [0, 2], \"duration\": 30}, \"2\": {\"attendees\": [0, 1, 2], \"duration\": 60}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 90}}, \"attendee_availability\": {\"0\... | {
"generator_name": "easy",
"index": 141,
"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\": [1, 2], \"duration\": 90}, \"2\": {\"attendees\": [1, 2], \"duration\": 60}, \"3\": {\"attendees\": [1, 2], \"duration\": 60}}, \"attendee_availability\": {\"0\": [[5... | {
"generator_name": "easy",
"index": 74,
"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\": {\"39\": 1, \"1\": 10, \"2\": 10, \"3\": 10, \"4\": 10, \"6\": 9, \"7\": 8, \"8\": 8, \"10\": 10, \"11\": 10, \"20\": 5, \"34\": 1, \"36\": 1}, \"1\": {\"12\": 1, \"0\": 10, \"2\": 8, \"3\": 8, \"6\": 10, \"8\": 10, \"10\": 8, \"11\": 8, \"26\": 2, \... | {
"generator_name": "easy",
"index": 187,
"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, 3], \"duration\": 30}, \"1\": {\"attendees\": [1, 2, 3], \"duration\": 30}, \"2\": {\"attendees\": [0, 3, 4], \"duration\": 90}, \"3\": {\"attendees\": [1, 3, 4], \"duration\": 90}, \"4\": {\"attendees\": [0, 1, 4],... | {
"generator_name": "easy",
"index": 66,
"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\", \"6\"], \"1\": [\"0\", \"3\", \"7\"], \"2\": [\"0\", \"5\"], \"3\": [\"1\"], \"4\": [\"6\"], \"5\": [\"2\"], \"6\": [\"0\", \"4\", \"7\"], \"7\": [\"1\", \"6\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 104,
"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\": 78, \"items\": {\"3\": {\"weight\": 15, \"value\": 33}, \"4\": {\"weight\": 10, \"value\": 19}, \"5\": {\"weight\": 5, \"value\": 9}, \"11\": {\"weight\": 9, \"value\": 19}, \"13\": {\"weight\": 13, \"value\": 28}, \"15\": {\"weight\": 6, \"va... | {
"generator_name": "easy",
"index": 64,
"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\": [\"2\", \"3\", \"4\"], \"1\": [\"3\"], \"2\": [\"0\", \"3\", \"4\"], \"3\": [\"0\", \"1\", \"2\", \"4\"], \"4\": [\"0\", \"2\", \"3\"]}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 102,
"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\": 60}, \"1\": {\"attendees\": [0, 1, 2], \"duration\": 60}, \"2\": {\"attendees\": [0, 1, 2], \"duration\": 90}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 90}}, \"attendee_availability\": {\... | {
"generator_name": "easy",
"index": 194,
"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\": {\"41\": 1, \"11\": 3, \"1\": 8, \"2\": 8, \"3\": 8, \"4\": 9, \"5\": 9, \"6\": 9, \"7\": 8, \"8\": 8, \"12\": 10, \"13\": 8, \"10\": 1, \"16\": 1, \"30\": 3, \"15\": 6}, \"1\": {\"16\": 1, \"10\": 3, \"11\": 1, \"0\": 8, \"2\": 10, \"3\": 8, \"4\": ... | {
"generator_name": "easy",
"index": 0,
"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\": [6], \"1\": [5, 2], \"2\": [5, 1, 9, 3], \"3\": [4, 9, 2], \"4\": [9, 3, 10], \"5\": [1, 2], \"6\": [0, 10], \"7\": [], \"8\": [], \"9\": [4, 3, 2], \"10\": [4, 6]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 119,
"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\": {\"6\": 1, \"10\": 1}, \"1\": {\"7\": 1, \"10\": 1}, \"2\": {\"6\": 1, \"4\": 1}, \"3\": {\"6\": 1, \"8\": 1}, \"4\": {\"7\": 1, \"8\": 1, \"9\": 1, \"2\": 1, \"11\": 1, \"12\": 1}, \"5\": {\"8\": 1, \"10\": 1}, \"6\": {\"3\": 1, \"0\": 1, \"2\": 1, ... | {
"generator_name": "easy",
"index": 15,
"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\": [\"2\", \"3\", \"4\"], \"1\": [\"3\", \"4\"], \"2\": [\"0\", \"3\", \"4\"], \"3\": [\"0\", \"1\", \"2\"], \"4\": [\"0\", \"1\", \"2\"]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 176,
"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\": {\"7\": 1, \"2\": 1, \"4\": 1, \"10\": 1, \"11\": 1, \"12\": 1}, \"1\": {\"13\": 1, \"6\": 1}, \"2\": {\"9\": 1, \"3\": 1, \"0\": 1, \"14\": 1}, \"3\": {\"13\": 1, \"6\": 1, \"2\": 1, \"11\": 1}, \"4\": {\"9\": 1, \"5\": 1, \"0\": 1, \"13\": 1, \"7\"... | {
"generator_name": "easy",
"index": 141,
"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\": {\"6\": 1}, \"1\": {\"6\": 1, \"9\": 1}, \"2\": {\"5\": 1, \"6\": 1, \"9\": 1, \"10\": 1, \"3\": 1, \"7\": 1}, \"3\": {\"8\": 1, \"2\": 1, \"12\": 1, \"9\": 1}, \"4\": {\"8\": 1, \"12\": 1, \"5\": 1, \"9\": 1}, \"5\": {\"2\": 1, \"9\": 1, \"4\": 1, \... | {
"generator_name": "easy",
"index": 188,
"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\": [0, 2, 4], \"duration\": 60}, \"2\": {\"attendees\": [1, 2], \"duration\": 30}, \"3\": {\"attendees\": [2, 3], \"duration\": 30}, \"4\": {\"attendees\": [1, 3], \"dur... | {
"generator_name": "easy",
"index": 131,
"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\": [11, 16, 6, 9, 18], \"1\": [17, 3, 9, 10, 15], \"2\": [13, 11, 4, 7, 8, 14, 18], \"3\": [1, 14, 5, 11], \"4\": [18, 9, 2, 13, 15, 16], \"5\": [12, 8, 3, 7, 10, 11, 16, 18], \"6\": [15, 8, 0, 10, 12], \"7\": [16, 10, 2, 5, 9, 14, 15], \"8\": [5, 6, 2,... | {
"generator_name": "easy",
"index": 6,
"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, 17, 1, 10, 13, 16], \"1\": [17, 11, 0, 6], \"2\": [6, 10, 8, 9, 15, 16], \"3\": [7, 16, 4, 12, 14, 17], \"4\": [5, 6, 3], \"5\": [15, 4, 7, 8], \"6\": [4, 2, 1, 8, 16], \"7\": [9, 3, 5, 8], \"8\": [13, 0, 2, 5, 6, 7], \"9\": [11, 7, 2], \"10\": [... | {
"generator_name": "easy",
"index": 48,
"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, \"2\": 8, \"3\": 10, \"4\": 8, \"5\": 10, \"6\": 9, \"7\": 8, \"8\": 10, \"10\": 10, \"12\": 8, \"13\": 10, \"14\": 6}, \"1\": {\"3\": 1, \"4\": 1, \"6\": 1, \"22\": 9, \"27\": 10, \"33\": 9, \"37\": 10, \"41\": 9, \"12\": 2, \"31\": 4}, ... | {
"generator_name": "easy",
"index": 137,
"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\": {\"15\": 1, \"9\": 1, \"13\": 1, \"1\": 1, \"7\": 1, \"18\": 1, \"14\": 1, \"2\": 1, \"4\": 1}, \"1\": {\"15\": 1, \"10\": 1, \"13\": 1, \"5\": 1, \"0\": 1, \"8\": 1, \"12\": 1, \"18\": 1, \"4\": 1, \"14\": 1}, \"2\": {\"15\": 1, \"9\": 1, \"16\": 1,... | {
"generator_name": "easy",
"index": 53,
"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\": {\"1\": 1, \"3\": 1, \"13\": 1, \"15\": 1, \"10\": 1, \"8\": 1, \"7\": 1, \"18\": 1}, \"1\": {\"0\": 1, \"12\": 1, \"6\": 1, \"11\": 1, \"13\": 1, \"19\": 1, \"10\": 1, \"18\": 1, \"8\": 1}, \"2\": {\"11\": 1, \"13\": 1, \"7\": 1, \"4\": 1, \"14\": 1... | {
"generator_name": "easy",
"index": 214,
"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\": [0], \"1\": [0, 4, 10], \"2\": [9, 11, 4], \"3\": [0, 6, 7], \"4\": [9, 1, 8], \"5\": [0, 3, 2, 5]}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 99,
"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.