id stringlengths 32 32 ⌀ | instruction_seed stringlengths 80 53.1k | output stringlengths 3.8k 69.9k ⌀ | source stringclasses 10
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 3
values | difficulty int64 6 10 | solution stringlengths 36 8.94k ⌀ | index stringclasses 70
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 256 798 | __original_row_idx int64 10 63.2k | ms_id int64 0 3.95k | reasoning sequencelengths 16 16 | deepseek_solution sequencelengths 16 16 | final_reasoning_trace sequencelengths 16 16 | _majority_responses sequencelengths 8 8 | verified_final_reasoning_trace stringlengths 1.63k 87.6k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
66b785d19a334f463bbecf9ec360542f | "Gaku decided to observe the ant's nest as a free study during the summer vacation. The transparent (...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where we have to calculate the maximum possi(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | 8 | "import math\nimport sys\n\ndef main():\n while True:\n line = sys.stdin.readline()\n (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires a deep understanding of geometry and mathematical modeling to determine the ma(...TRUNCATED) | 15,509 | 969 | ["Okay, so I need to solve this programming problem. Let's read the problem carefully again to under(...TRUNCATED) | ["To solve this problem, we need to determine the maximum possible height of soil in an ant nest cas(...TRUNCATED) | ["<think>\nOkay, so I need to solve this programming problem. Let's read the problem carefully again(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo t(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let's read the problem carefully again (...TRUNCATED) | [{"from":"human","value":"Gaku decided to observe the ant's nest as a free study during the summer v(...TRUNCATED) |
null | "Background:\nI originally posted this question last night, and received backlash on its vagueness. (...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "This problem involves parsing a string of digits to find a missing integer in a specified range. Th(...TRUNCATED) | 9,901 | 618 | ["Okay, I need to solve this problem where a string is formed by concatenating all numbers from 0 to(...TRUNCATED) | ["To solve this problem, we need to determine which number is missing from a scrambled string of con(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where a string is formed by concatenating all numbers (...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where a string is formed by concatenating all numbers (...TRUNCATED) | "<think>\nOkay, I need to solve this problem where a string is formed by concatenating all numbers f(...TRUNCATED) | [{"from":"human","value":"Background:\nI originally posted this question last night, and received ba(...TRUNCATED) |
00352529f88219ce87281590cf74daed | "Once, during a lesson, Sasha got bored and decided to talk with his friends. Suddenly, he saw Kefa.(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo th(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "MOD = 10**9 + 7\n\nn, m, a, b = map(int, input().split())\n\n# Precompute factorials and inverse fa(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves counting the number of 'beautiful trees' based on specific criteria involving (...TRUNCATED) | 25,918 | 1,619 | ["Okay, so I need to solve this problem where I have to count the number of beautiful trees. Let's r(...TRUNCATED) | ["To solve this problem, we need to count the number of beautiful trees where the distance between t(...TRUNCATED) | ["<think>\nOkay, so I need to solve this problem where I have to count the number of beautiful trees(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefull(...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. So, the task is to count the numb(...TRUNCATED) | [{"from":"human","value":"Once, during a lesson, Sasha got bored and decided to talk with his friend(...TRUNCATED) |
null | "Background (skip to definitions)\nEuler proved a beautiful theorem about the complex numbers: \\$e^(...TRUNCATED) | null | null | null | null | null | 9 | null | null | stackexchange_codegolf | "The problem requires a deep understanding of complex numbers, polynomials, cyclotomic polynomials, (...TRUNCATED) | 1,438 | 89 | ["Okay, I need to find a way to compute the n-th cyclotomic polynomial. Let me think about the defin(...TRUNCATED) | ["To solve this problem, we need to compute the n-th cyclotomic polynomial. The cyclotomic polynomia(...TRUNCATED) | ["<think>\nOkay, I need to find a way to compute the n-th cyclotomic polynomial. Let me think about (...TRUNCATED) | ["<think>\nOkay, I need to find a way to compute the n-th cyclotomic polynomial. Let me think about (...TRUNCATED) | "<think>\nOkay, I need to write a program that generates the n-th cyclotomic polynomial. Let's think(...TRUNCATED) | [{"from":"human","value":"Background (skip to definitions)\nEuler proved a beautiful theorem about t(...TRUNCATED) |
null | "A pristine program is a program that does not have any errors itself but will error if you modify i(...TRUNCATED) | null | null | null | null | null | 9 | null | null | stackexchange_codegolf | "This problem requires an extensive understanding of programming concepts, compiler behavior, and er(...TRUNCATED) | 12,470 | 779 | ["Okay, so I need to create a program in a programming language where inserting any single character(...TRUNCATED) | ["To solve this problem, we need to create a program that minimizes the score defined as the ratio o(...TRUNCATED) | ["<think>\nOkay, so I need to create a program in a programming language where inserting any single (...TRUNCATED) | ["<think>\nOkay, I need to create a program in a language that allows me to minimize the number of n(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to write a program that's as close to crys(...TRUNCATED) | [{"from":"human","value":"A pristine program is a program that does not have any errors itself but w(...TRUNCATED) |
null | "Introduction - What is a necklace?\nA necklace is something that OEIS people are obsessed with. The(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem involves deep mathematical insights into combinatorics and group theory, specifically r(...TRUNCATED) | 17,638 | 1,102 | ["Okay, let's try to figure out how to solve this problem. The task is to compute the number of dist(...TRUNCATED) | ["To solve this problem, we need to determine the number of distinct reversible primitive binary nec(...TRUNCATED) | ["<think>\nOkay, let's try to figure out how to solve this problem. The task is to compute the numbe(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where given an integer n, I have to find the number of(...TRUNCATED) | "<think>\nOkay, I need to find the number of distinct reversible primitive binary necklaces of lengt(...TRUNCATED) | [{"from":"human","value":"Introduction - What is a necklace?\nA necklace is something that OEIS peop(...TRUNCATED) |
null | "Two dimensional chiral objects are not chiral in three dimensional space. This is because you can f(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem involves understanding and processing three-dimensional data structures (arrays of char(...TRUNCATED) | 48,215 | 3,013 | ["Okay, so I need to solve this problem where I have to determine if a 3D text is chiral or not. Let(...TRUNCATED) | ["To solve this problem, we need to determine if a given 3D text is chiral. A 3D text is chiral if, (...TRUNCATED) | ["<think>\nOkay, so I need to solve this problem where I have to determine if a 3D text is chiral or(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to determine if a 3D text is chiral. The (...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to determine if a 3D text is chiral. Let m(...TRUNCATED) | [{"from":"human","value":"Two dimensional chiral objects are not chiral in three dimensional space. (...TRUNCATED) |
470276de8ecea8e813a084b09e0e29a0 | "Reziba has many magic gems. Each magic gem can be split into M normal gems. The amount of space eac(...TRUNCATED) | "<think>\nOkay, let's see. I need to find the number of configurations of magic and normal gems such(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "mod = 10**9 + 7\n\nN, M = map(int, input().split())\n\ndef build_matrix(M):\n mat = [[0] * M for(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves calculating configurations of gem arrangements based on specific rules of spli(...TRUNCATED) | 10,386 | 649 | ["Okay, let's try to understand this problem. So, Reziba has magic gems and normal gems. But wait, n(...TRUNCATED) | ["To solve this problem, we need to determine the number of different configurations of magic and no(...TRUNCATED) | ["<think>\nOkay, let's try to understand this problem. So, Reziba has magic gems and normal gems. Bu(...TRUNCATED) | ["<think>\nOkay, let's try to understand this problem. So, Reziba has magic gems and normal gems. Bu(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about counting the number of configurations of magic and n(...TRUNCATED) | [{"from":"human","value":"Reziba has many magic gems. Each magic gem can be split into M normal gems(...TRUNCATED) |
null | "Overview\nShue (Simplified Thue) is a language that was designed by AnttiP for this challenge. A Sh(...TRUNCATED) | null | null | null | null | null | 10 | null | null | stackexchange_codegolf | "The problem requires a deep understanding of string replacement, non-deterministic behavior of prog(...TRUNCATED) | 36,019 | 2,251 | ["Okay, I need to solve this problem where I have to write a program that simulates the execution of(...TRUNCATED) | ["To solve this problem, we need to simulate the execution of a Shue program. A Shue program consist(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to write a program that simulates the exe(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to write a program that simulates the exe(...TRUNCATED) | "<think>\nOkay, I need to solve this Shue interpreter problem. Let's see. The task is to write a pro(...TRUNCATED) | [{"from":"human","value":"Overview\nShue (Simplified Thue) is a language that was designed by AnttiP(...TRUNCATED) |
null | "The Post's Correspondence Problem (PCP) gives you a list of pairs of strings, P_1 ... P_n. Your tas(...TRUNCATED) | null | null | null | null | null | 10 | null | null | stackexchange_codegolf | "The Post's Correspondence Problem (PCP) is a well-known undecidable problem in computer science, wh(...TRUNCATED) | 45,215 | 2,825 | ["Okay, so I need to solve the Post's Correspondence Problem for given pairs of strings. The input i(...TRUNCATED) | ["To solve this problem, we need to determine if there exists a sequence of indices such that the co(...TRUNCATED) | ["<think>\nOkay, so I need to solve the Post's Correspondence Problem for given pairs of strings. Th(...TRUNCATED) | ["<think>\nOkay, I need to solve this Post's Correspondence Problem. The input is a list of pairs of(...TRUNCATED) | "<think>\nOkay, so I need to solve the Post's Correspondence Problem for given pairs of strings. The(...TRUNCATED) | [{"from":"human","value":"The Post's Correspondence Problem (PCP) gives you a list of pairs of strin(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6