id stringclasses 572
values | instruction_seed stringlengths 192 53.1k | output stringlengths 5.1k 71.5k ⌀ | source stringclasses 10
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 3
values | difficulty int64 6 10 | solution stringlengths 0 7.89k ⌀ | index stringclasses 67
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 280 861 | __original_row_idx int64 0 31.6k | ms_id int64 0 1.97k | reasoning stringlengths 1.4k 101k | deepseek_solution stringlengths 17 15.3k | final_reasoning_trace stringlengths 2.14k 106k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
37edf7309702ad47715d3fb4b73968a8 | "This is an interactive problem\n\nGinny is taking an exam on game theory. The professor is tired of(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this interactive problem where Ginny has to guess a verte(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "n, m, t = map(int, input().split())\nedges = [tuple(map(int, input().split())) for _ in range(m)]\n(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires a deep understanding of combinatorial game theory and interaction with a dynam(...TRUNCATED) | 7,336 | 458 | "Okay, let's try to figure out this problem. So, the problem is about modifying a directed acyclic g(...TRUNCATED) | "To solve this problem, we need to determine the chosen vertex in a directed acyclic graph (DAG) mod(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So, the problem is about modifying a directed (...TRUNCATED) | [{"from":"human","value":"This is an interactive problem\n\nGinny is taking an exam on game theory. (...TRUNCATED) |
null | "Output all 95 bytes from 0x20 to 0x7E inclusive (printable ASCII including space), in any order, ea(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem requires a deep understanding of programming concepts and constraints related to outpu(...TRUNCATED) | 6,818 | 426 | "Okay, I need to solve this programming challenge. Let me read the problem again carefully.\n\nThe t(...TRUNCATED) | "To solve this problem, we need to create a program that outputs all 95 printable ASCII characters ((...TRUNCATED) | "<think>\nOkay, I need to solve this programming challenge. Let me read the problem again carefully.(...TRUNCATED) | [{"from":"human","value":"Output all 95 bytes from 0x20 to 0x7E inclusive (printable ASCII including(...TRUNCATED) |
1109fb6814140a1775ee752d9abd0109 | "Leha like all kinds of strange things. Recently he liked the function F(n, k). Consider all possibl(...TRUNCATED) | "<think>\nOkay, let's see. So the problem is about rearranging array A to maximize the sum of F(A_i'(...TRUNCATED) | codeforces | - | - | - | 8 | "m = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\n# Cre(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves knowledge of combinatorial mathematics, specifically the expected value of the(...TRUNCATED) | 23,489 | 1,468 | "Okay, let's see. So the problem is about rearranging array A such that when we compute the sum of F(...TRUNCATED) | "To solve this problem, we need to maximize the sum of the mathematical expectation of the minimal e(...TRUNCATED) | "<think>\nOkay, let's see. So the problem is about rearranging array A such that when we compute the(...TRUNCATED) | [{"from":"human","value":"Leha like all kinds of strange things. Recently he liked the function F(n,(...TRUNCATED) |
null | "Subleq is a Turing-complete esolang with only one instruction, SUBLEQ. This instruction takes in th(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "This problem revolves around implementing a Turing-complete esolang with a single instruction, whic(...TRUNCATED) | 20,500 | 1,281 | "Okay, let's see. I need to implement the Subleq esolang. The input is an array of integers represen(...TRUNCATED) | "To solve this problem, we need to implement an interpreter for the Subleq esoteric programming lang(...TRUNCATED) | "<think>\nOkay, let's see. I need to implement the Subleq esolang. The input is an array of integers(...TRUNCATED) | [{"from":"human","value":"Subleq is a Turing-complete esolang with only one instruction, SUBLEQ. Thi(...TRUNCATED) |
null | "Robbers thread\nIn this cops-and-robbers challenge, your task is to write a program h that outputs (...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem requires a deep understanding of programming languages, the ability to construct a prog(...TRUNCATED) | 9,635 | 602 | "Okay, I need to create a Shue program that transforms a given input string into \"Hello Shue!\". Th(...TRUNCATED) | "GolfScript, score 15+1=16 \ni: `A` \nh (GolfScript program): \n`\"Hello Shue!\"` \nShue program(...TRUNCATED) | "<think>\nOkay, I need to create a Shue program that transforms a given input string into \"Hello Sh(...TRUNCATED) | [{"from":"human","value":"Robbers thread\nIn this cops-and-robbers challenge, your task is to write (...TRUNCATED) |
null | "Key Links\n\nDwarf question\nChat room\nGame\nController Interface\n\nTroll league table\n\n\n<scri(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires understanding complex game dynamics and implementing algorithms that respond t(...TRUNCATED) | 28,523 | 1,782 | "Okay, I need to create a troll player for the Thud game. Let me start by understanding the rules fo(...TRUNCATED) | "# AggressiveTroll\n==================\n\n```javascript\nclass AggressiveTroll {\n constructor(co(...TRUNCATED) | "<think>\nOkay, I need to create a troll player for the Thud game. Let me start by understanding the(...TRUNCATED) | [{"from":"human","value":"Key Links\n\nDwarf question\nChat room\nGame\nController Interface\n\nTrol(...TRUNCATED) |
null | "The challenge\nSimply write a program that outputs its own source code.\nNothing more than a regula(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem requires a deep understanding of quines, which are non-trivial programming constructs t(...TRUNCATED) | 20,719 | 1,294 | "Okay, I need to create a quine in VHDL that can run on an FPGA. The quine must output its own sourc(...TRUNCATED) | "To solve this problem, we need to create a quine in VHDL that outputs its own source code through a(...TRUNCATED) | "<think>\nOkay, I need to create a quine in VHDL that can run on an FPGA. The quine must output its (...TRUNCATED) | [{"from":"human","value":"The challenge\nSimply write a program that outputs its own source code.\nN(...TRUNCATED) |
e97d7c5fe3c51d41a0e98d92fcf1e577 | "Let f_{x} = c^{2x-6} ⋅ f_{x-1} ⋅ f_{x-2} ⋅ f_{x-3} for x ≥ 4.\n\nYou have given integers n,(...TRUNCATED) | "<think>\nOkay, let's see. I have to find f_n mod 1e9+7 given the recurrence relation. The problem i(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 9 | "mod = 10**9 + 7\nmod1 = mod - 1\n\ndef matrix_mult(a, b, mod):\n res = [[0]*3 for _ in range(3)](...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves calculating a term in a recursively defined sequence with very large values fo(...TRUNCATED) | 10,080 | 630 | "Okay, let's see. The problem is about computing f_n modulo 1e9+7, given the recursive formula where(...TRUNCATED) | "To solve this problem, we need to compute the value of \\( f_n \\) modulo \\( 10^9 + 7 \\) given a (...TRUNCATED) | "<think>\nOkay, let's see. The problem is about computing f_n modulo 1e9+7, given the recursive form(...TRUNCATED) | [{"from":"human","value":"Let f_{x} = c^{2x-6} ⋅ f_{x-1} ⋅ f_{x-2} ⋅ f_{x-3} for x ≥ 4.\n\nY(...TRUNCATED) |
f440e7fe58ed310cf376f7bb8aca3e53 | "We are committed to the well being of all participants. Therefore, instead of the problem, we sugge(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem where given a bunch of triangles(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom collections import defaultdict\n\ndef main():\n input = sys.stdin.read().split((...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires a deep understanding of geometry, especially concerning the properties of con(...TRUNCATED) | 13,110 | 819 | "Okay, let's try to figure out how to solve this problem. So the problem is about reconstructing the(...TRUNCATED) | "To solve this problem, we need to determine the original vertex order of a regular n-sided polygon (...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. So the problem is about reconstru(...TRUNCATED) | [{"from":"human","value":"We are committed to the well being of all participants. Therefore, instead(...TRUNCATED) |
null | "A strictly non-palindromic number N is a number that isn't a palindrome in any base (in bases 2 to (...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires a good understanding of numeric bases and palindromic properties, which involv(...TRUNCATED) | 2,627 | 164 | "Okay, so I need to solve this problem where I have to determine if a number is strictly non-palindr(...TRUNCATED) | "To solve this problem, we need to determine if a given number \\( N \\) is strictly non-palindromic(...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to determine if a number is strictly no(...TRUNCATED) | [{"from":"human","value":"A strictly non-palindromic number N is a number that isn't a palindrome in(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6