Dataset Viewer
id
stringclasses 805
values | instruction_seed
stringlengths 80
53.1k
| output
stringlengths 4.44k
71.6k
⌀ | source
stringclasses 10
values | license
stringclasses 4
values | dataset
stringclasses 4
values | split
stringclasses 3
values | difficulty
int64 6
10
| solution
stringlengths 8
8.94k
⌀ | index
stringclasses 129
values | _source
stringclasses 2
values | difficulty_reasoning
stringlengths 256
886
| __original_row_idx
int64 2
63.2k
| ms_id
int64 0
3.95k
| reasoning
stringlengths 3.51k
111k
| deepseek_solution
stringlengths 0
64.8k
| final_reasoning_trace
stringlengths 4.16k
127k
| question_answer_string
stringlengths 4.42k
129k
| _fasttext_score
float64 1
1
| conversations
listlengths 2
2
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "The task is simple: given a 32 bit integer, convert it to its floating point value as defined by th(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem requires a deep understanding of the IEEE 754 floating-point standard, as well as know(...TRUNCATED) | 47,562 | 2,972 | "Okay, I need to convert a 32-bit integer into its corresponding IEEE 754 single-precision floating-(...TRUNCATED) | "To solve this problem, we need to convert a 32-bit integer into its corresponding IEEE 754 single-p(...TRUNCATED) | "<think>\nOkay, I need to convert a 32-bit integer into its corresponding IEEE 754 single-precision (...TRUNCATED) | "Question: The task is simple: given a 32 bit integer, convert it to its floating point value as def(...TRUNCATED) | 1.00001 | [{"from":"human","value":"The task is simple: given a 32 bit integer, convert it to its floating poi(...TRUNCATED) |
2057ec2f0b575bc7d713ea5ac404a3d1
| "In modern cryptography much is tied to the algorithmic complexity of solving several problems. One (...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the discrete logarithm in the nimb(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 9 | "import sys\nfrom functools import lru_cache\n\nmemo_power = {}\n\ndef find_power(x):\n if x < 2:(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem involves understanding advanced concepts in number theory and cryptography, specifical(...TRUNCATED) | 28,867 | 1,804 | "Okay, let's tackle this problem. So, the task is to find x such that a^⊙x = b in the nimber field(...TRUNCATED) | "To solve this problem, we need to find the discrete logarithm in the nimber field, which involves s(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So, the task is to find x such that a^⊙x = b in the nim(...TRUNCATED) | "Question: In modern cryptography much is tied to the algorithmic complexity of solving several prob(...TRUNCATED) | 1 | [{"from":"human","value":"In modern cryptography much is tied to the algorithmic complexity of solvi(...TRUNCATED) |
null | "From Codidact with permission.\nDescription\nAPL trains are a series of functions, that get applied(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem requires a deep understanding of functional programming concepts, particularly how fun(...TRUNCATED) | 42,819 | 2,676 | "Okay, I need to find a way to generate the evaluation order for an APL train with n functions. Let'(...TRUNCATED) | "To solve this problem, we need to determine the evaluation order of functions in an APL train, whic(...TRUNCATED) | "<think>\nOkay, I need to find a way to generate the evaluation order for an APL train with n functi(...TRUNCATED) | "Question: From Codidact with permission.\nDescription\nAPL trains are a series of functions, that g(...TRUNCATED) | 1.000008 | [{"from":"human","value":"From Codidact with permission.\nDescription\nAPL trains are a series of fu(...TRUNCATED) |
null | "The task is to provide code that evaluates to 0.5 numerically, i.e. the output must be recognized b(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem requires a deep understanding of programming concepts and creative problem-solving skil(...TRUNCATED) | 11,620 | 726 | "Okay, so I need to create a code snippet that evaluates to 0.5 without using any digits 0-9. The ex(...TRUNCATED) | "To solve this problem, we need to generate a numeric value of 0.5 without using any digits (0-9) in(...TRUNCATED) | "<think>\nOkay, so I need to create a code snippet that evaluates to 0.5 without using any digits 0-(...TRUNCATED) | "Question: The task is to provide code that evaluates to 0.5 numerically, i.e. the output must be re(...TRUNCATED) | 1.00001 | [{"from":"human","value":"The task is to provide code that evaluates to 0.5 numerically, i.e. the ou(...TRUNCATED) |
null | "Qat is a tool that lets you search for words matching a given pattern, often used by crossword and (...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem involves understanding pattern matching, variable assignments, and a series of equation(...TRUNCATED) | 11,489 | 718 | "Okay, let's tackle this problem. Hmm, the task is to implement a subset of Qat's equation solver ba(...TRUNCATED) | "To solve this problem, we need to implement a subset of Qat's equation solver, which involves solvi(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the task is to implement a subset of Qat's equation (...TRUNCATED) | "Question: Qat is a tool that lets you search for words matching a given pattern, often used by cros(...TRUNCATED) | 1.000008 | [{"from":"human","value":"Qat is a tool that lets you search for words matching a given pattern, oft(...TRUNCATED) |
null | "Given infinite different integers, order them into a sequence \\$a_1, a_2, a_3, ...\\$ such that \\(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem requires deep mathematical insights into the underlying structure of integer sequences(...TRUNCATED) | 51,918 | 3,244 | "Okay, let's see. The problem is to order an infinite set of distinct integers into a sequence where(...TRUNCATED) | "To solve this problem, we need to generate a sequence from an infinite set of distinct integers suc(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to order an infinite set of distinct integers into a seque(...TRUNCATED) | "Question: Given infinite different integers, order them into a sequence \\$a_1, a_2, a_3, ...\\$ su(...TRUNCATED) | 1.000001 | [{"from":"human","value":"Given infinite different integers, order them into a sequence \\$a_1, a_2,(...TRUNCATED) |
null | "Objective\nGiven an Arabic string consisting of ISO/IEC 8859-6 Arabic letters (U+0621–063A, 0640(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem involves a deep understanding of how Arabic characters are rendered in different forms (...TRUNCATED) | 4,679 | 292 | "Okay, let's tackle this problem. So the task is to convert an Arabic string from ISO-8859-6 encodin(...TRUNCATED) | "To solve this problem, we need to convert an Arabic string composed of ISO/IEC 8859-6 characters in(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So the task is to convert an Arabic string from ISO-8859-(...TRUNCATED) | "Question: Objective\nGiven an Arabic string consisting of ISO/IEC 8859-6 Arabic letters (U+0621–0(...TRUNCATED) | 1.000007 | [{"from":"human","value":"Objective\nGiven an Arabic string consisting of ISO/IEC 8859-6 Arabic lett(...TRUNCATED) |
d127d5ce3b91003beb7529c8e4cbf5c6
| "Winter is here at the North and the White Walkers are close. John Snow has an army consisting of n (...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 | "n = int(input())\na = list(map(int, input().split()))\nMOD = 10**9 + 7\n\nmax_a = max(a) if a else (...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires understanding and manipulation of the greatest common divisor (gcd) over combi(...TRUNCATED) | 41,137 | 2,571 | "Okay, so I have this programming problem to solve, and I need to figure out how to approach it. Let(...TRUNCATED) | "To solve this problem, we need to calculate the strength of John Snow's army based on the strengths(...TRUNCATED) | "<think>\nOkay, so I have this programming problem to solve, and I need to figure out how to approac(...TRUNCATED) | "Question: Winter is here at the North and the White Walkers are close. John Snow has an army consis(...TRUNCATED) | 1.000005 | [{"from":"human","value":"Winter is here at the North and the White Walkers are close. John Snow has(...TRUNCATED) |
bc56f8034c81292722d43d9877e74655
| "Ali is Hamed's little brother and tomorrow is his birthday. Hamed wants his brother to earn his gif(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about a rooted tree where each edge has a weight, and we n(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import sys\nfrom collections import defaultdict\nMOD = 10**9 + 7\nsys.setrecursionlimit(1 << 25)\n\(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires a deep understanding of tree structures, as well as efficient algorithms to co(...TRUNCATED) | 4,662 | 291 | "Okay, I need to solve this programming problem for Ali. Let's read the problem carefully.\n\nSo the(...TRUNCATED) | "To solve this problem, we need to compute the function f(u, v) for each query on a rooted tree. The(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem for Ali. Let's read the problem carefully.\(...TRUNCATED) | "Question: Ali is Hamed's little brother and tomorrow is his birthday. Hamed wants his brother to ea(...TRUNCATED) | 1.00001 | [{"from":"human","value":"Ali is Hamed's little brother and tomorrow is his birthday. Hamed wants hi(...TRUNCATED) |
53451373bd569d41536cd279fc8a7875
| "Consider the decimal presentation of an integer. Let's call a number d-magic if digit d appears in (...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let's read the problem statement carefu(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "MOD = 10**9 + 7\n\ndef subtract_one(s):\n s_list = list(s)\n i = len(s_list) - 1\n while i(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem requires a combination of number theory (to handle multiples of m), advanced digit man(...TRUNCATED) | 56,727 | 3,545 | "Okay, I need to solve this problem where I have to count the number of d-magic numbers between a an(...TRUNCATED) | "To solve this problem, we need to count the number of d-magic numbers within a given range [a, b] t(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to count the number of d-magic numbers bet(...TRUNCATED) | "Question: Consider the decimal presentation of an integer. Let's call a number d-magic if digit d a(...TRUNCATED) | 1.000009 | [{"from":"human","value":"Consider the decimal presentation of an integer. Let's call a number d-mag(...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 21