Dataset Viewer
id
stringclasses 761
values | instruction_seed
stringlengths 187
26.8k
| output
stringlengths 3.8k
79.3k
⌀ | source
stringclasses 10
values | license
stringclasses 4
values | dataset
stringclasses 4
values | split
stringclasses 3
values | difficulty
int64 6
10
| solution
stringlengths 0
8.94k
⌀ | index
stringclasses 116
values | _source
stringclasses 2
values | difficulty_reasoning
stringlengths 256
886
| __original_row_idx
int64 0
987
| ms_id
int64 0
3.95k
| final_reasoning_trace
stringlengths 7.03k
107k
| question_answer_string
stringlengths 8.45k
110k
| _fasttext_score
float64 1
1
| conversations
listlengths 2
2
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "Write a program in the shortest number of bytes possible that will parse any string given to it by (...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires a deep understanding of string parsing, regex-like behavior for identifying nu(...TRUNCATED) | 158 | 1,306 | "We are asked: \"Write a program in the shortest number of bytes possible that will parse any string(...TRUNCATED) | "Question: Write a program in the shortest number of bytes possible that will parse any string given(...TRUNCATED) | 0.999561 | [{"from":"human","value":"Write a program in the shortest number of bytes possible that will parse a(...TRUNCATED) |
52fbcf073255b1b8f971c8442e34e726
| "International Coding Procedures Company (ICPC) writes all its code in Jedi Script (JS) programming (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the task is to create a minifier for the Jedi Script(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import sys\nfrom itertools import product\n\ndef parse_line(line, reserved_tokens):\n tokens = [(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires an understanding of token parsing, handling comment stripping, and implementin(...TRUNCATED) | 719 | 2,453 | "We are given a problem that describes a minification process of a subset of JS grammar. Explanation(...TRUNCATED) | "Question: International Coding Procedures Company (ICPC) writes all its code in Jedi Script (JS) pr(...TRUNCATED) | 0.999343 | [{"from":"human","value":"International Coding Procedures Company (ICPC) writes all its code in Jedi(...TRUNCATED) |
null | "Challenge\nGiven a left- or right-stochastic matrix where the limit as x approaches infinity of the(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem involves convergence of a stochastic matrix, which typically requires knowledge of line(...TRUNCATED) | 474 | 708 | "We're asked a challenge: \"Given a left- or right-stochastic matrix where the limit as x approaches(...TRUNCATED) | "Question: Challenge\nGiven a left- or right-stochastic matrix where the limit as x approaches infin(...TRUNCATED) | 0.99952 | [{"from":"human","value":"Challenge\nGiven a left- or right-stochastic matrix where the limit as x a(...TRUNCATED) |
null | "(yes, \"generating generating\" in the title is correct :) )\nContext\nIn middle (?) school we are (...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem requires a deep understanding of polynomial interpolation and the ability to derive co(...TRUNCATED) | 524 | 3,429 | "We are asked the following text: \"generating generating in the title\" with a hint: \"Yes, it's co(...TRUNCATED) | "Question: (yes, \"generating generating\" in the title is correct :) )\nContext\nIn middle (?) scho(...TRUNCATED) | 0.998994 | [{"from":"human","value":"(yes, \"generating generating\" in the title is correct :) )\nContext\nIn (...TRUNCATED) |
null | "Let \\$Z\\$ be either the integers, the positive integers, or the non-zero integers; pick whatever'(...TRUNCATED) | null | null | null | null | null | 9 | null | null |
stackexchange_codegolf
| "The problem requires a deep understanding of mathematical functions and their interrelations, deman(...TRUNCATED) | 968 | 3,148 | "We are asked: \"Let Z be either the integers, the positive integers, or the non-zero integers; pick(...TRUNCATED) | "Question: Let \\$Z\\$ be either the integers, the positive integers, or the non-zero integers; pick(...TRUNCATED) | 0.999762 | [{"from":"human","value":"Let \\$Z\\$ be either the integers, the positive integers, or the non-zero(...TRUNCATED) |
null | "Consider the sequence 1/2, 1/3 + 1/2, 1/4 + 1/3 + 1/2, and so on. In mathematical symbols, this is\(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires knowledge of series summation and the ability to convert fractions to repeatin(...TRUNCATED) | 118 | 2,909 | "We are asked: \"Consider the sequence 1/2, 1/3 + 1/2, 1/4 + 1/3 + 1/2, and so on. In mathematical s(...TRUNCATED) | "Question: Consider the sequence 1/2, 1/3 + 1/2, 1/4 + 1/3 + 1/2, and so on. In mathematical symbols(...TRUNCATED) | 0.99952 | [{"from":"human","value":"Consider the sequence 1/2, 1/3 + 1/2, 1/4 + 1/3 + 1/2, and so on. In mathe(...TRUNCATED) |
null | "Given infinite different integers, order them into a sequence \\$a_1, a_2, a_3, ...\\$ such that \\(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem involves constructing a sequence from infinite integers with specific ordering constrai(...TRUNCATED) | 536 | 3,182 | "We are asked: \"Given infinite different integers, order them into a sequence a1, a2, a3, ... such (...TRUNCATED) | "Question: Given infinite different integers, order them into a sequence \\$a_1, a_2, a_3, ...\\$ su(...TRUNCATED) | 0.999241 | [{"from":"human","value":"Given infinite different integers, order them into a sequence \\$a_1, a_2,(...TRUNCATED) |
9a8b9987a33ea2faa2fae5d82cbbb032
| "Rikhail Mubinchik believes that the current definition of prime numbers is obsolete as they are too(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. The task is to find the maximum n where the number of pri(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import math\n\ndef sieve(n):\n sieve = [True] * (n + 1)\n sieve[0] = sieve[1] = False\n fo(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires a deep understanding of prime numbers and palindromic numbers, as well as the (...TRUNCATED) | 418 | 3,854 | "We are given a problem description which states: \"Rikhail Mubinchik believes that the current defi(...TRUNCATED) | "Question: Rikhail Mubinchik believes that the current definition of prime numbers is obsolete as th(...TRUNCATED) | 0.999938 | [{"from":"human","value":"Rikhail Mubinchik believes that the current definition of prime numbers is(...TRUNCATED) |
null | "Challenge\nPremise\nIt's 2006, and Alice is trying to send Bob their her completed notes on their n(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem requires a deep understanding of coordinates and geometric transformations, as well as(...TRUNCATED) | 224 | 3,225 | "We are Phi. The challenge is: \"Help Alice draw rasterised glyphs.\" It describes that the input is(...TRUNCATED) | "Question: Challenge\nPremise\nIt's 2006, and Alice is trying to send Bob their her completed notes (...TRUNCATED) | 0.999125 | [{"from":"human","value":"Challenge\nPremise\nIt's 2006, and Alice is trying to send Bob their her c(...TRUNCATED) |
2b7d55ad18bdcda3a2b10d8105a16336
| "For the multiset of positive integers s=\\\\{s_1,s_2,...,s_k\\}, define the Greatest Common Divisor(...TRUNCATED) | "<think>\nOkay, so I need to find the GCD of all LCMs of pairs in the array. Hmm, let's think about (...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "from collections import defaultdict\n\ndef main():\n import sys\n input = sys.stdin.read\n (...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem requires a deep understanding of the properties of GCD and LCM, as well as some insigh(...TRUNCATED) | 386 | 2,864 | "We are Phi; the problem: Given sequence of n integers. For each distinct pair (i, j) with i < j, co(...TRUNCATED) | "Question: For the multiset of positive integers s=\\\\{s_1,s_2,...,s_k\\}, define the Greatest Comm(...TRUNCATED) | 0.999941 | [{"from":"human","value":"For the multiset of positive integers s=\\\\{s_1,s_2,...,s_k\\}, define th(...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6