Dataset Viewer (First 5GB)
Auto-converted to Parquet Duplicate
id
stringlengths
32
32
instruction_seed
stringlengths
80
48.6k
output
stringlengths
4.77k
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
7.89k
index
stringclasses
77 values
_source
stringclasses
2 values
difficulty_reasoning
stringlengths
280
886
__original_row_idx
int64
11
44.8k
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
34
743
_majority_responses
sequencelengths
1
16
verified_final_reasoning_trace
stringlengths
3.39k
105k
conversations
listlengths
2
2
null
"Introduction\nWrite a program to output the outgoing spiral of the famous pangram following given r(...TRUNCATED)
null
null
null
null
null
7
null
null
stackexchange_codegolf
"The problem requires understanding of how to generate a spiral pattern with specific rules based on(...TRUNCATED)
25,076
3,926
["Okay, I need to solve this spiral pangram problem. Let's read the problem carefully.\n\nSo the tas(...TRUNCATED)
["To solve this problem, we need to generate a spiral based on the famous pangram \"The quick brown (...TRUNCATED)
["<think>\nOkay, I need to solve this spiral pangram problem. Let's read the problem carefully.\n\nS(...TRUNCATED)
[ true, true, false, true, true, true, false, true, true, false, true, false, true, true, false, false ]
"The provided solution only contains English text, as it consists solely of instructions and explana(...TRUNCATED)
["<think>\nOkay, I need to solve this spiral pangram problem. Let's read the problem carefully.\n\nS(...TRUNCATED)
"<think>\nOkay, so I need to solve this programming challenge where I generate a spiral based on the(...TRUNCATED)
[{"from":"human","value":"Introduction\nWrite a program to output the outgoing spiral of the famous (...TRUNCATED)
b08b19bfd61cc6ac41a7b212cfb83694
"It is now 125 years later, but humanity is still on the run from a humanoid-cyborg race determined (...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 fractions import Fraction\n\ndef compute_rref(matrix):\n matrix = [row.copy() f(...TRUNCATED)
null
nvidia/OpenCodeReasoning
"This problem involves advanced concepts in linear algebra, specifically in understanding vector spa(...TRUNCATED)
24,397
3,087
["Okay, so I need to solve this problem where I have to group ships based on their subspaces being e(...TRUNCATED)
["To solve this problem, we need to group ships based on their hyperspace jump subspaces, which are (...TRUNCATED)
["<think>\nOkay, so I need to solve this problem where I have to group ships based on their subspace(...TRUNCATED)
[ true, true, false, false, true, false, false, true, true, true, true, true, true, true, true, true ]
The provided answer contains only one language, which is English.
["<think>\nOkay, so I need to solve this problem where I have to group ships based on their subspace(...TRUNCATED)
"<think>\nOkay, let's see. The problem is to group subspaces of a d-dimensional space, where each su(...TRUNCATED)
[{"from":"human","value":"It is now 125 years later, but humanity is still on the run from a humanoi(...TRUNCATED)
291a2cfa833f45f33fe4d8e32f0ca3f7
"You have a bag which contains n cards. There is a number written on each card; the number on i-th c(...TRUNCATED)
"<think>\nOkay, let's see. The problem is to calculate the probability of winning this game. Hmm. So(...TRUNCATED)
codeforces
cc-by-4.0
code_contests
train
8
"MOD = 998244353\n\nn = int(input())\na = list(map(int, input().split()))\nfrom collections import d(...TRUNCATED)
null
nvidia/OpenCodeReasoning
"This problem requires a deep understanding of probabilities, combinatorial counting, and modular ar(...TRUNCATED)
11,850
2,617
["Okay, let's see. We need to calculate the probability that the game ends with a win. The game ends(...TRUNCATED)
["To solve this problem, we need to calculate the probability of winning a game where you draw cards(...TRUNCATED)
["<think>\nOkay, let's see. We need to calculate the probability that the game ends with a win. The (...TRUNCATED)
[ true, false, false, true, false, true, true, true, false, true, true, true, true, false, false, false ]
The provided answer contains only one language, which is English.
["<think>\nOkay, let's see. We need to calculate the probability that the game ends with a win. The (...TRUNCATED)
"<think>\nOkay, let's try to figure out how to solve this problem. The problem statement says that w(...TRUNCATED)
[{"from":"human","value":"You have a bag which contains n cards. There is a number written on each c(...TRUNCATED)
24f7c4d4139c9b0ecb29afc7730adf35
"HCII, the health committee for interstellar intelligence, aims to take care of the health of every (...TRUNCATED)
"<think>\nOkay, let's tackle this problem. Hmm, the task is to find the maximum angle the equipment (...TRUNCATED)
aizu
cc-by-4.0
code_contests
train
8
"import math\n\ndef rotate_point(x, y, cx, cy, theta_deg):\n theta = math.radians(theta_deg)\n (...TRUNCATED)
null
nvidia/OpenCodeReasoning
"The problem requires a deep understanding of geometry and computational geometry concepts, particul(...TRUNCATED)
9,890
1,806
["Okay, let's tackle this problem. Hmm, the problem is about rotating a polygon-shaped equipment aro(...TRUNCATED)
["To solve this problem, we need to determine the maximum angle the health check equipment can rotat(...TRUNCATED)
["<think>\nOkay, let's tackle this problem. Hmm, the problem is about rotating a polygon-shaped equi(...TRUNCATED)
[ true, true, false, false, true, false, true, false, true, true, false, true, true, false, true, true ]
"The provided answer is entirely in English, which is a single language. Thus, it meets the criteria(...TRUNCATED)
["<think>\nOkay, let's tackle this problem. Hmm, the problem is about rotating a polygon-shaped equi(...TRUNCATED)
"<think>\nOkay, let's see. I need to solve this programming problem where I have to calculate the ma(...TRUNCATED)
[{"from":"human","value":"HCII, the health committee for interstellar intelligence, aims to take car(...TRUNCATED)
null
"Introduction\nI can type at a moderate pace, using the QWERTY keyboard layout. But if a word like y(...TRUNCATED)
null
null
null
null
null
7
null
null
stackexchange_codegolf
"This problem tasks the solver with implementing a function that calculates typing time based on inp(...TRUNCATED)
18,535
3,359
["Okay, let's tackle this problem. Hmm, the challenge is to calculate the time it takes to type a gi(...TRUNCATED)
["To solve this problem, we need to calculate the time it takes to type a given string based on the (...TRUNCATED)
["<think>\nOkay, let's tackle this problem. Hmm, the challenge is to calculate the time it takes to (...TRUNCATED)
[ true, false, true, true, true, true, false, false, true, false, true, true, false, false, false, true ]
"The provided answer uses only English, which is the standard language for programming and mathemati(...TRUNCATED)
["<think>\nOkay, let's tackle this problem. Hmm, the challenge is to calculate the time it takes to (...TRUNCATED)
"<think>\nOkay, let's tackle this problem. Hmm, the challenge is to calculate the time it takes to t(...TRUNCATED)
[{"from":"human","value":"Introduction\nI can type at a moderate pace, using the QWERTY keyboard lay(...TRUNCATED)
null
"This is the audio version of the Twitter image encoding challenge.\nDesign an audio compression for(...TRUNCATED)
null
null
null
null
null
9
null
null
stackexchange_codegolf
"This problem requires extensive knowledge of algorithms and mathematical concepts associated with d(...TRUNCATED)
9,674
1,809
["Okay, I need to design an audio compression format that can fit at least one minute of music into (...TRUNCATED)
["To solve this problem, we need to design an audio compression format that can represent at least o(...TRUNCATED)
["<think>\nOkay, I need to design an audio compression format that can fit at least one minute of mu(...TRUNCATED)
[ true, false, true, true, false, true, false, true, true, true, true, true, true, false, true, true ]
The provided answer exclusively uses English as the language throughout its entirety.
["<think>\nOkay, I need to design an audio compression format that can fit at least one minute of mu(...TRUNCATED)
"<think>\nOkay, so I need to design an audio compression format that can fit at least one minute of (...TRUNCATED)
[{"from":"human","value":"This is the audio version of the Twitter image encoding challenge.\nDesign(...TRUNCATED)
null
"In sporting competitions, it often happens that winners are presented on podiums, with the first-pl(...TRUNCATED)
null
null
null
null
null
7
null
null
stackexchange_codegolf
"The problem requires knowledge of string manipulation, ASCII art creation, and handling of varying (...TRUNCATED)
15,684
1,353
["Okay, I need to solve this problem where I have to create podium layouts based on the given names.(...TRUNCATED)
["To solve this problem, we need to generate podium layouts for three winners in a sporting competit(...TRUNCATED)
["<think>\nOkay, I need to solve this problem where I have to create podium layouts based on the giv(...TRUNCATED)
[ false, true, false, true, false, false, false, true, true, false, false, true, false, false, true, true ]
The provided answer contains only one language, which is English.
["<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefull(...TRUNCATED)
"<think>\nOkay, I need to solve this problem where given three names, I have to generate a podium st(...TRUNCATED)
[{"from":"human","value":"In sporting competitions, it often happens that winners are presented on p(...TRUNCATED)
a51f8f9680273db7b8233cccd2661686
"You are a very busy person, with a lot of important meetings. Today, you have a meeting for which i(...TRUNCATED)
"<think>\nOkay, let's see. I need to find the latest departure time from the hotel (stop 0) such tha(...TRUNCATED)
kattis
mit
apps
test
8
"import heapq\n\ndef main():\n import sys\n input = sys.stdin.read().split()\n idx = 0\n (...TRUNCATED)
3467
nvidia/OpenCodeReasoning
"This problem requires knowledge of graph traversal and handling intervals, particularly understandi(...TRUNCATED)
7,588
1,412
["Okay, so I need to solve this problem where I have to find the latest possible time to leave the h(...TRUNCATED)
["To solve this problem, we need to determine the latest possible time to leave the hotel (located a(...TRUNCATED)
["<think>\nOkay, so I need to solve this problem where I have to find the latest possible time to le(...TRUNCATED)
[ true, true, true, true, true, true, false, false, true, true, true, false, true, true, true, false ]
"The provided answer only contains one language, specifically Python. There are no instances of code(...TRUNCATED)
["<think>\nOkay, so I need to solve this problem where I have to find the latest possible time to le(...TRUNCATED)
"<think>\nOkay, let's tackle this problem. Hmm, the goal is to find the latest departure time from t(...TRUNCATED)
[{"from":"human","value":"You are a very busy person, with a lot of important meetings. Today, you h(...TRUNCATED)
null
"Task\nYou will be given a positive integer and you must output a \"self-complementary graph\" with (...TRUNCATED)
null
null
null
null
null
8
null
null
stackexchange_codegolf
"The problem requires understanding of advanced graph theory concepts, specifically the definition a(...TRUNCATED)
27,450
585
["Okay, I need to solve this problem where I have to generate a self-complementary graph for a given(...TRUNCATED)
["To solve this problem, we need to generate a self-complementary graph for a given number of nodes (...TRUNCATED)
["<think>\nOkay, I need to solve this problem where I have to generate a self-complementary graph fo(...TRUNCATED)
[ true, false, true, false, true, false, true, false, true, true, false, true, true, false, false, false ]
The provided answer is in English only.
["<think>\nOkay, I need to solve this problem where I have to generate a self-complementary graph fo(...TRUNCATED)
"<think>\nOkay, I need to solve this problem where I have to output a self-complementary graph with (...TRUNCATED)
[{"from":"human","value":"Task\nYou will be given a positive integer and you must output a \"self-co(...TRUNCATED)
2c9301a43885877a27fe37d9ccd2c4bd
"You are involved in the development of a certain game. The game is for players to explore randomly (...TRUNCATED)
"<think>\nOkay, I need to solve this problem where I have to calculate the sum of the maximum edge w(...TRUNCATED)
aizu
cc-by-4.0
code_contests
train
9
"n = int(input())\nedges = []\nfor _ in range(n - 1):\n a, b, c = map(int, input().split())\n (...TRUNCATED)
null
nvidia/OpenCodeReasoning
"The problem involves calculating the risk levels between all pairs of rooms in a dungeon, using the(...TRUNCATED)
7,370
1,425
["Okay, I need to solve this programming problem. Let's read the problem statement carefully.\n\nSo,(...TRUNCATED)
["To solve this problem, we need to compute the sum of the maximum edge weights (risk levels) for al(...TRUNCATED)
["<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefull(...TRUNCATED)
[ true, true, false, true, true, false, true, true, true, true, true, true, true, true, true, true ]
"The provided answer is exclusively in English, utilizing technical and programming language related(...TRUNCATED)
["<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefull(...TRUNCATED)
"<think>\nOkay, let's tackle this problem. So the problem is about calculating the sum of the maximu(...TRUNCATED)
[{"from":"human","value":"You are involved in the development of a certain game. The game is for pla(...TRUNCATED)
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
5