problem stringlengths 0 14.3k | solution stringlengths 0 6.9k ⌀ | tests stringlengths 33 74M ⌀ | domain stringclasses 8
values | source stringclasses 85
values | difficulty stringlengths 24 320 ⌀ | metadata stringlengths 2 88M |
|---|---|---|---|---|---|---|
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
As you might remember from the previous round, Vova is currently playing a strategic game known as Rage of Empires.
Vova managed to build a large army, but forgot about ... | null | {"inputs": ["5\n1 3\n1 4\n3 8 3\n2 4\n3 6 3\n", "5\n1 3\n1 4\n3 6 3\n1 4\n3 6 3\n", "5\n1 3\n1 4\n3 6 3\n1 4\n3 2 3\n", "5\n1 6\n1 4\n3 6 3\n1 4\n3 6 3\n", "5\n1 3\n1 4\n3 6 5\n1 4\n1 2 3\n", "5\n1 3\n1 4\n3 7 3\n1 4\n3 6 3\n", "5\n1 4\n1 7\n3 8 3\n2 4\n3 6 2\n", "5\n1 1\n1 4\n3 6 3\n1 4\n3 10 3\n", "5\n1 3\n1 4\n3 8 3... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "14/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Given two positive numbers B and C, what is the minimum positive value of A, such that A \cdot B is divisible by C.
Here, A \cdot B denotes the value obtained when A is ... | null | {"inputs": ["2\n2 4\n8 12"], "outputs": ["2\n3"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "2/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
For "x", determine how many positive integers less than or equal to "x" are odd but not prime. Assume "x" is an integer between 1 and 10000.
Example: 5 has three odd num... | null | {"fn_name": "odd_not_prime", "inputs": ["5", "10", "99"], "outputs": ["1", "2", "26"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "12/16", "DeepSeek-R1-Distill-Qwen-32B": "10/16", "DeepSeek-R1-Distill-Qwen-7B": "2/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Consider an array A of length N. You know that for all 1 ≤ i ≤ N, 0 ≤ A_{i} ≤ 10^{5}. We construct an array B of length N-1 such that, for all 1 ≤ i ≤ N - 1, B_{i} = min(... | null | {"inputs": ["3\n2\n100\n5\n3 9 8 4\n3\n10 12"], "outputs": ["199801\n199983\n199977"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-very_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "14/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
You have a given integer $n$. Find the number of ways to fill all $3 \times n$ tiles with the shape described in the picture below. Upon filling, no empty spaces are allo... | null | {"inputs": ["4\n", "1\n", "17\n", "36\n", "47\n", "60\n", "56\n", "27\n", "11\n", "12\n", "39\n", "59\n", "2\n", "8\n", "5\n", "7\n", "44\n", "57\n", "3\n", "19\n", "18\n", "6\n", "7\n", "60\n", "36\n", "18\n", "8\n", "44\n", "39\n", "3\n", "57\n", "5\n", "12\n", "17\n", "19\n", "11\n", "59\n", "47\n", "56\n", "27\n", ... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "12/16", "DeepSeek-R1-Distill-Qwen-32B": "4/16", "DeepSeek-R1-Distill-Qwen-7B": "12/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
Given three integers x, y, and bound, return a list of all the powerful integers that have a value less than or equal t... | null | {"entry_point": "Solution().powerfulIntegers", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\n... | code | Skywork/Skywork-OR1-RL-Data/train-code-leetcode-Medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "2/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "6/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
You have multiset of n strings of the same length, consisting of lowercase English letters. We will say that those strings are easy to remember if for each string there i... | null | {"inputs": ["4 5\nabcde\nabcde\nabcde\nabcde\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n", "4 3\nabc\naba\nadc\nada\n10 10 10\n10 1 10\n10 10 10\n10 1 10\n", "3 3\nabc\nada\nssa\n1 1 1\n1 1 1\n1 1 1\n", "5 2\naa\naa\nab\nbb\nbb\n1 100\n100 100\n1 1\n100 100\n100 1\n", "3 3\nabc\nabc\nabc\n1 100 100\n100 1 100\n100 10... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-very_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Your task in order to complete this Kata is to write a function which formats a duration, given as a number of seconds, in a human-friendly way.
The function must accept... | null | {"fn_name": "format_duration", "inputs": ["0", "1", "62", "120", "3600", "3662", "15731080", "132030240", "205851834", "253374061", "242062374", "101956166", "33243586"], "outputs": ["\"now\"", "\"1 second\"", "\"1 minute and 2 seconds\"", "\"2 minutes\"", "\"1 hour\"", "\"1 hour, 1 minute and 2 seconds\"", "\"182 days... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "14/16", "DeepSeek-R1-Distill-Qwen-32B": "8/16", "DeepSeek-R1-Distill-Qwen-7B": "14/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
A prime number is an integer greater than $1$ that has no positive divisors other than $1$ and itself.
We call a number megaprime if it is prime and all of its individua... | null | {"inputs": ["1 100\n"], "outputs": ["8\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "12/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "12/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Watson gave Sherlock a collection of arrays $V$. Here each $V_i$ is an array of variable length. It is guaranteed that if you merge the arrays into one single array, you'... | null | {"inputs": ["3\n1 2 3\n", "2\n2 1\n"], "outputs": ["4\n", "1\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "14/16", "DeepSeek-R1-Distill-Qwen-32B": "12/16", "DeepSeek-R1-Distill-Qwen-7B": "12/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Takahashi loves palindromes. Non-palindromic strings are unacceptable to him. Each time he hugs a string, he can change one of its characters to any character of his choi... | null | {"inputs": ["redcoder\n", "vvvvvv\n", "abcdabc\n", "cgayikejwockvntzlvpsfjtzlqfhoqoiahcodvinogbpuxhvohhcvhzmidloliztdhrntxqurzqjztjmwpylaknjncowkeuikhgc\n", "pgfqwbxjygkpqanpkicpaxfgeembvdgtllvtiyamxfpwtknorxxvonpntkwcffyjtvwlqgvvbzmmgfgkwezkemmxpagyihbkqidk\n", "ytmltbhwcqlwaliqyxgowpinxvugmgpzzahkhlgzajylknxzddtedijk... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "6/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Slime has a sequence of positive integers $a_1, a_2, \ldots, a_n$.
In one operation Orac can choose an arbitrary subsegment $[l \ldots r]$ of this sequence and replace a... | null | {"inputs": ["5\n5 3\n1 5 2 6 1\n1 6\n6\n3 2\n1 2 3\n4 3\n3 1 2 3\n10 3\n1 2 3 4 5 6 7 8 9 10\n", "2\n1 1\n1000000000\n3 1000000000\n1000000000 996 251\n", "1\n7 2\n5 5 1 1 2 1 1\n", "1\n10 2\n1 1 2 1 1 1 1 5 1 5\n", "1\n10 10\n10 1 1 1 1 1 1 11 1 11\n", "1\n9 3\n3 1 1 1 1 1 4 1 4\n", "1\n7 3\n3 2 2 2 4 2 4\n", "1\n9 5\... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
# Task
An IP address contains four numbers(0-255) and separated by dots. It can be converted to a number by this way:
Given a string `s` represents a number or an IP a... | null | {"fn_name": "numberAndIPaddress", "inputs": ["\"10.0.3.193\"", "\"167969729\""], "outputs": ["\"167773121\"", "\"10.3.3.193\""]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
A person is said to be sleep deprived if he slept strictly less than 7 hours in a day.
Chef was only able to sleep X hours yesterday. Determine if he is sleep deprived o... | null | {"inputs": ["3\n4\n7\n10\n"], "outputs": ["YES\nNO\nNO\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "0/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
There is an undirected graph consisting of n nodes numbered from 1 to n. You are given the integer n and a 2D array edg... | null | {"entry_point": "Solution().isPossible", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\nfrom m... | code | Skywork/Skywork-OR1-RL-Data/train-code-leetcode-Hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "4/16", "DeepSeek-R1-Distill-Qwen-7B": "8/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
In the world of DragonBool there are fierce warriors called Soints. Also there are even fiercer warriors called Sofloats – the mortal enemies of Soints.
The power of eac... | null | {"inputs": ["2\n2 3\n10 1\n20 2\n5 2\n5 2\n18 1\n5 5\n73 87\n69 13\n36 36\n77 46\n43 93\n49 46\n74 93\n78 87\n99 13\n59 36", "2\n2 3\n10 1\n20 2\n5 2\n4 2\n18 1\n5 5\n73 87\n69 13\n36 36\n77 46\n43 93\n49 46\n74 93\n78 87\n99 13\n59 36", "2\n2 3\n10 1\n20 2\n5 2\n4 2\n18 1\n5 5\n73 87\n69 13\n36 36\n77 46\n16 93\n49 46... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "12/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
There are n pieces arranged in a line, and each piece is colored either by 'A' or by 'B'. You are given a string colors... | null | {"entry_point": "Solution().winnerOfGame", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\nfrom... | code | Skywork/Skywork-OR1-RL-Data/train-code-leetcode-Medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "12/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "8/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Anya and Becky found an N\times M grid that contains distinct integers, and decided to play a game on it. The integer present at the intersection of the i-th row and j-th... | null | {"inputs": ["3\n2 2\n4 1\n2 3\n2 2\n1 4\n2 3\n3 4\n4 2 11 10\n6 7 1 9\n5 12 3 8\n"], "outputs": ["4\n3\n9\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-very_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "8/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
There is a huge blanket on your bed but unfortunately it has N stains. You cover them using
a single, rectangular silk cloth. The silk is expensive, which is why the rec... | null | {"inputs": ["5 2\n0 1\n3 3\n2 0\n0 3\n2 3\n"], "outputs": ["8\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "12/16", "DeepSeek-R1-Distill-Qwen-32B": "2/16", "DeepSeek-R1-Distill-Qwen-7B": "12/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
The neutral city of Eyes City, in the heart of the four countries, is home to the transcontinental train Bandai. The platform has a row of chairs for passengers waiting f... | null | {"inputs": ["5 4\nA\nC\nC\nD\n5 4\nD\nC\nB\nA\n0 0", "5 4\nA\nC\nC\nD\n5 4\nD\nD\nB\nA\n0 0", "5 4\nA\nC\nC\nD\n4 4\nD\nC\nB\nA\n0 0", "5 4\nA\nD\nC\nD\n5 4\nD\nD\nB\nA\n0 0", "5 4\nA\nC\nC\nD\n4 4\nD\nC\nC\nA\n0 0", "5 4\nA\nC\nB\nD\n4 4\nD\nC\nC\nA\n0 0", "5 4\nA\nC\nC\nD\n4 4\nD\nB\nB\nA\n0 0", "5 4\nA\nB\nB\nD\n4 4... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-unknown_difficulty | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "14/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
In Summer Informatics School, if a student doesn't behave well, teachers make a hole in his badge. And today one of the teachers caught a group of $n$ students doing yet ... | null | {"inputs": ["3\n2 3 2\n", "3\n1 2 3\n", "3\n2 3 1\n", "1\n1\n", "2\n2 1\n", "100\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 8... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "6/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Chef has started studying for the upcoming test. The textbook has N pages in total. Chef wants to read at most X pages a day for Y days.
Find out whether it is possible ... | null | {"inputs": ["4\n5 2 3\n10 3 3\n7 7 1\n3 2 1\n"], "outputs": ["YES\nNO\nYES\nNO\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "0/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Takahashi loves the number 7 and multiples of K.
Where is the first occurrence of a multiple of K in the sequence 7,77,777,\ldots? (Also see Output and Sample Input/Outpu... | null | {"inputs": ["101\n", "2\n", "999983\n", "1\n", "1000000\n", "11\n", "13\n", "999863\n", "999953\n", "237169\n", "3\n", "531441\n", "7\n", "823543\n", "21\n", "823543\n", "871131\n", "260522\n", "436426\n", "979445\n", "407775\n", "63340\n", "287940\n", "296263\n", "224593\n", "601449\n", "836991\n", "3", "1803846", "1"... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "10/16", "DeepSeek-R1-Distill-Qwen-32B": "2/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
There is a string, $unrecognized$, of lowercase English letters that is repeated infinitely many times. Given an integer, $unrecognized$, find and print the number of le... | null | {"inputs": ["aba\n10\n", "a\n1000000000000\n"], "outputs": ["7\n", "1000000000000\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "4/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
You are given a tree rooted at node 0 that consists of n nodes numbered from 0 to n - 1. The tree is represented by an ... | null | {"entry_point": "Solution().findSubtreeSizes", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\n... | code | Skywork/Skywork-OR1-RL-Data/test-code-leetcode-Medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane and an integer k, return the k ... | null | {"entry_point": "Solution().kClosest", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\nfrom mat... | code | Skywork/Skywork-OR1-RL-Data/train-code-leetcode-Medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "4/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
There are n people and k keys on a straight line. Every person wants to get to the office which is located on the line as well. To do that, he needs to reach some point w... | null | {"inputs": ["2 4 50\n20 100\n60 10 40 80\n", "1 2 10\n11\n15 7\n", "2 5 15\n10 4\n29 23 21 22 26\n", "3 10 1500\n106 160 129\n1333 1532 1181 1091 1656 1698 1291 1741 1242 1163\n", "5 20 1\n314 316 328 323 321\n30 61 11 83 19 63 97 87 14 79 43 57 75 48 47 95 41 27 8 88\n", "20 20 1000000000\n911196469 574676950 88404724... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "14/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "4/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Given an integer N, find the base -2 representation of N.
Here, S is the base -2 representation of N when the following are all satisfied:
- S is a string consisting of ... | null | {"inputs": ["-9\n", "123456789\n", "0\n", "-84\n", "-60\n", "-41\n", "-100\n", "8\n", "586260100\n", "-192321079\n", "95834122\n", "802780784\n", "418379342\n", "-790013317\n", "-445130206\n", "189801569\n", "1000000000\n", "-1000000000\n", "-1", "208967441", "-6", "-2", "180276081", "-3", "1", "175198680", "-4", "2", ... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "4/16", "DeepSeek-R1-Distill-Qwen-32B": "2/16", "DeepSeek-R1-Distill-Qwen-7B": "2/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
A program was supposed to print an array of integers. The program forgot to print whitespaces and the array is printed ... | null | {"entry_point": "Solution().numberOfArrays", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\nfr... | code | Skywork/Skywork-OR1-RL-Data/train-code-leetcode-Hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "2/16", "DeepSeek-R1-Distill-Qwen-7B": "6/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Your task is to write a function that does just what the title suggests (so, fair warning, be aware that you are not getting out of it just throwing a lame bas sorting me... | null | {"fn_name": "first_n_smallest", "inputs": ["[1, 2, 3, 4, 5]\n3", "[5, 4, 3, 2, 1]\n3", "[1, 2, 3, 1, 2]\n3", "[1, 2, 3, -4, 0]\n3", "[1, 2, 3, 4, 5]\n0", "[1, 2, 3, 4, 5]\n5", "[1, 2, 3, 4, 2]\n4", "[2, 1, 2, 3, 4, 2]\n2", "[2, 1, 2, 3, 4, 2]\n3", "[2, 1, 2, 3, 4, 2]\n4"], "outputs": ["[1, 2, 3]", "[3, 2, 1]", "[1, 2, ... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "8/16", "DeepSeek-R1-Distill-Qwen-32B": "14/16", "DeepSeek-R1-Distill-Qwen-7B": "10/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
# ASC Week 1 Challenge 5 (Medium #2)
Create a function that takes a 2D array as an input, and outputs another array that contains the average values for the numbers in t... | null | {"fn_name": "avg_array", "inputs": ["[[1, 2, 3, 4], [5, 6, 7, 8]]", "[[2, 3, 9, 10, 7], [12, 6, 89, 45, 3], [9, 12, 56, 10, 34], [67, 23, 1, 88, 34]]", "[[2, 5, 4, 3, 19], [2, 5, 6, 7, 10]]", "[[1.2, 8.521, 0.4, 3.14, 1.9], [2, 4.5, 3.75, 0.987, 1.0]]", "[[2, 5, -4, 3, -19], [-2, -5, 6, 7, 10]]", "[[-2, -18, -45, -10],... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "2/16", "DeepSeek-R1-Distill-Qwen-7B": "10/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
# Definition (Primorial Of a Number)
*Is similar to factorial of a number*, **_In primorial_**, not all the natural numbers get multiplied, **_only prime numbers are mul... | null | {"fn_name": "num_primorial", "inputs": ["3", "4", "5", "8", "9"], "outputs": ["30", "210", "2310", "9699690", "223092870"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "12/16", "DeepSeek-R1-Distill-Qwen-7B": "4/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Ever since you started work at the grocer, you have been faithfully logging down each item and its category that passes through. One day, your boss walks in and asks, "Wh... | null | {"fn_name": "group_groceries", "inputs": ["\"fruit_banana,vegetable_carrot,meat_chicken,drink_juice\"", "\"fruit_banana,vegetable_carrot,fruit_apple,canned_sardines,drink_juice,fruit_orange\"", "\"vegetable_celery,meat_chicken,meat_beef,fruit_banana,vegetable_carrot,canned_sardines,drink_juice,frozen_fries,fruit_lemon\... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "14/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
You are given an integer array nums of size n where n is even, and an integer k.
You can perform some changes on the ar... | null | {"entry_point": "Solution().minChanges", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\nfrom m... | code | Skywork/Skywork-OR1-RL-Data/test-code-leetcode-Medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "6/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
Given an array of positive integers nums, return the maximum possible sum of an ascending subarray in nums.
A subarray ... | null | {"entry_point": "Solution().maxAscendingSum", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\nf... | code | Skywork/Skywork-OR1-RL-Data/train-code-leetcode-Easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "10/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
You are given an array $A$, consisting of $n$ positive integers $a_1, a_2, \dots, a_n$, and an array $B$, consisting of $m$ positive integers $b_1, b_2, \dots, b_m$.
Ch... | null | {"inputs": ["1\n20\n2\n10 20\n", "3\n3 2 2\n5\n1 5 7 7 9\n", "4\n1 3 5 7\n4\n7 5 3 1\n", "1\n1\n10\n1 2 3 4 5 6 7 8 9 10\n", "1\n148\n1\n40\n", "4\n77 112 81 91\n8\n183 174 187 111 121 21 129 28\n", "10\n80 141 15 177 191 182 115 183 36 3\n20\n129 114 183 94 169 16 18 104 49 146 68 157 33 38 10 77 112 47 73 37\n", "20\... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
Given a string s and an array of strings words, return the number of words[i] that is a subsequence of s.
A subsequence... | null | {"entry_point": "Solution().numMatchingSubseq", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\... | code | Skywork/Skywork-OR1-RL-Data/train-code-leetcode-Medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "10/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "2/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
You are given a list of $N$ numbers $a_1,a_2,\ldots,a_n$. For each element at position $\boldsymbol{i}$ ($1\leq i\leq N$), we define $\text{Left}(i)$ and $\textit{Right}(... | null | {"inputs": ["5\n5 4 3 4 5\n"], "outputs": ["8\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "14/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "2/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
*This kata is based on [Project Euler Problem #349](https://projecteuler.net/problem=349). You may want to start with solving [this kata](https://www.codewars.com/kata/la... | null | {"fn_name": "langtons_ant", "inputs": ["0", "1", "2", "10", "100", "1000", "10000", "100000", "1000000", "10000000"], "outputs": ["0", "1", "2", "6", "20", "118", "720", "11108", "114952", "1153412"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "14/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
You have a certain number of processors, each having 4 cores. The number of tasks to be executed is four times the numb... | null | {"entry_point": "Solution().minProcessingTime", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\... | code | Skywork/Skywork-OR1-RL-Data/train-code-leetcode-Medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
You are given an array of integers nums of size 3.
Return the maximum possible number whose binary representation can b... | null | {"entry_point": "Solution().maxGoodNumber", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\nfro... | code | Skywork/Skywork-OR1-RL-Data/test-code-leetcode-Medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "0/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
It is September 9 in Japan now.
You are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?
-----Constraints-----
- 10≤N≤99
... | null | {"inputs": ["29\n", "72\n", "91\n", "1", "69", "115", "84", "0", "181", "168", "174", "304", "143", "465", "929", "109", "820", "147", "112", "19", "215", "34", "161", "8", "189", "15", "361", "17", "485", "16", "348", "3", "49", "2", "41", "4", "23", "-2", "7", "6", "9", "5", "-3", "10", "-4", "20", "-8", "13", "-10",... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "2/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Read problem statements in [Hindi], [Bengali], [Mandarin Chinese], [Russian], and [Vietnamese] as well.
Consider the following function, where + denotes string concatena... | null | {"inputs": ["2\n2\n5 9\n7\n1 2 4 8 16 64 128"], "outputs": ["12\n127"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "12/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "6/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Salem gave you $n$ sticks with integer positive lengths $a_1, a_2, \ldots, a_n$.
For every stick, you can change its length to any other positive integer length (that is... | null | {"inputs": ["3\n10 1 4\n", "5\n1 1 2 2 3\n", "1\n5\n", "2\n1 2\n", "3\n1 1 1\n", "5\n100 100 100 100 100\n", "113\n86 67 31 33 72 100 88 63 16 12 79 80 76 45 31 96 44 10 24 33 53 11 56 100 23 57 9 48 28 73 18 48 12 89 73 9 51 11 82 94 90 92 34 99 54 58 33 67 35 87 58 90 94 64 57 80 87 99 84 99 20 1 63 12 16 40 50 95 33... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "8/16", "DeepSeek-R1-Distill-Qwen-32B": "14/16", "DeepSeek-R1-Distill-Qwen-7B": "8/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Let N be a positive even number.
We have a permutation of (1, 2, ..., N), p = (p_1, p_2, ..., p_N).
Snuke is constructing another permutation of (1, 2, ..., N), q, follow... | null | {"inputs": ["4\n3 2 4 1\n", "2\n1 2\n", "8\n4 6 3 2 8 5 7 1\n", "2\n0 2", "8\n4 6 5 2 8 5 7 1", "4\n3 3 4 1", "2\n-1 2", "8\n4 6 5 2 8 5 0 1", "2\n-1 0", "8\n2 6 5 2 8 5 0 1", "2\n-1 1", "8\n2 6 5 2 8 4 0 1", "2\n0 1", "8\n2 6 5 2 1 4 0 1", "2\n0 0", "2\n0 -1", "2\n-2 0", "2\n-2 -1", "2\n-1 -1", "2\n-1 -2", "2\n0 -2", ... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-very_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
You're given an array $b$ of length $n$. Let's define another array $a$, also of length $n$, for which $a_i = 2^{b_i}$ ($1 \leq i \leq n$).
Valerii says that every two ... | null | {"inputs": ["2\n6\n4 3 0 1 2 0\n2\n2 5\n", "1\n3\n1 1 2\n", "1\n3\n1 1 1\n", "1\n3\n1 2 3\n", "1\n3\n1 2 3\n", "1\n3\n1 1 1\n", "1\n3\n1 1 2\n", "1\n3\n1 2 2\n", "2\n6\n0 3 0 1 2 0\n2\n2 5\n", "1\n3\n0 2 1\n", "1\n3\n0 1 1\n", "1\n3\n0 2 2\n", "1\n3\n0 2 4\n", "1\n3\n1 2 1\n", "1\n3\n1 2 4\n", "1\n3\n1 3 1\n", "1\n3\n1... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "10/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Sherlock Holmes is bored to death as there aren't any interesting cases to solve. Dr Watson finding it impossible to be around Sherlock goes out to get some fresh air. Ju... | null | {"inputs": ["2 00010\n"], "outputs": ["2\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "2/16", "DeepSeek-R1-Distill-Qwen-7B": "12/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
You wrote down all integers from $0$ to $10^n - 1$, padding them with leading zeroes so their lengths are exactly $n$. For example, if $n = 3$ then you wrote out 000, 001... | null | {"inputs": ["1\n", "2\n", "3\n", "4\n", "5\n", "6\n", "7\n", "8\n", "9\n", "10\n", "1448\n", "100\n", "4\n", "8\n", "10\n", "7\n", "3\n", "5\n", "199\n", "6\n", "1447\n", "1337\n", "9\n", "189\n", "751\n", "110\n", "15\n", "12\n", "19\n", "13\n", "22\n", "132\n", "213\n", "963\n", "279\n", "318\n", "111\n", "24\n", "35... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "8/16", "DeepSeek-R1-Distill-Qwen-7B": "12/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Moamen and Ezzat are playing a game. They create an array $a$ of $n$ non-negative integers where every element is less than $2^k$.
Moamen wins if $a_1 \,\&\, a_2 \,\&\, ... | null | {"inputs": ["3\n3 1\n2 1\n4 0\n", "5\n200000 200000\n24567 23423\n1 200000\n200000 1\n200000 0\n", "5\n2 200000\n199991 200000\n100000 1024\n1024 0\n200000 2048\n", "5\n199991 200000\n199992 200000\n199992 200000\n199992 200000\n199996 200000\n", "5\n200000 200000\n200000 200000\n200000 200000\n200000 200000\n200000 20... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "4/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
In a garden represented as an infinite 2D grid, there is an apple tree planted at every integer coordinate. The apple t... | null | {"entry_point": "Solution().minimumPerimeter", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\n... | code | Skywork/Skywork-OR1-RL-Data/train-code-leetcode-Medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "14/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "2/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
You have to create a function named reverseIt.
Write your function so that in the case a string or a number is passed in as the data , you will return the data in revers... | null | {"fn_name": "reverse_it", "inputs": ["\"Hello\"", "314159", "\"314159\"", "[]", "{}", "true", "[1, 2, 3]"], "outputs": ["\"olleH\"", "951413", "\"951413\"", "[]", "{}", "true", "[1, 2, 3]"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "12/16", "DeepSeek-R1-Distill-Qwen-32B": "8/16", "DeepSeek-R1-Distill-Qwen-7B": "14/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Write a program that extracts n different numbers from the numbers 0 to 100 and outputs the number of combinations that add up to s. Each n number is from 0 to 100, and t... | null | {"inputs": ["3 12\n3 1\n0 0", "5 12\n3 0\n0 0", "5 23\n3 0\n0 0", "5 28\n3 0\n0 0", "6 6\n3 1\n0 0", "3 12\n3 3\n0 0", "6 23\n3 0\n0 0", "3 11\n3 3\n0 0", "3 19\n3 -1\n0 0", "6 19\n3 0\n0 0", "3 11\n3 2\n0 0", "6 26\n3 0\n0 0", "3 22\n3 1\n0 0", "5 12\n0 0\n0 0", "5 15\n3 0\n0 0", "6 46\n3 0\n0 0", "5 12\n1 1\n0 0", "1... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-unknown_difficulty | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "8/16", "DeepSeek-R1-Distill-Qwen-7B": "10/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Given an integer `n` return `"odd"` if the number of its divisors is odd. Otherwise return `"even"`.
**Note**: big inputs will be tested.
## Examples:
All prime number... | null | {"fn_name": "oddity", "inputs": ["1", "5", "16", "27", "121"], "outputs": ["\"odd\"", "\"even\"", "\"odd\"", "\"even\"", "\"odd\""]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "10/16", "DeepSeek-R1-Distill-Qwen-32B": "14/16", "DeepSeek-R1-Distill-Qwen-7B": "12/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
We are given a list nums of integers representing a list compressed with run-length encoding.
Consider each adjacent pa... | null | {"entry_point": "Solution().decompressRLElist", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\... | code | Skywork/Skywork-OR1-RL-Data/train-code-leetcode-Easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "6/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Absent-minded Masha got set of n cubes for her birthday.
At each of 6 faces of each cube, there is exactly one digit from 0 to 9. Masha became interested what is the lar... | null | {"inputs": ["3\n0 1 2 3 4 5\n6 7 8 9 0 1\n2 3 4 5 6 7\n", "3\n0 1 3 5 6 8\n1 2 4 5 7 8\n2 3 4 6 7 9\n", "3\n0 1 2 3 4 5\n0 1 2 3 4 5\n0 1 2 3 4 5\n", "3\n1 2 3 7 8 9\n9 8 7 1 2 3\n7 9 2 3 1 8\n", "1\n5 2 2 5 6 7\n", "1\n7 6 5 8 9 0\n", "1\n2 5 9 6 7 9\n", "1\n6 3 1 9 4 9\n", "1\n1 9 8 3 7 8\n", "2\n1 7 2 0 4 3\n5 2 3 6... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "14/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "6/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Given an array of integers and a target sum, determine the sum nearest to but not exceeding the target that can be created. To create the sum, use any element of your ar... | null | {"inputs": ["2\n3 12\n1 6 9\n5 9\n3 4 4 4 8\n"], "outputs": ["12\n9\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "14/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Alexey, a merry Berland entrant, got sick of the gray reality and he zealously wants to go to university. There are a lot of universities nowadays, so Alexey is getting l... | null | {"inputs": ["2\n5 2 3\n6 4 5\n", "50\n69 6 6\n22 1 1\n23 3 3\n60 13 13\n13 3 3\n7 4 7\n6 1 1\n49 7 9\n68 8 8\n20 2 2\n34 1 1\n79 5 5\n22 1 1\n77 58 65\n10 3 3\n72 5 5\n47 1 1\n82 3 3\n92 8 8\n34 1 1\n42 9 10\n63 14 14\n10 3 3\n38 2 2\n80 6 6\n79 5 5\n53 5 5\n44 7 7\n85 2 2\n24 2 2\n57 3 3\n95 29 81\n77 6 6\n24 1 1\n33 ... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "2/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
An element in an array is dominant if it is greater than all elements to its right. You will be given an array and your task will be to return a list of all dominant elem... | null | {"fn_name": "solve", "inputs": ["[16, 17, 14, 3, 14, 5, 2]", "[92, 52, 93, 31, 89, 87, 77, 105]", "[75, 47, 42, 56, 13, 55]", "[67, 54, 27, 85, 66, 88, 31, 24, 49]", "[76, 17, 25, 36, 29]", "[104, 18, 37, 9, 36, 47, 28]"], "outputs": ["[17, 14, 5, 2]", "[105]", "[75, 56, 55]", "[88, 49]", "[76, 36, 29]", "[104, 47, 28]... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "10/16", "DeepSeek-R1-Distill-Qwen-32B": "14/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
A circular array of length N is defined as follows: N integers A_{1},A_{2},…,A_{N} are placed in a circle in such a way that for each 1 ≤ i < N, A_{i} and A_{i+1} are adj... | null | {"inputs": ["4\n6 1\n0 1 0 1 0 0\n3 0\n0 1 2\n8 2\n0 0 0 2 0 0 0 5\n3 10\n1 2 3"], "outputs": ["6\n3\n23\n66"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "10/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
You have a description of a lever as string s. We'll represent the string length as record |s|, then the lever looks as a horizontal bar with weights of length |s| - 1 wi... | null | {"inputs": ["=^==\n", "9===^==1\n", "2==^7==\n", "41^52==\n", "=^2=4=1===1=\n", "9=6===5==3=9=1=1^7=1==\n", "85=61=36=^93===4==44==35==94===39===15===\n", "==88=^95==83=45===8====73===7==7====1=29====29=8=85=\n", "==41^52==\n", "2===================^2\n", "9^=============1\n", "4=========^=55\n", "123^321\n", "7^1=2\n"... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "12/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "2/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Read problems statements in Mandarin chinese, Russian and Vietnamese as well.
You are given four integers a, b, c and d. Determine if there's a rectangle such that the ... | null | {"inputs": ["3\n1 1 2 2\n3 2 2 3\n1 2 2 2"], "outputs": ["YES\nYES\nNO"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "0/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
You are given three sticks with positive integer lengths of a, b, and c centimeters. You can increase length of some of them by some positive integer number of centimeter... | null | {"inputs": ["1 1 1 2\n", "1 2 3 1\n", "10 2 1 7\n", "1 2 1 5\n", "10 15 17 10\n", "5 5 5 10000\n", "5 7 30 100\n", "5 5 5 300000\n", "4 2 5 28\n", "2 7 8 4\n", "85 50 17 89\n", "17 28 19 5558\n", "5276 8562 1074 8453\n", "9133 7818 3682 82004\n", "81780 54799 231699 808\n", "53553 262850 271957 182759\n", "300000 30000... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "2/16", "DeepSeek-R1-Distill-Qwen-7B": "14/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
There is a long-established secondhand bookstore called JOI secondhand bookstore in your town, and you often use the JOI secondhand bookstore. Each book has a standard pr... | null | {"inputs": ["7 4\n14 1\n13 2\n12 3\n26 2\n8 2\n16 3\n11 2", "7 4\n4 1\n13 2\n12 3\n48 2\n8 2\n16 5\n11 2", "7 4\n4 1\n13 2\n11 3\n48 3\n8 2\n16 5\n11 2", "7 5\n4 1\n13 2\n11 3\n48 3\n8 2\n16 5\n11 2", "7 5\n4 1\n13 2\n11 3\n48 3\n8 2\n23 5\n11 2", "7 5\n4 1\n13 2\n11 3\n43 3\n8 2\n23 5\n11 2", "7 4\n14 1\n13 2\n12 3\n1... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-unknown_difficulty | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "12/16", "DeepSeek-R1-Distill-Qwen-7B": "14/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to sa... | null | {"inputs": ["9\n1000000000 0 0 1000000000 1000000000 0 0 1000000000 1000000000\n", "4\n1 0 1 0\n", "3\n0 0 0\n", "17\n1000000000 0 0 1000000000 1000000000 0 0 1000000000 1000000000 0 0 1000000000 1000000000 0 0 1000000000 1000000000\n", "5\n1000000000 0 0 1000000000 -1000000000\n", "50\n-5 -9 0 44 -10 37 34 -49 11 -22 ... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Some new cashiers started to work at your restaurant.
They are good at taking orders, but they don't know how to capitalize words, or use a space bar!
All the orders ... | null | {"fn_name": "get_order", "inputs": ["\"burgerfriesfriesfriesfriesfriespizzasandwichcokefriesburger\""], "outputs": ["\"Burger Burger Fries Fries Fries Fries Fries Fries Pizza Sandwich Coke\""]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "12/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
With a friend we used to play the following game on a chessboard
(8, rows, 8 columns).
On the first row at the *bottom* we put numbers:
`1/2, 2/3, 3/4, 4/5, 5/6, 6/7, 7/... | null | {"fn_name": "game", "inputs": ["0", "1", "8", "40", "101", "204", "807", "1808", "5014", "120000", "750000", "750001", "3000000", "3000001"], "outputs": ["[0]", "[1, 2]", "[32]", "[800]", "[10201, 2]", "[20808]", "[651249, 2]", "[1634432]", "[12570098]", "[7200000000]", "[281250000000]", "[562501500001, 2]", "[45000000... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "12/16", "DeepSeek-R1-Distill-Qwen-32B": "14/16", "DeepSeek-R1-Distill-Qwen-7B": "12/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Chef has an array A of length N.
Let F(A) denote the maximum frequency of any element present in the array.
For example:
If A = [1, 2, 3, 2, 2, 1], then F(A) = 3 since... | null | {"inputs": ["3\n4\n1 2 1 2\n5\n1 1 1 1 1\n6\n1 2 2 1 2 2\n"], "outputs": ["2\n3\n2\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "10/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Chef wants to buy a stock whose price was S rupees when the market opened. He will buy the stock if and only if its price is in the range [A, B]. The price of the stock h... | null | {"inputs": ["3\n100 93 108 7\n100 94 100 -7\n183 152 172 -17"], "outputs": ["Yes\nNo\nNo"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "12/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Given a sorted doubly linked list and an element X, your need to insert the element X into correct position in the sorted DLL.
Example:
Input:
LinkedList:
X = 9
Output:
Y... | null | {"inputs": ["\"L\"\n\"i\"\n\"n\"\n\"k\"\n\"e\"\n\"d\"\n\"L\"\n\"i\"\n\"s\"\n\"t\"\n\":\"\n\"\\r\"\n\"\\n\"\n\"\\r\"\n\"\\n\"\n\"X\"\n\" \"\n\"=\"\n\" \"\n\"9\""], "outputs": [""]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "14/16", "DeepSeek-R1-Distill-Qwen-32B": "12/16", "DeepSeek-R1-Distill-Qwen-7B": "6/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Chef has an array A of length N consisting of 1 and -1 only.
In one operation, Chef can choose any index i (1≤ i ≤ N) and multiply the element A_{i} by -1.
Find the min... | null | {"inputs": ["4\n4\n1 1 1 1\n5\n1 -1 1 -1 1\n6\n1 -1 -1 1 1 1\n2\n1 -1\n"], "outputs": ["2\n-1\n1\n0\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "6/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Chef recently saw the movie Matrix. He loved the movie overall but he didn't agree with some things in it. Particularly he didn't agree with the bald boy when he declared... | null | {"inputs": ["3\n3 6\nabDefb\nbSpoon\nNIKHil\n6 6\naaaaaa\nssssss\nxuisdP\noooooo\nioowoo\nbdylan\n6 5\nbdfhj\ncacac\nopqrs\nddddd\nindia\nyucky", "3\n3 6\nabDefb\nbSpoon\nNIKHil\n6 6\naaaaaa\nssssss\nxuisdP\noooooo\nioowoo\nbdylan\n6 5\njhfdb\ncacac\nopqrs\nddddd\nindia\nyucky", "3\n3 6\nabDefb\nbSpoon\nNIKHil\n6 6\naa... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "12/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "2/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Aizu Gakuen High School holds a school festival every year. The most popular of these is the haunted house. The most popular reason is that 9 classes do haunted houses in... | null | {"inputs": ["1a 132 243\n1c 324 183\n1f 93 199\n2b 372 163\n2c 229 346\n2e 391 206\n3a 118 168\n3b 263 293\n3d 281 102", "1a 132 243\n1c 324 183\n1f 93 199\n3b 372 163\n2c 229 346\n2e 391 206\n3a 118 168\n3b 263 293\n3d 281 102", "1a 132 243\n1c 324 183\n1f 93 199\n3b 372 163\n2c 229 346\n2e 12 206\n3a 118 168\n3b 263 ... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-unknown_difficulty | {"DeepSeek-R1-Distill-Qwen-1.5B": "2/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "2/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
# Introduction
Ka ka ka cypher is a cypher used by small children in some country. When a girl wants to pass something to the other girls and there are some boys nearby... | null | {"fn_name": "ka_co_ka_de_ka_me", "inputs": ["\"ka\"", "\"a\"", "\"aa\"", "\"z\"", "\"Abbaa\"", "\"maintenance\"", "\"Woodie\"", "\"Incomprehensibilities\""], "outputs": ["\"kaka\"", "\"kaa\"", "\"kaaa\"", "\"kaz\"", "\"kaAkabbaa\"", "\"kamaikantekanakance\"", "\"kaWookadie\"", "\"kaIkancokamprekahekansikabikalikatiekas... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "6/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
You are given a program that consists of $n$ instructions. Initially a single variable $x$ is assigned to $0$. Afterwards, the instructions are of two types:
increase $x... | null | {"inputs": ["2\n8 4\n-+--+--+\n1 8\n2 8\n2 5\n1 1\n4 10\n+-++\n1 1\n1 2\n2 2\n1 3\n2 3\n3 3\n1 4\n2 4\n3 4\n4 4\n", "2\n8 4\n-+--+--+\n2 8\n2 8\n2 5\n1 1\n4 10\n+-++\n1 1\n1 2\n2 2\n1 3\n2 3\n3 3\n1 4\n2 4\n3 4\n4 4\n", "2\n8 4\n-+--+--+\n1 8\n2 8\n2 5\n2 1\n4 10\n+-++\n1 1\n1 2\n2 2\n1 3\n2 3\n3 3\n1 4\n2 4\n3 4\n4 4\... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "14/16", "DeepSeek-R1-Distill-Qwen-7B": "10/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
There is a collection of rocks where each rock has various minerals embeded in it. Each type of mineral is designated by a lowercase letter in the range $a s c i i[a-z]$... | null | {"inputs": ["3 \nabcdde \nbaccd\neeabg\n"], "outputs": ["2\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "2/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "6/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
You are given a positive integer k. You are also given:
a 2D integer array rowConditions of size n where rowConditions... | null | {"entry_point": "Solution().buildMatrix", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\nfrom ... | code | Skywork/Skywork-OR1-RL-Data/train-code-leetcode-Hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "6/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any ord... | null | {"entry_point": "Solution().topKFrequent", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\nfrom... | code | Skywork/Skywork-OR1-RL-Data/train-code-leetcode-Medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "6/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "2/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Each number should be formatted that it is rounded to two decimal places. You don't need to check whether the input is a valid number because only valid numbers are used ... | null | {"fn_name": "two_decimal_places", "inputs": ["4.659725356", "173735326.37837327", "4.653725356"], "outputs": ["4.66", "173735326.38", "4.65"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "14/16", "DeepSeek-R1-Distill-Qwen-32B": "10/16", "DeepSeek-R1-Distill-Qwen-7B": "8/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
You are given an array A of size N. Output the maximum value of A[i]%A[j] (ie. A[i] mod A[j]) over all 1 ≤ i, j ≤ N.
------ Input ------
First line of input contains T... | null | {"inputs": ["1\n2\n1 2"], "outputs": ["1"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "2/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
A *Vampire number* is a positive integer `z` with a factorization `x * y = z` such that
- `x` and `y` have the same number of digits and
- the multiset of digits of `z` ... | null | {"fn_name": "VampireNumber", "inputs": ["10", "100", "155"], "outputs": ["105210", "336960", "939658"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "14/16", "DeepSeek-R1-Distill-Qwen-32B": "14/16", "DeepSeek-R1-Distill-Qwen-7B": "8/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Read problem statements in [Bengali], [Mandarin Chinese], [Russian], and [Vietnamese] as well.
You are given an integer $C$. Let $d$ be the smallest integer such that $2... | null | {"inputs": ["2\n13\n10"], "outputs": ["70\n91"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "0/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Vasya is sitting on an extremely boring math class. To have fun, he took a piece of paper and wrote out n numbers on a single line. After that, Vasya began to write out d... | null | {"inputs": ["3 1\n108\n", "3 2\n108\n", "1 0\n5\n", "5 2\n39923\n", "6 3\n967181\n", "7 1\n2178766\n", "10 0\n3448688665\n", "14 6\n00000000000001\n", "16 15\n8086179429588546\n", "18 15\n703140050361297985\n", "20 9\n34540451546587567970\n", "20 8\n99999999999999999999\n", "20 19\n33137197659033083606\n", "57 13\n1779... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Lisa just got a new math workbook. A workbook contains exercise problems, grouped into chapters. Lisa believes a problem to be special if its index (within a chapter) i... | null | {"inputs": ["5 3\n4 2 6 1 10\n"], "outputs": ["4\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "12/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "4/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
In some country live wizards. They love playing with numbers.
The blackboard has two numbers written on it — a and b. The order of the numbers is not important. Let's c... | null | {"inputs": ["7\n576460752303423487 2\n82 9\n101 104\n10 21\n31 10\n0 1\n10 30\n", "1\n128817972817282999 327672410994637530\n", "66\n7 0\n5 7\n1 3\n3 2\n3 5\n0 6\n1 2\n0 7\n4 5\n4 7\n5 1\n2 0\n4 0\n0 5\n3 6\n7 3\n6 0\n5 2\n6 6\n1 7\n5 6\n2 2\n3 4\n2 1\n5 3\n4 6\n6 2\n3 3\n100000000000 1000000000000000000\n0 1\n4 1\n2 6... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
We have one slime.
You can set the health of this slime to any integer value of your choice.
A slime reproduces every second by spawning another slime that has strictly l... | null | {"inputs": ["2\n4 2 3 1\n", "2\n1 2 3 1\n", "1\n1 1\n", "5\n4 3 5 3 1 2 7 8 7 4 6 3 7 2 3 6 2 7 3 2 6 7 3 4 6 7 3 4 2 5 2 3\n"], "outputs": ["Yes\n", "Yes\n", "No\n", "No\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "2/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a $r \times c$ grid. Each cell on ... | null | {"inputs": ["4\n7 8\nAAPAAAAA\nPPPPAAAA\nPPPPAAAA\nAPAAPPPP\nAPAPPAPP\nAAAAPPAP\nAAAAPPAA\n6 5\nAAAAA\nAAAAA\nAAPAA\nAAPAP\nAAAPP\nAAAPP\n4 4\nPPPP\nPPPP\nPPPP\nPPPP\n3 4\nPPPP\nPAAP\nPPPP\n", "1\n1 1\nA\n", "1\n3 3\nAAA\nAAA\nAAA\n", "1\n4 4\nAAAA\nAAAA\nAAAA\nAAAA\n", "1\n2 2\nAA\nAA\n", "1\n2 2\nAA\nAA\n", "1\n4 4\n... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "14/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
We consider two strings to be anagrams of each other if the first string's letters can be rearranged to form the second string. In other words, both strings must contain ... | null | {"inputs": ["cde\nabc\n"], "outputs": ["4\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "10/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "10/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
In this problem you have to simulate the workflow of one-thread server. There are n queries to process, the i-th will be received at moment t_{i} and needs to be processe... | null | {"inputs": ["5 1\n2 9\n4 8\n10 9\n15 2\n19 1\n", "4 1\n2 8\n4 8\n10 9\n15 2\n", "1 1\n1000000000 1000000000\n", "4 3\n999999996 1000000000\n999999997 1000000000\n999999998 1000000000\n999999999 1000000000\n", "5 1\n2 1\n3 6\n4 5\n6 4\n7 2\n", "10 2\n4 14\n5 2\n6 6\n7 11\n8 6\n9 5\n10 13\n11 8\n13 2\n20 2\n", "6 4\n2 4\... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium_hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Sonya was unable to think of a story for this problem, so here comes the formal description.
You are given the array containing n positive integers. At one turn you can ... | null | {"inputs": ["5\n850 840 521 42 169\n", "2\n1000 1\n", "5\n100 80 60 70 90\n", "75\n392 593 98 533 515 448 220 310 386 79 539 294 208 828 75 534 875 493 94 205 656 105 546 493 60 188 222 108 788 504 809 621 934 455 307 212 630 298 938 62 850 421 839 134 950 256 934 817 209 559 866 67 990 835 534 672 468 768 757 516 959 ... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-hard | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "12/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
My friend wants a new band name for her band. She like bands that use the formula: "The" + a noun with the first letter capitalized, for example:
`"dolphin" -> "The Dolp... | null | {"fn_name": "band_name_generator", "inputs": ["\"knife\"", "\"tart\"", "\"sandles\"", "\"bed\"", "\"qq\""], "outputs": ["\"The Knife\"", "\"Tartart\"", "\"Sandlesandles\"", "\"The Bed\"", "\"Qqq\""]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "8/16", "DeepSeek-R1-Distill-Qwen-7B": "14/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
There is an array with n elements a_1, a_2, ..., a_{n} and the number x.
In one operation you can select some i (1 ≤ i ≤ n) and replace element a_{i} with a_{i} & x, whe... | null | {"inputs": ["4 3\n1 2 3 7\n", "2 228\n1 1\n", "3 7\n1 2 3\n", "4 3\n1 2 7 15\n", "4 3\n7 3 2 1\n", "5 132\n10060 81912 13624 40413 19012\n", "3 32768\n95911 33435 56607\n", "3 65536\n37707 92596 76353\n", "5 65537\n60825 99853 69251 68402 1266\n", "4 22\n17 49 1028 4\n", "4 3\n7 15 1 17\n", "2 1\n3 5\n", "4 10\n3 6 10 ... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "14/16", "DeepSeek-R1-Distill-Qwen-32B": "2/16", "DeepSeek-R1-Distill-Qwen-7B": "2/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
After long studying how embryos of organisms become asymmetric during their development, Dr. Podboq, a famous biologist, has reached his new hypothesis. Dr. Podboq is now... | null | {"inputs": ["(((x x) x) ((x x) (x (x x))))\n(((x x) (x x)) ((x x) ((x x) (x x))))\n(((x x) ((x x) x)) (((x (x x)) x) (x x)))\n(((x x) x) ((x x) (((((x x) x) x) x) x)))\n(((x x) x) ((x (x x)) (x (x x))))\n((((x (x x)) x) (x ((x x) x))) ((x (x x)) (x x)))\n((((x x) x) ((x x) (x (x x)))) (((x x) (x x)) ((x x) ((x x) (x x)... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-unknown_difficulty | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
You are given an array nums consisting of positive integers.
Split the array into one or more disjoint subarrays such t... | null | {"entry_point": "Solution().minimumSplits", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\nfro... | code | Skywork/Skywork-OR1-RL-Data/train-code-leetcode-Medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "6/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Shreyan is appearing for CAT examination and is stuck at a problem to find minimum value needed to be added or subtracted to make a number perfect square.You as his frien... | null | {"inputs": ["3\n25\n168\n19", "1000\n10000000000\n100000000000\n999999999999\n99999999999\n10000000000\n100000000000\n999999999999\n99999999999\n10000000000\n100000000000\n999999999999\n99999999999\n10000000000\n100000000000\n999999999999\n99999999999\n10000000000\n100000000000\n999999999999\n99999999999\n10000000000\n... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-unknown_difficulty | {"DeepSeek-R1-Distill-Qwen-1.5B": "12/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Given are a sequence of N positive integers A_1, A_2, \ldots, A_N, and a positive integer K.
Find the number of non-empty contiguous subsequences in A such that the remai... | null | {"inputs": ["5 4\n1 4 2 3 5\n", "8 4\n4 2 4 2 4 2 4 2\n", "10 7\n14 15 92 65 35 89 79 32 38 46\n", "5 1\n1 4 2 3 5", "10 7\n14 15 101 65 35 89 79 32 38 46", "10 8\n14 26 111 65 35 89 95 32 38 46", "10 3\n14 26 111 65 35 89 95 32 38 46", "5 8\n1 4 2 3 5", "10 7\n18 15 92 65 35 89 79 32 38 46", "10 3\n14 26 111 65 35 89 ... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-medium | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
problem
Play by arranging white and black stones on the table. First, place the stones on the left edge of the table. Then place the stones in the second place from the ... | null | {"inputs": ["8\n1\n1\n1\n1\n0\n0\n0\n0\n8\n1\n0\n1\n1\n0\n0\n0\n1\n0", "8\n1\n1\n1\n1\n0\n0\n0\n0\n8\n1\n0\n0\n1\n0\n0\n0\n1\n0", "8\n1\n0\n1\n1\n0\n0\n0\n0\n4\n1\n0\n1\n1\n0\n0\n0\n1\n0", "8\n1\n0\n1\n1\n0\n0\n0\n0\n2\n1\n0\n1\n1\n0\n0\n-1\n1\n0", "8\n0\n0\n1\n1\n0\n0\n0\n0\n2\n1\n0\n2\n1\n0\n0\n-1\n1\n0", "8\n1\n1\n1... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-unknown_difficulty | {"DeepSeek-R1-Distill-Qwen-1.5B": "16/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "16/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
```if-not:sql
Implement a function that receives two IPv4 addresses, and returns the number of addresses between them (including the first one, excluding the last one).
`... | null | {"fn_name": "ips_between", "inputs": ["\"150.0.0.0\"\n\"150.0.0.1\"", "\"10.0.0.0\"\n\"10.0.0.50\"", "\"20.0.0.10\"\n\"20.0.1.0\"", "\"10.11.12.13\"\n\"10.11.13.0\"", "\"160.0.0.0\"\n\"160.0.1.0\"", "\"170.0.0.0\"\n\"170.1.0.0\"", "\"50.0.0.0\"\n\"50.1.1.1\"", "\"180.0.0.0\"\n\"181.0.0.0\"", "\"1.2.3.4\"\n\"5.6.7.8\""]... | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "12/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "2/16"} | {} |
You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
### Question:
You are given three positive integers num1, num2, and num3.
The key of num1, num2, and num3 is defined as a four-digit ... | null | {"entry_point": "Solution().generateKey", "import_prefix": "import collections\nimport string\nimport math\nimport datetime\n\nfrom typing import *\nfrom functools import *\nfrom collections import *\nfrom itertools import *\nfrom heapq import *\nfrom bisect import *\nfrom string import *\nfrom operator import *\nfrom ... | code | Skywork/Skywork-OR1-RL-Data/test-code-leetcode-Easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "0/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "0/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
You have an array $a$ of size $n$ consisting only of zeroes and ones and an integer $k$. In one operation you can do one of the following:
Select $2$ consecutive element... | null | {"inputs": ["7\n3 2\n0 1 0\n5 3\n1 0 1 1 0\n2 2\n1 1\n4 4\n0 0 0 0\n6 3\n0 0 1 0 0 1\n7 5\n1 1 1 1 1 1 1\n5 3\n0 0 1 0 0\n", "1\n32 32\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n"], "outputs": ["YES\nYES\nYES\nNO\nYES\nYES\nYES\n", "NO\n"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "6/16", "DeepSeek-R1-Distill-Qwen-32B": "0/16", "DeepSeek-R1-Distill-Qwen-7B": "4/16"} | {} |
You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
# Task
We have a N×N `matrix` (N<10) and a robot.
We wrote in each point of matrix x and y coordinates of a point of matrix.
When robot goes to a point of matrix... | null | {"fn_name": "robot_transfer", "inputs": ["[[\"0,1\", \"0,0\", \"1,2\"], [\"1,1\", \"1,0\", \"0,2\"], [\"2,1\", \"2,0\", \"0,0\"]]\n2", "[[\"0,1\", \"0,0\"], [\"1,1\", \"1,0\"]]\n2"], "outputs": ["8", "4"]} | code | Skywork/Skywork-OR1-RL-Data/train-code-taco-easy | {"DeepSeek-R1-Distill-Qwen-1.5B": "14/16", "DeepSeek-R1-Distill-Qwen-32B": "16/16", "DeepSeek-R1-Distill-Qwen-7B": "10/16"} | {} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.