id stringlengths 32 32 ⌀ | instruction_seed stringlengths 187 48.6k | output stringlengths 2.75k 73.2k ⌀ | source stringclasses 10
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 3
values | difficulty int64 6 10 | solution stringlengths 36 6.37k ⌀ | index stringclasses 42
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 308 821 | __original_row_idx int64 3 31.6k | ms_id int64 0 7.9k | reasoning stringlengths 2.99k 107k | deepseek_solution stringlengths 22 23.4k | final_reasoning_trace stringlengths 6.02k 113k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
5a1457386eebbc5fc97c07a21330002a | "You are given a connected undirected weighted graph consisting of n vertices and m edges.\n\nYou ne(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import heapq\n\nn, m, k = map(int, input().split())\nadj = [[] for _ in range(n + 1)]\nedges = []\n(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires understanding of graph theory concepts, specifically shortest paths in weight(...TRUNCATED) | 21,923 | 5,480 | "Okay, so I need to solve this problem where I have to find the k-th smallest shortest path in a gra(...TRUNCATED) | "To solve this problem, we need to find the k-th smallest shortest path in a connected undirected we(...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to find the k-th smallest shortest path(...TRUNCATED) | [{"from":"human","value":"You are given a connected undirected weighted graph consisting of n vertic(...TRUNCATED) |
b93f5cd02dd5a32a08d1d5ecc078c846 | "SaMer has written the greatest test case of all time for one of his problems. For a given array of (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the task is to find for each k from 1 to n, the numb(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "def square_free(x):\n if x == 0:\n return 0\n sign = 1 if x > 0 else -1\n x = abs(x(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves grouping integers based on their multiplicative properties (specifically wheth(...TRUNCATED) | 22,894 | 5,723 | "Okay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe problem sa(...TRUNCATED) | "To solve this problem, we need to determine the number of contiguous subarrays of a given array tha(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe p(...TRUNCATED) | [{"from":"human","value":"SaMer has written the greatest test case of all time for one of his proble(...TRUNCATED) |
null | "Given a directed graph on the nodes 0, 1, ..n, where each edge has two non-negative integer costs, (...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem involves finding Pareto optimal paths in a directed graph, requiring an understanding o(...TRUNCATED) | 24,594 | 6,148 | "Okay, I need to find all Pareto optimal path costs from node 0 to node n in a directed graph where (...TRUNCATED) | "To solve this problem, we need to find all Pareto optimal path costs from node 0 to node n in a dir(...TRUNCATED) | "<think>\nOkay, I need to find all Pareto optimal path costs from node 0 to node n in a directed gra(...TRUNCATED) | [{"from":"human","value":"Given a directed graph on the nodes 0, 1, ..n, where each edge has two non(...TRUNCATED) |
b7fd8f3d2712b26f7ee5698baf5cb798 | "Masha lives in a country with n cities numbered from 1 to n. She lives in the city number 1. \n\nTh(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, M(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "n, k = map(int, input().split())\ncost = [list(map(int, input().split())) for _ in range(n)]\nINF =(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires a combination of advanced dynamic programming and graph theory, as it involve(...TRUNCATED) | 5,822 | 1,455 | "Okay, so I've got this programming problem to solve, and I need to figure out how to approach it. L(...TRUNCATED) | "To solve this problem, we need to find the cheapest journey for Masha that starts and ends at city (...TRUNCATED) | "<think>\nOkay, so I've got this programming problem to solve, and I need to figure out how to appro(...TRUNCATED) | [{"from":"human","value":"Masha lives in a country with n cities numbered from 1 to n. She lives in (...TRUNCATED) |
null | "Introduction:\nInspired by both Perfect License Plates and How many points does my license plate gi(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires a good understanding of string manipulation, randomization, and the use of pre(...TRUNCATED) | 11,012 | 2,753 | "Okay, I need to solve this programming problem. Let's read the requirements carefully.\n\nSo the in(...TRUNCATED) | "To solve this problem, we need to generate a Dutch sentence from a given license plate using predef(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the requirements carefully.\n\n(...TRUNCATED) | [{"from":"human","value":"Introduction:\nInspired by both Perfect License Plates and How many points(...TRUNCATED) |
null | "You're tasked with writing an algorithm to efficiently estimate cost of solving an Eni-Puzzle from (...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem requires a deep understanding of combinatorial optimization and algorithmic efficiency.(...TRUNCATED) | 18,246 | 4,561 | "Okay, let's try to tackle this problem. The goal is to find the minimum cost to transform the given(...TRUNCATED) | "To solve this problem, we need to efficiently estimate the minimum cost required to solve an Eni-Pu(...TRUNCATED) | "<think>\nOkay, let's try to tackle this problem. The goal is to find the minimum cost to transform (...TRUNCATED) | [{"from":"human","value":"You're tasked with writing an algorithm to efficiently estimate cost of so(...TRUNCATED) |
5de3eadb4f7d2af8b01c86081acb559e | "ZS the Coder has recently found an interesting concept called the Birthday Paradox. It states that (...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem where I have to compute the prob(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import math\n\nMOD = 10**6 + 3\n\n# Precompute factorial and inverse factorial modulo MOD\nmax_fact(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem involves understanding the Birthday Paradox and calculating the probability of at leas(...TRUNCATED) | 4,019 | 1,004 | "Okay, let's try to solve this problem. Hmm, so the task is to calculate the probability that at lea(...TRUNCATED) | "To solve this problem, we need to determine the probability that at least two out of k people inter(...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. Hmm, so the task is to calculate the probability th(...TRUNCATED) | [{"from":"human","value":"ZS the Coder has recently found an interesting concept called the Birthday(...TRUNCATED) |
bb320d4f215c0b82647f21017e920561 | "Imagine a board with n pins put into it, the i-th pin is located at (x_i, y_i). For simplicity, we (...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import math\n\ndef compute_perimeter(polygon):\n n = len(polygon)\n perimeter = 0.0\n for (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires understanding and application of computational geometry concepts, particularly(...TRUNCATED) | 14,675 | 3,668 | "Okay, let's see. We need to find the area of the fiber shape F(S, l), which is the set of points t (...TRUNCATED) | "To solve this problem, we need to determine the area of the fiber shape F(S, l) for a given convex (...TRUNCATED) | "<think>\nOkay, let's see. We need to find the area of the fiber shape F(S, l), which is the set of (...TRUNCATED) | [{"from":"human","value":"Imagine a board with n pins put into it, the i-th pin is located at (x_i, (...TRUNCATED) |
675ac64c91725dbe77a1876738219d99 | "Your task is to build a model^(1) which can predict y-coordinate.\nYou can pass tests if predicted (...TRUNCATED) | "<think>\nOkay, I need to build a model to predict the y-coordinate based on the training data provi(...TRUNCATED) | codewars | mit | apps | train | 8 | "class LinearRegressionModel:\n def __init__(self):\n self.m = 0.0\n self.b = 0.0\n(...TRUNCATED) | 4891 | nvidia/OpenCodeReasoning | "The problem requires a deep understanding of machine learning concepts such as model training, erro(...TRUNCATED) | 23,246 | 5,811 | "Okay, I need to build a model to predict the y-coordinate based on given x values. The problem says(...TRUNCATED) | "To solve this problem, we need to build a model that predicts the y-coordinate based on given x-val(...TRUNCATED) | "<think>\nOkay, I need to build a model to predict the y-coordinate based on given x values. The pro(...TRUNCATED) | [{"from":"human","value":"Your task is to build a model^(1) which can predict y-coordinate.\nYou can(...TRUNCATED) |
null | "This is a graphical output challenge where the task is to give the shortest code per language. \nT(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem involves graphical programming with specific requirements for animation timing, continu(...TRUNCATED) | 4,932 | 1,233 | "Okay, I need to write a Python program that displays a single purple pixel moving clockwise around (...TRUNCATED) | "## Python, 283 bytes\n\n```python\nimport pygame as g,math as m\ng.init()\ns=g.display.set_mode([10(...TRUNCATED) | "<think>\nOkay, I need to write a Python program that displays a single purple pixel moving clockwis(...TRUNCATED) | [{"from":"human","value":"This is a graphical output challenge where the task is to give the shortes(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6