id stringlengths 32 32 ⌀ | instruction_seed stringlengths 80 48.6k | output stringlengths 4.44k 72.1k ⌀ | source stringclasses 10
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 3
values | difficulty int64 6 10 | solution stringlengths 8 8.94k ⌀ | index stringclasses 39
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 280 886 | __original_row_idx int64 10 63.1k | ms_id int64 0 3.94k | 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 85.4k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
236ba229737df24208c2446987652c18 | "You are given a directed weighted graph with n nodes and 2n - 2 edges. The nodes are labeled from 1(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the problem is about handling queries on a directed (...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom sys import stdin\ninput = sys.stdin.read\ndata = input().split()\nidx = 0\n\nn, q (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves a directed weighted graph with complex characteristics, requiring an understan(...TRUNCATED) | 51,026 | 3,189 | ["Okay, let's try to solve this programming problem. So, the problem is about a directed weighted gr(...TRUNCATED) | ["To solve this problem, we need to efficiently handle two types of queries on a directed weighted g(...TRUNCATED) | ["<think>\nOkay, let's try to solve this programming problem. So, the problem is about a directed we(...TRUNCATED) | ["<think>\nOkay, let's see. I have to solve this programming problem. Let's read the problem stateme(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the problem is about a directed graph with specific (...TRUNCATED) | [{"from":"human","value":"You are given a directed weighted graph with n nodes and 2n - 2 edges. The(...TRUNCATED) |
null | "Write a program or function that takes in a positive integer N and outputs the first N numbers of t(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem requires not just implementation skills but also a deep understanding of the pattern fo(...TRUNCATED) | 25,108 | 1,569 | ["Okay, I need to write a program or function that generates this amplifying zigzag pattern up to N (...TRUNCATED) | ["To solve this problem, we need to generate an amplifying zigzag pattern of numbers up to a given p(...TRUNCATED) | ["<think>\nOkay, I need to write a program or function that generates this amplifying zigzag pattern(...TRUNCATED) | ["<think>\nOkay, I need to write a program that takes a positive integer N and outputs the first N n(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So, the goal is to generate this amplifying zigzag patter(...TRUNCATED) | [{"from":"human","value":"Write a program or function that takes in a positive integer N and outputs(...TRUNCATED) |
null | "Asked on Stack Overflow, but they suggested to move it here\nA while ago I was reading about quines(...TRUNCATED) | null | null | null | null | null | 9 | null | null | stackexchange_codegolf | "The problem requires an extensive understanding of C macros, particularly the preprocessor and how (...TRUNCATED) | 7,882 | 492 | ["Okay, so the user is asking if it's possible to write a quine in C using only macros, without any (...TRUNCATED) | ["To address the challenge of creating a quine in C using macros, we must navigate the limitations o(...TRUNCATED) | ["<think>\nOkay, so the user is asking if it's possible to write a quine in C using only macros, wit(...TRUNCATED) | ["<think>\nOkay, so I want to create a quine in C where most of the code is in macros, right? The us(...TRUNCATED) | "<think>\nOkay, so the user wants to create a quine in C using only macros, without any functions li(...TRUNCATED) | [{"from":"human","value":"Asked on Stack Overflow, but they suggested to move it here\nA while ago I(...TRUNCATED) |
null | "A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits ever(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The knight's tour problem requires advanced algorithmic knowledge, including backtracking and possi(...TRUNCATED) | 4,144 | 259 | ["Okay, I need to write a program that generates a knight's tour for a given n (n > 4). Hmm, the kni(...TRUNCATED) | ["To solve this problem, we need to generate a valid knight's tour on an \\( n \\times n \\) chessbo(...TRUNCATED) | ["<think>\nOkay, I need to write a program that generates a knight's tour for a given n (n > 4). Hmm(...TRUNCATED) | ["<think>\nOkay, I need to write a Python program that generates a knight's tour for a given n where(...TRUNCATED) | "<think>\nOkay, I need to write a program that generates a knight's tour for a given n x n chessboar(...TRUNCATED) | [{"from":"human","value":"A knight's tour is a sequence of moves of a knight on a chessboard such th(...TRUNCATED) |
null | "PROBLEM\nFor a list of numbers, list: Find the lowest possible integer, x, which is optimally close(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem requires a deep understanding of mathematical concepts such as even-harmonics and cumul(...TRUNCATED) | 32,950 | 2,059 | ["Okay, let's try to figure out how to solve this problem. So, the task is to find the lowest intege(...TRUNCATED) | ["To solve this problem, we need to find the lowest integer value \\( x \\) between 20 and 100 that (...TRUNCATED) | ["<think>\nOkay, let's try to figure out how to solve this problem. So, the task is to find the lowe(...TRUNCATED) | ["<think>\nOkay, let's try to figure out how to solve this problem. So, the task is to find the lowe(...TRUNCATED) | "<think>\nOkay, let's see. I need to find the lowest integer x between 20 and 100 that minimizes the(...TRUNCATED) | [{"from":"human","value":"PROBLEM\nFor a list of numbers, list: Find the lowest possible integer, x,(...TRUNCATED) |
null | "Background\nA Ruth-Aaron pair is a pair of consecutive positive integers n and n+1 such that the su(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "The problem involves generating Ruth-Aaron pairs which requires understanding of prime factorizatio(...TRUNCATED) | 62,378 | 3,898 | ["Okay, I need to find the nth Aaron number, which is the larger number in the nth Ruth-Aaron pair. (...TRUNCATED) | ["To solve this problem, we need to find the nth Aaron number, which is the larger number in the nth(...TRUNCATED) | ["<think>\nOkay, I need to find the nth Aaron number, which is the larger number in the nth Ruth-Aar(...TRUNCATED) | ["<think>\nOkay, I need to find the nth Aaron number, which is the larger number in the nth Ruth-Aar(...TRUNCATED) | "<think>\nOkay, I need to find the nth Aaron number, which is the larger number in the nth Ruth-Aaro(...TRUNCATED) | [{"from":"human","value":"Background\nA Ruth-Aaron pair is a pair of consecutive positive integers n(...TRUNCATED) |
null | "Given a double-precision float, find the closest double-precision float whose binary representation(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem requires deep mathematical insights into the IEEE 754 binary64 double-precision float (...TRUNCATED) | 39,508 | 2,469 | ["Okay, I need to solve this problem where I have to find the closest double-precision float to a gi(...TRUNCATED) | ["To solve this problem, we need to find the closest double-precision floating-point number to a giv(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to find the closest double-precision floa(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to find the closest double-precision floa(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the task is to find the closest double-precision flo(...TRUNCATED) | [{"from":"human","value":"Given a double-precision float, find the closest double-precision float wh(...TRUNCATED) |
null | "Task\nYou will be given a positive integer and you must output a \"self-complementary graph\" with (...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "The problem requires understanding of advanced graph theory concepts, specifically the definition a(...TRUNCATED) | 9,365 | 585 | ["Okay, I need to find a way to generate a self-complementary graph for a given number of nodes n. L(...TRUNCATED) | ["To solve this problem, we need to generate a self-complementary graph for a given number of nodes (...TRUNCATED) | ["<think>\nOkay, I need to find a way to generate a self-complementary graph for a given number of n(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to output a self-complementary graph give(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to output a self-complementary graph with (...TRUNCATED) | [{"from":"human","value":"Task\nYou will be given a positive integer and you must output a \"self-co(...TRUNCATED) |
null | "Your task, at the moment that you choose to accept it, is to write a program that, when given a str(...TRUNCATED) | null | null | null | null | null | 9 | null | null | stackexchange_codegolf | "This problem involves calculating the minimum Levenshtein distance between a string and potential m(...TRUNCATED) | 3,373 | 210 | ["Okay, I need to write a Python program that takes a string and a regex, and finds the minimum Leve(...TRUNCATED) | ["To solve this problem, we need to find the minimum Levenshtein distance between a given string and(...TRUNCATED) | ["<think>\nOkay, I need to write a Python program that takes a string and a regex, and finds the min(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to find the minimum Levenshtein distance (...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the minimum Levenshtein distance b(...TRUNCATED) | [{"from":"human","value":"Your task, at the moment that you choose to accept it, is to write a progr(...TRUNCATED) |
37d42183dd5ddb3695f64d0972def46c | "Luyi has n circles on the plane. The i-th circle is centered at (xi, yi). At the time zero circles (...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the latest time when the last hole(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import math\n\nn = int(input())\npoints = [tuple(map(int, input().split())) for _ in range(n)]\n\ni(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem involves geometric considerations of growing circles and the identification of regions(...TRUNCATED) | 48,877 | 3,054 | ["Okay, let's try to solve this problem. So, the task is to find the latest time when there's still (...TRUNCATED) | ["To solve this problem, we need to determine the moment when the last hole disappears as circles gr(...TRUNCATED) | ["<think>\nOkay, let's try to solve this problem. So, the task is to find the latest time when there(...TRUNCATED) | ["<think>\nOkay, let's try to solve this problem. So, the task is to find the latest time when there(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding the time when the last hole disappears when (...TRUNCATED) | [{"from":"human","value":"Luyi has n circles on the plane. The i-th circle is centered at (xi, yi). (...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6