instruction_seed stringlengths 117 52.7k | _source stringclasses 2
values | gpt41_mini_response stringlengths 5.99k 74.4k | __original_row_idx int64 2 31.6k | length int64 5.99k 74.4k | id stringlengths 32 32 ⌀ | output stringlengths 3.75k 77.6k ⌀ | source stringclasses 5
values | license stringclasses 2
values | dataset stringclasses 2
values | split stringclasses 3
values | difficulty stringclasses 25
values | solution stringlengths 24 17.9k ⌀ | reasoning stringlengths 133 127k | deepseek_solution stringlengths 0 47.9k | final_reasoning_trace stringlengths 5.63k 129k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"\nCONGRATULATIONS to @kuroineko for the best entry and winning the 200 bounty from @TheBestOne (exc(...TRUNCATED) | stackexchange_codegolf | "Thanks for the detailed explanation of the Image Battle challenge and the included judge and refere(...TRUNCATED) | 18,260 | 6,620 | null | null | null | null | null | null | null | null | "Okay, I need to create a program that can color as much of an image as possible before other progra(...TRUNCATED) | "To solve this problem, we need to create a program that efficiently colors as much of an image as p(...TRUNCATED) | "<think>\nOkay, I need to create a program that can color as much of an image as possible before oth(...TRUNCATED) | [{"from":"human","value":"\nCONGRATULATIONS to @kuroineko for the best entry and winning the 200 bou(...TRUNCATED) |
"You are given a table a of size 2 × n (i.e. two rows and n columns) consisting of integers from 1 (...TRUNCATED) | nvidia/OpenCodeReasoning | "Let's understand the problem carefully and then discuss the approach and solution.\n\n---\n\n**Prob(...TRUNCATED) | 6,104 | 16,416 | 3702ab18de9df4862fff61f2f8edd735 | "<think>\nOkay, so I need to solve this programming problem. Let's read the problem carefully.\n\nTh(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 13 | "import sys\nfrom collections import defaultdict\n\nclass DSU:\n def __init__(self, size):\n (...TRUNCATED) | "Okay, let's tackle this problem. Hmm. So the problem is about a 2xN table where each column can be (...TRUNCATED) | "To solve this problem, we need to determine the minimum number of column swaps required to transfor(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm. So the problem is about a 2xN table where each colum(...TRUNCATED) | [{"from":"human","value":"You are given a table a of size 2 × n (i.e. two rows and n columns) consi(...TRUNCATED) |
"Jeff got 2n real numbers a1, a2, ..., a2n as a birthday present. The boy hates non-integer numbers,(...TRUNCATED) | nvidia/OpenCodeReasoning | "Let's carefully analyze the problem and then provide a solution.\n\n---\n\n### Problem Restatement\(...TRUNCATED) | 31,238 | 18,464 | 2ca1397b270568476561697b155dc8d3 | "<think>\nOkay, let's see. I need to solve this programming problem. The problem is about Jeff perfo(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | competition | "n = int(input())\nnum_strings = input().split()\n\nsum_f = 0.0\nm = 0\n\nfor s in num_strings:\n (...TRUNCATED) | "Okay, let's tackle this problem. Hmm, so Jeff has 2n real numbers, and he's doing n operations. Eac(...TRUNCATED) | "To solve this problem, we need to minimize the absolute difference between the sum of the original (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, so Jeff has 2n real numbers, and he's doing n operat(...TRUNCATED) | [{"from":"human","value":"Jeff got 2n real numbers a1, a2, ..., a2n as a birthday present. The boy h(...TRUNCATED) |
"You may or may not remember Xeyes, a demo program that came with (and, as far as I know, still come(...TRUNCATED) | stackexchange_codegolf | "Here's a concise Python solution using the `curses` library for ASCII terminal control and `mousema(...TRUNCATED) | 28,655 | 6,363 | null | null | null | null | null | null | null | null | "Okay, let's tackle this problem step by step. The goal is to create an ASCII art version of Xeyes w(...TRUNCATED) | "To solve this problem, we need to create an ASCII art representation of eyes that follow the mouse (...TRUNCATED) | "<think>\nOkay, let's tackle this problem step by step. The goal is to create an ASCII art version o(...TRUNCATED) | [{"from":"human","value":"You may or may not remember Xeyes, a demo program that came with (and, as (...TRUNCATED) |
"The Hexadecimal virus loves playing with number sets — intersecting them, uniting them. One beaut(...TRUNCATED) | nvidia/OpenCodeReasoning | "Let's analyze the problem carefully:\n\n---\n### Problem Restatement:\n\nYou have **n** sets of num(...TRUNCATED) | 30,411 | 16,038 | 7e61b46c626717625fe0b9b0b86244a4 | "<think>\nOkay, let's see. The problem is about selecting a collection of sets such that the number (...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | VERY_HARD | "import sys\nfrom collections import deque\n\nclass Edge:\n def __init__(self, to, rev, capacity,(...TRUNCATED) | "Okay, so I need to solve this programming problem. Let's read through the problem carefully.\n\nThe(...TRUNCATED) | "To solve this problem, we need to find the minimum cost of a collection of sets such that the numbe(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let's read through the problem carefull(...TRUNCATED) | [{"from":"human","value":"The Hexadecimal virus loves playing with number sets — intersecting them(...TRUNCATED) |
"Explanation\nBefunge is a two-dimensional program that uses stacks.\nThat means, to do 5 + 6, you w(...TRUNCATED) | stackexchange_codegolf | "Below is a Python 3 solution that, given an integer `n`, finds the shortest Befunge stack expressio(...TRUNCATED) | 7,648 | 7,259 | null | null | null | null | null | null | null | null | "Okay, I need to solve this Befunge number generation problem. Let's start by understanding the prob(...TRUNCATED) | "To solve this problem, we need to generate the shortest possible Befunge-style code for each number(...TRUNCATED) | "<think>\nOkay, I need to solve this Befunge number generation problem. Let's start by understanding(...TRUNCATED) | [{"from":"human","value":"Explanation\nBefunge is a two-dimensional program that uses stacks.\nThat (...TRUNCATED) |
"Choose a language and write a program in the language that:\n\nTake a valid program of the language(...TRUNCATED) | stackexchange_codegolf | "Let's carefully parse the problem, then design a solution with reasoning.\n\n---\n\n### **Problem r(...TRUNCATED) | 11,194 | 7,035 | null | null | null | null | null | null | null | null | "Okay, let's see. I need to write a program that takes another valid program in the same language as(...TRUNCATED) | "To solve this problem, we need to create a program that takes a valid program in the same language (...TRUNCATED) | "<think>\nOkay, let's see. I need to write a program that takes another valid program in the same la(...TRUNCATED) | [{"from":"human","value":"Choose a language and write a program in the language that:\n\nTake a vali(...TRUNCATED) |
"Bananistan is a beautiful banana republic. Beautiful women in beautiful dresses. Beautiful statues (...TRUNCATED) | nvidia/OpenCodeReasoning | "Let's analyze the problem carefully and then proceed with the solution.\n\n---\n\n### Problem Resta(...TRUNCATED) | 25,551 | 23,014 | a4ea266f93700bbe82607c626293dec0 | "<think>\nOkay, I need to solve this problem. Let's read it carefully.\n\nThe problem is about minim(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | HARD | "n, x = map(int, input().split())\nintervals = [tuple(map(int, input().split())) for _ in range(n)]\(...TRUNCATED) | "Okay, let's see. I need to solve this problem where I have to find the minimal total cost for movin(...TRUNCATED) | "To solve this problem, we need to minimize the total cost incurred by moving between positions and (...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where I have to find the minimal total cost (...TRUNCATED) | [{"from":"human","value":"Bananistan is a beautiful banana republic. Beautiful women in beautiful dr(...TRUNCATED) |
"Camel Up Cup 2k18\nIn this challenge, we will be playing the semi-popular board game Camel Up.\nCam(...TRUNCATED) | stackexchange_codegolf | "The Camel Up Cup 2k18 challenge requires writing a Python bot that can play the Camel Up! board gam(...TRUNCATED) | 23,436 | 9,519 | null | null | null | null | null | null | null | null | "Okay, I need to create a Python bot for the Camel Up game. Let's start by understanding the rules a(...TRUNCATED) | "To solve this problem, we need to create a Python bot that plays the Camel Up board game effectivel(...TRUNCATED) | "<think>\nOkay, I need to create a Python bot for the Camel Up game. Let's start by understanding th(...TRUNCATED) | [{"from":"human","value":"Camel Up Cup 2k18\nIn this challenge, we will be playing the semi-popular (...TRUNCATED) |
"This time Panda is doing great. He is good with mathematical problems. His teacher decided to puzzl(...TRUNCATED) | nvidia/OpenCodeReasoning | "Let's analyze the problem carefully:\n\n---\n\n### Problem Restatement:\n\nYou have an array `arr` (...TRUNCATED) | 26,479 | 16,863 | 7a1e634bcee34960acbb092e197cd6b6 | "<think>\nOkay, let's tackle this problem. So the task is to find the maximum possible value of C, w(...TRUNCATED) | hackerearth | cc-by-4.0 | code_contests | train | MEDIUM | "MOD = 10**9 + 7\n\ndef main():\n import sys\n input = sys.stdin.read().split()\n idx = 0\n(...TRUNCATED) | "Okay, let's try to figure out this problem. So the problem is about maximizing some value C, which (...TRUNCATED) | "To solve this problem, we need to maximize the value of C, which is derived from the sum of B_i mul(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So the problem is about maximizing some value (...TRUNCATED) | [{"from":"human","value":"This time Panda is doing great. He is good with mathematical problems. His(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4