task_type stringclasses 1
value | problem stringlengths 261 3.34k | answer stringlengths 35 6.15k | problem_tokens int64 62 774 | answer_tokens int64 12 2.04k |
|---|---|---|---|---|
coding | Solve the programming task below in a Python markdown code block.
Ripul was skilled in the art of lapidary. He used to collect stones and convert it into decorative items for sale. There were n stone shops. Each shop was having one exclusive stone of value s[i] , where 1<=i<=n. If number of stones collected are more ... | {"inputs": ["1\n3\n1 2 3"], "outputs": ["6 1 2"]} | 483 | 24 |
coding | Solve the programming task below in a Python markdown code block.
Rick wants a faster way to get the product of the largest pair in an array. Your task is to create a performant solution to find the product of the largest two integers in a unique array of positive numbers. All inputs will be valid.
Passing [2, 6, 3] sh... | {"functional": "_inputs = [[[56, 335, 195, 443, 6, 494, 252]], [[154, 428, 455, 346]], [[39, 135, 47, 275, 37, 108, 265, 457, 2, 133, 316, 330, 153, 253, 321, 411]], [[136, 376, 10, 146, 105, 63, 234]], [[354, 463, 165, 62, 472, 53, 347, 293, 252, 378, 420, 398, 255, 89]], [[346, 446, 26, 425, 432, 349, 123, 269, 285, ... | 229 | 607 |
coding | Solve the programming task below in a Python markdown code block.
Chef has decided to join a Gym in ChefLand and if possible, also hire a personal trainer at the gym. The monthly cost of the gym is X and personal training will cost him an additional Y per month. Chef's total budget per month is only Z. Print 1 if Chef ... | {"inputs": ["4\n1 2 3\n10 12 13\n23 1 22\n23 1 63"], "outputs": ["2\n1\n0\n2"]} | 525 | 49 |
coding | Solve the programming task below in a Python markdown code block.
Alice wrote an exam containing N true or false questions (i.e. questions whose answer is either true or false). Each question is worth 1 mark and there is no negative marking in the examination. Alice scored K marks out of N.
Bob wrote the same exam but... | {"inputs": ["3\n1 1\n50 0\n100 76\n"], "outputs": ["0\n50\n24\n"]} | 337 | 36 |
coding | Solve the programming task below in a Python markdown code block.
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 rectangular piece needs to have the least area as possible. You love this blanket and d... | {"inputs": ["5 2\n0 1\n3 3\n2 0\n0 3\n2 3\n"], "outputs": ["8\n"]} | 450 | 36 |
coding | Solve the programming task below in a Python markdown code block.
Given two integers A and B.
Let P denote a sequence of N [prime numbers] such that the sum of the sequence is A.
Let Q denote a sequence of M prime numbers such that the sum of the sequence is B.
Let X denote the maximum absolute difference between P_{... | {"inputs": ["2\n3 6\n3 2"], "outputs": ["0\n1"]} | 483 | 22 |
coding | Solve the programming task below in a Python markdown code block.
There are N mountains ranging from east to west, and an ocean to the west.
At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.
The height of the i-th mountain from the west is H_i.
You can certainly see... | {"inputs": ["1\n1\n", "2\n75 26\n", "4\n6 5 5 8", "4\n6 5 8 8", "4\n6 2 0 8", "4\n9 2 0 8", "4\n9 2 0 9", "4\n6 5 6 8"], "outputs": ["1\n", "1\n", "2\n", "3\n", "2\n", "1\n", "2\n", "3"]} | 290 | 119 |
coding | Solve the programming task below in a Python markdown code block.
## Task
An `ATM` ran out of 10 dollar bills and only has `100, 50 and 20` dollar bills.
Given an amount between `40 and 10000 dollars (inclusive)` and assuming that the ATM wants to use as few bills as possible, determinate the minimal number of 100,... | {"functional": "_inputs = [[40], [250], [260], [230], [60]]\n_outputs = [[[0, 0, 2]], [[2, 1, 0]], [[2, 0, 3]], [[1, 1, 4]], [[0, 0, 3]]]\nimport math\ndef _deep_eq(a, b, tol=1e-5):\n if isinstance(a, float) or isinstance(b, float):\n return math.isclose(a, b, rel_tol=tol, abs_tol=tol)\n if isinstance(a, (... | 292 | 216 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
There is a directed graph of n nodes with each node labeled from 0 to n - 1. The graph is represented by a 0-indexed 2D integer array graph where graph[i] is an integer array of nodes adjacent to node i, meaning there... | {"functional": "def check(candidate):\n assert candidate(graph = [[1,2],[2,3],[5],[0],[5],[],[]]) == [2,4,5,6]\n assert candidate(graph = [[1,2,3,4],[1,2],[3,4],[0,4],[]]) == [4]\n\n\ncheck(Solution().eventualSafeNodes)"} | 177 | 88 |
coding | Solve the programming task below in a Python markdown code block.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each dataset consists of two integers H and W separated by a sin... | {"inputs": ["3 4\n5 6\n2 3\n0 0", "3 4\n5 6\n2 0\n0 0", "3 4\n5 6\n2 4\n0 0", "4 4\n5 6\n2 0\n0 0", "4 4\n5 6\n4 0\n0 0", "3 5\n5 6\n2 2\n0 0", "3 4\n5 0\n2 2\n0 0", "3 4\n5 6\n2 1\n0 0"], "outputs": ["####\n####\n####\n\n######\n######\n######\n######\n######\n\n###\n###\n\n", "####\n####\n####\n\n######\n######\n####... | 163 | 406 |
coding | Solve the programming task below in a Python markdown code block.
Summer is at its peak in Chefland. Chef is planning to purchase a water cooler to keep his room cool. He has two options available:
Rent a cooler at the cost of X coins per month.
Purchase a cooler for Y coins.
Given that the summer season will last fo... | {"inputs": ["3\n5 10 1\n5 10 2\n5 10 3"], "outputs": ["YES\nNO\nNO"]} | 549 | 37 |
coding | Solve the programming task below in a Python markdown code block.
Zubin is the dark messiah. He roams the streets at night, helping the poor and the innocent from evil. He's Batman.
Ghosh is Zubin's nemesis. He's the Riddler to Zubin's Batman. He delights in torturing people with his puzzles.
Tonight, Ghosh has gotten ... | {"inputs": ["10\n\n562189\n8112316\n9855612318\n8548\n12385561\n118\n0\n452157848\n44512\n855"], "outputs": ["2988369\n52526037\n94213633266\n29900\n82470764\n195\n1\n3717187680\n187585\n2138"]} | 236 | 151 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
You are given an array of n strings strs, all of the same length.
We may choose any deletion indices, and we delete all the characters in those indices for each string.
For example, if we have strs = ["abcdef","uvwxyz... | {"functional": "def check(candidate):\n assert candidate(strs = [\"babca\",\"bbazb\"]) == 3\n assert candidate(strs = [\"edcba\"]) == 4\n assert candidate(strs = [\"ghi\",\"def\",\"abc\"]) == 0\n\n\ncheck(Solution().minDeletionSize)"} | 240 | 76 |
coding | Solve the programming task below in a Python markdown code block.
On an xy plane, in an area satisfying 0 ≤ x ≤ W, 0 ≤ y ≤ H, there is one house at each and every point where both x and y are integers.
There are unpaved roads between every pair of points for which either the x coordinates are equal and the difference ... | {"inputs": ["2 2\n3\n6\n2\n7", "2 2\n3\n9\n2\n7", "2 2\n3\n9\n0\n7", "2 2\n3\n9\n1\n7", "2 2\n1\n8\n1\n7", "2 2\n3\n5\n2\n7", "2 2\n3\n16\n2\n7", "2 2\n3\n32\n2\n7"], "outputs": ["31\n", "35\n", "29\n", "32\n", "27\n", "29", "42\n", "58\n"]} | 392 | 151 |
coding | Solve the programming task below in a Python markdown code block.
Chef has three numbers A, B, and C.
He can do the following type of operation:
Select two numbers amongst A, B, and C;
Add 1 to the selected numbers;
Subtract 1 from the remaining number.
Determine whether Chef can make all the three numbers equal afte... | {"inputs": ["4\n1 1 2\n3 7 3\n4 4 4\n1 2 3\n"], "outputs": ["-1\n2\n0\n-1\n"]} | 482 | 46 |
coding | Solve the programming task below in a Python markdown code block.
The R1 company wants to hold a web search championship. There were n computers given for the competition, each of them is connected to the Internet. The organizers believe that the data transfer speed directly affects the result. The higher the speed of ... | {"inputs": ["1 1\n16\n", "1 1\n16\n", "2 2\n200 300\n", "2 2\n200 300\n", "2 2\n200 226\n", "3 2\n40 20 30\n", "2 1\n10000 17\n", "3 1\n21 25 16\n"], "outputs": ["16\n", "16", "200\n", "200", "200\n", "30\n", "10000\n", "25\n"]} | 510 | 155 |
coding | Solve the programming task below in a Python markdown code block.
Reyaan has given you the following problem to solve:
You are given an integer K in base B, represented by an array A of length N such that
0 ≤ A_{i} < B for every 1 ≤ i ≤ N
\sum_{i=1}^N A_{i} \cdot B^{N-i} = K
Note that N ≤ B in this problem.
Find the... | {"inputs": ["4\n4 4\n3 1 0 2\n4 5\n1 2 3 4\n2 2\n1 1\n1 3\n2\n"], "outputs": ["0\n500\n1\n9\n"]} | 668 | 60 |
coding | Solve the programming task below in a Python markdown code block.
Problem
It seems that a magician with a smoky smell will show off his magic.
"Now, think of one favorite integer."
You decide to think of your counting years in your head.
The magician has thrown the query $ N $ times.
Each query is one of the followi... | {"inputs": ["3\n1 1\n1 6\n2 8", "3\n1 0\n1 7\n3 9", "3\n1 2\n1 6\n2 8", "3\n1 1\n1 7\n3 9", "3\n2 0\n1 3\n2 4", "3\n2 1\n1 3\n2 4", "3\n1 2\n2 8\n2 8", "3\n1 2\n2 8\n3 8"], "outputs": ["-8 6\n", "9 0\n", "-8 12\n", "9 7\n", "-4 3\n", "-7 3\n", "-16 2\n", "0 2\n"]} | 576 | 177 |
coding | Solve the programming task below in a Python markdown code block.
In the medieval age, there were 3 kingdoms A, B, and C. The army of these kingdom had N_{A}, N_{B}, and N_{C} soldiers respectively.
You are given that an army with X soldiers can defeat an army with Y soldiers only if X > Y.
An army is said to be do... | {"inputs": ["4\n15 5 6\n12 13 16\n1 1 100\n10 10 20\n"], "outputs": ["YES\nNO\nYES\nNO\n"]} | 467 | 53 |
coding | Solve the programming task below in a Python markdown code block.
In this kata you should simply determine, whether a given year is a leap year or not. In case you don't know the rules, here they are:
* years divisible by 4 are leap years
* but years divisible by 100 are **not** leap years
* but years divisible by 400... | {"functional": "_inputs = [[1984], [2000], [2004], [8], [0], [1234], [1100], [1194]]\n_outputs = [[True], [True], [True], [True], [True], [False], [False], [False]]\nimport math\ndef _deep_eq(a, b, tol=1e-5):\n if isinstance(a, float) or isinstance(b, float):\n return math.isclose(a, b, rel_tol=tol, abs_tol=t... | 139 | 215 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other.
Given an integer n, return all distinct solutions to the n-queens puzzle. You may return the ans... | {"functional": "def check(candidate):\n assert candidate(n = 4) == [[\".Q..\",\"...Q\",\"Q...\",\"..Q.\"],[\"..Q.\",\"Q...\",\"...Q\",\".Q..\"]]\n assert candidate(n = 1) == [[\"Q\"]]\n\n\ncheck(Solution().solveNQueens)"} | 139 | 79 |
coding | Solve the programming task below in a Python markdown code block.
The entire network is under the inspection and direct control of the Decepticons. They have learned our language through the World Wide Web and can easily understand the messages which are being sent. Sam is trying to send the information to Autobots to ... | {"inputs": ["techtrishna online event\nonlin"], "outputs": ["Y"]} | 272 | 20 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
Given two arrays of integers nums and index. Your task is to create target array under the following rules:
Initially target array is empty.
From left to right read nums[i] and index[i], insert at index index[i] the ... | {"functional": "def check(candidate):\n assert candidate(nums = [0,1,2,3,4], index = [0,1,2,2,1]) == [0,4,1,3,2]\n assert candidate(nums = [1,2,3,4,0], index = [0,1,2,3,0]) == [0,1,2,3,4]\n assert candidate(nums = [1], index = [0]) == [1]\n\n\ncheck(Solution().createTargetArray)"} | 145 | 122 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
You are given two m x n binary matrices grid1 and grid2 containing only 0's (representing water) and 1's (representing land). An island is a group of 1's connected 4-directionally (horizontal or vertical). Any cells o... | {"functional": "def check(candidate):\n assert candidate(grid1 = [[1,1,1,0,0],[0,1,1,1,1],[0,0,0,0,0],[1,0,0,0,0],[1,1,0,1,1]], grid2 = [[1,1,1,0,0],[0,0,1,1,1],[0,1,0,0,0],[1,0,1,1,0],[0,1,0,1,0]]) == 3\n assert candidate(grid1 = [[1,0,1,0,1],[1,1,1,1,1],[0,0,0,0,0],[1,1,1,1,1],[1,0,1,0,1]], grid2 = [[0,0,0,0,0]... | 170 | 252 |
coding | Solve the programming task below in a Python markdown code block.
You have a sequence $a$ with length $N$ created by removing some elements (possibly zero) from a permutation of numbers $(1, 2, \dots, N)$. When an element is removed, the length of the sequence doesn't change, but there is an empty spot left where the r... | {"inputs": ["1\n3 1\n2 0 0"], "outputs": ["2"]} | 424 | 22 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
There are n students in a class numbered from 0 to n - 1. The teacher will give each student a problem starting with the student number 0, then the student number 1, and so on until the teacher reaches the student num... | {"functional": "def check(candidate):\n assert candidate(chalk = [5,1,5], k = 22) == 0\n assert candidate(chalk = [3,4,1,2], k = 25) == 1\n\n\ncheck(Solution().chalkReplacer)"} | 219 | 66 |
coding | Solve the programming task below in a Python markdown code block.
Fizza is a cute girl and she wants to be more beautiful.
So she approached a magician to increase her beauty magically. But the magician's
glasses accidently got locked inside the locker and he forgot the password. Without
glasses he can't help her. The... | {"inputs": ["3\n8\n6 3 6 4 5 4 3 6\n9\n5 5 4 5 2 1 3 4 2\n6\n1 2 3 4 5 6"], "outputs": ["1\n2\n0"]} | 526 | 68 |
coding | Solve the programming task below in a Python markdown code block.
Alice has learnt factorization recently. Bob doesn't think she has learnt it properly and hence he has decided to quiz her. Bob gives Alice a very large number and asks her to find out the number of factors of that number. To make it a little easier for ... | {"inputs": ["3\n3\n3 5 7\n3\n2 4 6\n2\n5 5", "3\n3\n3 5 7\n3\n2 4 3\n2\n5 5", "3\n3\n3 3 7\n3\n2 4 3\n2\n5 5", "3\n3\n3 5 7\n3\n2 4 3\n2\n5 2", "3\n3\n3 5 7\n3\n2 4 6\n2\n8 5", "3\n3\n4 3 7\n3\n2 4 3\n2\n5 5", "3\n3\n3 7 7\n3\n2 4 6\n2\n8 5", "3\n3\n3 5 7\n3\n2 4 6\n2\n7 5"], "outputs": ["8\n10\n3", "8\n8\n3\n", "6\n8\... | 356 | 274 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
Given an array of integers arr, return the number of subarrays with an odd sum.
Since the answer can be very large, return it modulo 109 + 7.
Please complete the following python code precisely:
```python
class Solu... | {"functional": "def check(candidate):\n assert candidate(arr = [1,3,5]) == 4\n assert candidate(arr = [2,4,6]) == 0\n assert candidate(arr = [1,2,3,4,5,6,7]) == 16\n assert candidate(arr = [100,100,99,99]) == 4\n assert candidate(arr = [7]) == 1\n\n\ncheck(Solution().numOfSubarrays)"} | 86 | 114 |
coding | Solve the programming task below in a Python markdown code block.
You are given a set $\mbox{A}$ and $n$ other sets.
Your job is to find whether set $\mbox{A}$ is a strict superset of each of the $N$ sets.
Print True, if $\mbox{A}$ is a strict superset of each of the $N$ sets. Otherwise, print False.
A strict s... | {"inputs": ["1 2 3 4 5 6 7 8 9 10 11 12 23 45 84 78\n2\n1 2 3 4 5\n100 11 12\n"], "outputs": ["False\n"]} | 577 | 73 |
coding | Solve the programming task below in a Python markdown code block.
A category page displays a set number of products per page, with pagination at the bottom allowing the user to move from page to page.
Given that you know the page you are on, how many products are in the category in total, and how many products are on ... | {"functional": "_inputs = [[1, 10, 30], [3, 10, 26], [1, 10, 8], [2, 30, 350], [1, 23, 30], [2, 23, 30], [43, 15, 3456]]\n_outputs = [['Showing 1 to 10 of 30 Products.'], ['Showing 21 to 26 of 26 Products.'], ['Showing 1 to 8 of 8 Products.'], ['Showing 31 to 60 of 350 Products.'], ['Showing 1 to 23 of 30 Products.'], ... | 229 | 340 |
coding | Solve the programming task below in a Python markdown code block.
Manasa has a string having N number of A's and 2*N number of B's. She wants to arrange these characters in such a way that in each prefix and in each suffix of the string the number of B's is greater than or equal to the number of A's. Given the value of... | {"inputs": ["2\n1\n2\n"], "outputs": ["1\n4\n"]} | 223 | 20 |
coding | Solve the programming task below in a Python markdown code block.
You have r red, g green and b blue balloons. To decorate a single table for the banquet you need exactly three balloons. Three balloons attached to some table shouldn't have the same color. What maximum number t of tables can be decorated if we know numb... | {"inputs": ["5 4 3\n", "1 1 1\n", "2 3 3\n", "0 1 0\n", "0 3 3\n", "4 0 4\n", "0 0 0\n", "3 5 2\n"], "outputs": ["4\n", "1\n", "2\n", "0\n", "2\n", "2\n", "0\n", "3\n"]} | 276 | 102 |
coding | Solve the programming task below in a Python markdown code block.
You are given a string S of length n with each character being one of the first m lowercase English letters.
Calculate how many different strings T of length n composed from the first m lowercase English letters exist such that the length of LCS (longe... | {"inputs": ["1 2\nb\n", "1 3\nb\n", "1 1\na\n", "1 5\nc\n", "1 2\na\n", "1 26\nz\n", "1 26\ny\n", "1 36\ny\n"], "outputs": ["1\n", "2\n", "0\n", "4\n", "1\n", "25\n", "25\n", "35\n"]} | 320 | 108 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
Given an array of string words, return all strings in words that is a substring of another word. You can return the answer in any order.
A substring is a contiguous sequence of characters within a string
Please comp... | {"functional": "def check(candidate):\n assert candidate(words = [\"mass\",\"as\",\"hero\",\"superhero\"]) == [\"as\",\"hero\"]\n assert candidate(words = [\"leetcode\",\"et\",\"code\"]) == [\"et\",\"code\"]\n assert candidate(words = [\"blue\",\"green\",\"bu\"]) == []\n\n\ncheck(Solution().stringMatching)"} | 90 | 86 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
Given an array nums, return true if the array was originally sorted in non-decreasing order, then rotated some number of positions (including zero). Otherwise, return false.
There may be duplicates in the original arr... | {"functional": "def check(candidate):\n assert candidate(nums = [3,4,5,1,2]) == True\n assert candidate(nums = [2,1,3,4]) == False\n assert candidate(nums = [1,2,3]) == True\n\n\ncheck(Solution().check)"} | 130 | 69 |
coding | Solve the programming task below in a Python markdown code block.
Ridbit starts with an integer $n$.
In one move, he can perform one of the following operations:
divide $n$ by one of its proper divisors, or
subtract $1$ from $n$ if $n$ is greater than $1$.
A proper divisor is a divisor of a number, excluding itself... | {"inputs": ["6\n1\n2\n3\n4\n6\n9\n", "6\n1\n2\n3\n4\n1\n9\n", "6\n1\n2\n3\n7\n1\n1\n", "6\n1\n3\n3\n4\n1\n9\n", "6\n1\n3\n3\n3\n6\n7\n", "6\n1\n4\n3\n7\n1\n1\n", "6\n1\n3\n3\n4\n1\n3\n", "6\n1\n4\n3\n7\n1\n2\n"], "outputs": ["0\n1\n2\n2\n2\n3\n", "0\n1\n2\n2\n0\n3\n", "0\n1\n2\n3\n0\n0\n", "0\n2\n2\n2\n0\n3\n", "0\n2\n... | 373 | 246 |
coding | Solve the programming task below in a Python markdown code block.
For two sequences S and T of length N consisting of 0 and 1, let us define f(S, T) as follows:
- Consider repeating the following operation on S so that S will be equal to T. f(S, T) is the minimum possible total cost of those operations.
- Change S_i ... | {"inputs": ["2\n8 8", "2\n8 6", "2\n3 8", "2\n2 6", "2\n9 6", "2\n4 8", "2\n8 9", "2\n0 6"], "outputs": ["160\n", "136\n", "100\n", "72\n", "144\n", "112\n", "168\n", "48\n"]} | 515 | 108 |
coding | Solve the programming task below in a Python markdown code block.
Zenyk and Marichka are playing a game taking turns alternatively. They have N piles of stones. In the i^{th} pile, there are A_{i} stones initially.
Marichka goes first, and removes any non-zero number of stones from any pile.
After that, in one move... | {"inputs": ["3\n3\n1 2 3\n2\n1 1\n1\n10\n"], "outputs": ["Marichka\nZenyk\nMarichka\n"]} | 514 | 43 |
coding | Solve the programming task below in a Python markdown code block.
You are given an array of N integers a1, a2, ..., aN and an integer K. Find the number of such unordered pairs {i, j} that
- i ≠ j
- |ai + aj - K| is minimal possible
Output the minimal possible value of |ai + aj - K| (where i ≠ j) and the number of ... | {"inputs": ["1\n4 9\n4 4 2 6", "1 \n4 7\n4 0 2 6", "1 \n4 7\n0 0 0 0", "1 \n4 0\n9 1 1 1", "1 \n4 8\n0 1 1 1", "1 \n4 9\n4 4 2 6", "1 \n4 14\n4 4 2 6", "1 \n4 14\n4 1 2 6"], "outputs": ["1 4", "1 3\n", "7 6\n", "2 3\n", "6 3\n", "1 4\n", "4 2\n", "4 1\n"]} | 343 | 189 |
coding | Solve the programming task below in a Python markdown code block.
Two participants are each given a pair of distinct numbers from 1 to 9 such that there's exactly one number that is present in both pairs. They want to figure out the number that matches by using a communication channel you have access to without reveali... | {"inputs": ["2 1\n1 2 1 3\n1 2\n", "2 1\n4 5 6 7\n4 7\n", "2 1\n1 2 1 3\n1 2\n", "2 1\n4 5 6 7\n4 7\n", "2 1\n1 4 1 3\n1 2\n", "2 1\n4 6 6 7\n4 7\n", "2 1\n3 6 6 7\n4 7\n", "2 2\n1 2 3 4\n1 5 3 4\n"], "outputs": ["1\n", "-1\n", "1", "-1", "1\n", "-1\n", "7\n", "1\n"]} | 754 | 184 |
coding | Solve the programming task below in a Python markdown code block.
Write a function `sumTimesTables` which sums the result of the sums of the elements specified in `tables` multiplied by all the numbers in between `min` and `max` including themselves.
For example, for `sumTimesTables([2,5],1,3)` the result should be th... | {"functional": "_inputs = [[[2, 3], 1, 3], [[1, 3, 5], 1, 1], [[1, 3, 5], 1, 10], [[], 1, 10], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 1, 10], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1], 1, 10], [[5, 4, 7, 8, 9, 6, 3, 2, 10, 1], 1, 10], [[-2], -1, 3], [[-2, 2], -1, 3], [[-2, 3], -1, 3], [[2, -3], -1, 3], [[2, 4, 7], -100, 100], [[2, 4... | 196 | 479 |
coding | Solve the programming task below in a Python markdown code block.
The Little Elephant has an integer a, written in the binary notation. He wants to write this number on a piece of paper.
To make sure that the number a fits on the piece of paper, the Little Elephant ought to delete exactly one any digit from number a i... | {"inputs": ["11\n", "11\n", "101\n", "111\n", "111\n", "110\n", "100\n", "101\n"], "outputs": ["1\n", "1\n", "11\n", "11\n", "11\n", "11\n", "10\n", "11\n"]} | 306 | 90 |
coding | Solve the programming task below in a Python markdown code block.
Array inversion indicates how far the array is from being sorted.
Inversions are pairs of elements in array that are out of order.
## Examples
```
[1, 2, 3, 4] => 0 inversions
[1, 3, 2, 4] => 1 inversion: 2 and 3
[4, 1, 2, 3] => 3 inversions: 4 ... | {"functional": "_inputs = [[[]], [[1, 2, 3]], [[2, 1, 3]], [[6, 5, 4, 3, 2, 1]], [[6, 5, 4, 3, 3, 3, 3, 2, 1]]]\n_outputs = [[0], [0], [1], [15], [30]]\nimport math\ndef _deep_eq(a, b, tol=1e-5):\n if isinstance(a, float) or isinstance(b, float):\n return math.isclose(a, b, rel_tol=tol, abs_tol=tol)\n if i... | 229 | 232 |
coding | Solve the programming task below in a Python markdown code block.
You're given an array $a$ of $n$ integers, such that $a_1 + a_2 + \cdots + a_n = 0$.
In one operation, you can choose two different indices $i$ and $j$ ($1 \le i, j \le n$), decrement $a_i$ by one and increment $a_j$ by one. If $i < j$ this operation is... | {"inputs": ["1\n6\n1 0 -3 1 0 1\n", "1\n6\n5 -5 -3 1 1 1\n", "1\n6\n5 -6 -3 2 1 1\n", "1\n6\n5 -4 -4 1 1 1\n", "1\n6\n5 -6 -4 2 2 1\n", "1\n6\n6 -5 -3 1 0 1\n", "1\n6\n3 -6 -4 4 2 1\n", "1\n6\n6 -4 -3 1 0 0\n"], "outputs": ["2\n", "3\n", "4\n", "3\n", "5\n", "2\n", "7\n", "1\n"]} | 596 | 182 |
coding | Solve the programming task below in a Python markdown code block.
In this Kata, you will be given an integer array and your task is to return the sum of elements occupying prime-numbered indices.
~~~if-not:fortran
The first element of the array is at index `0`.
~~~
~~~if:fortran
The first element of an array is at i... | {"functional": "_inputs = [[[]], [[1, 2, 3, 4]], [[1, 2, 3, 4, 5, 6]], [[1, 2, 3, 4, 5, 6, 7, 8]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]]]\n_outputs = [[0], [7], [13], [21], [21], [33], [47]]\nimport math\ndef _deep_eq(... | 199 | 359 |
coding | Solve the programming task below in a Python markdown code block.
A recently found Ancient Prophesy is believed to contain the exact Apocalypse date. The prophesy is a string that only consists of digits and characters "-".
We'll say that some date is mentioned in the Prophesy if there is a substring in the Prophesy t... | {"inputs": ["01-01-2014\n", "29-02-2013-02-2013-29-02-2013\n", "29-02-2013-03-2013-29-02-2013\n", "29-02-3013-02-2013-29-02-2013\n", "30-12-201429-15-208830-12-2014\n", "29-02-201329-02-201321-12-2013\n", "120110201311-10-20151201102013\n", "31-12-201331-11-201331-11-2013\n"], "outputs": ["01-01-2014\n", "13-02-2013\n"... | 516 | 351 |
coding | Solve the programming task below in a Python markdown code block.
Sherlock is given an array of $N$ integers ($A_0,A_1...A_{N-1}$ by Watson. Now Watson asks Sherlock how many different pairs of indices $\boldsymbol{i}$ and $j$ exist such that $\boldsymbol{i}$ is not equal to $j$ but $A_i$ is equal to $A_j$.
That ... | {"inputs": ["2\n3\n1 2 3\n3\n1 1 2\n"], "outputs": ["0\n2\n"]} | 342 | 32 |
coding | Solve the programming task below in a Python markdown code block.
The aliens living in outer space are very advanced in technology,
intelligence and everything, except one, and that is Cooking.
Each year they spend millions of dollars in research, to crack famous recipes prepared by humans.
Recently they came to kno... | {"inputs": ["4\n1 4\n3 10\n2 6\n5 8\n3\n1 5\n2 2 6\n3 1 10 9"], "outputs": ["3\n4\n2"]} | 640 | 54 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You must write an algorithm with O(log n)... | {"functional": "def check(candidate):\n assert candidate(nums = [1,3,5,6], target = 5) == 2\n assert candidate(nums = [1,3,5,6], target = 2) == 1\n assert candidate(nums = [1,3,5,6], target = 7) == 4\n\n\ncheck(Solution().searchInsert)"} | 105 | 88 |
coding | Solve the programming task below in a Python markdown code block.
You are given $n$ distinct points on a plane. The coordinates of the $i$-th point are $(x_i, y_i)$.
For each point $i$, find the nearest (in terms of Manhattan distance) point with integer coordinates that is not among the given $n$ points. If there are... | {"inputs": ["1\n1 1\n", "1\n200000 200000\n", "6\n2 2\n1 2\n2 1\n3 2\n2 3\n5 5\n", "8\n4 4\n2 4\n2 2\n2 3\n1 4\n4 2\n1 3\n3 3\n"], "outputs": ["1 0\n", "200000 199999\n", "1 1\n1 1\n2 0\n3 1\n2 4\n5 4\n", "4 3\n2 5\n2 1\n2 5\n1 5\n4 1\n1 2\n3 2\n"]} | 485 | 178 |
coding | Solve the programming task below in a Python markdown code block.
You are looking for a place to park your car on a wall street. You can park at any position that meets the following requirements:
1. It is not directly in front of a private driveway.
2. It is not directly in front of a bus stop.
3. It is not 5 meter... | {"inputs": ["46\n---B--S-D--S--\nDDBDDBDDBDD\n--S--S--S--S--\nSSD-B---BD-DDSB-----S-S--------S-B----BSB-S--B-S-D\n-SB---S----DD-D-DS---B--BD-S-SD---D----D-B---B-SDD\n------BB-----D--------S--D-BSSS-----B---S-S-SSS---\n----------S--S----D---------SD---DD--D---DSB-B----\n-S---------DDDB---BB----SSD---D-B---S-B-----DD---S... | 485 | 734 |
coding | Solve the programming task below in a Python markdown code block.
Hongcow likes solving puzzles.
One day, Hongcow finds two identical puzzle pieces, with the instructions "make a rectangle" next to them. The pieces can be described by an n by m grid of characters, where the character 'X' denotes a part of the puzzle a... | {"inputs": ["1 1\nX\n", "1 1\nX\n", "1 2\nXX\n", "1 2\nXX\n", "2 1\nX\nX\n", "2 1\nX\nX\n", "2 2\n.X\nXX\n", "2 2\nX.\nX.\n"], "outputs": ["YES\n", "YES\n", "YES\n", "YES\n", "YES\n", "YES\n", "NO\n", "YES\n"]} | 513 | 112 |
coding | Solve the programming task below in a Python markdown code block.
A k-multiple free set is a set of integers where there is no pair of integers where one is equal to another integer multiplied by k. That is, there are no two integers x and y (x < y) from the set, such that y = x·k.
You're given a set of n distinct pos... | {"inputs": ["1 1\n1\n", "1 1\n1\n", "1 1\n2\n", "1 1\n3\n", "1 2\n3\n", "1 4\n3\n", "1 2\n5\n", "1 4\n5\n"], "outputs": ["1\n", "1\n", "1\n", "1\n", "1\n", "1\n", "1\n", "1\n"]} | 276 | 102 |
coding | Solve the programming task below in a Python markdown code block.
Read problems statements in [Mandarin Chinese], [Russian] and [Vietnamese] as well.
Chef is a farmer and a pet lover. He has a lot of his favorite pets cats and dogs in the barn. He knows that there are $C$ cats and $D$ dogs in the barn. Also, one day w... | {"inputs": ["3\n1 1 8\n1 1 4\n1 1 2"], "outputs": ["yes\nyes\nno"]} | 606 | 34 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
A robot on an infinite XY-plane starts at point (0, 0) facing north. The robot receives an array of integers commands, which represents a sequence of moves that it needs to execute. There are only three possible types... | {"functional": "def check(candidate):\n assert candidate(commands = [4,-1,3], obstacles = []) == 25\n assert candidate(commands = [4,-1,4,-2,4], obstacles = [[2,4]]) == 65\n assert candidate(commands = [6,-1,-1,6], obstacles = []) == 36\n\n\ncheck(Solution().robotSim)"} | 309 | 89 |
coding | Solve the programming task below in a Python markdown code block.
Given an array of integers and a positive integer $\boldsymbol{\mbox{k}}$, determine the number of $(i,j)$ pairs where $i<j$ and $ar[i]$ + $ar[j]$ is divisible by $\boldsymbol{\mbox{k}}$.
Example
$ar=[1,2,3,4,5,6]$
$k=5$
Three pairs meet the ... | {"inputs": ["6 3\n1 3 2 6 1 2\n"], "outputs": [" 5\n"]} | 462 | 29 |
coding | Solve the programming task below in a Python markdown code block.
There are n heaps of stone. The i-th heap has h_i stones. You want to change the number of stones in the heap by performing the following process once:
* You go through the heaps from the 3-rd heap to the n-th heap, in this order.
* Let i be the n... | {"inputs": ["4\n4\n1 2 4 100\n4\n100 000 100 1\n5\n5 1 1 1 8\n6\n1 2 3 4 5 6\n", "4\n4\n1 2 5 100\n4\n100 100 100 1\n5\n5 2 1 1 8\n6\n1 2 3 6 5 6\n", "4\n4\n1 0 6 100\n4\n000 101 100 2\n5\n5 1 1 1 8\n6\n1 1 2 3 0 7\n", "4\n4\n2 2 2 100\n4\n100 101 100 1\n5\n5 1 1 1 2\n6\n1 2 4 1 5 6\n", "4\n4\n1 2 6 100\n4\n100 111 100... | 667 | 550 |
coding | Solve the programming task below in a Python markdown code block.
Some programming contest problems are really tricky: not only do they
require a different output format from what you might have expected, but
also the sample output does not show the difference. For an example,
let us look at permutations.
A permutatio... | {"inputs": ["4\n1 4 3 2\n5\n2 3 4 5 1\n1\n1\n0", "4\n1 4 3 4\n5\n2 3 4 5 1\n1\n1\n0", "4\n1 4 3 2\n5\n1 3 4 5 1\n1\n1\n0", "4\n1 4 3 4\n5\n0 3 4 5 0\n0\n1\n0", "4\n1 3 3 0\n0\n3 3 3 1 1\n1\n1\n0", "4\n1 4 3 2\n0\n2 3 4 0 1\n1\n1\n1", "4\n1 4 3 4\n5\n0 3 4 5 1\n1\n1\n0", "4\n1 4 3 4\n5\n3 3 4 5 1\n1\n1\n0"], "outputs": ... | 432 | 302 |
coding | Solve the programming task below in a Python markdown code block.
A valid email address meets the following criteria:
It's composed of a username, domain name, and extension assembled in this format: username@domain.extension
The username starts with an English alphabetical character, and any subsequent characters ... | {"inputs": ["2 \nDEXTER <dexter@hotmail.com>\nVIRUS <virus!@variable.:p>\n"], "outputs": ["DEXTER <dexter@hotmail.com>\n"]} | 461 | 45 |
coding | Solve the programming task below in a Python markdown code block.
Read problem statements in [Hindi], [Bengali], [Mandarin Chinese], [Russian], and [Vietnamese] as well.
Сhef has assembled a football team! Now he needs to choose a name for his team. There are $N$ words in English that Chef considers *funny*. These wor... | {"inputs": ["3\n2\nsuf mas\n3\ngood game guys\n4\nhell bell best test"], "outputs": ["2\n0\n2"]} | 563 | 36 |
coding | Solve the programming task below in a Python markdown code block.
Well, those numbers were right and we're going to feed their ego.
Write a function, isNarcissistic, that takes in any amount of numbers and returns true if all the numbers are narcissistic. Return false for invalid arguments (numbers passed in as string... | {"functional": "_inputs = [[11], [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], [0, 1, 2, 3, 4, 5, 6, 7, 22, 9], ['4'], ['4', 7, '9'], ['words'], [[1, 2]], [407, 8208], [-1], [''], ['', 407], [407, ''], [5, '', 407], [9474], [{}]]\n_outputs = [[False], [True], [False], [True], [True], [False], [False], [True], [False], [False], [Fals... | 132 | 329 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
Given a string num which represents an integer, return true if num is a strobogrammatic number.
A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down).
Please compl... | {"functional": "def check(candidate):\n assert candidate(num = \"69\") == True\n assert candidate(num = \"88\") == True\n assert candidate(num = \"962\") == False\n assert candidate(num = \"1\") == True\n\n\ncheck(Solution().isStrobogrammatic)"} | 98 | 70 |
coding | Solve the programming task below in a Python markdown code block.
You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.
Segment [l_1, r_1] lies within segment [l_2, r_2] iff l_... | {"inputs": ["2\n3 7\n3 9\n", "2\n1 4\n1 5\n", "2\n1 1\n1 1\n", "2\n1 2\n1 3\n", "2\n1 1\n1 2\n", "2\n2 3\n2 4\n", "2\n1 3\n3 3\n", "2\n1 3\n1 5\n"], "outputs": ["1 2\n", "1 2\n", "2 1\n", "1 2\n", "1 2\n", "1 2\n", "2 1\n", "1 2\n"]} | 402 | 150 |
coding | Solve the programming task below in a Python markdown code block.
# Task
If string has more than one neighboring dashes(e.g. --) replace they with one dash(-).
Dashes are considered neighbors even if there is some whitespace **between** them.
# Example
For `str = "we-are- - - code----warriors.-"`
The result ... | {"functional": "_inputs = [['we-are- - - code----warriors.-'], ['a---b- - -c'], ['a------'], ['Lorem - ipsum- - - dolor sit amet, consectetur adipiscing elit. Praesent tristique lectus non erat dapibus tincidunt. Integer non nibh fermentum, cursus-diam -------pharetra, mattis--risus.-------']]\n_outputs = [['we-are- co... | 136 | 304 |
coding | Solve the programming task below in a Python markdown code block.
Today, puppy Tuzik is going to a new dog cinema. He has already left his home and just realised that he forgot his dog-collar! This is a real problem because the city is filled with catchers looking for stray dogs.
A city where Tuzik lives in can be cons... | {"inputs": ["2 3\n1 2\n0 1\nRDL"], "outputs": ["4\n6\n6"]} | 681 | 29 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
There are n buildings in a line. You are given an integer array heights of size n that represents the heights of the buildings in the line.
The ocean is to the right of the buildings. A building has an ocean view if t... | {"functional": "def check(candidate):\n assert candidate(heights = [4,2,3,1]) == [0,2,3]\n assert candidate(heights = [4,3,2,1]) == [0,1,2,3]\n assert candidate(heights = [1,3,2,4]) == [3]\n assert candidate(heights = [2,2,2,2]) == [3]\n\n\ncheck(Solution().findBuildings)"} | 150 | 110 |
coding | Solve the programming task below in a Python markdown code block.
A positive integer number n is written on a blackboard. It consists of not more than 105 digits. You have to transform it into a beautiful number by erasing some of the digits, and you want to erase as few digits as possible.
The number is called beauti... | {"inputs": ["7\n", "3\n", "5\n", "4\n", "2\n", "1\n", "74\n", "88\n"], "outputs": ["-1\n", "3\n", "-1\n", "-1\n", "-1\n", "-1\n", "-1\n", "-1\n"]} | 361 | 73 |
coding | Solve the programming task below in a Python markdown code block.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the servers, and only after that it can be saved in the social networ... | {"inputs": ["1 1\n1 1\n", "1 1\n1 1\n", "1 1\n2 1\n", "1 1\n2 2\n", "1 1\n2 4\n", "3 2\n1 5\n2 5\n3 5\n", "3 2\n1 1\n2 5\n3 5\n", "3 2\n2 1\n2 5\n3 5\n"], "outputs": ["2\n", "2\n", "3", "4", "6", "6\n7\n11\n", "2\n7\n8", "3\n7\n8"]} | 613 | 150 |
coding | Solve the programming task below in a Python markdown code block.
Given are a permutation p_1, p_2, \dots, p_N of (1, 2, ..., N) and an integer K. Maroon performs the following operation for i = 1, 2, \dots, N - K + 1 in this order:
* Shuffle p_i, p_{i + 1}, \dots, p_{i + K - 1} uniformly randomly.
Find the expecte... | {"inputs": ["3 3\n1 2 3", "3 2\n2 1 3", "3 2\n2 3 1", "3 3\n1 2 2", "3 3\n1 2 1", "3 3\n1 3 3", "3 3\n2 3 3", "3 3\n2 3 1"], "outputs": ["499122178\n", "1\n", "2\n", "499122178\n", "499122178\n", "499122178\n", "499122178\n", "499122178\n"]} | 446 | 174 |
coding | Solve the programming task below in a Python markdown code block.
Students of group 199 have written their lectures dismally. Now an exam on Mathematical Analysis is approaching and something has to be done asap (that is, quickly). Let's number the students of the group from 1 to n. Each student i (1 ≤ i ≤ n) has a bes... | {"inputs": ["1\n1\n1\n", "2\n1 2\n1 2\n", "2\n1 2\n2 1\n", "3\n1 2 3\n2 1 3\n", "3\n2 3 1\n1 2 3\n", "3\n1 2 3\n1 2 3\n", "4\n1 2 3 4\n2 1 4 3\n", "4\n2 1 4 3\n3 4 2 1\n"], "outputs": ["1 ", "1 2 ", "2 1 ", "2 1 3 ", "3 1 2 ", "1 2 3 ", "2 1 4 3 ", "4 3 1 2 "]} | 602 | 179 |
coding | Solve the programming task below in a Python markdown code block.
Sorry folks,, admin has no time to create a story for this problem...
You have two integers n and m and you have to print value of factorial(n)%m.
OUTPUT
a single integer containing answer of problem.
Input
23 14567
NOTE You do not need to create a p... | {"inputs": ["23 14567"], "outputs": ["12404"]} | 118 | 23 |
coding | Solve the programming task below in a Python markdown code block.
A Little Elephant and his friends from the Zoo of Lviv like candies very much.
There are N elephants in the Zoo. The elephant with number K (1 ≤ K ≤ N) will be happy if he receives at least A_{K} candies. There are C candies in all in the Zoo.
The Zoo ... | {"inputs": ["2\n2 3\n1 1\n3 7\n4 2 2", "2\n2 1\n1 1\n3 7\n4 2 2", "2\n2 1\n1 2\n3 7\n0 2 2", "2\n2 2\n1 1\n3 3\n4 1 6", "2\n2 2\n1 1\n3 3\n0 0 3", "2\n2 1\n1 2\n3 7\n4 2 2", "2\n2 1\n2 2\n3 7\n0 2 2", "2\n2 0\n1 1\n3 7\n4 2 2"], "outputs": ["Yes\nNo", "No\nNo\n", "No\nYes\n", "Yes\nNo\n", "Yes\nYes\n", "No\nNo\n", "No\... | 485 | 221 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
You are given an integer array ranks and a character array suits. You have 5 cards where the ith card has a rank of ranks[i] and a suit of suits[i].
The following are the types of poker hands you can make from best to... | {"functional": "def check(candidate):\n assert candidate(ranks = [13,2,3,1,9], suits = [\"a\",\"a\",\"a\",\"a\",\"a\"]) == \"Flush\"\n assert candidate(ranks = [4,4,2,4,4], suits = [\"d\",\"a\",\"a\",\"b\",\"c\"]) == \"Three of a Kind\"\n assert candidate(ranks = [10,10,2,12,9], suits = [\"a\",\"b\",\"c\",\"a\... | 173 | 137 |
coding | Solve the programming task below in a Python markdown code block.
International Christmas Present Company (ICPC) is a company to employ Santa and deliver presents on Christmas. Many parents request ICPC to deliver presents to their children at specified time of December 24. Although same Santa can deliver two or more p... | {"inputs": ["4 2 3\n0 2 2\n1 2 10\n0 -1\n1 8\n2 0\n3 2 4\n1 1 0\n1 2 10\n0 0\n1 10\n2 20\n0 25\n18 10 10\n0 2 39\n2 3 81\n3 5 20\n4 8 24\n1 9 10\n7 9 40\n4 2 5\n5 7 20\n1 2 93\n1 4 13\n0 0\n1 100000000\n2 100\n3 941\n4 333\n5 235\n5 300\n7 166\n8 101\n9 100\n0 0 0", "3 2 3\n0 1 2\n1 2 10\n1 -1\n1 8\n2 0\n3 2 4\n1 1 10\... | 741 | 1,814 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
Given a balanced parentheses string s, return the score of the string.
The score of a balanced parentheses string is based on the following rule:
"()" has score 1.
AB has score A + B, where A and B are balanced paren... | {"functional": "def check(candidate):\n assert candidate( \"()\") == 1\n assert candidate( \"(())\") == 2\n assert candidate( \"()()\") == 2\n assert candidate( \"(()(()))\") == 6\n\n\ncheck(Solution().scoreOfParentheses)"} | 117 | 73 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
A k x k magic square is a k x k grid filled with integers such that every row sum, every column sum, and both diagonal sums are all equal. The integers in the magic square do not have to be distinct. Every 1 x 1 grid ... | {"functional": "def check(candidate):\n assert candidate(grid = [[7,1,4,5,6],[2,5,1,6,4],[1,5,4,3,2],[1,2,7,3,4]]) == 3\n assert candidate(grid = [[5,1,3,1],[9,3,3,1],[1,3,3,8]]) == 2\n\n\ncheck(Solution().largestMagicSquare)"} | 143 | 105 |
coding | Solve the programming task below in a Python markdown code block.
Kulyash has given you an array A of size N.
He defines the *subsequence-number* of a non-empty [subsequence]
S of array A as the number formed by the concatenation of all the elements of the subsequence S.
Find the count of non-empty subsequences of... | {"inputs": ["3\n2\n1 2\n4\n1 2 3 4\n2\n7 7\n"], "outputs": ["0\n1\n3\n"]} | 621 | 40 |
coding | Solve the programming task below in a Python markdown code block.
Your task is to create a new implementation of `modpow` so that it computes `(x^y)%n` for large `y`. The problem with the current implementation is that the output of `Math.pow` is so large on our inputs that it won't fit in a 64-bit float.
You're also ... | {"functional": "_inputs = [[11, 10, 300], [11, 100000, 49], [5, 100000000, 19], [2, 3, 5], [4, 12, 3], [200, 3000, 10], [8132, 21302, 5], [9, 193125, 37], [13, 81230123, 22], [29, 1013293125, 492], [31, 902938423012, 1023]]\n_outputs = [[1], [32], [5], [3], [1], [0], [4], [26], [19], [161], [961]]\nimport math\ndef _de... | 121 | 363 |
coding | Solve the programming task below in a Python markdown code block.
In this Kata, we will check if a string contains consecutive letters as they appear in the English alphabet and if each letter occurs only once.
```Haskell
Rules are: (1) the letters are adjacent in the English alphabet, and (2) each letter occurs only... | {"functional": "_inputs = [['abc'], ['abd'], ['dabc'], ['abbc']]\n_outputs = [[True], [False], [True], [False]]\nimport math\ndef _deep_eq(a, b, tol=1e-5):\n if isinstance(a, float) or isinstance(b, float):\n return math.isclose(a, b, rel_tol=tol, abs_tol=tol)\n if isinstance(a, (list, tuple)):\n if... | 197 | 174 |
coding | Solve the programming task below in a Python markdown code block.
After the phenomenal success of the 36th Chamber of Shaolin, San Te has decided to start 37th Chamber of Shaolin. The aim this time is to equip women with shaolin self-defence techniques.
The only condition for a woman to be eligible for the special tra... | {"inputs": ["3\n3\n15 23 65\n3\n15 62 16\n2\n35 9"], "outputs": ["2\n2\n1"]} | 462 | 45 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
You are given an array of intervals, where intervals[i] = [starti, endi] and each starti is unique.
The right interval for an interval i is an interval j such that startj >= endi and startj is minimized. Note that i m... | {"functional": "def check(candidate):\n assert candidate(intervals = [[1,2]]) == [-1]\n assert candidate(intervals = [[3,4],[2,3],[1,2]]) == [-1,0,1]\n assert candidate(intervals = [[1,4],[2,3],[3,4]]) == [-1,2,-1]\n\n\ncheck(Solution().findRightInterval)"} | 138 | 92 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
A peak element in a 2D grid is an element that is strictly greater than all of its adjacent neighbors to the left, right, top, and bottom.
Given a 0-indexed m x n matrix mat where no two adjacent cells are equal, find... | {"functional": "def check(candidate):\n assert candidate(mat = [[1,4],[3,2]]) == [0,1]\n assert candidate(mat = [[10,20,15],[21,30,14],[7,16,32]]) == [1,1]\n\n\ncheck(Solution().findPeakGrid)"} | 166 | 80 |
coding | Solve the programming task below in a Python markdown code block.
You are given an array $a_1, a_2, \dots, a_n$. You can perform operations on the array. In each operation you can choose an integer $i$ ($1 \le i < n$), and swap elements $a_i$ and $a_{i+1}$ of the array, if $a_i + a_{i+1}$ is odd.
Determine whether it ... | {"inputs": ["4\n4\n1 6 31 14\n2\n4 2\n5\n2 9 6 7 10\n3\n6 6 6\n"], "outputs": ["Yes\nNo\nNo\nYes\n"]} | 525 | 59 |
coding | Solve the programming task below in a Python markdown code block.
Read problem statements in [Hindi], [Bengali], [Mandarin Chinese], [Russian], and [Vietnamese] as well.
You are given two binary strings $A$ and $B$, each with length $N$. You may reorder the characters of $A$ in an arbitrary way and reorder the charact... | {"inputs": ["1\n2\n00\n10"], "outputs": ["2"]} | 578 | 20 |
coding | Solve the programming task below in a Python markdown code block.
A robber has attempted to rob a bank but failed to complete his task. However, he had managed to open all the safes.
Oleg the bank client loves money (who doesn't), and decides to take advantage of this failed robbery and steal some money from the safes... | {"inputs": ["3 2 4\n1\n3\n", "3 2 4\n1\n1\n", "6 4 8\n1\n4\n", "2 1 3\n1\n3\n", "3 2 4\n1\n3\n", "3 2 4\n1\n1\n", "2 1 3\n1\n3\n", "6 4 8\n1\n4\n"], "outputs": ["1\n", "0\n", "0\n", "0\n", "1", "0", "0", "0"]} | 621 | 130 |
coding | Please solve the programming task below using a self-contained code snippet in a markdown code block.
You are given the root of a binary tree with unique values.
In one operation, you can choose any two nodes at the same level and swap their values.
Return the minimum number of operations needed to make the values at ... | {"functional": "def check(candidate):\n assert candidate(root = tree_node([1,4,3,7,6,8,5,None,None,None,None,9,None,10])) == 3\n assert candidate(root = tree_node([1,3,2,7,6,5,4])) == 3\n assert candidate(root = tree_node([1,2,3,4,5,6])) == 0\n\n\ncheck(Solution().minimumOperations)"} | 173 | 105 |
coding | Solve the programming task below in a Python markdown code block.
ATMs of a well-known bank of a small country are arranged so that they can not give any amount of money requested by the user. Due to the limited size of the bill dispenser (the device that is directly giving money from an ATM) and some peculiarities of ... | {"inputs": ["1 1\n1\n1\n1\n", "1 1\n1\n1\n1\n", "1 20\n1\n1\n200000000\n", "1 20\n1\n1\n200000000\n", "2 5\n1 2\n1\n200000000\n", "2 2\n1 2\n1\n200000000\n", "2 2\n1 2\n1\n200000000\n", "2 5\n1 2\n1\n200000000\n"], "outputs": ["1\n", "1\n", "-1\n", "-1\n", "-1\n", "-1\n", "-1\n", "-1\n"]} | 652 | 192 |
coding | Solve the programming task below in a Python markdown code block.
Chef wants to host some Division-3 contests. Chef has $N$ setters who are busy creating new problems for him. The $i^{th}$ setter has made $A_i$ problems where $1 \leq i \leq N$.
A Division-3 contest should have exactly $K$ problems. Chef wants to pl... | {"inputs": ["5\n1 5 31\n4\n1 10 3\n23\n2 5 7\n20 36\n2 5 10\n19 2\n3 3 300\n1 1 1"], "outputs": ["0\n2\n7\n4\n1"]} | 756 | 77 |
coding | Solve the programming task below in a Python markdown code block.
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
-----Constr... | {"inputs": ["2\n8 5\n", "2\n3 10\n", "3\n3 1 6", "3\n3 2 6", "3\n3 3 6", "3\n2 1 6", "3\n7 0 6", "3\n2 0 6"], "outputs": ["11\n", "11\n", "7\n", "8\n", "9\n", "6\n", "10\n", "5\n"]} | 243 | 112 |
coding | Solve the programming task below in a Python markdown code block.
On a history lesson the teacher asked Vasya to name the dates when n famous events took place. He doesn't remembers the exact dates but he remembers a segment of days [li, ri] (inclusive) on which the event could have taken place. However Vasya also reme... | {"inputs": ["2\n2 3\n1 3\n", "2\n1 3\n1 3\n", "3\n1 2\n2 3\n3 4\n", "10\n1 1\n8 10\n1 7\n6 8\n5 7\n1 9\n8 8\n6 10\n1 4\n3 4\n", "10\n2 8\n8 10\n1 6\n1 2\n7 10\n1 9\n6 8\n3 4\n1 3\n5 8\n", "10\n1 4\n1 12\n5 7\n5 5\n2 5\n1 7\n1 10\n7 9\n8 9\n9 11\n", "10\n2 8\n8 10\n1 6\n1 10\n7 10\n1 9\n6 8\n3 4\n1 3\n5 8\n", "10\n1 2\n... | 247 | 420 |
coding | Solve the programming task below in a Python markdown code block.
You are given a permutation p = (p_1, \ldots, p_N) of \\{ 1, \ldots, N \\}. You can perform the following two kinds of operations repeatedly in any order:
* Pay a cost A. Choose integers l and r (1 \leq l < r \leq N), and shift (p_l, \ldots, p_r) to the... | {"inputs": ["1 8 9\n1", "1 8 3\n1", "1 8 5\n1", "1 8 10\n1", "1 12 10\n1", "1 10 10\n1", "3 4 11\n3 1 2", "3 26 30\n3 1 2"], "outputs": ["0", "0", "0", "0", "0", "0", "4", "26"]} | 522 | 119 |
coding | Solve the programming task below in a Python markdown code block.
Two strings ```a``` and b are called isomorphic if there is a one to one mapping possible for every character of ```a``` to every character of ```b```. And all occurrences of every character in ```a``` map to same character in ```b```.
## Task
In this ... | {"functional": "_inputs = [['ESTATE', 'DUELED'], ['XXX', 'YYY'], ['CBAABC', 'DEFFED'], ['RAMBUNCTIOUSLY', 'THERMODYNAMICS'], ['DISCRIMINATIVE', 'SIMPLIFICATION'], ['SEE', 'SAW'], ['BANANA', 'SENSE'], ['AB', 'CC'], ['XXY', 'XYY'], ['ABCBACCBA', 'ABCBACCAB'], ['AA', 'BBB'], ['abcdefghijk', 'abcdefghijba']]\n_outputs = [[... | 197 | 296 |
coding | Solve the programming task below in a Python markdown code block.
One day Alice visited Byteland to purchase jewels for her upcoming wedding anniversary.
In Byteland, every Jewelry shop has their own discount methods to attract the customers. One discount method called Buy1-Get1 caught Alice's attention. That is, Alice... | {"inputs": ["4\nssss\nssas\nsa\ns", "4\nssss\nrsas\nsa\ns", "4\ntsss\nsasr\nas\nt", "4\nssss\natrs\nat\nt", "4\nrsss\natsr\nbt\nt", "4\nrstq\narsr\nra\nt", "4\nrstu\nrqta\nar\nt", "4\nssss\nsasr\nsa\ns"], "outputs": ["2\n3\n2\n1", "2\n3\n2\n1\n", "3\n3\n2\n1\n", "2\n4\n2\n1\n", "3\n4\n2\n1\n", "4\n3\n2\n1\n", "4\n4\n2\... | 487 | 191 |
coding | Solve the programming task below in a Python markdown code block.
Theofanis really likes sequences of positive integers, thus his teacher (Yeltsa Kcir) gave him a problem about a sequence that consists of only special numbers.
Let's call a positive number special if it can be written as a sum of different non-negative... | {"inputs": ["3\n6 7\n2 6\n9 255\n", "3\n1 2\n2 6\n7 433\n", "3\n6 7\n2 6\n9 205\n", "3\n1 2\n2 6\n7 749\n", "3\n0 4\n2 6\n39 564\n", "3\n0 8\n0 6\n105 46\n", "3\n1 7\n0 6\n35 564\n", "3\n0 4\n0 6\n39 564\n"], "outputs": ["43\n6\n5380840\n", "1\n6\n6607553\n", "43\n6\n5315221\n", "1\n6\n41311999\n", "0\n6\n452236824\n",... | 347 | 277 |
coding | Solve the programming task below in a Python markdown code block.
# It's too hot, and they can't even…
One hot summer day Pete and his friend Billy decided to buy watermelons. They chose the biggest crate. They rushed home, dying of thirst, and decided to divide their loot, however they faced a hard problem.
Pete and... | {"functional": "_inputs = [[4], [2], [5], [88], [100], [67], [90], [10], [99], [32]]\n_outputs = [[True], [False], [False], [True], [True], [False], [True], [True], [False], [True]]\nimport math\ndef _deep_eq(a, b, tol=1e-5):\n if isinstance(a, float) or isinstance(b, float):\n return math.isclose(a, b, rel_t... | 295 | 216 |
coding | Solve the programming task below in a Python markdown code block.
N persons are standing in a row. The height of the i-th person from the front is A_i.
We want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:
Condition: Nobody in front... | {"inputs": ["5\n1 3 3 3 3", "5\n2 1 5 8 3", "5\n1 2 3 6 3", "5\n2 1 2 8 4", "5\n4 4 3 6 6", "5\n4 4 3 7 6", "5\n3 1 5 8 3", "5\n0 1 2 8 4"], "outputs": ["0\n", "6\n", "3\n", "5\n", "1\n", "2\n", "7\n", "4\n"]} | 279 | 142 |
coding | Solve the programming task below in a Python markdown code block.
We conducted a survey on newspaper subscriptions. More specifically, we asked each of the N respondents the following two questions:
* Question 1: Are you subscribing to Newspaper X?
* Question 2: Are you subscribing to Newspaper Y?
As the result, A ... | {"inputs": ["0 2 1", "0 3 1", "0 3 2", "1 3 2", "2 3 1", "1 5 0", "1 3 0", "10 2 5"], "outputs": ["1 3\n", "1 4\n", "2 5\n", "2 4\n", "1 2\n", "0 4\n", "0 2\n", "2 0\n"]} | 266 | 111 |
coding | Solve the programming task below in a Python markdown code block.
You are solving the crossword problem K from IPSC 2014. You solved all the clues except for one: who does Eevee evolve into? You are not very into pokemons, but quick googling helped you find out, that Eevee can evolve into eight different pokemons: Vapo... | {"inputs": ["6\n.s..o.\n", "6\n......\n", "6\n..p...\n", "6\n......\n", "6\n.s..o.\n", "6\n..p...\n", "7\nj......\n", "7\n...feon\n"], "outputs": ["espeon\n", "espeon\n", "espeon\n", "espeon\n", "espeon\n", "espeon\n", "jolteon\n", "leafeon\n"]} | 423 | 113 |
coding | Solve the programming task below in a Python markdown code block.
Sachin wants to give a love letter to his girlfriend on valentines day. He
is having a circular piece of paper of radius "r".
He wants to use rectangular piece of paper for letter writing whose length and breadth are integers. In how many ways can he ... | {"inputs": ["12"], "outputs": ["424"]} | 159 | 15 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.