id string | instruction_seed string | output string | source string | license string | dataset string | split string | difficulty int64 | solution string | index string | _source string | difficulty_reasoning string | __original_row_idx int64 | ms_id int64 | reasoning string | deepseek_solution string | final_reasoning_trace string | conversations list |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
a105b21699e6671f6f33b5d14426e61c | "Finally, \"Hayabusa2\" will be launched at the end of this month. When Hayabusa came back four year(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to calculate the time Kaguya is hidden beh(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | 8 | "import math\n\nm, t = map(int, input().split())\n\ntheta_m_initial = math.radians(m)\nt_seconds = t(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires understanding of circular motion in three-dimensional space, dealing with conc(...TRUNCATED) | 3,868 | 241 | "Okay, I need to solve this programming problem. Let's read through the problem statement carefully.(...TRUNCATED) | "To solve this problem, we need to determine the time duration during which the Kaguya satellite is (...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read through the problem statement c(...TRUNCATED) | [{"from":"human","value":"Finally, \"Hayabusa2\" will be launched at the end of this month. When Hay(...TRUNCATED) |
null | "Write a program or function that takes in a nonempty single-line string. You may assume it only con(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires generating a specific ASCII art structure based on input, which involves both (...TRUNCATED) | 4,586 | 286 | "Okay, let's see. I need to write a program that takes a string and generates this lozenge shape mad(...TRUNCATED) | "To solve this problem, we need to generate an ASCII art lozenge shape from the prefixes of a given (...TRUNCATED) | "<think>\nOkay, let's see. I need to write a program that takes a string and generates this lozenge (...TRUNCATED) | [{"from":"human","value":"Write a program or function that takes in a nonempty single-line string. Y(...TRUNCATED) |
null | "Write a function or program that, when given a list of names, outputs or returns a list where dupli(...TRUNCATED) | null | null | null | null | null | 6 | null | null | stackexchange_codegolf | "The problem requires a mix of string manipulation and algorithmic thinking to ensure the uniqueness(...TRUNCATED) | 18,809 | 1,175 | "Okay, I need to solve this problem. Let's read the problem statement carefully.\n\nThe task is to p(...TRUNCATED) | "To solve this problem, we need to process a list of names such that each name is formatted accordin(...TRUNCATED) | "<think>\nOkay, I need to solve this problem. Let's read the problem statement carefully.\n\nThe tas(...TRUNCATED) | [{"from":"human","value":"Write a function or program that, when given a list of names, outputs or r(...TRUNCATED) |
0fcbb7a2e9742b8a4fad70e7efa8153d | "D: Is greed the best?\n\nstory\n\nIn Japan, where there are 1, 5, 10, 50, 100, 500 yen coins, it is(...TRUNCATED) | "<think>\nOkay, so I need to find the smallest amount where the greedy algorithm doesn't work for th(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | 8 | "A, B = map(int, input().split())\nd = B % A\nif d == 0:\n print(-1)\nelse:\n m = B // A\n (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires a deep understanding of coin denominations and greedy algorithms coupled with(...TRUNCATED) | 31,142 | 1,946 | "Okay, I need to solve this problem where given two coin denominations A and B (with 1 being the thi(...TRUNCATED) | "To solve this problem, we need to determine the smallest amount of money that cannot be minimized b(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where given two coin denominations A and B (with 1 bein(...TRUNCATED) | [{"from":"human","value":"D: Is greed the best?\n\nstory\n\nIn Japan, where there are 1, 5, 10, 50, (...TRUNCATED) |
null | "A challenge I thought that would be very cool is to make an interpreter for a Turing-complete langu(...TRUNCATED) | null | null | null | null | null | 10 | null | null | stackexchange_codegolf | "This problem requires a deep understanding of computation theory, specifically the concept of Turin(...TRUNCATED) | 27,573 | 1,723 | "Okay, so I need to create an interpreter for a Turing-complete language using another language. The(...TRUNCATED) | "To solve this problem, we need to create an interpreter for the Brainfuck programming language usin(...TRUNCATED) | "<think>\nOkay, so I need to create an interpreter for a Turing-complete language using another lang(...TRUNCATED) | [{"from":"human","value":"A challenge I thought that would be very cool is to make an interpreter fo(...TRUNCATED) |
null | "Every programmer knows that brackets []{}()<> are really fun. To exacerbate this fun, groups of in(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires an understanding of data structures to keep track of the positions of various (...TRUNCATED) | 27,834 | 1,739 | "Okay, so I need to solve this problem where I have to take a string of balanced brackets and turn t(...TRUNCATED) | "To solve this problem, we need to transform a string of balanced brackets into an interlocking squa(...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to take a string of balanced brackets a(...TRUNCATED) | [{"from":"human","value":"Every programmer knows that brackets []{}()<> are really fun. To exacerba(...TRUNCATED) |
null | "This challenge is to find the longest chain of English words where the first 3\ncharacters of the n(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires the construction of chains of words based on specific matching criteria (first(...TRUNCATED) | 22,393 | 1,399 | "Okay, I need to find the longest chain of English words where each next word starts with the last t(...TRUNCATED) | "To solve this problem, we need to find the longest chain of English words where each subsequent wor(...TRUNCATED) | "<think>\nOkay, I need to find the longest chain of English words where each next word starts with t(...TRUNCATED) | [{"from":"human","value":"This challenge is to find the longest chain of English words where the fir(...TRUNCATED) |
null | "This is a two-player card game which resembles a vastly simplified game of Texas Hold'em,\ncombined(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires a moderate understanding of game mechanics, strategies for card selection, and(...TRUNCATED) | 3,479 | 217 | "Okay, let's see. I need to create a bot for this card game. The game has a Draft phase and a Main p(...TRUNCATED) | "To solve this problem, we need to create a bot that can effectively play a simplified card game inv(...TRUNCATED) | "<think>\nOkay, let's see. I need to create a bot for this card game. The game has a Draft phase and(...TRUNCATED) | [{"from":"human","value":"This is a two-player card game which resembles a vastly simplified game of(...TRUNCATED) |
null | "Background\nAlice and Bob are creating a golfing language to win every single PPCG challenge.\nAlic(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem involves parsing a two-dimensional representation of a programming language, which incl(...TRUNCATED) | 3,307 | 206 | "Okay, I need to solve this problem where I have to parse a grid of characters into a nested functio(...TRUNCATED) | "To solve this problem, we need to parse a grid of characters into a nested function call expression(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to parse a grid of characters into a neste(...TRUNCATED) | [{"from":"human","value":"Background\nAlice and Bob are creating a golfing language to win every sin(...TRUNCATED) |
null | "In this challenge you will be given an alphabetic string as input. We will define the \"anti-strin(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires an understanding of strings and specific manipulations involving their substri(...TRUNCATED) | 13,985 | 874 | "Okay, I need to solve this problem. Let me read through the description again to make sure I unders(...TRUNCATED) | "To solve this problem, we need to repeatedly find the longest contiguous substrings in a given stri(...TRUNCATED) | "<think>\nOkay, I need to solve this problem. Let me read through the description again to make sure(...TRUNCATED) | [{"from":"human","value":"In this challenge you will be given an alphabetic string as input. We wil(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5