id stringlengths 32 32 ⌀ | instruction_seed stringlengths 56 53.1k | output stringlengths 1.55k 81k ⌀ | source stringclasses 10
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 4
values | difficulty int64 6 10 | solution stringlengths 0 13.1k ⌀ | index stringclasses 297
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 247 922 | __original_row_idx int64 2 31.6k | ms_id int64 2 31.6k | reasoning stringlengths 1.16k 113k | deepseek_solution stringlengths 22 22.5k | final_reasoning_trace stringlengths 1.41k 119k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "In chemistry class, we were learning about titrations, and attempting one as a lab. We were using p(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires knowledge of RGB to HSL color conversion, understanding lightness calculations(...TRUNCATED) | 13,712 | 13,712 | "Okay, let's tackle this problem. Hmm, the task is to write a program that processes a list of RGB c(...TRUNCATED) | "To solve this problem, we need to determine the accuracy of titrations based on their color lightne(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the task is to write a program that processes a list(...TRUNCATED) | [{"from":"human","value":"In chemistry class, we were learning about titrations, and attempting one (...TRUNCATED) |
fb6e8035cfdbb8bf256ac2afcad93de8 | "The stardate is 2015, and Death Stars are bigger than ever! This time, two rebel spies have yet aga(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So the task is to find N pairs of corresponding stars bet(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nimport math\nimport random\nfrom collections import defaultdict\n\ndef main():\n inp(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem involves identifying correspondences between two maps of coordinates under transformat(...TRUNCATED) | 18,715 | 18,715 | "Okay, so I need to solve this problem where there are two maps of stars, each containing some Death(...TRUNCATED) | "To solve this problem, we need to identify the correct correspondences between Death Stars in two d(...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where there are two maps of stars, each containing s(...TRUNCATED) | [{"from":"human","value":"The stardate is 2015, and Death Stars are bigger than ever! This time, two(...TRUNCATED) |
5f760bf63d3a5da40e386ecdd5a9a90d | "This is an interactive problem!\n\nAn arithmetic progression or arithmetic sequence is a sequence o(...TRUNCATED) | "<think>\nOkay, let's see. I need to find the smallest element x1 and the common difference d of the(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nimport math\nfrom functools import reduce\n\ndef main():\n n = int(sys.stdin.readlin(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves an interactive approach where you need to derive two values (the smallest elem(...TRUNCATED) | 13,143 | 13,143 | "Okay, let's tackle this problem. Hmm, the problem says that the array, when sorted, forms an arithm(...TRUNCATED) | "To solve this problem, we need to determine the smallest element (x1) and the common difference (d)(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the problem says that the array, when sorted, forms (...TRUNCATED) | [{"from":"human","value":"This is an interactive problem!\n\nAn arithmetic progression or arithmetic(...TRUNCATED) |
55ec6fac6f0c660b87f54ea87e211d25 | "A team of furry rescue rangers was sitting idle in their hollow tree when suddenly they received a (...TRUNCATED) | "<think>\nOkay, let's see. I need to calculate the minimal time for the dirigible to reach the desti(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import math\n\nx1, y1, x2, y2 = map(int, input().split())\nv, t = map(int, input().split())\nvx, vy(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves optimizing the travel time of a dirigible on a Cartesian plane while navigatin(...TRUNCATED) | 18,072 | 18,072 | "Okay, I have to solve this programming problem. Let's read the problem carefully and understand wha(...TRUNCATED) | "To solve this problem, we need to determine the minimum time required for a dirigible to travel fro(...TRUNCATED) | "<think>\nOkay, I have to solve this programming problem. Let's read the problem carefully and under(...TRUNCATED) | [{"from":"human","value":"A team of furry rescue rangers was sitting idle in their hollow tree when (...TRUNCATED) |
null | "Write a program that outputs as many characters as possible, with two conditions:\n\nThe program mu(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem involves creating a program constrained by size and runtime while ensuring it outputs t(...TRUNCATED) | 25,683 | 25,683 | "Okay, let's see. I need to write a program that outputs as many characters as possible, but it has (...TRUNCATED) | "To solve this problem, we need to write a program that outputs as many characters as possible while(...TRUNCATED) | "<think>\nOkay, let's see. I need to write a program that outputs as many characters as possible, bu(...TRUNCATED) | [{"from":"human","value":"Write a program that outputs as many characters as possible, with two cond(...TRUNCATED) |
null | "The recent volume of MAA's Mathematics Magazine had an article \"Connecting the Dots: Maximal Polyg(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem involves advanced geometric concepts and combinatorial counting of polygons with speci(...TRUNCATED) | 19,013 | 19,013 | "Okay, let's tackle this problem. So the challenge is to count the number of \"essentially different(...TRUNCATED) | "To solve this problem, we need to count the number of \"essentially different\" n²-gons on an n x (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So the challenge is to count the number of \"essentially (...TRUNCATED) | [{"from":"human","value":"The recent volume of MAA's Mathematics Magazine had an article \"Connectin(...TRUNCATED) |
f9fd2e0f5688d3ac5dfc0b4f7d04d8f1 | "Nim is a famous game in which two players take turns removing items from $n$ distinct piles. During(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this Zero-Move Nim problem. Hmm. So the problem is simila(...TRUNCATED) | hackerrank | apache-2.0 | taco | train | 8 | "g = int(input())\nfor _ in range(g):\n n = int(input())\n piles = list(map(int, input().split(...TRUNCATED) | 17971 | nvidia/OpenCodeReasoning | "This problem involves a non-trivial variant of the Nim game with an additional 'Zero-Move' rule, re(...TRUNCATED) | 28,391 | 28,391 | "Okay, let's try to figure out how to solve this problem. So the problem is about a modified version(...TRUNCATED) | "To solve this problem, we need to determine the winner of a modified version of the Nim game called(...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. So the problem is about a modifie(...TRUNCATED) | [{"from":"human","value":"Nim is a famous game in which two players take turns removing items from $(...TRUNCATED) |
eef357a9b3332c1f5f0a6d38d41b1b90 | "You are given an integer k and n distinct points with integer coordinates on the Euclidean plane, t(...TRUNCATED) | "<think>\nOkay, let's see. I need to find the k-th smallest distance from the origin to all lines fo(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import math\nimport bisect\n\ndef main():\n import sys\n input = sys.stdin.read\n data = i(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires a deep understanding of geometry, combinatorial mathematics to calculate dista(...TRUNCATED) | 21,866 | 21,866 | "Okay, so I have this programming problem to solve. Let me read it carefully.\n\nThe problem says th(...TRUNCATED) | "To solve this problem, we need to find the k-th smallest distance from the origin to the line forme(...TRUNCATED) | "<think>\nOkay, so I have this programming problem to solve. Let me read it carefully.\n\nThe proble(...TRUNCATED) | [{"from":"human","value":"You are given an integer k and n distinct points with integer coordinates (...TRUNCATED) |
01ad6a2182b351828053ede3c800073c | "In an attempt to make peace with the Mischievious Mess Makers, Bessie and Farmer John are planning (...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem. Let me read the problem careful(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nimport math\n\nMOD = 10**9 + 7\n\ndef main():\n input = sys.stdin.read\n data = i(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves complex combinatorial optimization and requires knowledge of advanced algorith(...TRUNCATED) | 27,406 | 27,406 | "Okay, let's try to tackle this problem. Hmm. So the problem is about choosing k species from a set (...TRUNCATED) | "To solve this problem, we need to determine the sum of the maximum number of gardens Farmer John ca(...TRUNCATED) | "<think>\nOkay, let's try to tackle this problem. Hmm. So the problem is about choosing k species fr(...TRUNCATED) | [{"from":"human","value":"In an attempt to make peace with the Mischievious Mess Makers, Bessie and (...TRUNCATED) |
null | "Write an algorithm to interpret a sequence of letters as a Roman numeral. (see roman numeral rules (...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires a mix of advanced string manipulation and algorithmic logic to derive a valid (...TRUNCATED) | 30,966 | 30,966 | "Okay, I need to write an algorithm that can interpret a sequence of letters as a Roman numeral when(...TRUNCATED) | "To solve this problem, we need to determine if a given sequence of letters can be interpreted as a (...TRUNCATED) | "<think>\nOkay, I need to write an algorithm that can interpret a sequence of letters as a Roman num(...TRUNCATED) | [{"from":"human","value":"Write an algorithm to interpret a sequence of letters as a Roman numeral. (...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6