instruction_seed stringlengths 32 25.6k | _source stringclasses 2
values | _fasttext_score float64 1 1 | id stringclasses 422
values | output stringlengths 981 87k ⌀ | source stringclasses 5
values | license stringclasses 2
values | dataset stringclasses 2
values | split stringclasses 3
values | difficulty stringclasses 22
values | solution stringlengths 15 7.75k ⌀ | reasoning stringlengths 708 105k | deepseek_solution stringlengths 6 17.9k | __original_row_idx int64 0 31.6k | final_reasoning_trace stringlengths 1.79k 110k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"Omkar is building a house. He wants to decide how to make the floor plan for the last floor.\n\nOmk(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.99999 | f74161ea8b386b7f5d45cdc36d60884d | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 11 | "n, m = map(int, input().split())\nrows = []\nfor _ in range(n):\n k = int(input())\n interval(...TRUNCATED) | "Okay, let's tackle this problem. Hmm. So the problem is about maximizing the quality of a floor pla(...TRUNCATED) | "To solve this problem, we need to maximize the quality of a floor plan defined as the sum of the sq(...TRUNCATED) | 26,884 | "<think>\nOkay, let's tackle this problem. Hmm. So the problem is about maximizing the quality of a (...TRUNCATED) | [{"from":"human","value":"Omkar is building a house. He wants to decide how to make the floor plan f(...TRUNCATED) |
"Kolya is very absent-minded. Today his math teacher asked him to solve a simple problem with the eq(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.999996 | b36ba755c42feadf2f14ed4ac76c8a71 | "<think>\nOkay, I need to find two numbers a and b such that a + 1 = b. The first digit of a is d_a,(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 7 | "d_a, d_b = map(int, input().split())\n\nif d_a == d_b:\n a = d_a * 10\n print(a, a + 1)\nelif(...TRUNCATED) | "Okay, I need to solve this problem where Kolya remembers the first digits of a and b in the equatio(...TRUNCATED) | "To solve this problem, we need to determine if there exist two positive integers \\(a\\) and \\(b\\(...TRUNCATED) | 11,981 | "<think>\nOkay, I need to solve this problem where Kolya remembers the first digits of a and b in th(...TRUNCATED) | [{"from":"human","value":"Kolya is very absent-minded. Today his math teacher asked him to solve a s(...TRUNCATED) |
"It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.\n\nGive(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.999994 | 45f5aa74844d709ac8d51ffec39c5d36 | "<think>\nOkay, let's see. The problem is to find the area of a regular dodecagon inscribed in a cir(...TRUNCATED) | atcoder | cc-by-4.0 | code_contests | train | 0 | r = int(input())
print(3 * r ** 2) | "Okay, let's see. The problem says that the area of a regular dodecagon inscribed in a circle of rad(...TRUNCATED) | "To solve this problem, we need to determine the area of a regular dodecagon (12-sided polygon) insc(...TRUNCATED) | 21,670 | "<think>\nOkay, let's see. The problem says that the area of a regular dodecagon inscribed in a circ(...TRUNCATED) | [{"from":"human","value":"It is known that the area of a regular dodecagon inscribed in a circle of (...TRUNCATED) |
"String s of length n is called k-palindrome, if it is a palindrome itself, and its prefix and suffi(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.999995 | e0cfbac70f35482270f32a4884a627a1 | "<think>\nOkay, let's see. I need to calculate the sum of palindrome degrees for all prefixes of a g(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | HARD | "s = input().strip()\nn = len(s)\nmod = 10**18 + 3\nbase = 911382629\n\nif n == 0:\n print(0)\n (...TRUNCATED) | "Okay, I need to solve this problem where I have to find the sum of the palindrome degrees of all pr(...TRUNCATED) | "To solve this problem, we need to determine the sum of the palindrome degrees of all prefixes of a (...TRUNCATED) | 15,415 | "<think>\nOkay, I need to solve this problem where I have to find the sum of the palindrome degrees (...TRUNCATED) | [{"from":"human","value":"String s of length n is called k-palindrome, if it is a palindrome itself,(...TRUNCATED) |
"An old Chinese poem goes:\n\n一百饅頭一百僧，\n 大僧三個更無爭，\n 小僧三人(...TRUNCATED) | stackexchange_codegolf | 0.999967 | null | null | null | null | null | null | null | null | "Okay, let's see. I need to solve this problem where there are b buns and m monks. The big monks eat(...TRUNCATED) | "To solve this problem, we need to determine the number of big and small monks such that the total n(...TRUNCATED) | 22,209 | "<think>\nOkay, let's see. I need to solve this problem where there are b buns and m monks. The big (...TRUNCATED) | [{"from":"human","value":"An old Chinese poem goes:\n\n一百饅頭一百僧，\n 大僧三個更(...TRUNCATED) |
"You are hired by the ∀I¶אΞ℘, an extraterrestrial intelligence, as a programmer of their type(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.999985 | a9b5022849830c2544ed883d4ca43590 | "<think>\nOkay, so I need to solve this text justification problem. Let's see what the problem says.(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "import sys\n\ndef main():\n case = 0\n while True:\n line = sys.stdin.readline()\n (...TRUNCATED) | "Okay, let's tackle this problem. Hmm, the task is to find the minimum cost for text justification b(...TRUNCATED) | "To solve this problem, we need to justify text such that the cost, defined by the sum of absolute d(...TRUNCATED) | 2,509 | "<think>\nOkay, let's tackle this problem. Hmm, the task is to find the minimum cost for text justif(...TRUNCATED) | [{"from":"human","value":"You are hired by the ∀I¶אΞ℘, an extraterrestrial intelligence, as a(...TRUNCATED) |
"You have n friends and you want to take m pictures of them. Exactly two of your friends should appe(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.99999 | 2820c00584d3c8539f3688931ce10910 | "<think>\nOkay, let's see. The problem is about selecting m pairs of friends such that each pair is (...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | VERY_HARD | "n, m = map(int, input().split())\na = list(map(int, input().split()))\nxors = []\nfor i in range(n)(...TRUNCATED) | "Okay, let's see. The problem is about selecting m pairs of friends such that each pair is unique, a(...TRUNCATED) | "To solve this problem, we need to maximize the sum of attractiveness values from exactly `m` unique(...TRUNCATED) | 4,739 | "<think>\nOkay, let's see. The problem is about selecting m pairs of friends such that each pair is (...TRUNCATED) | [{"from":"human","value":"You have n friends and you want to take m pictures of them. Exactly two of(...TRUNCATED) |
"Rotate and Rewrite\n\nTwo sequences of integers A: A1 A2 ... An and B: B1 B2 ... Bm and a set of re(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.999994 | 942e81169d550784f02e3dcd4628e19e | "<think>\nOkay, let's see. I need to solve this problem where two sequences can be rotated and rewri(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "import sys\nfrom collections import deque\n\ndef rotate(s, i):\n return s[i:] + s[:i]\n\ndef get(...TRUNCATED) | "Okay, let's see. The problem is about determining if two sequences A and B can be transformed into (...TRUNCATED) | "To solve this problem, we need to determine if two sequences of integers, A and B, can be transform(...TRUNCATED) | 13,947 | "<think>\nOkay, let's see. The problem is about determining if two sequences A and B can be transfor(...TRUNCATED) | [{"from":"human","value":"Rotate and Rewrite\n\nTwo sequences of integers A: A1 A2 ... An and B: B1 (...TRUNCATED) |
"Given an input string S, return truthy if all the letters in S are Lexically Ordered: their ASCII v(...TRUNCATED) | stackexchange_codegolf | 0.999978 | null | null | null | null | null | null | null | null | "Okay, so I need to write a program or function that checks if all the letters in a string are in ei(...TRUNCATED) | "To solve this problem, we need to determine if the characters in a given string are ordered either (...TRUNCATED) | 15,670 | "<think>\nOkay, so I need to write a program or function that checks if all the letters in a string (...TRUNCATED) | [{"from":"human","value":"Given an input string S, return truthy if all the letters in S are Lexical(...TRUNCATED) |
"The numbers 1 to n x n are contained in the n x n square squares one by one, and the sum of the squ(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.999984 | cf9e00f8c2691336bca4e7347ec7d1a0 | "<think>\nOkay, I need to write a Python program that generates a magic square of size n x n, where (...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "def generate_magic(n):\n magic = [[0] * n for _ in range(n)]\n row = (n // 2 + 1) % n\n co(...TRUNCATED) | "Okay, I need to create a program that generates a magic square of size n x n using the given method(...TRUNCATED) | "To solve this problem, we need to generate a magic square of size n x n for an odd integer n using (...TRUNCATED) | 23,997 | "<think>\nOkay, I need to create a program that generates a magic square of size n x n using the giv(...TRUNCATED) | [{"from":"human","value":"The numbers 1 to n x n are contained in the n x n square squares one by on(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 8