Dataset Viewer (First 5GB)
id
stringlengths 32
32
⌀ | instruction_seed
stringlengths 195
28.7k
| output
stringlengths 3.8k
79.3k
⌀ | source
stringclasses 9
values | license
stringclasses 4
values | dataset
stringclasses 4
values | split
stringclasses 3
values | difficulty
int64 6
10
| solution
stringlengths 36
7.95k
⌀ | index
stringclasses 88
values | _source
stringclasses 2
values | difficulty_reasoning
stringlengths 280
886
| __original_row_idx
int64 9
42k
| ms_id
int64 0
3.95k
| reasoning
sequencelengths 16
16
| deepseek_solution
sequencelengths 16
16
| final_reasoning_trace
sequencelengths 16
16
| correct
sequencelengths 16
16
| classifier_reasoning
stringlengths 28
743
| _majority_responses
sequencelengths 2
16
| verified_final_reasoning_trace
stringlengths 1.83k
110k
| conversations
listlengths 2
2
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ceec31d83abb48355eb9f0c8b165cc20
| "Let x be an array of integers x = [x_1, x_2, ..., x_n]. Let's define B(x) as a minimal size of a pa(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe p(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 9 | "MOD = 10**9 + 7\n\ndef main():\n import sys\n input = sys.stdin.read().split()\n idx = 0\n(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves calculating the expected value of a complex function defined over partitions o(...TRUNCATED) | 9,825 | 1,784 | ["Okay, I need to calculate the expected value of B(x) squared, where B(x) is the minimal number of (...TRUNCATED) | ["To solve this problem, we need to calculate the expected value of the square of the minimal partit(...TRUNCATED) | ["<think>\nOkay, I need to calculate the expected value of B(x) squared, where B(x) is the minimal n(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
false,
true,
true,
false,
false,
true,
false,
true,
true,
false
] | "The provided answer contains only one language, which is English. The entire response, including th(...TRUNCATED) | ["<think>\nOkay, I need to calculate the expected value of B(x) squared, where B(x) is the minimal n(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe p(...TRUNCATED) | [{"from":"human","value":"Let x be an array of integers x = [x_1, x_2, ..., x_n]. Let's define B(x) (...TRUNCATED) |
579e37272efb8c212b01c1119b3b3a41
| "Arithmetic coding is a method to represent a message as a real number $x$ such that $0 \\leq x < 1$(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the original message given the enc(...TRUNCATED) |
kattis
|
mit
|
apps
|
test
| 8 | "n = int(input())\nd = int(input())\nbinary_str = input().strip()\n\npA = d / 8.0\n# Convert binary (...TRUNCATED) |
2993
|
nvidia/OpenCodeReasoning
| "The problem involves arithmetic coding, which is a complex encoding algorithm that requires a stron(...TRUNCATED) | 7,174 | 1,340 | ["Okay, let's see. I need to solve this problem where I'm given the length of a message (N), the pro(...TRUNCATED) | ["To solve this problem, we need to reverse-engineer the arithmetic coding process to determine the (...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this problem where I'm given the length of a message (N)(...TRUNCATED) |
[
true,
true,
true,
true,
true,
false,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | "The provided answer only contains one language, which is English. It explains the arithmetic coding(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this problem where I'm given the length of a message (N)(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to reverse-engineer the original message f(...TRUNCATED) | [{"from":"human","value":"Arithmetic coding is a method to represent a message as a real number $x$ (...TRUNCATED) |
null | "The challenge\nThe plastic number is a number related to the golden ratio, with many interesting ma(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem involves deriving the plastic number from the equation ρ³=ρ+1. This requires an unde(...TRUNCATED) | 10,415 | 2,253 | ["Okay, I need to write a program or function that approximates the plastic number ρ where ρ³ = (...TRUNCATED) | ["To solve this problem, we need to approximate the plastic number, which is defined as the real num(...TRUNCATED) | ["<think>\nOkay, I need to write a program or function that approximates the plastic number ρ where(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
false,
true,
true,
true,
true
] | "The question pertains to whether the provided solution includes only one language or mixes multiple(...TRUNCATED) | ["<think>\nOkay, I need to write a program or function that approximates the plastic number ρ where(...TRUNCATED) | "<think>\nOkay, I need to write a program that approximates the plastic number ρ, where ρ³ = ρ +(...TRUNCATED) | [{"from":"human","value":"The challenge\nThe plastic number is a number related to the golden ratio,(...TRUNCATED) |
d56a2dd5fa68ce9b72837ccc6032d211
| "After a wonderful evening in the restaurant the time to go home came. Leha as a true gentlemen sugg(...TRUNCATED) | "<think>\nOkay, let's see. So the problem is about a parking grid where each cell (x, y) has a car w(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "MOD = 10**9 + 7\n\ndef compute(X, Y, K):\n if X < 0 or Y < 0 or K < 0:\n return (0, 0)\n (...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves a matrix of size 10^9 × 10^9, which is extremely large and impractical to han(...TRUNCATED) | 27,393 | 801 | ["Okay, so I've got this programming problem to solve, and I'm trying to figure out how to approach (...TRUNCATED) | ["To solve this problem, we need to efficiently compute the sum of car numbers in a specific submatr(...TRUNCATED) | ["<think>\nOkay, so I've got this programming problem to solve, and I'm trying to figure out how to (...TRUNCATED) |
[
false,
false,
false,
true,
false,
true,
true,
false,
false,
false,
true,
true,
true,
true,
false,
false
] | "The provided text contains a mix of natural language and technical notation (e.g., mathematical for(...TRUNCATED) | ["<think>\nOkay, let's try to understand this problem. So, the parking is a huge matrix where each c(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let me read the problem statement carefull(...TRUNCATED) | [{"from":"human","value":"After a wonderful evening in the restaurant the time to go home came. Leha(...TRUNCATED) |
4365a1d6a43952c26c9c2cabe1ef3c9f
| "The clique problem is one of the most well-known NP-complete problems. Under some simplification it(...TRUNCATED) | "<think>\nOkay, so I need to find the maximum clique in a graph where the vertices are points on a l(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 9 | "n = int(input())\nintervals = []\nfor _ in range(n):\n x, w = map(int, input().split())\n lef(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves finding the maximum clique in a modified NP-complete clique problem where edge(...TRUNCATED) | 13,169 | 165 | ["Okay, let's see. We need to find the maximum clique in a graph where edges connect points if the d(...TRUNCATED) | ["To solve this problem, we need to determine the size of the maximum clique in a graph formed by po(...TRUNCATED) | ["<think>\nOkay, let's see. We need to find the maximum clique in a graph where edges connect points(...TRUNCATED) |
[
true,
true,
true,
false,
true,
true,
true,
true,
true,
true,
true,
false,
true,
true,
true,
true
] |
The provided answer is entirely in English, containing no other languages.
| ["<think>\nOkay, let's see. We need to find the maximum clique in a graph where edges connect points(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the maximum clique in a graph formed by certain po(...TRUNCATED) | [{"from":"human","value":"The clique problem is one of the most well-known NP-complete problems. Und(...TRUNCATED) |
null | "Write a program that takes two lists of strings and generates a javascript regex that fully matches(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem requires generating a regular expression that correctly matches an explicit set of stri(...TRUNCATED) | 24,142 | 2,769 | ["Okay, I need to write a program that generates a JavaScript regex that matches all strings in the (...TRUNCATED) | ["To solve this problem, we need to generate a JavaScript regular expression (regex) that matches al(...TRUNCATED) | ["<think>\nOkay, I need to write a program that generates a JavaScript regex that matches all string(...TRUNCATED) |
[
false,
true,
false,
true,
true,
true,
true,
false,
true,
false,
true,
true,
true,
true,
false,
false
] |
The provided answer is written in English and thereby consists of only one language.
| ["<think>\nOkay, I need to write a Python program that generates a JavaScript regex. The regex shoul(...TRUNCATED) | "<think>\nOkay, I need to write a program that generates a JavaScript regex which matches all string(...TRUNCATED) | [{"from":"human","value":"Write a program that takes two lists of strings and generates a javascript(...TRUNCATED) |
c6560a84bf8459c9f36475507b84fb2a
| "VK gave a problem to Chef, but Chef is too lazy, so he asked you to solve the problem for him. The (...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. The task is to find the number of(...TRUNCATED) |
codechef
|
mit
|
apps
|
train
| 8 | "MOD = 10**9 + 7\n\nimport sys\n\ndef main():\n input = sys.stdin.read\n data = input().split((...TRUNCATED) |
1346
|
nvidia/OpenCodeReasoning
| "The problem requires a deep understanding of combinatorial number generation based on specified con(...TRUNCATED) | 8,846 | 1,694 | ["Okay, let's try to solve this problem. So the problem is to find the number of N-digit integers wh(...TRUNCATED) | ["To solve this problem, we need to determine the number of N-digit positive integers that have a sp(...TRUNCATED) | ["<think>\nOkay, let's try to solve this problem. So the problem is to find the number of N-digit in(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
false,
true
] | "The provided answer contains only one language, which is English. All the text, including the quest(...TRUNCATED) | ["<think>\nOkay, let's try to solve this problem. So the problem is to find the number of N-digit in(...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. So the problem is to find the number of N-digit int(...TRUNCATED) | [{"from":"human","value":"VK gave a problem to Chef, but Chef is too lazy, so he asked you to solve (...TRUNCATED) |
null | "In this challenge you will write a function that takes a list (ordered set) containing real numbers(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem requires deep mathematical insights and complex algorithmic implementations, particula(...TRUNCATED) | 21,458 | 1,021 | ["Okay, I need to write a Python function that takes a list of real numbers and computes this f(x) b(...TRUNCATED) | ["To solve this problem, we need to compute a function based on the length of the input list and its(...TRUNCATED) | ["<think>\nOkay, I need to write a Python function that takes a list of real numbers and computes th(...TRUNCATED) |
[
true,
true,
false,
true,
false,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | "The provided text and solution is written entirely in English without any presence of another langu(...TRUNCATED) | ["<think>\nOkay, I need to write a Python function that takes a list of real numbers and computes th(...TRUNCATED) | "<think>\nOkay, let's see. I need to write a Python function that takes a list of real numbers and c(...TRUNCATED) | [{"from":"human","value":"In this challenge you will write a function that takes a list (ordered set(...TRUNCATED) |
ed2581df44d0eb17ade7243ab1135a15
| "Spiders are Om Nom's old enemies. They love eating candies as much as he does and that's why they k(...TRUNCATED) | "<think>\nOkay, let's see. I have this programming problem to solve, and I need to think through how(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import sys\nfrom collections import defaultdict\n\ndef main():\n sys.setrecursionlimit(1 << 25)\(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves trees and optimal paths, necessitating a strong understanding of graph theory (...TRUNCATED) | 27,853 | 1,552 | ["Okay, let's try to tackle this problem. Hmm. The problem statement is a bit complex, but let's bre(...TRUNCATED) | ["To solve this problem, we need to determine the maximum total length of ropes that spiders can cov(...TRUNCATED) | ["<think>\nOkay, let's try to tackle this problem. Hmm. The problem statement is a bit complex, but (...TRUNCATED) |
[
true,
true,
true,
false,
true,
false,
false,
true,
false,
true,
true,
true,
false,
true,
true,
false
] |
The provided answer is in English only. No other languages are used.
| ["<think>\nOkay, let's try to tackle this problem. Hmm. The problem statement is a bit complex, but (...TRUNCATED) | "<think>\nOkay, let's tackle this programming problem. So the problem is about trees and some querie(...TRUNCATED) | [{"from":"human","value":"Spiders are Om Nom's old enemies. They love eating candies as much as he d(...TRUNCATED) |
null | "A constructible \\$n\\$-gon is a regular polygon with n sides that you can construct with only a co(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires knowledge of number theory, specifically the properties of Fermat primes and t(...TRUNCATED) | 3,984 | 673 | ["Okay, I need to solve this problem where I have to determine if a given integer n>2 is a construct(...TRUNCATED) | ["To solve this problem, we need to determine if a given integer \\( n > 2 \\) corresponds to a cons(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to determine if a given integer n>2 is a (...TRUNCATED) |
[
false,
false,
false,
true,
true,
false,
true,
false,
true,
false,
true,
false,
false,
false,
false,
false
] | "The provided answer includes a significant amount of text in English, outlining the logic and reaso(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to determine if a given integer n > 2 is (...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to determine if a given integer n > 2 is a(...TRUNCATED) | [{"from":"human","value":"A constructible \\$n\\$-gon is a regular polygon with n sides that you can(...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 21