instruction_seed stringlengths 28 25.6k | _source stringclasses 2
values | _fasttext_score float64 1 1 | id stringclasses 351
values | output stringlengths 827 71.8k ⌀ | source stringclasses 5
values | license stringclasses 2
values | dataset stringclasses 2
values | split stringclasses 3
values | difficulty stringclasses 21
values | solution stringlengths 15 7.75k ⌀ | reasoning stringlengths 883 110k | deepseek_solution stringlengths 0 12.6k | __original_row_idx int64 27 31.6k | final_reasoning_trace stringlengths 1.96k 115k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"The Euclidean algorithm is a widely known algorithm for calculating the greatest common divisor (GC(...TRUNCATED) | stackexchange_codegolf | 0.999988 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where I have to simulate the Euclidean algorithm's steps visuall(...TRUNCATED) | "To solve this problem, we need to simulate the Euclidean algorithm for calculating the greatest com(...TRUNCATED) | 23,530 | "<think>\nOkay, I need to solve this problem where I have to simulate the Euclidean algorithm's step(...TRUNCATED) | [{"from":"human","value":"The Euclidean algorithm is a widely known algorithm for calculating the gr(...TRUNCATED) |
"You are given an array a consisting of n integer numbers.\n\nLet instability of the array be the fo(...TRUNCATED) | nvidia/OpenCodeReasoning | 1.000005 | d50a2a5239d12bcbc12c46e17fa9f414 | "<think>\nOkay, let's see. The problem is to find the minimum possible instability after removing ex(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "n = int(input())\na = list(map(int, input().split()))\na.sort()\nc1 = a[-2] - a[0]\nc2 = a[-1] - a[(...TRUNCATED) | "Okay, so I need to solve this programming problem where I have to find the minimum possible instabi(...TRUNCATED) | "To solve this problem, we need to minimize the instability of an array after removing exactly one e(...TRUNCATED) | 17,373 | "<think>\nOkay, so I need to solve this programming problem where I have to find the minimum possibl(...TRUNCATED) | [{"from":"human","value":"You are given an array a consisting of n integer numbers.\n\nLet instabili(...TRUNCATED) |
"Yuki made a sugoroku so that everyone can play at the children's association event. In this sugorok(...TRUNCATED) | nvidia/OpenCodeReasoning | 1.000006 | e0bd80845b074c5760bc65dad6cfa9d4 | "<think>\nOkay, I need to solve this problem where I have to find the number of squares in a sugorok(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "n = int(input())\na = list(map(int, input().split()))\nnext_node = [(i + a[i]) % n for i in range(n(...TRUNCATED) | "Okay, let's try to solve this problem. So, the task is to find out how many squares in the sugoroku(...TRUNCATED) | "To solve this problem, we need to determine the number of squares in a sugoroku game where starting(...TRUNCATED) | 12,304 | "<think>\nOkay, let's try to solve this problem. So, the task is to find out how many squares in the(...TRUNCATED) | [{"from":"human","value":"Yuki made a sugoroku so that everyone can play at the children's associati(...TRUNCATED) |
"You are given a tree with n nodes, numerated from 0 to n-1. For each k between 0 and n, inclusive, (...TRUNCATED) | nvidia/OpenCodeReasoning | 1.000005 | 911151c2412ec0047e6eef041941cd32 | "<think>\nOkay, I have to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | VERY_HARD | "import sys\nfrom sys import stdin\nfrom collections import defaultdict, deque\n\ndef main():\n s(...TRUNCATED) | "Okay, let's tackle this problem. Hmm, the task is to compute for each k from 0 to n, the number of (...TRUNCATED) | "To solve this problem, we need to determine the number of unordered pairs (u, v) such that the MEX (...TRUNCATED) | 16,069 | "<think>\nOkay, let's tackle this problem. Hmm, the task is to compute for each k from 0 to n, the n(...TRUNCATED) | [{"from":"human","value":"You are given a tree with n nodes, numerated from 0 to n-1. For each k bet(...TRUNCATED) |
"Example\nInput\n\n0 3 1 7 5 9 8 6 4 2\n7 0 9 2 1 5 4 8 6 3\n4 2 0 6 8 7 1 3 5 9\n1 7 5 0 9 8 3 4 2 (...TRUNCATED) | nvidia/OpenCodeReasoning | 1.000006 | df937f5815b70be506abde838728acc5 | "<think>\nOkay, so I need to solve this problem where I'm given a 10x10 matrix, and I have to find s(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "# Read the 10x10 matrix from input\nmatrix = [list(map(int, input().split())) for _ in range(10)]\n(...TRUNCATED) | "Okay, let's see. I need to figure out the output for this given input matrix. The example input is (...TRUNCATED) | 0 | 23,407 | "<think>\nOkay, let's see. I need to figure out the output for this given input matrix. The example (...TRUNCATED) | [{"from":"human","value":"Example\nInput\n\n0 3 1 7 5 9 8 6 4 2\n7 0 9 2 1 5 4 8 6 3\n4 2 0 6 8 7 1 (...TRUNCATED) |
"Alice and Brown are brothers in a family and each receives pocket money in celebration of the comin(...TRUNCATED) | nvidia/OpenCodeReasoning | 1.000004 | 41c1672ec804e3fdb02b921982668464 | "<think>\nOkay, let's see. The problem is to calculate the amount of money each of Alice and Brown r(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | a, b = map(int, input().split())
print((a + b) // 2) | "Okay, let's see. The problem is about Alice and Brown sharing their pocket money equally. The input(...TRUNCATED) | "To solve this problem, we need to determine the equal share of pocket money that Alice and Brown re(...TRUNCATED) | 18,941 | "<think>\nOkay, let's see. The problem is about Alice and Brown sharing their pocket money equally. (...TRUNCATED) | [{"from":"human","value":"Alice and Brown are brothers in a family and each receives pocket money in(...TRUNCATED) |
"You are given a permutation p_1, p_2, …, p_n.\n\nIn one move you can swap two adjacent values.\n\(...TRUNCATED) | nvidia/OpenCodeReasoning | 1.000005 | 24f35a999ac772d975290dadf6681ca7 | "<think>\nOkay, I need to solve this problem where I have to find the minimum number of adjacent swa(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | HARD | "class FenwickTree:\n def __init__(self, size):\n self.n = size\n self.tree = [0] *(...TRUNCATED) | "Okay, let's see. I have to find f(k) for each k from 1 to n. Each f(k) is the minimum number of adj(...TRUNCATED) | "To solve this problem, we need to determine the minimum number of adjacent swaps required to form a(...TRUNCATED) | 878 | "<think>\nOkay, let's see. I have to find f(k) for each k from 1 to n. Each f(k) is the minimum numb(...TRUNCATED) | [{"from":"human","value":"You are given a permutation p_1, p_2, …, p_n.\n\nIn one move you can swa(...TRUNCATED) |
"There are a number of ways to shuffle a deck of cards. Hanafuda shuffling for Japanese card game 'H(...TRUNCATED) | nvidia/OpenCodeReasoning | 1.000004 | af2807ac4233b631287d366bfc5f0a2d | "<think>\nOkay, let's see. I need to solve this Hanafuda shuffling problem. Hmm. The problem says th(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "while True:\n n, r = map(int, input().split())\n if n == 0 and r == 0:\n break\n de(...TRUNCATED) | "Okay, let's see. I need to solve this Hanafuda shuffling problem. Hmm. The problem says that each t(...TRUNCATED) | "To solve this problem, we need to simulate the Hanafuda shuffling process, which involves repeatedl(...TRUNCATED) | 8,444 | "<think>\nOkay, let's see. I need to solve this Hanafuda shuffling problem. Hmm. The problem says th(...TRUNCATED) | [{"from":"human","value":"There are a number of ways to shuffle a deck of cards. Hanafuda shuffling (...TRUNCATED) |
"Write a program of the Insertion Sort algorithm which sorts a sequence A in ascending order. The al(...TRUNCATED) | nvidia/OpenCodeReasoning | 1.000007 | 1d2866124276727ca5364e39dfcbbb39 | "<think>\nOkay, let's see. I need to write a Python program that implements the Insertion Sort algor(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "n = int(input())\na = list(map(int, input().split()))\nprint(' '.join(map(str, a)))\nfor i in range(...TRUNCATED) | "Okay, I need to write a C program that implements the Insertion Sort algorithm and outputs the inte(...TRUNCATED) | "To solve this problem, we need to implement the Insertion Sort algorithm to sort a sequence in asce(...TRUNCATED) | 3,271 | "<think>\nOkay, I need to write a C program that implements the Insertion Sort algorithm and outputs(...TRUNCATED) | [{"from":"human","value":"Write a program of the Insertion Sort algorithm which sorts a sequence A i(...TRUNCATED) |
"Vanya has a table consisting of 100 rows, each row contains 100 cells. The rows are numbered by int(...TRUNCATED) | nvidia/OpenCodeReasoning | 1.000005 | 1df66637c1050a65213e99f2418948ef | "<think>\nOkay, I need to solve this programming problem. Let's read the question carefully.\n\nThe (...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | interview | "n = int(input())\ntotal = 0\nfor _ in range(n):\n x1, y1, x2, y2 = map(int, input().split())\n (...TRUNCATED) | "Okay, let's see. The problem is about calculating the sum of all cells in a 100x100 grid where each(...TRUNCATED) | "To solve this problem, we need to determine the sum of values in all cells of a 100x100 grid where (...TRUNCATED) | 30,625 | "<think>\nOkay, let's see. The problem is about calculating the sum of all cells in a 100x100 grid w(...TRUNCATED) | [{"from":"human","value":"Vanya has a table consisting of 100 rows, each row contains 100 cells. The(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6