problem stringlengths 46 14.6k | source stringclasses 6
values | domain stringclasses 1
value | id sequencelengths 12 12 | reasoning stringlengths 406 56.8k | deepseek_solution stringlengths 93 11.9k | __original_row_idx int64 0 1.26k | final_reasoning_trace sequencelengths 12 12 | correct_majority_indices sequencelengths 2 12 | _judge_reasoning stringlengths 192 1.43k | _majority_responses sequencelengths 2 12 | verified_final_reasoning_trace stringlengths 603 98.4k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
"Please focus on the efficiency of this problem and provide code in ANSI C:\nGiven a **1-indexed** a(...TRUNCATED) | dolphin | code | [
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255
] | "Okay, let's see. The problem is to find two numbers in a sorted array that add up to a target. And (...TRUNCATED) | "To solve this problem, we need to find two numbers in a sorted array such that their sum equals a g(...TRUNCATED) | 117 | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9",
"10",
"11"
] | "All solutions provided utilize the two-pointer approach to find indices of two numbers in a sorted (...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a tar(...TRUNCATED) | [{"from":"human","value":"Please focus on the efficiency of this problem and provide code in ANSI C:(...TRUNCATED) |
"Please focus on the efficiency of this problem and provide code in ANSI C:\nGiven a **1-indexed** a(...TRUNCATED) | dolphin | code | [
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255
] | "Okay, let's see. The problem is to find two numbers in a sorted array that add up to a target. And (...TRUNCATED) | "To solve this problem, we need to find two numbers in a sorted array such that their sum equals a g(...TRUNCATED) | 117 | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9",
"10",
"11"
] | "All solutions provided utilize the two-pointer approach to find indices of two numbers in a sorted (...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find two numbers in a sorted array that(...TRUNCATED) | [{"from":"human","value":"Please focus on the efficiency of this problem and provide code in ANSI C:(...TRUNCATED) |
"Please focus on the efficiency of this problem and provide code in ANSI C:\nGiven a **1-indexed** a(...TRUNCATED) | dolphin | code | [
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255
] | "Okay, let's see. The problem is to find two numbers in a sorted array that add up to a target. And (...TRUNCATED) | "To solve this problem, we need to find two numbers in a sorted array such that their sum equals a g(...TRUNCATED) | 117 | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9",
"10",
"11"
] | "All solutions provided utilize the two-pointer approach to find indices of two numbers in a sorted (...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a tar(...TRUNCATED) | [{"from":"human","value":"Please focus on the efficiency of this problem and provide code in ANSI C:(...TRUNCATED) |
"Please focus on the efficiency of this problem and provide code in ANSI C:\nGiven a **1-indexed** a(...TRUNCATED) | dolphin | code | [
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255
] | "Okay, let's see. The problem is to find two numbers in a sorted array that add up to a target. And (...TRUNCATED) | "To solve this problem, we need to find two numbers in a sorted array such that their sum equals a g(...TRUNCATED) | 117 | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9",
"10",
"11"
] | "All solutions provided utilize the two-pointer approach to find indices of two numbers in a sorted (...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find two numbers in a sorted array that(...TRUNCATED) | [{"from":"human","value":"Please focus on the efficiency of this problem and provide code in ANSI C:(...TRUNCATED) |
"Please focus on the efficiency of this problem and provide code in ANSI C:\nGiven a **1-indexed** a(...TRUNCATED) | dolphin | code | [
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255
] | "Okay, let's see. The problem is to find two numbers in a sorted array that add up to a target. And (...TRUNCATED) | "To solve this problem, we need to find two numbers in a sorted array such that their sum equals a g(...TRUNCATED) | 117 | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9",
"10",
"11"
] | "All solutions provided utilize the two-pointer approach to find indices of two numbers in a sorted (...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find two numbers in a sorted array that(...TRUNCATED) | [{"from":"human","value":"Please focus on the efficiency of this problem and provide code in ANSI C:(...TRUNCATED) |
"Please focus on the efficiency of this problem and provide code in ANSI C:\nGiven a **1-indexed** a(...TRUNCATED) | dolphin | code | [
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255
] | "Okay, let's see. The problem is to find two numbers in a sorted array that add up to a target. And (...TRUNCATED) | "To solve this problem, we need to find two numbers in a sorted array such that their sum equals a g(...TRUNCATED) | 117 | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9",
"10",
"11"
] | "All solutions provided utilize the two-pointer approach to find indices of two numbers in a sorted (...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | "<think>\nOkay, let's see. So the problem is to find two numbers in a sorted array that add up to a (...TRUNCATED) | [{"from":"human","value":"Please focus on the efficiency of this problem and provide code in ANSI C:(...TRUNCATED) |
"Please focus on the efficiency of this problem and provide code in ANSI C:\nGiven a **1-indexed** a(...TRUNCATED) | dolphin | code | [
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255
] | "Okay, let's see. The problem is to find two numbers in a sorted array that add up to a target. And (...TRUNCATED) | "To solve this problem, we need to find two numbers in a sorted array such that their sum equals a g(...TRUNCATED) | 117 | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9",
"10",
"11"
] | "All solutions provided utilize the two-pointer approach to find indices of two numbers in a sorted (...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find two numbers in a sorted array that(...TRUNCATED) | [{"from":"human","value":"Please focus on the efficiency of this problem and provide code in ANSI C:(...TRUNCATED) |
"Please focus on the efficiency of this problem and provide code in ANSI C:\nGiven a **1-indexed** a(...TRUNCATED) | dolphin | code | [
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255
] | "Okay, let's see. The problem is to find two numbers in a sorted array that add up to a target. And (...TRUNCATED) | "To solve this problem, we need to find two numbers in a sorted array such that their sum equals a g(...TRUNCATED) | 117 | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9",
"10",
"11"
] | "All solutions provided utilize the two-pointer approach to find indices of two numbers in a sorted (...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find two numbers in a sorted array that(...TRUNCATED) | [{"from":"human","value":"Please focus on the efficiency of this problem and provide code in ANSI C:(...TRUNCATED) |
"Please focus on the efficiency of this problem and provide code in ANSI C:\nGiven a **1-indexed** a(...TRUNCATED) | dolphin | code | [
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255
] | "Okay, let's see. The problem is to find two numbers in a sorted array that add up to a target. And (...TRUNCATED) | "To solve this problem, we need to find two numbers in a sorted array such that their sum equals a g(...TRUNCATED) | 117 | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9",
"10",
"11"
] | "All solutions provided utilize the two-pointer approach to find indices of two numbers in a sorted (...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where I have to find two numbers in a sorted(...TRUNCATED) | [{"from":"human","value":"Please focus on the efficiency of this problem and provide code in ANSI C:(...TRUNCATED) |
"Please focus on the efficiency of this problem and provide code in ANSI C:\nGiven a **1-indexed** a(...TRUNCATED) | dolphin | code | [
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255,
255
] | "Okay, let's see. The problem is to find two numbers in a sorted array that add up to a target. And (...TRUNCATED) | "To solve this problem, we need to find two numbers in a sorted array such that their sum equals a g(...TRUNCATED) | 117 | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9",
"10",
"11"
] | "All solutions provided utilize the two-pointer approach to find indices of two numbers in a sorted (...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to find two numbers in a sorted array that add up to a ta(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find two numbers in a sorted array that(...TRUNCATED) | [{"from":"human","value":"Please focus on the efficiency of this problem and provide code in ANSI C:(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 10