id stringlengths 32 32 ⌀ | instruction_seed stringlengths 264 48.6k | output stringlengths 3.8k 79.3k ⌀ | source stringclasses 9
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 3
values | difficulty int64 6 10 | solution stringlengths 36 7.95k ⌀ | index stringclasses 87
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 256 861 | __original_row_idx int64 119 63.2k | ms_id int64 7 3.95k | reasoning stringlengths 2.43k 107k | deepseek_solution stringlengths 0 16.4k | final_reasoning_trace stringlengths 3.85k 109k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "SE Sandbox Link, Codidact Sandbox Link\nInspired by this video.\nGiven a positive integer, draw its(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem involves converting numeric values into a specific graphical representation (Cistercian(...TRUNCATED) | 54,179 | 3,386 | "Okay, I need to solve this Cistercian numeral ASCII art problem. Let's start by understanding the p(...TRUNCATED) | "To solve this problem, we need to generate the Cistercian numeral representation of a given positiv(...TRUNCATED) | "<think>\nOkay, I need to solve this Cistercian numeral ASCII art problem. Let's start by understand(...TRUNCATED) | [{"from":"human","value":"SE Sandbox Link, Codidact Sandbox Link\nInspired by this video.\nGiven a p(...TRUNCATED) |
9efffe67dce9987cd4dbcf20a2540340 | "You are given two convex polygons $A$ and $B$. It is guaranteed that $B$ is strictly contained insi(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the minimum cost to cut out polygon B from polygon(...TRUNCATED) | kattis | mit | apps | test | 8 | "import math\n\ndef perimeter(points):\n n = len(points)\n total = 0.0\n for i in range(n):(...TRUNCATED) | 3590 | nvidia/OpenCodeReasoning | "The problem involves geometric algorithms and requires a good understanding of convex polygons, the(...TRUNCATED) | 8,092 | 505 | "Okay, let's see. We need to find the minimum cost to cut out polygon B from polygon A by making cut(...TRUNCATED) | "To solve this problem, we need to determine the minimum cost to cut out a convex polygon B from ano(...TRUNCATED) | "<think>\nOkay, let's see. We need to find the minimum cost to cut out polygon B from polygon A by m(...TRUNCATED) | [{"from":"human","value":"You are given two convex polygons $A$ and $B$. It is guaranteed that $B$ i(...TRUNCATED) |
null | "Your task is to, given an image, compress it to 100000 bytes or less, while following all of the be(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem involves advanced concepts related to image processing and compression algorithms. It r(...TRUNCATED) | 57,931 | 3,620 | "Okay, I need to solve this image compression problem. Let me read through the requirements again to(...TRUNCATED) | "To solve this problem, we need to compress an image to 100,000 bytes or less while adhering to spec(...TRUNCATED) | "<think>\nOkay, I need to solve this image compression problem. Let me read through the requirements(...TRUNCATED) | [{"from":"human","value":"Your task is to, given an image, compress it to 100000 bytes or less, whil(...TRUNCATED) |
null | "Paterson's worms are a kind of cellular automaton that exist on an infinite triangular grid and, ev(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem revolves around the behavior of a cellular automaton characterized by specific movement(...TRUNCATED) | 12,109 | 756 | "Okay, let's tackle this problem. Hmm, the task is to simulate Paterson's worm based on a given inpu(...TRUNCATED) | "To solve this problem, we need to simulate the movement of Paterson's worm on a triangular grid bas(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the task is to simulate Paterson's worm based on a g(...TRUNCATED) | [{"from":"human","value":"Paterson's worms are a kind of cellular automaton that exist on an infinit(...TRUNCATED) |
null | "(This challenge is very similar, but this current challenge has additional complications.)\n\nImagi(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem requires an understanding of geometrical reflections and handling a light beam simulati(...TRUNCATED) | 29,537 | 1,846 | "Okay, so I need to solve this programming problem. Let's read the problem carefully.\n\nThe task is(...TRUNCATED) | "To solve this problem, we need to simulate the path of a light beam entering a room with mirrored w(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let's read the problem carefully.\n\nTh(...TRUNCATED) | [{"from":"human","value":"(This challenge is very similar, but this current challenge has additional(...TRUNCATED) |
b8e2f3ab77eeea8910736410c06922f2 | "Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct ver(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem where Greg is deleting vertices one by o(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "n = int(input())\nadj = [list(map(int, input().split())) for _ in range(n)]\nx = list(map(int, inpu(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem involves working with a weighted directed graph and requires understanding of shortest(...TRUNCATED) | 60,476 | 3,779 | "Okay, I have this programming problem to solve. Let me read it carefully.\n\nSo Greg has a directed(...TRUNCATED) | "To solve this problem, we need to compute the sum of the shortest paths between all pairs of remain(...TRUNCATED) | "<think>\nOkay, I have this programming problem to solve. Let me read it carefully.\n\nSo Greg has a(...TRUNCATED) | [{"from":"human","value":"Greg has a weighed directed graph, consisting of n vertices. In this graph(...TRUNCATED) |
null | "In prefix notation, the operator comes before the arguments, so you can kind of imagine that the op(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem requires a deep understanding of stack-based evaluation methods and notation systems, (...TRUNCATED) | 39,342 | 2,458 | "Okay, I need to create an anyfix interpreter. Let's start by understanding the problem.\n\nThe main(...TRUNCATED) | "To solve this problem, we need to create an interpreter for the anyfix notation, which allows opera(...TRUNCATED) | "<think>\nOkay, I need to create an anyfix interpreter. Let's start by understanding the problem.\n\(...TRUNCATED) | [{"from":"human","value":"In prefix notation, the operator comes before the arguments, so you can ki(...TRUNCATED) |
6680cf995be38c594b46eb38141ae401 | "Dr. Asimov, a robotics researcher, released cleaning robots he developed (see Problem B). His robot(...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. Hmm, the problem is a bit complex, so I need to und(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | 8 | "def main():\n import sys\n input = sys.stdin.read().split()\n idx = 0\n while True:\n (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves generating carpet layouts for robots with specific movement and interaction ru(...TRUNCATED) | 62,601 | 3,912 | "Okay, let's see. The problem is about creating a carpet layout for Dr. Asimov's house such that the(...TRUNCATED) | "To solve this problem, we need to generate a carpet layout for Dr. Asimov's house such that there e(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about creating a carpet layout for Dr. Asimov's house such(...TRUNCATED) | [{"from":"human","value":"Dr. Asimov, a robotics researcher, released cleaning robots he developed ((...TRUNCATED) |
2c0d36fbb91b538551fd7641fb69452b | "Alice is teaching Bob maths via a game called N-guesser.\n\nAlice has a positive integer N which Bo(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where Alice gives Bob the sum of divisors (X) and the s(...TRUNCATED) | codechef | apache-2.0 | taco | train | 8 | "import math\n\ndef sum_divisors(n):\n if n == 0:\n return 0\n original = n\n total (...TRUNCATED) | 19533 | nvidia/OpenCodeReasoning | "The problem requires understanding and manipulation of number theory concepts, specifically regardi(...TRUNCATED) | 13,059 | 816 | "Okay, let's see. The problem is about finding a number N given two pieces of information: the sum o(...TRUNCATED) | "To solve this problem, we need to determine a positive integer \\( N \\) given the sum of its divis(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding a number N given two pieces of information: (...TRUNCATED) | [{"from":"human","value":"Alice is teaching Bob maths via a game called N-guesser.\n\nAlice has a po(...TRUNCATED) |
null | "Consider \\$3\\$ binary strings of length \\$n\\$ chosen independently and uniformly at random. W(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem involves advanced concepts of expected values, Hamming distance, and requires a solid u(...TRUNCATED) | 15,903 | 993 | "Okay, let's see. The problem is to compute the exact expected minimum Hamming distance between any (...TRUNCATED) | "To solve this problem, we need to compute the exact expected minimum Hamming distance between any p(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to compute the exact expected minimum Hamming distance bet(...TRUNCATED) | [{"from":"human","value":"Consider \\$3\\$ binary strings of length \\$n\\$ chosen independently and(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6