id stringlengths 32 32 ⌀ | instruction_seed stringlengths 56 26.8k | output stringlengths 2.79k 73.2k ⌀ | source stringclasses 10
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 4
values | difficulty int64 6 10 | solution stringlengths 8 10.3k ⌀ | index stringclasses 258
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 265 925 | __original_row_idx int64 18 31.6k | ms_id int64 4 7.9k | reasoning stringlengths 1.55k 109k | deepseek_solution stringlengths 107 32k | final_reasoning_trace stringlengths 2.39k 121k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1c4a283b2cf3fd6f8cbbbb59c01cdcd0 | "“Can you answer this million dollar question ?” said the presenter to Little Achraf. \n“Yes(...TRUNCATED) | "<think>\nOkay, so I have this programming problem to solve. Let's try to understand it step by step(...TRUNCATED) | hackerearth | cc-by-4.0 | code_contests | train | 8 | "MOD = 10**9 + 7\n\ndef multiply(a, b, size):\n result = [[0]*size for _ in range(size)]\n for(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem is complex because it requires advanced understanding of sequences defined recursively,(...TRUNCATED) | 13,465 | 3,366 | "Okay, so I need to solve this programming problem. Let's read the problem carefully.\n\nThe problem(...TRUNCATED) | "To solve this problem, we need to determine the number of valid sequences that satisfy given constr(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let's read the problem carefully.\n\nTh(...TRUNCATED) | [{"from":"human","value":"“Can you answer this million dollar question ?” said the presenter to (...TRUNCATED) |
bcda95e6199be7a759a66b3d5e379522 | "You have a full binary tree having infinite levels.\n\nEach node has an initial value. If a node ha(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read through the problem carefully.\(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\n\ndef main():\n shift_val = dict() # Maps level to value shifts\n shift_node = d(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires deep understanding of tree structures and how to efficiently manipulate node (...TRUNCATED) | 20,905 | 5,226 | "Okay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, the proble(...TRUNCATED) | "To solve this problem, we need to handle an infinite full binary tree with nodes that can be shifte(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED) | [{"from":"human","value":"You have a full binary tree having infinite levels.\n\nEach node has an in(...TRUNCATED) |
null | "Your should write a program or function that determines the language of a given word.\nThe task is (...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires the implementation of a basic language recognition algorithm that categorizes (...TRUNCATED) | 26,182 | 6,545 | "Okay, I need to solve this problem where I have to determine the language of a given word among Eng(...TRUNCATED) | "To solve this problem, we need to determine the language of a given word among English, German, Ita(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to determine the language of a given word (...TRUNCATED) | [{"from":"human","value":"Your should write a program or function that determines the language of a (...TRUNCATED) |
7101aa5cda89d1f1df05a0a97e5c6875 | "Witua is a little student from the University of Lviv. He enjoys studying math. Witua knows a lot o(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem where for each test case with a given N, I (...TRUNCATED) | codechef | cc-by-4.0 | code_contests | train | 9 | "def is_prime(n):\n if n <= 1:\n return False\n elif n <= 3:\n return True\n (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires knowledge of the Euler's totient function and its properties, specifically in(...TRUNCATED) | 28,354 | 7,088 | "Okay, so I need to find, for a given N, the integer i between 2 and N that maximizes φ(i)/i. Let's(...TRUNCATED) | "To solve this problem, we need to determine the integer \\( i \\) between 2 and \\( N \\) that maxi(...TRUNCATED) | "<think>\nOkay, so I need to find, for a given N, the integer i between 2 and N that maximizes φ(i)(...TRUNCATED) | [{"from":"human","value":"Witua is a little student from the University of Lviv. He enjoys studying (...TRUNCATED) |
null | "Given a positive integer, output a truthy/falsy value as to whether the number can eat itself.\nRul(...TRUNCATED) | null | null | null | null | null | 6 | null | null | stackexchange_codegolf | "This problem combines rules about manipulating the digits of an integer and evaluating conditions b(...TRUNCATED) | 1,633 | 408 | "Okay, I need to solve this problem where a number can eat itself based on certain rules. Let me rea(...TRUNCATED) | "To solve this problem, we need to determine if a positive integer can \"eat itself\" based on speci(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where a number can eat itself based on certain rules. L(...TRUNCATED) | [{"from":"human","value":"Given a positive integer, output a truthy/falsy value as to whether the nu(...TRUNCATED) |
13bd2061c9b2f881620995d4bc5b334d | "You will be given a contest schedule for D days and M queries of schedule modification. In the i-th(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem. Let's read the problem statemen(...TRUNCATED) | atcoder | cc-by-4.0 | code_contests | train | 8 | "import bisect\n\ndef sum_interval(a, b, c, D):\n if a is None and b is None:\n return c *(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires understanding complex data manipulations and efficiency in handling multiple u(...TRUNCATED) | 21,096 | 5,274 | "Okay, let's see. I need to solve this programming problem. Hmm. The problem is about calculating th(...TRUNCATED) | "To solve this problem, we need to efficiently compute the satisfaction score after each modificatio(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem. Hmm. The problem is about calcu(...TRUNCATED) | [{"from":"human","value":"You will be given a contest schedule for D days and M queries of schedule (...TRUNCATED) |
null | "Robbers section\nThe cops section can be found here.\nChallenge\nYour task is to outgolf the submis(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem involves 'outgolfing' code submissions, which requires an understanding of code optimiz(...TRUNCATED) | 9,839 | 2,459 | "Okay, I need to find a cop submission that I can crack by writing a shorter program in the same lan(...TRUNCATED) | "## Python 3, <s>34</s> 17 bytes, [Destructible Watermelon's A000217](https://codegolf.stackexchange(...TRUNCATED) | "<think>\nOkay, I need to find a cop submission that I can crack by writing a shorter program in the(...TRUNCATED) | [{"from":"human","value":"Robbers section\nThe cops section can be found here.\nChallenge\nYour task(...TRUNCATED) |
null | "Challenge\nWrite two programs that:\n\nrun in two different programming languages.\n\n\nThese may n(...TRUNCATED) | null | null | null | null | null | 10 | null | null | stackexchange_codegolf | "The problem is exceptionally challenging due to several reasons: it requires creating two distinct (...TRUNCATED) | 14,457 | 3,614 | "Okay, I need to create two programs in different languages that output each other. And they have to(...TRUNCATED) | "To solve this problem, we need to create two programs in different programming languages that can o(...TRUNCATED) | "<think>\nOkay, I need to create two programs in different languages that output each other. And the(...TRUNCATED) | [{"from":"human","value":"Challenge\nWrite two programs that:\n\nrun in two different programming la(...TRUNCATED) |
null | "The inspiration for this code golf puzzle is the Bridge and Torch problem, in which d people at the(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem involves a strategic approach to minimize the total crossing time, which includes sorti(...TRUNCATED) | 7,723 | 1,930 | "Okay, I need to solve this bridge and torch problem for code golf. Hmm. Let's think about the appro(...TRUNCATED) | "To solve this problem, we need to determine the minimum time required for a group of people to cros(...TRUNCATED) | "<think>\nOkay, I need to solve this bridge and torch problem for code golf. Hmm. Let's think about (...TRUNCATED) | [{"from":"human","value":"The inspiration for this code golf puzzle is the Bridge and Torch problem,(...TRUNCATED) |
null | "Write a program or function that takes in a positive integer N and recreates this pattern of circle(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires both a solid understanding of basic geometry to position the circles correctly(...TRUNCATED) | 31,309 | 7,827 | "Okay, I need to write a program that generates this circle pattern for a given N. Let's see. The ex(...TRUNCATED) | "To solve this problem, we need to generate an image with a specific pattern of circles that fit int(...TRUNCATED) | "<think>\nOkay, I need to write a program that generates this circle pattern for a given N. Let's se(...TRUNCATED) | [{"from":"human","value":"Write a program or function that takes in a positive integer N and recreat(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6