instruction_seed stringlengths 189 24.4k | _source stringclasses 2
values | embedding sequencelengths 3.07k 3.07k | mean_positive_score float64 0.15 0.4 | mean_negative_score float64 0.01 0.17 | difference_score float64 0.14 0.32 | id stringclasses 367
values | output stringlengths 2.76k 75.1k ⌀ | source stringclasses 3
values | license stringclasses 2
values | dataset stringclasses 2
values | split stringclasses 3
values | difficulty stringclasses 20
values | solution stringlengths 39 8.04k ⌀ | reasoning stringlengths 0 115k | deepseek_solution stringlengths 0 15.1k | __original_row_idx int64 2 31.6k | final_reasoning_trace stringlengths 19 120k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"For a 2 dimensional array we will define the elements in either the first row or the last column to(...TRUNCATED) | stackexchange_codegolf | [0.029381565749645233,-0.00821427907794714,-0.004202060401439667,0.014712687581777573,-0.01006157975(...TRUNCATED) | 0.228045 | 0.078128 | 0.149917 | null | null | null | null | null | null | null | null | "Okay, I need to find the J-twin of a given 2D array. Let me try to understand what the J-twin is ba(...TRUNCATED) | "To solve this problem, we need to determine the J-twin of a given 2D array. The J-twin is another m(...TRUNCATED) | 8,471 | "<think>\nOkay, I need to find the J-twin of a given 2D array. Let me try to understand what the J-t(...TRUNCATED) | [{"from":"human","value":"For a 2 dimensional array we will define the elements in either the first (...TRUNCATED) |
"There are n positive integers a_1, a_2, ..., a_n. For the one move you can choose any even value c (...TRUNCATED) | nvidia/OpenCodeReasoning | [-0.02297651581466198,-0.029893601313233376,-0.01224565226584673,0.014531238935887814,0.007842043414(...TRUNCATED) | 0.37873 | 0.103882 | 0.274848 | f6a1965116bb047ffa76b810b2c9d7d6 | "<think>\nOkay, so I need to solve this programming problem. Let's read the problem statement carefu(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | EASY | "import sys\n\ndef main():\n input = sys.stdin.read\n data = input().split()\n idx = 0\n (...TRUNCATED) | "Okay, so I've got this programming problem to solve. Let me read through it carefully and understan(...TRUNCATED) | "To solve this problem, we need to transform an array of integers into an array of only odd integers(...TRUNCATED) | 7,118 | "<think>\nOkay, so I've got this programming problem to solve. Let me read through it carefully and (...TRUNCATED) | [{"from":"human","value":"There are n positive integers a_1, a_2, ..., a_n. For the one move you can(...TRUNCATED) |
"From Wikipedia, Gabriel's Horn is a particular geometric figure that has infinite surface area but (...TRUNCATED) | stackexchange_codegolf | [0.002761006820946932,0.011338348500430584,-0.015052393078804016,0.003262052545323968,0.009243066422(...TRUNCATED) | 0.223974 | 0.078142 | 0.145831 | null | null | null | null | null | null | null | null | "Okay, let's see. I need to solve this problem where after each slice of the cake, the total surface(...TRUNCATED) | "To solve this problem, we need to calculate the total surface area of a cuboid cake after each cons(...TRUNCATED) | 1,396 | "<think>\nOkay, let's see. I need to solve this problem where after each slice of the cake, the tota(...TRUNCATED) | [{"from":"human","value":"From Wikipedia, Gabriel's Horn is a particular geometric figure that has i(...TRUNCATED) |
"Introduction\nProgrammers have already solved the trolley problem (a classical problem in philosoph(...TRUNCATED) | stackexchange_codegolf | [-0.01707957126200199,-0.039567165076732635,-0.005667728837579489,-0.01108338963240385,0.00703883077(...TRUNCATED) | 0.296963 | 0.122899 | 0.174064 | null | null | null | null | null | null | null | null | "Okay, so I need to solve this problem where the goal is to find two paths in a directed acyclic pla(...TRUNCATED) | "To solve this problem, we need to find two paths in a directed, rooted, acyclic planar graph such t(...TRUNCATED) | 19,006 | "<think>\nOkay, so I need to solve this problem where the goal is to find two paths in a directed ac(...TRUNCATED) | [{"from":"human","value":"Introduction\nProgrammers have already solved the trolley problem (a class(...TRUNCATED) |
"When it comes to eating candy, I hold myself to higher standards than the typical layperson. There(...TRUNCATED) | stackexchange_codegolf | [0.02263438142836094,0.002814908279106021,-0.0009424996678717434,0.010288354940712452,-0.00921635143(...TRUNCATED) | 0.24783 | 0.093762 | 0.154068 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem. Let's read the problem statement carefully. The task is to take(...TRUNCATED) | "To solve this problem, we need to determine the correct order of candy consumption based on a speci(...TRUNCATED) | 24,780 | "<think>\nOkay, I need to solve this problem. Let's read the problem statement carefully. The task i(...TRUNCATED) | [{"from":"human","value":"When it comes to eating candy, I hold myself to higher standards than the (...TRUNCATED) |
"Objective\nGiven an integer \\$n\\$ interpreted as two's complement binary, output two integers, na(...TRUNCATED) | stackexchange_codegolf | [-0.00008254552813014016,-0.014519266784191132,-0.005428689531981945,-0.026729445904493332,-0.015184(...TRUNCATED) | 0.218508 | 0.046711 | 0.171796 | null | null | null | null | null | null | null | null | "Okay, let's tackle this problem. So the task is to split a given integer into two parts based on th(...TRUNCATED) | "To solve this problem, we need to split a given integer into two parts based on the positions of it(...TRUNCATED) | 6,503 | "<think>\nOkay, let's tackle this problem. So the task is to split a given integer into two parts ba(...TRUNCATED) | [{"from":"human","value":"Objective\nGiven an integer \\$n\\$ interpreted as two's complement binary(...TRUNCATED) |
"You task here is very simple:\nGiven a positive integer n without leading zeroes as input, split it(...TRUNCATED) | stackexchange_codegolf | [0.010046605952084064,-0.026171408593654633,-0.005305863916873932,0.012238021939992905,0.00086102553(...TRUNCATED) | 0.26502 | 0.04489 | 0.22013 | null | null | null | null | null | null | null | null | "Okay, let's see. The problem is to split a given positive integer into all possible partitions wher(...TRUNCATED) | "To solve this problem, we need to generate all possible ways to split a given positive integer (pro(...TRUNCATED) | 14,612 | "<think>\nOkay, let's see. The problem is to split a given positive integer into all possible partit(...TRUNCATED) | [{"from":"human","value":"You task here is very simple:\nGiven a positive integer n without leading (...TRUNCATED) |
"Iahub accidentally discovered a secret lab. He found there n devices ordered in a line, numbered fr(...TRUNCATED) | nvidia/OpenCodeReasoning | [-0.0057046543806791306,-0.016076084226369858,-0.003339983057230711,0.021228674799203873,0.000084477(...TRUNCATED) | 0.352396 | 0.083862 | 0.268534 | ea561659b09ce2a765437b014ae10c06 | "<think>\nOkay, let's see. I need to solve this programming problem. Let's read the problem carefull(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | HARD | "MOD = 10**9 + 7\n\nn = int(input())\na = list(map(int, input().split()))\ntotal = 0\n\nfor i in ran(...TRUNCATED) | "Okay, let's see. The problem is about finding the number of ways to select a contiguous subarray an(...TRUNCATED) | "To solve this problem, we need to determine the number of ways Iahub can take a photo of a contiguo(...TRUNCATED) | 17,211 | "<think>\nOkay, let's see. The problem is about finding the number of ways to select a contiguous su(...TRUNCATED) | [{"from":"human","value":"Iahub accidentally discovered a secret lab. He found there n devices order(...TRUNCATED) |
"You are given a functional graph. It is a directed graph, in which from each vertex goes exactly on(...TRUNCATED) | nvidia/OpenCodeReasoning | [0.010316768661141396,-0.0031657477375119925,-0.00130281422752887,0.013746879994869232,0.01611292921(...TRUNCATED) | 0.337955 | 0.07908 | 0.258874 | be797c47981ebefd5da6e5c7fb05a0c8 | "<think>\nOkay, let's tackle this problem. Hmm. So the problem is about functional graphs, where eac(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 11 | "import sys\n\ndef main():\n n, k = map(int, sys.stdin.readline().split())\n f = list(map(int,(...TRUNCATED) | "Okay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, we have a (...TRUNCATED) | "To solve this problem, we need to compute two values for each vertex in a functional graph after fo(...TRUNCATED) | 1,722 | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, w(...TRUNCATED) | [{"from":"human","value":"You are given a functional graph. It is a directed graph, in which from ea(...TRUNCATED) |
"Given the input of the first number and the second number (both positive integers, zero exluded), d(...TRUNCATED) | stackexchange_codegolf | [0.016243591904640198,0.0026414492167532444,-0.003948959056288004,-0.003093869425356388,-0.016181403(...TRUNCATED) | 0.280611 | 0.097901 | 0.18271 | null | null | null | null | null | null | null | null | "Okay, let's see. I need to find the number of ways to reach the second number from the first using (...TRUNCATED) | "To solve this problem, we need to determine the number of ways to transform a starting number into (...TRUNCATED) | 6,941 | "<think>\nOkay, let's see. I need to find the number of ways to reach the second number from the fir(...TRUNCATED) | [{"from":"human","value":"Given the input of the first number and the second number (both positive i(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4