id stringlengths 32 32 ⌀ | instruction_seed stringlengths 195 48.6k | output stringlengths 4.8k 79.3k ⌀ | source stringclasses 10
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 3
values | difficulty int64 6 10 | solution stringlengths 8 12.5k ⌀ | index stringclasses 75
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 256 886 | __original_row_idx int64 10 63.2k | ms_id int64 0 3.95k | reasoning sequencelengths 16 16 | deepseek_solution sequencelengths 16 16 | final_reasoning_trace sequencelengths 16 16 | _majority_responses sequencelengths 8 8 | verified_final_reasoning_trace stringlengths 2.71k 114k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "In graph theory a tree is just any graph with no cycles. But in computer science we often use root(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires a good understanding of tree data structures, particularly rooted trees, and i(...TRUNCATED) | 31,549 | 1,971 | ["Okay, I need to solve this problem where I have to re-root a tree such that the depth is minimized(...TRUNCATED) | ["To solve this problem, we need to re-root a given tree such that the depth of the tree is minimize(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to re-root a tree such that the depth is (...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. So, the task is to re-root a given rooted tree such that(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So, the task is to re-root a given rooted tree such that (...TRUNCATED) | [{"from":"human","value":"In graph theory a tree is just any graph with no cycles. But in computer (...TRUNCATED) |
8cac61700078e5a46aa27a79d7a6b426 | "Let's denote as L(x, p) an infinite sequence of integers y such that gcd(p, y) = 1 and y > x (where(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\n\ndef main():\n input = sys.stdin.read().split()\n t = int(input[0])\n queries(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves generating elements of an infinite sequence based on the greatest common divis(...TRUNCATED) | 27,735 | 1,733 | ["Okay, let's tackle this problem. So, the task is to find the k-th element in the sequence L(x, p),(...TRUNCATED) | ["To solve this problem, we need to efficiently find the k-th element in a sequence of integers grea(...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. So, the task is to find the k-th element in the sequence(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let me read the problem statement again c(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the k-th element in the sequence L(x, p), which co(...TRUNCATED) | [{"from":"human","value":"Let's denote as L(x, p) an infinite sequence of integers y such that gcd(p(...TRUNCATED) |
13fb6b2c8eff99b3fb29ab4c2cecf8eb | "Connected undirected weighted graph without self-loops and multiple edges is given. Graph contains (...TRUNCATED) | "<think>\nOkay, so I've got this programming problem to solve. Let me read through it again to make (...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom collections import deque\n\ndef main():\n sys.setrecursionlimit(1 << 25)\n n(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves calculating the minimal weight of spanning trees that include each edge in a c(...TRUNCATED) | 45,739 | 2,858 | ["Okay, let's try to solve this programming problem. Hmm. The problem is about finding for each edge(...TRUNCATED) | ["To solve this problem, we need to determine the minimal possible weight of a spanning tree that in(...TRUNCATED) | ["<think>\nOkay, let's try to solve this programming problem. Hmm. The problem is about finding for (...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this problem where for each edge in the graph, I have to(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let's read the problem statement carefu(...TRUNCATED) | [{"from":"human","value":"Connected undirected weighted graph without self-loops and multiple edges (...TRUNCATED) |
null | "You know how many and which kinds of chess pieces were murdered. Can you come up with any possibil(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires a good understanding of chess rules and the ability to manipulate the game sta(...TRUNCATED) | 1,331 | 83 | ["Okay, I need to solve this problem where I have to generate a sequence of chess moves that results(...TRUNCATED) | ["To solve this problem, we need to generate a sequence of legal chess moves that results in a speci(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to generate a sequence of chess moves tha(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to generate a legal chess move sequence t(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where given a certain material content of a chessboard (...TRUNCATED) | [{"from":"human","value":"You know how many and which kinds of chess pieces were murdered. Can you (...TRUNCATED) |
null | "\\$BB\\$ is the busy beaver function, an uncomputable function.\nWrite a program which when given a(...TRUNCATED) | null | null | null | null | null | 10 | null | null | stackexchange_codegolf | "This problem involves the busy beaver function, which is known to be uncomputable. The requirement (...TRUNCATED) | 5,247 | 327 | ["Okay, I need to write a Python program that, given an integer n, outputs BB(n) with at least 2/3 p(...TRUNCATED) | ["To solve this problem, we need to write a program that outputs the value of the busy beaver functi(...TRUNCATED) | ["<think>\nOkay, I need to write a Python program that, given an integer n, outputs BB(n) with at le(...TRUNCATED) | ["<think>\nOkay, I need to write a program that, given an integer n, outputs BB(n) with at least 2/3(...TRUNCATED) | "<think>\nOkay, I need to write a program that, given an integer n, outputs BB(n) with at least 2/3 (...TRUNCATED) | [{"from":"human","value":"\\$BB\\$ is the busy beaver function, an uncomputable function.\nWrite a p(...TRUNCATED) |
e863021bd1d6e0af3a10faf803cfe143 | "Everyone knows what the Fibonacci sequence is. This sequence can be defined by the recurrence relat(...TRUNCATED) | "<think>\nOkay, let's see. I need to compute the sum of Ai(k) from i=1 to n, where Ai(k) is Fi multi(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "MOD = 10**9 + 7\n\ndef main():\n import sys\n n, k = map(int, sys.stdin.readline().split())\n(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves calculating a sum of a modified Fibonacci sequence, which is not straightforwa(...TRUNCATED) | 18,708 | 1,169 | ["Okay, I need to solve this programming problem. Let's read it carefully.\n\nThe problem is about c(...TRUNCATED) | ["To solve this problem, we need to compute the sum of the sequence \\( A_i(k) = F_i \\times i^k \\)(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read it carefully.\n\nThe problem i(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe (...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | [{"from":"human","value":"Everyone knows what the Fibonacci sequence is. This sequence can be define(...TRUNCATED) |
f38e7065400925ec9075154604a25047 | "You all know that the Library of Bookland is the largest library in the world. There are dozens of (...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let's read the problem statement carefu(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom collections import deque, defaultdict\n\ndef main():\n n, m = map(int, sys.stdi(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires deep understanding of lexicographical order and the implications of capitalizi(...TRUNCATED) | 50,090 | 3,130 | ["Okay, let's try to figure out this problem. So the task is to determine which letters to capitaliz(...TRUNCATED) | ["To solve this problem, we need to determine which letters in Bookland's alphabet should be capital(...TRUNCATED) | ["<think>\nOkay, let's try to figure out this problem. So the task is to determine which letters to (...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read through the problem carefully.(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So, the task is to determine which letters to (...TRUNCATED) | [{"from":"human","value":"You all know that the Library of Bookland is the largest library in the wo(...TRUNCATED) |
fb8bb622002d6bd8da8c87b66eca4d34 | "You are a member of the space station engineering team, and are assigned a task in the construction(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe t(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | 8 | "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 a deep understanding of geometric relationships between spheres in three-dimen(...TRUNCATED) | 10,713 | 669 | ["Okay, let's see. I need to solve this problem where I have to calculate the minimum total length o(...TRUNCATED) | ["To solve this problem, we need to determine the minimum total length of corridors required to conn(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this problem where I have to calculate the minimum total(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefull(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | [{"from":"human","value":"You are a member of the space station engineering team, and are assigned a(...TRUNCATED) |
null | "I am sorry for the very long description. But i think some information of how /proc/self/cmdline wo(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem requires deep understanding of low-level programming concepts, particularly in relatio(...TRUNCATED) | 51,012 | 3,188 | ["Okay, I need to solve this programming problem. Let's read the task carefully.\n\nSo, the goal is (...TRUNCATED) | ["To solve this problem, we need to create a program that takes a number as input and calls another (...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the task carefully.\n\nSo, the(...TRUNCATED) | ["<think>\nOkay, let's see. I need to write a program that takes a number as input and calls another(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read through the task again carefull(...TRUNCATED) | [{"from":"human","value":"I am sorry for the very long description. But i think some information of (...TRUNCATED) |
c38d61c9c7c50cddfa67704593f82888 | "You're trying to set the record on your favorite video game. The game consists of N levels, which m(...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. Hmm. The problem is about calcula(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\n\ndef main():\n N, R = map(int, sys.stdin.readline().split())\n levels = []\n (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires a deep understanding of probabilistic expectations, as well as the ability to(...TRUNCATED) | 5,598 | 349 | ["Okay, let's try to tackle this problem. Hmm, the problem is about minimizing the expected time to (...TRUNCATED) | ["To solve this problem, we need to minimize the expected time to complete all levels of a game with(...TRUNCATED) | ["<think>\nOkay, let's try to tackle this problem. Hmm, the problem is about minimizing the expected(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this programming problem where the goal is to compute th(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED) | [{"from":"human","value":"You're trying to set the record on your favorite video game. The game cons(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6