Split (3)

train · 13.3k rows

tests dict	problem stringlengths 29 13k
{ "inputs": [ "5\n2 4\nabac\nzbab\n2 4\naaaa\nbbbb\n3 3\nbaa\naaa\naab\n2 2\nab\nbb\n3 1\na\nb\nc\n", "5\n2 4\nabac\nzbab\n2 4\naaaa\nbbbb\n3 3\nbaa\naaa\naab\n2 2\nab\nbb\n3 1\na\nb\nc\n", "5\n2 4\nabac\nbabz\n2 4\naaaa\nbbbb\n3 3\nbaa\naaa\naab\n2 2\nab\nbb\n3 1\na\nb\nc\n", "5\n2 4\nabac\nbabz\n2 4...	You are given n strings a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters. Find any string s of length m such that each of the given n strings differs from s in at most one position. Formally, for each given string a_i, there is no more than one position j such that...
{ "inputs": [ "5\n00100\n", "6\n111010\n", "5\n10001\n", "7\n1100010\n", "18\n110100000000000000\n", "70\n0010011001010100000110011001011111101011010110110101110101111011101010\n", "7\n0000000\n", "17\n00100000000000000\n", "16\n1101010010000000\n", "3\n111\n", "4\n0000\n",...	Vasya and Petya have invented a new game. Vasya takes a stripe consisting of 1 × n square and paints the squares black and white. After that Petya can start moves — during a move he may choose any two neighboring squares of one color and repaint these two squares any way he wants, perhaps in different colors. Petya can...
{ "inputs": [ "5\ninsert A\ninsert T\ninsert C\nfind G\nfind A", "13\ninsert AAA\ninsert AAC\ninsert AGA\ninsert AGG\ninsert TTT\nfind AAA\nfind CCC\nfind CCC\ninsert CCC\nfind CCC\ninsert T\nfind TTT\nfind T", "5\ninsert A\ninsert U\ninsert C\nfind G\nfind A", "13\ninsert AAA\ninsert AAC\ninsert AGA\...	Your task is to write a program of a simple dictionary which implements the following instructions: * insert str: insert a string str in to the dictionary * find str: if the distionary contains str, then print 'yes', otherwise print 'no' Notes Template in C Constraints * A string consists of 'A', 'C', 'G', or 'T' ...
{ "inputs": [ "1 4\nSE23\n", "5 7\n000E0T3\nT0TT0T0\n010T0T0\n2T0T0T0\n0T0S000\n", "1 10\n9T9TSET9T9\n", "3 3\n920\n752\nE8S\n", "1 5\n78S6E\n", "2 2\nE9\nS4\n", "3 3\n000\nS0E\n000\n", "5 1\n9\nT\nE\n6\nS\n", "3 5\n00000\nS0E01\n00000\n", "5 5\nS9999\nTTTT9\n99999\n9TTTT\n9999...	You're a mikemon breeder currently in the middle of your journey to become a mikemon master. Your current obstacle is go through the infamous Biridian Forest. The forest The Biridian Forest is a two-dimensional grid consisting of r rows and c columns. Each cell in Biridian Forest may contain a tree, or may be vacant....
{ "inputs": [ "4\n1 4 1\n1 3 1\n2 2 4\n2 3 5\n1\n1 5 1\n7\n2 2 2\n1 4 1\n2 1 3\n1 4 1\n1 1 1\n2 5 5\n1 4 2\n0", "4\n1 4 1\n1 3 2\n2 2 4\n2 3 5\n1\n1 5 1\n7\n2 2 2\n1 4 1\n2 1 3\n1 4 1\n1 1 1\n2 5 5\n1 4 2\n0", "4\n1 4 1\n1 3 2\n1 2 4\n2 3 5\n1\n1 5 1\n7\n2 2 2\n1 4 1\n2 1 3\n1 4 1\n1 1 1\n2 5 5\n1 4 2\n0"...	Tetris is a game in which falling blocks are lined up on the board and erased. Here, let's consider a game that arranges it a little. The size of the board of this game is 5 frames wide, and it is high enough to accommodate all the blocks that appear. The falling blocks are straight and come in two types, landscape an...
{ "inputs": [ "1\naabbcc\n\nSAMPLE", "10\naabbccddeeffgghhiijjkkllmmnnooppqqrrssttuuvvwwxxyyzz\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\nabcdefghijklmnopqrstuvwxyz\n...............................aaaaaaaaaaaaaaaaaaaaaa\n....................,,,,,,,,,,,,,,,,,,,,,aaaaaaaaaaaaa\naaaaaaaaaaaaa.................d...	After the Tatvik Hiring Challenge, Karan's NLP professor has given him another homework. Since Manhattan Associates Hiring Challenge is round the corner and Karan is busy preparing for it, he turns to you for help. Given a string, replace all the consecutively occurring characters by a single, same character. Input: ...
{ "inputs": [ "6\[email protected]\[email protected]\[email protected]\[email protected]\[email protected]\[email protected]", "8\[email protected]\[email protected]\[email protected]\[email protected]\[email protected]\[email protected]\[email protected]\[email protected]", "2\...	Polycarp has quite recently learned about email aliases. Of course, he used to suspect that the case of the letters doesn't matter in email addresses. He also learned that a popular mail server in Berland bmail.com ignores dots (characters '.') and all the part of an address from the first character "plus" ('+') to cha...
{ "inputs": [ "5 4\n1 2 1\n2 3 1\n1 3 6\n4 5 8\n", "3 2\n2 1 4\n1 3 2\n", "5 5\n1 2 1\n2 3 1\n3 4 1\n1 5 1\n5 4 10\n", "18 27\n3 16 55467\n17 11 829\n5 12 15831\n14 6 24056\n5 2 63216\n15 6 38762\n2 6 10654\n12 6 51472\n11 9 79384\n1 6 67109\n5 13 86794\n7 6 74116\n10 3 44030\n5 7 71499\n16 17 33019\n...	You are given a directed acyclic graph (a directed graph that does not contain cycles) of n vertices and m arcs. The i-th arc leads from the vertex x_i to the vertex y_i and has the weight w_i. Your task is to select an integer a_v for each vertex v, and then write a number b_i on each arcs i such that b_i = a_{x_i} -...
{ "inputs": [ "237 7\n", "15 2\n", "117 3\n", "1000 1\n", "1 8\n", "1000 2\n", "1 5\n", "998 9\n", "1 4\n", "1000 4\n", "8 2\n", "23 4\n", "666 5\n", "2 1\n", "25 5\n", "1000 5\n", "15 5\n", "999 8\n", "8 9\n", "1 7\n", "2 3\n", "...	Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is sold for k burles. Assume that there is an unlimited number of such shovels in the shop. In his pocket Polycarp has an unlimited number of "10-burle coins" and exactly one coin of r burles (1 ≤ r ...
{ "inputs": [ "5\n1 3 5 7 9\n", "5\n2 3 5 7 11\n", "5\n4 6 9 3 6\n", "1\n5\n", "1\n1000000\n", "5\n3 3 6 2 2\n", "1\n1\n", "2\n1 1000000\n", "2\n999999 1000000\n", "1\n1343\n", "1\n4\n", "5\n3 2 6 2 2\n", "5\n1 3 5 11 9\n", "5\n2 3 5 10 11\n", "5\n3 2 6 2 3\...	Simon has an array a1, a2, ..., an, consisting of n positive integers. Today Simon asked you to find a pair of integers l, r (1 ≤ l ≤ r ≤ n), such that the following conditions hold: 1. there is integer j (l ≤ j ≤ r), such that all integers al, al + 1, ..., ar are divisible by aj; 2. value r - l takes the maximum...
{ "inputs": [ "3 4\n1 3\n1 1\n1 2\n2 3\n", "4 6\n1 2\n1 4\n1 2\n3 3\n1 3\n1 3\n", "10 85\n2 2\n1 10\n1 1\n2 6\n1 2\n1 4\n1 7\n2 1\n1 1\n3 3\n1 9\n1 6\n1 8\n1 10\n3 8\n2 8\n1 6\n1 3\n1 9\n1 6\n1 3\n1 8\n1 1\n1 6\n1 10\n2 1\n2 10\n1 10\n1 1\n1 10\n1 6\n1 2\n1 8\n1 3\n1 4\n1 9\n1 5\n1 5\n2 2\n2 4\n1 7\n1 1\n...	Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the number of unread notifications generated by those applications (maybe Loki put a curse on it so he can't). q events are abou...
{ "inputs": [ "3 3 4\n111\n111\n111\n111\n111\n111", "3 3 4\n111\n111\n111\n111\n111\n011", "3 3 4\n111\n111\n011\n111\n011\n111", "3 1 4\n111\n111\n011\n111\n011\n111", "5 0 4\n011\n111\n011\n011\n010\n111", "5 4 2\n101\n110\n011\n111\n100\n101", "3 3 4\n111\n111\n011\n111\n111\n111", ...	E: Arai's --Arai's- problem Arai's is a female idol group that has been popular since the school idol era. Nowadays, it is active at the world level as a large group to which many "Arai" belong. And today, it was decided to start a new project. They decided to try to further increase sales by forming several small un...
{ "inputs": [ "7\n1 2 1\n0 0 0\n9 1 7\n2 2 3\n2 3 2\n3 2 2\n4 4 4\n", "2\n2 2 8\n3 2 2\n", "2\n2 2 8\n3 3 2\n", "7\n1 2 1\n0 0 0\n9 1 7\n2 2 3\n2 3 2\n3 2 2\n0 4 4\n", "7\n1 2 1\n0 0 0\n9 1 1\n2 2 3\n2 3 2\n3 2 2\n0 4 4\n", "2\n2 2 7\n3 3 0\n", "7\n1 2 1\n0 0 0\n9 1 1\n2 2 2\n2 3 2\n3 2 2\...	Tired of boring office work, Denis decided to open a fast food restaurant. On the first day he made a portions of dumplings, b portions of cranberry juice and c pancakes with condensed milk. The peculiarity of Denis's restaurant is the procedure of ordering food. For each visitor Denis himself chooses a set of dishes...
{ "inputs": [ "6\n5 0\n10 0\n12 -4\n10 -8\n5 -8\n3 -4\n", "4\n0 0\n0 1\n1 1\n1 0\n", "4\n-100000 -100000\n-99999 -99999\n100000 99999\n0 -100\n", "4\n0 0\n1 100\n100 0\n1 -100\n", "4\n-1000000000 1000000000\n1000000000 500000000\n1000000000 -1000000000\n-500000000 -1000000000\n", "4\n-10000 -1...	You are given a convex polygon P with n distinct vertices p1, p2, ..., pn. Vertex pi has coordinates (xi, yi) in the 2D plane. These vertices are listed in clockwise order. You can choose a real number D and move each vertex of the polygon a distance of at most D from their original positions. Find the maximum value ...
{ "inputs": [ "8\n10 3\n100 4\n8 7\n97 2\n8 8\n3 10\n5 3\n1000000000 9\n", "8\n10 3\n100 4\n8 7\n97 2\n8 8\n3 10\n5 3\n1000000000 9\n", "7\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n", "8\n10 3\n100 8\n8 7\n97 2\n8 8\n3 10\n5 3\n1000000000 9\n", "7\n1 1\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n", "8\n10 3\n100...	You are given two positive integers n (1 ≤ n ≤ 10^9) and k (1 ≤ k ≤ 100). Represent the number n as the sum of k positive integers of the same parity (have the same remainder when divided by 2). In other words, find a_1, a_2, …, a_k such that all a_i>0, n = a_1 + a_2 + … + a_k and either all a_i are even or all a_i ar...
{ "inputs": [ "4 4\n2 4\n1 1\n2 3\n2 4", "4 7\n2 4\n1 1\n2 3\n2 4", "4 4\n2 4\n1 1\n2 0\n2 4", "4 4\n3 4\n1 1\n2 3\n2 4", "4 4\n2 4\n1 1\n2 0\n3 4", "4 4\n1 4\n1 1\n2 0\n3 4", "4 5\n0 4\n0 1\n4 5\n3 4", "4 7\n2 4\n0 1\n2 3\n5 7", "4 7\n1 3\n0 1\n4 1\n3 7", "4 7\n2 4\n0 1\n2 3\n...	There is a grid of squares with H+1 horizontal rows and W vertical columns. You will start at one of the squares in the top row and repeat moving one square right or down. However, for each integer i from 1 through H, you cannot move down from the A_i-th, (A_i + 1)-th, \ldots, B_i-th squares from the left in the i-th ...
{ "inputs": [ "4\n0 0\n10 0\n10 10\n0 10", "4\n0 0\n10 0\n10 4\n0 10", "4\n0 0\n10 0\n10 2\n0 10", "4\n0 0\n10 0\n10 2\n0 9", "4\n0 0\n10 1\n10 2\n0 9", "4\n0 0\n10 1\n10 2\n1 9", "4\n0 0\n9 1\n10 2\n1 9", "4\n0 0\n9 1\n10 4\n1 9", "4\n0 0\n10 0\n14 10\n0 10", "4\n0 0\n7 0\n10 ...	Fair Chocolate-Cutting You are given a flat piece of chocolate of convex polygon shape. You are to cut it into two pieces of precisely the same amount with a straight knife. Write a program that computes, for a given convex polygon, the maximum and minimum lengths of the line segments that divide the polygon into two...
{ "inputs": [ "2\na b\na c\nc d\n\nSAMPLE", "11\nfovjpmznym zhpfejofcp\nisbdmefcnz kgrkqwecpc\nfpyiwhfmxj wauoluqowk\nidvreukgrg qrryquogop\nnnupvighsb lfnszeowha\njlkpwzbxet dlxfajcsev\nnldxzjdmac tqtgdxrlnx\nqueogjfufo ngffnbxhax\niktzwaqclx dfpthfuouv\nqtshrrgtpa jmazfklhnk\nmxavpwgxgg kdtatexhrr\narmxqvth...	Several drivers had lined up for the Drag Racing Competition at the Tokyo Drift Street. Dom had organized the competition, but he was not available during all the races and hence he did not know their results. In the drag race match, 2 drivers race against each other and one of them is the winner, and the loser gets el...
{ "inputs": [ "9 4\n", "8 3\n", "1 1\n", "26 6\n", "3 4\n", "2 4\n", "2 3\n", "800019998 40000\n", "77792 2\n", "123456789 13456\n", "147268968 2\n", "4 3\n", "7 2\n", "2 1\n", "7 3\n", "999961559 44720\n", "3 2\n", "3 3\n", "20492 2\n", ...	Polycarp has to solve exactly n problems to improve his programming skill before an important programming competition. But this competition will be held very soon, most precisely, it will start in k days. It means that Polycarp has exactly k days for training! Polycarp doesn't want to procrastinate, so he wants to sol...
{ "inputs": [ "5 5\n1 2 1 1 2\n1 2\n1 3\n2 4\n2 5\n1 2 3\n1 1 2\n2 1\n2 2\n2 4\n", "10 10\n137 197 856 768 825 894 86 174 218 326\n7 8\n4 7\n8 9\n7 10\n1 2\n2 4\n3 6\n3 5\n2 3\n1 9 624\n2 1\n2 4\n1 6 505\n1 8 467\n1 3 643\n2 1\n1 8 631\n2 4\n1 7 244\n", "10 10\n418 45 865 869 745 901 177 773 854 462\n4 8\...	Iahub likes trees very much. Recently he discovered an interesting tree named propagating tree. The tree consists of n nodes numbered from 1 to n, each node i having an initial value ai. The root of the tree is node 1. This tree has a special property: when a value val is added to a value of node i, the value -val is ...
{ "inputs": [ "abc\nddd\n", "abcdef\nabcdeg\n", "abacaba\nubuduba\n", "izybggxalv\nrbqjamqnyg\n", "abacabadaba\ndabacabaaba\n", "aaaaaa\nzzzzzz\n", "aac\nbbb\n", "jvmzmvqexcqycjcpuqimvyovcffrdwtexpqhxswzytoaokvnexkzgycpmbgvsnyifkwvfbirtwnprmrlotlnhkogjlmxmgruklcuqstwfwoswux\nvzsmohqcjp...	At the Byteland State University marks are strings of the same length. Mark x is considered better than y if string y is lexicographically smaller than x. Recently at the BSU was an important test work on which Vasya recived the mark a. It is very hard for the teacher to remember the exact mark of every student, but h...
{ "inputs": [ "14", "10", "13", "15", "12", "25", "17", "32", "16", "42", "22", "20", "33", "48", "51", "29", "24", "27", "55", "49", "54", "39", "36", "43", "60", "38", "103", "46", "79", "74", ...	Chef loves arrays. But he really loves a specific kind of them - Rainbow Arrays. The array is a Rainbow Array if it has such a structure: The first a1 elements equal to 1. The next a2 elements equal to 2. The next a3 elements equal to 3. The next a4 elements equal to 4. The next a5 elements equal to 5. The n...
{ "inputs": [ "3 3\n100 10 10\n-100 -20 -100\n-100 -20 -100\n-100 -20 -100\n3 3\n100 10 10\n-100 -20 -100\n-100 -20 -20\n-100 -60 -20\n3 3\n100 10 3\n-100 -20 -100\n-20 -20 -20\n-20 -100 -20\n3 3\n100 3 3\n-100 -20 -30\n-100 -20 2\n-100 -20 -20\n4 5\n1500 5 4\n-10 -380 -250 -250\n-90 2 -80 8\n-250 -130 -330 -120\...	Aizu has an ancient legend of buried treasure. You have finally found the place where the buried treasure is buried. Since we know the depth of the buried treasure and the condition of the strata to be dug, we can reach the buried treasure at the lowest cost with careful planning. So you decided to create a program tha...
{ "inputs": [ "16\nnandu \nkanth\nkalyan\ndhiraj\nkanth\nkalyan\nbaala\nkt\nbaala\njayanth\nsampu\nbaala\nkanth\nkalyan\nbaala\nkt\n\nSAMPLE", "50\nphqghumeaylnlfdxfirc\nvscxggbwkfnqduxwfnfo\nzvsrtkjprepggxrpnrvy\nstmwcysyycqpevikeffm\nznimkkasvwsrenzkycxf\nxtlsgypsfadpooefxzbc\noejuvpvaboygpoeylfpb\nnpljvrvi...	Bob gives you a list of N strings and a task to solve. The task is to remove all the duplicate strings from the list and print the resulting list of strings in a sorted order. Input: The first line contains an integer N. Then next N lines contain a string Si. Output: Print the sorted list. Constraints: 1 ≤ \|N\| ≤ ...
{ "inputs": [ "6\n1 1 2 2 1 1\n", "6\n1 3 2 5 4 6\n", "5\n1 2 1 2 1\n", "1\n44884539\n", "1\n56946342\n", "6\n1 2 2 2 1 1\n", "6\n1 3 2 5 2 6\n", "1\n91135303\n", "6\n1 2 2 1 1 1\n", "6\n2 3 2 5 2 6\n", "1\n19087161\n", "6\n1 2 1 1 1 1\n", "6\n2 3 2 8 2 6\n", "1...	Berland — is a huge country with diverse geography. One of the most famous natural attractions of Berland is the "Median mountain range". This mountain range is n mountain peaks, located on one straight line and numbered in order of 1 to n. The height of the i-th mountain top is a_i. "Median mountain range" is famous...
{ "inputs": [ "2\n3\n1 2 3\n2\n42 42", "2\n3\n1 4 3\n2\n42 42", "2\n3\n1 4 3\n2\n42 28", "2\n3\n1 4 3\n2\n38 42", "2\n3\n1 0 3\n2\n38 42", "2\n3\n1 -1 3\n2\n38 42", "2\n3\n1 0 1\n2\n38 42", "2\n3\n2 0 1\n2\n38 42", "2\n3\n1 4 3\n2\n42 7", "2\n3\n1 0 3\n2\n61 42", "2\n3\n2 0...	Little chief has his own restaurant in the city. There are N workers there. Each worker has his own salary. The salary of the i-th worker equals to Wi (i = 1, 2, ..., N). Once, chief decided to equalize all workers, that is, he wants to make salaries of all workers to be equal. But for this goal he can use only one ope...
{ "inputs": [ "2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonday Tuesday Wednesday\n9 4\nThursday Friday Saturday Sunday\n0 0", "2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonday Tuesday Wednesday\n9 4\nTsurhday Friday Saturday ...	You are working as a private teacher. Since you are giving lessons to many pupils, you are very busy, especially during examination seasons. This season is no exception in that regard. You know days of the week convenient for each pupil, and also know how many lessons you have to give to him or her. You can give just ...
{ "inputs": [ "3 \n1200\n500\n242", "3 \n1200\n360\n242", "3 \n1200\n360\n255", "3 \n1200\n493\n380", "3 \n1200\n806\n380", "3 \n1200\n32\n380", "3 \n1200\n30\n380", "3 \n1200\n30\n99", "3 \n1200\n30\n158", "3 \n1200\n12\n158", "3 \n1200\n24\n158", "3 \n391\n24\n158", ...	Consider a currency system in which there are notes of seven denominations, namely, Rs. 1, Rs. 2, Rs. 5, Rs. 10, Rs. 50, Rs. 100. If the sum of Rs. N is input, write a program to computer smallest number of notes that will combine to give Rs. N. Input The first line contains an integer T, total number of testcases. T...
{ "inputs": [ "11\nbabu\nanand\nrani\naarti\nnandu\nrani\nrani\nap\nanand\nbabu\nnandu\n\nSAMPLE", "234\nljio\nj\nhfwod\nydgr\nrc\nlzh\nvnhwm\nnyunx\nohjz\nmiyj\nd\ncqk\nzttn\ng\nug\nscw\nmkc\nqa\nmnfj\noiexd\nesez\nwip\npsp\nss\ny\nnimxh\ne\nrsyav\nqhyj\neps\nnvl\na\nd\ngkgb\nnm\nhipsv\nfj\nrzsj\nboxq\noee\n...	Problem : Chotu's father is the owner of a Vada Pav shop. One Sunday, his father takes him to the shop. Father tells him that at the end of the day, Chotu has to give him a list consisting of the names of all the customers on that day who bought Vada Pav(s) from the shop. The list should not have the names of any of t...
{ "inputs": [ "1222", "3242", "0290", "2364", "1114", "2005", "1455", "1152", "3246", "6120", "2768", "1183", "1024", "1181", "1785", "1372", "1765", "1280", "2308", "1824", "2162", "1802", "1226", "2412", "1699", ...	Sitting in a station waiting room, Joisino is gazing at her train ticket. The ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive). In the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with `+` or `-` so that the formula holds. The given in...
{ "inputs": [ "2 2 2\n2 1\n1 2\n2 1\n", "5 3 3\n0 3 0 0 2\n2 4\n3 4\n3 5\n", "7 6 5\n0 4 5 4 1 0 0\n6 1\n3 6\n3 1\n7 5\n7 1\n7 4\n", "8 4 6\n0 0 3 0 0 0 0 0\n7 6\n6 2\n6 3\n4 7\n", "10 11 3\n1 0 0 0 0 0 0 0 2 0\n6 1\n2 10\n7 5\n7 4\n6 4\n8 1\n6 8\n9 10\n7 2\n6 1\n7 10\n", "7 4 5\n0 0 1 3 5 2 2...	There are n military men in the Berland army. Some of them have given orders to other military men by now. Given m pairs (xi, yi), meaning that the military man xi gave the i-th order to another military man yi. It is time for reform! The Berland Ministry of Defence plans to introduce ranks in the Berland army. Each m...
{ "inputs": [ "6\n3 2 2 2\n0 0 -2 -2 2 2\n3 1 4 1\n0 0 -1 -1 1 1\n1 1 1 1\n1 1 1 1 1 1\n0 0 0 1\n0 0 0 0 0 1\n5 1 1 1\n0 0 -100 -100 0 100\n1 1 5 1\n0 0 -100 -100 100 0\n", "1\n83 75 18 67\n-4233924 24412104 -4233956 24412104 -4233832 24412181\n", "1\n0 0 1 1\n0 0 0 0 0 0\n", "1\n83 128 18 67\n-423392...	Alice has a cute cat. To keep her cat fit, Alice wants to design an exercising walk for her cat! Initially, Alice's cat is located in a cell (x,y) of an infinite grid. According to Alice's theory, cat needs to move: * exactly a steps left: from (u,v) to (u-1,v); * exactly b steps right: from (u,v) to (u+1,v); ...
{ "inputs": [ "4 3 3\n1 1 2 3", "4 1 4\n3 3 2 2", "6 2 2\n0 2 2 2 2 0", "8 7 15\n5 0 9 14 0 4 4 15", "8 10 18\n2 12 16 14 18 4 17 16", "4 1 4\n3 2 2 2", "6 2 2\n1 2 2 2 2 0", "8 7 15\n5 0 9 14 0 4 0 15", "8 10 18\n2 12 16 14 18 4 17 10", "2 1 4\n3 2 2 2", "8 7 15\n5 0 1 14 ...	In the building of Jewelry Art Gallery (JAG), there is a long corridor in the east-west direction. There is a window on the north side of the corridor, and $N$ windowpanes are attached to this window. The width of each windowpane is $W$, and the height is $H$. The $i$-th windowpane from the west covers the horizontal r...
{ "inputs": [ "3\n3\n1 3 2\n4\n4 1 2 1\n6\n1 2 2 2 2 1", "3\n3\n1 3 2\n4\n4 1 3 1\n6\n1 2 2 2 2 1", "3\n3\n1 3 2\n4\n4 1 3 1\n6\n1 2 2 0 2 1", "3\n3\n1 3 2\n4\n4 1 3 1\n6\n1 1 2 0 2 1", "3\n3\n1 3 2\n4\n4 2 3 1\n6\n1 2 2 2 2 1", "3\n3\n1 5 2\n4\n4 2 3 1\n6\n1 2 2 2 2 1", "3\n3\n1 3 3\n4\n4...	Chef likes problems involving arrays. Unfortunately, the last one he tried to solve didn't quite get solved. Chef has an array A of N positive numbers. He wants to find the number of subarrays for which the sum and product of elements are equal. Please help Chef find this number. Input The first line of input con...
{ "inputs": [ "2\n3\n4", "2\n1\n4", "2\n2\n4", "2\n2\n1", "2\n1\n1", "2\n4\n4", "2\n5\n4", "2\n1\n6", "2\n-1\n4", "2\n6\n4", "2\n4\n1", "2\n-1\n7", "2\n6\n2", "2\n6\n1", "2\n-1\n8", "2\n6\n3", "2\n10\n1", "2\n4\n3", "2\n1\n7", "2\n3\n7", ...	Asmany strings are strings of '0's and '1's that have as many 00 as 11. A string such as 00110001 consists of 3 "00" and 1 "11". Of course this is not an Asmany string. 0011, 1100, 000111000111 are Asmany strings. An L'th Asmany number is the number of Asmany strings of length L for all positive integers L. For esote...
{ "inputs": [ "3\n3 1\n4 108\n1 10", "3\n3 2\n4 108\n1 10", "3\n3 0\n4 108\n1 10", "3\n3 1\n4 98\n1 10", "3\n1 1\n4 108\n1 10", "3\n3 1\n4 108\n1 2", "3\n3 1\n2 98\n1 10", "3\n3 1\n4 50\n1 2", "3\n3 2\n2 98\n1 10", "3\n3 1\n4 75\n1 2", "3\n3 2\n2 98\n1 9", "3\n3 1\n4 75...	A professor invented Cookie Breeding Machine for his students who like cookies very much. When one cookie with the taste of x is put into the machine and a non-negative integer y less than or equal to 127 is input on the machine, it consumes the cookie and generates two cookies with the taste of y and (x XOR y). Here...
{ "inputs": [ "red blue\n3 4\nred", "red blue\n5 5\nblue", "red blue\n3 2\nred", "red blte\n3 0\nred", "red blue\n5 0\nred", "red blue\n7 0\nred", "red blue\n5 1\nred", "red blue\n0 0\nred", "red blte\n3 4\nred", "red blue\n1 0\nred", "red blue\n11 0\nred", "red blue\n-...	We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. Constraints * S, T, and ...
{ "inputs": [ "2 1 3\n9 5\n1\n2 8 5\n", "1 1 1\n3\n5\n4\n", "10 1 1\n11 7 20 15 19 14 2 4 13 14\n8\n11\n", "2 2 2\n3 10\n6 9\n10 9\n", "9 4 7\n17 19 19 9 20 6 1 14 11\n15 12 10 20\n15 10 3 20 1 16 7\n", "16 26 8\n44 13 2 24 56 74 72 4 87 98 43 4 17 30 82 8\n31 6 76 32 88 37 19 64 44 55 18 67 7...	You are given three multisets of pairs of colored sticks: * R pairs of red sticks, the first pair has length r_1, the second pair has length r_2, ..., the R-th pair has length r_R; * G pairs of green sticks, the first pair has length g_1, the second pair has length g_2, ..., the G-th pair has length g_G; * B ...
{ "inputs": [ "1 1 5\n1 1\n1 1\n1 1\n1 1\n1 1\n", "3 3 7\n1 2\n2 3\n1 3\n3 2\n3 3\n2 1\n2 1\n", "2000 2000 1\n1387 936\n", "9 9 55\n5 1\n8 3\n1 6\n5 6\n5 9\n6 5\n9 8\n6 6\n5 5\n7 7\n7 2\n1 6\n3 8\n4 3\n1 8\n8 5\n5 4\n6 1\n2 7\n2 6\n2 8\n7 7\n7 3\n6 9\n2 7\n9 3\n3 5\n7 9\n6 8\n4 6\n5 2\n9 2\n4 3\n9 5\n...	You are given a bipartite graph G = (U, V, E), U is the set of vertices of the first part, V is the set of vertices of the second part and E is the set of edges. There might be multiple edges. Let's call some subset of its edges <image> k-covering iff the graph <image> has each of its vertices incident to at least k e...
{ "inputs": [ "ABC\nabc\n", "AbC\nDCbA\n", "abacaba\nAbaCaBA\n", "r\nqA\n", "CdAbD\ndecbde\n", "a\nB\n", "Adc\neadeabcad\n", "DBAdeb\ndeeabcddadaa\n", "CCAE\ndcecc\n", "l\nFPbAVjsMpPDTLkfwNYFmBDHPTDSWSOUlrBHYJHPM\n", "Dccb\nbeeeb\n", "EDCED\neebeacdba\n", "DpiNBmCRF...	Little Tanya decided to present her dad a postcard on his Birthday. She has already created a message — string s of length n, consisting of uppercase and lowercase English letters. Tanya can't write yet, so she found a newspaper and decided to cut out the letters and glue them into the postcard to achieve string s. The...
{ "inputs": [ "4 2 2 2\n3\n3 2\n5 3\n2 4", "1 1 6 5\n3\n3 2\n5 3\n2 4", "3 5 6 4\n3\n3 2\n5 3\n2 4", "4 2 2 2\n3\n3 0\n5 3\n2 4", "0 1 6 5\n3\n3 2\n5 3\n2 4", "3 5 6 5\n3\n3 2\n5 3\n2 4", "0 1 6 8\n3\n3 2\n5 3\n2 4", "3 1 6 5\n3\n3 4\n5 3\n2 4", "4 2 2 2\n3\n3 2\n5 3\n0 4", "1 ...	In the city of Nevermore, there are 10^8 streets and 10^8 avenues, both numbered from 0 to 10^8-1. All streets run straight from west to east, and all avenues run straight from south to north. The distance between neighboring streets and between neighboring avenues is exactly 100 meters. Every street intersects every ...
{ "inputs": [ "1\n3 3\n\nSAMPLE", "10\n97654 99999\n97655 99998\n97656 99997\n97657 99996\n97658 99995\n97659 99994\n97660 99993\n97661 99992\n97662 99991\n97663 99990", "10\n23 100000\n24 99999\n25 99998\n26 99997\n27 99996\n28 99995\n29 99994\n30 99993\n31 99992\n32 99991", "10\n23 100000\n24 99999\...	Our Friend Monk has finally found the Temple of Programming secrets. However, the door of the temple is firmly locked. Now, as per the rules of the temple, Monk needs to enter a Secret Password in a special language to unlock the door. This language, unlike English consists of K alphabets. The properties of this secret...
{ "inputs": [ "5\n-1 -1 1 1\n-4 0 0 4\n0 0 4 4\n-4 -4 0 0\n0 -4 4 0\n", "4\n0 0 4 4\n-4 -4 0 0\n0 -4 4 0\n-2 -4 2 4\n", "5\n-1 0 2 4\n1 4 4 5\n2 3 5 4\n-5 3 1 5\n0 -4 2 3\n", "10\n-39 29 10 85\n-44 69 83 71\n-35 33 31 74\n-68 66 47 86\n77 -49 96 89\n-24 25 7 93\n-24 -35 47 -12\n85 -91 95 33\n-94 15 -7...	Arkady has got an infinite plane painted in color 0. Then he draws n rectangles filled with paint with sides parallel to the Cartesian coordinate axes, one after another. The color of the i-th rectangle is i (rectangles are enumerated from 1 to n in the order he draws them). It is possible that new rectangles cover som...
{ "inputs": [ "5\n1 2\n2 3\n3 4\n2 5\n1 2 1 2 3\n11\nQ 1\nQ 2\nQ 3\nQ 4\nU 5 1\nQ 1\nU 3 2\nQ 1\nQ 2\nU 5 4\nQ 1", "5\n1 2\n2 3\n3 4\n3 5\n1 2 1 2 3\n11\nQ 1\nQ 2\nQ 3\nQ 4\nU 5 1\nQ 1\nU 3 2\nQ 1\nQ 2\nU 5 4\nQ 1", "5\n1 2\n2 3\n3 4\n2 5\n1 2 1 2 3\n11\nQ 1\nQ 2\nQ 3\nQ 4\nU 5 1\nQ 1\nU 3 2\nQ 1\nQ 2\nU ...	Colorful Tree A tree structure with some colors associated with its vertices and a sequence of commands on it are given. A command is either an update operation or a query on the tree. Each of the update operations changes the color of a specified vertex, without changing the tree structure. Each of the queries asks t...
{ "inputs": [ "2 0\n", "2 1\n", "3 2\n", "904089164817530426 53747406876903279\n", "860936792402722414 59551033597232946\n", "316313018463929883 78259904441946885\n", "1 3\n", "216006901533424028 8313457244750219\n", "883717267463724670 29585639347346605\n", "1000000007 2\n", ...	Nastya received a gift on New Year — a magic wardrobe. It is magic because in the end of each month the number of dresses in it doubles (i.e. the number of dresses becomes twice as large as it is in the beginning of the month). Unfortunately, right after the doubling the wardrobe eats one of the dresses (if any) with ...
{ "inputs": [ "2 10\n10 200 1\n10 100 100", "2 10\n10 200 1\n10 100 101", "2 10\n10 137 1\n10 100 101", "0 10\n10 200 0\n10 100 100", "2 10\n6 331 1\n0 110 100", "3 10\n1 349 1\n16 100 101", "2 10\n6 554 1\n0 100 100", "1 10\n1 470 -1\n15 101 101", "2 10\n6 28 1\n10 100 101", "...	Example Input 2 10 10 200 1 10 100 100 Output 200
{ "inputs": [ "5\n1 2 3 4 5", "5\n1 2 3 0 5", "5\n1 2 3 0 2", "5\n1 2 4 0 2", "5\n1 4 4 0 2", "5\n1 4 4 1 2", "5\n1 4 4 2 2", "5\n1 6 4 2 2", "5\n1 8 4 2 2", "5\n1 8 3 2 2", "5\n1 8 3 2 1", "5\n2 8 3 2 1", "5\n2 8 3 2 0", "5\n2 8 3 3 0", "5\n4 8 3 3 0", ...	Kattapa, as you all know was one of the greatest warriors of his time. The kingdom of Maahishmati had never lost a battle under him (as army-chief), and the reason for that was their really powerful army, also called as Mahasena. Kattapa was known to be a very superstitious person. He believed that a soldier is "lucky"...
{ "inputs": [ "1\n90447 91000", "2\n96000 -72000\n-72000 54000", "3\n0 10\n5 -5\n-5 -5", "10\n1 2\n3 4\n5 6\n7 8\n9 10\n11 12\n13 14\n15 16\n17 18\n19 20", "5\n1 1\n1 0\n0 1\n-1 0\n0 -1", "3\n0 0\n0 1\n1 0", "5\n1 1\n2 2\n3 3\n4 4\n5 5", "1\n52551 91000", "2\n96000 -130259\n-72000 ...	E869120 is initially standing at the origin (0, 0) in a two-dimensional plane. He has N engines, which can be used as follows: * When E869120 uses the i-th engine, his X- and Y-coordinate change by x_i and y_i, respectively. In other words, if E869120 uses the i-th engine from coordinates (X, Y), he will move to the ...
{ "inputs": [ "4 5\nWRWRW\nBWRWB\nWRWRW\nRWBWR", "4 5\nWRWRW\nBRWWB\nWRWRW\nRWBWR", "4 5\nWRWRW\nBWRWB\nWRWRW\nRWBWQ", "4 5\nWQWRW\nBWRXB\nRVWRW\nWQBWQ", "4 3\nWQWRW\nBWRXB\nRVWRW\nRWBWQ", "4 5\nWQWRW\nBWRXC\nRVWRW\nWQBWQ", "4 10\nWRWQW\nBWRXB\nRVWRW\nRWBWQ", "4 0\nWQXRW\nBWRXB\nVRWRW\...	problem President K decided to make a flag for IOI 2016 in Russia. Chairman K first took out the old flag from the warehouse. This flag is divided into squares of N rows and M columns, and each square is painted in one of white, blue, and red. Chairman K is trying to repaint some of the squares on this flag to make i...
{ "inputs": [ "3\n17 136\n859 937\n16 641\n", "4\n-1 3\n4 5\n6 2\n3 -5\n", "3\n0 0\n5 5\n5 0\n", "3\n217949 72327\n20730 141135\n667478 391012\n", "28\n-999992 -308892\n-999961 -775849\n-999942 -893083\n-999456 -939329\n-999012 -979265\n-997835 -988395\n-989576 -999615\n-707413 -999804\n-356518 -9...	Ksusha is a vigorous mathematician. She is keen on absolutely incredible mathematical riddles. Today Ksusha came across a convex polygon of non-zero area. She is now wondering: if she chooses a pair of distinct points uniformly among all integer points (points with integer coordinates) inside or on the border of the ...
{ "inputs": [ "4\n5\n1 2 1 2 2\n6\n1 2 2 1 2 2\n5\n1 2 1 2 3\n3\n10 10 10\n", "4\n5\n1 2 1 2 2\n6\n1 2 2 1 2 2\n5\n1 2 1 2 3\n3\n10 10 10\n", "4\n5\n1 2 1 2 2\n6\n1 2 2 1 2 2\n5\n1 2 1 2 3\n3\n14 10 10\n", "4\n5\n1 2 1 2 2\n6\n1 2 2 1 2 2\n5\n1 2 1 2 6\n3\n10 10 10\n", "4\n5\n1 2 1 2 4\n6\n1 2 2 1...	The round carousel consists of n figures of animals. Figures are numbered from 1 to n in order of the carousel moving. Thus, after the n-th figure the figure with the number 1 follows. Each figure has its own type — the type of the animal corresponding to this figure (the horse, the tiger and so on). The type of animal...
{ "inputs": [ "4 5 4\nBBRR\nRBBR\nBBBBB\nRRRRR\nL 2 3\nR 3 4\nU 1 5\nD 1 5\n", "4 5 4\nBBRR\nRBBR\nBBBBB\nRRRRR\nL 2 3\nR 3 4\nU 2 5\nD 1 5\n", "4 5 4\nBBRR\nRBBR\nBBBBB\nRRRRR\nL 2 4\nR 3 4\nU 1 5\nD 1 5\n", "4 5 4\nRRBB\nRBBR\nBBBBB\nRRRRR\nL 2 3\nR 3 4\nU 1 5\nD 1 5\n", "4 5 4\nRRBB\nRBBR\nBBBB...	This is a harder version of the problem H with modification queries. Lester and Delbert work at an electronics company. They are currently working on a microchip component serving to connect two independent parts of a large supercomputer. The component is built on top of a breadboard — a grid-like base for a microchi...
{ "inputs": [ "2\n3 2\n2 4 7\n5 3\n1 2 3 4 5", "2\n3 2\n2 4 7\n3 3\n1 2 3 4 5", "2\n3 2\n2 4 7\n3 3\n1 2 3 4 9", "2\n3 2\n2 4 7\n3 3\n1 2 3 4 7", "2\n3 2\n2 4 10\n3 3\n1 2 3 4 7", "2\n4 2\n1 4 7\n5 3\n1 2 3 4 9", "2\n4 1\n1 4 7\n5 6\n1 2 5 6 9", "2\n6 2\n2 4 7\n4 3\n1 2 3 4 12", "2...	There is a line with 1000 cells numbered from 1 to 1000 from left to right and N coins placed on it. Coin i is placed at cell Xi, and no two coins are placed at the same cell. Bob would like to move the coins to the N leftmost cells of the line. To do this, he is allowed to take a coin from any cell T and move it to c...
{ "inputs": [ "4 3\nIN 1 4 10\nIN 2 3 20\nCOMPARE 1 2", "10 4\nIN 10 8 2328\nIN 8 4 3765\nIN 3 8 574\nCOMPARE 4 8", "3 5\nCOMPARE 1 2\nIN 1 2 5\nIN 2 3 3\nCOMPARE 2 3\nCOMPARE 1 3", "3 4\nIN 2 1 2\nIN 3 1 2\nCOMPARE 1 3\nCOMPARE 2 3", "3 5\nIN 1 2 5\nIN 1 2 5\nIN 2 3 10\nCOMPARE 1 2\nCOMPARE 2 3",...	Problem In 20XX, a scientist developed a powerful android with biotechnology. This android is extremely powerful because it is made by a computer by combining the cells of combat masters. At this rate, the earth would be dominated by androids, so the N warriors decided to fight the androids. However, today's warriors...
{ "inputs": [ "2 2\n20 18\n2 14\n", "5 3\n-1 0 1 2 3\n-1 0 1\n", "14 8\n-1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000...	Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of which frighten the monster out of coming. Little Tommy has n lanterns and Big Ban...
{ "inputs": [ "6\n0 6 7 6 7 0", "4\n1 2 3 4", "1\n1000000000", "3\n1 2 3", "6\n1 6 7 6 7 0", "4\n1 4 3 4", "1\n1000010000", "3\n2 2 3", "6\n1 10 7 6 7 0", "4\n1 4 0 4", "1\n1100010000", "3\n4 2 3", "6\n1 10 7 6 4 0", "4\n0 4 0 4", "1\n1100010100", "3\n6 ...	You are given an integer sequence of length n, a_1, ..., a_n. Let us consider performing the following n operations on an empty sequence b. The i-th operation is as follows: 1. Append a_i to the end of b. 2. Reverse the order of the elements in b. Find the sequence b obtained after these n operations. Constraints...
{ "inputs": [ "1 3\n1 6\n3 5\n2 200\n25 99\n0 0", "2 3\n1 6\n3 5\n2 200\n25 99\n0 0", "2 6\n1 5\n3 5\n2 200\n25 99\n0 0", "1 6\n1 5\n3 5\n2 200\n34 99\n0 0", "1 6\n1 5\n3 9\n2 200\n34 99\n0 0", "1 6\n1 8\n3 9\n2 200\n34 99\n0 0", "1 6\n1 8\n3 9\n2 200\n34 62\n0 0", "2 6\n1 8\n3 9\n2 20...	You are a teacher at a cram school for elementary school pupils. One day, you showed your students how to calculate division of fraction in a class of mathematics. Your lesson was kind and fluent, and it seemed everything was going so well - except for one thing. After some experiences, a student Max got so curious ab...
{ "inputs": [ "1 1\n0 0 2 0", "2 1\n0 0 1 0\n1 1 0 1", "3 2\n0 0 2 0\n1 -1 1 2\n0 1 2 1", "1 1\n0 0 2 -1", "2 2\n0 0 1 0\n1 1 0 1", "3 2\n-1 0 2 0\n1 -1 1 2\n0 1 2 1", "1 1\n1 0 2 -1", "2 2\n-1 0 1 0\n1 1 0 1", "1 0\n1 0 2 -1", "1 1\n0 0 3 0", "3 4\n-1 0 2 0\n1 -1 1 2\n0 1 ...	In the west of Tokyo, there is a city named “Academy City.” There are many schools and laboratories to develop psychics in Academy City. You are a psychic student of a school in Academy City. Your psychic ability is to give acceleration to a certain object. You can use your psychic ability anytime and anywhere, but t...
{ "inputs": [ "4\n1 2 3 4", "5\n3 3 3 3 3", "4\n1 2 0 4", "5\n5 3 3 3 3", "4\n1 2 1 4", "5\n4 3 3 3 3", "4\n2 2 1 4", "5\n4 3 6 3 3", "5\n4 0 6 3 3", "5\n4 0 4 3 3", "4\n2 1 0 8", "4\n2 1 -1 8", "5\n4 0 7 3 1", "5\n4 -2 10 3 1", "4\n5 0 -2 8", "4\n5 0 -2...	Boy G was on a voyage with his father to celebrate his 13th birthday. However, during the voyage, unfortunately the ship was hit by a storm and the ship capsized. When he woke up, it was an uninhabited island. Partly due to the influence of the adventurer's father, he decided to live a survival life on an uninhabited i...
{ "inputs": [ "5\n4 10 3 13 7\n8\n1 2 4\n2 1 3 3\n1 2 4\n1 3 3\n2 2 5 5\n1 1 5\n2 1 2 10\n1 2 3\n", "6\n4 7 4 0 7 3\n5\n2 2 3 8\n1 1 5\n2 3 5 1\n2 4 5 6\n1 2 3\n", "20\n34 20 8 27 49 36 10 9 35 22 41 2 35 50 24 21 11 33 30 16\n20\n2 1 8 9\n1 8 12\n2 4 16 14\n2 4 13 5\n1 8 16\n1 4 19\n2 1 19 16\n2 4 5 47\n...	You've got an array a, consisting of n integers a1, a2, ..., an. You are allowed to perform two operations on this array: 1. Calculate the sum of current array elements on the segment [l, r], that is, count value al + al + 1 + ... + ar. 2. Apply the xor operation with a given number x to each array element on the...
{ "inputs": [ "2\n2\n1 2\n2 1\n4\n2 1 4 1\n2 4 1 4", "2\n2\n1 2\n2 1\n4\n2 1 4 1\n2 5 1 4", "2\n2\n2 2\n2 1\n4\n2 1 4 1\n4 4 1 4", "2\n2\n1 2\n2 1\n4\n1 1 4 1\n2 5 1 4", "2\n2\n2 2\n2 1\n4\n2 1 4 1\n2 4 1 4", "2\n2\n2 2\n2 1\n4\n2 1 4 1\n1 4 1 4", "2\n2\n1 2\n2 1\n4\n1 1 1 1\n2 5 1 4", ...	Little Egor is a huge movie fan. He likes watching different kinds of movies: from drama movies to comedy movies, from teen movies to horror movies. He is planning to visit cinema this weekend, but he's not sure which movie he should watch. There are n movies to watch during this weekend. Each movie can be characterize...
{ "inputs": [ "6\n382253568 723152896 37802240 379425024 404894720 471526144", "4\n5 6 8 10", "3\n8 12 40", "6\n382253568 723152896 37802240 379425024 590201381 471526144", "3\n10 12 40", "3\n16 36 16", "4\n5 6 13 10", "6\n382253568 723152896 32183854 379425024 590201381 471526144", ...	There are N positive integers written on a blackboard: A_1, ..., A_N. Snuke can perform the following operation when all integers on the blackboard are even: * Replace each integer X on the blackboard by X divided by 2. Find the maximum possible number of operations that Snuke can perform. Constraints * 1 \leq N...
{ "inputs": [ "2\n4\nbbcb\naada\naada\n3\nabc\nbbb\nbbb\n", "9\n5\nbcdbccc\nadaedae\neecdaca\n5\ndbeedcbcbaccdddbdcbcabacecbe\ndcaeaabaadacddcdecbbebcbadcb\nddbacaaabdaeedaacbabebccebbd\n5\nbdbedbb\ncccacdc\ncdcbccc\n3\nccacb\ncbaaa\nccbaa\n4\nccbbb\naaabc\nacbcc\n3\nccbcccbacbbabbcccb\nbbabcccbacaaccbaab\nbc...	Vasya owns three strings s , a and b, each of them consists only of first k Latin letters. Let a template be such a string of length k that each of the first k Latin letters appears in it exactly once (thus there are k! distinct templates). Application of template p to the string s is the replacement of each character...
{ "inputs": [ "2\n1\n2\n\nSAMPLE", "2\n2\n2\n\nSAMPLE", "2\n4\n2\n\nSAMPLE", "2\n4\n1\n\nSALPLE", "2\n7\n1\n\nSALPLE", "2\n6\n1\n\nSALPLE", "2\n5\n1\n\nTALPLE", "2\n10\n1\n\nTALLPD", "2\n3\n1\n\nTALLPD", "2\n1\n2\n\nSAMPKE", "2\n6\n2\n\nSAMPLE", "2\n13\n1\n\nSALPLE", ...	Daenerys Targaryen has set her eyes on The kingdom of Dorne. Dornishmen, known for their strong sense of national identity, have refused to surrender to the whims of Daenerys. Fearing the imminent attack on their kingdom and knowing their strength as Spearmen, they have devised a battle plan which they think will give ...
{ "inputs": [ "8\nfced\nxyz\nr\ndabcef\naz\naa\nbad\nbabc\n", "1\nshh\n", "1\nsoo\n", "1\naaaab\n", "1\nabcdefghijkm\n", "1\nabczz\n", "1\naadde\n", "1\ndaa\n", "1\nefhi\n", "2\nrtsuvwyz\nzyxwvutsrqponmlkjihgfedcbaaa\n", "1\nabbdf\n", "69\nabc\nabc\nabc\nabc\nabc\nabc\n...	A string is called diverse if it contains consecutive (adjacent) letters of the Latin alphabet and each letter occurs exactly once. For example, the following strings are diverse: "fced", "xyz", "r" and "dabcef". The following string are not diverse: "az", "aa", "bad" and "babc". Note that the letters 'a' and 'z' are n...
{ "inputs": [ "2 4\n5000\n", "2 2\n7\n", "3 1\n9\n", "3 3\n9\n", "8934829 12\n5048272609027744689584230909741172415239400471666476392160572093949157832786399486962245730213411626\n", "5893919 9\n221030949855650263908286580605428803696870256851550399001034575206908648601454476361678576617108302...	For a given prime integer p and integers α, A calculate the number of pairs of integers (n, k), such that 0 ≤ k ≤ n ≤ A and <image> is divisible by pα. As the answer can be rather large, print the remainder of the answer moduly 109 + 7. Let us remind you that <image> is the number of ways k objects can be chosen fro...
{ "inputs": [ "1 3\n0 3", "5 21600\n2 14\n3 22\n1 3\n1 10\n1 9", "3 7\n2 0\n3 2\n0 3", "7 57\n0 25\n3 10\n2 4\n5 15\n3 22\n2 14\n1 15", "1 3\n0 0", "5 21600\n2 14\n3 22\n1 3\n0 10\n1 9", "7 57\n0 25\n3 10\n2 4\n5 15\n3 22\n2 14\n1 9", "1 0\n1 -1", "7 149\n0 25\n3 10\n2 4\n2 20\n3 2...	There are N stores called Store 1, Store 2, \cdots, Store N. Takahashi, who is at his house at time 0, is planning to visit some of these stores. It takes Takahashi one unit of time to travel from his house to one of the stores, or between any two stores. If Takahashi reaches Store i at time t, he can do shopping the...
{ "inputs": [ "6\n1 3\n2 3\n3 3\n4 -3\n5 -1\n6 -100\n", "3\n-5 9\n0 1\n5 -1\n", "14\n-916171372 999999988\n-892307487 999999987\n-882212312 999999986\n-700694118 999998986\n-490374058 999997986\n-179890370 999996986\n-153268251 999995986\n-143722350 -999994986\n822181362 -999995986\n888153520 -999996986\n...	Recently the construction of Berland collider has been completed. Collider can be represented as a long narrow tunnel that contains n particles. We associate with collider 1-dimensional coordinate system, going from left to right. For each particle we know its coordinate and velocity at the moment of start of the colli...
{ "inputs": [ "5 229 8419\n1795 95\n4873 720\n3149 81\n6101 2325\n3674 629\n\nSAMPLE", "5 438 8419\n1795 95\n4873 720\n3149 81\n6101 2325\n3674 629\n\nSAMPLE", "5 438 8419\n1795 21\n4873 720\n3149 81\n6101 2325\n3674 629\n\nELPMAS", "5 438 8419\n1795 21\n4873 720\n3149 81\n6101 2325\n3674 795\n\nSLPMA...	Protection of the Indian border and safe transport of items from one point to another along the border are the paramount jobs for the Indian army. However they need some information about the protection status along the length of the border. The border can be viewed as the real x-axis. Along the axis, Indian army has N...
{ "inputs": [ "3 6 1 2 1\n", "5 10 1 2 5\n", "10000 1 999999999 1000000000 1\n", "9103 555078149 86703 93382 8235\n", "9102 808807765 95894 96529 2021\n", "39 407 62 63 2\n", "8367 515267305 49370 57124 723\n", "59 770 86 94 2\n", "39 252 51 98 26\n", "10000 1 1 2 1\n", "59...	On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get to the excursion quickly, it was decided to rent a bus, which has seats for k people (it means that it can't fit more than k pe...
{ "inputs": [ "5\n1 2 3 4 5\n", "10\n635370 154890 909382 220996 276501 716105 538714 140162 171960 271264\n", "1\n1\n", "10\n371054 506438 397130 1 766759 208409 769264 549213 641270 771837\n", "1\n1000000\n", "1\n2\n", "2\n3 2\n", "50\n110876 835020 859879 999908 712969 788264 287153...	A magic island Geraldion, where Gerald lives, has its own currency system. It uses banknotes of several values. But the problem is, the system is not perfect and sometimes it happens that Geraldionians cannot express a certain sum of money with any set of banknotes. Of course, they can use any number of banknotes of ea...
{ "inputs": [ "1 8\n2 8 81\n", "2 30\n20 30 80\n3 9 85\n", "4 319\n63 79 89\n79 97 91\n75 87 88\n75 90 83\n", "2 98\n77 86 82\n17 21 91\n", "50 1872\n45 85 93\n37 67 97\n62 77 83\n50 71 81\n59 62 84\n52 82 96\n67 73 96\n59 92 99\n33 66 96\n18 43 94\n4 82 96\n15 29 93\n47 87 84\n33 67 83\n78 99 88\...	You're trying to set the record on your favorite video game. The game consists of N levels, which must be completed sequentially in order to beat the game. You usually complete each level as fast as possible, but sometimes finish a level slower. Specifically, you will complete the i-th level in either Fi seconds or Si ...
{ "inputs": [ "1\n0 10 0 10\n", "2\n12 3 4 7\n1 15 9 1\n", "2\n5 4 8 8\n4 12 14 0\n", "10\n31181 6 72281 7\n65255 10 17867 2\n96212 8 32852 10\n69668 6 37236 1\n6031 7 61541 0\n12286 4 40227 2\n30573 9 36317 3\n97429 6 35399 9\n20907 5 19251 8\n86446 8 56301 10\n", "10\n1000000000 0 1000000000 0\n...	Alice and Bonnie are sisters, but they don't like each other very much. So when some old family photos were found in the attic, they started to argue about who should receive which photos. In the end, they decided that they would take turns picking photos. Alice goes first. There are n stacks of photos. Each stack con...
{ "inputs": [ "2\n4 1\n1 2 5\n3 1 2\n3 4 3\n7 2\n1 2 5\n1 3 4\n1 4 2\n2 5 1\n2 6 2\n4 7 3\n", "10\n9 3\n7 4 10\n6 8 1\n1 3 6\n2 4 10\n2 9 1\n5 4 9\n3 6 5\n1 2 5\n2 6\n1 2 2\n2 4\n1 2 8\n7 7\n4 3 2\n6 5 1\n3 2 3\n3 5 7\n7 1 10\n1 2 9\n3 9\n3 2 6\n2 1 8\n7 10\n1 5 9\n3 4 2\n1 3 6\n7 3 9\n3 6 3\n1 2 3\n6 3\n2 1 ...	You are given a weighted tree consisting of n vertices. Recall that a tree is a connected graph without cycles. Vertices u_i and v_i are connected by an edge with weight w_i. Let's define the k-coloring of the tree as an assignment of exactly k colors to each vertex, so that each color is used no more than two times. ...
{ "inputs": [ "3 4\n2 2 1 3\n2 2 3 1\n\nSAMPLE", "100000 344\n9489 61424 27955 42780 24866 60662 35985 72602 7178 66039 20165 80878 65110 53338 89723 12426 82120 81954 41970 39397 58255 82537 3650 28876 93078 72976 12227 6751 83149 67385 30224 11174 57709 8346 76772 99593 37316 51065 36529 82364 8508 25414 90...	After setting up the area and his toys. Chandu is up for playing his very first game. His first game is played on a N X N board with some initial stones placed on each cell. He can move each stone in all four direction i.e up,down, left or right. His target of the game is to move all stones to any one of the four corn...
{ "inputs": [ "3\n0 0 1\n0 0 1\n1 1 0\n", "4\n0 1 1 1\n1 0 1 1\n1 1 0 1\n1 1 1 0\n", "3\n0 0 0\n0 0 1\n0 1 0\n", "4\n0 0 1 0\n0 0 0 1\n1 0 0 0\n0 1 0 0\n", "4\n0 0 0 1\n0 0 0 0\n0 0 0 1\n1 0 1 0\n", "10\n0 0 0 0 0 0 1 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 1 0 0 0 0 0 0\n0 0 1 0 0 0 0 0 0 0\n0 0 0 ...	There are n points marked on the plane. The points are situated in such a way that they form a regular polygon (marked points are its vertices, and they are numbered in counter-clockwise order). You can draw n - 1 segments, each connecting any two marked points, in such a way that all points have to be connected with e...
{ "inputs": [ "8 3\n2 0\n7 0\n8 3\n", "8 2\n2 0\n7 0\n", "99999999 20\n3 100000000\n14 100000000\n22 100000000\n24 100000000\n31 100000000\n41 100000000\n46 100000000\n84 100000000\n94 100000000\n98 100000000\n99999912 100000000\n99999915 100000000\n99999916 100000000\n99999923 100000000\n99999935 1000000...	A tourist hiked along the mountain range. The hike lasted for n days, during each day the tourist noted height above the sea level. On the i-th day height was equal to some integer hi. The tourist pick smooth enough route for his hike, meaning that the between any two consecutive days height changes by at most 1, i.e. ...
{ "inputs": [ "4\n0 0 100 60\n0 60 50 90\n50 60 100 90\n0 90 100 120\n6\n0 0 100 40\n0 40 50 70\n50 40 100 60\n50 60 100 80\n0 70 50 120\n50 80 100 120\n0", "4\n0 0 100 60\n0 60 50 90\n50 60 100 90\n0 90 100 120\n6\n0 0 100 40\n0 67 50 70\n50 40 100 60\n50 60 100 80\n0 70 50 120\n50 80 100 120\n0", "4\n0 ...	Yanagi is a high school student, and she is called "Hime" by her boyfriend who is a ninja fanboy. She likes picture books very much, so she often writes picture books by herself. She always asks you to make her picture book as an assistant. Today, you got asked to help her with making a comic. She sometimes reads her ...
{ "inputs": [ "10 3 5 2\n5 50\n7 60\n8 100\n2 2 5\n3\n1 3\n3\n3\n", "484 30 46 67\n51 74\n105 26\n242 24\n22 81\n48 46\n21 11\n60 74\n160 46\n91 3\n39 87\n100 55\n294 58\n64 22\n380 14\n300 33\n143 79\n15 24\n2 40\n90 54\n323 21\n240 6\n147 99\n187 16\n25 30\n88 32\n130 28\n49 98\n45 25\n14 41\n260 74\n1 144\...	Rainbow built h cells in a row that are numbered from 1 to h from left to right. There are n cells with treasure. We call each of these n cells "Treasure Cell". The i-th "Treasure Cell" is the ai-th cell and the value of treasure in it is ci dollars. Then, Freda went in the first cell. For now, she can go just k cells...
{ "inputs": [ "2 10\n1 2\n1 9\n8 7", "2 10\n1 2\n1 9\n6 7", "2 10\n2 2\n1 9\n10 7", "1 10\n1 2\n1 9\n8 7", "2 10\n1 2\n1 9\n10 7", "2 20\n2 2\n1 9\n10 7", "2 10\n3 2\n1 9\n10 7", "1 10\n1 2\n0 9\n8 7", "2 11\n2 2\n1 9\n10 7", "2 13\n3 2\n1 9\n10 7", "1 10\n1 0\n0 9\n8 7", ...	H: Colorful Tree Story Yamiuchi (assassination) is a traditional event that is held annually in JAG summer camp. Every team displays a decorated tree in the dark and all teams' trees are compared from the point of view of their colorfulness. In this competition, it is allowed to cut the other teams’ tree to reduce it...
{ "inputs": [ "A?\n?\n3\n", "A\nB\n10\n", "AAAAAAAAAAAAAAAAAAAAA\n?\n300000\n", "?\n?\n300000\n", "ABB\nAB\n129133\n", "A\n?\n10\n", "A\nA\n300000\n", "??\n??\n1\n", "AAAAA\nAAAAA\n13\n", "?????\n?????\n5\n", "A\nB\n300000\n", "AB????\nAB\n300000\n", "??B?\n?A?\n5\n...	Igor the analyst is at work. He learned about a feature in his text editor called "Replace All". Igor is too bored at work and thus he came up with the following problem: Given two strings x and y which consist of the English letters 'A' and 'B' only, a pair of strings (s, t) is called good if: * s and t consist of...
{ "inputs": [ "5 1\n2 1 3 2\n2 1 2 2\n0 0", "5 1\n2 1 3 2\n2 1 2 2\n0 1", "5 1\n2 1 5 2\n2 1 2 2\n0 1", "5 1\n1 1 5 2\n2 1 2 2\n0 1", "5 1\n1 1 0 2\n2 1 2 2\n0 1", "5 1\n2 1 3 2\n2 1 4 2\n0 1", "5 1\n2 1 1 2\n2 1 2 2\n0 1", "5 1\n1 1 5 1\n2 1 2 0\n0 1", "5 1\n1 1 1 2\n4 1 2 2\n0 1"...	In a forest, there lived a spider named Tim. Tim was so smart that he created a huge, well-structured web. Surprisingly, his web forms a set of equilateral and concentric N-sided polygons whose edge lengths form an arithmetic sequence. <image> Figure 1: An example web of Tim Corresponding vertices of the N-sided pol...
{ "inputs": [ "2 2 2 1\n0 0 0", "2 2 2 0\n0 0 0", "2 1 2 0\n-1 -1 0", "2 0 2 0\n-1 0 0", "4 2 2 0\n0 0 1", "3 1 2 0\n-1 0 -1", "1 2 1 0\n-2 -1 0", "2 2 3 0\n-1 -1 -1", "1 1 4 0\n0 1 -1", "3 2 0 0\n-1 -1 -1", "1 0 1 0\n0 1 -1", "1 -1 1 0\n0 1 -1", "1 0 0 0\n0 0 -1", ...	Example Input 2 2 2 1 0 0 0 Output 24
{ "inputs": [ "3 2\n6 2 6\n", "6 9\n9 9 9 9 9 9\n", "1 500000\n500000\n", "18 4\n2 4 9 5 8 3 8 9 5 5 8 1 1 6 6 5 9 8\n", "1 1\n500000\n", "9 2\n1 2 1 2 1 2 1 3 3\n", "2 1\n1 2\n", "18 1\n2 2 2 2 1 1 1 1 2 1 2 2 1 2 2 2 2 2\n", "18 5\n4 4 4 6 6 4 1 1 1 1 3 3 4 5 6 4 1 3\n", "18 ...	You are given array a of length n. You can choose one segment [l, r] (1 ≤ l ≤ r ≤ n) and integer value k (positive, negative or even zero) and change a_l, a_{l + 1}, ..., a_r by k each (i.e. a_i := a_i + k for each l ≤ i ≤ r). What is the maximum possible number of elements with value c that can be obtained after one ...
{ "inputs": [ "3 2\n2 6\n4 3\n1 5", "3 4\n1 4 7 10\n2 5 8 11\n3 6 9 12", "3 2\n2 5\n4 3\n1 5", "3 2\n2 6\n4 3\n2 5", "3 2\n1 6\n4 3\n2 5", "3 2\n1 6\n4 4\n2 5", "3 4\n1 4 7 10\n2 6 8 11\n3 6 9 12", "3 2\n2 5\n3 3\n1 5", "3 2\n2 6\n4 3\n2 6", "3 2\n1 6\n4 3\n2 6", "3 2\n1 6\...	We have a grid with N rows and M columns of squares. Each integer from 1 to NM is written in this grid once. The number written in the square at the i-th row from the top and the j-th column from the left is A_{ij}. You need to rearrange these numbers as follows: 1. First, for each of the N rows, rearrange the number...
{ "inputs": [ "2 2 1000000007\n/\n/\n", "2 2 1000000007\n\n\\\\", "2 2 3\n\n\n", "20 19 1000000007\n/\\*****/\\///\\\n/\\\\/*///\\\n****\\//\\\\***/\n//*******//\\/\\\\\n//\\\\\\\\*/\\\\\\/\\//\n////\\\\\\/*\\\\\n//\\\\**\\//\n\\//////*\\\\...	You are given a box full of mirrors. Box consists of grid of size n × m. Each cell of the grid contains a mirror put in the shape of '\' or ' / ' (45 degree to the horizontal or vertical line). But mirrors in some cells have been destroyed. You want to put new mirrors into these grids so that the following two conditio...
{ "inputs": [ "6 3\n5 6\n1 4\n4 6\n", "5 3\n1 3\n2 4\n2 5\n", "1000 10\n3 998\n2 1000\n1 999\n2 1000\n3 998\n2 1000\n3 998\n1 1000\n2 1000\n3 999\n", "1 1\n1 1\n", "1000 20\n50 109\n317 370\n710 770\n440 488\n711 757\n236 278\n314 355\n131 190\n115 162\n784 834\n16 56\n677 730\n802 844\n632 689\n2...	Sonya decided to organize an exhibition of flowers. Since the girl likes only roses and lilies, she decided that only these two kinds of flowers should be in this exhibition. There are n flowers in a row in the exhibition. Sonya can put either a rose or a lily in the i-th position. Thus each of n positions should cont...
{ "inputs": [ "15\n57\n62\n47\n45\n42\n74\n90\n75\n54\n50\n66\n63\n77\n87\n51", "2\n1\n2", "7\n10\n15\n13\n18\n11\n14\n19", "15\n57\n62\n37\n45\n42\n74\n90\n75\n54\n50\n66\n63\n77\n87\n51", "2\n0\n2", "7\n10\n15\n13\n18\n11\n24\n19", "15\n57\n62\n74\n45\n42\n74\n90\n75\n54\n50\n66\n63\n77\...	You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist? * The vertices are numbered 1,2,..., N. * The edges are numbered 1,2,..., N-1, and Edge i connects Vertex u_i and v_i. * For each vertex i, the sum of ...
{ "inputs": [ "4 5 3 1 5\n", "5 1 2 1 2\n", "3 3 1 1 1\n", "2 313 856 964 421\n", "61 464 623 89 548\n", "37 261 207 1 1000\n", "4 202 512 995 375\n", "3 3 1 6 9\n", "213 480 811 134 745\n", "1 10 2 6 10\n", "6 5 7 10 4\n", "2 7 6 2 3\n", "29 344 406 900 1\n", "...	Two boys decided to compete in text typing on the site "Key races". During the competition, they have to type a text consisting of s characters. The first participant types one character in v1 milliseconds and has ping t1 milliseconds. The second participant types one character in v2 milliseconds and has ping t2 millis...
{ "inputs": [ "2\n31\n4 1\n160\n9 2\n\nSAMPLE", "2\n31\n4 1\n98\n9 2\n\nSAMPLE", "2\n31\n7 1\n98\n17 2\n\nSAMOLE", "2\n6\n7 1\n98\n17 2\n\nSAMOLE", "2\n6\n4 2\n98\n24 3\n\nSAMOLE", "2\n6\n4 2\n152\n24 3\n\nSAMOLE", "2\n12\n4 1\n152\n24 3\n\nSAMOLE", "2\n12\n4 1\n72\n24 3\n\nELOMAS", ...	Gudi enters the castle, and moves along the main path. Suddenly, a block in the ground opens and she falls into it! Gudi slides down and lands in a dark room. A mysterious voice announces: Intruders are not allowed inside the castle. To proceed, you must solve my puzzle. Here is a string S indexed from 1 to N, cons...
{ "inputs": [ "5 4 10 1 6\n1 1 5\n1 5 5\n1 3 2\n1 5 2\n2 1\n2 2\n", "5 2 2 1 8\n1 1 2\n1 5 3\n1 2 1\n2 2\n1 4 2\n1 3 2\n2 1\n2 3\n", "1 1 2 1 1\n2 1\n", "1 1 2 0 1\n2 1\n", "5 4 10 1 6\n1 1 5\n1 5 5\n1 3 2\n1 5 1\n2 1\n2 2\n", "5 2 2 1 8\n1 1 2\n1 5 3\n1 2 1\n2 2\n1 4 0\n1 3 2\n2 1\n2 3\n", ...	A factory produces thimbles in bulk. Typically, it can produce up to a thimbles a day. However, some of the machinery is defective, so it can currently only produce b thimbles each day. The factory intends to choose a k-day period to do maintenance and construction; it cannot produce any thimbles during this time, but ...
{ "inputs": [ "7 2\nabacaba\naa\n", "15 6\nqwertyhgfdsazxc\nqa\n", "7 3\nasddsaf\nsd\n", "4 2\nbbaa\nab\n", "200 100\ncxqtpwtozcnavklpcksprgecocdraaryxzztqkcfzsrhdrzabtwdukzmsgpnvvgigbtyaxubrngiomfatojjvnvhogqqlujsrglodzwmpyjijtzdzcczlxvhmkkefuereazzwfqbndaccpvlupgixdezadhvwdfzxqzmnkcgwktubylaiezr...	You are given two strings s and t consisting of lowercase Latin letters. The length of t is 2 (i.e. this string consists only of two characters). In one move, you can choose any character of s and replace it with any lowercase Latin letter. More formally, you choose some i and replace s_i (the character at the positio...
{ "inputs": [ "2\n3 2\n7 6 3 5 4 2 1\n3 2\n7 6 5 4 3 2 1\n", "2\n3 2\n7 6 3 5 4 2 1\n3 2\n7 6 5 4 3 2 1\n", "2\n3 2\n7 6 3 5 4 2 1\n3 2\n14 6 5 4 3 2 1\n", "2\n3 1\n7 6 3 5 4 2 1\n3 2\n14 6 5 4 3 2 1\n", "2\n3 2\n7 6 3 5 4 2 1\n3 1\n23 6 5 4 3 2 1\n", "2\n3 1\n7 6 3 5 4 2 1\n3 1\n23 6 5 4 3 2 ...	Drazil likes heap very much. So he created a problem with heap: There is a max heap with a height h implemented on the array. The details of this heap are the following: This heap contains exactly 2^h - 1 distinct positive non-zero integers. All integers are distinct. These numbers are stored in the array a indexed f...
{ "inputs": [ "5", "1", "4", "2", "3", "8", "11", "10", "7", "6", "12", "14", "9", "19", "16", "15", "13", "23", "32", "58", "99", "34", "54", "35", "40", "67", "41", "62", "49", "24", "17", ...	Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 above week by week. Write a program which computes the amount of the debt in n weeks. Input An integer n (0 ≤ n ≤ 100) is g...
{ "inputs": [ "3\na\naa\naa\na\n", "5\nba\na\nabab\na\naba\nbaba\nab\naba\n", "2\na\nc\n", "5\na\na\nab\nba\naba\naba\nbaba\nabab\n", "4\nab\na\nb\nbab\nab\naba\n", "5\na\naa\naaa\naaaa\nb\nba\nbaa\nbaaa\n", "4\na\nba\naba\nb\nba\nbab\n", "4\na\nb\nab\nab\nbab\naba\n", "5\nbaba\nab...	Ivan wants to play a game with you. He picked some string s of length n consisting only of lowercase Latin letters. You don't know this string. Ivan has informed you about all its improper prefixes and suffixes (i.e. prefixes and suffixes of lengths from 1 to n-1), but he didn't tell you which strings are prefixes an...
{ "inputs": [ "98765432109876543210\n58", "30\n4", "1000000009\n1", "98765432109876543210\n66", "30\n1", "1000000009\n2", "98765432109876543210\n18", "1000000009\n4", "98765432109876543210\n11", "1000000009\n5", "98765432109876543210\n12", "1000000009\n9", "98765432...	Find the number of integers between 1 and K (inclusive) satisfying the following condition, modulo 10^9 + 7: * The sum of the digits in base ten is a multiple of D. Constraints * All values in input are integers. * 1 \leq K < 10^{10000} * 1 \leq D \leq 100 Input Input is given from Standard Input in the following ...
{ "inputs": [ "3\n8 3\n0 1\n4 8", "1\n1 1", "2\n1 2\n3 2", "2\n1 3\n3 1", "1\n0 0", "2\n1 5\n5 1", "3\n8 3\n-1 1\n5 8", "2\n0 2\n3 1", "2\n0 1\n3 2", "2\n1 4\n5 2", "3\n8 3\n-1 0\n4 8", "1\n2 2", "1\n-1 -1", "2\n1 0\n1 2", "2\n2 3\n2 1", "1\n3 3", "1...	You are given sequences A and B consisting of non-negative integers. The lengths of both A and B are N, and the sums of the elements in A and B are equal. The i-th element in A is A_i, and the i-th element in B is B_i. Tozan and Gezan repeats the following sequence of operations: * If A and B are equal sequences, ter...
{ "inputs": [ "3\njohn johanna\nira ira\nkayla jayla", "3\njohn johanna\nira ria\nkayla jayla", "3\njohn johanna\nria ria\nkayla jayla", "3\njogn johanna\nria qia\nkayma jayla", "3\nipoh o`gomka\nbjr bjr\njmya` aayjk", "3\njohn johanna\nria ria\nkayma jayla", "3\njohn johanna\nria qia\nkay...	In an attempt to control the rise in population, Archer was asked to come up with a plan. This time he is targeting marriages. Archer, being as intelligent as he is, came up with the following plan: A man with name M is allowed to marry a woman with name W, only if M is a subsequence of W or W is a subsequence of M. A ...
{ "inputs": [ "7 2\n1 2\n1 3\n1 4\n3 5\n3 6\n3 7\n2 7\n", "6 4\n1 2\n2 3\n2 4\n4 5\n4 6\n2 4 5 6\n", "10 3\n10 5\n3 2\n6 8\n1 5\n10 4\n6 1\n9 8\n2 9\n7 3\n3 9 1\n", "16 8\n16 12\n16 15\n15 9\n15 13\n16 3\n15 2\n15 10\n1 2\n6 16\n5 15\n2 7\n15 4\n14 15\n11 16\n8 5\n5 10 14 6 8 3 1 9\n", "8 5\n2 5\n...	Ari the monster is not an ordinary monster. She is the hidden identity of Super M, the Byteforces’ superhero. Byteforces is a country that consists of n cities, connected by n - 1 bidirectional roads. Every road connects exactly two distinct cities, and the whole road system is designed in a way that one is able to go ...
{ "inputs": [ "3\n4 28 27 11\n15 20 42 5\n11 24 33 14\n5\n4 28 27 11\n12 11 34 2\n7 26 14 16\n14 16 19 12\n17 28 27 21\n2\n300000 1000000 600000 0\n0 600000 1000000 300000\n0", "3\n4 28 27 11\n15 20 42 5\n11 24 33 14\n5\n4 28 27 11\n12 11 34 2\n7 26 14 16\n14 16 19 12\n17 28 27 21\n2\n322297 1000000 600000 0\...	There are a number of rectangles on the x-y plane. The four sides of the rectangles are parallel to either the x-axis or the y-axis, and all of the rectangles reside within a range specified later. There are no other constraints on the coordinates of the rectangles. The plane is partitioned into regions surrounded by ...

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.