instruction_seed stringlengths 87 20k | _source stringclasses 2
values | _fasttext_score float64 0.91 1 | id stringclasses 323
values | output stringlengths 1.55k 70.7k ⌀ | source stringclasses 5
values | license stringclasses 2
values | dataset stringclasses 2
values | split stringclasses 3
values | difficulty stringclasses 20
values | solution stringlengths 8 6.71k ⌀ | reasoning stringlengths 1.51k 105k | deepseek_solution stringlengths 175 16.5k | __original_row_idx int64 19 31.6k | final_reasoning_trace stringlengths 2.1k 113k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"Qat is a tool that lets you search for words matching a given pattern, often used by crossword and (...TRUNCATED) | stackexchange_codegolf | 0.981054 | null | null | null | null | null | null | null | null | "Okay, let's tackle this problem. Hmm, the task is to implement a subset of Qat's equation solver. T(...TRUNCATED) | "To solve this problem, we need to implement a subset of Qat's equation solver, where we find words (...TRUNCATED) | 13,211 | "<think>\nOkay, let's tackle this problem. Hmm, the task is to implement a subset of Qat's equation (...TRUNCATED) | [{"from":"human","value":"Qat is a tool that lets you search for words matching a given pattern, oft(...TRUNCATED) |
"Arya has n opponents in the school. Each day he will fight with all opponents who are present this (...TRUNCATED) | nvidia/OpenCodeReasoning | 0.998991 | a3d32e768801fdf33d14267d6ff1ae66 | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo th(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | interview | "n, d = map(int, input().split())\nwin_days = []\n\nfor _ in range(d):\n s = input().strip()\n (...TRUNCATED) | "Okay, let's see. I need to solve this problem where Arya is fighting opponents each day. The key is(...TRUNCATED) | "To solve this problem, we need to determine the maximum number of consecutive days Arya will beat a(...TRUNCATED) | 23,362 | "<think>\nOkay, let's see. I need to solve this problem where Arya is fighting opponents each day. T(...TRUNCATED) | [{"from":"human","value":"Arya has n opponents in the school. Each day he will fight with all oppone(...TRUNCATED) |
"This is an easy version of the problem. The actual problems are different, but the easy version is (...TRUNCATED) | nvidia/OpenCodeReasoning | 0.999279 | 8f621db6791fabe83fce835dbf650512 | "<think>\nOkay, let's see. The problem is to determine if we can color each character in the string (...TRUNCATED) | codeforces | - | - | - | introductory | "n = int(input())\ns = input().strip()\ns_ord = [ord(c) for c in s]\n\n# Initialize DP. Each entry i(...TRUNCATED) | "Okay, let's see. So the problem is about coloring a string's characters either 0 or 1. Then, after (...TRUNCATED) | "To solve this problem, we need to determine if we can color the characters of a given string such t(...TRUNCATED) | 5,757 | "<think>\nOkay, let's see. So the problem is about coloring a string's characters either 0 or 1. The(...TRUNCATED) | [{"from":"human","value":"This is an easy version of the problem. The actual problems are different,(...TRUNCATED) |
"There are n boxes with colored balls on the table. Colors are numbered from 1 to n. i-th box contai(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.999169 | f81b5f42c296b73e9a54f73081344fb4 | "<think>\nOkay, let's try to figure out this problem. So, the task is to find the minimum number of (...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | interview | "n = int(input())\na = list(map(int, input().split()))\nmax_a = max(a)\nlow = 1\nhigh = max_a\nans =(...TRUNCATED) | "Okay, let's try to figure out this problem. So, we have n boxes, each with balls of a unique color.(...TRUNCATED) | "To solve this problem, we need to divide all balls into sets such that each set contains balls of a(...TRUNCATED) | 21,787 | "<think>\nOkay, let's try to figure out this problem. So, we have n boxes, each with balls of a uniq(...TRUNCATED) | [{"from":"human","value":"There are n boxes with colored balls on the table. Colors are numbered fro(...TRUNCATED) |
"There are n lights aligned in a row. These lights are numbered 1 to n from left to right. Initially(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.998988 | 0f4f338458e1e1fd106e0f137199b9db | "<think>\nOkay, let's try to figure out this problem. So, we have a row of n lights, some of which a(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | interview | "MOD = 10**9 + 7\n\nn, m = map(int, input().split())\nons = list(map(int, input().split()))\nons.sor(...TRUNCATED) | "Okay, let's see. The problem is about turning on all the lights in a row, given some initially on. (...TRUNCATED) | "To solve this problem, we need to determine the number of ways to switch on all the lights in a row(...TRUNCATED) | 29,759 | "<think>\nOkay, let's see. The problem is about turning on all the lights in a row, given some initi(...TRUNCATED) | [{"from":"human","value":"There are n lights aligned in a row. These lights are numbered 1 to n from(...TRUNCATED) |
"Little D is a friend of Little C who loves intervals very much instead of number \"3\".\n\nNow he h(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.999623 | 43d1e0a667d9aa1d158d1c5addc2f5bb | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | VERY_HARD | "def main():\n import sys\n input = sys.stdin.read\n data = input().split()\n idx = 0\n (...TRUNCATED) | "Okay, let's see. So the problem is about selecting exactly k different interval of intervals such t(...TRUNCATED) | "To solve this problem, we need to select exactly k different intervals of intervals such that the s(...TRUNCATED) | 14,045 | "<think>\nOkay, let's see. So the problem is about selecting exactly k different interval of interva(...TRUNCATED) | [{"from":"human","value":"Little D is a friend of Little C who loves intervals very much instead of (...TRUNCATED) |
"Given a textual representation (case-insensitive full name or 3 character abbreviation) of a month (...TRUNCATED) | stackexchange_codegolf | 0.950025 | null | null | null | null | null | null | null | null | "Okay, I need to write a function that takes a month's name (either full name case-insensitive or 3-(...TRUNCATED) | "To solve this problem, we need to determine the number of days in a given month based on its textua(...TRUNCATED) | 1,112 | "<think>\nOkay, I need to write a function that takes a month's name (either full name case-insensit(...TRUNCATED) | [{"from":"human","value":"Given a textual representation (case-insensitive full name or 3 character (...TRUNCATED) |
"The number 113 is the first prime whose length 3 is prime, digital sum 5 = 1 + 1 + 3 is prime, and (...TRUNCATED) | stackexchange_codegolf | 0.921604 | null | null | null | null | null | null | null | null | "Okay, I need to find the largest supremely prime number possible. Let's start by understanding the (...TRUNCATED) | "To find the largest supremely prime number, we need to consider numbers composed mostly of 1's with(...TRUNCATED) | 14,506 | "<think>\nOkay, I need to find the largest supremely prime number possible. Let's start by understan(...TRUNCATED) | [{"from":"human","value":"The number 113 is the first prime whose length 3 is prime, digital sum 5 =(...TRUNCATED) |
"Let's imagine we have a finite set of positive integers. This set can be represented as a line of (...TRUNCATED) | stackexchange_codegolf | 0.917727 | null | null | null | null | null | null | null | null | "Okay, let's try to figure out how to solve this problem. The task is to find all the factors of a g(...TRUNCATED) | "To solve this problem, we need to determine all possible factors of a given set of positive integer(...TRUNCATED) | 13,844 | "<think>\nOkay, let's try to figure out how to solve this problem. The task is to find all the facto(...TRUNCATED) | [{"from":"human","value":"Let's imagine we have a finite set of positive integers. This set can be (...TRUNCATED) |
"You are given a sequence a consisting of n integers. Find the maximum possible value of <image> (in(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.999752 | 372a55816f9862dbd017107cd6640e5b | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe t(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | HARD | "import bisect\n\nn = int(input())\na = list(map(int, input().split()))\na.sort()\nmax_mod = 0\nprev(...TRUNCATED) | "Okay, let's see. The problem is to find the maximum possible value of ai mod aj where ai >= aj. Hmm(...TRUNCATED) | "To solve this problem, we need to find the maximum possible value of the remainder when an element (...TRUNCATED) | 24,774 | "<think>\nOkay, let's see. The problem is to find the maximum possible value of ai mod aj where ai >(...TRUNCATED) | [{"from":"human","value":"You are given a sequence a consisting of n integers. Find the maximum poss(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 3