Dataset Viewer
id
stringlengths 32
32
⌀ | instruction_seed
stringlengths 80
53.1k
| output
stringlengths 4.77k
70.8k
⌀ | source
stringclasses 9
values | license
stringclasses 4
values | dataset
stringclasses 4
values | split
stringclasses 3
values | difficulty
int64 6
10
| solution
stringlengths 8
5.91k
⌀ | index
stringclasses 35
values | _source
stringclasses 2
values | difficulty_reasoning
stringlengths 287
821
| __original_row_idx
int64 96
63.2k
| ms_id
int64 6
3.95k
| reasoning
sequencelengths 16
16
| deepseek_solution
sequencelengths 16
16
| final_reasoning_trace
sequencelengths 16
16
| _majority_responses
sequencelengths 8
8
| verified_final_reasoning_trace
stringlengths 2.94k
110k
| conversations
listlengths 2
2
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1318f00ca8d4a923bb5030b5eae7b4cf
| "You are given a set of n points in a 2D plane. No three points are collinear.\n\nA pentagram is a s(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem where I have to count the number of pentagr(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import itertools\n\ndef cross(o, a, b):\n return (a[0] - o[0]) * (b[1] - o[1]) - (a[1] - o[1]) *(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires a deep understanding of geometry and combinatorial arrangements to determine h(...TRUNCATED) | 28,671 | 1,791 | ["Okay, let's see. The problem is to count the number of 5-point subsets from a given set of points (...TRUNCATED) | ["To solve this problem, we need to count the number of 5-point subsets from a given set of points t(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to count the number of 5-point subsets from a given set o(...TRUNCATED) | ["<think>\nOkay, so I've got this programming problem to solve. Let's see what it's about. The task (...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to count the number of pentagrams formed b(...TRUNCATED) | [{"from":"human","value":"You are given a set of n points in a 2D plane. No three points are colline(...TRUNCATED) |
5ce45bda5a9bf948ac00faa299870ead
| "After a successful field test, Heidi is considering deploying a trap along some Corridor, possibly (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the problem is about finding, for each edge not in t(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 9 | "import sys\nfrom collections import deque\n\nclass DSU:\n def __init__(self, n):\n self.p(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves calculating a specific value related to a minimum spanning tree (MST) of a gra(...TRUNCATED) | 15,542 | 971 | ["Okay, so I need to solve this problem where Heidi wants to determine E_max for each corridor that'(...TRUNCATED) | ["To solve this problem, we need to determine the maximum energy value \\( E_{max}(c) \\) for each c(...TRUNCATED) | ["<think>\nOkay, so I need to solve this problem where Heidi wants to determine E_max for each corri(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is about finding, for each corridor not in the minimum spann(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding, for each corridor not in the minimum spanni(...TRUNCATED) | [{"from":"human","value":"After a successful field test, Heidi is considering deploying a trap along(...TRUNCATED) |
09154c2c01bf74bf3b382e9264a7607f
| "The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he (...TRUNCATED) | "<think>\nOkay, let's see. We need to find the number of integer values x such that when the Beaver (...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 9 | "n, c = map(int, input().split())\nplanets = []\nall_a_zero = True\nfor _ in range(n):\n a, b = m(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires a combination of arithmetic operations with constraints that lead to multiple (...TRUNCATED) | 20,283 | 1,267 | ["Okay, I need to solve this programming problem. Let's read the problem carefully and understand wh(...TRUNCATED) | ["To solve this problem, we need to determine the number of ways to choose a positive integer \\( x (...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully and unde(...TRUNCATED) | ["<think>\nOkay, so I need to solve this programming problem. Let's read through the problem stateme(...TRUNCATED) | "<think>\nOkay, let's try to understand this problem. So the Smart Beaver is visiting n planets, and(...TRUNCATED) | [{"from":"human","value":"The Smart Beaver from ABBYY plans a space travel on an ultramodern spacesh(...TRUNCATED) |
17094203eb0b6fb1cd83be195a4ebef7
| "Bomboslav set up a branding agency and now helps companies to create new logos and advertising slog(...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to find the longest sequence of slogans(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "class State:\n def __init__(self):\n self.next = {}\n self.link = -1\n self(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves determining the longest sequence of slogans where each subsequent slogan is 'c(...TRUNCATED) | 60,784 | 3,799 | ["Okay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, the task (...TRUNCATED) | ["To solve this problem, we need to determine the maximum possible length of a sequence of slogans w(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, (...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefull(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem where I have to find the longest sequenc(...TRUNCATED) | [{"from":"human","value":"Bomboslav set up a branding agency and now helps companies to create new l(...TRUNCATED) |
4b62f6bd850e1a208a5b1ca7a272d7dd
| "Omkar and Akmar are playing a game on a circular board with n (2 ≤ n ≤ 10^6) cells. The cells a(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So, the task is to compute the number of possi(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "MOD = 10**9 + 7\n\nn = int(input())\n\nif n % 2 == 0:\n exponent = (n // 2) - 1\nelse:\n expo(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires a combinatorial understanding of game theory and optimal strategies, along wit(...TRUNCATED) | 1,690 | 105 | ["Okay, let's try to understand this problem. So, Omkar and Akmar are playing a game on a circular b(...TRUNCATED) | ["To solve this problem, we need to determine the number of possible distinct games where Omkar and (...TRUNCATED) | ["<think>\nOkay, let's try to understand this problem. So, Omkar and Akmar are playing a game on a c(...TRUNCATED) | ["<think>\nOkay, so I've got this programming problem to solve. Let me read through it carefully.\n\(...TRUNCATED) | "<think>\nOkay, so I've got this programming problem to solve. Let me read through it carefully.\n\n(...TRUNCATED) | [{"from":"human","value":"Omkar and Akmar are playing a game on a circular board with n (2 ≤ n ≤(...TRUNCATED) |
null | "In the old DOS operating system, a number of characters were provided to draw boxes. Here is a sele(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires a solid understanding of string handling and character output, as well as the (...TRUNCATED) | 56,137 | 3,508 | ["Okay, let's tackle this programming challenge. The problem is to read a series of coordinates for (...TRUNCATED) | ["To solve this problem, we need to draw boxes using specific box-drawing characters based on input (...TRUNCATED) | ["<think>\nOkay, let's tackle this programming challenge. The problem is to read a series of coordin(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming challenge. Let me read the problem carefully.\n\nS(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the challenge carefully. The ta(...TRUNCATED) | [{"from":"human","value":"In the old DOS operating system, a number of characters were provided to d(...TRUNCATED) |
1b2c544513d98c60f9ade47e5720084f
| "In the Land of Fire there are n villages and n-1 bidirectional road, and there is a path between an(...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\nfrom collections import deque\n\ndef main():\n sys.setrecursionlimit(1 << 25)\n n(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem involves concepts of graph theory, specifically dealing with an undirected tree (since(...TRUNCATED) | 38,098 | 2,381 | ["Okay, let's see. The problem is about a tree where each road is either stone or sand. Every day, a(...TRUNCATED) | ["To solve this problem, we need to determine the longest path in a tree where each edge can be eith(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is about a tree where each road is either stone or sand. Eve(...TRUNCATED) | ["<think>\nOkay, let's see. So the problem is about a tree where each road is either stone or sand. (...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So, the problem is about a tree with roads tha(...TRUNCATED) | [{"from":"human","value":"In the Land of Fire there are n villages and n-1 bidirectional road, and t(...TRUNCATED) |
null | "Quarterstaff repo here with additional quarterbf interpreter: rather bereft of documentation, howev(...TRUNCATED) | null | null | null | null | null | 10 | null | null |
stackexchange_codegolf
| "The problem involves compiling a program from one esoteric language (Quarterstaff) to another (Quar(...TRUNCATED) | 24,359 | 1,522 | ["Okay, I need to compile Quarterstaff to QuarterBF. Let me start by understanding the specification(...TRUNCATED) | ["To solve this problem, we need to compile a program written in Quarterstaff to QuarterBF, ensuring(...TRUNCATED) | ["<think>\nOkay, I need to compile Quarterstaff to QuarterBF. Let me start by understanding the spec(...TRUNCATED) | ["<think>\nOkay, I need to compile Quarterstaff to QuarterBF. Let's start by understanding the speci(...TRUNCATED) | "<think>\nOkay, I need to compile Quarterstaff code into Brainfuck. Let me start by understanding th(...TRUNCATED) | [{"from":"human","value":"Quarterstaff repo here with additional quarterbf interpreter: rather beref(...TRUNCATED) |
null | "Write a function that accepts a rectangular grid of ids in any reasonable format, for example a mul(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem involves constructing a grid from input strings representing unique IDs and box drawing(...TRUNCATED) | 21,423 | 1,338 | ["Okay, I need to write a function that takes a grid of IDs and a list of box drawing characters and(...TRUNCATED) | ["To solve this problem, we need to convert a grid of IDs into a pretty-printed version using box dr(...TRUNCATED) | ["<think>\nOkay, I need to write a function that takes a grid of IDs and a list of box drawing chara(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem. Let's read the problem statement carefully.\n\nThe ta(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to convert a grid of IDs into a box-drawn (...TRUNCATED) | [{"from":"human","value":"Write a function that accepts a rectangular grid of ids in any reasonable (...TRUNCATED) |
4886cb31eb88d09f7fd3624927c82195
| "This problem is interactive.\n\nYou should guess hidden number x which is between 1 and M = 1000420(...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to guess a hidden number between 1 and (...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import sys\n\ndef main():\n sys.setrecursionlimit(10000)\n M = 10004205361450474\n remaini(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves interactive querying, where the solution must adapt based on the responses rec(...TRUNCATED) | 35,011 | 2,188 | ["Okay, let's see. The problem is to guess a hidden number x between 1 and M = 10004205361450474 wit(...TRUNCATED) | ["To solve this problem, we need to guess a hidden number x between 1 and M (where M = 1000420536145(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to guess a hidden number x between 1 and M = 100042053614(...TRUNCATED) | ["<think>\nOkay, I need to figure out how to guess the hidden number x between 1 and M=1000420536145(...TRUNCATED) | "<think>\nOkay, I need to figure out how to guess the hidden number x between 1 and M=10004205361450(...TRUNCATED) | [{"from":"human","value":"This problem is interactive.\n\nYou should guess hidden number x which is (...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 15