data_source stringclasses 10
values | prompt listlengths 1 1 | reward_model dict | extra_info dict |
|---|---|---|---|
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\": {\"0\": {\"weight\": 24, \"value\": 50}, \"1\": {\"weight\": 8, \"value\": 16}, \"3\": {\"weight\": 9, \"value\": 17}, \"5\": {\"weight\": 19, \"value\": 47}, \"6\": {\"weight\": 21, \"value\": 40}, \"8\": {\"weight\": 18, \"va... | {
"generator_name": "easy",
"index": 147,
"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\": 136, \"items\": {\"3\": {\"weight\": 15, \"value\": 31}, \"4\": {\"weight\": 11, \"value\": 22}, \"5\": {\"weight\": 15, \"value\": 30}, \"6\": {\"weight\": 21, \"value\": 44}, \"7\": {\"weight\": 22, \"value\": 46}, \"9\": {\"weight\": 25, \"... | {
"generator_name": "easy",
"index": 25,
"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\": 117, \"items\": {\"3\": {\"weight\": 7, \"value\": 16}, \"4\": {\"weight\": 6, \"value\": 12}, \"5\": {\"weight\": 18, \"value\": 36}, \"7\": {\"weight\": 9, \"value\": 16}, \"9\": {\"weight\": 6, \"value\": 11}, \"11\": {\"weight\": 12, \"val... | {
"generator_name": "easy",
"index": 48,
"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\": {\"2\": {\"weight\": 8, \"value\": 17}, \"3\": {\"weight\": 20, \"value\": 44}, \"9\": {\"weight\": 7, \"value\": 15}, \"10\": {\"weight\": 18, \"value\": 40}, \"12\": {\"weight\": 8, \"value\": 14}, \"13\": {\"weight\": 20, \"... | {
"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\": [1, 2], \"duration\": 60}, \"2\": {\"attendees\": [0, 2], \"duration\": 60}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 30}, \"4\": {\"attendees\": [1, 2], \"durati... | {
"generator_name": "easy",
"index": 17,
"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, \"4\": 1, \"10\": 1, \"15\": 1, \"7\": 1, \"18\": 1, \"12\": 1, \"14\": 1, \"6\": 1, \"3\": 1, \"19\": 1, \"13\": 1, \"8\": 1}, \"1\": {\"5\": 1, \"12\": 1, \"19\": 1, \"13\": 1, \"8\": 1, \"17\": 1, \"16\": 1}, \"2\": {\"9\": 1, \"8\": 1... | {
"generator_name": "easy",
"index": 211,
"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, 8], \"1\": [3, 8], \"2\": [5, 9], \"3\": [9, 1], \"4\": [8], \"5\": [2, 6, 8], \"6\": [5, 0], \"7\": [8], \"8\": [5, 0, 1, 4, 7], \"9\": [2, 3]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 155,
"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\": 82, \"2\": 83, \"3\": 38, \"4\": 17, \"5\": 84, \"6\": 50, \"7\": 98, \"8\": 70, \"9\": 60, \"10\": 29}, \"1\": {\"0\": 82, \"1\": 0, \"2\": 21, \"3\": 76, \"4\": 13, \"5\": 81, \"6\": 63, \"7\": 100, \"8\": 72, \"9\": 35, \"10\": 6... | {
"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\": 25, \"numbers\": {\"0\": 2, \"1\": 3, \"2\": 3, \"3\": 3, \"4\": 1, \"5\": 5, \"6\": 5, \"7\": 4, \"8\": 3}}, \"ground_truth\": 7}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 101,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 153, \"items\": {\"2\": {\"weight\": 5, \"value\": 11}, \"3\": {\"weight\": 16, \"value\": 38}, \"7\": {\"weight\": 11, \"value\": 25}, \"8\": {\"weight\": 23, \"value\": 53}, \"10\": {\"weight\": 18, \"value\": 44}, \"12\": {\"weight\": 16, \... | {
"generator_name": "easy",
"index": 23,
"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\": [3, 10, 11, 0, 1, 6], \"1\": [11], \"2\": [2], \"3\": [5, 2, 3, 8], \"4\": [10, 2, 0], \"5\": [4], \"6\": [0, 7, 9]}}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 125,
"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\": {\"30\": 1, \"3\": 1, \"2\": 10, \"4\": 8, \"5\": 9, \"6\": 9, \"7\": 10, \"8\": 9, \"11\": 9, \"12\": 9, \"13\": 10, \"18\": 6, \"17\": 5}, \"1\": {\"4\": 1, \"13\": 2, \"15\": 10, \"23\": 9, \"26\": 9, \"39\": 9, \"40\": 9, \"33\": 10}, \"2\": {\"1... | {
"generator_name": "easy",
"index": 215,
"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\": [0, 9], \"1\": [2, 4, 0, 3], \"2\": [8, 2, 7], \"3\": [8, 1], \"4\": [4, 2, 5, 6]}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 58,
"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\": {\"0\": {\"weight\": 22, \"value\": 41}, \"5\": {\"weight\": 19, \"value\": 45}, \"9\": {\"weight\": 16, \"value\": 31}, \"10\": {\"weight\": 8, \"value\": 18}, \"12\": {\"weight\": 5, \"value\": 11}, \"13\": {\"weight\": 13, \... | {
"generator_name": "easy",
"index": 196,
"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\": 3, \"1\": 4, \"2\": 4, \"3\": 4, \"4\": 5, \"5\": 5}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 107,
"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, \"2\": 1, \"5\": 1, \"6\": 1, \"16\": 1}, \"1\": {\"0\": 1, \"3\": 1, \"10\": 1, \"8\": 1, \"9\": 1, \"4\": 1, \"13\": 1, \"15\": 1}, \"2\": {\"0\": 1, \"10\": 1, \"8\": 1, \"5\": 1, \"9\": 1, \"4\": 1, \"6\": 1, \"12\": 1, \"15\": 1}, \"3... | {
"generator_name": "easy",
"index": 0,
"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, 17, 1, 8, 10, 13], \"1\": [16, 9, 0, 4, 7], \"2\": [10, 8, 4, 5], \"3\": [13, 5, 4, 11], \"4\": [9, 10, 1, 2, 3, 14], \"5\": [3, 0, 2, 7, 8, 11, 12], \"6\": [17, 7, 9, 14], \"7\": [6, 14, 1, 5, 12, 15, 16], \"8\": [2, 15, 0, 5, 14], \"9\": [1, 4,... | {
"generator_name": "easy",
"index": 14,
"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\": [0, 18, 4, 16], \"1\": [2, 13, 7, 4, 19, 14, 0], \"2\": [7, 3, 8, 2, 12, 4, 13, 10, 1], \"3\": [13, 18], \"4\": [9, 10, 16, 15], \"5\": [13, 9, 18, 6, 17, 19, 5], ... | {
"generator_name": "easy",
"index": 207,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [9, 6, 1, 2, 3, 12], \"1\": [10, 7, 0, 3, 9, 14], \"2\": [5, 12, 0, 4, 10, 14], \"3\": [11, 4, 0, 1, 7, 9, 12], \"4\": [3, 5, 2, 7], \"5\": [4, 2, 10], \"6\": [0, 14, 11], \"7\": [1, 11, 3, 4, 10], \"8\": [14, 13, 12], \"9\": [12, 0, 1, 3, 13], \"10\... | {
"generator_name": "easy",
"index": 109,
"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\": 37, \"3\": 71, \"4\": 13, \"5\": 36, \"6\": 58, \"7\": 97, \"8\": 99, \"9\": 24, \"10\": 93, \"11\": 40, \"12\": 65, \"13\": 73, \"14\": 96, \"15\": 12, \"16\": 73, \"17\": 88, \"18\": 83}, \"1\": {\"0\": 92, \"1\": 0, \"... | {
"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\": [4, 13, 8, 17], \"1\": [9, 15, 4, 8, 13], \"2\": [6, 7, 8, 9, 12], \"3\": [14, 12, 5, 11], \"4\": [17, 0, 1, 7, 10], \"5\": [15, 14, 3, 6, 13], \"6\": [2, 9, 5, 7, 8, 10, 13, 14, 16], \"7\": [10, 2, 4, 6, 12, 13], \"8\": [16, 11, 0, 1, 2, 6], \"9\": ... | {
"generator_name": "easy",
"index": 79,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSetCover | [
{
"content": "'Introduction': 'You are a great expert solving set-cover question. You should propose a solution to this question.', 'Task description': 'Given a universal set U and a collection of subsets S, the Set Cover Problem aims to find the smallest possible sub-collection of S whose union equals U. In o... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"U\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16], \"S\": {\"0\": [0, 5, 2, 1, 11, 7, 4], \"1\": [10], \"2\": [3, 0, 15, 7, 13], \"3\": [6, 12, 8, 16], \"4\": [2], \"5\": [9], \"6\": [9, 14], \"7\": [12, 5, 15, 2, 0], \"8\": [16, 3, 0, 2]}},... | {
"generator_name": "easy",
"index": 106,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [4], \"1\": [3], \"2\": [10], \"3\": [1, 5, 10], \"4\": [0], \"5\": [3], \"6\": [8], \"7\": [], \"8\": [6], \"9\": [11], \"10\": [2, 3], \"11\": [9]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 99,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [12, 3, 6], \"1\": [5, 13, 8], \"2\": [6, 4, 5], \"3\": [0, 10, 13], \"4\": [2, 12], \"5\": [7, 1, 2, 6, 13], \"6\": [13, 2, 0, 5, 12], \"7\": [8, 5, 10, 15], \"8\": [9, 7, 1, 10, 14], \"9\": [14, 8, 12], \"10\": [3, 11, 7, 8], \"11\": [10, 15], \"12... | {
"generator_name": "easy",
"index": 91,
"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\": 13, \"numbers\": {\"0\": 5, \"1\": 3, \"2\": 4, \"3\": 4, \"4\": 3, \"5\": 1, \"6\": 1}}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 170,
"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\"], \"1\": [\"0\", \"2\", \"3\", \"4\"], \"2\": [\"0\", \"1\"], \"3\": [\"0\", \"1\", \"4\"], \"4\": [\"0\", \"1\", \"3\"]}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 105,
"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\": 212, \"items\": {\"1\": {\"weight\": 21, \"value\": 51}, \"2\": {\"weight\": 15, \"value\": 34}, \"7\": {\"weight\": 11, \"value\": 21}, \"10\": {\"weight\": 24, \"value\": 56}, \"12\": {\"weight\": 11, \"value\": 24}, \"13\": {\"weight\": 7, ... | {
"generator_name": "easy",
"index": 152,
"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, \"1\": 1, \"10\": 1, \"3\": 1, \"9\": 1}, \"1\": {\"0\": 1, \"11\": 1, \"5\": 1, \"7\": 1}, \"2\": {\"5\": 1, \"3\": 1, \"9\": 1}, \"3\": {\"0\": 1, \"2\": 1}, \"4\": {\"0\": 1, \"11\": 1, \"5\": 1, \"9\": 1, \"10\": 1}, \"5\": {\"4\": 1, ... | {
"generator_name": "easy",
"index": 11,
"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, 2, 7, 9, 14], \"1\": [16, 11, 3, 4, 5, 9], \"2\": [0, 14, 3, 5, 7, 10, 11, 16], \"3\": [12, 6, 1, 2, 8], \"4\": [13, 7, 1, 5, 8], \"5\": [11, 15, 1, 2, 4, 7, 8, 12], \"6\": [3, 10, 11, 13, 15, 16], \"7\": [4, 12, 0, 2, 5, 11, 15], \"8\": [14, 9,... | {
"generator_name": "easy",
"index": 194,
"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\"], \"1\": [\"0\", \"2\", \"4\", \"5\"], \"2\": [\"0\", \"1\", \"4\", \"5\"], \"3\": [\"4\", \"5\"], \"4\": [\"0\", \"1\", \"2\", \"3\"], \"5\": [\"1\", \"2\", \"3\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 27,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 14, \"numbers\": {\"0\": 2, \"1\": 4, \"2\": 4, \"3\": 4, \"4\": 2, \"5\": 2, \"6\": 1, \"7\": 4}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 89,
"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\": 3, \"1\": 3, \"2\": 4, \"3\": 3, \"4\": 3, \"5\": 3, \"6\": 2, \"7\": 1}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 105,
"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\": [16, 19, 12, 3], \"1\": [4, 6, 10, 16, 8, 1, 5], \"2\": [0, 11, 5, 15, 2, 12], \"3\": [4, 12, 9], \"4\": [14, 5, 18, 13], \"5\": [12, 1, 8, 6, 16, 9, 7], \"6\": [7... | {
"generator_name": "easy",
"index": 113,
"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, 14, 6], \"1\": [14, 5, 2, 3], \"2\": [7, 9, 1, 11, 13], \"3\": [12, 11, 1, 9], \"4\": [6, 0, 5], \"5\": [1, 13, 4], \"6\": [12, 4, 0, 7], \"7\": [8, 2, 6, 10], \"8\": [13, 7, 9], \"9\": [2, 10, 3, 8, 13, 14], \"10\": [9, 11, 7], \"11\": [10, 3, 2... | {
"generator_name": "easy",
"index": 43,
"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, 3, 7, 9], \"1\": [11, 2, 12], \"2\": [1, 7], \"3\": [10, 9, 0, 5, 6], \"4\": [9, 6, 8, 15], \"5\": [14, 11, 3], \"6\": [4, 13, 3, 15], \"7\": [2, 12, 0, 14], \"8\": [15, 14, 4, 9, 12], \"9\": [3, 4, 0, 8], \"10\": [3, 12, 15], \"11\": [5, 1,... | {
"generator_name": "easy",
"index": 189,
"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\": [9, 0], \"2\": [3], \"3\": [2], \"4\": [8], \"5\": [10, 6], \"6\": [5], \"7\": [], \"8\": [4], \"9\": [10, 1], \"10\": [5, 9]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 8,
"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\": 214, \"items\": {\"1\": {\"weight\": 25, \"value\": 54}, \"5\": {\"weight\": 9, \"value\": 22}, \"9\": {\"weight\": 25, \"value\": 57}, \"12\": {\"weight\": 18, \"value\": 40}, \"14\": {\"weight\": 24, \"value\": 59}, \"17\": {\"weight\": 19, ... | {
"generator_name": "easy",
"index": 81,
"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\": {\"29\": 1, \"1\": 8, \"3\": 9, \"5\": 10, \"7\": 8, \"8\": 10, \"11\": 8, \"12\": 10, \"13\": 8, \"24\": 3, \"10\": 1, \"38\": 4, \"20\": 1, \"18\": 2, \"21\": 5}, \"1\": {\"32\": 2, \"0\": 8, \"3\": 10, \"4\": 8, \"5\": 9, \"7\": 8, \"8\": 8, \"10\... | {
"generator_name": "easy",
"index": 49,
"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, \"9\": 1, \"12\": 1, \"14\": 1, \"8\": 1, \"7\": 1, \"18\": 1}, \"1\": {\"9\": 1, \"5\": 1, \"11\": 1, \"8\": 1, \"16\": 1}, \"2\": {\"10\": 1, \"15\": 1, \"6\": 1, \"5\": 1, \"11\": 1, \"7\": 1, \"8\": 1, \"16\": 1, \"18\": 1}, \"3\": {\"... | {
"generator_name": "easy",
"index": 110,
"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, 7], \"1\": [8], \"2\": [0], \"3\": [4], \"4\": [3, 6, 8], \"5\": [], \"6\": [4], \"7\": [0], \"8\": [1, 4], \"9\": []}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 191,
"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\": [0, 1, 2], \"duration\": 60}, \"2\": {\"attendees\": [0, 2], \"duration\": 60}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 60}, \"4\": {\"attendees\": [1, 2], \"dur... | {
"generator_name": "easy",
"index": 208,
"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\": 30}, \"1\": {\"attendees\": [0, 2, 3], \"duration\": 60}, \"2\": {\"attendees\": [1, 2, 3], \"duration\": 90}, \"3\": {\"attendees\": [1, 2, 3], \"duration\": 30}, \"4\": {\"attendees\": [2, 3], \"... | {
"generator_name": "easy",
"index": 135,
"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, \"7\": 1, \"17\": 1, \"19\": 1, \"3\": 1}, \"1\": {\"2\": 1, \"13\": 1, \"12\": 1, \"18\": 1, \"14\": 1, \"7\": 1, \"11\": 1, \"8\": 1, \"9\": 1, \"10\": 1}, \"2\": {\"15\": 1, \"13\": 1, \"1\": 1, \"0\": 1, \"11\": 1, \"4\": 1, \"16\": 1,... | {
"generator_name": "easy",
"index": 49,
"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, \"10\": 1, \"6\": 1, \"2\": 1, \"4\": 1, \"7\": 1, \"11\": 1, \"12\": 1}, \"1\": {\"10\": 1, \"11\": 1, \"6\": 1}, \"2\": {\"10\": 1, \"0\": 1}, \"3\": {\"10\": 1, \"5\": 1, \"6\": 1, \"4\": 1, \"9\": 1}, \"4\": {\"8\": 1, \"0\": 1, \"3\":... | {
"generator_name": "easy",
"index": 145,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 16, \"numbers\": {\"0\": 1, \"1\": 4, \"2\": 1, \"3\": 4, \"4\": 1, \"5\": 5, \"6\": 3, \"7\": 5, \"8\": 4}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 182,
"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\": 73, \"3\": 59, \"4\": 67, \"5\": 68, \"6\": 94, \"7\": 63, \"8\": 97, \"9\": 78, \"10\": 89, \"11\": 68, \"12\": 75, \"13\": 60, \"14\": 96, \"15\": 65, \"16\": 60, \"17\": 69, \"18\": 39}, \"1\": {\"0\": 16, \"1\": 0, \"... | {
"generator_name": "easy",
"index": 56,
"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\": [4, 3], \"2\": [], \"3\": [1], \"4\": [5, 1, 6], \"5\": [4], \"6\": [4], \"7\": []}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 40,
"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, 4, 13, 15, 17], \"1\": [5, 11, 2, 4], \"2\": [0, 14, 1, 16, 17], \"3\": [4, 13, 7, 10, 14, 17], \"4\": [0, 3, 1, 6, 7, 14, 15], \"5\": [17, 1, 7, 8, 10, 11, 16], \"6\": [7, 16, 4, 8, 11, 13, 17], \"7\": [8, 6, 3, 4, 5, 14], \"8\": [18, 7, 5, 6, 1... | {
"generator_name": "easy",
"index": 208,
"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\": [18, 10], \"1\": [10, 8, 3], \"2\": [4, 5, 8, 9, 11, 12, 15], \"3\": [9, 4, 1, 17], \"4\": [3, 2, 5, 7, 8, 11, 16, 18], \"5\": [2, 14, 4, 7, 8, 11, 17], \"6\": [15, 13, 8, 18], \"7\": [8, 12, 4, 5, 18], \"8\": [1, 7, 2, 4, 5, 6, 10, 13, 14, 17], \"9\... | {
"generator_name": "easy",
"index": 217,
"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, 7], \"1\": [0, 6], \"2\": [9, 4], \"3\": [0], \"4\": [2], \"5\": [], \"6\": [1], \"7\": [0], \"8\": [9], \"9\": [2, 8]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 206,
"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\", \"6\"], \"1\": [\"0\", \"4\", \"5\"], \"2\": [\"4\"], \"3\": [\"4\", \"6\", \"7\"], \"4\": [\"1\", \"2\", \"3\", \"5\"], \"5\": [\"1\", \"4\"], \"6\": [\"0\", \"3\"], \"7\": [\"3\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 20,
"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}, \"1\": {\"8\": 1, \"11\": 1}, \"2\": {\"12\": 1, \"4\": 1, \"8\": 1, \"11\": 1, \"9\": 1}, \"3\": {\"12\": 1, \"13\": 1, \"9\": 1}, \"4\": {\"12\": 1, \"11\": 1, \"13\": 1, \"7\": 1, \"2\": 1, \"5\": 1}, \"5\": {\"12\": 1, \"4\": 1, \"8\"... | {
"generator_name": "easy",
"index": 150,
"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\": 153, \"items\": {\"3\": {\"weight\": 22, \"value\": 45}, \"4\": {\"weight\": 6, \"value\": 14}, \"6\": {\"weight\": 25, \"value\": 60}, \"7\": {\"weight\": 20, \"value\": 45}, \"8\": {\"weight\": 8, \"value\": 14}, \"9\": {\"weight\": 6, \"val... | {
"generator_name": "easy",
"index": 121,
"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\": [1, 2], \"duration\": 30}, \"2\": {\"attendees\": [0, 2], \"duration\": 30}, \"3\": {\"attendees\": [1, 2], \"duration\": 30}, \"4\": {\"attendees\": [0, 2], \"durati... | {
"generator_name": "easy",
"index": 211,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 14, \"numbers\": {\"0\": 3, \"1\": 3, \"2\": 4, \"3\": 1, \"4\": 1, \"5\": 3, \"6\": 5}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 33,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSetCover | [
{
"content": "'Introduction': 'You are a great expert solving set-cover question. You should propose a solution to this question.', 'Task description': 'Given a universal set U and a collection of subsets S, the Set Cover Problem aims to find the smallest possible sub-collection of S whose union equals U. In o... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"U\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16], \"S\": {\"0\": [8, 7, 4], \"1\": [11, 9, 10, 13, 6, 2], \"2\": [12, 3, 5], \"3\": [14, 8, 10, 6], \"4\": [16, 0, 1, 15]}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 22,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [15, 1, 4, 5, 11, 14, 17], \"1\": [0, 4, 2, 6], \"2\": [13, 15, 1, 18], \"3\": [6, 18, 8], \"4\": [12, 1, 0, 8, 13, 17], \"5\": [11, 16, 0, 7, 9, 13, 14], \"6\": [16, 3, 1, 10, 13, 17, 18], \"7\": [18, 17, 5, 13, 14], \"8\": [9, 13, 3, 4, 11, 15], \"... | {
"generator_name": "easy",
"index": 36,
"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\": 75, \"2\": 49, \"3\": 18, \"4\": 27, \"5\": 44, \"6\": 46, \"7\": 70, \"8\": 33, \"9\": 96, \"10\": 72, \"11\": 52, \"12\": 22}, \"1\": {\"0\": 75, \"1\": 0, \"2\": 13, \"3\": 90, \"4\": 70, \"5\": 87, \"6\": 10, \"7\": 89, \"8\": 5... | {
"generator_name": "easy",
"index": 31,
"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\": [2, 3], \"duration\": 60}, \"2\": {\"attendees\": [1, 2, 3], \"duration\": 60}, \"3\": {\"attendees\": [0, 3], \"duration\": 30}, \"4\": {\"attendees\": [0, 1, 3], \"dur... | {
"generator_name": "easy",
"index": 93,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 141, \"items\": {\"3\": {\"weight\": 19, \"value\": 34}, \"4\": {\"weight\": 7, \"value\": 14}, \"7\": {\"weight\": 17, \"value\": 35}, \"9\": {\"weight\": 7, \"value\": 15}, \"10\": {\"weight\": 20, \"value\": 49}, \"12\": {\"weight\": 8, \"v... | {
"generator_name": "easy",
"index": 115,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [15, 5, 3, 8, 16], \"1\": [4, 5, 6, 13, 18], \"2\": [17, 19, 5, 7, 8, 16], \"3\": [4, 8, 0, 6, 11], \"4\": [1, 3, 18], \"5\": [0, 1, 2, 18], \"6\": [10, 14, 1, 3, 8, 12, 13, 19], \"7\": [9, 15, 2, 11, 18, 19], \"8\": [3, 17, 0, 2, 6, 15, 18], \"9\": ... | {
"generator_name": "easy",
"index": 34,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [13, 17, 1, 2, 3, 15], \"1\": [7, 11, 0, 5, 16], \"2\": [16, 5, 0, 9, 14], \"3\": [14, 7, 0, 6, 16, 17, 18], \"4\": [18, 6, 11, 13], \"5\": [2, 14, 1, 16], \"6\": [4, 12, 3, 9, 11, 13, 15, 18], \"7\": [1, 3, 11], \"8\": [10, 16, 13, 14], \"9\": [15, ... | {
"generator_name": "easy",
"index": 196,
"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\": 80, \"items\": {\"0\": {\"weight\": 6, \"value\": 14}, \"5\": {\"weight\": 20, \"value\": 48}, \"6\": {\"weight\": 9, \"value\": 16}, \"7\": {\"weight\": 6, \"value\": 12}, \"10\": {\"weight\": 6, \"value\": 12}, \"11\": {\"weight\": 9, \"valu... | {
"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\": 22, \"numbers\": {\"0\": 4, \"1\": 4, \"2\": 4, \"3\": 5, \"4\": 2, \"5\": 3, \"6\": 4, \"7\": 1}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 4,
"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\": 9, \"6\": 9, \"7\": 8, \"9\": 9, \"10\": 10, \"12\": 8, \"13\": 9, \"8\": 1, \"40\": 5, \"24\": 6}, \"1\": {\"34\": 1, \"0\": 10, \"2\": 9, \"3\": 8, \"5\": 8, \"6\": 8, \"7\": 9, \"9\": 10, \"10\": 9, \"12\":... | {
"generator_name": "easy",
"index": 190,
"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\": [3, 8, 2, 4, 11], \"1\": [3], \"2\": [4, 7, 9, 5, 1], \"3\": [0, 8], \"4\": [9, 4], \"5\": [6], \"6\": [4, 6, 7, 9], \"7\": [5, 3, 10, 8], \"8\": [9, 4], \"9\": [7, 10, 2]}}, \"ground_truth\": 5}... | {
"generator_name": "easy",
"index": 73,
"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\", \"5\"], \"1\": [\"0\", \"3\", \"5\", \"7\"], \"2\": [\"0\", \"5\", \"6\"], \"3\": [\"1\", \"5\", \"6\", \"7\"], \"4\": [\"0\", \"5\", \"6\"], \"5\": [\"0\", \"1\", \"2\", \"3\", \"4\", \"6\"], \"6\": [\"2\", \"3\", \"4\", \"5\",... | {
"generator_name": "easy",
"index": 2,
"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\": 20, \"2\": 88, \"3\": 11, \"4\": 36, \"5\": 59, \"6\": 68, \"7\": 56, \"8\": 56, \"9\": 82, \"10\": 61, \"11\": 40, \"12\": 94, \"13\": 62, \"14\": 30, \"15\": 31, \"16\": 33, \"17\": 41, \"18\": 87, \"19\": 100}, \"1\": {\"0\": 20,... | {
"generator_name": "easy",
"index": 46,
"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\", \"4\"], \"1\": [\"0\", \"2\", \"3\"], \"2\": [\"1\", \"3\", \"4\"], \"3\": [\"0\", \"1\", \"2\"], \"4\": [\"0\", \"2\"]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 119,
"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\": [8], \"4\": [5, 7], \"5\": [4], \"6\": [], \"7\": [4], \"8\": [3]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 33,
"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\": [0, 1, 2], \"duration\": 90}, \"2\": {\"attendees\": [0, 1], \"duration\": 90}, \"3\": {\"attendees\": [0, 1], \"duration\": 90}}, \"attendee_availability\": {\"0\": [[5... | {
"generator_name": "easy",
"index": 6,
"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\": [1, 2], \"duration\": 60}, \"2\": {\"attendees\": [0, 2], \"duration\": 90}, \"3\": {\"attendees\": [0, 2], \"duration\": 30}, \"4\": {\"attendees\": [0, 1], \"duration\... | {
"generator_name": "easy",
"index": 167,
"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\": [15, 7, 1, 9, 0, 2, 17], \"1\": [16, 9, 18, 7, 5, 2], \"2\": [2, 13, 10, 3, 14], \"3\": [15, 6, 1, 11, 9], \"4\": [8, 4, 9, 6, 15, 2], \"5\": [6, 0, 16, 1, 12], \"6\":... | {
"generator_name": "easy",
"index": 66,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [2, 5], \"1\": [], \"2\": [0], \"3\": [], \"4\": [], \"5\": [0], \"6\": [], \"7\": []}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 73,
"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\": {\"31\": 2, \"3\": 10, \"4\": 10, \"5\": 9, \"7\": 10, \"8\": 9, \"9\": 10, \"10\": 8, \"12\": 10, \"13\": 10, \"33\": 3, \"38\": 4, \"40\": 1}, \"1\": {\"3\": 9, \"4\": 10, \"5\": 8, \"7\": 8, \"8\": 9, \"9\": 10, \"10\": 9, \"12\": 10, \"13\": 9, \... | {
"generator_name": "easy",
"index": 224,
"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, 6, 4, 10, 17], \"1\": [15, 7, 8, 10, 12], \"2\": [9, 3, 12, 13, 17], \"3\": [5, 2, 10, 14], \"4\": [13, 12, 0, 17], \"5\": [10, 3, 9, 11, 14], \"6\": [0, 11, 8, 17], \"7\": [1, 17], \"8\": [14, 0, 1, 6], \"9\": [2, 16, 5], \"10\": [12, 5, 0, 1, 3... | {
"generator_name": "easy",
"index": 59,
"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\": 19, \"2\": 60, \"3\": 19, \"4\": 42, \"5\": 37, \"6\": 67, \"7\": 29, \"8\": 64, \"9\": 23, \"10\": 39, \"11\": 87, \"12\": 65}, \"1\": {\"0\": 19, \"1\": 0, \"2\": 96, \"3\": 54, \"4\": 72, \"5\": 14, \"6\": 70, \"7\": 63, \"8\": 1... | {
"generator_name": "easy",
"index": 82,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 20, \"numbers\": {\"0\": 1, \"1\": 5, \"2\": 5, \"3\": 5, \"4\": 5, \"5\": 4, \"6\": 3}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 181,
"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], \"1\": [2], \"2\": [1, 4], \"3\": [0], \"4\": [2], \"5\": [7], \"6\": [0], \"7\": [5], \"8\": [], \"9\": []}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 112,
"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\": 75, \"2\": 27, \"3\": 20, \"4\": 54, \"5\": 43, \"6\": 72, \"7\": 62, \"8\": 57, \"9\": 51, \"10\": 34, \"11\": 30, \"12\": 71, \"13\": 27, \"14\": 55, \"15\": 97}, \"1\": {\"0\": 75, \"1\": 0, \"2\": 67, \"3\": 87, \"4\": 70, \"5\"... | {
"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\": {\"8\": 1, \"10\": 1, \"7\": 1, \"1\": 1, \"4\": 1, \"15\": 1}, \"1\": {\"7\": 1, \"4\": 1, \"9\": 1, \"14\": 1, \"15\": 1, \"11\": 1, \"0\": 1}, \"2\": {\"8\": 1, \"14\": 1, \"12\": 1}, \"3\": {\"8\": 1, \"10\": 1, \"7\": 1, \"4\": 1, \"9\": 1, \"5\... | {
"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\": 23, \"numbers\": {\"0\": 2, \"1\": 4, \"2\": 4, \"3\": 3, \"4\": 5, \"5\": 5}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 149,
"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, \"10\": 1, \"13\": 1, \"9\": 1, \"14\": 1, \"1\": 1, \"5\": 1, \"7\": 1}, \"1\": {\"0\": 1, \"10\": 1, \"11\": 1, \"9\": 1}, \"2\": {\"15\": 1, \"13\": 1, \"8\": 1, \"3\": 1, \"6\": 1, \"7\": 1}, \"3\": {\"15\": 1, \"2\": 1, \"10\": 1, \"1... | {
"generator_name": "easy",
"index": 44,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSetCover | [
{
"content": "'Introduction': 'You are a great expert solving set-cover question. You should propose a solution to this question.', 'Task description': 'Given a universal set U and a collection of subsets S, the Set Cover Problem aims to find the smallest possible sub-collection of S whose union equals U. In o... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"U\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16], \"S\": {\"0\": [1, 7, 11, 16, 8], \"1\": [5, 7, 2], \"2\": [10, 6, 7, 15], \"3\": [12, 6], \"4\": [5, 15, 0], \"5\": [10, 0, 9, 7, 4], \"6\": [6, 3, 13, 9, 5, 15, 14]}}, \"ground_truth\": 5}... | {
"generator_name": "easy",
"index": 61,
"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, 2, 11], \"1\": [4, 10, 7, 8, 14], \"2\": [0, 7], \"3\": [16, 15, 4], \"4\": [13, 1, 3, 6, 8, 9, 14], \"5\": [14, 13, 8, 9, 16], \"6\": [12, 10, 4, 15], \"7\": [2, 16, 1, 14], \"8\": [9, 0, 1, 4, 5, 12, 14], \"9\": [11, 8, 4, 5, 15], \"10\": [1, 6... | {
"generator_name": "easy",
"index": 50,
"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, 4], \"duration\": 30}, \"1\": {\"attendees\": [0, 2], \"duration\": 60}, \"2\": {\"attendees\": [0, 3, 4], \"duration\": 30}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 30}}, \"attendee_availability\": {\"0\": ... | {
"generator_name": "easy",
"index": 185,
"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\": [4], \"2\": [], \"3\": [5], \"4\": [1], \"5\": [3], \"6\": [], \"7\": [], \"8\": [], \"9\": []}, \"ground_truth\": 2}",
"style": "rule"
} | {
"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, 2], \"duration\": 90}, \"1\": {\"attendees\": [0, 2, 4], \"duration\": 60}, \"2\": {\"attendees\": [1, 4], \"duration\": 30}, \"3\": {\"attendees\": [2, 4], \"duration\": 30}, \"4\": {\"attendees\": [2, 3, 4], \"dur... | {
"generator_name": "easy",
"index": 98,
"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\", \"2\", \"4\", \"6\"], \"2\": [\"0\", \"1\", \"4\", \"6\"], \"3\": [\"0\", \"4\", \"6\", \"7\"], \"4\": [\"0\", \"1\", \"2\", \"3\"], \"5\": [\"0\", \"7\"], \"6\": [\"0\", \"1\", \"2\",... | {
"generator_name": "easy",
"index": 204,
"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], \"2\": [4, 1], \"3\": [1], \"4\": [9, 2], \"5\": [], \"6\": [], \"7\": [9, 8], \"8\": [7], \"9\": [4, 7]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 214,
"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\"], \"2\": [\"0\", \"3\"], \"3\": [\"2\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 150,
"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\": 34, \"2\": 66, \"3\": 64, \"4\": 25, \"5\": 92, \"6\": 66, \"7\": 71, \"8\": 85, \"9\": 62, \"10\": 27, \"11\": 52, \"12\": 10, \"13\": 49, \"14\": 97, \"15\": 97, \"16\": 19}, \"1\": {\"0\": 34, \"1\": 0, \"2\": 39, \"3\": 82, \"4\... | {
"generator_name": "easy",
"index": 15,
"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\": [2, 12], \"1\": [2, 5, 11, 0], \"2\": [14], \"3\": [7], \"4\": [8, 4, 9, 12, 3], \"5\": [11, 7], \"6\": [6, 4, 12, 8, 5, 9], \"7\": [13, 12, 15, 4, 3], \"8\": [2, 10, 13, 9], \"9\... | {
"generator_name": "easy",
"index": 47,
"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\": {\"30\": 2, \"1\": 1, \"10\": 3, \"2\": 9, \"3\": 9, \"4\": 9, \"5\": 9, \"7\": 8, \"8\": 9, \"9\": 10, \"11\": 8, \"12\": 9, \"13\": 2}, \"1\": {\"0\": 1, \"4\": 2, \"5\": 2, \"8\": 3, \"9\": 2, \"11\": 3, \"14\": 10, \"22\": 10, \"20\": 9, \"36\": ... | {
"generator_name": "easy",
"index": 82,
"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\": 30}, \"1\": {\"attendees\": [1, 2, 4], \"duration\": 30}, \"2\": {\"attendees\": [2, 3, 4], \"duration\": 30}, \"3\": {\"attendees\": [1, 2, 4], \"duration\": 60}}, \"attendee_availability\": {\... | {
"generator_name": "easy",
"index": 77,
"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\"], \"3\": []}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 140,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 23, \"numbers\": {\"0\": 2, \"1\": 4, \"2\": 2, \"3\": 4, \"4\": 3, \"5\": 2, \"6\": 3, \"7\": 3, \"8\": 3}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 58,
"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\": {\"13\": 3, \"1\": 10, \"2\": 8, \"3\": 9, \"4\": 8, \"5\": 8, \"6\": 8, \"7\": 8, \"9\": 9, \"10\": 8, \"14\": 1, \"26\": 1}, \"1\": {\"13\": 1, \"12\": 3, \"0\": 10, \"2\": 9, \"3\": 9, \"4\": 9, \"5\": 10, \"6\": 8, \"7\": 10, \"9\": 10, \"11\": 9... | {
"generator_name": "easy",
"index": 220,
"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\": 78, \"2\": 32, \"3\": 49, \"4\": 86, \"5\": 95, \"6\": 82, \"7\": 38, \"8\": 61, \"9\": 28, \"10\": 70, \"11\": 39, \"12\": 45, \"13\": 79, \"14\": 81, \"15\": 90}, \"1\": {\"0\": 78, \"1\": 0, \"2\": 83, \"3\": 68, \"4\": 19, \"5\"... | {
"generator_name": "easy",
"index": 74,
"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, 8, 9], \"1\": [], \"2\": [0, 5], \"3\": [5], \"4\": [6], \"5\": [2, 3, 7], \"6\": [4], \"7\": [5], \"8\": [0], \"9\": [0]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 32,
"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.