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\nAt the time of writing this, the P vs NP problem is still unsolved, but you might have (...TRUNCATED) | null | null | null | null | null | 9 | null | null |
stackexchange_codegolf
| "The problem involves finding the largest clique in an undirected graph which is a well-known NP-com(...TRUNCATED) | 39,270 | 2,454 | ["Okay, I need to solve this problem where I have to find the largest clique in a graph given by its(...TRUNCATED) | ["To solve this problem, we need to determine the size of the largest clique in an undirected graph (...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to find the largest clique in a graph giv(...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 find the largest clique in a graph giv(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the largest clique in an undirecte(...TRUNCATED) | [{"from":"human","value":"Background\nAt the time of writing this, the P vs NP problem is still unso(...TRUNCATED) |
null | "Task\nGiven an integer \\$n\\in[0,10^{12})\\$ in any convenient format, return the number of stroke(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem involves converting integers into Chinese numerals, which is a non-trivial task due to (...TRUNCATED) | 38,520 | 2,407 | ["Okay, let's tackle this problem. So, the task is to calculate the number of strokes needed to writ(...TRUNCATED) | ["To solve this problem, we need to determine the number of strokes required to write a given intege(...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. So, the task is to calculate the number of strokes neede(...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 calculate the number of strokes neede(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where given a number n, I have to calculate the number (...TRUNCATED) | [{"from":"human","value":"Task\nGiven an integer \\$n\\in[0,10^{12})\\$ in any convenient format, re(...TRUNCATED) |
d84c88b1911e61f7d5e5eb52ba9b5091
| "Two people play the following string game. Initially the players have got some string s. The player(...TRUNCATED) | "<think>\nOkay, so I need to solve this game problem where two players take turns cutting a string i(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "def main():\n import sys\n s = sys.stdin.readline().strip()\n n = len(s)\n if n == 0:\n(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem has a significant strategic depth as it requires analysis of optimal moves and outcomes(...TRUNCATED) | 29,691 | 1,855 | ["Okay, let's see. So the problem is about a game where two players take turns cutting a string into(...TRUNCATED) | ["To solve this problem, we need to determine if the first player can win a string game by making an(...TRUNCATED) | ["<think>\nOkay, let's see. So the problem is about a game where two players take turns cutting a st(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. So the problem is about a game where two players take turns cutting a st(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where two players take turns cutting a string, and the (...TRUNCATED) | [{"from":"human","value":"Two people play the following string game. Initially the players have got (...TRUNCATED) |
null | "A binary relation on a set \\$X\\$ is simply a subset \\$S \\subseteq X \\times X\\$; in other word(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "This problem involves aspects of combinatorial reasoning regarding binary relations and requires un(...TRUNCATED) | 48,528 | 3,033 | ["Okay, I need to solve this problem where I have to count the number of binary relations on a set o(...TRUNCATED) | ["To solve this problem, we need to count the number of binary relations on a set of size \\( n \\) (...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to count the number of binary relations o(...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 count the number of binary relations o(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to count the number of binary relations on(...TRUNCATED) | [{"from":"human","value":"A binary relation on a set \\$X\\$ is simply a subset \\$S \\subseteq X \\(...TRUNCATED) |
null | "Sandbox post\nIn this code-golf challenge, you are provided with a series of y values at even x-val(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "This problem involves generating an ASCII-art ribbon plot based on provided floating-point y-values(...TRUNCATED) | 5,404 | 337 | ["Okay, I need to solve this code golf problem. Let's read through the problem statement carefully a(...TRUNCATED) | ["To solve this problem, we need to generate an ASCII-art ribbon plot from a list of y-values, scale(...TRUNCATED) | ["<think>\nOkay, I need to solve this code golf problem. Let's read through the problem statement ca(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, I need to solve this code golf problem. Let's read through the problem statement ca(...TRUNCATED) | "<think>\nOkay, let's tackle this problem step by step. Hmm, the goal is to create an ASCII ribbon p(...TRUNCATED) | [{"from":"human","value":"Sandbox post\nIn this code-golf challenge, you are provided with a series (...TRUNCATED) |
45fc0b168ff89d6b78d38c8c411278f2
| "Alice and Bob are playing a game with a string of characters, with Alice going first. The string co(...TRUNCATED) | "<think>\nOkay, let's see. We need to find the number of strings of length n using the first k lette(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "n, k, p = map(int, input().split())\n\nif n % 2 == 0:\n result = (pow(k, n, p) - k) % p\nelse:\n(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem involves strategic game theory where the players must optimize their moves based on a (...TRUNCATED) | 13,376 | 836 | ["Okay, let's try to understand this problem. So Alice and Bob are playing this game with a string. (...TRUNCATED) | ["To solve this problem, we need to determine the number of initial words where Alice can win if bot(...TRUNCATED) | ["<think>\nOkay, let's try to understand this problem. So Alice and Bob are playing this game with a(...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 Alice and Bob are playing this game with a(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So the problem is about Alice and Bob playing (...TRUNCATED) | [{"from":"human","value":"Alice and Bob are playing a game with a string of characters, with Alice g(...TRUNCATED) |
c0c38e1cd638113c38130b99b428d394
| "The citizens of BubbleLand are celebrating their 10th anniversary so they decided to organize a big(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding the maximum area convex polygon formed by ex(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import math\nfrom itertools import combinations\n\ndef cross(o, a, b):\n return (a[0] - o[0]) * (...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem requires understanding and implementation of computational geometry, specifically the (...TRUNCATED) | 21,559 | 1,347 | ["Okay, so I need to solve this programming problem. Let me read the problem statement carefully.\n\(...TRUNCATED) | ["To solve this problem, we need to find the maximum area convex polygon formed by exactly K points (...TRUNCATED) | ["<think>\nOkay, so I need to solve this programming problem. Let me read the problem statement care(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, so I need to solve this programming problem. Let me read the problem statement care(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let's read the problem statement carefu(...TRUNCATED) | [{"from":"human","value":"The citizens of BubbleLand are celebrating their 10th anniversary so they (...TRUNCATED) |
149bb212287c7ca59073bae43d04e075
| "Bankopolis is an incredible city in which all the n crossroads are located on a straight line and n(...TRUNCATED) | "<think>\nOkay, let's see. So the problem is about finding the minimum total difficulty of a path th(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import heapq\nimport bisect\n\nn, k = map(int, input().split())\nm = int(input())\n\nadj = [[] for (...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires finding a minimum cost path under specific conditions that involve avoiding pr(...TRUNCATED) | 44,518 | 2,782 | ["Okay, let's try to figure out this problem. Hmm, the problem says that Oleg needs to visit exactly(...TRUNCATED) | ["To solve this problem, we need to find the minimum possible total difficulty of a path that visits(...TRUNCATED) | ["<think>\nOkay, let's try to figure out this problem. Hmm, the problem says that Oleg needs to visi(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's try to figure out this problem. Hmm, the problem says that Oleg needs to visi(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED) | [{"from":"human","value":"Bankopolis is an incredible city in which all the n crossroads are located(...TRUNCATED) |
fd52977d3afc65a6166ebcd78d440b87
| "The Little Elephant loves strings very much. \n\nHe has an array a from n strings, consisting of lo(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let me read the problem statement carefull(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "class State:\n __slots__ = ['len', 'link', 'transitions', 'count', 'last_seen']\n def __init_(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires finding all substrings of given strings that appear in at least k strings from(...TRUNCATED) | 27,705 | 1,731 | ["Okay, let's tackle this problem. Hmm. So the task is, for each string in the array, count the numb(...TRUNCATED) | ["To solve this problem, we need to determine the number of substrings for each string in an array t(...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. Hmm. So the task is, for each string in the array, count(...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's tackle this problem. Hmm. So the task is, for each string in the array, count(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where for each string in the array, I have to count the(...TRUNCATED) | [{"from":"human","value":"The Little Elephant loves strings very much. \n\nHe has an array a from n (...TRUNCATED) |
aaea6fe2d1f4211c499aea69e0178028
| "Once Grisha found a tree (connected graph without cycles) with a root in node 1.\n\nBut this tree w(...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. Hmm, the problem involves handlin(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import sys\nfrom sys import stdin\nsys.setrecursionlimit(1 << 25)\n\ndef main():\n input = sys.s(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves a non-trivial data structure (a tree) and requires a combination of queries th(...TRUNCATED) | 38,372 | 2,398 | ["Okay, let's try to figure out how to solve this problem. So, the problem is about a tree with a pe(...TRUNCATED) | ["To solve this problem, we need to efficiently handle two types of queries on a tree structure with(...TRUNCATED) | ["<think>\nOkay, let's try to figure out how to solve this problem. So, the problem is about a tree (...TRUNCATED) |
[
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's try to figure out how to solve this problem. So, the problem is about a tree (...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So, we have a tree with nodes, each containing(...TRUNCATED) | [{"from":"human","value":"Once Grisha found a tree (connected graph without cycles) with a root in n(...TRUNCATED) |
End of preview.
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.