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