Dataset Viewer
Auto-converted to Parquet Duplicate
id
stringclasses
10 values
instruction_seed
stringclasses
10 values
output
stringclasses
10 values
source
stringclasses
2 values
license
stringclasses
1 value
dataset
stringclasses
1 value
split
stringclasses
1 value
difficulty
stringclasses
6 values
solution
stringclasses
10 values
_source
stringclasses
1 value
to_be_used
float64
95
100
classifier_reasoning
stringclasses
10 values
__original_row_idx
int64
5
147
ms_id
int64
0
9
reasoning
sequencelengths
16
16
deepseek_solution
sequencelengths
16
16
final_reasoning_trace
sequencelengths
16
16
correct
sequencelengths
16
16
_majority_responses
sequencelengths
2
16
verified_final_reasoning_trace
stringlengths
5.05k
91.5k
conversations
listlengths
2
2
5a91c652cac7f0c376bc583bfa2050f1
"Some positive integers can be represented by a sum of one or more consecutive prime numbers. How ma(...TRUNCATED)
"<think>\nOkay, let's tackle this problem. Hmm, the task is to find the number of ways a given numbe(...TRUNCATED)
aizu
cc-by-4.0
code_contests
train
UNKNOWN_DIFFICULTY
"import bisect\n\ndef sieve(n):\n sieve = [True] * (n + 1)\n sieve[0] = sieve[1] = False\n (...TRUNCATED)
nvidia/OpenCodeReasoning
95
"The provided answer successfully implements an efficient algorithm that addresses the given problem(...TRUNCATED)
22
4
["Okay, let's see. I need to find the number of ways a given number can be expressed as the sum of c(...TRUNCATED)
["To solve this problem, we need to determine how many ways a given positive integer can be expresse(...TRUNCATED)
["<think>\nOkay, let's see. I need to find the number of ways a given number can be expressed as the(...TRUNCATED)
[ true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true ]
["<think>\nOkay, let's see. I need to find the number of ways a given number can be expressed as the(...TRUNCATED)
"<think>\nOkay, let's see. The problem is to find the number of ways a given number can be expressed(...TRUNCATED)
[{"from":"human","value":"Some positive integers can be represented by a sum of one or more consecut(...TRUNCATED)
c3cc2633bfa653699f525a34b26f32dd
"Hongcow is learning to spell! One day, his teacher gives him a word that he needs to learn to spell(...TRUNCATED)
"<think>\nOkay, let's see. The problem is to find out how many distinct cyclic shifts a given string(...TRUNCATED)
codeforces
cc-by-4.0
code_contests
train
interview
"s = input().strip()\nn = len(s)\nunique_shifts = set()\n\nfor k in range(n):\n rotated = s[-k:] (...TRUNCATED)
nvidia/OpenCodeReasoning
95
"The provided answer correctly explains the problem of counting distinct cyclic shifts of a string a(...TRUNCATED)
75
5
["Okay, let's see. The problem is about finding the number of distinct cyclic shifts of a given stri(...TRUNCATED)
["To solve this problem, we need to determine the number of distinct cyclic shifts that can be gener(...TRUNCATED)
["<think>\nOkay, let's see. The problem is about finding the number of distinct cyclic shifts of a g(...TRUNCATED)
[ true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, false ]
["<think>\nOkay, let's see. The problem is about finding the number of distinct cyclic shifts of a g(...TRUNCATED)
"<think>\nOkay, let's see. The problem is about cyclic shifts of a string. So Hongcow can take the l(...TRUNCATED)
[{"from":"human","value":"Hongcow is learning to spell! One day, his teacher gives him a word that h(...TRUNCATED)
39ce61e19acbfada59c33b82a74f0838
"The Berland's capital has the form of a rectangle with sizes n × m quarters. All quarters are divi(...TRUNCATED)
"<think>\nOkay, so I need to solve this programming problem. Let me read the problem statement caref(...TRUNCATED)
codeforces
cc-by-4.0
code_contests
train
HARD
"n, m, q, p = map(int, input().split())\ngrid = [input().strip() for _ in range(n)]\n\ntotal = [[0]*(...TRUNCATED)
nvidia/OpenCodeReasoning
100
"The provided answer outlines a correct approach to solving the problem of calculating noise levels (...TRUNCATED)
36
1
["Okay, let's tackle this problem. Hmm, the problem is about calculating the noise level in each qua(...TRUNCATED)
["To solve this problem, we need to determine the number of quarters in the Berland capital where th(...TRUNCATED)
["<think>\nOkay, let's tackle this problem. Hmm, the problem is about calculating the noise level in(...TRUNCATED)
[ true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, false ]
["<think>\nOkay, let's tackle this problem. Hmm, the problem is about calculating the noise level in(...TRUNCATED)
"<think>\nOkay, let's tackle this problem. Hmm, the problem is about calculating the noise level in (...TRUNCATED)
[{"from":"human","value":"The Berland's capital has the form of a rectangle with sizes n × m quarte(...TRUNCATED)
4951486bce2eb180de066a30fcac4c57
"n students are taking an exam. The highest possible score at this exam is m. Let a_{i} be the score(...TRUNCATED)
"<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED)
codeforces
cc-by-4.0
code_contests
train
7
"import sys\n\nt = int(sys.stdin.readline())\nfor _ in range(t):\n n, m = map(int, sys.stdin.read(...TRUNCATED)
nvidia/OpenCodeReasoning
95
"The provided answer correctly follows the logical process needed to solve the problem. It grasps th(...TRUNCATED)
19
6
["Okay, let's see. The problem is about maximizing the score of the first student under certain cond(...TRUNCATED)
["To solve this problem, we need to determine the highest possible score that the first student can (...TRUNCATED)
["<think>\nOkay, let's see. The problem is about maximizing the score of the first student under cer(...TRUNCATED)
[ true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true ]
["<think>\nOkay, let's see. The problem is about maximizing the score of the first student under cer(...TRUNCATED)
"<think>\nOkay, let's try to solve this problem. So the problem is about maximizing the first studen(...TRUNCATED)
[{"from":"human","value":"n students are taking an exam. The highest possible score at this exam is (...TRUNCATED)
a205c1398019fa3572b43bce0fd8d317
"There are n positive integers written on the blackboard. Also, a positive number k ≥ 2 is chosen,(...TRUNCATED)
"<think>\nOkay, let's see. The problem is about combining numbers on a blackboard through operations(...TRUNCATED)
codeforces
cc-by-4.0
code_contests
train
VERY_HARD
"import sys\nfrom itertools import combinations\nfrom collections import deque\n\ndef main():\n n(...TRUNCATED)
nvidia/OpenCodeReasoning
95
"The provided solution does not explicitly follow a well-formed structure to guarantee reaching the (...TRUNCATED)
111
8
["Okay, let's try to figure out this problem. So the problem is about merging numbers on a blackboar(...TRUNCATED)
["To solve this problem, we need to determine if we can merge a list of integers using a specific op(...TRUNCATED)
["<think>\nOkay, let's try to figure out this problem. So the problem is about merging numbers on a (...TRUNCATED)
[ false, false, false, true, true, true, false, true, true, false, true, true, false, true, false, false ]
["<think>\nOkay, I need to solve this problem where I have to determine if it's possible to combine (...TRUNCATED)
"<think>\nOkay, I need to solve this problem. Let's read the problem statement carefully.\n\nSo, the(...TRUNCATED)
[{"from":"human","value":"There are n positive integers written on the blackboard. Also, a positive (...TRUNCATED)
39ce61e19acbfada59c33b82a74f0838
"The Berland's capital has the form of a rectangle with sizes n × m quarters. All quarters are divi(...TRUNCATED)
"<think>\nOkay, so I need to solve this programming problem. Let me read the problem statement caref(...TRUNCATED)
codeforces
cc-by-4.0
code_contests
train
HARD
"n, m, q, p = map(int, input().split())\ngrid = [input().strip() for _ in range(n)]\n\ntotal = [[0]*(...TRUNCATED)
nvidia/OpenCodeReasoning
100
"The provided answer outlines a correct approach to solving the problem of calculating noise levels (...TRUNCATED)
36
1
["Okay, let's tackle this problem. Hmm, the problem is about calculating the noise level in each qua(...TRUNCATED)
["To solve this problem, we need to determine the number of quarters in the Berland capital where th(...TRUNCATED)
["<think>\nOkay, let's tackle this problem. Hmm, the problem is about calculating the noise level in(...TRUNCATED)
[ true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, false ]
["<think>\nOkay, let's tackle this problem. Hmm, the problem is about calculating the noise level in(...TRUNCATED)
"<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED)
[{"from":"human","value":"The Berland's capital has the form of a rectangle with sizes n × m quarte(...TRUNCATED)
c3cc2633bfa653699f525a34b26f32dd
"Hongcow is learning to spell! One day, his teacher gives him a word that he needs to learn to spell(...TRUNCATED)
"<think>\nOkay, let's see. The problem is to find out how many distinct cyclic shifts a given string(...TRUNCATED)
codeforces
cc-by-4.0
code_contests
train
interview
"s = input().strip()\nn = len(s)\nunique_shifts = set()\n\nfor k in range(n):\n rotated = s[-k:] (...TRUNCATED)
nvidia/OpenCodeReasoning
95
"The provided answer correctly explains the problem of counting distinct cyclic shifts of a string a(...TRUNCATED)
75
5
["Okay, let's see. The problem is about finding the number of distinct cyclic shifts of a given stri(...TRUNCATED)
["To solve this problem, we need to determine the number of distinct cyclic shifts that can be gener(...TRUNCATED)
["<think>\nOkay, let's see. The problem is about finding the number of distinct cyclic shifts of a g(...TRUNCATED)
[ true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, false ]
["<think>\nOkay, let's see. The problem is about finding the number of distinct cyclic shifts of a g(...TRUNCATED)
"<think>\nOkay, I need to solve this programming problem. Let's see what the problem is about. The t(...TRUNCATED)
[{"from":"human","value":"Hongcow is learning to spell! One day, his teacher gives him a word that h(...TRUNCATED)
c3cc2633bfa653699f525a34b26f32dd
"Hongcow is learning to spell! One day, his teacher gives him a word that he needs to learn to spell(...TRUNCATED)
"<think>\nOkay, let's see. The problem is to find out how many distinct cyclic shifts a given string(...TRUNCATED)
codeforces
cc-by-4.0
code_contests
train
interview
"s = input().strip()\nn = len(s)\nunique_shifts = set()\n\nfor k in range(n):\n rotated = s[-k:] (...TRUNCATED)
nvidia/OpenCodeReasoning
95
"The provided answer correctly explains the problem of counting distinct cyclic shifts of a string a(...TRUNCATED)
75
5
["Okay, let's see. The problem is about finding the number of distinct cyclic shifts of a given stri(...TRUNCATED)
["To solve this problem, we need to determine the number of distinct cyclic shifts that can be gener(...TRUNCATED)
["<think>\nOkay, let's see. The problem is about finding the number of distinct cyclic shifts of a g(...TRUNCATED)
[ true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, false ]
["<think>\nOkay, let's see. The problem is about finding the number of distinct cyclic shifts of a g(...TRUNCATED)
"<think>\nOkay, let's see. The problem is to find out how many distinct strings Hongcow can generate(...TRUNCATED)
[{"from":"human","value":"Hongcow is learning to spell! One day, his teacher gives him a word that h(...TRUNCATED)
4951486bce2eb180de066a30fcac4c57
"n students are taking an exam. The highest possible score at this exam is m. Let a_{i} be the score(...TRUNCATED)
"<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED)
codeforces
cc-by-4.0
code_contests
train
7
"import sys\n\nt = int(sys.stdin.readline())\nfor _ in range(t):\n n, m = map(int, sys.stdin.read(...TRUNCATED)
nvidia/OpenCodeReasoning
95
"The provided answer correctly follows the logical process needed to solve the problem. It grasps th(...TRUNCATED)
19
6
["Okay, let's see. The problem is about maximizing the score of the first student under certain cond(...TRUNCATED)
["To solve this problem, we need to determine the highest possible score that the first student can (...TRUNCATED)
["<think>\nOkay, let's see. The problem is about maximizing the score of the first student under cer(...TRUNCATED)
[ true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true ]
["<think>\nOkay, let's see. The problem is about maximizing the score of the first student under cer(...TRUNCATED)
"<think>\nOkay, let's see. I need to solve this programming problem. The problem is about adjusting (...TRUNCATED)
[{"from":"human","value":"n students are taking an exam. The highest possible score at this exam is (...TRUNCATED)
4951486bce2eb180de066a30fcac4c57
"n students are taking an exam. The highest possible score at this exam is m. Let a_{i} be the score(...TRUNCATED)
"<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED)
codeforces
cc-by-4.0
code_contests
train
7
"import sys\n\nt = int(sys.stdin.readline())\nfor _ in range(t):\n n, m = map(int, sys.stdin.read(...TRUNCATED)
nvidia/OpenCodeReasoning
95
"The provided answer correctly follows the logical process needed to solve the problem. It grasps th(...TRUNCATED)
19
6
["Okay, let's see. The problem is about maximizing the score of the first student under certain cond(...TRUNCATED)
["To solve this problem, we need to determine the highest possible score that the first student can (...TRUNCATED)
["<think>\nOkay, let's see. The problem is about maximizing the score of the first student under cer(...TRUNCATED)
[ true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true ]
["<think>\nOkay, let's see. The problem is about maximizing the score of the first student under cer(...TRUNCATED)
"<think>\nOkay, let's see. The problem is that we need to find the maximum possible score for the fi(...TRUNCATED)
[{"from":"human","value":"n students are taking an exam. The highest possible score at this exam is (...TRUNCATED)
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
6