id stringlengths 32 32 ⌀ | instruction_seed stringlengths 201 24.3k | output stringlengths 5.1k 70.3k ⌀ | source stringclasses 7
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 3
values | difficulty int64 6 10 | solution stringlengths 182 4.87k ⌀ | index stringclasses 9
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 303 821 | __original_row_idx int64 816 63.1k | ms_id int64 51 3.94k | 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 3.22k 104k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
00352529f88219ce87281590cf74daed | "Once, during a lesson, Sasha got bored and decided to talk with his friends. Suddenly, he saw Kefa.(...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. So, the task is to count the numb(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 9 | "MOD = 10**9 + 7\n\nn, m, a, b = map(int, input().split())\n\nif n == 1:\n print(0)\n exit()\n(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves counting the number of distinct beautiful trees based on the weights of edges (...TRUNCATED) | 58,181 | 3,636 | ["Okay, let's see. So the problem is to count the number of beautiful trees. A beautiful tree is a t(...TRUNCATED) | ["To solve this problem, we need to count the number of weighted trees where the sum of the weights (...TRUNCATED) | ["<think>\nOkay, let's see. So the problem is to count the number of beautiful trees. A beautiful tr(...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. So, the task is to count the number of beautiful trees. (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So, the task is to count the number of beautiful trees. A(...TRUNCATED) | [{"from":"human","value":"Once, during a lesson, Sasha got bored and decided to talk with his friend(...TRUNCATED) |
null | "The problem:\nGiven a non-empty set of points in the Cartesian plane, find the smallest circle that(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires knowledge of computational geometry to find the smallest enclosing circle for (...TRUNCATED) | 35,123 | 2,195 | ["Okay, so I need to find the smallest circle that encloses all given points. Hmm. Let's think about(...TRUNCATED) | ["To solve this problem, we need to find the smallest circle that encloses all given points in the C(...TRUNCATED) | ["<think>\nOkay, so I need to find the smallest circle that encloses all given points. Hmm. Let's th(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to find the smallest circle that encloses(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the smallest circle that encloses (...TRUNCATED) | [{"from":"human","value":"The problem:\nGiven a non-empty set of points in the Cartesian plane, find(...TRUNCATED) |
08c7ea09a11cc31fce8afcced42b0906 | "There's a famous museum in the city where Kleofáš lives. In the museum, n exhibits (numbered 1 th(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\n\ndef main():\n n, k = map(int, sys.stdin.readline().split())\n all_items = {}\n (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem involves dynamic programming concepts similar to the knapsack problem, where the objec(...TRUNCATED) | 24,586 | 1,536 | ["Okay, let's tackle this problem. Hmm. So the problem is about handling a dynamic set of exhibits a(...TRUNCATED) | ["To solve this problem, we need to efficiently handle dynamic updates to a set of exhibits in a mus(...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. Hmm. So the problem is about handling a dynamic set of e(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this programming problem. Let's read the problem stateme(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let me read the problem carefully.\n\nT(...TRUNCATED) | [{"from":"human","value":"There's a famous museum in the city where Kleofáš lives. In the museum, (...TRUNCATED) |
67e3361b2124bd3777ddda71b4565eb7 | "Consider a k x k matrix M with entries as the following:\n\nM(i, i) = 1 (Diagonal is all 1s)\nM(i, (...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. So, the problem is about calculating a sum S which (...TRUNCATED) | codechef | cc-by-4.0 | code_contests | train | 8 | "MOD = 10**9 + 7\nmax_n = 100001 # Maximum possible N+1\n\n# Precompute Fibonacci numbers modulo MO(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires understanding of matrix determinants as well as the calculation of the greate(...TRUNCATED) | 63,056 | 3,941 | ["Okay, let's tackle this problem. So we need to compute the sum S for each N, which is the sum of g(...TRUNCATED) | ["To solve this problem, we need to compute the sum of the greatest common divisors (gcd) of the det(...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. So we need to compute the sum S for each N, which is the(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to compute the sum S for a given N, which(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, so the task is to compute the sum S for a given N, w(...TRUNCATED) | [{"from":"human","value":"Consider a k x k matrix M with entries as the following:\n\nM(i, i) = 1 (D(...TRUNCATED) |
ab406efaf604c61b2b11261115421376 | "The Olympic Games in Bercouver are in full swing now. Here everyone has their own objectives: sport(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the best observation point that se(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import math\n\ndef read_circle():\n x, y, r = map(int, input().split())\n return (x, y, r)\n\(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires an understanding of geometric properties and optimization to determine the be(...TRUNCATED) | 28,362 | 1,772 | ["Okay, let's see. So the problem is about finding the best observation point where all three stadiu(...TRUNCATED) | ["To solve this problem, we need to find the optimal observation point from where all three given ci(...TRUNCATED) | ["<think>\nOkay, let's see. So the problem is about finding the best observation point where all thr(...TRUNCATED) | ["<think>\nOkay, so I have this programming problem to solve. Let me read it carefully.\n\nThe probl(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the task is to find the best observation point where(...TRUNCATED) | [{"from":"human","value":"The Olympic Games in Bercouver are in full swing now. Here everyone has th(...TRUNCATED) |
null | "Preamble\nThere was a unit test in our codebase which was shuffling a string of length \\$52\\$ for(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem requires a deep understanding of probability theory and combinatorics, as well as the (...TRUNCATED) | 2,973 | 185 | ["Okay, let's tackle this problem. The goal is to calculate the probability that a random permutatio(...TRUNCATED) | ["To solve this problem, we need to determine the probability that a random permutation of a string (...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. The goal is to calculate the probability that a random p(...TRUNCATED) | ["<think>\nOkay, so I need to calculate the probability that when I shuffle a string composed of a c(...TRUNCATED) | "<think>\nOkay, so I need to find the probability that a random permutation of a string made up of a(...TRUNCATED) | [{"from":"human","value":"Preamble\nThere was a unit test in our codebase which was shuffling a stri(...TRUNCATED) |
null | "I was watching the world snooker championship and it got me wondering..\nSnooker scoring\nIn the ga(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem involves a good understanding of the rules of snooker scoring and requires the implemen(...TRUNCATED) | 2,211 | 138 | ["Okay, let's tackle this problem. The goal is to find all possible combinations of snooker balls po(...TRUNCATED) | ["To solve this problem, we need to determine all possible ways a snooker player could achieve a giv(...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. The goal is to find all possible combinations of snooker(...TRUNCATED) | ["<think>\nOkay, so I need to solve this problem where given a snooker score, I have to find all pos(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where given a snooker score, I have to find all possibl(...TRUNCATED) | [{"from":"human","value":"I was watching the world snooker championship and it got me wondering..\nS(...TRUNCATED) |
eb493169521ce86130837c72b8f53885 | "SmallR is a biologist. Her latest research finding is how to change the sex of dogs. In other words(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. Hmm, so the problem is about SmallR changing t(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 9 | "import sys\nfrom collections import defaultdict\n\ndef main():\n n, m, g = map(int, sys.stdin.re(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires extensive knowledge of advanced algorithms and mathematical concepts. It invo(...TRUNCATED) | 2,831 | 176 | ["Okay, let's see. So the problem is about SmallR trying to maximize her profit by flipping the sex (...TRUNCATED) | ["To solve this problem, we need to determine the maximum profit SmallR can achieve by flipping the (...TRUNCATED) | ["<think>\nOkay, let's see. So the problem is about SmallR trying to maximize her profit by flipping(...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. Hmm, the problem statement is a bit complex, but let's b(...TRUNCATED) | "<think>\nOkay, let's see. The problem is a bit complex, but I'll try to break it down. So, we have (...TRUNCATED) | [{"from":"human","value":"SmallR is a biologist. Her latest research finding is how to change the se(...TRUNCATED) |
03ed1372f932eef869f9d0c6eb68ccf6 | "- Percent sign sand dollar sign! And colon semicolon, too!\n\n - You Asterisk-mouth! – Sam & Max:(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the task is to find the minimal number of key presse(...TRUNCATED) | kattis | mit | apps | test | 8 | "import sys\nfrom collections import defaultdict\n\ndef main():\n digit_sequence_map = defaultdic(...TRUNCATED) | 3447 | nvidia/OpenCodeReasoning | "The problem requires a deep understanding of mapping digit sequences to words, managing a dictionar(...TRUNCATED) | 5,322 | 332 | ["Okay, let's tackle this programming problem. Hmm. So the problem is about finding the minimal numb(...TRUNCATED) | ["To solve this problem, we need to determine the minimal number of key presses required to type a g(...TRUNCATED) | ["<think>\nOkay, let's tackle this programming problem. Hmm. So the problem is about finding the min(...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. Hmm. So the task is to find the minimal number of key pr(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where I have to find the minimum number of k(...TRUNCATED) | [{"from":"human","value":"- Percent sign sand dollar sign! And colon semicolon, too!\n\n - You Aster(...TRUNCATED) |
bd6d348536298054b36dd653711e9b93 | "Unknown pathogen\n\nDr. Hideyo discovered an unknown pathogen. This pathogen has a chain structure (...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | 8 | "def main():\n import sys\n input = sys.stdin.read().split()\n Q = int(input[0])\n cases(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The described problem requires a combination of algorithmic insights involving string manipulation,(...TRUNCATED) | 5,507 | 344 | ["Okay, let's see. So the problem is about processing these pathogen chains made of 'o's and 'x's. T(...TRUNCATED) | ["To solve this problem, we need to determine if we can detoxify a pathogen by splitting and joining(...TRUNCATED) | ["<think>\nOkay, let's see. So the problem is about processing these pathogen chains made of 'o's an(...TRUNCATED) | ["<think>\nOkay, so I have this programming problem to solve, and I need to figure out how to approa(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So the task is to determine if we can split an(...TRUNCATED) | [{"from":"human","value":"Unknown pathogen\n\nDr. Hideyo discovered an unknown pathogen. This pathog(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5