instruction_seed stringlengths 158 53.1k | _source stringclasses 2
values | gpt4o_mini_response stringlengths 2.86k 29.3k | __original_row_idx int64 3 31.6k | length int64 2.86k 29.3k | id stringlengths 32 32 ⌀ | output stringlengths 3.65k 104k ⌀ | source stringclasses 5
values | license stringclasses 2
values | dataset stringclasses 2
values | split stringclasses 3
values | difficulty stringclasses 22
values | solution stringlengths 106 17.9k ⌀ | reasoning stringlengths 2.6k 115k | deepseek_solution stringlengths 84 22.3k | final_reasoning_trace stringlengths 3.48k 122k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"Tokyo has a very complex railway system. For example, there exists a partial map of lines and stati(...TRUNCATED) | nvidia/OpenCodeReasoning | "To solve the problem of finding the minimum fare to travel from a starting station to a goal statio(...TRUNCATED) | 7,042 | 5,022 | 8259715bc4ded88c332b4a4ce704f703 | "<think>\nOkay, let's tackle this problem. Hmm, the problem is about finding the minimum fare path b(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "import heapq\n\ndef calculate_fare(company, distance, companies):\n if company == 0:\n re(...TRUNCATED) | "Okay, I need to solve this programming problem. Let's read the problem carefully and understand wha(...TRUNCATED) | "To solve this problem, we need to find the path between two stations in a railway network that mini(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully and under(...TRUNCATED) | [{"from":"human","value":"Tokyo has a very complex railway system. For example, there exists a parti(...TRUNCATED) |
"A ski base is planned to be built in Walrusland. Recently, however, the project is still in the con(...TRUNCATED) | nvidia/OpenCodeReasoning | "To solve the problem of determining the number of different ski bases that can be formed as roads a(...TRUNCATED) | 31,039 | 4,663 | a884c386fcd22037b06404d1c50b8d5f | "<think>\nOkay, let's try to figure out this problem. The task is to compute, after each road is add(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | HARD | "MOD = 10**9 + 9\n\nn, m = map(int, input().split())\n\n# Precompute powers of 2 modulo MOD\npow2 = (...TRUNCATED) | "Okay, let's see. The problem is about building roads one by one and after each step, calculating th(...TRUNCATED) | "To solve this problem, we need to determine the number of valid ski bases after each road is built.(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about building roads one by one and after each step, calcu(...TRUNCATED) | [{"from":"human","value":"A ski base is planned to be built in Walrusland. Recently, however, the pr(...TRUNCATED) |
"\"Multidimensional spaces are completely out of style these days, unlike genetics problems\" — th(...TRUNCATED) | nvidia/OpenCodeReasoning | "To solve the problem of counting DNA sequences of given length \\( n \\) that can be filtered by a (...TRUNCATED) | 20,742 | 5,357 | 7d986a382cb9b790b35a7d4344aa917a | "<think>\nOkay, let's see. The problem is to find the number of DNA sequences of length n that are c(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | VERY_HARD | "MOD = 10**9 + 9\n\nn, m = map(int, input().split())\nstrings = [input().strip() for _ in range(m)]\(...TRUNCATED) | "Okay, so I need to solve this problem where I have to find the number of DNA sequences of length n (...TRUNCATED) | "To solve this problem, we need to count the number of valid DNA sequences of length `n` such that e(...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to find the number of DNA sequences of (...TRUNCATED) | [{"from":"human","value":"\"Multidimensional spaces are completely out of style these days, unlike g(...TRUNCATED) |
"Baldman is a warp master. He possesses a unique ability — creating wormholes! Given two positions(...TRUNCATED) | nvidia/OpenCodeReasoning | "To solve this problem, we are dealing with an undirected graph representing the military base consi(...TRUNCATED) | 28,460 | 5,000 | 91179565be101552ab747c13c39b0420 | "<think>\nOkay, let's tackle this problem. Hmm, the problem statement is a bit complex. Let me read (...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | VERY_HARD | "import sys\nfrom collections import defaultdict\n\ndef main():\n sys.setrecursionlimit(1 << 25)\(...TRUNCATED) | "Okay, let's tackle this programming problem. Hmm, the problem statement is a bit complex, so I need(...TRUNCATED) | "To solve this problem, we need to determine the minimum cost of creating a system of wormholes such(...TRUNCATED) | "<think>\nOkay, let's tackle this programming problem. Hmm, the problem statement is a bit complex, (...TRUNCATED) | [{"from":"human","value":"Baldman is a warp master. He possesses a unique ability — creating wormh(...TRUNCATED) |
"You are given a string of terrain, with molehills and mountains:\n /\\\n (...TRUNCATED) | stackexchange_codegolf | "Here's a solution in Python that replaces molehills with mountain equivalents, keeping the original(...TRUNCATED) | 25,477 | 2,945 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where I have to replace all molehills in a given terrain string (...TRUNCATED) | "To solve this problem, we need to identify molehills in a given terrain string and replace each mol(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to replace all molehills in a given terrai(...TRUNCATED) | [{"from":"human","value":"You are given a string of terrain, with molehills and mountains:\n (...TRUNCATED) |
"Given a grid of directions and a start and end position, determine the minimum number of substituti(...TRUNCATED) | stackexchange_codegolf | "Here's a solution to the problem described. The implementation uses the breadth-first search (BFS) (...TRUNCATED) | 7,183 | 3,038 | null | null | null | null | null | null | null | null | "Okay, let's try to tackle this problem. So, the task is to find the minimum number of substitutions(...TRUNCATED) | "To solve this problem, we need to determine the minimum number of substitutions required in a grid (...TRUNCATED) | "<think>\nOkay, let's try to tackle this problem. So, the task is to find the minimum number of subs(...TRUNCATED) | [{"from":"human","value":"Given a grid of directions and a start and end position, determine the min(...TRUNCATED) |
"Test Driver • Challenge Discussion • Submit Adventurer\n\n(Image Source)\nSeveral rival adventu(...TRUNCATED) | stackexchange_codegolf | "# GoldDigger\nThis bot is designed to maximize treasures while managing stamina efficiently. It pri(...TRUNCATED) | 1,072 | 3,872 | null | null | null | null | null | null | null | null | "Okay, so I need to create a bot for this adventurer game. Let me think about how to approach this.\(...TRUNCATED) | "# BountyHunter\n\n import math\n\n class BountyHunter(Adventurer):\n def __init__(self(...TRUNCATED) | "<think>\nOkay, so I need to create a bot for this adventurer game. Let me think about how to approa(...TRUNCATED) | [{"from":"human","value":"Test Driver • Challenge Discussion • Submit Adventurer\n\n(Image Sourc(...TRUNCATED) |
"Your job is to write a program that takes a number N as input and outputs all 2-by-N mazes that are(...TRUNCATED) | stackexchange_codegolf | "To solve the problem of generating 2-by-N mazes that are solvable with a path from the left end to (...TRUNCATED) | 14,849 | 3,128 | null | null | null | null | null | null | null | null | "Okay, I need to write a program that generates all possible 2xN mazes that are solvable. The input (...TRUNCATED) | "To solve this problem, we need to generate all possible 2-by-N mazes that are solvable. A maze is s(...TRUNCATED) | "<think>\nOkay, I need to write a program that generates all possible 2xN mazes that are solvable. T(...TRUNCATED) | [{"from":"human","value":"Your job is to write a program that takes a number N as input and outputs (...TRUNCATED) |
"Make a wish to a shooting star\n\nThe mysterious organization JAG (Japanese Alumni Group) holds reg(...TRUNCATED) | nvidia/OpenCodeReasoning | "To solve the problem of determining when each shooting star disappears, we follow a systematic appr(...TRUNCATED) | 28,089 | 5,132 | 0fa5f1c620911a63b75405eb999db151 | "<think>\nOkay, let's tackle this problem. Hmm. So, the problem is about shooting stars that move an(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "import heapq\nimport math\n\ndef solve():\n while True:\n n = int(input())\n if n (...TRUNCATED) | "Okay, let's try to figure out how to solve this problem. Hmm, the problem is about shooting stars t(...TRUNCATED) | "To solve this problem, we need to determine the time at which each shooting star disappears, either(...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. Hmm, the problem is about shootin(...TRUNCATED) | [{"from":"human","value":"Make a wish to a shooting star\n\nThe mysterious organization JAG (Japanes(...TRUNCATED) |
"Inspired by There, I fixed it (with rope), There, I fixed it (with Tape), There, I broke it (with s(...TRUNCATED) | stackexchange_codegolf | "Here’s a Python solution to the given challenge that implements the described rules for string tr(...TRUNCATED) | 24,492 | 3,349 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem. Let's read the challenge carefully.\n\nThe task is to process a(...TRUNCATED) | "To solve this problem, we need to transform a given string by identifying missing letters between c(...TRUNCATED) | "<think>\nOkay, I need to solve this problem. Let's read the challenge carefully.\n\nThe task is to (...TRUNCATED) | [{"from":"human","value":"Inspired by There, I fixed it (with rope), There, I fixed it (with Tape), (...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4