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