Dataset Viewer
id
stringlengths 32
32
⌀ | instruction_seed
stringlengths 80
53.1k
| output
stringlengths 3.8k
79.3k
⌀ | source
stringclasses 10
values | license
stringclasses 4
values | dataset
stringclasses 4
values | split
stringclasses 3
values | difficulty
int64 6
10
| solution
stringlengths 0
12.5k
⌀ | index
stringclasses 148
values | _source
stringclasses 2
values | difficulty_reasoning
stringlengths 256
886
| __original_row_idx
int64 1
63.2k
| ms_id
int64 0
3.95k
| reasoning
stringlengths 1.09k
110k
| deepseek_solution
stringlengths 0
32.2k
| final_reasoning_trace
stringlengths 1.58k
119k
| conversations
listlengths 2
2
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
3f3699897a4fbbcbe45182d8b0484347
| "Jane lives in N-dimensional space. Her house is a N-dimensional hypercube, with the centre located(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding a Hamiltonian path in a hypercube graph wher(...TRUNCATED) |
codechef
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import sys\n\ndef gray_to_binary(gray):\n binary = gray\n mask = gray >> 1\n while mask !=(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem involves navigating an N-dimensional hypercube with specific constraints on distances,(...TRUNCATED) | 5,797 | 362 | "Okay, let's tackle this problem. Hmm, the problem is about finding a Hamiltonian path in a hypercub(...TRUNCATED) | "To solve this problem, we need to determine if Jane can visit all rooms in her N-dimensional hyperc(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the problem is about finding a Hamiltonian path in a(...TRUNCATED) | [{"from":"human","value":"Jane lives in N-dimensional space. Her house is a N-dimensional hypercube(...TRUNCATED) |
null | "Goal\nThe goal of this challenge is to write code that will execute once and only once. This means(...TRUNCATED) | null | null | null | null | null | 9 | null | null |
stackexchange_codegolf
| "The problem requires extensive knowledge of advanced programming concepts, such as system behavior (...TRUNCATED) | 56,206 | 3,512 | "Okay, I need to create a code snippet that runs once and only once. The challenge is that after it (...TRUNCATED) | "To solve this problem, we need to create a script that runs once and only once between system reboo(...TRUNCATED) | "<think>\nOkay, I need to create a code snippet that runs once and only once. The challenge is that (...TRUNCATED) | [{"from":"human","value":"Goal\nThe goal of this challenge is to write code that will execute once a(...TRUNCATED) |
e87b2a00b6a280aa3c7b1b3f34c74f6a
| "Lunar rover finally reached planet X. After landing, he met an obstacle, that contains permutation (...TRUNCATED) | "<think>\nOkay, I need to find the maximum possible time the robot can take to turn a permutation in(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "def main():\n import sys\n input = sys.stdin.read().split()\n t = int(input[0])\n idx =(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires a deep understanding of permutations and a clear analysis of how different rea(...TRUNCATED) | 22,906 | 1,431 | "Okay, so I've got this programming problem to solve, and I need to think through it carefully. Let (...TRUNCATED) | "To solve this problem, we need to determine the maximum possible time the robot will take to transf(...TRUNCATED) | "<think>\nOkay, so I've got this programming problem to solve, and I need to think through it carefu(...TRUNCATED) | [{"from":"human","value":"Lunar rover finally reached planet X. After landing, he met an obstacle, t(...TRUNCATED) |
null | "The Setup\nConsider an oddly-shaped box containing 29 numbered cells as shown in Fig. 1 below.\n\nI(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem requires a deep understanding of simulation and multiple interacting rules regarding g(...TRUNCATED) | 50,546 | 3,159 | "Okay, I need to solve this problem. Let me read the problem statement carefully and understand what(...TRUNCATED) | "To solve this problem, we need to simulate the manipulations (rotations and stot moves) on a box co(...TRUNCATED) | "<think>\nOkay, I need to solve this problem. Let me read the problem statement carefully and unders(...TRUNCATED) | [{"from":"human","value":"The Setup\nConsider an oddly-shaped box containing 29 numbered cells as sh(...TRUNCATED) |
8c8742f2e4881d48ac10364ba8fdc8a3
| "This is an interactive problem.\n\nWe have hidden an integer 1 ≤ X ≤ 10^{9}. You don't have to (...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem where I have to guess the number of divi(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 9 | "import sys\n\nfirst_20_primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem involves understanding the number of divisors of a number without directly knowing the(...TRUNCATED) | 52,705 | 3,294 | "Okay, so I've got this programming problem to solve. Let's see what it's about. The task is to find(...TRUNCATED) | "To solve this problem, we need to determine the number of divisors of a hidden integer \\( X \\) us(...TRUNCATED) | "<think>\nOkay, so I've got this programming problem to solve. Let's see what it's about. The task i(...TRUNCATED) | [{"from":"human","value":"This is an interactive problem.\n\nWe have hidden an integer 1 ≤ X ≤ 1(...TRUNCATED) |
null | "Every odd degree polynomial has at least one real root. However this root does not have to be a rat(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem requires a solid understanding of polynomial functions, rational approximations, and p(...TRUNCATED) | 63,022 | 3,938 | "Okay, I need to solve this problem where given an odd-degree polynomial with integer coefficients, (...TRUNCATED) | "To solve this problem, we need to generate a sequence of rational numbers that approximates a real (...TRUNCATED) | "<think>\nOkay, I need to solve this problem where given an odd-degree polynomial with integer coeff(...TRUNCATED) | [{"from":"human","value":"Every odd degree polynomial has at least one real root. However this root (...TRUNCATED) |
null | "This should be easy: given an arbitrary string, your program will give it a name.\nRequirements\nYo(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "This problem presents a non-trivial challenge due to its requirements for a simplified hash functio(...TRUNCATED) | 32,085 | 2,005 | "Okay, I need to solve this problem. Let's start by understanding the requirements. The task is to c(...TRUNCATED) | "To solve this problem, we need to create a function that generates a unique \"name\" for an arbitra(...TRUNCATED) | "<think>\nOkay, I need to solve this problem. Let's start by understanding the requirements. The tas(...TRUNCATED) | [{"from":"human","value":"This should be easy: given an arbitrary string, your program will give it (...TRUNCATED) |
null | "Leaderboard\n 154 Calculator\n 144 Taxman\n 138 Statistician\n 137 Solver\n 137 RandoAggroLawy(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem requires deep understanding of game theory, strategy development, and algorithmic imple(...TRUNCATED) | 53,525 | 3,345 | "Okay, I need to write a program that plays Coup based on the rules provided. Let's start by underst(...TRUNCATED) | "To solve this problem, we need to create a bot that can play the game of Coup effectively by making(...TRUNCATED) | "<think>\nOkay, I need to write a program that plays Coup based on the rules provided. Let's start b(...TRUNCATED) | [{"from":"human","value":"Leaderboard\n 154 Calculator\n 144 Taxman\n 138 Statistician\n 137 Sol(...TRUNCATED) |
null | "Background\nHamiltonian circuit problem is a decision problem which asks whether a given graph has (...TRUNCATED) | null | null | null | null | null | 9 | null | null |
stackexchange_codegolf
| "The problem revolves around converting a general undirected graph to a grid graph that retains the (...TRUNCATED) | 48,809 | 3,050 | "Okay, so I need to find a way to convert any general undirected graph into a grid graph such that t(...TRUNCATED) | "To solve this problem, we need to convert a general undirected graph into a grid graph such that th(...TRUNCATED) | "<think>\nOkay, so I need to find a way to convert any general undirected graph into a grid graph su(...TRUNCATED) | [{"from":"human","value":"Background\nHamiltonian circuit problem is a decision problem which asks w(...TRUNCATED) |
8f7cee8d26b9b4c82f797f2388f00ca3
| "A permutation of length N is an array of N integers A = [A_{1}, A_{2}, \\dots, A_{N}] such that eve(...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. So the task is to find the expected value of the fu(...TRUNCATED) |
codechef
|
apache-2.0
|
taco
|
train
| 8 | "MOD = 10**9 + 7\ninv12 = pow(12, MOD - 2, MOD)\n\nT = int(input())\nfor _ in range(T):\n N = int(...TRUNCATED) |
8448
|
nvidia/OpenCodeReasoning
| "The problem requires deep mathematical insights to compute the expected value of a function over al(...TRUNCATED) | 37,065 | 2,316 | "Okay, let's try to solve this problem. The task is to find the expected value of the function F(A) (...TRUNCATED) | "To solve this problem, we need to compute the expected value of the function \\( F(A) \\) over all (...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. The task is to find the expected value of the funct(...TRUNCATED) | [{"from":"human","value":"A permutation of length N is an array of N integers A = [A_{1}, A_{2}, \\d(...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 23