data_source stringclasses 10
values | prompt listlengths 1 1 | reward_model dict | extra_info dict |
|---|---|---|---|
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, 7, 11, 12, 16], \"1\": [13, 6, 2, 4, 7, 15, 18], \"2\": [0, 16, 1, 6, 8, 13, 15], \"3\": [10, 9, 4, 12, 13, 17], \"4\": [12, 18, 1, 3, 11, 13, 15, 17], \"5\": [17, 7, 10, 12, 15], \"6\": [1, 14, 2, 8], \"7\": [14, 5, 0, 1, 8, 10, 13, 15], \"8\... | {
"generator_name": "easy",
"index": 39,
"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\": 71, \"2\": 69, \"3\": 97, \"4\": 81, \"5\": 94, \"6\": 16, \"7\": 23, \"8\": 46, \"9\": 27}, \"1\": {\"0\": 71, \"1\": 0, \"2\": 93, \"3\": 84, \"4\": 75, \"5\": 35, \"6\": 19, \"7\": 23, \"8\": 83, \"9\": 17}, \"2\": {\"0\": 69, \"... | {
"generator_name": "easy",
"index": 94,
"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\": [1, 2], \"duration\": 90}, \"2\": {\"attendees\": [0, 1, 2], \"duration\": 60}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 30}, \"4\": {\"attendees\": [0, 2], \"dur... | {
"generator_name": "easy",
"index": 214,
"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\": {\"32\": 2, \"2\": 2, \"4\": 2, \"15\": 10, \"19\": 10, \"26\": 9, \"35\": 10, \"39\": 9, \"40\": 10, \"11\": 3}, \"1\": {\"12\": 3, \"2\": 9, \"3\": 10, \"4\": 8, \"5\": 10, \"6\": 8, \"8\": 9, \"9\": 8, \"10\": 10, \"11\": 8, \"13\": 9, \"21\": 3, ... | {
"generator_name": "easy",
"index": 175,
"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\": [2, 3], \"duration\": 90}, \"2\": {\"attendees\": [2, 3, 4], \"duration\": 90}, \"3\": {\"attendees\": [0, 3, 4], \"duration\": 90}, \"4\": {\"attendees\": [1, 3], \"dur... | {
"generator_name": "easy",
"index": 206,
"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\": 90}, \"1\": {\"attendees\": [0, 3], \"duration\": 30}, \"2\": {\"attendees\": [1, 2], \"duration\": 30}, \"3\": {\"attendees\": [0, 2], \"duration\": 90}}, \"attendee_availability\": {\"0\": [[5... | {
"generator_name": "easy",
"index": 169,
"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\": 48, \"2\": 81, \"3\": 79, \"4\": 92, \"5\": 67, \"6\": 56, \"7\": 67, \"8\": 32, \"9\": 26}, \"1\": {\"0\": 48, \"1\": 0, \"2\": 69, \"3\": 19, \"4\": 20, \"5\": 23, \"6\": 13, \"7\": 11, \"8\": 49, \"9\": 37}, \"2\": {\"0\": 81, \"... | {
"generator_name": "easy",
"index": 48,
"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\": 76, \"2\": 55, \"3\": 57, \"4\": 78, \"5\": 20, \"6\": 39, \"7\": 40, \"8\": 90, \"9\": 13, \"10\": 52, \"11\": 82, \"12\": 10, \"13\": 57, \"14\": 82, \"15\": 56, \"16\": 28, \"17\": 24}, \"1\": {\"0\": 76, \"1\": 0, \"2\": 84, \"3... | {
"generator_name": "easy",
"index": 104,
"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, \"12\": 1, \"1\": 1, \"16\": 1, \"7\": 1, \"15\": 1}, \"1\": {\"9\": 1, \"12\": 1, \"14\": 1, \"0\": 1, \"13\": 1, \"10\": 1, \"16\": 1, \"3\": 1, \"4\": 1, \"15\": 1}, \"2\": {\"9\": 1, \"8\": 1, \"14\": 1, \"13\": 1, \"11\": 1, \"5\": 1,... | {
"generator_name": "easy",
"index": 156,
"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\": {\"8\": 1, \"11\": 1, \"3\": 1, \"6\": 1, \"16\": 1, \"9\": 1, \"15\": 1, \"4\": 1, \"10\": 1, \"19\": 1}, \"1\": {\"14\": 1, \"3\": 1, \"2\": 1, \"5\": 1, \"12\": 1, \"19\": 1}, \"2\": {\"8\": 1, \"11\": 1, \"14\": 1, \"1\": 1, \"6\": 1, \"16\": 1, ... | {
"generator_name": "easy",
"index": 83,
"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, 4, 7, 8, 11, 12], \"1\": [16, 12, 2, 10, 13], \"2\": [13, 11, 1, 4, 14, 16], \"3\": [6, 5, 8, 10, 11, 12, 15, 16], \"4\": [0, 15, 2, 17], \"5\": [11, 3, 7, 17], \"6\": [3, 9, 16], \"7\": [15, 14, 0, 5, 8], \"8\": [14, 13, 0, 3, 7, 10], \"9\": [6... | {
"generator_name": "easy",
"index": 224,
"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\": [8, 4, 7, 2], \"1\": [4, 1, 8, 3], \"2\": [5, 3, 2], \"3\": [6, 8, 9], \"4\": [8, 5, 4], \"5\": [7, 0], \"6\": [3, 7, 5, 4], \"7\": [6, 3, 2]}}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 172,
"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\": {\"4\": 1, \"16\": 1, \"13\": 1, \"1\": 1, \"12\": 1}, \"1\": {\"5\": 1, \"15\": 1, \"6\": 1, \"18\": 1, \"9\": 1, \"0\": 1, \"10\": 1, \"2\": 1, \"11\": 1, \"17\": 1}, \"2\": {\"4\": 1, \"8\": 1, \"16\": 1, \"5\": 1, \"14\": 1, \"19\": 1, \"13\": 1,... | {
"generator_name": "easy",
"index": 207,
"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\", \"2\", \"3\", \"4\", \"5\"], \"2\": [\"0\", \"1\", \"3\", \"4\", \"5\", \"6\"], \"3\": [\"1\", \"2\", \"4\"], \"4\": [\"1\", \"2\", \"3\", \"5\"], \"5\": [\"1\", \"2\", \"4\"], \"6\": [\"0\", \"2\"]}, \"ground_tr... | {
"generator_name": "easy",
"index": 85,
"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\": 3, \"1\": 3, \"2\": 1, \"3\": 1, \"4\": 5, \"5\": 4, \"6\": 4, \"7\": 2, \"8\": 2}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 99,
"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, \"1\": 1, \"9\": 1, \"13\": 1}, \"1\": {\"14\": 1, \"5\": 1, \"9\": 1, \"18\": 1, \"11\": 1, \"0\": 1, \"3\": 1, \"4\": 1, \"10\": 1, \"12\": 1}, \"2\": {\"8\": 1, \"6\": 1, \"18\": 1, \"13\": 1, \"17\": 1, \"15\": 1, \"3\": 1, \"10\": 1}... | {
"generator_name": "easy",
"index": 6,
"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], \"S\": {\"0\": [1, 10, 6], \"1\": [13, 5, 0, 12], \"2\": [8, 3, 7], \"3\": [2, 8, 0, 9], \"4\": [13, 4, 11], \"5\": [14]}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 97,
"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\": 95, \"items\": {\"4\": {\"weight\": 8, \"value\": 14}, \"5\": {\"weight\": 7, \"value\": 14}, \"7\": {\"weight\": 11, \"value\": 24}, \"8\": {\"weight\": 8, \"value\": 15}, \"10\": {\"weight\": 24, \"value\": 46}, \"14\": {\"weight\": 13, \"va... | {
"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\": [\"2\", \"3\", \"4\"], \"1\": [\"2\", \"3\", \"4\"], \"2\": [\"0\", \"1\", \"3\", \"4\"], \"3\": [\"0\", \"1\", \"2\", \"4\"], \"4\": [\"0\", \"1\", \"2\", \"3\"]}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 4,
"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, 19, 4, 5, 8, 18], \"1\": [12, 17, 4, 5, 10], \"2\": [14, 12, 9, 10, 13], \"3\": [7, 0, 4, 12, 15, 18], \"4\": [10, 7, 0, 1, 3, 11, 12, 18], \"5\": [16, 9, 0, 1, 11, 19], \"6\": [11, 14, 13, 16, 17, 19], \"7\": [4, 3, 10, 11, 12, 16, 17], \"8\": [... | {
"generator_name": "easy",
"index": 105,
"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\": 11, \"numbers\": {\"0\": 2, \"1\": 1, \"2\": 4, \"3\": 3, \"4\": 5, \"5\": 4, \"6\": 2}}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 141,
"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\", \"5\", \"6\"], \"1\": [\"2\"], \"2\": [\"0\", \"1\", \"3\", \"4\", \"5\"], \"3\": [\"0\", \"2\", \"4\"], \"4\": [\"0\", \"2\", \"3\", \"5\", \"6\"], \"5\": [\"0\", \"2\", \"4\", \"6\"], \"6\": [\"0\", \"4\", \"5\"]}, \"ground_tr... | {
"generator_name": "easy",
"index": 95,
"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\": {\"18\": 1, \"3\": 8, \"4\": 8, \"5\": 9, \"6\": 8, \"7\": 9, \"8\": 9, \"10\": 9, \"11\": 10, \"12\": 10, \"37\": 5, \"1\": 4}, \"1\": {\"6\": 3, \"8\": 1, \"17\": 10, \"25\": 10, \"16\": 10, \"28\": 10, \"31\": 10, \"36\": 9, \"0\": 4, \"7\": 1, \"... | {
"generator_name": "easy",
"index": 195,
"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\": [5], \"2\": [3, 6], \"3\": [2], \"4\": [], \"5\": [1], \"6\": [2], \"7\": []}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 153,
"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\": 150, \"items\": {\"2\": {\"weight\": 25, \"value\": 57}, \"4\": {\"weight\": 21, \"value\": 42}, \"5\": {\"weight\": 7, \"value\": 17}, \"6\": {\"weight\": 24, \"value\": 55}, \"8\": {\"weight\": 18, \"value\": 34}, \"13\": {\"weight\": 20, \"... | {
"generator_name": "easy",
"index": 36,
"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\": [2, 5, 7, 6], \"1\": [6, 7, 11, 8], \"2\": [0, 9, 10], \"3\": [3, 12], \"4\": [11, 4], \"5\": [4, 11], \"6\": [0, 6, 7, 1]}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 215,
"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\": 33, \"3\": 81, \"4\": 57, \"5\": 91, \"6\": 40, \"7\": 56, \"8\": 73, \"9\": 28, \"10\": 73, \"11\": 43, \"12\": 21}, \"1\": {\"0\": 14, \"1\": 0, \"2\": 16, \"3\": 97, \"4\": 56, \"5\": 22, \"6\": 97, \"7\": 63, \"8\": 4... | {
"generator_name": "easy",
"index": 154,
"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\": [5, 7], \"1\": [7, 4], \"2\": [7], \"3\": [], \"4\": [1], \"5\": [7, 0], \"6\": [], \"7\": [1, 5, 2, 0]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 2,
"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, 15, 2, 6], \"1\": [10, 14, 2, 9, 15], \"2\": [4, 7, 0, 1, 10, 11], \"3\": [7, 5, 9], \"4\": [6, 2, 15, 16], \"5\": [3, 8, 6, 13, 16], \"6\": [9, 4, 0, 5, 10, 11], \"7\": [2, 3, 12], \"8\": [5, 16, 12], \"9\": [11, 6, 1, 3], \"10\": [1, 13, 2, 6]... | {
"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\": {\"6\": 1, \"3\": 1, \"1\": 1, \"12\": 1, \"7\": 1}, \"1\": {\"15\": 1, \"10\": 1, \"0\": 1, \"4\": 1, \"5\": 1, \"14\": 1}, \"2\": {\"3\": 1, \"12\": 1, \"5\": 1}, \"3\": {\"8\": 1, \"16\": 1, \"2\": 1, \"12\": 1, \"13\": 1, \"0\": 1, \"4\": 1, \"10... | {
"generator_name": "easy",
"index": 90,
"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\": 5, \"1\": 5, \"2\": 1, \"3\": 4, \"4\": 4}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 14,
"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, \"7\": 1, \"10\": 1, \"2\": 1, \"5\": 1}, \"1\": {\"7\": 1, \"10\": 1, \"2\": 1, \"8\": 1, \"6\": 1, \"12\": 1}, \"2\": {\"11\": 1, \"8\": 1, \"1\": 1, \"9\": 1, \"0\": 1, \"4\": 1, \"6\": 1}, \"3\": {\"8\": 1, \"5\": 1, \"6\": 1, \"4\": ... | {
"generator_name": "easy",
"index": 62,
"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\": [2, 3, 13, 1, 12], \"1\": [7, 4], \"2\": [9, 0, 5], \"3\": [2, 3, 9], \"4\": [8, 11], \"5\": [6, 10]}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 17,
"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\"], \"2\": [\"0\"], \"3\": [\"1\", \"4\"], \"4\": [\"3\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 200,
"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\": [16, 15], \"1\": [15, 5, 3, 7, 14, 16, 12], \"2\": [16, 15, 2, 4, 0, 9, 12], \"3\": [16, 10, 15, 11, 14, 8, 6], \"4\": [15, 5], \"5\": [11, 1, 0, 7, 5, 10, 14], \"6\": [1]... | {
"generator_name": "easy",
"index": 220,
"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, 5], \"1\": [6], \"2\": [4, 5], \"3\": [6, 0], \"4\": [2, 5], \"5\": [4, 6, 2, 0], \"6\": [7, 1, 3, 5], \"7\": [6]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 118,
"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\": [3, 5, 6, 8], \"2\": [1], \"3\": [7], \"4\": [2, 7, 6, 0, 4], \"5\": [9, 5]}}, \"ground_truth\": 4}",
"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\": 152, \"items\": {\"0\": {\"weight\": 19, \"value\": 42}, \"2\": {\"weight\": 13, \"value\": 23}, \"3\": {\"weight\": 9, \"value\": 22}, \"5\": {\"weight\": 5, \"value\": 11}, \"9\": {\"weight\": 25, \"value\": 60}, \"10\": {\"weight\": 9, \"va... | {
"generator_name": "easy",
"index": 8,
"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, 19], \"S\": {\"0\": [8, 12, 11], \"1\": [7, 19, 3, 2], \"2\": [11, 19, 18, 6], \"3\": [7, 19, 15, 9, 14, 0, 18], \"4\": [16, 14, 17], \"5\": [5, 1, 10], \"6\": [11, 13, 4, 9]}}, \"gro... | {
"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\": 23, \"numbers\": {\"0\": 5, \"1\": 4, \"2\": 4, \"3\": 5, \"4\": 1, \"5\": 4}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 50,
"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\": 5, \"1\": 1, \"2\": 5, \"3\": 4, \"4\": 2, \"5\": 4, \"6\": 1, \"7\": 1, \"8\": 2}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 39,
"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\": [9, 11, 8], \"1\": [11, 8, 9, 6, 1], \"2\": [10], \"3\": [5, 10], \"4\": [2, 6, 7, 12], \"5\": [8, 5, 6], \"6\": [8], \"7\": [3, 0, 2], \"8\": [12, 7, 2, 10, 4]}}, \"ground_truth\": 4}",
"s... | {
"generator_name": "easy",
"index": 210,
"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\": 77, \"2\": 45, \"3\": 43, \"4\": 52, \"5\": 94, \"6\": 80, \"7\": 63, \"8\": 32, \"9\": 61, \"10\": 99}, \"1\": {\"0\": 77, \"1\": 0, \"2\": 63, \"3\": 19, \"4\": 55, \"5\": 69, \"6\": 22, \"7\": 14, \"8\": 32, \"9\": 20, \"10\": 10... | {
"generator_name": "easy",
"index": 202,
"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\": 152, \"items\": {\"0\": {\"weight\": 24, \"value\": 56}, \"5\": {\"weight\": 9, \"value\": 18}, \"12\": {\"weight\": 13, \"value\": 24}, \"13\": {\"weight\": 21, \"value\": 44}, \"14\": {\"weight\": 25, \"value\": 52}, \"15\": {\"weight\": 10,... | {
"generator_name": "easy",
"index": 96,
"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, 1, 3], \"1\": [0, 10, 2, 5, 11], \"2\": [12, 14, 1, 6, 7, 8, 11], \"3\": [9, 13, 0, 4, 6, 14], \"4\": [13, 0, 3, 5, 7, 14], \"5\": [8, 11, 1, 4, 12], \"6\": [14, 9, 2, 3], \"7\": [11, 12, 2, 4, 8, 14], \"8\": [5, 10, 2, 7], \"9\": [6, 3, 10], \"1... | {
"generator_name": "easy",
"index": 20,
"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], \"S\": {\"0\": [14, 3, 10, 1, 4], \"1\": [9, 10, 4, 11, 5], \"2\": [14, 4, 1, 12, 11], \"3\": [11, 2, 4, 10, 5, 3], \"4\": [14, 7], \"5\": [8, 10, 11], \"6\": [14, 0, 13], \"7\": [8, 5], \"8\": [0, ... | {
"generator_name": "easy",
"index": 186,
"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\", \"5\"], \"1\": [\"0\", \"2\", \"5\", \"7\"], \"2\": [\"0\", \"1\", \"3\", \"4\", \"5\"], \"3\": [\"0\", \"2\", \"5\", \"6\", \"7\"], \"4\": [\"2\", \"5\"], \"5\": [\"0\", \"1\", \"2\", \"3\", \"4\"], \"6\": [\"3\", \"7\"], \"7\"... | {
"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\": [1, 9, 3, 10], \"1\": [0, 5, 2], \"2\": [1], \"3\": [0], \"4\": [9], \"5\": [1, 9], \"6\": [7, 8, 10], \"7\": [6], \"8\": [6], \"9\": [0, 5, 4], \"10\": [6, 0]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 26,
"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\": 41, \"2\": 26, \"3\": 28, \"4\": 28, \"5\": 86, \"6\": 97, \"7\": 72, \"8\": 37, \"9\": 98, \"10\": 13, \"11\": 58, \"12\": 62, \"13\": 61}, \"1\": {\"0\": 41, \"1\": 0, \"2\": 86, \"3\": 11, \"4\": 67, \"5\": 62, \"6\": 98, \"7\": ... | {
"generator_name": "easy",
"index": 160,
"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\": 2, \"1\": 1, \"2\": 4, \"3\": 2, \"4\": 3, \"5\": 2, \"6\": 2, \"7\": 2}}, \"ground_truth\": 7}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 81,
"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\": 5, \"1\": 2, \"2\": 2, \"3\": 2, \"4\": 1, \"5\": 2, \"6\": 5}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 150,
"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, 17, 9, 12, 14], \"1\": [10, 4, 2, 3, 11], \"2\": [7, 6, 1, 3, 4, 9, 11, 16, 17], \"3\": [5, 16, 1, 2, 14], \"4\": [1, 12, 2, 6, 7, 13, 15, 17], \"5\": [11, 3, 7, 9, 14], \"6\": [2, 0, 4, 9, 11, 14, 16, 17], \"7\": [9, 2, 4, 5, 10, 15], \"8\": [14... | {
"generator_name": "easy",
"index": 101,
"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\": [5], \"1\": [2], \"2\": [1], \"3\": [7], \"4\": [6], \"5\": [0, 7], \"6\": [4], \"7\": [3, 5]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 221,
"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, \"13\": 1, \"4\": 1, \"11\": 1}, \"1\": {\"14\": 1, \"8\": 1, \"9\": 1, \"12\": 1, \"4\": 1, \"11\": 1}, \"2\": {\"6\": 1, \"9\": 1, \"12\": 1, \"5\": 1, \"7\": 1, \"10\": 1}, \"3\": {\"6\": 1, \"8\": 1, \"5\": 1, \"11\": 1}, \"4\": {\"9\"... | {
"generator_name": "easy",
"index": 224,
"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\": 92, \"2\": 65, \"3\": 74, \"4\": 51, \"5\": 63, \"6\": 78, \"7\": 65, \"8\": 74, \"9\": 79, \"10\": 16, \"11\": 29, \"12\": 76, \"13\": 38, \"14\": 77, \"15\": 83, \"16\": 83, \"17\": 74, \"18\": 64}, \"1\": {\"0\": 92, \"1\": 0, \"... | {
"generator_name": "easy",
"index": 172,
"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, 14, 7], \"1\": [16, 7, 4, 5, 11], \"2\": [5, 13, 6, 12, 14, 16], \"3\": [18, 17, 4, 9], \"4\": [9, 10, 1, 3, 8, 17], \"5\": [14, 2, 1, 17], \"6\": [8, 16, 2, 10, 14, 18], \"7\": [1, 15, 0, 13, 14, 17], \"8\": [17, 6, 4, 9, 11, 14], \"9\": [4, 15... | {
"generator_name": "easy",
"index": 153,
"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\": 186, \"items\": {\"0\": {\"weight\": 7, \"value\": 14}, \"1\": {\"weight\": 11, \"value\": 22}, \"3\": {\"weight\": 21, \"value\": 51}, \"5\": {\"weight\": 6, \"value\": 11}, \"9\": {\"weight\": 24, \"value\": 44}, \"11\": {\"weight\": 22, \"v... | {
"generator_name": "easy",
"index": 175,
"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, 7, 13], \"1\": [3, 15, 9, 11, 18], \"2\": [8, 6, 4, 5, 9, 11, 12, 13, 14, 15], \"3\": [5, 1], \"4\": [7, 9, 2, 6], \"5\": [3, 10, 2, 6, 14], \"6\": [2, 10, 0, 4, 5, 12, 14, 16, 18], \"7\": [13, 4, 0, 18], \"8\": [12, 2, 14], \"9\": [4, 18... | {
"generator_name": "easy",
"index": 170,
"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\": 5, \"1\": 5, \"2\": 4, \"3\": 2, \"4\": 1, \"5\": 5, \"6\": 5, \"7\": 1}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 162,
"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, 19], \"S\": {\"0\": [17, 4, 6, 0, 1], \"1\": [10, 8], \"2\": [9, 0, 11, 5, 2, 10, 13], \"3\": [11, 16, 7, 3, 6, 14], \"4\": [12, 3, 10, 13, 5, 15, 18, 19]}}, \"ground_truth\": 5}",
... | {
"generator_name": "easy",
"index": 222,
"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\": 3, \"3\": 1, \"4\": 4, \"5\": 1, \"6\": 3}}, \"ground_truth\": 7}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 167,
"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\": {\"14\": 2, \"13\": 1, \"1\": 8, \"7\": 9, \"8\": 10, \"9\": 8, \"10\": 9, \"11\": 8, \"12\": 10, \"5\": 5}, \"1\": {\"3\": 1, \"0\": 8, \"2\": 8, \"5\": 9, \"6\": 9, \"7\": 9, \"8\": 10, \"9\": 8, \"10\": 10, \"11\": 8, \"12\": 9, \"40\": 1, \"35\":... | {
"generator_name": "easy",
"index": 57,
"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\": [7, 4, 2, 3, 10, 14], \"1\": [13, 17, 2, 9, 10, 16], \"2\": [6, 10, 0, 1, 14], \"3\": [8, 6, 0, 4, 5], \"4\": [0, 15, 3, 6, 12], \"5\": [11, 7, 3], \"6\": [3, 2, 4, 8, 12, 15], \"7\": [5, 0, 9, 12, 17], \"8\": [3, 14, 6, 10, 15], \"9\": [17, 14, 1, 7... | {
"generator_name": "easy",
"index": 5,
"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\": [19, 1, 5, 6, 7, 9, 10, 18], \"1\": [0, 10, 4, 6, 9, 17, 18], \"2\": [7, 9, 17], \"3\": [9, 6, 10, 11, 12, 14], \"4\": [13, 16, 1], \"5\": [8, 14, 0, 9, 17, 19], \"6\": [3, 19, 0, 1, 12, 14], \"7\": [14, 2, 0, 12, 19], \"8\": [18, 5], \"9\": [2, 3, 0... | {
"generator_name": "easy",
"index": 114,
"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\": 178, \"items\": {\"3\": {\"weight\": 15, \"value\": 36}, \"8\": {\"weight\": 9, \"value\": 18}, \"10\": {\"weight\": 19, \"value\": 40}, \"12\": {\"weight\": 8, \"value\": 17}, \"17\": {\"weight\": 19, \"value\": 38}, \"18\": {\"weight\": 24, ... | {
"generator_name": "easy",
"index": 28,
"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\": [10], \"2\": [0, 4, 5], \"3\": [8, 5], \"4\": [2, 6, 8, 5], \"5\": [3, 2, 11, 4], \"6\": [4], \"7\": [8, 10], \"8\": [3, 7, 4], \"9\": [], \"10\": [1, 7], \"11\": [5]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 60,
"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\": 2, \"2\": 1, \"3\": 4, \"4\": 2, \"5\": 5}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 148,
"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, \"18\": 1, \"10\": 1, \"3\": 1, \"13\": 1}, \"1\": {\"19\": 1, \"7\": 1, \"17\": 1, \"18\": 1, \"13\": 1, \"8\": 1, \"4\": 1, \"6\": 1, \"9\": 1, \"12\": 1}, \"2\": {\"14\": 1, \"18\": 1, \"16\": 1, \"3\": 1, \"13\": 1, \"15\": 1, \"11\": ... | {
"generator_name": "easy",
"index": 174,
"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\": {\"28\": 1, \"37\": 2, \"2\": 10, \"4\": 8, \"7\": 8, \"8\": 9, \"10\": 10, \"12\": 10, \"13\": 10, \"29\": 1}, \"1\": {\"16\": 2, \"34\": 1, \"2\": 10, \"3\": 10, \"4\": 10, \"6\": 8, \"7\": 9, \"8\": 10, \"10\": 9, \"12\": 10, \"13\": 10, \"37\": 5... | {
"generator_name": "easy",
"index": 148,
"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\": {\"8\": 1, \"7\": 1, \"9\": 1, \"14\": 1, \"12\": 1, \"13\": 1}, \"1\": {\"9\": 1, \"2\": 1, \"11\": 1, \"13\": 1}, \"2\": {\"15\": 1, \"7\": 1, \"4\": 1, \"1\": 1, \"3\": 1}, \"3\": {\"16\": 1, \"8\": 1, \"7\": 1, \"9\": 1, \"14\": 1, \"13\": 1, \"2... | {
"generator_name": "easy",
"index": 81,
"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\": 30}, \"1\": {\"attendees\": [0, 4], \"duration\": 90}, \"2\": {\"attendees\": [0, 1], \"duration\": 60}, \"3\": {\"attendees\": [1, 4], \"duration\": 60}, \"4\": {\"attendees\": [0, 3, 4], \"dur... | {
"generator_name": "easy",
"index": 21,
"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\": [\"0\", \"1\"]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 217,
"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, 2, 3], \"duration\": 60}, \"2\": {\"attendees\": [1, 2, 3], \"duration\": 90}, \"3\": {\"attendees\": [0, 1, 3], \"duration\": 90}, \"4\": {\"attendees\": [0, 3], \"... | {
"generator_name": "easy",
"index": 170,
"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\": 90}, \"1\": {\"attendees\": [0, 1, 3], \"duration\": 30}, \"2\": {\"attendees\": [2, 3], \"duration\": 30}, \"3\": {\"attendees\": [2, 3], \"duration\": 90}, \"4\": {\"attendees\": [0, 1, 3], \"... | {
"generator_name": "easy",
"index": 181,
"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\"], \"2\": [\"0\", \"1\"], \"3\": [\"0\"]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 158,
"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\": [5, 7, 8], \"3\": [], \"4\": [], \"5\": [2], \"6\": [], \"7\": [2], \"8\": [2], \"9\": []}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 104,
"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\": 1, \"1\": 8, \"5\": 8, \"6\": 10, \"7\": 9, \"9\": 10, \"10\": 9, \"13\": 9, \"18\": 4, \"38\": 3, \"14\": 3, \"4\": 6}, \"1\": {\"0\": 8, \"3\": 10, \"4\": 10, \"5\": 9, \"7\": 10, \"9\": 9, \"10\": 10, \"12\": 8, \"13\": 9, \"16\": 5, \"8\... | {
"generator_name": "easy",
"index": 26,
"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\": 44, \"2\": 10, \"3\": 83, \"4\": 100, \"5\": 55, \"6\": 98, \"7\": 25, \"8\": 16, \"9\": 26, \"10\": 57, \"11\": 38, \"12\": 99, \"13\": 33}, \"1\": {\"0\": 44, \"1\": 0, \"2\": 85, \"3\": 12, \"4\": 39, \"5\": 26, \"6\": 10, \"7\":... | {
"generator_name": "easy",
"index": 69,
"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\": 133, \"items\": {\"2\": {\"weight\": 25, \"value\": 55}, \"7\": {\"weight\": 14, \"value\": 27}, \"8\": {\"weight\": 20, \"value\": 40}, \"10\": {\"weight\": 12, \"value\": 26}, \"12\": {\"weight\": 8, \"value\": 15}, \"13\": {\"weight\": 15, ... | {
"generator_name": "easy",
"index": 118,
"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\": [4, 6, 11], \"1\": [8, 5], \"2\": [8, 7, 1], \"3\": [10, 8], \"4\": [3, 4, 6], \"5\": [11, 2, 4, 0], \"6\": [1, 9], \"7\": [6, 10]}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 49,
"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\": {\"1\": {\"weight\": 17, \"value\": 32}, \"7\": {\"weight\": 15, \"value\": 28}, \"8\": {\"weight\": 17, \"value\": 36}, \"10\": {\"weight\": 23, \"value\": 42}, \"11\": {\"weight\": 11, \"value\": 21}, \"13\": {\"weight\": 12,... | {
"generator_name": "easy",
"index": 22,
"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\": {\"3\": 1, \"5\": 3, \"8\": 2, \"14\": 9, \"16\": 10, \"22\": 9, \"39\": 10, \"33\": 9, \"31\": 2, \"25\": 5, \"10\": 2, \"37\": 6, \"29\": 1}, \"1\": {\"28\": 2, \"13\": 3, \"2\": 10, \"3\": 8, \"4\": 9, \"5\": 9, \"6\": 8, \"7\": 9, \"8\": 8, \"9\"... | {
"generator_name": "easy",
"index": 35,
"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\": [5], \"2\": [3, 6], \"3\": [2, 4], \"4\": [3], \"5\": [7, 1, 6], \"6\": [2, 5], \"7\": [5], \"8\": []}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 115,
"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, \"14\": 1, \"2\": 1, \"4\": 1, \"1\": 1, \"12\": 1, \"16\": 1}, \"1\": {\"3\": 1, \"8\": 1, \"15\": 1, \"11\": 1, \"0\": 1}, \"2\": {\"3\": 1, \"8\": 1, \"0\": 1, \"13\": 1, \"17\": 1, \"6\": 1, \"9\": 1, \"12\": 1}, \"3\": {\"15\": 1, \"... | {
"generator_name": "easy",
"index": 161,
"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\": 16, \"2\": 100, \"3\": 83, \"4\": 79, \"5\": 38, \"6\": 26, \"7\": 52, \"8\": 57, \"9\": 15, \"10\": 56, \"11\": 64, \"12\": 58, \"13\": 12, \"14\": 73, \"15\": 61, \"16\": 61}, \"1\": {\"0\": 16, \"1\": 0, \"2\": 96, \"3\": 12, \"4... | {
"generator_name": "easy",
"index": 38,
"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\": 45, \"2\": 25, \"3\": 68, \"4\": 73, \"5\": 97, \"6\": 21, \"7\": 10, \"8\": 35, \"9\": 45, \"10\": 88, \"11\": 66, \"12\": 24, \"13\": 38, \"14\": 41}, \"1\": {\"0\": 45, \"1\": 0, \"2\": 23, \"3\": 88, \"4\": 53, \"5\": 82, \"6\":... | {
"generator_name": "easy",
"index": 39,
"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\": [0, 2, 4], \"duration\": 30}, \"2\": {\"attendees\": [0, 1, 3], \"duration\": 60}, \"3\": {\"attendees\": [0, 4], \"duration\": 60}}, \"attendee_availability\": {\"0\": ... | {
"generator_name": "easy",
"index": 105,
"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\": [9], \"3\": [7, 10], \"4\": [], \"5\": [1], \"6\": [0, 8], \"7\": [3], \"8\": [6], \"9\": [2], \"10\": [3]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 189,
"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\"], \"1\": [\"0\", \"3\"], \"2\": [\"3\"], \"3\": [\"1\", \"2\", \"4\"], \"4\": [\"0\", \"3\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 133,
"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, \"12\": 1, \"2\": 1, \"10\": 1, \"1\": 1, \"8\": 1, \"7\": 1}, \"1\": {\"6\": 1, \"10\": 1, \"3\": 1, \"0\": 1, \"7\": 1}, \"2\": {\"6\": 1, \"0\": 1, \"8\": 1, \"4\": 1, \"11\": 1}, \"3\": {\"12\": 1, \"6\": 1, \"1\": 1, \"11\": 1, \"4\":... | {
"generator_name": "easy",
"index": 1,
"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\": [1, 14, 10, 3, 9, 15], \"1\": [10, 12, 7, 1, 6, 15], \"2\": [0, 1], \"3\": [12, 14, 2, 8, 6], \"4\": [11, 8, 6, 13, 9, 3], \"5\": [12, 1], \"6\": [13, 5], \"7\": [11, 6, 4]}}, \"g... | {
"generator_name": "easy",
"index": 218,
"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\": [1, 2, 3], \"duration\": 90}, \"2\": {\"attendees\": [0, 1, 3], \"duration\": 90}, \"3\": {\"attendees\": [0, 1, 3], \"duration\": 30}, \"4\": {\"attendees\": [0, 1, 2],... | {
"generator_name": "easy",
"index": 174,
"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\": 27, \"numbers\": {\"0\": 5, \"1\": 3, \"2\": 1, \"3\": 4, \"4\": 4, \"5\": 4, \"6\": 4, \"7\": 5, \"8\": 1}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 175,
"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, \"5\": 1, \"3\": 1, \"4\": 1, \"6\": 1, \"8\": 1, \"15\": 1, \"7\": 1, \"13\": 1}, \"1\": {\"5\": 1, \"18\": 1, \"16\": 1, \"8\": 1, \"12\": 1, \"9\": 1, \"17\": 1}, \"2\": {\"14\": 1, \"11\": 1, \"3\": 1, \"18\": 1, \"16\": 1, \"10\": 1,... | {
"generator_name": "easy",
"index": 131,
"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\": 4, \"2\": 2, \"3\": 4, \"4\": 3, \"5\": 4, \"6\": 2}}, \"ground_truth\": 7}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 30,
"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\": 3, \"1\": 4, \"2\": 4, \"3\": 3, \"4\": 5, \"5\": 5, \"6\": 1, \"7\": 5}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 42,
"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\", \"6\", \"7\"], \"1\": [\"0\", \"2\", \"3\", \"5\", \"6\"], \"2\": [\"0\", \"1\", \"4\", \"7\"], \"3\": [\"1\", \"5\", \"6\"], \"4\": [\"2\", \"7\"], \"5\": [\"0\", \"1\", \"3\", \"6\"], \"6\": [\"0\", \"1\", \"3\", \"5\"], \"7\"... | {
"generator_name": "easy",
"index": 144,
"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\"], \"1\": [\"0\", \"2\", \"3\"], \"2\": [\"1\", \"3\"], \"3\": [\"0\", \"1\", \"2\"]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 80,
"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, \"12\": 1, \"15\": 1, \"13\": 1, \"8\": 1, \"14\": 1, \"4\": 1, \"18\": 1}, \"1\": {\"11\": 1, \"16\": 1, \"5\": 1, \"12\": 1, \"17\": 1, \"2\": 1}, \"2\": {\"9\": 1, \"13\": 1, \"8\": 1, \"6\": 1, \"1\": 1, \"3\": 1}, \"3\": {\"11\": 1, ... | {
"generator_name": "easy",
"index": 26,
"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, \"13\": 1, \"2\": 1, \"10\": 1}, \"1\": {\"15\": 1, \"9\": 1, \"6\": 1, \"3\": 1, \"5\": 1}, \"2\": {\"0\": 1, \"15\": 1, \"7\": 1, \"8\": 1, \"6\": 1, \"3\": 1}, \"3\": {\"15\": 1, \"13\": 1, \"9\": 1, \"1\": 1, \"6\": 1, \"14\": 1, \"2\... | {
"generator_name": "easy",
"index": 52,
"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.