Dataset Viewer
id
string | instruction_seed
string | output
string | source
string | license
string | dataset
string | split
string | difficulty
int64 | solution
string | index
string | _source
string | difficulty_reasoning
string | __original_row_idx
int64 | ms_id
int64 | reasoning
string | deepseek_solution
string | final_reasoning_trace
string | question_answer_string
string | _fasttext_score
float64 | conversations
list |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
5bf0b31ecc4fdf84586bfbe5132422f7
| "The Great Mushroom King descended to the dwarves, but not everyone managed to see him. Only the few(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the problem says that for each query, we need to com(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import sys\n\ndef factor(n):\n factors = {}\n while n % 2 == 0:\n factors[2] = factors(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves computing the least common multiple (LCM) for a range of numbers which is a no(...TRUNCATED) | 21,374 | 1,335 | "Okay, let's try to tackle this problem. So, the task is to compute the LCM of a sequence of numbers(...TRUNCATED) | "To solve this problem, we need to determine the number of dwarves who can see the Great Mushroom Ki(...TRUNCATED) | "<think>\nOkay, let's try to tackle this problem. So, the task is to compute the LCM of a sequence o(...TRUNCATED) | "Question: The Great Mushroom King descended to the dwarves, but not everyone managed to see him. On(...TRUNCATED) | 1.00001 | [{"from":"human","value":"The Great Mushroom King descended to the dwarves, but not everyone managed(...TRUNCATED) |
null | "ProSet is a classic card game that is played normally with 63 cards. One card has 6 colored dots on(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "This problem involves combinatorial reasoning and requires knowledge of binary representation and t(...TRUNCATED) | 59,758 | 3,734 | "Okay, let's tackle this ProSet problem. So the goal is to find the number of valid ProSets in a giv(...TRUNCATED) | "To solve this problem, we need to determine the number of valid ProSets in a given set of cards. A (...TRUNCATED) | "<think>\nOkay, let's tackle this ProSet problem. So the goal is to find the number of valid ProSets(...TRUNCATED) | "Question: ProSet is a classic card game that is played normally with 63 cards. One card has 6 color(...TRUNCATED) | 0.999998 | [{"from":"human","value":"ProSet is a classic card game that is played normally with 63 cards. One c(...TRUNCATED) |
null | "Task\nGiven is a square matrix of any dimension and any integer n.\nOutput all possible matrices(wi(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem requires the calculation of determinants and the generation of all possible submatrices(...TRUNCATED) | 24,264 | 1,516 | "Okay, I need to solve this problem where I have to find all possible submatrices of a given square (...TRUNCATED) | "To solve this problem, we need to find all possible square submatrices of a given square matrix suc(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find all possible submatrices of a give(...TRUNCATED) | "Question: Task\nGiven is a square matrix of any dimension and any integer n.\nOutput all possible m(...TRUNCATED) | 1.000007 | [{"from":"human","value":"Task\nGiven is a square matrix of any dimension and any integer n.\nOutput(...TRUNCATED) |
null | "Welcome to the piNapple bar, Melbourne. All of the finest code golfers are here, with their laptops(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires advanced knowledge of binary data manipulation, understanding of barcode encod(...TRUNCATED) | 60,380 | 3,773 | "Okay, I need to solve this programming problem. Let's read the problem statement carefully.\n\nThe (...TRUNCATED) | "To solve this problem, we need to decode a barcode represented as a string of 0s and 1s. The barcod(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | "Question: Welcome to the piNapple bar, Melbourne. All of the finest code golfers are here, with the(...TRUNCATED) | 1.00001 | [{"from":"human","value":"Welcome to the piNapple bar, Melbourne. All of the finest code golfers are(...TRUNCATED) |
null | "I'm sure most of us have heard of zip bombs and similar decompression bomb tricks, where a maliciou(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "This problem requires knowledge of Markdown syntax and understanding how it translates to HTML, whi(...TRUNCATED) | 18,994 | 1,187 | "Okay, so I need to create a Markdown compression bomb. The goal is to have a small Markdown input t(...TRUNCATED) | "To create a Markdown compression bomb, we leverage the efficiency of tables in generating verbose H(...TRUNCATED) | "<think>\nOkay, so I need to create a Markdown compression bomb. The goal is to have a small Markdow(...TRUNCATED) | "Question: I'm sure most of us have heard of zip bombs and similar decompression bomb tricks, where (...TRUNCATED) | 1.000008 | [{"from":"human","value":"I'm sure most of us have heard of zip bombs and similar decompression bomb(...TRUNCATED) |
657354e69a5d657f6913a0dd267f8cbb
| "A girl named Sonya is studying in the scientific lyceum of the Kingdom of Kremland. The teacher of (...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. Hmm, the problem is about calculating the probabili(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "MOD = 10**9 + 7\n\ndef multiply(a, b, m_size):\n result = [[0] * m_size for _ in range(m_size)]\(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem requires a deep understanding of combinatorial probabilities, as well as skills in mod(...TRUNCATED) | 28,200 | 1,762 | "Okay, I have to solve this programming problem. Let's read the problem carefully.\n\nSo, the proble(...TRUNCATED) | "To solve this problem, we need to determine the probability that an array of 0s and 1s will be sort(...TRUNCATED) | "<think>\nOkay, I have to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED) | "Question: A girl named Sonya is studying in the scientific lyceum of the Kingdom of Kremland. The t(...TRUNCATED) | 1 | [{"from":"human","value":"A girl named Sonya is studying in the scientific lyceum of the Kingdom of (...TRUNCATED) |
20b411527dbe1951cfc75f6c9dc1d847
| "Omkar's most recent follower, Ajit, has entered the Holy Forest. Ajit realizes that Omkar's forest (...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where we have a grid with some cells fixed a(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "MOD = 10**9 + 7\n\nt = int(input())\nfor _ in range(t):\n n, m = map(int, input().split())\n (...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires constraints on a grid with complex adjacency rules and non-trivial counting of(...TRUNCATED) | 10,316 | 644 | "Okay, let's try to understand this problem. So, we have a grid where some cells are fixed as 0, and(...TRUNCATED) | "To solve this problem, we need to determine the number of valid configurations of a grid where each(...TRUNCATED) | "<think>\nOkay, let's try to understand this problem. So, we have a grid where some cells are fixed (...TRUNCATED) | "Question: Omkar's most recent follower, Ajit, has entered the Holy Forest. Ajit realizes that Omkar(...TRUNCATED) | 1.000007 | [{"from":"human","value":"Omkar's most recent follower, Ajit, has entered the Holy Forest. Ajit real(...TRUNCATED) |
1945a48dabb0437b9b0b99620a0170c0
| "The Head Chef is interested in studying interactions between his chefs . There are N chefs with i(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about counting the number of paths from each chef in the q(...TRUNCATED) |
codechef
|
cc-by-4.0
|
code_contests
|
train
| 8 | "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 understanding directed graphs, where chefs represent nodes and trust relation(...TRUNCATED) | 14,114 | 882 | "Okay, let's try to figure out this problem. Hmm. So we have N chefs, each trusting the next ni chef(...TRUNCATED) | "To solve this problem, we need to determine the number of lines of trust from each chef in a given (...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. Hmm. So we have N chefs, each trusting the nex(...TRUNCATED) | "Question: The Head Chef is interested in studying interactions between his chefs . There are N ch(...TRUNCATED) | 1.000003 | [{"from":"human","value":"The Head Chef is interested in studying interactions between his chefs . T(...TRUNCATED) |
null | "The minimal power iteration of a number \\$n\\$ is defined as follows:\n$$\\text{MPI}(n):=n^{\\text(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires understanding of mathematical concepts related to powers and digits, as well a(...TRUNCATED) | 43,903 | 2,743 | "Okay, let's try to tackle this problem. The task is to generate numbers whose minimal power root (M(...TRUNCATED) | "To solve this problem, we need to generate numbers whose minimal power root (MPR) is neither 1 nor (...TRUNCATED) | "<think>\nOkay, let's try to tackle this problem. The task is to generate numbers whose minimal powe(...TRUNCATED) | "Question: The minimal power iteration of a number \\$n\\$ is defined as follows:\n$$\\text{MPI}(n):(...TRUNCATED) | 1.000009 | [{"from":"human","value":"The minimal power iteration of a number \\$n\\$ is defined as follows:\n$$(...TRUNCATED) |
null | "Background\nThe Sidi polynomial of degree \\$n\\$ – or the \\$(n + 1)\\$th Sidi polynomial – is(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem requires deep understanding of combinatorial mathematics and polynomial properties, sp(...TRUNCATED) | 22,893 | 1,430 | "Okay, I need to find a way to compute the absolute sum Σ_n for the Sidi polynomial of degree n. Le(...TRUNCATED) | "To solve this problem, we need to compute the absolute sum of the coefficients of the Sidi polynomi(...TRUNCATED) | "<think>\nOkay, I need to find a way to compute the absolute sum Σ_n for the Sidi polynomial of deg(...TRUNCATED) | "Question: Background\nThe Sidi polynomial of degree \\$n\\$ – or the \\$(n + 1)\\$th Sidi polynom(...TRUNCATED) | 1.000008 | [{"from":"human","value":"Background\nThe Sidi polynomial of degree \\$n\\$ – or the \\$(n + 1)\\$(...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 18