data_source stringclasses 10
values | prompt listlengths 1 1 | reward_model dict | extra_info dict |
|---|---|---|---|
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], \"duration\": 60}, \"1\": {\"attendees\": [0, 4], \"duration\": 30}, \"2\": {\"attendees\": [2, 3], \"duration\": 60}, \"3\": {\"attendees\": [0, 1, 4], \"duration\": 30}}, \"attendee_availability\": {\"0\": [[5... | {
"generator_name": "easy",
"index": 75,
"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\": 163, \"items\": {\"4\": {\"weight\": 6, \"value\": 13}, \"6\": {\"weight\": 17, \"value\": 35}, \"10\": {\"weight\": 23, \"value\": 48}, \"13\": {\"weight\": 6, \"value\": 12}, \"14\": {\"weight\": 14, \"value\": 34}, \"17\": {\"weight\": 6, \... | {
"generator_name": "easy",
"index": 223,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 82, \"2\": 11, \"3\": 99, \"4\": 97, \"5\": 31, \"6\": 27, \"7\": 78, \"8\": 16, \"9\": 78}, \"1\": {\"0\": 82, \"1\": 0, \"2\": 49, \"3\": 48, \"4\": 94, \"5\": 71, \"6\": 86, \"7\": 19, \"8\": 44, \"9\": 91}, \"2\": {\"0\": 11, \"... | {
"generator_name": "easy",
"index": 208,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"2\": 8, \"4\": 10, \"5\": 9, \"6\": 9, \"7\": 9, \"9\": 9, \"10\": 9, \"11\": 9, \"13\": 8, \"37\": 2, \"20\": 4}, \"1\": {\"4\": 2, \"5\": 3, \"6\": 1, \"24\": 9, \"16\": 9, \"19\": 10, \"29\": 9, \"40\": 9, \"30\": 9, \"7\": 3, \"33\": 3, \"35\"... | {
"generator_name": "easy",
"index": 18,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 19, \"numbers\": {\"0\": 3, \"1\": 1, \"2\": 4, \"3\": 1, \"4\": 1, \"5\": 5, \"6\": 4}}, \"ground_truth\": 7}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 74,
"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\": {\"1\": {\"weight\": 13, \"value\": 24}, \"2\": {\"weight\": 11, \"value\": 25}, \"3\": {\"weight\": 8, \"value\": 16}, \"7\": {\"weight\": 21, \"value\": 50}, \"9\": {\"weight\": 19, \"value\": 37}, \"12\": {\"weight\": 9, \"v... | {
"generator_name": "easy",
"index": 193,
"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\": [3, 4], \"duration\": 60}, \"1\": {\"attendees\": [0, 3, 4], \"duration\": 30}, \"2\": {\"attendees\": [1, 4], \"duration\": 30}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 60}, \"4\": {\"attendees\": [2, 3, 4], \"... | {
"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\": [1, 2], \"duration\": 60}, \"1\": {\"attendees\": [0, 2], \"duration\": 90}, \"2\": {\"attendees\": [0, 2, 3], \"duration\": 60}, \"3\": {\"attendees\": [0, 1], \"duration\": 60}}, \"attendee_availability\": {\"0\": [[5... | {
"generator_name": "easy",
"index": 44,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [1, 2], \"duration\": 30}, \"1\": {\"attendees\": [0, 1, 2], \"duration\": 90}, \"2\": {\"attendees\": [0, 1, 2], \"duration\": 60}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 90}}, \"attendee_availability\": {\"0\... | {
"generator_name": "easy",
"index": 62,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"22\": 1, \"8\": 3, \"6\": 2, \"2\": 10, \"3\": 8, \"4\": 8, \"5\": 9, \"7\": 10, \"10\": 9, \"11\": 9, \"12\": 10, \"13\": 8, \"34\": 4, \"32\": 6}, \"1\": {\"20\": 1, \"7\": 3, \"27\": 10, \"23\": 10, \"29\": 10, \"40\": 10, \"38\": 10, \"9\": 6,... | {
"generator_name": "easy",
"index": 120,
"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, 2, 1, 3, 6, 9, 13, 14], \"1\": [12, 7, 0, 3, 5, 6, 9, 14], \"2\": [0, 14, 4, 13], \"3\": [14, 9, 0, 1, 4, 6, 10], \"4\": [10, 0, 2, 3, 5, 12], \"5\": [8, 10, 1, 4, 12], \"6\": [7, 8, 0, 1, 3, 9, 13, 14], \"7\": [1, 6, 15], \"8\": [6, 5, 11], \"9\... | {
"generator_name": "easy",
"index": 80,
"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], \"duration\": 60}, \"2\": {\"attendees\": [0, 1, 2], \"duration\": 30}, \"3\": {\"attendees\": [0, 2], \"duration\": 30}}, \"attendee_availability\": {\"0\": [[5... | {
"generator_name": "easy",
"index": 159,
"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\"], \"2\": [\"1\", \"4\"], \"3\": [\"1\", \"4\"], \"4\": [\"1\", \"2\", \"3\"]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 156,
"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\": 4, \"1\": 2, \"2\": 1, \"3\": 4, \"4\": 4, \"5\": 3, \"6\": 2, \"7\": 5, \"8\": 5}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 72,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 12, \"2\": 73, \"3\": 58, \"4\": 49, \"5\": 23, \"6\": 81, \"7\": 60, \"8\": 14, \"9\": 31}, \"1\": {\"0\": 12, \"1\": 0, \"2\": 46, \"3\": 62, \"4\": 18, \"5\": 55, \"6\": 61, \"7\": 78, \"8\": 66, \"9\": 55}, \"2\": {\"0\": 73, \"... | {
"generator_name": "easy",
"index": 178,
"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\": 1, \"1\": 1, \"2\": 2, \"3\": 2, \"4\": 3, \"5\": 1, \"6\": 3, \"7\": 2, \"8\": 5, \"9\": 2}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 133,
"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\": 169, \"items\": {\"0\": {\"weight\": 6, \"value\": 13}, \"1\": {\"weight\": 25, \"value\": 46}, \"2\": {\"weight\": 12, \"value\": 28}, \"7\": {\"weight\": 5, \"value\": 9}, \"8\": {\"weight\": 16, \"value\": 33}, \"11\": {\"weight\": 21, \"va... | {
"generator_name": "easy",
"index": 103,
"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, 2, 1, 4, 6, 11], \"1\": [5, 10, 0, 3, 4, 7], \"2\": [0, 11, 12], \"3\": [11, 7, 1, 10, 12, 14], \"4\": [6, 9, 0, 1], \"5\": [14, 1, 8, 12], \"6\": [8, 4, 0], \"7\": [3, 8, 1], \"8\": [7, 6, 5, 9, 11, 12], \"9\": [4, 12, 8], \"10\": [13, 1, 3], \... | {
"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\": {\"2\": 1, \"11\": 1, \"4\": 1, \"12\": 1}, \"1\": {\"6\": 1, \"8\": 1, \"4\": 1, \"11\": 1, \"13\": 1}, \"2\": {\"6\": 1, \"0\": 1, \"10\": 1, \"5\": 1, \"13\": 1, \"4\": 1, \"11\": 1, \"12\": 1}, \"3\": {\"4\": 1, \"11\": 1, \"12\": 1}, \"4\": {\"0... | {
"generator_name": "easy",
"index": 7,
"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\": 3, \"5\": 3, \"13\": 2, \"22\": 9, \"19\": 10, \"16\": 9, \"32\": 10, \"39\": 9, \"4\": 4, \"41\": 5, \"1\": 1}, \"1\": {\"19\": 2, \"16\": 2, \"2\": 9, \"3\": 10, \"4\": 8, \"5\": 9, \"6\": 10, \"8\": 9, \"9\": 10, \"10\": 9, \"11\": 8, \"13... | {
"generator_name": "easy",
"index": 191,
"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\": {\"3\": 1, \"6\": 1, \"12\": 1, \"13\": 1, \"11\": 1, \"8\": 1}, \"1\": {\"4\": 1, \"10\": 1, \"12\": 1, \"13\": 1, \"9\": 1, \"2\": 1, \"7\": 1}, \"2\": {\"4\": 1, \"5\": 1, \"1\": 1, \"3\": 1, \"13\": 1}, \"3\": {\"0\": 1, \"2\": 1, \"9\": 1}, \"4\... | {
"generator_name": "easy",
"index": 18,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [0, 1, 3], \"duration\": 60}, \"1\": {\"attendees\": [0, 2, 3], \"duration\": 90}, \"2\": {\"attendees\": [2, 4], \"duration\": 30}, \"3\": {\"attendees\": [3, 4], \"duration\": 90}}, \"attendee_availability\": {\"0\": ... | {
"generator_name": "easy",
"index": 197,
"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\": {\"5\": 1, \"10\": 1, \"8\": 1, \"3\": 1}, \"2\": {\"4\": 1, \"5\": 1, \"10\": 1, \"8\": 1, \"9\": 1, \"11\": 1}, \"3\": {\"4\": 1, \"8\": 1, \"1\": 1, \"9\": 1}, \"4\": {\"2\": 1, \"10\": 1, \"3\": 1, \"0\": 1, \"6\": 1, \"9\": 1}... | {
"generator_name": "easy",
"index": 120,
"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\"], \"3\": [\"0\", \"2\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 149,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [1, 3], \"duration\": 90}, \"1\": {\"attendees\": [0, 1, 3], \"duration\": 30}, \"2\": {\"attendees\": [0, 2, 3], \"duration\": 30}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 90}}, \"attendee_availability\": {\"0\... | {
"generator_name": "easy",
"index": 95,
"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\": [6, 13, 12, 3], \"1\": [16, 3, 4, 10], \"2\": [12, 17, 0, 11, 7, 4, 10], \"3\": [17, 10], \"4\": [11, 12, 10, 13, 3, 2], \"5\": [12, 6, 7, 17, 15, 1, 3], \"6\": [17, 3, 4,... | {
"generator_name": "easy",
"index": 151,
"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\": 9, \"4\": 8, \"5\": 10, \"6\": 9, \"7\": 8, \"8\": 10, \"9\": 8, \"10\": 9, \"12\": 8, \"13\": 10, \"21\": 6, \"40\": 4, \"19\": 6, \"32\": 2}, \"1\": {\"36\": 1, \"7\": 1, \"10\": 2, \"12\": 1, \"13\": 3, \"24\": 10, \"19\": 9, \"25\": 9, \"... | {
"generator_name": "easy",
"index": 30,
"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, 9, 1, 3, 6, 8, 15], \"1\": [17, 10, 0, 13, 18], \"2\": [4, 11, 3, 5, 7, 9, 10], \"3\": [19, 17, 0, 2, 6, 11], \"4\": [8, 2, 11, 14, 17], \"5\": [14, 10, 2, 8, 9, 12], \"6\": [16, 8, 0, 3, 9, 10, 11, 12], \"7\": [15, 16, 2, 18], \"8\": [6, 4, 0, ... | {
"generator_name": "easy",
"index": 174,
"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, 18, 4, 9, 15, 17], \"1\": [9, 3, 2, 5, 16, 19], \"2\": [4, 14, 1, 8, 9, 11], \"3\": [1, 16, 6, 13], \"4\": [15, 2, 0, 6, 19], \"5\": [17, 10, 1, 8, 14], \"6\": [19, 8, 3, 4, 11, 16], \"7\": [12, 0, 9, 10, 16, 17], \"8\": [6, 13, 2, 5, 14, 15, 16,... | {
"generator_name": "easy",
"index": 88,
"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\": [6, 3, 0, 1], \"1\": [5, 8], \"2\": [6, 4, 11, 10], \"3\": [9], \"4\": [5, 7, 2, 6, 12], \"5\": [10, 4, 11, 7, 13]}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 127,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [1, 2], \"duration\": 90}, \"1\": {\"attendees\": [0, 1, 2], \"duration\": 30}, \"2\": {\"attendees\": [0, 1], \"duration\": 30}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 90}}, \"attendee_availability\": {\"0\": ... | {
"generator_name": "easy",
"index": 177,
"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\", \"5\"], \"1\": [\"0\", \"2\", \"4\"], \"2\": [\"1\", \"3\", \"4\"], \"3\": [\"2\", \"5\", \"6\"], \"4\": [\"1\", \"2\", \"6\"], \"5\": [\"0\", \"3\", \"6\"], \"6\": [\"3\", \"4\", \"5\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 90,
"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\"], \"1\": [\"0\", \"2\"], \"2\": [\"0\", \"1\", \"3\", \"4\", \"5\"], \"3\": [\"0\", \"2\", \"4\", \"5\"], \"4\": [\"0\", \"2\", \"3\"], \"5\": [\"0\", \"2\", \"3\"]}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 216,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumSet | [
{
"content": "'Introduction': 'You are a great expert solving maximum-set question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Independent Set Problem aims to find the largest set of vertices where no two vertices are adjacent (i.e., no two vert... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"7\": 1, \"8\": 1, \"5\": 1, \"1\": 1, \"6\": 1}, \"1\": {\"4\": 1, \"6\": 1, \"2\": 1, \"11\": 1, \"0\": 1, \"9\": 1, \"10\": 1, \"12\": 1}, \"2\": {\"7\": 1, \"3\": 1, \"1\": 1, \"6\": 1, \"9\": 1, \"10\": 1}, \"3\": {\"7\": 1, \"5\": 1, \"2\": 1... | {
"generator_name": "easy",
"index": 126,
"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, \"6\": 1, \"5\": 1, \"11\": 1, \"17\": 1, \"14\": 1, \"4\": 1}, \"1\": {\"10\": 1, \"6\": 1, \"3\": 1, \"13\": 1, \"16\": 1, \"7\": 1, \"12\": 1, \"11\": 1, \"17\": 1, \"9\": 1, \"14\": 1, \"15\": 1}, \"2\": {\"13\": 1, \"12\": 1, \"17\": ... | {
"generator_name": "easy",
"index": 84,
"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\": {\"8\": 2, \"1\": 9, \"3\": 10, \"4\": 8, \"6\": 9, \"7\": 8, \"9\": 9, \"12\": 10, \"13\": 9, \"34\": 6}, \"1\": {\"40\": 1, \"0\": 9, \"3\": 8, \"4\": 8, \"5\": 10, \"7\": 9, \"9\": 8, \"11\": 9, \"13\": 10, \"29\": 3, \"30\": 1}, \"2\": {\"7\": 2,... | {
"generator_name": "easy",
"index": 56,
"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, \"10\": 1, \"11\": 1, \"6\": 1, \"4\": 1}, \"1\": {\"3\": 1, \"12\": 1, \"11\": 1, \"13\": 1, \"2\": 1, \"8\": 1, \"0\": 1, \"5\": 1, \"7\": 1}, \"2\": {\"12\": 1, \"1\": 1, \"11\": 1, \"5\": 1, \"7\": 1, \"8\": 1}, \"3\": {\"12\": 1, \"1\... | {
"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\": 233, \"items\": {\"0\": {\"weight\": 14, \"value\": 25}, \"1\": {\"weight\": 8, \"value\": 17}, \"5\": {\"weight\": 23, \"value\": 42}, \"7\": {\"weight\": 16, \"value\": 36}, \"8\": {\"weight\": 20, \"value\": 40}, \"10\": {\"weight\": 22, \"... | {
"generator_name": "easy",
"index": 179,
"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\": 60}, \"1\": {\"attendees\": [0, 1], \"duration\": 30}, \"2\": {\"attendees\": [0, 1, 2], \"duration\": 90}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 30}}, \"attendee_availability\": {\"0\": ... | {
"generator_name": "easy",
"index": 52,
"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\": [], \"2\": [5], \"3\": [5], \"4\": [], \"5\": [3, 7, 2], \"6\": [0], \"7\": [5]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 63,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumCliqueProblem | [
{
"content": "'Introduction': 'You are a great expert solving maximum-clique-problem question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Clique Problem aims to find a subset of vertices (a clique) where every two distinct vertices in the clique... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [\"1\"], \"1\": [\"0\", \"2\", \"4\", \"5\", \"6\", \"7\"], \"2\": [\"1\", \"3\", \"6\"], \"3\": [\"2\"], \"4\": [\"1\", \"5\", \"7\"], \"5\": [\"1\", \"4\", \"6\"], \"6\": [\"1\", \"2\", \"5\"], \"7\": [\"1\", \"4\"]}, \"ground_truth\": 3}",
"styl... | {
"generator_name": "easy",
"index": 125,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 197, \"items\": {\"0\": {\"weight\": 9, \"value\": 20}, \"1\": {\"weight\": 22, \"value\": 40}, \"4\": {\"weight\": 24, \"value\": 45}, \"8\": {\"weight\": 15, \"value\": 28}, \"11\": {\"weight\": 22, \"value\": 52}, \"16\": {\"weight\": 25, \... | {
"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\": [12, 8, 6, 7, 9, 14, 17], \"1\": [11, 3, 7, 13, 14, 17], \"2\": [3, 6, 5, 15], \"3\": [1, 2, 7, 12, 13, 14, 17], \"4\": [13, 11, 5], \"5\": [16, 17, 2, 4, 9, 12, 18], \"6\": [2, 12, 0, 15], \"7\": [15, 13, 0, 1, 3, 9], \"8\": [0, 16], \"9\": [10, 18,... | {
"generator_name": "easy",
"index": 149,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [8], \"1\": [], \"2\": [3], \"3\": [2, 8, 9, 5, 6], \"4\": [], \"5\": [8, 3], \"6\": [3], \"7\": [9], \"8\": [0, 5, 3], \"9\": [7, 3], \"10\": []}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 101,
"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, 10, 3, 9], \"1\": [14, 9, 8, 12, 15], \"2\": [15, 8, 4, 6, 11, 12, 14], \"3\": [14, 4, 0, 9, 12], \"4\": [13, 3, 2, 11, 14, 16], \"5\": [9, 7, 6], \"6\": [10, 16, 2, 5, 8, 11, 13, 15], \"7\": [5, 0, 11, 16], \"8\": [2, 13, 1, 6, 10, 16], \"9\": [... | {
"generator_name": "easy",
"index": 16,
"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\": 3, \"1\": 4, \"2\": 3, \"3\": 2, \"4\": 4, \"5\": 2, \"6\": 5, \"7\": 3, \"8\": 5}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 140,
"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, 12, 15], \"1\": [15, 2, 4, 11], \"2\": [1, 0, 4, 6, 8, 11, 14], \"3\": [12, 7, 6, 9, 15], \"4\": [6, 14, 1, 2, 7, 10], \"5\": [14, 9], \"6\": [8, 4, 2, 3, 7, 10, 14], \"7\": [3, 10, 4, 6, 14], \"8\": [11, 6, 2], \"9\": [5, 13, 3, 16], \"10\": [7,... | {
"generator_name": "easy",
"index": 219,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"4\": 1, \"26\": 10, \"27\": 10, \"19\": 10, \"40\": 10, \"30\": 10, \"29\": 9, \"18\": 3, \"2\": 4, \"5\": 6, \"33\": 4}, \"1\": {\"4\": 2, \"6\": 2, \"10\": 3, \"19\": 9, \"15\": 10, \"21\": 10, \"31\": 9, \"39\": 10, \"33\": 9, \"28\": 2, \"34\"... | {
"generator_name": "easy",
"index": 119,
"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\": {\"1\": {\"weight\": 24, \"value\": 44}, \"8\": {\"weight\": 13, \"value\": 32}, \"11\": {\"weight\": 5, \"value\": 12}, \"12\": {\"weight\": 16, \"value\": 31}, \"14\": {\"weight\": 21, \"value\": 38}, \"16\": {\"weight\": 19,... | {
"generator_name": "easy",
"index": 87,
"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\": 99, \"2\": 20, \"3\": 48, \"4\": 99, \"5\": 87, \"6\": 16, \"7\": 27, \"8\": 100, \"9\": 89, \"10\": 46, \"11\": 63, \"12\": 79, \"13\": 17, \"14\": 91, \"15\": 66, \"16\": 27, \"17\": 28, \"18\": 39, \"19\": 13}, \"1\": {\"0\": 99,... | {
"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\": [2, 13, 4, 11, 15], \"1\": [15, 4, 2, 3], \"2\": [7, 0, 1, 8, 9], \"3\": [8, 6, 1, 4], \"4\": [1, 12, 0, 3, 7, 10, 14, 15], \"5\": [15, 13, 12], \"6\": [3, 10, 8], \"7\": [10, 2, 4, 11, 14, 15], \"8\": [9, 3, 2, 6, 11, 14], \"9\": [14, 8, 2], \"10\":... | {
"generator_name": "easy",
"index": 176,
"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\": [1, 2], \"duration\": 90}, \"2\": {\"attendees\": [0, 1], \"duration\": 90}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 90}, \"4\": {\"attendees\": [0, 1, 2], \"dur... | {
"generator_name": "easy",
"index": 147,
"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\": 2, \"2\": 4, \"3\": 4, \"4\": 4, \"5\": 4, \"6\": 4, \"7\": 2}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 166,
"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, 13, 7, 8], \"1\": [10, 3, 7, 11, 15, 17], \"2\": [14, 5, 10, 11, 15, 17], \"3\": [1, 16, 5], \"4\": [8, 6, 10, 13], \"5\": [2, 12, 3, 13, 16, 17], \"6\": [12, 4, 9, 10, 14, 17], \"7\": [8, 17, 0, 1, 10, 11], \"8\": [4, 7, 0, 11, 12, 17], \"9\": [... | {
"generator_name": "easy",
"index": 158,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"1\": 9, \"2\": 8, \"3\": 8, \"4\": 9, \"7\": 9, \"8\": 9, \"9\": 9, \"12\": 10, \"13\": 9, \"37\": 1, \"11\": 4, \"20\": 6, \"28\": 6}, \"1\": {\"0\": 9, \"2\": 10, \"3\": 8, \"4\": 10, \"7\": 8, \"8\": 9, \"11\": 10, \"13\": 10, \"12\": 1, \"20\"... | {
"generator_name": "easy",
"index": 50,
"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, 8, 4, 5, 6, 9, 13], \"1\": [15, 6, 2, 9, 11, 12, 16], \"2\": [4, 12, 1, 3, 16], \"3\": [13, 4, 2, 10], \"4\": [3, 2, 0, 11, 12], \"5\": [7, 10, 0], \"6\": [1, 14, 0, 10, 16], \"7\": [9, 5, 12, 16], \"8\": [0, 9, 12, 13], \"9\": [8, 7, 0, 1, 11],... | {
"generator_name": "easy",
"index": 47,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [16, 12, 18], \"1\": [11, 13, 5, 6, 14], \"2\": [8, 10, 18, 19], \"3\": [12, 5, 11, 17, 19], \"4\": [10, 7, 15], \"5\": [3, 13, 1, 8], \"6\": [11, 14, 1, 8, 10], \"7\": [4, 18, 12, 16], \"8\": [15, 2, 5, 6, 10, 12, 17, 18, 19], \"9\": [18, 19, 11, 14... | {
"generator_name": "easy",
"index": 73,
"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\": [8, 1, 18, 6, 3, 13, 0, 10], \"1\": [2, 9], \"2\": [14, 16, 0, 4, 18, 6], \"3\": [17, 18], \"4\": [7, 16, 6, 15], \"5\": [6, 13, 5, 11, 2, 12], \"6\": [0, 14, 13, 11, ... | {
"generator_name": "easy",
"index": 164,
"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, \"10\": 1, \"8\": 1, \"6\": 1, \"5\": 1, \"7\": 1}, \"1\": {\"11\": 1, \"10\": 1, \"4\": 1, \"2\": 1, \"3\": 1, \"8\": 1, \"7\": 1, \"5\": 1, \"6\": 1, \"9\": 1}, \"2\": {\"11\": 1, \"1\": 1, \"4\": 1, \"3\": 1, \"7\": 1, \"5\": 1, \"12\"... | {
"generator_name": "easy",
"index": 75,
"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\": 146, \"items\": {\"0\": {\"weight\": 18, \"value\": 36}, \"1\": {\"weight\": 16, \"value\": 32}, \"2\": {\"weight\": 10, \"value\": 21}, \"3\": {\"weight\": 16, \"value\": 35}, \"6\": {\"weight\": 10, \"value\": 18}, \"10\": {\"weight\": 15, \... | {
"generator_name": "easy",
"index": 138,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [0, 1, 4], \"duration\": 60}, \"1\": {\"attendees\": [1, 3, 4], \"duration\": 30}, \"2\": {\"attendees\": [0, 1, 3], \"duration\": 90}, \"3\": {\"attendees\": [0, 1, 4], \"duration\": 90}}, \"attendee_availability\": {\... | {
"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\": [2], \"1\": [3, 4, 5, 8], \"2\": [0, 6, 7], \"3\": [1], \"4\": [1], \"5\": [8, 1], \"6\": [2], \"7\": [2], \"8\": [5, 1], \"9\": [], \"10\": []}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 158,
"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\": [7, 14, 4], \"1\": [12, 14, 8, 2, 7, 15], \"2\": [17], \"3\": [17, 11, 3, 8, 9], \"4\": [6, 10, 13, 9, 3], \"5\": [8, 11, 5, 0, 14], \"6\": [9, 12, 2, 1, 13, 16], \"7\... | {
"generator_name": "easy",
"index": 84,
"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, 12, 4, 6, 7], \"1\": [14, 8, 5, 6], \"2\": [8, 0, 3, 12, 13], \"3\": [11, 6, 2, 4, 5, 12], \"4\": [9, 11, 0, 3], \"5\": [10, 9, 1, 3, 12], \"6\": [3, 14, 0, 1], \"7\": [13, 10, 0, 12], \"8\": [1, 2], \"9\": [5, 4, 11, 13], \"10\": [7, 5, 13], \"1... | {
"generator_name": "easy",
"index": 160,
"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, 5], \"2\": [9], \"3\": [10, 5], \"4\": [1], \"5\": [1, 3, 7], \"6\": [], \"7\": [5], \"8\": [], \"9\": [2], \"10\": [3]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 125,
"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\": [1, 2, 10, 3], \"1\": [10, 5, 2, 8], \"2\": [3, 5, 4, 12, 0], \"3\": [6, 2, 10, 9], \"4\": [10, 7], \"5\": [4, 5, 12, 11]}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"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\": 69, \"2\": 90, \"3\": 25, \"4\": 11, \"5\": 12, \"6\": 77, \"7\": 95, \"8\": 72, \"9\": 32, \"10\": 23, \"11\": 59, \"12\": 93, \"13\": 100, \"14\": 26, \"15\": 18, \"16\": 64}, \"1\": {\"0\": 69, \"1\": 0, \"2\": 44, \"3\": 56, \"4... | {
"generator_name": "easy",
"index": 161,
"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\": 3, \"1\": 1, \"2\": 5, \"3\": 1, \"4\": 5, \"5\": 3, \"6\": 2, \"7\": 2, \"8\": 4}}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 221,
"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\": 90}, \"1\": {\"attendees\": [0, 1], \"duration\": 90}, \"2\": {\"attendees\": [0, 2], \"duration\": 30}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 90}, \"4\": {\"attendees\": [0, 2], \"durati... | {
"generator_name": "easy",
"index": 73,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [14, 11, 8, 13], \"1\": [13, 16], \"2\": [15, 3, 4, 12], \"3\": [4, 2, 5, 10, 15], \"4\": [6, 3, 2, 5, 7, 10, 11], \"5\": [10, 14, 3, 4, 8, 15], \"6\": [16, 4], \"7\": [11, 8, 4], \"8\": [7, 13, 0, 5, 12], \"9\": [12, 10, 15], \"10\": [9, 5, 3, 4, 11... | {
"generator_name": "easy",
"index": 13,
"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], \"duration\": 30}, \"1\": {\"attendees\": [3, 4], \"duration\": 90}, \"2\": {\"attendees\": [0, 3], \"duration\": 60}, \"3\": {\"attendees\": [0, 3, 4], \"duration\": 60}, \"4\": {\"attendees\": [1, 2, 4], \"dur... | {
"generator_name": "easy",
"index": 99,
"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, 7], \"1\": [4], \"2\": [8, 4], \"3\": [4, 7], \"4\": [0, 1, 3, 8, 2], \"5\": [], \"6\": [], \"7\": [0, 3], \"8\": [4, 2]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 215,
"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\": {\"3\": 1, \"12\": 1, \"6\": 1, \"16\": 1, \"7\": 1, \"10\": 1}, \"1\": {\"15\": 1, \"16\": 1}, \"2\": {\"5\": 1, \"15\": 1, \"17\": 1, \"6\": 1}, \"3\": {\"0\": 1, \"9\": 1, \"15\": 1, \"6\": 1, \"11\": 1, \"7\": 1, \"16\": 1}, \"4\": {\"13\": 1, \"... | {
"generator_name": "easy",
"index": 71,
"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\", \"4\", \"5\", \"7\"], \"3\": [\"2\"], \"4\": [\"2\", \"6\", \"7\"], \"5\": [\"2\", \"6\"], \"6\": [\"4\", \"5\"], \"7\": [\"2\", \"4\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 107,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 171, \"items\": {\"0\": {\"weight\": 24, \"value\": 47}, \"2\": {\"weight\": 13, \"value\": 25}, \"3\": {\"weight\": 9, \"value\": 18}, \"6\": {\"weight\": 5, \"value\": 11}, \"13\": {\"weight\": 11, \"value\": 24}, \"14\": {\"weight\": 17, \"... | {
"generator_name": "easy",
"index": 182,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSetCover | [
{
"content": "'Introduction': 'You are a great expert solving set-cover question. You should propose a solution to this question.', 'Task description': 'Given a universal set U and a collection of subsets S, the Set Cover Problem aims to find the smallest possible sub-collection of S whose union equals U. In o... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"U\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], \"S\": {\"0\": [6, 7, 8, 1], \"1\": [0, 2, 10, 11], \"2\": [11, 3], \"3\": [1, 5, 2, 4], \"4\": [9], \"5\": [0], \"6\": [11, 3, 10], \"7\": [7, 9, 2, 11], \"8\": [4, 0], \"9\": [11, 7, 6]}}, \"ground_truth\": 5... | {
"generator_name": "easy",
"index": 15,
"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, 4, 2, 3, 7], \"1\": [9, 12, 15], \"2\": [16, 11, 0, 7, 9, 10], \"3\": [13, 6, 0, 14], \"4\": [0, 17, 5], \"5\": [6, 9, 4, 13, 17], \"6\": [3, 5, 14], \"7\": [14, 13, 0, 2], \"8\": [15, 10], \"9\": [5, 1, 2, 12], \"10\": [14, 8, 2, 13, 15, 17], \... | {
"generator_name": "easy",
"index": 157,
"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\": [4, 16, 17, 6, 1, 5], \"1\": [16, 2, 8], \"2\": [0, 9, 17, 11, 6], \"3\": [7, 15, 14, 6, 3, 10, 12], \"4\": [13]}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 209,
"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, \"14\": 1, \"2\": 1, \"13\": 1, \"10\": 1, \"1\": 1, \"12\": 1, \"15\": 1}, \"1\": {\"7\": 1, \"14\": 1, \"0\": 1, \"11\": 1, \"2\": 1}, \"2\": {\"7\": 1, \"0\": 1, \"11\": 1, \"13\": 1, \"8\": 1, \"1\": 1, \"6\": 1, \"12\": 1, \"15\": 1},... | {
"generator_name": "easy",
"index": 89,
"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, 9], \"1\": [3, 2], \"2\": [1, 8], \"3\": [1, 7, 10, 9], \"4\": [], \"5\": [11], \"6\": [0], \"7\": [3], \"8\": [2], \"9\": [3, 0], \"10\": [3], \"11\": [5]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 210,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [1], \"1\": [0, 5], \"2\": [7], \"3\": [], \"4\": [5, 6], \"5\": [4, 1], \"6\": [4, 7], \"7\": [2, 6]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 116,
"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\": 208, \"items\": {\"4\": {\"weight\": 24, \"value\": 52}, \"8\": {\"weight\": 21, \"value\": 38}, \"12\": {\"weight\": 9, \"value\": 21}, \"14\": {\"weight\": 22, \"value\": 50}, \"16\": {\"weight\": 19, \"value\": 44}, \"17\": {\"weight\": 23,... | {
"generator_name": "easy",
"index": 16,
"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\": 53, \"2\": 85, \"3\": 72, \"4\": 68, \"5\": 74, \"6\": 25, \"7\": 39, \"8\": 23, \"9\": 59, \"10\": 33, \"11\": 15, \"12\": 43, \"13\": 61, \"14\": 85}, \"1\": {\"0\": 53, \"1\": 0, \"2\": 65, \"3\": 55, \"4\": 14, \"5\": 56, \"6\":... | {
"generator_name": "easy",
"index": 166,
"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\": [1, 16, 3, 5, 6, 9, 17], \"1\": [9, 0, 11, 14, 15, 17], \"2\": [16, 7, 3], \"3\": [13, 11, 0, 2, 5, 6, 7, 15, 17], \"4\": [5, 14, 7, 15], \"5\": [15, 4, 0, 3], \"6\": [8, 7, 0, 3, 16], \"7\": [2, 6, 3, 4, 10, 14, 16], \"8\": [6, 13, 14], \"9\": [10, ... | {
"generator_name": "easy",
"index": 113,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [1, 3, 4], \"duration\": 60}, \"1\": {\"attendees\": [0, 2, 3], \"duration\": 30}, \"2\": {\"attendees\": [3, 4], \"duration\": 60}, \"3\": {\"attendees\": [2, 3], \"duration\": 90}, \"4\": {\"attendees\": [0, 4], \"dur... | {
"generator_name": "easy",
"index": 69,
"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\": [0, 2], \"duration\": 60}, \"2\": {\"attendees\": [0, 1], \"duration\": 60}, \"3\": {\"attendees\": [2, 3], \"duration\": 90}}, \"attendee_availability\": {\"0\": [[540,... | {
"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], \"S\": {\"0\": [2], \"1\": [9, 7, 4], \"2\": [4], \"3\": [8, 2, 5, 0], \"4\": [10, 9, 5], \"5\": [8, 7, 1], \"6\": [3, 5, 4, 0], \"7\": [5, 4, 0, 11, 6], \"8\": [7]}}, \"ground_truth\": 5}",
"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\": {\"2\": 1, \"10\": 1, \"9\": 1, \"13\": 1, \"11\": 1}, \"1\": {\"17\": 1, \"8\": 1, \"11\": 1}, \"2\": {\"9\": 1, \"13\": 1, \"0\": 1, \"16\": 1}, \"3\": {\"17\": 1, \"14\": 1, \"6\": 1, \"12\": 1}, \"4\": {\"8\": 1, \"11\": 1}, \"5\": {\"11\": 1, \"... | {
"generator_name": "easy",
"index": 182,
"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\", \"2\", \"3\", \"4\", \"6\"], \"2\": [\"1\", \"3\", \"4\", \"5\", \"6\"], \"3\": [\"1\", \"2\", \"4\", \"5\", \"6\"], \"4\": [\"1\", \"2\", \"3\", \"6\"], \"5\": [\"2\", \"3\", \"6\"], \"6\": [\"0\", \"1\", \"2\", \"3\",... | {
"generator_name": "easy",
"index": 182,
"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\": 13, \"value\": 24}, \"9\": {\"weight\": 24, \"value\": 56}, \"10\": {\"weight\": 21, \"value\": 39}, \"11\": {\"weight\": 11, \"value\": 23}, \"13\": {\"weight\": 12, \"value\": 23}, \"14\": {\"weight\": 10... | {
"generator_name": "easy",
"index": 112,
"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, \"6\": 1, \"2\": 1, \"1\": 1, \"4\": 1, \"19\": 1, \"3\": 1, \"11\": 1}, \"1\": {\"0\": 1, \"6\": 1, \"7\": 1, \"2\": 1, \"4\": 1, \"8\": 1, \"5\": 1, \"9\": 1, \"11\": 1, \"16\": 1}, \"2\": {\"0\": 1, \"13\": 1, \"6\": 1, \"1\": 1, \"18\... | {
"generator_name": "easy",
"index": 88,
"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, 3], \"duration\": 90}, \"1\": {\"attendees\": [1, 3], \"duration\": 60}, \"2\": {\"attendees\": [1, 3], \"duration\": 90}, \"3\": {\"attendees\": [2, 3], \"duration\": 60}}, \"attendee_availability\": {\"0\": [[5... | {
"generator_name": "easy",
"index": 96,
"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, \"4\": 1}, \"1\": {\"9\": 1, \"2\": 1, \"0\": 1, \"8\": 1, \"11\": 1}, \"2\": {\"1\": 1, \"0\": 1, \"3\": 1, \"6\": 1, \"7\": 1, \"11\": 1}, \"3\": {\"10\": 1, \"2\": 1}, \"4\": {\"10\": 1, \"8\": 1, \"0\": 1, \"6\": 1, \"7\": 1}... | {
"generator_name": "easy",
"index": 112,
"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], \"1\": [0, 13], \"2\": [8, 10, 3, 5, 4, 13, 1, 15], \"3\": [13, 6, 12, 8], \"4\": [2, 14, 10, 11, 16, 9], \"5\": [7, 4, 3, 5]}}, \"ground_truth\": 5}",
"style": "rule"
... | {
"generator_name": "easy",
"index": 78,
"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\": 1, \"1\": 3, \"2\": 5, \"3\": 1, \"4\": 5, \"5\": 1, \"6\": 3, \"7\": 4}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 183,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 13, \"2\": 29, \"3\": 64, \"4\": 17, \"5\": 16, \"6\": 47, \"7\": 27, \"8\": 64, \"9\": 20, \"10\": 65, \"11\": 92, \"12\": 72, \"13\": 81, \"14\": 30, \"15\": 99, \"16\": 52, \"17\": 88}, \"1\": {\"0\": 13, \"1\": 0, \"2\": 15, \"3... | {
"generator_name": "easy",
"index": 95,
"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\": [2, 4], \"duration\": 60}, \"2\": {\"attendees\": [0, 1, 3], \"duration\": 60}, \"3\": {\"attendees\": [1, 4], \"duration\": 60}, \"4\": {\"attendees\": [1, 4], \"dur... | {
"generator_name": "easy",
"index": 107,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [], \"1\": [], \"2\": [], \"3\": [], \"4\": [], \"5\": [], \"6\": [7], \"7\": [6]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 82,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 34, \"2\": 64, \"3\": 30, \"4\": 96, \"5\": 30, \"6\": 11, \"7\": 68, \"8\": 93, \"9\": 95, \"10\": 29, \"11\": 97, \"12\": 50, \"13\": 96, \"14\": 51, \"15\": 72, \"16\": 20, \"17\": 44, \"18\": 88, \"19\": 12}, \"1\": {\"0\": 34, ... | {
"generator_name": "easy",
"index": 65,
"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, 9, 10, 13, 14], \"1\": [7, 3, 5, 8, 12, 17], \"2\": [16, 0, 9], \"3\": [1, 9, 4, 5, 7, 10, 14], \"4\": [0, 8, 3, 10, 11, 14], \"5\": [15, 13, 1, 3, 10], \"6\": [8, 17, 16, 18], \"7\": [12, 1, 3, 10, 11, 16], \"8\": [4, 6, 1, 12, 14, 15], \"9\"... | {
"generator_name": "easy",
"index": 179,
"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.