Dataset Viewer
id
stringclasses 510
values | instruction_seed
stringlengths 80
26.8k
| output
stringlengths 4.77k
71.6k
⌀ | source
stringclasses 9
values | license
stringclasses 4
values | dataset
stringclasses 4
values | split
stringclasses 3
values | difficulty
int64 6
10
| solution
stringlengths 8
5.91k
⌀ | index
stringclasses 73
values | _source
stringclasses 2
values | difficulty_reasoning
stringlengths 256
814
| __original_row_idx
int64 16
63.2k
| ms_id
int64 1
3.95k
| reasoning
stringlengths 3.62k
105k
| deepseek_solution
stringlengths 0
50.6k
| final_reasoning_trace
stringlengths 5.16k
113k
| question_answer_string
stringlengths 5.68k
114k
| _fasttext_score
float64 1
1
| conversations
listlengths 2
2
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
4266d6bec11210720bd56ba88aa3d500
| "Diverta City is a new city consisting of N towns numbered 1, 2, ..., N.\n\nThe mayor Ringo is plann(...TRUNCATED) | "<think>\nOkay, I need to find a way to assign road lengths between towns in such a way that all Ham(...TRUNCATED) |
atcoder
|
cc-by-4.0
|
code_contests
|
train
| 8 | "primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]\n\nn = int(input())\np = primes[:n]\n\nfor i in range(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves constructing a distance matrix for a complete graph with N towns, ensuring tha(...TRUNCATED) | 46,577 | 2,911 | "Okay, let's see. The problem is to assign lengths to the roads between N towns such that all Hamilt(...TRUNCATED) | "To solve this problem, we need to assign lengths to the roads between towns such that all Hamiltoni(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to assign lengths to the roads between N towns such that a(...TRUNCATED) | "Question: Diverta City is a new city consisting of N towns numbered 1, 2, ..., N.\n\nThe mayor Ring(...TRUNCATED) | 1.000001 | [{"from":"human","value":"Diverta City is a new city consisting of N towns numbered 1, 2, ..., N.\n\(...TRUNCATED) |
7339c76700e4c236c3af522086cf7b69
| "This is an interactive problem.\n\nVasya and Vitya play a game. Vasya thought of two integers a and(...TRUNCATED) | "<think>\nOkay, so I need to solve this interactive problem where I have to guess two numbers a and (...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import sys\n\ndef main():\n n = int(sys.stdin.readline())\n a_low, a_high = 1, n\n b_low, (...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem requires both advanced algorithmic thinking for efficient querying within a constraine(...TRUNCATED) | 47,448 | 2,965 | "Okay, I need to solve this problem where I have to guess two numbers a and b that Vasya has chosen,(...TRUNCATED) | "To solve this problem, we need to guess two integers, `a` and `b`, chosen by Vasya, within 600 quer(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to guess two numbers a and b that Vasya ha(...TRUNCATED) | "Question: This is an interactive problem.\n\nVasya and Vitya play a game. Vasya thought of two inte(...TRUNCATED) | 1.00001 | [{"from":"human","value":"This is an interactive problem.\n\nVasya and Vitya play a game. Vasya thou(...TRUNCATED) |
null | "Alienese refers to two \"languages\" in the show Futurama. In actuality, they are two ciphers of En(...TRUNCATED) | null | null | null | null | null | 9 | null | null |
stackexchange_codegolf
| "The problem involves understanding and implementing a complex autokey cipher with non-obvious mathe(...TRUNCATED) | 44,812 | 2,800 | "Okay, I need to solve this problem where I have to determine the number of steps it takes for a giv(...TRUNCATED) | "To solve this problem, we need to determine the number of steps required for a given string to retu(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to determine the number of steps it takes (...TRUNCATED) | "Question: Alienese refers to two \"languages\" in the show Futurama. In actuality, they are two cip(...TRUNCATED) | 1.000006 | [{"from":"human","value":"Alienese refers to two \"languages\" in the show Futurama. In actuality, t(...TRUNCATED) |
null | "You may write a program or function that receives an odd, positive integer n, where n >= 3, as eith(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires generating an ASCII spiral while adhering to memory constraints (O(log n)), wh(...TRUNCATED) | 57,339 | 3,583 | "Okay, I need to solve this programming problem. Let's read the requirements carefully.\n\nThe task (...TRUNCATED) | "To solve this problem, we need to generate an ASCII spiral that spins inward clockwise, given an od(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the requirements carefully.\n\n(...TRUNCATED) | "Question: You may write a program or function that receives an odd, positive integer n, where n >= (...TRUNCATED) | 0.999991 | [{"from":"human","value":"You may write a program or function that receives an odd, positive integer(...TRUNCATED) |
440988c68a53af541267591e70a67315
| "Let f(x) = a0 + a1x + a2x2 + ... + adxd be the function where each ai (0 ≤ i ≤ d) is a constant(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find all complex integer solutions to a(...TRUNCATED) |
aizu
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import math\n\nd = int(input())\ncoefficients = list(map(int, input().split()))\na0 = coefficients[(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves finding all complex integer solutions of a polynomial equation, which requires(...TRUNCATED) | 38,303 | 2,393 | "Okay, I need to solve this programming problem where I have to find all complex integer solutions t(...TRUNCATED) | "To solve this problem, we need to find all complex integer solutions to a given polynomial equation(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem where I have to find all complex integer so(...TRUNCATED) | "Question: Let f(x) = a0 + a1x + a2x2 + ... + adxd be the function where each ai (0 ≤ i ≤ d) is (...TRUNCATED) | 1.000008 | [{"from":"human","value":"Let f(x) = a0 + a1x + a2x2 + ... + adxd be the function where each ai (0 (...TRUNCATED) |
null | "Consider a sequence of natural numbers for which N appears as a substring in N^2. A018834\nOutput t(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem requires not only knowledge of number representation and manipulation but also an under(...TRUNCATED) | 34,070 | 2,129 | "Okay, I need to find a way to generate the nth element of the sequence where N is a substring of N (...TRUNCATED) | "To solve this problem, we need to generate the nth element of a sequence where each number N appear(...TRUNCATED) | "<think>\nOkay, I need to find a way to generate the nth element of the sequence where N is a substr(...TRUNCATED) | "Question: Consider a sequence of natural numbers for which N appears as a substring in N^2. A018834(...TRUNCATED) | 1.000009 | [{"from":"human","value":"Consider a sequence of natural numbers for which N appears as a substring (...TRUNCATED) |
abe4fba6655ddb904cc2aa8326f74cc4
| "We'll call a set of positive integers a beautiful if the following condition fulfills: for any prim(...TRUNCATED) | "<think>\nOkay, let's see. I need to find a beautiful set of k numbers where each number is at most (...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "k = int(input())\nmax_val = 2 * k * k\n\n# Compute the largest power of 2 <= max_val\ns1 = 1\nwhile(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires the ability to construct a set of integers that meet specific divisibility con(...TRUNCATED) | 20,951 | 1,309 | "Okay, let's see. I need to find a beautiful set of k positive integers where each element doesn't e(...TRUNCATED) | "To solve this problem, we need to construct a beautiful set of k positive integers such that for an(...TRUNCATED) | "<think>\nOkay, let's see. I need to find a beautiful set of k positive integers where each element (...TRUNCATED) | "Question: We'll call a set of positive integers a beautiful if the following condition fulfills: fo(...TRUNCATED) | 1.000007 | [{"from":"human","value":"We'll call a set of positive integers a beautiful if the following conditi(...TRUNCATED) |
null | "(via chat)\nThe OEIS entry A123321 lists the sequence of numbers that are the product of seven dist(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires knowledge of prime factors and their products, along with the ability to gener(...TRUNCATED) | 58,631 | 3,664 | "Okay, so I need to solve this problem where I have to find the closest 7DP number to a given input (...TRUNCATED) | "To solve this problem, we need to find the closest number to a given input `n` that is a product of(...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to find the closest 7DP number to a giv(...TRUNCATED) | "Question: (via chat)\nThe OEIS entry A123321 lists the sequence of numbers that are the product of (...TRUNCATED) | 1.000009 | [{"from":"human","value":"(via chat)\nThe OEIS entry A123321 lists the sequence of numbers that are (...TRUNCATED) |
4886cb31eb88d09f7fd3624927c82195
| "This problem is interactive.\n\nYou should guess hidden number x which is between 1 and M = 1000420(...TRUNCATED) | "<think>\nOkay, so I need to solve this interactive problem where I have to guess a hidden number be(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "def compute_max(q, low):\n if q == 0:\n return 0\n if q == 1:\n return low\n (...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem is classified at Level 8 due to the requirement for deep mathematical insights and the(...TRUNCATED) | 52,447 | 3,277 | "Okay, let's see. So the problem is to guess a hidden number x between 1 and M=10004205361450474 usi(...TRUNCATED) | "To solve this problem, we need to guess a hidden number between 1 and a very large number (10^16) u(...TRUNCATED) | "<think>\nOkay, let's see. So the problem is to guess a hidden number x between 1 and M=100042053614(...TRUNCATED) | "Question: This problem is interactive.\n\nYou should guess hidden number x which is between 1 and M(...TRUNCATED) | 1.000008 | [{"from":"human","value":"This problem is interactive.\n\nYou should guess hidden number x which is (...TRUNCATED) |
null | "Challenge\nGiven a string of any length, write it as a triangle, spiraling out from the center. Fo(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem involves generating a spiral pattern for the given string, which requires knowledge of (...TRUNCATED) | 43,547 | 2,721 | "Okay, so I need to solve this problem where I have to arrange a given string into a triangle that s(...TRUNCATED) | "To solve this problem, we need to arrange a given string into a triangle that spirals out from the (...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to arrange a given string into a triang(...TRUNCATED) | "Question: Challenge\nGiven a string of any length, write it as a triangle, spiraling out from the c(...TRUNCATED) | 1.000001 | [{"from":"human","value":"Challenge\nGiven a string of any length, write it as a triangle, spiraling(...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5