The full dataset viewer is not available (click to read why). Only showing a preview of the rows.
Data processing error: I/O error: Permission denied (os error 13)
Error code: UnexpectedError
Need help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.
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
sequence | deepseek_solution
sequence | final_reasoning_trace
sequence | correct
sequence | _majority_responses
sequence | verified_final_reasoning_trace
string | conversations
list |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1fbae6dbc968a4e3cf6fc65d547dbb25
| "Your friend recently gave you some slimes for your birthday. You have a very large amount of slimes(...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. So the task is to compute the expected sum of the s(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 9 | "n, p = map(int, input().split())\nq = p / 10**9\n\n# We model the expected sum E(k) after k steps a(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires understanding of probabilities, expected values, and potentially complex dynam(...TRUNCATED) | 33,136 | 2,071 | ["Okay, let's try to tackle this problem. Hmm. So the problem is about calculating the expected sum (...TRUNCATED) | ["To solve this problem, we need to calculate the expected sum of values of slimes on a board after (...TRUNCATED) | ["<think>\nOkay, let's try to tackle this problem. Hmm. So the problem is about calculating the expe(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's try to tackle this problem. Hmm. So the problem is about calculating the expe(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So, the problem is about calculating the expec(...TRUNCATED) | [{"from":"human","value":"Your friend recently gave you some slimes for your birthday. You have a ve(...TRUNCATED) |
b55ca68295839d1e973c99c18c662481
| "Modern cryptosystems rely heavily on our inability to factor large integers quickly as the basis fo(...TRUNCATED) | "<think>\nOkay, I need to determine if a given very large number is prime or composite. The input ca(...TRUNCATED) |
codechef
|
cc-by-4.0
|
code_contests
|
train
| 8 | "n = int(input())\nif n <= 1:\n print(\"COMPOSITE\")\nelif n <= 3:\n print(\"PRIME\")\nelif n (...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves testing the primality of very large numbers (up to 1000 digits), which require(...TRUNCATED) | 36,229 | 2,264 | ["Okay, so I need to determine if a very large number (up to 1000 digits) is prime or composite. Hmm(...TRUNCATED) | ["To solve this problem, we need to determine if a very large number (up to 1000 digits) is prime or(...TRUNCATED) | ["<think>\nOkay, so I need to determine if a very large number (up to 1000 digits) is prime or compo(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, so I need to determine if a very large number (up to 1000 digits) is prime or compo(...TRUNCATED) | "<think>\nOkay, I need to determine if a given very large number is prime or composite. The input ca(...TRUNCATED) | [{"from":"human","value":"Modern cryptosystems rely heavily on our inability to factor large integer(...TRUNCATED) |
null | "Background\nWe will be using a 3x3 cube for this challenge.\nRubik's cubers have their own notation(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem requires deep mathematical insights into group theory and the specific notation for Ru(...TRUNCATED) | 39,126 | 2,445 | ["Okay, I need to solve this problem where I have to expand a Rubik's cube commutator into the indiv(...TRUNCATED) | ["To solve this problem, we need to expand a Rubik's cube commutator into its individual moves. The (...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to expand a Rubik's cube commutator into (...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, I need to solve this problem where I have to expand a Rubik's cube commutator into (...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where given a Rubik's cube commutator, I hav(...TRUNCATED) | [{"from":"human","value":"Background\nWe will be using a 3x3 cube for this challenge.\nRubik's cuber(...TRUNCATED) |
bf4970763e987a9c3f08b3368030ae56
| "If the girl doesn't go to Denis, then Denis will go to the girl. Using this rule, the young man lef(...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 heapq\n\nn, m = map(int, input().split())\nd = list(map(int, input().split()))\ng, r = map(i(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires a deep understanding of algorithm design, particularly in navigating a path su(...TRUNCATED) | 9,923 | 620 | ["Okay, let's try to understand this problem. So Denis needs to cross the road from 0 to n, and ther(...TRUNCATED) | ["To solve this problem, we need to determine the minimal time Denis can cross the road from point 0(...TRUNCATED) | ["<think>\nOkay, let's try to understand this problem. So Denis needs to cross the road from 0 to n,(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's try to understand this problem. So Denis needs to cross the road from 0 to n,(...TRUNCATED) | "<think>\nOkay, let's see. So the problem is about Denis trying to cross a road with safety islands,(...TRUNCATED) | [{"from":"human","value":"If the girl doesn't go to Denis, then Denis will go to the girl. Using thi(...TRUNCATED) |
null | "Challenge\nGiven a string of any length, write it as a triangle, spiraling out from the center. Fo(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "This problem requires a good understanding of string manipulation and complex positional logic. The(...TRUNCATED) | 25,754 | 1,609 | ["Okay, I need to solve this problem where I have to write a string as a triangle spiraling out from(...TRUNCATED) | ["To solve this problem, we need to write a given string as a triangle spiraling out from the center(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to write a string as a triangle spiraling(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, I need to solve this problem where I have to write a string as a triangle spiraling(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to arrange a given string into a triangle (...TRUNCATED) | [{"from":"human","value":"Challenge\nGiven a string of any length, write it as a triangle, spiraling(...TRUNCATED) |
null | "Given an input integer from 1, 2, ..., n, the task to write code to make a number as close as possi(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem requires a deep understanding of mathematical optimization and algorithm design to fin(...TRUNCATED) | 43,657 | 2,728 | ["Okay, I need to solve this problem where given an integer n, I have to generate an arithmetic expr(...TRUNCATED) | ["To solve this problem, we need to generate an arithmetic expression using integers from 1 to n (ea(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where given an integer n, I have to generate an arithm(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, I need to solve this problem where given an integer n, I have to generate an arithm(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where given an integer n, I have to generate an arithme(...TRUNCATED) | [{"from":"human","value":"Given an input integer from 1, 2, ..., n, the task to write code to make a(...TRUNCATED) |
37f9d5a2fc8d7272c8abd1b55b53df61
| "ZS the Coder has recently found an interesting concept called the Birthday Paradox. It states that (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So, the task is to compute the probability that at least (...TRUNCATED) |
codeforces
|
-
|
-
|
-
| 8 | "MOD = 10**6 + 3\nphi_MOD = MOD - 1\n\nn, k = map(int, input().split())\n\n# Check if k exceeds 2^n\(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem involves advanced probability concepts, require insights into combinatorial structures(...TRUNCATED) | 41,521 | 2,595 | ["Okay, I need to solve this programming problem. Let's read the question carefully.\n\nSo the probl(...TRUNCATED) | ["To solve this problem, we need to determine the probability that at least two out of k people shar(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the question carefully.\n\nSo (...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, I need to solve this programming problem. Let's read the question carefully.\n\nSo (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm. So the problem is about calculating the probability (...TRUNCATED) | [{"from":"human","value":"ZS the Coder has recently found an interesting concept called the Birthday(...TRUNCATED) |
null | "A composition of an integer \\$n\\$ is a representation of \\$n\\$ as a sum of positive integers. F(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem requires a deep understanding of combinatorial mathematics, specifically related to co(...TRUNCATED) | 43,154 | 2,697 | ["Okay, I need to find the number of compositions of an integer n where the greatest part is odd. Le(...TRUNCATED) | ["To solve this problem, we need to determine the number of compositions of an integer \\( n \\) whe(...TRUNCATED) | ["<think>\nOkay, I need to find the number of compositions of an integer n where the greatest part i(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, I need to find the number of compositions of an integer n where the greatest part i(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to compute the number of compositions of an integer n wher(...TRUNCATED) | [{"from":"human","value":"A composition of an integer \\$n\\$ is a representation of \\$n\\$ as a su(...TRUNCATED) |
null | "As you may very well know python has lists. As you might not know these lists can contain themselv(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem requires knowledge of data structures (specifically self-referential lists) and a deep (...TRUNCATED) | 6,815 | 425 | ["Okay, I need to write a Python function called equal that compares two lists which might contain t(...TRUNCATED) | ["To solve this problem, we need to compare two lists that may contain themselves or other lists in (...TRUNCATED) | ["<think>\nOkay, I need to write a Python function called equal that compares two lists which might (...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, I need to write a Python function called equal that compares two lists which might (...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to compare two Python lists that might con(...TRUNCATED) | [{"from":"human","value":"As you may very well know python has lists. As you might not know these l(...TRUNCATED) |
null | "Challenge\nGiven an array of positive integers and a threshold, the algorithm should output a set o(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem involves advanced concepts such as greedy algorithms, combinatorial optimization, and p(...TRUNCATED) | 40,985 | 2,561 | ["Okay, let's tackle this problem. So, the task is to split an array of positive integers into group(...TRUNCATED) | ["To solve this problem, we need to split an array of positive integers into consecutive groups such(...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. So, the task is to split an array of positive integers i(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's tackle this problem. So, the task is to split an array of positive integers i(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where given an array of positive integers an(...TRUNCATED) | [{"from":"human","value":"Challenge\nGiven an array of positive integers and a threshold, the algori(...TRUNCATED) |
End of preview.
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.