Datasets:
The full dataset viewer is not available (click to read why). Only showing a preview of the rows.
Error code: JobManagerCrashedError
Need help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.
uid string | messages list | source string | domain string | think_type string |
|---|---|---|---|---|
Code_no_think_0941093 | [
{
"role": "user",
"content": "Problem Description:\nYou are given an integer sequence B of length M.\nFind the maximum sum of any two elements (with different indices) in B.\n\nInput Format:\nThe first line contains an integer M.\nThe second line contains M space-separated integers representing the sequence... | rStar-Coder | Code | no_think |
Code_no_think_0313877 | [
{
"role": "user",
"content": "We have N voting papers. The i-th vote (1 \\leq i \\leq N) has the string S_i written on it.\n\nPrint all strings that are written on the most number of votes, in lexicographical order.\n\nConstraints\n\n* 1 \\leq N \\leq 2 \\times 10^5\n* S_i (1 \\leq i \\leq N) are strings co... | OpenCodeReasoning | Code | no_think |
Code_no_think_0890404 | [
{
"role": "user",
"content": "You are given a list of integers `lst` and a target integer `target`. Your task is to implement a function `closest_index` that returns the index of the first element in `lst` that is closest to `target`. If there are multiple elements with the same closest value, return the in... | OpenCodeInstruct | Code | no_think |
Math_no_think_0165904 | [
{
"role": "user",
"content": "If (some number ^ a) * 9 ^ (3a - 1) = (2 ^ 7) * (3 ^ b) and a and b are positive integers, and the value of a is 7, what is the base of the first exponent?"
},
{
"role": "assistant",
"content": "Based on the information provided, let's break down the problem step-by... | UltraData-sft-2605 | Math | no_think |
Code_no_think_0312455 | [
{
"role": "user",
"content": "Sandy is given an array of N integers which is a permutation of the first N natural numbers. He can swap any two elements of the array and can make at most K swaps. He needs to tell the largest permutation, in numerical order, could be made? You being sandy's friend help him in... | OpenCodeReasoning | Code | no_think |
Code_no_think_0289512 | [
{
"role": "user",
"content": "You are given an array `A` which may contain integers and non-integer elements. Your task is to implement the function `unique_sorted_array(A)` that processes the array as follows:\n1. Remove all non-integer elements.\n2. Remove duplicate integers.\n3. Sort the remaining intege... | OpenCodeInstruct | Code | no_think |
Math_no_think_0882013 | [
{
"role": "user",
"content": "A bakery sold 35 loaves of bread in the morning. In the afternoon, the bakery sold 23 loaves of bread. If each loaf of bread weighs 400g, how many grams of bread did the bakery sell for the whole day?"
},
{
"role": "assistant",
"content": "To find the total weight o... | OpenMathInstruct-2 | Math | no_think |
Code_no_think_0574423 | [
{
"role": "user",
"content": "Implement a `BinarySearchTree` class in Python that supports the following operations:\n- `insert(value)`: Inserts a new value into the tree.\n- `search(value)`: Searches for a value in the tree and returns `True` if found, otherwise `False`.\n- `delete(value)`: Deletes a value... | OpenCodeInstruct | Code | no_think |
Math_no_think_0486912 | [
{
"role": "user",
"content": "If $2x + 3y = 9$ and $xy = -12$, what is the value of $4x^2 + 9y^2$?"
},
{
"role": "assistant",
"content": "To find the value of $4x^2 + 9y^2$, we can use algebraic identities based on the given equations.\n\n**Given:**\n1. $2x + 3y = 9$\n2. $xy = -12$\n\n**Goal:**\... | UltraData-sft-2605 | Math | no_think |
Math_no_think_0975932 | [
{
"role": "user",
"content": "For how many four-digit positive integers is the product of the digits equal to 12?\n\nLet the four-digit number be represented as abcd. The product of the digits must equal 12, so we can form the equation abcd = 12.\n\nWe can try different combinations of digits to find the nu... | OpenMathInstruct-2 | Math | no_think |
Math_no_think_0427056 | [
{
"role": "user",
"content": "Given $\\alpha $ and $\\beta $ are two distinct planes, $m$ is a line in plane $\\alpha $. Which of the following statements is correct?\n\nA: If $m$ is parallel to $\\beta $, then $\\alpha $ is parallel to $\\beta $.\n\nB: If $l$ is a subset of $\\beta $, and $m$ is parallel t... | UltraData-sft-2605 | Math | no_think |
Math_no_think_0977771 | [
{
"role": "user",
"content": "A dance troupe consists of 6 couples, each consisting of a leader and a follower. They want to perform a choreographed dance where each dancer is paired with a new partner for each step, but with the constraint that a leader can only be paired with a follower and vice versa. If... | OpenMathInstruct-2 | Math | no_think |
Math_no_think_0081488 | [
{
"role": "user",
"content": "Mary went to the store to buy fruit. Apples cost $1, oranges cost $2, bananas cost $3, peaches cost $4, and grapes cost $5. For every 5 fruits that customers buy, the store offers a $1 discount. Additionally, for every 3 peaches and 2 grapes that are bought together, there is a... | UltraData-sft-2605 | Math | no_think |
Math_no_think_0931589 | [
{
"role": "user",
"content": "Let $f$ be a function defined on the real numbers as follows:\n\\[f(x) = \\left\\{ \\begin{aligned} -x & \\quad \\text{ if } x < 0 \\\\ 2x & \\quad \\text{ if } 0 \\le x \\le 1 \\\\ 3 - x & \\quad \\text{ if } x > 1 \\end{aligned} \\right.\\]\nIf $g$ is the inverse of $f$, find... | OpenMathInstruct-2 | Math | no_think |
Code_no_think_0660137 | [
{
"role": "user",
"content": "Little C loves number «3» very much. He loves all things about it.\n\nNow he is playing a game on a chessboard of size n × m. The cell in the x-th row and in the y-th column is called (x,y). Initially, The chessboard is empty. Each time, he places two chessmen on two different ... | OpenCodeReasoning | Code | no_think |
Math_no_think_0356503 | [
{
"role": "user",
"content": "Given the angles of $150^{\\circ}$ and $160^{\\circ}$ as shown in the figure, calculate the values of the angles $x, y,$ and $z$."
},
{
"role": "assistant",
"content": "Based on the standard geometric configuration implied by your description (two lines intersecting... | UltraData-sft-2605 | Math | no_think |
Code_no_think_0908717 | [
{
"role": "user",
"content": "You are given a simple function that takes two integers as input and returns their sum. Your task is to refactor the function to enhance its readability and maintainability while preserving its original functionality. Follow standard naming conventions and code structuring prac... | OpenCodeInstruct | Code | no_think |
Code_no_think_0966982 | [
{
"role": "user",
"content": "You are given the task to design a function `generate_valid_input` that will be used to generate test cases for the constructor of a class `OrthogonalSystem`. The `OrthogonalSystem` class is initialized with a dictionary where keys are unique alphanumeric strings representing c... | OpenCodeInstruct | Code | no_think |
Code_no_think_0547910 | [
{
"role": "user",
"content": "You are given a list of strings. Your task is to write a Python function that returns a new list containing only the strings that are palindromes. A palindrome is defined as a string that reads the same forwards and backwards, ignoring case and punctuation. \n\n**Input:**\n- A ... | OpenCodeInstruct | Code | no_think |
Code_no_think_0465072 | [
{
"role": "user",
"content": "Problem Description:\nYou are given a zero-indexed array B. Rearrange the elements of B such that the following conditions are satisfied:\n\nB[i] ≥ B[i+1] if i is even.\nB[i] ≤ B[i+1] if i is odd.\nIn other words, the following inequality should hold: B[0] ≥ B[1] ≤ B[2] ≥ B[3] ... | rStar-Coder | Code | no_think |
Code_no_think_0841640 | [
{
"role": "user",
"content": "You are tasked with implementing a function `weighted_average` that computes the weighted average of a list of values given their corresponding weights. The function should handle potential floating-point precision issues, especially when dealing with very small or very large n... | OpenCodeInstruct | Code | no_think |
Math_no_think_0995293 | [
{
"role": "user",
"content": "Alexis drives her friends to school every day. She has 4 friends in the carpool, and they split the fuel costs equally to thank Alexis for driving. The round-trip distance to school is 18 miles, the fuel price is $3.20/gallon, Alexis' car has a fuel efficiency of 25 miles/gallo... | OpenMathInstruct-2 | Math | no_think |
Math_no_think_0562435 | [
{
"role": "user",
"content": "For what value of c will the equation\n$$x + |x - 1| + |x - 2| = c$$\nhave exactly two solutions?"
},
{
"role": "assistant",
"content": "To determine the value of $c$ for which the equation\n$$x + |x - 1| + |x - 2| = c$$\nhas exactly two solutions, let us define the... | OpenMathInstruct-2 | Math | no_think |
Code_no_think_0576325 | [
{
"role": "user",
"content": "You are given a string `sentence` consisting of words separated by spaces. Your task is to write a Python function that counts the frequency of each word in the string and returns a dictionary with words as keys and their frequencies as values. The function should ignore punctu... | OpenCodeInstruct | Code | no_think |
Code_no_think_0298462 | [
{
"role": "user",
"content": "You are given a nested dictionary representing a tree-like structure where each key is a node and its value is either another dictionary (subtree) or a non-dictionary value (leaf node). Your task is to write a function that counts the total number of leaf nodes with prime value... | OpenCodeInstruct | Code | no_think |
Code_no_think_0581941 | [
{
"role": "user",
"content": "Problem Description:\nYou are given an array B of length M. At each step, any element B_{i} > 0 will decrement by 1, and each of its adjacent elements will increment by 1. The array is not circular, so the first and last elements only have one neighbor. Determine the sum of ele... | rStar-Coder | Code | no_think |
Code_no_think_0081124 | [
{
"role": "user",
"content": "Problem Description:\nGiven a list of distinct positive integers, determine the size of the largest subset such that each integer in the subset is a multiple of the previous one.\n\nInput Format:\n- The first line contains an integer n (1 ≤ n ≤ 10^6), the size of the list.\n- T... | rStar-Coder | Code | no_think |
Code_no_think_0619733 | [
{
"role": "user",
"content": "You are given a base directory path where project reports need to be stored. Your task is to design a function that generates a unique directory path within this base path. The function should ensure that the generated path does not already exist and should be efficient enough ... | OpenCodeInstruct | Code | no_think |
Math_no_think_0171316 | [
{
"role": "user",
"content": "Let $f(x)$ be an odd function defined on $\\mathbb{R}$. When $x \\geqslant 0$, $f(x)=2^{x}+\\sin \\frac {\\pi x}{2}+b$ ($b$ is a constant). Find $f(-1)=(\\ \\ \\ )$\nA: $-3$\nB: $-2$\nC: $2$\nD: $3$"
},
{
"role": "assistant",
"content": "**Step 1: Determine the valu... | UltraData-sft-2605 | Math | no_think |
Math_no_think_0081001 | [
{
"role": "user",
"content": "200 candidates participate in a mathematics competition, and they have 6 problems to solve. It is assumed that each problem has been solved by at least 120 participants. Show that there exist two candidates such that each problem has been solved by at least one of them."
},
... | UltraData-sft-2605 | Math | no_think |
Math_no_think_0768100 | [
{
"role": "user",
"content": "Find the greatest common factor of the polynomials $x^2 + 4x + 4$ and $x^2 + 2x - 3$."
},
{
"role": "assistant",
"content": "To find the greatest common factor (GCF) of the two polynomials, we need to factor each polynomial completely and then identify the common fa... | OpenMathInstruct-2 | Math | no_think |
Math_no_think_0949910 | [
{
"role": "user",
"content": "Solve for $x$ in the equation $\\sqrt{x} \\cdot \\frac{2}{7} \\cdot x = 12$."
},
{
"role": "assistant",
"content": "To solve for $x$ in the equation $\\sqrt{x} \\cdot \\frac{2}{7} \\cdot x = 12$, we will proceed step-by-step.\n\n### Step 1: Simplify the Equation\nFi... | OpenMathInstruct-2 | Math | no_think |
Math_no_think_0150277 | [
{
"role": "user",
"content": "Evaluate $\\lfloor\\sqrt{23}\\rfloor^2$."
},
{
"role": "assistant",
"content": "To evaluate the expression $\\lfloor\\sqrt{23}\\rfloor^2$, we will proceed step by step.\n\n### Step 1: Estimate the value of $\\sqrt{23}$\nWe need to find the integer part of the square... | UltraData-sft-2605 | Math | no_think |
Code_no_think_0688399 | [
{
"role": "user",
"content": "Problem Description:\nGiven a positive integer N, determine the number of ways to write N as a sum of distinct positive integers.\n\nInput Format:\n- A single integer N, where 1 <= N <= 1000.\n\nOutput Format: \n- A single integer representing the number of distinct ways to wr... | rStar-Coder | Code | no_think |
Math_no_think_0292340 | [
{
"role": "user",
"content": "Calculate the value of the following expression:\n\\[\\left(\\left((3+2)^{-1}+2\\right)^{-1}+2\\right)^{-1}+2.\\]\nA. $\\frac{65}{27}$ \nB. $\\frac{11}{27}$ \nC. $\\frac{27}{11}$ \nD. $\\frac{11}{5}$ \nE. $\\frac{27}{65}$"
},
{
"role": "assistant",
"content": "T... | UltraData-sft-2605 | Math | no_think |
Math_no_think_0812143 | [
{
"role": "user",
"content": "How many ways are there to arrange the letters of the word $\\text{BAAABCC}$, where the letters A, B, and C are considered different and no two identical letters can be adjacent?"
},
{
"role": "assistant",
"content": "To solve this problem, we need to find the numbe... | OpenMathInstruct-2 | Math | no_think |
Code_no_think_0653975 | [
{
"role": "user",
"content": "You are given two sorted lists of integers, `list1` and `list2`, and a list of indices, `indices`. Your task is to insert elements from `list2` into `list1` at the positions specified by `indices`. Note that `indices` may contain duplicate values, indicating that the correspond... | OpenCodeInstruct | Code | no_think |
Code_no_think_0473752 | [
{
"role": "user",
"content": "Thanos sort is a supervillain sorting algorithm, which works as follows: if the array is not sorted, snap your fingers* to remove the first or the second half of the items, and repeat the process.\n\nGiven an input array, what is the size of the longest sorted array you can obt... | OpenCodeReasoning-2 | Code | no_think |
Mephisto-MathCode_2M
2,000,000 non-thinking SFT examples — an even 1M/1M split of math and code — drawn from openbmb/UltraData-SFT-2605, filtered to English and globally shuffled.
This is a curation pass, not a generation one: no model produced these answers for this dataset. All credit for the content belongs to OpenBMB. What is added here is language filtering, an exact 1M/1M balance, and a global shuffle so the file can be streamed without a shuffle buffer.
domain |
rows |
|---|---|
Code |
1,000,000 |
Math |
1,000,000 |
Source config/split: Code/no_think and Math/no_think.
Format
{
"uid": "...",
"messages": [
{"role": "user", "content": "..."},
{"role": "assistant", "content": "..."}
],
"source": "UltraData-sft-2605",
"domain": "Code",
"think_type": "no_think"
}
The source schema is preserved unchanged. Every row is exactly two turns
(user, assistant) and think_type is no_think throughout — responses are
direct answers with no chain-of-thought block, though math answers do show
their working as ordinary prose/LaTeX.
domain distinguishes the two halves, and uid maps back to the source row.
Filtering
Only one filter was applied: Chinese removal. Rows whose prompt or answer is more than 5% CJK characters were dropped.
| scanned | kept | dropped (CJK) | |
|---|---|---|---|
| Code | 1,000,171 | 1,000,000 | 171 (0.017%) |
| Math | 1,000,154 | 1,000,000 | 154 (0.015%) |
Verified by re-running the filter over the output: 0 CJK rows and 0 duplicate
uids remained. No quality, length, or degeneracy filtering was performed —
inspect before training.
Shuffling
Shuffled globally across both halves with a seeded Fisher–Yates permutation (ChaCha8, seed 42), so every shard and every prefix is representative:
| Code | Math | |
|---|---|---|
| shard 000 | 50.4% | 49.6% |
| shard 019 | 49.2% | 50.8% |
take(n) on a streaming load gives an unbiased, balanced sample without an
extra shuffle buffer.
The shuffle was done with a small memory-mapped Rust tool that permutes an
index of (file_id, offset, length) — 16 bytes per row, so 2M rows cost 32 MB
of RAM regardless of the 10 GB of text behind them, and line bytes go straight
from mmap to the output without ever entering the process heap. This matters
if you want to re-shuffle it yourself on a modest machine.
Caveats
- Unfiltered for quality. The source is broadly good but nothing here has been checked for correctness, degeneracy, or answer length.
- Math rows are long (the 1M math rows are ~7.1 GB vs ~2.7 GB for 1M code rows), so a token-balanced mix is not 50/50 by row count.
- English-only by construction; the source split is bilingual.
- No deduplication beyond exact
uidcollisions.
Provenance and license
All content from openbmb/UltraData-SFT-2605 (Apache-2.0); see the source
dataset for its terms. Released under Apache-2.0.
- Downloads last month
- 92