instruction_seed stringlengths 36 36.9k | _source stringclasses 2
values | _fasttext_score float64 0.56 0.99 | id stringclasses 359
values | output stringlengths 948 70.9k ⌀ | source stringclasses 5
values | license stringclasses 2
values | dataset stringclasses 2
values | split stringclasses 3
values | difficulty stringclasses 20
values | solution stringlengths 8 10.5k ⌀ | reasoning stringlengths 702 113k | deepseek_solution stringlengths 5 31.9k | __original_row_idx int64 0 31.6k | final_reasoning_trace stringlengths 1.84k 119k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"Bearland is a dangerous place. Limak can’t travel on foot. Instead, he has k magic teleportation (...TRUNCATED) | nvidia/OpenCodeReasoning | 0.686918 | 05bc965b28c649228575db17851baf06 | "<think>\nOkay, let's tackle this problem. Hmm, so the goal is to determine how many monsters are \"(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | VERY_HARD | "k, n = map(int, input().split())\nstones = [tuple(map(int, input().split())) for _ in range(k)]\nmo(...TRUNCATED) | "Okay, let's try to figure out this problem. So, the problem is about Limak using teleport stones to(...TRUNCATED) | "To solve this problem, we need to determine how many monsters can be hit by Limak using his telepor(...TRUNCATED) | 23,590 | "<think>\nOkay, let's try to figure out this problem. So, the problem is about Limak using teleport (...TRUNCATED) | [{"from":"human","value":"Bearland is a dangerous place. Limak can’t travel on foot. Instead, he h(...TRUNCATED) |
"There are n cities located along the one-way road. Cities are numbered from 1 to n in the direction(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.752763 | 38363d4af6dfb0b469409cbb25518afe | "<think>\nOkay, let's tackle this problem. Hmm. So, the task is to maximize the total goods sold in (...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | VERY_HARD | "import bisect\n\nn, c = map(int, input().split())\np = list(map(int, input().split()))\ns = list(ma(...TRUNCATED) | "Okay, let's try to figure out this problem. So, the problem is about transporting goods between cit(...TRUNCATED) | "To solve this problem, we need to maximize the total number of goods sold in cities by transporting(...TRUNCATED) | 20,033 | "<think>\nOkay, let's try to figure out this problem. So, the problem is about transporting goods be(...TRUNCATED) | [{"from":"human","value":"There are n cities located along the one-way road. Cities are numbered fro(...TRUNCATED) |
"Task\nTake in 3 inputs. The length of the wall, the height of the wall and the coverage of the pain(...TRUNCATED) | stackexchange_codegolf | 0.62405 | null | null | null | null | null | null | null | null | "Okay, let's see. The problem is to calculate the number of paint tins needed based on the length, h(...TRUNCATED) | "To solve this problem, we need to determine the number of paint tins required to paint a wall given(...TRUNCATED) | 27,456 | "<think>\nOkay, let's see. The problem is to calculate the number of paint tins needed based on the (...TRUNCATED) | [{"from":"human","value":"Task\nTake in 3 inputs. The length of the wall, the height of the wall and(...TRUNCATED) |
"++++++++[>+>++>+++>++++>+++++>++++++>+++++++>++++++++>+++++++++>++++++++++>+\n\t++++++++++>++++++++(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.684506 | 8fc7e0718d59aa789865eed74f3d51ae | "<think>\nOkay, let's try to figure out this problem. The user gave a Python programming problem whe(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 10 | "s = input().strip()\ncount = 0\nfor c in s:\n if c == '0':\n count += 1\n elif c == '6(...TRUNCATED) | "Okay, let's see. I need to solve this programming problem. The input is an integer a between 0 and (...TRUNCATED) | "To solve this problem, we need to determine the correct output for a given integer input. The solut(...TRUNCATED) | 10,669 | "<think>\nOkay, let's see. I need to solve this programming problem. The input is an integer a betwe(...TRUNCATED) | [{"from":"human","value":"++++++++[>+>++>+++>++++>+++++>++++++>+++++++>++++++++>+++++++++>++++++++++(...TRUNCATED) |
"Bearland is a dangerous place. Limak can’t travel on foot. Instead, he has k magic teleportation (...TRUNCATED) | nvidia/OpenCodeReasoning | 0.686918 | 05bc965b28c649228575db17851baf06 | "<think>\nOkay, let's tackle this programming problem. Hmm, the problem is about determining how man(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | VERY_HARD | "k, n = map(int, input().split())\nstones = [tuple(map(int, input().split())) for _ in range(k)]\nmo(...TRUNCATED) | "Okay, I need to solve this programming problem. Let's read the problem statement carefully.\n\nSo, (...TRUNCATED) | "To solve this problem, we need to determine how many monsters in Bearland should be afraid of Limak(...TRUNCATED) | 3,203 | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | [{"from":"human","value":"Bearland is a dangerous place. Limak can’t travel on foot. Instead, he h(...TRUNCATED) |
"Given integer n, find length of n! (which is factorial of n) excluding trailing zeros.\nInput\n\nTh(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.687856 | de47c1c93cc1e523f60b041935e6890f | "<think>\nOkay, let's see. The problem is to find the length of n! without the trailing zeros. Hmm. (...TRUNCATED) | hackerearth | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "import math\n\nt = int(input())\nfor _ in range(t):\n n = int(input())\n if n == 0:\n (...TRUNCATED) | "Okay, I need to solve this problem where for each given n, I have to find the length of n! (the fac(...TRUNCATED) | "To solve this problem, we need to determine the number of digits in the factorial of a given intege(...TRUNCATED) | 16,862 | "<think>\nOkay, I need to solve this problem where for each given n, I have to find the length of n!(...TRUNCATED) | [{"from":"human","value":"Given integer n, find length of n! (which is factorial of n) excluding tra(...TRUNCATED) |
"You are given two arithmetic progressions: a1k + b1 and a2l + b2. Find the number of integers x suc(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.703289 | 64f4af6cd03fbea27ee4bd0d97ca5862 | "<think>\nOkay, let's tackle this problem. So, the task is to find the number of integers x between (...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | interview | "def extended_gcd(a, b):\n if b == 0:\n return (a, 1, 0)\n else:\n g, x, y = ext(...TRUNCATED) | "Okay, let's try to solve this problem. Hmm, the problem says we have two arithmetic progressions, a(...TRUNCATED) | "To solve this problem, we need to determine the number of integers \\( x \\) that lie within the ra(...TRUNCATED) | 8,702 | "<think>\nOkay, let's try to solve this problem. Hmm, the problem says we have two arithmetic progre(...TRUNCATED) | [{"from":"human","value":"You are given two arithmetic progressions: a1k + b1 and a2l + b2. Find the(...TRUNCATED) |
"This challenge is completely ripped offheavily inspired by All Light, developed by Soulgit Games.\n(...TRUNCATED) | stackexchange_codegolf | 0.668956 | null | null | null | null | null | null | null | null | "Okay, so I need to solve this problem where I have to connect all the lights to the battery in a gr(...TRUNCATED) | "To solve this problem, we need to connect all the lights to the battery in a grid such that each li(...TRUNCATED) | 22,412 | "<think>\nOkay, so I need to solve this problem where I have to connect all the lights to the batter(...TRUNCATED) | [{"from":"human","value":"This challenge is completely ripped offheavily inspired by All Light, deve(...TRUNCATED) |
"SPECIFICATION\nGiven m variables, create every combination up to order n. For example, \nThe output(...TRUNCATED) | stackexchange_codegolf | 0.566712 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where given m variables and an order n, I have to generate all p(...TRUNCATED) | "To solve this problem, we need to generate all possible combinations of variables up to a specified(...TRUNCATED) | 3,405 | "<think>\nOkay, I need to solve this problem where given m variables and an order n, I have to gener(...TRUNCATED) | [{"from":"human","value":"SPECIFICATION\nGiven m variables, create every combination up to order n. (...TRUNCATED) |
"You have two strings a and b of equal even length n consisting of characters 0 and 1.\n\nWe're in t(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.699621 | e8942e04c5e2720ad6f5af76a2fef068 | "<think>\nOkay, I need to solve this problem where I have to make two binary strings a and b equal b(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | VERY_HARD | "def solve():\n import sys\n input = sys.stdin.read().split()\n idx = 0\n t = int(input[(...TRUNCATED) | "Okay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo the problem(...TRUNCATED) | "To solve this problem, we need to transform string `a` into string `b` using a series of prefix rev(...TRUNCATED) | 3,102 | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo th(...TRUNCATED) | [{"from":"human","value":"You have two strings a and b of equal even length n consisting of characte(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 7