id stringlengths 32 32 ⌀ | instruction_seed stringlengths 187 53.1k | output stringlengths 3.8k 70.8k ⌀ | source stringclasses 10
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 3
values | difficulty int64 6 10 | solution stringlengths 0 7.89k ⌀ | index stringclasses 85
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 256 886 | __original_row_idx int64 43 43k | ms_id int64 0 3.95k | reasoning sequencelengths 16 16 | deepseek_solution sequencelengths 16 16 | final_reasoning_trace sequencelengths 16 16 | correct sequencelengths 16 16 | classifier_reasoning stringlengths 111 2.02k | _majority_responses sequencelengths 1 16 | verified_final_reasoning_trace stringlengths 1.76k 109k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "An ***ameoba graph**** is a type of tree whose nodes all have values from 0 to some non-negative in(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "This problem requires a solid understanding of tree structures and the concept of greedy algorithms(...TRUNCATED) | 18,881 | 3,239 | ["Okay, I need to solve this problem where I have to generate an ameoba graph up to N=8 based on the(...TRUNCATED) | ["To solve this problem, we need to generate an ameoba graph up to a given level N. The graph is con(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to generate an ameoba graph up to N=8 bas(...TRUNCATED) | [
true,
true,
false,
true,
false,
false,
true,
true,
false,
true,
false,
false,
false,
false,
false,
false
] | "The provided code snippet correctly implements the inductive growth rules for an ameoba graph as de(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to generate an ameoba graph up to N=8 bas(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to generate an ameoba graph up to N=8 base(...TRUNCATED) | [{"from":"human","value":"An ***ameoba graph**** is a type of tree whose nodes all have values from (...TRUNCATED) |
null | "Did you know that Heronian Tetrahedra Are Lattice Tetrahedra? A Heronian tetrahedron is a tetrahedr(...TRUNCATED) | null | null | null | null | null | 9 | null | null | stackexchange_codegolf | "This problem requires extensive knowledge of geometry, specifically the properties of Heronian tetr(...TRUNCATED) | 31,073 | 2,391 | ["Okay, I need to solve this problem where given the six edge lengths of a Heronian tetrahedron, I h(...TRUNCATED) | ["To solve this problem, we need to find integer coordinates for the vertices of a Heronian tetrahed(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where given the six edge lengths of a Heronian tetrahe(...TRUNCATED) | [
false,
false,
false,
false,
false,
true,
false,
false,
true,
true,
false,
false,
false,
false,
false,
false
] | "The provided code snippet is not a correct solution to the problem of finding integer coordinates f(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where given the six edge lengths of a Heronian tetrahe(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where given the six edge lengths of a Heronian tetrahed(...TRUNCATED) | [{"from":"human","value":"Did you know that Heronian Tetrahedra Are Lattice Tetrahedra? A Heronian t(...TRUNCATED) |
null | "Introduction\nThere have been a few examples of the smallest possible OCI container that does \"X\"(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires a solid understanding of signal handling, process management, and Docker conta(...TRUNCATED) | 11,744 | 2,729 | ["Okay, let's tackle this challenge. The goal is to create the smallest possible OCI container that (...TRUNCATED) | ["To solve this problem, we need to create the smallest possible OCI container that correctly handle(...TRUNCATED) | ["<think>\nOkay, let's tackle this challenge. The goal is to create the smallest possible OCI contai(...TRUNCATED) | [
true,
true,
true,
false,
true,
true,
true,
true,
true,
true,
true,
false,
false,
true,
true,
true
] | "The provided code snippet correctly handles PID 1 signal responsibilities by implementing proper si(...TRUNCATED) | ["<think>\nOkay, let's tackle this challenge. The goal is to create the smallest possible OCI contai(...TRUNCATED) | "<think>\nOkay, I need to create the smallest possible Docker container that correctly handles termi(...TRUNCATED) | [{"from":"human","value":"Introduction\nThere have been a few examples of the smallest possible OCI (...TRUNCATED) |
ad1c426a5f4022160c35c3e8c0dcc8e4 | "Try guessing the statement from this picture <http://tiny.cc/ogyoiz>.\n\nYou are given two integers(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem. The problem is to find the numb(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "t = int(input())\nfor _ in range(t):\n A, B = map(int, input().split())\n d_max = 0\n curr(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves understanding mathematical properties of concatenation and multiplication, and(...TRUNCATED) | 15,859 | 2,222 | ["Okay, let's tackle this programming problem. Hmm, the problem is to find the number of pairs (a, b(...TRUNCATED) | ["To solve this problem, we need to determine the number of valid pairs (a, b) such that the equatio(...TRUNCATED) | ["<think>\nOkay, let's tackle this programming problem. Hmm, the problem is to find the number of pa(...TRUNCATED) | [
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | "The provided code snippet correctly implements the logic derived from the problem statement. It cou(...TRUNCATED) | ["<think>\nOkay, let's tackle this programming problem. Hmm, the problem is to find the number of pa(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding pairs (a, b) such that a*b + a + b equals th(...TRUNCATED) | [{"from":"human","value":"Try guessing the statement from this picture <http://tiny.cc/ogyoiz>.\n\nY(...TRUNCATED) |
ab88b4469ab6335a4602c3c7d96f61a6 | "Vasya has got a magic matrix a of size n × m. The rows of the matrix are numbered from 1 to n from(...TRUNCATED) | "<think>\nOkay, let's see. So, the problem is about calculating the expected value of the Vasya's fi(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 9 | "MOD = 998244353\n\nn, m = map(int, input().split())\nmatrix = []\nfor _ in range(n):\n row = lis(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires a solid understanding of probability theory and knowledge of the expected valu(...TRUNCATED) | 3,869 | 614 | ["Okay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, the probl(...TRUNCATED) | ["To solve this problem, we need to calculate the expected value of the final score Vasya achieves b(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, (...TRUNCATED) | [
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
false,
true,
true,
true
] | "The provided code snippet correctly implements the described algorithm for calculating the expected(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, (...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let's read through the problem carefull(...TRUNCATED) | [{"from":"human","value":"Vasya has got a magic matrix a of size n × m. The rows of the matrix are (...TRUNCATED) |
null | "Background\nWe all know about distributivity, i.e. \\$a(b+c) = ab + ac\\$. This is a property on 2 (...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem involves understanding a non-standard algebraic operation and deriving properties of se(...TRUNCATED) | 11,681 | 2,681 | ["Okay, let's try to tackle this problem. Hmm. The task is to find all possible minimal periods of t(...TRUNCATED) | ["To solve this problem, we need to determine the smallest positive periods of the row corresponding(...TRUNCATED) | ["<think>\nOkay, let's try to tackle this problem. Hmm. The task is to find all possible minimal per(...TRUNCATED) | [
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | "The provided code snippet effectively addresses the problem by checking if the given integer N is a(...TRUNCATED) | ["<think>\nOkay, let's try to tackle this problem. Hmm. The task is to find all possible minimal per(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where given a positive integer N, I have to compute all(...TRUNCATED) | [{"from":"human","value":"Background\nWe all know about distributivity, i.e. \\$a(b+c) = ab + ac\\$.(...TRUNCATED) |
b2094fffbcd4fc254c99d40e05528f7f | "Milly is feeling bored during her winter vaccations, so she has decided to do some random fun on so(...TRUNCATED) | "<think>\nOkay, let's try to understand the problem step by step. \n\nSo Milly has K arrays, each of(...TRUNCATED) | hackerearth | cc-by-4.0 | code_contests | train | 8 | "MOD = 10**9 + 7\n\ndef main():\n import sys\n input = sys.stdin.read().split()\n ptr = 0\n(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves generating all possible non-empty subsets of given arrays considering specific(...TRUNCATED) | 20,955 | 722 | ["Okay, let's see. I need to solve this problem where Milly is working with arrays and subsets. The (...TRUNCATED) | ["To solve this problem, we need to determine the maximum and minimum values of an operation P appli(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this problem where Milly is working with arrays and subs(...TRUNCATED) | [
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
false,
true,
true,
true
] | "The explanation and reasoning provided give a thorough understanding of the problem and the associa(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this problem where Milly is working with arrays and subs(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let me read the problem carefully again(...TRUNCATED) | [{"from":"human","value":"Milly is feeling bored during her winter vaccations, so she has decided to(...TRUNCATED) |
null | "This is the robbers' thread. For the cops' thread, click here.\nCops' Task\nFor the cops' thread, c(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "This problem requires a good understanding of code manipulation, specifically unscrambling or rever(...TRUNCATED) | 13,935 | 570 | ["Okay, I need to find an uncracked submission from the cops' thread and figure out how to unscrambl(...TRUNCATED) | ["Python, 29 bytes, example_cop \n[Link to the cop's submission](https://example.com/cop-submission(...TRUNCATED) | ["<think>\nOkay, I need to find an uncracked submission from the cops' thread and figure out how to (...TRUNCATED) | [
true,
true,
true,
true,
false,
true,
true,
false,
true,
false,
true,
true,
true,
true,
true,
true
] | "The provided response correctly follows the problem's requirements. It identifies an uncracked subm(...TRUNCATED) | ["<think>\nOkay, I need to find an uncracked submission from the cops' thread and figure out how to (...TRUNCATED) | "<think>\nOkay, I need to find an uncracked submission from the cops' thread and unscramble it into (...TRUNCATED) | [{"from":"human","value":"This is the robbers' thread. For the cops' thread, click here.\nCops' Task(...TRUNCATED) |
c9a482ee781256ae366007f0896cd70b | "There are n sharks who grow flowers for Wet Shark. They are all sitting around the table, such that(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to calculate the expected total dollars th(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "n, p = map(int, input().split())\na = []\n\nfor _ in range(n):\n l, r = map(int, input().split()(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires a combination of algebraic insight and knowledge of probability to compute the(...TRUNCATED) | 1,254 | 130 | ["Okay, I need to solve this problem. Let's read it carefully.\n\nSo, there are n sharks arranged in(...TRUNCATED) | ["To solve this problem, we need to determine the expected total amount of money that sharks receive(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem. Let's read it carefully.\n\nSo, there are n sharks ar(...TRUNCATED) | [
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | "The provided code snippet correctly implements the logic and requirements of the problem statement.(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem. Let's read it carefully.\n\nSo, there are n sharks ar(...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. So, the problem is about calculating the expected t(...TRUNCATED) | [{"from":"human","value":"There are n sharks who grow flowers for Wet Shark. They are all sitting ar(...TRUNCATED) |
null | "The following problem is taken from the real world — but indubitably code-golf!\nIn this puzzle, (...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem involves deep mathematical insights and complex algorithmic implementations, specifica(...TRUNCATED) | 16,837 | 3,491 | ["Okay, I need to find the shortest program to stably sort four registers w, x, y, z using the given(...TRUNCATED) | ["To solve this problem, we need to stably sort four registers (w, x, y, z) using a fixed set of ins(...TRUNCATED) | ["<think>\nOkay, I need to find the shortest program to stably sort four registers w, x, y, z using (...TRUNCATED) | [
true,
true,
false,
true,
false,
false,
true,
false,
true,
false,
true,
false,
true,
true,
true,
true
] | "The provided code snippet successfully implements a bubble sort algorithm to stably sort the four r(...TRUNCATED) | ["<think>\nOkay, I need to find the shortest program to stably sort four registers w, x, y, z using (...TRUNCATED) | "<think>\nOkay, I need to find the shortest program in this custom assembly-like language that stabl(...TRUNCATED) | [{"from":"human","value":"The following problem is taken from the real world — but indubitably cod(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5