Dataset Viewer
id
stringlengths 32
32
⌀ | instruction_seed
stringlengths 195
14.9k
| output
stringlengths 4.77k
65.6k
⌀ | source
stringclasses 9
values | license
stringclasses 4
values | dataset
stringclasses 4
values | split
stringclasses 3
values | difficulty
int64 6
10
| solution
stringlengths 36
5.52k
⌀ | index
stringclasses 47
values | _source
stringclasses 2
values | difficulty_reasoning
stringlengths 286
861
| __original_row_idx
int64 113
63.1k
| ms_id
int64 7
3.95k
| qwq_thinking_trajectory
stringlengths 7.2k
137k
| qwq_attempt
stringlengths 13
56.4k
| qwq_response
stringlengths 7.82k
141k
| question_answer_string
stringlengths 8.81k
144k
| _fasttext_score
float64 1
1
| conversations
listlengths 2
2
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "Choose a language and write a program in the language that:\n\nTake a valid program of the language(...TRUNCATED) | null | null | null | null | null | 9 | null | null |
stackexchange_codegolf
| "The problem requires a deep understanding of programming language semantics, input-output mappings,(...TRUNCATED) | 37,202 | 2,325 | "<think>\nOkay, let's see what I need to do here. The problem is to create a program that takes a va(...TRUNCATED) | "To solve this problem, I need to create a program that takes a valid program of its own language as(...TRUNCATED) | "<think>\nOkay, let's see what I need to do here. The problem is to create a program that takes a va(...TRUNCATED) | "Question: Choose a language and write a program in the language that:\n\nTake a valid program of th(...TRUNCATED) | 0.999701 | [{"from":"human","value":"Choose a language and write a program in the language that:\n\nTake a vali(...TRUNCATED) |
null | "Long-time lurker, first-time poster. So here goes.\nIn the Wikipedia page for quine, it says that \(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem requires a deep understanding of programming concepts like file I/O and recursion, as (...TRUNCATED) | 49,749 | 3,109 | "<think>\n\nOkay, I need to create a cheating quine that reads its own source code from the file. So(...TRUNCATED) | "### Ruby, 15 bytes\n\n```ruby\nputs IO.read $0\n```\n\nThe approach leverages Ruby's `$0` global va(...TRUNCATED) | "<think>\n\nOkay, I need to create a cheating quine that reads its own source code from the file. So(...TRUNCATED) | "Question: Long-time lurker, first-time poster. So here goes.\nIn the Wikipedia page for quine, it s(...TRUNCATED) | 0.999998 | [{"from":"human","value":"Long-time lurker, first-time poster. So here goes.\nIn the Wikipedia page (...TRUNCATED) |
617029ad790a0f93e8410446781bb5e0
| "You have been given n distinct integers a1, a2, ..., an. You can remove at most k of them. Find the(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "n, k = map(int, input().split())\na = list(map(int, input().split()))\ns = n - k\n\nif s <= 1:\n (...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves finding a minimum modular value based on conditions that relate pairs of integ(...TRUNCATED) | 41,969 | 2,623 | "<think>\nOkay, so I have this problem here where I need to find the minimum positive integer m such(...TRUNCATED) | "To solve this problem, we need to find the minimum positive integer \\( m \\) such that after remov(...TRUNCATED) | "<think>\nOkay, so I have this problem here where I need to find the minimum positive integer m such(...TRUNCATED) | "Question: You have been given n distinct integers a1, a2, ..., an. You can remove at most k of them(...TRUNCATED) | 0.99977 | [{"from":"human","value":"You have been given n distinct integers a1, a2, ..., an. You can remove at(...TRUNCATED) |
b0eb8429d0ee8efc2cb9b8b77b3cab7b
| "She was worried. The grades are not good. Although she forced her parents to enroll in a dormitory (...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to determine if a given logical express(...TRUNCATED) |
aizu
|
cc-by-4.0
|
code_contests
|
train
| 8 | "def main():\n import sys\n for line in sys.stdin:\n line = line.strip()\n if li(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves parsing and evaluating a logical expression in a unique additive standard form(...TRUNCATED) | 39,285 | 2,455 | "<think>\nOkay, I need to solve this problem where I have to determine if a given logical expression(...TRUNCATED) | "To solve this problem, we need to determine if a given logical expression in additive canonical for(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to determine if a given logical expression(...TRUNCATED) | "Question: She was worried. The grades are not good. Although she forced her parents to enroll in a (...TRUNCATED) | 0.999852 | [{"from":"human","value":"She was worried. The grades are not good. Although she forced her parents (...TRUNCATED) |
null | "Palindromes are fun, but some of the other strings are starting to feel left out. We can turn those(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires a thorough understanding of palindromic sequences and dynamic programming to e(...TRUNCATED) | 20,446 | 1,277 | "<think>\nOkay, I need to solve this problem where I have to find the number of palindromic chunky p(...TRUNCATED) | "To solve this problem, we need to determine the number of ways to partition a given string into chu(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the number of palindromic chunky p(...TRUNCATED) | "Question: Palindromes are fun, but some of the other strings are starting to feel left out. We can (...TRUNCATED) | 0.999993 | [{"from":"human","value":"Palindromes are fun, but some of the other strings are starting to feel le(...TRUNCATED) |
d4be5976a6e4a5365f0364b2ac70c597
| "Optimal Binary Search Tree is a binary search tree constructed from $n$ keys and $n+1$ dummy keys s(...TRUNCATED) | "<think>\nOkay, I need to solve this Optimal Binary Search Tree problem. Let's think about how to ap(...TRUNCATED) |
aizu
|
cc-by-4.0
|
code_contests
|
train
| 8 | "n = int(input())\np = list(map(float, input().split()))\nq = list(map(float, input().split()))\n\n#(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem of constructing an optimal binary search tree involves dynamic programming with non-tri(...TRUNCATED) | 3,649 | 228 | "<think>\nOkay, I need to solve this problem about finding the optimal binary search tree with the m(...TRUNCATED) | "To solve this problem, we need to construct an optimal binary search tree (BST) that minimizes the (...TRUNCATED) | "<think>\nOkay, I need to solve this problem about finding the optimal binary search tree with the m(...TRUNCATED) | "Question: Optimal Binary Search Tree is a binary search tree constructed from $n$ keys and $n+1$ du(...TRUNCATED) | 0.999831 | [{"from":"human","value":"Optimal Binary Search Tree is a binary search tree constructed from $n$ ke(...TRUNCATED) |
null | "The minimal power iteration of a number \\$n\\$ is defined as follows:\n$$\\text{MPI}(n):=n^{\\text(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires understanding of mathematical concepts related to powers and digits, as well a(...TRUNCATED) | 43,892 | 2,743 | "<think>\nOkay, so the task is to find numbers whose minimal power root (MPR) isn't 1 or themselves.(...TRUNCATED) | "```python\ndef m(n):\n while 1:\n d=min(map(int,str(n)))\n if not d:return 1\n (...TRUNCATED) | "<think>\nOkay, so the task is to find numbers whose minimal power root (MPR) isn't 1 or themselves.(...TRUNCATED) | "Question: The minimal power iteration of a number \\$n\\$ is defined as follows:\n$$\\text{MPI}(n):(...TRUNCATED) | 0.999905 | [{"from":"human","value":"The minimal power iteration of a number \\$n\\$ is defined as follows:\n$$(...TRUNCATED) |
null | "Consider the Tetris pieces, but made out of some number of (hyper)cubes instead of four squares, wh(...TRUNCATED) | null | null | null | null | null | 9 | null | null |
stackexchange_codegolf
| "This problem requires extensive knowledge of combinatorial geometry and advanced algorithms to coun(...TRUNCATED) | 55,128 | 3,445 | "<think>\nOkay, I need to solve this problem where I have to count the number of n-celled polyominoe(...TRUNCATED) | "To solve this problem, we need to count the number of n-celled hypercubes (polyominoes) in k dimens(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to count the number of n-celled polyominoe(...TRUNCATED) | "Question: Consider the Tetris pieces, but made out of some number of (hyper)cubes instead of four s(...TRUNCATED) | 0.999877 | [{"from":"human","value":"Consider the Tetris pieces, but made out of some number of (hyper)cubes in(...TRUNCATED) |
1e06555eab76bb9e3e58971a092661c5
| "While Grisha was celebrating New Year with Ded Moroz, Misha gifted Sasha a small rectangular pond o(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import heapq\nfrom collections import defaultdict\n\nn, m, r, k = map(int, input().split())\n\ndef (...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires a deep understanding of combinatorial optimization and expected values, combin(...TRUNCATED) | 11,937 | 746 | "<think>\nOkay, so I have this problem about placing fish in a pond to maximize the expected number (...TRUNCATED) | "```python\nimport heapq\n\ndef compute_R(n, r):\n R = []\n for x in range(1, n + 1):\n (...TRUNCATED) | "<think>\nOkay, so I have this problem about placing fish in a pond to maximize the expected number (...TRUNCATED) | "Question: While Grisha was celebrating New Year with Ded Moroz, Misha gifted Sasha a small rectangu(...TRUNCATED) | 0.999731 | [{"from":"human","value":"While Grisha was celebrating New Year with Ded Moroz, Misha gifted Sasha a(...TRUNCATED) |
null | "Input\nA string s of printable ASCII characters, newlines, and spaces (0x20 ( ) to 0x7E (~)), and a(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem involves creating a program that constructs another program (or itself) based on the in(...TRUNCATED) | 31,286 | 1,955 | "<think>\nOkay, let's tackle this problem. The task is to create a program that, given a string s an(...TRUNCATED) | "To solve this problem, we need to create a program that outputs another program which outputs a giv(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. The task is to create a program that, given a string s an(...TRUNCATED) | "Question: Input\nA string s of printable ASCII characters, newlines, and spaces (0x20 ( ) to 0x7E ((...TRUNCATED) | 0.999904 | [{"from":"human","value":"Input\nA string s of printable ASCII characters, newlines, and spaces (0x2(...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 2