Dataset Viewer
id
stringclasses 975
values | instruction_seed
stringlengths 80
53.1k
| output
stringlengths 3.8k
79.3k
⌀ | source
stringclasses 10
values | license
stringclasses 4
values | dataset
stringclasses 4
values | split
stringclasses 3
values | difficulty
int64 6
10
| solution
stringlengths 0
12.5k
⌀ | index
stringclasses 135
values | _source
stringclasses 2
values | difficulty_reasoning
stringlengths 256
886
| __original_row_idx
int64 8
63.2k
| ms_id
int64 0
3.95k
| reasoning
stringlengths 1.08k
105k
| deepseek_solution
stringlengths 0
31.7k
| final_reasoning_trace
stringlengths 1.69k
108k
| conversations
listlengths 2
2
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "Imagine that there are \\$n\\$ different types of objects \\$O_1,O_2,O_3,\\ldots,O_n\\$ and they ea(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires understanding of conversions between objects based on given factors, which int(...TRUNCATED) | 61,689 | 3,855 | "Okay, let's tackle this problem. Hmm, the task is to find all possible ending configurations after (...TRUNCATED) | "To solve this problem, we need to determine all possible ending configurations of objects after all(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the task is to find all possible ending configuratio(...TRUNCATED) | [{"from":"human","value":"Imagine that there are \\$n\\$ different types of objects \\$O_1,O_2,O_3,\(...TRUNCATED) |
d56a2dd5fa68ce9b72837ccc6032d211
| "After a wonderful evening in the restaurant the time to go home came. Leha as a true gentlemen sugg(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's try to understand what's going on he(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 9 | "import sys\n\nMOD = 10**9 + 7\n\ndef get_bits(x):\n bits = []\n for i in range(29, -1, -1):\n(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem requires extensive knowledge of advanced algorithms and mathematical concepts, particu(...TRUNCATED) | 5,347 | 334 | "Okay, let's try to figure out how to solve this problem. The problem is about a parking grid where (...TRUNCATED) | "To solve this problem, we need to efficiently compute the sum of car numbers in a specific submatri(...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. The problem is about a parking gr(...TRUNCATED) | [{"from":"human","value":"After a wonderful evening in the restaurant the time to go home came. Leha(...TRUNCATED) |
null | "For today's task, we have two programs, P and Q, both in the same language. Each of them receives a(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires participants to design two programs that interact with each other, ensuring th(...TRUNCATED) | 51,707 | 3,231 | "Okay, let's try to tackle this problem. So, the task is to create two different programs P and Q. E(...TRUNCATED) | "To solve this problem, we need two distinct programs, P and Q, where each program outputs the count(...TRUNCATED) | "<think>\nOkay, let's try to tackle this problem. So, the task is to create two different programs P(...TRUNCATED) | [{"from":"human","value":"For today's task, we have two programs, P and Q, both in the same language(...TRUNCATED) |
null | "\nLet's define a 2-quine as a program that prints its source code two times. For example, if the pr(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "This problem requires a solid understanding of quines, which are non-trivial programming constructs(...TRUNCATED) | 18,147 | 1,134 | "Okay, I need to write a 2-quine that, when run, produces a 3-quine, which in turn produces a 4-quin(...TRUNCATED) | "To solve this problem, we need to create a program that generates a sequence of n-quines, where eac(...TRUNCATED) | "<think>\nOkay, I need to write a 2-quine that, when run, produces a 3-quine, which in turn produces(...TRUNCATED) | [{"from":"human","value":"\nLet's define a 2-quine as a program that prints its source code two time(...TRUNCATED) |
d70122efc9b2691ca408044206c0adf1
| "AtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grow(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem where I have to schedule contest(...TRUNCATED) |
atcoder
|
cc-by-4.0
|
code_contests
|
train
| 8 | "D = int(input())\nc = list(map(int, input().split()))\ns = [list(map(int, input().split())) for _ i(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem involves planning and scheduling contests to maximize user satisfaction based on given(...TRUNCATED) | 40,800 | 2,550 | "Okay, so I need to solve this problem where I have to schedule contests over 365 days to maximize t(...TRUNCATED) | "To solve this problem, we need to schedule contests over 365 days to maximize user satisfaction, wh(...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to schedule contests over 365 days to m(...TRUNCATED) | [{"from":"human","value":"AtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the(...TRUNCATED) |
null | "A few hours earlier, I got this puzzle:\n\nSuppose, you toss a coin n times, then what is the proba(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "This problem requires a solid understanding of probabilities, combinatorial mathematics, and prime (...TRUNCATED) | 12,536 | 783 | "Okay, let's see. The problem is to calculate the probability of getting m heads in n coin tosses wh(...TRUNCATED) | "To solve this problem, we need to calculate the probability of getting a prime number of heads when(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to calculate the probability of getting m heads in n coin (...TRUNCATED) | [{"from":"human","value":"A few hours earlier, I got this puzzle:\n\nSuppose, you toss a coin n time(...TRUNCATED) |
null | "Task:\nConsider the problem: \"given a chessboard with one square missing, cut it into 21 L-triomin(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem involves a deep understanding of combinatorial design (specifically tiling problems) an(...TRUNCATED) | 26,596 | 1,662 | "Okay, I need to solve this problem where I have to tile an 8x8 chessboard with a missing square usi(...TRUNCATED) | "To solve this problem, we need to tile an 8x8 chessboard with one missing square using L-shaped tri(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to tile an 8x8 chessboard with a missing s(...TRUNCATED) | [{"from":"human","value":"Task:\nConsider the problem: \"given a chessboard with one square missing,(...TRUNCATED) |
38135ea118f1c877f70292f9edb033e1
| "You are a given a tree of N vertices. The i-th vertex has two things assigned to it — a value A_{(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about minimizing the sum of absolute differences across ed(...TRUNCATED) |
codechef
|
apache-2.0
|
taco
|
train
| 8 | "import sys\nfrom sys import stdin\nfrom collections import deque\n\ndef main():\n input = sys.st(...TRUNCATED) |
16142
|
nvidia/OpenCodeReasoning
| "This problem requires a deep understanding of graph theory (specifically trees) and optimization te(...TRUNCATED) | 47,353 | 2,959 | "Okay, let's see. We have a tree with N vertices. Each vertex has a value A_i, and a range [L_i, R_i(...TRUNCATED) | "To solve this problem, we need to minimize the sum of absolute differences between values of adjace(...TRUNCATED) | "<think>\nOkay, let's see. We have a tree with N vertices. Each vertex has a value A_i, and a range (...TRUNCATED) | [{"from":"human","value":"You are a given a tree of N vertices. The i-th vertex has two things assig(...TRUNCATED) |
ae14c93749fe700594dd1ab99762d286
| "Vivek initially has an empty array a and some integer constant m.\n\nHe performs the following algo(...TRUNCATED) | "<think>\nOkay, let's try to solve this problem. Hmm. The task is to find the expected length of the(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "MOD = 10**9 + 7\n\nm = int(input())\n\n# Precompute divisors for each number up to m\ndivisors = [[(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem involves understanding the expected value in a probabilistic setting, particularly rel(...TRUNCATED) | 49,158 | 3,072 | "Okay, so I need to find the expected length of the array a that Vivek generates based on the given (...TRUNCATED) | "To solve this problem, we need to determine the expected length of an array generated by an algorit(...TRUNCATED) | "<think>\nOkay, so I need to find the expected length of the array a that Vivek generates based on t(...TRUNCATED) | [{"from":"human","value":"Vivek initially has an empty array a and some integer constant m.\n\nHe pe(...TRUNCATED) |
null | "Given a list of non-negative integers the function \\$f\\$ replaces every integer with the number o(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires understanding of functional manipulations and properties of sequences, which s(...TRUNCATED) | 39,187 | 2,449 | "Okay, I need to solve this problem where I have to determine if a given list is in a loop according(...TRUNCATED) | "To solve this problem, we need to determine if a given list of non-negative integers is part of a l(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to determine if a given list is in a loop (...TRUNCATED) | [{"from":"human","value":"Given a list of non-negative integers the function \\$f\\$ replaces every (...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 12