instruction_seed stringlengths 161 37.7k | _source stringclasses 2
values | to_be_used float64 90 100 | classifier_reasoning stringlengths 27 1.11k | __original_row_idx int64 2 31.6k | id stringlengths 32 32 ⌀ | output stringlengths 1.43k 78.2k ⌀ | source stringclasses 5
values | license stringclasses 2
values | dataset stringclasses 2
values | split stringclasses 3
values | difficulty stringclasses 26
values | solution stringlengths 34 17.9k ⌀ | reasoning stringlengths 1.17k 117k | deepseek_solution stringlengths 93 16.6k | final_reasoning_trace stringlengths 2.31k 121k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"Given the state of a square Game of Life grid, determine whether it could have evolved from any pre(...TRUNCATED) | stackexchange_codegolf | 90 | "The proposed question requires determining whether a particular state in Conway's Game of Life coul(...TRUNCATED) | 7,996 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where I have to determine if a given Game of Life grid is a Gard(...TRUNCATED) | "To solve this problem, we need to determine if a given state in Conway's Game of Life could have ev(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to determine if a given Game of Life grid (...TRUNCATED) | [{"from":"human","value":"Given the state of a square Game of Life grid, determine whether it could (...TRUNCATED) |
"When translating DNA into proteins, the ribosomes read the sequence of DNA nucleotides 3 by 3. Each(...TRUNCATED) | stackexchange_codegolf | 95 | "The provided question is a computational problem involving string manipulation, codons, and genetic(...TRUNCATED) | 17,749 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where I have to find the earliest substitution in a DNA sequence(...TRUNCATED) | "To solve this problem, we need to find the earliest substitution in a DNA sequence that causes an e(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the earliest substitution in a DNA(...TRUNCATED) | [{"from":"human","value":"When translating DNA into proteins, the ribosomes read the sequence of DNA(...TRUNCATED) |
"Challenge\nThis coding challenge is to figure out how many rounds the cat can live.\nIn a \\$4\\tim(...TRUNCATED) | stackexchange_codegolf | 95 | "The question presented is a coding challenge that resembles the positive examples closely by involv(...TRUNCATED) | 23,257 | null | null | null | null | null | null | null | null | "Okay, let's try to solve this problem. Hmm, the challenge is to determine how many rounds the cat c(...TRUNCATED) | "To solve this problem, we need to determine how many rounds a cat can survive in a 4x4 grid by movi(...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. Hmm, the challenge is to determine how many rounds (...TRUNCATED) | [{"from":"human","value":"Challenge\nThis coding challenge is to figure out how many rounds the cat (...TRUNCATED) |
"Today Adilbek is taking his probability theory test. Unfortunately, when Adilbek arrived at the uni(...TRUNCATED) | nvidia/OpenCodeReasoning | 100 | "This question requires solving a complex problem related to probability theory, similar to the posi(...TRUNCATED) | 20,594 | 4d33b42a4c6c39dbf9de1429c4fe2247 | "<think>\nOkay, let's try to figure out this problem. Hmm. So Adilbek is solving crosswords one by o(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 12 | "MOD = 10**9 + 7\n\nn, T = map(int, input().split())\nt = list(map(int, input().split()))\n\nmax_n =(...TRUNCATED) | "Okay, let's try to figure out this problem. So Adilbek is solving crosswords one by one, and each t(...TRUNCATED) | "To solve this problem, we need to determine the expected number of crosswords Adilbek can solve wit(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So Adilbek is solving crosswords one by one, a(...TRUNCATED) | [{"from":"human","value":"Today Adilbek is taking his probability theory test. Unfortunately, when A(...TRUNCATED) |
"All Berland residents are waiting for an unprecedented tour of wizard in his Blue Helicopter over t(...TRUNCATED) | nvidia/OpenCodeReasoning | 100 | "The question involves a combinatorial problem about optimizing the number of episodes of a performa(...TRUNCATED) | 20,667 | 765ef144b6e007f22c881f0ce03a2ad2 | "<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 | HARD | "import sys\nfrom collections import defaultdict\n\ndef main():\n n, m = map(int, sys.stdin.readl(...TRUNCATED) | "Okay, let's see. The problem is about finding the maximum number of episodes the wizard can perform(...TRUNCATED) | "To solve this problem, we need to determine the maximum number of episodes the wizard can perform, (...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding the maximum number of episodes the wizard ca(...TRUNCATED) | [{"from":"human","value":"All Berland residents are waiting for an unprecedented tour of wizard in h(...TRUNCATED) |
"We'll define the N-exponential potential of a positive integer M as the count of prefixes of MN tha(...TRUNCATED) | stackexchange_codegolf | 95 | "The question requires the computation of a property related to prefixes of a number being perfect p(...TRUNCATED) | 8,463 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where given M and N, I have to compute the N-exponential potenti(...TRUNCATED) | "To solve this problem, we need to determine the N-exponential potential of a positive integer M, wh(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where given M and N, I have to compute the N-exponentia(...TRUNCATED) | [{"from":"human","value":"We'll define the N-exponential potential of a positive integer M as the co(...TRUNCATED) |
"This is Hole-3 from The Autumn Tournament of APL CodeGolf. I am the original author of the problem (...TRUNCATED) | stackexchange_codegolf | 94 | "The question involves mathematical concepts and logical reasoning related to knight movements on a (...TRUNCATED) | 17,453 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where given a number of moves and a list of starting positions o(...TRUNCATED) | "To solve this problem, we need to determine the unique positions a knight can reach on an 8x8 chess(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where given a number of moves and a list of starting po(...TRUNCATED) | [{"from":"human","value":"This is Hole-3 from The Autumn Tournament of APL CodeGolf. I am the origin(...TRUNCATED) |
"A variable-length quantity (also referred to as VLQ or uintvar) is a way to encode up to a 28 bit i(...TRUNCATED) | stackexchange_codegolf | 90 | "The question asks for a coding challenge that involves converting a variable-length quantity to its(...TRUNCATED) | 20,556 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where I have to convert a variable-length quantity (VLQ) into it(...TRUNCATED) | "To solve this problem, we need to convert a variable-length quantity (VLQ) into its corresponding i(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to convert a variable-length quantity (VLQ(...TRUNCATED) | [{"from":"human","value":"A variable-length quantity (also referred to as VLQ or uintvar) is a way t(...TRUNCATED) |
"Background\nA binary tree is a rooted tree whose every node has at most two children.\nA labelled b(...TRUNCATED) | stackexchange_codegolf | 90 | "The question describes a problem involving binary search trees and asks for a determination based o(...TRUNCATED) | 23,153 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where I have to determine if a given list of integers is a valid(...TRUNCATED) | "To solve this problem, we need to determine if a given list of integers is a valid pre-order traver(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to determine if a given list of integers i(...TRUNCATED) | [{"from":"human","value":"Background\nA binary tree is a rooted tree whose every node has at most tw(...TRUNCATED) |
"Your task\nGiven a numerical string or integer \\$\\ge 0\\$ (which may have leading zeros), convert(...TRUNCATED) | stackexchange_codegolf | 95 | "The given question asks for a solution to a problem involving converting a numerical string into le(...TRUNCATED) | 2,817 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where I have to convert a numerical string into letters based on(...TRUNCATED) | "To solve this problem, we need to convert a numerical string (which may include leading zeros) into(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to convert a numerical string into letters(...TRUNCATED) | [{"from":"human","value":"Your task\nGiven a numerical string or integer \\$\\ge 0\\$ (which may hav(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4