instruction_seed stringlengths 32 13.2k | _source stringclasses 2
values | _fasttext_score float64 0.91 1 | id stringlengths 32 32 ⌀ | output stringlengths 1.28k 69.5k ⌀ | source stringclasses 5
values | license stringclasses 2
values | dataset stringclasses 2
values | split stringclasses 3
values | difficulty stringclasses 19
values | solution stringlengths 34 5.95k ⌀ | reasoning stringlengths 1.03k 116k | deepseek_solution stringlengths 278 13.7k | __original_row_idx int64 22 31.6k | final_reasoning_trace stringlengths 2.41k 123k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"Challenge :\nGiven a string representing a mathematical expression return the result\n\nInput :\nA (...TRUNCATED) | stackexchange_codegolf | 0.957918 | null | null | null | null | null | null | null | null | "Okay, I need to write a program that evaluates a mathematical expression given as a string. The pro(...TRUNCATED) | "To solve this problem, we need to evaluate a mathematical expression given as a string, taking into(...TRUNCATED) | 14,937 | "<think>\nOkay, I need to write a program that evaluates a mathematical expression given as a string(...TRUNCATED) | [{"from":"human","value":"Challenge :\nGiven a string representing a mathematical expression return (...TRUNCATED) |
"Given an integer, make an expression that produces it from 0 using unary negation - and bitwise com(...TRUNCATED) | stackexchange_codegolf | 0.927712 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where I have to generate the shortest possible expression using (...TRUNCATED) | "To solve this problem, we need to generate the shortest possible expression using only unary negati(...TRUNCATED) | 1,197 | "<think>\nOkay, I need to solve this problem where I have to generate the shortest possible expressi(...TRUNCATED) | [{"from":"human","value":"Given an integer, make an expression that produces it from 0 using unary n(...TRUNCATED) |
"How to\nGiven an integer n start with n ones (i.e. 4 -> 1 1 1 1). Then sum up the\nlast n numbers, (...TRUNCATED) | stackexchange_codegolf | 0.920563 | null | null | null | null | null | null | null | null | "Okay, I need to solve this programming problem. Let's read the problem statement carefully.\n\nThe (...TRUNCATED) | "To solve this problem, we need to generate the first 30 numbers of a sequence starting with `n` one(...TRUNCATED) | 7,079 | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | [{"from":"human","value":"How to\nGiven an integer n start with n ones (i.e. 4 -> 1 1 1 1). Then sum(...TRUNCATED) |
"Every integer can be expressed in powers of 2. You know this as the binary system\nAssume you are g(...TRUNCATED) | stackexchange_codegolf | 0.917052 | null | null | null | null | null | null | null | null | "Okay, let's see. The user has this problem where they need to check if every power of 2 up to 2^(n-(...TRUNCATED) | "To determine if every power of 2 up to \\(2^{n-1}\\) occurs at least \\(m\\) times in a set of inte(...TRUNCATED) | 30,034 | "<think>\nOkay, let's see. The user has this problem where they need to check if every power of 2 up(...TRUNCATED) | [{"from":"human","value":"Every integer can be expressed in powers of 2. You know this as the binary(...TRUNCATED) |
"Arpa is researching the Mexican wave.\n\nThere are n spectators in the stadium, labeled from 1 to n(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.994371 | 92ebbe9c70033aee3f7ac612fd779b1e | "<think>\nOkay, I need to solve this problem where I have to find out how many spectators are standi(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 7 | "n, k, t = map(int, input().split())\nif t <= k:\n print(t)\nelif t <= n:\n print(k)\nelse:\n (...TRUNCATED) | "Okay, let's see. The problem is about the Mexican wave in a stadium. We need to find out how many s(...TRUNCATED) | "To solve this problem, we need to determine how many spectators are standing at a given time `t` du(...TRUNCATED) | 24,057 | "<think>\nOkay, let's see. The problem is about the Mexican wave in a stadium. We need to find out h(...TRUNCATED) | [{"from":"human","value":"Arpa is researching the Mexican wave.\n\nThere are n spectators in the sta(...TRUNCATED) |
"The manager of the Japanese sweets shop Tomogurido in Aizuwakamatsu City is a very skillful craftsm(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.962952 | 1d6b66e2fb5cf9de310de0bac699a4e3 | "<think>\nOkay, let's see. I need to solve this problem where the goal is to find the maximum number(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "import sys\n\ndef generate_combinations():\n combinations = []\n target = 10\n\n def dfs(s(...TRUNCATED) | "Okay, let's see. So the problem is about packing buns into bags such that each bag's total weight i(...TRUNCATED) | "To solve this problem, we need to pack buns into bags such that each bag's total weight is exactly (...TRUNCATED) | 21,061 | "<think>\nOkay, let's see. So the problem is about packing buns into bags such that each bag's total(...TRUNCATED) | [{"from":"human","value":"The manager of the Japanese sweets shop Tomogurido in Aizuwakamatsu City i(...TRUNCATED) |
"For a given weighted undirected graph G(V, E), find the distance of the shortest route that meets t(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.976359 | c7eb21e710e5942acb2ce495d546f774 | "<think>\nOkay, let's try to solve this problem. The task is to find the shortest closed cycle in a (...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "import sys\nfrom functools import lru_cache\n\ndef main():\n input = sys.stdin.read().split()\n (...TRUNCATED) | "Okay, so I need to solve this problem where I have to find the shortest closed cycle in a graph tha(...TRUNCATED) | "To solve this problem, we need to find the shortest closed cycle in a weighted undirected graph tha(...TRUNCATED) | 14,642 | "<think>\nOkay, so I need to solve this problem where I have to find the shortest closed cycle in a (...TRUNCATED) | [{"from":"human","value":"For a given weighted undirected graph G(V, E), find the distance of the sh(...TRUNCATED) |
"Draw a chessboard which has a height of H cm and a width of W cm. For example, the following figure(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.966812 | ecf00a32ba0e07160dc4b71f568680d1 | "<think>\nOkay, let's see. I need to create a Python program that draws a chessboard pattern based o(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "while True:\n line = input().strip()\n if not line:\n continue\n H, W = map(int, li(...TRUNCATED) | "Okay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, the task i(...TRUNCATED) | "To solve this problem, we need to generate a chessboard pattern based on given height (H) and width(...TRUNCATED) | 6,513 | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED) | [{"from":"human","value":"Draw a chessboard which has a height of H cm and a width of W cm. For exam(...TRUNCATED) |
"An bydrocarbon is an organic compound which contains only carbons and hydrogens. An isomer is a com(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.964637 | 8698c93222944e045bcbea58b421edf3 | "<think>\nOkay, let's see. The problem is about finding the maximum number of carbons a compound can(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "def solve():\n import sys\n for line in sys.stdin:\n n = int(line.strip())\n if(...TRUNCATED) | "Okay, so I need to solve this problem where given a number n, which represents the length of the lo(...TRUNCATED) | "To solve this problem, we need to determine the maximum number of carbons in a hydrocarbon isomer s(...TRUNCATED) | 22,460 | "<think>\nOkay, so I need to solve this problem where given a number n, which represents the length (...TRUNCATED) | [{"from":"human","value":"An bydrocarbon is an organic compound which contains only carbons and hydr(...TRUNCATED) |
"This challenge requires integration with C, so you can stop reading if you're not interested.\nMatr(...TRUNCATED) | stackexchange_codegolf | 0.950399 | null | null | null | null | null | null | null | null | "Okay, I need to write a faster matrix multiplication function for 64x64 matrices using AVX2 and FMA(...TRUNCATED) | "To solve this problem, we need to optimize matrix multiplication for 64x64 matrices using AVX2 and (...TRUNCATED) | 21,255 | "<think>\nOkay, I need to write a faster matrix multiplication function for 64x64 matrices using AVX(...TRUNCATED) | [{"from":"human","value":"This challenge requires integration with C, so you can stop reading if you(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 7