id stringlengths 32 32 ⌀ | instruction_seed stringlengths 80 53.1k | output stringlengths 3.8k 71.6k ⌀ | source stringclasses 10
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 3
values | difficulty int64 6 10 | solution stringlengths 8 12.5k ⌀ | index stringclasses 67
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 256 821 | __original_row_idx int64 10 63.2k | ms_id int64 0 3.95k | reasoning sequencelengths 16 16 | deepseek_solution sequencelengths 16 16 | final_reasoning_trace sequencelengths 16 16 | _majority_responses sequencelengths 8 8 | verified_final_reasoning_trace stringlengths 2.88k 109k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "In Haskell (and probably some other languages or something) zip is a function which takes two lists(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem requires understanding of advanced data structures (ragged lists) and recursion to hand(...TRUNCATED) | 28,257 | 1,766 | ["Okay, I need to solve this problem where I have to zip two ragged lists according to the given rul(...TRUNCATED) | ["To solve this problem, we need to zip two ragged lists of positive integers according to specific (...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to zip two ragged lists according to the (...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to zip two ragged lists according to the (...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to zip two ragged lists. Let's start by un(...TRUNCATED) | [{"from":"human","value":"In Haskell (and probably some other languages or something) zip is a funct(...TRUNCATED) |
null | "I struggle to easily encode big numbers in ><>. If only there was a program that could find the bes(...TRUNCATED) | null | null | null | null | null | 9 | null | null | stackexchange_codegolf | "The problem presented involves an esoteric programming language (`><>`) with a unique set of comman(...TRUNCATED) | 3,402 | 212 | ["Okay, I need to create a program that can find the optimal way to encode numbers into ><> (Fish) c(...TRUNCATED) | ["To solve the problem of encoding numbers efficiently in ><>, we need to generate the shortest poss(...TRUNCATED) | ["<think>\nOkay, I need to create a program that can find the optimal way to encode numbers into ><>(...TRUNCATED) | ["<think>\nOkay, I need to find the best way to encode numbers into ><> programs efficiently. The go(...TRUNCATED) | "<think>\nOkay, I need to find the best way to encode numbers into ><> programs efficiently. The goa(...TRUNCATED) | [{"from":"human","value":"I struggle to easily encode big numbers in ><>. If only there was a progra(...TRUNCATED) |
f928b4f4ea1c656aebc35ad09bab97cf | "Read problems statements in Mandarin chinese, Russian and Vietnamese as well. \n\nGritukan likes to(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So, the problem is about counting the number o(...TRUNCATED) | codechef | apache-2.0 | taco | train | 8 | "import sys\nMOD = 998244353\n\ndef main():\n input = sys.stdin.read().split()\n ptr = 0\n (...TRUNCATED) | 7278 | nvidia/OpenCodeReasoning | "This problem involves understanding complex permutations and their relationships with cyclic routes(...TRUNCATED) | 59,477 | 3,717 | ["Okay, let's see. So the problem is about finding the number of permutations P that match a given s(...TRUNCATED) | ["To solve this problem, we need to determine the number of permutations of countries that Gritukan (...TRUNCATED) | ["<think>\nOkay, let's see. So the problem is about finding the number of permutations P that match (...TRUNCATED) | ["<think>\nOkay, let's try to figure out this problem. So the task is to find the number of permutat(...TRUNCATED) | "<think>\nOkay, let's see. I need to find the number of permutations P that match the given array A.(...TRUNCATED) | [{"from":"human","value":"Read problems statements in Mandarin chinese, Russian and Vietnamese as we(...TRUNCATED) |
0e6674a8d47b144945c642fc57a96d20 | "The Elements of Harmony are six supernatural artifacts representing subjective aspects of harmony. (...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 9 | "import math\n\ndef main():\n import sys\n input = sys.stdin.read().split()\n ptr = 0\n (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves understanding how to compute the energy distribution in a complete graph with (...TRUNCATED) | 684 | 42 | ["Okay, let's see. I need to solve this problem where I have to compute the energy distribution afte(...TRUNCATED) | ["To solve this problem, we need to compute the energy distribution at a given time `t` based on an (...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this problem where I have to compute the energy distribu(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this problem where we have these Elements of Harmony, an(...TRUNCATED) | "<think>\nOkay, let's see. I have to compute the energy distribution after t steps given the transfo(...TRUNCATED) | [{"from":"human","value":"The Elements of Harmony are six supernatural artifacts representing subjec(...TRUNCATED) |
43d1e0a667d9aa1d158d1c5addc2f5bb | "Little D is a friend of Little C who loves intervals very much instead of number \"3\".\n\nNow he h(...TRUNCATED) | "<think>\nOkay, let's see. So the problem is about selecting exactly k different interval ranges [l,(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\n\ndef main():\n sys.setrecursionlimit(1 << 25)\n n, k = map(int, sys.stdin.readli(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem involves understanding intervals and the concept of union lengths, which can lead to c(...TRUNCATED) | 36,773 | 2,298 | ["Okay, I need to solve this programming problem. Let me read the problem statement carefully.\n\nSo(...TRUNCATED) | ["To solve this problem, we need to select exactly k different intervals of intervals such that the (...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let me read the problem statement careful(...TRUNCATED) | ["<think>\nOkay, so I need to solve this programming problem. Let me read the problem statement care(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about selecting exactly k different interval of intervals (...TRUNCATED) | [{"from":"human","value":"Little D is a friend of Little C who loves intervals very much instead of (...TRUNCATED) |
null | "Caves and Cliffs edition\nPart 1, Very related\nYou're given a piece of ASCII art representing a pi(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "This problem involves validating connections between ASCII characters in specific ways, which requi(...TRUNCATED) | 46,569 | 2,910 | ["Okay, I need to solve this problem where I have to check if the given ASCII art forms a single con(...TRUNCATED) | ["To solve this problem, we need to determine if a given piece of ASCII art forms a single connected(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to check if the given ASCII art forms a s(...TRUNCATED) | ["<think>\nOkay, so I need to solve this problem where I have to determine if a given ASCII art repr(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to determine if the given ASCII art repres(...TRUNCATED) | [{"from":"human","value":"Caves and Cliffs edition\nPart 1, Very related\nYou're given a piece of AS(...TRUNCATED) |
null | "An intriguing MathsSE question asked if there were large N-queens solutions where no three queens l(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem requires a deep understanding of combinatorial algorithms, specifically related to the(...TRUNCATED) | 43,116 | 2,694 | ["Okay, I need to solve the N-Queens problem with the additional constraint that no three queens are(...TRUNCATED) | ["To solve this problem, we need to generate an N-Queens solution where no three queens lie on a str(...TRUNCATED) | ["<think>\nOkay, I need to solve the N-Queens problem with the additional constraint that no three q(...TRUNCATED) | ["<think>\nOkay, I need to solve the N-Queens problem with the additional constraint that no three q(...TRUNCATED) | "<think>\nOkay, I need to write a fast code that solves the N-Queens problem with the additional con(...TRUNCATED) | [{"from":"human","value":"An intriguing MathsSE question asked if there were large N-queens solution(...TRUNCATED) |
null | "Given a list of strings, replace each string by one of its non-empty substrings which is not a subs(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem requires a deep understanding of substring search and uniqueness within a set of strin(...TRUNCATED) | 62,428 | 3,901 | ["Okay, I need to solve this problem where I have to replace each string in a list with the shortest(...TRUNCATED) | ["To solve this problem, we need to replace each string in a given list with the shortest possible n(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to replace each string in a list with the(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where, given a list of strings, each string must be re(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where, given a list of strings, each string must be rep(...TRUNCATED) | [{"from":"human","value":"Given a list of strings, replace each string by one of its non-empty subst(...TRUNCATED) |
e98411cc10554d2c52a1459327826198 | "Bizon the Champion isn't just friendly, he also is a rigorous coder.\n\nLet's define function f(a),(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem. The problem is about generating(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom collections import deque\n\ndef factorize(x):\n factors = {}\n i = 2\n wh(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves understanding and implementing a recursive type function with combinatory prop(...TRUNCATED) | 17,146 | 1,071 | ["Okay, I need to solve this programming problem. Let's read the problem statement carefully.\n\nSo,(...TRUNCATED) | ["To solve this problem, we need to generate the sequence Xk, which is derived by iteratively applyi(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefull(...TRUNCATED) | ["<think>\nOkay, let's try to solve this problem. Hmm, the problem statement is a bit complex, but I(...TRUNCATED) | "<think>\nOkay, so I have this programming problem to solve, and I need to think through how to appr(...TRUNCATED) | [{"from":"human","value":"Bizon the Champion isn't just friendly, he also is a rigorous coder.\n\nLe(...TRUNCATED) |
null | "Given a single digit integer and a three digit integer, output a mathematical formula that uses onl(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires an understanding of mathematical operations and the formulation of valid expre(...TRUNCATED) | 10,252 | 640 | ["Okay, I need to solve this problem where given a single digit and a three-digit number, I have to (...TRUNCATED) | ["To solve this problem, we need to generate a mathematical expression using a given single-digit in(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where given a single digit and a three-digit number, I(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where given a single digit and a three-digit number, I(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where given a single-digit integer and a three-digit nu(...TRUNCATED) | [{"from":"human","value":"Given a single digit integer and a three digit integer, output a mathemati(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6