data_source stringclasses 10
values | prompt listlengths 1 1 | reward_model dict | extra_info dict |
|---|---|---|---|
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"3\": 1, \"8\": 3, \"9\": 1, \"12\": 3, \"23\": 10, \"21\": 9, \"15\": 10, \"31\": 9, \"32\": 9, \"39\": 9, \"34\": 4, \"24\": 6}, \"1\": {\"5\": 3, \"2\": 8, \"3\": 9, \"4\": 8, \"7\": 10, \"8\": 9, \"9\": 9, \"10\": 10, \"11\": 9, \"12\": 8, \"13... | {
"generator_name": "easy",
"index": 89,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSetCover | [
{
"content": "'Introduction': 'You are a great expert solving set-cover question. You should propose a solution to this question.', 'Task description': 'Given a universal set U and a collection of subsets S, the Set Cover Problem aims to find the smallest possible sub-collection of S whose union equals U. In o... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"U\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17], \"S\": {\"0\": [8, 9, 3], \"1\": [12], \"2\": [3, 5, 7, 4, 17], \"3\": [2, 3, 0, 11, 10], \"4\": [14, 11, 15, 6], \"5\": [0, 15, 7, 16, 12, 13, 11], \"6\": [8, 4, 11, 12, 1], \"7\": [6, ... | {
"generator_name": "easy",
"index": 83,
"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, 4, 7], \"1\": [4], \"2\": [], \"3\": [0, 8], \"4\": [0, 1, 5, 7], \"5\": [4], \"6\": [7], \"7\": [4, 6, 0], \"8\": [3], \"9\": []}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 167,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"15\": 1, \"34\": 2, \"1\": 1, \"22\": 10, \"17\": 10, \"26\": 9, \"37\": 10, \"28\": 10, \"41\": 9, \"3\": 3, \"2\": 1}, \"1\": {\"0\": 1, \"2\": 9, \"3\": 10, \"4\": 10, \"5\": 9, \"6\": 9, \"7\": 10, \"9\": 9, \"10\": 9, \"11\": 8, \"13\": 10, \... | {
"generator_name": "easy",
"index": 144,
"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\": [7], \"2\": [], \"3\": [], \"4\": [], \"5\": [], \"6\": [], \"7\": [1]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 185,
"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\": 1, \"1\": 1, \"2\": 1, \"3\": 3, \"4\": 2, \"5\": 5, \"6\": 4, \"7\": 5, \"8\": 3, \"9\": 1}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 84,
"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\": 30}, \"1\": {\"attendees\": [3, 4], \"duration\": 30}, \"2\": {\"attendees\": [1, 3], \"duration\": 60}, \"3\": {\"attendees\": [2, 3, 4], \"duration\": 60}}, \"attendee_availability\": {\"0\": [[5... | {
"generator_name": "easy",
"index": 15,
"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\": 27, \"2\": 46, \"3\": 97, \"4\": 39, \"5\": 63, \"6\": 72, \"7\": 87, \"8\": 44, \"9\": 35, \"10\": 75, \"11\": 25, \"12\": 40}, \"1\": {\"0\": 27, \"1\": 0, \"2\": 37, \"3\": 25, \"4\": 81, \"5\": 51, \"6\": 83, \"7\": 19, \"8\": 2... | {
"generator_name": "easy",
"index": 163,
"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, 15, 7], \"1\": [5, 3, 2, 10, 11, 16], \"2\": [9, 6, 1, 4, 7, 8, 13, 14], \"3\": [1, 14, 8, 11], \"4\": [7, 16, 2, 9, 10, 11, 12, 13], \"5\": [15, 1], \"6\": [2, 7, 9, 10, 13], \"7\": [6, 4, 0, 2], \"8\": [11, 12, 2, 3, 10, 14], \"9\": [13, 2, 4,... | {
"generator_name": "easy",
"index": 221,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [11, 9, 4, 6, 12], \"1\": [14, 2, 9, 11], \"2\": [1, 8, 6, 14], \"3\": [8, 5, 9], \"4\": [13, 11, 0, 5], \"5\": [3, 13, 4, 8], \"6\": [10, 7, 0, 2, 9, 11, 13], \"7\": [6, 12, 11], \"8\": [2, 3, 5, 14], \"9\": [0, 10, 1, 3, 6, 14], \"10\": [9, 6, 14],... | {
"generator_name": "easy",
"index": 99,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumSet | [
{
"content": "'Introduction': 'You are a great expert solving maximum-set question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Independent Set Problem aims to find the largest set of vertices where no two vertices are adjacent (i.e., no two vert... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"8\": 1, \"5\": 1, \"7\": 1, \"4\": 1, \"2\": 1, \"9\": 1}, \"1\": {\"5\": 1, \"12\": 1, \"9\": 1, \"2\": 1, \"10\": 1}, \"2\": {\"8\": 1, \"5\": 1, \"1\": 1, \"3\": 1, \"0\": 1}, \"3\": {\"5\": 1, \"7\": 1, \"4\": 1, \"2\": 1}, \"4\": {\"5\": 1, \... | {
"generator_name": "easy",
"index": 140,
"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\": [5, 2, 3], \"1\": [5, 7, 0, 4], \"2\": [2], \"3\": [2], \"4\": [8, 5, 6, 1, 9]}}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 14,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumSet | [
{
"content": "'Introduction': 'You are a great expert solving maximum-set question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Independent Set Problem aims to find the largest set of vertices where no two vertices are adjacent (i.e., no two vert... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"1\": 1, \"11\": 1, \"2\": 1}, \"1\": {\"5\": 1, \"7\": 1, \"0\": 1, \"3\": 1, \"11\": 1, \"2\": 1, \"6\": 1}, \"2\": {\"1\": 1, \"7\": 1, \"0\": 1, \"4\": 1, \"3\": 1, \"9\": 1}, \"3\": {\"1\": 1, \"4\": 1, \"9\": 1, \"2\": 1, \"6\": 1, \"8\": 1, ... | {
"generator_name": "easy",
"index": 165,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [0, 1, 4], \"duration\": 90}, \"1\": {\"attendees\": [1, 2, 4], \"duration\": 90}, \"2\": {\"attendees\": [3, 4], \"duration\": 60}, \"3\": {\"attendees\": [2, 3], \"duration\": 90}, \"4\": {\"attendees\": [1, 2, 3], \"... | {
"generator_name": "easy",
"index": 154,
"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, 17, 5, 7, 11, 15, 19], \"1\": [18, 0], \"2\": [10, 13, 18], \"3\": [15, 12, 13, 14], \"4\": [17, 7, 5, 9, 12, 13, 19], \"5\": [14, 19, 0, 4, 6, 8], \"6\": [7, 15, 5, 9], \"7\": [4, 6, 0, 12, 14], \"8\": [13, 18, 5, 17], \"9\": [16, 14, 4, 6, 12, ... | {
"generator_name": "easy",
"index": 69,
"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\": [2], \"1\": [0, 1, 13, 14], \"2\": [12, 1, 9, 0], \"3\": [11, 5, 1, 3, 13, 8], \"4\": [16, 17], \"5\": [6, 11, 3, 10], \"6\": [4, 2, 12, 15, 9, 1, 0, 7]}}, \"ground_truth\... | {
"generator_name": "easy",
"index": 76,
"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, 7], \"1\": [12, 2, 3, 13], \"2\": [1, 6, 7, 10, 12], \"3\": [10, 8, 1], \"4\": [7, 10, 6, 14], \"5\": [6, 9, 11, 13], \"6\": [2, 5, 4, 7, 14], \"7\": [0, 4, 2, 6, 10, 11, 12], \"8\": [3, 13], \"9\": [5, 11, 10, 12, 14], \"10\": [4, 3, 2, 7, 9, 1... | {
"generator_name": "easy",
"index": 173,
"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\": 201, \"items\": {\"0\": {\"weight\": 25, \"value\": 49}, \"8\": {\"weight\": 21, \"value\": 47}, \"11\": {\"weight\": 19, \"value\": 46}, \"12\": {\"weight\": 21, \"value\": 50}, \"13\": {\"weight\": 8, \"value\": 15}, \"14\": {\"weight\": 16,... | {
"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, 13, 15], \"1\": [11, 14, 8, 15], \"2\": [10, 5, 7], \"3\": [14, 4], \"4\": [0, 3, 13, 14, 15], \"5\": [2, 8], \"6\": [7, 10, 14], \"7\": [13, 6, 2, 12, 14], \"8\": [5, 15, 1, 9, 12], \"9\": [12, 11, 8], \"10\": [6, 2], \"11\": [9, 1], \"12\": [15... | {
"generator_name": "easy",
"index": 7,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [1, 3], \"duration\": 30}, \"1\": {\"attendees\": [0, 2], \"duration\": 60}, \"2\": {\"attendees\": [2, 3], \"duration\": 90}, \"3\": {\"attendees\": [2, 3], \"duration\": 90}, \"4\": {\"attendees\": [0, 2, 3], \"durati... | {
"generator_name": "easy",
"index": 200,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpKnapsack | [
{
"content": "'Introduction': 'You are a great expert solving knapsack question. You should propose a solution to this question.', 'Task description': \"The knapsack problem's goal is to choose a subset of items to pack into a limited-capacity bag in a way that maximizes total value without exceeding the weight... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"capacity\": 157, \"items\": {\"1\": {\"weight\": 10, \"value\": 18}, \"4\": {\"weight\": 22, \"value\": 52}, \"6\": {\"weight\": 23, \"value\": 45}, \"8\": {\"weight\": 13, \"value\": 27}, \"9\": {\"weight\": 21, \"value\": 45}, \"11\": {\"weight\": 23, \... | {
"generator_name": "easy",
"index": 158,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 27, \"numbers\": {\"0\": 5, \"1\": 1, \"2\": 4, \"3\": 4, \"4\": 3, \"5\": 1, \"6\": 5, \"7\": 4}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 76,
"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\": 29, \"2\": 42, \"3\": 77, \"4\": 76, \"5\": 19, \"6\": 76, \"7\": 20, \"8\": 45, \"9\": 81, \"10\": 62, \"11\": 86, \"12\": 67, \"13\": 57, \"14\": 10}, \"1\": {\"0\": 29, \"1\": 0, \"2\": 38, \"3\": 77, \"4\": 24, \"5\": 34, \"6\":... | {
"generator_name": "easy",
"index": 191,
"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\": 151, \"items\": {\"1\": {\"weight\": 23, \"value\": 46}, \"2\": {\"weight\": 14, \"value\": 25}, \"4\": {\"weight\": 15, \"value\": 29}, \"5\": {\"weight\": 12, \"value\": 23}, \"6\": {\"weight\": 10, \"value\": 20}, \"7\": {\"weight\": 10, \"... | {
"generator_name": "easy",
"index": 199,
"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], \"duration\": 90}, \"2\": {\"attendees\": [0, 1, 2], \"duration\": 30}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 60}}, \"attendee_availability\": {\"0\": ... | {
"generator_name": "easy",
"index": 163,
"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\": 134, \"items\": {\"3\": {\"weight\": 14, \"value\": 33}, \"4\": {\"weight\": 6, \"value\": 12}, \"12\": {\"weight\": 7, \"value\": 14}, \"13\": {\"weight\": 16, \"value\": 34}, \"14\": {\"weight\": 22, \"value\": 51}, \"15\": {\"weight\": 13, ... | {
"generator_name": "easy",
"index": 88,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [5, 6], \"1\": [], \"2\": [8], \"3\": [9], \"4\": [6, 9], \"5\": [0, 9], \"6\": [4, 0], \"7\": [], \"8\": [2], \"9\": [3, 5, 4]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 224,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 96, \"2\": 61, \"3\": 62, \"4\": 56, \"5\": 84, \"6\": 43, \"7\": 57, \"8\": 60, \"9\": 20, \"10\": 94, \"11\": 80, \"12\": 73, \"13\": 15, \"14\": 14, \"15\": 48}, \"1\": {\"0\": 96, \"1\": 0, \"2\": 37, \"3\": 93, \"4\": 32, \"5\"... | {
"generator_name": "easy",
"index": 193,
"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\", \"3\", \"4\", \"6\"], \"2\": [\"4\"], \"3\": [\"1\"], \"4\": [\"1\", \"2\", \"5\"], \"5\": [\"4\"], \"6\": [\"0\", \"1\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 113,
"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\": {\"37\": 2, \"2\": 8, \"3\": 10, \"5\": 8, \"6\": 8, \"7\": 8, \"9\": 10, \"10\": 8, \"11\": 9, \"12\": 8, \"13\": 8, \"36\": 2, \"30\": 2, \"20\": 1, \"26\": 5}, \"1\": {\"24\": 2, \"3\": 1, \"6\": 2, \"9\": 2, \"12\": 2, \"25\": 10, \"23\": 9, \"17... | {
"generator_name": "easy",
"index": 129,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumCliqueProblem | [
{
"content": "'Introduction': 'You are a great expert solving maximum-clique-problem question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Clique Problem aims to find a subset of vertices (a clique) where every two distinct vertices in the clique... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [\"2\", \"3\", \"4\"], \"1\": [\"2\", \"3\", \"4\", \"5\"], \"2\": [\"0\", \"1\", \"3\", \"4\", \"5\"], \"3\": [\"0\", \"1\", \"2\", \"4\", \"5\"], \"4\": [\"0\", \"1\", \"2\", \"3\"], \"5\": [\"1\", \"2\", \"3\"]}, \"ground_truth\": 4}",
"style": ... | {
"generator_name": "easy",
"index": 88,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 10, \"numbers\": {\"0\": 3, \"1\": 1, \"2\": 1, \"3\": 1, \"4\": 1, \"5\": 4}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 10,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumSet | [
{
"content": "'Introduction': 'You are a great expert solving maximum-set question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Independent Set Problem aims to find the largest set of vertices where no two vertices are adjacent (i.e., no two vert... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"10\": 1, \"4\": 1, \"2\": 1}, \"1\": {\"10\": 1, \"12\": 1, \"5\": 1, \"6\": 1, \"2\": 1, \"7\": 1}, \"2\": {\"10\": 1, \"4\": 1, \"5\": 1, \"6\": 1, \"1\": 1, \"0\": 1}, \"3\": {\"9\": 1, \"12\": 1, \"5\": 1, \"6\": 1, \"11\": 1}, \"4\": {\"9\": ... | {
"generator_name": "easy",
"index": 162,
"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\": 86, \"2\": 85, \"3\": 79, \"4\": 72, \"5\": 34, \"6\": 20, \"7\": 12, \"8\": 97, \"9\": 87, \"10\": 19, \"11\": 76, \"12\": 100}, \"1\": {\"0\": 86, \"1\": 0, \"2\": 67, \"3\": 23, \"4\": 12, \"5\": 28, \"6\": 81, \"7\": 32, \"8\": ... | {
"generator_name": "easy",
"index": 224,
"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\": 17, \"numbers\": {\"0\": 5, \"1\": 3, \"2\": 2, \"3\": 3, \"4\": 1, \"5\": 1, \"6\": 3, \"7\": 3, \"8\": 1, \"9\": 2}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 102,
"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\": 154, \"items\": {\"0\": {\"weight\": 13, \"value\": 26}, \"3\": {\"weight\": 8, \"value\": 17}, \"5\": {\"weight\": 15, \"value\": 32}, \"10\": {\"weight\": 22, \"value\": 42}, \"14\": {\"weight\": 7, \"value\": 12}, \"16\": {\"weight\": 8, \"... | {
"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\": [3, 16, 2, 6, 10, 11], \"1\": [16, 9, 5, 10, 13, 15], \"2\": [14, 3, 0, 5, 10, 15], \"3\": [2, 0, 8, 10], \"4\": [17, 12, 5, 7, 9, 14], \"5\": [7, 13, 1, 2, 4, 14], \"6\": [14, 10, 0, 16, 17], \"7\": [15, 5, 4, 13], \"8\": [11, 17, 3, 14], \"9\": [1,... | {
"generator_name": "easy",
"index": 135,
"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\": [10, 4, 16], \"1\": [10, 15, 2, 9, 18, 17], \"2\": [1, 18, 7, 2, 16], \"3\": [5, 13, 18, 3], \"4\": [2, 5], \"5\": [8], \"6\": [11, 7, 5, 15, 0, 8], \"7\": [11, 12, 16... | {
"generator_name": "easy",
"index": 81,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumCliqueProblem | [
{
"content": "'Introduction': 'You are a great expert solving maximum-clique-problem question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Clique Problem aims to find a subset of vertices (a clique) where every two distinct vertices in the clique... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [\"3\", \"4\"], \"1\": [\"3\", \"4\"], \"2\": [\"4\"], \"3\": [\"0\", \"1\"], \"4\": [\"0\", \"1\", \"2\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 127,
"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, 4, 6], \"1\": [], \"2\": [4], \"3\": [7, 0], \"4\": [2, 0, 9], \"5\": [], \"6\": [8, 0], \"7\": [9, 3], \"8\": [6], \"9\": [7, 4], \"10\": []}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 31,
"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\": 190, \"items\": {\"0\": {\"weight\": 22, \"value\": 46}, \"2\": {\"weight\": 16, \"value\": 36}, \"5\": {\"weight\": 13, \"value\": 31}, \"6\": {\"weight\": 14, \"value\": 28}, \"10\": {\"weight\": 22, \"value\": 44}, \"16\": {\"weight\": 13, ... | {
"generator_name": "easy",
"index": 78,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpHamiltonianCycle | [
{
"content": "'Introduction': 'You are a great expert solving hamiltonian-cycle question. You should propose a solution to this question.', 'Task description': 'Your objective is to find a subgraph within a given graph G that contains a Hamiltonian circuit, which is a path that visits every vertex exactly once ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [19, 1, 2, 9, 17], \"1\": [0, 15, 4], \"2\": [18, 17, 0, 6, 8, 12, 16], \"3\": [6, 11, 10, 12, 16, 18], \"4\": [13, 5, 1, 7, 10, 11], \"5\": [4, 12, 14, 15, 18], \"6\": [16, 3, 2, 7, 8], \"7\": [10, 18, 4, 6, 17], \"8\": [17, 9, 2, 6, 12, 14, 15, 16]... | {
"generator_name": "easy",
"index": 168,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"3\": 3, \"12\": 1, \"16\": 10, \"22\": 10, \"35\": 10, \"39\": 9, \"33\": 2, \"24\": 1, \"7\": 1, \"17\": 5}, \"1\": {\"31\": 2, \"10\": 3, \"3\": 8, \"4\": 9, \"5\": 8, \"6\": 10, \"7\": 10, \"9\": 9, \"11\": 10, \"12\": 10, \"13\": 10, \"17\": 6... | {
"generator_name": "easy",
"index": 193,
"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\", \"3\", \"4\"], \"2\": [\"0\", \"1\", \"3\", \"4\"], \"3\": [\"1\", \"2\", \"4\"], \"4\": [\"0\", \"1\", \"2\", \"3\"]}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 31,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSubsetSum | [
{
"content": "'Introduction': 'You are a great expert solving subset-sum question. You should propose a solution to this question.', 'Task description': 'The subset sum problem asks whether a subset of numbers adds up to a given target. In this variation, the goal is not just to find any solution, but one that ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"target\": 23, \"numbers\": {\"0\": 2, \"1\": 5, \"2\": 2, \"3\": 2, \"4\": 2, \"5\": 4, \"6\": 5, \"7\": 2, \"8\": 1, \"9\": 5}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 121,
"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\": 2, \"1\": 4, \"2\": 4, \"3\": 4, \"4\": 4, \"5\": 1, \"6\": 2, \"7\": 5}}, \"ground_truth\": 7}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 117,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumCliqueProblem | [
{
"content": "'Introduction': 'You are a great expert solving maximum-clique-problem question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Clique Problem aims to find a subset of vertices (a clique) where every two distinct vertices in the clique... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [\"1\", \"2\", \"6\"], \"1\": [\"0\", \"4\", \"7\"], \"2\": [\"0\", \"5\", \"7\"], \"3\": [\"4\", \"5\", \"6\", \"7\"], \"4\": [\"1\", \"3\"], \"5\": [\"2\", \"3\"], \"6\": [\"0\", \"3\"], \"7\": [\"1\", \"2\", \"3\"]}, \"ground_truth\": 2}",
"styl... | {
"generator_name": "easy",
"index": 73,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [1, 3], \"duration\": 30}, \"1\": {\"attendees\": [1, 2, 4], \"duration\": 30}, \"2\": {\"attendees\": [1, 2], \"duration\": 90}, \"3\": {\"attendees\": [0, 1], \"duration\": 90}}, \"attendee_availability\": {\"0\": [[5... | {
"generator_name": "easy",
"index": 184,
"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, 1], \"duration\": 60}, \"2\": {\"attendees\": [0, 1, 2], \"duration\": 90}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 60}}, \"attendee_availability\": {\"0\": ... | {
"generator_name": "easy",
"index": 124,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [0, 2, 3], \"duration\": 30}, \"1\": {\"attendees\": [1, 3], \"duration\": 60}, \"2\": {\"attendees\": [0, 2, 3], \"duration\": 90}, \"3\": {\"attendees\": [0, 1, 2], \"duration\": 30}, \"4\": {\"attendees\": [1, 2, 3],... | {
"generator_name": "easy",
"index": 3,
"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\": 60}, \"1\": {\"attendees\": [1, 2, 4], \"duration\": 90}, \"2\": {\"attendees\": [1, 3, 4], \"duration\": 60}, \"3\": {\"attendees\": [0, 2], \"duration\": 30}, \"4\": {\"attendees\": [2, 3], \"dur... | {
"generator_name": "easy",
"index": 94,
"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\", \"3\", \"4\"], \"2\": [\"0\", \"3\", \"4\"], \"3\": [\"0\", \"1\", \"2\", \"4\"], \"4\": [\"0\", \"1\", \"2\", \"3\"]}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 191,
"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], \"2\": [1, 9], \"3\": [5, 6, 9], \"4\": [8], \"5\": [3, 9], \"6\": [0, 3], \"7\": [], \"8\": [4], \"9\": [5, 2, 3]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 123,
"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\": 188, \"items\": {\"3\": {\"weight\": 20, \"value\": 37}, \"5\": {\"weight\": 16, \"value\": 34}, \"6\": {\"weight\": 9, \"value\": 21}, \"7\": {\"weight\": 20, \"value\": 40}, \"8\": {\"weight\": 13, \"value\": 26}, \"11\": {\"weight\": 16, \"... | {
"generator_name": "easy",
"index": 67,
"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\": 5, \"2\": 1, \"3\": 1, \"4\": 3, \"5\": 4, \"6\": 3}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 15,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumSet | [
{
"content": "'Introduction': 'You are a great expert solving maximum-set question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Independent Set Problem aims to find the largest set of vertices where no two vertices are adjacent (i.e., no two vert... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"5\": 1, \"6\": 1, \"2\": 1, \"16\": 1, \"17\": 1, \"10\": 1, \"18\": 1, \"3\": 1, \"8\": 1, \"12\": 1, \"11\": 1, \"9\": 1, \"13\": 1, \"14\": 1}, \"1\": {\"7\": 1, \"18\": 1, \"3\": 1, \"12\": 1, \"15\": 1, \"14\": 1}, \"2\": {\"19\": 1, \"0\": 1... | {
"generator_name": "easy",
"index": 147,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumSet | [
{
"content": "'Introduction': 'You are a great expert solving maximum-set question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Independent Set Problem aims to find the largest set of vertices where no two vertices are adjacent (i.e., no two vert... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"13\": 1, \"11\": 1, \"2\": 1, \"7\": 1, \"17\": 1, \"9\": 1}, \"1\": {\"5\": 1, \"6\": 1, \"13\": 1, \"12\": 1, \"19\": 1, \"15\": 1, \"3\": 1, \"9\": 1, \"16\": 1}, \"2\": {\"13\": 1, \"12\": 1, \"7\": 1, \"0\": 1, \"17\": 1, \"9\": 1, \"15\": 1}... | {
"generator_name": "easy",
"index": 19,
"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\": 66, \"2\": 98, \"3\": 67, \"4\": 78, \"5\": 77, \"6\": 53, \"7\": 42, \"8\": 74, \"9\": 85}, \"1\": {\"0\": 66, \"1\": 0, \"2\": 11, \"3\": 74, \"4\": 82, \"5\": 15, \"6\": 78, \"7\": 53, \"8\": 43, \"9\": 22}, \"2\": {\"0\": 98, \"... | {
"generator_name": "easy",
"index": 183,
"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\": 17, \"numbers\": {\"0\": 2, \"1\": 5, \"2\": 4, \"3\": 2, \"4\": 3, \"5\": 2, \"6\": 5, \"7\": 1}}, \"ground_truth\": 6}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 144,
"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\": {\"7\": 2, \"1\": 9, \"2\": 10, \"6\": 10, \"8\": 8, \"10\": 10, \"11\": 8, \"12\": 8, \"13\": 10, \"17\": 1, \"38\": 6, \"5\": 1, \"31\": 2, \"24\": 4, \"19\": 1}, \"1\": {\"0\": 9, \"2\": 8, \"3\": 9, \"4\": 10, \"6\": 8, \"8\": 10, \"10\": 9, \"11... | {
"generator_name": "easy",
"index": 34,
"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\": {\"7\": 1, \"11\": 3, \"1\": 10, \"2\": 8, \"3\": 10, \"4\": 9, \"5\": 9, \"10\": 9, \"12\": 9, \"13\": 9, \"35\": 4, \"36\": 4, \"19\": 6, \"26\": 4}, \"1\": {\"9\": 1, \"0\": 10, \"2\": 10, \"3\": 9, \"4\": 10, \"5\": 10, \"6\": 9, \"8\": 8, \"10\"... | {
"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\": [1], \"1\": [0], \"2\": [3], \"3\": [7, 2], \"4\": [], \"5\": [7], \"6\": [], \"7\": [3, 5, 8], \"8\": [7]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 156,
"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\": [7, 5, 9, 1, 6, 14], \"1\": [10], \"2\": [7, 0], \"3\": [5, 4, 3, 12, 8, 2], \"4\": [12, 10, 3, 7, 15], \"5\": [0, 13, 14, 11], \"6\": [8, 7, 12, 6], \"7\": [14, 10, 12, 0, 6, 8],... | {
"generator_name": "easy",
"index": 33,
"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\", \"6\"], \"1\": [\"0\", \"3\", \"4\"], \"2\": [\"0\", \"3\", \"4\", \"6\"], \"3\": [\"0\", \"1\", \"2\", \"6\"], \"4\": [\"1\", \"2\"], \"5\": [\"6\"], \"6\": [\"0\", \"2\", \"3\", \"5\"]}, \"ground_truth\": 4}",
"style": "rule... | {
"generator_name": "easy",
"index": 124,
"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\": 107, \"items\": {\"0\": {\"weight\": 19, \"value\": 44}, \"1\": {\"weight\": 9, \"value\": 21}, \"4\": {\"weight\": 12, \"value\": 29}, \"7\": {\"weight\": 15, \"value\": 32}, \"8\": {\"weight\": 18, \"value\": 33}, \"11\": {\"weight\": 21, \"... | {
"generator_name": "easy",
"index": 139,
"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\": 154, \"items\": {\"0\": {\"weight\": 8, \"value\": 15}, \"5\": {\"weight\": 9, \"value\": 18}, \"8\": {\"weight\": 11, \"value\": 24}, \"9\": {\"weight\": 22, \"value\": 46}, \"11\": {\"weight\": 8, \"value\": 16}, \"12\": {\"weight\": 20, \"v... | {
"generator_name": "easy",
"index": 10,
"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\": [\"4\", \"5\"], \"1\": [\"3\", \"5\"], \"2\": [\"3\"], \"3\": [\"1\", \"2\", \"4\"], \"4\": [\"0\", \"3\"], \"5\": [\"0\", \"1\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 221,
"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\": 176, \"items\": {\"0\": {\"weight\": 24, \"value\": 47}, \"1\": {\"weight\": 23, \"value\": 45}, \"2\": {\"weight\": 7, \"value\": 16}, \"8\": {\"weight\": 17, \"value\": 39}, \"15\": {\"weight\": 21, \"value\": 44}, \"16\": {\"weight\": 20, \... | {
"generator_name": "easy",
"index": 54,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [1], \"1\": [0], \"2\": [8, 6], \"3\": [7], \"4\": [5], \"5\": [4, 7], \"6\": [2], \"7\": [3, 5], \"8\": [2]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 197,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumCliqueProblem | [
{
"content": "'Introduction': 'You are a great expert solving maximum-clique-problem question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Clique Problem aims to find a subset of vertices (a clique) where every two distinct vertices in the clique... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [\"2\", \"3\", \"4\"], \"1\": [\"2\", \"3\", \"4\"], \"2\": [\"0\", \"1\", \"4\"], \"3\": [\"0\", \"1\", \"4\"], \"4\": [\"0\", \"1\", \"2\", \"3\"]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 172,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumCliqueProblem | [
{
"content": "'Introduction': 'You are a great expert solving maximum-clique-problem question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Clique Problem aims to find a subset of vertices (a clique) where every two distinct vertices in the clique... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [\"5\"], \"1\": [\"2\", \"5\", \"6\"], \"2\": [\"1\", \"4\", \"6\"], \"3\": [\"4\", \"5\", \"6\"], \"4\": [\"2\", \"3\", \"6\"], \"5\": [\"0\", \"1\", \"3\", \"6\"], \"6\": [\"1\", \"2\", \"3\", \"4\", \"5\"]}, \"ground_truth\": 3}",
"style": "rule... | {
"generator_name": "easy",
"index": 155,
"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\": [11, 0, 14, 10, 6], \"1\": [12, 8, 0, 11], \"2\": [6, 4, 14, 10, 12, 0], \"3\": [8, 12, 13, 15], \"4\": [12, 2, 4, 6], \"5\": [2, 0, 1, 10], \"6\": [0, 3, 5, 7, 9]}}, \"ground_tru... | {
"generator_name": "easy",
"index": 140,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpSetCover | [
{
"content": "'Introduction': 'You are a great expert solving set-cover question. You should propose a solution to this question.', 'Task description': 'Given a universal set U and a collection of subsets S, the Set Cover Problem aims to find the smallest possible sub-collection of S whose union equals U. In o... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"U\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13], \"S\": {\"0\": [2, 8, 13, 7, 5], \"1\": [9, 11, 12, 5], \"2\": [9, 8, 4, 1, 7, 10, 6], \"3\": [13], \"4\": [0, 12, 5], \"5\": [11, 2, 1, 5, 3]}}, \"ground_truth\": 4}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 16,
"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, 1, 3, 11, 13], \"1\": [0, 12, 2, 3, 13], \"2\": [6, 0, 1, 4, 5, 7, 9, 14], \"3\": [8, 9, 0, 1, 4], \"4\": [10, 13, 2, 3, 5, 12, 15], \"5\": [11, 13, 2, 4, 9], \"6\": [14, 2], \"7\": [12, 11, 2], \"8\": [10, 3, 15], \"9\": [3, 15, 2, 5, 14], \"10\... | {
"generator_name": "easy",
"index": 110,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"19\": 2, \"2\": 2, \"8\": 2, \"9\": 1, \"26\": 10, \"15\": 10, \"35\": 9, \"33\": 10, \"36\": 1, \"21\": 5, \"10\": 4, \"6\": 1}, \"1\": {\"2\": 9, \"4\": 10, \"5\": 8, \"6\": 10, \"8\": 10, \"9\": 10, \"10\": 8, \"11\": 10, \"12\": 8, \"13\": 9, ... | {
"generator_name": "easy",
"index": 222,
"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\": 85, \"items\": {\"0\": {\"weight\": 8, \"value\": 19}, \"3\": {\"weight\": 8, \"value\": 17}, \"7\": {\"weight\": 14, \"value\": 25}, \"12\": {\"weight\": 6, \"value\": 13}, \"13\": {\"weight\": 11, \"value\": 24}, \"20\": {\"weight\": 11, \"v... | {
"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\": [\"4\", \"5\", \"6\"], \"1\": [\"4\", \"7\"], \"2\": [\"3\", \"4\"], \"3\": [\"2\", \"6\", \"7\"], \"4\": [\"0\", \"1\", \"2\", \"7\"], \"5\": [\"0\"], \"6\": [\"0\", \"3\"], \"7\": [\"1\", \"3\", \"4\"]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 189,
"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\": 128, \"items\": {\"3\": {\"weight\": 15, \"value\": 29}, \"4\": {\"weight\": 18, \"value\": 42}, \"7\": {\"weight\": 13, \"value\": 28}, \"8\": {\"weight\": 7, \"value\": 17}, \"11\": {\"weight\": 23, \"value\": 56}, \"12\": {\"weight\": 22, \... | {
"generator_name": "easy",
"index": 218,
"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, 16, 2, 6, 11, 17, 19], \"1\": [8, 19], \"2\": [19, 13, 0, 5, 8, 10, 14], \"3\": [15, 9, 12, 13], \"4\": [5, 6, 7, 8, 10, 11, 13, 14, 18], \"5\": [7, 4, 2, 12, 13, 15], \"6\": [4, 17, 0, 10, 18], \"7\": [11, 5, 4, 15], \"8\": [1, 17, 2, 4], \"9\"... | {
"generator_name": "easy",
"index": 116,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpGcpD | [
{
"content": "'Introduction': 'You are a great expert solving gcp-d question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph G = （V, E）, where V is a set of vertices and E is a set of edges, the Graph Coloring Problem (GCP) asks whether it is possible to assign ... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [5, 4, 9], \"1\": [4, 2, 8], \"2\": [1], \"3\": [6, 9], \"4\": [1, 0, 11, 7], \"5\": [9, 10, 0], \"6\": [3, 7], \"7\": [6, 4, 10], \"8\": [1, 9], \"9\": [5, 0, 3, 8, 11], \"10\": [5, 7], \"11\": [4, 9]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 212,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"12\": 1, \"3\": 9, \"4\": 8, \"5\": 9, \"6\": 8, \"7\": 10, \"8\": 8, \"9\": 10, \"10\": 8, \"11\": 8, \"13\": 9, \"37\": 5, \"18\": 5, \"33\": 6}, \"1\": {\"29\": 2, \"4\": 2, \"8\": 1, \"14\": 10, \"16\": 10, \"25\": 10, \"28\": 10, \"38\": 10, ... | {
"generator_name": "easy",
"index": 128,
"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\": 3, \"2\": 2, \"3\": 5, \"4\": 1, \"5\": 1, \"6\": 3, \"7\": 4}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 29,
"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, 4, 2, 3, 12, 14], \"1\": [5, 10], \"2\": [3, 13, 0, 5, 6, 8, 12], \"3\": [2, 8, 0, 13], \"4\": [0, 6, 5, 14], \"5\": [11, 1, 2, 4], \"6\": [4, 7, 2, 8, 12, 13, 14], \"7\": [6, 11], \"8\": [3, 9, 2, 6, 11], \"9\": [8, 0, 12, 13], \"10\": [1, 12], ... | {
"generator_name": "easy",
"index": 124,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumSet | [
{
"content": "'Introduction': 'You are a great expert solving maximum-set question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Independent Set Problem aims to find the largest set of vertices where no two vertices are adjacent (i.e., no two vert... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"15\": 1, \"3\": 1, \"9\": 1, \"2\": 1, \"4\": 1, \"12\": 1, \"1\": 1, \"8\": 1}, \"1\": {\"15\": 1, \"0\": 1, \"16\": 1, \"7\": 1, \"17\": 1, \"18\": 1}, \"2\": {\"0\": 1, \"3\": 1, \"9\": 1, \"7\": 1, \"12\": 1, \"18\": 1, \"5\": 1, \"13\": 1}, \... | {
"generator_name": "easy",
"index": 146,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumSet | [
{
"content": "'Introduction': 'You are a great expert solving maximum-set question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Independent Set Problem aims to find the largest set of vertices where no two vertices are adjacent (i.e., no two vert... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"14\": 1, \"12\": 1, \"3\": 1, \"13\": 1}, \"1\": {\"2\": 1, \"16\": 1, \"11\": 1, \"3\": 1, \"4\": 1, \"10\": 1}, \"2\": {\"3\": 1, \"15\": 1, \"1\": 1}, \"3\": {\"2\": 1, \"14\": 1, \"0\": 1, \"10\": 1, \"15\": 1, \"1\": 1, \"6\": 1}, \"4\": {\"1... | {
"generator_name": "easy",
"index": 181,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumCliqueProblem | [
{
"content": "'Introduction': 'You are a great expert solving maximum-clique-problem question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Clique Problem aims to find a subset of vertices (a clique) where every two distinct vertices in the clique... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [\"2\", \"4\", \"5\"], \"1\": [\"3\", \"4\", \"5\", \"7\"], \"2\": [\"0\", \"5\"], \"3\": [\"1\", \"5\"], \"4\": [\"0\", \"1\", \"5\", \"6\", \"7\"], \"5\": [\"0\", \"1\", \"2\", \"3\", \"4\", \"6\"], \"6\": [\"4\", \"5\", \"7\"], \"7\": [\"1\", \"4\... | {
"generator_name": "easy",
"index": 37,
"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, 4, 5], \"1\": [13, 2, 8, 14], \"2\": [1, 7, 9], \"3\": [12, 10, 6, 14], \"4\": [0, 6, 7, 12, 14], \"5\": [11, 14, 0, 15], \"6\": [4, 12, 3, 14], \"7\": [2, 8, 4, 9, 11, 12], \"8\": [7, 9, 1, 10], \"9\": [8, 11, 2, 7, 12], \"10\": [3, 15, 8, 13],... | {
"generator_name": "easy",
"index": 125,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpTsp | [
{
"content": "'Introduction': 'You are a great expert solving TSP question. You should propose a solution to this question.', 'Task description': 'Given a set of cities and the distances between each pair of cities, the Traveling Salesman Problem (TSP) aims to find the shortest possible route that visits each c... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"0\": 0, \"1\": 58, \"2\": 35, \"3\": 94, \"4\": 94, \"5\": 64, \"6\": 75, \"7\": 39, \"8\": 59, \"9\": 10}, \"1\": {\"0\": 58, \"1\": 0, \"2\": 57, \"3\": 28, \"4\": 52, \"5\": 29, \"6\": 96, \"7\": 59, \"8\": 73, \"9\": 13}, \"2\": {\"0\": 35, \"... | {
"generator_name": "easy",
"index": 6,
"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, \"13\": 1, \"15\": 1, \"4\": 1, \"16\": 1, \"6\": 1}, \"1\": {\"4\": 1, \"10\": 1, \"5\": 1, \"12\": 1, \"14\": 1}, \"2\": {\"3\": 1, \"13\": 1, \"6\": 1, \"10\": 1, \"17\": 1, \"5\": 1, \"12\": 1}, \"3\": {\"7\": 1, \"13\": 1, \"2\": 1, \... | {
"generator_name": "easy",
"index": 35,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMinimumCut | [
{
"content": "'Introduction': 'You are a great expert solving minimum-cut question. You should propose a solution to this question.', 'Task description': 'Given a weighted undirected graph, the **Balanced Minimum Bisection Problem** aims to partition the graph into two disjoint subsets of **equal size** (or dif... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": {\"18\": 2, \"3\": 2, \"10\": 1, \"13\": 3, \"26\": 9, \"25\": 9, \"15\": 10, \"29\": 10, \"37\": 10, \"41\": 10, \"28\": 5, \"34\": 5, \"4\": 5, \"14\": 5}, \"1\": {\"26\": 2, \"10\": 3, \"21\": 9, \"23\": 10, \"31\": 10, \"37\": 9, \"32\": 10, \"5\... | {
"generator_name": "easy",
"index": 172,
"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\": [3], \"3\": [2, 1, 7], \"4\": [0], \"5\": [6, 7], \"6\": [5], \"7\": [3, 5]}, \"ground_truth\": 2}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 64,
"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\": 191, \"items\": {\"0\": {\"weight\": 15, \"value\": 31}, \"4\": {\"weight\": 14, \"value\": 25}, \"5\": {\"weight\": 19, \"value\": 41}, \"6\": {\"weight\": 11, \"value\": 24}, \"7\": {\"weight\": 25, \"value\": 45}, \"9\": {\"weight\": 13, \"... | {
"generator_name": "easy",
"index": 170,
"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\": [9, 12, 13, 4], \"1\": [16, 10, 1, 0, 3, 13], \"2\": [16, 1, 3, 7, 5, 8], \"3\": [12, 13, 16], \"4\": [2, 14, 10, 9, 16, 6, 15], \"5\": [11]}}, \"ground_truth\": 5}",
"style... | {
"generator_name": "easy",
"index": 213,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMaximumCliqueProblem | [
{
"content": "'Introduction': 'You are a great expert solving maximum-clique-problem question. You should propose a solution to this question.', 'Task description': 'Given an undirected graph, the Maximum Clique Problem aims to find a subset of vertices (a clique) where every two distinct vertices in the clique... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"0\": [\"1\", \"2\", \"5\"], \"1\": [\"0\", \"2\", \"3\", \"5\"], \"2\": [\"0\", \"1\", \"3\", \"4\"], \"3\": [\"1\", \"2\", \"4\", \"5\"], \"4\": [\"2\", \"3\"], \"5\": [\"0\", \"1\", \"3\"]}, \"ground_truth\": 3}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 135,
"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\": 4, \"3\": 1, \"4\": 4, \"5\": 3, \"6\": 5, \"7\": 3}}, \"ground_truth\": 8}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 218,
"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\": 5, \"3\": 5, \"4\": 4, \"5\": 4, \"6\": 2}}, \"ground_truth\": 7}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 111,
"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\": 1, \"1\": 3, \"2\": 2, \"3\": 3, \"4\": 3, \"5\": 4, \"6\": 4}}, \"ground_truth\": 5}",
"style": "rule"
} | {
"generator_name": "easy",
"index": 222,
"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\": [9, 16, 6], \"1\": [17, 3, 1], \"2\": [16, 2], \"3\": [7, 4, 16, 15], \"4\": [12, 8, 13], \"5\": [14], \"6\": [0, 17, 10], \"7\": [3], \"8\": [10, 17, 12, 11, 5, 3], \"9\"... | {
"generator_name": "easy",
"index": 42,
"need_tools_kwargs": false,
"split": "train"
} |
bootcamp/NpMeetingSchedule | [
{
"content": "'Introduction': 'You are a great expert solving meeting-schedule question. You should propose a solution to this question.', 'Task description': 'Given a set of meetings, each with a required set of attendees, their availability times, and available meeting rooms with capacities, the Meeting Sched... | {
"ground_truth": "{\"difficulty\": \"easy\", \"question\": {\"meetings\": {\"0\": {\"attendees\": [2, 3], \"duration\": 60}, \"1\": {\"attendees\": [0, 2, 3], \"duration\": 90}, \"2\": {\"attendees\": [0, 1, 2], \"duration\": 30}, \"3\": {\"attendees\": [0, 1, 3], \"duration\": 60}}, \"attendee_availability\": {\"0\... | {
"generator_name": "easy",
"index": 22,
"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\", \"6\"], \"1\": [\"0\", \"3\", \"4\", \"5\", \"6\"], \"2\": [\"5\", \"6\"], \"3\": [\"0\", \"1\", \"4\"], \"4\": [\"0\", \"1\", \"3\", \"5\", \"6\"], \"5\": [\"1\", \"2\", \"4\", \"6\"], \"6\": [\"0\", \"1\", \"2\", \"4\", \"5\"]... | {
"generator_name": "easy",
"index": 118,
"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.