Dataset Viewer
id
stringlengths 32
32
⌀ | instruction_seed
stringlengths 187
11.4k
| output
stringlengths 5.1k
72.1k
⌀ | source
stringclasses 8
values | license
stringclasses 4
values | dataset
stringclasses 4
values | split
stringclasses 3
values | difficulty
int64 6
10
| solution
stringlengths 25
5.75k
⌀ | index
stringclasses 12
values | _source
stringclasses 2
values | difficulty_reasoning
stringlengths 306
798
| __original_row_idx
int64 428
40.7k
| ms_id
int64 46
3.92k
| reasoning
sequencelengths 16
16
| deepseek_solution
sequencelengths 16
16
| final_reasoning_trace
sequencelengths 16
16
| correct
sequencelengths 16
16
| classifier_reasoning
stringlengths 43
407
| _majority_responses
sequencelengths 4
16
| verified_final_reasoning_trace
stringlengths 1.63k
90.1k
| conversations
listlengths 2
2
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "The generalised harmonic number of order \\$m\\$ of \\$n\\$ is\n$$H_{n,m} = \\sum_{k=1}^n \\frac 1 (...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem requires knowledge of harmonic numbers, which involve summing series with inverse power(...TRUNCATED) | 24,587 | 3,454 | ["Okay, I need to solve this problem where I have to compute the generalized harmonic number H_{n,m}(...TRUNCATED) | ["To solve this problem, we need to compute the generalized harmonic number \\( H_{n,m} \\) as a red(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to compute the generalized harmonic numbe(...TRUNCATED) |
[
true,
true,
true,
true,
false,
true,
true,
true,
false,
true,
false,
true,
false,
true,
true,
false
] | "The provided answer is entirely in English, with a mathematical context that uses standard mathemat(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to compute the generalized harmonic numbe(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to compute the generalized harmonic number(...TRUNCATED) | [{"from":"human","value":"The generalised harmonic number of order \\$m\\$ of \\$n\\$ is\n$$H_{n,m} (...TRUNCATED) |
1e06555eab76bb9e3e58971a092661c5
| "While Grisha was celebrating New Year with Ded Moroz, Misha gifted Sasha a small rectangular pond o(...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
| 8 | "import heapq\n\nn, m, r, k = map(int, input().split())\n\ndef compute_counts(length, r_param):\n (...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves placing fishes in a pond to maximize the expected number of caught fishes, whi(...TRUNCATED) | 25,799 | 2,351 | ["Okay, let's try to figure out this problem. So, the task is to place k fishes in an n×m grid such(...TRUNCATED) | ["To solve this problem, we need to maximize the expected number of fishes caught by a randomly plac(...TRUNCATED) | ["<think>\nOkay, let's try to figure out this problem. So, the task is to place k fishes in an n×m (...TRUNCATED) |
[
true,
true,
false,
true,
true,
true,
true,
true,
false,
true,
false,
true,
true,
true,
false,
true
] | "The answer provided is exclusively in English, without any code snippets or phrases in other langua(...TRUNCATED) | ["<think>\nOkay, let's try to figure out this problem. So, the task is to place k fishes in an n×m (...TRUNCATED) | "<think>\nOkay, let's see. The problem is about placing k fishes in an n x m grid such that the expe(...TRUNCATED) | [{"from":"human","value":"While Grisha was celebrating New Year with Ded Moroz, Misha gifted Sasha a(...TRUNCATED) |
null | "The Challenge\nYou must calculate pi in the shortest length you can. Any language is welcome to joi(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires participants to compute pi to a specific precision using any method they choos(...TRUNCATED) | 17,298 | 3,048 | ["Okay, I need to find the shortest way to calculate Pi in any programming language. The goal is to (...TRUNCATED) | ["To calculate π in the shortest code possible, using a language with a built-in π constant achiev(...TRUNCATED) | ["<think>\nOkay, I need to find the shortest way to calculate Pi in any programming language. The go(...TRUNCATED) |
[
true,
true,
false,
true,
true,
true,
true,
true,
true,
true,
false,
true,
true,
false,
true,
true
] |
The provided response is written entirely in English, thus containing only one language.
| ["<think>\nOkay, I need to find the shortest way to calculate Pi in any programming language. The go(...TRUNCATED) | "<think>\nOkay, I need to calculate pi in the shortest possible code. The challenge is to make the c(...TRUNCATED) | [{"from":"human","value":"The Challenge\nYou must calculate pi in the shortest length you can. Any l(...TRUNCATED) |
5c64fcaa9b10122163712cfff3d4ff5a
| "One of the most difficult things about going on a holiday is making sure your luggage does not exce(...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. Hmm. The problem is about reconst(...TRUNCATED) |
kattis
|
mit
|
apps
|
test
| 8 | "n = int(input())\ns = []\nfor _ in range(2**n):\n w = int(input())\n s.append(w)\ns.sort()\n\(...TRUNCATED) |
2725
|
nvidia/OpenCodeReasoning
| "This problem mixes insight from combinatorial optimization (specifically the Knapsack problem) and (...TRUNCATED) | 25,119 | 1,062 | ["Okay, let's see. The problem is to reconstruct the original list of item weights given the multise(...TRUNCATED) | ["To solve this problem, we need to reconstruct the original list of item weights from the given mul(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to reconstruct the original list of item weights given th(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
false,
false,
false,
false,
true,
true,
false,
true,
true,
true
] |
The provided answer is written entirely in English.
| ["<think>\nOkay, let's see. The problem is to reconstruct the original list of item weights given th(...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. So the problem is, given all subs(...TRUNCATED) | [{"from":"human","value":"One of the most difficult things about going on a holiday is making sure y(...TRUNCATED) |
c99196c35c8885f8593667e394e54edd
| "On a plane are n points (xi, yi) with integer coordinates between 0 and 106. The distance between t(...TRUNCATED) | "<think>\nOkay, let's see. I need to find a Hamiltonian path (a permutation of all points) such that(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "n = int(input())\npoints = []\nfor i in range(n):\n x, y = map(int, input().split())\n points(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires finding a Hamiltonian path based on Manhattan distance constraints which invol(...TRUNCATED) | 20,552 | 3,721 | ["Okay, I need to find a Hamiltonian path for a set of n points such that the total Manhattan distan(...TRUNCATED) | ["To solve this problem, we need to find a Hamiltonian path for a set of points such that the total (...TRUNCATED) | ["<think>\nOkay, I need to find a Hamiltonian path for a set of n points such that the total Manhatt(...TRUNCATED) |
[
true,
true,
false,
true,
true,
true,
true,
true,
true,
false,
true,
true,
true,
true,
true,
true
] |
The provided answer is in English, and there are no indications of other languages being used.
| ["<think>\nOkay, I need to find a Hamiltonian path for a set of n points such that the total Manhatt(...TRUNCATED) | "<think>\nOkay, I need to find a Hamiltonian path for a set of points such that the total Manhattan (...TRUNCATED) | [{"from":"human","value":"On a plane are n points (xi, yi) with integer coordinates between 0 and 10(...TRUNCATED) |
5dc2e6113499ab71febec0f23d5d4cc7
| "You are given an undirected graph where each edge has one of two colors: black or red.\n\nYour task(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where I have to assign real numbers to nodes(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import sys\nfrom collections import deque\nimport math\n\ndef main():\n input = sys.stdin.read()(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves assigning real numbers to nodes in an undirected graph subject to constraints (...TRUNCATED) | 12,934 | 3,623 | ["Okay, let's see. I have this problem where I need to assign real numbers to nodes in an undirected(...TRUNCATED) | ["To solve this problem, we need to assign real numbers to each node in an undirected graph such tha(...TRUNCATED) | ["<think>\nOkay, let's see. I have this problem where I need to assign real numbers to nodes in an u(...TRUNCATED) |
[
true,
true,
true,
true,
false,
true,
true,
true,
false,
true,
false,
true,
true,
false,
true,
true
] |
The provided answer is entirely in English, which indicates that it only contains one language.
| ["<think>\nOkay, let's see. I have this problem where I need to assign real numbers to nodes in an u(...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. The problem requires assigning re(...TRUNCATED) | [{"from":"human","value":"You are given an undirected graph where each edge has one of two colors: b(...TRUNCATED) |
8bcf91d6a7051ab2a388e0d4b4e15dbc
| "Tavas lives in Tavaspolis. Tavaspolis has n cities numbered from 1 to n connected by n - 1 bidirect(...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 sys\nfrom collections import deque\n\nsys.setrecursionlimit(1 << 25)\n\ndef main():\n n, (...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves several concepts beyond basic implementation, including constructing paths in (...TRUNCATED) | 24,589 | 3,303 | ["Okay, so I've got this programming problem to solve, and I need to figure out the best way to appr(...TRUNCATED) | ["To solve this problem, we need to compute the \"goodness\" of a binary string formed based on the (...TRUNCATED) | ["<think>\nOkay, so I've got this programming problem to solve, and I need to figure out the best wa(...TRUNCATED) |
[
true,
true,
false,
true,
true,
true,
true,
true,
false,
false,
false,
true,
false,
true,
true,
true
] | "The provided answer is in English, as it contains complete and coherent sentences, specific program(...TRUNCATED) | ["<think>\nOkay, so I've got this programming problem to solve, and I need to figure out the best wa(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem. Let me try to understand what's(...TRUNCATED) | [{"from":"human","value":"Tavas lives in Tavaspolis. Tavaspolis has n cities numbered from 1 to n co(...TRUNCATED) |
null | "The challenge is twofold:\nMake a program that builds a door. ASCII, HTML or otherwise\nMake the do(...TRUNCATED) | null | null | null | null | null | 9 | null | null |
stackexchange_codegolf
| "The problem involves building an interactive ASCII or HTML door, which is a unique challenge. The r(...TRUNCATED) | 24,100 | 2,665 | ["Okay, I need to create a program that builds a functional door. The user wants it to be interactiv(...TRUNCATED) | ["Here's a concise Python program that creates an interactive ASCII door, toggling between open and (...TRUNCATED) | ["<think>\nOkay, I need to create a program that builds a functional door. The user wants it to be i(...TRUNCATED) |
[
true,
true,
true,
true,
true,
false,
true,
true,
false,
true,
false,
false,
true,
true,
true,
true
] | "The provided answer consists solely of English language content, with no other languages mixed in. (...TRUNCATED) | ["<think>\nOkay, I need to create a program that builds a functional door. The user wants it to be i(...TRUNCATED) | "<think>\nOkay, I need to create a program that builds a functional door. Let's start by understandi(...TRUNCATED) | [{"from":"human","value":"The challenge is twofold:\nMake a program that builds a door. ASCII, HTML (...TRUNCATED) |
null | "Background\nShadow transform of a 0-based integer sequence \\$a(n)\\$ is another 0-based integer se(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem requires a deep understanding of combinatorial sequences and properties of divisibility(...TRUNCATED) | 4,548 | 652 | ["Okay, let's tackle this problem. We need to compute the number of distinct shadow transforms of le(...TRUNCATED) | ["To solve this problem, we need to compute the number of distinct shadow transforms of a given leng(...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. We need to compute the number of distinct shadow transfo(...TRUNCATED) |
[
true,
true,
true,
false,
false,
true,
true,
false,
true,
true,
true,
true,
false,
false,
false,
true
] |
The provided answer is written entirely in English, thus it only contains one language.
| ["<think>\nOkay, let's tackle this problem. We need to compute the number of distinct shadow transfo(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. We need to compute the number of distinct shadow transfor(...TRUNCATED) | [{"from":"human","value":"Background\nShadow transform of a 0-based integer sequence \\$a(n)\\$ is a(...TRUNCATED) |
a9b4f4dee1ad302b047209c9f0ad6aec
| "Once Vasya and Petya assembled a figure of m cubes, each of them is associated with a number betwee(...TRUNCATED) | "<think>\nOkay, let's see. We need to find the number formed by the cubes when they are removed in a(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import heapq\n\nMOD = 10**9 + 9\n\nm = int(input())\ncubes = [tuple(map(int, input().split())) for (...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves strategic game theory where two players optimize their moves under constraints(...TRUNCATED) | 24,638 | 561 | ["Okay, so I need to solve this programming problem where Vasya and Petya are removing cubes from a (...TRUNCATED) | ["To solve this problem, we need to determine the optimal order in which Vasya and Petya remove cube(...TRUNCATED) | ["<think>\nOkay, so I need to solve this programming problem where Vasya and Petya are removing cube(...TRUNCATED) |
[
true,
true,
false,
true,
true,
true,
false,
true,
false,
false,
true,
false,
false,
false,
true,
false
] | "The provided answer consists exclusively of English text. It does not contain words, phrases, or se(...TRUNCATED) | ["<think>\nOkay, so I need to solve this programming problem where Vasya and Petya are removing cube(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm. So the problem is about a figure made of cubes, each(...TRUNCATED) | [{"from":"human","value":"Once Vasya and Petya assembled a figure of m cubes, each of them is associ(...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 8