id stringlengths 32 32 ⌀ | instruction_seed stringlengths 192 25.6k | output stringlengths 4.77k 66.8k ⌀ | source stringclasses 10
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 3
values | difficulty int64 6 10 | solution stringlengths 36 7.89k ⌀ | index stringclasses 36
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 259 886 | __original_row_idx int64 18 63.1k | ms_id int64 1 3.95k | reasoning stringlengths 7.84k 94.8k | deepseek_solution stringlengths 0 10.2k | final_reasoning_trace stringlengths 8.94k 98.9k | question_answer_string stringlengths 10.2k 101k | _fasttext_score float64 1 1 | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "A Gaussian integer is a complex number whose real and imaginary parts are integers.\nGaussian integ(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem requires understanding of Gaussian integers and their prime factorization, which are ad(...TRUNCATED) | 54,686 | 3,417 | "Okay, I need to factor a Gaussian integer into Gaussian primes. Let's start by understanding what a(...TRUNCATED) | "To solve this problem, we need to factor a given Gaussian integer into Gaussian primes. A Gaussian (...TRUNCATED) | "<think>\nOkay, I need to factor a Gaussian integer into Gaussian primes. Let's start by understandi(...TRUNCATED) | "Question: A Gaussian integer is a complex number whose real and imaginary parts are integers.\nGaus(...TRUNCATED) | 0.999997 | [{"from":"human","value":"A Gaussian integer is a complex number whose real and imaginary parts are (...TRUNCATED) |
f69e3789e548eda16e55714470d1c984 | "There is a matrix A of size x × y filled with integers. For every <image>, <image> Ai, j = y(i - 1(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to determine if there exists a matrix of size x × y such (...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "n = int(input())\na = list(map(int, input().split()))\n\nif n == 1:\n print(\"YES\")\n print((...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires deep understanding of matrix properties, path traversal, and restrictions bas(...TRUNCATED) | 23,853 | 1,490 | "Okay, let's see. I need to find x and y such that the given sequence of numbers a1 to an can be tra(...TRUNCATED) | "To solve this problem, we need to determine if there exists a matrix configuration (x rows and y co(...TRUNCATED) | "<think>\nOkay, let's see. I need to find x and y such that the given sequence of numbers a1 to an c(...TRUNCATED) | "Question: There is a matrix A of size x × y filled with integers. For every <image>, <image> Ai, j(...TRUNCATED) | 1.00001 | [{"from":"human","value":"There is a matrix A of size x × y filled with integers. For every <image>(...TRUNCATED) |
43983e415d28b61f0b8ae438ccc640bb | "User ainta likes trees. This time he is going to make an undirected tree with n vertices numbered b(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So, the user needs to construct a tree with n (...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "n = int(input())\n\nedges = []\n# Build the tree structure similar to the sample\nif n >=5:\n ed(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires a deep understanding of tree structures and how to manipulate path weights and(...TRUNCATED) | 34,105 | 2,131 | "Okay, so I have this problem where I need to construct a tree with certain properties. The goal is (...TRUNCATED) | "To solve this problem, we need to construct a tree with specific properties such that there are at (...TRUNCATED) | "<think>\nOkay, so I have this problem where I need to construct a tree with certain properties. The(...TRUNCATED) | "Question: User ainta likes trees. This time he is going to make an undirected tree with n vertices (...TRUNCATED) | 1 | [{"from":"human","value":"User ainta likes trees. This time he is going to make an undirected tree w(...TRUNCATED) |
31aa244f5f1e37f0eb206c199158e3b3 | "Let's define a balanced multiset the following way. Write down the sum of all elements of the multi(...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. So the task is about handling que(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nimport itertools\n\nK = 20\n\ndef merge(a, b, k):\n merged = []\n i = j = 0\n (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves advanced algorithmic concepts and multiple steps. It requires maintaining and (...TRUNCATED) | 21,674 | 1,354 | "Okay, let's tackle this problem. Hmm. So the task is to handle queries where we either update an el(...TRUNCATED) | "To solve this problem, we need to handle two types of queries on an array: updating an element and (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm. So the task is to handle queries where we either upd(...TRUNCATED) | "Question: Let's define a balanced multiset the following way. Write down the sum of all elements of(...TRUNCATED) | 1.000007 | [{"from":"human","value":"Let's define a balanced multiset the following way. Write down the sum of (...TRUNCATED) |
eeabae33039f79af7cddea7bd64fa6cc | "Elon Musk has succesfully built an automated staircase from Earth to Mars. Many people want to go t(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the number of ways to climb a staircase with N ste(...TRUNCATED) | hackerrank | apache-2.0 | taco | train | 8 | "import sys\nfrom decimal import Decimal, getcontext, ROUND_HALF_UP\n\ngetcontext().prec = 30\nlog10(...TRUNCATED) | 20865 | nvidia/OpenCodeReasoning | "This problem exhibits complexity as it involves not only combinatorial counting of ways to climb st(...TRUNCATED) | 3,850 | 240 | "Okay, so I need to solve this problem where I have to find the number of ways to climb a staircase (...TRUNCATED) | "To solve this problem, we need to determine the number of ways to climb a staircase with N steps, w(...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to find the number of ways to climb a s(...TRUNCATED) | "Question: Elon Musk has succesfully built an automated staircase from Earth to Mars. Many people wa(...TRUNCATED) | 1.000001 | [{"from":"human","value":"Elon Musk has succesfully built an automated staircase from Earth to Mars.(...TRUNCATED) |
null | "Since this is a answer-chaining challenge, you might want to sort answers by oldest.\n\nYour task i(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem requires a deep understanding of programming concepts and creative problem-solving skil(...TRUNCATED) | 10,877 | 679 | "Okay, let's start with the first answer. The task is to choose any printable ASCII character not us(...TRUNCATED) | "# [///](https://esolangs.org/wiki////), 1 byte\n\n\\$y= 1\\$. Used so far: <code>a</code>\n\n a\(...TRUNCATED) | "<think>\nOkay, let's start with the first answer. The task is to choose any printable ASCII charact(...TRUNCATED) | "Question: Since this is a answer-chaining challenge, you might want to sort answers by oldest.\n\nY(...TRUNCATED) | 1.00001 | [{"from":"human","value":"Since this is a answer-chaining challenge, you might want to sort answers (...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 find for a given N the integer i (2 ≤ i ≤ N) that maximizes the value (...TRUNCATED) | codechef | cc-by-4.0 | code_contests | train | 8 | "def is_prime(n):\n if n <= 1:\n return False\n elif n <= 3:\n return True\n (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves properties of Euler's totient function, which requires a good understanding of(...TRUNCATED) | 47,533 | 2,970 | "Okay, I need to solve this problem where for a given N, I have to find the integer i between 2 and (...TRUNCATED) | "To solve this problem, we need to determine the integer \\( i \\) between 2 and \\( N \\) (inclusiv(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where for a given N, I have to find the integer i betwe(...TRUNCATED) | "Question: Witua is a little student from the University of Lviv. He enjoys studying math. Witua kno(...TRUNCATED) | 1.00001 | [{"from":"human","value":"Witua is a little student from the University of Lviv. He enjoys studying (...TRUNCATED) |
null | "Your task is to create a program that will, given an input image, create an output image of the sam(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "This problem requires advanced understanding of image processing and algorithmic techniques to sort(...TRUNCATED) | 16,285 | 1,017 | "Okay, I need to create a Python program that takes an input image and outputs an image where all th(...TRUNCATED) | "To solve this problem, we need to create a program that takes an input image, sorts its pixels by t(...TRUNCATED) | "<think>\nOkay, I need to create a Python program that takes an input image and outputs an image whe(...TRUNCATED) | "Question: Your task is to create a program that will, given an input image, create an output image (...TRUNCATED) | 1.000009 | [{"from":"human","value":"Your task is to create a program that will, given an input image, create a(...TRUNCATED) |
d6a938596c83cb3751244e41ccde18e2 | "Consider some positive integer x. Its prime factorization will be of form x = 2^{k_1} ⋅ 3^{k_2} (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. The goal is to count the number of elegant numbers betwee(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom functools import lru_cache\n\nsys.setrecursionlimit(1 << 25)\n\ndef compute_m(n, d(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires understanding of prime factorization and greatest common divisors, which invol(...TRUNCATED) | 14,956 | 934 | "Okay, let's see. I need to count the number of elegant numbers from 2 to n. An elegant number is on(...TRUNCATED) | "To solve this problem, we need to count the number of \"elegant\" integers between 2 and a given nu(...TRUNCATED) | "<think>\nOkay, let's see. I need to count the number of elegant numbers from 2 to n. An elegant num(...TRUNCATED) | "Question: Consider some positive integer x. Its prime factorization will be of form x = 2^{k_1} ⋅(...TRUNCATED) | 1.000003 | [{"from":"human","value":"Consider some positive integer x. Its prime factorization will be of form (...TRUNCATED) |
null | "Everyone loves The Big Bang Theory, right? And everyone loves polyglots, right? So let's combine th(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "This problem requires knowledge of multiple programming languages and the ability to write polyglot(...TRUNCATED) | 54,310 | 3,394 | "Okay, so I need to create a polyglot that outputs different TBBT characters' full names when run in(...TRUNCATED) | "Here is a polyglot that works in five different languages, each outputting one of the five main cha(...TRUNCATED) | "<think>\nOkay, so I need to create a polyglot that outputs different TBBT characters' full names wh(...TRUNCATED) | "Question: Everyone loves The Big Bang Theory, right? And everyone loves polyglots, right? So let's (...TRUNCATED) | 1.000009 | [{"from":"human","value":"Everyone loves The Big Bang Theory, right? And everyone loves polyglots, r(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6