id string | instruction_seed string | output string | source string | license string | dataset string | split string | difficulty int64 | solution string | index string | _source string | difficulty_reasoning string | __original_row_idx int64 | ms_id int64 | reasoning string | deepseek_solution string | final_reasoning_trace string | conversations list |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "About the Series\nFirst off, you may treat this like any other code golf challenge, and answer it w(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem requires advanced algorithmic knowledge due to its complexity in dealing with infinite(...TRUNCATED) | 6,976 | 436 | "Okay, I need to solve this problem where I have to shuffle an infinite list such that each element (...TRUNCATED) | "To solve this problem, we need to shuffle an infinite list such that each element from the input li(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to shuffle an infinite list such that each(...TRUNCATED) | [{"from":"human","value":"About the Series\nFirst off, you may treat this like any other code golf c(...TRUNCATED) |
null | "A constructible \\$n\\$-gon is a regular polygon with n sides that you can construct with only a co(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem requires deep mathematical insights relating to constructibility of polygons, Fermat pr(...TRUNCATED) | 17,719 | 1,107 | "Okay, I need to solve this problem where I have to determine if a given integer n>2 is a constructi(...TRUNCATED) | "To solve this problem, we need to determine if a given integer \\( n > 2 \\) represents a construct(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to determine if a given integer n>2 is a c(...TRUNCATED) | [{"from":"human","value":"A constructible \\$n\\$-gon is a regular polygon with n sides that you can(...TRUNCATED) |
f50bb07f59891e7ffebdb421c0e79426 | "There are two main kinds of events in the life of top-model: fashion shows and photo shoots. Partic(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So, the task is to find the earliest time t wh(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import bisect\n\ndef main():\n import sys\n input = sys.stdin.read\n data = input().split((...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires a mix of simulation and careful analysis of the model's rating over time, espe(...TRUNCATED) | 9,301 | 581 | "Okay, let's see. The problem is about Izabella, a top-model, who wants to participate in a talk sho(...TRUNCATED) | "To solve this problem, we need to determine the earliest time Izabella can participate in a talk sh(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about Izabella, a top-model, who wants to participate in a(...TRUNCATED) | [{"from":"human","value":"There are two main kinds of events in the life of top-model: fashion shows(...TRUNCATED) |
null | "An ordinary N-digit combination lock consists of N rotating discs. Each disc has digits 0-9 inscrib(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires understanding and applying advanced algorithmic techniques to effectively gues(...TRUNCATED) | 13,153 | 822 | "Okay, I need to solve this problem where I have to find the password of a distance-revealing lock w(...TRUNCATED) | "To solve this problem, we need to determine the password of a distance-revealing lock with the mini(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the password of a distance-reveali(...TRUNCATED) | [{"from":"human","value":"An ordinary N-digit combination lock consists of N rotating discs. Each di(...TRUNCATED) |
null | "Given an input string of length 2 or longer consisting solely of alphabetical characters [A-Z] or [(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem involves generating a complex output pattern based on the input string, requiring caref(...TRUNCATED) | 22,773 | 1,423 | "Okay, let's tackle this problem. Hmm, the task is to generate a double diamond pattern using the in(...TRUNCATED) | "To solve this problem, we need to generate a continuous string of characters forming a double diamo(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the task is to generate a double diamond pattern usi(...TRUNCATED) | [{"from":"human","value":"Given an input string of length 2 or longer consisting solely of alphabeti(...TRUNCATED) |
bebbe20205d860064127d9efc2ff2255 | "Koa the Koala has a directed graph G with n nodes and m edges. Each edge has a capacity associated (...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. So, the problem is about computin(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom collections import deque\n\nclass Edge:\n def __init__(self, to, rev, capacity)(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves calculating the maximum flow in a directed graph after adjusting the capacitie(...TRUNCATED) | 2,060 | 128 | "Okay, I need to solve this problem. Let's read it carefully.\n\nThe problem is about a directed gra(...TRUNCATED) | "To solve this problem, we need to efficiently compute the maximum flow in a graph where certain edg(...TRUNCATED) | "<think>\nOkay, I need to solve this problem. Let's read it carefully.\n\nThe problem is about a dir(...TRUNCATED) | [{"from":"human","value":"Koa the Koala has a directed graph G with n nodes and m edges. Each edge h(...TRUNCATED) |
5cf2cb77d6aba3fca3f862b2e60a5600 | "Yaroslav thinks that two strings s and w, consisting of digits and having length n are non-comparab(...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. Hmm. The problem is about two string templates with(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "MOD = 10**9 + 7\n\n# Precompute the contributions for each possible character pair\npre = {}\nfor s(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires understanding of combinatorial counting with constraints based on string compa(...TRUNCATED) | 18,754 | 1,172 | "Okay, so I need to solve this problem where I have two string templates with digits and question ma(...TRUNCATED) | "To solve this problem, we need to determine the number of ways to replace all question marks in two(...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have two string templates with digits and qu(...TRUNCATED) | [{"from":"human","value":"Yaroslav thinks that two strings s and w, consisting of digits and having (...TRUNCATED) |
null | "The Library of Babel is defined as \n\na universe in the form of a vast library containing all poss(...TRUNCATED) | null | null | null | null | null | 9 | null | null | stackexchange_codegolf | "The problem requires a deep understanding of algorithms for generating highly structured outputs ba(...TRUNCATED) | 3,907 | 244 | "Okay, so I need to create a program that generates valid pages from the Library of Babel. Let's see(...TRUNCATED) | "To solve this problem, we need to generate valid page excerpts from the Library of Babel. Each page(...TRUNCATED) | "<think>\nOkay, so I need to create a program that generates valid pages from the Library of Babel. (...TRUNCATED) | [{"from":"human","value":"The Library of Babel is defined as \n\na universe in the form of a vast li(...TRUNCATED) |
c6286b08010d33044eb63de6a11cdaa8 | "Denis came to Nastya and discovered that she was not happy to see him... There is only one chance t(...TRUNCATED) | "<think>\nOkay, let's try to understand this problem. So Denis needs to visit all nodes in a tree st(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom sys import stdin\nsys.setrecursionlimit(1 << 25)\n\ndef main():\n n = int(stdin(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves a combination of graph traversal and optimization under constraints while ensu(...TRUNCATED) | 31,297 | 1,956 | "Okay, let's see. So Denis needs to visit all nodes in the tree starting and ending at 1, using time(...TRUNCATED) | "To solve this problem, we need to find an optimal route for Denis to visit all nodes in a tree star(...TRUNCATED) | "<think>\nOkay, let's see. So Denis needs to visit all nodes in the tree starting and ending at 1, u(...TRUNCATED) | [{"from":"human","value":"Denis came to Nastya and discovered that she was not happy to see him... T(...TRUNCATED) |
6a0e160cf7a1fa642438fcfce96d53c6 | "A permutation p of length n is a sequence of distinct integers p1, p2, ..., pn (1 ≤ pi ≤ n). A (...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let's read the problem carefully and un(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "def compute_cycles(perm):\n n = len(perm)\n visited = [False] * (n + 2) # 1-based indexing u(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves transforming a permutation into another with a specific number of swaps, requi(...TRUNCATED) | 1,802 | 112 | "Okay, I need to solve this problem where Valera wants to transform a permutation into another permu(...TRUNCATED) | "To solve this problem, we need to transform a given permutation into another permutation such that (...TRUNCATED) | "<think>\nOkay, I need to solve this problem where Valera wants to transform a permutation into anot(...TRUNCATED) | [{"from":"human","value":"A permutation p of length n is a sequence of distinct integers p1, p2, ...(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5