id stringlengths 32 32 ⌀ | instruction_seed stringlengths 201 22.6k | output stringlengths 4.44k 70.8k ⌀ | source stringclasses 9
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 3
values | difficulty int64 6 10 | solution stringlengths 0 12.5k ⌀ | index stringclasses 49
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 259 821 | __original_row_idx int64 23 40.6k | ms_id int64 0 3.94k | reasoning sequencelengths 16 16 | deepseek_solution sequencelengths 16 16 | final_reasoning_trace sequencelengths 16 16 | correct sequencelengths 16 16 | classifier_reasoning stringlengths 139 1.78k | _majority_responses sequencelengths 1 16 | verified_final_reasoning_trace stringlengths 6.13k 110k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
c0b06f021efb9a8ae75b2fa828e06140 | "It was the last day of the summer camp you strayed into the labyrinth on the way to Komaba Campus, (...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let me read the problem statement carefull(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom collections import deque\n\nW, H = map(int, sys.stdin.readline().split())\n\niniti(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires a combination of advanced graph traversal (using BFS or DFS due to multiple la(...TRUNCATED) | 6,712 | 1,153 | ["Okay, let's tackle this programming problem. Hmm, the problem seems a bit complex. Let's read it c(...TRUNCATED) | ["To solve this problem, we need to navigate a labyrinth with two floors, switches that toggle the f(...TRUNCATED) | ["<think>\nOkay, let's tackle this programming problem. Hmm, the problem seems a bit complex. Let's (...TRUNCATED) | [
false,
true,
false,
true,
true,
false,
true,
true,
false,
true,
false,
true,
true,
false,
true,
true
] | "The provided code does not fully implement the problem as described. It lacks several critical step(...TRUNCATED) | ["<think>\nOkay, so I need to solve this labyrinth problem. Let's try to understand the problem firs(...TRUNCATED) | "<think>\nOkay, let's try to tackle this problem. Hmm, the problem statement is a bit complex. So, t(...TRUNCATED) | [{"from":"human","value":"It was the last day of the summer camp you strayed into the labyrinth on t(...TRUNCATED) |
1318f00ca8d4a923bb5030b5eae7b4cf | "You are given a set of n points in a 2D plane. No three points are collinear.\n\nA pentagram is a s(...TRUNCATED) | "<think>\nOkay, let's see. We need to count the number of pentagrams formed by any five points from (...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import itertools\n\ndef cross(o, a, b):\n return (a[0] - o[0]) * (b[1] - o[1]) - (a[1] - o[1]) *(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires a deep understanding of geometric properties and combinatorial counting. The (...TRUNCATED) | 2,963 | 364 | ["Okay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe task is t(...TRUNCATED) | ["To solve this problem, we need to count the number of ways to select 5 points from a given set tha(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe (...TRUNCATED) | [
false,
true,
false,
true,
false,
false,
false,
true,
true,
false,
false,
true,
true,
false,
false,
false
] | "The provided code snippet does not handle the problem correctly as outlined. While it calculates th(...TRUNCATED) | ["<think>\nOkay, let's see. I need to count the number of pentagrams formed by 5 points in a given s(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to count the number of pentagrams formed b(...TRUNCATED) | [{"from":"human","value":"You are given a set of n points in a 2D plane. No three points are colline(...TRUNCATED) |
23fc29ba134691315db0bd3044fd1cea | "Everyone wants to live as long a life as possible. As time progresses, technology progresses. Vario(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about maximizing the lifespan by choosing the right pills.(...TRUNCATED) | kattis | mit | apps | test | 8 | "n, p, c = map(int, input().split())\npills = []\nfor _ in range(p):\n t, x, y = map(int, input()(...TRUNCATED) | 3520 | nvidia/OpenCodeReasoning | "The problem involves advanced mathematical insights combined with complex algorithmic implementatio(...TRUNCATED) | 20,261 | 3,575 | ["Okay, let's tackle this programming problem. Hmm, the problem is about maximizing the lifespan by (...TRUNCATED) | ["To solve this problem, we need to determine the maximum lifespan achievable by taking advantage of(...TRUNCATED) | ["<think>\nOkay, let's tackle this programming problem. Hmm, the problem is about maximizing the lif(...TRUNCATED) | [
true,
false,
true,
true,
true,
false,
false,
true,
true,
false,
true,
true,
false,
true,
false,
true
] | "The provided code effectively implements the outlined solution to the problem of maximizing lifespa(...TRUNCATED) | ["<think>\nOkay, let's tackle this programming problem. Hmm, the problem is about maximizing the lif(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's start by understanding the problem c(...TRUNCATED) | [{"from":"human","value":"Everyone wants to live as long a life as possible. As time progresses, tec(...TRUNCATED) |
b625a559aa50f96bb76c8b952ab7c579 | "The leader of some very secretive organization has decided to invite all other members to a meeting(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem. The problem is about finding th(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom heapq import heappush, heappop\n\nclass Edge:\n def __init__(self, to, rev, cap(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires an understanding of graph traversal and optimization strategies to minimize a (...TRUNCATED) | 9,695 | 1,767 | ["Okay, let's see. I need to find the minimal discontent for the leader when all members reach cross(...TRUNCATED) | ["To solve this problem, we need to minimize the leader's discontent when all members of the organiz(...TRUNCATED) | ["<think>\nOkay, let's see. I need to find the minimal discontent for the leader when all members re(...TRUNCATED) | [
true,
false,
false,
false,
false,
true,
false,
true,
false,
true,
true,
true,
true,
true,
true,
true
] | "The code snippet correctly implements a minimum cost flow algorithm to compute the optimal paths fo(...TRUNCATED) | ["<think>\nOkay, let's see. I need to find the minimal discontent for the leader when all members re(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let's read the problem statement carefu(...TRUNCATED) | [{"from":"human","value":"The leader of some very secretive organization has decided to invite all o(...TRUNCATED) |
null | "This is a cops-and-robbers challenge the Robbers' Thread can be found here\nYour challenge is to wr(...TRUNCATED) | null | null | null | null | null | 9 | null | null | stackexchange_codegolf | "The problem is a complex variation of the classic quine challenge, which itself is already non-triv(...TRUNCATED) | 3,179 | 459 | ["Okay, so I need to create a program that outputs an anagram of its own source code, but not the or(...TRUNCATED) | ["BA","The output of the hidden program is an anagram of its source code. Here's the output:\n\n```p(...TRUNCATED) | ["<think>\nOkay, so I need to create a program that outputs an anagram of its own source code, but n(...TRUNCATED) | [
true,
false,
false,
true,
true,
true,
true,
true,
false,
true,
false,
false,
false,
true,
true,
true
] | "The provided code snippet outputs 'BA', which is indeed an anagram of the original source code 'AB'(...TRUNCATED) | ["<think>\nOkay, so I need to create a program that outputs an anagram of its own source code, but n(...TRUNCATED) | "<think>\nOkay, so I need to create a program that outputs an anagram of its own source code, but no(...TRUNCATED) | [{"from":"human","value":"This is a cops-and-robbers challenge the Robbers' Thread can be found here(...TRUNCATED) |
440988c68a53af541267591e70a67315 | "Let f(x) = a0 + a1x + a2x2 + ... + adxd be the function where each ai (0 ≤ i ≤ d) is a constant(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find all complex integer solutions to a(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | 9 | "import math\n\nd = int(input())\ncoeffs = list(map(int, input().split()))\nleading_coeff = coeffs[-(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves finding complex integer solutions for a polynomial equation of degree d, which(...TRUNCATED) | 18,603 | 3,091 | ["Okay, I need to solve this problem where I have to find all complex integer solutions to a polynom(...TRUNCATED) | ["To solve this problem, we need to find all complex integer solutions (Gaussian integers) of a give(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to find all complex integer solutions to (...TRUNCATED) | [
false,
true,
true,
false,
true,
false,
true,
true,
true,
true,
true,
true,
true,
false,
true,
true
] | "The provided code snippet attempts to solve the problem of finding complex integer solutions for th(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem where I have to find all complex integer s(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem where I have to find all complex integer so(...TRUNCATED) | [{"from":"human","value":"Let f(x) = a0 + a1x + a2x2 + ... + adxd be the function where each ai (0 (...TRUNCATED) |
fb8bb622002d6bd8da8c87b66eca4d34 | "You are a member of the space station engineering team, and are assigned a task in the construction(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where I have to connect all the cells in a s(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | 8 | "import math\n\nclass DSU:\n def __init__(self, size):\n self.parent = list(range(size))\n(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires a deep understanding of geometry in three dimensions, as well as a solid gras(...TRUNCATED) | 20,256 | 3,718 | ["Okay, so I need to solve this programming problem. Let's read the problem carefully.\n\nThe proble(...TRUNCATED) | ["To solve this problem, we need to design a configuration for a space station such that all cells ((...TRUNCATED) | ["<think>\nOkay, so I need to solve this programming problem. Let's read the problem carefully.\n\nT(...TRUNCATED) | [
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | "The provided code snippet correctly implements a solution to the described problem of connecting ce(...TRUNCATED) | ["<think>\nOkay, so I need to solve this programming problem. Let's read the problem carefully.\n\nT(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem. The problem is about connecting(...TRUNCATED) | [{"from":"human","value":"You are a member of the space station engineering team, and are assigned a(...TRUNCATED) |
c6c7ed39ac93e2de3fa08406a01099b3 | "You are given an undirected weighted connected graph with n vertices and m edges without loops and (...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 | "import sys\nfrom collections import deque\n\ndef main():\n sys.setrecursionlimit(1 << 25)\n n(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem involves understanding of minimum spanning trees (MSTs) and how to manipulate edge wei(...TRUNCATED) | 24,197 | 2,865 | ["Okay, let's try to tackle this problem. Hmm, the task is to make sure that after some edge weight (...TRUNCATED) | ["To solve this problem, we need to ensure that the Minimum Spanning Tree (MST) of a given graph bec(...TRUNCATED) | ["<think>\nOkay, let's try to tackle this problem. Hmm, the task is to make sure that after some edg(...TRUNCATED) | [
true,
true,
false,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | "The provided code correctly implements the solution approach for finding a unique Minimum Spanning (...TRUNCATED) | ["<think>\nOkay, let's try to tackle this problem. Hmm, the task is to make sure that after some edg(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So, the task is to modify the edges of a graph(...TRUNCATED) | [{"from":"human","value":"You are given an undirected weighted connected graph with n vertices and m(...TRUNCATED) |
3c98412d08d4336fab2dbc7e419f6e49 | "For his computer science class, Jacob builds a model tree with sticks and balls containing n nodes (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the problem is about finding the best possible minim(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom collections import deque\n\ndef main():\n n, k = map(int, sys.stdin.readline().(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves constructing a tree and optimizing the traversal order to maximize the minimum(...TRUNCATED) | 28,079 | 3,125 | ["Okay, let's try to figure out this problem. So, Jacob has a tree structure made of nodes, and each(...TRUNCATED) | ["To solve this problem, we need to determine the maximum grade Jacob can achieve by selecting the o(...TRUNCATED) | ["<think>\nOkay, let's try to figure out this problem. So, Jacob has a tree structure made of nodes,(...TRUNCATED) | [
true,
true,
true,
true,
true,
false,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | "The provided code snippet correctly implements the described solution to the problem posed. It effe(...TRUNCATED) | ["<think>\nOkay, let's try to figure out this problem. So, Jacob has a tree structure made of nodes,(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding the best possible grade Jacob can get by cho(...TRUNCATED) | [{"from":"human","value":"For his computer science class, Jacob builds a model tree with sticks and (...TRUNCATED) |
null | "(Inspired by this comment on an old question.)\nBackground\nAn error quine (also known as a \"Kimia(...TRUNCATED) | null | null | null | null | null | 9 | null | null | stackexchange_codegolf | "This problem requires extensive knowledge of programming concepts including quines, compiler behavi(...TRUNCATED) | 25,444 | 1,775 | ["Okay, I need to create a program that is both a proper quine and an error quine. Let's break down (...TRUNCATED) | ["To solve this problem, we need a program that acts as both a proper quine (outputs its own source (...TRUNCATED) | ["<think>\nOkay, I need to create a program that is both a proper quine and an error quine. Let's br(...TRUNCATED) | [
false,
false,
true,
false,
false,
true,
true,
false,
false,
true,
false,
false,
false,
false,
true,
false
] | "The problem of creating a proper error quine is highly complicated and often involves nuances speci(...TRUNCATED) | ["<think>\nOkay, I need to create a quine that's also an error quine. So when I run the program norm(...TRUNCATED) | "<think>\nOkay, I need to create a quine that's also an error quine. So when I run the program norma(...TRUNCATED) | [{"from":"human","value":"(Inspired by this comment on an old question.)\nBackground\nAn error quine(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6