Dataset Viewer (First 5GB)
Search is not available for this dataset
id
stringlengths 32
32
⌀ | instruction_seed
stringlengths 187
48.6k
| output
stringlengths 3.8k
71.6k
⌀ | source
stringclasses 10
values | license
stringclasses 4
values | dataset
stringclasses 4
values | split
stringclasses 3
values | difficulty
int64 6
10
| solution
stringlengths 8
7.89k
⌀ | index
stringclasses 80
values | _source
stringclasses 2
values | difficulty_reasoning
stringlengths 286
792
| __original_row_idx
int64 131
63.1k
| ms_id
int64 8
3.94k
| reasoning
sequencelengths 16
16
| deepseek_solution
sequencelengths 16
16
| final_reasoning_trace
sequencelengths 16
16
| correct
sequencelengths 16
16
| _majority_responses
sequencelengths 1
16
| verified_final_reasoning_trace
stringlengths 1.99k
98.7k
| conversations
listlengths 2
2
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "Inspired by this stack of little statues that are currently on my desk at work, given to me by my c(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "This problem requires a solid understanding of data structures and potentially advanced algorithms (...TRUNCATED) | 31,630 | 1,976 | ["Okay, I need to solve this problem where I have to determine if a set of statues can be stacked su(...TRUNCATED) | ["To solve this problem, we need to determine if a list of statues can be stacked such that each sta(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to determine if a set of statues can be s(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, I need to solve this problem where I have to determine if a set of statues can be s(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to determine if a given list of statues ca(...TRUNCATED) | [{"from":"human","value":"Inspired by this stack of little statues that are currently on my desk at (...TRUNCATED) |
7edd181eac289f22d3543b1e4567c867
| "This is an interactive problem.\n\nKochiya Sanae is playing with magnets. Realizing that some of th(...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to find all the demagnetized magnets (t(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import sys\n\ndef main():\n t = int(sys.stdin.readline())\n for _ in range(t):\n n = i(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem requires a good understanding of interactive programming, constraint handling, and eff(...TRUNCATED) | 52,339 | 3,271 | ["Okay, let's tackle this problem. So, we have to find all the demagnetized magnets (the '-') in a s(...TRUNCATED) | ["To solve this problem, we need to identify all demagnetized magnets (denoted as '-') using a machi(...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. So, we have to find all the demagnetized magnets (the '-(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's tackle this problem. So, we have to find all the demagnetized magnets (the '-(...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. So the task is to find all the demagnetized magnets(...TRUNCATED) | [{"from":"human","value":"This is an interactive problem.\n\nKochiya Sanae is playing with magnets. (...TRUNCATED) |
null | "When writing a programm 1 missing character can ruin everything,\nwouldn't it be great if the progr(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem requires a deep understanding of programming concepts and creative problem-solving. Co(...TRUNCATED) | 33,091 | 2,068 | ["Okay, I need to create a program that normally outputs nothing. But if exactly one character is re(...TRUNCATED) | ["To solve this problem, we need to create a program that outputs nothing when unmodified. However, (...TRUNCATED) | ["<think>\nOkay, I need to create a program that normally outputs nothing. But if exactly one charac(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, I need to create a program that normally outputs nothing. But if exactly one charac(...TRUNCATED) | "<think>\nOkay, I need to create a program that does nothing when run as is. But if any single chara(...TRUNCATED) | [{"from":"human","value":"When writing a programm 1 missing character can ruin everything,\nwouldn't(...TRUNCATED) |
null | "A Russian nesting doll, more commonly known as a Matryoshka doll, is a doll which contains a smalle(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "This problem involves generating a self-replicating program based on the concept of Quines and embe(...TRUNCATED) | 17,086 | 1,067 | ["Okay, I need to solve this Russian nesting doll problem. Let me try to understand what's required (...TRUNCATED) | ["To solve this problem, we need to create a self-replicating program that reduces its nesting level(...TRUNCATED) | ["<think>\nOkay, I need to solve this Russian nesting doll problem. Let me try to understand what's (...TRUNCATED) |
[
true,
true,
true,
true,
false,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, I need to solve this Russian nesting doll problem. Let me try to understand what's (...TRUNCATED) | "<think>\nOkay, I need to solve this problem where the program has to contain itself N times and pri(...TRUNCATED) | [{"from":"human","value":"A Russian nesting doll, more commonly known as a Matryoshka doll, is a dol(...TRUNCATED) |
5ae9927830cfb792a23b75e1075e6d19
| "You are given an undirected connected graph G consisting of n vertexes and n edges. G contains no s(...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. So, the problem is about handling a graph and some (...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import sys\nfrom sys import stdin\nfrom collections import defaultdict, deque\n\nsys.setrecursionli(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires a solid understanding of graph theory, particularly the concept of shortest pa(...TRUNCATED) | 19,776 | 1,236 | ["Okay, let's see. We have this problem where we need to process multiple queries on a graph. The gr(...TRUNCATED) | ["To solve this problem, we need to determine the number of connected components in a graph after ea(...TRUNCATED) | ["<think>\nOkay, let's see. We have this problem where we need to process multiple queries on a grap(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. We have this problem where we need to process multiple queries on a grap(...TRUNCATED) | "<think>\nOkay, let's tackle this programming problem. Hmm, the problem statement says we have an un(...TRUNCATED) | [{"from":"human","value":"You are given an undirected connected graph G consisting of n vertexes and(...TRUNCATED) |
null | "Robbers' Thread\nYour challenge is to find an existing challenge, and implement it in a way such th(...TRUNCATED) | null | null | null | null | null | 9 | null | null |
stackexchange_codegolf
| "The problem involves crafting a challenge that not only meets specific criteria but also consistent(...TRUNCATED) | 28,835 | 1,802 | ["Okay, I need to find a challenge that meets all the specified criteria. Let me start by recalling (...TRUNCATED) | ["**Challenge**: [Is this number a prime?](https://codegolf.stackexchange.com/questions/57617/is-thi(...TRUNCATED) | ["<think>\nOkay, I need to find a challenge that meets all the specified criteria. Let me start by r(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, I need to find a challenge that meets all the specified criteria. Let me start by r(...TRUNCATED) | "<think>\nOkay, I need to find a challenge that meets all the given criteria: code-golf, open, not l(...TRUNCATED) | [{"from":"human","value":"Robbers' Thread\nYour challenge is to find an existing challenge, and impl(...TRUNCATED) |
b81076021da29c8a5f96fe8f9ec13dee
| "You're given a tree consisting of n nodes. Every node u has a weight a_u. You want to choose an int(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where I have a tree with nodes that have wei(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import sys\nfrom sys import stdin\nfrom collections import deque\n\ndef main():\n sys.setrecursi(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem involves a combination of graph theory (specifically trees) and optimization, as it re(...TRUNCATED) | 43,464 | 2,716 | ["Okay, let's see. I need to solve this programming problem. Let's read the problem statement carefu(...TRUNCATED) | ["To solve this problem, we need to select k connected components from a tree such that the sum of t(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this programming problem. Let's read the problem stateme(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
false,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. I need to solve this programming problem. Let's read the problem stateme(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about selecting k connected components in a tree to maximi(...TRUNCATED) | [{"from":"human","value":"You're given a tree consisting of n nodes. Every node u has a weight a_u. (...TRUNCATED) |
becbffe9c53613a96a72a08b93b03dc1
| "Barney lives in NYC. NYC has infinite number of intersections numbered with positive integers start(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the problem is about roads between intersections in (...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "from collections import defaultdict\n\nroad_fees = defaultdict(int)\n\ndef get_lca(u, v):\n whil(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves maintaining and querying a tree-like structure for shortest paths, along with (...TRUNCATED) | 46,410 | 2,900 | ["Okay, let's see. So the problem is about handling events on a binary tree structure where roads co(...TRUNCATED) | ["To solve this problem, we need to handle two types of events on a binary tree structure where each(...TRUNCATED) | ["<think>\nOkay, let's see. So the problem is about handling events on a binary tree structure where(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. So the problem is about handling events on a binary tree structure where(...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. Hmm, the problem is about a tree structure where ea(...TRUNCATED) | [{"from":"human","value":"Barney lives in NYC. NYC has infinite number of intersections numbered wit(...TRUNCATED) |
null | "Given an integer \\$ n \\ge 2 \\$, you need to calculate \\$ \\lfloor n \\log_2(n) \\rfloor \\$, as(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires understanding logarithmic calculations and careful handling of floating-point (...TRUNCATED) | 43,145 | 2,696 | ["Okay, so I need to find the floor of n times log base 2 of n. But the problem is that using regula(...TRUNCATED) | ["To solve this problem, we need to compute the floor value of \\( n \\log_2(n) \\) for a given inte(...TRUNCATED) | ["<think>\nOkay, so I need to find the floor of n times log base 2 of n. But the problem is that usi(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
false,
true,
true,
true
] | ["<think>\nOkay, so I need to find the floor of n times log base 2 of n. But the problem is that usi(...TRUNCATED) | "<think>\nOkay, I need to find a way to compute floor(n log₂ n) accurately for very large n withou(...TRUNCATED) | [{"from":"human","value":"Given an integer \\$ n \\ge 2 \\$, you need to calculate \\$ \\lfloor n \\(...TRUNCATED) |
5bf0b31ecc4fdf84586bfbe5132422f7
| "The Great Mushroom King descended to the dwarves, but not everyone managed to see him. Only the few(...TRUNCATED) | "<think>\nOkay, let's see. So the problem is to compute the LCM of a sequence of numbers generated b(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import sys\nimport math\n\ndef is_power_of_two(n):\n return (n & (n - 1)) == 0 and n != 0\n\ndef(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem involves calculating the least common multiple (LCM) over a potentially large range of(...TRUNCATED) | 25,973 | 1,623 | ["Okay, let's try to tackle this problem. Hmm, the problem says that for each visit, we need to comp(...TRUNCATED) | ["To solve this problem, we need to determine the number of dwarves who can see the Great Mushroom K(...TRUNCATED) | ["<think>\nOkay, let's try to tackle this problem. Hmm, the problem says that for each visit, we nee(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's try to tackle this problem. Hmm, the problem says that for each visit, we nee(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe p(...TRUNCATED) | [{"from":"human","value":"The Great Mushroom King descended to the dwarves, but not everyone managed(...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 78