id stringlengths 32 32 ⌀ | instruction_seed stringlengths 80 48.6k | output stringlengths 4.44k 71.5k ⌀ | source stringclasses 9
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 3
values | difficulty int64 6 10 | solution stringlengths 0 8.94k ⌀ | index stringclasses 82
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 256 861 | __original_row_idx int64 17 63.2k | ms_id int64 1 3.95k | reasoning sequencelengths 16 16 | deepseek_solution sequencelengths 16 16 | final_reasoning_trace sequencelengths 16 16 | _majority_responses sequencelengths 8 8 | verified_final_reasoning_trace stringlengths 1.82k 91.8k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "The Simplest N-Dimensional shape one can create for any dimension is a Simplex, and this is a set o(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "This problem requires advanced algorithmic knowledge to generate N-dimensional vertex sets of regul(...TRUNCATED) | 35,825 | 2,239 | ["Okay, I need to generate a simplex in N dimensions. The simplex has N+1 points, each pair of which(...TRUNCATED) | ["To solve this problem, we need to generate the coordinates of an N-dimensional simplex, which cons(...TRUNCATED) | ["<think>\nOkay, I need to generate a simplex in N dimensions. The simplex has N+1 points, each pair(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where, given a dimension N, I have to generate the coo(...TRUNCATED) | "<think>\nOkay, I need to generate an n-dimensional simplex. Let's think about how to construct this(...TRUNCATED) | [{"from":"human","value":"The Simplest N-Dimensional shape one can create for any dimension is a Sim(...TRUNCATED) |
null | "In this fastest-code challenge, you are provided with a set of \\$n\\$ identical blocks and need to(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem requires a deep understanding of combinatorial geometry as it involves counting unique (...TRUNCATED) | 11,364 | 710 | ["Okay, I need to solve this problem where I have to count the number of unique buildings made with (...TRUNCATED) | ["To solve this problem, we need to determine the number of unique buildings that can be constructed(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to count the number of unique buildings m(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this problem where I have to count the number of unique (...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to determine the number of unique build(...TRUNCATED) | [{"from":"human","value":"In this fastest-code challenge, you are provided with a set of \\$n\\$ ide(...TRUNCATED) |
3c98412d08d4336fab2dbc7e419f6e49 | "For his computer science class, Jacob builds a model tree with sticks and balls containing n nodes (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm. So Jacob can choose the root of the tree and rearran(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import bisect\nfrom collections import deque\n\nn, k = map(int, input().split())\na = list(map(int,(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires combinatorial insights and an understanding of tree traversal techniques, spec(...TRUNCATED) | 37,406 | 2,337 | ["Okay, let's see. We need to find the maximum possible minimum value among the first k nodes in a D(...TRUNCATED) | ["To solve this problem, we need to determine the maximum possible minimum value among the first k n(...TRUNCATED) | ["<think>\nOkay, let's see. We need to find the maximum possible minimum value among the first k nod(...TRUNCATED) | ["<think>\nOkay, let's see. So the problem is about finding the best possible minimum value among th(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So the task is to maximize the minimum a_i amo(...TRUNCATED) | [{"from":"human","value":"For his computer science class, Jacob builds a model tree with sticks and (...TRUNCATED) |
c0b3bc503d5af6bc816576e0d56d525d | "Tanya is now five so all her friends gathered together to celebrate her birthday. There are n child(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "n, m, b = map(int, input().split())\np = list(map(int, input().split()))\nchildren = []\nsum_i = [](...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves scheduling multiple children with complex constraints on gaming machines, requ(...TRUNCATED) | 52,013 | 3,250 | ["Okay, let's see. So the problem is about scheduling children's playtimes on gaming machines, possi(...TRUNCATED) | ["To solve this problem, we need to determine the optimal way to rent additional gaming machines to (...TRUNCATED) | ["<think>\nOkay, let's see. So the problem is about scheduling children's playtimes on gaming machin(...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. Hmm, the problem is about scheduling children's play on (...TRUNCATED) | "<think>\nOkay, let's tackle this programming problem. Hmm. So the problem is about scheduling child(...TRUNCATED) | [{"from":"human","value":"Tanya is now five so all her friends gathered together to celebrate her bi(...TRUNCATED) |
null | "Looking at\nArnauld's answer, it seems like this version is not really more difficult than the othe(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem involves parsing nested absolute values and requires a good understanding of string ma(...TRUNCATED) | 41,495 | 2,593 | ["Okay, I need to solve this problem where I have to parse an expression with absolute values repres(...TRUNCATED) | ["To solve this problem, we need to parse an expression containing nested absolute values represente(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to parse an expression with absolute valu(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to parse an expression with absolute valu(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to parse an expression with nested absolut(...TRUNCATED) | [{"from":"human","value":"Looking at\nArnauld's answer, it seems like this version is not really mor(...TRUNCATED) |
3ea13f94bfbcddffcc51ce1d7915c784 | "MTR (subway) stations are common meetup locations in Hong Kong. Alice and Bob are going to meet up (...TRUNCATED) | "<think>\nOkay, I need to find the expected time until Alice and Bob meet. Let me think about how to(...TRUNCATED) | kattis | mit | apps | test | 8 | "import sys\nfrom collections import deque\n\ndef main():\n input = sys.stdin.read().split()\n (...TRUNCATED) | 3575 | nvidia/OpenCodeReasoning | "The problem requires understanding of expected value calculations in a random walk scenario on a gr(...TRUNCATED) | 6,798 | 424 | ["Okay, let's see. So the problem is about Alice and Bob trying to meet in the MTR stations. The sta(...TRUNCATED) | ["To solve this problem, we need to determine the expected time for Alice and Bob to meet at the sam(...TRUNCATED) | ["<think>\nOkay, let's see. So the problem is about Alice and Bob trying to meet in the MTR stations(...TRUNCATED) | ["<think>\nOkay, let's see. So the problem is about Alice and Bob trying to meet at MTR stations in (...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So Alice and Bob are moving between subway sta(...TRUNCATED) | [{"from":"human","value":"MTR (subway) stations are common meetup locations in Hong Kong. Alice and (...TRUNCATED) |
null | "In this challenge, you'll create some programs which behave similarly to genes. When you run one, i(...TRUNCATED) | null | null | null | null | null | 9 | null | null | stackexchange_codegolf | "The problem involves complex concepts related to genetic programming, quines, and random generation(...TRUNCATED) | 60,696 | 3,793 | ["Okay, so I need to create genetic quines. Let's understand the problem first. Each genetic quine i(...TRUNCATED) | ["To solve this problem, we need to create genetic quines that, when run, return one of their two al(...TRUNCATED) | ["<think>\nOkay, so I need to create genetic quines. Let's understand the problem first. Each geneti(...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. So, we need to create genetic quines. Each program has t(...TRUNCATED) | "<think>\nOkay, I need to solve this genetic quine problem. Let me try to understand the requirement(...TRUNCATED) | [{"from":"human","value":"In this challenge, you'll create some programs which behave similarly to g(...TRUNCATED) |
null | "Let's go for a rollercodester ride\nThe objective of this challenge is to create a program that is (...TRUNCATED) | null | null | null | null | null | 9 | null | null | stackexchange_codegolf | "The problem requires in-depth understanding of the execution and scoring mechanisms of recursive pr(...TRUNCATED) | 43,530 | 2,720 | ["Okay, let's see. I need to create a polyglot program that runs through multiple languages, each ti(...TRUNCATED) | ["To solve this problem, we need to create a polyglot program that runs through multiple languages, (...TRUNCATED) | ["<think>\nOkay, let's see. I need to create a polyglot program that runs through multiple languages(...TRUNCATED) | ["<think>\nOkay, let's see. I need to create a polyglot program that runs in multiple languages in s(...TRUNCATED) | "<think>\nOkay, I need to create a polyglot program that runs through multiple languages, each time (...TRUNCATED) | [{"from":"human","value":"Let's go for a rollercodester ride\nThe objective of this challenge is to (...TRUNCATED) |
null | "I need to go to the bank and withdraw some money. I need to withdraw $30, $22 to pay my roommate f(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires understanding of partitions, combinations of denominations, and optimization f(...TRUNCATED) | 34,661 | 2,166 | ["Okay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe task is t(...TRUNCATED) | ["To solve this problem, we need to determine the minimal set of denominations (requests) such that (...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe (...TRUNCATED) | ["<think>\nOkay, let's try to figure out how to solve this problem. Hmm. The task is to find the sma(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So, the task is to write a program that takes (...TRUNCATED) | [{"from":"human","value":"I need to go to the bank and withdraw some money. I need to withdraw $30,(...TRUNCATED) |
13fb6b2c8eff99b3fb29ab4c2cecf8eb | "Connected undirected weighted graph without self-loops and multiple edges is given. Graph contains (...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem where for each edge in a graph, I have t(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom collections import deque\n\nclass DSU:\n def __init__(self, size):\n sel(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem involves knowledge of minimum spanning trees (MST) and requires an advanced understand(...TRUNCATED) | 7,678 | 479 | ["Okay, let's see. The problem is asking for each edge in the graph, find the minimal possible weigh(...TRUNCATED) | ["To solve this problem, we need to determine the minimal possible weight of a spanning tree that in(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is asking for each edge in the graph, find the minimal possi(...TRUNCATED) | ["<think>\nOkay, let's see. We have this problem where we need to find, for each edge in a graph, th(...TRUNCATED) | "<think>\nOkay, let's see. The problem is asking for each edge in the graph, find the minimal possib(...TRUNCATED) | [{"from":"human","value":"Connected undirected weighted graph without self-loops and multiple edges (...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6