id stringlengths 32 32 ⌀ | instruction_seed stringlengths 56 48.6k | output stringlengths 5k 73.2k ⌀ | source stringclasses 10
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 4
values | difficulty int64 6 10 | solution stringlengths 36 10.3k ⌀ | index stringclasses 229
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 243 873 | __original_row_idx int64 35 31.6k | ms_id int64 8 7.9k | reasoning stringlengths 1.37k 111k | deepseek_solution stringlengths 0 50.2k | final_reasoning_trace stringlengths 1.47k 117k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2ce8186d93e9baf11ab3806e86318623 | "Bamboo Blossoms\n\nThe bamboos live for decades, and at the end of their lives, they flower to make(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm. So the goal is to find the first year after the firs(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | 8 | "import sys\nimport math\n\ndef count_generators(m, x):\n if x < m:\n return 0\n is_gen(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires a deep understanding of mathematical insights related to modular arithmetic a(...TRUNCATED) | 11,042 | 2,760 | "Okay, let's tackle this problem. Hmm. The problem is about finding the first year after m years whe(...TRUNCATED) | "To solve this problem, we need to determine the first year after the initial m years where Dr. ACM'(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm. The problem is about finding the first year after m (...TRUNCATED) | [{"from":"human","value":"Bamboo Blossoms\n\nThe bamboos live for decades, and at the end of their l(...TRUNCATED) |
null | "Challenge\nWe once had a challenge to count domino tilings of m by n grid, and we all know that, fo(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem requires deep mathematical insights and advanced algorithmic implementations to derive(...TRUNCATED) | 10,076 | 2,519 | "Okay, so I need to write a program that, given an integer m, outputs the coefficients of a linear r(...TRUNCATED) | "To solve this problem, we need to compute the linear recurrence relation for the number of domino t(...TRUNCATED) | "<think>\nOkay, so I need to write a program that, given an integer m, outputs the coefficients of a(...TRUNCATED) | [{"from":"human","value":"Challenge\nWe once had a challenge to count domino tilings of m by n grid,(...TRUNCATED) |
d689272b202a34848e2220da41506cb6 | "Taro went to a toy store to buy a game of life made by Aizu Hobby. Life games are played using a bo(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where I calculate the expected value of the (...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | 8 | "import sys\n\ndef main():\n while True:\n line = sys.stdin.readline()\n if not lin(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires careful handling of probabilities and expected values, which involves understa(...TRUNCATED) | 28,292 | 7,073 | "Okay, let's see. I need to solve this problem where I have to compute the expected value of the mon(...TRUNCATED) | "To solve this problem, we need to calculate the expected value of the money earned when reaching th(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where I have to compute the expected value o(...TRUNCATED) | [{"from":"human","value":"Taro went to a toy store to buy a game of life made by Aizu Hobby. Life ga(...TRUNCATED) |
6d442ac149450731d2ff92fc65b72825 | "Misha has a tree with characters written on the vertices. He can choose two vertices s and t of thi(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding the longest common prefix between two paths (...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom collections import deque\n\ndef main():\n input = sys.stdin.read().split()\n (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves both tree structure manipulation and string processing, which are non-trivial (...TRUNCATED) | 1,716 | 429 | "Okay, so I've got this programming problem to solve, and I need to figure out the best way to appro(...TRUNCATED) | "To solve this problem, we need to determine the length of the longest common prefix (LCP) between t(...TRUNCATED) | "<think>\nOkay, so I've got this programming problem to solve, and I need to figure out the best way(...TRUNCATED) | [{"from":"human","value":"Misha has a tree with characters written on the vertices. He can choose tw(...TRUNCATED) |
null | "This is a challenge for the people using Swift 2.0 beta 6, it's not code golf, but it's a programmi(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem requires a deep understanding of Swift language features, including the usage of generi(...TRUNCATED) | 17,162 | 4,290 | "Okay, let's tackle this Swift puzzle. The goal is to make the given code compile without modifying (...TRUNCATED) | "To solve this puzzle, we need to make the provided Swift code compile without altering the given li(...TRUNCATED) | "<think>\nOkay, let's tackle this Swift puzzle. The goal is to make the given code compile without m(...TRUNCATED) | [{"from":"human","value":"This is a challenge for the people using Swift 2.0 beta 6, it's not code g(...TRUNCATED) |
1e289e150193ae4b1d972d21b003fe38 | "You've probably heard about the twelve labors of Heracles, but do you have any idea about the thirt(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let's try to understand what's being as(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\n\ndef main():\n input = sys.stdin.read().split()\n ptr = 0\n t = int(input[ptr(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem involves complex graph theory concepts, specifically dealing with tree structures and (...TRUNCATED) | 13,445 | 3,361 | "Okay, let's try to tackle this problem. So, the task is to compute for each k from 1 to n-1 the max(...TRUNCATED) | "To solve this problem, we need to determine the maximum possible value of a k-coloring for a tree w(...TRUNCATED) | "<think>\nOkay, let's try to tackle this problem. So, the task is to compute for each k from 1 to n-(...TRUNCATED) | [{"from":"human","value":"You've probably heard about the twelve labors of Heracles, but do you have(...TRUNCATED) |
null | "Your task is pretty simple, calculate the n-th element of A190810.\nElements of A190810 are calcula(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem involves generating a sequence based on specific rules and requires the implementation (...TRUNCATED) | 11,347 | 2,836 | "Okay, I need to find a way to compute the n-th element of the A190810 sequence. Let me start by und(...TRUNCATED) | "To solve this problem, we need to compute the n-th element of the sequence A190810, which is genera(...TRUNCATED) | "<think>\nOkay, I need to find a way to compute the n-th element of the A190810 sequence. Let me sta(...TRUNCATED) | [{"from":"human","value":"Your task is pretty simple, calculate the n-th element of A190810.\nElemen(...TRUNCATED) |
2a75dbcd352cd3ab73cc8bd7ceb306b1 | "While Grisha was celebrating New Year with Ded Moroz, Misha gifted Sasha a small rectangular pond o(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about placing k fishes in an n x m grid such that the expe(...TRUNCATED) | codeforces | - | - | - | 8 | "import heapq\n\nn, m, r, k = map(int, input().split())\n\ndef compute_counts(n, r):\n max_dx = m(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves not only a clear understanding of grid arrangements and the implications of a (...TRUNCATED) | 19,938 | 4,984 | "Okay, let's see. We need to place k fishes in the pond such that the expected number of caught fish(...TRUNCATED) | "To solve this problem, we need to place k fishes in an n x m pond such that the expected number of (...TRUNCATED) | "<think>\nOkay, let's see. We need to place k fishes in the pond such that the expected number of ca(...TRUNCATED) | [{"from":"human","value":"While Grisha was celebrating New Year with Ded Moroz, Misha gifted Sasha a(...TRUNCATED) |
null | "Challenge\nGiven the Cartesian coordinates of two or more distinct points in Euclidean n-space (\\$(...TRUNCATED) | null | null | null | null | null | 9 | null | null | stackexchange_codegolf | "The problem involves advanced concepts in linear algebra, specifically the rank of matrices and aff(...TRUNCATED) | 26,853 | 6,713 | "Okay, I need to solve this problem where I have to find the minimum dimension of a flat subspace th(...TRUNCATED) | "To solve this problem, we need to determine the minimum dimension of a flat (affine) subspace that (...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the minimum dimension of a flat su(...TRUNCATED) | [{"from":"human","value":"Challenge\nGiven the Cartesian coordinates of two or more distinct points (...TRUNCATED) |
3db9fe9b289e64ad0f4cb3b6e47a292e | "Rahul has recently been obsessed with mathematics, and spends most of his time reading the research(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. The task is to find the number of ways to represent a num(...TRUNCATED) | hackerearth | cc-by-4.0 | code_contests | train | 8 | "import sys\n\ndef count_power_of_two(n):\n k = 0\n while n % 2 == 0:\n k += 1\n (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires deep mathematical insights related to the representation of numbers as a sum o(...TRUNCATED) | 7,241 | 1,810 | "Okay, I need to solve this problem where given a number N, I have to find the number of ways to rep(...TRUNCATED) | "To solve this problem, we need to determine the number of ways a given number \\( N \\) can be repr(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where given a number N, I have to find the number of wa(...TRUNCATED) | [{"from":"human","value":"Rahul has recently been obsessed with mathematics, and spends most of his (...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6