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 | final_reasoning_trace
string | _domain
string | messages
list | response_seed
string | gpt41_mini_response
string | length
int64 | domain
string | r1_response
string | r1_reasoning_content
string | extract_solution
string | url
string | filename
string | success
bool | page_count
int64 | page_number
int64 | question_choices_solutions
string | extracted_question
string | extracted_answer_choices
sequence | matched_solution
string | qa_validation_outputs
bool | classifier_reasoning
string | is_organic_chemistry
bool | conversations
list |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
9165f5327dce910f3c1f6fdc04857981
| "Some days ago, WJMZBMR learned how to answer the query \"how many times does a string x occur in a (...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe t(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import sys\n\ndef minimal_cyclic_shift(s):\n n = len(s)\n if n == 0:\n return \"\"\n (...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires understanding of cyclical isomorphism, which involves recognizing that two str(...TRUNCATED) | 207 | 6,578 | "<think> Alright, so I have this problem where I need to find out how many substrings of a given str(...TRUNCATED) |
code
| null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | [{"from":"human","value":"Some days ago, WJMZBMR learned how to answer the query \"how many times do(...TRUNCATED) |
null | "Background\nSKI combinator calculus, or simply SKI calculus, is a system similar to lambda calculus(...TRUNCATED) | null | null | null | null | null | 9 | null | null |
stackexchange_codegolf
| "The problem involves deep understanding of SKI combinators, Church encoding, and the construction o(...TRUNCATED) | 332 | 14,723 | "<think> Okay, I need to write a SKI expression that evaluates to the Church list equivalent of \"He(...TRUNCATED) |
code
| null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | [{"from":"human","value":"Background\nSKI combinator calculus, or simply SKI calculus, is a system s(...TRUNCATED) |
afdf1f9f8b4e655a77e13f3a309028d7
| "Ostap is preparing to play chess again and this time he is about to prepare. Thus, he was closely m(...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. So the problem is about determini(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "m, n = map(int, input().split())\npoints = list(map(int, input().split()))\n\n# Step 1: Check if an(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires the implementation of a solution that not only handles complex logic regarding(...TRUNCATED) | 17 | 11,096 | "<think> Okay, let's tackle this problem. Hmm, Ostap remembers the top n sorted points from a tourna(...TRUNCATED) |
code
| null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | [{"from":"human","value":"Ostap is preparing to play chess again and this time he is about to prepar(...TRUNCATED) |
null | "For this golf, you will need to use more than one language.\nThe task\nA Rube Goldberg machine is a(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem requires a deep understanding of multiple programming languages and coding techniques, (...TRUNCATED) | 4 | 7,596 | "<think> Okay, I need to solve this Rube Goldberg machine programming problem. The goal is to create(...TRUNCATED) |
code
| null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | [{"from":"human","value":"For this golf, you will need to use more than one language.\nThe task\nA R(...TRUNCATED) |
4bb2c7d7ee0097058017b045a43f0949
| "Given are two strings s and t consisting of lowercase English letters. Determine if there exists an(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the minimum i such that the first (...TRUNCATED) |
atcoder
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import bisect\nfrom collections import defaultdict\n\ns = input().strip()\nt = input().strip()\n\ns(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem requires deep mathematical insights and a complex algorithmic implementation to handle(...TRUNCATED) | 77 | 4,814 | "<think> Okay, I need to solve this problem where I have to determine if string t can be a subsequen(...TRUNCATED) |
code
| null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | [{"from":"human","value":"Given are two strings s and t consisting of lowercase English letters. Det(...TRUNCATED) |
null | "Task\nA pure mirror checkmate is a checkmate position, where the mated king is surrounded by 8 empt(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires knowledge of chess rules and effective manipulation of data structures to repr(...TRUNCATED) | 140 | 14,684 | "<think> Okay, so I need to determine if a given chess position is a pure mirror checkmate. From the(...TRUNCATED) |
code
| null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | [{"from":"human","value":"Task\nA pure mirror checkmate is a checkmate position, where the mated kin(...TRUNCATED) |
334c542a2a6284a323861b00a9ba64b4
| "Teiji is a number theory lover. All numbers are his friends - so long as they are integers. One day(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) |
aizu
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import heapq\nimport bisect\n\ndef generate_primes(n):\n primes = []\n candidate = 2\n whi(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves calculating the divisor function σ(n), which is a number theory concept, and (...TRUNCATED) | 335 | 3,439 | "<think> Okay, so I have to write a program that calculates the maximum value of σ(n)/n for all n u(...TRUNCATED) |
code
| null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | [{"from":"human","value":"Teiji is a number theory lover. All numbers are his friends - so long as t(...TRUNCATED) |
null | "Your task is to solve a new puzzle called Cubax. This toy is actually a Chinese puzzle whose expect(...TRUNCATED) | null | null | null | null | null | 9 | null | null |
stackexchange_codegolf
| "The problem requires extensive knowledge of advanced algorithms and combinatorial logic to generate(...TRUNCATED) | 86 | 1,741 | "<think> Okay, I need to solve this Cubax puzzle problem. Let's see what's required here. The proble(...TRUNCATED) |
code
| null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | [{"from":"human","value":"Your task is to solve a new puzzle called Cubax. This toy is actually a Ch(...TRUNCATED) |
null | "There are many generalizations of Conway's Game of Life. One of them is the isotropic non-totalisti(...TRUNCATED) | null | null | null | null | null | 9 | null | null |
stackexchange_codegolf
| "The problem requires a deep understanding of cellular automata, specifically isotropic non-totalist(...TRUNCATED) | 287 | 8,590 | "<think> Okay, so I need to write a program that simulates an isotropic non-totalistic cellular auto(...TRUNCATED) |
code
| null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | [{"from":"human","value":"There are many generalizations of Conway's Game of Life. One of them is th(...TRUNCATED) |
92c72e452076be9726d70a524193a40b
| "The game of bingo is played on a 5 × 5 square grid filled with distinct numbers between 1 and 75. (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the problem is about calculating the expected value (...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import math\n\nn, m, k = map(int, input().split())\n\n# Precompute log combinations for n choose s\(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires understanding of expectations in probability theory, combinatorial reasoning t(...TRUNCATED) | 218 | 13,414 | "<think> Okay, so I have this problem about calculating the expected value of a bingo game's score, (...TRUNCATED) |
code
| null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | [{"from":"human","value":"The game of bingo is played on a 5 × 5 square grid filled with distinct n(...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 7