id stringclasses 665
values | instruction_seed stringlengths 192 53.1k | output stringlengths 3.8k 71.5k ⌀ | 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 280 861 | __original_row_idx int64 0 31.6k | ms_id int64 0 1.97k | reasoning stringlengths 1.31k 122k | deepseek_solution stringlengths 53 30k | final_reasoning_trace stringlengths 1.96k 127k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
e37a431468d884ff761a7af047f6331c | "Koa the Koala has a matrix A of n rows and m columns. Elements of this matrix are distinct integers(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So, the task is to find a matrix A' that has the same spe(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "n, m = map(int, input().split())\nmatrix = [list(map(int, input().split())) for _ in range(n)]\n\n#(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves constructing a matrix with specific constraints on its rows and columns, where(...TRUNCATED) | 27,968 | 1,748 | "Okay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe problem is(...TRUNCATED) | "To solve this problem, we need to construct a matrix A' such that it has the same row and column ma(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe p(...TRUNCATED) | [{"from":"human","value":"Koa the Koala has a matrix A of n rows and m columns. Elements of this mat(...TRUNCATED) |
null | "I have a serious problem. I have some text files where I keep my very important numbers -- all of t(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "This problem involves understanding a complex encoding of loops in ASCII format, which requires kno(...TRUNCATED) | 12,631 | 789 | "Okay, I need to solve this problem where I have to count the number of loops in an ASCII art repres(...TRUNCATED) | "To solve this problem, we need to count the number of loops in an ASCII art representation where lo(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to count the number of loops in an ASCII a(...TRUNCATED) | [{"from":"human","value":"I have a serious problem. I have some text files where I keep my very impo(...TRUNCATED) |
null | "Your boss just emailed you a list of 12 programming tasks he needs done as soon as possible. The ta(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem presents a unique challenge since it requires the solver to fit solutions for multiple(...TRUNCATED) | 24,948 | 1,559 | "Okay, let's see. I need to solve as many of these 12 tasks as possible in under 140 bytes total. Th(...TRUNCATED) | "To solve as many tasks as possible within 140 bytes, we need to focus on tasks that can be solved w(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve as many of these 12 tasks as possible in under 140 bytes (...TRUNCATED) | [{"from":"human","value":"Your boss just emailed you a list of 12 programming tasks he needs done as(...TRUNCATED) |
null | "Given an integer n > 2, print or return the smallest non-negative integer k such that a(n, k) = 9, (...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "This problem requires knowledge of recursion or iteration since the definition of a(n, k) involves (...TRUNCATED) | 4,769 | 298 | "Okay, I need to solve this problem where given an integer n greater than 2, I have to find the smal(...TRUNCATED) | "To solve this problem, we need to find the smallest non-negative integer \\( k \\) such that the fu(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where given an integer n greater than 2, I have to find(...TRUNCATED) | [{"from":"human","value":"Given an integer n > 2, print or return the smallest non-negative integer (...TRUNCATED) |
null | "While looking at the ARM instruction set, you notice that the ADD instruction has the so-called \"F(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem requires a deep understanding of both programming concepts and low-level optimization (...TRUNCATED) | 24,871 | 1,554 | "Okay, I need to solve this problem where I have to generate an optimal C macro for multiplying a nu(...TRUNCATED) | "To solve this problem, we need to generate an optimal C macro for multiplying a number by a given i(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to generate an optimal C macro for multipl(...TRUNCATED) | [{"from":"human","value":"While looking at the ARM instruction set, you notice that the ADD instruct(...TRUNCATED) |
null | "The robber's thread is here\nThe cops task is to write a function or program that, when given an in(...TRUNCATED) | null | null | null | null | null | 10 | null | null | stackexchange_codegolf | "This problem requires deep insights into programming languages, self-replicating code, and potentia(...TRUNCATED) | 14,277 | 892 | "Okay, let's try to tackle this problem. The task is to write a program that, when given itself as i(...TRUNCATED) | "**Python 3, 91 bytes, Score: 1**\n\nInput is from STDIN. The program outputs \"X\" when given its o(...TRUNCATED) | "<think>\nOkay, let's try to tackle this problem. The task is to write a program that, when given it(...TRUNCATED) | [{"from":"human","value":"The robber's thread is here\nThe cops task is to write a function or progr(...TRUNCATED) |
null | "Code-Golf caddy Eddie Brackets was getting tired of quine challenges, which appeared to be much too(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem requires a deep understanding of quines (self-replicating programs), which in itself is(...TRUNCATED) | 559 | 34 | "Okay, I need to solve this quine challenge where the output is four rotated squares of the squeezed(...TRUNCATED) | "To solve this problem, we need to write a quine that prints itself in a squeezed format (without wh(...TRUNCATED) | "<think>\nOkay, I need to solve this quine challenge where the output is four rotated squares of the(...TRUNCATED) | [{"from":"human","value":"Code-Golf caddy Eddie Brackets was getting tired of quine challenges, whic(...TRUNCATED) |
null | "Given an integral polynomial \\$p\\$, determine if \\$p\\$ is a square of another integral polynomi(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "This problem requires knowledge of polynomial algebra and understanding of the conditions under whi(...TRUNCATED) | 29,455 | 1,840 | "Okay, I need to solve this problem where I have to determine if a given integral polynomial is a sq(...TRUNCATED) | "To solve this problem, we need to determine if a given integral polynomial is a perfect square of a(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to determine if a given integral polynomia(...TRUNCATED) | [{"from":"human","value":"Given an integral polynomial \\$p\\$, determine if \\$p\\$ is a square of (...TRUNCATED) |
291a2cfa833f45f33fe4d8e32f0ca3f7 | "You have a bag which contains n cards. There is a number written on each card; the number on i-th c(...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 | 8 | "from collections import defaultdict\n\nmod = 998244353\n\nn = int(input())\na = list(map(int, input(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires calculating the probability of winning a game based on a series of outcomes in(...TRUNCATED) | 29,010 | 1,813 | "Okay, let's try to figure out how to solve this problem. So the problem is about calculating the pr(...TRUNCATED) | "To solve this problem, we need to calculate the probability of winning a game where you draw cards (...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. So the problem is about calculati(...TRUNCATED) | [{"from":"human","value":"You have a bag which contains n cards. There is a number written on each c(...TRUNCATED) |
98a821ea58ecf31845a2e71a8128ed88 | "It is vacation time and Panda is in his hometown Pandaland. Panda is very bored so he started study(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So, the task is to find the count of 'lazy num(...TRUNCATED) | hackerearth | cc-by-4.0 | code_contests | train | 8 | "import math\n\ndef count_lazy_numbers():\n import sys\n input = sys.stdin.read().split()\n (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem involves some advanced concepts in number theory, specifically the properties of divis(...TRUNCATED) | 6,488 | 405 | "Okay, let's see. The problem is about finding lazy numbers between L and R. So a lazy number is a n(...TRUNCATED) | "To solve this problem, we need to determine the count of 'lazy numbers' between two given numbers L(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding lazy numbers between L and R. So a lazy numb(...TRUNCATED) | [{"from":"human","value":"It is vacation time and Panda is in his hometown Pandaland. Panda is very (...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5