instruction_seed stringlengths 190 53.1k | _source stringclasses 2
values | gpt4o_mini_response stringlengths 2.86k 22.4k | __original_row_idx int64 11 31.6k | length int64 2.86k 22.4k | id stringlengths 32 32 ⌀ | output stringlengths 4.57k 81k ⌀ | source stringclasses 5
values | license stringclasses 2
values | dataset stringclasses 2
values | split stringclasses 3
values | difficulty stringclasses 19
values | solution stringlengths 188 11k ⌀ | reasoning stringlengths 2.6k 119k | deepseek_solution stringlengths 0 18.9k | final_reasoning_trace stringlengths 4.35k 126k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"There seems to be this ongoing craze about people tediously learning new keyboard layouts like Dvor(...TRUNCATED) | stackexchange_codegolf | "To solve the problem of finding the optimal allocation of letters to the buttons on a telephone key(...TRUNCATED) | 26,360 | 4,174 | null | null | null | null | null | null | null | null | "Okay, let's tackle this problem. So the task is to find the optimal telephone keypad layout that mi(...TRUNCATED) | "To solve this problem, we need to determine the optimal telephone keypad layout that minimizes the (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So the task is to find the optimal telephone keypad layou(...TRUNCATED) | [{"from":"human","value":"There seems to be this ongoing craze about people tediously learning new k(...TRUNCATED) |
"Create a function that accepts a list of dates (unsorted with possible duplicates) and returns the (...TRUNCATED) | stackexchange_codegolf | "To accomplish the task of creating a function that processes a list of dates and categorizes them i(...TRUNCATED) | 27,088 | 2,979 | null | null | null | null | null | null | null | null | "Okay, let's tackle this problem. So, the task is to create a function that takes a list of dates an(...TRUNCATED) | "To solve this problem, we need to create a function that processes a list of dates and returns the (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So, the task is to create a function that takes a list of(...TRUNCATED) | [{"from":"human","value":"Create a function that accepts a list of dates (unsorted with possible dup(...TRUNCATED) |
"\nIf you've ever played Spacewar!, you know it was a fun game. If you haven't, know this: it was (a(...TRUNCATED) | stackexchange_codegolf | "It sounds like you're embarking on an exciting project to implement a bot for the classic game Spac(...TRUNCATED) | 20,938 | 4,734 | null | null | null | null | null | null | null | null | "Okay, I need to create a bot for this Spacewar! game. Let's start by understanding the requirements(...TRUNCATED) | "To solve this problem, we need to create a bot for the Spacewar! game that can effectively maneuver(...TRUNCATED) | "<think>\nOkay, I need to create a bot for this Spacewar! game. Let's start by understanding the req(...TRUNCATED) | [{"from":"human","value":"\nIf you've ever played Spacewar!, you know it was a fun game. If you have(...TRUNCATED) |
"Inspired by both the challenge \"Unique is Cheap\" by @Laikoni, where the score is based on the cha(...TRUNCATED) | stackexchange_codegolf | "Here's a solution to the challenge in Python. We'll create a compression and decompression program (...TRUNCATED) | 870 | 3,780 | null | null | null | null | null | null | null | null | "Okay, let's see. I need to create a compressor and decompressor pair. The compressor takes the comb(...TRUNCATED) | "**Python 3, Score 1440 bits (180 bytes)**\n\nThis implementation uses a simple fixed-length encodin(...TRUNCATED) | "<think>\nOkay, let's see. I need to create a compressor and decompressor pair. The compressor takes(...TRUNCATED) | [{"from":"human","value":"Inspired by both the challenge \"Unique is Cheap\" by @Laikoni, where the (...TRUNCATED) |
"Petya loves lucky numbers. Everybody knows that positive integers are lucky if their decimal repres(...TRUNCATED) | nvidia/OpenCodeReasoning | "To solve the problem of determining the minimum number of roads Petya needs to build in order to cr(...TRUNCATED) | 25,404 | 4,849 | 00a50c4a590970fb99a2e9b9c98dc66e | "<think>\nOkay, so I need to solve this programming problem. Let's read the problem carefully.\n\nTh(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | VERY_HARD | "class DSU:\n def __init__(self, size):\n self.parent = list(range(size + 1)) # 1-based i(...TRUNCATED) | "Okay, let's see. The problem is about finding the minimum number of roads to build between regions (...TRUNCATED) | "To solve this problem, we need to determine the minimum number of roads required to connect regions(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding the minimum number of roads to build between(...TRUNCATED) | [{"from":"human","value":"Petya loves lucky numbers. Everybody knows that positive integers are luck(...TRUNCATED) |
"[Question inspired by Can you calculate the average Levenshtein distance exactly? . Thank you Anush(...TRUNCATED) | stackexchange_codegolf | "To compute the average length of the longest common substring (LCS) between two independent and uni(...TRUNCATED) | 5,090 | 3,112 | null | null | null | null | null | null | null | null | "Okay, I need to compute the exact average length of the longest common substring between two binary(...TRUNCATED) | "To solve this problem, we need to compute the exact average length of the longest common substring (...TRUNCATED) | "<think>\nOkay, I need to compute the exact average length of the longest common substring between t(...TRUNCATED) | [{"from":"human","value":"[Question inspired by Can you calculate the average Levenshtein distance e(...TRUNCATED) |
"Functional graph is a directed graph in which all vertices have outdegree equal to 1. Loops are all(...TRUNCATED) | nvidia/OpenCodeReasoning | "To solve the problem, we need to construct a functional graph based on the provided constraints for(...TRUNCATED) | 2,350 | 4,671 | 342f225d25cf47d8d61ae6c2bfa16466 | "<think>\nOkay, let's try to solve this problem. Hmm, the problem is about building a functional gra(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | VERY_HARD | "import sys\nfrom collections import defaultdict\n\ndef main():\n n = int(sys.stdin.readline())\n(...TRUNCATED) | "Okay, let's tackle this problem. Hmm. So the task is to construct a functional graph based on the g(...TRUNCATED) | "To solve this problem, we need to construct a functional graph based on given precycle and cycle va(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm. So the task is to construct a functional graph based(...TRUNCATED) | [{"from":"human","value":"Functional graph is a directed graph in which all vertices have outdegree (...TRUNCATED) |
"Some chess variants use interesting non-standard pieces. In order to concisely describe new pieces (...TRUNCATED) | stackexchange_codegolf | "Here's a solution implemented in Python that generates the ASCII-art diagram based on the movement (...TRUNCATED) | 5,727 | 3,117 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where I have to parse a Parlett's movement notation and generate(...TRUNCATED) | "To solve this problem, we need to parse a given chess piece movement notation and generate an ASCII(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to parse a Parlett's movement notation and(...TRUNCATED) | [{"from":"human","value":"Some chess variants use interesting non-standard pieces. In order to conci(...TRUNCATED) |
"Your challenge is given an input of a prison layout to work out whether any of the prisoners can es(...TRUNCATED) | stackexchange_codegolf | "To determine whether any prisoners (represented by 'P') can escape from a prison layout defined by (...TRUNCATED) | 24,265 | 3,128 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where I have to determine if any prisoner can escape from a pris(...TRUNCATED) | "To solve this problem, we need to determine if any prisoner (denoted by 'P') in a given prison layo(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to determine if any prisoner can escape fr(...TRUNCATED) | [{"from":"human","value":"Your challenge is given an input of a prison layout to work out whether an(...TRUNCATED) |
"Introduction\nThere have been a few examples of the smallest possible OCI container that does \"X\"(...TRUNCATED) | stackexchange_codegolf | "To create the smallest possible OCI container that correctly handles PID 1 signal responsibilities (...TRUNCATED) | 22,351 | 2,941 | null | null | null | null | null | null | null | null | "Okay, I need to create the smallest possible OCI container that correctly handles termination signa(...TRUNCATED) | "To create the smallest possible container that correctly handles termination signals as PID 1, we'l(...TRUNCATED) | "<think>\nOkay, I need to create the smallest possible OCI container that correctly handles terminat(...TRUNCATED) | [{"from":"human","value":"Introduction\nThere have been a few examples of the smallest possible OCI (...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4