instruction_seed stringlengths 32 25.6k | _source stringclasses 2
values | _fasttext_score float64 0.91 1 | id stringclasses 361
values | output stringlengths 953 81k ⌀ | source stringclasses 5
values | license stringclasses 2
values | dataset stringclasses 2
values | split stringclasses 3
values | difficulty stringclasses 19
values | solution stringlengths 34 7.75k ⌀ | reasoning stringlengths 0 109k | deepseek_solution stringlengths 0 18.2k | __original_row_idx int64 0 31.6k | final_reasoning_trace stringlengths 19 113k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"On puzzling SE there are what are called \"matchstick problems\" in which math is written in match (...TRUNCATED) | stackexchange_codegolf | 0.922844 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where given a number and a certain number of moves, I have to fi(...TRUNCATED) | "To solve this problem, we need to determine the largest possible number that can be formed by rearr(...TRUNCATED) | 2,227 | "<think>\nOkay, I need to solve this problem where given a number and a certain number of moves, I h(...TRUNCATED) | [{"from":"human","value":"On puzzling SE there are what are called \"matchstick problems\" in which (...TRUNCATED) |
"Genos needs your help. He was asked to solve the following programming problem by Saitama:\n\nThe l(...TRUNCATED) | nvidia/OpenCodeReasoning | 0.970181 | 130d8c0554150ea64a4e68b990479061 | "<think>\nOkay, so I need to solve this problem where I have to calculate the sum of Hamming distanc(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "a = input().strip()\nb = input().strip()\n\nlen_a = len(a)\nlen_b = len(b)\n\nif len_a > len_b:\n (...TRUNCATED) | "Okay, let's see. The problem is to compute the sum of Hamming distances between string a and every (...TRUNCATED) | "To solve this problem, we need to compute the sum of the Hamming distances between a given binary s(...TRUNCATED) | 8,911 | "<think>\nOkay, let's see. The problem is to compute the sum of Hamming distances between string a a(...TRUNCATED) | [{"from":"human","value":"Genos needs your help. He was asked to solve the following programming pro(...TRUNCATED) |
"Given a word, treat every letter as its number in English alphabet (so a becomes 1, b becomes 2, z (...TRUNCATED) | stackexchange_codegolf | 0.911014 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where I have to check if all pairs of letters in a word are copr(...TRUNCATED) | "To solve this problem, we need to determine if every pair of letters in a given word, when converte(...TRUNCATED) | 7,668 | "<think>\nOkay, I need to solve this problem where I have to check if all pairs of letters in a word(...TRUNCATED) | [{"from":"human","value":"Given a word, treat every letter as its number in English alphabet (so a b(...TRUNCATED) |
"Background\nShadow transform of a 0-based integer sequence \\$a(n)\\$ is another 0-based integer se(...TRUNCATED) | stackexchange_codegolf | 0.949898 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where I have to compute the number of distinct shadow transforms(...TRUNCATED) | "To solve this problem, we need to compute the number of distinct shadow transforms of length \\( n (...TRUNCATED) | 23,535 | "<think>\nOkay, I need to solve this problem where I have to compute the number of distinct shadow t(...TRUNCATED) | [{"from":"human","value":"Background\nShadow transform of a 0-based integer sequence \\$a(n)\\$ is a(...TRUNCATED) |
"Given a natural numbers n>1, find the smallest narcissistic number of n digit.\nA narcissistic numb(...TRUNCATED) | stackexchange_codegolf | 0.944738 | null | null | null | null | null | null | null | null | "Okay, I need to find the smallest narcissistic number (also known as an Armstrong number) with exac(...TRUNCATED) | "To solve this problem, we need to find the smallest narcissistic number (also known as an Armstrong(...TRUNCATED) | 940 | "<think>\nOkay, I need to find the smallest narcissistic number (also known as an Armstrong number) (...TRUNCATED) | [{"from":"human","value":"Given a natural numbers n>1, find the smallest narcissistic number of n di(...TRUNCATED) |
"How Many Divisors?\n\nWrite a program which reads three integers a, b and c, and prints the number (...TRUNCATED) | nvidia/OpenCodeReasoning | 0.979954 | 52e1bb7d8c1bad724e453a39808126d7 | "<think>\nOkay, let's see. I need to write a Python program that counts the number of divisors of c (...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "a, b, c = map(int, input().split())\nprint(sum(1 for i in range(1, c + 1) if c % i == 0 and a <= i (...TRUNCATED) | "Okay, let's see. I need to find the number of divisors of c that are between a and b, inclusive. Hm(...TRUNCATED) | "To solve this problem, we need to determine the number of divisors of a given integer \\( c \\) tha(...TRUNCATED) | 21,658 | "<think>\nOkay, let's see. I need to find the number of divisors of c that are between a and b, incl(...TRUNCATED) | [{"from":"human","value":"How Many Divisors?\n\nWrite a program which reads three integers a, b and (...TRUNCATED) |
"Make an upside down triangle of positive integers. Every number in the triangle must be distinct. E(...TRUNCATED) | stackexchange_codegolf | 0.939554 | null | null | null | null | null | null | null | null | "Okay, I need to solve this problem where I have to generate an upside-down triangle of distinct pos(...TRUNCATED) | "To solve this problem, we need to generate an upside-down triangle of distinct positive integers su(...TRUNCATED) | 28,537 | "<think>\nOkay, I need to solve this problem where I have to generate an upside-down triangle of dis(...TRUNCATED) | [{"from":"human","value":"Make an upside down triangle of positive integers. Every number in the tri(...TRUNCATED) |
"We'd like to factorize a semiprime \\$N\\$. The goal of this challenge is to find two small integer(...TRUNCATED) | stackexchange_codegolf | 0.946453 | null | null | null | null | null | null | null | null | "Okay, I need to solve this programming problem where I have to find two small integers u and v such(...TRUNCATED) | "To solve this problem, we need to factorize a semiprime \\( N \\) into two prime factors by finding(...TRUNCATED) | 15,096 | "<think>\nOkay, I need to solve this programming problem where I have to find two small integers u a(...TRUNCATED) | [{"from":"human","value":"We'd like to factorize a semiprime \\$N\\$. The goal of this challenge is (...TRUNCATED) |
"Challenge\nA repdigit is a non-negative integer whose digits are all equal.\nCreate a function or c(...TRUNCATED) | stackexchange_codegolf | 0.93874 | null | null | null | null | null | null | null | null | "Okay, I need to write a function or program that checks if a given positive integer is a repdigit. (...TRUNCATED) | "To solve this problem, we need to determine if a given positive integer is a repdigit. A repdigit i(...TRUNCATED) | 8,826 | "<think>\nOkay, I need to write a function or program that checks if a given positive integer is a r(...TRUNCATED) | [{"from":"human","value":"Challenge\nA repdigit is a non-negative integer whose digits are all equal(...TRUNCATED) |
"The well-known Fibonacci sequence F_0, F_1, F_2,… is defined as follows: \n\n * F_0 = 0, F_1 = (...TRUNCATED) | nvidia/OpenCodeReasoning | 0.978627 | c186fcfe0144ac98160cfbdacdbd02a6 | "<think>\nOkay, I need to solve this programming problem. Let me read the problem carefully again to(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 12 | "MOD = 10**18\n\ndef fast_doubling(n):\n def multiply(a, b):\n return [\n (a[0](...TRUNCATED) | "Okay, let's see. I need to find an arithmetic sequence (b, b+e, ..., b+(n-1)e) such that each a+id (...TRUNCATED) | "To solve this problem, we need to find an arithmetic sequence of indices such that each term in the(...TRUNCATED) | 7,724 | "<think>\nOkay, let's see. I need to find an arithmetic sequence (b, b+e, ..., b+(n-1)e) such that e(...TRUNCATED) | [{"from":"human","value":"The well-known Fibonacci sequence F_0, F_1, F_2,… is defined as follows(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6