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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "Background\nConway chained arrow notation is a notation to express very large numbers. It consists (...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem requires understanding and implementing a specific mathematical notation (Conway chaine(...TRUNCATED) | 33,340 | 2,083 | ["Okay, I need to solve this problem where I have to evaluate a Conway chained arrow notation. Let's(...TRUNCATED) | ["To solve this problem, we need to evaluate a Conway chained arrow notation, which is a way to expr(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to evaluate a Conway chained arrow notati(...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 evaluate a Conway chained arrow notati(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to evaluate a Conway chained arrow notatio(...TRUNCATED) | [{"from":"human","value":"Background\nConway chained arrow notation is a notation to express very la(...TRUNCATED) |
null | "Task:\nConsider the problem: \"given a chessboard with one square missing, cut it into 21 L-triomin(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem involves a complex constructive proof and requires both algorithmic implementation and(...TRUNCATED) | 19,809 | 1,238 | ["Okay, I need to solve this problem where I have to tile an 8x8 chessboard missing one square with (...TRUNCATED) | ["To solve this problem, we need to tile an 8x8 chessboard with one missing square using L-shaped tr(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to tile an 8x8 chessboard missing one squ(...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 tile an 8x8 chessboard missing one squ(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to tile an 8x8 chessboard minus one square(...TRUNCATED) | [{"from":"human","value":"Task:\nConsider the problem: \"given a chessboard with one square missing,(...TRUNCATED) |
null | "This challenge will have you count pseudo-polyforms on the snub square tiling.\nI think that this s(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem involves counting generalized pseudo-polyforms on the snub square tiling, which require(...TRUNCATED) | 12,175 | 760 | ["Okay, let's try to tackle this problem. The goal is to count pseudo-polyforms on the snub square t(...TRUNCATED) | ["To solve this problem, we need to count the number of unique pseudo-polyforms on the snub square t(...TRUNCATED) | ["<think>\nOkay, let's try to tackle this problem. The goal is to count pseudo-polyforms on the snub(...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. The goal is to count pseudo-polyforms on the snub(...TRUNCATED) | "<think>\nOkay, I need to find the number of pseudo-polyforms on the snub square tiling for each n, (...TRUNCATED) | [{"from":"human","value":"This challenge will have you count pseudo-polyforms on the snub square til(...TRUNCATED) |
null | "Problem\nA fact you may have noticed about factorials is that as \\$n\\$ gets larger \\$n!\\$ will (...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem requires understanding and implementing an efficient algorithm for counting trailing ze(...TRUNCATED) | 58,416 | 3,651 | ["Okay, so I need to find the smallest x such that x! has at least n trailing zeros in base b. Hmm. (...TRUNCATED) | ["To solve this problem, we need to determine the smallest integer \\( x \\) such that \\( x! \\) ha(...TRUNCATED) | ["<think>\nOkay, so I need to find the smallest x such that x! has at least n trailing zeros in base(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, so I need to find the smallest x such that x! has at least n trailing zeros in base(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the smallest x such that x! has at(...TRUNCATED) | [{"from":"human","value":"Problem\nA fact you may have noticed about factorials is that as \\$n\\$ g(...TRUNCATED) |
4ef8b147e7fa1007434930193d5a7a95
| "Chances are that you have probably already heard of the travelling salesman problem. If you have, t(...TRUNCATED) | "<think>\nOkay, let's see. So the problem is a variation of the traveling salesman problem, but with(...TRUNCATED) |
kattis
|
mit
|
apps
|
test
| 9 | "def main():\n import sys\n input = sys.stdin.read\n data = input().split()\n idx = 0\n (...TRUNCATED) |
3512
|
nvidia/OpenCodeReasoning
| "The problem presented is a variation of the Traveling Salesman Problem (TSP), which is a well-known(...TRUNCATED) | 56,183 | 3,511 | ["Okay, let's see. We have to solve this modified traveling salesman problem where the salesman has (...TRUNCATED) | ["To solve this problem, we need to find the minimum total flight duration for the travelling salesm(...TRUNCATED) | ["<think>\nOkay, let's see. We have to solve this modified traveling salesman problem where the sale(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. We have to solve this modified traveling salesman problem where the sale(...TRUNCATED) | "<think>\nOkay, let's see. We have to solve this modified traveling salesman problem where the sales(...TRUNCATED) | [{"from":"human","value":"Chances are that you have probably already heard of the travelling salesma(...TRUNCATED) |
null | "These are ASCII dandelions:\n \\|/ \\ / | \n /|\\ | \\|/ | (...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem involves generating ASCII art based on parameters, which requires a strong understandin(...TRUNCATED) | 29,788 | 1,861 | ["Okay, I need to solve this problem where I have to write a program or function that can both gener(...TRUNCATED) | ["To solve this problem, we need to create a program that can both generate ASCII dandelions from gi(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to write a program or function that can b(...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 program or function that can b(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to write a program or function that conver(...TRUNCATED) | [{"from":"human","value":"These are ASCII dandelions:\n \\|/ \\ / | \n /|\\ (...TRUNCATED) |
null | "Your challenge is simple. Write two programs that share no characters which output each other.\nExa(...TRUNCATED) | null | null | null | null | null | 9 | null | null |
stackexchange_codegolf
| "This problem requires extensive knowledge of programming concepts, specifically quines and mutual e(...TRUNCATED) | 54,545 | 3,409 | ["Okay, I need to create two programs, P and Q, that output each other and share no characters. Both(...TRUNCATED) | ["To solve this problem, we need to create two programs, P and Q, such that each program outputs the(...TRUNCATED) | ["<think>\nOkay, I need to create two programs, P and Q, that output each other and share no charact(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, I need to create two programs, P and Q, that output each other and share no charact(...TRUNCATED) | "<think>\nOkay, I need to create two programs, P and Q, that output each other and share no characte(...TRUNCATED) | [{"from":"human","value":"Your challenge is simple. Write two programs that share no characters whic(...TRUNCATED) |
8efdf9b44d97ebb7729d460d863d407d
| "In the intergalactic empire Bubbledom there are N planets, of which some pairs are directly connect(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem. The problem is about calculatin(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 9 | "import sys\n\ndef main():\n input = sys.stdin.read().split()\n ptr = 0\n N = int(input[ptr(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves understanding the properties of trees (which are defined as connected acyclic (...TRUNCATED) | 16,498 | 1,031 | ["Okay, let's see. The problem is about calculating the expected number of connected components afte(...TRUNCATED) | ["To solve this problem, we need to determine the expected number of connected components (kingdoms)(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is about calculating the expected number of connected compon(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. The problem is about calculating the expected number of connected compon(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the problem is about calculating the expected number(...TRUNCATED) | [{"from":"human","value":"In the intergalactic empire Bubbledom there are N planets, of which some p(...TRUNCATED) |
286bc26c2f8ab87cc869d6904d77a34f
| "This issue is a reactive issue. It is necessary to create a program that derives the correct answer(...TRUNCATED) | "<think>\nOkay, so I need to write a Python program that interacts with a server. Hmm, reactive issu(...TRUNCATED) |
aizu
|
cc-by-4.0
|
code_contests
|
train
| 9 | "import sys\n\nfor line in sys.stdin:\n line = line.strip()\n # Process the input line here an(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves creating a program that interacts with a server-side program, which often requ(...TRUNCATED) | 1,246 | 77 | ["Okay, let's see. I need to create a program that interacts with a server-side program to derive th(...TRUNCATED) | ["To solve this problem, we need to create an interactive program that communicates with a server-si(...TRUNCATED) | ["<think>\nOkay, let's see. I need to create a program that interacts with a server-side program to (...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. I need to create a program that interacts with a server-side program to (...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem where I have to interactively respond to(...TRUNCATED) | [{"from":"human","value":"This issue is a reactive issue. It is necessary to create a program that d(...TRUNCATED) |
9efffe67dce9987cd4dbcf20a2540340
| "You are given two convex polygons $A$ and $B$. It is guaranteed that $B$ is strictly contained insi(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the minimum cost to cut out polygon B from polygon(...TRUNCATED) |
kattis
|
mit
|
apps
|
test
| 8 | "import math\n\ndef perimeter(points):\n n = len(points)\n total = 0.0\n for i in range(n):(...TRUNCATED) |
3590
|
nvidia/OpenCodeReasoning
| "The problem involves geometric algorithms and requires a good understanding of convex polygons, the(...TRUNCATED) | 8,095 | 505 | ["Okay, let's see. I need to find the minimum cost to cut polygon B out of polygon A using straight (...TRUNCATED) | ["To solve this problem, we need to determine the minimum cost required to cut out polygon B from po(...TRUNCATED) | ["<think>\nOkay, let's see. I need to find the minimum cost to cut polygon B out of polygon A using (...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. I need to find the minimum cost to cut polygon B out of polygon A using (...TRUNCATED) | "<think>\nOkay, so I have this problem where I need to find the minimum cost to cut out polygon B fr(...TRUNCATED) | [{"from":"human","value":"You are given two convex polygons $A$ and $B$. It is guaranteed that $B$ i(...TRUNCATED) |
End of preview.
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.