prompt listlengths 1 1 | data_source stringclasses 2
values | ability stringclasses 2
values | reward_model dict | extra_info dict |
|---|---|---|---|---|
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nWe are interested in collecting the sets of six prime numbers, that having a starting prime p, the following values are also primes forming the sextuplet ```[p, p + 4, p + 6, p + 10, p + 12, p + 16]```\n\nThe first sextuplet that... | taco-verified | coding | {
"ground_truth": "{\"fn_name\": \"find_primes_sextuplet\", \"inputs\": [[70], [600], [2000000]], \"outputs\": [[[7, 11, 13, 17, 19, 23]], [[97, 101, 103, 107, 109, 113]], [[1091257, 1091261, 1091263, 1091267, 1091269, 1091273]]]}",
"style": "rule"
} | {
"dataset": "likaixin/TACO-verified",
"difficulty": "EASY",
"index": 0,
"raw_tags": "['Mathematics', 'Algorithms', 'Memoization', 'Sorting', 'Data Structures']",
"skill_types": "['Dynamic programming', 'Sorting', 'Data structures']",
"source": "codewars",
"split": "train",
"tags": "['Dynamic programmin... |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nOptimal Binary Search Tree is a binary search tree constructed from $n$ keys and $n+1$ dummy keys so as to minimize the expected value of cost for a search operation.\n\nWe are given a sequence $K = {k_1, k_2, ..., k_n}$ of $n$ d... | taco-verified | coding | {
"ground_truth": "{\"inputs\": [\"5\\n0.1500 0.1000 0.0500 0.1000 0.2000\\n0.0500 0.1000 0.0500 0.0500 0.0500 0.1000\", \"7\\n0.0400 0.0600 0.0800 0.0200 0.1000 0.1200 0.1400\\n0.0600 0.0600 0.0600 0.0600 0.0500 0.0500 0.0500 0.0500\"], \"outputs\": [\"2.75000000\", \"3.12000000\"]}",
"style": "rule"
} | {
"dataset": "likaixin/TACO-verified",
"difficulty": "UNKNOWN_DIFFICULTY",
"index": 1,
"raw_tags": "[]",
"skill_types": "[]",
"source": "aizu",
"split": "train",
"tags": "[]",
"url": null
} |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nLimak is a little polar bear. He plays by building towers from blocks. Every block is a cube with positive integer length of side. Limak has infinitely many blocks of each side length.\n\nA block with side a has volume a^3. A tow... | taco-verified | coding | {
"ground_truth": "{\"inputs\": [\"48\\n\", \"6\\n\", \"1\\n\", \"994\\n\", \"567000123\\n\", \"123830583943\\n\", \"3842529393411\\n\", \"999999993700000\\n\", \"2\\n\", \"7\\n\", \"8\\n\", \"9\\n\", \"112\\n\", \"113\\n\", \"114\\n\", \"265\\n\", \"995\\n\", \"200385\\n\", \"909383000\\n\", \"108000000057\\n\", \"3... | {
"dataset": "likaixin/TACO-verified",
"difficulty": "HARD",
"index": 2,
"raw_tags": "['greedy', 'binary search', 'dp']",
"skill_types": "['Dynamic programming', 'Sorting', 'Greedy algorithms']",
"source": "codeforces",
"split": "train",
"tags": "['Dynamic programming', 'Sorting', 'Greedy algorithms']",... |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nYou are given a sequence of $n$ integers $a_1, \\, a_2, \\, \\dots, \\, a_n$.\n\nDoes there exist a sequence of $n$ integers $b_1, \\, b_2, \\, \\dots, \\, b_n$ such that the following property holds?\n\nFor each $1 \\le i \\le n... | taco-verified | coding | {
"ground_truth": "{\"inputs\": [\"5\\n5\\n4 -7 -1 5 10\\n1\\n0\\n3\\n1 10 100\\n4\\n-3 2 10 2\\n9\\n25 -171 250 174 152 242 100 -205 -258\\n\", \"20\\n2\\n0 -7\\n3\\n4 3 -2\\n2\\n6 0\\n2\\n0 5\\n3\\n0 -3 0\\n3\\n3 0 2\\n2\\n4 -9\\n1\\n0\\n2\\n0 6\\n3\\n0 -5 1\\n2\\n9 -6\\n3\\n-2 -3 -1\\n3\\n2 -4 -4\\n3\\n-1 -4 -2\\n... | {
"dataset": "likaixin/TACO-verified",
"difficulty": "MEDIUM_HARD",
"index": 3,
"raw_tags": "['math', 'dfs and similar', 'dp', 'brute force', 'bitmasks', 'graphs', 'constructive algorithms']",
"skill_types": "['Dynamic programming', 'Bit manipulation', 'Complete search']",
"source": "codeforces",
"split":... |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nYou are given three integers A, B and C.\n\nDetermine if there exists an equilateral triangle whose sides have lengths A, B and C.\n\nConstraints\n\n* All values in input are integers.\n* 1 \\leq A,B,C \\leq 100\n\nInput\n\nInput... | taco-verified | coding | {
"ground_truth": "{\"inputs\": [\"2 4 2\", \"0 0 0\", \"3 4 2\", \"2 6 2\", \"3 4 1\", \"2 7 2\", \"3 0 1\", \"1 7 2\", \"4 0 1\", \"0 7 2\", \"4 0 2\", \"0 13 2\", \"5 0 2\", \"1 13 2\", \"6 0 2\", \"1 13 3\", \"8 0 2\", \"1 15 3\", \"8 -1 2\", \"2 15 3\", \"15 -1 2\", \"4 15 3\", \"13 -1 2\", \"3 15 3\", \"16 -1 2... | {
"dataset": "likaixin/TACO-verified",
"difficulty": "UNKNOWN_DIFFICULTY",
"index": 4,
"raw_tags": "[]",
"skill_types": "[]",
"source": "atcoder",
"split": "train",
"tags": "[]",
"url": null
} |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nChef is a high-ranked army officer and he has been given the job to train the army.\n\nThe army consists of N soldiers where each soldier has 3 parameters:\n*Attack points*: A_{i} where (0< A_{i} < 1000);\n*Defense points*: (1000... | taco-verified | coding | {
"ground_truth": "{\"inputs\": [\"4\\n2\\n500 500\\n3\\n500 500 500\\n4\\n100 800 300 500\\n4\\n300 700 800 200\\n\"], \"outputs\": [\"250000\\n500000\\n2080000\\n2250000\\n\"]}",
"style": "rule"
} | {
"dataset": "likaixin/TACO-verified",
"difficulty": "MEDIUM_HARD",
"index": 5,
"raw_tags": "['Algorithms', 'Sorting']",
"skill_types": "['Sorting']",
"source": "codechef",
"split": "train",
"tags": "['Sorting']",
"url": "https://www.codechef.com/problems/ARMTRN"
} |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nThe goal of this Kata is to reduce the passed integer to a single digit (if not already) by converting the number to binary, taking the sum of the binary digits, and if that sum is not a single digit then repeat the process.\n\n-... | taco-verified | coding | {
"ground_truth": "{\"fn_name\": \"single_digit\", \"inputs\": [[5], [999], [1234444123], [443566], [565656565], [9889345778311094737448], [4868872], [234234235], [567448], [10000000000]], \"outputs\": [[5], [8], [1], [2], [3], [2], [8], [2], [7], [3]]}",
"style": "rule"
} | {
"dataset": "likaixin/TACO-verified",
"difficulty": "EASY",
"index": 6,
"raw_tags": "['Fundamentals', 'Binary']",
"skill_types": "['Bit manipulation']",
"source": "codewars",
"split": "train",
"tags": "['Bit manipulation', 'Fundamentals']",
"url": "https://www.codewars.com/kata/5a7778790136a132a00000... |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nThere is a data which provides heights (in meter) of mountains. The data is only for ten mountains.\n\nWrite a program which prints heights of the top three mountains in descending order.\n\nConstraints\n\n0 ≤ height of mountain ... | taco-verified | coding | {
"ground_truth": "{\"inputs\": [\"1819\\n2003\\n876\\n2840\\n1723\\n1799\\n3776\\n2848\\n1592\\n922\", \"100\\n200\\n300\\n568\\n500\\n600\\n700\\n800\\n900\\n900\", \"1819\\n2003\\n876\\n2840\\n1723\\n1799\\n4419\\n2848\\n1592\\n922\", \"100\\n200\\n300\\n568\\n500\\n600\\n700\\n1096\\n900\\n900\", \"100\\n200\\n30... | {
"dataset": "likaixin/TACO-verified",
"difficulty": "UNKNOWN_DIFFICULTY",
"index": 7,
"raw_tags": "[]",
"skill_types": "[]",
"source": "aizu",
"split": "train",
"tags": "[]",
"url": null
} |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nHamed has recently found a string t and suddenly became quite fond of it. He spent several days trying to find all occurrences of t in other strings he had. Finally he became tired and started thinking about the following problem... | taco-verified | coding | {
"ground_truth": "{\"inputs\": [\"a\\naa\\n\", \"a\\na\\n\", \"vnssnssnssnssnssnssnssnssnssnssnssnssnssnssnssnssn\\nnssnssns\\n\", \"ababababab\\nabab\\n\", \"a\\nb\\n\", \"vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv\\nvvvvvvvv\\n\", \"kpjmawawawawawawawawawawawawawawawawawawawawawawaw\\nwawawawa\\n\", \"a\\n... | {
"dataset": "likaixin/TACO-verified",
"difficulty": "HARD",
"index": 8,
"raw_tags": "['strings', 'dp']",
"skill_types": "['Dynamic programming']",
"source": "codeforces",
"split": "train",
"tags": "['String algorithms', 'Dynamic programming']",
"url": "https://codeforces.com/problemset/problem/495/D"... |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nYou are given a permutation $p_1, p_2, \\ldots, p_n$.\n\nIn one move you can swap two adjacent values.\n\nYou want to perform a minimum number of moves, such that in the end there will exist a subsegment $1,2,\\ldots, k$, in othe... | taco-verified | coding | {
"ground_truth": "{\"inputs\": [\"5\\n5 4 3 2 1\\n\", \"3\\n1 2 3\\n\", \"1\\n1\\n\", \"10\\n5 1 6 2 8 3 4 10 9 7\\n\", \"100\\n98 52 63 2 18 96 31 58 84 40 41 45 66 100 46 71 26 48 81 20 73 91 68 76 13 93 17 29 64 95 79 21 55 75 19 85 54 51 89 78 15 87 43 59 36 1 90 35 65 56 62 28 86 5 82 49 3 99 33 9 92 32 74 69 2... | {
"dataset": "likaixin/TACO-verified",
"difficulty": "HARD",
"index": 9,
"raw_tags": "['data structures', 'binary search']",
"skill_types": "['Sorting', 'Data structures']",
"source": "codeforces",
"split": "train",
"tags": "['Sorting', 'Data structures']",
"url": "https://codeforces.com/problemset/pr... |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nYou are given a string S constisting of uppercase Latin letters. Is it possible to reorder the characters in this string to get a string with prefix \"LTIME\" and suffix \"EMITL\"?\nWe remind you that a prefix of a string is any ... | taco-verified | coding | {
"ground_truth": "{\"inputs\": [[\"3\", \"LTIMEAZAZAITLME\", \"LLLTTTIIIMMMEEEAHA\", \"LTIMEM\"]], \"outputs\": [[\"YES\", \"YES\", \"NO\"]]}",
"style": "rule"
} | {
"dataset": "likaixin/TACO-verified",
"difficulty": "MEDIUM",
"index": 10,
"raw_tags": "['Algorithms', 'Implementation']",
"skill_types": "[]",
"source": "codechef",
"split": "train",
"tags": "['Implementation']",
"url": "https://www.codechef.com/problems/EMITL"
} |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nThis is an easier version of the next problem. In this version, $q = 0$.\n\nA sequence of integers is called nice if its elements are arranged in blocks like in $[3, 3, 3, 4, 1, 1]$. Formally, if two elements are equal, everythin... | taco-verified | coding | {
"ground_truth": "{\"inputs\": [\"5 0\\n3 7 3 7 3\\n\", \"10 0\\n1 2 1 2 3 1 1 1 50 1\\n\", \"6 0\\n6 6 3 3 4 4\\n\", \"7 0\\n3 3 1 3 2 1 2\\n\", \"5 0\\n1 2 1 2 1\\n\", \"5 0\\n2 3 2 3 3\\n\", \"100 0\\n6 7 100 8 5 61 5 75 59 65 51 47 83 37 34 54 87 46 4 26 21 87 12 97 86 68 60 11 62 76 14 83 29 31 91 62 57 80 47 7... | {
"dataset": "likaixin/TACO-verified",
"difficulty": "HARD",
"index": 11,
"raw_tags": "['data structures', 'greedy', 'implementation', 'dsu', 'two pointers']",
"skill_types": "['Data structures', 'Amortized analysis', 'Greedy algorithms']",
"source": "codeforces",
"split": "train",
"tags": "['Amortized ... |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nIn this kata you will create a function that takes in a list and returns a list with the reverse order.\n\n### Examples\n\n```python\nreverse_list([1,2,3,4]) == [4,3,2,1]\nreverse_list([3,1,5,4]) == [4,5,1,3]\n```\n\nYou may reus... | taco-verified | coding | {
"ground_truth": "{\"fn_name\": \"reverse_list\", \"inputs\": [[[1, 2, 3, 4]], [[3, 1, 5, 4]], [[3, 6, 9, 2]], [[1]]], \"outputs\": [[[4, 3, 2, 1]], [[4, 5, 1, 3]], [[2, 9, 6, 3]], [[1]]]}",
"style": "rule"
} | {
"dataset": "likaixin/TACO-verified",
"difficulty": "EASY",
"index": 12,
"raw_tags": "['Fundamentals', 'Lists']",
"skill_types": "['Data structures']",
"source": "codewars",
"split": "train",
"tags": "['Fundamentals', 'Data structures']",
"url": "https://www.codewars.com/kata/53da6d8d112bd1a0dc00008b... |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nLittle Petya likes to play very much. And most of all he likes to play the following game:\n\nHe is given a sequence of N integer numbers. At each step it is allowed to increase the value of any number by 1 or to decrease it by 1... | taco-verified | coding | {
"ground_truth": "{\"inputs\": [\"5\\n0 0 0 0 0\\n\", \"2\\n10 2\\n\", \"20\\n10 5 3 1 3 7 7 6 8 3 6 2 9 10 5 2 10 9 10 4\\n\", \"10\\n8 8 2 2 2 2 10 10 10 8\\n\", \"5\\n1 2 3 1 1\\n\", \"20\\n10 6 1 9 10 10 7 0 10 5 9 1 5 7 4 9 3 9 7 2\\n\", \"20\\n7 7 7 7 7 7 10 10 10 10 23 21 23 20 22 23 22 23 95 97\\n\", \"7\\n1... | {
"dataset": "likaixin/TACO-verified",
"difficulty": "HARD",
"index": 13,
"raw_tags": "['sortings', 'dp']",
"skill_types": "['Dynamic programming', 'Sorting']",
"source": "codeforces",
"split": "train",
"tags": "['Dynamic programming', 'Sorting']",
"url": "https://codeforces.com/problemset/problem/13/... |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nYou and your $n - 1$ friends have found an array of integers $a_1, a_2, \\dots, a_n$. You have decided to share it in the following way: All $n$ of you stand in a line in a particular order. Each minute, the person at the front o... | taco-verified | coding | {
"ground_truth": "{\"inputs\": [\"4\\n6 4 2\\n2 9 2 3 8 5\\n4 4 1\\n2 13 60 4\\n4 1 3\\n1 2 2 1\\n2 2 0\\n1 2\\n\", \"4\\n6 4 2\\n2 9 2 3 8 5\\n4 4 1\\n2 13 60 4\\n4 1 3\\n1 2 1 1\\n2 2 0\\n1 2\\n\", \"4\\n6 4 2\\n2 9 2 3 8 5\\n4 4 1\\n2 13 60 4\\n4 2 3\\n1 2 2 1\\n2 2 0\\n1 2\\n\", \"4\\n6 3 2\\n2 9 2 3 8 5\\n4 4 1... | {
"dataset": "likaixin/TACO-verified",
"difficulty": "MEDIUM_HARD",
"index": 14,
"raw_tags": "['data structures', 'brute force', 'implementation']",
"skill_types": "['Data structures', 'Complete search']",
"source": "codeforces",
"split": "train",
"tags": "['Data structures', 'Implementation', 'Complete... |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nThere are N Pokemon trainers numbered from 1 to N. Each trainer has one Pokemon. All the trainers have arrived to participate in a contest. \nThere are two battle arenas, one in ground and other in water. Each Pokemon may have d... | taco-verified | coding | {
"ground_truth": "{\"inputs\": [\"4\\n2\\n1 2\\n3 4\\n2\\n1 2\\n2 1\\n3\\n1 2 3\\n1 4 2\\n5\\n2 3 5 4 1\\n4 2 1 5 6\"], \"outputs\": [\"1\\n2\\n2\\n3\"]}",
"style": "rule"
} | {
"dataset": "likaixin/TACO-verified",
"difficulty": "MEDIUM_HARD",
"index": 15,
"raw_tags": "['Algorithms', 'Sorting']",
"skill_types": "['Sorting']",
"source": "codechef",
"split": "train",
"tags": "['Sorting']",
"url": "https://www.codechef.com/problems/PBATTLE"
} |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nYou are given a length of string and two thumbtacks. On thumbtack goes into the focus point *F₀* with coordinates *x₀* and *y₀*, and the other does into point *F₁* with points *x₁* and *y₁*. The string is then tied at the ends to... | taco-verified | coding | {
"ground_truth": "{\"fn_name\": \"ellipse_contains_point\", \"inputs\": [[{\"x\": 0, \"y\": 0}, {\"x\": 0, \"y\": 0}, 2, {\"x\": 0, \"y\": 0}], [{\"x\": 0, \"y\": 0}, {\"x\": 0, \"y\": 0}, 2, {\"x\": 1, \"y\": 1}]], \"outputs\": [[true], [false]]}",
"style": "rule"
} | {
"dataset": "likaixin/TACO-verified",
"difficulty": "EASY",
"index": 16,
"raw_tags": "['Mathematics', 'Algorithms', 'Geometry']",
"skill_types": "[]",
"source": "codewars",
"split": "train",
"tags": "['Geometry', 'Mathematics']",
"url": "https://www.codewars.com/kata/5b01abb9de4c7f3c22000012"
} |
[
{
"content": "Solve the programming task below in a Python markdown code block.\n\nWe have N balance beams numbered 1 to N. The length of each beam is 1 meters. Snuke walks on Beam i at a speed of 1/A_i meters per second, and Ringo walks on Beam i at a speed of 1/B_i meters per second.\n\nSnuke and Ringo will p... | taco-verified | coding | {
"ground_truth": "{\"inputs\": [\"3\\n1 1\\n5 2\\n6 3\", \"4\\n1 5\\n4 7\\n2 1\\n6 4\", \"10\\n1375710043 178537096\\n705445072 318106937\\n472381277 579910117\\n353498483 865935868\\n383133839 231371336\\n378371075 681212831\\n304570952 16537461\\n955719384 267238505\\n844917655 218662351\\n550309930 62731178\", \"... | {
"dataset": "likaixin/TACO-verified",
"difficulty": "UNKNOWN_DIFFICULTY",
"index": 17,
"raw_tags": "[]",
"skill_types": "[]",
"source": "atcoder",
"split": "train",
"tags": "[]",
"url": null
} |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 3