Dataset Viewer
id
stringclasses 486
values | instruction_seed
stringlengths 187
25.6k
| output
stringlengths 4.44k
68.9k
⌀ | source
stringclasses 10
values | license
stringclasses 4
values | dataset
stringclasses 4
values | split
stringclasses 3
values | difficulty
int64 6
10
| solution
stringlengths 25
6.64k
⌀ | index
stringclasses 67
values | _source
stringclasses 2
values | difficulty_reasoning
stringlengths 259
814
| __original_row_idx
int64 25
63.2k
| ms_id
int64 1
3.95k
| reasoning
stringlengths 4.17k
105k
| deepseek_solution
stringlengths 0
64.8k
| final_reasoning_trace
stringlengths 4.26k
127k
| question_answer_string
stringlengths 5.96k
129k
| _fasttext_score
float64 1
1
| conversations
listlengths 2
2
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
9cec5eba8665ba40b01da6f8ffcf8a23
| "Chef's professor gave him homework to find a permutation of length 2^{N} such that each integer fro(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the task is to find permutations of length 2^N where(...TRUNCATED) |
codechef
|
apache-2.0
|
taco
|
train
| 8 | "MOD = 10**9 + 7\n\ndef generate_permutation(n):\n if n == 1:\n return [0, 1]\n perm = (...TRUNCATED) |
13750
|
nvidia/OpenCodeReasoning
| "This problem requires deep mathematical insights and complex algorithmic implementations to find th(...TRUNCATED) | 54,817 | 3,426 | "Okay, let's tackle this problem. So, Chef needs to find permutations of length 2^N where each numbe(...TRUNCATED) | "To solve this problem, we need to find the number of valid permutations of length \\(2^N\\) such th(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So, Chef needs to find permutations of length 2^N where e(...TRUNCATED) | "Question: Chef's professor gave him homework to find a permutation of length 2^{N} such that each i(...TRUNCATED) | 1.000009 | [{"from":"human","value":"Chef's professor gave him homework to find a permutation of length 2^{N} s(...TRUNCATED) |
4d33b42a4c6c39dbf9de1429c4fe2247
| "Today Adilbek is taking his probability theory test. Unfortunately, when Adilbek arrived at the uni(...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. So the problem is about calculati(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 9 | "MOD = 10**9 + 7\n\ndef main():\n import sys\n input = sys.stdin.read().split()\n n = int(i(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires a deep understanding of probability theory combined with combinatorial optimiz(...TRUNCATED) | 37,542 | 2,346 | "Okay, let's see. So the problem is about Adilbek solving crosswords, and we need to compute the exp(...TRUNCATED) | "To solve this problem, we need to calculate the expected number of crosswords Adilbek can solve wit(...TRUNCATED) | "<think>\nOkay, let's see. So the problem is about Adilbek solving crosswords, and we need to comput(...TRUNCATED) | "Question: Today Adilbek is taking his probability theory test. Unfortunately, when Adilbek arrived (...TRUNCATED) | 1.000009 | [{"from":"human","value":"Today Adilbek is taking his probability theory test. Unfortunately, when A(...TRUNCATED) |
ce286947ba5ffbd6e6d548d2f9d74a34
| "Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex (...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding two disjoint vertex covers A and B in an und(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 9 | "import sys\nfrom collections import deque\n\ndef main():\n n, m = map(int, sys.stdin.readline().(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves finding a specific structure (two disjoint vertex covers) in a potentially com(...TRUNCATED) | 47,008 | 2,938 | "Okay, I need to solve this problem where I have to find two disjoint vertex covers A and B. Both of(...TRUNCATED) | "To solve this problem, we need to determine if we can split an undirected graph into two disjoint v(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find two disjoint vertex covers A and B(...TRUNCATED) | "Question: Recently, Pari and Arya did some research about NP-Hard problems and they found the minim(...TRUNCATED) | 1.000008 | [{"from":"human","value":"Recently, Pari and Arya did some research about NP-Hard problems and they (...TRUNCATED) |
null | "I recently learned from a comment by MathOverflow user pregunton that it is possible to enumerate a(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem involves generating a sequence of operations based on mathematical transformations, req(...TRUNCATED) | 61,021 | 3,813 | "Okay, I need to solve this problem where given two integers n and d, I have to find the shortest se(...TRUNCATED) | "To solve this problem, we need to find the shortest sequence of operations (either 'f' or 'g') that(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where given two integers n and d, I have to find the sh(...TRUNCATED) | "Question: I recently learned from a comment by MathOverflow user pregunton that it is possible to e(...TRUNCATED) | 1.000008 | [{"from":"human","value":"I recently learned from a comment by MathOverflow user pregunton that it i(...TRUNCATED) |
null | "Let's say you have a stack, which at the start contains a b c in this order (a is on the top). You (...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem involves manipulating a stack with specific operations to achieve a desired order. It r(...TRUNCATED) | 22,786 | 1,424 | "Okay, I need to solve this problem where I have to find the shortest sequence of operations (s, d, (...TRUNCATED) | "To solve this problem, we need to find the shortest sequence of operations (s, d, t) to transform t(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the shortest sequence of operation(...TRUNCATED) | "Question: Let's say you have a stack, which at the start contains a b c in this order (a is on the (...TRUNCATED) | 1.000004 | [{"from":"human","value":"Let's say you have a stack, which at the start contains a b c in this orde(...TRUNCATED) |
null | "Some time after this incident…\nThere are some of us who are against this defiling order of jQuer(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem involves a thorough understanding of input validation and manipulation of strings while(...TRUNCATED) | 15,878 | 992 | "Okay, I need to solve this programming problem. Let me read the problem again carefully to understa(...TRUNCATED) | "To solve this problem, we need to validate an input program to check for the presence of any defili(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let me read the problem again carefully to(...TRUNCATED) | "Question: Some time after this incident…\nThere are some of us who are against this defiling orde(...TRUNCATED) | 1.000008 | [{"from":"human","value":"Some time after this incident…\nThere are some of us who are against thi(...TRUNCATED) |
1065f9f6387e29747cebcdf4c2908a98
| "In number theory, Euler's totient is an arithmetic function, introduced in 1763 by Euler, that coun(...TRUNCATED) | "<think>\nOkay, I need to write a Python function for Euler's totient function. Let's think about ho(...TRUNCATED) |
codewars
|
mit
|
apps
|
train
| 8 | "import math\n\ndef euler_totient(n):\n # Check if input is valid\n if isinstance(n, bool):\n (...TRUNCATED) |
3673
|
nvidia/OpenCodeReasoning
| "The problem involves computing the Euler's totient function, which requires an understanding of num(...TRUNCATED) | 23,320 | 1,457 | "Okay, I need to write a function to compute Euler's totient function for a given n. Let's think abo(...TRUNCATED) | "To solve this problem, we need to compute Euler's Totient Function, φ(n), which counts the number (...TRUNCATED) | "<think>\nOkay, I need to write a function to compute Euler's totient function for a given n. Let's (...TRUNCATED) | "Question: In number theory, Euler's totient is an arithmetic function, introduced in 1763 by Euler,(...TRUNCATED) | 1.000009 | [{"from":"human","value":"In number theory, Euler's totient is an arithmetic function, introduced in(...TRUNCATED) |
26036b8fe1fdb55d8cd7dccce9df9947
| "The commanding officers decided to drop a nuclear bomb on the enemy's forces. You are ordered to de(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the minimal radius R such that the probability of (...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import math\n\ndef compute_min_radius():\n N = int(input())\n K, eps_per_mil = map(int, input(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem involves advanced mathematical insights relating to probability and distances in a geo(...TRUNCATED) | 6,223 | 388 | "Okay, let's see. So the problem is about finding the minimal radius R for a nuclear bomb such that (...TRUNCATED) | "To solve this problem, we need to determine the minimal radius \\( R \\) for a nuclear warhead such(...TRUNCATED) | "<think>\nOkay, let's see. So the problem is about finding the minimal radius R for a nuclear bomb s(...TRUNCATED) | "Question: The commanding officers decided to drop a nuclear bomb on the enemy's forces. You are ord(...TRUNCATED) | 1.00001 | [{"from":"human","value":"The commanding officers decided to drop a nuclear bomb on the enemy's forc(...TRUNCATED) |
null | "Let's say you have a stack, which at the start contains a b c in this order (a is on the top). You (...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem involves manipulating a stack with specific operations to achieve a desired order. It r(...TRUNCATED) | 22,787 | 1,424 | "Okay, I need to solve this problem where I have to find the shortest sequence of operations (s, d, (...TRUNCATED) | "To solve this problem, we need to determine the shortest sequence of operations to transform the in(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the shortest sequence of operation(...TRUNCATED) | "Question: Let's say you have a stack, which at the start contains a b c in this order (a is on the (...TRUNCATED) | 1.000006 | [{"from":"human","value":"Let's say you have a stack, which at the start contains a b c in this orde(...TRUNCATED) |
null | "For this challenge a \"binary tree\" is a rooted tree where each node has 0 children (leaf) or 2. (...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem involves generating and counting specific structures (binary trees) with particular co(...TRUNCATED) | 57,837 | 3,614 | "Okay, let's try to figure out how to solve this problem. So, the task is to calculate the number of(...TRUNCATED) | "To solve this problem, we need to determine the number of binary trees labeled from 1 to 2n+1 such (...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. So, the task is to calculate the (...TRUNCATED) | "Question: For this challenge a \"binary tree\" is a rooted tree where each node has 0 children (lea(...TRUNCATED) | 1.000007 | [{"from":"human","value":"For this challenge a \"binary tree\" is a rooted tree where each node has (...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 8