id stringlengths 32 32 ⌀ | instruction_seed stringlengths 201 48.6k | output stringlengths 5.1k 69.6k ⌀ | source stringclasses 10
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 4
values | difficulty int64 6 10 | solution stringlengths 75 10.3k ⌀ | index stringclasses 89
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 247 820 | __original_row_idx int64 19 31.6k | ms_id int64 4 7.89k | reasoning stringlengths 4.02k 110k | deepseek_solution stringlengths 198 14.5k | final_reasoning_trace stringlengths 4.88k 117k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "Introduction\nDecide whether a Hexagony program composed solely of the characters .)_|\\/><@ will h(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem requires a deep understanding of a non-standard programming language (Hexagony), where(...TRUNCATED) | 19,920 | 4,980 | "Okay, I need to solve this problem where I have to determine if a given Hexagony program composed o(...TRUNCATED) | "To solve this problem, we need to determine if a given Hexagony program composed of specific charac(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to determine if a given Hexagony program c(...TRUNCATED) | [{"from":"human","value":"Introduction\nDecide whether a Hexagony program composed solely of the cha(...TRUNCATED) |
bfec554d2e223626fc57cf367b29ec76 | "Local authorities have heard a lot about combinatorial abilities of Ostap Bender so they decided to(...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. So the problem is about selecting two subsets of pe(...TRUNCATED) | codeforces | - | - | - | 8 | "n, n1, n2 = map(int, input().split())\na = list(map(int, input().split()))\na.sort(reverse=True)\nt(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires optimizing the selection of candidates based on wealth to maximize the sum of (...TRUNCATED) | 5,302 | 1,325 | "Okay, let's see. So the problem is about selecting two subsets of people for two cities such that t(...TRUNCATED) | "To solve this problem, we need to select two subsets of people for two cities such that the sum of (...TRUNCATED) | "<think>\nOkay, let's see. So the problem is about selecting two subsets of people for two cities su(...TRUNCATED) | [{"from":"human","value":"Local authorities have heard a lot about combinatorial abilities of Ostap (...TRUNCATED) |
null | "There was a prior question about golfing an HQ9+ compiler that translates HQ9+ code into the langua(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem involves creating a transpiler for the HQ9+ programming language, which requires a soli(...TRUNCATED) | 13,396 | 3,349 | "Okay, I need to create a transpiler for HQ9+ that takes the source code and outputs code in another(...TRUNCATED) | "To solve this problem, we need to create a transpiler that converts HQ9+ code into another programm(...TRUNCATED) | "<think>\nOkay, I need to create a transpiler for HQ9+ that takes the source code and outputs code i(...TRUNCATED) | [{"from":"human","value":"There was a prior question about golfing an HQ9+ compiler that translates (...TRUNCATED) |
04de8b4a96842962d63080a535f640db | "JOI Park\n\nIn preparation for the Olympic Games in IOI in 20XX, the JOI Park in IOI will be develo(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where JOI Park's maintenance plan has to fin(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | 8 | "import heapq\nimport bisect\n\ndef main():\n import sys\n input = sys.stdin.read\n data = (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem involves advanced graph algorithms, specifically about calculating shortest paths in a(...TRUNCATED) | 16,893 | 4,223 | "Okay, so I need to solve this problem where I have to find the minimum sum of the costs for maintai(...TRUNCATED) | "To solve this problem, we need to determine the optimal way to develop JOI Park by connecting certa(...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to find the minimum sum of the costs fo(...TRUNCATED) | [{"from":"human","value":"JOI Park\n\nIn preparation for the Olympic Games in IOI in 20XX, the JOI P(...TRUNCATED) |
null | "Recently, I have found a bijective mapping \\$f\\$ from positive integers to finite, nested sequenc(...TRUNCATED) | null | null | null | null | null | 9 | null | null | stackexchange_codegolf | "The problem requires extensive knowledge of number theory related to prime factorization and the ab(...TRUNCATED) | 26,136 | 6,534 | "Okay, I need to solve this problem where I have to map a positive integer to a nested sequence stru(...TRUNCATED) | "To solve this problem, we need to map a positive integer to a nested sequence structure based on it(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to map a positive integer to a nested sequ(...TRUNCATED) | [{"from":"human","value":"Recently, I have found a bijective mapping \\$f\\$ from positive integers (...TRUNCATED) |
3c98412d08d4336fab2dbc7e419f6e49 | "For his computer science class, Jacob builds a model tree with sticks and balls containing n nodes (...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the maximum possible minimum value among the first(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom sys import stdin\nfrom bisect import bisect_right\n\ndef main():\n sys.setrecur(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires a deep understanding of tree structures, depth-first search (DFS) traversal, (...TRUNCATED) | 6,172 | 1,543 | "Okay, let's see. The problem is about choosing a root for a tree and ordering the children of each (...TRUNCATED) | "To solve this problem, we need to determine the maximum grade Jacob can achieve by strategically ch(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about choosing a root for a tree and ordering the children(...TRUNCATED) | [{"from":"human","value":"For his computer science class, Jacob builds a model tree with sticks and (...TRUNCATED) |
null | "Conways' Game of Life is a well known cellular automaton \"played\" on an infinite grid, filled wit(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem requires a deep understanding of Conways' Game of Life, including cellular automaton be(...TRUNCATED) | 24,682 | 6,170 | "Okay, I need to figure out how to create a starting configuration for the Game of Life that takes a(...TRUNCATED) | "**Answer for n=3, p=3**\n\nStarting configuration (3x3):\n```\nX X .\nX . .\n. . .\n```\n\nThis con(...TRUNCATED) | "<think>\nOkay, I need to figure out how to create a starting configuration for the Game of Life tha(...TRUNCATED) | [{"from":"human","value":"Conways' Game of Life is a well known cellular automaton \"played\" on an (...TRUNCATED) |
null | "Write a program in brainfuck that accepts input of 4 ASCII characters as numbers (from 32 to 126) a(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem involves sorting four distinct ASCII characters in Brainfuck, a Turing-complete languag(...TRUNCATED) | 11,757 | 2,939 | "Okay, I need to write a Brainfuck program that takes four ASCII characters as input, sorts them in (...TRUNCATED) | "To solve this problem, we need to write a Brainfuck program that reads four ASCII characters, sorts(...TRUNCATED) | "<think>\nOkay, I need to write a Brainfuck program that takes four ASCII characters as input, sorts(...TRUNCATED) | [{"from":"human","value":"Write a program in brainfuck that accepts input of 4 ASCII characters as n(...TRUNCATED) |
null | "Your task is, given a square grid of digits (0-9), output one of the ways that the digits can be gr(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem requires a deep understanding of graph theory (specifically regarding how to form grou(...TRUNCATED) | 8,677 | 2,169 | "Okay, I need to solve this problem where I have to group a square grid of digits into a certain num(...TRUNCATED) | "To solve this problem, we need to group the digits of a square grid into a specified number of grou(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to group a square grid of digits into a ce(...TRUNCATED) | [{"from":"human","value":"Your task is, given a square grid of digits (0-9), output one of the ways (...TRUNCATED) |
b9ec9a3992ad3476e95a74033cdda9a5 | "A few years ago Sajjad left his school and register to another one due to security reasons. Now he (...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the minimum cost Sajjad needs to pay for tickets t(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | n = int(input())
if n % 2 == 0:
print(n // 2 - 1)
else:
print((n - 1) // 2) | null | nvidia/OpenCodeReasoning | "This problem requires a deeper understanding of graph theory and minimum cost path algorithms, pote(...TRUNCATED) | 31,023 | 7,755 | "Okay, let's try to solve this problem. The task is to find the minimum cost Sajjad needs to pay for(...TRUNCATED) | "To solve this problem, we need to determine the minimum cost for Sajjad to buy tickets such that he(...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. The task is to find the minimum cost Sajjad needs t(...TRUNCATED) | [{"from":"human","value":"A few years ago Sajjad left his school and register to another one due to (...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6