id stringlengths 32 32 ⌀ | instruction_seed stringlengths 56 52.7k | output stringlengths 2.45k 79.3k ⌀ | source stringclasses 10
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 4
values | difficulty int64 6 10 | solution stringlengths 25 9.63k ⌀ | index stringclasses 507
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 265 925 | __original_row_idx int64 0 31.6k | ms_id int64 0 7.9k | reasoning stringlengths 1.22k 126k | deepseek_solution stringlengths 0 18k | final_reasoning_trace stringlengths 1.31k 128k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "John Doe used to be one of the fastest QWERTY keyboard typists in the world, but a recent head inju(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem involves understanding character proximity on a keyboard layout and implementing an alg(...TRUNCATED) | 24,024 | 6,006 | "Okay, I need to solve this problem where I have to check if each character in two strings of equal (...TRUNCATED) | "To solve this problem, we need to determine if each character in two given strings of equal length (...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to check if each character in two strings (...TRUNCATED) | [{"from":"human","value":"John Doe used to be one of the fastest QWERTY keyboard typists in the worl(...TRUNCATED) |
37c6430b27aa9f112efc6f548d36cdd5 | "Monk visits Biksy, the largest trading market in the land. Biksy has traders from all over the worl(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where Monk wants to know if he can become infinitely ri(...TRUNCATED) | hackerearth | cc-by-4.0 | code_contests | train | 8 | "import sys\n\ndef main():\n input = sys.stdin.read().split()\n ptr = 0\n T = int(input[ptr(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires an understanding of graph theory, particularly the detection of negative weigh(...TRUNCATED) | 27,840 | 6,960 | "Okay, let's see. The problem is to determine if there's a way for Monk to become infinitely rich by(...TRUNCATED) | "To solve this problem, we need to determine if Monk can become infinitely rich by trading items in (...TRUNCATED) | "<think>\nOkay, let's see. The problem is to determine if there's a way for Monk to become infinitel(...TRUNCATED) | [{"from":"human","value":"Monk visits Biksy, the largest trading market in the land. Biksy has trade(...TRUNCATED) |
0f2340f810332e8711de4748c0efaeeb | "A long time ago in some country in Asia were civil wars.\n\nEach of n cities wanted to seize power.(...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. Hmm, the problem statement is a b(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nsys.setrecursionlimit(1 << 25)\n\ndef main():\n import sys\n input = sys.stdin.re(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves complex graph traversal and optimizations based on the weighted roads between (...TRUNCATED) | 8,596 | 2,149 | "Okay, let's see. The problem is about finding the road (or roads) that have the maximum number of b(...TRUNCATED) | "To solve this problem, we need to determine which road(s) in a tree structure have the highest numb(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding the road (or roads) that have the maximum nu(...TRUNCATED) | [{"from":"human","value":"A long time ago in some country in Asia were civil wars.\n\nEach of n citi(...TRUNCATED) |
null | "Given 4096 16-bit integers, only four of which are unique and others appeared twice (so 2050 differ(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem requires knowledge of not only basic programming but also optimizations specific to the(...TRUNCATED) | 25,348 | 6,337 | "Okay, I need to find the four unique 16-bit integers in an array of 4096 elements. The catch is tha(...TRUNCATED) | "To solve this problem efficiently on a resource-constrained 8051 microcontroller, we need to identi(...TRUNCATED) | "<think>\nOkay, I need to find the four unique 16-bit integers in an array of 4096 elements. The cat(...TRUNCATED) | [{"from":"human","value":"Given 4096 16-bit integers, only four of which are unique and others appea(...TRUNCATED) |
null | "Challenge\nCreate a program that, when run, changes the contents of the source file. This means tha(...TRUNCATED) | null | null | null | null | null | 9 | null | null | stackexchange_codegolf | "This problem requires extensive knowledge of file manipulation and programmatically altering source(...TRUNCATED) | 7,430 | 1,857 | "Okay, I need to create a program that, when run, modifies its own source code. Let's think about ho(...TRUNCATED) | "To solve this problem, we need to create a program that modifies its own source code each time it i(...TRUNCATED) | "<think>\nOkay, I need to create a program that, when run, modifies its own source code. Let's think(...TRUNCATED) | [{"from":"human","value":"Challenge\nCreate a program that, when run, changes the contents of the so(...TRUNCATED) |
1a4abfb0de59264907c384af1e433bd7 | "Introduction\nBrainfuck is one of the most well-known esoteric programming languages. But it can be(...TRUNCATED) | "<think>\nOkay, I need to solve this Brainfuck to C translator problem. Let's break it down into the(...TRUNCATED) | codewars | mit | apps | train | 8 | "def brainfuck_to_c(source_code):\n def merge_commands(s):\n merged = []\n i = 0\n (...TRUNCATED) | 1703 | nvidia/OpenCodeReasoning | "The problem involves non-trivial manipulation of Brainfuck code, requiring understanding of the lan(...TRUNCATED) | 22,368 | 5,592 | "Okay, I need to solve this Brainfuck to C converter problem. Let's see what the problem says. The f(...TRUNCATED) | "To solve this problem, we need to convert Brainfuck code into optimized and error-checked C code. T(...TRUNCATED) | "<think>\nOkay, I need to solve this Brainfuck to C converter problem. Let's see what the problem sa(...TRUNCATED) | [{"from":"human","value":"Introduction\nBrainfuck is one of the most well-known esoteric programming(...TRUNCATED) |
null | "\nPlease participate in the meta discussion about reopening this challenge before casting a vote.\n(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires implementing a non-trivial interpreter for a specialized programming language (...TRUNCATED) | 23,259 | 5,814 | "Okay, I need to write a Deadfish interpreter with all the quirks. Let's see the requirements again.(...TRUNCATED) | "To solve this problem, we need to create a Deadfish interpreter that adheres to the specific rules (...TRUNCATED) | "<think>\nOkay, I need to write a Deadfish interpreter with all the quirks. Let's see the requiremen(...TRUNCATED) | [{"from":"human","value":"\nPlease participate in the meta discussion about reopening this challenge(...TRUNCATED) |
a0bb958801071c7b16bfa1b4b639e735 | "In Storia Kingdom, there is an artifact called \"Perfect Sphere\" made by a great meister Es. This (...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem. Let's read the problem statemen(...TRUNCATED) | aizu | 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 requires extensive knowledge of geometric properties, specifically involving rotations (...TRUNCATED) | 19,022 | 4,755 | "Okay, let's try to figure out this problem. Hmm, the problem statement is a bit complex, but let's (...TRUNCATED) | "To solve this problem, we need to simulate the rotation of a polygon inside a circle, where the pol(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. Hmm, the problem statement is a bit complex, b(...TRUNCATED) | [{"from":"human","value":"In Storia Kingdom, there is an artifact called \"Perfect Sphere\" made by (...TRUNCATED) |
null | "Read infinitely from stdin, and convert every number to the corresponding symbol on a US qwerty key(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires knowledge of input reading, character mappings, and implementation without usi(...TRUNCATED) | 13,679 | 3,419 | "Okay, let's tackle this problem. The goal is to read input infinitely, converting every number to i(...TRUNCATED) | "To solve this problem, we need to read input infinitely from stdin and convert every number to the (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. The goal is to read input infinitely, converting every nu(...TRUNCATED) | [{"from":"human","value":"Read infinitely from stdin, and convert every number to the corresponding (...TRUNCATED) |
d3999b4d99debfaaa03866d87a86b8a3 | "The pandemic is upon us, and the world is in shortage of the most important resource: toilet paper.(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about assigning each factory to an airport such that each (...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import bisect\n\ndef hopcroft_karp(adj, N_U, N_V):\n pair_U = [-1] * N_U\n pair_V = [-1] * N_(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem involves finding a perfect matching in a bipartite graph with a weight constraint, whi(...TRUNCATED) | 23,582 | 5,895 | "Okay, let's see. So the problem is about matching factories to airports such that each factory is c(...TRUNCATED) | "To solve this problem, we need to find the minimum number of days required to complete all roads su(...TRUNCATED) | "<think>\nOkay, let's see. So the problem is about matching factories to airports such that each fac(...TRUNCATED) | [{"from":"human","value":"The pandemic is upon us, and the world is in shortage of the most importan(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6