Dataset Viewer (First 5GB)
Auto-converted to Parquet Duplicate
id
stringlengths
32
32
instruction_seed
stringlengths
247
53.1k
output
stringlengths
4.8k
71.6k
source
stringclasses
9 values
license
stringclasses
4 values
dataset
stringclasses
4 values
split
stringclasses
3 values
difficulty
int64
6
10
solution
stringlengths
36
12.5k
index
stringclasses
65 values
_source
stringclasses
2 values
difficulty_reasoning
stringlengths
256
886
__original_row_idx
int64
5
3.95k
ms_id
int64
3
3.94k
reasoning
sequencelengths
16
16
deepseek_solution
sequencelengths
16
16
final_reasoning_trace
sequencelengths
16
16
correct_majority_indices
sequencelengths
2
16
_judge_reasoning
stringlengths
0
1.7k
_majority_responses
sequencelengths
2
16
verified_final_reasoning_trace
stringlengths
2.26k
113k
conversations
listlengths
2
2
0dc96057a2ed0cfff6d6ac60a320b372
"Makoto has a big blackboard with a positive integer n written on it. He will perform the following (...TRUNCATED)
"<think>\nOkay, let's tackle this problem. Hmm, the problem says that we start with a number n and p(...TRUNCATED)
codeforces
cc-by-4.0
code_contests
train
8
"import math\nimport random\n\nMOD = 10**9 + 7\n\ndef is_prime(n):\n if n < 2:\n return Fa(...TRUNCATED)
null
nvidia/OpenCodeReasoning
"This problem requires a deep understanding of probability theory and number theory, as well as the (...TRUNCATED)
3,276
3,181
["Okay, let's try to solve this problem. Hmm. The problem says that we start with a number n and per(...TRUNCATED)
["To solve this problem, we need to determine the expected value of the number on the blackboard aft(...TRUNCATED)
["<think>\nOkay, let's try to solve this problem. Hmm. The problem says that we start with a number (...TRUNCATED)
[ "1", "0", "3", "4", "2", "5", "6", "7", "8", "9", "11", "10", "12", "14", "13", "15" ]
"The provided code samples all approach the problem of calculating the expected value after k steps (...TRUNCATED)
["<think>\nOkay, I need to solve this problem where we have to compute the expected value after k st(...TRUNCATED)
"<think>\nOkay, let's try to solve this problem. Hmm. So, the problem is about finding the expected (...TRUNCATED)
[{"from":"human","value":"Makoto has a big blackboard with a positive integer n written on it. He wi(...TRUNCATED)
2214ce88aa810bd140c71404a052b0ad
"You are developing software to stream music to users over the Interwebs. In order to reduce network(...TRUNCATED)
"<think>\nOkay, let's tackle this programming problem. So the goal is to find the maximum possible m(...TRUNCATED)
kattis
mit
apps
test
8
"import bisect\n\ndef main():\n import sys\n input = sys.stdin.read\n data = input().split((...TRUNCATED)
3684
nvidia/OpenCodeReasoning
"The problem involves optimizing data transfer in a peer-to-peer streaming scenario, where multiple (...TRUNCATED)
1,469
1,226
["Okay, let's try to figure out this problem. So, the problem is about streaming music in a peer-to-(...TRUNCATED)
["To solve this problem, we need to determine the maximum possible minimum buffer size for each user(...TRUNCATED)
["<think>\nOkay, let's try to figure out this problem. So, the problem is about streaming music in a(...TRUNCATED)
[ "0", "1", "4", "5", "3", "2", "12", "13" ]
"Solutions 0, 1, 4, 5, 3, 2, 12, and 13 all use similar methods to calculate the maximum possible mi(...TRUNCATED)
["<think>\nOkay, let's try to figure out this problem. So, the problem is about streaming music in a(...TRUNCATED)
"<think>\nOkay, let's try to tackle this problem. Hmm, the problem statement is a bit complex, but I(...TRUNCATED)
[{"from":"human","value":"You are developing software to stream music to users over the Interwebs. I(...TRUNCATED)
null
"PROBLEM\nFor a list of numbers, list: Find the lowest possible integer, x, which is optimally close(...TRUNCATED)
null
null
null
null
null
8
null
null
stackexchange_codegolf
"The problem requires understanding of even-harmonics, absolute cumulative remainders, and optimizat(...TRUNCATED)
1,059
2,555
["Okay, let's tackle this problem. Hmm, the goal is to find the lowest possible integer x between 20(...TRUNCATED)
["To solve this problem, we need to find the lowest possible integer x within the range [20, 100] th(...TRUNCATED)
["<think>\nOkay, let's tackle this problem. Hmm, the goal is to find the lowest possible integer x b(...TRUNCATED)
[ "0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "11", "12", "13", "14", "15" ]
"All solutions presented closely follow the same structure for calculating the optimal value of x. T(...TRUNCATED)
["<think>\nOkay, let's tackle this problem. Hmm, the goal is to find the lowest possible integer x b(...TRUNCATED)
"<think>\nOkay, let's try to figure out how to solve this problem. So, the task is to find the integ(...TRUNCATED)
[{"from":"human","value":"PROBLEM\nFor a list of numbers, list: Find the lowest possible integer, x,(...TRUNCATED)
c38d61c9c7c50cddfa67704593f82888
"You're trying to set the record on your favorite video game. The game consists of N levels, which m(...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
"import sys\n\ndef main():\n sys.setrecursionlimit(1 << 25)\n n, R = map(int, sys.stdin.readli(...TRUNCATED)
null
nvidia/OpenCodeReasoning
"This problem involves understanding probability, expected values, and optimal decision-making given(...TRUNCATED)
3,721
2,063
["Okay, let's tackle this problem. Hmm, so the problem is about calculating the expected minimum tim(...TRUNCATED)
["To solve this problem, we need to determine the minimal expected time to complete all levels of a (...TRUNCATED)
["<think>\nOkay, let's tackle this problem. Hmm, so the problem is about calculating the expected mi(...TRUNCATED)
[ "0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "11", "12", "13", "14", "15" ]
"All the code samples use dynamic programming or similar iterative approaches to minimize the expect(...TRUNCATED)
["<think>\nOkay, let's tackle this problem. Hmm, so the problem is about calculating the expected mi(...TRUNCATED)
"<think>\nOkay, let's see. The problem is about calculating the expected time to complete all N leve(...TRUNCATED)
[{"from":"human","value":"You're trying to set the record on your favorite video game. The game cons(...TRUNCATED)
88e37f88f9725822c13c37cf49cc1270
"The country of Reberland is the archenemy of Berland. Recently the authorities of Berland arrested (...TRUNCATED)
"<think>\nOkay, let's see. So the problem is about processing multiple queries to find which leaflet(...TRUNCATED)
codeforces
cc-by-4.0
code_contests
train
8
"class State:\n def __init__(self):\n self.next = dict() # char -> state index\n s(...TRUNCATED)
null
nvidia/OpenCodeReasoning
"The problem requires a combination of string searching, handling multiple queries efficiently, and (...TRUNCATED)
481
944
["Okay, so I need to solve this programming problem. Let's read the problem statement carefully.\n\n(...TRUNCATED)
["To solve this problem, we need to determine which leaflet, within a specified range, contains the (...TRUNCATED)
["<think>\nOkay, so I need to solve this programming problem. Let's read the problem statement caref(...TRUNCATED)
[ "0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "11", "12", "13", "14", "15" ]
"The solutions provided all utilize a suffix automaton (SAM) which effectively handles substring que(...TRUNCATED)
["<think>\nOkay, so I need to solve this programming problem. Let's read the problem statement caref(...TRUNCATED)
"<think>\nOkay, so I have this programming problem to solve. Let me read through the question carefu(...TRUNCATED)
[{"from":"human","value":"The country of Reberland is the archenemy of Berland. Recently the authori(...TRUNCATED)
afece4bdc61d1a50145c71b00f062993
"You may know that Euclid was a mathematician. Well, as it turns out, Morpheus knew it too. So when (...TRUNCATED)
"<think>\nOkay, let's tackle this problem. Hmm, the problem is about finding the size of the set T, (...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\n data = input().spli(...TRUNCATED)
null
nvidia/OpenCodeReasoning
"This problem involves advanced concepts such as vector space theory over finite fields (specificall(...TRUNCATED)
2,703
3,929
["Okay, let's try to solve this problem. Hmm, the problem is about finding the size of the set T, wh(...TRUNCATED)
["To solve this problem, we need to determine the number of distinct vectors that can be generated b(...TRUNCATED)
["<think>\nOkay, let's try to solve this problem. Hmm, the problem is about finding the size of the (...TRUNCATED)
[ "0", "1", "2", "3", "4", "5", "6", "7" ]
"The solutions share a common strategy of using union-find or similar approaches to determine the co(...TRUNCATED)
["<think>\nOkay, let's try to solve this problem. Hmm, the problem is about finding the size of the (...TRUNCATED)
"<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED)
[{"from":"human","value":"You may know that Euclid was a mathematician. Well, as it turns out, Morph(...TRUNCATED)
null
"In this programming-puzzle, your goal is to write the following function in JavaScript, using (esse(...TRUNCATED)
null
null
null
null
null
8
null
null
stackexchange_codegolf
"This problem requires deep knowledge of JavaScript's functional programming features, particularly (...TRUNCATED)
790
1,700
["Okay, so I need to create a JavaScript function that behaves like (f) => void(f()), but using poin(...TRUNCATED)
["The problem requires creating a function that takes another function `f`, calls it, and returns `u(...TRUNCATED)
["<think>\nOkay, so I need to create a JavaScript function that behaves like (f) => void(f()), but u(...TRUNCATED)
[ "0", "3", "1", "2", "5" ]
"Solutions 0, 3, 1, and 2 are functionally equivalent since they use `Function.prototype.call` to ex(...TRUNCATED)
["<think>\nOkay, so I need to create a JavaScript function that behaves like (f) => void(f()), but u(...TRUNCATED)
"<think>\nOkay, so I need to create a JavaScript function that behaves like (f) => void(f()), but us(...TRUNCATED)
[{"from":"human","value":"In this programming-puzzle, your goal is to write the following function i(...TRUNCATED)
7fc7eab9a2d990783bc923f5c7b6b1b4
"Dima and Anya love playing different games. Now Dima has imagined a new game that he wants to play (...TRUNCATED)
"<think>\nOkay, I need to solve this problem where I have to count the number of ways Dima can write(...TRUNCATED)
codeforces
cc-by-4.0
code_contests
train
8
"MOD = 10**9 + 7\n\ndef main():\n import sys\n n, p = map(int, sys.stdin.readline().split())\n(...TRUNCATED)
null
nvidia/OpenCodeReasoning
"This problem involves combinatorial game theory and requires understanding complex recursive relati(...TRUNCATED)
2,920
1,327
["Okay, let's see. We need to find the number of ways Dima can write n pairs of integers (li, ri) su(...TRUNCATED)
["To solve this problem, we need to determine the number of ways Dima can write pairs of integers su(...TRUNCATED)
["<think>\nOkay, let's see. We need to find the number of ways Dima can write n pairs of integers (l(...TRUNCATED)
[ "0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "11", "12", "13", "14", "15" ]
"The solutions are functionally equivalent in terms of analyzing Grundy numbers and counting valid s(...TRUNCATED)
["<think>\nOkay, let's see. We need to find the number of ways Dima can write n pairs of integers (l(...TRUNCATED)
"<think>\nOkay, let's try to solve this problem. So, the problem is about Dima and Anya playing a ga(...TRUNCATED)
[{"from":"human","value":"Dima and Anya love playing different games. Now Dima has imagined a new ga(...TRUNCATED)
98e460b03a2c0bd4f7f7af44eaf03b74
"You come home and fell some unpleasant smell. Where is it coming from?\n\nYou are given an array a.(...TRUNCATED)
"<think>\nOkay, so I need to solve this programming problem. Let's read the problem carefully.\n\nTh(...TRUNCATED)
codeforces
cc-by-4.0
code_contests
train
8
"import sys\nimport math\nfrom collections import defaultdict\n\ndef main():\n input = sys.stdin.(...TRUNCATED)
null
nvidia/OpenCodeReasoning
"This problem involves both point updates and range queries in an array, requiring the calculation o(...TRUNCATED)
2,449
2,763
["Okay, let's see. The problem is to handle two types of queries on an array. The first type asks fo(...TRUNCATED)
["To solve this problem, we need to handle two types of queries on an array efficiently: finding the(...TRUNCATED)
["<think>\nOkay, let's see. The problem is to handle two types of queries on an array. The first typ(...TRUNCATED)
[ "0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "11", "12", "13", "14", "15" ]
"The solutions are functionally equivalent as they all implement a version of Mo's algorithm to hand(...TRUNCATED)
["<think>\nOkay, let's see. The problem is to handle two types of queries on an array. The first typ(...TRUNCATED)
"<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED)
[{"from":"human","value":"You come home and fell some unpleasant smell. Where is it coming from?\n\n(...TRUNCATED)
null
"(This challenge is very similar, but this current challenge has additional complications.)\n\nImagi(...TRUNCATED)
null
null
null
null
null
8
null
null
stackexchange_codegolf
"The problem requires an understanding of geometrical reflections and handling a light beam simulati(...TRUNCATED)
2,315
1,846
["Okay, so I need to solve this programming problem. Let's read the problem carefully.\n\nThe task i(...TRUNCATED)
["To solve this problem, we need to simulate the path of a light beam entering a room with mirrored (...TRUNCATED)
["<think>\nOkay, so I need to solve this programming problem. Let's read the problem carefully.\n\nT(...TRUNCATED)
[ "0", "1", "2", "3", "4", "5", "6", "7", "10", "12" ]
"The solutions listed are functionally similar as they all essentially accomplish the task of simula(...TRUNCATED)
["<think>\nOkay, so I need to solve this programming problem. Let's read the problem carefully.\n\nT(...TRUNCATED)
"<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED)
[{"from":"human","value":"(This challenge is very similar, but this current challenge has additional(...TRUNCATED)
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
6