0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You can not just take the file and send it. When Polycarp trying to send a file in the social network \"Codehorses\", he encountered an unexpected problem. If the name of the file contains three or more \"x\" (lowercase Latin letters \"x\") in a row, the system considers that the file content does not correspond to the social network topic. In this case, the file is not sent and an error message is displayed.\n\nDetermine the minimum number of characters to remove from the file name so after that the name does not contain \"xxx\" as a substring. Print 0 if the file name does not initially contain a forbidden substring \"xxx\".\n\nYou can delete characters in arbitrary positions (not necessarily consecutive). If you delete a character, then the length of a string is reduced by $1$. For example, if you delete the character in the position $2$ from the string \"exxxii\", then the resulting string is \"exxii\".",
"input": "",
"output": "```python\nn = int(input())\r\ns = input()\r\nsegs = []\r\nseg=[-1,-1]\r\nfor i in range(len(s)):\r\n if(s[i] == 'x'):\r\n if(seg[0] == -1):\r\n seg[0] = i\r\n seg[1] = i\r\n else:\r\n seg[-1] = i\r\n else:\r\n if(seg[0] != -1):\r\n segs.append(seg)\r\n seg = [-1,-1]\r\nif(seg[0] != -1):\r\n segs.append(seg)\r\nans = 0\r\nfor i in segs:\r\n l = i[1] - i[0] + 1\r\n if(l >= 3):\r\n ans += l - 2\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A famous Berland's painter Kalevitch likes to shock the public. One of his last obsessions is chess. For more than a thousand years people have been playing this old game on uninteresting, monotonous boards. Kalevitch decided to put an end to this tradition and to introduce a new attitude to chessboards.\n\nAs before, the chessboard is a square-checkered board with the squares arranged in a 8<=×<=8 grid, each square is painted black or white. Kalevitch suggests that chessboards should be painted in the following manner: there should be chosen a horizontal or a vertical line of 8 squares (i.e. a row or a column), and painted black. Initially the whole chessboard is white, and it can be painted in the above described way one or more times. It is allowed to paint a square many times, but after the first time it does not change its colour any more and remains black. Kalevitch paints chessboards neatly, and it is impossible to judge by an individual square if it was painted with a vertical or a horizontal stroke.\n\nKalevitch hopes that such chessboards will gain popularity, and he will be commissioned to paint chessboards, which will help him ensure a comfortable old age. The clients will inform him what chessboard they want to have, and the painter will paint a white chessboard meeting the client's requirements.\n\nIt goes without saying that in such business one should economize on everything — for each commission he wants to know the minimum amount of strokes that he has to paint to fulfill the client's needs. You are asked to help Kalevitch with this task.",
"input": "",
"output": "```python\ndef main():\r\n row = [False] * 8\r\n col = [False] * 8\r\n\r\n for r in range(8):\r\n s = input()\r\n for c in range(8):\r\n if s[c] == 'W':\r\n row[r] = True\r\n col[c] = True\r\n\r\n answer = 16 - sum(row) - sum(col)\r\n if answer == 16:\r\n answer = 8\r\n\r\n print(answer)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a game called \"I Wanna Be the Guy\", consisting of *n* levels. Little X and his friend Little Y are addicted to the game. Each of them wants to pass the whole game.\n\nLittle X can pass only *p* levels of the game. And Little Y can pass only *q* levels of the game. You are given the indices of levels Little X can pass and the indices of levels Little Y can pass. Will Little X and Little Y pass the whole game, if they cooperate each other?",
"input": "",
"output": "```python\nx = int(input())\r\np = list(map(int,input().split()))\r\nq = list(map(int,input().split()))\r\np.pop(0)\r\nq.pop(0)\r\nr = p+q\r\nm = list(range(1,x+1))\r\nsum = 0\r\nfor a in m :\r\n if a in r:\r\n sum+=1\r\nif sum == x:\r\n print(\"I become the guy.\")\r\nelse: print(\"Oh, my keyboard!\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Anton's favourite geometric figures are regular polyhedrons. Note that there are five kinds of regular polyhedrons: \n - Tetrahedron. Tetrahedron has 4 triangular faces. - Cube. Cube has 6 square faces. - Octahedron. Octahedron has 8 triangular faces. - Dodecahedron. Dodecahedron has 12 pentagonal faces. - Icosahedron. Icosahedron has 20 triangular faces. \nAll five kinds of polyhedrons are shown on the picture below:\n\nAnton has a collection of *n* polyhedrons. One day he decided to know, how many faces his polyhedrons have in total. Help Anton and find this number!",
"input": "",
"output": "```python\nn=int(input())\r\nt_f=0\r\nfor i in range(n):\r\n p=input()\r\n if p==\"Tetrahedron\":\r\n t_f+=4\r\n elif p==\"Cube\":\r\n t_f+=6\r\n elif p==\"Octahedron\":\r\n t_f+=8\r\n elif p==\"Dodecahedron\":\r\n t_f+=12\r\n elif p==\"Icosahedron\":\r\n t_f+=20\r\nprint(t_f)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Lenny is playing a game on a 3<=×<=3 grid of lights. In the beginning of the game all lights are switched on. Pressing any of the lights will toggle it and all side-adjacent lights. The goal of the game is to switch all the lights off. We consider the toggling as follows: if the light was switched on then it will be switched off, if it was switched off then it will be switched on.\n\nLenny has spent some time playing with the grid and by now he has pressed each light a certain number of times. Given the number of times each light is pressed, you have to print the current state of each light.",
"input": "",
"output": "```python\nmat = [[int(x) for x in input().split()] for y in range(3)]\r\na=[[0 for x in range(3)] for y in range(3)]\r\nfor i in range(3) :\r\n\tfor j in range(3) :\r\n\t\twhile mat[i][j]>0 :\r\n\t\t\tfor ii in range(0,3) :\r\n\t\t\t\ta[ii][j]=a[ii][j]+1\r\n\t\t\t#print(a)\r\n\t\t\tfor jj in range(0,3) :\r\n\t\t\t\ta[i][jj]=a[i][jj]+1\r\n\t\t\tmat[i][j]=mat[i][j]-1\r\n\t\t\t#print(a)\r\nans=[[0 for x in range(3)] for y in range(3)]\r\nfor i in range(3) :\r\n\tfor j in range(3) :\r\n\t\tprint(1 if a[i][j]%2==0 else 0,end=\"\")\r\n\tprint()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Santa Claus has *n* candies, he dreams to give them as gifts to children.\n\nWhat is the maximal number of children for whose he can give candies if Santa Claus want each kid should get distinct positive integer number of candies. Santa Class wants to give all *n* candies he has.",
"input": "",
"output": "```python\nf = int(input())\r\n\r\n\r\ndata = dict()\r\ndata[1] = [{1}]\r\ndata[2] = [{2}]\r\ndata[3] = [{1, 2}]\r\n\r\nfor c in range(4, f+1):\r\n t = data[c-1]\r\n\r\n n = list()\r\n for i in t:\r\n if 1 in i:\r\n for z in i:\r\n if sum(i - {z} | {z+1}) == c:\r\n n.append(i - {z} | {z+1})\r\n else:\r\n n.append(i | {1})\r\n\r\n l = max([len(x) for x in n])\r\n b = set()\r\n for z in n:\r\n if len(z) == l:\r\n b.add(tuple(z))\r\n data[c] = [list(map(lambda x: set(x), b))[0]]\r\n\r\nl = len(data[f][0])\r\ns = ' '.join(map(str, list(data[f][0])))\r\nprint(f'{l}\\n{s}')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A soldier wants to buy *w* bananas in the shop. He has to pay *k* dollars for the first banana, 2*k* dollars for the second one and so on (in other words, he has to pay *i*·*k* dollars for the *i*-th banana). \n\nHe has *n* dollars. How many dollars does he have to borrow from his friend soldier to buy *w* bananas?",
"input": "",
"output": "```python\nk, n, w = map(int, input().split())\r\ntotal = int(w * (w + 1) / 2)\r\nif ans := (total * k - n) > 0 : print(ans)\r\nelse : print(0)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In a new version of the famous Pinball game, one of the most important parts of the game field is a sequence of *n* bumpers. The bumpers are numbered with integers from 1 to *n* from left to right. There are two types of bumpers. They are denoted by the characters '<' and '>'. When the ball hits the bumper at position *i* it goes one position to the right (to the position *i*<=+<=1) if the type of this bumper is '>', or one position to the left (to *i*<=-<=1) if the type of the bumper at position *i* is '<'. If there is no such position, in other words if *i*<=-<=1<=<<=1 or *i*<=+<=1<=><=*n*, the ball falls from the game field.\n\nDepending on the ball's starting position, the ball may eventually fall from the game field or it may stay there forever. You are given a string representing the bumpers' types. Calculate the number of positions such that the ball will eventually fall from the game field if it starts at that position.",
"input": "",
"output": "```python\nimport os\r\nos.system(\"cls\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The winner of the card game popular in Berland \"Berlogging\" is determined according to the following rules. If at the end of the game there is only one player with the maximum number of points, he is the winner. The situation becomes more difficult if the number of such players is more than one. During each round a player gains or loses a particular number of points. In the course of the game the number of points is registered in the line \"name score\", where name is a player's name, and score is the number of points gained in this round, which is an integer number. If score is negative, this means that the player has lost in the round. So, if two or more players have the maximum number of points (say, it equals to *m*) at the end of the game, than wins the one of them who scored at least *m* points first. Initially each player has 0 points. It's guaranteed that at the end of the game at least one player has a positive number of points.",
"input": "",
"output": "```python\nimport collections\r\nn = int(input())\r\nd = collections.defaultdict(lambda: [0, 0])\r\nmax = None\r\nfor i in range(n):\r\n info = input().split(\" \")\r\n if max is None: max = info[0]\r\n d[info[0]][0] += int(info[1])\r\n d[info[0]][1] = i\r\n if d[info[0]][0] > d[max][0]: max = info[0]\r\n \r\nprint(max)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her objective is to get away with at least one brain, so she can analyze the zombies' mindset back home and gain a strategic advantage.\n\nThey will be *N* guests tonight: *N*<=-<=1 real zombies and a fake one, our Heidi. The living-dead love hierarchies as much as they love brains: each one has a unique rank in the range 1 to *N*<=-<=1, and Heidi, who still appears slightly different from the others, is attributed the highest rank, *N*. Tonight there will be a chest with brains on display and every attendee sees how many there are. These will then be split among the attendees according to the following procedure:\n\nThe zombie of the highest rank makes a suggestion on who gets how many brains (every brain is an indivisible entity). A vote follows. If at least half of the attendees accept the offer, the brains are shared in the suggested way and the feast begins. But if majority is not reached, then the highest-ranked zombie is killed, and the next zombie in hierarchy has to make a suggestion. If he is killed too, then the third highest-ranked makes one, etc. (It's enough to have exactly half of the votes – in case of a tie, the vote of the highest-ranked alive zombie counts twice, and he will of course vote in favor of his own suggestion in order to stay alive.)\n\nYou should know that zombies are very greedy and sly, and they know this too – basically all zombie brains are alike. Consequently, a zombie will never accept an offer which is suboptimal for him. That is, if an offer is not strictly better than a potential later offer, he will vote against it. And make no mistake: while zombies may normally seem rather dull, tonight their intellects are perfect. Each zombie's priorities for tonight are, in descending order: \n 1. survive the event (they experienced death already once and know it is no fun), 1. get as many brains as possible. \nHeidi goes first and must make an offer which at least half of the attendees will accept, and which allocates at least one brain for Heidi herself.\n\nWhat is the smallest number of brains that have to be in the chest for this to be possible?",
"input": "",
"output": "```python\nn = int(input())\nif n%2==1:\n print(n//2+1)\nelse:\n print(n//2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little boy Valera studies an algorithm of sorting an integer array. After studying the theory, he went on to the practical tasks. As a result, he wrote a program that sorts an array of *n* integers *a*1,<=*a*2,<=...,<=*a**n* in the non-decreasing order. The pseudocode of the program, written by Valera, is given below. The input of the program gets number *n* and array *a*.\n\nBut Valera could have made a mistake, because he hasn't yet fully learned the sorting algorithm. If Valera made a mistake in his program, you need to give a counter-example that makes his program work improperly (that is, the example that makes the program sort the array not in the non-decreasing order). If such example for the given value of *n* doesn't exist, print -1.",
"input": "",
"output": "```python\nn=int(input())\r\nif n==1:\r\n print(-1)\r\nelse:\r\n a=\"\"\r\n while n>0:\r\n a=a+str(n)\r\n a=a+\" \"\r\n n=n-1\r\n print(a)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The programming competition season has already started and it's time to train for ICPC. Sereja coaches his teams for a number of year and he knows that to get ready for the training session it's not enough to prepare only problems and editorial. As the training sessions lasts for several hours, teams become hungry. Thus, Sereja orders a number of pizzas so they can eat right after the end of the competition.\n\nTeams plan to train for *n* times during *n* consecutive days. During the training session Sereja orders exactly one pizza for each team that is present this day. He already knows that there will be *a**i* teams on the *i*-th day.\n\nThere are two types of discounts in Sereja's favourite pizzeria. The first discount works if one buys two pizzas at one day, while the second is a coupon that allows to buy one pizza during two consecutive days (two pizzas in total).\n\nAs Sereja orders really a lot of pizza at this place, he is the golden client and can use the unlimited number of discounts and coupons of any type at any days.\n\nSereja wants to order exactly *a**i* pizzas on the *i*-th day while using only discounts and coupons. Note, that he will never buy more pizzas than he need for this particular day. Help him determine, whether he can buy the proper amount of pizzas each day if he is allowed to use only coupons and discounts. Note, that it's also prohibited to have any active coupons after the end of the day *n*.",
"input": "",
"output": "```python\n\r\ninput()\r\np=0\r\nfor x in map(int, input().split()):\r\n p=1<<20 if x0 else 'YES')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.\n\nOne day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.\n\nIn his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The *i*-th digit of the answer is 1 if and only if the *i*-th digit of the two given numbers differ. In the other case the *i*-th digit of the answer is 0.\n\nShapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.\n\nNow you are going to take part in Shapur's contest. See if you are faster and more accurate.",
"input": "",
"output": "```python\na=input()\r\nb=input()\r\naa=[]\r\nbb=[]\r\nt=0\r\nfor c in a:\r\n aa.append(c)\r\nfor d in b:\r\n bb.append(d)\r\nwhile True:\r\n if aa[t]==bb[t]:\r\n t+=1\r\n print(0,end='')\r\n else:\r\n t+=1\r\n print(1,end='')\r\n if t>=len(a):\r\n break\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaurants and order the most expensive and exotic wood types there. \n\nThe content special agent has got an important task: to get the latest research by British scientists on the English Language. These developments are encoded and stored in a large safe. The Beaver's teeth are strong enough, so the authorities assured that upon arriving at the place the beaver won't have any problems with opening the safe.\n\nAnd he finishes his aspen sprig and leaves for this important task. Of course, the Beaver arrived at the location without any problems, but alas. He can't open the safe with his strong and big teeth. At this point, the Smart Beaver get a call from the headquarters and learns that opening the safe with the teeth is not necessary, as a reliable source has sent the following information: the safe code consists of digits and has no leading zeroes. There also is a special hint, which can be used to open the safe. The hint is string *s* with the following structure:\n - if *s**i* = \"?\", then the digit that goes *i*-th in the safe code can be anything (between 0 to 9, inclusively); - if *s**i* is a digit (between 0 to 9, inclusively), then it means that there is digit *s**i* on position *i* in code; - if the string contains letters from \"A\" to \"J\", then all positions with the same letters must contain the same digits and the positions with distinct letters must contain distinct digits. - The length of the safe code coincides with the length of the hint. \nFor example, hint \"?JGJ9\" has such matching safe code variants: \"51919\", \"55959\", \"12329\", \"93539\" and so on, and has wrong variants such as: \"56669\", \"00111\", \"03539\" and \"13666\".\n\nAfter receiving such information, the authorities change the plan and ask the special agents to work quietly and gently and not to try to open the safe by mechanical means, and try to find the password using the given hint.\n\nAt a special agent school the Smart Beaver was the fastest in his platoon finding codes for such safes, but now he is not in that shape: the years take their toll ... Help him to determine the number of possible variants of the code to the safe, matching the given hint. After receiving this information, and knowing his own speed of entering codes, the Smart Beaver will be able to determine whether he will have time for tonight's show \"Beavers are on the trail\" on his favorite TV channel, or he should work for a sleepless night...",
"input": "",
"output": "```python\n\r\n\r\nS = input()\r\n\r\nchSet = set()\r\n\r\nnumQ = 0\r\n\r\nfor s in S:\r\n if ord(s) >= 65 and ord(s) <= 74:\r\n chSet.add(s)\r\n \r\n elif s == '?':\r\n numQ += 1\r\n \r\n\r\nif len(chSet) != 0:\r\n cur = 1\r\n for i in range(10, max(10 - len(chSet), 0), -1):\r\n cur *= i\r\n if S[0] not in chSet:\r\n print(cur * pow(10, numQ))\r\n else:\r\n cur = cur * 9 // 10\r\n print(cur * pow(10, numQ))\r\nelse:\r\n print(pow(10, numQ))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two polar bears Menshykov and Uslada from the St.Petersburg zoo and elephant Horace from the Kiev zoo got six sticks to play with and assess the animals' creativity. Menshykov, Uslada and Horace decided to make either an elephant or a bear from those sticks. They can make an animal from sticks in the following way: \n - Four sticks represent the animal's legs, these sticks should have the same length. - Two remaining sticks represent the animal's head and body. The bear's head stick must be shorter than the body stick. The elephant, however, has a long trunk, so his head stick must be as long as the body stick. Note that there are no limits on the relations between the leg sticks and the head and body sticks. \nYour task is to find out which animal can be made from the given stick set. The zoo keeper wants the sticks back after the game, so they must never be broken, even bears understand it.",
"input": "",
"output": "```python\nfrom collections import Counter\r\ndef solved(dic):\r\n chan = 0\r\n if len(list(dic.values())) == 3:\r\n for k,v in dic.items():\r\n if v == 4:\r\n chan = k\r\n if chan != 0:\r\n return 'Bear'\r\n elif len(list(dic.values())) == 2:\r\n for k,v in dic.items():\r\n if v == 4:\r\n chan = k\r\n if chan != 0:\r\n return 'Elephant'\r\n else:\r\n return 'Alien'\r\nif __name__ == '__main__':\r\n lst = list(map(int,input().split()))\r\n dic = Counter(lst)\r\n print(solved(dic))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Your security guard friend recently got a new job at a new security company. The company requires him to patrol an area of the city encompassing exactly *N* city blocks, but they let him choose which blocks. That is, your friend must walk the perimeter of a region whose area is exactly *N* blocks. Your friend is quite lazy and would like your help to find the shortest possible route that meets the requirements. The city is laid out in a square grid pattern, and is large enough that for the sake of the problem it can be considered infinite.",
"input": "",
"output": "```python\nimport math\r\n\r\ndef compute(l, n):\r\n l2 = math.ceil(n / l)\r\n return 2 * l + 2 * l2\r\n\r\nn = int(input())\r\n\r\nbest = 9999999999\r\nfor i in range(1, n):\r\n best = min(best, compute(i, n))\r\nprint(best)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given *n* switches and *m* lamps. The *i*-th switch turns on some subset of the lamps. This information is given as the matrix *a* consisting of *n* rows and *m* columns where *a**i*,<=*j*<==<=1 if the *i*-th switch turns on the *j*-th lamp and *a**i*,<=*j*<==<=0 if the *i*-th switch is not connected to the *j*-th lamp.\n\nInitially all *m* lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all *n* switches then all *m* lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other *n*<=-<=1 switches then all the *m* lamps will be turned on.",
"input": "",
"output": "```python\ndef dfs(v,graph,flag,vnt):\r\n\tvnt[v] = 1\r\n\tflag[v] = True\r\n\tfor i in range(len(graph[v])):\r\n\t\tif(flag[graph[v][i]] == False):\r\n\t\t\tdfs(graph[v][i],graph,flag,vnt)\r\n\t\t\tvnt[v] += vnt[graph[v][i]]\r\n\r\n\r\n\r\nn = int(input())\r\n\r\ngraph = [[] for _ in range(n+1)]\r\nflag = [False]*(n+1)\r\nvnt = [0]*(n+1)\r\nfor _ in range(n-1):\r\n\tu,v = input().split()\r\n\tgraph[int(u) -1].append(int(v) -1)\r\n\tgraph[int(v) -1].append(int(u) -1)\r\ndfs(0,graph,flag,vnt)\r\nans = 0\r\n\r\nfor i in range(1,n):\r\n\tif(vnt[i]%2 == 0):\r\n\t\tans += 1\r\nif(n%2 != 0):\r\n\tprint(-1)\r\nelse:\r\n\tprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vitaly was going home late at night and wondering: how many people aren't sleeping at that moment? To estimate, Vitaly decided to look which windows are lit in the house he was passing by at that moment.\n\nVitaly sees a building of *n* floors and 2·*m* windows on each floor. On each floor there are *m* flats numbered from 1 to *m*, and two consecutive windows correspond to each flat. If we number the windows from 1 to 2·*m* from left to right, then the *j*-th flat of the *i*-th floor has windows 2·*j*<=-<=1 and 2·*j* in the corresponding row of windows (as usual, floors are enumerated from the bottom). Vitaly thinks that people in the flat aren't sleeping at that moment if at least one of the windows corresponding to this flat has lights on.\n\nGiven the information about the windows of the given house, your task is to calculate the number of flats where, according to Vitaly, people aren't sleeping.",
"input": "",
"output": "```python\nf = 0\r\nv = []\r\nn,m = map(int,input().split())\r\nfor i in range(n):\r\n l = list(map(int,input().split()))\r\n for j in range(len(l)):\r\n v.append(l[j])\r\nfor i in range(0,len(v)-1,2):\r\n if v[i] == 1 or v[i+1] == 1:\r\n f+=1\r\nprint(f)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.\n\nThere are *m* types of discounts. We assume that the discounts are indexed from 1 to *m*. To use the discount number *i*, the customer takes a special basket, where he puts exactly *q**i* items he buys. Under the terms of the discount system, in addition to the items in the cart the customer can receive at most two items from the supermarket for free. The number of the \"free items\" (0, 1 or 2) to give is selected by the customer. The only condition imposed on the selected \"free items\" is as follows: each of them mustn't be more expensive than the cheapest item out of the *q**i* items in the cart.\n\nMaxim now needs to buy *n* items in the shop. Count the minimum sum of money that Maxim needs to buy them, if he use the discount system optimally well.\n\nPlease assume that the supermarket has enough carts for any actions. Maxim can use the same discount multiple times. Of course, Maxim can buy items without any discounts.",
"input": "",
"output": "```python\nm = int(input())\r\nq = [int(i) for i in input().split()]\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nc = min(q)\r\na.sort()\r\n\r\nprice = 0\r\nfor i in range(n):\r\n if i % (c+2) < c:\r\n price += a[n-1-i]\r\n \r\nprint(price)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are at a water bowling training. There are *l* people who play with their left hand, *r* people, who play with their right hand, and *a* ambidexters, who can play with left or right hand.\n\nThe coach decided to form a team of even number of players, exactly half of the players should play with their right hand, and exactly half of the players should play with their left hand. One player should use only on of his hands.\n\nAmbidexters play as well with their right hand as with their left hand. In the team, an ambidexter can play with their left hand, or with their right hand.\n\nPlease find the maximum possible size of the team, where equal number of players use their left and right hands, respectively.",
"input": "",
"output": "```python\nx = input().split()\r\nl = int(x[0])\r\nr = int(x[1])\r\na = int(x[2])\r\n\r\nmin1 = min(l,r)\r\nmax1 = max(l,r)\r\ndiff = max1 - min1\r\n\r\nif diff > 0:\r\n if diff > a:\r\n print((min1+a)*2)\r\n else:\r\n a-=diff\r\n divide = int(a/2)\r\n print((max1+divide)*2)\r\nelse:\r\n print((min1+int(a/2))*2)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "We'll define *S*(*n*) for positive integer *n* as follows: the number of the *n*'s digits in the decimal base. For example, *S*(893)<==<=3, *S*(114514)<==<=6.\n\nYou want to make a consecutive integer sequence starting from number *m* (*m*,<=*m*<=+<=1,<=...). But you need to pay *S*(*n*)·*k* to add the number *n* to the sequence.\n\nYou can spend a cost up to *w*, and you want to make the sequence as long as possible. Write a program that tells sequence's maximum length.",
"input": "",
"output": "```python\nw, m, k = [int(i) for i in input().split()] \n\n\ns = lambda n: len(str(n))\n\ncost = s(m)*k\nseqLen = 0\n\nwhile cost <= w:\n m += 1\n cost += s(m)*k\n seqLen += 1\n #print('cost: ',cost,' m: ',m,' w: ',w)\n\nprint(seqLen)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are at a water bowling training. There are *l* people who play with their left hand, *r* people, who play with their right hand, and *a* ambidexters, who can play with left or right hand.\n\nThe coach decided to form a team of even number of players, exactly half of the players should play with their right hand, and exactly half of the players should play with their left hand. One player should use only on of his hands.\n\nAmbidexters play as well with their right hand as with their left hand. In the team, an ambidexter can play with their left hand, or with their right hand.\n\nPlease find the maximum possible size of the team, where equal number of players use their left and right hands, respectively.",
"input": "",
"output": "```python\nl,r,a = map(int,input().split())\r\ntotal = 0\r\nif min(l,r)+a<=l or min(l,r)+a<=r:\r\n minemum = min(l,r)+a\r\n total=minemum*2\r\nelse:\r\n minemum = min(l,r)+a\r\n a = minemum-max(l,r)\r\n minemum = max(l,r)\r\n total=(minemum*2)+(a)\r\n \r\nif total%2==0:\r\n print(total)\r\nelse:\r\n print(total-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. \"Piece of cake\" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.",
"input": "",
"output": "```python\nn = int(input())\r\nsum_coordinates = []\r\nnew_list = []\r\nfor i in range(n):\r\n sum_coordinates.append(list(map(int, input().split())))\r\nnew_list = [sum(x) for x in zip(*sum_coordinates)]\r\nif sum(new_list) == 0 or new_list[0] == 0 and new_list[1] == 0 and new_list[2] == 0:\r\n print(\"YES\")\r\nelif new_list[0] != 0 and new_list[1] != 0 and new_list[2] != 0:\r\n print(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vladik had started reading a complicated book about algorithms containing *n* pages. To improve understanding of what is written, his friends advised him to read pages in some order given by permutation *P*<==<=[*p*1,<=*p*2,<=...,<=*p**n*], where *p**i* denotes the number of page that should be read *i*-th in turn.\n\nSometimes Vladik’s mom sorted some subsegment of permutation *P* from position *l* to position *r* inclusive, because she loves the order. For every of such sorting Vladik knows number *x* — what index of page in permutation he should read. He is wondered if the page, which he will read after sorting, has changed. In other words, has *p**x* changed? After every sorting Vladik return permutation to initial state, so you can assume that each sorting is independent from each other.",
"input": "",
"output": "```python\n\r\nn, m = list(map(int, input().split()))\r\npages = list(map(int, input().split()))\r\nres = []\r\ninputs = [list(map(int, input().split())) for _ in range(m)]\r\nfor row in inputs:\r\n l, r, x = row\r\n not_changed = \"Yes\"\r\n if l <= x <= r:\r\n el = pages[x - 1]\r\n seg = pages[l - 1:r]\r\n seg.sort()\r\n if seg[x - l] != el:\r\n not_changed = \"No\"\r\n\r\n res += [not_changed]\r\n\r\nfor i in res:\r\n print(i)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Friends are going to play console. They have two joysticks and only one charger for them. Initially first joystick is charged at *a*1 percent and second one is charged at *a*2 percent. You can connect charger to a joystick only at the beginning of each minute. In one minute joystick either discharges by 2 percent (if not connected to a charger) or charges by 1 percent (if connected to a charger).\n\nGame continues while both joysticks have a positive charge. Hence, if at the beginning of minute some joystick is charged by 1 percent, it has to be connected to a charger, otherwise the game stops. If some joystick completely discharges (its charge turns to 0), the game also stops.\n\nDetermine the maximum number of minutes that game can last. It is prohibited to pause the game, i. e. at each moment both joysticks should be enabled. It is allowed for joystick to be charged by more than 100 percent.",
"input": "",
"output": "```python\nenergy1, energy2 = map(int, input().split())\r\ni = 0\r\nconnected = 1\r\nwhile True:\r\n if connected == 1:\r\n if energy2 < energy1:\r\n connected = 2\r\n energy1 -= 2\r\n energy2 += 1\r\n else:\r\n energy1 += 1\r\n energy2 -= 2\r\n else:\r\n if energy1 < energy2:\r\n connected = 1\r\n energy2 -= 2\r\n energy1 += 1\r\n else:\r\n energy1 -= 2\r\n energy2 += 1\r\n\r\n if energy1 <= 0 or energy2 <= 0:\r\n break\r\n \r\n i += 1\r\nprint(i)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "«Polygon» is a system which allows to create programming tasks in a simple and professional way. When you add a test to the problem, the corresponding form asks you for the test index. As in most cases it is clear which index the next test will have, the system suggests the default value of the index. It is calculated as the smallest positive integer which is not used as an index for some previously added test.\n\nYou are to implement this feature. Create a program which determines the default index of the next test, given the indexes of the previously added tests.",
"input": "",
"output": "```python\nn = int(input())\r\na = sorted([int(i) for i in input().split()])\r\nfor i in a:\r\n if i+1 not in a:\r\n print(i+1)\r\n exit()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Right now she actually isn't. But she will be, if you don't solve this problem.\n\nYou are given integers *n*, *k*, *A* and *B*. There is a number *x*, which is initially equal to *n*. You are allowed to perform two types of operations: \n 1. Subtract 1 from *x*. This operation costs you *A* coins. 1. Divide *x* by *k*. Can be performed only if *x* is divisible by *k*. This operation costs you *B* coins.",
"input": "",
"output": "```python\nn=int(input())\r\nk=int(input())\r\nA=int(input())\r\nB=int(input())\r\ns=0\r\nwhile n>1:\r\n #print('n='+str(n))\r\n #print('s='+str(s))\r\n if n0:\r\n s+=r*A\r\n n-=r\r\n else:\r\n m=n//k\r\n s+=min((n-m)*A,B)\r\n n=m\r\nprint(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Evlampiy has found one more cool application to process photos. However the application has certain limitations.\n\nEach photo *i* has a contrast *v**i*. In order for the processing to be truly of high quality, the application must receive at least *k* photos with contrasts which differ as little as possible.\n\nEvlampiy already knows the contrast *v**i* for each of his *n* photos. Now he wants to split the photos into groups, so that each group contains at least *k* photos. As a result, each photo must belong to exactly one group.\n\nHe considers a processing time of the *j*-th group to be the difference between the maximum and minimum values of *v**i* in the group. Because of multithreading the processing time of a division into groups is the maximum processing time among all groups.\n\nSplit *n* photos into groups in a such way that the processing time of the division is the minimum possible, i.e. that the the maximum processing time over all groups as least as possible.",
"input": "",
"output": "```python\n# n , k = 5,2\n\ns1 = input()\n\narr1 = s1.split(' ')\n\nn,k = int(arr1[0]),int(arr1[1])\n\ns2 = input()\n\n# s = '50 110 130 40 120'\n\narray = s2.split(' ')\n\nfor i in range(n):\n array[i] = int(array[i])\n\narray.sort(reverse=True)\n\nleft = 0\nright = array[0] - array[-1] \n\ndef check(x)->bool:\n l = 0\n r = k - 1\n if r == n-1:\n return array[0]-array[-1]<=x\n while l < n and r=k and array[l] - array[r+1]<=x:\n r+=1\n if r==n-1 or n-(r+1)x:\n # print('ee')\n return False\n l = r+1\n r = l+k-1\n # print(l,r)\n \n # print('en ',l,r)\n return True\n\nwhile left 0 and valid[k - 1]:\r\n union(k, k - 1)\r\n if k < n - 1 and valid[k + 1]:\r\n union(k, k + 1)\r\n \r\n t = stat[find(k)]\r\n m = max(ans[-1], t)\r\n ans.append(m)\r\n\r\nwhile len(ans) > 0:\r\n print(ans.pop())\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Malek lives in an apartment block with 100 floors numbered from 0 to 99. The apartment has an elevator with a digital counter showing the floor that the elevator is currently on. The elevator shows each digit of a number with 7 light sticks by turning them on or off. The picture below shows how the elevator shows each digit.\n\nOne day when Malek wanted to go from floor 88 to floor 0 using the elevator he noticed that the counter shows number 89 instead of 88. Then when the elevator started moving the number on the counter changed to 87. After a little thinking Malek came to the conclusion that there is only one explanation for this: One of the sticks of the counter was broken. Later that day Malek was thinking about the broken stick and suddenly he came up with the following problem.\n\nSuppose the digital counter is showing number *n*. Malek calls an integer *x* (0<=≤<=*x*<=≤<=99) good if it's possible that the digital counter was supposed to show *x* but because of some(possibly none) broken sticks it's showing *n* instead. Malek wants to know number of good integers for a specific *n*. So you must write a program that calculates this number. Please note that the counter always shows two digits.",
"input": "",
"output": "```python\nl = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\ns = input()\r\nk = 1\r\nfor i in s:\r\n k *= l[int(i)]\r\nprint(k)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One cold winter evening Alice and her older brother Bob was sitting at home near the fireplace and giving each other interesting problems to solve. When it was Alice's turn, she told the number *n* to Bob and said:\n\n—Shuffle the digits in this number in order to obtain the smallest possible number without leading zeroes.\n\n—No problem! — said Bob and immediately gave her an answer.\n\nAlice said a random number, so she doesn't know whether Bob's answer is correct. Help her to find this out, because impatient brother is waiting for the verdict.",
"input": "",
"output": "```python\na=str(input())\nb=str(input())\nd={0:0,1:0,2:0,3:0,4:0,5:0,6:0,7:0,8:0,9:0}\nfor i in range(len(a)):\n d[int(a[i])]+=1\n#print(d)\nans=\"\"\nkeep=0\nfor i in range(1,10):\n if d[i]>0 :\n ans+=str(i)\n keep=i\n d[i]-=1\n break \n\n#print(ans)\nfor i in range(1,len(a)):\n for j in range(10):\n if(d[j]>0):\n ans+=str(j)\n d[j]-=1\n break\nif(ans==b):\n print(\"OK\")\nelse:\n print(\"WRONG_ANSWER\")\n\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings *a* and *b* of equal length are called equivalent in one of the two cases: \n 1. They are equal. 1. If we split string *a* into two halves of the same size *a*1 and *a*2, and string *b* into two halves of the same size *b*1 and *b*2, then one of the following is correct: *a*1 is equivalent to *b*1, and *a*2 is equivalent to *b*2 1. *a*1 is equivalent to *b*2, and *a*2 is equivalent to *b*1 \nAs a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.\n\nGerald has already completed this home task. Now it's your turn!",
"input": "",
"output": "```python\nsa = input().strip()\r\nsb = input().strip()\r\n\r\n\r\ndef check(p1, p2, ln):\r\n global sa, sb\r\n for i, j in zip(range(p1, p1 + ln), range(p2, p2 + ln)):\r\n if sa[i] != sb[j]:\r\n break\r\n else:\r\n return True\r\n if ln % 2:\r\n return False\r\n nln = ln // 2\r\n return (check(p1, p2, nln) and check(p1 + nln, p2 + nln, nln)) or (check(p1, p2 + nln, nln) and check(p1 + nln, p2, nln))\r\n\r\nprint(\"YES\" if check(0, 0, len(sa)) else \"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a \"crime\" and find out what is happening. He can ask any questions whatsoever that can be answered with \"Yes\" or \"No\". All the rest agree beforehand to answer the questions like that: if the question’s last letter is a vowel, they answer \"Yes\" and if the last letter is a consonant, they answer \"No\". Of course, the sleuth knows nothing about it and his task is to understand that.\n\nUnfortunately, Vasya is not very smart. After 5 hours of endless stupid questions everybody except Vasya got bored. That’s why Vasya’s friends ask you to write a program that would give answers instead of them.\n\nThe English alphabet vowels are: A, E, I, O, U, Y\n\nThe English alphabet consonants are: B, C, D, F, G, H, J, K, L, M, N, P, Q, R, S, T, V, W, X, Z",
"input": "",
"output": "```python\ns=input()\r\ni=-1\r\nwhile(not((s[i]>='a' and s[i]<='z') or (s[i]>='A' and s[i]<='Z'))):\r\n i-=1\r\nif(s[i]=='A' or s[i]=='E' or s[i]=='I' or s[i]=='O' or s[i]=='Y' or s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='y'):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a fence in front of Polycarpus's home. The fence consists of *n* planks of the same width which go one after another from left to right. The height of the *i*-th plank is *h**i* meters, distinct planks can have distinct heights.\n\nPolycarpus has bought a posh piano and is thinking about how to get it into the house. In order to carry out his plan, he needs to take exactly *k* consecutive planks from the fence. Higher planks are harder to tear off the fence, so Polycarpus wants to find such *k* consecutive planks that the sum of their heights is minimal possible.\n\nWrite the program that finds the indexes of *k* consecutive planks with minimal total height. Pay attention, the fence is not around Polycarpus's home, it is in front of home (in other words, the fence isn't cyclic).",
"input": "",
"output": "```python\nn,k = list(map(int,input().split(\" \")))\r\narr=list(map(int,input().split(\" \")))\r\nsumi=0\r\nfor i in range(k):\r\n sumi=sumi+arr[i]\r\nmini = sumi\r\nindex=0\r\nl=0\r\nr=k-1\r\nwhile(r<=n-2):\r\n r=r+1\r\n sumi=sumi+arr[r]\r\n sumi=sumi-arr[l]\r\n l=l+1\r\n if(sumi=0:\r\n a=-a\r\n print((a+b)//k+1)\r\n continue\r\nelse:\r\n if a<=0 and b<=0:\r\n a=-a\r\n b=-b\r\n a,b=b,a\r\n ans=(b-a+1)//k\r\n print(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Anton's favourite geometric figures are regular polyhedrons. Note that there are five kinds of regular polyhedrons: \n - Tetrahedron. Tetrahedron has 4 triangular faces. - Cube. Cube has 6 square faces. - Octahedron. Octahedron has 8 triangular faces. - Dodecahedron. Dodecahedron has 12 pentagonal faces. - Icosahedron. Icosahedron has 20 triangular faces. \nAll five kinds of polyhedrons are shown on the picture below:\n\nAnton has a collection of *n* polyhedrons. One day he decided to know, how many faces his polyhedrons have in total. Help Anton and find this number!",
"input": "",
"output": "```python\nx = input()\r\ncnt=0\r\nfor i in range(1,x):\r\n s = input()\r\n if s==\"Tetrahedron\":\r\n cnt+=4\r\n elif s==\"Cube\":\r\n cnt+=6\r\n elif s==\"Octahedron\":\r\n cnt+=8\r\n elif s==\"Dodecahedron\":\r\n cnt+=12\r\n elif s==\"Icosahedron\":\r\n cnt+=20\r\nprint(cnt)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Oleg the client and Igor the analyst are good friends. However, sometimes they argue over little things. Recently, they started a new company, but they are having trouble finding a name for the company.\n\nTo settle this problem, they've decided to play a game. The company name will consist of *n* letters. Oleg and Igor each have a set of *n* letters (which might contain multiple copies of the same letter, the sets can be different). Initially, the company name is denoted by *n* question marks. Oleg and Igor takes turns to play the game, Oleg moves first. In each turn, a player can choose one of the letters *c* in his set and replace any of the question marks with *c*. Then, a copy of the letter *c* is removed from his set. The game ends when all the question marks has been replaced by some letter.\n\nFor example, suppose Oleg has the set of letters {*i*,<=*o*,<=*i*} and Igor has the set of letters {*i*,<=*m*,<=*o*}. One possible game is as follows :\n\nInitially, the company name is ???.\n\nOleg replaces the second question mark with 'i'. The company name becomes ?i?. The set of letters Oleg have now is {*i*,<=*o*}.\n\nIgor replaces the third question mark with 'o'. The company name becomes ?io. The set of letters Igor have now is {*i*,<=*m*}.\n\nFinally, Oleg replaces the first question mark with 'o'. The company name becomes oio. The set of letters Oleg have now is {*i*}.\n\nIn the end, the company name is oio.\n\nOleg wants the company name to be as lexicographically small as possible while Igor wants the company name to be as lexicographically large as possible. What will be the company name if Oleg and Igor always play optimally?\n\nA string *s*<==<=*s*1*s*2...*s**m* is called lexicographically smaller than a string *t*<==<=*t*1*t*2...*t**m* (where *s*<=≠<=*t*) if *s**i*<=<<=*t**i* where *i* is the smallest index such that *s**i*<=≠<=*t**i*. (so *s**j*<==<=*t**j* for all *j*<=<<=*i*)",
"input": "",
"output": "```python\nA = [0 for _ in range(26)]\r\nB = [0 for _ in range(26)]\r\nptr_a = 30\r\nptr_b = -1\r\n\r\ns1 = input()\r\nlength = len(s1)\r\nfor c in s1:\r\n x = ord(c)-ord(\"a\")\r\n A[x] += 1\r\n if A[x] == 1 and x < ptr_a:\r\n ptr_a = x\r\n\r\n\r\ns2 = input()\r\nfor c in s2:\r\n x = ord(c) - ord(\"a\")\r\n B[x] += 1\r\n if B[x] == 1 and x > ptr_b:\r\n ptr_b = x\r\n\r\nname = []\r\n\r\np = 0\r\nwhile len(name) < length:\r\n if p == 0:\r\n name.append(chr(ord(\"a\")+ptr_a))\r\n A[ptr_a] -= 1\r\n if A[ptr_a] == 0:\r\n while True:\r\n ptr_a += 1\r\n if ptr_a == 26:\r\n break\r\n if A[ptr_a] > 0:\r\n break\r\n p = 1\r\n else:\r\n name.append(chr(ord(\"a\") + ptr_b))\r\n B[ptr_b] -= 1\r\n if B[ptr_b] == 0:\r\n while True:\r\n ptr_b -= 1\r\n if ptr_b == -1:\r\n break\r\n if B[ptr_b] > 0:\r\n break\r\n p = 0\r\n\r\nprint(\"\".join(name))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A permutation of size *n* is an array of size *n* such that each integer from 1 to *n* occurs exactly once in this array. An inversion in a permutation *p* is a pair of indices (*i*,<=*j*) such that *i*<=><=*j* and *a**i*<=<<=*a**j*. For example, a permutation [4,<=1,<=3,<=2] contains 4 inversions: (2,<=1), (3,<=1), (4,<=1), (4,<=3).\n\nYou are given a permutation *a* of size *n* and *m* queries to it. Each query is represented by two indices *l* and *r* denoting that you have to reverse the segment [*l*,<=*r*] of the permutation. For example, if *a*<==<=[1,<=2,<=3,<=4] and a query *l*<==<=2, *r*<==<=4 is applied, then the resulting permutation is [1,<=4,<=3,<=2].\n\nAfter each query you have to determine whether the number of inversions is odd or even.",
"input": "",
"output": "```python\nn = int(input())\r\n\r\nlst = []\r\nfor x in input().split():\r\n lst.append(int(x))\r\n\r\nm = int(input())\r\npair = []\r\nfor x in range(m):\r\n (l, r) = map(int, input().split())\r\n pair.append((l, r))\r\n\r\nk = 0\r\nfor x in range(0, len(lst) - 1):\r\n for y in range(x + 1, len(lst)):\r\n if lst[y] < lst[x]: \r\n k += 1\r\n \r\nfor (l, r) in pair:\r\n if (k - (r - l + 1) // 2) % 2 == 0:\r\n print(\"even\")\r\n else:\r\n print(\"odd\")\r\n k = k - (r - l + 1) // 2\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given an equation: \n\nYour task is to find the number of distinct roots of the equation and print all of them in ascending order.",
"input": "",
"output": "```python\n\nimport sys, io, os\nfrom collections import Counter\n \ninput = sys.stdin.readline # for strings\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline # for non-strings\n \ndef solve():\n a, b, c = map(int, input().split())\n if a == 0:\n if b == 0:\n if c == 0:\n print(-1)\n else:\n print(0)\n else:\n print(1)\n print(-c/b)\n else:\n delta = b**2 - 4*a*c\n if delta == 0:\n print(1)\n print(-b/(2*a))\n elif delta<0:\n print(0)\n else:\n print(2)\n print((-b-delta**0.5)/(2*a))\n print((-b+delta**0.5)/(2*a))\n\n \nif __name__==\"__main__\":\n solve()\n \n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Greatest common divisor *GCD*(*a*,<=*b*) of two positive integers *a* and *b* is equal to the biggest integer *d* such that both integers *a* and *b* are divisible by *d*. There are many efficient algorithms to find greatest common divisor *GCD*(*a*,<=*b*), for example, Euclid algorithm. \n\nFormally, find the biggest integer *d*, such that all integers *a*,<=*a*<=+<=1,<=*a*<=+<=2,<=...,<=*b* are divisible by *d*. To make the problem even more complicated we allow *a* and *b* to be up to googol, 10100 — such number do not fit even in 64-bit integer type!",
"input": "",
"output": "```python\na, b = map(int, input().split())\n\nif a == b:\n\tprint(a)\nelse:\n\tprint(1)\n \t \t \t\t\t \t \t \t\t \t \t\t\t\t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Anastasia loves going for a walk in Central Uzhlyandian Park. But she became uninterested in simple walking, so she began to collect Uzhlyandian pebbles. At first, she decided to collect all the pebbles she could find in the park.\n\nShe has only two pockets. She can put at most *k* pebbles in each pocket at the same time. There are *n* different pebble types in the park, and there are *w**i* pebbles of the *i*-th type. Anastasia is very responsible, so she never mixes pebbles of different types in same pocket. However, she can put different kinds of pebbles in different pockets at the same time. Unfortunately, she can't spend all her time collecting pebbles, so she can collect pebbles from the park only once a day.\n\nHelp her to find the minimum number of days needed to collect all the pebbles of Uzhlyandian Central Park, taking into consideration that Anastasia can't place pebbles of different types in same pocket.",
"input": "",
"output": "```python\nimport math\r\nc=0\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().strip().split()))\r\nfor i in arr:c+=math.ceil(i/k)\r\nprint(math.ceil(c/2))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.\n\nOne day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.\n\nIn his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The *i*-th digit of the answer is 1 if and only if the *i*-th digit of the two given numbers differ. In the other case the *i*-th digit of the answer is 0.\n\nShapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.\n\nNow you are going to take part in Shapur's contest. See if you are faster and more accurate.",
"input": "",
"output": "```python\ns=input()\r\nr=input()\r\nprint(s^r)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Winnie-the-Pooh likes honey very much! That is why he decided to visit his friends. Winnie has got three best friends: Rabbit, Owl and Eeyore, each of them lives in his own house. There are winding paths between each pair of houses. The length of a path between Rabbit's and Owl's houses is *a* meters, between Rabbit's and Eeyore's house is *b* meters, between Owl's and Eeyore's house is *c* meters.\n\nFor enjoying his life and singing merry songs Winnie-the-Pooh should have a meal *n* times a day. Now he is in the Rabbit's house and has a meal for the first time. Each time when in the friend's house where Winnie is now the supply of honey is about to end, Winnie leaves that house. If Winnie has not had a meal the required amount of times, he comes out from the house and goes to someone else of his two friends. For this he chooses one of two adjacent paths, arrives to the house on the other end and visits his friend. You may assume that when Winnie is eating in one of his friend's house, the supply of honey in other friend's houses recover (most probably, they go to the supply store).\n\nWinnie-the-Pooh does not like physical activity. He wants to have a meal *n* times, traveling minimum possible distance. Help him to find this distance.",
"input": "",
"output": "```python\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nno_move = False\r\n_min = min(a, b)\r\n\r\nif n == 1:\r\n no_move = True\r\n\r\nif no_move:\r\n print(0)\r\nelse:\r\n if c >= _min:\r\n dist = (n-1)*_min\r\n else:\r\n dist = _min+(n-2)*c\r\n\r\n print(dist)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The police department of your city has just started its journey. Initially, they don’t have any manpower. So, they started hiring new recruits in groups.\n\nMeanwhile, crimes keeps occurring within the city. One member of the police force can investigate only one crime during his/her lifetime.\n\nIf there is no police officer free (isn't busy with crime) during the occurrence of a crime, it will go untreated.\n\nGiven the chronological order of crime occurrences and recruit hirings, find the number of crimes which will go untreated.",
"input": "",
"output": "```python\nt = input()\r\nevents = list(map(int , input().split()))\r\npolice = 0\r\ncount = 0\r\n\r\nfor event in events:\r\n police += event\r\n if police < 0:\r\n count +=1\r\n police = 0\r\nprint(count)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vanya and his friends are walking along the fence of height *h* and they do not want the guard to notice them. In order to achieve this the height of each of the friends should not exceed *h*. If the height of some person is greater than *h* he can bend down and then he surely won't be noticed by the guard. The height of the *i*-th person is equal to *a**i*.\n\nConsider the width of the person walking as usual to be equal to 1, while the width of the bent person is equal to 2. Friends want to talk to each other while walking, so they would like to walk in a single row. What is the minimum width of the road, such that friends can walk in a row and remain unattended by the guard?",
"input": "",
"output": "```python\nn,k =input().split()\nn =int(n)\nk=int(k)\na=input()\nx=a.split()\nc=0\nfor i in range(n):\n x[i]=int(x[i])\n if x[i]>k:\n c+=2\n else:\n c+=1\nprint(c)\n \t\t\t \t \t\t\t \t \t \t\t\t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Caisa solved the problem with the sugar and now he is on the way back to home. \n\nCaisa is playing a mobile game during his path. There are (*n*<=+<=1) pylons numbered from 0 to *n* in this game. The pylon with number 0 has zero height, the pylon with number *i* (*i*<=><=0) has height *h**i*. The goal of the game is to reach *n*-th pylon, and the only move the player can do is to jump from the current pylon (let's denote its number as *k*) to the next one (its number will be *k*<=+<=1). When the player have made such a move, its energy increases by *h**k*<=-<=*h**k*<=+<=1 (if this value is negative the player loses energy). The player must have non-negative amount of energy at any moment of the time. \n\nInitially Caisa stand at 0 pylon and has 0 energy. The game provides a special opportunity: one can pay a single dollar and increase the height of anyone pylon by one. Caisa may use that opportunity several times, but he doesn't want to spend too much money. What is the minimal amount of money he must paid to reach the goal of the game?",
"input": "",
"output": "```python\nn = int(input())\r\nh = *map(int, input().split()),\r\ncost = 0\r\ncost += h[1]\r\ne = h[1]\r\ni = 2\r\nwhile i < n:\r\n if h[i] > e:\r\n cost += h[i] - e\r\n e += h[i] - e\r\n else:\r\n e += e - h[i]\r\n i += 1\r\nprint(cost)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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 \"-\".\n\nWe'll say that some date is mentioned in the Prophesy if there is a substring in the Prophesy that is the date's record in the format \"dd-mm-yyyy\". We'll say that the number of the date's occurrences is the number of such substrings in the Prophesy. For example, the Prophesy \"0012-10-2012-10-2012\" mentions date 12-10-2012 twice (first time as \"0012-10-2012-10-2012\", second time as \"0012-10-2012-10-2012\").\n\nThe date of the Apocalypse is such correct date that the number of times it is mentioned in the Prophesy is strictly larger than that of any other correct date.\n\nA date is correct if the year lies in the range from 2013 to 2015, the month is from 1 to 12, and the number of the day is strictly more than a zero and doesn't exceed the number of days in the current month. Note that a date is written in the format \"dd-mm-yyyy\", that means that leading zeroes may be added to the numbers of the months or days if needed. In other words, date \"1-1-2013\" isn't recorded in the format \"dd-mm-yyyy\", and date \"01-01-2013\" is recorded in it.\n\nNotice, that any year between 2013 and 2015 is not a leap year.",
"input": "",
"output": "```python\nfrom statistics import mode\r\nimport re\r\nlst = []\r\nstr = input()\r\nS = str\r\nwhile len(S):\r\n m = re.search(r'([0-2][0-9]|[3][01])[-]([0][13578]|[1][02])[-]([2][0][1][3-5])',S)\r\n if m:\r\n lst.append(m.group())\r\n S = S[m.start() + 1:]\r\n else:\r\n break\r\nS = str\r\nwhile len(S):\r\n m = re.search(r'([0-2][0-9]|[3][0])[-]([0][469]|[1][1])[-]([2][0][1][3-5])',S)\r\n if m:\r\n lst.append(m.group())\r\n S = S[m.start() + 1:]\r\n else:\r\n break\r\nS = str\r\nwhile len(S):\r\n m = re.search(r'([0-2][0-9])[-][0][2][-][2][0][1][3-5]',S)\r\n if m:\r\n lst.append(m.group())\r\n S = S[m.start() + 1:]\r\n else:\r\n break\r\nprint(mode(lst))\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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 only repaint the squares in white and black colors. Petya’s aim is to repaint the stripe so that no two neighboring squares were of one color. Help Petya, using the given initial coloring, find the minimum number of moves Petya needs to win.",
"input": "",
"output": "```python\nn=int(input())\r\ns=input()\r\nc=0\r\n \r\nfor i in range(n):\r\n if (i+1)%2==0 and s[i]==\"1\" or (i+1)%2==1 and s[i]==\"0\":\r\n c+=1\r\nprint(min(n-c,c))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Today, Wet Shark is given *n* integers. Using any of these integers no more than once, Wet Shark wants to get maximum possible even (divisible by 2) sum. Please, calculate this value for Wet Shark. \n\nNote, that if Wet Shark uses no integers from the *n* integers, the sum is an even integer 0.",
"input": "",
"output": "```python\nn=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nol=[]\r\nfor i in l:\r\n if i%2==0:\r\n s=s+i\r\n else:\r\n ol.append(i)\r\nif len(ol)%2==0:\r\n s=s+sum(ol)\r\nelse:\r\n s=s+sum(ol)-min(ol)\r\nprint(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have a positive integer *m* and a non-negative integer *s*. Your task is to find the smallest and the largest of the numbers that have length *m* and sum of digits *s*. The required numbers should be non-negative integers written in the decimal base without leading zeroes.",
"input": "",
"output": "```python\nm,s=[int(i) for i in input().split()]\r\ndef convert(lis):\r\n max_val=0\r\n min_val=0\r\n s=''\r\n for i in lis:\r\n s=s+str(i)\r\n max_val=int(s)\r\n lis.reverse()\r\n s=''\r\n for i in lis:\r\n s=s+str(i)\r\n min_val=int(s)\r\n return (min_val,max_val)\r\nif s<1 or s>m*9:print(-1,-1)\r\nelse:\r\n lis=[]\r\n q=s//m\r\n for i in range(m-1):\r\n lis.append(s-q)\r\n s=s-q\r\n lis.append(q)\r\n p=lis.count(0)\r\n if p>0:\r\n lis.sort()\r\n for i in range(m):\r\n if lis[i]!=0:\r\n k=i\r\n for i in range(m):\r\n if lis[i]==0:\r\n lis[i]=1\r\n elif i==k and a[k]-p>=0:\r\n lis[k]=lis[k]-p\r\n elif i==k and lis[k]-p<0:\r\n p=p-lis[k]\r\n lis[k]=0\r\n k=k+1\r\n else:\r\n lis.sort()\r\n lis.reverse()\r\n for i in range(m-1):\r\n if lis[i]==9:\r\n continue\r\n elif lis[i]!=9 and 9-lis[i]=lis[i+1] and i==m-2:\r\n lis[i]=lis[i]+lis[i+1]-1\r\n lis[i+1]=1\r\n elif lis[i]!=9 and 9-lis[i]>=lis[i+1] and i!=m-2:\r\n lis[i]=lis[i]+lis[i+1]\r\n lis[i+1]=0\r\n print(convert(lis))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\nx=input(\"\")\r\ny=x.lower()\r\nz=x.upper()\r\ny1=0\r\nx1=0\r\nfor i in x:\r\n if i in y:\r\n y1+=1\r\n else:\r\n x1+=1\r\nif y1>x1:\r\n print(y)\r\nelse:\r\n print(z)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Year 2118. Androids are in mass production for decades now, and they do all the work for humans. But androids have to go to school to be able to solve creative tasks. Just like humans before.\n\nIt turns out that high school struggles are not gone. If someone is not like others, he is bullied. Vasya-8800 is an economy-class android which is produced by a little-known company. His design is not perfect, his characteristics also could be better. So he is bullied by other androids.\n\nOne of the popular pranks on Vasya is to force him to compare $x^y$ with $y^x$. Other androids can do it in milliseconds while Vasya's memory is too small to store such big numbers.\n\nPlease help Vasya! Write a fast program to compare $x^y$ with $y^x$ for Vasya, maybe then other androids will respect him.",
"input": "",
"output": "```python\ndef qpow(x,y):\n z=1\n while (y):\n if (y&1):\n z=z*x\n x=x*x\n y>>=1\n return z\n\nx,y=map(int,input().strip().split())\na=x**y\nb=y**x\nif (a==b):\n print('=')\nelif (a>b):\n print('>')\nelse:\n print('<')\n\t \t \t\t\t \t \t \t\t\t\t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Twilight Sparkle was playing Ludo with her friends Rainbow Dash, Apple Jack and Flutter Shy. But she kept losing. Having returned to the castle, Twilight Sparkle became interested in the dice that were used in the game.\n\nThe dice has *m* faces: the first face of the dice contains a dot, the second one contains two dots, and so on, the *m*-th face contains *m* dots. Twilight Sparkle is sure that when the dice is tossed, each face appears with probability . Also she knows that each toss is independent from others. Help her to calculate the expected maximum number of dots she could get after tossing the dice *n* times.",
"input": "",
"output": "```python\ndef miis():\r\n return map(int, input().split())\r\n\r\nm, n = miis()\r\nans = 0\r\nfor i in range(1, m+1):\r\n ans += i*((i/m)**n-((i-1)/m)**n)\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya loves playing with rectangles. Mom bought Petya a rectangle divided into cells *n*<=×<=*m* in size (containing *n* rows, *m* columns). Petya marked two different cells of the rectangle and now he is solving the following task:\n\nLet's define a simple path between those two cells as a sequence of distinct cells *a*1,<=*a*2,<=...,<=*a**k*, where *a*1 and *a**k* are the two marked cells. Besides, *a**i* and *a**i*<=+<=1 are side-neighboring cells of the path (1<=≤<=*i*<=<<=*k*). Let's denote the path length as number *k* (the sequence length). \n\nPetya's task is to find the longest simple path's length and to print the path. Help him.",
"input": "",
"output": "```python\nm,n=map(int,input().split())\r\na1,b1=map(int,input().split())\r\na2,b2=map(int,input().split())\r\nprint((m*n)-1)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a positive integer $n$, written without leading zeroes (for example, the number 04 is incorrect). \n\nIn one operation you can delete any digit of the given integer so that the result remains a positive integer without leading zeros.\n\nDetermine the minimum number of operations that you need to consistently apply to the given integer $n$ to make from it the square of some positive integer or report that it is impossible.\n\nAn integer $x$ is the square of some positive integer if and only if $x=y^2$ for some positive integer $y$.",
"input": "",
"output": "```python\nq = int(input())\n\npot = []\nb = 1\n\nwhile (42):\n a = b**2\n if(a <= q):\n pot.append((a))\n b += 1\n else:\n break\n\npot.sort(reverse = True)\n\nb = 0\naux = -1\nres = \"\"\nq = list(str(q))\n\nwhile b < len(pot):\n pot_aux = list(str(pot[b]))\n flag = 0\n aux = -1\n for i in range(len(pot_aux)): \n \n if pot_aux[i] in q and q.index(pot_aux[i]) > aux:\n aux = q.index(pot_aux[i])\n else:\n flag = 1\n break\n if flag == 0:\n res = str(pot[b])\n break\n else:\n b += 1\n \nif res == \"\":\n print(-1)\nelse:\n print(len(q)-len(res))\n\t\t \t \t \t\t \t \t\t\t\t \t\t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\nm, n = map(int, input().split())\r\n\r\narea = m*n\r\n\r\ncount = area//2\r\n\r\nprint(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A colored stripe is represented by a horizontal row of *n* square cells, each cell is pained one of *k* colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells are of the same color. You can use any color from 1 to *k* to repaint the cells.",
"input": "",
"output": "```python\nprint(\"_RANDOM_GUESS_1689366534.3880188\")# 1689366534.388033\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A long time ago (probably even in the first book), Nicholas Flamel, a great alchemist and the creator of the Philosopher's Stone, taught Harry Potter three useful spells. The first one allows you to convert *a* grams of sand into *b* grams of lead, the second one allows you to convert *c* grams of lead into *d* grams of gold and third one allows you to convert *e* grams of gold into *f* grams of sand. When Harry told his friends about these spells, Ron Weasley was amazed. After all, if they succeed in turning sand into lead, lead into gold, and then turning part of the gold into sand again and so on, then it will be possible to start with a small amount of sand and get huge amounts of gold! Even an infinite amount of gold! Hermione Granger, by contrast, was skeptical about that idea. She argues that according to the law of conservation of matter getting an infinite amount of matter, even using magic, is impossible. On the contrary, the amount of matter may even decrease during transformation, being converted to magical energy. Though Hermione's theory seems convincing, Ron won't believe her. As far as Ron is concerned, Hermione made up her law of conservation of matter to stop Harry and Ron wasting their time with this nonsense, and to make them go and do homework instead. That's why Ron has already collected a certain amount of sand for the experiments. A quarrel between the friends seems unavoidable...\n\nHelp Harry to determine which one of his friends is right, and avoid the quarrel after all. To do this you have to figure out whether it is possible to get the amount of gold greater than any preassigned number from some finite amount of sand.",
"input": "",
"output": "```python\n# LUOGU_RID: 112089745\na, b, c, d, e, f = map(int, input().split());\r\nif a * c * e < b * d * f or a == 0 and b * d > 0 or c == 0 and d > 0:\r\n print(\"Ron\");\r\nelse:\r\n print(\"Hermione\");\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "*n* participants of the competition were split into *m* teams in some manner so that each team has at least one participant. After the competition each pair of participants from the same team became friends.\n\nYour task is to write a program that will find the minimum and the maximum number of pairs of friends that could have formed by the end of the competition.",
"input": "",
"output": "```python\nimport math\r\ndef comb(n, k):\r\n\tif(n >= k):\r\n\t\treturn math.comb(n, 2)\r\n\telse:\r\n\t\treturn 0\r\ndef take_min(n, t):\r\n\tl = int(n/t) + 1\r\n\tdif = t*l - n\r\n\tfriends = (t-dif)*comb(l, 2) + (dif)*comb(l-1, 2)\r\n\treturn int(friends)\r\ndef take_max(n, t):\r\n\treturn int(comb(n-(t-1), 2))\r\nn, t = list(map(int, input().split()))\r\nprint(take_min(n, t), take_max(n, t))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A company has *n* employees numbered from 1 to *n*. Each employee either has no immediate manager or exactly one immediate manager, who is another employee with a different number. An employee *A* is said to be the superior of another employee *B* if at least one of the following is true:\n - Employee *A* is the immediate manager of employee *B* - Employee *B* has an immediate manager employee *C* such that employee *A* is the superior of employee *C*. \nThe company will not have a managerial cycle. That is, there will not exist an employee who is the superior of his/her own immediate manager.\n\nToday the company is going to arrange a party. This involves dividing all *n* employees into several groups: every employee must belong to exactly one group. Furthermore, within any single group, there must not be two employees *A* and *B* such that *A* is the superior of *B*.\n\nWhat is the minimum number of groups that must be formed?",
"input": "",
"output": "```python\nn=int(input())\r\nl=[int(input()) for i in range(n)]\r\ng=0\r\nfor i in range(n):\r\n cnt=0\r\n while i>=0:\r\n i=l[i]-1\r\n cnt+=1\r\n g=max(g,cnt)\r\nprint(g)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Programmer Rostislav got seriously interested in the Link/Cut Tree data structure, which is based on Splay trees. Specifically, he is now studying the *expose* procedure.\n\nUnfortunately, Rostislav is unable to understand the definition of this procedure, so he decided to ask programmer Serezha to help him. Serezha agreed to help if Rostislav solves a simple task (and if he doesn't, then why would he need Splay trees anyway?)\n\nGiven integers *l*, *r* and *k*, you need to print all powers of number *k* within range from *l* to *r* inclusive. However, Rostislav doesn't want to spent time doing this, as he got interested in playing a network game called Agar with Gleb. Help him!",
"input": "",
"output": "```python\nimport math\nimport cmath\nimport string\nimport sys\nimport bisect\nimport ctypes\nfrom queue import Queue,LifoQueue,PriorityQueue\nfrom itertools import permutations,combinations\nfrom collections import deque,Counter\n\nl,r,k=list(map(int,input().split()))\ni=0\na=[]\nwhile 1:\n temp=pow(k,i)\n i+=1\n if temp<=r:\n a.append(temp)\n else:\n break\n\nb=[]\nfor i in a:\n if i<=r and i>=l:\n b.append(i)\nif len(b)==0:\n print(-1)\nfor i in b:\n print(i,end=\" \")\n\n\n \t\t \t\t \t \t\t \t \t\t\t\t\t\t\t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In a small but very proud high school it was decided to win ACM ICPC. This goal requires to compose as many teams of three as possible, but since there were only 6 students who wished to participate, the decision was to build exactly two teams.\n\nAfter practice competition, participant number *i* got a score of *a**i*. Team score is defined as sum of scores of its participants. High school management is interested if it's possible to build two teams with equal scores. Your task is to answer that question.",
"input": "",
"output": "```python\ndef solution(peeps):\n\ts = sum(peeps)\n\tfor i in range(len(peeps)):\n\t\tfor j in range(i + 1, len(peeps)):\n\t\t\tfor k in range(j + 1, len(peeps)):\n\t\t\t\ttotal = i + j + k\n\t\t\t\tif total == s - total:\n\t\t\t\t\treturn \"YES\"\n\treturn \"NO\"\n\n\n\npeeps = list(map(int, input().split()))\nprint(solution(peeps))\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Lenny is playing a game on a 3<=×<=3 grid of lights. In the beginning of the game all lights are switched on. Pressing any of the lights will toggle it and all side-adjacent lights. The goal of the game is to switch all the lights off. We consider the toggling as follows: if the light was switched on then it will be switched off, if it was switched off then it will be switched on.\n\nLenny has spent some time playing with the grid and by now he has pressed each light a certain number of times. Given the number of times each light is pressed, you have to print the current state of each light.",
"input": "",
"output": "```python\nons = [[1,1,1], [1,1,1], [1,1,1]]\nfor i in range(3):\n rr = map(int, input().split())\n for j, togs in enumerate(rr):\n for _ in range(togs):\n for ii in range(i-(i>0), min(i+2, 3)):\n for jj in range(j-(j>0), min(j+2,3)):\n ons[ii][jj] ^= 1 \nfor g in ons:\n for h in g:\n print(h, end=\"\")\n print()\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Jzzhu is the president of country A. There are *n* cities numbered from 1 to *n* in his country. City 1 is the capital of A. Also there are *m* roads connecting the cities. One can go from city *u**i* to *v**i* (and vise versa) using the *i*-th road, the length of this road is *x**i*. Finally, there are *k* train routes in the country. One can use the *i*-th train route to go from capital of the country to city *s**i* (and vise versa), the length of this route is *y**i*.\n\nJzzhu doesn't want to waste the money of the country, so he is going to close some of the train routes. Please tell Jzzhu the maximum number of the train routes which can be closed under the following condition: the length of the shortest path from every city to the capital mustn't change.",
"input": "",
"output": "```python\n# ﷽\r\nfrom collections import defaultdict\r\nfrom heapq import heappop, heappush\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\ndef inlst():return [int(i) for i in input().split()]\r\nclass Graph:\r\n def __init__(self,n):\r\n self.graph=defaultdict(list)\r\n self.graph2=set()\r\n self.n=n\r\n self.train=[0]*n\r\n \r\n self.ans=0\r\n def dijkstra(self, start=0):\r\n \"\"\" \r\n Uses Dijkstra's algortihm to find the shortest path from node start\r\n to all other nodes in a directed weighted graph.\r\n \"\"\"\r\n n = self.n\r\n dist, parents = [float(\"inf\")] * n, [-1] * n\r\n dist[start] = 0\r\n\r\n queue = [(0, start)]\r\n while queue:\r\n path_len, v = heappop(queue)\r\n if path_len == dist[v]:\r\n for w, edge_len in self.graph[v]:\r\n if edge_len + path_len < dist[w]:\r\n dist[w], parents[w] = edge_len + path_len, v\r\n heappush(queue, (edge_len + path_len, w))\r\n if edge_len + path_len == dist[w] and v!=start:\r\n dist[w], parents[w] = edge_len + path_len, v\r\n heappush(queue, (edge_len + path_len, w))\r\n\r\n return dist, parents\r\n def ingraph(self,num_edges, num_edqe2):\r\n for _ in range(num_edges):\r\n a,b,w=[int(i) for i in input().split()]\r\n self.graph[a].append((b,w))\r\n self.graph[b].append((a,w)) \r\n if a==1:\r\n self.graph2.add((b,w))\r\n if b==1:\r\n self.graph2.add((a,w))\r\n \r\n for _ in range(num_edqe2):\r\n a,b,w=[1]+[int(i) for i in input().split()]\r\n self.graph[a].append((b,w))\r\n self.graph[b].append((a,w))\r\n\r\n self.train[b]+=1\r\n\r\n\r\n\r\ndef solve():\r\n n,m,k=inlst()\r\n graph=Graph(n+1)\r\n graph.ingraph(m,k)\r\n dist, parents=graph.dijkstra(1)\r\n tot=0\r\n # print(dist)\r\n # print(parents)\r\n for i ,j in enumerate(parents):\r\n if j==1:\r\n if (i,dist[i]) in graph.graph2:\r\n tot+=1*graph.train[i]\r\n else:\r\n tot+=graph.train[i]-1\r\n elif j!=-1:tot+=1\r\n # print(i,j,tot)\r\n print(tot)\r\n # print(graph.graph)\r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n solve()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The \"BerCorp\" company has got *n* employees. These employees can use *m* approved official languages for the formal correspondence. The languages are numbered with integers from 1 to *m*. For each employee we have the list of languages, which he knows. This list could be empty, i. e. an employee may know no official languages. But the employees are willing to learn any number of official languages, as long as the company pays their lessons. A study course in one language for one employee costs 1 berdollar.\n\nFind the minimum sum of money the company needs to spend so as any employee could correspond to any other one (their correspondence can be indirect, i. e. other employees can help out translating).",
"input": "",
"output": "```python\ndef find_min_cost_to_connect_employees(n, m, employees):\r\n graph = [[] for _ in range(n)]\r\n\r\n for i in range(n):\r\n _, *languages = employees[i]\r\n for lang in languages:\r\n graph[i].append(lang)\r\n\r\n visited = [False] * n\r\n total_cost = 0\r\n\r\n def dfs(node):\r\n visited[node] = True\r\n return 1\r\n\r\n for i in range(n):\r\n if not visited[i]:\r\n component_size = dfs(i)\r\n total_cost += component_size - 1\r\n\r\n return total_cost\r\n\r\nn, m = map(int, input().split())\r\nemployees = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nmin_cost = find_min_cost_to_connect_employees(n, m, employees)\r\nprint(min_cost)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Indian summer is such a beautiful time of the year! A girl named Alyona is walking in the forest and picking a bouquet from fallen leaves. Alyona is very choosy — she doesn't take a leaf if it matches the color and the species of the tree of one of the leaves she already has. Find out how many leaves Alyona has picked.",
"input": "",
"output": "```python\nd = {}\r\nfor i in range(int(input())):\r\n s = list(map(str, input().split()))\r\n if s[0] not in d:\r\n d[s[0]] = [s[1]]\r\n else:\r\n if (s[1] not in d[s[0]]):\r\n d[s[0]].append(s[1])\r\nans = 0\r\n# print(d)\r\nfor key in d:\r\n for value in d[key]:\r\n ans += 1\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bajtek is learning to skate on ice. He's a beginner, so his only mode of transportation is pushing off from a snow drift to the north, east, south or west and sliding until he lands in another snow drift. He has noticed that in this way it's impossible to get from some snow drifts to some other by any sequence of moves. He now wants to heap up some additional snow drifts, so that he can get from any snow drift to any other one. He asked you to find the minimal number of snow drifts that need to be created.\n\nWe assume that Bajtek can only heap up snow drifts at integer coordinates.",
"input": "",
"output": "```python\nn = int(input())\n\nsnowpatch = [input().split() for i in range(n)]\n\nnewnode = 0\n\nvisited = [ False for i in range(n)]\n\nfor i in range(n):\n if visited[i] == True:\n continue\n visited[i] = True\n newnode += 1\n stack = [i]\n\n while stack:\n x = stack[-1]\n stack.pop()\n for j in range(n):\n if visited[j] == True:\n continue\n if snowpatch[j][0] == snowpatch[x][0] or snowpatch[j][1] == snowpatch[x][1]:\n stack.append(j)\n visited[x] = True\n\nprint(newnode - 1)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word *s*. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word *s*.",
"input": "",
"output": "```python\ns = input()\nhello = \"hello\"\ncounter = 0 \nj = 0\nfor i in range(len(hello)):\n while j < len(s):\n \n if hello[i] == s[j]:\n counter += 1\n j += 1\n break\n j += 1\nif counter == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "When Xellos was doing a practice course in university, he once had to measure the intensity of an effect that slowly approached equilibrium. A good way to determine the equilibrium intensity would be choosing a sufficiently large number of consecutive data points that seems as constant as possible and taking their average. Of course, with the usual sizes of data, it's nothing challenging — but why not make a similar programming contest problem while we're at it?\n\nYou're given a sequence of *n* data points *a*1,<=...,<=*a**n*. There aren't any big jumps between consecutive data points — for each 1<=≤<=*i*<=<<=*n*, it's guaranteed that |*a**i*<=+<=1<=-<=*a**i*|<=≤<=1.\n\nA range [*l*,<=*r*] of data points is said to be almost constant if the difference between the largest and the smallest value in that range is at most 1. Formally, let *M* be the maximum and *m* the minimum value of *a**i* for *l*<=≤<=*i*<=≤<=*r*; the range [*l*,<=*r*] is almost constant if *M*<=-<=*m*<=≤<=1.\n\nFind the length of the longest almost constant range.",
"input": "",
"output": "```python\nn = int (input())\r\na = list(map(int,input().split()))\r\ncheck = 0\r\ni = 0\r\nans = 2\r\nmn = min(a[0],a[1])\r\nmx = max(a[0],a[1])\r\ncheck =0\r\nwhile(ians:\r\n ans = l\r\n break\r\n elif next > mx and mn!=mx:\r\n # print('22222222222222222222222222222222')\r\n mn= mx\r\n mx = next\r\n i += 1\r\n if l > ans:\r\n ans = l\r\n break\r\n else:\r\n # print('33333333333333333333333333333333')\r\n l+=1\r\n mn = min(mn,mx,next)\r\n mx = max(mn,mx,next)\r\n if j == n-1:\r\n # print('4444444444444444444444444444444444')\r\n if l>ans:\r\n ans = l\r\n check = 1\r\n break\r\n # print('Cur L:',l)\r\n\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach the treasure. \n\nBottle with potion has two values *x* and *y* written on it. These values define four moves which can be performed using the potion:\n - - - - \nMap shows that the position of Captain Bill the Hummingbird is (*x*1,<=*y*1) and the position of the treasure is (*x*2,<=*y*2).\n\nYou task is to tell Captain Bill the Hummingbird whether he should accept this challenge or decline. If it is possible for Captain to reach the treasure using the potion then output \"YES\", otherwise \"NO\" (without quotes).\n\nThe potion can be used infinite amount of times.",
"input": "",
"output": "```python\npositions = [int(a) for a in input().split()]\npotion = [int(a) for a in input().split()]\n\nx_dist = abs(positions[2] - positions[0])\ny_dist = abs(positions[3] - positions[1])\n\nif (x_dist%potion[0]==0 and y_dist%potion[1]==0):\n \n x_div = x_dist//potion[0]\n y_div = y_dist//potion[1]\n\n if (abs(x_div - y_div)%2 == 0):\n print('YES')\n else: print('NO')\n\nelse: print('NO')\n\n\n\t \t \t\t \t \t\t\t \t \t\t\t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bran and his older sister Arya are from the same house. Bran like candies so much, so Arya is going to give him some Candies.\n\nAt first, Arya and Bran have 0 Candies. There are *n* days, at the *i*-th day, Arya finds *a**i* candies in a box, that is given by the Many-Faced God. Every day she can give Bran at most 8 of her candies. If she don't give him the candies at the same day, they are saved for her and she can give them to him later.\n\nYour task is to find the minimum number of days Arya needs to give Bran *k* candies before the end of the *n*-th day. Formally, you need to output the minimum day index to the end of which *k* candies will be given out (the days are indexed from 1 to *n*).\n\nPrint -1 if she can't give him *k* candies during *n* given days.",
"input": "",
"output": "```python\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ngot = 0\r\nfor i in range(n):\r\n got += a[i]\r\n k -= min(got, 8)\r\n got -= min(got, 8)\r\n if k <= 0:\r\n print(i+1)\r\n break\r\nif k > 0:\r\n print(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he organized a New Year party at his place and invited *n* his friends there.\n\nIf there's one thing Petya likes more that receiving gifts, that's watching others giving gifts to somebody else. Thus, he safely hid the laptop until the next New Year and made up his mind to watch his friends exchanging gifts while he does not participate in the process. He numbered all his friends with integers from 1 to *n*. Petya remembered that a friend number *i* gave a gift to a friend number *p**i*. He also remembered that each of his friends received exactly one gift.\n\nNow Petya wants to know for each friend *i* the number of a friend who has given him a gift.",
"input": "",
"output": "```python\nn=int(input())\r\na=[int(x) for x in input().split()]\r\nd=[0]*n\r\nfor i in range(n):\r\n d[a[i]-1]=str(i+1)\r\nm=\" \".join(d)\r\nprint(m)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "\"QAQ\" is a word to denote an expression of crying. Imagine \"Q\" as eyes with tears and \"A\" as a mouth.\n\nNow Diamond has given Bort a string consisting of only uppercase English letters of length *n*. There is a great number of \"QAQ\" in the string (Diamond is so cute!).\n\nBort wants to know how many subsequences \"QAQ\" are in the string Diamond has given. Note that the letters \"QAQ\" don't have to be consecutive, but the order of letters should be exact.",
"input": "",
"output": "```python\ns=input()\r\nl=list(s)\r\nn=len(s)\r\nc=0\r\nfor i in range(n):\r\n if l[i]=='A':\r\n a=0\r\n b=0\r\n for j in range(i):\r\n if l[j]=='Q':\r\n a+=1\r\n for j in range(i,n):\r\n if l[j]=='Q':\r\n b+=1\r\n c+=a*b\r\nprint(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.\n\nIn the given sequence moving up is described by character U and moving right is described by character R. Mikhail can replace any pair of consecutive moves RU or UR with a diagonal move (described as character D). After that, he can go on and do some other replacements, until there is no pair of consecutive moves RU or UR left.\n\nYour problem is to print the minimum possible length of the sequence of moves after the replacements.",
"input": "",
"output": "```python\nn = int(input)\r\ntext = input()\r\nnew_text1 = text.replace('RU', 'D')\r\nnew_text2 = text.replace('UR', 'D')\r\nx = len(new_text2)\r\nprint(x)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Luke Skywalker got locked up in a rubbish shredder between two presses. R2D2 is already working on his rescue, but Luke needs to stay alive as long as possible. For simplicity we will assume that everything happens on a straight line, the presses are initially at coordinates 0 and *L*, and they move towards each other with speed *v*1 and *v*2, respectively. Luke has width *d* and is able to choose any position between the presses. Luke dies as soon as the distance between the presses is less than his width. Your task is to determine for how long Luke can stay alive.",
"input": "",
"output": "```python\nd,L,v1,v2 = map(int,input().split())\r\n\r\nt = (L-d)/(v1+v2)\r\nprint(t)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Cucumber boy is fan of Kyubeat, a famous music game.\n\nKyubeat has 16 panels for playing arranged in 4<=×<=4 table. When a panel lights up, he has to press that panel.\n\nEach panel has a timing to press (the preffered time when a player should press it), and Cucumber boy is able to press at most *k* panels in a time with his one hand. Cucumber boy is trying to press all panels in perfect timing, that is he wants to press each panel exactly in its preffered time. If he cannot press the panels with his two hands in perfect timing, his challenge to press all the panels in perfect timing will fail.\n\nYou are given one scene of Kyubeat's panel from the music Cucumber boy is trying. Tell him is he able to press all the panels in perfect timing.",
"input": "",
"output": "```python\nk=int(input())\r\nm=[int(c) for c in input() if c!='.' for row in range(4)]\r\nprint(\"YES\" if all(m.count(t)<=2*k for t in set(m)) else \"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In Aramic language words can only represent objects.\n\nWords in Aramic have special properties: \n - A word is a root if it does not contain the same letter more than once. - A root and all its permutations represent the same object. - The root $x$ of a word $y$ is the word that contains all letters that appear in $y$ in a way that each letter appears once. For example, the root of \"aaaa\", \"aa\", \"aaa\" is \"a\", the root of \"aabb\", \"bab\", \"baabb\", \"ab\" is \"ab\". - Any word in Aramic represents the same object as its root. \nYou have an ancient script in Aramic. What is the number of different objects mentioned in the script?",
"input": "",
"output": "```python\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ns = list(input().rstrip().decode().split())\r\nu = set()\r\nfor s0 in s:\r\n v = list(set(s0))\r\n v.sort()\r\n u.add(tuple(v))\r\nans = len(u)\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "People in the Tomskaya region like magic formulas very much. You can see some of them below.\n\nImagine you are given a sequence of positive integer numbers *p*1, *p*2, ..., *p**n*. Lets write down some magic formulas:\n\nHere, \"mod\" means the operation of taking the residue after dividing.\n\nThe expression means applying the bitwise *xor* (excluding \"OR\") operation to integers *x* and *y*. The given operation exists in all modern programming languages. For example, in languages C++ and Java it is represented by \"^\", in Pascal — by \"xor\".\n\nPeople in the Tomskaya region like magic formulas very much, but they don't like to calculate them! Therefore you are given the sequence *p*, calculate the value of *Q*.",
"input": "",
"output": "```python\nn=int(input())\r\na=list(map(int,input().split()))\r\ndp=[0 for i in range(n+1)]\r\nfor i in range(1,n+1):\r\n dp[i]=dp[i-1]^i\r\nans=0\r\nfor i in a:\r\n ans=ans^i\r\nfor i in range(2,n+1):\r\n x=n//i\r\n if x&1:\r\n ans=ans^dp[i-1]\r\n rem=n%i\r\n ans=ans^dp[rem]\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has a non-negative integer *n*. He wants to round it to nearest integer, which ends up with 0. If *n* already ends up with 0, Vasya considers it already rounded.\n\nFor example, if *n*<==<=4722 answer is 4720. If *n*<==<=5 Vasya can round it to 0 or to 10. Both ways are correct.\n\nFor given *n* find out to which integer will Vasya round it.",
"input": "",
"output": "```python\nn=int(input())\r\nif n>=1 and n<=1000000000:\r\n a=n%10\r\n if a <=5:\r\n print(n-a)\r\n else:\r\n print(n+(10-a))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given *n* numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given *n* numbers finds one that is different in evenness.",
"input": "",
"output": "```python\nn=int(input())\r\nnumber=[int(x) for x in input().split()]\r\nodd=0\r\neven=0\r\nfor i in range(n):\r\n if number[i]%2==0:\r\n evennum=number[i]\r\n even+=1\r\n else:\r\n oddnum=number[i]\r\n odd+=1\r\nif odd>even:\r\n print((number.index(evennum))+1)\r\nelse:\r\n print((number.index(oddnum))+1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Little Elephant loves chess very much. \n\nOne day the Little Elephant and his friend decided to play chess. They've got the chess pieces but the board is a problem. They've got an 8<=×<=8 checkered board, each square is painted either black or white. The Little Elephant and his friend know that a proper chessboard doesn't have any side-adjacent cells with the same color and the upper left cell is white. To play chess, they want to make the board they have a proper chessboard. For that the friends can choose any row of the board and cyclically shift the cells of the chosen row, that is, put the last (rightmost) square on the first place in the row and shift the others one position to the right. You can run the described operation multiple times (or not run it at all).\n\nFor example, if the first line of the board looks like that \"BBBBBBWW\" (the white cells of the line are marked with character \"W\", the black cells are marked with character \"B\"), then after one cyclic shift it will look like that \"WBBBBBBW\".\n\nHelp the Little Elephant and his friend to find out whether they can use any number of the described operations to turn the board they have into a proper chessboard.",
"input": "",
"output": "```python\na=input()\r\nb=input()\t\r\nc=input()\r\nd=input()\r\ne=input()\r\nf=input()\t\t\r\ng=input()\r\nh=input()\r\ns=\"WBWBWBWB\"\r\ns1=\"BWBWBWBW\"\r\nl=[a,b,c,d,e,f,g,h]\r\nok=0\r\nif l.count(s)==4 and l.count(s1)==4:\r\n\tok+=1\r\nelse:\r\n\tok=0\r\n# else:\r\n\t# ok=0\r\nif ok==1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Allen is hosting a formal dinner party. $2n$ people come to the event in $n$ pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The $2n$ people line up, but Allen doesn't like the ordering. Allen prefers if each pair occupies adjacent positions in the line, as this makes the picture more aesthetic.\n\nHelp Allen find the minimum number of swaps of adjacent positions he must perform to make it so that each couple occupies adjacent positions in the line.",
"input": "",
"output": "```python\nn,m = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\na.sort()\r\nl,p,k = a[n-1],0,0\r\nfor i in range(n-1):\r\n if pp:\r\n k+=(a[i]-1)\r\n p+=1\r\n else:\r\n k+=(a[i]-1)\r\n else:\r\n k+=(a[i]-1)\r\nif p>=l:\r\n print(k+(a[n-1]-1))\r\nelse:\r\n print(k+(a[n-1]-(l-p)))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A continued fraction of height *n* is a fraction of form . You are given two rational numbers, one is represented as and the other one is represented as a finite fraction of height *n*. Check if they are equal.",
"input": "",
"output": "```python\np, q = [int(x) for x in input().split()]\r\nn = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nfor x in a:\r\n\tp -= q*x\r\n\tp,q = q,p\r\n\r\nif(q==0):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Dreamoon wants to climb up a stair of *n* steps. He can climb 1 or 2 steps at each move. Dreamoon wants the number of moves to be a multiple of an integer *m*. \n\nWhat is the minimal number of moves making him climb to the top of the stairs that satisfies his condition?",
"input": "",
"output": "```python\nn,m=map(int,input().split())\r\nif n count_low:\r\n for ch in s:\r\n print(ch.upper(), end=\"\")\r\n else:\r\n for ch in s:\r\n print(ch.lower(), end=\"\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya the Hipster decided to count how many socks he had. It turned out that he had *a* red socks and *b* blue socks.\n\nAccording to the latest fashion, hipsters should wear the socks of different colors: a red one on the left foot, a blue one on the right foot.\n\nEvery day Vasya puts on new socks in the morning and throws them away before going to bed as he doesn't want to wash them.\n\nVasya wonders, what is the maximum number of days when he can dress fashionable and wear different socks, and after that, for how many days he can then wear the same socks until he either runs out of socks or cannot make a single pair from the socks he's got.\n\nCan you help him?",
"input": "",
"output": "```python\nx, y = map(int, input().split())\r\nmin = min(x, y)\r\nmax = max(x, y)\r\n\r\ndifferent_days = min\r\nsame_days = (max - min) // 2\r\n\r\nprint(different_days, same_days)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "On the way to school, Karen became fixated on the puzzle game on her phone!\n\nThe game is played as follows. In each level, you have a grid with *n* rows and *m* columns. Each cell originally contains the number 0.\n\nOne move consists of choosing one row or column, and adding 1 to all of the cells in that row or column.\n\nTo win the level, after all the moves, the number in the cell at the *i*-th row and *j*-th column should be equal to *g**i*,<=*j*.\n\nKaren is stuck on one level, and wants to know a way to beat this level using the minimum number of moves. Please, help her with this task!",
"input": "",
"output": "```python\nimport math as mt \nimport sys,string\ninput=sys.stdin.readline\nimport random\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn,m=M()\nl=[]\nx=[]\nreq=[]\nreq2=[]\nans=[]\nans2=[]\nc=0\nf=0\nc2=0\nfor i in range(n):\n l.append(L())\n k=min(l[-1])\n if(k>0):\n ans.append((\"r\",i+1,k))\n req.append([k]*m)\n c+=k\n else:\n req.append([0]*m)\nfor i in range(n):\n for j in range(m):\n if(l[i][j]!=req[i][j]):\n e=l[i][j]-req[i][j]\n c+=e\n for k in range(n):\n req[k][j]+=e\n ans.append((\"c\",j+1,e))\n #print(e,\"E\")\n\nif(req==l):\n f=1\nfor i in range(n):\n req2.append([0]*m)\nfor i in range(m):\n k=10**10\n for j in range(n):\n k=min(k,l[j][i])\n if(k>0):\n for p in range(n):\n req2[p][i]=k\n c2+=k\n ans2.append((\"c\",i+1,k))\nfor i in range(n):\n for j in range(m):\n if(l[i][j]!=req2[i][j]):\n e=l[i][j]-req2[i][j]\n c2+=e\n for k in range(m):\n req2[i][k]+=e\n ans2.append((\"r\",i+1,e))\n\n\n\nif(req2==l):\n f+=2\nif(f==3):\n print(min(c,c2))\n if(c= 10:\r\n ans += 1\r\n n = sum_digits(n)\r\n \r\n print(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is now assumed to be an integer.\n\nReliable sources have informed the financier Anton of some information about the exchange rate of currency you all know against the burle for tomorrow. Now Anton knows that tomorrow the exchange rate will be an even number, which can be obtained from the present rate by swapping exactly two distinct digits in it. Of all the possible values that meet these conditions, the exchange rate for tomorrow will be the maximum possible. It is guaranteed that today the exchange rate is an odd positive integer *n*. Help Anton to determine the exchange rate of currency you all know for tomorrow!",
"input": "",
"output": "```python\nn=[i for i in input()]\r\nflag=True\r\nbravo=-1\r\nfor i in range(len(n)):\r\n if int(n[i])%2==0 and int(n[i])32:\r\n print('00:00')\r\nelif(6<=int(t[:2])<=9):\r\n print('10:01')\r\nelif(16<=int(t[:2])<=19):\r\n print('20:02')\r\nelif(int(t[:2][::-1]) <= int(t[3:5])):\r\n print(t[:2]+':'+t[:2][::-1])\r\nelse:\r\n print(str(int(t[:2])+1)+':'+str(int(t[:2])[::-1]))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya loves presents. His mum bought him two strings of the same size for his birthday. The strings consist of uppercase and lowercase Latin letters. Now Petya wants to compare those two strings lexicographically. The letters' case does not matter, that is an uppercase letter is considered equivalent to the corresponding lowercase letter. Help Petya perform the comparison.",
"input": "",
"output": "```python\ns1 = input().lower()\r\ns2 = input().lower()\r\nf = 0\r\nfor i in range(len(s1)):\r\n if ord(s1[i]) > ord(s2[i]):\r\n f = 1\r\n break\r\n elif ord(s1[i]) < ord(s2[i]):\r\n f = -1\r\n break\r\nprint(f)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. \"Piece of cake\" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.",
"input": "",
"output": "```python\nn = int(input())\r\narr = [[]]\r\nfor i in range(n):\r\n for j in range(n):\r\n arr[i][j] = int(input())\r\nsom = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n som += arr[i][j]\r\nif som == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has *n* burles. One bottle of Ber-Cola costs *a* burles and one Bars bar costs *b* burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number of Bars bars.\n\nFind out if it's possible to buy some amount of bottles of Ber-Cola and Bars bars and spend exactly *n* burles.\n\nIn other words, you should find two non-negative integers *x* and *y* such that Vasya can buy *x* bottles of Ber-Cola and *y* Bars bars and *x*·*a*<=+<=*y*·*b*<==<=*n* or tell that it's impossible.",
"input": "",
"output": "```python\nn = int(input())\na = int(input())\nb = int(input())\n\ndef main():\n total = n\n \n if total%a == 0:\n print(\"YES\")\n print(total//a,0)\n return\n if total%b == 0:\n print(\"YES\")\n print(0,total//b)\n return\n\n counter = 0\n while total>0:\n if total%b == 0:\n print(\"YES\")\n print(counter,total//b)\n return\n total -= a\n counter += 1\n\n print(\"NO\")\n return\n\nmain() \n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count. \n\nThe game goes as follows. Kids stand in circle. Let's agree to think of the children as numbered with numbers from 1 to *n* clockwise and the child number 1 is holding the ball. First the first child throws the ball to the next one clockwise, i.e. to the child number 2. Then the child number 2 throws the ball to the next but one child, i.e. to the child number 4, then the fourth child throws the ball to the child that stands two children away from him, i.e. to the child number 7, then the ball is thrown to the child who stands 3 children away from the child number 7, then the ball is thrown to the child who stands 4 children away from the last one, and so on. It should be mentioned that when a ball is thrown it may pass the beginning of the circle. For example, if *n*<==<=5, then after the third throw the child number 2 has the ball again. Overall, *n*<=-<=1 throws are made, and the game ends.\n\nThe problem is that not all the children get the ball during the game. If a child doesn't get the ball, he gets very upset and cries until Natalia Pavlovna gives him a candy. That's why Natalia Pavlovna asks you to help her to identify the numbers of the children who will get the ball after each throw.",
"input": "",
"output": "```python\nn = int(input())\r\n\r\nid = 1\r\nfor i in range(n - 1):\r\n id += i + 1\r\n id %= n\r\n if id == 0:\r\n print(n, end=' ')\r\n else:\r\n print(id, end=' ')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.\n\nAt some points on the road there are *n* friends, and *i*-th of them is standing at the point *x**i* meters and can move with any speed no greater than *v**i* meters per second in any of the two directions along the road: south or north.\n\nYou are to compute the minimum time needed to gather all the *n* friends at some point on the road. Note that the point they meet at doesn't need to have integer coordinate.",
"input": "",
"output": "```python\nn = int(input())\r\nx = [int(i) for i in input().split()]\r\nv = [int(i) for i in input().split()]\r\n\r\ndef search(n,x,v,t):\r\n lmax = max([x[i]-t*v[i] for i in range(n)])\r\n rmin = min([x[i]+t*v[i] for i in range(n)])\r\n if lmax<=rmin:\r\n return True\r\n return False\r\n\r\ndef binary(n,x,v):\r\n l,r = 0,10**9\r\n while abs(r-l)>10**-6:\r\n mid = (l+r)/2\r\n if search(n,x,v,mid):\r\n r = mid\r\n else:\r\n l = mid\r\n return l\r\n\r\nprint(binary(n,x,v))\r\n\r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A new e-mail service \"Berlandesk\" is going to be opened in Berland in the near future. The site administration wants to launch their project as soon as possible, that's why they ask you to help. You're suggested to implement the prototype of site registration system. The system should work on the following principle. \n\nEach time a new user wants to register, he sends to the system a request with his name. If such a name does not exist in the system database, it is inserted into the database, and the user gets the response OK, confirming the successful registration. If the name already exists in the system database, the system makes up a new user name, sends it to the user as a prompt and also inserts the prompt into the database. The new name is formed by the following rule. Numbers, starting with 1, are appended one after another to name (name1, name2, ...), among these numbers the least *i* is found so that name*i* does not yet exist in the database.",
"input": "",
"output": "```python\ndef register_users(n, requests):\n registered_users = set() # Set to store registered user names\n responses = [] # List to store system responses\n for request in requests:\n if request not in registered_users:\n registered_users.add(request)\n responses.append(\"OK\")\n else:\n i = 1\n while f\"{request}{i}\" in registered_users:\n i += 1\n new_username = f\"{request}{i}\"\n registered_users.add(new_username)\n responses.append(new_username)\n return responses\nn = int(input()) # Number of requests\nrequests = [input() for _ in range(n)] # List of requests\nresponses = register_users(n, requests)\nfor response in responses:\n print(response)\n\n \t \t\t \t \t\t\t\t \t \t\t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.\n\nHowever, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every *k*-th dragon got punched in the face with a frying pan. Every *l*-th dragon got his tail shut into the balcony door. Every *m*-th dragon got his paws trampled with sharp heels. Finally, she threatened every *n*-th dragon to call her mom, and he withdrew in panic.\n\nHow many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of *d* dragons?",
"input": "",
"output": "```python\nnum=[]\r\ncount=0\r\nfor i in range(5):\r\n num.append(int(input()))\r\nif num[0]==1 or num[1]==1 or num[2]==1 or num[3]==1:\r\n print(num[4])\r\nelse:\r\n for i in range(1,num[4]+1):\r\n if i%num[0]==0 or i%num[1]==0 or i%num[2]==0 or i%num[3]==0:\r\n count+=1 \r\n print(count)\r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarpus has an array, consisting of *n* integers *a*1,<=*a*2,<=...,<=*a**n*. Polycarpus likes it when numbers in an array match. That's why he wants the array to have as many equal numbers as possible. For that Polycarpus performs the following operation multiple times:\n - he chooses two elements of the array *a**i*, *a**j* (*i*<=≠<=*j*); - he simultaneously increases number *a**i* by 1 and decreases number *a**j* by 1, that is, executes *a**i*<==<=*a**i*<=+<=1 and *a**j*<==<=*a**j*<=-<=1. \nThe given operation changes exactly two distinct array elements. Polycarpus can apply the described operation an infinite number of times. \n\nNow he wants to know what maximum number of equal array elements he can get if he performs an arbitrary number of such operation. Help Polycarpus.",
"input": "",
"output": "```python\nimport collections\r\nn=int(input())\r\nA=[int(x) for x in input().split()]\r\n\r\nwhile True:\r\n A.sort()\r\n B=A[:]\r\n flag=1\r\n for i in range(n//2):\r\n while(A[n-i-1]-1>A[i]):\r\n A[n-i-1]-=1\r\n A[i]+=1\r\n flag=0\r\n if flag:\r\n break\r\nD=collections.Counter(A)\r\nprint(max(D.values()))\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Tattah's youngest brother, Tuftuf, is new to programming.\n\nSince his older brother is such a good programmer, his biggest dream is to outshine him. Tuftuf is a student at the German University in Cairo (GUC) where he learns to write programs in Gava.\n\nToday, Tuftuf was introduced to Gava's unsigned integer datatypes. Gava has *n* unsigned integer datatypes of sizes (in bits) *a*1,<=*a*2,<=... *a**n*. The *i*-th datatype have size *a**i* bits, so it can represent every integer between 0 and 2*a**i*<=-<=1 inclusive. \n\nTuftuf is thinking of learning a better programming language. If there exists an integer *x*, such that *x* fits in some type *i* (in *a**i* bits) and *x*·*x* does not fit in some other type *j* (in *a**j* bits) where *a**i*<=<<=*a**j*, then Tuftuf will stop using Gava.\n\nYour task is to determine Tuftuf's destiny.",
"input": "",
"output": "```python\nn = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nper = 0\r\nper2 = True\r\nwhile per < n-1:\r\n if A[per] < A[per+1]:\r\n if A[per+1] < A[per] * 2:\r\n per2 = False\r\n print(A[per],A[per+1])\r\n break\r\n else:\r\n per+=1\r\n else:\r\n per+=1\r\nif per2:\r\n print('NO')\r\nelse:\r\n print('YES')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was *n* integers *a*1,<=*a*2,<=...,<=*a**n*. These numbers mean that Greg needs to do exactly *n* exercises today. Besides, Greg should repeat the *i*-th in order exercise *a**i* times.\n\nGreg now only does three types of exercises: \"chest\" exercises, \"biceps\" exercises and \"back\" exercises. Besides, his training is cyclic, that is, the first exercise he does is a \"chest\" one, the second one is \"biceps\", the third one is \"back\", the fourth one is \"chest\", the fifth one is \"biceps\", and so on to the *n*-th exercise.\n\nNow Greg wonders, which muscle will get the most exercise during his training. We know that the exercise Greg repeats the maximum number of times, trains the corresponding muscle the most. Help Greg, determine which muscle will get the most training.",
"input": "",
"output": "```python\nimport sys\r\nt = int(sys.stdin.readline())\r\narr = list(map(int, sys.stdin.readline().split()))\r\nchest = biceps = back = 0\r\nfor i in range(len(arr)):\r\n if i % 3 == 0:\r\n chest += arr[i]\r\n elif i % 3 == 1:\r\n biceps += arr[i]\r\n else:\r\n back += arr[i]\r\nif chest > biceps and chest > back:\r\n print(\"chest\")\r\nelif biceps > chest and biceps > back:\r\n print(\"biceps\")\r\nelse:\r\n print(\"back\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mike has a string *s* consisting of only lowercase English letters. He wants to change exactly one character from the string so that the resulting one is a palindrome. \n\nA palindrome is a string that reads the same backward as forward, for example strings \"z\", \"aaa\", \"aba\", \"abccba\" are palindromes, but strings \"codeforces\", \"reality\", \"ab\" are not.",
"input": "",
"output": "```python\ndef iter(s):\r\n rev = s[::-1]\r\n count = 0\r\n length_string = len(s)\r\n for i in range(length_string):\r\n if(s[i]!=rev[i]):\r\n count+=1\r\n if count==2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\ns = input()\r\niter(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya adores sport programming. He can't write programs but he loves to watch the contests' progress. Vasya even has a favorite coder and Vasya pays special attention to him.\n\nOne day Vasya decided to collect the results of all contests where his favorite coder participated and track the progress of his coolness. For each contest where this coder participated, he wrote out a single non-negative number — the number of points his favorite coder earned in the contest. Vasya wrote out the points for the contest in the order, in which the contests run (naturally, no two contests ran simultaneously).\n\nVasya considers a coder's performance in a contest amazing in two situations: he can break either his best or his worst performance record. First, it is amazing if during the contest the coder earns strictly more points that he earned on each past contest. Second, it is amazing if during the contest the coder earns strictly less points that he earned on each past contest. A coder's first contest isn't considered amazing. Now he wants to count the number of amazing performances the coder had throughout his whole history of participating in contests. But the list of earned points turned out long and Vasya can't code... That's why he asks you to help him.",
"input": "",
"output": "```python\na=(input())\r\nb=lift(map(int,input().split()))\r\nc=0\r\nd=e=b[0]\r\nfor i in b:\r\n\tif d>i:\r\n\t\td=i\r\n\t\tc+=1\r\n\tif d 0:\r\n z = queue.pop(0)\r\n for i in range(len(mas[z])):\r\n if dist[mas[z][i]] > dist[z] + 1:\r\n dist[mas[z][i]] = dist[z] + 1\r\n if visit[mas[z][i]] == -1:\r\n visit[mas[z][i]] = 0\r\n queue.append(mas[z][i])\r\nprint((max(dist) - dist[x] + dist[x]) * 2) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Anton has the integer *x*. He is interested what positive integer, which doesn't exceed *x*, has the maximum sum of digits.\n\nYour task is to help Anton and to find the integer that interests him. If there are several such integers, determine the biggest of them.",
"input": "",
"output": "```python\nimport math\r\nn=int(input())\r\nx=math.log10(n)\r\nv=int(x)\r\nif(v==x):\r\n print(n-1)\r\nelse:\r\n num=n\r\n s=0\r\n c=0\r\n while(num>10):\r\n s=s+(num%10)\r\n c=c+1\r\n num=int(num/10)\r\n k=num-1\r\n if(num==10):\r\n s=s+1\r\n else:\r\n s=s+num\r\n s1=c*9 + k\r\n if(s1>s):\r\n print(k,end=\"\")\r\n while(c>0):\r\n print(\"9\",end=\"\")\r\n c=c-1\r\n else:\r\n print (n)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* children in Jzzhu's school. Jzzhu is going to give some candies to them. Let's number all the children from 1 to *n*. The *i*-th child wants to get at least *a**i* candies.\n\nJzzhu asks children to line up. Initially, the *i*-th child stands at the *i*-th place of the line. Then Jzzhu start distribution of the candies. He follows the algorithm:\n 1. Give *m* candies to the first child of the line. 1. If this child still haven't got enough candies, then the child goes to the end of the line, else the child go home. 1. Repeat the first two steps while the line is not empty. \nConsider all the children in the order they go home. Jzzhu wants to know, which child will be the last in this order?",
"input": "",
"output": "```python\nn, m = list(map(int, input().split(\" \")))\r\na = list(map(int, input().split(\" \")))\r\nposa = []\r\n\r\nfor i in range(len(a)):\r\n posa.append(i+1)\r\n\r\nwhile len(a) != 1:\r\n a[0] -= m\r\n if a[0] <= 0:\r\n del(a[0])\r\n del(posa[0])\r\n else:\r\n a.append(a[0])\r\n posa.append(posa[0])\r\n del(a[0])\r\n del(posa[0])\r\n\r\nprint(posa[0])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Just in case somebody missed it: this winter is totally cold in Nvodsk! It is so cold that one gets funny thoughts. For example, let's say there are strings with the length exactly *n*, based on the alphabet of size *m*. Any its substring with length equal to *k* is a palindrome. How many such strings exist? Your task is to find their quantity modulo 1000000007 (109<=+<=7). Be careful and don't miss a string or two!\n\nLet us remind you that a string is a palindrome if it can be read the same way in either direction, from the left to the right and from the right to the left.",
"input": "",
"output": "```python\nclass Dsu:\r\n def __init__(self,n):\r\n self.sizes=[1]*(n)\r\n self.parent=[i for i in range(n)]\r\n def findpar(self,node):\r\n if self.parent[node]==node:\r\n return node\r\n self.parent[node]=self.findpar(self.parent[node])\r\n return self.parent[node]\r\n def union(self,x,y):\r\n px=self.findpar(x)\r\n py=self.findpar(y)\r\n if px==py:\r\n return \r\n if self.sizes[px]>self.sizes[py]:\r\n self.parent[py]=px\r\n self.sizes[px]+=self.sizes[py]\r\n else:\r\n self.sizes[py]+=self.sizes[px]\r\n self.parent[px]=py\r\n return \r\nn,m,k=map(int,input().split())\r\nd=Dsu(n)\r\nfor i in range (n):\r\n low,high=i,i+k-1\r\n if i+k-1>=n:\r\n break\r\n while low 3]\n set3 = [i for i in sets if len(i) == 3]\n set2 = [i for i in sets if len(i) == 2]\n len4 = sum([len(i) for i in set4])\n len3 = sum([len(i) for i in set3])\n len2 = sum([len(i) for i in set2])\n # set1 = [i for i in sets if len(i) == 1]\n len1 = n - len2 - len3 - len4\n # print(sets)\n # print(set2)\n # print(set3)\n # print(set4)\n # print(len4)\n # print(len3)\n # print(len2)\n if len4 > 0 | len2 > len1 | (len1 - len2) % 3 != 0:\n outStr(-1)\n else:\n allset = set()\n for i in set3:\n allset = allset.union(i)\n for i in set2:\n allset = allset.union(i)\n for i in set4:\n allset = allset.union(i)\n set1 = set([i + 1 for i in range(n)]) - allset\n set1 = list(set1)\n # print(set1)\n for i in set3:\n outStr(\" \".join([str(j) for j in i]))\n i = 0\n for it in set2:\n outStr(\" \".join([str(j) for j in it].extend([str(j) for j in set1[i]])))\n i += 1\n while i < len(set1):\n outStr(\" \".join([str(set1[i]), str(set1[i + 1]), str(set1[i + 2])]))\n i += 3\n\n\nif __name__ == \"__main__\":\n main()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A well-known art union called \"Kalevich is Alive!\" manufactures objects d'art (pictures). The union consists of *n* painters who decided to organize their work as follows.\n\nEach painter uses only the color that was assigned to him. The colors are distinct for all painters. Let's assume that the first painter uses color 1, the second one uses color 2, and so on. Each picture will contain all these *n* colors. Adding the *j*-th color to the *i*-th picture takes the *j*-th painter *t**ij* units of time.\n\nOrder is important everywhere, so the painters' work is ordered by the following rules:\n - Each picture is first painted by the first painter, then by the second one, and so on. That is, after the *j*-th painter finishes working on the picture, it must go to the (*j*<=+<=1)-th painter (if *j*<=<<=*n*); - each painter works on the pictures in some order: first, he paints the first picture, then he paints the second picture and so on; - each painter can simultaneously work on at most one picture. However, the painters don't need any time to have a rest; - as soon as the *j*-th painter finishes his part of working on the picture, the picture immediately becomes available to the next painter. \nGiven that the painters start working at time 0, find for each picture the time when it is ready for sale.",
"input": "",
"output": "```python\n\r\nm,n = map(int,input().strip().split())\r\nfinal = []\r\nfor _ in range(m):\r\n l=list(map(int,input().split()))\r\n final.append(l)\r\ncheckstart=0\r\ncheckend=0\r\nfor i in range(1,m):\r\n final[i][0] += final[i-1][0]\r\n \r\nfor i in range(1,n):\r\n final[0][i] += final[0][i-1]\r\n \r\nfor i in range(1,m):\r\n for j in range(1,n):\r\n final[i][j] += max(final[i][j-1],final[i-1][j])\r\n \r\nans=[]\r\nfor i in range(m):\r\n ans.append(final[i][n-1])\r\n \r\nprint(*ans)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Amr lives in Lala Land. Lala Land is a very beautiful country that is located on a coordinate line. Lala Land is famous with its apple trees growing everywhere.\n\nLala Land has exactly *n* apple trees. Tree number *i* is located in a position *x**i* and has *a**i* apples growing on it. Amr wants to collect apples from the apple trees. Amr currently stands in *x*<==<=0 position. At the beginning, he can choose whether to go right or left. He'll continue in his direction until he meets an apple tree he didn't visit before. He'll take all of its apples and then reverse his direction, continue walking in this direction until he meets another apple tree he didn't visit before and so on. In the other words, Amr reverses his direction when visiting each new apple tree. Amr will stop collecting apples when there are no more trees he didn't visit in the direction he is facing.\n\nWhat is the maximum number of apples he can collect?",
"input": "",
"output": "```python\nprint(\"_RANDOM_GUESS_1689445518.1281602\")# 1689445518.1281798\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Johny likes numbers *n* and *k* very much. Now Johny wants to find the smallest integer *x* greater than *n*, so it is divisible by the number *k*.",
"input": "",
"output": "```python\na ,b=map(int,input().split())\r\nif a>b and (b*2)!=a:\r\n print(min(a,b)*2)\r\nelif (b*2) == a:\r\n print(a + b)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Katie, Kuro and Shiro are best friends. They have known each other since kindergarten. That's why they often share everything with each other and work together on some very hard problems.\n\nToday is Shiro's birthday. She really loves pizza so she wants to invite her friends to the pizza restaurant near her house to celebrate her birthday, including her best friends Katie and Kuro.\n\nShe has ordered a very big round pizza, in order to serve her many friends. Exactly $n$ of Shiro's friends are here. That's why she has to divide the pizza into $n + 1$ slices (Shiro also needs to eat). She wants the slices to be exactly the same size and shape. If not, some of her friends will get mad and go home early, and the party will be over.\n\nShiro is now hungry. She wants to cut the pizza with minimum of straight cuts. A cut is a straight segment, it might have ends inside or outside the pizza. But she is too lazy to pick up the calculator.\n\nAs usual, she will ask Katie and Kuro for help. But they haven't come yet. Could you help Shiro with this problem?",
"input": "",
"output": "```python\nn=int(input())\r\nif (n+1)%2==0:\r\n\tprint((n+1)//2)\r\nelif (n+1)%2==1:\r\n\tprint(n+1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Quite recently, a very smart student named Jury decided that lectures are boring, so he downloaded a game called \"Black Square\" on his super cool touchscreen phone.\n\nIn this game, the phone's screen is divided into four vertical strips. Each second, a black square appears on some of the strips. According to the rules of the game, Jury must use this second to touch the corresponding strip to make the square go away. As Jury is both smart and lazy, he counted that he wastes exactly *a**i* calories on touching the *i*-th strip.\n\nYou've got a string *s*, describing the process of the game and numbers *a*1,<=*a*2,<=*a*3,<=*a*4. Calculate how many calories Jury needs to destroy all the squares?",
"input": "",
"output": "```python\n\r\n\r\na,b,c,d = input().split()\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nd = int(d)\r\ncounter=0\r\nboxes=input()\r\nfor i in boxes:\r\n if i == \"1\":\r\n counter+=a\r\n elif i == \"2\":\r\n counter+=b\r\n elif i == \"3\":\r\n counter+=c\r\n elif i == \"4\":\r\n counter+=d\r\nprint (counter)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Misha and Vasya participated in a Codeforces contest. Unfortunately, each of them solved only one problem, though successfully submitted it at the first attempt. Misha solved the problem that costs *a* points and Vasya solved the problem that costs *b* points. Besides, Misha submitted the problem *c* minutes after the contest started and Vasya submitted the problem *d* minutes after the contest started. As you know, on Codeforces the cost of a problem reduces as a round continues. That is, if you submit a problem that costs *p* points *t* minutes after the contest started, you get points. \n\nMisha and Vasya are having an argument trying to find out who got more points. Help them to find out the truth.",
"input": "",
"output": "```python\n\r\nL1= [int(x) for x in input().split(\" \")]\r\n\r\nmp=L1[0]\r\nvp=L1[1]\r\n\r\nmt=L1[2]\r\nvt=L1[3]\r\n\r\nLm=[(3*mp)/10,mp-(mp*mt)/250]\r\n\r\nLv=[(3*vp)/10,vp-(vp*vt)/250]\r\n\r\nm=max(Lm)\r\nv=max(Lv)\r\n\r\nif m>v:\r\n print(\"Misha\")\r\nelif m==v:\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarpus has a ribbon, its length is *n*. He wants to cut the ribbon in a way that fulfils the following two conditions: \n - After the cutting each ribbon piece should have length *a*, *b* or *c*. - After the cutting the number of ribbon pieces should be maximum. \nHelp Polycarpus and find the number of ribbon pieces after the required cutting.",
"input": "",
"output": "```python\ndef ans(n,a,b,c):\r\n if l[n]!=-1:\r\n return l[n]\r\n if n==0:\r\n return 0\r\n elif n<0:\r\n return -10**9\r\n else:\r\n l[n]=max(1+ans(n-a,a,b,c),1+ans(n-b,a,b,c),1+ans(n-c,a,b,c) )\r\n return l[n]\r\n\r\n\r\nn,a,b,c=list(map(int,input().split()))\r\nl=[-1]* (n+2)\r\nprint(ans(n,a,b,c))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.\n\nHe bought *n* pieces of jewelry. The *i*-th piece has price equal to *i*<=+<=1, that is, the prices of the jewelry are 2,<=3,<=4,<=... *n*<=+<=1.\n\nWatson gave Sherlock a challenge to color these jewelry pieces such that two pieces don't have the same color if the price of one piece is a prime divisor of the price of the other piece. Also, Watson asked him to minimize the number of different colors used.\n\nHelp Sherlock complete this trivial task.",
"input": "",
"output": "```python\nn=int(input())\nflag=False;arr=[]\nfor i in range(2,n+2):\n if i%2!=0:arr.append(1)\n elif i%3!=0:arr.append(2)\n else:arr.append(3)\nprint(len(set(arr)))\nprint(*arr)\n\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vanya and his friends are walking along the fence of height *h* and they do not want the guard to notice them. In order to achieve this the height of each of the friends should not exceed *h*. If the height of some person is greater than *h* he can bend down and then he surely won't be noticed by the guard. The height of the *i*-th person is equal to *a**i*.\n\nConsider the width of the person walking as usual to be equal to 1, while the width of the bent person is equal to 2. Friends want to talk to each other while walking, so they would like to walk in a single row. What is the minimum width of the road, such that friends can walk in a row and remain unattended by the guard?",
"input": "",
"output": "```python\nn,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in a:\r\n if i>h:\r\n count+=2\r\n else:\r\n count+=1 \r\nprint(count)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Each year in the castle of Dwarven King there is a competition in growing mushrooms among the dwarves. The competition is one of the most prestigious ones, and the winner gets a wooden salad bowl. This year's event brought together the best mushroom growers from around the world, so we had to slightly change the rules so that the event gets more interesting to watch.\n\nEach mushroom grower has a mushroom that he will grow on the competition. Under the new rules, the competition consists of two parts. The first part lasts *t*1 seconds and the second part lasts *t*2 seconds. The first and the second part are separated by a little break.\n\nAfter the starting whistle the first part of the contest starts, and all mushroom growers start growing mushrooms at once, each at his individual speed of *v**i* meters per second. After *t*1 seconds, the mushroom growers stop growing mushrooms and go to have a break. During the break, for unexplained reasons, the growth of all mushrooms is reduced by *k* percent. After the break the second part of the contest starts and all mushrooms growers at the same time continue to grow mushrooms, each at his individual speed of *u**i* meters per second. After a *t*2 seconds after the end of the break, the competition ends. Note that the speeds before and after the break may vary.\n\nBefore the match dwarf Pasha learned from all participants, what two speeds they have chosen. However, the participants did not want to disclose to him all their strategy and therefore, did not say in what order they will be using these speeds. That is, if a participant chose speeds *a**i* and *b**i*, then there are two strategies: he either uses speed *a**i* before the break and speed *b**i* after it, or vice versa.\n\nDwarf Pasha really wants to win the totalizer. He knows that each participant chooses the strategy that maximizes the height of the mushroom. Help Dwarf Pasha make the final table of competition results.\n\nThe participants are sorted in the result table by the mushroom height (the participants with higher mushrooms follow earlier in the table). In case of equal mushroom heights, the participants are sorted by their numbers (the participants with a smaller number follow earlier).",
"input": "",
"output": "```python\nn, t1, t2, k = map(int, input().split())\r\ntable = []\r\nfor i in range(1, n+1):\r\n a, b = map(int, input().split())\r\n c1 = a*t1*(1-k/100) + b*t2\r\n c2 = b*t1*(1-k/100) + a*t2\r\n if c1 > c2:\r\n c = c1\r\n else:\r\n c = c2\r\n table.append((i, f\"{c:.2f}\"))\r\nfor e in sorted(table, key=lambda x: float(x[1]), reverse=True):\r\n print(*e)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Andrewid the Android is a galaxy-famous detective. In his free time he likes to think about strings containing zeros and ones.\n\nOnce he thought about a string of length *n* consisting of zeroes and ones. Consider the following operation: we choose any two adjacent positions in the string, and if one them contains 0, and the other contains 1, then we are allowed to remove these two digits from the string, obtaining a string of length *n*<=-<=2 as a result.\n\nNow Andreid thinks about what is the minimum length of the string that can remain after applying the described operation several times (possibly, zero)? Help him to calculate this number.",
"input": "",
"output": "```python\n# Case of the Zeros and Ones\r\nn=int(input())\r\ns=input()\r\ni=0\r\nwhile (s.__contains__('10') or s.__contains__('01')) and len(s)>1:\r\n if s[i:i+2]=='10' or s[i:i+2]=='01':\r\n s=s[:i]+s[i+2:]\r\n #print(s)\r\n i=i-2\r\n i=i+1\r\nprint(len(s))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A new e-mail service \"Berlandesk\" is going to be opened in Berland in the near future. The site administration wants to launch their project as soon as possible, that's why they ask you to help. You're suggested to implement the prototype of site registration system. The system should work on the following principle. \n\nEach time a new user wants to register, he sends to the system a request with his name. If such a name does not exist in the system database, it is inserted into the database, and the user gets the response OK, confirming the successful registration. If the name already exists in the system database, the system makes up a new user name, sends it to the user as a prompt and also inserts the prompt into the database. The new name is formed by the following rule. Numbers, starting with 1, are appended one after another to name (name1, name2, ...), among these numbers the least *i* is found so that name*i* does not yet exist in the database.",
"input": "",
"output": "```python\nq={}\r\nfor _ in range(int(input())):t=input();print(t+str(q[t])if q.setdefault(t,0)else 'OK');q[t]+=1\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A bracket sequence is called regular if it is possible to obtain correct arithmetic expression by inserting characters «+» and «1» into this sequence. For example, sequences «(())()», «()» and «(()(()))» are regular, while «)(», «(()» and «(()))(» are not.\n\nOne day Johnny got bracket sequence. He decided to remove some of the brackets from it in order to obtain a regular bracket sequence. What is the maximum length of a regular bracket sequence which can be obtained?",
"input": "",
"output": "```python\nimport sys\ninput = sys.stdin.readline\nprint = sys.stdout.write\n\ns = input().strip()\nstack = []\nans = 0\nfor c in s:\n if c == '(':\n stack.append(c)\n else: # c == ')'\n if not stack:\n continue\n stack.pop()\n ans += 2\nprint(ans)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Alex doesn't like boredom. That's why whenever he gets bored, he comes up with games. One long winter evening he came up with a game and decided to play it.\n\nGiven a sequence *a* consisting of *n* integers. The player can make several steps. In a single step he can choose an element of the sequence (let's denote it *a**k*) and delete it, at that all elements equal to *a**k*<=+<=1 and *a**k*<=-<=1 also must be deleted from the sequence. That step brings *a**k* points to the player. \n\nAlex is a perfectionist, so he decided to get as many points as possible. Help him.",
"input": "",
"output": "```python\nfrom functools import cache\r\nimport sys\r\nfrom typing import Counter\r\n\r\ninput = lambda:sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef I(): return input()\r\ndef II(): return int(input())\r\ndef MII(): return map(int, input().split())\r\ndef LI(): return list(input().split())\r\ndef LII(): return list(map(int, input().split()))\r\n\r\ninf = float(\"inf\")\r\nmod = 10**9 + 7\r\n# for _ in range(II()):\r\nn = II()\r\na = LII()\r\nmx = max(a)\r\ncnt = Counter(a)\r\n@cache\r\ndef dfs(i):\r\n if i < 0: return 0\r\n return max(dfs(i-2) + i * cnt[i], dfs(i-1))\r\nprint(dfs(mx))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bear Limak examines a social network. Its main functionality is that two members can become friends (then they can talk with each other and share funny pictures).\n\nThere are *n* members, numbered 1 through *n*. *m* pairs of members are friends. Of course, a member can't be a friend with themselves.\n\nLet A-B denote that members A and B are friends. Limak thinks that a network is reasonable if and only if the following condition is satisfied: For every three distinct members (X, Y, Z), if X-Y and Y-Z then also X-Z.\n\nFor example: if Alan and Bob are friends, and Bob and Ciri are friends, then Alan and Ciri should be friends as well.\n\nCan you help Limak and check if the network is reasonable? Print \"YES\" or \"NO\" accordingly, without the quotes.",
"input": "",
"output": "```python\n\r\ndef addEdge(adj, a, b):\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n\r\ndef dfs(x):\r\n visited[x] = True\r\n for child in adj[x]:\r\n if not visited[child]:\r\n dfs(child)\r\n\r\nif __name__ == '__main__':\r\n \r\n n, e = map(int, input().split())\r\n\r\n adj = [ [] for i in range(n)]\r\n visited = [False] * n\r\n\r\n for i in range(e):\r\n x, y = map(int, input().split())\r\n addEdge(adj, x - 1, y - 1)\r\n check = True\r\n for i in range(n):\r\n for child in adj[i]:\r\n if len(adj[i]) != len(adj[child]) :\r\n check = False\r\n break\r\n if check:\r\n print(\"YES\")\r\n else: print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* children in Jzzhu's school. Jzzhu is going to give some candies to them. Let's number all the children from 1 to *n*. The *i*-th child wants to get at least *a**i* candies.\n\nJzzhu asks children to line up. Initially, the *i*-th child stands at the *i*-th place of the line. Then Jzzhu start distribution of the candies. He follows the algorithm:\n 1. Give *m* candies to the first child of the line. 1. If this child still haven't got enough candies, then the child goes to the end of the line, else the child go home. 1. Repeat the first two steps while the line is not empty. \nConsider all the children in the order they go home. Jzzhu wants to know, which child will be the last in this order?",
"input": "",
"output": "```python\na,b=map(int,input().split())\r\nx=[int(i)for i in input().split()]\r\nfor i in range(a-1,-1,-1):\r\n if x[i]>b:\r\n print(i+1)\r\n break\r\nelse: print(a)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\nx,y = map(int,input().split())\r\n\r\nif (x*y) %2 ==0:\r\n print((x*y)//2)\r\nelse:\r\n print((x*y) //2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "\"Contestant who earns a score equal to or greater than the *k*-th place finisher's score will advance to the next round, as long as the contestant earns a positive score...\" — an excerpt from contest rules.\n\nA total of *n* participants took part in the contest (*n*<=≥<=*k*), and you already know their scores. Calculate how many participants will advance to the next round.",
"input": "",
"output": "```python\n'''\r\n158A - Next Round\r\nBy: Ayushi Rawat\r\n'''\r\n\r\nkeys = input().split()\r\n#print(keys)\r\n\r\nscores = []\r\n\r\nfor i in range(8):\r\n scores.append(int(input()))\r\n# print(scores)\r\nn, k = 8, 5\r\nscore = [10, 9, 8, 7, 7, 7, 5, 5]\r\n\r\ncount = 0\r\nk = keys[1]\r\nfor i in range(keys[0]):\r\n if score[i] > 0 and score[i] >= score[k]:\r\n count += 1\r\n\r\nprint(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\nx = [int(a) for a in input().split()] \r\nif(1 <= x[0] <= x[1] <= 16):\r\n a = x[0]/2 * x[1]\r\n if(a == int(a)):\r\n print(int(a))\r\n else:\r\n print(int(a - 0.5))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "\"QAQ\" is a word to denote an expression of crying. Imagine \"Q\" as eyes with tears and \"A\" as a mouth.\n\nNow Diamond has given Bort a string consisting of only uppercase English letters of length *n*. There is a great number of \"QAQ\" in the string (Diamond is so cute!).\n\nBort wants to know how many subsequences \"QAQ\" are in the string Diamond has given. Note that the letters \"QAQ\" don't have to be consecutive, but the order of letters should be exact.",
"input": "",
"output": "```python\na = [i for i in input() if i == 'Q' or i == 'A']\r\nt = 0\r\nfor i in range(len(a)):\r\n for j in range(i, len(a)):\r\n for k in range(j, len(a)):\r\n if a[i] == 'Q' and a[j] == 'A' and a[k] == 'Q':\r\n t += 1\r\nprint(t)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Alex decided to remember childhood when computers were not too powerful and lots of people played only default games. Alex enjoyed playing Minesweeper that time. He imagined that he saved world from bombs planted by terrorists, but he rarely won.\n\nAlex has grown up since then, so he easily wins the most difficult levels. This quickly bored him, and he thought: what if the computer gave him invalid fields in the childhood and Alex could not win because of it?\n\nHe needs your help to check it.\n\nA Minesweeper field is a rectangle $n \\times m$, where each cell is either empty, or contains a digit from $1$ to $8$, or a bomb. The field is valid if for each cell: \n - if there is a digit $k$ in the cell, then exactly $k$ neighboring cells have bombs. - if the cell is empty, then all neighboring cells have no bombs. \nTwo cells are neighbors if they have a common side or a corner (i. e. a cell has at most $8$ neighboring cells).",
"input": "",
"output": "```python\n\r\n# Getting Minesweeper dimensions and field from Codeforces.\r\ndimensions,field = tuple(map(int,input().split(' '))),[]\r\nfor i in range(dimensions[0]):\r\n field.append(list(input()))\r\n# Declaring List Storing Relative Coords of a Cell' Neighbours.\r\nrelCoords = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1)]\r\n# For Storing a single cell's bombCount.\r\nbombCount = 0\r\n# Method to compute bomb count in neighbourhood.\r\ndef computeBombCount(pos,depth):\r\n # global.\r\n global bombCount\r\n # Determining if Cell is valid.\r\n if 0>pos[0] or pos[0]>=dimensions[0]: return 0\r\n if 0>pos[1] or pos[1]>=dimensions[1]: return 0\r\n # Determining and returning cell count (Base-Case).\r\n if depth == 1:\r\n if field[pos[0]][pos[1]] == '*':\r\n bombCount = bombCount+1\r\n # Exploring All Neighbours.\r\n else:\r\n for i in range(len(relCoords)):\r\n newCoord = (pos[0]+relCoords[i][0],pos[1]+relCoords[i][1])\r\n computeBombCount(newCoord,1)\r\n# Exploring Field and Ascertaining Validity.\r\nfor i in range(dimensions[0]):\r\n for j in range(dimensions[1]):\r\n # Combuting bombCount.\r\n computeBombCount((i,j),0)\r\n # Case Numbered Cell.\r\n if field[i][j] in tuple(map(str,range(9))):\r\n # Case Bomb-Count Mismatch.\r\n if not int(field[i][j]) == bombCount:\r\n print(\"NO\");exit()\r\n elif field[i][j] == '.' and bombCount>0:\r\n print(\"NO\");exit();\r\n bombCount = 0\r\nprint(\"YES\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for $n$ flowers and so it looks like a pipe with $n$ holes. Arkady can only use the water that flows from the first hole.\n\nArkady can block some of the holes, and then pour $A$ liters of water into the pipe. After that, the water will flow out from the non-blocked holes proportionally to their sizes $s_1, s_2, \\ldots, s_n$. In other words, if the sum of sizes of non-blocked holes is $S$, and the $i$-th hole is not blocked, $\\frac{s_i \\cdot A}{S}$ liters of water will flow out of it.\n\nWhat is the minimum number of holes Arkady should block to make at least $B$ liters of water flow out of the first hole?",
"input": "",
"output": "```python\nn,A,B=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\ncnt=0\r\n#l.sort()\r\nfor each in range(len(l)):\r\n temp=(l[each]*A)/s\r\n #print(temp)\r\n if temp=4:\r\n for i in range(2,len(data)-1):\r\n score=score+(int(data[i])*int((n-i+2)))\r\n score=score+int(int(n)*int(data[1]))\r\n score=score+int(int(n)*int(data[0]))\r\nelif n==3:\r\n score = score+(int(data[2])*2)\r\n score = score+int(3*int(data[1]))\r\n score = score+int(3*int(data[0]))\r\nelif n==2:\r\n score = score+int(2*int(data[1]))+int(2*int(data[0]))\r\nelif n==1:\r\n score = int(data[0])\r\nprint(score)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya decided to have a look at the results of Berland 1910 Football Championship’s finals. Unfortunately he didn't find the overall score of the match; however, he got hold of a profound description of the match's process. On the whole there are *n* lines in that description each of which described one goal. Every goal was marked with the name of the team that had scored it. Help Vasya, learn the name of the team that won the finals. It is guaranteed that the match did not end in a tie.",
"input": "",
"output": "```python\nteams = {}\r\nfor i in range(int(input())):\r\n t = input()\r\n if t not in teams:\r\n teams[t] = 1\r\n else:\r\n teams[t] += 1\r\n\r\nprint(max(teams, key=teams.get))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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.\n\nIn his pocket Polycarp has an unlimited number of \"10-burle coins\" and exactly one coin of *r* burles (1<=≤<=*r*<=≤<=9).\n\nWhat is the minimum number of shovels Polycarp has to buy so that he can pay for the purchase without any change? It is obvious that he can pay for 10 shovels without any change (by paying the requied amount of 10-burle coins and not using the coin of *r* burles). But perhaps he can buy fewer shovels and pay without any change. Note that Polycarp should buy at least one shovel.",
"input": "",
"output": "```python\nk,r=map(int,input().split())\r\nsum=0\r\nwhile(r%k !=0):\r\n r=r+10\r\n sum=sum+1\r\nprint(r//k)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word *s*. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word *s*.",
"input": "",
"output": "```python\n#!/usr/bin/env python\n# coding: utf-8\n\n# In[2]:\n\n\ns = input()\na = s[0]\nfor i in range(1,len(s)):\n if s[i] != s[i-1] :\n a += s[i]\nif \"helo\" in a.lower() or \"hello\" in a.lower() :\n print(\"YES\")\nelse :\n print(\"NO\")\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ilya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam.\n\nYou've got string *s*<==<=*s*1*s*2... *s**n* (*n* is the length of the string), consisting only of characters \".\" and \"#\" and *m* queries. Each query is described by a pair of integers *l**i*,<=*r**i* (1<=≤<=*l**i*<=<<=*r**i*<=≤<=*n*). The answer to the query *l**i*,<=*r**i* is the number of such integers *i* (*l**i*<=≤<=*i*<=<<=*r**i*), that *s**i*<==<=*s**i*<=+<=1.\n\nIlya the Lion wants to help his friends but is there anyone to help him? Help Ilya, solve the problem.",
"input": "",
"output": "```python\nfrom functools import lru_cache\r\ndef update(index, delta):\r\n while index < len(tree):\r\n tree[index] += delta\r\n index += index & (-index)\r\n\r\n\r\n@lru_cache(None)\r\ndef query(index):\r\n res = 0\r\n while index > 0:\r\n res += tree[index]\r\n index -= index & (-index)\r\n return res\r\n\r\n\r\ns = input()\r\ntree = [0] * len(s)\r\nfor i in range(len(s) - 1):\r\n update(i + 1, s[i] == s[i + 1])\r\nfor _ in range(int(input())):\r\n l, r = map(int, input().split())\r\n print(query(r - 1) - query(l - 1))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Inna likes sweets and a game called the \"Candy Matrix\". Today, she came up with the new game \"Candy Matrix 2: Reload\".\n\nThe field for the new game is a rectangle table of size *n*<=×<=*m*. Each line of the table contains one cell with a dwarf figurine, one cell with a candy, the other cells of the line are empty. The game lasts for several moves. During each move the player should choose all lines of the matrix where dwarf is not on the cell with candy and shout \"Let's go!\". After that, all the dwarves from the chosen lines start to simultaneously move to the right. During each second, each dwarf goes to the adjacent cell that is located to the right of its current cell. The movement continues until one of the following events occurs:\n - some dwarf in one of the chosen lines is located in the rightmost cell of his row; - some dwarf in the chosen lines is located in the cell with the candy. \nThe point of the game is to transport all the dwarves to the candy cells.\n\nInna is fabulous, as she came up with such an interesting game. But what about you? Your task is to play this game optimally well. Specifically, you should say by the given game field what minimum number of moves the player needs to reach the goal of the game.",
"input": "",
"output": "```python\nrows, columns = map(int,input().split())\r\n\r\nelems = []\r\nres = 0 \r\ndistance_from_candy = []\r\n\r\nfor i in range(rows):\r\n x = input()\r\n elems.append(x)\r\n \r\n if (x.index(\"G\") > x.index(\"S\")):\r\n res = -1\r\n \r\n if (x.index(\"G\") != x.index(\"S\")):\r\n distance_from_candy.append(x.index(\"S\") - x.index(\"G\"))\r\n \r\nif (res == -1):\r\n print(res)\r\n exit()\r\n \r\ndistance_from_candy = list(set(distance_from_candy))\r\n \r\nprint(len(distance_from_candy)) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are *n* flights that must depart today, the *i*-th of them is planned to depart at the *i*-th minute of the day.\n\nMetropolis airport is the main transport hub of Metropolia, so it is difficult to keep the schedule intact. This is exactly the case today: because of technical issues, no flights were able to depart during the first *k* minutes of the day, so now the new departure schedule must be created.\n\nAll *n* scheduled flights must now depart at different minutes between (*k*<=+<=1)-th and (*k*<=+<=*n*)-th, inclusive. However, it's not mandatory for the flights to depart in the same order they were initially scheduled to do so — their order in the new schedule can be different. There is only one restriction: no flight is allowed to depart earlier than it was supposed to depart in the initial schedule.\n\nHelen knows that each minute of delay of the *i*-th flight costs airport *c**i* burles. Help her find the order for flights to depart in the new schedule that minimizes the total cost for the airport.",
"input": "",
"output": "```python\nn, k = map(int, input().split()); Cost = [int(x)for x in input().split()]; O = [[0]for i in range(n)];\r\nNow = [int(x+k+1) for x in range(n)]; Past = [int(x+1)for x in range(n-k)]; o = 0;\r\nfor i in range(1, k+1):\r\n O[-i] = n+1-i; Cost[-i] = -1; Now.remove(n+1-i);\r\nwhile [0] in O:\r\n y = Cost.index(max(Cost));\r\n o += (min(Now) - min(Past)) * Cost[y]; Past.remove(min(Past));\r\n O[y] = min(Now); Cost[y] = -1; Now.remove(min(Now));\r\nprint(o);\r\nfor i in O:\r\n print(i, end = ' ');\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (*x*1,<=*y*1),<=(*x*2,<=*y*2),<=...,<=(*x**n*,<=*y**n*). Let's define neighbors for some fixed point from the given set (*x*,<=*y*): \n - point (*x*',<=*y*') is (*x*,<=*y*)'s right neighbor, if *x*'<=><=*x* and *y*'<==<=*y* - point (*x*',<=*y*') is (*x*,<=*y*)'s left neighbor, if *x*'<=<<=*x* and *y*'<==<=*y* - point (*x*',<=*y*') is (*x*,<=*y*)'s lower neighbor, if *x*'<==<=*x* and *y*'<=<<=*y* - point (*x*',<=*y*') is (*x*,<=*y*)'s upper neighbor, if *x*'<==<=*x* and *y*'<=><=*y* \nWe'll consider point (*x*,<=*y*) from the given set supercentral, if it has at least one upper, at least one lower, at least one left and at least one right neighbor among this set's points.\n\nVasya marked quite many points on the paper. Analyzing the picture manually is rather a challenge, so Vasya asked you to help him. Your task is to find the number of supercentral points in the given set.",
"input": "",
"output": "```python\nss = 0\r\nn = int(input())\r\nxes = []\r\nyes = []\r\nfor i in range(n):\r\n x,y = (int(x) for x in input().split())\r\n xes.append(x)\r\n yes.append(y)\r\nfor i in range(n):\r\n a,b,c,d = [0]*4\r\n for j in range(0,n):\r\n if xes[j] == xes[i] and yes[j] > yes[i]: a+=1\r\n if xes[j] == xes[i] and yes[j] < yes[i]: b+=1\r\n if xes[j] > xes[i] and yes[j] == yes[i]: c+=1\r\n if xes[j] < xes[i] and yes[j] == yes[i]: d+=1\r\n if a*b*c*d != 0 : ss+=1\r\nprint(ss)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Iahub isn't well prepared on geometry problems, but he heard that this year there will be a lot of geometry problems on the IOI selection camp. Scared, Iahub locked himself in the basement and started thinking of new problems of this kind. One of them is the following.\n\nIahub wants to draw *n* distinct points and *m* segments on the *OX* axis. He can draw each point with either red or blue. The drawing is good if and only if the following requirement is met: for each segment [*l**i*,<=*r**i*] consider all the red points belong to it (*r**i* points), and all the blue points belong to it (*b**i* points); each segment *i* should satisfy the inequality |*r**i*<=-<=*b**i*|<=≤<=1.\n\nIahub thinks that point *x* belongs to segment [*l*,<=*r*], if inequality *l*<=≤<=*x*<=≤<=*r* holds.\n\nIahub gives to you all coordinates of points and segments. Please, help him to find any good drawing.",
"input": "",
"output": "```python\ndef flip(l,ind,q):\n for p in l:\n if p[0] > ind:\n break\n p[1] = 1-p[1]\n for p in q:\n p[1][0] = 0\n p[1][1] = 0\n for ll in l:\n if p[0][0] <= ll[0] <= p[0][1] and ll[0] <= ind:\n p[1][ll[1]] += 1\n\nn,m = [int(i) for i in input().split()]\npoints = [[int(i),0] for i in input().split()]\nsegs = []\nfor i in range(m):\n\tsegs.append([int(i) for i in input().split()])\nsegs.sort(reverse = True)\n\nq = []\nindex = 0\nfor i in range(102):\n while len(segs) > 0 and segs[-1][0] == i:\n q.append([segs.pop(),[0,0]])\n q = [j for j in q if j[0][1] != i-1]\n if index < len(points) and points[index][0] == i:\n fl = False\n #print()\n for pair in q:\n #print(pair)\n if pair[1][0] - pair[1][1] >= 1:\n #print(\"test\")\n if fl:\n #print(-1)\n sys.exit(0)\n fl = True\n flip(points,i-1,q)\n pair[1][0] += 1\n #print()\n index += 1\n\n #print(q)\n\n#print(points)\nfor i,c in points:\n print(c,end = ' ')\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp has $n$ coins, the value of the $i$-th coin is $a_i$. Polycarp wants to distribute all the coins between his pockets, but he cannot put two coins with the same value into the same pocket.\n\nFor example, if Polycarp has got six coins represented as an array $a = [1, 2, 4, 3, 3, 2]$, he can distribute the coins into two pockets as follows: $[1, 2, 3], [2, 3, 4]$.\n\nPolycarp wants to distribute all the coins with the minimum number of used pockets. Help him to do that.",
"input": "",
"output": "```python\nn=int(input())\r\nl=list(map(int,input().split()))\r\ns=list(set(l))\r\nc=0\r\nfor i in range(len(s)):\r\n t=l.count(s[i])\r\n if t>c:\r\n c=t \r\nprint(c)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are $n$ students in a school class, the rating of the $i$-th student on Codehorses is $a_i$. You have to form a team consisting of $k$ students ($1 \\le k \\le n$) such that the ratings of all team members are distinct.\n\nIf it is impossible to form a suitable team, print \"NO\" (without quotes). Otherwise print \"YES\", and then print $k$ distinct numbers which should be the indices of students in the team you form. If there are multiple answers, print any of them.",
"input": "",
"output": "```python\nn,p=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=[]\r\nk=[]\r\nfor i in range(0,n,1):\r\n if l[i] not in d:\r\n d.append(l[i])\r\n k.append(i+1)\r\nif len(d)==p:\r\n print(\"YES\")\r\n print(*k)\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n \r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has got two number: *a* and *b*. However, Vasya finds number *a* too short. So he decided to repeat the operation of lengthening number *a* *n* times.\n\nOne operation of lengthening a number means adding exactly one digit to the number (in the decimal notation) to the right provided that the resulting number is divisible by Vasya's number *b*. If it is impossible to obtain the number which is divisible by *b*, then the lengthening operation cannot be performed.\n\nYour task is to help Vasya and print the number he can get after applying the lengthening operation to number *a* *n* times.",
"input": "",
"output": "```python\na,b,c= map(int,input().split())\r\naaa=str(a)\r\naa=len(aaa)\r\np=True\r\nz=True\r\nfor i in range(c):\r\n if z:\r\n a=a*10 + 9\r\n a-=a%b\r\n ba=str(a)\r\n c1=(len(ba)==(i+aa+1))\r\n c2=(ba.startswith(aaa))\r\n if (not c1) or (not c2):\r\n print(-1)\r\n p=False\r\n break\r\n if c1 and c2:\r\n z=False\r\n else:\r\n a=a*10\r\nif p :\r\n print(a)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In this problem we consider a special type of an auction, which is called the second-price auction. As in regular auction *n* bidders place a bid which is price a bidder ready to pay. The auction is closed, that is, each bidder secretly informs the organizer of the auction price he is willing to pay. After that, the auction winner is the participant who offered the highest price. However, he pay not the price he offers, but the highest price among the offers of other participants (hence the name: the second-price auction).\n\nWrite a program that reads prices offered by bidders and finds the winner and the price he will pay. Consider that all of the offered prices are different.",
"input": "",
"output": "```python\nn = int(input())\r\np = list(map(int,input().split()))\r\nll = p.index(max(p))\r\np.pop(ll)\r\nprint(ll+1,max(p))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Being a nonconformist, Volodya is displeased with the current state of things, particularly with the order of natural numbers (natural number is positive integer number). He is determined to rearrange them. But there are too many natural numbers, so Volodya decided to start with the first *n*. He writes down the following sequence of numbers: firstly all odd integers from 1 to *n* (in ascending order), then all even integers from 1 to *n* (also in ascending order). Help our hero to find out which number will stand at the position number *k*.",
"input": "",
"output": "```python\nn, k = map(int, input().split())\r\n\r\n\r\nprint(([i for i in range(1, n+1, 2)] + [i for i in range(2, n+1, 2)])[k-1])\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ilya is a very clever lion, he lives in an unusual city ZooVille. In this city all the animals have their rights and obligations. Moreover, they even have their own bank accounts. The state of a bank account is an integer. The state of a bank account can be a negative number. This means that the owner of the account owes the bank money.\n\nIlya the Lion has recently had a birthday, so he got a lot of gifts. One of them (the gift of the main ZooVille bank) is the opportunity to delete the last digit or the digit before last from the state of his bank account no more than once. For example, if the state of Ilya's bank account is -123, then Ilya can delete the last digit and get his account balance equal to -12, also he can remove its digit before last and get the account balance equal to -13. Of course, Ilya is permitted not to use the opportunity to delete a digit from the balance.\n\nIlya is not very good at math, and that's why he asks you to help him maximize his bank account. Find the maximum state of the bank account that can be obtained using the bank's gift.",
"input": "",
"output": "```python\nn=int(input())\r\nif(n>=0):\r\n print(n)\r\nelse:\r\n if(n>=-10):\r\n print(\"0\")\r\n else:\r\n a=n//10;\r\n b=((n//100)*10)+(n%10);\r\n if(a>b):\r\n print(a)\r\n else:\r\n print(b)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Further research on zombie thought processes yielded interesting results. As we know from the previous problem, the nervous system of a zombie consists of *n* brains and *m* brain connectors joining some pairs of brains together. It was observed that the intellectual abilities of a zombie depend mainly on the topology of its nervous system. More precisely, we define the distance between two brains *u* and *v* (1<=≤<=*u*,<=*v*<=≤<=*n*) as the minimum number of brain connectors used when transmitting a thought between these two brains. The brain latency of a zombie is defined to be the maximum distance between any two of its brains. Researchers conjecture that the brain latency is the crucial parameter which determines how smart a given zombie is. Help them test this conjecture by writing a program to compute brain latencies of nervous systems.\n\nIn this problem you may assume that any nervous system given in the input is valid, i.e., it satisfies conditions (1) and (2) from the easy version.",
"input": "",
"output": "```python\nfrom typing import List\r\n\r\n\r\n# 좀비의 뇌의 수 n, 뇌를 연결하는 링크의 수 m\r\n# 두 노드 간의 최대 거리를 계산(노드 사이 연결은 트리 형태로 가정)\r\n# 1번 노드로부터의 거리 계산, 1번 노드는 항상 연결되어 있다고 가정\r\ndef solution(brain_links: List[List[int]], visited: List[int]) -> int:\r\n def dfs(node: int) -> int:\r\n max_distance = 1\r\n for link in brain_links[node]:\r\n if not visited[link]:\r\n visited[link] = True\r\n max_distance = max(max_distance, 1 + dfs(link))\r\n visited[link] = False\r\n return max_distance\r\n\r\n import heapq\r\n visited[1] = True\r\n distances = []\r\n for next_brain in brain_links[1]:\r\n heapq.heappush(distances, dfs(next_brain))\r\n \r\n if len(distances) == 1:\r\n return heapq.heappop(distances)\r\n return heapq.heappop(distances) + heapq.heappop(distances)\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n links = [[] for _ in range(n + 1)]\r\n for _ in range(m):\r\n a, b = map(int, input().split())\r\n links[a].append(b)\r\n links[b].append(a)\r\n visited = [False] * (n + 1)\r\n\r\n print(solution(links, visited))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Each student eagerly awaits the day he would pass the exams successfully. Thus, Vasya was ready to celebrate, but, alas, he didn't pass it. However, many of Vasya's fellow students from the same group were more successful and celebrated after the exam.\n\nSome of them celebrated in the BugDonalds restaurant, some of them — in the BeaverKing restaurant, the most successful ones were fast enough to celebrate in both of restaurants. Students which didn't pass the exam didn't celebrate in any of those restaurants and elected to stay home to prepare for their reexamination. However, this quickly bored Vasya and he started checking celebration photos on the Kilogramm. He found out that, in total, BugDonalds was visited by $A$ students, BeaverKing — by $B$ students and $C$ students visited both restaurants. Vasya also knows that there are $N$ students in his group.\n\nBased on this info, Vasya wants to determine either if his data contradicts itself or, if it doesn't, how many students in his group didn't pass the exam. Can you help him so he won't waste his valuable preparation time?",
"input": "",
"output": "```python\nif __name__ == '__main__':\n a, b, c, n = map(int, input().split())\n passed = True\n presult = a+b-c\n if (a-c < 0 or b-c < 0):\n passed = False\n\n if(passed == False or presult < 1 or presult >= n):\n print(-1)\n else:\n print(n-presult)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mishka is decorating the Christmas tree. He has got three garlands, and all of them will be put on the tree. After that Mishka will switch these garlands on.\n\nWhen a garland is switched on, it periodically changes its state — sometimes it is lit, sometimes not. Formally, if *i*-th garland is switched on during *x*-th second, then it is lit only during seconds *x*, *x*<=+<=*k**i*, *x*<=+<=2*k**i*, *x*<=+<=3*k**i* and so on.\n\nMishka wants to switch on the garlands in such a way that during each second after switching the garlands on there would be at least one lit garland. Formally, Mishka wants to choose three integers *x*1, *x*2 and *x*3 (not necessarily distinct) so that he will switch on the first garland during *x*1-th second, the second one — during *x*2-th second, and the third one — during *x*3-th second, respectively, and during each second starting from *max*(*x*1,<=*x*2,<=*x*3) at least one garland will be lit.\n\nHelp Mishka by telling him if it is possible to do this!",
"input": "",
"output": "```python\na = sorted(list(map(int, input().split())))\r\nif a[:1] == [1] or a[:2] == [2,2] or a[:3] == [3,3,3] or a[:3] == [2,4,4]:\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint (\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bear Limak likes watching sports on TV. He is going to watch a game today. The game lasts 90 minutes and there are no breaks.\n\nEach minute can be either interesting or boring. If 15 consecutive minutes are boring then Limak immediately turns TV off.\n\nYou know that there will be *n* interesting minutes *t*1,<=*t*2,<=...,<=*t**n*. Your task is to calculate for how many minutes Limak will watch the game.",
"input": "",
"output": "```python\nn = int(input())\r\nmin = input().split()\r\nbl = True\r\nif int(min[0]) > 15:\r\n bl = False\r\n print(15)\r\nelse:\r\n for i in range(n-1):\r\n if(int(min[i+1])-int(min[i])>15) and bl == True:\r\n bl = False\r\n print(int(min[i])+15)\r\nif bl == True:\r\n if int(min[n])<85:\r\n print(int(min[n])+15)\r\n else:\r\n print(90)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In the city of Ultima Thule job applicants are often offered an IQ test. \n\nThe test is as follows: the person gets a piece of squared paper with a 4<=×<=4 square painted on it. Some of the square's cells are painted black and others are painted white. Your task is to repaint at most one cell the other color so that the picture has a 2<=×<=2 square, completely consisting of cells of the same color. If the initial picture already has such a square, the person should just say so and the test will be completed. \n\nYour task is to write a program that determines whether it is possible to pass the test. You cannot pass the test if either repainting any cell or no action doesn't result in a 2<=×<=2 square, consisting of cells of the same color.",
"input": "",
"output": "```python\nmatrix=[]\nanswer=\"NO\"\nfor i in range (4):\n matrix.append(input())\nfor i in range(3):\n for j in range(3):\n if ((matrix[i][j])+(matrix[i][j+1])+(matrix[i+1][j])+(matrix[i+1][j+1])).count(\"#\") !=2:\n answer=\"YES\"\n break\nprint(answer)\n\n\n \t \t \t \t\t \t\t \t\t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Chloe, the same as Vladik, is a competitive programmer. She didn't have any problems to get to the olympiad like Vladik, but she was confused by the task proposed on the olympiad.\n\nLet's consider the following algorithm of generating a sequence of integers. Initially we have a sequence consisting of a single element equal to 1. Then we perform (*n*<=-<=1) steps. On each step we take the sequence we've got on the previous step, append it to the end of itself and insert in the middle the minimum positive integer we haven't used before. For example, we get the sequence [1,<=2,<=1] after the first step, the sequence [1,<=2,<=1,<=3,<=1,<=2,<=1] after the second step.\n\nThe task is to find the value of the element with index *k* (the elements are numbered from 1) in the obtained sequence, i. e. after (*n*<=-<=1) steps.\n\nPlease help Chloe to solve the problem!",
"input": "",
"output": "```python\ndef solve(n, k):\r\n middle = n\r\n length = (1 << middle) - 1\r\n while k != (length + 1) // 2:\r\n if k > (length + 1) // 2:\r\n k = length + 1 - k\r\n\r\n middle -= 1\r\n length //= 2\r\n return middle\r\n\r\nn = int(input())\r\nk = int(input())\r\nprint(solve(n, k))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "zscoder loves simple strings! A string *t* is called simple if every pair of adjacent characters are distinct. For example ab, aba, zscoder are simple whereas aa, add are not simple.\n\nzscoder is given a string *s*. He wants to change a minimum number of characters so that the string *s* becomes simple. Help him with this task!",
"input": "",
"output": "```python\ns = input()\r\n\r\ns += '0'\r\n\r\nfor i in range(1, len(s)):\r\n if s[i - 1] == s[i]:\r\n if s[i] != 'z' and s[i + 1] != 'z':\r\n s = s[:i] + 'z' + s[i + 1:]\r\n elif s[i] == 'a' or s[i + 1] == 'b':\r\n s = s[:i] + 'b' + s[i + 1:]\r\n else:\r\n s = s[:i] + 'a' + s[i + 1:]\r\n\r\nprint(s[:len(s) - 1])\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Fox Ciel is playing a game with numbers now. \n\nCiel has *n* positive integers: *x*1, *x*2, ..., *x**n*. She can do the following operation as many times as needed: select two different indexes *i* and *j* such that *x**i* > *x**j* hold, and then apply assignment *x**i* = *x**i* - *x**j*. The goal is to make the sum of all numbers as small as possible.\n\nPlease help Ciel to find this minimal sum.",
"input": "",
"output": "```python\n# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nwhile max(arr) > min(arr):\r\n index = arr.index(max(arr))\r\n arr[index] -= min(arr)\r\nprint(sum(arr))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little penguin Polo has an *n*<=×<=*m* matrix, consisting of integers. Let's index the matrix rows from 1 to *n* from top to bottom and let's index the columns from 1 to *m* from left to right. Let's represent the matrix element on the intersection of row *i* and column *j* as *a**ij*.\n\nIn one move the penguin can add or subtract number *d* from some matrix element. Find the minimum number of moves needed to make all matrix elements equal. If the described plan is impossible to carry out, say so.",
"input": "",
"output": "```python\nn, m, d = map(int, input().split())\r\nl = []\r\nfor _ in range(n):\r\n l += list(map(int, input().split()))\r\n\r\nl.sort()\r\nmid = (n*m)//2\r\nans = 0\r\nfor i in l:\r\n if abs(i-l[mid]) % d != 0:\r\n print(-1)\r\n break\r\n ans += abs(i - l[mid])\r\nelse:\r\n print(ans//d)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be *n* problems, sorted by difficulty, i.e. problem 1 is the easiest and problem *n* is the hardest. Limak knows it will take him 5·*i* minutes to solve the *i*-th problem.\n\nLimak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs *k* minutes to get there from his house, where he will participate in the contest first.\n\nHow many problems can Limak solve if he wants to make it to the party?",
"input": "",
"output": "```python\nn,k=map(int,input().split())\r\nactual_time=240-k\r\ncounter=0\r\nfor i in range(1,n):\r\n if 5*i<=actual_time:\r\n counter+=1\r\nprint(counter)\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\ns = input()\r\nuppercase = 0\r\n\r\nfor c in s:\r\n if c.isupper():\r\n uppercase += 1\r\n\r\nif uppercase > int(len(s) / 2):\r\n s = s.upper()\r\nelse:\r\n s = s.lower()\r\n\r\nprint(s)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day the Codeforces round author sat exams. He had *n* exams and he needed to get an integer from 2 to 5 for each exam. He will have to re-sit each failed exam, i.e. the exam that gets mark 2. \n\nThe author would need to spend too much time and effort to make the sum of his marks strictly more than *k*. That could have spoilt the Codeforces round. On the other hand, if the sum of his marks is strictly less than *k*, the author's mum won't be pleased at all. \n\nThe Codeforces authors are very smart and they always get the mark they choose themselves. Also, the Codeforces authors just hate re-sitting exams. \n\nHelp the author and find the minimum number of exams he will have to re-sit if he passes the exams in the way that makes the sum of marks for all *n* exams equal exactly *k*.",
"input": "",
"output": "```python\nl1 = [int(x) for x in input().split()]\r\nexamnumber = l1[0]\r\ntotalscore = l1[1]\r\nprint(max(0,examnumber*3-totalscore))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya the Hipster decided to count how many socks he had. It turned out that he had *a* red socks and *b* blue socks.\n\nAccording to the latest fashion, hipsters should wear the socks of different colors: a red one on the left foot, a blue one on the right foot.\n\nEvery day Vasya puts on new socks in the morning and throws them away before going to bed as he doesn't want to wash them.\n\nVasya wonders, what is the maximum number of days when he can dress fashionable and wear different socks, and after that, for how many days he can then wear the same socks until he either runs out of socks or cannot make a single pair from the socks he's got.\n\nCan you help him?",
"input": "",
"output": "```python\nn = list(map (int , input() . split()))\r\n\r\nx = max(n) - min(n) \r\nprint( min(n) , x//2 )\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Vasya went to the supermarket to get some groceries. He walked about the supermarket for a long time and got a basket full of products. Now he needs to choose the cashier to pay for the products.\n\nThere are *n* cashiers at the exit from the supermarket. At the moment the queue for the *i*-th cashier already has *k**i* people. The *j*-th person standing in the queue to the *i*-th cashier has *m**i*,<=*j* items in the basket. Vasya knows that:\n - the cashier needs 5 seconds to scan one item; - after the cashier scans each item of some customer, he needs 15 seconds to take the customer's money and give him the change. \nOf course, Vasya wants to select a queue so that he can leave the supermarket as soon as possible. Help him write a program that displays the minimum number of seconds after which Vasya can get to one of the cashiers.",
"input": "",
"output": "```python\nn = int(input())\r\nppl = list(map(int, input().strip().split()))[:n]\r\ntime = []\r\nfor i in range(0, n):\r\n temp = 15 * ppl[i]\r\n product = list(map(int, input().strip().split()))[:ppl[i]]\r\n for j in range(0, ppl[i]):\r\n temp += product[j]*5\r\n time.append(temp)\r\ntime.sort()\r\nprint(time[0])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have a positive integer *m* and a non-negative integer *s*. Your task is to find the smallest and the largest of the numbers that have length *m* and sum of digits *s*. The required numbers should be non-negative integers written in the decimal base without leading zeroes.",
"input": "",
"output": "```python\nm,s=map(int,input().split())\r\nif m!=1 and s<=1 or m*9ans:\n\t\tans = temp\n\n\ttotals[idx] = -10**9 \nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.\n\nOne day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.\n\nIn his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The *i*-th digit of the answer is 1 if and only if the *i*-th digit of the two given numbers differ. In the other case the *i*-th digit of the answer is 0.\n\nShapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.\n\nNow you are going to take part in Shapur's contest. See if you are faster and more accurate.",
"input": "",
"output": "```python\nnum=str(int(input()))\r\nnum3=str(int(input()))\r\nif len(num)>len(num3):\r\n num3=num3.zfill(len(num))\r\nelse:\r\n num=num.zfill(len(num3))\r\nch=\"\"\r\nfor i in range(len(num)):\r\n if num[i]==num3[i]:\r\n ch+=\"0\"\r\n else:\r\n ch+=\"1\"\r\n\r\nprint(ch)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Luke Skywalker gave Chewbacca an integer number *x*. Chewbacca isn't good at numbers but he loves inverting digits in them. Inverting digit *t* means replacing it with digit 9<=-<=*t*. \n\nHelp Chewbacca to transform the initial number *x* to the minimum possible positive number by inverting some (possibly, zero) digits. The decimal representation of the final number shouldn't start with a zero.",
"input": "",
"output": "```python\ns = input()\r\nx = \"\"\r\nfor i in s :\r\n if i == '9' : x+=i\r\n else : x+=str(min((9 - int(i)), int(i)))\r\nprint(x)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya likes everything infinite. Now he is studying the properties of a sequence *s*, such that its first element is equal to *a* (*s*1<==<=*a*), and the difference between any two neighbouring elements is equal to *c* (*s**i*<=-<=*s**i*<=-<=1<==<=*c*). In particular, Vasya wonders if his favourite integer *b* appears in this sequence, that is, there exists a positive integer *i*, such that *s**i*<==<=*b*. Of course, you are the person he asks for a help.",
"input": "",
"output": "```python\na,b,c=map(int,input().split())\r\nif(c==0):\r\n if(a==b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n f=(b-a)/c\r\n if(f-int(f)>0 or f<0):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently a dog was bought for Polycarp. The dog's name is Cormen. Now Polycarp has a lot of troubles. For example, Cormen likes going for a walk. \n\nEmpirically Polycarp learned that the dog needs at least *k* walks for any two consecutive days in order to feel good. For example, if *k*<==<=5 and yesterday Polycarp went for a walk with Cormen 2 times, today he has to go for a walk at least 3 times. \n\nPolycarp analysed all his affairs over the next *n* days and made a sequence of *n* integers *a*1,<=*a*2,<=...,<=*a**n*, where *a**i* is the number of times Polycarp will walk with the dog on the *i*-th day while doing all his affairs (for example, he has to go to a shop, throw out the trash, etc.).\n\nHelp Polycarp determine the minimum number of walks he needs to do additionaly in the next *n* days so that Cormen will feel good during all the *n* days. You can assume that on the day before the first day and on the day after the *n*-th day Polycarp will go for a walk with Cormen exactly *k* times. \n\nWrite a program that will find the minumum number of additional walks and the appropriate schedule — the sequence of integers *b*1,<=*b*2,<=...,<=*b**n* (*b**i*<=≥<=*a**i*), where *b**i* means the total number of walks with the dog on the *i*-th day.",
"input": "",
"output": "```python\nn,k = map(int, input().split())\na= list(map(int, input().split()))\nr= 0\nfor i in range(1,n):\n if a[i-1] + a[i] < k:\n r+= k -(a[i-1] +a[i])\n a[i] = k -a[i-1]\nprint(r)\nprint(*a)\n\t \t \t \t \t\t\t\t \t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sheldon, Leonard, Penny, Rajesh and Howard are in the queue for a \"Double Cola\" drink vending machine; there are no other people in the queue. The first one in the queue (Sheldon) buys a can, drinks it and doubles! The resulting two Sheldons go to the end of the queue. Then the next in the queue (Leonard) buys a can, drinks it and gets to the end of the queue as two Leonards, and so on. This process continues ad infinitum.\n\nFor example, Penny drinks the third can of cola and the queue will look like this: Rajesh, Howard, Sheldon, Sheldon, Leonard, Leonard, Penny, Penny.\n\nWrite a program that will print the name of a man who will drink the *n*-th can.\n\nNote that in the very beginning the queue looks like that: Sheldon, Leonard, Penny, Rajesh, Howard. The first person is Sheldon.",
"input": "",
"output": "```python\nlist_ = ['Sheldon', 'Leonard', 'Penny', 'Rajesh', 'Howard']\r\nquantidades = [0, 5]\r\ntarget = int(input())\r\n\r\nx = 0\r\nwhile quantidades[-1] < target:\r\n x += 1\r\n quantidades.append(quantidades[-1] + 5 * 2 ** x)\r\n\r\nprint(list_[(target-1 - quantidades[-2])//2**x])\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?",
"input": "",
"output": "```python\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nflag=0\r\nx=[min(a),min(b)]\r\nfor i in range(n):\r\n\tif a[i] in b:\r\n\t\tprint(a[i])\r\n\t\tflag=1\r\n\t\tbreak\r\nif flag==0:\r\n\tprint(*sorted(x),sep='')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The preferred way to generate user login in Polygon is to concatenate a prefix of the user's first name and a prefix of their last name, in that order. Each prefix must be non-empty, and any of the prefixes can be the full name. Typically there are multiple possible logins for each person.\n\nYou are given the first and the last name of a user. Return the alphabetically earliest login they can get (regardless of other potential Polygon users).\n\nAs a reminder, a prefix of a string *s* is its substring which occurs at the beginning of *s*: \"a\", \"ab\", \"abc\" etc. are prefixes of string \"{abcdef}\" but \"b\" and 'bc\" are not. A string *a* is alphabetically earlier than a string *b*, if *a* is a prefix of *b*, or *a* and *b* coincide up to some position, and then *a* has a letter that is alphabetically earlier than the corresponding letter in *b*: \"a\" and \"ab\" are alphabetically earlier than \"ac\" but \"b\" and \"ba\" are alphabetically later than \"ac\".",
"input": "",
"output": "```python\nf,l = input().split()\nans = ''\nif len(f) > 3\n ans = f[:3] + l[0]\nelse:\n ans = f[:2] + l[0]\n\nprint(ans)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Your friend has recently learned about coprime numbers. A pair of numbers {*a*,<=*b*} is called coprime if the maximum number that divides both *a* and *b* is equal to one. \n\nYour friend often comes up with different statements. He has recently supposed that if the pair (*a*,<=*b*) is coprime and the pair (*b*,<=*c*) is coprime, then the pair (*a*,<=*c*) is coprime. \n\nYou want to find a counterexample for your friend's statement. Therefore, your task is to find three distinct numbers (*a*,<=*b*,<=*c*), for which the statement is false, and the numbers meet the condition *l*<=≤<=*a*<=<<=*b*<=<<=*c*<=≤<=*r*. \n\nMore specifically, you need to find three numbers (*a*,<=*b*,<=*c*), such that *l*<=≤<=*a*<=<<=*b*<=<<=*c*<=≤<=*r*, pairs (*a*,<=*b*) and (*b*,<=*c*) are coprime, and pair (*a*,<=*c*) is not coprime.",
"input": "",
"output": "```python\ndef hypothesis(l, r):\r\n if l % 2 != 0:\r\n l += 1\r\n elif l + 2 > r:\r\n return -1\r\n return l, l + 1, l + 2\r\n\r\n\r\nL, R = [int(i) for i in input().split()]\r\nprint(*hypothesis(L, R))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Devu is a dumb guy, his learning curve is very slow. You are supposed to teach him *n* subjects, the *i**th* subject has *c**i* chapters. When you teach him, you are supposed to teach all the chapters of a subject continuously.\n\nLet us say that his initial per chapter learning power of a subject is *x* hours. In other words he can learn a chapter of a particular subject in *x* hours.\n\nWell Devu is not complete dumb, there is a good thing about him too. If you teach him a subject, then time required to teach any chapter of the next subject will require exactly 1 hour less than previously required (see the examples to understand it more clearly). Note that his per chapter learning power can not be less than 1 hour.\n\nYou can teach him the *n* subjects in any possible order. Find out minimum amount of time (in hours) Devu will take to understand all the subjects and you will be free to do some enjoying task rather than teaching a dumb guy.\n\nPlease be careful that answer might not fit in 32 bit data type.",
"input": "",
"output": "```python\nn, x = map(int, input().split())\r\nc = sorted(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if x == 0:\r\n x += 1\r\n ans += c[i] * x\r\n x -= 1\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pasha loves his phone and also putting his hair up... But the hair is now irrelevant.\n\nPasha has installed a new game to his phone. The goal of the game is following. There is a rectangular field consisting of *n* row with *m* pixels in each row. Initially, all the pixels are colored white. In one move, Pasha can choose any pixel and color it black. In particular, he can choose the pixel that is already black, then after the boy's move the pixel does not change, that is, it remains black. Pasha loses the game when a 2<=×<=2 square consisting of black pixels is formed. \n\nPasha has made a plan of *k* moves, according to which he will paint pixels. Each turn in his plan is represented as a pair of numbers *i* and *j*, denoting respectively the row and the column of the pixel to be colored on the current move.\n\nDetermine whether Pasha loses if he acts in accordance with his plan, and if he does, on what move the 2<=×<=2 square consisting of black pixels is formed.",
"input": "",
"output": "```python\nn,m,k=map(int,input().split())\r\na=[]\r\nfor i in range(k):\r\n b=list(map(int,input().split()))\r\n a.append(b)\r\nx=max(n,m)\r\nfor i in range(x):\r\n for j in range(x):\r\n if [i,j] in a and [i+1,j] in a and [i+1,j+1] in a and [i,j+1] in a:\r\n d=a.index([i+1,j])\r\n e=a.index([i+1,j+1])\r\n f=a.index([i,j+1])\r\n g=a.index([i,j])\r\n print(max(d+1,e+1,f+1,g+1))\r\n break\r\n else:\r\n print(0)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A string is called palindrome if it reads the same from left to right and from right to left. For example \"kazak\", \"oo\", \"r\" and \"mikhailrubinchikkihcniburliahkim\" are palindroms, but strings \"abb\" and \"ij\" are not.\n\nYou are given string *s* consisting of lowercase Latin letters. At once you can choose any position in the string and change letter in that position to any other lowercase letter. So after each changing the length of the string doesn't change. At first you can change some letters in *s*. Then you can permute the order of letters as you want. Permutation doesn't count as changes. \n\nYou should obtain palindrome with the minimal number of changes. If there are several ways to do that you should get the lexicographically (alphabetically) smallest palindrome. So firstly you should minimize the number of changes and then minimize the palindrome lexicographically.",
"input": "",
"output": "```python\ncounts = [0]*26\r\nfor c in input():\r\n\tcounts[ord(c)-97] += 1\r\n# print(*counts)\r\n\r\nans = \"\"\r\n\r\ni = 26\r\nwhile i:\r\n\ti -= 1\r\n\tif counts[i]&1:\r\n\t\t# Find min thing with odd count and increase that\r\n\t\tj = 0\r\n\t\twhile j < 26 and counts[j]&1 < 1:\r\n\t\t\tj += 1\r\n\t\tif j < 26 and counts[j]&1:\r\n\t\t\tcounts[i] -= 1\r\n\t\t\tcounts[j] += 1\r\n\t\tbreak\r\n# print(ans)\r\n\r\nfor i in range(25, -1, -1):\r\n\tadd = chr(i+97) * (counts[i]//2)\r\n\tans = add + ans + add\r\n\r\n\tif counts[i]&1:\r\n\t\tl = len(ans)//2\r\n\t\tans = ans[:l] + chr(i+97) + ans[l:]\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Scientists say a lot about the problems of global warming and cooling of the Earth. Indeed, such natural phenomena strongly influence all life on our planet.\n\nOur hero Vasya is quite concerned about the problems. He decided to try a little experiment and observe how outside daily temperature changes. He hung out a thermometer on the balcony every morning and recorded the temperature. He had been measuring the temperature for the last *n* days. Thus, he got a sequence of numbers *t*1,<=*t*2,<=...,<=*t**n*, where the *i*-th number is the temperature on the *i*-th day.\n\nVasya analyzed the temperature statistics in other cities, and came to the conclusion that the city has no environmental problems, if first the temperature outside is negative for some non-zero number of days, and then the temperature is positive for some non-zero number of days. More formally, there must be a positive integer *k* (1<=≤<=*k*<=≤<=*n*<=-<=1) such that *t*1<=<<=0,<=*t*2<=<<=0,<=...,<=*t**k*<=<<=0 and *t**k*<=+<=1<=><=0,<=*t**k*<=+<=2<=><=0,<=...,<=*t**n*<=><=0. In particular, the temperature should never be zero. If this condition is not met, Vasya decides that his city has environmental problems, and gets upset.\n\nYou do not want to upset Vasya. Therefore, you want to select multiple values of temperature and modify them to satisfy Vasya's condition. You need to know what the least number of temperature values needs to be changed for that.",
"input": "",
"output": "```python\na = open(\"input.txt\", \"r\")\nb = open(\"output.txt\", \"w\")\n\nc = int(a.readline())\nd = list(map(int, a.readline().split()))\n\nej = 0\n\nfor x in d:\n \n if x <= 0:\n \n e += 1\n\nfor i in d[:-1]:\n \n e += (i > 0) - (i < 0)\n \n c = min(c, e)\n \nprint(c, file = b)\n\n#roomatehelp\n \t\t\t\t\t \t\t \t\t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A necklace can be described as a string of links ('-') and pearls ('o'), with the last link or pearl connected to the first one.\n\nYou can remove a link or a pearl and insert it between two other existing links or pearls (or between a link and a pearl) on the necklace. This process can be repeated as many times as you like, but you can't throw away any parts.\n\nCan you make the number of links between every two adjacent pearls equal? Two pearls are considered to be adjacent if there is no other pearl between them.\n\nNote that the final necklace should remain as one circular part of the same length as the initial necklace.",
"input": "",
"output": "```python\nneckelace = input()\r\np = neckelace.count(\"o\")\r\nl = neckelace.count(\"-\")\r\nif l%p==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Today Patrick waits for a visit from his friend Spongebob. To prepare for the visit, Patrick needs to buy some goodies in two stores located near his house. There is a *d*1 meter long road between his house and the first shop and a *d*2 meter long road between his house and the second shop. Also, there is a road of length *d*3 directly connecting these two shops to each other. Help Patrick calculate the minimum distance that he needs to walk in order to go to both shops and return to his house.\n\nPatrick always starts at his house. He should visit both shops moving only along the three existing roads and return back to his house. He doesn't mind visiting the same shop or passing the same road multiple times. The only goal is to minimize the total distance traveled.",
"input": "",
"output": "```python\n\r\n\r\na,b,c=map(int,input().split())\r\nprint(min(a+a+c+c,b+b+c+c,a+b+c,a+a+b+b))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In a far away kingdom lived the King, the Prince, the Shoemaker, the Dressmaker and many other citizens. They lived happily until great trouble came into the Kingdom. The ACMers settled there.\n\nMost damage those strange creatures inflicted upon the kingdom was that they loved high precision numbers. As a result, the Kingdom healers had already had three appointments with the merchants who were asked to sell, say, exactly 0.273549107 beer barrels. To deal with the problem somehow, the King issued an order obliging rounding up all numbers to the closest integer to simplify calculations. Specifically, the order went like this:\n- If a number's integer part does not end with digit 9 and its fractional part is strictly less than 0.5, then the rounded up number coincides with the number’s integer part. - If a number's integer part does not end with digit 9 and its fractional part is not less than 0.5, the rounded up number is obtained if we add 1 to the last digit of the number’s integer part.- If the number’s integer part ends with digit 9, to round up the numbers one should go to Vasilisa the Wise. In the whole Kingdom she is the only one who can perform the tricky operation of carrying into the next position. \nMerchants found the algorithm very sophisticated and they asked you (the ACMers) to help them. Can you write a program that would perform the rounding according to the King’s order?",
"input": "",
"output": "```python\ns=input()\r\n\r\na=round(float(s))\r\na=str(a)\r\nb=a[len(a)-1]\r\nif(s[s.index(\".\")-1]==\"9\"):\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n print(int(a))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mahmoud has *n* line segments, the *i*-th of them has length *a**i*. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is sure he can win, so he asked you to tell him if he should accept the challenge. Given the lengths of the line segments, check if he can choose exactly 3 of them to form a non-degenerate triangle.\n\nMahmoud should use exactly 3 line segments, he can't concatenate two line segments or change any length. A non-degenerate triangle is a triangle with positive area.",
"input": "",
"output": "```python\ndef mapear(f, xs):\r\n return list(map(f, xs))\r\n\r\ndef solve():\r\n n = int(input())\r\n a = mapear(int, input().split(' '))\r\n\r\n # Sem perda de generalidade, assumo que i < j < k \r\n # Dessa forma, garante-se que nenhuma permutação se repetirá\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n for k in range(j+1, n):\r\n if (a[i] + a[j] > a[k]) and (a[i] + a[k] > a[j]) and (a[j] + a[k] > a[i]):\r\n print('YES')\r\n return\r\n \r\n print('NO')\r\n\r\nsolve()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In a small restaurant there are *a* tables for one person and *b* tables for two persons. \n\nIt it known that *n* groups of people come today, each consisting of one or two people. \n\nIf a group consist of one person, it is seated at a vacant one-seater table. If there are none of them, it is seated at a vacant two-seater table. If there are none of them, it is seated at a two-seater table occupied by single person. If there are still none of them, the restaurant denies service to this group.\n\nIf a group consist of two people, it is seated at a vacant two-seater table. If there are none of them, the restaurant denies service to this group.\n\nYou are given a chronological order of groups coming. You are to determine the total number of people the restaurant denies service to.",
"input": "",
"output": "```python\n#!/usr/bin/env python3\r\n\r\nimport math\r\n\r\ndef test_case(casen):\r\n n, a, b = map(int, input().split())\r\n t = list(map(int, input().split()))\r\n\r\n ans = 0\r\n\r\n twoone = 0\r\n\r\n for i in range(n):\r\n if t[i] == 1 and a > 0:\r\n a -= 1\r\n continue\r\n if t[i] == 1 and twoone > 0:\r\n twoone -= 1\r\n continue\r\n if t[i] == 1 and b > 0:\r\n twoone += 1\r\n b -= 1\r\n continue\r\n if t[i] == 1:\r\n ans += 1\r\n continue\r\n if t[i] == 2 and b > 0:\r\n b -= 1\r\n else:\r\n ans += 2\r\n return ans\r\n\r\n\r\n\r\n\r\ndef main():\r\n print(test_case(0))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya loves presents. His mum bought him two strings of the same size for his birthday. The strings consist of uppercase and lowercase Latin letters. Now Petya wants to compare those two strings lexicographically. The letters' case does not matter, that is an uppercase letter is considered equivalent to the corresponding lowercase letter. Help Petya perform the comparison.",
"input": "",
"output": "```python\ns1=input()\r\na=s1.lower()\r\n\r\ns2=input()\r\nb=s2.lower()\r\n\r\nos1=0\r\nos2=0\r\nif a==b:\r\n print(0)\r\nif ab:\r\n print(1)\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Theatre Square in the capital city of Berland has a rectangular shape with the size *n*<=×<=*m* meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size *a*<=×<=*a*.\n\nWhat is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.",
"input": "",
"output": "```python\nn=int(input())\r\nm=int(input())\r\na=int(input())\r\nif n%a==0:\r\n b=n/a\r\nelse:\r\n b= n//a +1\r\nif m%a==0:\r\n c=m/a\r\nelse:\r\n c=m//a+1\r\nprint(max(b,c))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer.\n\nAt the start of the day they have *x* ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and Gerda's house even in the night. Each person in the queue wants either to take several ice cream packs for himself and his friends or to give several ice cream packs to Kay and Gerda (carriers that bring ice cream have to stand in the same queue).\n\nIf a carrier with *d* ice cream packs comes to the house, then Kay and Gerda take all his packs. If a child who wants to take *d* ice cream packs comes to the house, then Kay and Gerda will give him *d* packs if they have enough ice cream, otherwise the child will get no ice cream at all and will leave in distress.\n\nKay wants to find the amount of ice cream they will have after all people will leave from the queue, and Gerda wants to find the number of distressed kids.",
"input": "",
"output": "```python\n# // #include\r\n\r\n\r\n# // int main()\r\n# // {\r\n# // int n,x;\r\n# // scanf(\"%d %d\" , &n , &x);\r\n# // int count = 0;\r\n# // char sign;\r\n# // int d;\r\n# // for(int i = 0 ; i 0) x -= d;\r\n# // else if(sign == '-' && x-d < 0) count++;\r\n# // }\r\n# // printf(\"%d %d\" , x , count);\r\n# // }\r\nn,x = map(int,input().split())\r\ncount = 0\r\nfor i in range(n):\r\n sign,d = map(str,input().split())\r\n packs = int(d)\r\n if(sign == '+'):\r\n x += packs\r\n elif(sign == '-' and x - packs > 0):\r\n x -= packs\r\n elif(sign == '-' and x - packs < 0):\r\n count += 1\r\nprint(x,count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kuriyama Mirai has killed many monsters and got many (namely *n*) stones. She numbers the stones from 1 to *n*. The cost of the *i*-th stone is *v**i*. Kuriyama Mirai wants to know something about these stones so she will ask you two kinds of questions:\n 1. She will tell you two numbers, *l* and *r* (1<=≤<=*l*<=≤<=*r*<=≤<=*n*), and you should tell her . 1. Let *u**i* be the cost of the *i*-th cheapest stone (the cost that will be on the *i*-th place if we arrange all the stone costs in non-decreasing order). This time she will tell you two numbers, *l* and *r* (1<=≤<=*l*<=≤<=*r*<=≤<=*n*), and you should tell her . \nFor every question you should give the correct answer, or Kuriyama Mirai will say \"fuyukai desu\" and then become unhappy.",
"input": "",
"output": "```python\nn = int(input())\r\na = list(map(int, input().split()))\r\nk = int(input())\r\nb = [0]\r\nsum = 0\r\nfor i in range(n):\r\n sum += a[i]\r\n b.append(sum)\r\n\r\n\r\na.sort()\r\nc = [0]\r\nfor i in range(n):\r\n sum += a[i]\r\n c.append(sum)\r\n\r\n\r\nfor i in range(k):\r\n temp = list(map(int, input().split()))\r\n if temp[0] == 1:\r\n l = temp[1]\r\n r = temp[2]\r\n print(b[r] - b[l -1])\r\n else:\r\n l = temp[1]\r\n r = temp[2]\r\n print(c[r] - c[l - 1])\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two set of points. The first set is determined by the equation *A*1*x*<=+<=*B*1*y*<=+<=*C*1<==<=0, and the second one is determined by the equation *A*2*x*<=+<=*B*2*y*<=+<=*C*2<==<=0.\n\nWrite the program which finds the number of points in the intersection of two given sets.",
"input": "",
"output": "```python\nvet1 = input().split()\nvet2 = input().split()\na = int(vet1[0])\nb = int(vet1[1])\nc = int(vet1[2])\np = int(vet2[0])\nq = int(vet2[1])\nr = int(vet2[2])\ndetlow = a*q-b*p\ndet1 = q*c-b*r\ndet2 = p*c-a*r\nif(detlow == 0):\n print(0)\nelif((a == 0 and b == 0) and (p == 0 and q == 0) and c != r):\n print(0)\nelif((a == 0 and b == 0) and (p == 0 and q == 0) and c != r):\n print(0)\nelif(a == 0 and b == 0 and c == 0):\n print(-1)\nelif(p == 0 and q == 0 and r == 0):\n print(-1) \nelif(detlow == 0 and det1 == 0 and det2==0):\n print(-1)\nelse: \n print(1)\n\n \t\t\t \t\t\t \t \t \t \t \t\t \t \t\t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bran and his older sister Arya are from the same house. Bran like candies so much, so Arya is going to give him some Candies.\n\nAt first, Arya and Bran have 0 Candies. There are *n* days, at the *i*-th day, Arya finds *a**i* candies in a box, that is given by the Many-Faced God. Every day she can give Bran at most 8 of her candies. If she don't give him the candies at the same day, they are saved for her and she can give them to him later.\n\nYour task is to find the minimum number of days Arya needs to give Bran *k* candies before the end of the *n*-th day. Formally, you need to output the minimum day index to the end of which *k* candies will be given out (the days are indexed from 1 to *n*).\n\nPrint -1 if she can't give him *k* candies during *n* given days.",
"input": "",
"output": "```python\na,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ns,x =0,0\r\nfor i in l:\r\n\tx+=1;s+=i\r\n\tif s<=8:b-=s;s =0\r\n\telse:b-=8;s-=8\r\n\tif b<=0:break\r\nif b>0:print(-1)\r\nelse:print(x)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You're given a tree with $n$ vertices.\n\nYour task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even size.",
"input": "",
"output": "```python\nn = int(input())\r\nd = {i: [] for i in range(1, n + 1)}\r\nfor i in range(n - 1):\r\n a, b = map(int, input().split())\r\n d[a].append(b)\r\n d[b].append(a)\r\nif n & 1:\r\n print(-1)\r\nelse:\r\n\r\n val = [1 for i in range(n + 1)]\r\n par = [-1 for i in range(n + 1)]\r\n par[1] = 1\r\n stack = [1]\r\n while stack:\r\n u = stack[-1]\r\n f = 0\r\n for i in d[u]:\r\n if par[i] == -1:\r\n par[i] = u\r\n stack.append(i)\r\n f = 1\r\n if f == 0:\r\n stack.pop()\r\n val[par[u]] += val[u]\r\n ans = 0\r\n for i in range(2, n + 1):\r\n if val[i] % 2 == 0:\r\n ans += 1\r\n print(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A permutation is a sequence of integers *p*1,<=*p*2,<=...,<=*p**n*, consisting of *n* distinct positive integers, each of them doesn't exceed *n*. Let's denote the *i*-th element of permutation *p* as *p**i*. We'll call number *n* the size of permutation *p*1,<=*p*2,<=...,<=*p**n*.\n\nNickolas adores permutations. He likes some permutations more than the others. He calls such permutations perfect. A perfect permutation is such permutation *p* that for any *i* (1<=≤<=*i*<=≤<=*n*) (*n* is the permutation size) the following equations hold *p**p**i*<==<=*i* and *p**i*<=≠<=*i*. Nickolas asks you to print any perfect permutation of size *n* for the given *n*.",
"input": "",
"output": "```python\n\r\n#[a, b, c, d] = [int(x) for x in input().split()]\r\nc=int(input())\r\nif c%2==0:\r\n for i in range(0,c):\r\n print(c-i,\" \")\r\n \r\nelse:\r\n print(\"-1\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "According to rules of the Berland fashion, a jacket should be fastened by all the buttons except only one, but not necessarily it should be the last one. Also if the jacket has only one button, it should be fastened, so the jacket will not swinging open.\n\nYou are given a jacket with *n* buttons. Determine if it is fastened in a right way.",
"input": "",
"output": "```python\n#Berland and fashion\r\nn = int(input())\r\nlst = list(map(int,input().split()))\r\ncount = 0\r\nfor item in lst:\r\n if item == 0:\r\n count += 1\r\n\r\nif (len(lst) == 1 and lst[0] == 0) or count > 1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Dreamoon wants to climb up a stair of *n* steps. He can climb 1 or 2 steps at each move. Dreamoon wants the number of moves to be a multiple of an integer *m*. \n\nWhat is the minimal number of moves making him climb to the top of the stairs that satisfies his condition?",
"input": "",
"output": "```python\n#https://codeforces.com/problemset/problem/476/A\nn,m=map(int,input().split(' '))\nans=-1\ns=0\nif n%2==0:\n\ts=n/2\nelse:\n\ts=(n+1)/2\ns=int(s)\nfor i in range(s,n+1):\n\tif i%m==0:\n\t\tans=i;\n\t\tbreak\nprint(ans)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Allen is hosting a formal dinner party. $2n$ people come to the event in $n$ pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The $2n$ people line up, but Allen doesn't like the ordering. Allen prefers if each pair occupies adjacent positions in the line, as this makes the picture more aesthetic.\n\nHelp Allen find the minimum number of swaps of adjacent positions he must perform to make it so that each couple occupies adjacent positions in the line.",
"input": "",
"output": "```python\nn = int(input())\r\np = input().split(\" \")\r\np = [int(p[i]) for i in range (2*n)]\r\nc = 0\r\n\r\n# slides the value at index ind to i+1, returns number of spots slid\r\ndef slide(i, ind):\r\n temp = p[ind]\r\n for j in range (ind-1, i, -1):\r\n p[j+1] = p[j]\r\n print(p)\r\n p[i+1] = temp\r\n return ind-i-1\r\n \r\nfor i in range (0, 2*n, 2):\r\n ind = p.index(p[i], i+1)\r\n c += slide(i, ind)\r\n\r\nprint(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.\n\nNow the party is ready to start its journey, but firstly they have to choose kayaks. There are 2·*n* people in the group (including Vadim), and they have exactly *n*<=-<=1 tandem kayaks (each of which, obviously, can carry two people) and 2 single kayaks. *i*-th person's weight is *w**i*, and weight is an important matter in kayaking — if the difference between the weights of two people that sit in the same tandem kayak is too large, then it can crash. And, of course, people want to distribute their seats in kayaks in order to minimize the chances that kayaks will crash.\n\nFormally, the instability of a single kayak is always 0, and the instability of a tandem kayak is the absolute difference between weights of the people that are in this kayak. Instability of the whole journey is the total instability of all kayaks.\n\nHelp the party to determine minimum possible total instability!",
"input": "",
"output": "```python\nn = int(input())\nl = list(map(int, input().split()))\nnat = False\nfor i in range(2 * n):\n for c in range(i + 1, 2 * n):\n \n ls = l[:]\n ls[i] = 0\n ls[c] = 0\n ls = sorted(ls)\n now = 0\n \n for loc in range(1, len(ls), 2):\n now += ls[loc] - ls[loc - 1]\n \n if now < nat or str(nat) == 'False':\n nat = now\nprint(nat)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Being a nonconformist, Volodya is displeased with the current state of things, particularly with the order of natural numbers (natural number is positive integer number). He is determined to rearrange them. But there are too many natural numbers, so Volodya decided to start with the first *n*. He writes down the following sequence of numbers: firstly all odd integers from 1 to *n* (in ascending order), then all even integers from 1 to *n* (also in ascending order). Help our hero to find out which number will stand at the position number *k*.",
"input": "",
"output": "```python\nn, k = map(int, input().split())\r\n\r\nif n == k:\r\n print(k - 1)\r\nelse:\r\n result = k if k <= n // 2 else (k - n // 2) * 2\r\n print(result)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was *n* integers *a*1,<=*a*2,<=...,<=*a**n*. These numbers mean that Greg needs to do exactly *n* exercises today. Besides, Greg should repeat the *i*-th in order exercise *a**i* times.\n\nGreg now only does three types of exercises: \"chest\" exercises, \"biceps\" exercises and \"back\" exercises. Besides, his training is cyclic, that is, the first exercise he does is a \"chest\" one, the second one is \"biceps\", the third one is \"back\", the fourth one is \"chest\", the fifth one is \"biceps\", and so on to the *n*-th exercise.\n\nNow Greg wonders, which muscle will get the most exercise during his training. We know that the exercise Greg repeats the maximum number of times, trains the corresponding muscle the most. Help Greg, determine which muscle will get the most training.",
"input": "",
"output": "```python\nn=int(input())\r\nm=list(map(int,input().split()))\r\n\r\nchest=0\r\nbiceps=0\r\nback=0\r\n\r\nfor i in range(n):\r\n if i%3==0:\r\n chest+=m[i]\r\n \r\n elif i%3==1:\r\n biceps+=m[i]\r\n \r\n else:\r\n back+=m[i]\r\n \r\n\r\nn=max(back,biceps,chest)\r\nif n==biceps:\r\n print('biceps')\r\n\r\nelif n==back:\r\n print('back')\r\n\r\nelse:\r\n print('chest')\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "So, the New Year holidays are over. Santa Claus and his colleagues can take a rest and have guests at last. When two \"New Year and Christmas Men\" meet, thear assistants cut out of cardboard the letters from the guest's name and the host's name in honor of this event. Then the hung the letters above the main entrance. One night, when everyone went to bed, someone took all the letters of our characters' names. Then he may have shuffled the letters and put them in one pile in front of the door.\n\nThe next morning it was impossible to find the culprit who had made the disorder. But everybody wondered whether it is possible to restore the names of the host and his guests from the letters lying at the door? That is, we need to verify that there are no extra letters, and that nobody will need to cut more letters.\n\nHelp the \"New Year and Christmas Men\" and their friends to cope with this problem. You are given both inscriptions that hung over the front door the previous night, and a pile of letters that were found at the front door next morning.",
"input": "",
"output": "```python\nx1=input()\r\nx2=input()\r\nx=x1+x2\r\nres1 = ''.join(sorted(x))\r\nx3=input()\r\nres3 = ''.join(sorted(x3))\r\nif (res1==res3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A long time ago, in a galaxy far far away two giant IT-corporations Pineapple and Gogol continue their fierce competition. Crucial moment is just around the corner: Gogol is ready to release it's new tablet Lastus 3000.\n\nThis new device is equipped with specially designed artificial intelligence (AI). Employees of Pineapple did their best to postpone the release of Lastus 3000 as long as possible. Finally, they found out, that the name of the new artificial intelligence is similar to the name of the phone, that Pineapple released 200 years ago. As all rights on its name belong to Pineapple, they stand on changing the name of Gogol's artificial intelligence.\n\nPineapple insists, that the name of their phone occurs in the name of AI as a substring. Because the name of technology was already printed on all devices, the Gogol's director decided to replace some characters in AI name with \"#\". As this operation is pretty expensive, you should find the minimum number of characters to replace with \"#\", such that the name of AI doesn't contain the name of the phone as a substring.\n\nSubstring is a continuous subsequence of a string.",
"input": "",
"output": "```python\nnameofAI = input()\r\nnameofPhone = input()\r\n\r\nprint(nameofAI.count(nameofPhone))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once Bob got to a sale of old TV sets. There were *n* TV sets at that sale. TV set with index *i* costs *a**i* bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV sets he wants. Though he's very strong, Bob can carry at most *m* TV sets, and he has no desire to go to the sale for the second time. Please, help Bob find out the maximum sum of money that he can earn.",
"input": "",
"output": "```python\nn, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\na = [x for x in a if x <= 0]\r\na.sort()\r\nprint(sum(a[:min(m, len(a))])*-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (*x*,<=*y*) on this plane. \n\nHan Solo has the newest duplex lazer gun to fight these stormtroopers. It is situated at the point (*x*0,<=*y*0). In one shot it can can destroy all the stormtroopers, situated on some line that crosses point (*x*0,<=*y*0).\n\nYour task is to determine what minimum number of shots Han Solo needs to defeat all the stormtroopers.\n\nThe gun is the newest invention, it shoots very quickly and even after a very large number of shots the stormtroopers don't have enough time to realize what's happening and change their location.",
"input": "",
"output": "```python\nn, x, y = map(int, input().split())\r\nlines = set()\r\nfor _ in range(n):\r\n x1, y1 = map(int, input().split())\r\n if x1 != x:\r\n k = (y1 - y) / (x1-x)\r\n b = y - k * x\r\n else:\r\n k = None\r\n b = x1\r\n lines.add((k, b))\r\n\r\nprint(len(lines))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In a Berland's zoo there is an enclosure with camels. It is known that camels like to spit. Bob watched these interesting animals for the whole day and registered in his notepad where each animal spitted. Now he wants to know if in the zoo there are two camels, which spitted at each other. Help him to solve this task.\n\nThe trajectory of a camel's spit is an arc, i.e. if the camel in position *x* spits *d* meters right, he can hit only the camel in position *x*<=+<=*d*, if such a camel exists.",
"input": "",
"output": "```python\nimport sys\r\nn=int(input())\r\na=[0]*n\r\nb=[0]*n\r\nfor i in range(n):\r\n a[i],b[i]=map(int,input().split())\r\n b[i]=a[i]+b[i]\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i]==b[j] and b[i]==a[j] and i!=j:\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day *n* friends gathered together to play \"Mafia\". During each round of the game some player must be the supervisor and other *n*<=-<=1 people take part in the game. For each person we know in how many rounds he wants to be a player, not the supervisor: the *i*-th person wants to play *a**i* rounds. What is the minimum number of rounds of the \"Mafia\" game they need to play to let each person play at least as many rounds as they want?",
"input": "",
"output": "```python\ndef check(x):\r\n global a, s, n\r\n if s - x*(n-1) <= 0:\r\n return True\r\n return False\r\n\r\n\r\ndef lbp():\r\n global a, s, n\r\n low = max(a)\r\n high = s\r\n while high - low > 1:\r\n mid = (high + low) // 2\r\n if check(mid):\r\n high = mid\r\n else:\r\n low = mid\r\n if check(low):\r\n return low\r\n return high\r\n\r\n\r\ndef main():\r\n global a, n, s\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n s = sum(a)\r\n print(lbp())\r\n\r\na = []\r\ns = 0\r\nn = 0\r\nmain()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Yakko, Wakko and Dot, world-famous animaniacs, decided to rest from acting in cartoons, and take a leave to travel a bit. Yakko dreamt to go to Pennsylvania, his Motherland and the Motherland of his ancestors. Wakko thought about Tasmania, its beaches, sun and sea. Dot chose Transylvania as the most mysterious and unpredictable place.\n\nBut to their great regret, the leave turned to be very short, so it will be enough to visit one of the three above named places. That's why Yakko, as the cleverest, came up with a truly genius idea: let each of the three roll an ordinary six-sided die, and the one with the highest amount of points will be the winner, and will take the other two to the place of his/her dreams.\n\nYakko thrown a die and got Y points, Wakko — W points. It was Dot's turn. But she didn't hurry. Dot wanted to know for sure what were her chances to visit Transylvania.\n\nIt is known that Yakko and Wakko are true gentlemen, that's why if they have the same amount of points with Dot, they will let Dot win.",
"input": "",
"output": "```python\nfrom math import gcd\r\n\r\na, b = map(int, input().split())\r\na, b = min(a, b), max(a, b)\r\ng = gcd(a, b)\r\nprint(f\"{a // g}/{b // g}\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given an *n*<=×<=*m* rectangular table consisting of lower case English letters. In one operation you can completely remove one column from the table. The remaining parts are combined forming a new table. For example, after removing the second column from the table\n\n \n\nwe obtain the table:\n\n \n\nA table is called good if its rows are ordered from top to bottom lexicographically, i.e. each row is lexicographically no larger than the following one. Determine the minimum number of operations of removing a column needed to make a given table good.",
"input": "",
"output": "```python\nn, m = map(int, input().split())\nt = [input() for i in range(n)]\nlt = [False] * (n - 1)\n\ndef tc(j):\n global lt\n lt2 = list(lt)\n for i in range(n - 1):\n if not lt2[i]:\n if t[i][j] < t[i + 1][j]:\n lt2[i] = True\n elif t[i][j] > t[i + 1][j]:\n return True\n lt = lt2\n return False\n\nprint(sum(1 for j in range(m) if tc(j)))\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Anton likes to play chess, and so does his friend Danik.\n\nOnce they have played *n* games in a row. For each game it's known who was the winner — Anton or Danik. None of the games ended with a tie.\n\nNow Anton wonders, who won more games, he or Danik? Help him determine this.",
"input": "",
"output": "```python\ncount=int(input())\r\nwins=input()\r\nA=0\r\nD=0\r\nfor i in wins:\r\n if i=='A':\r\n A+=1\r\n else:\r\n D+=1\r\nif A>D:\r\n print('Anton')\r\nelif A= d:\r\n count += 1\r\n sum_ = 0\r\nprint(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "\"Night gathers, and now my watch begins. It shall not end until my death. I shall take no wife, hold no lands, father no children. I shall wear no crowns and win no glory. I shall live and die at my post. I am the sword in the darkness. I am the watcher on the walls. I am the shield that guards the realms of men. I pledge my life and honor to the Night's Watch, for this night and all the nights to come.\" — The Night's Watch oath.\n\nWith that begins the watch of Jon Snow. He is assigned the task to support the stewards.\n\nThis time he has *n* stewards with him whom he has to provide support. Each steward has his own strength. Jon Snow likes to support a steward only if there exists at least one steward who has strength strictly less than him and at least one steward who has strength strictly greater than him.\n\nCan you find how many stewards will Jon support?",
"input": "",
"output": "```python\nn = int(input())\r\nstewards = list(map(int, input().split()))\r\ncount = 0\r\nsm = 10000000000\r\nlg = -10000000000\r\n\r\nfor i in stewards:\r\n sm = min(i, sm)\r\n lg = max(i, lg)\r\n\r\nfor i in stewards:\r\n if i > sm and i < lg:\r\n count += 1\r\n \r\nprint(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You can not just take the file and send it. When Polycarp trying to send a file in the social network \"Codehorses\", he encountered an unexpected problem. If the name of the file contains three or more \"x\" (lowercase Latin letters \"x\") in a row, the system considers that the file content does not correspond to the social network topic. In this case, the file is not sent and an error message is displayed.\n\nDetermine the minimum number of characters to remove from the file name so after that the name does not contain \"xxx\" as a substring. Print 0 if the file name does not initially contain a forbidden substring \"xxx\".\n\nYou can delete characters in arbitrary positions (not necessarily consecutive). If you delete a character, then the length of a string is reduced by $1$. For example, if you delete the character in the position $2$ from the string \"exxxii\", then the resulting string is \"exxii\".",
"input": "",
"output": "```python\ncharacters = int(input())\r\nstring = input()\r\n\r\nremovals = 0\r\n\r\nfor i in range(0, characters - 2):\r\n \r\n if string[i] == 'x' and string[i + 1] == 'x' and string[i + 2] == 'x':\r\n removals = removals + 1\r\n\r\nprint(removals)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a sequence *a* consisting of *n* integers. You may partition this sequence into two sequences *b* and *c* in such a way that every element belongs exactly to one of these sequences. \n\nLet *B* be the sum of elements belonging to *b*, and *C* be the sum of elements belonging to *c* (if some of these sequences is empty, then its sum is 0). What is the maximum possible value of *B*<=-<=*C*?",
"input": "",
"output": "```python\nn = int(input())\na = list(map(int,input().split()))\nc = 0\nfor i in range(n):\n c += abs(a[i])\nprint(c)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any longer, so he decided to get some food in the house.\n\nKarlsson's gaze immediately fell on *n* wooden cupboards, standing in the kitchen. He immediately realized that these cupboards have hidden jam stocks. Karlsson began to fly greedily around the kitchen, opening and closing the cupboards' doors, grab and empty all the jars of jam that he could find.\n\nAnd now all jars of jam are empty, Karlsson has had enough and does not want to leave traces of his stay, so as not to let down his friend. Each of the cupboards has two doors: the left one and the right one. Karlsson remembers that when he rushed to the kitchen, all the cupboards' left doors were in the same position (open or closed), similarly, all the cupboards' right doors were in the same position (open or closed). Karlsson wants the doors to meet this condition as well by the time the family returns. Karlsson does not remember the position of all the left doors, also, he cannot remember the position of all the right doors. Therefore, it does not matter to him in what position will be all left or right doors. It is important to leave all the left doors in the same position, and all the right doors in the same position. For example, all the left doors may be closed, and all the right ones may be open.\n\nKarlsson needs one second to open or close a door of a cupboard. He understands that he has very little time before the family returns, so he wants to know the minimum number of seconds *t*, in which he is able to bring all the cupboard doors in the required position.\n\nYour task is to write a program that will determine the required number of seconds *t*.",
"input": "",
"output": "```python\n\r\nn=int(input())\r\nx=list()\r\ny=list()\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x.append(a)\r\n y.append(b)\r\n\r\nx0=x.count(0)\r\nx1=n-x0\r\ny0=y.count(0)\r\ny1=n-y0\r\n\r\n# if(x0>x1 and y1>y0):\r\n# print(x1+y0)\r\n# elif(x0>x1 and y1>y0):\r\n# print(x0)\r\nif x0+y1>y0+x1:\r\n print(x1+y0)\r\nelse:\r\n print(y0+x1)\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\ns=input()\r\nctru,ctrl=0,0\r\nfor i in s:\r\n if i.islower():ctrl+=1\r\n else:ctru+=1\r\nif ctrl>ctru:s=s.lower()\r\nelse: s=s.upper()\r\nprint(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are several days left before the fiftieth birthday of a famous Berland's writer Berlbury. In this connection the local library decided to make an exposition of the works of this famous science-fiction writer. It was decided as well that it is necessary to include into the exposition only those books that were published during a particular time period. It is obvious that if the books differ much in size, the visitors will not like it. That was why the organizers came to the opinion, that the difference between the highest and the lowest books in the exposition should be not more than *k* millimeters.\n\nThe library has *n* volumes of books by Berlbury, arranged in chronological order of their appearance. The height of each book in millimeters is know, it is *h**i*. As Berlbury is highly respected in the city, the organizers want to include into the exposition as many books as possible, and to find out what periods of his creative work they will manage to cover. You are asked to help the organizers cope with this hard task.",
"input": "",
"output": "```python\nfrom collections import deque\r\nn,k = [int(i) for i in input().split()]\r\nh = [int(i) for i in input().split()]\r\nr = []\r\nd = deque()\r\ncnt = 0\r\nfor i in range(len(h)):\r\n d.append(h[i])\r\n if max(d) - min(d) > k:\r\n temp = len(d)-1\r\n if temp > cnt:\r\n cnt = temp\r\n r = []\r\n r.append((i-len(d)+2,i))\r\n elif temp == cnt:\r\n r.append((i-len(d)+2,i))\r\n while max(d) - min(d) > k:\r\n d.popleft()\r\ntemp = len(d)\r\nif cnt == 0:\r\n r.append((len(h)-len(d)+1,len(h)))\r\nelif temp == cnt:\r\n r.append((len(h)-len(d)+1,len(h)))\r\nelif temp > cnt:\r\n r = []\r\n r.append((len(h)-len(d)+1,len(h)))\r\nprint('{0} {1}'.format(r[0][1]-r[0][0]+1,len(r)))\r\n \r\nfor i in range(len(r)):\r\n print('{0} {1}'.format(r[i][0],r[i][1]))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently, Anton has found a set. The set consists of small English letters. Anton carefully wrote out all the letters from the set in one line, separated by a comma. He also added an opening curved bracket at the beginning of the line and a closing curved bracket at the end of the line. \n\nUnfortunately, from time to time Anton would forget writing some letter and write it again. He asks you to count the total number of distinct letters in his set.",
"input": "",
"output": "```python\nn = input()\nn = str(n)\na = n.replace(\"a\",\".\")\nb = n.replace(\"b\",\".\")\nc = n.replace(\"c\",\".\")\nd = n.replace(\"d\",\".\")\ne = n.replace(\"e\",\".\")\nf = n.replace(\"f\",\".\")\ng = n.replace(\"g\",\".\")\nh = n.replace(\"h\",\".\")\ni = n.replace(\"i\",\".\")\nj = n.replace(\"j\",\".\")\nk = n.replace(\"k\",\".\")\nl = n.replace(\"l\",\".\")\nm = n.replace(\"m\",\".\")\nn = n.replace(\"n\",\".\")\no = n.replace(\"o\",\".\")\np = n.replace(\"p\",\".\")\nq = n.replace(\"q\",\".\")\nr = n.replace(\"r\",\".\")\ns = n.replace(\"s\",\".\")\nt = n.replace(\"t\",\".\")\nu = n.replace(\"u\",\".\")\nv = n.replace(\"v\",\".\")\nw = n.replace(\"w\",\".\")\nx = n.replace(\"x\",\".\")\ny = n.replace(\"y\",\".\")\nz = n.replace(\"z\",\".\")\nee = n.count(\".\")\nprint(ee)\n \t\t\t\t \t\t \t\t \t\t \t\t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A well-known art union called \"Kalevich is Alive!\" manufactures objects d'art (pictures). The union consists of *n* painters who decided to organize their work as follows.\n\nEach painter uses only the color that was assigned to him. The colors are distinct for all painters. Let's assume that the first painter uses color 1, the second one uses color 2, and so on. Each picture will contain all these *n* colors. Adding the *j*-th color to the *i*-th picture takes the *j*-th painter *t**ij* units of time.\n\nOrder is important everywhere, so the painters' work is ordered by the following rules:\n - Each picture is first painted by the first painter, then by the second one, and so on. That is, after the *j*-th painter finishes working on the picture, it must go to the (*j*<=+<=1)-th painter (if *j*<=<<=*n*); - each painter works on the pictures in some order: first, he paints the first picture, then he paints the second picture and so on; - each painter can simultaneously work on at most one picture. However, the painters don't need any time to have a rest; - as soon as the *j*-th painter finishes his part of working on the picture, the picture immediately becomes available to the next painter. \nGiven that the painters start working at time 0, find for each picture the time when it is ready for sale.",
"input": "",
"output": "```python\nimport sys\r\nimport math\r\ndef fn(n,m,a):\r\n if n==1:\r\n t1=0\r\n for i in range(m):\r\n t1=t1+a[i][0]\r\n print(t1,end=' ')\r\n return 0\r\n \r\n t=[0]*n\r\n t[0]=a[0][0]\r\n for i in range(1,n):\r\n t[i] = a[0][i]+ t[i-1]\r\n print(t[n-1],end=' ')\r\n for i in range(1,m):\r\n for j in range(n-1):\r\n t[j] = t[j] + a[i][j]\r\n if t[j+1] -1:\r\n f = string.find(\"ogo\")\r\n end = f + 3\r\n end2 = end + 2\r\n while string[end:end2] == \"go\":\r\n end += 2\r\n end2 = end + 2\r\n string = string[:f] + \"***\" + string[end:]\r\nprint(string)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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 *h**i*. 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. for all *i*'s from 1 to *n*<=-<=1 the inequality |*h**i*<=-<=*h**i*<=+<=1|<=≤<=1 holds.\n\nAt the end of the route the tourist rafted down a mountain river and some notes in the journal were washed away. Moreover, the numbers in the notes could have been distorted. Now the tourist wonders what could be the maximum height during his hike. Help him restore the maximum possible value of the maximum height throughout the hike or determine that the notes were so much distorted that they do not represent any possible height values that meet limits |*h**i*<=-<=*h**i*<=+<=1|<=≤<=1.",
"input": "",
"output": "```python\nN, M = map(int, input().split())\nH = []\nD = []\nfor i in range(M):\n d, h = map(int, input().split())\n H.append(h)\n D.append(d)\n\nres = max(max(H), H[M - 1] + N - D[M - 1])\nfor i in range(M - 1):\n dest = D[i + 1] - D[i]\n diff = abs(H[i + 1] - H[i])\n if diff > dest:\n res = float('inf')\n break\n else:\n res = max(res, (dest - diff) // 2 + max(H[i + 1], H[i]))\n\nif res == float('inf'):\n print(\"IMPOSSIBLE\")\nelse:\n print(res)\n \n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Today at the lesson Vitya learned a very interesting function — mex. Mex of a sequence of numbers is the minimum non-negative number that is not present in the sequence as element. For example, *mex*([4,<=33,<=0,<=1,<=1,<=5])<==<=2 and *mex*([1,<=2,<=3])<==<=0.\n\nVitya quickly understood all tasks of the teacher, but can you do the same?\n\nYou are given an array consisting of *n* non-negative integers, and *m* queries. Each query is characterized by one number *x* and consists of the following consecutive steps:\n - Perform the bitwise addition operation modulo 2 (xor) of each array element with the number *x*. - Find mex of the resulting array. \nNote that after each query the array changes.",
"input": "",
"output": "```python\nfrom sys import stdin, stdout\n\nn,m = map(int,stdin.readline().rstrip().split())\na = set(map(int,stdin.readline().rstrip().split()))\n\nq = 0\nfor _ in range(m):\n q = q ^ int(stdin.readline().rstrip())\n for i in range(n+1):\n if q^i not in a:\n print(i)\n break\n \n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Valera runs a 24/7 fast food cafe. He magically learned that next day *n* people will visit his cafe. For each person we know the arrival time: the *i*-th person comes exactly at *h**i* hours *m**i* minutes. The cafe spends less than a minute to serve each client, but if a client comes in and sees that there is no free cash, than he doesn't want to wait and leaves the cafe immediately. \n\nValera is very greedy, so he wants to serve all *n* customers next day (and get more profit). However, for that he needs to ensure that at each moment of time the number of working cashes is no less than the number of clients in the cafe. \n\nHelp Valera count the minimum number of cashes to work at his cafe next day, so that they can serve all visitors.",
"input": "",
"output": "```python\nfrom collections import*\r\nq=int(input())\r\nlst=[]\r\nfor i in range(q):\r\n h,m=map(int,input().split())\r\n d=str(h)+str(m)\r\n lst.append(d)\r\ns=1\r\nfor i,x in Counter(lst).items():\r\n if x>=2:\r\n s+=1\r\nprint(s)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have *n* devices that you want to use simultaneously.\n\nThe *i*-th device uses *a**i* units of power per second. This usage is continuous. That is, in λ seconds, the device will use λ·*a**i* units of power. The *i*-th device currently has *b**i* units of power stored. All devices can store an arbitrary amount of power.\n\nYou have a single charger that can plug to any single device. The charger will add *p* units of power per second to a device. This charging is continuous. That is, if you plug in a device for λ seconds, it will gain λ·*p* units of power. You can switch which device is charging at any arbitrary unit of time (including real numbers), and the time it takes to switch is negligible.\n\nYou are wondering, what is the maximum amount of time you can use the devices until one of them hits 0 units of power.\n\nIf you can use the devices indefinitely, print -1. Otherwise, print the maximum amount of time before any one device hits 0 power.",
"input": "",
"output": "```python\nfrom math import inf\r\nn, p = [int(x) for x in input().split()]\r\nl = []\r\nfor i in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n l.append((a, b, b/a))\r\nl.sort(key=lambda x: x[2])\r\nasum = 0\r\nbsum = 0\r\nsumt = 0\r\nfor i in range(n):\r\n a0, b0, _ = l[i]\r\n c1 = inf if i == n-1 else l[i+1][2]\r\n asum += a0\r\n bsum += b0\r\n dp = asum - p\r\n if dp > 0:\r\n t = bsum / dp\r\n if t < c1:\r\n print(t)\r\n exit()\r\nprint(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.\n\nA little later they found a string *s*, carved on a rock below the temple's gates. Asterix supposed that that's the password that opens the temple and read the string aloud. However, nothing happened. Then Asterix supposed that a password is some substring *t* of the string *s*.\n\nPrefix supposed that the substring *t* is the beginning of the string *s*; Suffix supposed that the substring *t* should be the end of the string *s*; and Obelix supposed that *t* should be located somewhere inside the string *s*, that is, *t* is neither its beginning, nor its end.\n\nAsterix chose the substring *t* so as to please all his companions. Besides, from all acceptable variants Asterix chose the longest one (as Asterix loves long strings). When Asterix read the substring *t* aloud, the temple doors opened. \n\nYou know the string *s*. Find the substring *t* or determine that such substring does not exist and all that's been written above is just a nice legend.",
"input": "",
"output": "```python\nch=input()\r\nx=len(ch)\r\na=0\r\ni=0\r\nwhile (a==0) and (i1):\r\n if (a==1) and (t in ch[c:x-c]):\r\n print(t)\r\n else:\r\n print(\"Just a legend\")\r\n\r\nelse:\r\n print(\"Just a legend\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kicker (table football) is a board game based on football, in which players control the footballers' figures mounted on rods by using bars to get the ball into the opponent's goal. When playing two on two, one player of each team controls the goalkeeper and the full-backs (plays defence), the other player controls the half-backs and forwards (plays attack).\n\nTwo teams of company Q decided to battle each other. Let's enumerate players from both teams by integers from 1 to 4. The first and second player play in the first team, the third and the fourth one play in the second team. For each of the four players we know their game skills in defence and attack. The defence skill of the *i*-th player is *a**i*, the attack skill is *b**i*.\n\nBefore the game, the teams determine how they will play. First the players of the first team decide who will play in the attack, and who will play in the defence. Then the second team players do the same, based on the choice of their opponents.\n\nWe will define a team's defence as the defence skill of player of the team who plays defence. Similarly, a team's attack is the attack skill of the player of the team who plays attack. We assume that one team is guaranteed to beat the other one, if its defence is strictly greater than the opponent's attack and its attack is strictly greater than the opponent's defence.\n\nThe teams of company Q know each other's strengths and therefore arrange their teams optimally. Identify the team that is guaranteed to win (if both teams act optimally) or tell that there is no such team.",
"input": "",
"output": "```python\na=[int(k) for k in input().split()]\r\nb=[int(k) for k in input().split()]\r\nc=[int(k) for k in input().split()]\r\nd=[int(k) for k in input().split()]\r\n\r\nif (a[0]>c[1] and b[1]>d[0]) and (a[0]>d[1] and b[1]>c[0]):\r\n print(\"Team 1\")\r\nelif (a[1]>c[0] and b[0]>d[1]) and (a[1]>d[0] and b[0]>c[1]):\r\n print(\"Team 1\")\r\nelif ((c[1]>a[0] and d[0]>b[1]) or (d[1]>a[0] and c[0]>b[1])) and ((c[0]>a[1] and d[1]>b[0]) or (d[0]>a[1] and c[1]>b[0])):\r\n print(\"Team 2\")\r\nelse:\r\n print(\"Draw\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "HQ9+ is a joke programming language which has only four one-character instructions:\n- \"H\" prints \"Hello, World!\",- \"Q\" prints the source code of the program itself,- \"9\" prints the lyrics of \"99 Bottles of Beer\" song, - \"+\" increments the value stored in the internal accumulator.\nInstructions \"H\" and \"Q\" are case-sensitive and must be uppercase. The characters of the program which are not instructions are ignored.\n\nYou are given a program written in HQ9+. You have to figure out whether executing this program will produce any output.",
"input": "",
"output": "```python\nx = input()\ninstructions = \"HQ9\"\n\nfor char in x:\n if char in instructions:\n print(\"YES\")\n break\n\nelse:\n print(\"NO\")\n\n \t \t\t\t \t \t\t \t \t \t\t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In Ancient Berland there were *n* cities and *m* two-way roads of equal length. The cities are numbered with integers from 1 to *n* inclusively. According to an ancient superstition, if a traveller visits three cities *a**i*, *b**i*, *c**i* in row, without visiting other cities between them, a great disaster awaits him. Overall there are *k* such city triplets. Each triplet is ordered, which means that, for example, you are allowed to visit the cities in the following order: *a**i*, *c**i*, *b**i*. Vasya wants to get from the city 1 to the city *n* and not fulfil the superstition. Find out which minimal number of roads he should take. Also you are required to find one of his possible path routes.",
"input": "",
"output": "```python\nimport sys\r\ndef find(b, road):\r\n if b: find(pre[b][road], b)\r\n print(road, end=' ')\r\n \r\n_input = lambda:[*map(int, input().split())]\r\nn, m, k = _input()\r\nroad_descs = [[]for i in range(n + 1)]\r\n\r\nfor i in range(m):\r\n a, b = _input()\r\n road_descs[a] += [b]\r\n road_descs[b] += [a]\r\n \r\nst = set()\r\nfor i in range(k): st.add(tuple(_input()))\r\npre = [[0] * (n + 1) for i in range(n + 1)]\r\ntmp = [[100000000] * (n + 1)for i in range(n + 1)]\r\ntmp[0][1] = 0\r\nq = [(0, 1)]\r\n\r\nwhile(q):\r\n a, b = q.pop(0)\r\n d = tmp[a][b]+1\r\n for road in road_descs[b]:\r\n if tmp[b][c] > d and (a, b, road) not in st:\r\n q += [(b, road)]\r\n tmp[b][road] = d\r\n pre[b][road] = a\r\n if road == n:\r\n print(d)\r\n find(b, road)\r\n sys.exit(0)\r\nprint(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mishka started participating in a programming contest. There are $n$ problems in the contest. Mishka's problem-solving skill is equal to $k$.\n\nMishka arranges all problems from the contest into a list. Because of his weird principles, Mishka only solves problems from one of the ends of the list. Every time, he chooses which end (left or right) he will solve the next problem from. Thus, each problem Mishka solves is either the leftmost or the rightmost problem in the list.\n\nMishka cannot solve a problem with difficulty greater than $k$. When Mishka solves the problem, it disappears from the list, so the length of the list decreases by $1$. Mishka stops when he is unable to solve any problem from any end of the list.\n\nHow many problems can Mishka solve?",
"input": "",
"output": "```python\nn,m=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nvis=[0]*n\r\ncnt=0\r\nfor i in range(n):\r\n if lst[i]<=m:\r\n cnt+=1\r\n vis[i]=1\r\n else:\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if vis[i]==1 or lst[i]>m:\r\n break\r\n else:\r\n cnt+=1\r\nprint(cnt)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Programmers' kids solve this riddle in 5-10 minutes. How fast can you do it?",
"input": "",
"output": "```python\ns = int(input())\r\na = hex(s)[2:]\r\nprint(a.count('0') + a.count('4') + a.count('6') + a.count('8') * 2 + a.count('a') + a.count('9') + a.count('b') * 2 + a.count('d'))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best choice. The main argument in favor of choosing Java was that it has a very large integer data type, called BigInteger.\n\nBut having attended several classes of the club, Petya realized that not all tasks require using the BigInteger type. It turned out that in some tasks it is much easier to use small data types. That's why a question arises: \"Which integer type to use if one wants to store a positive integer *n*?\"\n\nPetya knows only 5 integer types:\n\n1) byte occupies 1 byte and allows you to store numbers from <=-<=128 to 127\n\n2) short occupies 2 bytes and allows you to store numbers from <=-<=32768 to 32767\n\n3) int occupies 4 bytes and allows you to store numbers from <=-<=2147483648 to 2147483647\n\n4) long occupies 8 bytes and allows you to store numbers from <=-<=9223372036854775808 to 9223372036854775807\n\n5) BigInteger can store any integer number, but at that it is not a primitive type, and operations with it are much slower.\n\nFor all the types given above the boundary values are included in the value range.\n\nFrom this list, Petya wants to choose the smallest type that can store a positive integer *n*. Since BigInteger works much slower, Peter regards it last. Help him.",
"input": "",
"output": "```python\nitem=input()\n\ndef LTE(a,b):\n if(len(a)!=len(b)):\n #smaller length always smaller\n return len(a)b[i]):\n return False\n #equal\n return True\n\nif(item[0]!='-'):\n #positive\n if LTE(item,'127'):\n print(\"byte\")\n elif LTE(item,'32767'):\n print(\"short\")\n elif LTE(item,'2147483647'):\n print(\"int\")\n elif LTE(item,'9223372036854775807'):\n print(\"long\")\n else:\n print(\"BigInteger\")\nelse:\n #negative\n item=item[1:]\n if LTE(item,'128'):\n print(\"byte\")\n elif LTE(item,'32768'):\n print(\"short\")\n elif LTE(item,'2147483648'):\n print(\"int\")\n elif LTE(item,'9223372036854775808'):\n print(\"long\")\n else:\n print(\"BigInteger\")\n \t \t\t\t \t \t\t\t \t\t\t\t\t\t\t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "DZY has a hash table with *p* buckets, numbered from 0 to *p*<=-<=1. He wants to insert *n* numbers, in the order they are given, into the hash table. For the *i*-th number *x**i*, DZY will put it into the bucket numbered *h*(*x**i*), where *h*(*x*) is the hash function. In this problem we will assume, that *h*(*x*)<==<=*x* *mod* *p*. Operation *a* *mod* *b* denotes taking a remainder after division *a* by *b*.\n\nHowever, each bucket can contain no more than one element. If DZY wants to insert an number into a bucket which is already filled, we say a \"conflict\" happens. Suppose the first conflict happens right after the *i*-th insertion, you should output *i*. If no conflict happens, just output -1.",
"input": "",
"output": "```python\np, n = [int(_) for _ in input().split()]\r\nd = {}\r\nans = -1\r\nf = True\r\nfor i in range(n):\r\n\tx = int(input())\r\n\tif f and x%p in d:\r\n\t\tans = i+1\r\n\t\tf = False\r\n\telse:\r\n\t\td[x%p] = 1\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Theatre Square in the capital city of Berland has a rectangular shape with the size *n*<=×<=*m* meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size *a*<=×<=*a*.\n\nWhat is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.",
"input": "",
"output": "```python\nm,n,a = map(int, input().split())\r\nif(a>=m and a>=n):\r\n print(1)\r\nelif(a==1):\r\n print(m*n)\r\nelif(a>=m and a = n and a L[i-1] and L[i] > L[i+1]:\r\n ans += 1\r\n if L[i] < L[i-1] and L[i] < L[i+1]:\r\n ans += 1\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "— Oh my sweet Beaverette, would you fancy a walk along a wonderful woodland belt with me? \n\n — Of course, my Smart Beaver! Let us enjoy the splendid view together. How about Friday night? \n\nAt this point the Smart Beaver got rushing. Everything should be perfect by Friday, so he needed to prepare the belt to the upcoming walk. He needed to cut down several trees.\n\nLet's consider the woodland belt as a sequence of trees. Each tree *i* is described by the esthetic appeal *a**i* — some trees are very esthetically pleasing, others are 'so-so', and some trees are positively ugly!\n\nThe Smart Beaver calculated that he needed the following effects to win the Beaverette's heart: \n - The first objective is to please the Beaverette: the sum of esthetic appeal of the remaining trees must be maximum possible; - the second objective is to surprise the Beaverette: the esthetic appeal of the first and the last trees in the resulting belt must be the same; - and of course, the walk should be successful: there must be at least two trees in the woodland belt left. \nNow help the Smart Beaver! Which trees does he need to cut down to win the Beaverette's heart?",
"input": "",
"output": "```python\nfrom math import inf\r\n\r\n\r\ndef solve_task5():\r\n n = int(input())\r\n trees = tuple(map(int, input().split(\" \")))\r\n reversed_trees = tuple(reversed(trees))\r\n max_rating = -1 * inf\r\n begin_tree = 0\r\n end_tree = 0\r\n deleted_trees = []\r\n for i in range(n):\r\n l = trees[i]\r\n r = n - 1 - reversed_trees.index(trees[l])\r\n if l != r:\r\n temp_sum = trees[l] + trees[r]\r\n for j in range(l + 1, r):\r\n if trees[j] > 0:\r\n temp_sum += trees[j]\r\n if temp_sum > max_rating:\r\n max_rating, begin_tree, end_tree = temp_sum, l, r\r\n deleted_trees = list(range(begin_tree)) + list(range(end_tree + 1, n))\r\n for i in range(begin_tree + 1, end_tree):\r\n if trees[i] < 0:\r\n deleted_trees.append(trees[i])\r\n deleted_trees.sort()\r\n deleted_trees = [el + 1 for el in deleted_trees]\r\n k = len(deleted_trees)\r\n\r\n return \" \".join([str(max_rating), str(k)]) + \"\\n\" + \" \".join([str(el) for el in deleted_trees])\r\n\r\n\r\nresult = solve_task5()\r\nprint(result)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.\n\nYou know two languages, and the professor is giving the lecture in the first one. The words in both languages consist of lowercase English characters, each language consists of several words. For each language, all words are distinct, i.e. they are spelled differently. Moreover, the words of these languages have a one-to-one correspondence, that is, for each word in each language, there exists exactly one word in the other language having has the same meaning.\n\nYou can write down every word the professor says in either the first language or the second language. Of course, during the lecture you write down each word in the language in which the word is shorter. In case of equal lengths of the corresponding words you prefer the word of the first language.\n\nYou are given the text of the lecture the professor is going to read. Find out how the lecture will be recorded in your notes.",
"input": "",
"output": "```python\nn, m = map(int, input().split())\r\n\r\nwords = {}\r\nfor _ in range(m):\r\n first_lang, second_lang = input().split()\r\n words[first_lang] = second_lang\r\n\r\nlecture = input().split()\r\n\r\nrecorded_lecture = [words[word] if len(words[word]) < len(word) else word for word in lecture]\r\nrecorded_lecture = ' '.join(recorded_lecture)\r\n\r\nprint(recorded_lecture)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "*n* soldiers stand in a circle. For each soldier his height *a**i* is known. A reconnaissance unit can be made of such two neighbouring soldiers, whose heights difference is minimal, i.e. |*a**i*<=-<=*a**j*| is minimal. So each of them will be less noticeable with the other. Output any pair of soldiers that can form a reconnaissance unit.",
"input": "",
"output": "```python\n# https://codeforces.com/problemset/problem/34/A\r\n\r\ndef func_sol(raw_data):\r\n temp = list(map(int, raw_data.split('\\n')[1].split(' ')))\r\n a = sorted([(idx, t) for idx, t in enumerate(temp)], key=lambda e: e[1])\r\n min_diff = abs(a[0][1] - a[1][1])\r\n x, y = a[0][0], a[1][0]\r\n for idx in range(-1, len(a) - 1):\r\n temp_min_diff = abs(a[idx][1] - a[idx + 1][1])\r\n if temp_min_diff < min_diff:\r\n min_diff = temp_min_diff\r\n x, y = a[idx][0], a[idx + 1][0]\r\n return str(x + 1) + ' ' + str(y + 1)\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read()))\r\n\r\n\r\nmain()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pavel loves grid mazes. A grid maze is an *n*<=×<=*m* rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly *k* empty cells into walls so that all the remaining cells still formed a connected area. Help him.",
"input": "",
"output": "```python\ndef solve(x, y):\r\n global k\r\n if x < 0 or x > n - 1 or y < 0 or y > m - 1 or arr[x][y] != '.' or vis[x][y] == True:\r\n return\r\n\r\n vis[x][y] = True\r\n solve(x + 1, y)\r\n solve(x - 1, y)\r\n solve(x, y + 1)\r\n solve(x, y - 1)\r\n\r\n if k > 0:\r\n arr[x][y] = 'X'\r\n k -= 1\r\n \r\n\r\n\r\nn, m, k = [int(x) for x in input().split()]\r\narr = []\r\nvis = [[False for i in range(m + 10)] for j in range(n + 10)]\r\n\r\nfor i in range(n):\r\n s = input()\r\n s.strip()\r\n arr.append([x for x in s])\r\n\r\ni, j = 0, 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == '.':\r\n break\r\n if j < m:\r\n break\r\n\r\nsolve(i, j)\r\n\r\nfor i in arr:\r\n print(*i, sep='')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number *a* and Antisimon receives number *b*. They also have a heap of *n* stones. The players take turns to make a move and Simon starts. During a move a player should take from the heap the number of stones equal to the greatest common divisor of the fixed number he has received and the number of stones left in the heap. A player loses when he cannot take the required number of stones (i. e. the heap has strictly less stones left than one needs to take). \n\nYour task is to determine by the given *a*, *b* and *n* who wins the game.",
"input": "",
"output": "```python\ndef game(a, b, c, x, y):\r\n while True:\r\n x=a\r\n y=b\r\n z=c\r\n while z > 0:\r\n x, z = z, x % z\r\n c-=x\r\n z=c\r\n if c 0:\r\n y, z = z, y % z\r\n c-=y\r\n z=c\r\n if c l:\r\n print(s.upper())\r\nelif h < l:\r\n print(s.lower())\r\nelif h == l:\r\n print(s.upper())\r\nelse:\r\n pass\r\n \r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given an array of *n* integer numbers *a*0,<=*a*1,<=...,<=*a**n*<=-<=1. Find the distance between two closest (nearest) minimums in it. It is guaranteed that in the array a minimum occurs at least two times.",
"input": "",
"output": "```python\nn=int(input())\r\na=[]\r\ns=10\r\nd=0\r\nfor i in input().split():\r\n a.append(int(i))\r\nm=min(a)\r\np0=a.index(m)\r\nfor i in range(p0+1,len(a)):\r\n if a[i]==m:\r\n d=i-p0\r\n if d 0):\r\n\t\tresto = b\r\n\t\tb = a % b\r\n\t\ta = resto\r\n\treturn a\r\nn=int(input())\r\ny=n\r\nk=2\r\np=0\r\nr=0\r\nfor q in range (0, n-2):\r\n n=y\r\n while n>=k:\r\n a=n%k\r\n p=p+a\r\n n=n//k\r\n p=p+n\r\n k=k+1\r\nt=k-2\r\na=mcd(p,t)\r\nnu=p//a\r\nde=t//a\r\nprint(str(nu)+\"/\"+str(de))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The new \"Die Hard\" movie has just been released! There are *n* people at the cinema box office standing in a huge line. Each of them has a single 100, 50 or 25 ruble bill. A \"Die Hard\" ticket costs 25 rubles. Can the booking clerk sell a ticket to each person and give the change if he initially has no money and sells the tickets strictly in the order people follow in the line?",
"input": "",
"output": "```python\nn=int(input())\r\nx=input()\r\nif(x==25 or x== 50):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A coordinate line has *n* segments, the *i*-th segment starts at the position *l**i* and ends at the position *r**i*. We will denote such a segment as [*l**i*,<=*r**i*].\n\nYou have suggested that one of the defined segments covers all others. In other words, there is such segment in the given set, which contains all other ones. Now you want to test your assumption. Find in the given set the segment which covers all other segments, and print its number. If such a segment doesn't exist, print -1.\n\nFormally we will assume that segment [*a*,<=*b*] covers segment [*c*,<=*d*], if they meet this condition *a*<=≤<=*c*<=≤<=*d*<=≤<=*b*.",
"input": "",
"output": "```python\nans = -1\r\nreq = []\r\nmx = 0\r\nmn = 10**10\r\n\r\nfor _ in range(int(input())):\r\n seg = list(map(int, input().split()))\r\n\r\n # print(seg)\r\n \r\n \r\n if seg[0] < mn:\r\n mn = seg[0]\r\n req = seg\r\n ans = _+1 \r\n\r\n elif seg[0] == mn and seg[1] > mx:\r\n mx = seg[1]\r\n req = seg\r\n ans = _+1 \r\n \r\n if seg[1] > mx:\r\n mx = seg[1]\r\n \r\n # print(mn, mx)\r\nif req != [mn, mx]:\r\n print(-1)\r\n\r\nelse:\r\n print(ans)\r\n\r\n \r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Valera had two bags of potatoes, the first of these bags contains *x* (*x*<=≥<=1) potatoes, and the second — *y* (*y*<=≥<=1) potatoes. Valera — very scattered boy, so the first bag of potatoes (it contains *x* potatoes) Valera lost. Valera remembers that the total amount of potatoes (*x*<=+<=*y*) in the two bags, firstly, was not gerater than *n*, and, secondly, was divisible by *k*.\n\nHelp Valera to determine how many potatoes could be in the first bag. Print all such possible numbers in ascending order.",
"input": "",
"output": "```python\ny,k,n=map(int,input().split())\r\nif(y>=n):\r\n print(-1)\r\nelse:\r\n x=n//k\r\n l=[]\r\n for i in range(1,x+1):\r\n if(k*i-y>0):\r\n l.append((str(k*i-y)))\r\n print(' '.join(l))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mishka is decorating the Christmas tree. He has got three garlands, and all of them will be put on the tree. After that Mishka will switch these garlands on.\n\nWhen a garland is switched on, it periodically changes its state — sometimes it is lit, sometimes not. Formally, if *i*-th garland is switched on during *x*-th second, then it is lit only during seconds *x*, *x*<=+<=*k**i*, *x*<=+<=2*k**i*, *x*<=+<=3*k**i* and so on.\n\nMishka wants to switch on the garlands in such a way that during each second after switching the garlands on there would be at least one lit garland. Formally, Mishka wants to choose three integers *x*1, *x*2 and *x*3 (not necessarily distinct) so that he will switch on the first garland during *x*1-th second, the second one — during *x*2-th second, and the third one — during *x*3-th second, respectively, and during each second starting from *max*(*x*1,<=*x*2,<=*x*3) at least one garland will be lit.\n\nHelp Mishka by telling him if it is possible to do this!",
"input": "",
"output": "```python\nx1,x2,x3=[int(x1) for x1 in input().split()]\r\narr=[]\r\ncount=0\r\ncount2=0\r\nif(x1==1 or x2==1 or x3==1):\r\n print(\"YES\")\r\nelse:\r\n arr.append(x1)\r\n arr.append(x2)\r\n arr.append(x3)\r\n for i in range(3):\r\n if(arr[i]==2):\r\n count=count+1\r\n elif(arr[i]==4):\r\n count2=count2+1\r\n else:\r\n pass\r\n if(count==2 or count2==2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "For a positive integer *n* let's define a function *f*:\n\n*f*(*n*)<==<=<=-<=1<=+<=2<=-<=3<=+<=..<=+<=(<=-<=1)*n**n* \n\nYour task is to calculate *f*(*n*) for a given integer *n*.",
"input": "",
"output": "```python\nn = int(input())\r\ns = 0\r\nif n % 2 == 0:\r\n s = n // 2\r\nelse:\r\n s = n // 2 - n\r\nprint(s)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mahmoud has *n* line segments, the *i*-th of them has length *a**i*. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is sure he can win, so he asked you to tell him if he should accept the challenge. Given the lengths of the line segments, check if he can choose exactly 3 of them to form a non-degenerate triangle.\n\nMahmoud should use exactly 3 line segments, he can't concatenate two line segments or change any length. A non-degenerate triangle is a triangle with positive area.",
"input": "",
"output": "```python\ninput()\r\nL = list(map(int, input().split()))\r\nL.sort()\r\nflag = False\r\n#print(L)\r\nfor i in range(1, len(L) - 1):\r\n for j in range(0, len(L) - i - 1):\r\n #print(L[j], L[len(L) - i - 1], L[len(L) - i])\r\n if L[j] + L[len(L) - i - 1] >= L[len(L) - i]:\r\n flag = True\r\n break\r\nprint('YES') if flag else print('NO')\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two players are playing a game. First each of them writes an integer from 1 to 6, and then a dice is thrown. The player whose written number got closer to the number on the dice wins. If both payers have the same difference, it's a draw.\n\nThe first player wrote number *a*, the second player wrote number *b*. How many ways to throw a dice are there, at which the first player wins, or there is a draw, or the second player wins?",
"input": "",
"output": "```python\na,b=map(int,input().split())\r\naw=0\r\ndraw=0\r\nbw=0\r\nfor i in range(1,7):\r\n if(abs(a-i)abs(b-i)):\r\n bw+=1\r\n else:\r\n draw+=1\r\nprint(aw,draw,bw)\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya and Gena love playing table tennis. A single match is played according to the following rules: a match consists of multiple sets, each set consists of multiple serves. Each serve is won by one of the players, this player scores one point. As soon as one of the players scores *t* points, he wins the set; then the next set starts and scores of both players are being set to 0. As soon as one of the players wins the total of *s* sets, he wins the match and the match is over. Here *s* and *t* are some positive integer numbers.\n\nTo spice it up, Petya and Gena choose new numbers *s* and *t* before every match. Besides, for the sake of history they keep a record of each match: that is, for each serve they write down the winner. Serve winners are recorded in the chronological order. In a record the set is over as soon as one of the players scores *t* points and the match is over as soon as one of the players wins *s* sets.\n\nPetya and Gena have found a record of an old match. Unfortunately, the sequence of serves in the record isn't divided into sets and numbers *s* and *t* for the given match are also lost. The players now wonder what values of *s* and *t* might be. Can you determine all the possible options?",
"input": "",
"output": "```python\nimport sys\n\n\nn = int(input())\na = [int(i) for i in input().split()]\nm = a[-1]\nans = []\nfor t in range(1, n + 1):\n for s in range(1, n // t + 1):\n s1, s2, i, k1, k2 = 0, 0, 0, 0, 0\n while i != n:\n if a[i] == m:\n s1 += 1\n else:\n s2 += 1\n if s1 == t:\n s1, s2 = 0, 0\n k1 += 1\n if s2 == t:\n s1, s2 = 0, 0\n k2 += 1\n i += 1\n if s1 == s2 == 0 and s == k1 > k2:\n ans.append([s, t])\n break\nans.sort(key=lambda x: (x[0], x[1]))\nprint(len(ans))\nfor row in ans:\n print(*row)\n\n\n\n\n# Fri Jan 01 2021 15:18:31 GMT+0300 (Москва, стандартное время)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya likes numbers a lot. He found that number 123 in base 16 consists of two digits: the first is 7 and the second is 11. So the sum of digits of 123 in base 16 is equal to 18.\n\nNow he wonders what is an average value of sum of digits of the number *A* written in all bases from 2 to *A*<=-<=1.\n\nNote that all computations should be done in base 10. You should find the result as an irreducible fraction, written in base 10.",
"input": "",
"output": "```python\nfrom math import gcd\r\nn, s=int(input()), 0\r\nfor i in range(2,n):\r\n k = n\r\n while k != 0:\r\n s+=k%i\r\n k//=i\r\np=gcd(s,n-2)\r\nprint(f'{s//p}/{(n-2)//p}')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A soldier wants to buy *w* bananas in the shop. He has to pay *k* dollars for the first banana, 2*k* dollars for the second one and so on (in other words, he has to pay *i*·*k* dollars for the *i*-th banana). \n\nHe has *n* dollars. How many dollars does he have to borrow from his friend soldier to buy *w* bananas?",
"input": "",
"output": "```python\nk, n ,w = map(int, input().split())\r\nb, total = 0, 0\r\nfor x in range(1, w+1):\r\n total += x * k\r\nif (n - total) > -1:\r\n print(n)\r\nelse:\r\n print(abs(n-total))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Little Elephant enjoys recursive functions.\n\nThis time he enjoys the sorting function. Let *a* is a permutation of an integers from 1 to *n*, inclusive, and *a**i* denotes the *i*-th element of the permutation. The Little Elephant's recursive function *f*(*x*), that sorts the first *x* permutation's elements, works as follows:\n - If *x*<==<=1, exit the function. - Otherwise, call *f*(*x*<=-<=1), and then make *swap*(*a**x*<=-<=1,<=*a**x*) (swap the *x*-th and (*x*<=-<=1)-th elements of *a*). \nThe Little Elephant's teacher believes that this function does not work correctly. But that-be do not get an F, the Little Elephant wants to show the performance of its function. Help him, find a permutation of numbers from 1 to *n*, such that after performing the Little Elephant's function (that is call *f*(*n*)), the permutation will be sorted in ascending order.",
"input": "",
"output": "```python\ndef f(m):\r\n p[m-1],p[m]=p[m],p[m-1]\r\n \r\nk=int(input())\r\np=[]\r\nfor i in range(1,k+1):\r\n p.append(str(i))\r\nfor i in range(k,-1,-1):\r\n if i==1:\r\n break\r\n else:\r\n f(i-1)\r\nprint(' '.join(p))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has a non-negative integer *n*. He wants to round it to nearest integer, which ends up with 0. If *n* already ends up with 0, Vasya considers it already rounded.\n\nFor example, if *n*<==<=4722 answer is 4720. If *n*<==<=5 Vasya can round it to 0 or to 10. Both ways are correct.\n\nFor given *n* find out to which integer will Vasya round it.",
"input": "",
"output": "```python\nprint(input()[:-1]+'0')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are literally dozens of snooker competitions held each year, and team Jinotega tries to attend them all (for some reason they prefer name \"snookah\")! When a competition takes place somewhere far from their hometown, Ivan, Artsem and Konstantin take a flight to the contest and back.\n\nJinotega's best friends, team Base have found a list of their itinerary receipts with information about departure and arrival airports. Now they wonder, where is Jinotega now: at home or at some competition far away? They know that: \n - this list contains all Jinotega's flights in this year (in arbitrary order), - Jinotega has only flown from his hometown to a snooker contest and back, - after each competition Jinotega flies back home (though they may attend a competition in one place several times), - and finally, at the beginning of the year Jinotega was at home. \nPlease help them to determine Jinotega's location!",
"input": "",
"output": "```python\nn = int(input())\nhome = input()\nflights = []\ncomesFrom = []\ngoesTo = []\nfor i in range(n):\n flights.append(input())\n goingFrom, comingTo = flights[i].split('->', 1)\n if(goingFrom == home):\n goesTo.append(comingTo)\n \n if(comingTo == home):\n comesFrom.append(goingFrom)\n\nif(len(comesFrom) == len(goesTo)):\n print('Home')\nelse:\n print('Contest')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "First-rate specialists graduate from Berland State Institute of Peace and Friendship. You are one of the most talented students in this university. The education is not easy because you need to have fundamental knowledge in different areas, which sometimes are not related to each other. \n\nFor example, you should know linguistics very well. You learn a structure of Reberland language as foreign language. In this language words are constructed according to the following rules. First you need to choose the \"root\" of the word — some string which has more than 4 letters. Then several strings with the length 2 or 3 symbols are appended to this word. The only restriction — it is not allowed to append the same string twice in a row. All these strings are considered to be suffixes of the word (this time we use word \"suffix\" to describe a morpheme but not the few last characters of the string as you may used to). \n\nHere is one exercise that you have found in your task list. You are given the word *s*. Find all distinct strings with the length 2 or 3, which can be suffixes of this word according to the word constructing rules in Reberland language. \n\nTwo strings are considered distinct if they have different length or there is a position in which corresponding characters do not match. \n\nLet's look at the example: the word *abacabaca* is given. This word can be obtained in the following ways: , where the root of the word is overlined, and suffixes are marked by \"corners\". Thus, the set of possible suffixes for this word is {*aca*,<=*ba*,<=*ca*}.",
"input": "",
"output": "```python\nfrom collections import defaultdict,Counter,deque\nimport math\nimport bisect\nfrom itertools import accumulate\nfrom math import ceil, log,gcd\nfrom functools import lru_cache\nfrom sys import stdin, stdout\n\nimport atexit\nimport io\nimport sys\n\ndef write(*args, **kwargs):\n sep = kwargs.get('sep', ' ')\n end = kwargs.get('end', '\\n')\n stdout.write(sep.join(str(a) for a in args) + end)\n\ndef read():\n return stdin.readline().rstrip()\nimport sys\nimport random\nfrom typing import List\n\n\ndef primes(n):\n if n<=2:\n return []\n sieve=[True]*(n+1)\n for x in range(3,int(n**0.5)+1,2):\n for y in range(3,(n//x)+1,2):\n sieve[(x*y)]=False\n \n return [2]+[i for i in range(3,n,2) if sieve[i]]\n\n\n\ndef prime_factors(n):\n i = 2\n factors = []\n for i in primes(int(n**0.5+1)):\n while n % i == 0:\n n //= i\n factors.append(i)\n if n > 1:\n factors.append(n)\n return factors\n\n\n# x = int(read())\n\n\n\n\n# total = int(read())\n# n,m= ([*map(int, read().split())]) \n\n# d = [{} for i in range(m)]\n\n# p = [0]*n\n# for i in range(m):\n# x = ([*map(int, read().split())]) \n# cur = x[0]\n# for j in x[1:]:\n# d[i][cur] = j\n# cur = j\n# d[i][cur] = -1\n \n\n# cc = 0\n# for i in x:\n# if p[i-1] == 0:\n# c = 1\n# cur = i\n# while True:\n# if cur == -1:\n# break\n# # print(cur,c)\n# cc+=c\n# p[cur-1] = 1\n# n = True\n# t = d[0][cur]\n# for j in range(1,m):\n# # print('!', d[j][cur] ,t)\n# if d[j][cur] != t:\n# n= False\n# # print('!!!')\n# break\n# if n :\n# c+=1\n# cur = d[0][cur]\n# else:\n# break\n \n# print(cc)\n\ns = read()\n\nd = set()\nr = set()\nn = len(s)\nfor i in range(n):\n if i > 5:\n if i!=n-2:\n d.add(s[i-1:i+1])\n if i > 6:\n if i!=n-2:\n d.add(s[i-2:i+1])\n if i+2 < len(s):\n if s[i-1:i+1]==s[i+1:i+3]:\n r.add(s[i-1:i+1])\n if i+3 < len(s):\n if s[i-2:i+1]==s[i+1:i+4]:\n r.add(s[i-2:i+1])\n \nret = [x for x in d if x not in r]\nprint(len(ret))\nfor x in ret:\n print(x)\n\n# total = int(read())\n# x = ([*map(int, read().split())]) \n\n# # total = 10**5\n# # x = sorted([random.randint(1, 10**5) for i in range(total)])\n# mx = 0\n# p = primes(10**5)\n# d= defaultdict(lambda:0)\n# for i in x:\n# # print(i)\n# t = []\n# m = 0\n# p = prime_factors(i)\n# # print(i,p)\n# for j in range(len(p)):\n# if p[j] > i:\n# break\n# if i % p[j] == 0:\n# t.append(j)\n# m = max(m,d[p[j]])\n# for j in t:\n# d[p[j]] = m + 1\n# mx = max(mx,m+1) \n# write(mx) \n\n \n# a= 1 \n\n# b = 1\n\n# for i in range(1,1337):\n# a,b = 4*a +b, a + 2*b\n# a,b = a%1000000007,b%1000000007\n# print((a+b)%1000000007) \n\n\n\n\n\n\n# for _ in range(total):\n# n = int(read())\n \n \n# x = sorted(x)\n \n \n# o = x.count(1)\n# while True:\n# if o ==0:\n# break\n# if not check(o):\n# o-=1\n# else:\n# break\n \n# write(o) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.\n\nThe playing field is a sequence of *n* non-negative integers *a**i* numbered from 1 to *n*. The goal of the game is to make numbers *a*1,<=*a*2,<=...,<=*a**k* (i.e. some prefix of the sequence) equal to zero for some fixed *k* (*k*<=<<=*n*), and this should be done in the smallest possible number of moves.\n\nOne move is choosing an integer *i* (1<=≤<=*i*<=≤<=*n*) such that *a**i*<=><=0 and an integer *t* (*t*<=≥<=0) such that *i*<=+<=2*t*<=≤<=*n*. After the values of *i* and *t* have been selected, the value of *a**i* is decreased by 1, and the value of *a**i*<=+<=2*t* is increased by 1. For example, let *n*<==<=4 and *a*<==<=(1,<=0,<=1,<=2), then it is possible to make move *i*<==<=3, *t*<==<=0 and get *a*<==<=(1,<=0,<=0,<=3) or to make move *i*<==<=1, *t*<==<=1 and get *a*<==<=(0,<=0,<=2,<=2) (the only possible other move is *i*<==<=1, *t*<==<=0).\n\nYou are given *n* and the initial sequence *a**i*. The task is to calculate the minimum number of moves needed to make the first *k* elements of the original sequence equal to zero for each possible *k* (1<=≤<=*k*<=<<=*n*).",
"input": "",
"output": "```python\nimport math\r\nn=int(input())\r\nseq=list(map(int,input().split()))\r\nmove=0\r\n\r\nwhile len(seq)>1:\r\n lenth=len(seq)\r\n while seq[0]!=0:\r\n move+=1\r\n seq[0]-=1\r\n lgint=int(math.log2(lenth-1)//1)\r\n seq[2**lgint]+=1\r\n seq.remove(seq[0])\r\n print(move)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a tetrahedron. Let's mark its vertices with letters *A*, *B*, *C* and *D* correspondingly.\n\nAn ant is standing in the vertex *D* of the tetrahedron. The ant is quite active and he wouldn't stay idle. At each moment of time he makes a step from one vertex to another one along some edge of the tetrahedron. The ant just can't stand on one place.\n\nYou do not have to do much to solve the problem: your task is to count the number of ways in which the ant can go from the initial vertex *D* to itself in exactly *n* steps. In other words, you are asked to find out the number of different cyclic paths with the length of *n* from vertex *D* to itself. As the number can be quite large, you should print it modulo 1000000007 (109<=+<=7).",
"input": "",
"output": "```python\nimport math\r\n \r\nmod=10**9+7\r\nn=int(input())\r\n\r\nd = 0\r\nabc = 3\r\n \r\nfor i in range(2,n+1):\r\n d,abc = abc, 3*d+2*abc\r\n\r\nprint(d%mod)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A and B are preparing themselves for programming contests.\n\nAn important part of preparing for a competition is sharing programming knowledge from the experienced members to those who are just beginning to deal with the contests. Therefore, during the next team training A decided to make teams so that newbies are solving problems together with experienced participants.\n\nA believes that the optimal team of three people should consist of one experienced participant and two newbies. Thus, each experienced participant can share the experience with a large number of people.\n\nHowever, B believes that the optimal team should have two experienced members plus one newbie. Thus, each newbie can gain more knowledge and experience.\n\nAs a result, A and B have decided that all the teams during the training session should belong to one of the two types described above. Furthermore, they agree that the total number of teams should be as much as possible.\n\nThere are *n* experienced members and *m* newbies on the training session. Can you calculate what maximum number of teams can be formed?",
"input": "",
"output": "```python\nn, m = list(map(int, input().split()))\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n cur = i\r\n f = n - i\r\n mn = m - 2 * i\r\n\r\n if mn >= f:\r\n cur += min(mn, f // 2)\r\n ans += max(cur, ans)\r\n\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word *s*. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word *s*.",
"input": "",
"output": "```python\n# 01234\r\nkeyword = \"hello\"\r\nn_keyword = len(keyword)\r\n#keyword[0] == word[0] no\r\n#keyword[0] == word[1] yes\r\n#keyword[1] == word[2] no\r\n#keyword[1] == word[3] yes\r\n#keyword[2] == word[4] yes\r\n#keyword[3] == word[5] yes\r\n#keyword[4] == word[6] no\r\n#keyword[4] == word[7] no\r\n#keyword[4] == word[8] no\r\n#keyword[4] == word[9] yes\r\n#......\r\n#until there is 5 yes\r\n#or until all words have been checked\r\n#if there is no 5 yes then print(\"NO\")\r\n\r\n# 012345678901\r\n#word = \"ahhellllloou\"\r\nword=input()\r\nn_word = len(word)\r\n\r\n#How to do WHILE you need to:\r\n#1. initial counter\r\n#2. ending condition\r\n#3. counter increase/decrease\r\nyes=0\r\ncounter = 0\r\ncounter2 = 0\r\nwhile counter < n_keyword:\r\n while counter2n:\r\n break\r\n vals.append(str(x))\r\nif not vals:\r\n print(-1)\r\nelse:\r\n print(*vals)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Ms Swan bought an orange in a shop. The orange consisted of *n*·*k* segments, numbered with integers from 1 to *n*·*k*. \n\nThere were *k* children waiting for Ms Swan at home. The children have recently learned about the orange and they decided to divide it between them. For that each child took a piece of paper and wrote the number of the segment that he would like to get: the *i*-th (1<=≤<=*i*<=≤<=*k*) child wrote the number *a**i* (1<=≤<=*a**i*<=≤<=*n*·*k*). All numbers *a**i* accidentally turned out to be different.\n\nNow the children wonder, how to divide the orange so as to meet these conditions:\n - each child gets exactly *n* orange segments; - the *i*-th child gets the segment with number *a**i* for sure; - no segment goes to two children simultaneously. \nHelp the children, divide the orange and fulfill the requirements, described above.",
"input": "",
"output": "```python\nn, k = [int(x) for x in input().split(' ')]\r\na = [int(x) for x in input().split(' ')]\r\nb = [i for i in range(1, n * k + 1) if i not in a]\r\n\r\nfor i in range(k):\r\n print(*([a[i]] + b[i*(n-1):(i+1)*(n-1)]))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Johnny has a younger sister Anne, who is very clever and smart. As she came home from the kindergarten, she told his brother about the task that her kindergartener asked her to solve. The task was just to construct a triangle out of four sticks of different colours. Naturally, one of the sticks is extra. It is not allowed to break the sticks or use their partial length. Anne has perfectly solved this task, now she is asking Johnny to do the same.\n\nThe boy answered that he would cope with it without any difficulty. However, after a while he found out that different tricky things can occur. It can happen that it is impossible to construct a triangle of a positive area, but it is possible to construct a degenerate triangle. It can be so, that it is impossible to construct a degenerate triangle even. As Johnny is very lazy, he does not want to consider such a big amount of cases, he asks you to help him.",
"input": "",
"output": "```python\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\nif (a+b>c) and (b+c>a) and (c+a>b):\r\n print(\"TRIANGLE\")\r\nelif (a+b>d) and (a+d>b) and (d+b>a):\r\n print(\"TRIANGLE\")\r\nelif (a+c>d) and (a+d>c) and (d+c>a):\r\n print(\"TRIANGLE\")\r\nelif (b+c>d) and (b+d>c) and (b+c>a):\r\n print(\"TRIANGLE\")\r\nelif (a+b==c) or (b+c==a) or (c+a==b):\r\n print(\"SEGMENT\")\r\nelif (a+b==d) and (a+d==b) and (d+b==a):\r\n print(\"SEGMENT\")\r\nelif (a+c==d) and (a+d==c) and (d+c==a):\r\n print(\"SEGMENT\")\r\nelif (b+c==d) or (b+d==c) or (b+c==a):\r\n print(\"SEGMENT\")\r\nelif (a+b=lowlink[y] and order[y]>=lowlink[x]] for x in range(N)]\r\nseen=[False]*N\r\nfinished=[False]*N\r\nright=[N]*N\r\nfor s in range(N):\r\n if seen[s]:\r\n continue\r\n mi,ma=s,s\r\n stack=[s]\r\n while stack:\r\n x=stack.pop()\r\n if not seen[x]:\r\n seen[x]=True\r\n stack.append(x)\r\n mi=min(mi,x)\r\n ma=max(ma,x)\r\n for y in graph[x]:\r\n if not seen[y]:\r\n stack.append(y)\r\n elif not finished[x]:\r\n finished[x]=True\r\n if mi!=ma:\r\n right[mi]=ma\r\nfor l in range(N-2,-1,-1):\r\n right[l]=min(right[l],right[l+1])\r\nC=[0]+right\r\nfor i in range(1,N+1):\r\n C[i]+=C[i-1]\r\nQ=int(readline())\r\nfor q in range(Q):\r\n L,R=map(int,readline().split())\r\n L-=1\r\n i=max(L,bisect_right(right,R))\r\n ans=C[i]-C[L]+R*(R-i)-(L+R-1)*(R-L)//2\r\n print(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The new \"Die Hard\" movie has just been released! There are *n* people at the cinema box office standing in a huge line. Each of them has a single 100, 50 or 25 ruble bill. A \"Die Hard\" ticket costs 25 rubles. Can the booking clerk sell a ticket to each person and give the change if he initially has no money and sells the tickets strictly in the order people follow in the line?",
"input": "",
"output": "```python\nn = int(input())\r\n\r\nmoney = [int(i) for i in input().split()]\r\n\r\nstored = 0\r\n\r\nflag = True\r\n\r\nfor i in range(n):\r\n change = money[i] - 25\r\n if stored >= 0 and change > 0:\r\n stored = stored - change\r\n if stored < 0:\r\n flag = False\r\n break\r\n stored += 25\r\n\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Theatre Square in the capital city of Berland has a rectangular shape with the size *n*<=×<=*m* meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size *a*<=×<=*a*.\n\nWhat is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.",
"input": "",
"output": "```python\nm,n,a= map(int,input().split())\r\nM = 0\r\nN = 0\r\nif m % a == 0:\r\n M = m // a\r\nelse:\r\n M = (n // a) +1\r\nif n % a == 0:\r\n N = n // a\r\nelse:\r\n N = (n // a) +1\r\nprint(M*N)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day *n* friends gathered together to play \"Mafia\". During each round of the game some player must be the supervisor and other *n*<=-<=1 people take part in the game. For each person we know in how many rounds he wants to be a player, not the supervisor: the *i*-th person wants to play *a**i* rounds. What is the minimum number of rounds of the \"Mafia\" game they need to play to let each person play at least as many rounds as they want?",
"input": "",
"output": "```python\nn,s = int(input()) - 1,list(map(int,input().split()))\r\nprint(max(int(sum(s) / n + 0.5),max(s)))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Luke Skywalker got locked up in a rubbish shredder between two presses. R2D2 is already working on his rescue, but Luke needs to stay alive as long as possible. For simplicity we will assume that everything happens on a straight line, the presses are initially at coordinates 0 and *L*, and they move towards each other with speed *v*1 and *v*2, respectively. Luke has width *d* and is able to choose any position between the presses. Luke dies as soon as the distance between the presses is less than his width. Your task is to determine for how long Luke can stay alive.",
"input": "",
"output": "```python\nl,d,v1,v2=map(int,input().split())\r\nv=v1+v2\r\na=v\r\nx=d-l\r\nif(v-x>19995):\r\n\tv=2000\r\n\r\nans=str(x/v).split(\".\")\r\n\r\nif(a-x>19995):\r\n\tans[1]=\"0\"+ans[1]+\"0\"*(19-len(ans[1]))\r\n\tprint(ans[1])\r\nelse:\r\n\tans[1]=ans[1]+\"0\"*(20-len(ans[1]))\r\nprint(\".\".join(ans))\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word *s*. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word *s*.",
"input": "",
"output": "```python\nx=input().lower()\r\ns=[]\r\nhello=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nif len(x)>5:\r\n for i in x:\r\n for j in hello:\r\n if j==i:\r\n s.append(i)\r\n if len(s)<5:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A soldier wants to buy *w* bananas in the shop. He has to pay *k* dollars for the first banana, 2*k* dollars for the second one and so on (in other words, he has to pay *i*·*k* dollars for the *i*-th banana). \n\nHe has *n* dollars. How many dollars does he have to borrow from his friend soldier to buy *w* bananas?",
"input": "",
"output": "```python\ncost = 0\r\nk, n, w = map(int, input().split())\r\nfor i in range(1 , w+1):\r\n cost += i*k\r\nprint(cost-n) if cost > n else print(0)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In some game by Playrix it takes *t* minutes for an oven to bake *k* carrot cakes, all cakes are ready at the same moment *t* minutes after they started baking. Arkady needs at least *n* cakes to complete a task, but he currently don't have any. However, he has infinitely many ingredients and one oven. Moreover, Arkady can build one more similar oven to make the process faster, it would take *d* minutes to build the oven. While the new oven is being built, only old one can bake cakes, after the new oven is built, both ovens bake simultaneously. Arkady can't build more than one oven.\n\nDetermine if it is reasonable to build the second oven, i.e. will it decrease the minimum time needed to get *n* cakes or not. If the time needed with the second oven is the same as with one oven, then it is unreasonable.",
"input": "",
"output": "```python\nfrom math import ceil\r\nn, t, k, d = map(int, input().split())\r\ntotal_time = ceil(n / k) * t\r\nif total_time > t + d:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed *w* kilos. They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem.\n\nPete and Billy are great fans of even numbers, that's why they want to divide the watermelon in such a way that each of the two parts weighs even number of kilos, at the same time it is not obligatory that the parts are equal. The boys are extremely tired and want to start their meal as soon as possible, that's why you should help them and find out, if they can divide the watermelon in the way they want. For sure, each of them should get a part of positive weight.",
"input": "",
"output": "```python\nw=int(input('no'))\r\nassert 1<=w<=100\r\nfor i in range(2,w,2):\r\n if (w-i)%2==0:\r\n return YES\r\nreturn NO\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "It's one more school day now. Sasha doesn't like classes and is always bored at them. So, each day he invents some game and plays in it alone or with friends.\n\nToday he invented one simple game to play with Lena, with whom he shares a desk. The rules are simple. Sasha draws *n* sticks in a row. After that the players take turns crossing out exactly *k* sticks from left or right in each turn. Sasha moves first, because he is the inventor of the game. If there are less than *k* sticks on the paper before some turn, the game ends. Sasha wins if he makes strictly more moves than Lena. Sasha wants to know the result of the game before playing, you are to help him.",
"input": "",
"output": "```python\nn,k = map(int,input().split());s=0;t=0\r\nif (n == 1 and k != 1) or (n == 1 and k == 1):\r\n print(\"YES\")\r\n exit()\r\nelse:\r\n while n - k > t:\r\n t+=k\r\n s+=1\r\n if s % 2 == 0:\r\n print(\"NO\")\r\n elif s % 2 != 0:\r\n print(\"YES\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A large banner with word CODEFORCES was ordered for the 1000-th onsite round of Codeforcesω that takes place on the Miami beach. Unfortunately, the company that made the banner mixed up two orders and delivered somebody else's banner that contains someone else's word. The word on the banner consists only of upper-case English letters.\n\nThere is very little time to correct the mistake. All that we can manage to do is to cut out some substring from the banner, i.e. several consecutive letters. After that all the resulting parts of the banner will be glued into a single piece (if the beginning or the end of the original banner was cut out, only one part remains); it is not allowed change the relative order of parts of the banner (i.e. after a substring is cut, several first and last letters are left, it is allowed only to glue the last letters to the right of the first letters). Thus, for example, for example, you can cut a substring out from string 'TEMPLATE' and get string 'TEMPLE' (if you cut out string AT), 'PLATE' (if you cut out TEM), 'T' (if you cut out EMPLATE), etc.\n\nHelp the organizers of the round determine whether it is possible to cut out of the banner some substring in such a way that the remaining parts formed word CODEFORCES.",
"input": "",
"output": "```python\n## 2 - version\r\nimport re\r\n\r\ns=input()\r\n\r\nif re.search('C.*O.*D.*E.*F.*O.*R.*C.*E.*S',s):\r\n print('YES')\r\nelse:\r\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Xenia the beginner mathematician is a third year student at elementary school. She is now learning the addition operation.\n\nThe teacher has written down the sum of multiple numbers. Pupils should calculate the sum. To make the calculation easier, the sum only contains numbers 1, 2 and 3. Still, that isn't enough for Xenia. She is only beginning to count, so she can calculate a sum only if the summands follow in non-decreasing order. For example, she can't calculate sum 1+3+2+1 but she can calculate sums 1+1+2 and 3+3.\n\nYou've got the sum that was written on the board. Rearrange the summans and print the sum in such a way that Xenia can calculate the sum.",
"input": "",
"output": "```python\ns=input()\r\nsummands=list(map(int,input().split()))\r\nsorted_summands=sorted(summands)\r\nnew_sum=\"+\".join(map(str,sorted_summands))\r\nprint(new_sum)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.\n\nOne day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.\n\nIn his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The *i*-th digit of the answer is 1 if and only if the *i*-th digit of the two given numbers differ. In the other case the *i*-th digit of the answer is 0.\n\nShapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.\n\nNow you are going to take part in Shapur's contest. See if you are faster and more accurate.",
"input": "",
"output": "```python\nimport sys \n \nn1 = sys.stdin.readline().strip(\"\\n\")\nn2= sys.stdin.readline().strip(\"\\n\") \n \n \ni =0 \nr =\"\" \nwhile i < len(n1): \n r+=str(int(n1[i])^ int(n2[i])) \n i += 1 \n \nprint(r) \n \t \t\t \t\t\t \t \t \t \t \t\t\t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* cards (*n* is even) in the deck. Each card has a positive integer written on it. *n*<=/<=2 people will play new card game. At the beginning of the game each player gets two cards, each card is given to exactly one player. \n\nFind the way to distribute cards such that the sum of values written of the cards will be equal for each player. It is guaranteed that it is always possible.",
"input": "",
"output": "```python\nclass Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\tdef solve(self):\r\n\t\tn = int(input())\r\n\t\tarr = list(map(int, input().split()))\r\n\t\teach = 2*sum(arr)//n\t\t\r\n\t\tresult = \"\"\r\n\r\n\t\tfor i in range(n - 1):\r\n\t\t\tif arr[i] != 0:\r\n\t\t\t\tfor j in range(i+1, n):\r\n\t\t\t\t\tif arr[j] + arr[i] == each:\r\n\t\t\t\t\t\tresult += \"{} {}\\n\".format(i + 1, j + 1)\r\n\t\t\t\t\t\tbreak\r\n\r\n\t\tprint(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best choice. The main argument in favor of choosing Java was that it has a very large integer data type, called BigInteger.\n\nBut having attended several classes of the club, Petya realized that not all tasks require using the BigInteger type. It turned out that in some tasks it is much easier to use small data types. That's why a question arises: \"Which integer type to use if one wants to store a positive integer *n*?\"\n\nPetya knows only 5 integer types:\n\n1) byte occupies 1 byte and allows you to store numbers from <=-<=128 to 127\n\n2) short occupies 2 bytes and allows you to store numbers from <=-<=32768 to 32767\n\n3) int occupies 4 bytes and allows you to store numbers from <=-<=2147483648 to 2147483647\n\n4) long occupies 8 bytes and allows you to store numbers from <=-<=9223372036854775808 to 9223372036854775807\n\n5) BigInteger can store any integer number, but at that it is not a primitive type, and operations with it are much slower.\n\nFor all the types given above the boundary values are included in the value range.\n\nFrom this list, Petya wants to choose the smallest type that can store a positive integer *n*. Since BigInteger works much slower, Peter regards it last. Help him.",
"input": "",
"output": "```python\nn = int(input())\r\nsections = [int(i) for i in input().split()]\r\n\r\nmaximal = 0\r\nfor i in range(n):\r\n counter = 0\r\n for j in range(i, -1, -1):\r\n if sections[j] > sections[i]:\r\n break\r\n counter += 1\r\n for j in range(i + 1, n):\r\n if sections[j] > sections[i]:\r\n break\r\n counter += 1\r\n if counter > maximal:\r\n maximal = counter\r\n\r\nprint(maximal)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a square painted on a piece of paper, the square's side equals *n* meters. John Doe draws crosses on the square's perimeter. John paints the first cross in the lower left corner of the square. Then John moves along the square's perimeter in the clockwise direction (first upwards, then to the right, then downwards, then to the left and so on). Every time he walks (*n*<=+<=1) meters, he draws a cross (see picture for clarifications).\n\nJohn Doe stops only when the lower left corner of the square has two crosses. How many crosses will John draw?",
"input": "",
"output": "```python\nn=int(input())\r\nfor i in range(n):\r\n t=int(input())\r\n print(4*t+1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a \"crime\" and find out what is happening. He can ask any questions whatsoever that can be answered with \"Yes\" or \"No\". All the rest agree beforehand to answer the questions like that: if the question’s last letter is a vowel, they answer \"Yes\" and if the last letter is a consonant, they answer \"No\". Of course, the sleuth knows nothing about it and his task is to understand that.\n\nUnfortunately, Vasya is not very smart. After 5 hours of endless stupid questions everybody except Vasya got bored. That’s why Vasya’s friends ask you to write a program that would give answers instead of them.\n\nThe English alphabet vowels are: A, E, I, O, U, Y\n\nThe English alphabet consonants are: B, C, D, F, G, H, J, K, L, M, N, P, Q, R, S, T, V, W, X, Z",
"input": "",
"output": "```python\nn=input()\r\nn=n[::-1]\r\nv=['A','E','I','O','U','Y','a','e','i','o','u','y']\r\nfor i in range(len(n)):\r\n if n[i]!='' and n[i]!='?':\r\n if n[i] in v:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n break\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The developers of Looksery have to write an efficient algorithm that detects faces on a picture. Unfortunately, they are currently busy preparing a contest for you, so you will have to do it for them. \n\nIn this problem an image is a rectangular table that consists of lowercase Latin letters. A face on the image is a 2<=×<=2 square, such that from the four letters of this square you can make word \"face\". \n\nYou need to write a program that determines the number of faces on the image. The squares that correspond to the faces can overlap.",
"input": "",
"output": "```python\n#!/usr/bin/env python3.4\n\nn, m = map(int, input().split())\nboard = []\nfor i in range(n):\n board.append(input())\nok_set = set(['f', 'a', 'c', 'e'])\nans = 0\nfor i in range(n - 1):\n for j in range(m - 1):\n cur_set = set([board[i][j], board[i][j + 1], board[i + 1][j], board[i + 1][j + 1]])\n if cur_set == ok_set:\n ans += 1\nprint(ans)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Theatre Square in the capital city of Berland has a rectangular shape with the size *n*<=×<=*m* meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size *a*<=×<=*a*.\n\nWhat is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.",
"input": "",
"output": "```python\nl = list(map(int,input().split()))\r\nx = l[1]%l[2]\r\ny = l[0]%l[2]\r\na = (l[0]+y)//l[2]\r\nb = (l[1]+x)//l[2]\r\n\r\nprint(a*b)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mr. Funt now lives in a country with a very specific tax laws. The total income of mr. Funt during this year is equal to *n* (*n*<=≥<=2) burles and the amount of tax he has to pay is calculated as the maximum divisor of *n* (not equal to *n*, of course). For example, if *n*<==<=6 then Funt has to pay 3 burles, while for *n*<==<=25 he needs to pay 5 and if *n*<==<=2 he pays only 1 burle.\n\nAs mr. Funt is a very opportunistic person he wants to cheat a bit. In particular, he wants to split the initial *n* in several parts *n*1<=+<=*n*2<=+<=...<=+<=*n**k*<==<=*n* (here *k* is arbitrary, even *k*<==<=1 is allowed) and pay the taxes for each part separately. He can't make some part equal to 1 because it will reveal him. So, the condition *n**i*<=≥<=2 should hold for all *i* from 1 to *k*.\n\nOstap Bender wonders, how many money Funt has to pay (i.e. minimal) if he chooses and optimal way to split *n* in parts.",
"input": "",
"output": "```python\nimport sys\r\nimport math \r\n\r\ndef isprime(n):\r\n if n == 1:\r\n return False\r\n if n == 2:\r\n return True\r\n if n == 3:\r\n return True\r\n if (n % 2 == 0) or (n % 3 == 0):\r\n return False\r\n for i in range(5, int(math.sqrt(n))+1, 6):\r\n if (n % i == 0) or (n % (i + 2)) == 0:\r\n return False\r\n return True\r\n\r\ndef answer(n):\r\n if isprime(n):\r\n return 1\r\n if n % 2 == 0:\r\n return 2\r\n if isprime(n-2):\r\n return 2\r\n else:\r\n return 3\r\n\r\ndef main():\r\n n = int(sys.stdin.readline())\r\n print(answer(n))\r\n return\r\nmain()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Daniel is organizing a football tournament. He has come up with the following tournament format: \n 1. In the first several (possibly zero) stages, while the number of teams is even, they split in pairs and play one game for each pair. At each stage the loser of each pair is eliminated (there are no draws). Such stages are held while the number of teams is even. 1. Eventually there will be an odd number of teams remaining. If there is one team remaining, it will be declared the winner, and the tournament ends. Otherwise each of the remaining teams will play with each other remaining team once in round robin tournament (if there are *x* teams, there will be games), and the tournament ends. \nFor example, if there were 20 teams initially, they would begin by playing 10 games. So, 10 teams would be eliminated, and the remaining 10 would play 5 games. Then the remaining 5 teams would play 10 games in a round robin tournament. In total there would be 10+5+10=25 games.\n\nDaniel has already booked the stadium for *n* games. Help him to determine how many teams he should invite so that the tournament needs exactly *n* games. You should print all possible numbers of teams that will yield exactly *n* games in ascending order, or -1 if there are no such numbers.",
"input": "",
"output": "```python\nn, out, po = int(input()), set(), 1\r\nfor x in range(64):\r\n be, en = 1, 2 * 10 ** 9\r\n while be <= en:\r\n md = (be + en) >> 1\r\n val = md * (po - 1) + md * (md - 1) // 2\r\n\r\n if val < n:\r\n be = md + 1\r\n elif val == n:\r\n out.add(po * md)\r\n break\r\n else:\r\n en = md - 1\r\n po <<= 1\r\n\r\nif not out:\r\n exit(print(-1))\r\nprint('\\n'.join(map(str, sorted(out))))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Johny likes numbers *n* and *k* very much. Now Johny wants to find the smallest integer *x* greater than *n*, so it is divisible by the number *k*.",
"input": "",
"output": "```python\nn=list(map(int,input().split()))\r\ns=1\r\nwhile(True):\r\n n[0]=n[0]+1\r\n if(n[0]%n[1]==0):\r\n print(n[0])\r\n break\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any longer, so he decided to get some food in the house.\n\nKarlsson's gaze immediately fell on *n* wooden cupboards, standing in the kitchen. He immediately realized that these cupboards have hidden jam stocks. Karlsson began to fly greedily around the kitchen, opening and closing the cupboards' doors, grab and empty all the jars of jam that he could find.\n\nAnd now all jars of jam are empty, Karlsson has had enough and does not want to leave traces of his stay, so as not to let down his friend. Each of the cupboards has two doors: the left one and the right one. Karlsson remembers that when he rushed to the kitchen, all the cupboards' left doors were in the same position (open or closed), similarly, all the cupboards' right doors were in the same position (open or closed). Karlsson wants the doors to meet this condition as well by the time the family returns. Karlsson does not remember the position of all the left doors, also, he cannot remember the position of all the right doors. Therefore, it does not matter to him in what position will be all left or right doors. It is important to leave all the left doors in the same position, and all the right doors in the same position. For example, all the left doors may be closed, and all the right ones may be open.\n\nKarlsson needs one second to open or close a door of a cupboard. He understands that he has very little time before the family returns, so he wants to know the minimum number of seconds *t*, in which he is able to bring all the cupboard doors in the required position.\n\nYour task is to write a program that will determine the required number of seconds *t*.",
"input": "",
"output": "```python\ncount = 0\r\nwcount = 0\r\nfor i in range(int(input())):\r\n a , b = map(int,input().split())\r\n if (a == 0 and b == 0) or (a == 1 and b == 1):\r\n count += 1\r\n else:\r\n wcount += 1\r\nprint(wcount)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Misha and Andrew were playing a very simple game. First, each player chooses an integer in the range from 1 to *n*. Let's assume that Misha chose number *m*, and Andrew chose number *a*.\n\nThen, by using a random generator they choose a random integer *c* in the range between 1 and *n* (any integer from 1 to *n* is chosen with the same probability), after which the winner is the player, whose number was closer to *c*. The boys agreed that if *m* and *a* are located on the same distance from *c*, Misha wins.\n\nAndrew wants to win very much, so he asks you to help him. You know the number selected by Misha, and number *n*. You need to determine which value of *a* Andrew must choose, so that the probability of his victory is the highest possible.\n\nMore formally, you need to find such integer *a* (1<=≤<=*a*<=≤<=*n*), that the probability that is maximal, where *c* is the equiprobably chosen integer from 1 to *n* (inclusive).",
"input": "",
"output": "```python\nn,m=map(int,input().split(' '))\nif(m==1):\n if(n==1):print(1)\n else:print(2)\nelif(m==n):print(n-1)\nelse:\n if(m-1>=n-m):print(m-1)\n else:print(n-m)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya collects coins: he has exactly one coin for every year from 1 to *n*. Naturally, Vasya keeps all the coins in his collection in the order in which they were released. Once Vasya's younger brother made a change — he took all the coins whose release year dated from *l* to *r* inclusively and put them in the reverse order. That is, he took a certain segment [*l*,<=*r*] and reversed it. At that the segment's endpoints did not coincide. For example, if *n*<==<=8, then initially Vasya's coins were kept in the order 1 2 3 4 5 6 7 8. If Vasya's younger brother chose the segment [2,<=6], then after the reversal the coin order will change to 1 6 5 4 3 2 7 8. Vasya suspects that someone else could have spoilt the permutation after his brother. Help him to find that out. Check if the given permutation can be obtained from the permutation 1 2 ... *n* using exactly one segment reversal. If it is possible, find the segment itself.",
"input": "",
"output": "```python\nn=int(input());A=list(map(int,input().split()));B=A.copy();B.sort();C=[]\r\nif A==B:print(0,0)\r\nelse:\r\n left=0;right=0\r\n for i in range(n):\r\n if A[i]!=B[i]:\r\n C.append(abs(A[i]-B[i]))\r\n if A[i]==B[i] and right==0:left=i+2\r\n elif A[i]!=B[i]:right=i+1\r\n if C==C[::-1]:print(left,right)\r\n else:print(0,0)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After a team finished their training session on Euro football championship, Valeric was commissioned to gather the balls and sort them into baskets. Overall the stadium has *n* balls and *m* baskets. The baskets are positioned in a row from left to right and they are numbered with numbers from 1 to *m*, correspondingly. The balls are numbered with numbers from 1 to *n*.\n\nValeric decided to sort the balls in the order of increasing of their numbers by the following scheme. He will put each new ball in the basket with the least number of balls. And if he's got several variants, he chooses the basket which stands closer to the middle. That means that he chooses the basket for which is minimum, where *i* is the number of the basket. If in this case Valeric still has multiple variants, he chooses the basket with the minimum number.\n\nFor every ball print the number of the basket where it will go according to Valeric's scheme.\n\nNote that the balls are sorted into baskets in the order of increasing numbers, that is, the first ball goes first, then goes the second ball and so on.",
"input": "",
"output": "```python\nn,m = map(int,input().split())\r\nmid = (m+1)//2\r\nlst = [0]*m\r\nlst[0] = mid\r\np = 1\r\nfor i in range(1,mid):\r\n lst[p] = mid-i\r\n lst[p+1] = mid+1\r\n p += 2\r\nif m%2==0:\r\n lst[n-1] = m\r\nx = n//m\r\nv = n-x*m\r\nlst *= x\r\nlst.extend(lst[:v])\r\nprint(*lst)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) reversely. For example, a Berlandish word code corresponds to a Birlandish word edoc. However, it's easy to make a mistake during the «translation». Vasya translated word *s* from Berlandish into Birlandish as *t*. Help him: find out if he translated the word correctly.",
"input": "",
"output": "```python\ns=input()\nt=list(reversed(list(input())))\nfor letter_s,letter_t in zip(s,t):\n if letter_s!=letter_t:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number *n*. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that *n* is the answer to the arithmetic task for first-graders. In the textbook, a certain positive integer *x* was given. The task was to add *x* to the sum of the digits of the number *x* written in decimal numeral system.\n\nSince the number *n* on the board was small, Vova quickly guessed which *x* could be in the textbook. Now he wants to get a program which will search for arbitrary values of the number *n* for all suitable values of *x* or determine that such *x* does not exist. Write such a program for Vova.",
"input": "",
"output": "```python\nn=int(input())\r\noutput=[]\r\nfor i in range(1,101):\r\n listi=list(map(int,str(i)))\r\n if(i+sum(listi)==n):\r\n output.append(i)\r\nprint(len(output))\r\nfor i in range(len(output)):\r\n print(output[i])\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Duff is addicted to meat! Malek wants to keep her happy for *n* days. In order to be happy in *i*-th day, she needs to eat exactly *a**i* kilograms of meat.\n\nThere is a big shop uptown and Malek wants to buy meat for her from there. In *i*-th day, they sell meat for *p**i* dollars per kilogram. Malek knows all numbers *a*1,<=...,<=*a**n* and *p*1,<=...,<=*p**n*. In each day, he can buy arbitrary amount of meat, also he can keep some meat he has for the future.\n\nMalek is a little tired from cooking meat, so he asked for your help. Help him to minimize the total money he spends to keep Duff happy for *n* days.",
"input": "",
"output": "```python\nn = int(input())\r\nm = []\r\np = []\r\nfor i in range(n):\r\n mi, pi = map(int, input().split())\r\n m.append(mi)\r\n p.append(pi)\r\nans = 0\r\nminp = p[0]\r\nfor i in range(n):\r\n minp = min(p[i], minp)\r\n ans += m[i]* minp\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be *n* problems, sorted by difficulty, i.e. problem 1 is the easiest and problem *n* is the hardest. Limak knows it will take him 5·*i* minutes to solve the *i*-th problem.\n\nLimak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs *k* minutes to get there from his house, where he will participate in the contest first.\n\nHow many problems can Limak solve if he wants to make it to the party?",
"input": "",
"output": "```python\nx,y=map(int,input().split())\r\nc=240-y\r\np,q=0,0\r\nwhile (c-p-5)>=0 and x>0:\r\n p+=5\r\n q+=1\r\n x-=1\r\n c-=p\r\nprint(e)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Devu is a dumb guy, his learning curve is very slow. You are supposed to teach him *n* subjects, the *i**th* subject has *c**i* chapters. When you teach him, you are supposed to teach all the chapters of a subject continuously.\n\nLet us say that his initial per chapter learning power of a subject is *x* hours. In other words he can learn a chapter of a particular subject in *x* hours.\n\nWell Devu is not complete dumb, there is a good thing about him too. If you teach him a subject, then time required to teach any chapter of the next subject will require exactly 1 hour less than previously required (see the examples to understand it more clearly). Note that his per chapter learning power can not be less than 1 hour.\n\nYou can teach him the *n* subjects in any possible order. Find out minimum amount of time (in hours) Devu will take to understand all the subjects and you will be free to do some enjoying task rather than teaching a dumb guy.\n\nPlease be careful that answer might not fit in 32 bit data type.",
"input": "",
"output": "```python\nn,x=map(int,input().split())\r\nw=sorted(list(map(int,input().split())))\r\ns,i=0,0\r\nwhile True:\r\n s+=(w[i]*x)\r\n if x>1:\r\n x-=1\r\n i+=1\r\n if i==n:\r\n break\r\nprint (s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "PolandBall is a young, clever Ball. He is interested in prime numbers. He has stated a following hypothesis: \"There exists such a positive integer *n* that for each positive integer *m* number *n*·*m*<=+<=1 is a prime number\".\n\nUnfortunately, PolandBall is not experienced yet and doesn't know that his hypothesis is incorrect. Could you prove it wrong? Write a program that finds a counterexample for any *n*.",
"input": "",
"output": "```python\nval=int(input())\nif (val % 2 == 0):\n print(2)\nelse:\n print(1)\n\t\t \t \t \t \t \t \t \t\t\t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a graph with $n$ nodes and $m$ directed edges. One lowercase letter is assigned to each node. We define a path's value as the number of the most frequently occurring letter. For example, if letters on a path are \"abaca\", then the value of that path is $3$. Your task is find a path whose value is the largest.",
"input": "",
"output": "```python\nfrom collections import deque, defaultdict\r\n\r\nn, m = map(int, input().split())\r\nletters = input().strip()\r\ngraph = defaultdict(list)\r\nindegree = [0] * n\r\nq = deque([])\r\nmat = [[0] * 26 for _ in range(n)]\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n graph[x-1].append(y-1)\r\n indegree[y-1] += 1\r\n\r\nfor i in range(n):\r\n if indegree[i] == 0:\r\n q.append(i)\r\ncnt = 0\r\nwhile q:\r\n cur = q.popleft()\r\n cnt += 1\r\n mat[cur][ord(letters[cur]) - ord('a')] += 1\r\n for nei in graph[cur]:\r\n for j in range(26):\r\n mat[nei][j] = max(mat[nei][j], mat[cur][j])\r\n indegree[nei] -= 1\r\n if indegree[nei] == 0:\r\n q.append(nei)\r\nif cnt != n:\r\n print(-1)\r\n exit(0)\r\nans = 0\r\nfor i in range(len(mat)):\r\n for j in range(26):\r\n ans = max(ans, mat[i][j])\r\nprint(ans)\r\n \r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mishka is a little polar bear. As known, little bears loves spending their free time playing dice for chocolates. Once in a wonderful sunny morning, walking around blocks of ice, Mishka met her friend Chris, and they started playing the game.\n\nRules of the game are very simple: at first number of rounds *n* is defined. In every round each of the players throws a cubical dice with distinct numbers from 1 to 6 written on its faces. Player, whose value after throwing the dice is greater, wins the round. In case if player dice values are equal, no one of them is a winner.\n\nIn average, player, who won most of the rounds, is the winner of the game. In case if two players won the same number of rounds, the result of the game is draw.\n\nMishka is still very little and can't count wins and losses, so she asked you to watch their game and determine its result. Please help her!",
"input": "",
"output": "```python\nn = int(input())\r\nm = 0\r\nc = 0\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n if x>y:\r\n m = m+1\r\n elif xc):\r\n print(\"Mishka\")\r\nelif m=uppercount):\r\n a=a.lower()\r\nelse:\r\n a=a.upper()\r\nprint(a)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You've got a rectangular parallelepiped with integer edge lengths. You know the areas of its three faces that have a common vertex. Your task is to find the sum of lengths of all 12 edges of this parallelepiped.",
"input": "",
"output": "```python\nl = list(map(int, input().split()))\r\n\r\na = int(((l[0]*l[2])//l[1])**0.5)\r\nb = int(((l[0]*l[1])//l[2])**0.5)\r\nc = int(((l[1]*l[2])//l[0])**0.5)\r\n\r\nprint(4*(a+b+c))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Theatre Square in the capital city of Berland has a rectangular shape with the size *n*<=×<=*m* meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size *a*<=×<=*a*.\n\nWhat is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.",
"input": "",
"output": "```python\nn, m, a = map(int, input().split())\r\nside1 = n % a\r\nside2 = m % a\r\nif side1 != 0:\r\n val1 = n // a + 1\r\nelse:\r\n val1 = n // a\r\nif side2 != 0:\r\n val2 = m // a + 1\r\nelse:\r\n val2 = m // a \r\nprint(val1 * val2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Permutation *p* is an ordered set of integers *p*1,<=<=<=*p*2,<=<=<=...,<=<=<=*p**n*, consisting of *n* distinct positive integers not larger than *n*. We'll denote as *n* the length of permutation *p*1,<=<=<=*p*2,<=<=<=...,<=<=<=*p**n*.\n\nYour task is to find such permutation *p* of length *n*, that the group of numbers |*p*1<=-<=*p*2|,<=|*p*2<=-<=*p*3|,<=...,<=|*p**n*<=-<=1<=-<=*p**n*| has exactly *k* distinct elements.",
"input": "",
"output": "```python\nn, k = map(int, input().split(' '))\r\no = n - k\r\nprint(1, end = ' ')\r\nfor i in range(2, o + 1):\r\n print(i, end = ' ')\r\nmb = n\r\nmm = o + 1\r\nwhile mb >= mm:\r\n print(mb, end = ' ')\r\n mb -= 1\r\n if mb >= mm:\r\n print(mm, end = ' ')\r\n mm += 1\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he organized a New Year party at his place and invited *n* his friends there.\n\nIf there's one thing Petya likes more that receiving gifts, that's watching others giving gifts to somebody else. Thus, he safely hid the laptop until the next New Year and made up his mind to watch his friends exchanging gifts while he does not participate in the process. He numbered all his friends with integers from 1 to *n*. Petya remembered that a friend number *i* gave a gift to a friend number *p**i*. He also remembered that each of his friends received exactly one gift.\n\nNow Petya wants to know for each friend *i* the number of a friend who has given him a gift.",
"input": "",
"output": "```python\nn=int(input())\r\np=list(map(int,input().split()))\r\ns=list(range(1,101))\r\nv=[]\r\nfor i in range(n):\r\n c=p.index(min(p))\r\n v.append(s[c])\r\n p[c]=10000\r\nprint(*v)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.\n\nHe bought *n* pieces of jewelry. The *i*-th piece has price equal to *i*<=+<=1, that is, the prices of the jewelry are 2,<=3,<=4,<=... *n*<=+<=1.\n\nWatson gave Sherlock a challenge to color these jewelry pieces such that two pieces don't have the same color if the price of one piece is a prime divisor of the price of the other piece. Also, Watson asked him to minimize the number of different colors used.\n\nHelp Sherlock complete this trivial task.",
"input": "",
"output": "```python\nn=int(input())\nisp=[1]*(n+2)\nisp[1]=2\nfor i in range(2,n+2):\n\tif isp[i]==1:\n\t\tfor j in range(i*i,n+2,i):\n\t\t\tisp[i]=2\nprint(1 if n<=2 else 2)\nprint(' '.join(str(isp[i]) for i in range(2,n+2)))\n\t \t\t \t\t\t \t\t \t\t \t \t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given the current time in 24-hour format hh:mm. Find and print the time after *a* minutes.\n\nNote that you should find only the time after *a* minutes, see the examples to clarify the problem statement.\n\nYou can read more about 24-hour format here [https://en.wikipedia.org/wiki/24-hour_clock](https://en.wikipedia.org/wiki/24-hour_clock).",
"input": "",
"output": "```python\na,b=map(int,input().split(\":\"))\r\nz=int(input())\r\nk=z//60;z=z%60\r\na=(a+k)%24\r\nif b+z>59:\r\n a=(a+1)%24;b=(b+z)%60\r\nelse:b+=z\r\na=str(a);b=str(b)\r\nif len(a)==1:a=\"0\"+a\r\nif len(b)==1:b=\"0\"+b\r\nprint(a+\":\"+b)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The School №0 of the capital of Berland has *n* children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each child we know value *t**i*:\n - *t**i*<==<=1, if the *i*-th child is good at programming, - *t**i*<==<=2, if the *i*-th child is good at maths, - *t**i*<==<=3, if the *i*-th child is good at PE \nEach child happens to be good at exactly one of these three subjects.\n\nThe Team Scientific Decathlon Olympias requires teams of three students. The school teachers decided that the teams will be composed of three children that are good at different subjects. That is, each team must have one mathematician, one programmer and one sportsman. Of course, each child can be a member of no more than one team.\n\nWhat is the maximum number of teams that the school will be able to present at the Olympiad? How should the teams be formed for that?",
"input": "",
"output": "```python\nn = int(input())\r\nt = list(map(int, input().split()))\r\none = []\r\ntwo = []\r\nthree = []\r\n\r\nfor i in range(n):\r\n if t[i] == 1:\r\n one.append(i+1)\r\n elif t[i] == 2:\r\n two.append(i+1)\r\n else:\r\n three.append(i+1)\r\n\r\nminNumAmnt = min(len(one), len(two), len(three))\r\nprint(minNumAmnt)\r\nfor i in range(minNumAmnt):\r\n print(f\"{one[i]} {two[i]} {three[i]}\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Theatre Square in the capital city of Berland has a rectangular shape with the size *n*<=×<=*m* meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size *a*<=×<=*a*.\n\nWhat is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.",
"input": "",
"output": "```python\na,s,d=list(map(int,input().split()))\r\nq=a*s\r\nw=d*d\r\nif(q%w==0):\r\n print(int(q/w))\r\nelse:\r\n print(q%w)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Iahub is very proud of his recent discovery, propagating trees. Right now, he invented a new tree, called xor-tree. After this new revolutionary discovery, he invented a game for kids which uses xor-trees.\n\nThe game is played on a tree having *n* nodes, numbered from 1 to *n*. Each node *i* has an initial value *init**i*, which is either 0 or 1. The root of the tree is node 1.\n\nOne can perform several (possibly, zero) operations on the tree during the game. The only available type of operation is to pick a node *x*. Right after someone has picked node *x*, the value of node *x* flips, the values of sons of *x* remain the same, the values of sons of sons of *x* flips, the values of sons of sons of sons of *x* remain the same and so on.\n\nThe goal of the game is to get each node *i* to have value *goal**i*, which can also be only 0 or 1. You need to reach the goal of the game by using minimum number of operations.",
"input": "",
"output": "```python\n'''input\n10\n2 1\n3 1\n4 2\n5 1\n6 2\n7 5\n8 6\n9 8\n10 5\n1 0 1 1 0 1 0 1 0 1\n1 0 1 0 0 1 1 1 0 1\n'''\n\nfrom sys import stdin, setrecursionlimit\nfrom collections import defaultdict\nsetrecursionlimit(15000)\n\n\ndef counter(num):\n\tif num == 0:\n\t\treturn 1\n\telse:\n\t\treturn 0\n\n\ndef flip_me(original, count, index):\n\tif count % 2 == 0:\n\t\treturn original[index]\n\telse:\n\t\treturn counter(original[index])\n\n\ndef dfs(graph, visited, ans, original, goal, change, node):\n\tvisited[node] = True\n\n\tvalue = flip_me(original, change[node], node - 1)\n\tadd = 0\n\tif goal[node - 1] == value:\n\t\tpass\n\telse:\n\t\tadd = 1\n\t\tans.append(node)\n\t\n\tfor i in graph[node]:\n\t\tif visited[i] == False:\n\t\t\tfor j in graph[i]:\n\t\t\t\tif visited[j] == False:\n\t\t\t\t\tchange[j] += change[node] + add\n\n\t\t\tdfs(graph, visited, ans, original, goal, change, i)\n\n\ndef calculate(graph, original, goal):\n\tvisited = dict()\n\tchange = dict()\n\tfor i in graph:\n\t\tvisited[i] = False\n\t\tchange[i] = 0\n\tans = []\n\tdfs(graph, visited, ans, original, goal, change, 1)\n\treturn ans\n\n# main starts \nn = int(stdin.readline().strip())\ngraph = defaultdict(list)\nfor _ in range(n - 1):\n\tu, v = list(map(int, stdin.readline().split()))\n\tgraph[u].append(v)\n\tgraph[v].append(u)\n\noriginal = list(map(int, stdin.readline().split()))\ngoal = list(map(int, stdin.readline().split()))\ncount = [0]\nans = calculate(graph, original, goal)\nprint(len(ans))\nfor i in ans:\n\tprint(i)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mr. Kitayuta has kindly given you a string *s* consisting of lowercase English letters. You are asked to insert exactly one lowercase English letter into *s* to make it a palindrome. A palindrome is a string that reads the same forward and backward. For example, \"noon\", \"testset\" and \"a\" are all palindromes, while \"test\" and \"kitayuta\" are not.\n\nYou can choose any lowercase English letter, and insert it to any position of *s*, possibly to the beginning or the end of *s*. You have to insert a letter even if the given string is already a palindrome.\n\nIf it is possible to insert one lowercase English letter into *s* so that the resulting string will be a palindrome, print the string after the insertion. Otherwise, print \"NA\" (without quotes, case-sensitive). In case there is more than one palindrome that can be obtained, you are allowed to print any of them.",
"input": "",
"output": "```python\ndef is_p(s):\n return s==s[::-1]\ns=input()\nfor i in range(len(s)):\n for c in 'abcdefghijklmnopqrstuvwxyz':\n if is_p(s[:i]+c+s[i:]):\n print(s[:i]+c+s[i:])\n exit(0)\nprint(\"NA\")\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp has interviewed Oleg and has written the interview down without punctuation marks and spaces to save time. Thus, the interview is now a string *s* consisting of *n* lowercase English letters.\n\nThere is a filler word ogo in Oleg's speech. All words that can be obtained from ogo by adding go several times to the end of it are also considered to be fillers. For example, the words ogo, ogogo, ogogogo are fillers, but the words go, og, ogog, ogogog and oggo are not fillers.\n\nThe fillers have maximal size, for example, for ogogoo speech we can't consider ogo a filler and goo as a normal phrase. We should consider ogogo as a filler here.\n\nTo print the interview, Polycarp has to replace each of the fillers with three asterisks. Note that a filler word is replaced with exactly three asterisks regardless of its length.\n\nPolycarp has dealt with this problem in no time. Can you do the same? The clock is ticking!",
"input": "",
"output": "```python\nimport re\r\ninput()\r\nprint(re.sub(r'o(go)+',\"*\"*3,input()))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a chessboard of size 1<=×<=*n*. It is guaranteed that *n* is even. The chessboard is painted like this: \"BWBW...BW\".\n\nSome cells of the board are occupied by the chess pieces. Each cell contains no more than one chess piece. It is known that the total number of pieces equals to .\n\nIn one step you can move one of the pieces one cell to the left or to the right. You cannot move pieces beyond the borders of the board. You also cannot move pieces to the cells that are already occupied.\n\nYour task is to place all the pieces in the cells of the same color using the minimum number of moves (all the pieces must occupy only the black cells or only the white cells after all the moves are made).",
"input": "",
"output": "```python\nn = int(input())\r\nn = n/2\r\na = [int(x) for x in input().split(\" \")]\r\nsorted(a)\r\n\r\np1 = 1\r\np2 = 2\r\n\r\nr1 = 0\r\nr2 = 0\r\n\r\nfor element in a:\r\n r1 = r1 + abs(element-p1)\r\n r2 = r2 + abs(element-p2)\r\n p1 = p1 + 2\r\n p2 = p2 + 2\r\n\r\nprint(min(r1, r2))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number *a* and Antisimon receives number *b*. They also have a heap of *n* stones. The players take turns to make a move and Simon starts. During a move a player should take from the heap the number of stones equal to the greatest common divisor of the fixed number he has received and the number of stones left in the heap. A player loses when he cannot take the required number of stones (i. e. the heap has strictly less stones left than one needs to take). \n\nYour task is to determine by the given *a*, *b* and *n* who wins the game.",
"input": "",
"output": "```python\na,b,n = map(int, input().split())\r\ni = 0\r\nb1 = n\r\nb2 = n\r\na1 = a\r\na2 = b\r\nwhile n>=0:\r\n if i%2 == 0:\r\n while b1>0:\r\n c = a1\r\n a1 = b1\r\n b1 = c%a1\r\n n -= a1\r\n i += 1\r\n b2 = n\r\n else:\r\n while b2>0:\r\n c = a2\r\n a2 = b2\r\n b2 = c%a2\r\n n -= a2\r\n i += 1\r\n b1 = n\r\nif i % 2 ==0:\r\n print(0)\r\nelse:\r\n print(1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Let's call an undirected graph $G = (V, E)$ relatively prime if and only if for each edge $(v, u) \\in E$ $GCD(v, u) = 1$ (the greatest common divisor of $v$ and $u$ is $1$). If there is no edge between some pair of vertices $v$ and $u$ then the value of $GCD(v, u)$ doesn't matter. The vertices are numbered from $1$ to $|V|$.\n\nConstruct a relatively prime graph with $n$ vertices and $m$ edges such that it is connected and it contains neither self-loops nor multiple edges.\n\nIf there exists no valid graph with the given number of vertices and edges then output \"Impossible\".\n\nIf there are multiple answers then print any of them.",
"input": "",
"output": "```python\nfrom fractions import gcd\r\nn,m = map(int,input().split())\r\n\r\nsol = []\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if gcd(i,j) == 1:\r\n sol.append('{} {}'.format(i,j))\r\n if len(sol)>=m:break\r\n\r\nif len(sol)>=m:\r\n print ('Possible')\r\n print ('\\n'.join(sol[:m]))\r\n\r\nelse:\r\n print ('Impossible')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "When Valera has got some free time, he goes to the library to read some books. Today he's got *t* free minutes to read. That's why Valera took *n* books in the library and for each book he estimated the time he is going to need to read it. Let's number the books by integers from 1 to *n*. Valera needs *a**i* minutes to read the *i*-th book.\n\nValera decided to choose an arbitrary book with number *i* and read the books one by one, starting from this book. In other words, he will first read book number *i*, then book number *i*<=+<=1, then book number *i*<=+<=2 and so on. He continues the process until he either runs out of the free time or finishes reading the *n*-th book. Valera reads each book up to the end, that is, he doesn't start reading the book if he doesn't have enough free time to finish reading it. \n\nPrint the maximum number of books Valera can read.",
"input": "",
"output": "```python\na,b=map(int, input().split())\r\nA=list(map(int, input().split()))\r\nt=0\r\nk=0\r\nfor x in A:\r\n t+=x\r\n if t>b:\r\n t-=A[k]\r\n k+=1\r\nprint(a-k)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. \"Piece of cake\" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.",
"input": "",
"output": "```python\nn=int(input())\r\ns=int()\r\nf=0\r\nfor k in range(n):\r\n s=0\r\n m=0\r\n r=0\r\n a=[int(i) for i in input().split(\" \")]\r\n for i in range(len(a)):\r\n s=s+a[i]\r\n m=m+s\r\n f=f+m\r\n if m>0:\r\n r=r+1\r\n elif m<0:\r\n r=r-1\r\n k=k+r\r\nif f==0 and k<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer.\n\nAt the start of the day they have *x* ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and Gerda's house even in the night. Each person in the queue wants either to take several ice cream packs for himself and his friends or to give several ice cream packs to Kay and Gerda (carriers that bring ice cream have to stand in the same queue).\n\nIf a carrier with *d* ice cream packs comes to the house, then Kay and Gerda take all his packs. If a child who wants to take *d* ice cream packs comes to the house, then Kay and Gerda will give him *d* packs if they have enough ice cream, otherwise the child will get no ice cream at all and will leave in distress.\n\nKay wants to find the amount of ice cream they will have after all people will leave from the queue, and Gerda wants to find the number of distressed kids.",
"input": "",
"output": "```python\nn_x = input().split();\r\nn = int(n_x[0]);\r\nx = int(n_x[1]); \r\n\r\ndis_count = 0; \r\nfor i in range(n):\r\n inp = input().split(); \r\n if inp[0] == '+':\r\n x += int(inp[1]);\r\n else:\r\n if int(inp[1]) < x:\r\n x -= int(inp[1]); \r\n else:\r\n dis_count += 1; \r\nprint(x,\" \",dis_count); \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has got two number: *a* and *b*. However, Vasya finds number *a* too short. So he decided to repeat the operation of lengthening number *a* *n* times.\n\nOne operation of lengthening a number means adding exactly one digit to the number (in the decimal notation) to the right provided that the resulting number is divisible by Vasya's number *b*. If it is impossible to obtain the number which is divisible by *b*, then the lengthening operation cannot be performed.\n\nYour task is to help Vasya and print the number he can get after applying the lengthening operation to number *a* *n* times.",
"input": "",
"output": "```python\ndef main():\r\n a,b,n=map(int,input().split())\r\n mon = a\r\n cnt = 0\r\n non_exist = False\r\n while n!=0:\r\n for i in range(1,10):\r\n if (a*10+i) %b == 0:\r\n a = a*10+i\r\n break\r\n n-=1\r\n if mon == a:\r\n print(-1)\r\n else:\r\n print(a)\r\n\r\nmain()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Capitalization is writing a word with its first letter as a capital letter. Your task is to capitalize the given word.\n\nNote, that during capitalization all the letters except the first one remains unchanged.",
"input": "",
"output": "```python\ns=input()\r\nif ord(s[0])>90:\r\n a=chr(ord(s[0])-32)\r\n c=a\r\n for i in range(1,len(s)):\r\n c+=str(s[i])\r\n print(c)\r\nelse:\r\n print(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* cities in Bearland, numbered 1 through *n*. Cities are arranged in one long row. The distance between cities *i* and *j* is equal to |*i*<=-<=*j*|.\n\nLimak is a police officer. He lives in a city *a*. His job is to catch criminals. It's hard because he doesn't know in which cities criminals are. Though, he knows that there is at most one criminal in each city.\n\nLimak is going to use a BCD (Bear Criminal Detector). The BCD will tell Limak how many criminals there are for every distance from a city *a*. After that, Limak can catch a criminal in each city for which he is sure that there must be a criminal.\n\nYou know in which cities criminals are. Count the number of criminals Limak will catch, after he uses the BCD.",
"input": "",
"output": "```python\n# Problem Link: https://codeforces.com/problemset/problem/680/B\r\n# Problem Status:\r\n# -------------------- SEPARATOR --------------------\r\ndef TheAmazingFunction(Arr: list, A):\r\n Answer = 0\r\n i = A - 1\r\n j = A - 1\r\n while i >= 0 or j < len(Arr):\r\n if i == j:\r\n if Arr[i] == 1:\r\n Answer += 1\r\n else:\r\n if i >= 0 and j < len(Arr):\r\n if Arr[i] + Arr[j] == 2:\r\n Answer += 2\r\n else:\r\n if i >= 0:\r\n Answer += Arr[i]\r\n else:\r\n Answer += Arr[j]\r\n i -= 1\r\n j += 1\r\n return Answer\r\n\r\n\r\n# -------------------- SEPARATOR --------------------\r\nN, A_ = list(map(int, input().split()))\r\nArr_ = list(map(int, input().split()))\r\nprint(TheAmazingFunction(Arr_, A_))\r\n# -------------------- SEPARATOR --------------------\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya came across three Berland coins. They didn't have any numbers that's why Vasya didn't understand how their denominations differ. He supposed that if one coin is heavier than the other one, then it should be worth more. Vasya weighed all the three pairs of coins on pan balance scales and told you the results. Find out how the deminations of the coins differ or if Vasya has a mistake in the weighting results. No two coins are equal.",
"input": "",
"output": "```python\ndict_ = {'A':1,'B':1,'C':1}\r\n\r\ndef solve_dict(dict_):\r\n items = sorted(dict_.values())\r\n for j in range(1,len(items)):\r\n if items[j] - items[j-1] > 1:\r\n return 'Impossible'\r\n return ''.join(sorted(dict_, key=dict_.get))\r\n\r\nfor i in range(3):\r\n s = input()\r\n a = s[0]\r\n b = s[2]\r\n sign = s[1]\r\n \r\n if sign == '>':\r\n if (not(dict_[a] > dict_[b])):\r\n dict_[a] = dict_[b] + 1\r\n else:\r\n if (not(dict_[b] > dict_[a])):\r\n dict_[a] = dict_[b] - 1\r\nprint(solve_dict(dict_))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\nM = int(input(\"M = \"))\r\nN = int(input(\"N = \"))\r\n\r\nprint((N // 2) * M + (N % 2) * (M // 2))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings *a* and *b* of equal length are called equivalent in one of the two cases: \n 1. They are equal. 1. If we split string *a* into two halves of the same size *a*1 and *a*2, and string *b* into two halves of the same size *b*1 and *b*2, then one of the following is correct: *a*1 is equivalent to *b*1, and *a*2 is equivalent to *b*2 1. *a*1 is equivalent to *b*2, and *a*2 is equivalent to *b*1 \nAs a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.\n\nGerald has already completed this home task. Now it's your turn!",
"input": "",
"output": "```python\ndef sortString(str):\n length = len(str)\n if (length % 2 != 0):\n return str\n length //= 2\n left = sortString(str[:length])\n right = sortString(str[length:])\n if left < right:\n return left + right\n else:\n return right + left\n\n\na = input()\nb = input()\nprint(\"YES\" if sortString(a) == sortString(b) else \"NO\")\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.\n\nPetya wonders eagerly what minimum lucky number has the sum of digits equal to *n*. Help him cope with the task.",
"input": "",
"output": "```python\nn = int(input())\nans = \"\"\nprintou = False\nhasSeven = False\nhasFour = False\nwhile(n>0):\n if n >= 7 and n-7 >= 4:\n n-=7\n ans+=\"7\"\n hasSeven = True\n elif n >=4:\n n-=4\n ans+=\"4\"\n hasFour = True\n else:\n print(-1)\n printou = True\n break\nif(not printou):\n if hasSeven and hasFour:\n print(ans[::-1])\n else:\n print(-1)\n \t\t \t \t \t\t \t \t \t \t\t\t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.\n\nHe wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence corners at a single angle *a*.\n\nWill the robot be able to build the fence Emuskald wants? In other words, is there a regular polygon which angles are equal to *a*?",
"input": "",
"output": "```python\nt = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n n = 3\r\n while n < 180:\r\n if a == 180*(n-2)/n:\r\n print('YES')\r\n break\r\n else:\r\n n += 1\r\n if n >= 180:\r\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* cities numbered from 1 to *n* in Berland. Some of them are connected by two-way roads. Each road has its own length — an integer number from 1 to 1000. It is known that from each city it is possible to get to any other city by existing roads. Also for each pair of cities it is known the shortest distance between them. Berland Government plans to build *k* new roads. For each of the planned road it is known its length, and what cities it will connect. To control the correctness of the construction of new roads, after the opening of another road Berland government wants to check the sum of the shortest distances between all pairs of cities. Help them — for a given matrix of shortest distances on the old roads and plans of all new roads, find out how the sum of the shortest distances between all pairs of cities changes after construction of each road.",
"input": "",
"output": "```python\nfrom collections import defaultdict\r\n\r\n\r\ndef dijkstra(graph, start, end):\r\n\r\n import heapq\r\n\r\n heap = [(0, start)] # cost from start node,end node\r\n visited = set()\r\n while heap:\r\n (cost, u) = heapq.heappop(heap)\r\n if u in visited:\r\n continue\r\n visited.add(u)\r\n if u == end:\r\n return cost\r\n for v, c in graph[u]:\r\n if v in visited:\r\n continue\r\n next_item = cost + c\r\n heapq.heappush(heap, (next_item, v))\r\n return -1\r\n\r\ndef main():\r\n \r\n n = int(input())\r\n\r\n graph = defaultdict(list)\r\n\r\n for i in range(n):\r\n row = list(map(int, input().split()))\r\n for j in range(n):\r\n graph[i].append((j, row[j]))\r\n graph[j].append((i, row[j]))\r\n\r\n ans = []\r\n\r\n k = int(input())\r\n\r\n for _ in range(k):\r\n a,b,c = map(int, input().split())\r\n\r\n a-=1\r\n b-=1\r\n\r\n graph[a].append((b, c))\r\n graph[b].append((a, c))\r\n\r\n tot = 0\r\n for u in range(n):\r\n for v in range(u):\r\n cur = dijkstra(graph, u, v)\r\n tot += cur\r\n \r\n ans.append(tot)\r\n\r\n print(*ans)\r\n\r\n\r\n\r\nmain()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A family consisting of father bear, mother bear and son bear owns three cars. Father bear can climb into the largest car and he likes it. Also, mother bear can climb into the middle car and she likes it. Moreover, son bear can climb into the smallest car and he likes it. It's known that the largest car is strictly larger than the middle car, and the middle car is strictly larger than the smallest car. \n\nMasha came to test these cars. She could climb into all cars, but she liked only the smallest car. \n\nIt's known that a character with size *a* can climb into some car with size *b* if and only if *a*<=≤<=*b*, he or she likes it if and only if he can climb into this car and 2*a*<=≥<=*b*.\n\nYou are given sizes of bears and Masha. Find out some possible integer non-negative sizes of cars.",
"input": "",
"output": "```python\nv1,v2,v3,vm=map(int,input().split())\r\nif vm>2*v3:\r\n print(-1)\r\nelse:\r\n if v1-2*vm >0 and v2 -2*v3 >0:\r\n print(v1,v2,v3)\r\n else:\r\n print(-1)\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he organized a New Year party at his place and invited *n* his friends there.\n\nIf there's one thing Petya likes more that receiving gifts, that's watching others giving gifts to somebody else. Thus, he safely hid the laptop until the next New Year and made up his mind to watch his friends exchanging gifts while he does not participate in the process. He numbered all his friends with integers from 1 to *n*. Petya remembered that a friend number *i* gave a gift to a friend number *p**i*. He also remembered that each of his friends received exactly one gift.\n\nNow Petya wants to know for each friend *i* the number of a friend who has given him a gift.",
"input": "",
"output": "```python\nx=int(input());a=input().split();print(*[a.index(str(i+1))+1for i in range(x)])\n \t\t\t \t \t\t\t \t\t\t \t\t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number *a* and Antisimon receives number *b*. They also have a heap of *n* stones. The players take turns to make a move and Simon starts. During a move a player should take from the heap the number of stones equal to the greatest common divisor of the fixed number he has received and the number of stones left in the heap. A player loses when he cannot take the required number of stones (i. e. the heap has strictly less stones left than one needs to take). \n\nYour task is to determine by the given *a*, *b* and *n* who wins the game.",
"input": "",
"output": "```python\na,b,n=[int(i) for i in input().split()]\r\nfor i in range(100):\r\n if i%2==0:\r\n if n==0:\r\n print(1)\r\n break\r\n elif n%a==0:\r\n n=n-a\r\n else:\r\n n-=1\r\n else:\r\n if n==0:\r\n print(0)\r\n break\r\n elif n%b==0:\r\n n=n-b\r\n else:\r\n n-=1\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\nt=int(input())\nfor i in range(t):\n a=input()\n n=len(a)\n s1 = a[0]\n l1 = a[-1]\n length=len(a[1:-1])\n if n>10:\n print(f\"{s1}{length}{l1}\")\n else:\n print(a)\n\n\n \t \t \t\t \t \t \t\t \t\t \t\t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Olesya loves numbers consisting of *n* digits, and Rodion only likes numbers that are divisible by *t*. Find some number that satisfies both of them.\n\nYour task is: given the *n* and *t* print an integer strictly larger than zero consisting of *n* digits that is divisible by *t*. If such number doesn't exist, print <=-<=1.",
"input": "",
"output": "```python\nfrom collections import defaultdict\r\nimport math\r\n\r\ndef pug_func(s: str) -> int:\r\n\r\n n, t = s.split(\" \")\r\n\r\n n = int(n)\r\n t = int(t)\r\n\r\n num = 10 ** (n - 1)\r\n\r\n\r\n for i in range(1, 11):\r\n if (num * i) % t == 0:\r\n return num * i\r\n \r\n return -1\r\n\r\n\r\n\r\nt = input()\r\nx = pug_func(t)\r\nprint(x)\r\n\r\n# t = int(input())\r\n# lista_ans = []\r\n\r\n# for _ in range(t):\r\n# n = input()\r\n# line = input()\r\n# lista_ans.append(line)\r\n\r\n# for ans in lista_ans:\r\n# x = pug_func(ans)\r\n# print(x)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\n\r\ndef word(s):\r\n c = 0\r\n for i in s:\r\n print(ord(i))\r\n if 97<=ord(i)<=122:\r\n c += 1\r\n else:\r\n c -= 1\r\n print(c)\r\n print(c)\r\n if c >=0 :\r\n return s.lower()\r\n return s.upper()\r\n\r\n\r\n\r\nprint(word(input()))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once when Gerald studied in the first year at school, his teacher gave the class the following homework. She offered the students a string consisting of *n* small Latin letters; the task was to learn the way the letters that the string contains are written. However, as Gerald is too lazy, he has no desire whatsoever to learn those letters. That's why he decided to lose some part of the string (not necessarily a connected part). The lost part can consist of any number of segments of any length, at any distance from each other. However, Gerald knows that if he loses more than *k* characters, it will be very suspicious. \n\nFind the least number of distinct characters that can remain in the string after no more than *k* characters are deleted. You also have to find any possible way to delete the characters.",
"input": "",
"output": "```python\ns = input()\r\nk = int(input())\r\nt = 'a'\r\nfr = [0] * 26\r\nfor i in s:\r\n fr[ord('a') - 97]+=1\r\nwhile k != 0:\r\n try:\r\n x = min(i for i in fr if i > 0)\r\n except:\r\n x = 0\r\n if x == 0:\r\n break\r\n if k >= x:\r\n fr[fr.index(x)] = 0\r\n k -= x\r\n else:\r\n k = 0\r\nans = \"\"\r\nc = 0\r\nfor i in range(26):\r\n if fr[i]:\r\n ans += chr(ord('a') + i)\r\n c+=1\r\nprint(c, '\\n', ans)\r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya is learning to play chess. He has already learned how to move a king, a rook and a bishop. Let us remind you the rules of moving chess pieces. A chessboard is 64 square fields organized into an 8<=×<=8 table. A field is represented by a pair of integers (*r*,<=*c*) — the number of the row and the number of the column (in a classical game the columns are traditionally indexed by letters). Each chess piece takes up exactly one field. To make a move is to move a chess piece, the pieces move by the following rules:\n - A rook moves any number of fields horizontally or vertically. - A bishop moves any number of fields diagonally. - A king moves one field in any direction — horizontally, vertically or diagonally. \nPetya is thinking about the following problem: what minimum number of moves is needed for each of these pieces to move from field (*r*1,<=*c*1) to field (*r*2,<=*c*2)? At that, we assume that there are no more pieces besides this one on the board. Help him solve this problem.",
"input": "",
"output": "```python\n# MC521 - Desafios de Programacao I - 1s2021\n# Contest: 21/05/2021\n# Problema D: Rook, Bishop and King\n\n# leitura da posicao inicial e final\nr1, c1, r2, c2 = map(int, input().split())\n\n# movimentos necessarios para a torre\nR = 0\nif(r1 != r2): R += 1\nif(c1 != c2): R += 1\n\n# movimentos necessarios para o bispo\nB = 0\nif(abs(c2-c1) == abs(r2-r1) > 0): \n if(abs(c2-c1) == abs(r2-r1)): B = 1\n else: B = 2\n\n# movimentos necessarios para o rei\nK = abs(c2-c1)\nif(abs(r2-r1) > abs(c2-c1)): \n K = abs(r2-r1)\n\n# imprime\nprint(\"{} {} {}\".format(R, B, K))\n \t\t\t \t\t \t\t \t \t \t\t\t \t\t\t\t \t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.\n\nThere are *n* columns of toy cubes in the box arranged in a line. The *i*-th column contains *a**i* cubes. At first, the gravity in the box is pulling the cubes downwards. When Chris switches the gravity, it begins to pull all the cubes to the right side of the box. The figure shows the initial and final configurations of the cubes in the box: the cubes that have changed their position are highlighted with orange.\n\nGiven the initial configuration of the toy cubes in the box, find the amounts of cubes in each of the *n* columns after the gravity switch!",
"input": "",
"output": "```python\nn = int(input())\r\ncubes = list(map(int, input().split()))\r\n\r\n# Sort the array in non-decreasing order\r\ncubes.sort()\r\n\r\n# Output the sorted array\r\nprint(*cubes)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a string *s* consisting of |*s*| small english letters.\n\nIn one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b, s will be replaced with t, etc.). You cannot replace letter z with any other letter.\n\nYour target is to make some number of moves (not necessary minimal) to get string abcdefghijklmnopqrstuvwxyz (english alphabet) as a subsequence. Subsequence of the string is the string that is obtained by deleting characters at some positions. You need to print the string that will be obtained from the given string and will be contain english alphabet as a subsequence or say that it is impossible.",
"input": "",
"output": "```python\ns = list(input())\r\n\r\n\r\nalph = \"abcdefghijklmnopqrstuvwxyz\"\r\nind = 0\r\n\r\nfor i, char in enumerate(s):\r\n if ind == ord(char) - 97:\r\n ind += 1\r\n elif ind == ord(char) - 97 + 1:\r\n s[i] = chr(ord(char) + 1)\r\n ind += 1\r\n\r\nif ind == 26:\r\n print(\"\".join(s))\r\nelse:\r\n print(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Furik loves math lessons very much, so he doesn't attend them, unlike Rubik. But now Furik wants to get a good mark for math. For that Ms. Ivanova, his math teacher, gave him a new task. Furik solved the task immediately. Can you?\n\nYou are given a system of equations: \n\nYou should count, how many there are pairs of integers (*a*,<=*b*) (0<=≤<=*a*,<=*b*) which satisfy the system.",
"input": "",
"output": "```python\nn, m, answer = 0, 0, 0\r\nn, m = map(int, input().split())\r\n\r\ni = 0\r\nwhile i * i <= n and i <= m:\r\n b = n - i * i\r\n if i + b * b == m:\r\n answer += 1\r\n i += 1\r\n\r\nprint(answer)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Codeforces user' handle color depends on his rating — it is red if his rating is greater or equal to 2400; it is orange if his rating is less than 2400 but greater or equal to 2200, etc. Each time participant takes part in a rated contest, his rating is changed depending on his performance.\n\nAnton wants the color of his handle to become red. He considers his performance in the rated contest to be good if he outscored some participant, whose handle was colored red before the contest and his rating has increased after it.\n\nAnton has written a program that analyses contest results and determines whether he performed good or not. Are you able to do the same?",
"input": "",
"output": "```python\ns = 'NO'\r\nfor _ in range(int(input())):\r\n t = input().split(' ')\r\n if 2400 <= int(t[1]) < int(t[2]):\r\n s = 'YES'\r\nprint(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number *a* and Antisimon receives number *b*. They also have a heap of *n* stones. The players take turns to make a move and Simon starts. During a move a player should take from the heap the number of stones equal to the greatest common divisor of the fixed number he has received and the number of stones left in the heap. A player loses when he cannot take the required number of stones (i. e. the heap has strictly less stones left than one needs to take). \n\nYour task is to determine by the given *a*, *b* and *n* who wins the game.",
"input": "",
"output": "```python\na, b, c = [int(x) for x in input().split()]\r\n\r\ndef nod(lhs, rhs):\r\n if rhs==0:\r\n return lhs\r\n else:\r\n return nod(rhs, lhs%rhs)\r\nd=nod(a,c)\r\nk=0\r\n\r\nwhile c>0:\r\n\r\n if k==0:\r\n d=nod(a,c)\r\n else:\r\n d=nod(b,c)\r\n c -= d\r\n k = (k + 1) % 2\r\nprint((k + 1) % 2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently, Anton has found a set. The set consists of small English letters. Anton carefully wrote out all the letters from the set in one line, separated by a comma. He also added an opening curved bracket at the beginning of the line and a closing curved bracket at the end of the line. \n\nUnfortunately, from time to time Anton would forget writing some letter and write it again. He asks you to count the total number of distinct letters in his set.",
"input": "",
"output": "```python\ns = list(input())\r\ns.pop(0)\r\ns.pop()\r\ns = ''.join(s)\r\ns = set(s.split(', '))\r\nprint(len(s))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Valera is a collector. Once he wanted to expand his collection with exactly one antique item.\n\nValera knows *n* sellers of antiques, the *i*-th of them auctioned *k**i* items. Currently the auction price of the *j*-th object of the *i*-th seller is *s**ij*. Valera gets on well with each of the *n* sellers. He is perfectly sure that if he outbids the current price of one of the items in the auction (in other words, offers the seller the money that is strictly greater than the current price of the item at the auction), the seller of the object will immediately sign a contract with him.\n\nUnfortunately, Valera has only *v* units of money. Help him to determine which of the *n* sellers he can make a deal with.",
"input": "",
"output": "```python\nn,v = map(int,input().split())\nl1 = []\nfor i in range(n):\n\tk = list(map(int,input().split()))\n\tif min(k[1:]) < v:\n\t\tl1.append(i+1)\n\nprint(len(l1))\nprint(*l1)\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.\n\nRight now, Limak and Bob weigh *a* and *b* respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight.\n\nLimak eats a lot and his weight is tripled after every year, while Bob's weight is doubled after every year.\n\nAfter how many full years will Limak become strictly larger (strictly heavier) than Bob?",
"input": "",
"output": "```python\nnum = input().split(\" \")\r\ni=0\r\na,b = int(num[0]),int(num[1])\r\nwhile(True):\r\n a *= 3\r\n b *= 2\r\n i += 1\r\n if(a>b):\r\n print(i)\r\n break\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "As you may know, MemSQL has American offices in both San Francisco and Seattle. Being a manager in the company, you travel a lot between the two cities, always by plane.\n\nYou prefer flying from Seattle to San Francisco than in the other direction, because it's warmer in San Francisco. You are so busy that you don't remember the number of flights you have made in either direction. However, for each of the last *n* days you know whether you were in San Francisco office or in Seattle office. You always fly at nights, so you never were at both offices on the same day. Given this information, determine if you flew more times from Seattle to San Francisco during the last *n* days, or not.",
"input": "",
"output": "```python\nint(input());k=input();print(\"YES\" if k.count(\"SF\")>k.count(\"FS\") else \"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.\n\nOne day Petya came across an interval of numbers [*a*,<=*a*<=+<=*l*<=-<=1]. Let *F*(*x*) be the number of lucky digits of number *x*. Find the minimum *b* (*a*<=<<=*b*) such, that *F*(*a*) = *F*(*b*), *F*(*a*<=+<=1) = *F*(*b*<=+<=1), ..., *F*(*a*<=+<=*l*<=-<=1) = *F*(*b*<=+<=*l*<=-<=1).",
"input": "",
"output": "```python\nimport itertools\r\n\r\n\r\ndef F(x):\r\n q = 0\r\n for i in str(x):\r\n if i == '4' or i == '7':\r\n q += 1\r\n return q\r\n\r\n\r\na, l = map(lambda x: int(x), input().split())\r\nFa = [F(i) for i in range(a, a+l)]\r\nfor b in itertools.count(a+1):\r\n for i in range(l):\r\n if Fa[i] != F(b+i):\r\n break\r\n else:\r\n print(b)\r\n break\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently, you bought a brand new smart lamp with programming features. At first, you set up a schedule to the lamp. Every day it will turn power on at moment $0$ and turn power off at moment $M$. Moreover, the lamp allows you to set a program of switching its state (states are \"lights on\" and \"lights off\"). Unfortunately, some program is already installed into the lamp.\n\nThe lamp allows only good programs. Good program can be represented as a non-empty array $a$, where $0 < a_1 < a_2 < \\dots < a_{|a|} < M$. All $a_i$ must be integers. Of course, preinstalled program is a good program.\n\nThe lamp follows program $a$ in next manner: at moment $0$ turns power and light on. Then at moment $a_i$ the lamp flips its state to opposite (if it was lit, it turns off, and vice versa). The state of the lamp flips instantly: for example, if you turn the light off at moment $1$ and then do nothing, the total time when the lamp is lit will be $1$. Finally, at moment $M$ the lamp is turning its power off regardless of its state.\n\nSince you are not among those people who read instructions, and you don't understand the language it's written in, you realize (after some testing) the only possible way to alter the preinstalled program. You can insert at most one element into the program $a$, so it still should be a good program after alteration. Insertion can be done between any pair of consecutive elements of $a$, or even at the begining or at the end of $a$.\n\nFind such a way to alter the program that the total time when the lamp is lit is maximum possible. Maybe you should leave program untouched. If the lamp is lit from $x$ till moment $y$, then its lit for $y - x$ units of time. Segments of time when the lamp is lit are summed up.",
"input": "",
"output": "```python\nm,n=map(int,input().split())\r\nl1=[]\r\nl=[0]+list(map(int,input().split()))+[n]\r\nfor i in range(m+1):\r\n\r\n l1+=[l[i+1]-l[i]]\r\n\r\nl3=max(sum(l[::2]),sum(l[1::2]))\r\nfor i in range(0,len(l1),2):\r\n if l1[i]!=1:\r\n l3=max(l3,sum(l1[:i+1:2])-1+sum(l1[i+1::2]))\r\n\r\nfor i in range(1, len(l1), 2):\r\n if l1[i] != 1:\r\n l3=max(l3, sum(l1[:i:2]) - 1 + sum(l1[i::2]))\r\nprint(l3)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\na = input()\r\nzag = sum(map(str.isupper, a))\r\nstro = sum(map(str.islower, a))\r\nif zag == stro:\r\n print(a.lower())\r\nelif zag > stro:\r\n print(a.upper())\r\nelse:\r\n print(a.lower())\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "To stay woke and attentive during classes, Karen needs some coffee!\n\nKaren, a coffee aficionado, wants to know the optimal temperature for brewing the perfect cup of coffee. Indeed, she has spent some time reading several recipe books, including the universally acclaimed \"The Art of the Covfefe\".\n\nShe knows *n* coffee recipes. The *i*-th recipe suggests that coffee should be brewed between *l**i* and *r**i* degrees, inclusive, to achieve the optimal taste.\n\nKaren thinks that a temperature is admissible if at least *k* recipes recommend it.\n\nKaren has a rather fickle mind, and so she asks *q* questions. In each question, given that she only wants to prepare coffee with a temperature between *a* and *b*, inclusive, can you tell her how many admissible integer temperatures fall within the range?",
"input": "",
"output": "```python\nrec = [0]*200001\nn,q,r = map(int,input().split())\narr = []\nfor _ in range(n):\n a,b=map(int,input().split())\n arr.append((a,b))\nfor i in arr:\n for x in range(i[0],i[1]+1):\n rec[x]+=1\nfor _ in range(r):\n a,b=map(int,input().split())\n ans = 0\n for i in range(a,b+1):\n if rec[i]>=q:\n ans+=1\n print(ans)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a set of integer numbers, initially it is empty. You should perform *n* queries.\n\nThere are three different types of queries: \n - 1 *l* *r* — Add all missing numbers from the interval [*l*,<=*r*] - 2 *l* *r* — Remove all present numbers from the interval [*l*,<=*r*] - 3 *l* *r* — Invert the interval [*l*,<=*r*] — add all missing and remove all present numbers from the interval [*l*,<=*r*] \nAfter each query you should output MEX of the set — the smallest positive (MEX <=≥<=1) integer number which is not presented in the set.",
"input": "",
"output": "```python\nfrom collections import defaultdict\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef f(z, l, r):\r\n j = l // m\r\n c = 0\r\n if z == 0:\r\n return\r\n elif z == 1:\r\n for i in range(l, r):\r\n c += 1 - a[i]\r\n a[i] = 1\r\n elif z == 2:\r\n for i in range(l, r):\r\n c -= a[i]\r\n a[i] = 0\r\n else:\r\n for i in range(l, r):\r\n c += 1 - 2 * a[i]\r\n a[i] ^= 1\r\n cnt[j] += c\r\n return\r\n\r\nn = int(input())\r\ntlr = []\r\nd = defaultdict(lambda : set())\r\nd[0].add(1)\r\nmod = pow(10, 9) + 7\r\nfor _ in range(n):\r\n t, l, r = map(int, input().split())\r\n d[l // mod].add(l % mod)\r\n d[(l - 1) // mod].add((l - 1) % mod)\r\n d[r // mod].add(r % mod)\r\n d[(r + 1) // mod].add((r + 1) % mod)\r\n tlr.append((str(t), str(l), str(r)))\r\nif 0 in d[0]:\r\n d[0].remove(0)\r\ns = []\r\nfor i in sorted(d.keys()):\r\n u = i * mod\r\n for j in sorted(d[i]):\r\n s.append(str(u + j))\r\nd = dict()\r\nls = len(s)\r\nfor i in range(ls):\r\n d[s[i]] = i\r\nm = 357\r\nu = (ls // m + min(ls % m, 1) + 1) * m\r\nv = u // m\r\na = [0] * u\r\nb = [0] * v\r\ncnt = [0] * v\r\nans = []\r\nfor t0, l0, r0 in tlr:\r\n t, l, r = int(t0), d[l0], d[r0]\r\n x, y = l // m, r // m\r\n if t < 3:\r\n for i in range(x + 1, y):\r\n b[i] = t\r\n else:\r\n for i in range(x + 1, y):\r\n b[i] ^= 3\r\n if x == y:\r\n f(b[x], x * m, l)\r\n f(b[x], r + 1, (x + 1) * m)\r\n if t < 3:\r\n f(t, l, r + 1)\r\n else:\r\n f(t ^ b[x], l, r + 1)\r\n else:\r\n f(b[x], x * m, l)\r\n f(b[y], r + 1, (y + 1) * m)\r\n if t < 3:\r\n f(t, l, (x + 1) * m)\r\n f(t, y * m, r + 1)\r\n else:\r\n f(t ^ b[x], l, (x + 1) * m)\r\n f(t ^ b[y], y * m, r + 1)\r\n b[x], b[y] = 0, 0\r\n i = 0\r\n while (not cnt[i] ^ m and not b[i]) or (not cnt[i] and b[i] == 3) or b[i] == 1:\r\n i += 1\r\n i *= m\r\n f(b[i // m], i // m * m, i // m * m + m)\r\n b[i // m] = 0\r\n while i < len(s) - 1 and a[i]:\r\n if b[i // m]:\r\n f(b[i // m], i // m * m, i // m * m + m)\r\n b[i // m] = 0\r\n i += 1\r\n ans0 = s[i]\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya is a big fan of mathematics, especially its part related to fractions. Recently he learned that a fraction is called proper iff its numerator is smaller than its denominator (*a*<=<<=*b*) and that the fraction is called irreducible if its numerator and its denominator are coprime (they do not have positive common divisors except 1).\n\nDuring his free time, Petya thinks about proper irreducible fractions and converts them to decimals using the calculator. One day he mistakenly pressed addition button (<=+<=) instead of division button (÷) and got sum of numerator and denominator that was equal to *n* instead of the expected decimal notation. \n\nPetya wanted to restore the original fraction, but soon he realized that it might not be done uniquely. That's why he decided to determine maximum possible proper irreducible fraction such that sum of its numerator and denominator equals *n*. Help Petya deal with this problem.",
"input": "",
"output": "```python\nimport math\nn=int(input())\np,q=n//2,n-n//2\nwhile math.gcd(a,b)!=1:p,q=p-1,q+1\nprint(p,q)\n \t \t \t\t\t\t\t\t\t \t \t\t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A wise man told Kerem \"Different is good\" once, so Kerem wants all things in his life to be different. \n\nKerem recently got a string *s* consisting of lowercase English letters. Since Kerem likes it when things are different, he wants all substrings of his string *s* to be distinct. Substring is a string formed by some number of consecutive characters of the string. For example, string \"aba\" has substrings \"\" (empty substring), \"a\", \"b\", \"a\", \"ab\", \"ba\", \"aba\".\n\nIf string *s* has at least two equal substrings then Kerem will change characters at some positions to some other lowercase English letters. Changing characters is a very tiring job, so Kerem want to perform as few changes as possible.\n\nYour task is to find the minimum number of changes needed to make all the substrings of the given string distinct, or determine that it is impossible.",
"input": "",
"output": "```python\nfrom collections import Counter\r\nn=int(input())\r\ns=str(input())\r\ncount=Counter(s)\r\nc=0\r\nfor value in count.values():\r\n if value>=2:\r\n c=c+(value-1)\r\n\r\nprint(c)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The School №0 of the capital of Berland has *n* children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each child we know value *t**i*:\n - *t**i*<==<=1, if the *i*-th child is good at programming, - *t**i*<==<=2, if the *i*-th child is good at maths, - *t**i*<==<=3, if the *i*-th child is good at PE \nEach child happens to be good at exactly one of these three subjects.\n\nThe Team Scientific Decathlon Olympias requires teams of three students. The school teachers decided that the teams will be composed of three children that are good at different subjects. That is, each team must have one mathematician, one programmer and one sportsman. Of course, each child can be a member of no more than one team.\n\nWhat is the maximum number of teams that the school will be able to present at the Olympiad? How should the teams be formed for that?",
"input": "",
"output": "```python\nn=int(input())\r\na=list(map(int,input().split()))\r\nl=min(a.count(1),a.count(2),a.count(3))\r\nfor i in range(l):\r\n print(a.index(1)+1,a.index(2)+1,a.index(3)+1)\r\n a[a.index(1)]=0\r\n a[a.index(2)]=0\r\n a[a.index(3)]=0\r\nif l==0:\r\n print(0)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "To make a paper airplane, one has to use a rectangular piece of paper. From a sheet of standard size you can make $s$ airplanes.\n\nA group of $k$ people decided to make $n$ airplanes each. They are going to buy several packs of paper, each of them containing $p$ sheets, and then distribute the sheets between the people. Each person should have enough sheets to make $n$ airplanes. How many packs should they buy?",
"input": "",
"output": "```python\nk,n,s,p=map(int,input().split())\r\na=(n//s)+1\r\nb=k/p\r\nans=(a*b)+1\r\nprint(int(ans))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mashmokh works in a factory. At the end of each day he must turn off all of the lights. \n\nThe lights on the factory are indexed from 1 to *n*. There are *n* buttons in Mashmokh's room indexed from 1 to *n* as well. If Mashmokh pushes button with index *i*, then each light with index not less than *i* that is still turned on turns off.\n\nMashmokh is not very clever. So instead of pushing the first button he pushes some of the buttons randomly each night. He pushed *m* distinct buttons *b*1,<=*b*2,<=...,<=*b**m* (the buttons were pushed consecutively in the given order) this night. Now he wants to know for each light the index of the button that turned this light off. Please note that the index of button *b**i* is actually *b**i*, not *i*.\n\nPlease, help Mashmokh, print these indices.",
"input": "",
"output": "```python\nn,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nd,c = {},n+1\r\nfor i in range(m):\r\n\tif l[i]=(l):\r\n c=c+1\r\n\r\n\r\nimport fractions\r\ndef simplify_fraction(num1, num2):\r\n result = fractions(num1, num2)\r\n return result\r\nresult = simplify_fraction(c,6)\r\nprint(result)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word *s*. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word *s*.",
"input": "",
"output": "```python\nn=input()\nf=0\nfor i in range(n):\n print(i)\n print(f)\n if i == 'h' and f==0 :\n f=1\n elif i=='e' and f==1 :\n f=2\n elif i=='l' and f==2 :\n f=3\n elif i=='l' and f==3 :\n f=4\n elif i=='o' and f==4 :\n f=5\nif f==5 :\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t\t\t \t\t\t \t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A long time ago, in a galaxy far far away two giant IT-corporations Pineapple and Gogol continue their fierce competition. Crucial moment is just around the corner: Gogol is ready to release it's new tablet Lastus 3000.\n\nThis new device is equipped with specially designed artificial intelligence (AI). Employees of Pineapple did their best to postpone the release of Lastus 3000 as long as possible. Finally, they found out, that the name of the new artificial intelligence is similar to the name of the phone, that Pineapple released 200 years ago. As all rights on its name belong to Pineapple, they stand on changing the name of Gogol's artificial intelligence.\n\nPineapple insists, that the name of their phone occurs in the name of AI as a substring. Because the name of technology was already printed on all devices, the Gogol's director decided to replace some characters in AI name with \"#\". As this operation is pretty expensive, you should find the minimum number of characters to replace with \"#\", such that the name of AI doesn't contain the name of the phone as a substring.\n\nSubstring is a continuous subsequence of a string.",
"input": "",
"output": "```python\ns1=input() ; s2=input()\r\nans=0\r\nfor i in range(len(s1)):\r\n if s1[i:i+len(s2)]==s2:ans+=1\r\n\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "On the planet Mars a year lasts exactly *n* days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible number of days off per year on Mars.",
"input": "",
"output": "```python\nn=int(input())\n1<=n<=1000000\nif n==1:\n print('0 1')\nelif 2<=n<7:\n print('0 2')\nelse:\n i=n//7\n j=n%7\n if j>5:\n print('%d %d'%(i*2+1,i*2+1))\n else:\n print('%d %d'%(i*2,i*2))\n\t \t\t\t \t\t\t \t \t \t\t \t\t\t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Alex doesn't like boredom. That's why whenever he gets bored, he comes up with games. One long winter evening he came up with a game and decided to play it.\n\nGiven a sequence *a* consisting of *n* integers. The player can make several steps. In a single step he can choose an element of the sequence (let's denote it *a**k*) and delete it, at that all elements equal to *a**k*<=+<=1 and *a**k*<=-<=1 also must be deleted from the sequence. That step brings *a**k* points to the player. \n\nAlex is a perfectionist, so he decided to get as many points as possible. Help him.",
"input": "",
"output": "```python\ndp = [0 for x in range(100001)]\r\nc = [0 for x in range(100001)]\r\nn = int(input())\r\nif n == 1:\r\n print(int(input()))\r\ntmp = [int(x) for x in input().split()]\r\nfor i in tmp:\r\n c[i] += 1\r\ndp[1] = c[1]\r\nfor i in range(2, n + 1):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + c[i] * i)\r\nprint(dp[n])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Imp is in a magic forest, where xorangles grow (wut?)\n\nA xorangle of order *n* is such a non-degenerate triangle, that lengths of its sides are integers not exceeding *n*, and the xor-sum of the lengths is equal to zero. Imp has to count the number of distinct xorangles of order *n* to get out of the forest. \n\nFormally, for a given integer *n* you have to find the number of such triples (*a*,<=*b*,<=*c*), that:\n - 1<=≤<=*a*<=≤<=*b*<=≤<=*c*<=≤<=*n*; - , where denotes the [bitwise xor](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) of integers *x* and *y*. - (*a*,<=*b*,<=*c*) form a non-degenerate (with strictly positive area) triangle.",
"input": "",
"output": "```python\nn = int(input())\r\ncnt = 0\r\nans = set()\r\nfor c in range(1, n + 1):\r\n for a in range(1, c + 1):\r\n b = c ^ a\r\n \r\n if c >= a and c >= b and not (c >= a + b or a >= b + c or b >= a + c or b == 0):\r\n cnt += 1\r\n \r\nprint(cnt // 2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a permutation *p* of length *n*. Also you are given *m* foe pairs (*a**i*,<=*b**i*) (1<=≤<=*a**i*,<=*b**i*<=≤<=*n*,<=*a**i*<=≠<=*b**i*). \n\nYour task is to count the number of different intervals (*x*,<=*y*) (1<=≤<=*x*<=≤<=*y*<=≤<=*n*) that do not contain any foe pairs. So you shouldn't count intervals (*x*,<=*y*) that contain at least one foe pair in it (the positions and order of the values from the foe pair are not important).\n\nConsider some example: *p*<==<=[1,<=3,<=2,<=4] and foe pairs are {(3,<=2),<=(4,<=2)}. The interval (1,<=3) is incorrect because it contains a foe pair (3,<=2). The interval (1,<=4) is also incorrect because it contains two foe pairs (3,<=2) and (4,<=2). But the interval (1,<=2) is correct because it doesn't contain any foe pair.",
"input": "",
"output": "```python\nI = lambda:[*map(int, input().split())]\r\n\r\ndef solve():\r\n n, m = I()\r\n a = [0] + I()\r\n pos = [0] * (n + 1)\r\n f = [0] * (n + 1)\r\n for i, v in enumerate(a):\r\n pos[v] = i\r\n for i in range(m):\r\n x, y = I()\r\n x, y = pos[x], pos[y]\r\n if x > y:\r\n x, y = y, x\r\n f[y] = max(f[y], x)\r\n res, last = 0, 0\r\n for i in range(1, n + 1):\r\n last = max(f[i], last)\r\n res += i - last\r\n print(res)\r\n\r\nt = 1\r\nwhile t > 0:\r\n t -= 1\r\n solve()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya got hold of information on the Martian dollar course in bourles for the next *n* days. The buying prices and the selling prices for one dollar on day *i* are the same and are equal to *a**i*. Vasya has *b* bourles. He can buy a certain number of dollars and then sell it no more than once in *n* days. According to Martian laws, one can buy only an integer number of dollars. Which maximal sum of money in bourles can Vasya get by the end of day *n*?",
"input": "",
"output": "```python\nfrom collections import deque, Counter, OrderedDict\r\nfrom heapq import nsmallest, nlargest\r\n\r\ndef binNumber(n,size):\r\n return bin(n)[2:].zfill(size)\r\n\r\ndef gcd(a,b):\r\n if a == 0:\r\n return b\r\n return gcd(b%a,a)\r\n\r\ndef iar():\r\n return list(map(int,input().split()))\r\n\r\ndef ini():\r\n return int(input())\r\n\r\ndef isp():\r\n return map(int,input().split())\r\n\r\ndef sti():\r\n return str(input())\r\n\r\ndef rln(a):\r\n return range(len(a))\r\n\r\n# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\nif __name__ == \"__main__\":\r\n n,b = isp()\r\n a = iar()\r\n ma = b\r\n for i in range(n-1):\r\n for j in range(i+1,n):\r\n buy = b//a[i]\r\n rem = b%a[i]\r\n sel = buy*a[j] + rem\r\n ma = max(ma,sel)\r\n print(ma)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are *n* drinks in his fridge, the volume fraction of orange juice in the *i*-th drink equals *p**i* percent.\n\nOne day Vasya decided to make himself an orange cocktail. He took equal proportions of each of the *n* drinks and mixed them. Then he wondered, how much orange juice the cocktail has.\n\nFind the volume fraction of orange juice in the final drink.",
"input": "",
"output": "```python\nd = int(input())\r\nnum = list(map(int, input().split()))\r\ntotal_s = sum(num)\r\nresult = 1 // denominator * total_s\r\nprint(result)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "New Year is coming in Line World! In this world, there are *n* cells numbered by integers from 1 to *n*, as a 1<=×<=*n* board. People live in cells. However, it was hard to move between distinct cells, because of the difficulty of escaping the cell. People wanted to meet people who live in other cells.\n\nSo, user tncks0121 has made a transportation system to move between these cells, to celebrate the New Year. First, he thought of *n*<=-<=1 positive integers *a*1,<=*a*2,<=...,<=*a**n*<=-<=1. For every integer *i* where 1<=≤<=*i*<=≤<=*n*<=-<=1 the condition 1<=≤<=*a**i*<=≤<=*n*<=-<=*i* holds. Next, he made *n*<=-<=1 portals, numbered by integers from 1 to *n*<=-<=1. The *i*-th (1<=≤<=*i*<=≤<=*n*<=-<=1) portal connects cell *i* and cell (*i*<=+<=*a**i*), and one can travel from cell *i* to cell (*i*<=+<=*a**i*) using the *i*-th portal. Unfortunately, one cannot use the portal backwards, which means one cannot move from cell (*i*<=+<=*a**i*) to cell *i* using the *i*-th portal. It is easy to see that because of condition 1<=≤<=*a**i*<=≤<=*n*<=-<=*i* one can't leave the Line World using portals.\n\nCurrently, I am standing at cell 1, and I want to go to cell *t*. However, I don't know whether it is possible to go there. Please determine whether I can go to cell *t* by only using the construted transportation system.",
"input": "",
"output": "```python\nn,t = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ni = 0\r\nwhile i <= n-1:\r\n if i == t:\r\n print(\"YES\")\r\n break\r\n elif i > t:\r\n print(\"NO\")\r\n break\r\n i = i + l[i-1]\r\nelse:\r\n if i == t:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Amr has got a large array of size *n*. Amr doesn't like large arrays so he intends to make it smaller.\n\nAmr doesn't care about anything in the array except the beauty of it. The beauty of the array is defined to be the maximum number of times that some number occurs in this array. He wants to choose the smallest subsegment of this array such that the beauty of it will be the same as the original array.\n\nHelp Amr by choosing the smallest subsegment possible.",
"input": "",
"output": "```python\nn=int(input())\r\nl=list(map(int,input().split()))\r\nli=list(set(l))\r\nif len(l)==len(li):\r\n print(\"1 1\")\r\nelse:\r\n max=0\r\n index1=n+1\r\n index2=2*(n+1)+1\r\n for i in li:\r\n if l.count(i)>max:\r\n max=l.count(i)\r\n index1=l.index(i)\r\n index2=n-l[::-1].index(i)-1\r\n if l.count(i)==max:\r\n if l[::-1].index(i)-l.index(i) 1:\n n2 = calculate(n2)\n count = count + i + 1\n if length(str(n2)) > 1:\n calculate(n2)\n else:\n print(count)\n break\n else:\n print(0)\n\ndigit = int(input())\nresult(digit)\n\n \t\t\t \t\t\t\t\t \t \t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day, Twilight Sparkle is interested in how to sort a sequence of integers *a*1,<=*a*2,<=...,<=*a**n* in non-decreasing order. Being a young unicorn, the only operation she can perform is a unit shift. That is, she can move the last element of the sequence to its beginning:\n\nHelp Twilight Sparkle to calculate: what is the minimum number of operations that she needs to sort the sequence?",
"input": "",
"output": "```python\nn = int(input())\r\nA = [int(a) for a in input().split()]\r\n\r\nflag = True\r\nm = 0\r\n\r\nlast = A[0]\r\nbreak_seen = False\r\nfor i in range(1, n):\r\n if last > A[i]:\r\n if break_seen:\r\n flag = False\r\n break\r\n else:\r\n break_seen = True\r\n m = n - i\r\n last = A[i]\r\n\r\nif break_seen:\r\n if A[0] < A[n - 1]:\r\n flag = False\r\nif flag:\r\n print(m)\r\nelse:\r\n print(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any longer, so he decided to get some food in the house.\n\nKarlsson's gaze immediately fell on *n* wooden cupboards, standing in the kitchen. He immediately realized that these cupboards have hidden jam stocks. Karlsson began to fly greedily around the kitchen, opening and closing the cupboards' doors, grab and empty all the jars of jam that he could find.\n\nAnd now all jars of jam are empty, Karlsson has had enough and does not want to leave traces of his stay, so as not to let down his friend. Each of the cupboards has two doors: the left one and the right one. Karlsson remembers that when he rushed to the kitchen, all the cupboards' left doors were in the same position (open or closed), similarly, all the cupboards' right doors were in the same position (open or closed). Karlsson wants the doors to meet this condition as well by the time the family returns. Karlsson does not remember the position of all the left doors, also, he cannot remember the position of all the right doors. Therefore, it does not matter to him in what position will be all left or right doors. It is important to leave all the left doors in the same position, and all the right doors in the same position. For example, all the left doors may be closed, and all the right ones may be open.\n\nKarlsson needs one second to open or close a door of a cupboard. He understands that he has very little time before the family returns, so he wants to know the minimum number of seconds *t*, in which he is able to bring all the cupboard doors in the required position.\n\nYour task is to write a program that will determine the required number of seconds *t*.",
"input": "",
"output": "```python\nn=int(input())\r\nl=[]\r\nr=[]\r\nfor i in range(n):\r\n lst=list(map(int,input().split()))\r\n l.append(lst[0])\r\n r.append(lst[1])\r\nt=0\r\nif 0 in l and 1 in l:\r\n if l.count(1)>=l.count(0):\r\n for i in l:\r\n if i==0:\r\n t=t+1\r\n elif l.count(0)>l.count(1) :\r\n for i in l:\r\n if i==1:\r\n t=t+1\r\nif 0 in r and 1 in r:\r\n if r.count(1)>=r.count(0):\r\n for i in r:\r\n if i==0:\r\n t=t+1\r\n elif r.count(0)>r.count(1):\r\n for i in r:\r\n if i==1:\r\n t=t+1\r\nprint(t)\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Yakko, Wakko and Dot, world-famous animaniacs, decided to rest from acting in cartoons, and take a leave to travel a bit. Yakko dreamt to go to Pennsylvania, his Motherland and the Motherland of his ancestors. Wakko thought about Tasmania, its beaches, sun and sea. Dot chose Transylvania as the most mysterious and unpredictable place.\n\nBut to their great regret, the leave turned to be very short, so it will be enough to visit one of the three above named places. That's why Yakko, as the cleverest, came up with a truly genius idea: let each of the three roll an ordinary six-sided die, and the one with the highest amount of points will be the winner, and will take the other two to the place of his/her dreams.\n\nYakko thrown a die and got Y points, Wakko — W points. It was Dot's turn. But she didn't hurry. Dot wanted to know for sure what were her chances to visit Transylvania.\n\nIt is known that Yakko and Wakko are true gentlemen, that's why if they have the same amount of points with Dot, they will let Dot win.",
"input": "",
"output": "```python\nimport math\r\ny , w = map(int , input().split())\r\nh = 6 - max(y,w) + 1\r\np = 6 // h if 6 % h == 0 else 6\r\np = max(math.gcd(p,h),1)\r\nprint(str(p) + '/'+ str(h//p))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Professor Dumbledore is helping Harry destroy the Horcruxes. He went to Gaunt Shack as he suspected a Horcrux to be present there. He saw Marvolo Gaunt's Ring and identified it as a Horcrux. Although he destroyed it, he is still affected by its curse. Professor Snape is helping Dumbledore remove the curse. For this, he wants to give Dumbledore exactly *x* drops of the potion he made. \n\nValue of *x* is calculated as maximum of *p*·*a**i*<=+<=*q*·*a**j*<=+<=*r*·*a**k* for given *p*,<=*q*,<=*r* and array *a*1,<=*a*2,<=... *a**n* such that 1<=≤<=*i*<=≤<=*j*<=≤<=*k*<=≤<=*n*. Help Snape find the value of *x*. Do note that the value of *x* may be negative.",
"input": "",
"output": "```python\n# Define a lambda function to take input as integers from standard input\ncin = lambda: map(int, input().split())\n\n# Read in the input values: n, p, q, r and the array A\nn, p, q, r = cin()\nA = list(cin())\n\n# Initialize the variables tp, tq, and tr to negative infinity\ntp, tq, tr = -float(\"inf\"), -float(\"inf\"), -float(\"inf\")\n\n# Loop through the elements in the array A\nfor a in A:\n # Compute the maximum value of p*a seen so far and store it in tp\n tp = max(tp, p * a)\n \n # Compute the maximum value of tp+q*a seen so far and store it in tq\n tq = max(tq, tp + q * a)\n \n # Compute the maximum value of tq+r*a seen so far and store it in tr\n tr = max(tr, tq + r * a)\n\n# Print the value of tr, which represents the maximum value of (p * A[i] + q * A[j] + r * A[k])\nprint(tr)\n\n \t \t\t \t \t \t \t\t\t \t\t\t \t\t\t\t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kuriyama Mirai has killed many monsters and got many (namely *n*) stones. She numbers the stones from 1 to *n*. The cost of the *i*-th stone is *v**i*. Kuriyama Mirai wants to know something about these stones so she will ask you two kinds of questions:\n 1. She will tell you two numbers, *l* and *r* (1<=≤<=*l*<=≤<=*r*<=≤<=*n*), and you should tell her . 1. Let *u**i* be the cost of the *i*-th cheapest stone (the cost that will be on the *i*-th place if we arrange all the stone costs in non-decreasing order). This time she will tell you two numbers, *l* and *r* (1<=≤<=*l*<=≤<=*r*<=≤<=*n*), and you should tell her . \nFor every question you should give the correct answer, or Kuriyama Mirai will say \"fuyukai desu\" and then become unhappy.",
"input": "",
"output": "```python\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nsrr = arr[:]\r\nsrr.sort()\r\n\r\nfor i in range(1, n) :\r\n arr[i] += arr[i-1]\r\n srr[i] += srr[i-1]\r\n \r\nfor i in range(int(input())) :\r\n x, l, r = map(int, input().split())\r\n \r\n if x == 1:\r\n print(arr[r-1]-(arr[l-2] if l > 1 else 0))\r\n else :\r\n print(srr[r-1]-(srr[l-2] if l > 1 else 0))\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sereja has an array *a*, consisting of *n* integers *a*1, *a*2, ..., *a**n*. The boy cannot sit and do nothing, he decided to study an array. Sereja took a piece of paper and wrote out *m* integers *l*1,<=*l*2,<=...,<=*l**m* (1<=≤<=*l**i*<=≤<=*n*). For each number *l**i* he wants to know how many distinct numbers are staying on the positions *l**i*, *l**i*<=+<=1, ..., *n*. Formally, he want to find the number of distinct numbers among *a**l**i*,<=*a**l**i*<=+<=1,<=...,<=*a**n*.?\n\nSereja wrote out the necessary array elements but the array was so large and the boy was so pressed for time. Help him, find the answer for the described question for each *l**i*.",
"input": "",
"output": "```python\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor i in range(m):\r\n k=int(input())\r\n t=set(l[k-1:])\r\n print(len(t))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The hero of our story, Valera, and his best friend Arcady are still in school, and therefore they spend all the free time playing turn-based strategy \"GAGA: Go And Go Again\". The gameplay is as follows. \n\nThere are two armies on the playing field each of which consists of *n* men (*n* is always even). The current player specifies for each of her soldiers an enemy's soldier he will shoot (a target) and then all the player's soldiers shot simultaneously. This is a game world, and so each soldier shoots perfectly, that is he absolutely always hits the specified target. If an enemy soldier is hit, he will surely die. It may happen that several soldiers had been indicated the same target. Killed soldiers do not participate in the game anymore. \n\nThe game \"GAGA\" consists of three steps: first Valera makes a move, then Arcady, then Valera again and the game ends. \n\nYou are asked to calculate the maximum total number of soldiers that may be killed during the game.",
"input": "",
"output": "```python\nn=int(input())\r\nprint(int(n*1.5))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A permutation of size *n* is an array of size *n* such that each integer from 1 to *n* occurs exactly once in this array. An inversion in a permutation *p* is a pair of indices (*i*,<=*j*) such that *i*<=><=*j* and *a**i*<=<<=*a**j*. For example, a permutation [4,<=1,<=3,<=2] contains 4 inversions: (2,<=1), (3,<=1), (4,<=1), (4,<=3).\n\nYou are given a permutation *a* of size *n* and *m* queries to it. Each query is represented by two indices *l* and *r* denoting that you have to reverse the segment [*l*,<=*r*] of the permutation. For example, if *a*<==<=[1,<=2,<=3,<=4] and a query *l*<==<=2, *r*<==<=4 is applied, then the resulting permutation is [1,<=4,<=3,<=2].\n\nAfter each query you have to determine whether the number of inversions is odd or even.",
"input": "",
"output": "```python\nn = int(input())\r\n*a, = map(int, input().split())\r\np = 0\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if a[i] > a[j]:\r\n p ^= 1\r\nm = int(input())\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n k = r - l + 1\r\n k = k * (k - 1) // 2\r\n if k & 1:\r\n p ^= 1\r\n print('eovdedn'[p :: 2])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently learned at school what a number's divisor is and decided to determine a string's divisor. Here is what he came up with.\n\nString *a* is the divisor of string *b* if and only if there exists a positive integer *x* such that if we write out string *a* consecutively *x* times, we get string *b*. For example, string \"abab\" has two divisors — \"ab\" and \"abab\".\n\nNow Vasya wants to write a program that calculates the number of common divisors of two strings. Please help him.",
"input": "",
"output": "```python\ndef prefix(p,ss,l):\r\n s=p+'*'+ss\r\n n=len(s)\r\n arr=[0]*(n+1)\r\n i=0\r\n j=1\r\n cou=0\r\n while j0:\r\n i=arr[i-1]\r\n if(s[j]==s[i]):\r\n arr[j]=i+1\r\n i+=1\r\n j+=1\r\n else:\r\n arr[j]=arr[i]\r\n\r\n j+=1\r\n for i in range(l-1,len(ss),l):\r\n if(arr[i+len(p)+1]==l):\r\n cou+=1\r\n \r\n \r\n #print(arr,l,s,cou)\r\n return cou\r\n\r\nfrom math import sqrt\r\ns1=input()\r\ns2=input()\r\nl1=len(s1)\r\nl2=len(s2)\r\nif(l1>l2):\r\n l1,l2=l2,l1\r\n s1,s2=s2,s1\r\nd=[]\r\nfor i in range(1,int(sqrt(l1))+1):\r\n if(l1%i==0):\r\n d.append(i)\r\n if(i!=l1//i):\r\n d.append(l1//i)\r\nd.sort()\r\ns=\"\"\r\ncou=0\r\n#print(d)\r\nfor i in d:\r\n le=len(s)\r\n for j in range(le,i,1):\r\n s+=s1[j]\r\n n1=prefix(s,s1,i)\r\n n2=prefix(s,s2,i)\r\n if(n1==l1//i and n2==l2//i and l1%i==0 and l2%i==0):\r\n cou+=1\r\nprint(cou)\r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently, you bought a brand new smart lamp with programming features. At first, you set up a schedule to the lamp. Every day it will turn power on at moment $0$ and turn power off at moment $M$. Moreover, the lamp allows you to set a program of switching its state (states are \"lights on\" and \"lights off\"). Unfortunately, some program is already installed into the lamp.\n\nThe lamp allows only good programs. Good program can be represented as a non-empty array $a$, where $0 < a_1 < a_2 < \\dots < a_{|a|} < M$. All $a_i$ must be integers. Of course, preinstalled program is a good program.\n\nThe lamp follows program $a$ in next manner: at moment $0$ turns power and light on. Then at moment $a_i$ the lamp flips its state to opposite (if it was lit, it turns off, and vice versa). The state of the lamp flips instantly: for example, if you turn the light off at moment $1$ and then do nothing, the total time when the lamp is lit will be $1$. Finally, at moment $M$ the lamp is turning its power off regardless of its state.\n\nSince you are not among those people who read instructions, and you don't understand the language it's written in, you realize (after some testing) the only possible way to alter the preinstalled program. You can insert at most one element into the program $a$, so it still should be a good program after alteration. Insertion can be done between any pair of consecutive elements of $a$, or even at the begining or at the end of $a$.\n\nFind such a way to alter the program that the total time when the lamp is lit is maximum possible. Maybe you should leave program untouched. If the lamp is lit from $x$ till moment $y$, then its lit for $y - x$ units of time. Segments of time when the lamp is lit are summed up.",
"input": "",
"output": "```python\n# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Oct 16 16:27:20 2022\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\nn,M=map(int, input().split())\r\narray=list(map(int, input().split()))\r\ngap=[array[0]]\r\nfor i in range(n-1):\r\n gap.append(array[i+1]-array[i])\r\ngap.append(M-array[-1])\r\ngap_1=gap[::2]\r\ngap_2=gap[1::2]\r\nsumming_1=[gap_1[0]]\r\nfor i in range(len(gap_1)-1):\r\n summing_1.append(summing_1[i]+gap_1[i+1])\r\nsumming_2=[gap_2[0]]\r\nfor i in range(len(gap_2)-1):\r\n summing_2.append(summing_2[i]+gap_2[i+1])\r\nt=max(summing_1[-1],summing_1[0]+summing_2[-1]-1)\r\nfor j in range(1,len(gap_2)):\r\n t=max(t, summing_1[j]+summing_2[-1]-summing_2[j-1]-1)\r\nprint(t)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has become interested in wrestling. In wrestling wrestlers use techniques for which they are awarded points by judges. The wrestler who gets the most points wins.\n\nWhen the numbers of points of both wrestlers are equal, the wrestler whose sequence of points is lexicographically greater, wins.\n\nIf the sequences of the awarded points coincide, the wrestler who performed the last technique wins. Your task is to determine which wrestler won.",
"input": "",
"output": "```python\na=int(input())\r\n\r\nC=[]\r\nD=[]\r\nc=0\r\nd=0\r\nfor i in range(a):\r\n\tb=int(input())\r\n\tif b>0:\r\n\t\tc+=b\r\n\t\tC+=[str(b)]\r\n\tif b<0:\r\n\t\td+=-b\r\n\t\tD+=[str(-b)]\r\nif c>d:\r\n\tprint('first')\r\nelif cD:\r\n\t\tprint('first')\r\n\tif C0:\r\n\t\t\tprint('first')\r\n\t\telse:\r\n\t\t\tprint('second')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently Adaltik discovered japanese crosswords. Japanese crossword is a picture, represented as a table sized *a*<=×<=*b* squares, and each square is colored white or black. There are integers to the left of the rows and to the top of the columns, encrypting the corresponding row or column. The number of integers represents how many groups of black squares there are in corresponding row or column, and the integers themselves represents the number of consecutive black squares in corresponding group (you can find more detailed explanation in Wikipedia [https://en.wikipedia.org/wiki/Japanese_crossword](https://en.wikipedia.org/wiki/Japanese_crossword)).\n\nAdaltik decided that the general case of japanese crossword is too complicated and drew a row consisting of *n* squares (e.g. japanese crossword sized 1<=×<=*n*), which he wants to encrypt in the same way as in japanese crossword.\n\nHelp Adaltik find the numbers encrypting the row he drew.",
"input": "",
"output": "```python\nn=int(input())\ns=input()\nl=[]\ncount = 0\nfor i in range(n):\n if s[i] == 'B':\n count+=1\n if i == n-1: l.append(count)\n else:\n if count>0 : l.append(count)\n count = 0\nprint(len(l))\nprint(*l)\n \t \t \t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Every year, hundreds of people come to summer camps, they learn new algorithms and solve hard problems.\n\nThis is your first year at summer camp, and you are asked to solve the following problem. All integers starting with 1 are written in one line. The prefix of these line is \"123456789101112131415...\". Your task is to print the *n*-th digit of this string (digits are numbered starting with 1.",
"input": "",
"output": "```python\na = int(input())\r\ns = \"\"\r\ni = 1\r\nwhile len(s) < a:\r\n s+=str(i)\r\n i+=1\r\nprint(s[a-1])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Someday, Drazil wanted to go on date with Varda. Drazil and Varda live on Cartesian plane. Drazil's home is located in point (0,<=0) and Varda's home is located in point (*a*,<=*b*). In each step, he can move in a unit distance in horizontal or vertical direction. In other words, from position (*x*,<=*y*) he can go to positions (*x*<=+<=1,<=*y*), (*x*<=-<=1,<=*y*), (*x*,<=*y*<=+<=1) or (*x*,<=*y*<=-<=1). \n\nUnfortunately, Drazil doesn't have sense of direction. So he randomly chooses the direction he will go to in each step. He may accidentally return back to his house during his travel. Drazil may even not notice that he has arrived to (*a*,<=*b*) and continue travelling. \n\nLuckily, Drazil arrived to the position (*a*,<=*b*) successfully. Drazil said to Varda: \"It took me exactly *s* steps to travel from my house to yours\". But Varda is confused about his words, she is not sure that it is possible to get from (0,<=0) to (*a*,<=*b*) in exactly *s* steps. Can you find out if it is possible for Varda?",
"input": "",
"output": "```python\na, b, s = (map(int, input().split()))\r\nif a + b < s and abs(a + b - s) % 2 != 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "For a given positive integer *n* denote its *k*-rounding as the minimum positive integer *x*, such that *x* ends with *k* or more zeros in base 10 and is divisible by *n*.\n\nFor example, 4-rounding of 375 is 375·80<==<=30000. 30000 is the minimum integer such that it ends with 4 or more zeros and is divisible by 375.\n\nWrite a program that will perform the *k*-rounding of *n*.",
"input": "",
"output": "```python\nl = input().split()\nn = int(l[0])\nk = int(l[1])\n\n\ndef zero_am(num):\n res = 0\n while num % 10 == 0:\n num /= 10\n res += 1\n return res\n\ns = [1, 2, 4, 5, 6, 8]\nl = {}\nm = 0\nfor i in reversed(s):\n l.update({zero_am(n * i): n * i})\n if zero_am(n * i) > m:\n m = zero_am(n * i)\nans = l[m]\nfor i in range(m, k):\n ans *= 10\nprint(ans)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "DZY loves chessboard, and he enjoys playing with it.\n\nHe has a chessboard of *n* rows and *m* columns. Some cells of the chessboard are bad, others are good. For every good cell, DZY wants to put a chessman on it. Each chessman is either white or black. After putting all chessmen, DZY wants that no two chessmen with the same color are on two adjacent cells. Two cells are adjacent if and only if they share a common edge.\n\nYou task is to find any suitable placement of chessmen on the given chessboard.",
"input": "",
"output": "```python\nn, m = map(int, input().split())\r\nM = []\r\nfor _ in range(n):\r\n row = input()\r\n M.append(list(row))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if M[i][j] == '-':\r\n continue\r\n else:\r\n if i == 0:\r\n if j == 0:\r\n M[i][j] = 'B'\r\n else:\r\n if M[i][j - 1] == 'B':\r\n M[i][j] = 'W'\r\n else:\r\n M[i][j] = 'B'\r\n else:\r\n if j == 0:\r\n if M[i - 1][j] == 'B':\r\n M[i][j] = 'W'\r\n else:\r\n M[i][j] = 'B'\r\n else:\r\n if M[i - 1][j] == 'B' or M[i][j - 1] == 'B':\r\n M[i][j] = 'W'\r\n elif M[i - 1][j] == 'W' or M[i][j - 1] == 'W':\r\n M[i][j] = 'B'\r\n else:\r\n M[i][j] = 'B'\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n print(M[i][j], end='')\r\n print()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A wise man told Kerem \"Different is good\" once, so Kerem wants all things in his life to be different. \n\nKerem recently got a string *s* consisting of lowercase English letters. Since Kerem likes it when things are different, he wants all substrings of his string *s* to be distinct. Substring is a string formed by some number of consecutive characters of the string. For example, string \"aba\" has substrings \"\" (empty substring), \"a\", \"b\", \"a\", \"ab\", \"ba\", \"aba\".\n\nIf string *s* has at least two equal substrings then Kerem will change characters at some positions to some other lowercase English letters. Changing characters is a very tiring job, so Kerem want to perform as few changes as possible.\n\nYour task is to find the minimum number of changes needed to make all the substrings of the given string distinct, or determine that it is impossible.",
"input": "",
"output": "```python\ndef solve():\r\n n=int(input())\r\n st=input()\r\n\r\n\r\n lst=list(st)\r\n s=set(lst)\r\n n-=len(s)\r\n # print(n-len(s))\r\n\r\n if n<27:\r\n print(n)\r\n else:\r\n print(-1)\r\n \r\n \r\n \r\n# t=int(input())\r\n# for i in range(t):\r\nsolve()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.\n\nEmbosser is a special devise that allows to \"print\" the text of a plastic tape. Text is printed sequentially, character by character. The device consists of a wheel with a lowercase English letters written in a circle, static pointer to the current letter and a button that print the chosen letter. At one move it's allowed to rotate the alphabetic wheel one step clockwise or counterclockwise. Initially, static pointer points to letter 'a'. Other letters are located as shown on the picture:\n\nAfter Grigoriy add new item to the base he has to print its name on the plastic tape and attach it to the corresponding exhibit. It's not required to return the wheel to its initial position with pointer on the letter 'a'.\n\nOur hero is afraid that some exhibits may become alive and start to attack him, so he wants to print the names as fast as possible. Help him, for the given string find the minimum number of rotations of the wheel required to print it.",
"input": "",
"output": "```python\ninpt1 = input().strip()\r\ninput1 = list(inpt1)\r\n\r\nstarts_with = ord('a')\r\nends_with = ord('z')\r\n\r\nsum = 0\r\nprev= \"a\"\r\nfor char in input1:\r\n curr = ord(char)\r\n prev_ord = ord(prev)\r\n if curr >= prev_ord:\r\n sum += min(prev_ord-starts_with+ends_with-curr + 1, curr - prev_ord)\r\n else:\r\n sum += min(prev_ord-curr, ends_with-prev_ord + curr-starts_with+1)\r\n prev = char\r\nprint(sum)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have decided to watch the best moments of some movie. There are two buttons on your player: \n 1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie. 1. Skip exactly *x* minutes of the movie (*x* is some fixed positive integer). If the player is now at the *t*-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (*t*<=+<=*x*). \nInitially the movie is turned on in the player on the first minute, and you want to watch exactly *n* best moments of the movie, the *i*-th best moment starts at the *l**i*-th minute and ends at the *r**i*-th minute (more formally, the *i*-th best moment consists of minutes: *l**i*,<=*l**i*<=+<=1,<=...,<=*r**i*). \n\nDetermine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?",
"input": "",
"output": "```python\n#include \r\n#define nline \"\\n\"\r\n#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)\r\n#define MOD 1000000007\r\n#define loop(i,a,b) for(int i=(a);i<(b);i++)\r\n\r\nusing namespace std;\r\nvoid file_I_O() {\r\n fastio();\r\n#ifndef ONLINE_JUDGE\r\n freopen(\"input.txt\", \"r\", stdin);\r\n freopen(\"output.txt\", \"w\", stdout);\r\n#endif\r\n}\r\nint main()\r\n{\r\n file_I_O();\r\n\r\n int n , x;\r\n cin >> n >> x ;\r\n int timer = 1, wt = 0 ;\r\n int counter = 0;\r\n while (n--) {\r\n int l , r ;\r\n cin >> l >> r;\r\n timer += x * ((l - timer) / x);\r\n\r\n wt += r - timer + 1;\r\n timer = r + 1;\r\n\r\n\r\n }\r\n cout << wt;\r\n}\r\n\r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once Bob got to a sale of old TV sets. There were *n* TV sets at that sale. TV set with index *i* costs *a**i* bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV sets he wants. Though he's very strong, Bob can carry at most *m* TV sets, and he has no desire to go to the sale for the second time. Please, help Bob find out the maximum sum of money that he can earn.",
"input": "",
"output": "```python\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=[]\r\nfor i in range (m):\r\n l.append(min(a))\r\n a.remove(min(a))\r\nprint(abs(sum(l)))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently Polycarp started to develop a text editor that works only with correct bracket sequences (abbreviated as CBS). \n\nNote that a bracket sequence is correct if it is possible to get a correct mathematical expression by adding \"+\"-s and \"1\"-s to it. For example, sequences \"(())()\", \"()\" and \"(()(()))\" are correct, while \")(\", \"(()\" and \"(()))(\" are not. Each bracket in CBS has a pair. For example, in \"(()(()))\":\n - 1st bracket is paired with 8th, - 2d bracket is paired with 3d, - 3d bracket is paired with 2d, - 4th bracket is paired with 7th, - 5th bracket is paired with 6th, - 6th bracket is paired with 5th, - 7th bracket is paired with 4th, - 8th bracket is paired with 1st. \nPolycarp's editor currently supports only three operations during the use of CBS. The cursor in the editor takes the whole position of one of the brackets (not the position between the brackets!). There are three operations being supported:\n - «L» — move the cursor one position to the left, - «R» — move the cursor one position to the right, - «D» — delete the bracket in which the cursor is located, delete the bracket it's paired to and all brackets between them (that is, delete a substring between the bracket in which the cursor is located and the one it's paired to). \nAfter the operation \"D\" the cursor moves to the nearest bracket to the right (of course, among the non-deleted). If there is no such bracket (that is, the suffix of the CBS was deleted), then the cursor moves to the nearest bracket to the left (of course, among the non-deleted). \n\nThere are pictures illustrated several usages of operation \"D\" below.\n\nAll incorrect operations (shift cursor over the end of CBS, delete the whole CBS, etc.) are not supported by Polycarp's editor.\n\nPolycarp is very proud of his development, can you implement the functionality of his editor?",
"input": "",
"output": "```python\ndef f1(m2, s):\r\n m2 = {}\r\n st = []\r\n for i in range(len(s)):\r\n if s[i] == '(':\r\n st.append(i)\r\n else:\r\n m2[st[-1]] = i\r\n m2[i] = st[-1]\r\n st.pop()\r\n return m2\r\n\r\nn, m, p = map(int, input().split())\r\ns = input()\r\na = input()\r\nm = {}\r\nm = f1(m, s)\r\n\r\nj = p - 1\r\nmi = 1000000007\r\nma = -mi\r\nwas = 0\r\nfor i in a:\r\n d = j\r\n if i == 'L':\r\n j -= 1\r\n elif i == 'R':\r\n j += 1\r\n else:\r\n k = ''\r\n iznwas = was\r\n d2, m2 = min(d, m[d]), max(d, m[d])\r\n for re in range(d2):\r\n k += s[re]\r\n for re in range(m2 + 1, len(s)):\r\n k += s[re]\r\n s = k\r\n m = f1(m, s)\r\n if j >= len(s) - 1:\r\n j = len(s) - 2\r\n d += 1\r\nprint(s)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.\n\nEmbosser is a special devise that allows to \"print\" the text of a plastic tape. Text is printed sequentially, character by character. The device consists of a wheel with a lowercase English letters written in a circle, static pointer to the current letter and a button that print the chosen letter. At one move it's allowed to rotate the alphabetic wheel one step clockwise or counterclockwise. Initially, static pointer points to letter 'a'. Other letters are located as shown on the picture:\n\nAfter Grigoriy add new item to the base he has to print its name on the plastic tape and attach it to the corresponding exhibit. It's not required to return the wheel to its initial position with pointer on the letter 'a'.\n\nOur hero is afraid that some exhibits may become alive and start to attack him, so he wants to print the names as fast as possible. Help him, for the given string find the minimum number of rotations of the wheel required to print it.",
"input": "",
"output": "```python\ns1='abcdefghijklmnopqrstuvwxyz'\r\ns=input()\r\nj=0\r\nk=0\r\nfor i in range(len(s)):\r\n j1=s1.index(s[i])\r\n a=abs(j-j1)\r\n if a <=13:\r\n k+=a\r\n j=j1\r\n else:\r\n k+=26-a\r\n j=j1\r\nprint(k)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "All cities of Lineland are located on the *Ox* coordinate axis. Thus, each city is associated with its position *x**i* — a coordinate on the *Ox* axis. No two cities are located at a single point.\n\nLineland residents love to send letters to each other. A person may send a letter only if the recipient lives in another city (because if they live in the same city, then it is easier to drop in).\n\nStrange but true, the cost of sending the letter is exactly equal to the distance between the sender's city and the recipient's city.\n\nFor each city calculate two values *min**i* and *max**i*, where *min**i* is the minimum cost of sending a letter from the *i*-th city to some other city, and *max**i* is the the maximum cost of sending a letter from the *i*-th city to some other city",
"input": "",
"output": "```python\nn = int(input())\r\ncities = list(map(int,input().split(' ')))\r\nfor i in range(len(cities)):\r\n if i == 0:\r\n cost_min = abs(cities[i] - cities[1])\r\n cost_max = abs(cities[i] - cities[-1])\r\n elif i == len(cities)-1:\r\n cost_min = abs(cities[i] - cities[-2])\r\n cost_max = abs(cities[i] - cities[0])\r\n else:\r\n cost_min = min(abs(cities[i] - cities[i-1]), abs(cities[i] - cities[i+1]))\r\n cost_max = max(abs(cities[i] - cities[0]), abs(cities[i] - cities[-1]))\r\n print(cost_min, cost_max)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ivan has a robot which is situated on an infinite grid. Initially the robot is standing in the starting cell (0,<=0). The robot can process commands. There are four types of commands it can perform:\n - U — move from the cell (*x*,<=*y*) to (*x*,<=*y*<=+<=1); - D — move from (*x*,<=*y*) to (*x*,<=*y*<=-<=1); - L — move from (*x*,<=*y*) to (*x*<=-<=1,<=*y*); - R — move from (*x*,<=*y*) to (*x*<=+<=1,<=*y*). \nIvan entered a sequence of *n* commands, and the robot processed it. After this sequence the robot ended up in the starting cell (0,<=0), but Ivan doubts that the sequence is such that after performing it correctly the robot ends up in the same cell. He thinks that some commands were ignored by robot. To acknowledge whether the robot is severely bugged, he needs to calculate the maximum possible number of commands that were performed correctly. Help Ivan to do the calculations!",
"input": "",
"output": "```python\nn=int(input())\na=input()\nb=[0,0]\ncount=0\nfor i in a:\n if i==\"L\":\n b[0]-=1\n count+=1\n if i == \"R\":\n b[0]+=1\n count += 1\n if i == \"U\":\n b[1]+=1\n count += 1\n if i == \"D\":\n b[1]-=1\n count += 1\n if b[0]==0 and b[1]==0:\n print(count)\n break\n if count==n:\n print(0)\n \t\t\t \t \t\t \t\t\t \t \t \t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In a far away kingdom lived the King, the Prince, the Shoemaker, the Dressmaker and many other citizens. They lived happily until great trouble came into the Kingdom. The ACMers settled there.\n\nMost damage those strange creatures inflicted upon the kingdom was that they loved high precision numbers. As a result, the Kingdom healers had already had three appointments with the merchants who were asked to sell, say, exactly 0.273549107 beer barrels. To deal with the problem somehow, the King issued an order obliging rounding up all numbers to the closest integer to simplify calculations. Specifically, the order went like this:\n- If a number's integer part does not end with digit 9 and its fractional part is strictly less than 0.5, then the rounded up number coincides with the number’s integer part. - If a number's integer part does not end with digit 9 and its fractional part is not less than 0.5, the rounded up number is obtained if we add 1 to the last digit of the number’s integer part.- If the number’s integer part ends with digit 9, to round up the numbers one should go to Vasilisa the Wise. In the whole Kingdom she is the only one who can perform the tricky operation of carrying into the next position. \nMerchants found the algorithm very sophisticated and they asked you (the ACMers) to help them. Can you write a program that would perform the rounding according to the King’s order?",
"input": "",
"output": "```python\nn, f = input().split(\".\")\r\nif n[-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n n = int(n)\r\n print(n if int(f[0]) < 5 else n+1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasily has a deck of cards consisting of *n* cards. There is an integer on each of the cards, this integer is between 1 and 100<=000, inclusive. It is possible that some cards have the same integers on them.\n\nVasily decided to sort the cards. To do this, he repeatedly takes the top card from the deck, and if the number on it equals the minimum number written on the cards in the deck, then he places the card away. Otherwise, he puts it under the deck and takes the next card from the top, and so on. The process ends as soon as there are no cards in the deck. You can assume that Vasily always knows the minimum number written on some card in the remaining deck, but doesn't know where this card (or these cards) is.\n\nYou are to determine the total number of times Vasily takes the top card from the deck.",
"input": "",
"output": "```python\ndef read():\r\n return [int(x) for x in input().split()]\r\nnotimportant = int(input()[0])\r\nx = read()\r\ncounter =0\r\nind=0\r\nwhile len(x)>0:\r\n m = x.index(min(x))\r\n if m len(power)):\n print(max(power))\nelse:\n pontos = 0\n ultimo = 0\n while True:\n if(pontos == k):\n print(ultimo)\n break\n if(power[0] > power[1]):\n if(power[0] != ultimo):\n pontos = 0\n ultimo = power[0]\n aux = power[0]\n power[0] = power[1]\n power[1] = aux\n pontos += 1\n power.append(power.popleft())\n else:\n if(power[0] != ultimo):\n pontos = 0\n ultimo = power[1]\n pontos += 1\n power.append(power.popleft())\n \t\t \t \t\t \t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\nt=int(input())\nfor t in range(t):\ns=input()\nn=len(s)p\nif n<=10:\nprint(s)\nelse:\ns1=s[0]+str(n-2)+s[-1]\nprint(s1)\n#sdfbsr\n \t \t \t\t \t\t \t \t\t \t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You're given a list of *n* strings *a*1,<=*a*2,<=...,<=*a**n*. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest.\n\nGiven the list of strings, output the lexicographically smallest concatenation.",
"input": "",
"output": "```python\n#include\ntypedef long long int ll;\nusing namespace std;\n\nbool comp(string a, string b)\n{\n\treturn a + b < b + a;\n}\n\nint main()\n{\n\tint i, j, k;\n\tint r, m;\n\tcin >> r;\n\tstring *s = new string[r];\n\tfor (i = 0; i < r; i++)\n\t\tcin >> s[i];\n\n\tsort(s, s + n, comp);\n\n\tfor (i = 0; i < r; i++)\n\t\tcout << s[i];\n\n\treturn 0;\n}\n\t\t \t \t\t\t \t \t \t\t \t\t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mister B once received a gift: it was a book about aliens, which he started read immediately. This book had *c* pages.\n\nAt first day Mister B read *v*0 pages, but after that he started to speed up. Every day, starting from the second, he read *a* pages more than on the previous day (at first day he read *v*0 pages, at second — *v*0<=+<=*a* pages, at third — *v*0<=+<=2*a* pages, and so on). But Mister B is just a human, so he physically wasn't able to read more than *v*1 pages per day.\n\nAlso, to refresh his memory, every day, starting from the second, Mister B had to reread last *l* pages he read on the previous day. Mister B finished the book when he read the last page for the first time.\n\nHelp Mister B to calculate how many days he needed to finish the book.",
"input": "",
"output": "```python\nc,v0,v1,a,l = map(int,input().strip().split(' '))\n\ntp = c - min(v0,v1)\nans = 1\n\nif tp <= 0:\n\tans = 1\nelse:\n\ti = 1\n\twhile tp > 0:\n\t\tcp = v0 + i*a\n\t\tcp = min(v1,cp)\n\t\ttp = tp - cp + l\n\t\tans+= 1\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "It's one more school day now. Sasha doesn't like classes and is always bored at them. So, each day he invents some game and plays in it alone or with friends.\n\nToday he invented one simple game to play with Lena, with whom he shares a desk. The rules are simple. Sasha draws *n* sticks in a row. After that the players take turns crossing out exactly *k* sticks from left or right in each turn. Sasha moves first, because he is the inventor of the game. If there are less than *k* sticks on the paper before some turn, the game ends. Sasha wins if he makes strictly more moves than Lena. Sasha wants to know the result of the game before playing, you are to help him.",
"input": "",
"output": "```python\na, b = list(map(int, input().split()))\r\n\r\nif a // b % 2 == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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 the ATM structure, you can get at most *k* bills from it, and the bills may be of at most two distinct denominations.\n\nFor example, if a country uses bills with denominations 10, 50, 100, 500, 1000 and 5000 burles, then at *k*<==<=20 such ATM can give sums 100<=000 burles and 96<=000 burles, but it cannot give sums 99<=000 and 101<=000 burles.\n\nLet's suppose that the country uses bills of *n* distinct denominations, and the ATM that you are using has an unlimited number of bills of each type. You know that during the day you will need to withdraw a certain amount of cash *q* times. You know that when the ATM has multiple ways to give money, it chooses the one which requires the minimum number of bills, or displays an error message if it cannot be done. Determine the result of each of the *q* of requests for cash withdrawal.",
"input": "",
"output": "```python\nd = {0: 0}\r\nfor q in t:\r\n for i in range(1, k + 1): d[q * i] = i\r\n\r\nfor j in range(int(input())):\r\n x = int(input())\r\n p = [q + d[x - i] for q, i in d.items() if x - i in d]\r\n if p: p = min(p)\r\n print(p if p and p <= k else -1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Alex doesn't like boredom. That's why whenever he gets bored, he comes up with games. One long winter evening he came up with a game and decided to play it.\n\nGiven a sequence *a* consisting of *n* integers. The player can make several steps. In a single step he can choose an element of the sequence (let's denote it *a**k*) and delete it, at that all elements equal to *a**k*<=+<=1 and *a**k*<=-<=1 also must be deleted from the sequence. That step brings *a**k* points to the player. \n\nAlex is a perfectionist, so he decided to get as many points as possible. Help him.",
"input": "",
"output": "```python\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndp = [0] * n\r\nfor i in range(n):\r\nmax_dp_j = 0\r\nfor j in range(i):\r\nif abs(a[i] - a[j]) <= 1:\r\ncontinue\r\nmax_dp_j = max(max_dp_j, dp[j])\r\ndp[i] = max_dp_j + a[i]\r\n\r\nprint(max(dp))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarpus has a sequence, consisting of *n* non-negative integers: *a*1,<=*a*2,<=...,<=*a**n*.\n\nLet's define function *f*(*l*,<=*r*) (*l*,<=*r* are integer, 1<=≤<=*l*<=≤<=*r*<=≤<=*n*) for sequence *a* as an operation of bitwise OR of all the sequence elements with indexes from *l* to *r*. Formally: *f*(*l*,<=*r*)<==<=*a**l* | *a**l*<=+<=1 | ... | *a**r*. \n\nPolycarpus took a piece of paper and wrote out the values of function *f*(*l*,<=*r*) for all *l*,<=*r* (*l*,<=*r* are integer, 1<=≤<=*l*<=≤<=*r*<=≤<=*n*). Now he wants to know, how many distinct values he's got in the end. \n\nHelp Polycarpus, count the number of distinct values of function *f*(*l*,<=*r*) for the given sequence *a*.\n\nExpression *x* | *y* means applying the operation of bitwise OR to numbers *x* and *y*. This operation exists in all modern programming languages, for example, in language C++ and Java it is marked as \"|\", in Pascal — as \"or\".",
"input": "",
"output": "```python\n# Author Name: Ajay Meena\r\n# Codeforce : https://codeforces.com/profile/majay1638\r\nimport sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nfrom bisect import bisect_right\r\nfrom sys import stdin, stdout\r\n\r\n# -------------- INPUT FUNCTIONS ------------------\r\n\r\n\r\ndef get_ints_in_variables(): return map(\r\n int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_int(): return int(sys.stdin.readline())\r\n\r\n\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\n\r\n\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\n# -------- SOME CUSTOMIZED FUNCTIONS-----------\r\n\r\n\r\ndef myceil(x, y): return (x + y - 1) // y\r\n\r\n# -------------- SOLUTION FUNCTION ------------------\r\n\r\n\r\ndef Solution():\r\n # Write Your Code Here\r\n n = get_int()\r\n arr = get_ints_in_list()\r\n pre = [-1 for _ in range(20)]\r\n pos = [-1 for _ in range(20)]\r\n ain = [False for _ in range(pow(10, 6)+1)]\r\n cnt = 0\r\n for i in range(n):\r\n for j in range(20-1, -1, -1):\r\n if arr[i] & (1 << j):\r\n pre[j] = i\r\n val = arr[i]\r\n if not ain[val]:\r\n # print(\"nsd\")\r\n cnt += 1\r\n ain[val] = True\r\n for j in range(20):\r\n pos[j] = pre[j]\r\n pos = sorted(pos)\r\n for j in range(20-1, -1, -1):\r\n if pos[j] != -1:\r\n val |= arr[pos[j]]\r\n # print(\"val\", val)\r\n if not ain[val]:\r\n cnt += 1\r\n ain[val] = True\r\n print(cnt)\r\n\r\n\r\ndef main():\r\n # Take input Here and Call solution function\r\n Solution()\r\n\r\n\r\n# calling main Function\r\nif __name__ == '__main__':\r\n main()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me lift the veil of secrecy.\n\nLara is going to explore yet another dangerous dungeon. Game designers decided to use good old 2D environment. The dungeon can be represented as a rectangle matrix of *n* rows and *m* columns. Cell (*x*,<=*y*) is the cell in the *x*-th row in the *y*-th column. Lara can move between the neighbouring by side cells in all four directions.\n\nMoreover, she has even chosen the path for herself to avoid all the traps. She enters the dungeon in cell (1,<=1), that is top left corner of the matrix. Then she goes down all the way to cell (*n*,<=1) — the bottom left corner. Then she starts moving in the snake fashion — all the way to the right, one cell up, then to the left to the cell in 2-nd column, one cell up. She moves until she runs out of non-visited cells. *n* and *m* given are such that she always end up in cell (1,<=2).\n\nLara has already moved to a neighbouring cell *k* times. Can you determine her current position?",
"input": "",
"output": "```python\ndef main():\n n, m, k = map(int, input().split())\n if k < n:\n print(k + 1, 1)\n else:\n y, x = divmod(k - n, m * 2 - 2)\n y *= 2\n if x < m - 1:\n x = x + 2\n else:\n x = m * 2 - x - 1\n y += 1\n print(n - y, x)\n\n\nif __name__ == '__main__':\n main()\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After the lessons *n* groups of schoolchildren went outside and decided to visit Polycarpus to celebrate his birthday. We know that the *i*-th group consists of *s**i* friends (1<=≤<=*s**i*<=≤<=4), and they want to go to Polycarpus together. They decided to get there by taxi. Each car can carry at most four passengers. What minimum number of cars will the children need if all members of each group should ride in the same taxi (but one taxi can take more than one group)?",
"input": "",
"output": "```python\nimport math\r\nn= int(input())\r\nl = list(map(int, input().split()))\r\nres = sum(l)\r\nans = math.ceil(res/4)\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Jon fought bravely to rescue the wildlings who were attacked by the white-walkers at Hardhome. On his arrival, Sam tells him that he wants to go to Oldtown to train at the Citadel to become a maester, so he can return and take the deceased Aemon's place as maester of Castle Black. Jon agrees to Sam's proposal and Sam sets off his journey to the Citadel. However becoming a trainee at the Citadel is not a cakewalk and hence the maesters at the Citadel gave Sam a problem to test his eligibility. \n\nInitially Sam has a list with a single element *n*. Then he has to perform certain operations on this list. In each operation Sam must remove any element *x*, such that *x*<=><=1, from the list and insert at the same position , , sequentially. He must continue with these operations until all the elements in the list are either 0 or 1.\n\nNow the masters want the total number of 1s in the range *l* to *r* (1-indexed). Sam wants to become a maester but unfortunately he cannot solve this problem. Can you help Sam to pass the eligibility test?",
"input": "",
"output": "```python\nnum = int(input())\nlowerBound = int(input())\nupperBound = int(input())\n\ndef rec(num):\n if num == 1 or num == 0:\n return [num] \n devision = rec(num//2)\n remain = rec(num%2)\n remain.extend(devision)\n devision.extend(remain)\n return devision\nones = rec(num)\nres= 0\nfor i in range(lowerBound, upperBound+1, 1):\n if ones[i] == 1:\n res+=1\nprint(res)\n \t\t\t\t\t\t \t \t\t \t\t\t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 seats in remaining rows. \n\nThe event coordinator has a list of *k* participants who should be picked up at the airport. When a participant gets on the bus, he will sit in the last row with an empty seat. If there is more than one empty seat in that row, he will take the leftmost one. \n\nIn order to keep track of the people who are on the bus, the event coordinator needs a figure showing which seats are going to be taken by *k* participants. Your task is to draw the figure representing occupied seats.",
"input": "",
"output": "```python\nn=int(input())\r\nub=\"+------------------------+\"\r\nlb=\"+------------------------+\"\r\nr1,r2,r3,r4=['|'],['|'],['|'],['|']\r\nfl=0\r\nif n<3:\r\n r3.append('#')\r\n r3.append('.')\r\nwhile n!=0:\r\n r1.append('O')\r\n r1.append('.')\r\n n-=1\r\n if n==0:\r\n break\r\n r2.append('O')\r\n r2.append('.')\r\n n-=1\r\n if n==0:\r\n break\r\n if fl!=1:\r\n r3.append('O')\r\n r3.append('.')\r\n n-=1\r\n fl=1\r\n else:\r\n r3.append('.')\r\n r3.append('.')\r\n if n==0:\r\n break\r\n r4.append('O')\r\n r4.append('.')\r\n n-=1\r\nwhile len(r1)!=23:\r\n r1.append('#')\r\n r1.append('.')\r\nr1.append('|D|)')\r\nwhile len(r2)!=23:\r\n r2.append('#')\r\n r2.append('.')\r\nr2.append('|.|')\r\nwhile len(r3)!=23:\r\n r3.append('.')\r\n r3.append('.')\r\nr3.append('..|')\r\nwhile len(r4)!=23:\r\n r4.append('#')\r\n r4.append('.')\r\nr4.append('|.|)')\r\nprint(ub)\r\nprint(\"\".join(r1))\r\nprint(\"\".join(r2))\r\nprint(\"\".join(r3))\r\nprint(\"\".join(r4))\r\nprint(lb)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "\"What a pity it's already late spring,\" sighs Mino with regret, \"one more drizzling night and they'd be gone.\"\n\n\"But these blends are at their best, aren't they?\" Absorbed in the landscape, Kanno remains optimistic. \n\nThe landscape can be expressed as a row of consecutive cells, each of which either contains a flower of colour amber or buff or canary yellow, or is empty.\n\nWhen a flower withers, it disappears from the cell that it originally belonged to, and it spreads petals of its colour in its two neighbouring cells (or outside the field if the cell is on the side of the landscape). In case petals fall outside the given cells, they simply become invisible.\n\nYou are to help Kanno determine whether it's possible that after some (possibly none or all) flowers shed their petals, at least one of the cells contains all three colours, considering both petals and flowers. Note that flowers can wither in arbitrary order.",
"input": "",
"output": "```python\nn = input()\r\np = n.split('.')\r\nk=[]\r\nfor j in range(len(p)):\r\n if 'ABC' in p[j]:\r\n k.append('Yes')\r\n if 'ACB' in p[j]:\r\n k.append('Yes')\r\n if 'BAC' in p[j]:\r\n k.append('Yes')\r\n if 'BCA' in p[j]:\r\n k.append('Yes')\r\n if 'CAB' in p[j]:\r\n k.append('Yes') \r\n if 'CBA' in p[j]:\r\n k.append('Yes')\r\n else:\r\n k.append('No')\r\ny=''\r\ny=y.join(k)\r\nif 'Yes' in y:\r\n print('Yes')\r\nelse:\r\n print('No')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given string *s*. Your task is to determine if the given string *s* contains two non-overlapping substrings \"AB\" and \"BA\" (the substrings can go in any order).",
"input": "",
"output": "```python\ns=input()\r\nx=\"AB\"\r\ny=\"AB\"\r\nif x in s and y in s:\r\n if (s.index(x)!=s.index(y)+1)or(s.index(y)!=s.index(x)):\r\n print(\"YES\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are a lot of things which could be cut — trees, paper, \"the rope\". In this problem you are going to cut a sequence of integers.\n\nThere is a sequence of integers, which contains the equal number of even and odd numbers. Given a limited budget, you need to make maximum possible number of cuts such that each resulting segment will have the same number of odd and even integers.\n\nCuts separate a sequence to continuous (contiguous) segments. You may think about each cut as a break between two adjacent elements in a sequence. So after cutting each element belongs to exactly one segment. Say, $[4, 1, 2, 3, 4, 5, 4, 4, 5, 5]$ $\\to$ two cuts $\\to$ $[4, 1 | 2, 3, 4, 5 | 4, 4, 5, 5]$. On each segment the number of even elements should be equal to the number of odd elements.\n\nThe cost of the cut between $x$ and $y$ numbers is $|x - y|$ bitcoins. Find the maximum possible number of cuts that can be made while spending no more than $B$ bitcoins.",
"input": "",
"output": "```python\nn, c = map(int, input().split())\nseq = [int(x) for x in input().split()]\n\ncnt = 0\ncuts = []\nfor a, b in zip(seq[:-1], seq[1:]):\n if a % 2:\n cnt -= 1\n else:\n cnt += 1\n if cnt == 0:\n cuts.append(abs(a-b))\n\ncuts.sort(reverse=True)\n\nans = 0\nwhile cuts and c-cuts[-1] >= 0:\n c -= cuts.pop()\n ans += 1\n\nprint(ans)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pavel loves grid mazes. A grid maze is an *n*<=×<=*m* rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly *k* empty cells into walls so that all the remaining cells still formed a connected area. Help him.",
"input": "",
"output": "```python\nfrom sys import stdin\r\nfrom collections import deque\r\ninp = stdin.readline\r\n\r\nn, m, k = map(int, inp().split())\r\narr = [[x for x in \"#\"*(m+2)]]\r\n\r\nfor _ in range(n):\r\n s = inp().strip()\r\n arr.append([x for x in \"#\" + s + \"#\"])\r\n\r\narr.append([x for x in \"#\"*(m+2)])\r\n\r\nq = deque()\r\ncount = 0\r\nfor i in range(1, n+1):\r\n if count == k:\r\n break\r\n for j in range(1, m+1):\r\n if count == k:\r\n break\r\n if arr[i][j] != \".\":\r\n continue\r\n\r\n a = [0]*9\r\n for x in range(9):\r\n if arr[i-1 + x//3][j-1 + x%3] == \".\":\r\n a[x] = 1\r\n\r\n if sum(a[1::2]) == 1:\r\n q.append((i, j))\r\n elif a[0] == a[1] == a[3] == 1 or a[1] == a[2] == a[5] == 1 or a[5] == a[8] == a[7] == 1 or \\\r\n a[7] == a[6] == a[3] == 1:\r\n arr[i][j] = \"X\"\r\n count += 1\r\n\r\nwhile q and count < k:\r\n c = q.popleft()\r\n i = c[0]\r\n j = c[1]\r\n done = 0\r\n\r\n if arr[i-1][j] == \".\":\r\n if done:\r\n q.pop()\r\n continue\r\n q.append((i-1, j))\r\n done = 1\r\n\r\n if arr[i][j+1] == \".\":\r\n if done:\r\n q.pop()\r\n continue\r\n q.append((i, j+1))\r\n done = 1\r\n\r\n if arr[i][j-1] == \".\":\r\n if done:\r\n q.pop()\r\n continue\r\n q.append((i, j-1))\r\n done = 1\r\n\r\n if arr[i+1][j] == \".\":\r\n if done:\r\n q.pop()\r\n continue\r\n q.append((i+1, j))\r\n done = 1\r\n\r\n arr[i][j] = \"X\"\r\n count += 1\r\n\r\nfor c in arr[1:-1]:\r\n print(*c[1:-1], sep=\"\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a game called \"I Wanna Be the Guy\", consisting of *n* levels. Little X and his friend Little Y are addicted to the game. Each of them wants to pass the whole game.\n\nLittle X can pass only *p* levels of the game. And Little Y can pass only *q* levels of the game. You are given the indices of levels Little X can pass and the indices of levels Little Y can pass. Will Little X and Little Y pass the whole game, if they cooperate each other?",
"input": "",
"output": "```python\nn=int(input())\r\nx=[int(i) for i in input().split()]\r\ny=[int(i) for i in input().split()]\r\n# print(x)\r\n# print(y)\r\n# x=[3,1,2,3]\r\n# y=[2,2,3]\r\ntest=[i for i in range(1,n+1)]\r\n# print(test)\r\nz=x+y\r\nz.sort()\r\n# print(z)\r\nj=0\r\ncount=0\r\ni=0\r\n\r\nwhile(j 3 and i % 2 == 0:\r\n return 'YES'\r\n\r\nreturn 'NO'\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya decided to have a look at the results of Berland 1910 Football Championship’s finals. Unfortunately he didn't find the overall score of the match; however, he got hold of a profound description of the match's process. On the whole there are *n* lines in that description each of which described one goal. Every goal was marked with the name of the team that had scored it. Help Vasya, learn the name of the team that won the finals. It is guaranteed that the match did not end in a tie.",
"input": "",
"output": "```python\nfrom collections import Counter\r\n\r\ndef whoWon(mathes, size):\r\n dic = Counter(mathes)\r\n res = None\r\n for key in dic:\r\n if not res or dic.get(res) < dic.get(key):\r\n res = key\r\n \r\n return res\r\n\r\n\r\nsize = int(input())\r\nlst = []\r\nfor i in range(size):\r\n lst.append(input())\r\n\r\nprint(whoWon(lst, size))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two positive integer numbers *a* and *b*. Permute (change order) of the digits of *a* to construct maximal number not exceeding *b*. No number in input and/or output can start with the digit 0.\n\nIt is allowed to leave *a* as it is.",
"input": "",
"output": "```python\na = input()\nb = input()\nla = [int(x) for x in a]\nres = []\nla.sort()\nla = la[::-1]\nlb = [int(x) for x in b]\ncnt = [0] * 20\n\nif len(a) < len(b):\n for i in la:\n print(i, end = '')\n print()\nelse:\n for i in la:\n cnt[i] += 1\n flag = 0\n for i in range(len(lb)):\n if flag == 0 and cnt[lb[i]]:\n res.append(lb[i])\n cnt[lb[i]] -= 1\n else:\n flag = 1\n for j in range(lb[i] - 1, -1, -1):\n if cnt[j]:\n res.append(j)\n cnt[j] -= 1\n break\n for j in range(9, -1, -1):\n while cnt[j]:\n res.append(j)\n cnt[j] -= 1\n break\n for i in res:\n print(i, end = '')\n print()\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Theatre Square in the capital city of Berland has a rectangular shape with the size *n*<=×<=*m* meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size *a*<=×<=*a*.\n\nWhat is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.",
"input": "",
"output": "```python\nn,m,a = map(int,input().split())\nif n%a == 0:\n xa = n//a\nelse:\n xa = n // a + 1\nif m%a == 0:\n xa = m//a\nelse:\n xb = m//a +1\nprint(xa*xb)\n \t\t\t \t \t\t \t \t \t\t \t\t \t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two set of points. The first set is determined by the equation *A*1*x*<=+<=*B*1*y*<=+<=*C*1<==<=0, and the second one is determined by the equation *A*2*x*<=+<=*B*2*y*<=+<=*C*2<==<=0.\n\nWrite the program which finds the number of points in the intersection of two given sets.",
"input": "",
"output": "```python\neq1 = [int(i) for i in input().split(\" \")]\neq2 = [int(i) for i in input().split(\" \")]\n\na1, b1, c1 = eq1\na2, b2, c2 = eq2\n\nif a1 == 0 and b1 == 0 and or a2 == 0 and b2 == 0 and:\n\tif c1 != c2:\n\t\tprint(\"0\")\n\telif c1 == 0 and c2 == 0:\n\t\tprint(\"-1\")\n\telse: # c1 == c2 != 0\n\t\tprint(\"0\")\n\n\n # vertical line\nif b1 == 0:\n\tlinear1 = -c1/a1\n\tangular1 = 9999\n\nelse:\n\tlinear1 = -c1/b1\n\tangular1 = -a1/b1\n\n # vertical line\nif b2 == 0:\n\tlinear2 = -c2/a2\n\tangular2 = 9999\nelse:\n\tlinear2 = -c2/b2\n\tangular2 = -a2/b2\n\n\n# matching lines\nif angular1 == angular2 and linear1 == linear2:\n\tprint(\"-1\")\n\n# parallel lines\nelif (angular1 == angular2 and linear1 != linear2):\n\tprint(\"0\")\n# concurrent lines\nelse:\n\tprint(\"1\")\n\n\t\t \t\t \t\t\t \t\t \t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You've got a 5<=×<=5 matrix, consisting of 24 zeroes and a single number one. Let's index the matrix rows by numbers from 1 to 5 from top to bottom, let's index the matrix columns by numbers from 1 to 5 from left to right. In one move, you are allowed to apply one of the two following transformations to the matrix:\n 1. Swap two neighboring matrix rows, that is, rows with indexes *i* and *i*<=+<=1 for some integer *i* (1<=≤<=*i*<=<<=5). 1. Swap two neighboring matrix columns, that is, columns with indexes *j* and *j*<=+<=1 for some integer *j* (1<=≤<=*j*<=<<=5). \nYou think that a matrix looks beautiful, if the single number one of the matrix is located in its middle (in the cell that is on the intersection of the third row and the third column). Count the minimum number of moves needed to make the matrix beautiful.",
"input": "",
"output": "```python\nx = 0\r\ny = 0\r\nfor i in range(5):\r\n s = input().split()\r\n try:\r\n s.index(\"1\")\r\n except ValueError:\r\n continue\r\n else:\r\n x = i\r\n y = s.index(\"1\")\r\n \r\nprint(abs(x-2)+abs(y-2))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ivan's classes at the university have just finished, and now he wants to go to the local CFK cafe and eat some fried chicken.\n\nCFK sells chicken chunks in small and large portions. A small portion contains 3 chunks; a large one — 7 chunks. Ivan wants to eat exactly *x* chunks. Now he wonders whether he can buy exactly this amount of chicken.\n\nFormally, Ivan wants to know if he can choose two non-negative integers *a* and *b* in such a way that *a* small portions and *b* large ones contain exactly *x* chunks.\n\nHelp Ivan to answer this question for several values of *x*!",
"input": "",
"output": "```python\n# submitted from train through mobile\r\nfor _ in range(int(input ())):\r\n n = int(input())\r\n \r\n ans = \"NO\"\r\n for i in range(n) :\r\n Rem = n - 3*i\r\n if(Rem℅7 == 0 and Rem): ans = \"YES\"\r\n print(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two players are playing a game. First each of them writes an integer from 1 to 6, and then a dice is thrown. The player whose written number got closer to the number on the dice wins. If both payers have the same difference, it's a draw.\n\nThe first player wrote number *a*, the second player wrote number *b*. How many ways to throw a dice are there, at which the first player wins, or there is a draw, or the second player wins?",
"input": "",
"output": "```python\na,b=map(int,input().split())\r\nwa,wd,wb=0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n wa+=1\r\n elif abs(a-i) > abs(b-i):\r\n wb+=1\r\n else:\r\n wd+=1\r\nprint(wa,wd,wb)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Yakko, Wakko and Dot, world-famous animaniacs, decided to rest from acting in cartoons, and take a leave to travel a bit. Yakko dreamt to go to Pennsylvania, his Motherland and the Motherland of his ancestors. Wakko thought about Tasmania, its beaches, sun and sea. Dot chose Transylvania as the most mysterious and unpredictable place.\n\nBut to their great regret, the leave turned to be very short, so it will be enough to visit one of the three above named places. That's why Yakko, as the cleverest, came up with a truly genius idea: let each of the three roll an ordinary six-sided die, and the one with the highest amount of points will be the winner, and will take the other two to the place of his/her dreams.\n\nYakko thrown a die and got Y points, Wakko — W points. It was Dot's turn. But she didn't hurry. Dot wanted to know for sure what were her chances to visit Transylvania.\n\nIt is known that Yakko and Wakko are true gentlemen, that's why if they have the same amount of points with Dot, they will let Dot win.",
"input": "",
"output": "```python\n/*\n@ Author: Andres Nowak\n@ Date: Tue Mar 10 13:15:34 CST 2020\n*/\n\n#include \n#include \n#include \n\nusing namespace std;\n\nint gcd(int a, int b)\n{\n if (a == 0)\n return b;\n return gcd(b % a, a);\n}\n\nstring probability(vector throws_of_dice)\n{\n int denominator = 6;\n\n int maximum = *max_element(throws_of_dice.begin(), throws_of_dice.end());\n\n int higher_numbers_that_can_get = 7 - maximum;\n\n if (higher_numbers_that_can_get == 0)\n {\n return \"0/1\";\n }\n\n int common_factor = gcd(higher_numbers_that_can_get, denominator);\n\n higher_numbers_that_can_get = higher_numbers_that_can_get / common_factor;\n denominator = denominator / common_factor;\n\n int probability = higher_numbers_that_can_get / denominator;\n\n if (probability == 1)\n {\n return \"1/1\";\n }\n\n return to_string(higher_numbers_that_can_get) + \"/\" + to_string(denominator);\n}\n\nint main()\n{\n\n vector throws_of_dice(2);\n\n cin >> throws_of_dice[0] >> throws_of_dice[1];\n\n cout << probability(throws_of_dice) << endl;\n}\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The ship crashed into a reef and is sinking. Now the entire crew must be evacuated. All *n* crew members have already lined up in a row (for convenience let's label them all from left to right with positive integers from 1 to *n*) and await further instructions. However, one should evacuate the crew properly, in a strict order. Specifically:\n\nThe first crew members to leave the ship are rats. Then women and children (both groups have the same priority) leave the ship. After that all men are evacuated from the ship. The captain leaves the sinking ship last.\n\nIf we cannot determine exactly who should leave the ship first for any two members of the crew by the rules from the previous paragraph, then the one who stands to the left in the line leaves the ship first (or in other words, the one whose number in the line is less).\n\nFor each crew member we know his status as a crew member, and also his name. All crew members have different names. Determine the order in which to evacuate the crew.",
"input": "",
"output": "```python\n\r\nprioridades = []\r\ntipos = []\r\n\r\nnombres = []\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n nombre, tipo = input().split()\r\n prioridad = 5\r\n if tipo == 'rat':\r\n prioridad = 1\r\n elif tipo == 'woman' or tipo == 'child':\r\n prioridad = 2\r\n elif tipo == 'man':\r\n prioridad = 3\r\n else:\r\n prioridad = 4\r\n j = 0\r\n while j < len(prioridades):\r\n if prioridad < prioridades[j]:\r\n break\r\n j = j+1\r\n prioridades.insert(j, prioridad)\r\n nombres.insert(j, nombre)\r\n \r\nfor k in range(n):\r\n print(nombres[k])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Even if the world is full of counterfeits, I still regard it as wonderful.\n\nPile up herbs and incense, and arise again from the flames and ashes of its predecessor — as is known to many, the phoenix does it like this.\n\nThe phoenix has a rather long lifespan, and reincarnates itself once every *a*! years. Here *a*! denotes the factorial of integer *a*, that is, *a*!<==<=1<=×<=2<=×<=...<=×<=*a*. Specifically, 0!<==<=1.\n\nKoyomi doesn't care much about this, but before he gets into another mess with oddities, he is interested in the number of times the phoenix will reincarnate in a timespan of *b*! years, that is, . Note that when *b*<=≥<=*a* this value is always integer.\n\nAs the answer can be quite large, it would be enough for Koyomi just to know the last digit of the answer in decimal representation. And you're here to provide Koyomi with this knowledge.",
"input": "",
"output": "```python\n\r\na, b = map(int, input().split())\r\n\r\nif b - a > 9:\r\n\tprint(0)\r\nelse:\r\n\tans = 1\r\n\tfor i in range(a + 1, b + 1):\r\n\t\tans *= i\r\n\r\n\tprint(ans % 10)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "*n* soldiers stand in a circle. For each soldier his height *a**i* is known. A reconnaissance unit can be made of such two neighbouring soldiers, whose heights difference is minimal, i.e. |*a**i*<=-<=*a**j*| is minimal. So each of them will be less noticeable with the other. Output any pair of soldiers that can form a reconnaissance unit.",
"input": "",
"output": "```python\nn = int(input())\r\nls = list(map(int, input().split()))\r\n#for i in range(n-1):\r\n # if ls[i]\r\nprint(\"1 2\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\ns = input()\r\n\r\nuppercase = 0\r\nlowercase = 0\r\n\r\nfor i in s:\r\n if i.isupper():\r\n uppercase += 1\r\n elif i.islower:\r\n lowercase += 1\r\n\r\nif lowercase < uppercase:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The average miner Vaganych took refresher courses. As soon as a miner completes the courses, he should take exams. The hardest one is a computer test called \"Testing Pants for Sadness\".\n\nThe test consists of *n* questions; the questions are to be answered strictly in the order in which they are given, from question 1 to question *n*. Question *i* contains *a**i* answer variants, exactly one of them is correct. \n\nA click is regarded as selecting any answer in any question. The goal is to select the correct answer for each of the *n* questions. If Vaganych selects a wrong answer for some question, then all selected answers become unselected and the test starts from the very beginning, from question 1 again. But Vaganych remembers everything. The order of answers for each question and the order of questions remain unchanged, as well as the question and answers themselves.\n\nVaganych is very smart and his memory is superb, yet he is unbelievably unlucky and knows nothing whatsoever about the test's theme. How many clicks will he have to perform in the worst case?",
"input": "",
"output": "```python\nn = int(input())\r\nl = list(map(int,input().split()))\r\ns = sum([l[i]*(i+1)-i for i in range(n)])\r\nprint(s)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The organizers of a programming contest have decided to present t-shirts to participants. There are six different t-shirts sizes in this problem: S, M, L, XL, XXL, XXXL (sizes are listed in increasing order). The t-shirts are already prepared. For each size from S to XXXL you are given the number of t-shirts of this size.\n\nDuring the registration, the organizers asked each of the *n* participants about the t-shirt size he wants. If a participant hesitated between two sizes, he could specify two neighboring sizes — this means that any of these two sizes suits him.\n\nWrite a program that will determine whether it is possible to present a t-shirt to each participant of the competition, or not. Of course, each participant should get a t-shirt of proper size: \n - the size he wanted, if he specified one size; - any of the two neibouring sizes, if he specified two sizes. \nIf it is possible, the program should find any valid distribution of the t-shirts.",
"input": "",
"output": "```python\nused = list(map(int, input().split()))\r\nr = ['S', 'M', 'L', 'XL', 'XXL', 'XXXL']\r\nd = dict()\r\nfor i in range(6):\r\n d[r[i]] = i\r\nc = [0 for i in range(5)]\r\nn = int(input())\r\nf = True\r\nans = ['' for i in range(n)]\r\ncc = [[0 for j in range(0)] for i in range(5)]\r\nfor i in range(n):\r\n l = list(input().split(','))\r\n if len(l) == 1:\r\n used[d[l[0]]] -= 1\r\n ans[i] = l[0]\r\n if used[d[l[0]]] < 0:\r\n f = False\r\n else:\r\n c[d[l[0]]] += 1\r\n cc[d[l[0]]].append(i)\r\nfor i in range(6):\r\n if i != 0 and f:\r\n k = min(used[i], c[i - 1])\r\n used[i] -= k\r\n c[i - 1] -= k\r\n for j in range(k):\r\n ans[cc[i - 1][-1]] = r[i]\r\n cc[i - 1].pop()\r\n if i != 5 and f:\r\n k = min(used[i], c[i])\r\n used[i] -= k\r\n c[i] -= k\r\n for j in range(k):\r\n ans[cc[i][-1]] = r[i]\r\n cc[i].pop()\r\nif '' in ans:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print('\\n'.join(i for i in ans))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After Fox Ciel won an onsite round of a programming contest, she took a bus to return to her castle. The fee of the bus was 220 yen. She met Rabbit Hanako in the bus. They decided to play the following game because they got bored in the bus.\n - Initially, there is a pile that contains *x* 100-yen coins and *y* 10-yen coins. - They take turns alternatively. Ciel takes the first turn. - In each turn, they must take exactly 220 yen from the pile. In Ciel's turn, if there are multiple ways to take 220 yen, she will choose the way that contains the maximal number of 100-yen coins. In Hanako's turn, if there are multiple ways to take 220 yen, she will choose the way that contains the maximal number of 10-yen coins. - If Ciel or Hanako can't take exactly 220 yen from the pile, she loses. \n \n\nDetermine the winner of the game.",
"input": "",
"output": "```python\nx, y = map(int, input().split())\r\nm = 0\r\n\r\nwhile True:\r\n if m:\r\n if y<2:\r\n b = 0\r\n else:\r\n b = max(k for k in (2,12,22) if k<=y)\r\n a = min(x, (220-10*b)//100)\r\n else:\r\n a = min(2,x)\r\n b = min(y, (220-100*a)//10)\r\n if 100*a+10*b < 220:\r\n print('Ciel' if m else 'Hanako')\r\n break\r\n x -= a\r\n y -= b\r\n m = 1-m\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is the faculty of Computer Science in Berland. In the social net \"TheContact!\" for each course of this faculty there is the special group whose name equals the year of university entrance of corresponding course of students at the university. \n\nEach of students joins the group of his course and joins all groups for which the year of student's university entrance differs by no more than *x* from the year of university entrance of this student, where *x* — some non-negative integer. A value *x* is not given, but it can be uniquely determined from the available data. Note that students don't join other groups. \n\nYou are given the list of groups which the student Igor joined. According to this information you need to determine the year of Igor's university entrance.",
"input": "",
"output": "```python\n\r\nn = int(input())\r\nk = [int(i) for i in input().split()]\r\nk.sort()\r\nprint(k[n//2])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word *s*. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word *s*.",
"input": "",
"output": "```python\nw = input()\r\nh = \"hello\"\r\nc = 0\r\nfor i in w:\r\n if i == w[c]:\r\n c+=1\r\n if c == len(h):\r\n break\r\nif c == len(h):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One cold winter evening Alice and her older brother Bob was sitting at home near the fireplace and giving each other interesting problems to solve. When it was Alice's turn, she told the number *n* to Bob and said:\n\n—Shuffle the digits in this number in order to obtain the smallest possible number without leading zeroes.\n\n—No problem! — said Bob and immediately gave her an answer.\n\nAlice said a random number, so she doesn't know whether Bob's answer is correct. Help her to find this out, because impatient brother is waiting for the verdict.",
"input": "",
"output": "```python\nn=input()\r\nm=input()\r\nlst=list(n)\r\nlst.sort()\r\ni=0\r\nwhile(i 64 and ord(character) < 91:\n answer += 1\n else:\n pass\n\n maxanswer = max(answer, maxanswer)\n\nprint(answer)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sereja showed an interesting game to his friends. The game goes like that. Initially, there is a table with an empty cup and *n* water mugs on it. Then all players take turns to move. During a move, a player takes a non-empty mug of water and pours all water from it into the cup. If the cup overfills, then we assume that this player lost.\n\nAs soon as Sereja's friends heard of the game, they wanted to play it. Sereja, on the other hand, wanted to find out whether his friends can play the game in such a way that there are no losers. You are given the volumes of all mugs and the cup. Also, you know that Sereja has (*n*<=-<=1) friends. Determine if Sereja's friends can play the game so that nobody loses.",
"input": "",
"output": "```python\nn,k=map(int,input().split());a=list(map(int,input().split()));print(\"YES\" if sum(a)-max(a)<=k else \"NO\")\r\n#removing max because we have n-1 friends so we ar etrying to put as minimum as possible...\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Maxim wants to buy an apartment in a new house at Line Avenue of Metropolis. The house has *n* apartments that are numbered from 1 to *n* and are arranged in a row. Two apartments are adjacent if their indices differ by 1. Some of the apartments can already be inhabited, others are available for sale.\n\nMaxim often visits his neighbors, so apartment is good for him if it is available for sale and there is at least one already inhabited apartment adjacent to it. Maxim knows that there are exactly *k* already inhabited apartments, but he doesn't know their indices yet.\n\nFind out what could be the minimum possible and the maximum possible number of apartments that are good for Maxim.",
"input": "",
"output": "```python\n\r\nimport math\r\n\r\n\r\ndef apartment(number_of_apart,number_of_occupied):\r\n min,max=0,0\r\n floor=math.floor(number_of_apart/2)\r\n if number_of_occupied==number_of_apart:\r\n return 0,0\r\n if number_of_occupied>=floor:\r\n return 1, number_of_apart-number_of_occupied\r\n else:\r\n return 1,2*floor\r\n \r\n \r\n\r\n\r\n\r\n \r\nn,k=int(input())\r\nprint(apartment(n,k))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A and B are preparing themselves for programming contests.\n\nB loves to debug his code. But before he runs the solution and starts debugging, he has to first compile the code.\n\nInitially, the compiler displayed *n* compilation errors, each of them is represented as a positive integer. After some effort, B managed to fix some mistake and then another one mistake.\n\nHowever, despite the fact that B is sure that he corrected the two errors, he can not understand exactly what compilation errors disappeared — the compiler of the language which B uses shows errors in the new order every time! B is sure that unlike many other programming languages, compilation errors for his programming language do not depend on each other, that is, if you correct one error, the set of other error does not change.\n\nCan you help B find out exactly what two errors he corrected?",
"input": "",
"output": "```python\na = int(input())\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nd = list(map(int, input().split()))\r\nprint(sum(b)-sum(c))\r\nprint(sum(c)-sum(d))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The School №0 of the capital of Berland has *n* children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each child we know value *t**i*:\n - *t**i*<==<=1, if the *i*-th child is good at programming, - *t**i*<==<=2, if the *i*-th child is good at maths, - *t**i*<==<=3, if the *i*-th child is good at PE \nEach child happens to be good at exactly one of these three subjects.\n\nThe Team Scientific Decathlon Olympias requires teams of three students. The school teachers decided that the teams will be composed of three children that are good at different subjects. That is, each team must have one mathematician, one programmer and one sportsman. Of course, each child can be a member of no more than one team.\n\nWhat is the maximum number of teams that the school will be able to present at the Olympiad? How should the teams be formed for that?",
"input": "",
"output": "```python\nn = int(input())\r\narr = list(map(int, input().split()))\r\nvec = [[], [], [], []]\r\nfor i in range(n):\r\n vec[arr[i]].append(i + 1)\r\n \r\nmn = min(len(vec[1]), len(vec[2]), len(vec[3]))\r\nprint(mn)\r\nfor i in range(mn):\r\n print(vec[1][i], vec[2][i], vec[3][i])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya works as a DJ in the best Berland nightclub, and he often uses dubstep music in his performance. Recently, he has decided to take a couple of old songs and make dubstep remixes from them.\n\nLet's assume that a song consists of some number of words. To make the dubstep remix of this song, Vasya inserts a certain number of words \"WUB\" before the first word of the song (the number may be zero), after the last word (the number may be zero), and between words (at least one between any pair of neighbouring words), and then the boy glues together all the words, including \"WUB\", in one string and plays the song at the club.\n\nFor example, a song with words \"I AM X\" can transform into a dubstep remix as \"WUBWUBIWUBAMWUBWUBX\" and cannot transform into \"WUBWUBIAMWUBX\".\n\nRecently, Petya has heard Vasya's new dubstep track, but since he isn't into modern music, he decided to find out what was the initial song that Vasya remixed. Help Petya restore the original song.",
"input": "",
"output": "```python\n#Shanmukh\r\ns=input()\r\ns1=s.replace(\"WUB\",\" \")\r\ns1=list(s1)\r\nn=len(s1)\r\nfor i in range(len(s1)):\r\n if(s1[i]==\" \"):\r\n s1[i]=''\r\n else:\r\n break\r\nfor i in range(len(s1)-1):\r\n if(s1[i]==' ' and s1[i+1]==' '):\r\n s1[i]=''\r\nfor i in range(len(s1)):\r\n if(s1[n-1-i]==\" \"):\r\n s1[n-1-i]=''\r\n else:\r\n break\r\nprint(''.join(s1))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp is a big lover of killing time in social networks. A page with a chatlist in his favourite network is made so that when a message is sent to some friend, his friend's chat rises to the very top of the page. The relative order of the other chats doesn't change. If there was no chat with this friend before, then a new chat is simply inserted to the top of the list.\n\nAssuming that the chat list is initially empty, given the sequence of Polycaprus' messages make a list of chats after all of his messages are processed. Assume that no friend wrote any message to Polycarpus.",
"input": "",
"output": "```python\nfrom collections import OrderedDict\nst = OrderedDict()\nN = int(input())\nfor _ in range(N):\n msg = input()\n if msg in st.keys():\n del st[msg]\n st[msg] = 0\nfor i in reversed(st):\n print(i)\n\t \t\t\t \t\t \t \t\t \t\t\t \t\t\t\t\t\t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Valera has got *n* domino pieces in a row. Each piece consists of two halves — the upper one and the lower one. Each of the halves contains a number from 1 to 6. Valera loves even integers very much, so he wants the sum of the numbers on the upper halves and the sum of the numbers on the lower halves to be even.\n\nTo do that, Valera can rotate the dominoes by 180 degrees. After the rotation the upper and the lower halves swap places. This action takes one second. Help Valera find out the minimum time he must spend rotating dominoes to make his wish come true.",
"input": "",
"output": "```python\nn = int(input())\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n up, down = map(int, input().split())\r\n x.append(up)\r\n y.append(down)\r\n \r\nup = sum(x)\r\ndown = sum(y)\r\nif up%2 == 0 and down%2 == 0:\r\n print(0)\r\nelif up%2 == 1 and down%2 == 1 and n != 1:\r\n ans = -1\r\n for i in range(n):\r\n if (x[i]%2 == 0 and y[i]%2 == 1) or (x[i]%2 == 1 and y[i]%2 == 0):\r\n ans = 1\r\n break\r\n print(ans)\r\nelse:\r\n print(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After making bad dives into swimming pools, Wilbur wants to build a swimming pool in the shape of a rectangle in his backyard. He has set up coordinate axes, and he wants the sides of the rectangle to be parallel to them. Of course, the area of the rectangle must be positive. Wilbur had all four vertices of the planned pool written on a paper, until his friend came along and erased some of the vertices.\n\nNow Wilbur is wondering, if the remaining *n* vertices of the initial rectangle give enough information to restore the area of the planned swimming pool.",
"input": "",
"output": "```python\nn = int(input())\r\n\r\nif n == -1:\r\n print(\"-1\")\r\nelse:\r\n a = set()\r\n b = set()\r\n for _ in range(n):\r\n x, y = map(int, input().split())\r\n a.add(x)\r\n b.add(y)\r\n\r\n if len(a) != 2 or len(b) != 2:\r\n print(\"-1\")\r\n else:\r\n a = list(a)\r\n b = list(b)\r\n print(abs(a[1]-a[0])*abs(b[1]-b[0]))\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given *N* points on a plane. Write a program which will find the sum of squares of distances between all pairs of points.",
"input": "",
"output": "```python\nprint(\"_RANDOM_GUESS_1689448907.059664\")# 1689448907.0596824\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\nnumero = int(input())\r\narreglo = []\r\n \r\nfor i in range(numero):\r\n palabra = str(input())\r\n caracteres = len(palabra)\r\n if caracteres > 10:\r\n primera = palabra[0]\r\n ultima = palabra[caracteres-1]\r\n print(primera+str(caracteres-2)+ultima)\r\n else: \r\n print(palabra)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given an array of *n* integer numbers *a*0,<=*a*1,<=...,<=*a**n*<=-<=1. Find the distance between two closest (nearest) minimums in it. It is guaranteed that in the array a minimum occurs at least two times.",
"input": "",
"output": "```python\nn=int(input())\r\na=list(map(int,input().split(' ')))[:n]\r\nmin=min(a)\r\nout=0\r\nflag=0\r\nfor i in range(n):\r\n if a[i]==min:\r\n for j in range(i+1,n):\r\n if a[j]==min:\r\n if flag==0:\r\n out=j-i\r\n i=j\r\n flag=1\r\n elif (j-i)0\r\nlist1=[]\r\ns=0\r\nfor i in range (1,q+1):\r\n a,b,c=[int(x) for x in input().split()]\r\n list1.append(a)\r\n list1.append(b)\r\n list1.append(c)\r\nfor y in list1:\r\n s=s+y\r\nif s==0 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "SmallR is an archer. SmallR is taking a match of archer with Zanoes. They try to shoot in the target in turns, and SmallR shoots first. The probability of shooting the target each time is for SmallR while for Zanoes. The one who shoots in the target first should be the winner.\n\nOutput the probability that SmallR will win the match.",
"input": "",
"output": "```python\na, b, c, d = input().split() \r\nprint((int(a)/int(b))/(1 - int(c)/int(d)*int(a)/int(b))) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Inna loves sleeping very much, so she needs *n* alarm clocks in total to wake up. Let's suppose that Inna's room is a 100<=×<=100 square with the lower left corner at point (0,<=0) and with the upper right corner at point (100,<=100). Then the alarm clocks are points with integer coordinates in this square.\n\nThe morning has come. All *n* alarm clocks in Inna's room are ringing, so Inna wants to turn them off. For that Inna has come up with an amusing game:\n - First Inna chooses a type of segments that she will use throughout the game. The segments can be either vertical or horizontal. - Then Inna makes multiple moves. In a single move, Inna can paint a segment of any length on the plane, she chooses its type at the beginning of the game (either vertical or horizontal), then all alarm clocks that are on this segment switch off. The game ends when all the alarm clocks are switched off. \nInna is very sleepy, so she wants to get through the alarm clocks as soon as possible. Help her, find the minimum number of moves in the game that she needs to turn off all the alarm clocks!",
"input": "",
"output": "```python\nn = int(input())\r\n\r\nmemo_x = {}\r\nmemo_y = {}\r\n\r\nfor i in range(n):\r\n x, y = list(map(int, input().split()))\r\n if x in memo_x:\r\n memo_x[x] += 1\r\n else:\r\n memo_x[x] = 1\r\n if y in memo_y:\r\n memo_y[y] += 1\r\n else:\r\n memo_y[y] = 1\r\nprint(min(len(memo_x), len(memo_y)))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sereja showed an interesting game to his friends. The game goes like that. Initially, there is a table with an empty cup and *n* water mugs on it. Then all players take turns to move. During a move, a player takes a non-empty mug of water and pours all water from it into the cup. If the cup overfills, then we assume that this player lost.\n\nAs soon as Sereja's friends heard of the game, they wanted to play it. Sereja, on the other hand, wanted to find out whether his friends can play the game in such a way that there are no losers. You are given the volumes of all mugs and the cup. Also, you know that Sereja has (*n*<=-<=1) friends. Determine if Sereja's friends can play the game so that nobody loses.",
"input": "",
"output": "```python\nimport sys\r\n\r\ndef main():\r\n n, s, *l = map(int, sys.stdin.read().strip().split())\r\n return ('NO', 'YES')[sum(l) - max(l) <= s]\r\n\r\nprint(main())\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\na,b=(map(int,input().split()))\r\nm=(a*b)//2\r\nprint(m)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Capitalization is writing a word with its first letter as a capital letter. Your task is to capitalize the given word.\n\nNote, that during capitalization all the letters except the first one remains unchanged.",
"input": "",
"output": "```python\ndef capitalizied_word(word):\r\n return word[0].upper() + word[1:]\r\n\r\n\r\ninput_word = input()\r\ncapitalizied_word = capitalizied_word(input_word)\r\nprint(capitalizied_word)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ilya is a very clever lion, he lives in an unusual city ZooVille. In this city all the animals have their rights and obligations. Moreover, they even have their own bank accounts. The state of a bank account is an integer. The state of a bank account can be a negative number. This means that the owner of the account owes the bank money.\n\nIlya the Lion has recently had a birthday, so he got a lot of gifts. One of them (the gift of the main ZooVille bank) is the opportunity to delete the last digit or the digit before last from the state of his bank account no more than once. For example, if the state of Ilya's bank account is -123, then Ilya can delete the last digit and get his account balance equal to -12, also he can remove its digit before last and get the account balance equal to -13. Of course, Ilya is permitted not to use the opportunity to delete a digit from the balance.\n\nIlya is not very good at math, and that's why he asks you to help him maximize his bank account. Find the maximum state of the bank account that can be obtained using the bank's gift.",
"input": "",
"output": "```python\n# Read the input value n\r\nn = int(input())\r\n\r\n# Convert n to a string to easily manipulate its digits\r\nn_str = str(n)\r\n\r\n# Initialize a variable to store the maximum balance\r\nmax_balance = n\r\n\r\n# Try two possibilities:\r\n# 1. Remove the last digit (rightmost) from n_str and convert it back to an integer\r\nn_minus_last = int(n_str[:-1])\r\nmax_balance = max(max_balance, n_minus_last)\r\n\r\n# 2. Remove the second to last digit from n_str (if it has at least 2 digits)\r\nif len(n_str) > 1:\r\n n_minus_second_last = int(n_str[:-2] + n_str[-1])\r\n max_balance = max(max_balance, n_minus_second_last)\r\n\r\n# Print the maximum balance\r\nprint(max_balance)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "According to an old legeng, a long time ago Ankh-Morpork residents did something wrong to miss Fortune, and she cursed them. She said that at some time *n* snacks of distinct sizes will fall on the city, and the residents should build a Snacktower of them by placing snacks one on another. Of course, big snacks should be at the bottom of the tower, while small snacks should be at the top.\n\nYears passed, and once different snacks started to fall onto the city, and the residents began to build the Snacktower.\n\nHowever, they faced some troubles. Each day exactly one snack fell onto the city, but their order was strange. So, at some days the residents weren't able to put the new stack on the top of the Snacktower: they had to wait until all the bigger snacks fell. Of course, in order to not to anger miss Fortune again, the residents placed each snack on the top of the tower immediately as they could do it.\n\nWrite a program that models the behavior of Ankh-Morpork residents.",
"input": "",
"output": "```python\nn=int(input())\nins= input().split() \nstore=[]\nfor a in ins: \n if int(a)m:\r\n c=m\r\n b=n\r\nelse:\r\n c=n\r\n b=m\r\nif b<=1 or c<1:\r\n print(0)\r\n exit()\r\nif c<=b//2:\r\n print(c)\r\nelse:\r\n val=math.ceil(b/2)\r\n x=val+(c-val)//3\r\n if b%2==1 and (b-c)%2==1:\r\n print(x-1)\r\n else:\r\n print(x)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya has equal wooden bars of length *n*. He wants to make a frame for two equal doors. Each frame has two vertical (left and right) sides of length *a* and one top side of length *b*. A solid (i.e. continuous without breaks) piece of bar is needed for each side.\n\nDetermine a minimal number of wooden bars which are needed to make the frames for two doors. Petya can cut the wooden bars into any parts, but each side of each door should be a solid piece of a wooden bar (or a whole wooden bar).",
"input": "",
"output": "```python\nn=int(input())\r\na=int(input())\r\nb=int(input())\r\nl=[a,a,a,a,n]\r\nl.sort()\r\ncur=0\r\nans=0\r\ne=[]\r\nfor i in range(5):\r\n cur+=l[i]\r\n if cur>n:\r\n e.append(cur-l[i])\r\n cur=l[i]\r\n ans+=1\r\ne.sort()\r\ni=0\r\nc=0\r\n#print(e)\r\ne.append(0)\r\ne.append(0)\r\nwhile(i=b:\r\n c+=1\r\n e[i]+=b\r\n else:\r\n i+=1\r\n if c==2:\r\n break\r\nc=0\r\nif e[-1]==0:\r\n c=1\r\nif e[-2]==0:\r\n c+=1\r\n#print(e)\r\nprint(len(e)-c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently developed a new algorithm to optimize the reception of customer flow and he considered the following problem.\n\nLet the queue to the cashier contain *n* people, at that each of them is characterized by a positive integer *a**i* — that is the time needed to work with this customer. What is special about this very cashier is that it can serve two customers simultaneously. However, if two customers need *a**i* and *a**j* of time to be served, the time needed to work with both of them customers is equal to *max*(*a**i*,<=*a**j*). Please note that working with customers is an uninterruptable process, and therefore, if two people simultaneously come to the cashier, it means that they begin to be served simultaneously, and will both finish simultaneously (it is possible that one of them will have to wait).\n\nVasya used in his algorithm an ingenious heuristic — as long as the queue has more than one person waiting, then some two people of the first three standing in front of the queue are sent simultaneously. If the queue has only one customer number *i*, then he goes to the cashier, and is served within *a**i* of time. Note that the total number of phases of serving a customer will always be equal to ⌈*n*<=/<=2⌉.\n\nVasya thinks that this method will help to cope with the queues we all hate. That's why he asked you to work out a program that will determine the minimum time during which the whole queue will be served using this algorithm.",
"input": "",
"output": "```python\ndef solve(act, prev, N):\r\n global arr\r\n global dp\r\n global to\r\n if act >= N:\r\n return 0 if prev >= N else arr[prev]\r\n if dp[act][prev] == -1:\r\n answ = 10**9\r\n v = max(arr[prev], arr[act]) + solve(act+2, act+1, N)\r\n if v < answ:\r\n answ = v\r\n to[act][prev] = prev, act\r\n if act+1 < N:\r\n v = max(arr[prev], arr[act+1]) + solve(act+2, act, N)\r\n if v < answ:\r\n answ = v\r\n to[act][prev] = prev, act+1\r\n v = max(arr[act], arr[act+1]) + solve(act+2, prev, N)\r\n if v < answ:\r\n answ = v\r\n to[act][prev] = act, act+1\r\n dp[act][prev] = answ\r\n return dp[act][prev]\r\n \r\nN = int(input())\r\narr = [int(x) for x in input().split()]\r\ndp = [[-1 for i in range(N)] for j in range(N)]\r\nto = [[ [-1, -1] for i in range(N) ] for j in range(N)]\r\n \r\nansw = solve(1, 0, N)\r\nprint(answ)\r\n \r\nla = [0, 1, 2]\r\nact = 1\r\nprev = 0\r\n \r\nwhile act < N:\r\n print(to[act][prev][0]+1, to[act][prev][1]+1)\r\n la.remove(to[act][prev][0])\r\n la.remove(to[act][prev][1])\r\n prev = la[0]\r\n la.append(act+2)\r\n la.append(act+3)\r\n act+=2\r\n \r\nif N%2 == 1:\r\n print(la[0]+1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Your friend has *n* cards.\n\nYou know that each card has a lowercase English letter on one side and a digit on the other.\n\nCurrently, your friend has laid out the cards on a table so only one side of each card is visible.\n\nYou would like to know if the following statement is true for cards that your friend owns: \"If a card has a vowel on one side, then it has an even digit on the other side.\" More specifically, a vowel is one of 'a', 'e', 'i', 'o' or 'u', and even digit is one of '0', '2', '4', '6' or '8'.\n\nFor example, if a card has 'a' on one side, and '6' on the other side, then this statement is true for it. Also, the statement is true, for example, for a card with 'b' and '4', and for a card with 'b' and '3' (since the letter is not a vowel). The statement is false, for example, for card with 'e' and '5'. You are interested if the statement is true for all cards. In particular, if no card has a vowel, the statement is true.\n\nTo determine this, you can flip over some cards to reveal the other side. You would like to know what is the minimum number of cards you need to flip in the worst case in order to verify that the statement is true.",
"input": "",
"output": "```python\ns=list(input())\r\n# print(type(s[-1]))\r\ns1=['b','c','d','f','g','h','j','k','l','m','n','r','q','p','s','t','v','w','x','y','z']\r\nc=0\r\nfor i in s:\r\n if(i==\"a\"):\r\n c+=1\r\n elif(i==\"e\"):\r\n c+=1\r\n elif(i==\"i\"):\r\n c+=1\r\n elif(i==\"o\"):\r\n c+=1\r\n elif(i==\"u\"):\r\n c+=1\r\n elif(i in s1):\r\n pass\r\n else:\r\n if(int(i)%2!=0):\r\n c+=1\r\n \r\nprint(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Lolek and Bolek are about to travel abroad by plane. The local airport has a special \"Choose Your Plane\" offer. The offer's conditions are as follows:\n - it is up to a passenger to choose a plane to fly on; - if the chosen plane has *x* (*x*<=><=0) empty seats at the given moment, then the ticket for such a plane costs *x* zlotys (units of Polish currency). \nThe only ticket office of the airport already has a queue of *n* passengers in front of it. Lolek and Bolek have not stood in the queue yet, but they are already wondering what is the maximum and the minimum number of zlotys the airport administration can earn if all *n* passengers buy tickets according to the conditions of this offer?\n\nThe passengers buy tickets in turn, the first person in the queue goes first, then goes the second one, and so on up to *n*-th person.",
"input": "",
"output": "```python\ndef maxZ(lst,n):\r\n sp = list(lst)\r\n n1 = int(n)\r\n sommeMax = 0\r\n while(n1>0):\r\n index = sp.index(max(sp))\r\n sommeMax += max(sp)\r\n sp[index] -= 1\r\n if(sp[index]==0):\r\n sp.pop(index)\r\n n1-=1\r\n return sommeMax\r\n\r\ndef minZ(lst,n):\r\n sk = list(lst)\r\n n1 = int(n)\r\n sommeMax = 0\r\n while(n1>0):\r\n index = sk.index(min(sk))\r\n sommeMax += min(sk)\r\n sk[index] -= 1\r\n if(sk[index]==0):\r\n sk.pop(index)\r\n n1-=1\r\n \r\n return sommeMax\r\n\r\n\r\nn,m =[int(x) for x in input().split()]\r\nlst = [int(x) for x in input().split()]\r\n\r\nprint(str(maxZ(lst,n))+\" \"+str(minZ(lst,n)))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "DZY has a sequence *a*, consisting of *n* integers.\n\nWe'll call a sequence *a**i*,<=*a**i*<=+<=1,<=...,<=*a**j* (1<=≤<=*i*<=≤<=*j*<=≤<=*n*) a subsegment of the sequence *a*. The value (*j*<=-<=*i*<=+<=1) denotes the length of the subsegment.\n\nYour task is to find the longest subsegment of *a*, such that it is possible to change at most one number (change one number to any integer you want) from the subsegment to make the subsegment strictly increasing.\n\nYou only need to output the length of the subsegment you find.",
"input": "",
"output": "```python\nn = int(input())\r\nnums = [int(n) for n in input().split()]\r\nnums.append(0)\r\ndp = list()\r\ndp.append(1)\r\nfor j in range(1, n):\r\n if(nums[j] > nums[j-1]):\r\n dp.append(dp[j-1] + 1)\r\n else:\r\n dp.append(1)\r\n\r\nm = 0\r\nx = 0\r\nfor i in range(n-1, -1, -1):\r\n m = max(m, dp[i-1] + 1, x + 1)\r\n if(i == 0 or i == n-1 or nums[i-1] + 1 > nums[i+1]):\r\n m = max(m, min(dp[i-1] + x + 1, n))\r\n \r\n if(nums[i] > nums[i+1]):\r\n x += 1\r\n else:\r\n x = 1\r\n \r\nprint(m)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was *n* integers *a*1,<=*a*2,<=...,<=*a**n*. These numbers mean that Greg needs to do exactly *n* exercises today. Besides, Greg should repeat the *i*-th in order exercise *a**i* times.\n\nGreg now only does three types of exercises: \"chest\" exercises, \"biceps\" exercises and \"back\" exercises. Besides, his training is cyclic, that is, the first exercise he does is a \"chest\" one, the second one is \"biceps\", the third one is \"back\", the fourth one is \"chest\", the fifth one is \"biceps\", and so on to the *n*-th exercise.\n\nNow Greg wonders, which muscle will get the most exercise during his training. We know that the exercise Greg repeats the maximum number of times, trains the corresponding muscle the most. Help Greg, determine which muscle will get the most training.",
"input": "",
"output": "```python\nch=\"chest\"\nbi=\"biceps\"\nba=\"back\"\nm={ch:0,bi:0,ba:0}\nn=int(input())\na=map(int,input().split())\ns=[ch,bi,ba]*n\nz=zip(s[:n],a)\nfor e,ai in z:\n m[e]+=ai\nprint(max(m,key=m.get))\n\n\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her *n* students and give each of them a jigsaw puzzle (which, as wikipedia states, is a tiling puzzle that requires the assembly of numerous small, often oddly shaped, interlocking and tessellating pieces).\n\nThe shop assistant told the teacher that there are *m* puzzles in the shop, but they might differ in difficulty and size. Specifically, the first jigsaw puzzle consists of *f*1 pieces, the second one consists of *f*2 pieces and so on.\n\nMs. Manana doesn't want to upset the children, so she decided that the difference between the numbers of pieces in her presents must be as small as possible. Let *A* be the number of pieces in the largest puzzle that the teacher buys and *B* be the number of pieces in the smallest such puzzle. She wants to choose such *n* puzzles that *A*<=-<=*B* is minimum possible. Help the teacher and find the least possible value of *A*<=-<=*B*.",
"input": "",
"output": "```python\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nc = sum(a)\r\nfor i in range(m-n+1):\r\n if c > sum(a[i:i+n-1]):\r\n c = sum(a[i:i+n-1])\r\n d = a[i+n-1] - a[i]\r\n\r\nprint(d)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kefa decided to make some money doing business on the Internet for exactly *n* days. He knows that on the *i*-th day (1<=≤<=*i*<=≤<=*n*) he makes *a**i* money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence *a**i*. Let us remind you that the subsegment of the sequence is its continuous fragment. A subsegment of numbers is called non-decreasing if all numbers in it follow in the non-decreasing order.\n\nHelp Kefa cope with this task!",
"input": "",
"output": "```python\nn = int(input())\r\na = list(map(int, input().split()))\r\nc = 1\r\nmc = 1 # mc = 0 is an error for 5 4 3 2 1\r\np = a[0]\r\nfor v in a[1:]:\r\n if p <= v:\r\n c += 1\r\n mc = max(mc, c)\r\n else:\r\n c = 1\r\n p = v\r\nprint(mc)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.\n\nVasily has *a* candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make *b* went out candles into a new candle. As a result, this new candle can be used like any other new candle.\n\nNow Vasily wonders: for how many hours can his candles light up the room if he acts optimally well? Help him find this number.",
"input": "",
"output": "```python\na,b=input().split()\r\na1=int(a)\r\nb1=int(b)\r\ndef hrs(x):\r\n if x lista[-1]\r\nmala = False\r\nfor x in range(n):\r\n if mayor and lista[x] < lista[(-x - 1)]:\r\n mala = True\r\n\r\n if not mayor and lista[x] > lista[(-x - 1)]:\r\n mala = True\r\n\r\nif mala:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Manao works on a sports TV. He's spent much time watching the football games of some country. After a while he began to notice different patterns. For example, each team has two sets of uniforms: home uniform and guest uniform. When a team plays a game at home, the players put on the home uniform. When a team plays as a guest on somebody else's stadium, the players put on the guest uniform. The only exception to that rule is: when the home uniform color of the host team matches the guests' uniform, the host team puts on its guest uniform as well. For each team the color of the home and guest uniform is different.\n\nThere are *n* teams taking part in the national championship. The championship consists of *n*·(*n*<=-<=1) games: each team invites each other team to its stadium. At this point Manao wondered: how many times during the championship is a host team going to put on the guest uniform? Note that the order of the games does not affect this number.\n\nYou know the colors of the home and guest uniform for each team. For simplicity, the colors are numbered by integers in such a way that no two distinct colors have the same number. Help Manao find the answer to his question.",
"input": "",
"output": "```python\n#include \r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n int n;\r\n cin>>n;\r\n int a[n][3],i,j,c=0;\r\n for(i=0;i>a[i][j];\r\n }\r\n for(i=0;i 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once Max found an electronic calculator from his grandfather Dovlet's chest. He noticed that the numbers were written with seven-segment indicators ([https://en.wikipedia.org/wiki/Seven-segment_display](https://en.wikipedia.org/wiki/Seven-segment_display)).\n\nMax starts to type all the values from *a* to *b*. After typing each number Max resets the calculator. Find the total number of segments printed on the calculator.\n\nFor example if *a*<==<=1 and *b*<==<=3 then at first the calculator will print 2 segments, then — 5 segments and at last it will print 5 segments. So the total number of printed segments is 12.",
"input": "",
"output": "```python\nd = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]\na, b = map(int, input().split())\n\nnums = str(list(range(a, b+1)))\nr = 0\nfor i in range(len(d)):\n r += d[i] * nums.count(str(i))\nprint(r)\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* beacons located at distinct positions on a number line. The *i*-th beacon has position *a**i* and power level *b**i*. When the *i*-th beacon is activated, it destroys all beacons to its left (direction of decreasing coordinates) within distance *b**i* inclusive. The beacon itself is not destroyed however. Saitama will activate the beacons one at a time from right to left. If a beacon is destroyed, it cannot be activated.\n\nSaitama wants Genos to add a beacon strictly to the right of all the existing beacons, with any position and any power level, such that the least possible number of beacons are destroyed. Note that Genos's placement of the beacon means it will be the first beacon activated. Help Genos by finding the minimum number of beacons that could be destroyed.",
"input": "",
"output": "```python\nn = int(input())\r\ndp,li,mx=[0]*1000010,[0]*1000010,0\r\nfor _ in range(n):a,b = map(int,input().split());li[a]=b;\r\nfor i in range(1000010):\r\n\tif li[i]:dp[i]=dp[i-li[i]-1]+1\r\n\telse:dp[i]=dp[i-1]\r\n\tmx = max(mx,dp[i])\r\nprint(n-mx)\t\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\nimport string\r\ns=input()\r\nu=0\r\nl=0\r\nfor i in s:\r\n if i in string.ascii_lowercase:\r\n l=l+1\r\n else:\r\n u=u+1\r\nif l>=u:\r\n print(s.lower())\r\nelse:\r\n print(s.upper())\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Fox Ciel is playing a game with numbers now. \n\nCiel has *n* positive integers: *x*1, *x*2, ..., *x**n*. She can do the following operation as many times as needed: select two different indexes *i* and *j* such that *x**i* > *x**j* hold, and then apply assignment *x**i* = *x**i* - *x**j*. The goal is to make the sum of all numbers as small as possible.\n\nPlease help Ciel to find this minimal sum.",
"input": "",
"output": "```python\n'''input\n5\n45 12 27 30 18\n'''\nn = int(input())\nd = 1e9\nx = list(map(int, input().split()))\nfor i in range(n-1):\n\tif x[i+1]-x[i] >= 0:\n\t\td = min(d, x[i+1]-x[i])\nprint(n*d)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory. \n\nGeorge and Alex want to live in the same room. The dormitory has *n* rooms in total. At the moment the *i*-th room has *p**i* people living in it and the room can accommodate *q**i* people in total (*p**i*<=≤<=*q**i*). Your task is to count how many rooms has free place for both George and Alex.",
"input": "",
"output": "```python\nn = int(input()) # Input: The number of rooms\r\ncount = 0 # Initialize a counter for rooms where George and Alex can move in\r\n\r\nfor _ in range(n):\r\n pi, qi = map(int, input().split()) # Input: The number of people in the room and room's capacity\r\n if qi - pi >= 2:\r\n count += 1\r\n\r\nprint(count) # Output: The number of rooms where George and Alex can move in\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have an array *a* consisting of *n* integers. Each integer from 1 to *n* appears exactly once in this array.\n\nFor some indices *i* (1<=≤<=*i*<=≤<=*n*<=-<=1) it is possible to swap *i*-th element with (*i*<=+<=1)-th, for other indices it is not possible. You may perform any number of swapping operations any order. There is no limit on the number of times you swap *i*-th element with (*i*<=+<=1)-th (if the position is not forbidden).\n\nCan you make this array sorted in ascending order performing some sequence of swapping operations?",
"input": "",
"output": "```python\n#include\r\n#include\r\nusing namespace std;\r\ntypedef long long int ll;\r\ntypedef unsigned long long llu;\r\ntypedef long double ldo;\r\ntypedef vector vl;\r\ntypedef vector> vpll;\r\ntypedef vector vs;\r\ntypedef vector> vvll;\r\ntypedef vector> vvi;\r\n#define f1(iter,n) for(ll iter=0;iter=e;--iter)\r\n#define MOD (llu)1000000007\r\n#define pp pair\r\n#define vi vector\r\n#define vll vector\r\n#define vpp vector\r\n#define vss vector\r\n#define take(A,n) {f1(iter,n)cin>>A[iter];}\r\n#define pb push_back\r\n#define pob pop_back\r\n#define eb emplace_back\r\n#define pf push_front\r\n#define pof pop_front\r\n#define mkp make_pair\r\n#define all(a) a.begin(),a.end()\r\n#define ff first\r\n#define ss second\r\n#define lcm(a,b) (a*b)/__gcd(a,b)\r\n#define bs(v,x) binary_search(all(v),x)\r\n#define ub(v,x) upper_bound(all(v),x)\r\n#define lb(v,x) lower_bound(all(v),x)\r\n#define zoom ios_base::sync_with_stdio(false);cin.tie(NULL);\r\n// vvi gph(2e5+10);\r\n// int ans=0;\r\n// int DFS(int sv,int p)\r\n// {\r\n// int tch=1;\r\n// for(int i:gph[sv])\r\n// {\r\n// if(i!=p){\r\n// tch+=DFS(i,sv);\r\n// }\r\n// }\r\n// if(tch%2==0)\r\n// {\r\n// ans++;\r\n// tch=0;\r\n// }\r\n// return tch;\r\n// }\r\nint main() \r\n{ \r\n #ifndef ONLINE_JUDGE\r\n freopen(\"input.txt\", \"r\", stdin);\r\n freopen(\"output.txt\", \"w\", stdout);\r\n #endif\r\n zoom\r\n int t=1;//cin>>t;\r\n while(t--)\r\n {\r\n int n;cin>>n;\r\n int *arr = new int[n];\r\n string swap;\r\n take(arr,n);\r\n cin>>swap;\r\n int i=0;\r\n while(iarr[i]){\r\n cout<<\"NO\"< maxs: \r\n am += 1\r\n maxs = s[i] \r\n elif s[i] < mins: \r\n amt += 1\r\n mins = s[i] \r\n\r\nprint(am) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vika has *n* jars with paints of distinct colors. All the jars are numbered from 1 to *n* and the *i*-th jar contains *a**i* liters of paint of color *i*.\n\nVika also has an infinitely long rectangular piece of paper of width 1, consisting of squares of size 1<=×<=1. Squares are numbered 1, 2, 3 and so on. Vika decided that she will start painting squares one by one from left to right, starting from the square number 1 and some arbitrary color. If the square was painted in color *x*, then the next square will be painted in color *x*<=+<=1. In case of *x*<==<=*n*, next square is painted in color 1. If there is no more paint of the color Vika wants to use now, then she stops.\n\nSquare is always painted in only one color, and it takes exactly 1 liter of paint. Your task is to calculate the maximum number of squares that might be painted, if Vika chooses right color to paint the first square.",
"input": "",
"output": "```python\nfrom sys import*\r\ndef square(a):\r\n\tk = min(a)\r\n\tl = [i for i, x in enumerate(a) if x == k]\r\n\tif(len(l) == 1):\r\n\t\treturn (n*k + (n-1))\r\n\telse:\r\n\t\tb =[0]*(len(l))\r\n\t\tfor i in range(len(l) - 1):\r\n\t\t\tb[i] = l[i+1] - l[i]\r\n\t\tb[len(l) - 1] = (len(a) - l[len(l)-1] + l[0])\r\n\t\treturn (n*k + (max(b) - 1))\r\nn = int(input())\r\na = list(map(int,input().strip().split()))[:n]\r\nprint(square(a))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. \"Piece of cake\" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.",
"input": "",
"output": "```python\n# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 9 09:21:45 2020\r\n\r\n@author: 86198\r\n\"\"\"\r\ndef add(x,y):\r\n return x+y\r\nn=int(input())\r\na=0\r\nm=[0,0,0]\r\nfor i in (0,n):\r\n l=[int(i)for i in input().split()]\r\n m=map(add,m,l)\r\nfor i in list(m):\r\n if i !=0:\r\n a=a+1\r\n else:\r\n a=0\r\nif a!=0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n \r\n \r\n\r\n\r\n \r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have a description of a lever as string *s*. We'll represent the string length as record |*s*|, then the lever looks as a horizontal bar with weights of length |*s*|<=-<=1 with exactly one pivot. We will assume that the bar is a segment on the *Ox* axis between points 0 and |*s*|<=-<=1.\n\nThe decoding of the lever description is given below.\n - If the *i*-th character of the string equals \"^\", that means that at coordinate *i* there is the pivot under the bar. - If the *i*-th character of the string equals \"=\", that means that at coordinate *i* there is nothing lying on the bar. - If the *i*-th character of the string equals digit *c* (1-9), that means that at coordinate *i* there is a weight of mass *c* on the bar. \nYour task is, given the lever description, print if it will be in balance or not. Assume that the bar doesn't weight anything. Assume that the bar initially is in balance then all weights are simultaneously put on it. After that the bar either tilts to the left, or tilts to the right, or is in balance.",
"input": "",
"output": "```python\ns=[n for n in input()]\r\nk=s.index('^')\r\na=s[:k][::-1]\r\nb=s[k+1:]\r\nm=0\r\nfor n in range(len(a)):\r\n\tif ord('0')<=ord(a[n])<=ord('9'):\r\n\t\tm+=int(a[n])*(n+1)\r\np=0\r\nfor n in range(len(b)):\r\n\tif ord('0')<=ord(b[n])<=ord('9'):\r\n\t\tp+=int(b[n])*(n+1)\r\nif m==p:\r\n\tprint('balance')\r\nelif m>p:\r\n\tprint('left')\r\nelif m=r:\r\n n=r*2\r\n l-=n\r\n if l>=a:\r\n n+=(a*2)\r\n else:\r\n n+=(a//2)*2\r\nelse:\r\n n=l*2\r\n r-=n\r\n if r>=a:\r\n n+=(a*2)\r\n else:\r\n n+=(a//2)*2\r\nprint(n)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.\n\nOne day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.\n\nIn his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The *i*-th digit of the answer is 1 if and only if the *i*-th digit of the two given numbers differ. In the other case the *i*-th digit of the answer is 0.\n\nShapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.\n\nNow you are going to take part in Shapur's contest. See if you are faster and more accurate.",
"input": "",
"output": "```python\nprint(\"will do it\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Hooray! Berl II, the king of Berland is making a knight tournament. The king has already sent the message to all knights in the kingdom and they in turn agreed to participate in this grand event.\n\nAs for you, you're just a simple peasant. There's no surprise that you slept in this morning and were late for the tournament (it was a weekend, after all). Now you are really curious about the results of the tournament. This time the tournament in Berland went as follows:\n - There are *n* knights participating in the tournament. Each knight was assigned his unique number — an integer from 1 to *n*. - The tournament consisted of *m* fights, in the *i*-th fight the knights that were still in the game with numbers at least *l**i* and at most *r**i* have fought for the right to continue taking part in the tournament. - After the *i*-th fight among all participants of the fight only one knight won — the knight number *x**i*, he continued participating in the tournament. Other knights left the tournament. - The winner of the last (the *m*-th) fight (the knight number *x**m*) became the winner of the tournament. \nYou fished out all the information about the fights from your friends. Now for each knight you want to know the name of the knight he was conquered by. We think that the knight number *b* was conquered by the knight number *a*, if there was a fight with both of these knights present and the winner was the knight number *a*.\n\nWrite the code that calculates for each knight, the name of the knight that beat him.",
"input": "",
"output": "```python\ndef search(D,p,ln):\r\n\tk = p+1\r\n\t#print(k)\r\n\tfor i in range(ln):\r\n\t\tif k>=D[i][0] and k<=D[i][1] and k != D[i][2]:\r\n\t\t\treturn(D[i][2])\r\n\treturn(0)\r\n\r\ndef main():\r\n\tD = []\r\n\tResult = []\r\n\tL = list(map(int,input().split()))\r\n\tln = L[1]\r\n\tfor i in range(ln):\r\n\t\tD.append(list(map(int,input().split())))\r\n\t\t#print(D)\r\n\tfor i in range(L[0]):\r\n\t\tprint(str(search(D,i,ln)),end = \" \")\t\r\n\t#print(\" \".join(map(lambda x:str(x) ,Result)))\r\n\texit()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kyoya Ootori is selling photobooks of the Ouran High School Host Club. He has 26 photos, labeled \"a\" to \"z\", and he has compiled them into a photo booklet with some photos in some order (possibly with some photos being duplicated). A photo booklet can be described as a string of lowercase letters, consisting of the photos in the booklet in order. He now wants to sell some \"special edition\" photobooks, each with one extra photo inserted anywhere in the book. He wants to make as many distinct photobooks as possible, so he can make more money. He asks Haruhi, how many distinct photobooks can he make by inserting one extra photo into the photobook he already has?\n\nPlease help Haruhi solve this problem.",
"input": "",
"output": "```python\n# LUOGU_RID: 112614184\ns = str(input())\nn = len(s)\nprint(26 * (n + 1) - n)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Peter got a new snow blower as a New Year present. Of course, Peter decided to try it immediately. After reading the instructions he realized that it does not work like regular snow blowing machines. In order to make it work, you need to tie it to some point that it does not cover, and then switch it on. As a result it will go along a circle around this point and will remove all the snow from its path.\n\nFormally, we assume that Peter's machine is a polygon on a plane. Then, after the machine is switched on, it will make a circle around the point to which Peter tied it (this point lies strictly outside the polygon). That is, each of the points lying within or on the border of the polygon will move along the circular trajectory, with the center of the circle at the point to which Peter tied his machine.\n\nPeter decided to tie his car to point *P* and now he is wondering what is the area of the region that will be cleared from snow. Help him.",
"input": "",
"output": "```python\nimport functools\r\n\r\nclass Point:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n\r\n def squared_distance(self, another_point):\r\n return (self.x - another_point.x) ** 2 + (self.y - another_point.y) ** 2\r\n\r\nclass SnowBlower: \r\n def solution(self):\r\n first_line = input()\r\n first_line = first_line.split(\" \")\r\n num_vertices = int(first_line[0])\r\n origin = Point(int(first_line[1]), int(first_line[2]))\r\n\r\n vertices = []\r\n for _ in range(num_vertices):\r\n point = input()\r\n point = point.split(\" \")\r\n vertices.append(Point(int(point[0]), int(point[1])))\r\n\r\n min_distance = float(\"inf\")\r\n max_distance = float(\"-inf\")\r\n for vertex in vertices:\r\n squared_distance = origin.squared_distance(vertex)\r\n min_distance = squared_distance if min_distance > squared_distance else min_distance\r\n max_distance = squared_distance if squared_distance > max_distance else max_distance\r\n\r\n pi = 3.14159265358\r\n \r\n print(pi * (max_distance - min_distance))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n snow_blower = SnowBlower()\r\n snow_blower.solution()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "\"QAQ\" is a word to denote an expression of crying. Imagine \"Q\" as eyes with tears and \"A\" as a mouth.\n\nNow Diamond has given Bort a string consisting of only uppercase English letters of length *n*. There is a great number of \"QAQ\" in the string (Diamond is so cute!).\n\nBort wants to know how many subsequences \"QAQ\" are in the string Diamond has given. Note that the letters \"QAQ\" don't have to be consecutive, but the order of letters should be exact.",
"input": "",
"output": "```python\ns = input()\ncountQPassed = 0\ncountQNotPassed = len([x for x in s if x == 'Q'])\ncountRes = 0\n\nfor x in s:\n if x == 'A':\n countRes += countQPassed * countQNotPassed\n elif x == 'Q':\n countQPassed += 1\n countQNotPassed -= 1\n \nprint(countRes)\n\t\t \t \t \t\t \t\t\t \t\t\t\t\t\t\t \t\t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a permutation *p* of length *n*. Remove one element from permutation to make the number of records the maximum possible.\n\nWe remind that in a sequence of numbers *a*1,<=*a*2,<=...,<=*a**k* the element *a**i* is a record if for every integer *j* (1<=≤<=*j*<=<<=*i*) the following holds: *a**j*<=<<=*a**i*.",
"input": "",
"output": "```python\ndef find_max_records_to_remove(n, p):\r\n records = []\r\n max_records = 0\r\n max_records_element = 0\r\n for i in range(n):\r\n if i == 0 or p[i] > p[i - 1]:\r\n records.append(i)\r\n for i in range(len(records)):\r\n remove_element1 = p[records[i]]\r\n remove_element2 = p[records[i] - 1] if records[i] > 0 else float('inf')\r\n count_after_removal = max(records[i], n - records[i] - 1)\r\n if count_after_removal > max_records:\r\n max_records = count_after_removal\r\n max_records_element = min(remove_element1, remove_element2)\r\n return max(max_records_element, p[-1])\r\n\r\ndef main():\r\n n = int(input())\r\n p = list(map(int, input().split()))\r\n max_records_element = find_max_records_to_remove(n, p)\r\n print(max_records_element)\r\n\r\nif __name__ == \"__main__\":\r\n main()# 1690233908.4629285\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vlad likes to eat in cafes very much. During his life, he has visited cafes *n* times. Unfortunately, Vlad started to feel that his last visits are not any different from each other. To fix that Vlad had a small research.\n\nFirst of all, Vlad assigned individual indices to all cafes. Then, he wrote down indices of cafes he visited in a row, in order of visiting them. Now, Vlad wants to find such a cafe that his last visit to that cafe was before his last visits to every other cafe. In other words, he wants to find such a cafe that he hasn't been there for as long as possible. Help Vlad to find that cafe.",
"input": "",
"output": "```python\nimport re\n\nin1 = int(input())\nin2 = re.split(\"\\\\s\", input())\n\ntest = {}\n\ncount = 0\nfor x in in2:\n test[x] = count\n count += 1\n \nprint(min(test, key=test.get))\n \t \t\t\t\t \t\t\t\t \t \t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Heidi got one brain, thumbs up! But the evening isn't over yet and one more challenge awaits our dauntless agent: after dinner, at precisely midnight, the *N* attendees love to play a very risky game...\n\nEvery zombie gets a number *n**i* (1<=≤<=*n**i*<=≤<=*N*) written on his forehead. Although no zombie can see his own number, he can see the numbers written on the foreheads of all *N*<=-<=1 fellows. Note that not all numbers have to be unique (they can even all be the same). From this point on, no more communication between zombies is allowed. Observation is the only key to success. When the cuckoo clock strikes midnight, all attendees have to simultaneously guess the number on their own forehead. If at least one of them guesses his number correctly, all zombies survive and go home happily. On the other hand, if not a single attendee manages to guess his number correctly, all of them are doomed to die!\n\nZombies aren't very bright creatures though, and Heidi has to act fast if she does not want to jeopardize her life. She has one single option: by performing some quick surgery on the brain she managed to get from the chest, she has the ability to remotely reprogram the decision-making strategy of all attendees for their upcoming midnight game! Can you suggest a sound strategy to Heidi which, given the rules of the game, ensures that at least one attendee will guess his own number correctly, for any possible sequence of numbers on the foreheads?\n\nGiven a zombie's rank *R* and the *N*<=-<=1 numbers *n**i* on the other attendees' foreheads, your program will have to return the number that the zombie of rank *R* shall guess. Those answers define your strategy, and we will check if it is flawless or not.",
"input": "",
"output": "```python\nt = int(input())\r\nfor i in range(t):\r\n n, r = map(int, input().split())\r\n l = list(map(int, input().split()))\r\n if r == 1:\r\n s = sum(l) % n\r\n if s == 0:\r\n s = n\r\n print(s)\r\n else:\r\n s = 2 * l[0] - r + 1 - sum(l)\r\n s = s % n\r\n if s == 0:\r\n s = n\r\n print(s)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\nn = int(input())\r\nfor i in range(n):\r\n x = input()\r\n g = len(x)\r\n if g <= 10:\r\n print(st)\r\n else:\r\n print(x[0], g - 2, x[g - 1], sep=\"\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Quite recently, a very smart student named Jury decided that lectures are boring, so he downloaded a game called \"Black Square\" on his super cool touchscreen phone.\n\nIn this game, the phone's screen is divided into four vertical strips. Each second, a black square appears on some of the strips. According to the rules of the game, Jury must use this second to touch the corresponding strip to make the square go away. As Jury is both smart and lazy, he counted that he wastes exactly *a**i* calories on touching the *i*-th strip.\n\nYou've got a string *s*, describing the process of the game and numbers *a*1,<=*a*2,<=*a*3,<=*a*4. Calculate how many calories Jury needs to destroy all the squares?",
"input": "",
"output": "```python\na=list(map(int,input().split()))[:4]\r\ns=str(input())\r\nsum=0\r\nfor i in s:\r\n if i =='1':\r\n sum+=a[0]\r\n elif i =='2':\r\n sum+=a[1]\r\n elif i=='3':\r\n sum+=a[2]\r\n elif i=='4':\r\n sum+=a[3]\r\nprint(sum)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. \"Piece of cake\" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.",
"input": "",
"output": "```python\nn = int(input())\r\na,b,c = 0,0,0\r\nfor i,j,k in [int(x) for x in input().split()]:\r\n a += i\r\n b+=j\r\n c +=k\r\n\r\nif a == 0 and b ==0 and c==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given an array consisting of *n* non-negative integers *a*1,<=*a*2,<=...,<=*a**n*.\n\nYou are going to destroy integers in the array one by one. Thus, you are given the permutation of integers from 1 to *n* defining the order elements of the array are destroyed.\n\nAfter each element is destroyed you have to find out the segment of the array, such that it contains no destroyed elements and the sum of its elements is maximum possible. The sum of elements in the empty segment is considered to be 0.",
"input": "",
"output": "```python\nh=int(input())\r\nl=[*map(int,input().split())]\r\nd=[*map(int,input().split())]\r\no=2\r\nfor i in range(h):\r\n for j in range(h):\r\n l[d[j] - 1] = -1\r\n sums=[]\r\n x=0\r\n y=0\r\n for k in range(o):\r\n while l[x]!=-1 :\r\n y+=l[x]\r\n x+=1\r\n if x==h:\r\n break\r\n sums.append(y)\r\n y=0\r\n x+=1\r\n if x>=h:\r\n break\r\n o+=1\r\n\r\n print(max(sums))\r\n if max(sums)==0:\r\n exit(0)\r\n sums=[]\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Hands that shed innocent blood!\n\nThere are *n* guilty people in a line, the *i*-th of them holds a claw with length *L**i*. The bell rings and every person kills some of people in front of him. All people kill others at the same time. Namely, the *i*-th person kills the *j*-th person if and only if *j*<=<<=*i* and *j*<=≥<=*i*<=-<=*L**i*.\n\nYou are given lengths of the claws. You need to find the total number of alive people after the bell rings.",
"input": "",
"output": "```python\nn=int(input())\na=list(map(int,input().split()))\nb=0\nif n==1:\n print(1)\nelse:\n ans=0\n for i in range(n-1,-1,-1):\n if b==0:\n ans+=1\n #print(b,'b',b-1,'b-1',a[i],'a[i]',i,'i')\n b=max(b-1,a[i],0)\n #print('b',b)\n print(ans)\n\n\t \t \t\t \t\t \t \t \t\t \t\t \t\t\t \t\t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sereja and his friends went to a picnic. The guys had *n* soda bottles just for it. Sereja forgot the bottle opener as usual, so the guys had to come up with another way to open bottles.\n\nSereja knows that the *i*-th bottle is from brand *a**i*, besides, you can use it to open other bottles of brand *b**i*. You can use one bottle to open multiple other bottles. Sereja can open bottle with opened bottle or closed bottle.\n\nKnowing this, Sereja wants to find out the number of bottles they've got that they won't be able to open in any way. Help him and find this number.",
"input": "",
"output": "```python\nx,y,c=0,0,0\r\nfor i in range(int(input())):\r\n\ta,b=map(int, input().split())\r\n\tif b-a==0: c+=1\r\nprint(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given *n* numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given *n* numbers finds one that is different in evenness.",
"input": "",
"output": "```python\nn=int(input())\r\nl=list(map(lambda x : int(x)%2 ,input().split()))\r\ns=sum(l[:3])\r\nx=-1\r\nif s<=1:x=1\r\nelse:x=0\r\nfor i in range(n):\r\n if l[i]==x:break\r\nprint(1+i)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "President of Berland has a very vast office-room, where, apart from him, work his subordinates. Each subordinate, as well as President himself, has his own desk of a unique colour. Each desk is rectangular, and its sides are parallel to the office walls. One day President decided to establish an assembly, of which all his deputies will be members. Unfortunately, he does not remember the exact amount of his deputies, but he remembers that the desk of each his deputy is adjacent to his own desk, that is to say, the two desks (President's and each deputy's) have a common side of a positive length.\n\nThe office-room plan can be viewed as a matrix with *n* rows and *m* columns. Each cell of this matrix is either empty, or contains a part of a desk. An uppercase Latin letter stands for each desk colour. The «period» character («.») stands for an empty cell.",
"input": "",
"output": "```python\nlis=input().split()\nn,m=map(int,lis[:-1])\nc=lis[-1]\nans=['0'*(m+2)]\nl=[]\nb={'0','.',c}\nfor i in range(n):\n ans.append('0'+input()+'0')\nans.append('0'*(m+2))\nfor i in range(n):\n for j in range(m):\n if ans[i+1][j+1]==c:\n l.append(ans[i+1][j])\n l.append(ans[i+1][j+2])\n l.append(ans[i][j+1])\n l.append(ans[i+2][j+1])\nprint(len(set(l)-b))\n \t \t\t\t\t\t \t \t\t \t\t \t\t \t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bear Limak likes watching sports on TV. He is going to watch a game today. The game lasts 90 minutes and there are no breaks.\n\nEach minute can be either interesting or boring. If 15 consecutive minutes are boring then Limak immediately turns TV off.\n\nYou know that there will be *n* interesting minutes *t*1,<=*t*2,<=...,<=*t**n*. Your task is to calculate for how many minutes Limak will watch the game.",
"input": "",
"output": "```python\ninput();s=0\r\nfor i in map(int,input().split()):\r\n if i-s>15:break\r\n else:s=i\r\nprint([s+15,90][(s+15)>90])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Gerald bought two very rare paintings at the Sotheby's auction and he now wants to hang them on the wall. For that he bought a special board to attach it to the wall and place the paintings on the board. The board has shape of an *a*1<=×<=*b*1 rectangle, the paintings have shape of a *a*2<=×<=*b*2 and *a*3<=×<=*b*3 rectangles.\n\nSince the paintings are painted in the style of abstract art, it does not matter exactly how they will be rotated, but still, one side of both the board, and each of the paintings must be parallel to the floor. The paintings can touch each other and the edges of the board, but can not overlap or go beyond the edge of the board. Gerald asks whether it is possible to place the paintings on the board, or is the board he bought not large enough?",
"input": "",
"output": "```python\na1,b1 = map(int,input().split())\r\na2,b2 = map(int,input().split())\r\na3,b3 = map(int,input().split())\r\nn2 = [a2,b2]\r\nn3 = [a3,b3]\r\nl = []\r\nfor d2 in range(2):\r\n for d3 in range(2):\r\n l.append([n2[d2]+n3[d3],max(n2[d2-1],n3[d3-1])])\r\ndef c(l,a1,b1):\r\n a = False\r\n for i in l:\r\n if a1 >= i[0] and b1 >= i[1]:\r\n a = True\r\n return a\r\nz = c(l,a1,b1) or c(l,b1,a1)\r\nprint('YES' if z else 'NO')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a string *s* consisting only of characters 0 and 1. A substring [*l*,<=*r*] of *s* is a string *s**l**s**l*<=+<=1*s**l*<=+<=2... *s**r*, and its length equals to *r*<=-<=*l*<=+<=1. A substring is called balanced if the number of zeroes (0) equals to the number of ones in this substring.\n\nYou have to determine the length of the longest balanced substring of *s*.",
"input": "",
"output": "```python\nn = int(input())\r\ns = input()\r\nbalance_indices = {0: -1} \r\nbalance = 0\r\nmax_length = 0\r\nfor i in range(n):\r\n if s[i] == '0':\r\n balance -= 1\r\n else:\r\n balance += 1\r\n if balance in balance_indices:\r\n max_length = max(max_length, i - balance_indices[balance])\r\n else:\r\n balance_indices[balance] = i\r\nprint(max_length)# 1691082864.9898152\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given string *s*. Your task is to determine if the given string *s* contains two non-overlapping substrings \"AB\" and \"BA\" (the substrings can go in any order).",
"input": "",
"output": "```python\n\r\nif __name__=='__main__':\r\n s_arr = input()\r\n n_arr = []\r\n for i in s_arr:\r\n n_arr.append(i)\r\n # print(s_arr, n_arr)\r\n ab = 0\r\n ba = 0\r\n for i in range(len(n_arr)-1):\r\n c = n_arr[i]\r\n # print(c)\r\n if c == 'A' and n_arr[i+1] == 'B':\r\n # print(\"ab case\")\r\n ab=1\r\n n_arr[i]='x'\r\n n_arr[i+1]='x'\r\n elif c == 'B' and n_arr[i+1] == 'A':\r\n # print(\"ba case\")\r\n ba=1\r\n n_arr[i]='x'\r\n n_arr[i+1]='x'\r\n n_arr.append(c)\r\n \r\n if ab == 1 and ba == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Easter Rabbit laid *n* eggs in a circle and is about to paint them. \n\nEach egg should be painted one color out of 7: red, orange, yellow, green, blue, indigo or violet. Also, the following conditions should be satisfied:\n - Each of the seven colors should be used to paint at least one egg. - Any four eggs lying sequentially should be painted different colors. \nHelp the Easter Rabbit paint the eggs in the required manner. We know that it is always possible.",
"input": "",
"output": "```python\nn=int(input())\r\nc=\"ROYGBIV\"\r\nif n%7:\r\n m=n//7+1\r\n c*=m\r\n print(c[:n])\r\nelse:\r\n m=n//7\r\n print(c*m)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he organized a New Year party at his place and invited *n* his friends there.\n\nIf there's one thing Petya likes more that receiving gifts, that's watching others giving gifts to somebody else. Thus, he safely hid the laptop until the next New Year and made up his mind to watch his friends exchanging gifts while he does not participate in the process. He numbered all his friends with integers from 1 to *n*. Petya remembered that a friend number *i* gave a gift to a friend number *p**i*. He also remembered that each of his friends received exactly one gift.\n\nNow Petya wants to know for each friend *i* the number of a friend who has given him a gift.",
"input": "",
"output": "```python\n#Presents\r\nn=int(input())\r\narr=[int(i) for i in input().split()]\r\nans=[]\r\nrespuesta = \"\"\r\n\r\nfor i in range(n+1): ans.append(0)\r\nfor i in range(0,n): ans[arr[i]] = i+1\r\nfor i in range(1,len(ans)): respuesta+=str(ans[i])\r\n\r\nprint(respuesta)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once Bob got to a sale of old TV sets. There were *n* TV sets at that sale. TV set with index *i* costs *a**i* bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV sets he wants. Though he's very strong, Bob can carry at most *m* TV sets, and he has no desire to go to the sale for the second time. Please, help Bob find out the maximum sum of money that he can earn.",
"input": "",
"output": "```python\nn, m = map(int, input().split())\r\ntv = list(map(int, input().split()))\r\ntv.sort()\r\nresult = 0\r\nfor i in range(m):\r\n result -= tv[i]\r\nprint(result)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Alex doesn't like boredom. That's why whenever he gets bored, he comes up with games. One long winter evening he came up with a game and decided to play it.\n\nGiven a sequence *a* consisting of *n* integers. The player can make several steps. In a single step he can choose an element of the sequence (let's denote it *a**k*) and delete it, at that all elements equal to *a**k*<=+<=1 and *a**k*<=-<=1 also must be deleted from the sequence. That step brings *a**k* points to the player. \n\nAlex is a perfectionist, so he decided to get as many points as possible. Help him.",
"input": "",
"output": "```python\nn, arr = int(input()), [int(t) for t in input().split()]\r\nub = max(arr)\r\ncount, dp = [0] * (ub + 1), [0] * (ub + 1)\r\nfor i in arr: count[i] += i\r\ndp[1], dp[2] = count[1], count[2]\r\nfor i in range(3, ub + 1):\r\n dp[i] = count[i] + max(dp[i - 2], dp[i - 3])\r\nprint(max(dp[-1], dp[-2]))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Dr. Bruce Banner hates his enemies (like others don't). As we all know, he can barely talk when he turns into the incredible Hulk. That's why he asked you to help him to express his feelings.\n\nHulk likes the Inception so much, and like that his feelings are complicated. They have *n* layers. The first layer is hate, second one is love, third one is hate and so on...\n\nFor example if *n*<==<=1, then his feeling is \"I hate it\" or if *n*<==<=2 it's \"I hate that I love it\", and if *n*<==<=3 it's \"I hate that I love that I hate it\" and so on.\n\nPlease help Dr. Banner.",
"input": "",
"output": "```python\nprint(\" that \".join([\"I hate\",\"I love\"][i%2] for i in range(int(input()))),end=\" it\\n\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Masha and Grisha like studying sets of positive integers.\n\nOne day Grisha has written a set *A* containing *n* different integers *a**i* on a blackboard. Now he asks Masha to create a set *B* containing *n* different integers *b**j* such that all *n*2 integers that can be obtained by summing up *a**i* and *b**j* for all possible pairs of *i* and *j* are different.\n\nBoth Masha and Grisha don't like big numbers, so all numbers in *A* are from 1 to 106, and all numbers in *B* must also be in the same range.\n\nHelp Masha to create the set *B* that satisfies Grisha's requirement.",
"input": "",
"output": "```python\ndef get_numbers(numbers):\n\tresult_numbers = []\n\ttmp = []\n\tfor i in range(1, 10 ** 6):\n\t\tif len(result_numbers) == len(numbers):\n\t\t\tbreak\n\t\tfor elem in numbers:\n\t\t\tsumm = i + elem\n\t\t\t#print(not (summ in tmp or i in result_numbers), i, result_numbers)\n\t\t\tif not (summ in tmp or i in result_numbers):\t\n\t\t\t\ttmp.extend([elem + i for elem in numbers])\n\t\t\t\ttmp = list(set(tmp))\n\t\t\t\tresult_numbers.append(i)\n\t\tif i == 10 ** 6 - 1:\n\t\t\treturn 'NO'\n\treturn '\\nYES\\n' + ' '.join([str(x) for x in result_numbers])\n\n\ncount_tasks = int(input())\nresult = ''\nfor i in range(count_tasks):\n\tcount = input()\n\tnumbers = [int(x) for x in input().split()]\n\tresult += get_numbers(numbers)\nprint(result[1:])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little penguin Polo adores strings. But most of all he adores strings of length *n*.\n\nOne day he wanted to find a string that meets the following conditions:\n 1. The string consists of *n* lowercase English letters (that is, the string's length equals *n*), exactly *k* of these letters are distinct. 1. No two neighbouring letters of a string coincide; that is, if we represent a string as *s*<==<=*s*1*s*2... *s**n*, then the following inequality holds, *s**i*<=≠<=*s**i*<=+<=1(1<=≤<=*i*<=<<=*n*). 1. Among all strings that meet points 1 and 2, the required string is lexicographically smallest. \nHelp him find such string or state that such string doesn't exist.\n\nString *x*<==<=*x*1*x*2... *x**p* is lexicographically less than string *y*<==<=*y*1*y*2... *y**q*, if either *p*<=<<=*q* and *x*1<==<=*y*1,<=*x*2<==<=*y*2,<=... ,<=*x**p*<==<=*y**p*, or there is such number *r* (*r*<=<<=*p*,<=*r*<=<<=*q*), that *x*1<==<=*y*1,<=*x*2<==<=*y*2,<=... ,<=*x**r*<==<=*y**r* and *x**r*<=+<=1<=<<=*y**r*<=+<=1. The characters of the strings are compared by their ASCII codes.",
"input": "",
"output": "```python\nn,k = map(int,input().split())\r\nif n maximum:\n maximum = possible_max\n if int(number) > maximum:\n maximum = int(number)\n\nprint(maximum)\n \t \t \t\t \t\t \t\t \t\t \t\t\t\t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a given sequence of integers *a*1,<=*a*2,<=...,<=*a**n*, where every number is from 1 to 3 inclusively. You have to replace the minimum number of numbers in it so that all the numbers in the sequence are equal to each other.",
"input": "",
"output": "```python\nn=int(input())\r\nl=list(map(int, input().split()))[:n]\r\nx=[]\r\nx.append(l.count(1))\r\nx.append(l.count(2))\r\nx.append(l.count(3))\r\nx.sort()\r\nprint(x[0]+x[1])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petr likes to come up with problems about randomly generated data. This time problem is about random permutation. He decided to generate a random permutation this way: he takes identity permutation of numbers from $1$ to $n$ and then $3n$ times takes a random pair of different elements and swaps them. Alex envies Petr and tries to imitate him in all kind of things. Alex has also come up with a problem about random permutation. He generates a random permutation just like Petr but swaps elements $7n+1$ times instead of $3n$ times. Because it is more random, OK?!\n\nYou somehow get a test from one of these problems and now you want to know from which one.",
"input": "",
"output": "```python\nn = int(input())\r\na = [int(x) - 1 for x in input().split()]\r\n\r\nans = 0\r\nfor i in range(n):\r\n if a[i] == -1:\r\n continue\r\n ans ^= 1\r\n x = i\r\n while x != -1:\r\n y = a[x]\r\n a[x] = -1\r\n x = y\r\n\r\nif ans:\r\n print(\"Um_nik\")\r\nelse:\r\n print(\"Petr\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Theater stage is a rectangular field of size *n*<=×<=*m*. The director gave you the stage's plan which actors will follow. For each cell it is stated in the plan if there would be an actor in this cell or not.\n\nYou are to place a spotlight on the stage in some good position. The spotlight will project light in one of the four directions (if you look at the stage from above) — left, right, up or down. Thus, the spotlight's position is a cell it is placed to and a direction it shines.\n\nA position is good if two conditions hold: \n - there is no actor in the cell the spotlight is placed to; - there is at least one actor in the direction the spotlight projects. \nCount the number of good positions for placing the spotlight. Two positions of spotlight are considered to be different if the location cells or projection direction differ.",
"input": "",
"output": "```python\nn, m=map(int, input().split())\r\na=[list(map(int, input().split())) for _ in range(n)]\r\nans=p=0\r\n\r\ndef f(x):\r\n global ans, p\r\n if x==0:\r\n ans+=p\r\n else:\r\n p=1\r\n\r\nfor i in range(n):\r\n p=0\r\n for j in range(m):\r\n f(a[i][j])\r\n p=0\r\n for j in range(m-1, -1, -1):\r\n f(a[i][j])\r\n\r\nfor i in range(m):\r\n p=0\r\n for j in range(n):\r\n f(a[j][i])\r\n p=0\r\n for j in range(n-1, -1, -1):\r\n f(a[j][i])\r\n\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasily has a deck of cards consisting of *n* cards. There is an integer on each of the cards, this integer is between 1 and 100<=000, inclusive. It is possible that some cards have the same integers on them.\n\nVasily decided to sort the cards. To do this, he repeatedly takes the top card from the deck, and if the number on it equals the minimum number written on the cards in the deck, then he places the card away. Otherwise, he puts it under the deck and takes the next card from the top, and so on. The process ends as soon as there are no cards in the deck. You can assume that Vasily always knows the minimum number written on some card in the remaining deck, but doesn't know where this card (or these cards) is.\n\nYou are to determine the total number of times Vasily takes the top card from the deck.",
"input": "",
"output": "```python\nn = int(input())\r\nf = []\r\nfor i in range(n):\r\n\tavg = int(input())\r\n\ty=[avg,i+1]\r\n\tf.append(y)\r\nf.sort()\r\nlast = -1\r\nans = 0\r\nnumberContinueing = 0\r\nfor i in f:\r\n\tif(i[1]>last):\r\n\t\tlast = i[1]\r\n\t\tnumberContinueing+=1\r\n\telse:\r\n\t\tans+=n\r\n\t\tn-=numberContinueing\r\n\t\tnumberContinueing=1\r\n\t\tlast = i[1]\r\n\r\nprint(ans+n)\r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pasha loves his phone and also putting his hair up... But the hair is now irrelevant.\n\nPasha has installed a new game to his phone. The goal of the game is following. There is a rectangular field consisting of *n* row with *m* pixels in each row. Initially, all the pixels are colored white. In one move, Pasha can choose any pixel and color it black. In particular, he can choose the pixel that is already black, then after the boy's move the pixel does not change, that is, it remains black. Pasha loses the game when a 2<=×<=2 square consisting of black pixels is formed. \n\nPasha has made a plan of *k* moves, according to which he will paint pixels. Each turn in his plan is represented as a pair of numbers *i* and *j*, denoting respectively the row and the column of the pixel to be colored on the current move.\n\nDetermine whether Pasha loses if he acts in accordance with his plan, and if he does, on what move the 2<=×<=2 square consisting of black pixels is formed.",
"input": "",
"output": "```python\nn,m,k=map(int,input().split())\r\np,matrix=0,[[0 for _ in range(m+2)]for _ in range(n+2)]\r\nl=[[1,1],[-1,1],[1,-1],[-1,-1]]\r\nfor q in range(1,1+k):\r\n i,j=map(int,input().split())\r\n matrix[i][j]=1\r\n\r\n\r\n if sum([matrix[i][j],matrix[i+p[0]][j],matrix[i][j+p[1]],matrix[i+p[0]][j+p[1]]]==[1,1,1,1]for p in l)!=0:\r\n p=q\r\n break\r\nprint(p)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A number is called quasibinary if its decimal representation contains only digits 0 or 1. For example, numbers 0, 1, 101, 110011 — are quasibinary and numbers 2, 12, 900 are not.\n\nYou are given a positive integer *n*. Represent it as a sum of minimum number of quasibinary numbers.",
"input": "",
"output": "```python\nl=list(map(int,list(input())))\r\nc=[]\r\nt=len(l)\r\nfor x in range(9):\r\n s=''\r\n for x in range(t):\r\n if l[x]>0:\r\n l[x]-=1\r\n s+='1'\r\n else: s+='0'\r\n c.append(int(s))\r\n if c[-1]==0: c.pop();break\r\nprint(len(c))\r\nprint(*c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The input contains a single integer *a* (1<=≤<=*a*<=≤<=40).\n\nOutput a single string.",
"input": "",
"output": "```python\na = int(input())\r\npr = ['Washington', 'Adams', 'Jefferson', 'Madison', 'Monroe', 'Quincy Adams', 'Jackson', 'Van Buren', 'Henry Harrison', 'Tyler', 'Polk', 'Taylor', 'Fillmore', 'Pierce', 'Buchanan', 'Lincoln', 'Johnson', 'S. Grant', 'B. Hayes', 'A. Garfield', 'A. Arthur', 'Cleveland', 'Harrison', 'Cleveland', 'McKinley', 'Roosevelt', 'H. Taft', 'Wilson', 'Harding', 'Coolidge', 'Hoover', 'D. Roosevelt', 'S Truman', 'D. Eisenhower', 'F. Kennedy', 'B. Johnson', 'M. Nixon', 'R. Ford', 'Carter', 'W. Reagan', 'Bush', 'J. Clinton']\r\nprint(pr[a-1])\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once Max found an electronic calculator from his grandfather Dovlet's chest. He noticed that the numbers were written with seven-segment indicators ([https://en.wikipedia.org/wiki/Seven-segment_display](https://en.wikipedia.org/wiki/Seven-segment_display)).\n\nMax starts to type all the values from *a* to *b*. After typing each number Max resets the calculator. Find the total number of segments printed on the calculator.\n\nFor example if *a*<==<=1 and *b*<==<=3 then at first the calculator will print 2 segments, then — 5 segments and at last it will print 5 segments. So the total number of printed segments is 12.",
"input": "",
"output": "```python\na,b=map(int,input().split())\r\ncount=0\r\ndict={\"0\":6,\"6\":6,\"9\":6,\"1\":2,\"2\":5,\"3\":5,\"4\":4,\"5\":5,\"7\":3,\"8\":7}\r\nfor i in range(a,b+1):\r\n i=str(i)\r\n for j in range(len(str(i))):\r\n\r\n\r\n count+=dict[i[j]]\r\nprint(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "To make a paper airplane, one has to use a rectangular piece of paper. From a sheet of standard size you can make $s$ airplanes.\n\nA group of $k$ people decided to make $n$ airplanes each. They are going to buy several packs of paper, each of them containing $p$ sheets, and then distribute the sheets between the people. Each person should have enough sheets to make $n$ airplanes. How many packs should they buy?",
"input": "",
"output": "```python\nk,n,s,p=map(int,input().split())\r\nq=s\r\ni=1\r\nwhile q(p*packs*s):\r\n packs+=1\r\nprint(packs)\r\n\r\n \r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Как известно, в теплую погоду многие жители крупных городов пользуются сервисами городского велопроката. Вот и Аркадий сегодня будет добираться от школы до дома, используя городские велосипеды.\n\nШкола и дом находятся на одной прямой улице, кроме того, на той же улице есть *n* точек, где можно взять велосипед в прокат или сдать его. Первый велопрокат находится в точке *x*1 километров вдоль улицы, второй — в точке *x*2 и так далее, *n*-й велопрокат находится в точке *x**n*. Школа Аркадия находится в точке *x*1 (то есть там же, где и первый велопрокат), а дом — в точке *x**n* (то есть там же, где и *n*-й велопрокат). Известно, что *x**i*<=<<=*x**i*<=+<=1 для всех 1<=≤<=*i*<=<<=*n*.\n\nСогласно правилам пользования велопроката, Аркадий может брать велосипед в прокат только на ограниченное время, после этого он должен обязательно вернуть его в одной из точек велопроката, однако, он тут же может взять новый велосипед, и отсчет времени пойдет заново. Аркадий может брать не более одного велосипеда в прокат одновременно. Если Аркадий решает взять велосипед в какой-то точке проката, то он сдаёт тот велосипед, на котором он до него доехал, берёт ровно один новый велосипед и продолжает на нём своё движение.\n\nЗа отведенное время, независимо от выбранного велосипеда, Аркадий успевает проехать не больше *k* километров вдоль улицы. \n\nОпределите, сможет ли Аркадий доехать на велосипедах от школы до дома, и если да, то какое минимальное число раз ему необходимо будет взять велосипед в прокат, включая первый велосипед? Учтите, что Аркадий не намерен сегодня ходить пешком.",
"input": "",
"output": "```python\nhelper = 0\r\nn = ''\r\nk = ''\r\nmyList = []\r\n\r\nfirstData = input()\r\nfor i in firstData:\r\n\tif i != ' ' and helper == 0:\r\n\t\tn += i\r\n\telif i != ' ':\r\n\t\tk += i\r\n\telse:\r\n\t\thelper += 1\r\nn = int(n)\r\nk = int(k)\r\n\r\nhelper = 0\r\nhelpStr = ''\r\nsecondData = input()\r\nfor i in secondData:\r\n\tif i != ' ':\r\n\t\thelper = 0\r\n\t\thelpStr += i\r\n\telif i == ' ' and helper == 0:\r\n\t\tmyList.append(int(helpStr))\r\n\t\thelpStr = ''\r\n\t\thelper += 1\r\nmyList.append(int(helpStr))\r\n\r\nindex = 1\r\ncountBike = 0\r\n\r\nwhile index < len(myList):\r\n\thelpe = 0\r\n\thelper = myList[index + helpe] - myList[index - 1]\r\n\twhile helper <= k:\r\n\t\thelpe += 1\r\n\t\tif index + helpe< len(myList):\r\n\t\t\thelper = myList[index + helpe] - myList[index - 1]\r\n\t\telse:\r\n\t\t\tbreak\r\n\tif helpe == 0 :\r\n\t\tcountBike = -1\r\n\t\tbreak\r\n\telse:\r\n\t\tcountBike += 1\r\n\t\tindex += helpe\r\n\r\nprint(countBike)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Permutation *p* is an ordered set of integers *p*1,<=<=*p*2,<=<=...,<=<=*p**n*, consisting of *n* distinct positive integers, each of them doesn't exceed *n*. We'll denote the *i*-th element of permutation *p* as *p**i*. We'll call number *n* the size or the length of permutation *p*1,<=<=*p*2,<=<=...,<=<=*p**n*.\n\nYou have a sequence of integers *a*1,<=*a*2,<=...,<=*a**n*. In one move, you are allowed to decrease or increase any number by one. Count the minimum number of moves, needed to build a permutation from this sequence.",
"input": "",
"output": "```python\nn, val = int(input()), 0\r\nfor x, y in zip(sorted(int(x) for x in input().split()), range(1, n + 1)):\r\n val += abs(x - y)\r\nprint(val)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Capitalization is writing a word with its first letter as a capital letter. Your task is to capitalize the given word.\n\nNote, that during capitalization all the letters except the first one remains unchanged.",
"input": "",
"output": "```python\na = input()\r\nprint(a[0].capitalize() + a[1:])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "User ainta is making a web site. This time he is going to make a navigation of the pages. In his site, there are *n* pages numbered by integers from 1 to *n*. Assume that somebody is on the *p*-th page now. The navigation will look like this:\n\nWhen someone clicks the button \"<<\" he is redirected to page 1, and when someone clicks the button \">>\" he is redirected to page *n*. Of course if someone clicks on a number, he is redirected to the corresponding page.\n\nThere are some conditions in the navigation:\n - If page 1 is in the navigation, the button \"<<\" must not be printed. - If page *n* is in the navigation, the button \">>\" must not be printed. - If the page number is smaller than 1 or greater than *n*, it must not be printed. \nYou can see some examples of the navigations. Make a program that prints the navigation.",
"input": "",
"output": "```python\nX = list(map(int, input().split()))\r\nPages = [str(i + 1) for i in range(X[0])]\r\nPages[X[1] - 1] = '(' + Pages[X[1] - 1] + ')'\r\nif X[-1] <= X[1] - X[-1]:\r\n print(\"<< \", end=\"\")\r\nprint(*Pages[max(0, X[1] - X[-1] - 1):min(X[0], X[1] + X[-1])], end=\" \")\r\nif X[1] < X[0] - X[-1]:\r\n print(\">>\")\r\n\r\n# Caption: God bless you General Soleimani\r\n\r\n# ---------Hard Revenge---------\r\n\r\n# ****** Rest in Peace ******\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Dima and Alex had an argument about the price and quality of laptops. Dima thinks that the more expensive a laptop is, the better it is. Alex disagrees. Alex thinks that there are two laptops, such that the price of the first laptop is less (strictly smaller) than the price of the second laptop but the quality of the first laptop is higher (strictly greater) than the quality of the second laptop.\n\nPlease, check the guess of Alex. You are given descriptions of *n* laptops. Determine whether two described above laptops exist.",
"input": "",
"output": "```python\nn=int(input())\r\nprice=[]\r\nquility=[]\r\nflag=True\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n price.append(a)\r\n quility.append(b)\r\nfor i in range(n):\r\n if price[i]quility[i-1]:\r\n flag=True\r\n break\r\n else:\r\n flag=False\r\n\r\nprint(\"Happy Alex\") if flag==True else print(\"Poor Alex\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "During the winter holidays, the demand for Christmas balls is exceptionally high. Since it's already 2018, the advances in alchemy allow easy and efficient ball creation by utilizing magic crystals.\n\nGrisha needs to obtain some yellow, green and blue balls. It's known that to produce a yellow ball one needs two yellow crystals, green — one yellow and one blue, and for a blue ball, three blue crystals are enough.\n\nRight now there are *A* yellow and *B* blue crystals in Grisha's disposal. Find out how many additional crystals he should acquire in order to produce the required number of balls.",
"input": "",
"output": "```python\nA,B = map(int, input().split())\r\nx,y,z = map(int, input().split())\r\nA1 = 2*x + y - A\r\nB1 = 3*z + y - B\r\nfinal = 0\r\nif A1 > 0:\r\n final = final + A1\r\nif B1 > 0:\r\n final = final + B1\r\nprint(final)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Given an array *a*1,<=*a*2,<=...,<=*a**n* of *n* integers, find the largest number in the array that is not a perfect square.\n\nA number *x* is said to be a perfect square if there exists an integer *y* such that *x*<==<=*y*2.",
"input": "",
"output": "```python\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort() \r\nfor i in range(n):\r\n\tif math.sqrt(a[n-i-1])%1!=0:\r\n\t\tprint(a[n-1-i])\r\n\t\texit()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two arrays of integers *a* and *b*. For each element of the second array *b**j* you should find the number of elements in array *a* that are less than or equal to the value *b**j*.",
"input": "",
"output": "```python\nfrom collections import Counter\nm,n=list(map(int,input().split()))\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nres=[]\ncounter=Counter(a)\nsortedKeys=sorted(counter.keys())\nfor num in b:\n sum=0\n for x in sortedKeys:\n if x>num:\n break\n sum+=counter[x]\n res.append(sum)\nres=list(map(str,res))\nprint(\" \".join(res))\n\t\t \t \t\t\t \t\t\t\t\t \t \t \t\t \t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once again Tavas started eating coffee mix without water! Keione told him that it smells awful, but he didn't stop doing that. That's why Keione told his smart friend, SaDDas to punish him! SaDDas took Tavas' headphones and told him: \"If you solve the following problem, I'll return it to you.\"\n\nThe problem is: \n\nYou are given a lucky number *n*. Lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.\n\nIf we sort all lucky numbers in increasing order, what's the 1-based index of *n*? \n\nTavas is not as smart as SaDDas, so he asked you to do him a favor and solve this problem so he can have his headphones back.",
"input": "",
"output": "```python\nfrom sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\nfrom itertools import permutations\r\n\r\ndef main():\r\n n = I()\r\n l = len(str(n))\r\n s = list(str(n))\r\n s = ['4']*l + ['7']*l\r\n res = set()\r\n for i in range(1, l+1):\r\n p = permutations(s, i)\r\n for r in p:\r\n if len(r) == 1:\r\n dig = int(r[0])\r\n else:\r\n y = [*r]\r\n k = ''.join(y)\r\n dig = int(k)\r\n if dig not in res and dig <= n:\r\n res.add(dig)\r\n out = sorted(res)\r\n return out.index(n)+1\r\n\r\nif __name__ == '__main__':\r\n print(main())\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each direction) and 3 lanes getting out of the intersection, so we have 4 parts in total. Each part has 4 lights, one for each lane getting into the intersection (*l* — left, *s* — straight, *r* — right) and a light *p* for a pedestrian crossing. \n\nAn accident is possible if a car can hit a pedestrian. This can happen if the light of a pedestrian crossing of some part and the light of a lane that can get to or from that same part are green at the same time.\n\nNow, Sagheer is monitoring the configuration of the traffic lights. Your task is to help him detect whether an accident is possible.",
"input": "",
"output": "```python\na = [0] * 4\r\nfor i in range(4):\r\n a[i] = list(map(int, input().split()))\r\n \r\nif a[0][3] == 1:\r\n if a[3][3] or a[1][0] or a[2][1] or a[0][0] or a[0][1] or a[0][2]:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif a[1][3] == 1:\r\n if a[1][0] or a[1][1] or a[1][2] or a[0][2] or a[2][0] or a[3][1]:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif a[2][3] == 1:\r\n if a[2][0] or a[2][1] or a[2][2] or a[0][1] or a[1][2] or a[3][0]:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if a[3][0] or a[3][1] or a[3][2] or a[0][0] or a[1][1] or a[2][2]:\r\n print('YES')\r\n else:\r\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "For a positive integer *n* let's define a function *f*:\n\n*f*(*n*)<==<=<=-<=1<=+<=2<=-<=3<=+<=..<=+<=(<=-<=1)*n**n* \n\nYour task is to calculate *f*(*n*) for a given integer *n*.",
"input": "",
"output": "```python\nn=int(input())\r\nsum_e=0\r\nsum_o=0\r\nfor i in range(1,n+1):\r\n if i%2==0:\r\n sum_e=sum_e+i\r\n else:\r\n sum_o=sum_o-i\r\n sum_t=sum_e+sum_o\r\nprint(sum)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The tournament «Sleepyhead-2010» in the rapid falling asleep has just finished in Berland. *n* best participants from the country have participated in it. The tournament consists of games, each of them is a match between two participants. *n*·(*n*<=-<=1)<=/<=2 games were played during the tournament, and each participant had a match with each other participant. \n\nThe rules of the game are quite simple — the participant who falls asleep first wins. The secretary made a record of each game in the form «*x**i* *y**i*», where *x**i* and *y**i* are the numbers of participants. The first number in each pair is a winner (i.e. *x**i* is a winner and *y**i* is a loser). There is no draws.\n\nRecently researches form the «Institute Of Sleep» have found that every person is characterized by a value *p**j* — the speed of falling asleep. The person who has lower speed wins. Every person has its own value *p**j*, constant during the life. \n\nIt is known that all participants of the tournament have distinct speeds of falling asleep. Also it was found that the secretary made records about all the games except one. You are to find the result of the missing game.",
"input": "",
"output": "```python\ndef solve():\r\n n = int(input().strip())\r\n\r\n v = [x for x in range(1, n + 1)]\r\n\r\n count = [0 for x in range(1, n + 1)]\r\n won = [0 for x in range(1, n + 1)]\r\n\r\n for i in range(int(n * (n - 1) / 2) - 1):\r\n a, b = map(int, input().split())\r\n\r\n count[a - 1] += 1\r\n count[b - 1] += 1\r\n\r\n won[a - 1] += 1\r\n\r\n last = []\r\n for i in range(len(count)):\r\n if count[i] == n - 2:\r\n last.append(i + 1)\r\n\r\n # print(last, won)\r\n\r\n a_i = v.index(last[0])\r\n b_i = v.index(last[1])\r\n\r\n if won[a_i] > won[b_i]:\r\n print(last[0], last[1])\r\n else:\r\n print(last[1], last[0])\r\n\r\n # print(v)\r\n\r\n\r\nsolve()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Let's call a number *k*-good if it contains all digits not exceeding *k* (0,<=...,<=*k*). You've got a number *k* and an array *a* containing *n* numbers. Find out how many *k*-good numbers are in *a* (count each number every time it occurs in array *a*).",
"input": "",
"output": "```python\nn,k=map(int,input().split())\r\nm=[]\r\nnum=0\r\nfor i in range(0,n):\r\n m=list(map(int,input().split()))\r\n for i in range(0,len(m)):\r\n if(a[i]>k):\r\n num=num+1\r\n break\r\nprint(num) \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A bus moves along the coordinate line *Ox* from the point *x*<==<=0 to the point *x*<==<=*a*. After starting from the point *x*<==<=0, it reaches the point *x*<==<=*a*, immediately turns back and then moves to the point *x*<==<=0. After returning to the point *x*<==<=0 it immediately goes back to the point *x*<==<=*a* and so on. Thus, the bus moves from *x*<==<=0 to *x*<==<=*a* and back. Moving from the point *x*<==<=0 to *x*<==<=*a* or from the point *x*<==<=*a* to *x*<==<=0 is called a bus journey. In total, the bus must make *k* journeys.\n\nThe petrol tank of the bus can hold *b* liters of gasoline. To pass a single unit of distance the bus needs to spend exactly one liter of gasoline. The bus starts its first journey with a full petrol tank.\n\nThere is a gas station in point *x*<==<=*f*. This point is between points *x*<==<=0 and *x*<==<=*a*. There are no other gas stations on the bus route. While passing by a gas station in either direction the bus can stop and completely refuel its tank. Thus, after stopping to refuel the tank will contain *b* liters of gasoline.\n\nWhat is the minimum number of times the bus needs to refuel at the point *x*<==<=*f* to make *k* journeys? The first journey starts in the point *x*<==<=0.",
"input": "",
"output": "```python\na,b,f,k=map(int,input().split())\r\npetrol=b\r\nans=0\r\nfor i in range(k):\r\n if petrol<0:\r\n print(-1)\r\n exit()\r\n if i%2==0:\r\n if petrol>=a:\r\n petrol-=a\r\n elif petrol>=f:\r\n petrol=b-(a-f)\r\n ans+=1\r\n else:\r\n ans+=1\r\n petrol=b-f\r\n if petrol>=a:\r\n petrol-=a\r\n elif petrol>=f:\r\n petrol=b-a+f\r\n ans+=1\r\n else:\r\n print(-1)\r\n exit()\r\n else:\r\n if petrol>=a:\r\n petrol-=a\r\n elif petrol>=a-f:\r\n petrol=b-(f)\r\n ans+=1\r\n else:\r\n ans+=1\r\n petrol=b-a+f\r\n if petrol>=a:\r\n petrol-=a\r\n elif petrol>=f:\r\n petrol=b-f\r\n ans+=1\r\n else:\r\n print(-1)\r\n exit()\r\nprint(ans)\r\n \r\n \r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You can't possibly imagine how cold our friends are this winter in Nvodsk! Two of them play the following game to warm up: initially a piece of paper has an integer *q*. During a move a player should write any integer number that is a non-trivial divisor of the last written number. Then he should run this number of circles around the hotel. Let us remind you that a number's divisor is called non-trivial if it is different from one and from the divided number itself. \n\nThe first person who can't make a move wins as he continues to lie in his warm bed under three blankets while the other one keeps running. Determine which player wins considering that both players play optimally. If the first player wins, print any winning first move.",
"input": "",
"output": "```python\n\ndef factorize(n):\n p = 2\n r = []\n while p * p <= n:\n while n % p == 0:\n r.append(p)\n n //= p\n p += 1\n if n > 1:\n r.append(n)\n return r\n\n\nq = int(input())\nf = factorize(q)\nif len(f) <= 1:\n print(1)\n print(0)\nelif len(f) == 2:\n print(2)\nelse:\n print(1)\n print(f[0] * f[1])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\nn = int(input())\r\nanswers=[]\r\n\r\nfor i in range(n):\r\n accword = []\r\n word = str(input()).strip()\r\n if len(word) > 4:\r\n for char in word:\r\n accword.append(char)\r\n new = accword[0]+str(len(word))+accword[-1]\r\n answers.append(new)\r\n else:\r\n answers.append(word)\r\n\r\nfor i2 in answers:\r\n print(i2)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.\n\nSuppose the graph *G* is given. Subset *A* of its vertices is called a vertex cover of this graph, if for each edge *uv* there is at least one endpoint of it in this set, i.e. or (or both).\n\nPari and Arya have won a great undirected graph as an award in a team contest. Now they have to split it in two parts, but both of them want their parts of the graph to be a vertex cover.\n\nThey have agreed to give you their graph and you need to find two disjoint subsets of its vertices *A* and *B*, such that both *A* and *B* are vertex cover or claim it's impossible. Each vertex should be given to no more than one of the friends (or you can even keep it for yourself).",
"input": "",
"output": "```python\nflag = 0\r\nn, e = [int(i) for i in input().split(\" \")]\r\nedges = []\r\n\r\nfor i in range(e):\r\n k = [int(i) for i in input().split(\" \")]\r\n edges.append(k)\r\n \r\ndictionary = {}\r\nvisited = [0] * (n+1)\r\n\r\ndef backtrack(ind, set_1, set_2):\r\n\r\n if ind >= len(edges):\r\n return [True, set_1, set_2]\r\n \r\n u = edges[ind][0]\r\n v = edges[ind][1]\r\n \r\n if visited[u] == 1 and visited[v] == 1:\r\n if u in set_1 and v in set_1:\r\n return False\r\n \r\n elif u in set_2 and v in set_2:\r\n return False\r\n \r\n else:\r\n return backtrack(ind+1, set_1, set_2)\r\n \r\n elif visited[u] == 0 and visited[v] == 0:\r\n \r\n set_1.append(u)\r\n set_2.append(v)\r\n \r\n visited[u] = 1\r\n visited[v] = 1\r\n \r\n if backtrack(ind+1, set_1, set_2):\r\n return [True, set_1, set_2]\r\n else:\r\n set_1.remove(u)\r\n set_2.remove(v)\r\n \r\n set_1.append(v)\r\n set_2.append(u)\r\n \r\n return backtrack(ind+1, set_1, set_2)\r\n \r\n else:\r\n if visited[u] == 1:\r\n if u in set_1:\r\n set_2.append(v)\r\n else:\r\n set_1.append(v)\r\n visited[v] = 1\r\n \r\n return backtrack(ind+1, set_1, set_2)\r\n \r\n else:\r\n if v in set_1:\r\n set_2.append(u)\r\n else:\r\n set_1.append(u)\r\n visited[u] = 1\r\n \r\n return backtrack(ind+1, set_1, set_2)\r\n\r\nr = backtrack(0, [], [])\r\nk1 = r[1]\r\nk2 = r[2]\r\n# print(r)\r\nif r is not False:\r\n # print(r[1], r[2])\r\n \r\n print(len(r[1]))\r\n for i in range(len(k1)):\r\n print(k1[i], end=\" \")\r\n \r\n print()\r\n \r\n print(len(k2))\r\n for i in range(len(k2)):\r\n print(k2[i], end=\" \")\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given an equation: \n\nYour task is to find the number of distinct roots of the equation and print all of them in ascending order.",
"input": "",
"output": "```python\nimport math \r\n \r\na = float(input()) \r\nb = float(input()) \r\nc = float(input()) \r\n \r\nspecial = b**2 - 4*a*c \r\n \r\nif special < 0: \r\n print(0) \r\nelif special == 0: \r\n x = (-b)/(2*a) \r\n print(1)\r\n print(x) \r\nelif special > 9999999999:\r\n print(-1)\r\nelse: \r\n x1 = float( (-b-math.sqrt(special))/(2*a) )\r\n x2 = float( (-b+math.sqrt(special))/(2*a) )\r\n print(2)\r\n print(round(x1,5))\r\n print(x2 + 0.00000)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A number is called quasibinary if its decimal representation contains only digits 0 or 1. For example, numbers 0, 1, 101, 110011 — are quasibinary and numbers 2, 12, 900 are not.\n\nYou are given a positive integer *n*. Represent it as a sum of minimum number of quasibinary numbers.",
"input": "",
"output": "```python\nn=list(map(int,list(input())))\r\nans=int(max(n))\r\nprint(ans)\r\ns=\"\"\r\nwhile(ans):\r\n\tfor i in range(len(n)):\r\n\t\tif(n[i]>=1):\r\n\t\t\ts+=\"1\"\r\n\t\t\tn[i]-=1\r\n\t\telse:\r\n\t\t\ts+=str(n[i])\r\n\tprint(s,end=\" \")\r\n\ts=\"\"\r\n\tans-=1\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Saratov State University Olympiad Programmers Training Center (SSU OPTC) has *n* students. For each student you know the number of times he/she has participated in the ACM ICPC world programming championship. According to the ACM ICPC rules, each person can participate in the world championship at most 5 times.\n\nThe head of the SSU OPTC is recently gathering teams to participate in the world championship. Each team must consist of exactly three people, at that, any person cannot be a member of two or more teams. What maximum number of teams can the head make if he wants each team to participate in the world championship with the same members at least *k* times?",
"input": "",
"output": "```python\na, b = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nf = [f[i] + b for i in range(a)]\r\nr = 0\r\nfor _ in range(a):\r\n if f[_] <= 5:\r\n r+=1\r\n#print(*f)\r\nprint(r//3)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "All cities of Lineland are located on the *Ox* coordinate axis. Thus, each city is associated with its position *x**i* — a coordinate on the *Ox* axis. No two cities are located at a single point.\n\nLineland residents love to send letters to each other. A person may send a letter only if the recipient lives in another city (because if they live in the same city, then it is easier to drop in).\n\nStrange but true, the cost of sending the letter is exactly equal to the distance between the sender's city and the recipient's city.\n\nFor each city calculate two values *min**i* and *max**i*, where *min**i* is the minimum cost of sending a letter from the *i*-th city to some other city, and *max**i* is the the maximum cost of sending a letter from the *i*-th city to some other city",
"input": "",
"output": "```python\nfrom sys import stdin, stdout\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom queue import Queue\r\nimport heapq\r\nimport math\r\nfrom itertools import permutations, combinations, islice\r\n\r\nn = int(stdin.readline())\r\na = [*map(int, stdin.readline().strip().split())]\r\nfor i in range(n):\r\n prev = a[i-1]\r\n next = a[i+1] if (i+i) <= n else a[0]\r\n stdout.write(f\"{min(abs(a[i]-prev), abs(a[i]-next))} {max(abs(a[i]-prev), abs(a[i]-next))}\\n\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya came across three Berland coins. They didn't have any numbers that's why Vasya didn't understand how their denominations differ. He supposed that if one coin is heavier than the other one, then it should be worth more. Vasya weighed all the three pairs of coins on pan balance scales and told you the results. Find out how the deminations of the coins differ or if Vasya has a mistake in the weighting results. No two coins are equal.",
"input": "",
"output": "```python\nfrom typing import DefaultDict\n\n\nletters = DefaultDict(lambda :0)\nfor i in range(3):\n line = input()\n f = line[0]\n s = line[1]\n l = line[2]\n if s=='>':\n letters[f]+=1\n if s=='<':\n letters[l]+=1\norder = [None]*3\nres = ''\nfor letter in 'ABC':\n v = letters[letter]\n if order[v] is not None:\n res = 'Impossible'\n break\n else:\n order[v]=letter\nif res=='':\n res = ''.join(order)\nprint(res)\n\n\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mike is trying rock climbing but he is awful at it. \n\nThere are *n* holds on the wall, *i*-th hold is at height *a**i* off the ground. Besides, let the sequence *a**i* increase, that is, *a**i*<=<<=*a**i*<=+<=1 for all *i* from 1 to *n*<=-<=1; we will call such sequence a track. Mike thinks that the track *a*1, ..., *a**n* has difficulty . In other words, difficulty equals the maximum distance between two holds that are adjacent in height.\n\nToday Mike decided to cover the track with holds hanging on heights *a*1, ..., *a**n*. To make the problem harder, Mike decided to remove one hold, that is, remove one element of the sequence (for example, if we take the sequence (1,<=2,<=3,<=4,<=5) and remove the third element from it, we obtain the sequence (1,<=2,<=4,<=5)). However, as Mike is awful at climbing, he wants the final difficulty (i.e. the maximum difference of heights between adjacent holds after removing the hold) to be as small as possible among all possible options of removing a hold. The first and last holds must stay at their positions.\n\nHelp Mike determine the minimum difficulty of the track after removing one hold.",
"input": "",
"output": "```python\nn = int(input())\r\narr = list(map(int,input().split()))\r\nl = []\r\n\r\nfor i in range(1 , n-1):\r\n x = arr.pop(i)\r\n d = []\r\n #print(x)\r\n\r\n for j in range(len(arr) - 1):\r\n d.append(arr[j+1] - arr[j])\r\n #print(d)\r\n l.append(max(d))\r\n arr.append(x)\r\n arr.sort()\r\n\r\nprint(min(l))\r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Consider the infinite sequence of integers: 1,<=1,<=2,<=1,<=2,<=3,<=1,<=2,<=3,<=4,<=1,<=2,<=3,<=4,<=5.... The sequence is built in the following way: at first the number 1 is written out, then the numbers from 1 to 2, then the numbers from 1 to 3, then the numbers from 1 to 4 and so on. Note that the sequence contains numbers, not digits. For example number 10 first appears in the sequence in position 55 (the elements are numerated from one).\n\nFind the number on the *n*-th position of the sequence.",
"input": "",
"output": "```python\nn = int(input())\ni, s = 1, 0\nwhile s + i < n:\n s += i\n i += 1\nprint(n - s if n - s <= i else i)\n\n\t\t\t \t\t\t\t\t \t \t \t\t\t\t \t\t\t\t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The last product of the R2 company in the 2D games' field is a new revolutionary algorithm of searching for the shortest path in a 2<=×<=*n* maze.\n\nImagine a maze that looks like a 2<=×<=*n* rectangle, divided into unit squares. Each unit square is either an empty cell or an obstacle. In one unit of time, a person can move from an empty cell of the maze to any side-adjacent empty cell. The shortest path problem is formulated as follows. Given two free maze cells, you need to determine the minimum time required to go from one cell to the other.\n\nUnfortunately, the developed algorithm works well for only one request for finding the shortest path, in practice such requests occur quite often. You, as the chief R2 programmer, are commissioned to optimize the algorithm to find the shortest path. Write a program that will effectively respond to multiple requests to find the shortest path in a 2<=×<=*n* maze.",
"input": "",
"output": "```python\nn, m = map(int, input().split())\ns1 = input()\ns1 = 'X' + s1\ns2 = input()\ns2 = 'X' + s2\nblocks = []\ngroups = [0 for i in range(n)]\nres = [0 for i in range(2 * n)]\ngroup = 0\nfor i in range(n + 1):\n el1 = s1[i]\n el2 = s2[i]\n if el1 == el2 == 'X':\n blocks.append(3)\n elif el1 == 'X':\n blocks.append(1)\n elif el2 == 'X':\n blocks.append(2)\n else:\n blocks.append(0)\nfor i in range(1, n + 1):\n if blocks[i] == 3:\n continue\n if blocks[i - 1] == 3 or blocks[i - 1] + blocks[i] == 3:\n group += 1\n groups[i - 1] = group\n if s1[i] != 'X':\n res[i - 1] = 0\n if s2[i] != 'X':\n res[n + i - 1] = 1\n continue\n groups[i - 1] = group\n if blocks[i - 1] == 2:\n if blocks[i] == 0:\n res[i - 1] = res[i - 2] + 1\n res[n + i - 1] = res[i - 1] + 1\n else:\n res[i - 1] = res[i - 2] + 1\n elif blocks[i - 1] == 1:\n if blocks[i] == 0:\n res[n + i - 1] = res[n + i - 2] + 1\n res[i - 1] = res[n + i - 1] + 1\n else:\n res[n + i - 1] = res[n + i - 2] + 1\n else:\n if blocks[i] == 1:\n res[n + i - 1] = res[n + i - 2] + 1\n elif blocks[i] == 2:\n res[i - 1] = res[i - 2] + 1\n else:\n res[n + i - 1] = res[n + i - 2] + 1\n res[i - 1] = res[i - 2] + 1\n\nfor i in range(m):\n a, b = map(int, input().split())\n a_ = a - 1\n if a_ >= n:\n a_ -= n\n b_ = b - 1\n if b_ >= n:\n b_ -= n\n if groups[a_] != groups[b_]:\n print(-1)\n else:\n print(abs(res[a - 1] - res[b - 1]))\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarpus likes studying at school a lot and he is always diligent about his homework. Polycarpus has never had any problems with natural sciences as his great-great-grandfather was the great physicist Seinstein. On the other hand though, Polycarpus has never had an easy time with history.\n\nEverybody knows that the World history encompasses exactly *n* events: the *i*-th event had continued from the year *a**i* to the year *b**i* inclusive (*a**i*<=<<=*b**i*). Polycarpus easily learned the dates when each of *n* events started and ended (Polycarpus inherited excellent memory from his great-great-granddad). But the teacher gave him a more complicated task: Polycaprus should know when all events began and ended and he should also find out for each event whether it includes another event. Polycarpus' teacher thinks that an event *j* includes an event *i* if *a**j*<=<<=*a**i* and *b**i*<=<<=*b**j*. Your task is simpler: find the number of events that are included in some other event.",
"input": "",
"output": "```python\n# Getting Problem-Data from Codeforces.\r\neventCount,pairs = int(input()),[]\r\nfor i in range(eventCount):\r\n newPair = tuple(map(int,input().split(' ')))\r\n pairs.append(newPair)\r\n# Sorting Pairs by first componenet.\r\nfrom operator import itemgetter\r\npairs.sort(key=itemgetter(0))\r\n# Method to detemine if event-a contains event-b.\r\ndef isIncluded(a,b):\r\n return a[0] b[1]-b[0]:\r\n return a\r\n else: return b\r\n# Algorithm.\r\nmaxPrev,count = pairs[0],0\r\nfor j in range(1,eventCount):\r\n if isIncluded(maxPrev,pairs[j]):\r\n count = count+1\r\n maxPrev = maxEvent(maxPrev,pairs[j])\r\n# Solution.\r\nprint(count)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their competitions in peaceful game of Credit Cards.\n\nRules of this game are simple: each player bring his favourite *n*-digit credit card. Then both players name the digits written on their cards one by one. If two digits are not equal, then the player, whose digit is smaller gets a flick (knock in the forehead usually made with a forefinger) from the other player. For example, if *n*<==<=3, Sherlock's card is 123 and Moriarty's card has number 321, first Sherlock names 1 and Moriarty names 3 so Sherlock gets a flick. Then they both digit 2 so no one gets a flick. Finally, Sherlock names 3, while Moriarty names 1 and gets a flick.\n\nOf course, Sherlock will play honestly naming digits one by one in the order they are given, while Moriary, as a true villain, plans to cheat. He is going to name his digits in some other order (however, he is not going to change the overall number of occurences of each digit). For example, in case above Moriarty could name 1, 2, 3 and get no flicks at all, or he can name 2, 3 and 1 to give Sherlock two flicks.\n\nYour goal is to find out the minimum possible number of flicks Moriarty will get (no one likes flicks) and the maximum possible number of flicks Sherlock can get from Moriarty. Note, that these two goals are different and the optimal result may be obtained by using different strategies.",
"input": "",
"output": "```python\nimport random\r\na = input()\r\n\r\na = int(a)\r\n\r\nt1 = input()\r\nt2 = input()\r\n\r\nmor = 0\r\ns = []\r\nn = []\r\nfor i in range(0,a):\r\n s.append(int(t1[i]))\r\n n.append(int(t2[i]))\r\n\r\nn.sort()\r\n\r\nt = 1\r\nfor i in range(0,a):\r\n t = t * (a - i)\r\n\r\nmor = a * 2\r\nsher = 0\r\nfor i in range (0,t * 2):\r\n random.shuffle(n)\r\n test1 = 0\r\n test2 = 0\r\n for i in range(0,a):\r\n if n[i] == s[i]:\r\n continue\r\n if n[i] < s[i]:\r\n test1 += 1\r\n if n[i] > s[i]:\r\n test2 += 1\r\n\r\n if test1 < mor:\r\n mor = test1\r\n if test2 > sher:\r\n sher = test2\r\n\r\n \r\n \r\n\r\nprint (mor)\r\nprint (sher)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sheldon, Leonard, Penny, Rajesh and Howard are in the queue for a \"Double Cola\" drink vending machine; there are no other people in the queue. The first one in the queue (Sheldon) buys a can, drinks it and doubles! The resulting two Sheldons go to the end of the queue. Then the next in the queue (Leonard) buys a can, drinks it and gets to the end of the queue as two Leonards, and so on. This process continues ad infinitum.\n\nFor example, Penny drinks the third can of cola and the queue will look like this: Rajesh, Howard, Sheldon, Sheldon, Leonard, Leonard, Penny, Penny.\n\nWrite a program that will print the name of a man who will drink the *n*-th can.\n\nNote that in the very beginning the queue looks like that: Sheldon, Leonard, Penny, Rajesh, Howard. The first person is Sheldon.",
"input": "",
"output": "```python\nimport math\r\nk = {'s':'Sheldon' , 'l' : 'Leonard' , 'p' :'Penny' , 'r' : \"Rajesh\" , 'h' :'Howard'}\r\nh = \"\"\r\nst = \"slprh\"\r\ng = int(input())\r\nh = int(math.log(g/5 + 1 , 2))\r\nsu = 5*(2**h - 1)\r\ndiff = g - su\r\np = 2**h\r\nind = math.ceil(diff/p)\r\nprint( k[st[ind-1]])\r\n\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* boys and *m* girls studying in the class. They should stand in a line so that boys and girls alternated there as much as possible. Let's assume that positions in the line are indexed from left to right by numbers from 1 to *n*<=+<=*m*. Then the number of integers *i* (1<=≤<=*i*<=<<=*n*<=+<=*m*) such that positions with indexes *i* and *i*<=+<=1 contain children of different genders (position *i* has a girl and position *i*<=+<=1 has a boy or vice versa) must be as large as possible. \n\nHelp the children and tell them how to form the line.",
"input": "",
"output": "```python\nnm=input().split()\r\nn=int(nm[0])\r\nm=int(nm[1])\r\noutput=[]\r\nif n>=m:\r\n i=0\r\n while(in:\r\n i=0\r\n while(i int\n# returns minimum no. of rotations of the wheel (either c.w. or a.c.w starting from a) needed to print the given string\n\n# stub\n# def countSteps(string):\n# return 0\n\n# unit tests\n# def test():\n# assert countSteps(\"zeus\") == 18\n# assert countSteps(\"map\") == 35\n# assert countSteps(\"ares\") == 34\n\n# solution\ndef countSteps(string):\n wheel = [\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\"]\n currentIndex = 0\n steps = 0\n for letter in string:\n newIndex = wheel.index(letter)\n dist = abs(currentIndex - newIndex)\n if dist < 13:\n steps += dist\n else:\n steps += 26 - dist\n currentIndex = newIndex\n return steps\n# main\nif __name__ == \"__main__\":\n # test()\n string = input()\n print(countSteps(string))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a straight snowy road, divided into *n* blocks. The blocks are numbered from 1 to *n* from left to right. If one moves from the *i*-th block to the (*i*<=+<=1)-th block, he will leave a right footprint on the *i*-th block. Similarly, if one moves from the *i*-th block to the (*i*<=-<=1)-th block, he will leave a left footprint on the *i*-th block. If there already is a footprint on the *i*-th block, the new footprint will cover the old one.\n\nAt the beginning, there were no footprints. Then polar bear Alice starts from the *s*-th block, makes a sequence of moves and ends in the *t*-th block. It is known that Alice never moves outside of the road. \n\nYou are given the description of Alice's footprints. Your task is to find a pair of possible values of *s*,<=*t* by looking at the footprints.",
"input": "",
"output": "```python\nn = int(input())\r\nfootprints = list(input())\r\nstart = 0\r\nending = 0\r\nif 'R' in footprints:\r\n for i in range(n):\r\n if footprints[i] == 'R' and footprints[i - 1] == '.':\r\n start = i + 1\r\n if footprints[i] == 'R' and footprints[i + 1] == '.':\r\n ending = i + 2\r\n elif footprints[i] == 'R' and footprints[i + 1] == 'L':\r\n ending = i + 1\r\nelse:\r\n for i in range(n):\r\n if footprints[i] == 'L' and footprints[i - 1] == '.':\r\n ending = i\r\n if footprints[i] == 'L' and footprints[i + 1] == '.':\r\n start = i + 1\r\nprint(start, ending)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There were *n* groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in the same team.\n\nThe coach decided to form teams of exactly three people for this training. Determine the maximum number of teams of three people he can form. It is possible that he can't use all groups to form teams. For groups of two, either both students should write the contest, or both should not. If two students from a group of two will write the contest, they should be in the same team.",
"input": "",
"output": "```python\nn=int(input())\r\nl=list(map(int,input().split()))\r\nones=l.count(1)\r\ntwos=l.count(2)\r\nif ones==0:\r\n print(0)\r\nelse:\r\n res=0\r\n if ones>=twos:\r\n res=twos\r\n ones-=twos\r\n res+=(ones//3)\r\n else:\r\n res+=ones\r\n print(res)\r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Nicholas, a painter is going to paint several new canvases. Nicholas is sure that the canvases will turn out so great that each one will need framing and being hung on the wall. Frames are what Nicholas decided to begin with. \n\nNicholas has *n* sticks whose lengths equal *a*1,<=*a*2,<=... *a**n*. Nicholas does not want to break the sticks or glue them together. To make a *h*<=×<=*w*-sized frame, he needs two sticks whose lengths equal *h* and two sticks whose lengths equal *w*. Specifically, to make a square frame (when *h*<==<=*w*), he needs four sticks of the same length.\n\nNow Nicholas wants to make from the sticks that he has as many frames as possible; to be able to paint as many canvases as possible to fill the frames. Help him in this uneasy task. Note that it is not necessary to use all the sticks Nicholas has.",
"input": "",
"output": "```python\nn = int(input())\r\nA = list(map(int, input().split()))\r\nfrom collections import Counter\r\nC = Counter(A)\r\ncnt = 0\r\nfor k, v in C.items():\r\n cnt += v//2\r\nprint(cnt//2)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bear Limak examines a social network. Its main functionality is that two members can become friends (then they can talk with each other and share funny pictures).\n\nThere are *n* members, numbered 1 through *n*. *m* pairs of members are friends. Of course, a member can't be a friend with themselves.\n\nLet A-B denote that members A and B are friends. Limak thinks that a network is reasonable if and only if the following condition is satisfied: For every three distinct members (X, Y, Z), if X-Y and Y-Z then also X-Z.\n\nFor example: if Alan and Bob are friends, and Bob and Ciri are friends, then Alan and Ciri should be friends as well.\n\nCan you help Limak and check if the network is reasonable? Print \"YES\" or \"NO\" accordingly, without the quotes.",
"input": "",
"output": "```python\nfrom collections import defaultdict\n\nn, m = map(int, input().split())\n\namigos = defaultdict(set)\n\nfor _ in range(m):\n c, d = map(int, input().split())\n amigos[c].add(d)\n amigos[d].add(c)\n\nis_reasonable = all(amigos[i].intersection(amigos[j]) for i in amigos for j in amigos[i] if i != j)\n\nprint(\"YES\" if is_reasonable else \"NO\")\n \t \t \t \t \t \t \t \t \t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* stones on the table in a row, each of them can be red, green or blue. Count the minimum number of stones to take from the table so that any two neighboring stones had different colors. Stones in a row are considered neighboring if there are no other stones between them.",
"input": "",
"output": "```python\nn=Int(input())\r\nr=input()\r\nc=0\r\nfor i in range(0,n-1):\r\n if r[i]==r[i+1]:\r\n c+=1\r\nprint(c) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Today Sonya learned about long integers and invited all her friends to share the fun. Sonya has an initially empty multiset with integers. Friends give her *t* queries, each of one of the following type:\n 1. <=+<= *a**i* — add non-negative integer *a**i* to the multiset. Note, that she has a multiset, thus there may be many occurrences of the same integer. 1. <=-<= *a**i* — delete a single occurrence of non-negative integer *a**i* from the multiset. It's guaranteed, that there is at least one *a**i* in the multiset. 1. ? *s* — count the number of integers in the multiset (with repetitions) that match some pattern *s* consisting of 0 and 1. In the pattern, 0 stands for the even digits, while 1 stands for the odd. Integer *x* matches the pattern *s*, if the parity of the *i*-th from the right digit in decimal notation matches the *i*-th from the right digit of the pattern. If the pattern is shorter than this integer, it's supplemented with 0-s from the left. Similarly, if the integer is shorter than the pattern its decimal notation is supplemented with the 0-s from the left. \nFor example, if the pattern is *s*<==<=010, than integers 92, 2212, 50 and 414 match the pattern, while integers 3, 110, 25 and 1030 do not.",
"input": "",
"output": "```python\ncnt = [0]*262200\r\ntrans = str.maketrans('0123456789', '0101010101')\r\nt = int(input())\r\nfor _ in range(t):\r\n o, a = input().split()\r\n\r\n if o == '+':\r\n cnt[int(a.translate(trans), 2)] += 1\r\n elif o == '-':\r\n cnt[int(a.translate(trans), 2)] -= 1\r\n else:\r\n print(cnt[int(a, 2)])\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There were *n* groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in the same team.\n\nThe coach decided to form teams of exactly three people for this training. Determine the maximum number of teams of three people he can form. It is possible that he can't use all groups to form teams. For groups of two, either both students should write the contest, or both should not. If two students from a group of two will write the contest, they should be in the same team.",
"input": "",
"output": "```python\nn = int(input())\r\np = list(map(int, input().split()))\r\namount_of_ones = 0\r\namount_of_twos = 0\r\nfor i in range(n):\r\n if p[i] == 1:\r\n amount_of_ones += 1\r\n if p[i] == 2:\r\n amount_of_twos += 1 \r\n\r\nx = min(amount_of_twos, amount_of_ones)\r\n\r\nif amount_of_ones/3 > amount_of_twos:\r\n print (amount_of_ones - (amount_of_ones%3) // 3)\r\nelse:\r\n print (x)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "High school student Vasya got a string of length *n* as a birthday present. This string consists of letters 'a' and 'b' only. Vasya denotes beauty of the string as the maximum length of a substring (consecutive subsequence) consisting of equal letters.\n\nVasya can change no more than *k* characters of the original string. What is the maximum beauty of the string he can achieve?",
"input": "",
"output": "```python\nn,k=map(int,input().split())\r\ns=input()\r\ni,j=0,0 \r\nrm=k\r\nans=0\r\nwhile i0 or s[j]=='a'):\r\n if s[j]=='b': rm-=1\r\n j+=1\r\n ans=max(ans,j-i)\r\n if j==n: break\r\n while s[i]=='a':\r\n i+=1\r\n i+=1\r\n rm+=1\r\ni,j=0,0 \r\nrm=k\r\nwhile i0 or s[j]=='b'):\r\n if s[j]=='a': rm-=1\r\n j+=1\r\n ans=max(ans,j-i)\r\n if j==n: break\r\n while s[i]=='b':\r\n i+=1\r\n i+=1\r\n rm+=1\r\nprint(ans)\r\n\r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Xenia the beginner mathematician is a third year student at elementary school. She is now learning the addition operation.\n\nThe teacher has written down the sum of multiple numbers. Pupils should calculate the sum. To make the calculation easier, the sum only contains numbers 1, 2 and 3. Still, that isn't enough for Xenia. She is only beginning to count, so she can calculate a sum only if the summands follow in non-decreasing order. For example, she can't calculate sum 1+3+2+1 but she can calculate sums 1+1+2 and 3+3.\n\nYou've got the sum that was written on the board. Rearrange the summans and print the sum in such a way that Xenia can calculate the sum.",
"input": "",
"output": "```python\ns = list(map(int, input().split('+')))\r\ns.sort()\r\nprint(*s, sep='+')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "SmallR is an archer. SmallR is taking a match of archer with Zanoes. They try to shoot in the target in turns, and SmallR shoots first. The probability of shooting the target each time is for SmallR while for Zanoes. The one who shoots in the target first should be the winner.\n\nOutput the probability that SmallR will win the match.",
"input": "",
"output": "```python\nfrom sys import stdin,stdout\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\n\r\na, b, c, d = iia()\r\np = a / b\r\nq = (1 - c / d) * (1 - a / b)\r\nprint(p / (1 - q))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Dima and his friends have been playing hide and seek at Dima's place all night. As a result, Dima's place got messy. In the morning they decided that they need to clean the place.\n\nTo decide who exactly would clean the apartment, the friends want to play a counting-out game. First, all the guys stand in a circle, and then each of them shows some number of fingers on one hand (one to five), and then the boys count in a circle, starting from Dima, the number of people, respective to the total number of fingers shown. The person on who the countdown stops will clean the apartment.\n\nFor example, if Dima and one of his friends played hide and seek, and 7 fingers were shown during the counting-out, then Dima would clean the place. If there were 2 or say, 8 fingers shown, then his friend would clean the place.\n\nDima knows how many fingers each of his friends will show during the counting-out. Now he is interested in the number of ways to show some number of fingers on one hand (one to five), so that he did not have to clean the place. Help Dima.",
"input": "",
"output": "```python\na = int(input())\r\ns = list(map(int,input().split()))\r\ns1 = sum(s)\r\nc = 0\r\nfor i in range(1,5+1):\r\n if (s1+i)%(a+1)!=1:\r\n c+=1\r\nprint(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya loves football very much. One day, as he was watching a football match, he was writing the players' current positions on a piece of paper. To simplify the situation he depicted it as a string consisting of zeroes and ones. A zero corresponds to players of one team; a one corresponds to players of another team. If there are at least 7 players of some team standing one after another, then the situation is considered dangerous. For example, the situation 00100110111111101 is dangerous and 11110111011101 is not. You are given the current situation. Determine whether it is dangerous or not.",
"input": "",
"output": "```python\na= input()\nif \"0000000\" in a or \"1111111\" in a:\n print(\"yes\")\nelse:\n print(\"no\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.\n\nHe wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence corners at a single angle *a*.\n\nWill the robot be able to build the fence Emuskald wants? In other words, is there a regular polygon which angles are equal to *a*?",
"input": "",
"output": "```python\nfor _ in range(int(input())):\r\n a = int(input())\r\n print(\"YES\" if (360/(180-a)).is_integer() else \"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bran and his older sister Arya are from the same house. Bran like candies so much, so Arya is going to give him some Candies.\n\nAt first, Arya and Bran have 0 Candies. There are *n* days, at the *i*-th day, Arya finds *a**i* candies in a box, that is given by the Many-Faced God. Every day she can give Bran at most 8 of her candies. If she don't give him the candies at the same day, they are saved for her and she can give them to him later.\n\nYour task is to find the minimum number of days Arya needs to give Bran *k* candies before the end of the *n*-th day. Formally, you need to output the minimum day index to the end of which *k* candies will be given out (the days are indexed from 1 to *n*).\n\nPrint -1 if she can't give him *k* candies during *n* given days.",
"input": "",
"output": "```python\nimport math\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n#-----------------------------------\r\n\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\np=0\r\nfor i in range(n):\r\n if a[i]>8:\r\n k-=8\r\n p+=a[i]-8\r\n else:\r\n k-=a[i]\r\n if p!=0:\r\n k-=min(p,8-a[i])\r\n p-=min(p,8-a[i])\r\n if k<=0:\r\n print(i+1)\r\n break\r\nelse:\r\n print(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The developers of Looksery have to write an efficient algorithm that detects faces on a picture. Unfortunately, they are currently busy preparing a contest for you, so you will have to do it for them. \n\nIn this problem an image is a rectangular table that consists of lowercase Latin letters. A face on the image is a 2<=×<=2 square, such that from the four letters of this square you can make word \"face\". \n\nYou need to write a program that determines the number of faces on the image. The squares that correspond to the faces can overlap.",
"input": "",
"output": "```python\nn, m = map(int, input().split())\r\na = []\r\nans = 0\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(1, n):\r\n for j in range(1, m):\r\n c = [a[i][j], a[i - 1][j], a[i - 1][j - 1], a[i][j - 1]]\r\n if 'f' in c and 'a' in c and 'c' in c and 'e' in c:\r\n ans += 1\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vanya and his friends are walking along the fence of height *h* and they do not want the guard to notice them. In order to achieve this the height of each of the friends should not exceed *h*. If the height of some person is greater than *h* he can bend down and then he surely won't be noticed by the guard. The height of the *i*-th person is equal to *a**i*.\n\nConsider the width of the person walking as usual to be equal to 1, while the width of the bent person is equal to 2. Friends want to talk to each other while walking, so they would like to walk in a single row. What is the minimum width of the road, such that friends can walk in a row and remain unattended by the guard?",
"input": "",
"output": "```python\nfrom numpy import array\r\n\r\na = array([int] * 1000)\r\n\r\ndef solve():\r\n n = int(input())\r\n h = int(input())\r\n k = 0\r\n for i in range(n):\r\n a[i] = int(input())\r\n if a[i] <= h:\r\n k = k + 1\r\n else:\r\n k = k + 2\r\n print(k)\r\n\r\n'''def main():\r\n t = int(input())\r\n i = 0\r\n while i < t:\r\n solve()\r\n i = i + 1\r\n\r\nmain()\r\n'''\r\nsolve()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Small, but very brave, mouse Brain was not accepted to summer school of young villains. He was upset and decided to postpone his plans of taking over the world, but to become a photographer instead.\n\nAs you may know, the coolest photos are on the film (because you can specify the hashtag #film for such).\n\nBrain took a lot of colourful pictures on colored and black-and-white film. Then he developed and translated it into a digital form. But now, color and black-and-white photos are in one folder, and to sort them, one needs to spend more than one hour!\n\nAs soon as Brain is a photographer not programmer now, he asks you to help him determine for a single photo whether it is colored or black-and-white.\n\nPhoto can be represented as a matrix sized *n*<=×<=*m*, and each element of the matrix stores a symbol indicating corresponding pixel color. There are only 6 colors: \n - 'C' (cyan)- 'M' (magenta)- 'Y' (yellow)- 'W' (white)- 'G' (grey)- 'B' (black) \nThe photo is considered black-and-white if it has only white, black and grey pixels in it. If there are any of cyan, magenta or yellow pixels in the photo then it is considered colored.",
"input": "",
"output": "```python\nM_N,S_A = map(int, input().split())\r\nfor _R in range(M_N):\r\n if any(x in 'CMY' for x in input().split()) \r\n print('#Color')\r\n break\r\nelse: print('#Black&White')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\ns= input()\r\nk=0\r\nfor i in s:\r\n if i.upper()== i:\r\n k+=1\r\n\r\nif k> len(s)//2:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Max wants to buy a new skateboard. He has calculated the amount of money that is needed to buy a new skateboard. He left a calculator on the floor and went to ask some money from his parents. Meanwhile his little brother Yusuf came and started to press the keys randomly. Unfortunately Max has forgotten the number which he had calculated. The only thing he knows is that the number is divisible by 4.\n\nYou are given a string *s* consisting of digits (the number on the display of the calculator after Yusuf randomly pressed the keys). Your task is to find the number of substrings which are divisible by 4. A substring can start with a zero.\n\nA substring of a string is a nonempty sequence of consecutive characters.\n\nFor example if string *s* is 124 then we have four substrings that are divisible by 4: 12, 4, 24 and 124. For the string 04 the answer is three: 0, 4, 04.\n\nAs input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use gets/scanf/printf instead of getline/cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java.",
"input": "",
"output": "```python\n\n\n# A number is divisible by 4 when its last two digits are divisible by 4\ns= input()\nans = 0\n\n# First find sigle substring divisible by 4\nfor i in s:\n if int(i)%4 == 0:\n ans+=1\nn = len(s)\n\n# when two digits form a number divisible by 4 then increase the answer by the index of the right one\nfor i in range(0,n-1):\n print(s[i:i+2])\n if int(s[i:i+2])%4 == 0:\n ans+=i+1\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Julia is going to cook a chicken in the kitchen of her dormitory. To save energy, the stove in the kitchen automatically turns off after *k* minutes after turning on.\n\nDuring cooking, Julia goes to the kitchen every *d* minutes and turns on the stove if it is turned off. While the cooker is turned off, it stays warm. The stove switches on and off instantly.\n\nIt is known that the chicken needs *t* minutes to be cooked on the stove, if it is turned on, and 2*t* minutes, if it is turned off. You need to find out, how much time will Julia have to cook the chicken, if it is considered that the chicken is cooked evenly, with constant speed when the stove is turned on and at a constant speed when it is turned off.",
"input": "",
"output": "```python\n\"\"\"Problem C - Save Energy!.\n\nhttp://codeforces.com/contest/937/problem/C\n\nJulia is going to cook a chicken in the kitchen of her dormitory. To save\nenergy, the stove in the kitchen automatically turns off after k minutes after\nturning on.\n\nDuring cooking, Julia goes to the kitchen every d minutes and turns on the\nstove if it is turned off. While the cooker is turned off, it stays warm. The\nstove switches on and off instantly.\n\nIt is known that the chicken needs t minutes to be cooked on the stove, if it\nis turned on, and 2t minutes, if it is turned off. You need to find out, how\nmuch time will Julia have to cook the chicken, if it is considered that the\nchicken is cooked evenly, with constant speed when the stove is turned on and\nat a constant speed when it is turned off.\n\nInput:\n\nThe single line contains three integers k, d and t (1 ≤ k, d, t ≤ 1018).\n\nOutput:\n\nPrint a single number, the total time of cooking in minutes. The relative or\nabsolute error must not exceed 10 - 9.\n\nNamely, let's assume that your answer is x and the answer of the jury is y.\nThe checker program will consider your answer correct if .\n\n\"\"\"\nimport logging\nimport math\n\n\nfmt = '%(levelname)s - %(name)s (line:%(lineno)s) - %(message)s'\nformatter = logging.Formatter(fmt)\n\nch = logging.StreamHandler()\nch.setLevel(logging.DEBUG)\nch.setFormatter(formatter)\n\nlogger = logging.getLogger('sae')\nlogger.setLevel(logging.DEBUG)\nlogger.addHandler(ch)\n\n\ndef solve(k, d, t):\n if k % 2 == 0:\n r = 0\n elif k > d:\n r = d - k % d\n elif k < d:\n r = d % k\n\n n = t / (k + 0.5 * r)\n cooked = math.floor(n) * (k + 0.5 * r)\n diff = t - cooked\n time = math.floor(n) * (k + r)\n if diff > 0:\n time += diff\n return time\n\n\ndef main():\n k, d, t = [int(x) for x in input().strip().split()]\n result = solve(k, d, t)\n print(result)\n\n\nif __name__ == '__main__':\n main()\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "ZS the Coder loves to read the dictionary. He thinks that a word is nice if there exists a substring (contiguous segment of letters) of it of length 26 where each letter of English alphabet appears exactly once. In particular, if the string has length strictly less than 26, no such substring exists and thus it is not nice.\n\nNow, ZS the Coder tells you a word, where some of its letters are missing as he forgot them. He wants to determine if it is possible to fill in the missing letters so that the resulting word is nice. If it is possible, he needs you to find an example of such a word as well. Can you help him?",
"input": "",
"output": "```python\ns = input()\r\nn = len(s)\r\n\r\nif n < 26:\r\n print(-1)\r\n exit()\r\n\r\ncharacters = set(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")\r\nsubstring = []\r\n\r\nfor i in range(n):\r\n while len(substring) == 26 or (s[i] in substring and s[i] != \"?\"):\r\n substring.pop(0)\r\n substring.append(s[i])\r\n if len(substring) == 26:\r\n unique_chars = set(substring) - {\"?\"}\r\n missing_chars = characters - unique_chars\r\n\r\n if len(missing_chars) == 26 - len(unique_chars):\r\n new = [char if char != \"?\" else missing_chars.pop() for char in substring]\r\n replaced_s = s.replace(\"?\", \"A\")\r\n print(replaced_s[: i - 25] + \"\".join(new) + replaced_s[i + 1 :])\r\n exit()\r\nprint(-1)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arriving, they found that citizens are worried about maximum values of the Main Uzhlyandian Function *f*, which is defined as follows:\n\nIn the above formula, 1<=≤<=*l*<=<<=*r*<=≤<=*n* must hold, where *n* is the size of the Main Uzhlyandian Array *a*, and |*x*| means absolute value of *x*. But the heroes skipped their math lessons in school, so they asked you for help. Help them calculate the maximum value of *f* among all possible values of *l* and *r* for the given array *a*.",
"input": "",
"output": "```python\nn = int(input())\r\nA =list(map(int, input().split()))\r\nB = []\r\nfor i in range(n-1):\r\n B.append(abs(A[i]-A[i+1]))\r\ndpmin = [0] * n\r\ndpmax = [0] * n\r\nfor i in range(n-2,-1,-1):\r\n dpmax[i] = B[i]\r\n dpmin[i] = B[i]\r\n dpmin[i] = min(dpmin[i], B[i] - dpmax[i+1])\r\n dpmax[i] = max(dpmax[i], B[i] - dpmin[i+1])\r\nprint(dpmax[0])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\nm,n=map(int,input().split())\r\narea=m*n\r\nif area<2:\r\n print(0)\r\nelse:\r\n print(area//2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ted has a pineapple. This pineapple is able to bark like a bulldog! At time *t* (in seconds) it barks for the first time. Then every *s* seconds after it, it barks twice with 1 second interval. Thus it barks at times *t*, *t*<=+<=*s*, *t*<=+<=*s*<=+<=1, *t*<=+<=2*s*, *t*<=+<=2*s*<=+<=1, etc.\n\nBarney woke up in the morning and wants to eat the pineapple, but he can't eat it when it's barking. Barney plans to eat it at time *x* (in seconds), so he asked you to tell him if it's gonna bark at that time.",
"input": "",
"output": "```python\na,b,c=map(int,input().split())\r\nd=c//b\r\nif a==c or (d>0 and (c%b==a or c%b==a+1)) :print(\"YES\")\r\nelse:print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sereja showed an interesting game to his friends. The game goes like that. Initially, there is a table with an empty cup and *n* water mugs on it. Then all players take turns to move. During a move, a player takes a non-empty mug of water and pours all water from it into the cup. If the cup overfills, then we assume that this player lost.\n\nAs soon as Sereja's friends heard of the game, they wanted to play it. Sereja, on the other hand, wanted to find out whether his friends can play the game in such a way that there are no losers. You are given the volumes of all mugs and the cup. Also, you know that Sereja has (*n*<=-<=1) friends. Determine if Sereja's friends can play the game so that nobody loses.",
"input": "",
"output": "```python\nn, s = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.remove(max(a))\r\nans = sum(a) > s\r\nprint(\"NO\" if ans else \"YES\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ann has recently started commuting by subway. We know that a one ride subway ticket costs *a* rubles. Besides, Ann found out that she can buy a special ticket for *m* rides (she can buy it several times). It costs *b* rubles. Ann did the math; she will need to use subway *n* times. Help Ann, tell her what is the minimum sum of money she will have to spend to make *n* rides?",
"input": "",
"output": "```python\nl=list(map(int,input().split()))\r\nn=l[0]\r\nm=l[1]\r\na=l[2]\r\nb=l[3]\r\ntotal_cost=0\r\nwhile(n>0):\r\n if(n-m>=0):\r\n current_cost=min(m*a,b)\r\n total_cost+=current_cost\r\n n=n-m\r\n elif(n-1>=0):\r\n current_cost=a;\r\n total_cost+=current_cost\r\n n=n-1\r\nprint(total_cost)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You've decided to carry out a survey in the theory of prime numbers. Let us remind you that a prime number is a positive integer that has exactly two distinct positive integer divisors.\n\nConsider positive integers *a*, *a*<=+<=1, ..., *b* (*a*<=≤<=*b*). You want to find the minimum integer *l* (1<=≤<=*l*<=≤<=*b*<=-<=*a*<=+<=1) such that for any integer *x* (*a*<=≤<=*x*<=≤<=*b*<=-<=*l*<=+<=1) among *l* integers *x*, *x*<=+<=1, ..., *x*<=+<=*l*<=-<=1 there are at least *k* prime numbers. \n\nFind and print the required minimum *l*. If no value *l* meets the described limitations, print -1.",
"input": "",
"output": "```python\n# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 6 23:37:57 2021\r\n\r\n@author: LENOVO\r\n\"\"\"\r\n\r\n#método que crea un array (prim) desde 0 hasta b, dónde prim[i]=1 solo si i es un número primo\r\ndef PrimeGen(b): \r\n prim=[1]*(b+1)\r\n prim[0]=prim[1]=0\r\n for i in range(2,b+1,1):\r\n for j in range(i*i,b+1,i):\r\n prim[j]=0\r\n return prim\r\n \r\ns = input() #s = \"a b k\"\r\nl=a=b=k=y=x=0 #a,b,k,l representan lo mismo que en el enunciado del problema,\r\n #x es el indice de s donde comienza el valor a asignar,\r\n #y representa cuál de los 3 valores estamos asignando\r\nfor i in range(len(s)):\r\n if s[i]==' ':\r\n y+=1\r\n if y==1:\r\n a=int(s[x:i])\r\n elif y==2:\r\n b=int(s[x:i])\r\n x=i+1\r\n elif i==(len(s)-1):\r\n k=int(s[x:])\r\n\r\n\r\nprim = PrimeGen(b)\r\nnop=[0]*(b+1) #number_of_primes.\r\nfor i in range(a,b+1):\r\n nop[i]= nop[i-1]+prim[i]; #nop[i] representa cuántos números primos hay desde a hasta i\r\n \r\nif nop[b] < k: # si desde a hasta b no hay k numeros primos, devolvemos -1\r\n print(-1)\r\nelse: #buscamos l tal que cumpla con las condiciones establecidas en el problema\r\n l=1\r\n for x in range(a-1,b-l+1): \r\n while (l>=1 and l<=b-a+1 and x+l<=b and (nop[x+l]-nop[x]) p):\r\n e = printDivisors(j)\r\n f = 0\r\n for i in e:\r\n if i <= p:\r\n f = 1\r\n break\r\n\r\n if f == 0:\r\n m = j\r\n break\r\n\r\n j = j-1\r\n\r\nprint(m)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "For a given positive integer *n* denote its *k*-rounding as the minimum positive integer *x*, such that *x* ends with *k* or more zeros in base 10 and is divisible by *n*.\n\nFor example, 4-rounding of 375 is 375·80<==<=30000. 30000 is the minimum integer such that it ends with 4 or more zeros and is divisible by 375.\n\nWrite a program that will perform the *k*-rounding of *n*.",
"input": "",
"output": "```python\nn, k = input().split()\r\nk = int(k)\r\nn = int(n)\r\na = n\r\nb = 10**k\r\nif n%10 == 5 or n%10 == 0:\r\n\twhile a%2 == 0 and b%2 == 0:\r\n\t\ta = a//2\r\n\t\tb = b//2\r\n\twhile a%5 == 0 and b%5 == 0:\r\n\t\ta = a//5\r\n\t\tb = b//5\r\n\ta = n*b\r\nelse:\r\n\ta = a*(10**k)\r\nprint (a)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarpus just has been out of luck lately! As soon as he found a job in the \"Binary Cat\" cafe, the club got burgled. All ice-cream was stolen.\n\nOn the burglary night Polycarpus kept a careful record of all club visitors. Each time a visitor entered the club, Polycarpus put down character \"+\" in his notes. Similarly, each time a visitor left the club, Polycarpus put character \"-\" in his notes. We know that all cases of going in and out happened consecutively, that is, no two events happened at the same time. Polycarpus doesn't remember whether there was somebody in the club at the moment when his shift begun and at the moment when it ended.\n\nRight now the police wonders what minimum number of distinct people Polycarpus could have seen. Assume that he sees anybody coming in or out of the club. Each person could have come in or out an arbitrary number of times.",
"input": "",
"output": "```python\na = input()\r\nn = len(a)\r\n\r\nans = []\r\ncnt = 1\r\nm = 1 #for max\r\nans.append(1)\r\nfor i in range(1,n):\r\n if(a[i] == a[0]):\r\n cnt+=1\r\n else:\r\n cnt -=1\r\n ans.append(cnt)\r\n\r\n m = max(m,cnt)\r\n# print(ans)\r\nprint(m)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Many computer strategy games require building cities, recruiting army, conquering tribes, collecting resources. Sometimes it leads to interesting problems. \n\nLet's suppose that your task is to build a square city. The world map uses the Cartesian coordinates. The sides of the city should be parallel to coordinate axes. The map contains mines with valuable resources, located at some points with integer coordinates. The sizes of mines are relatively small, i.e. they can be treated as points. The city should be built in such a way that all the mines are inside or on the border of the city square. \n\nBuilding a city takes large amount of money depending on the size of the city, so you have to build the city with the minimum area. Given the positions of the mines find the minimum possible area of the city.",
"input": "",
"output": "```python\n#!/usr/bin/env python3\r\n\r\nnumber_of_mines = int(input())\r\nx_coords = []\r\ny_coords = []\r\nfor _ in range(number_of_mines):\r\n x, y = (int(value) for value in input().split())\r\n x_coords.append(x)\r\n y_coords.append(y)\r\nprint(max(abs(max(x_coords) - min(x_coords)), abs(max(y_coords) - min(y_coords))) ** 2)\r\n \r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Parmida is a clever girl and she wants to participate in Olympiads this year. Of course she wants her partner to be clever too (although he's not)! Parmida has prepared the following test problem for Pashmak.\n\nThere is a sequence *a* that consists of *n* integers *a*1,<=*a*2,<=...,<=*a**n*. Let's denote *f*(*l*,<=*r*,<=*x*) the number of indices *k* such that: *l*<=≤<=*k*<=≤<=*r* and *a**k*<==<=*x*. His task is to calculate the number of pairs of indicies *i*,<=*j* (1<=≤<=*i*<=<<=*j*<=≤<=*n*) such that *f*(1,<=*i*,<=*a**i*)<=><=*f*(*j*,<=*n*,<=*a**j*).\n\nHelp Pashmak with the test.",
"input": "",
"output": "```python\nimport sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\n\nclass Fenwick_tree:\n\n def __init__(self, numbers):\n self.length = numbers\n self.numbers = [0] * numbers\n self.bits = [0] * (self.length + 1)\n self.build_tree()\n\n def update(self, idx, value):\n idx += 1\n while idx <= self.length:\n self.bits[idx]+=value\n idx = idx + (idx&-idx)\n\n def sum_range(self,idx):\n result = 0\n idx += 1\n while idx > 0:\n result += self.bits[idx]\n idx = idx - (idx & -idx)\n return result\n\n def build_tree(self):\n for index in range(self.length):\n self.update(index, self.numbers[index])\n\n\nN = int(input())\nA = list(map(int,input().split()))\nfen_tree = Fenwick_tree(10**6+1)\nans = 0\n\ndic = defaultdict(int)\nl,r = [],[]\nfor i in range(N-1,-1,-1):\n r.append(dic[A[i]])\n dic[A[i]]+=1\nr = r[::-1]\ndic = defaultdict(int)\nfor i in range(N):\n l.append(dic[A[i]])\n dic[A[i]]+=1\n\ncnt = defaultdict(int)\n\n# print(l)\n# print(r)\nfen_tree.update(r[-1],1)\ncnt[r[-1]]+=1\nfor i in range(N-2,-1,-1):\n ans+=fen_tree.sum_range(l[i])-cnt[l[i]]\n fen_tree.update(r[i],1)\n cnt[r[i]]+=1\n\nprint(ans)\n\n\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once Bob needed to find the second order statistics of a sequence of integer numbers. Lets choose each number from the sequence exactly once and sort them. The value on the second position is the second order statistics of the given sequence. In other words it is the smallest element strictly greater than the minimum. Help Bob solve this problem.",
"input": "",
"output": "```python\nAmountOfNum = int(input())\nArray = list(map(int,input().split()))[:AmountOfNum]\nNew = set(Array)\nNew1 = sorted(New)\nif(len(New1)>1):\n print(New1[1])\nelse:\n print(\"NO\")\n\t\t\t\t\t \t\t \t\t\t \t\t \t\t \t \t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has a non-negative integer *n*. He wants to round it to nearest integer, which ends up with 0. If *n* already ends up with 0, Vasya considers it already rounded.\n\nFor example, if *n*<==<=4722 answer is 4720. If *n*<==<=5 Vasya can round it to 0 or to 10. Both ways are correct.\n\nFor given *n* find out to which integer will Vasya round it.",
"input": "",
"output": "```python\nn=int(input())\r\nif n%10<5:\r\n print (n//10*10)\r\nelif n%10==5:\r\n print (n//10*10 or n//10*10+10)\r\nelse:\r\n print (n//10*10+10)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A has a string consisting of some number of lowercase English letters 'a'. He gives it to his friend B who appends some number of letters 'b' to the end of this string. Since both A and B like the characters 'a' and 'b', they have made sure that at this point, at least one 'a' and one 'b' exist in the string.\n\nB now gives this string to C and he appends some number of letters 'c' to the end of the string. However, since C is a good friend of A and B, the number of letters 'c' he appends is equal to the number of 'a' or to the number of 'b' in the string. It is also possible that the number of letters 'c' equals both to the number of letters 'a' and to the number of letters 'b' at the same time.\n\nYou have a string in your hands, and you want to check if it is possible to obtain the string in this way or not. If it is possible to obtain the string, print \"YES\", otherwise print \"NO\" (without the quotes).",
"input": "",
"output": "```python\nstr = input()\r\nnumA = 0\r\nnumB = 0\r\nnumC = 0\r\ncheck = True\r\nfor x in str:\r\n if(x == 'a'):\r\n numA+=1 \r\n elif(x == 'b'):\r\n numB+=1 \r\n elif(x == 'c'):\r\n numC+=1\r\n \r\n if((x == 'a'and (numB != 0 or numC != 0)) or (x == 'b'and numC != 0 )):\r\n check = False\r\n break\r\n \r\nif (numA == numC or numB == numC) and check:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once Bob got to a sale of old TV sets. There were *n* TV sets at that sale. TV set with index *i* costs *a**i* bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV sets he wants. Though he's very strong, Bob can carry at most *m* TV sets, and he has no desire to go to the sale for the second time. Please, help Bob find out the maximum sum of money that he can earn.",
"input": "",
"output": "```python\ndef helper(n,m,a):\r\n a=sorted(a)\r\n \r\n ans=sum(a[:m])\r\n print(-ans)\r\n \r\nn,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nhelper(n,m,a)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Capitalization is writing a word with its first letter as a capital letter. Your task is to capitalize the given word.\n\nNote, that during capitalization all the letters except the first one remains unchanged.",
"input": "",
"output": "```python\nt = input()\r\nprint(t[0].capitalize()+t[1:])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The preferred way to generate user login in Polygon is to concatenate a prefix of the user's first name and a prefix of their last name, in that order. Each prefix must be non-empty, and any of the prefixes can be the full name. Typically there are multiple possible logins for each person.\n\nYou are given the first and the last name of a user. Return the alphabetically earliest login they can get (regardless of other potential Polygon users).\n\nAs a reminder, a prefix of a string *s* is its substring which occurs at the beginning of *s*: \"a\", \"ab\", \"abc\" etc. are prefixes of string \"{abcdef}\" but \"b\" and 'bc\" are not. A string *a* is alphabetically earlier than a string *b*, if *a* is a prefix of *b*, or *a* and *b* coincide up to some position, and then *a* has a letter that is alphabetically earlier than the corresponding letter in *b*: \"a\" and \"ab\" are alphabetically earlier than \"ac\" but \"b\" and \"ba\" are alphabetically later than \"ac\".",
"input": "",
"output": "```python\nfirst_name, last_name = input().split()\r\nfirst_done = first_name.lower()\r\nlast_done = last_name.lower()\r\nlogin = first_name[0]\r\nfor i in range(1, len(first_name) - 1):\r\n if ord(first_done[i]) < ord(last_done[0]):\r\n login += first_name[i]\r\n else:\r\n break\r\nlogin += last_name[0]\r\nprint(login)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya works as a DJ in the best Berland nightclub, and he often uses dubstep music in his performance. Recently, he has decided to take a couple of old songs and make dubstep remixes from them.\n\nLet's assume that a song consists of some number of words. To make the dubstep remix of this song, Vasya inserts a certain number of words \"WUB\" before the first word of the song (the number may be zero), after the last word (the number may be zero), and between words (at least one between any pair of neighbouring words), and then the boy glues together all the words, including \"WUB\", in one string and plays the song at the club.\n\nFor example, a song with words \"I AM X\" can transform into a dubstep remix as \"WUBWUBIWUBAMWUBWUBX\" and cannot transform into \"WUBWUBIAMWUBX\".\n\nRecently, Petya has heard Vasya's new dubstep track, but since he isn't into modern music, he decided to find out what was the initial song that Vasya remixed. Help Petya restore the original song.",
"input": "",
"output": "```python\ns=input()\na=s.split(\"WUB\")\nprint(a)\nr=\"\"\nfor i in range(len(a)):\n if a[i]!=\"\":\n if i==len(s)-1:\n r=r+a[i]\n else:\n r=r+a[i]+\" \"\nprint(r)\n \t \t \t\t \t \t \t\t \t\t\t\t\t\t\t\t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "It is the middle of 2018 and Maria Stepanovna, who lives outside Krasnokamensk (a town in Zabaikalsky region), wants to rent three displays to highlight an important problem.\n\nThere are $n$ displays placed along a road, and the $i$-th of them can display a text with font size $s_i$ only. Maria Stepanovna wants to rent such three displays with indices $i < j < k$ that the font size increases if you move along the road in a particular direction. Namely, the condition $s_i < s_j < s_k$ should be held.\n\nThe rent cost is for the $i$-th display is $c_i$. Please determine the smallest cost Maria Stepanovna should pay.",
"input": "",
"output": "```python\nimport sys\r\ninf = float('inf')\r\ninput = lambda: sys.stdin.readline().strip()\r\nI = lambda: input()\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLI = lambda: list(input().split())\r\nLII = lambda: list(map(int, input().split()))\r\nGMI = lambda: map(lambda x: int(x) - 1, input().split())\r\nLGMI = lambda: list(map(lambda x: int(x) - 1, input().split()))\r\nMOD = 10**9+7\r\n\r\nclass BIT:\r\n def __init__(self, n):\r\n self.n = n\r\n self.tree = [inf]*n\r\n\r\n def update(self, i, v):\r\n while i < self.n:\r\n self.tree[i] = min(self.tree[i], v)\r\n i += i & -i\r\n\r\n def query(self, i):\r\n res = inf\r\n while i:\r\n res = min(res, self.tree[i])\r\n i -= i & -i\r\n return res\r\n\r\ndef solve2():\r\n n = II()\r\n a, b = LII(), LII()\r\n ids = sorted(range(n), key=lambda i: (a[i], -i))\r\n # f[i][j]: 前i个数中长为j+1的递增子序列的b之和的最小值，从f[i][j-1]转移\r\n # 第二个维度优化掉，初始相当于f[i][0], 第一个循环后得到f[i][1]……\r\n f = b[:]\r\n for _ in range(2):\r\n g = [inf] * n\r\n t = BIT(n+1)\r\n for i in ids:\r\n g[i] = t.query(i)+b[i]\r\n t.update(i+1, f[i])\r\n f = g\r\n res = min(f)\r\n print(res if res < inf else -1)\r\n\r\ndef solve1():\r\n n = II()\r\n a = LII()\r\n b = LII()\r\n\r\n res = inf\r\n for j in range(n):\r\n left = inf\r\n for i in range(j):\r\n if a[i] < a[j]:\r\n left = min(left, b[i])\r\n right = inf\r\n for k in range(j+1, n):\r\n if a[k] > a[j]:\r\n right = min(right, b[k])\r\n res = min(res, b[j]+left+right)\r\n print(res if res < inf else -1)\r\n return\r\n\r\nsolve2()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer.\n\nAt the start of the day they have *x* ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and Gerda's house even in the night. Each person in the queue wants either to take several ice cream packs for himself and his friends or to give several ice cream packs to Kay and Gerda (carriers that bring ice cream have to stand in the same queue).\n\nIf a carrier with *d* ice cream packs comes to the house, then Kay and Gerda take all his packs. If a child who wants to take *d* ice cream packs comes to the house, then Kay and Gerda will give him *d* packs if they have enough ice cream, otherwise the child will get no ice cream at all and will leave in distress.\n\nKay wants to find the amount of ice cream they will have after all people will leave from the queue, and Gerda wants to find the number of distressed kids.",
"input": "",
"output": "```python\nn, x = [int(i) for i in input().split()]\r\ncount = 0\r\nfor i in range(n):\r\n a, d = list(input().split())\r\n if a == \"+\":\r\n x += int(d)\r\n else:\r\n if int(d) > x:\r\n count += 1\r\n else:\r\n x -= int(d)\r\n\r\nprint(x, count)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "\"This problem is rubbish! There is not statement, and there are only 5 test cases. The problemsetter took liberties with this problem!\" — people complained in the comments to one round on Codeforces. And even more... No, wait, the checker for the problem was alright, that's a mercy.",
"input": "",
"output": "```python\nn = int(input())\nprint(1)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Capitalization is writing a word with its first letter as a capital letter. Your task is to capitalize the given word.\n\nNote, that during capitalization all the letters except the first one remains unchanged.",
"input": "",
"output": "```python\ns = input()\nprint(s[0].upper() + s [1:])\n \t\t \t \t \t \t \t \t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sean is trying to save a large file to a USB flash drive. He has *n* USB flash drives with capacities equal to *a*1,<=*a*2,<=...,<=*a**n* megabytes. The file size is equal to *m* megabytes. \n\nFind the minimum number of USB flash drives needed to write Sean's file, if he can split the file between drives.",
"input": "",
"output": "```python\nn=int(input())\r\nm=int(input())\r\nl=[]\r\nfor i in range(n):\r\n a=int(input())\r\n l.append(a)\r\nl.sort(reverse=True)\r\nc=0\r\nfor i in range(n):\r\n c+=l[i]\r\n if(c>=m):\r\n print(i+1)\r\n break\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Olga came to visit the twins Anna and Maria and saw that they have many cookies. The cookies are distributed into bags. As there are many cookies, Olga decided that it's no big deal if she steals a bag. However, she doesn't want the sisters to quarrel because of nothing when they divide the cookies. That's why Olga wants to steal a bag with cookies so that the number of cookies in the remaining bags was even, that is, so that Anna and Maria could evenly divide it into two (even 0 remaining cookies will do, just as any other even number). How many ways there are to steal exactly one cookie bag so that the total number of cookies in the remaining bags was even?",
"input": "",
"output": "```python\nn = int(input())\nbags = list(map(int, input().split()))\n##check if sum is even or odd\n##if even, find all even bags\n##if odd, find all odd bags\ns = sum(bags)\nif s%2==0:\n for i in bags:\n if i%2==0:\n print(i)\nelse:\n for i in bags:\n if i%2==1:\n print(i)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Oleg the client and Igor the analyst are good friends. However, sometimes they argue over little things. Recently, they started a new company, but they are having trouble finding a name for the company.\n\nTo settle this problem, they've decided to play a game. The company name will consist of *n* letters. Oleg and Igor each have a set of *n* letters (which might contain multiple copies of the same letter, the sets can be different). Initially, the company name is denoted by *n* question marks. Oleg and Igor takes turns to play the game, Oleg moves first. In each turn, a player can choose one of the letters *c* in his set and replace any of the question marks with *c*. Then, a copy of the letter *c* is removed from his set. The game ends when all the question marks has been replaced by some letter.\n\nFor example, suppose Oleg has the set of letters {*i*,<=*o*,<=*i*} and Igor has the set of letters {*i*,<=*m*,<=*o*}. One possible game is as follows :\n\nInitially, the company name is ???.\n\nOleg replaces the second question mark with 'i'. The company name becomes ?i?. The set of letters Oleg have now is {*i*,<=*o*}.\n\nIgor replaces the third question mark with 'o'. The company name becomes ?io. The set of letters Igor have now is {*i*,<=*m*}.\n\nFinally, Oleg replaces the first question mark with 'o'. The company name becomes oio. The set of letters Oleg have now is {*i*}.\n\nIn the end, the company name is oio.\n\nOleg wants the company name to be as lexicographically small as possible while Igor wants the company name to be as lexicographically large as possible. What will be the company name if Oleg and Igor always play optimally?\n\nA string *s*<==<=*s*1*s*2...*s**m* is called lexicographically smaller than a string *t*<==<=*t*1*t*2...*t**m* (where *s*<=≠<=*t*) if *s**i*<=<<=*t**i* where *i* is the smallest index such that *s**i*<=≠<=*t**i*. (so *s**j*<==<=*t**j* for all *j*<=<<=*i*)",
"input": "",
"output": "```python\ns1=list(input())\r\ns2=list(input())\r\ns1.sort()\r\ns2.sort()\r\nans=\"\"\r\nn=len(s1)\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n ans+=s1[0]\r\n del(s1[0])\r\n else:\r\n ans+=s2[-1]\r\n del(s2[-1])\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In a building where Polycarp lives there are equal number of flats on each floor. Unfortunately, Polycarp don't remember how many flats are on each floor, but he remembers that the flats are numbered from 1 from lower to upper floors. That is, the first several flats are on the first floor, the next several flats are on the second and so on. Polycarp don't remember the total number of flats in the building, so you can consider the building to be infinitely high (i.e. there are infinitely many floors). Note that the floors are numbered from 1.\n\nPolycarp remembers on which floors several flats are located. It is guaranteed that this information is not self-contradictory. It means that there exists a building with equal number of flats on each floor so that the flats from Polycarp's memory have the floors Polycarp remembers.\n\nGiven this information, is it possible to restore the exact floor for flat *n*?",
"input": "",
"output": "```python\nn, m = map(int, input().split())\r\nlist1 = []\r\nans = []\r\nfor i in range(m):\r\n list1.append(list(map(int, input().split())))\r\nfor i in range(1, 101):\r\n if len(ans) > 1:\r\n print(-1)\r\n break\r\n for j in range(len(list1)):\r\n if list1[j][0] // i + min(1, list1[j][0] % i)!= list1[j][1]:\r\n break\r\n else:\r\n ans.append(i)\r\nelse:\r\n if len(ans) == 1:\r\n if n % ans[-1] > 0:\r\n print(n // ans[-1] + 1)\r\n else:\r\n print(n // ans[-1])\r\n else:\r\n print(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little X used to play a card game called \"24 Game\", but recently he has found it too easy. So he invented a new game.\n\nInitially you have a sequence of *n* integers: 1,<=2,<=...,<=*n*. In a single step, you can pick two of them, let's denote them *a* and *b*, erase them from the sequence, and append to the sequence either *a*<=+<=*b*, or *a*<=-<=*b*, or *a*<=×<=*b*.\n\nAfter *n*<=-<=1 steps there is only one number left. Can you make this number equal to 24?",
"input": "",
"output": "```python\nA = int(input()); ans = \"\"\"YES\r\n1 * 2 = 2\r\n3 * 4 = 12\"\"\"\r\nif A >= 5:\r\n if A % 2:\r\n ans = \"\"\"YES\r\n2 + 1 = 3\r\n5 - 3 = 2\r\n3 * 2 = 6\r\n4 * 6 = 24\"\"\"\r\n for a in range(int(A/2 - 5/2)+1):\r\n ans += '\\n%d - %d = 1'%(2*a+5, 2*a+4)\r\n for a in range(int(A/2 - 5/2)+1):\r\n ans += \"\\n1 * 24 = 24\"\r\n else:\r\n for a in range(int(A/2 - 6/2)+1):\r\n ans += \"\\n%d - %d = 1\"%(2*a+6, 2*a+5)\r\n ans += \"\\n2 * 12 = 24\" \r\n for a in range(int(A/2 - 6/2)+1):\r\n ans += \"\\n1 * 24 = 24\" \r\nelif A <= 3:\r\n ans = 'NO'\r\nelse:\r\n ans += '\\n12 * 2 = 24'\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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.\n\nIn his pocket Polycarp has an unlimited number of \"10-burle coins\" and exactly one coin of *r* burles (1<=≤<=*r*<=≤<=9).\n\nWhat is the minimum number of shovels Polycarp has to buy so that he can pay for the purchase without any change? It is obvious that he can pay for 10 shovels without any change (by paying the requied amount of 10-burle coins and not using the coin of *r* burles). But perhaps he can buy fewer shovels and pay without any change. Note that Polycarp should buy at least one shovel.",
"input": "",
"output": "```python\nx=input().split(\" \")\r\ni=0; b=True\r\nwhile b:\r\n i+=1\r\n if (int(x[0])*i) % 10 == 0 or ((int(x[0])*i - int(x[1])) % 10) == 0 :\r\n b=False\r\nprint(i)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After the lessons *n* groups of schoolchildren went outside and decided to visit Polycarpus to celebrate his birthday. We know that the *i*-th group consists of *s**i* friends (1<=≤<=*s**i*<=≤<=4), and they want to go to Polycarpus together. They decided to get there by taxi. Each car can carry at most four passengers. What minimum number of cars will the children need if all members of each group should ride in the same taxi (but one taxi can take more than one group)?",
"input": "",
"output": "```python\ndef s(n):\r\n if n == 1 or n == 3:\r\n return 3\r\n elif n == 2:\r\n return 2\r\n elif n == 4:\r\n return 1\r\nx = int(input())\r\narr = [int(i) for i in input().split()]\r\narr.sort(key=s, reverse=True)\r\nc = 0\r\nt = 1\r\nfor i in arr:\r\n if c + i > 4:\r\n c = 0\r\n t += 1\r\n c += i\r\nprint(t)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vova is again playing some computer game, now an RPG. In the game Vova's character received a quest: to slay the fearsome monster called Modcrab.\n\nAfter two hours of playing the game Vova has tracked the monster and analyzed its tactics. The Modcrab has *h*2 health points and an attack power of *a*2. Knowing that, Vova has decided to buy a lot of strong healing potions and to prepare for battle.\n\nVova's character has *h*1 health points and an attack power of *a*1. Also he has a large supply of healing potions, each of which increases his current amount of health points by *c*1 when Vova drinks a potion. All potions are identical to each other. It is guaranteed that *c*1<=><=*a*2.\n\nThe battle consists of multiple phases. In the beginning of each phase, Vova can either attack the monster (thus reducing its health by *a*1) or drink a healing potion (it increases Vova's health by *c*1; Vova's health can exceed *h*1). Then, if the battle is not over yet, the Modcrab attacks Vova, reducing his health by *a*2. The battle ends when Vova's (or Modcrab's) health drops to 0 or lower. It is possible that the battle ends in a middle of a phase after Vova's attack.\n\nOf course, Vova wants to win the fight. But also he wants to do it as fast as possible. So he wants to make up a strategy that will allow him to win the fight after the minimum possible number of phases.\n\nHelp Vova to make up a strategy! You may assume that Vova never runs out of healing potions, and that he can always win.",
"input": "",
"output": "```python\nif __name__ == \"__main__\":\n h1,a1,c1 = map(int,input().split())\n h2,a2 = map(int,input().split())\n tmp = []\n while h2>0:\n if a2>=h1:\n tmp.append(\"HEAL\")\n h1 = h1+c1\n h1 = h1-a2\n else:\n tmp.append(\"STRIKE\")\n h2 = h2-a1\n h1 = h1-a2\n n=len(tmp)\n print(n)\n for i in tmp:\n print(i)\n \t \t \t\t \t \t\t \t\t\t \t\t\t\t\t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petr wants to make a calendar for current month. For this purpose he draws a table in which columns correspond to weeks (a week is seven consequent days from Monday to Sunday), rows correspond to weekdays, and cells contain dates. For example, a calendar for January 2017 should look like on the picture:\n\nPetr wants to know how many columns his table should have given the month and the weekday of the first date of that month? Assume that the year is non-leap.",
"input": "",
"output": "```python\nn,d=map(int,input().split())\r\no=0\r\nif n in [1,3,5,7,8,10,12]:\r\n if d==7 or d==6:\r\n o=6\r\n else:\r\n o=5\r\nif n in [4,6,9,11]:\r\n if d==7:\r\n o=6\r\n else:\r\n o=5\r\nif n==2:\r\n if d==7:\r\n o=5\r\n else:\r\n o=4\r\nprint(o)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* cities situated along the main road of Berland. Cities are represented by their coordinates — integer numbers *a*1,<=*a*2,<=...,<=*a**n*. All coordinates are pairwise distinct.\n\nIt is possible to get from one city to another only by bus. But all buses and roads are very old, so the Minister of Transport decided to build a new bus route. The Minister doesn't want to spend large amounts of money — he wants to choose two cities in such a way that the distance between them is minimal possible. The distance between two cities is equal to the absolute value of the difference between their coordinates.\n\nIt is possible that there are multiple pairs of cities with minimal possible distance, so the Minister wants to know the quantity of such pairs. \n\nYour task is to write a program that will calculate the minimal possible distance between two pairs of cities and the quantity of pairs which have this distance.",
"input": "",
"output": "```python\nimport sys\ninput=sys.stdin.readline\ndef main():\n\tn = int(input())\n\ta = list(map(int, input().split()))\n\ta.sort()\n\tm, nm = a[1]-a[0], 1\n\tfor i in range(1, n-1):\n\t\tif a[i+1]-a[i] < m:\n\t\t\tm, nm = a[i+1]-a[i], 1\n\t\telif a[i+1]-a[i]==m:\n\t\t\tnm +=1\n\tprint(m,nm)\nmain()\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little penguin Polo has an *n*<=×<=*m* matrix, consisting of integers. Let's index the matrix rows from 1 to *n* from top to bottom and let's index the columns from 1 to *m* from left to right. Let's represent the matrix element on the intersection of row *i* and column *j* as *a**ij*.\n\nIn one move the penguin can add or subtract number *d* from some matrix element. Find the minimum number of moves needed to make all matrix elements equal. If the described plan is impossible to carry out, say so.",
"input": "",
"output": "```python\ndef f(m, arr):\r\n\tans = 0\r\n\tfor x in range(len(arr)):\r\n\t\tans+=abs(m-arr[x])/d\r\n\treturn ans\r\n\r\nnmd = [int(x) for x in input().split()]\r\nn = nmd[0]\r\nm = nmd[1]\r\nd = nmd[2]\r\nstatus = True\r\narr = []\r\nfor x in range(m):\r\n\tarr+=[int(i) for i in input().split()]\r\nfor x in arr:\r\n\tif x%d != 0:\r\n\t\tstatus = False\r\n\t\tbreak\r\nif status == True:\r\n\tl = 0\r\n\tr = 1e4\r\n\twhile (r > l+2):\r\n\t\tm1 = l + (r-l)//3\r\n\t\tm2 = m1 + (r-l)//3\r\n\t\tif (f(m1,arr) > f(m2,arr)):\r\n\t\t\tl = m1\r\n\t\telse:\r\n\t\t\tr = m2\r\n\tprint(int(min(f(l,arr), f(l+1,arr), f(l+2,arr))))\r\nelse:\r\n\tprint(\"-1\")\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya studies in a school and he adores Maths. His class has been studying arithmetic expressions. On the last class the teacher wrote three positive integers *a*, *b*, *c* on the blackboard. The task was to insert signs of operations '+' and '*', and probably brackets between the numbers so that the value of the resulting expression is as large as possible. Let's consider an example: assume that the teacher wrote numbers 1, 2 and 3 on the blackboard. Here are some ways of placing signs and brackets:\n - 1+2*3=7 - 1*(2+3)=5 - 1*2*3=6 - (1+2)*3=9 \nNote that you can insert operation signs only between *a* and *b*, and between *b* and *c*, that is, you cannot swap integers. For instance, in the given sample you cannot get expression (1+3)*2.\n\nIt's easy to see that the maximum value that you can obtain is 9.\n\nYour task is: given *a*, *b* and *c* print the maximum value that you can get.",
"input": "",
"output": "```python\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nprint(max(a+c+b,a*c*b,a+c*b,a*c+b,a*(b+c),(a+b)*c))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Summer holidays! Someone is going on trips, someone is visiting grandparents, but someone is trying to get a part-time job. This summer Noora decided that she wants to earn some money, and took a job in a shop as an assistant.\n\nShop, where Noora is working, has a plan on the following *n* days. For each day sales manager knows exactly, that in *i*-th day *k**i* products will be put up for sale and exactly *l**i* clients will come to the shop that day. Also, the manager is sure, that everyone, who comes to the shop, buys exactly one product or, if there aren't any left, leaves the shop without buying anything. Moreover, due to the short shelf-life of the products, manager established the following rule: if some part of the products left on the shelves at the end of the day, that products aren't kept on the next day and are sent to the dump.\n\nFor advertising purposes manager offered to start a sell-out in the shop. He asked Noora to choose any *f* days from *n* next for sell-outs. On each of *f* chosen days the number of products were put up for sale would be doubled. Thus, if on *i*-th day shop planned to put up for sale *k**i* products and Noora has chosen this day for sell-out, shelves of the shop would keep 2·*k**i* products. Consequently, there is an opportunity to sell two times more products on days of sell-out.\n\nNoora's task is to choose *f* days to maximize total number of sold products. She asks you to help her with such a difficult problem.",
"input": "",
"output": "```python\nn, f = map(int, input().split())\r\na=[]\r\nc =0\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n c =c + min(x, y)\r\n\r\n a.append(min(2 * x, y) - min(x, y))\r\n\r\na.sort(reverse=True)\r\n\r\n\r\nfor i in range(f):\r\n if i < n:\r\n c += max(a[i], 0)\r\n \r\n else:\r\n break\r\n\r\nprint(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has *n* days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this *n* days: whether that gym opened and whether a contest was carried out in the Internet on that day. For the *i*-th day there are four options:\n 1. on this day the gym is closed and the contest is not carried out; 1. on this day the gym is closed and the contest is carried out; 1. on this day the gym is open and the contest is not carried out; 1. on this day the gym is open and the contest is carried out. \nOn each of days Vasya can either have a rest or write the contest (if it is carried out on this day), or do sport (if the gym is open on this day).\n\nFind the minimum number of days on which Vasya will have a rest (it means, he will not do sport and write the contest at the same time). The only limitation that Vasya has — he does not want to do the same activity on two consecutive days: it means, he will not do sport on two consecutive days, and write the contest on two consecutive days.",
"input": "",
"output": "```python\n#\t!/bin/env python3\r\n#\tcoding: UTF-8\r\n\r\n\r\n#\t✪ H4WK3yE乡\r\n#\tMohd. Farhan Tahir\r\n#\tIndian Institute Of Information Technology and Management,Gwalior\r\n\r\n#\tQuestion Link\r\n#\r\n#\r\n\r\n# ///==========Libraries, Constants and Functions=============///\r\n\r\n\r\nimport sys\r\nsys.setrecursionlimit(2000)\r\n\r\ninf = float(\"inf\")\r\nmod = 1000000007\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\n\r\n\r\ndef input(): return sys.stdin.readline()\r\n\r\n# ///==========MAIN=============///\r\n\r\n\r\ndef recurse(arr, i, flag):\r\n if i == len(arr):\r\n return 1\r\n if dp[i][flag] != inf:\r\n return dp[i][flag]\r\n\r\n if arr[i] == 0:\r\n dp[i][flag] = min(dp[i][flag], 1+recurse(arr, i+1, 2))\r\n elif arr[i] == 1:\r\n if flag != 1:\r\n dp[i][flag] = min(dp[i][flag], recurse(arr, i+1, 1), 1+recurse(arr, i+1, 2))\r\n else:\r\n dp[i][flag] = min(dp[i][flag], 1+recurse(arr, i+1, 2))\r\n elif arr[i] == 2:\r\n if flag != 0:\r\n dp[i][flag] = min(dp[i][flag], recurse(arr, i+1, 0), 1+recurse(arr, i+1, 2))\r\n else:\r\n dp[i][flag] = min(dp[i][flag], 1+recurse(arr, i+1, 2))\r\n elif arr[i] == 3:\r\n if flag == 0:\r\n dp[i][flag] = min(dp[i][flag], 1+recurse(arr, i+1, 2), recurse(arr, i+1, 1))\r\n elif flag == 1:\r\n dp[i][flag] = min(dp[i][flag], 1+recurse(arr, i+1, 2), recurse(arr, i+1, 0))\r\n elif flag == 2:\r\n dp[i][flag] = min(dp[i][flag], 1+recurse(arr, i+1, 2),\r\n recurse(arr, i+1, 0), recurse(arr, i+1, 1))\r\n return dp[i][flag]\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n arr = get_array()\r\n print(recurse(arr, 0, 2)-1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n dp = [[inf for _ in range(3)] for _ in range(101)]\r\n main()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular cake, represented as an *r*<=×<=*c* grid. Each cell either has an evil strawberry, or is empty. For example, a 3<=×<=4 cake may look as follows:\n\nThe cakeminator is going to eat the cake! Each time he eats, he chooses a row or a column that does not contain any evil strawberries and contains at least one cake cell that has not been eaten before, and eats all the cake cells there. He may decide to eat any number of times.\n\nPlease output the maximum number of cake cells that the cakeminator can eat.",
"input": "",
"output": "```python\n# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Nov 19 21:18:28 2021\r\n\r\n@author: odraode\r\n\"\"\"\r\n\r\n\r\n'''\r\nTesto dell'esercizio su 'https://codeforces.com/problemset/problem/330/A' - diff 800\r\n'''\r\n\r\n\r\ndef countPieces(k):\r\n ris =0\r\n for i in range(len(k)):\r\n if(k[i]=='.'):\r\n ris+=1\r\n return ris\r\n\r\nr,c = input().split(' ')\r\nr = int(r)\r\nc = int(c)\r\nmatrix = [ [ 0 for i in range(c) ] for j in range(r) ]\r\nfor x in range(r):\r\n l = input()\r\n for y in range(c):\r\n # matrix[c][y]='S' if(l[y]=='S') else matrix[c][y]='.'\r\n if(l[y]=='S'): matrix[x][y]='S'\r\n else: matrix[x][y]='.'\r\n\r\nate = 0\r\nfor x in range(r):\r\n if('S' not in matrix[x]):\r\n ate+=c\r\n for y in range(c):\r\n matrix[x][y]=0\r\n\r\nfor x in range(c):\r\n l=[]\r\n for y in range(r):\r\n l.append(matrix[y][x])\r\n if('S' not in l):\r\n ate+=countPieces(l)\r\n\r\nprint(ate)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Do you know a story about the three musketeers? Anyway, you will learn about its origins now.\n\nRichelimakieu is a cardinal in the city of Bearis. He is tired of dealing with crime by himself. He needs three brave warriors to help him to fight against bad guys.\n\nThere are *n* warriors. Richelimakieu wants to choose three of them to become musketeers but it's not that easy. The most important condition is that musketeers must know each other to cooperate efficiently. And they shouldn't be too well known because they could be betrayed by old friends. For each musketeer his recognition is the number of warriors he knows, excluding other two musketeers.\n\nHelp Richelimakieu! Find if it is possible to choose three musketeers knowing each other, and what is minimum possible sum of their recognitions.",
"input": "",
"output": "```python\nimport sys\nsys\ninput = sys.stdin.readline\nI = lambda : list(map(int,input().split()))\n\nn,m=I()\ng=[[0]*n for i in range(n)]\ned=[]\nan=n*n\ndg=[0]*n\nfor i in range(m):\n\tx,y=I()\n\tx-=1;y-=1\n\tdg[x]+=1;dg[y]+=1\n\tg[x][y]=1\n\tg[y][x]=1\n\ted.append([x,y])\nfor i in range(m):\n\ta,b=ed[i]\n\tfor j in range(n):\n\t\tif j!=a and j!=b and g[a][j] and g[j][b]:\n\t\t\tan=min(an,dg[a]+dg[b]+dg[j]-6)\nif an==n*n:\n\tan=-1\nprint(an)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A map of some object is a rectangular field consisting of *n* rows and *n* columns. Each cell is initially occupied by the sea but you can cover some some cells of the map with sand so that exactly *k* islands appear on the map. We will call a set of sand cells to be island if it is possible to get from each of them to each of them by moving only through sand cells and by moving from a cell only to a side-adjacent cell. The cells are called to be side-adjacent if they share a vertical or horizontal side. It is easy to see that islands do not share cells (otherwise they together form a bigger island).\n\nFind a way to cover some cells with sand so that exactly *k* islands appear on the *n*<=×<=*n* map, or determine that no such way exists.",
"input": "",
"output": "```python\nn, k = [int(x) for x in input().split()]\r\n\r\nif (n ** 2 + 1) // 2 < k:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tcount = 0\r\n\tx = True\r\n\tfor i in range(n):\r\n\t\tlst = []\r\n\t\tfor j in range(n):\r\n\t\t\tif x and count < k:\r\n\t\t\t\tlst.append('L')\r\n\t\t\t\tcount += 1\r\n\t\t\t\tx = False\r\n\t\t\telse:\r\n\t\t\t\tlst.append('S')\r\n\t\t\t\tx = True\r\n\t\tprint(''.join(lst))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The polar bears are going fishing. They plan to sail from (*s**x*,<=*s**y*) to (*e**x*,<=*e**y*). However, the boat can only sail by wind. At each second, the wind blows in one of these directions: east, south, west or north. Assume the boat is currently at (*x*,<=*y*).\n - If the wind blows to the east, the boat will move to (*x*<=+<=1,<=*y*). - If the wind blows to the south, the boat will move to (*x*,<=*y*<=-<=1). - If the wind blows to the west, the boat will move to (*x*<=-<=1,<=*y*). - If the wind blows to the north, the boat will move to (*x*,<=*y*<=+<=1). \nAlternatively, they can hold the boat by the anchor. In this case, the boat stays at (*x*,<=*y*). Given the wind direction for *t* seconds, what is the earliest time they sail to (*e**x*,<=*e**y*)?",
"input": "",
"output": "```python\nimport io\r\nimport os\r\n#input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nt, x1, y1, x2, y2 = map(int, input().split())\r\n\r\nxmove = x2 - x1\r\nymove = y2 - y1\r\n\r\nxneed = abs(xmove)\r\nyneed = abs(ymove)\r\n\r\nif xmove < 0:\r\n dx = 'W'\r\nelse:\r\n dx = 'E'\r\n\r\nif ymove < 0:\r\n dy = 'S'\r\nelse:\r\n dy = 'N'\r\n\r\ndirects = input()\r\n\r\nif directs.count(dx) < xneed or directs.count(dy) < yneed:\r\n print(-1)\r\n exit()\r\n\r\ndone = 0\r\ncnt = -1\r\nfor m in range(t):\r\n if done == 0:\r\n if directs[m] == dx:\r\n xneed -= 1\r\n elif directs[m] == dy:\r\n yneed -= 1\r\n if xneed and yneed < 1:\r\n done = 1\r\n break\r\n cnt += 1\r\n\r\nprint(cnt)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "An elephant decided to visit his friend. It turned out that the elephant's house is located at point 0 and his friend's house is located at point *x*(*x*<=><=0) of the coordinate line. In one step the elephant can move 1, 2, 3, 4 or 5 positions forward. Determine, what is the minimum number of steps he need to make in order to get to his friend's house.",
"input": "",
"output": "```python\nx = int(input()) # Input the coordinate of the friend's house\r\n\r\n# Calculate the minimum number of steps needed\r\nmin_steps = (x + 4) // 5 # Integer division (//) ensures the result is rounded up\r\n\r\nprint(min_steps)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. \"Piece of cake\" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.",
"input": "",
"output": "```python\ncoordinates=int(input())\r\nx= list(map(int,input().split()))\r\ny= list(map(int,input().split()))\r\nz= list(map(int,input().split()))\r\nif (sum(x)+sum(y)+sum(z)==0):\r\n print('YES')\r\nelse:\r\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Having watched the last Harry Potter film, little Gerald also decided to practice magic. He found in his father's magical book a spell that turns any number in the sum of its digits. At the moment Gerald learned that, he came across a number *n*. How many times can Gerald put a spell on it until the number becomes one-digit?",
"input": "",
"output": "```python\nn = int(input())\r\ncount = 0\r\nif n <= 9:\r\n print(\"0\")\r\nelse:\r\n while n >= 9:\r\n n = sum(map(int, str(n)))\r\n count = count+1\r\n\r\nprint(count) \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A family consisting of father bear, mother bear and son bear owns three cars. Father bear can climb into the largest car and he likes it. Also, mother bear can climb into the middle car and she likes it. Moreover, son bear can climb into the smallest car and he likes it. It's known that the largest car is strictly larger than the middle car, and the middle car is strictly larger than the smallest car. \n\nMasha came to test these cars. She could climb into all cars, but she liked only the smallest car. \n\nIt's known that a character with size *a* can climb into some car with size *b* if and only if *a*<=≤<=*b*, he or she likes it if and only if he can climb into this car and 2*a*<=≥<=*b*.\n\nYou are given sizes of bears and Masha. Find out some possible integer non-negative sizes of cars.",
"input": "",
"output": "```python\na, b, c, m = [int(x) for x in input().split()]\n\npossible = True\nif m > 2*c or m > b:\n print(-1)\n possible = False\n\nsm = max(m, c)\nif sm > 2*m or sm > 2*c:\n print(-1)\n possible = False\n\nme = max(b, 2*m + 1)\nif me > 2*b:\n print(-1)\n possible = False\n\nla = max(a, 2*m + 2)\nif la > 2*a:\n print(-1)\n possible = False\n\nif possible:\n print(sm)\n print(me)\n print(la)\n\n \t \t \t\t\t\t\t \t\t\t \t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\nn = int(input())\r\nwords = []\r\nans = []\r\nfor i in range(n):\r\n x = input()\r\n words.append(x)\r\n if len(words[i]) > 10:\r\n y = words[i][0] + str(len(words[i])-2) + words[i][-1]\r\n ans.append(y)\r\n else:\r\n ans.append(x)\r\nfor i in range(n):\r\n print(words[i])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers which are between 1 and *n*, inclusive.",
"input": "",
"output": "```python\nimport math\n\ndef primefactors(n,l):\n while n%2==0:\n if l.count(2)==0:\n \tl.append(2)\n n = n//2\n for i in range(3,int(math.sqrt(n))+1,2):\n while (n % i == 0):\n if l.count(i)==0:\n \tl.append(i)\n n = n//i\n if n > 2:\n l.append(n)\n return len(l)\n\nn=int(input())\nc=0\nfor i in range(6,n+1):\n\tif primefactors(i,[])==2:\n\t\tc+=1\nprint(c)\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In a building where Polycarp lives there are equal number of flats on each floor. Unfortunately, Polycarp don't remember how many flats are on each floor, but he remembers that the flats are numbered from 1 from lower to upper floors. That is, the first several flats are on the first floor, the next several flats are on the second and so on. Polycarp don't remember the total number of flats in the building, so you can consider the building to be infinitely high (i.e. there are infinitely many floors). Note that the floors are numbered from 1.\n\nPolycarp remembers on which floors several flats are located. It is guaranteed that this information is not self-contradictory. It means that there exists a building with equal number of flats on each floor so that the flats from Polycarp's memory have the floors Polycarp remembers.\n\nGiven this information, is it possible to restore the exact floor for flat *n*?",
"input": "",
"output": "```python\nimport math\r\nn,k=map(int,input().split(' '))\r\nm=[]\r\nd=0\r\nfor i in range(k):\r\n m.append(list(map(int,input().split(' '))))\r\nt=-1\r\nfor i in range(101):\r\n p=0\r\n for j in m:\r\n if ((j[1]-1)*i maxi:\r\n c+=1\r\n maxi=l[i]\r\n elif l[i] < mini:\r\n c+=1\r\n mini=l[i]\r\nprint(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You've got a 5<=×<=5 matrix, consisting of 24 zeroes and a single number one. Let's index the matrix rows by numbers from 1 to 5 from top to bottom, let's index the matrix columns by numbers from 1 to 5 from left to right. In one move, you are allowed to apply one of the two following transformations to the matrix:\n 1. Swap two neighboring matrix rows, that is, rows with indexes *i* and *i*<=+<=1 for some integer *i* (1<=≤<=*i*<=<<=5). 1. Swap two neighboring matrix columns, that is, columns with indexes *j* and *j*<=+<=1 for some integer *j* (1<=≤<=*j*<=<<=5). \nYou think that a matrix looks beautiful, if the single number one of the matrix is located in its middle (in the cell that is on the intersection of the third row and the third column). Count the minimum number of moves needed to make the matrix beautiful.",
"input": "",
"output": "```python\n\r\nlis1=[]\r\nfor i in range(0,5):\r\n lis=list(map(int,input().split()))\r\n lis1.append(lis)\r\n\r\nrow=0\r\ncol=0\r\nfor i in range (0,5):\r\n for j in range(0,5):\r\n if lis[i][j]==1:\r\n row=i\r\n col=j\r\n print(row+col-6+2)\r\n break\r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. \"Piece of cake\" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.",
"input": "",
"output": "```python\nn = int(input())\r\nx1=y1=z1=0\r\nfor i in range(n):\r\n\tx,y,z=input().split()\r\n\tx1=x1+int(x)\r\n\ty1=y1+int(y)\r\n\tz1=z1+int(z)\r\nif x1==0 and y1==0 and z1==0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A bracket sequence is a string containing only characters \"(\" and \")\".\n\nA regular bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inserting characters \"1\" and \"+\" between the original characters of the sequence. For example, bracket sequences \"()()\", \"(())\" are regular (the resulting expressions are: \"(1)+(1)\", \"((1+1)+1)\"), and \")(\" and \"(\" are not.\n\nYou are given $n$ bracket sequences $s_1, s_2, \\dots , s_n$. Calculate the number of pairs $i, j \\, (1 \\le i, j \\le n)$ such that the bracket sequence $s_i + s_j$ is a regular bracket sequence. Operation $+$ means concatenation i.e. \"()(\" + \")()\" = \"()()()\".\n\nIf $s_i + s_j$ and $s_j + s_i$ are regular bracket sequences and $i \\ne j$, then both pairs $(i, j)$ and $(j, i)$ must be counted in the answer. Also, if $s_i + s_i$ is a regular bracket sequence, the pair $(i, i)$ must be counted in the answer.",
"input": "",
"output": "```python\ndef string_value(str):\n ans=0\n valid = True\n for char in str:\n if (ans<0 and char==\"(\"):\n valid=False\n if char==\")\":\n ans-=1\n else:\n ans+=1\n ans=0\n for char in reversed(str):\n if (ans<0 and char==\")\"):\n valid=False\n if char==\"(\":\n ans-=1\n else:\n ans+=1\n return valid, ans\n\nnum = int(input())\nvals = []\nfor i in range(num):\n valid, ans = string_value(input())\n if valid:\n vals.append(ans)\n\nans=0\nif len(vals)>0:\n vals = sorted(vals)\n prev=vals[0]\n occured=1\n occurances = {}\n keys=[]\n for i in vals[1:]:\n if prev!=i:\n keys.append(prev)\n occurances[prev] = occured\n occured = 1\n prev=i\n else:\n occured += 1\n\n occurances[prev] = occured\n keys.append(prev)\n j=0\n k=len(keys)-1\n\n while j<=k:\n if -keys[j]==keys[k]:\n ans+=occurances[keys[j]]*occurances[keys[k]]\n if abs(keys[j])>abs(keys[k]):\n j+=1\n else:\n k-=1\nprint(ans)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have two variables *a* and *b*. Consider the following sequence of actions performed with these variables:\n1. If *a*<==<=0 or *b*<==<=0, end the process. Otherwise, go to step 2;1. If *a*<=≥<=2·*b*, then set the value of *a* to *a*<=-<=2·*b*, and repeat step 1. Otherwise, go to step 3;1. If *b*<=≥<=2·*a*, then set the value of *b* to *b*<=-<=2·*a*, and repeat step 1. Otherwise, end the process.\nInitially the values of *a* and *b* are positive integers, and so the process will be finite.\n\nYou have to determine the values of *a* and *b* after the process ends.",
"input": "",
"output": "```python\nline = input()\na, b = list(map(int, line.strip().split()))\n\ndef helper(a, b):\n if a == 0 or b == 0:\n print(a, b)\n else:\n if a >= 2 * b:\n a = a - 2 * b\n helper(a, b)\n else:\n if b >= 2 * a:\n b = b - 2 * a\n helper(a, b)\n else:\n print(a, b)\n\nhelper(a, b)\n \t \t \t \t \t \t \t\t\t \t \t\t \t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In a small but very proud high school it was decided to win ACM ICPC. This goal requires to compose as many teams of three as possible, but since there were only 6 students who wished to participate, the decision was to build exactly two teams.\n\nAfter practice competition, participant number *i* got a score of *a**i*. Team score is defined as sum of scores of its participants. High school management is interested if it's possible to build two teams with equal scores. Your task is to answer that question.",
"input": "",
"output": "```python\na = [int(x) for x in input().split()]\r\nfl = False\r\nfor i in range(6):\r\n for j in range(6):\r\n for k in range(6):\r\n if (i == j or k == j or i == k):\r\n continue\r\n if a[i] + a[j] + a[k] == sum(a) / 2 and sum(a) % 2 == 0:\r\n fl = True\r\nif (fl):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya adores sport programming. He can't write programs but he loves to watch the contests' progress. Vasya even has a favorite coder and Vasya pays special attention to him.\n\nOne day Vasya decided to collect the results of all contests where his favorite coder participated and track the progress of his coolness. For each contest where this coder participated, he wrote out a single non-negative number — the number of points his favorite coder earned in the contest. Vasya wrote out the points for the contest in the order, in which the contests run (naturally, no two contests ran simultaneously).\n\nVasya considers a coder's performance in a contest amazing in two situations: he can break either his best or his worst performance record. First, it is amazing if during the contest the coder earns strictly more points that he earned on each past contest. Second, it is amazing if during the contest the coder earns strictly less points that he earned on each past contest. A coder's first contest isn't considered amazing. Now he wants to count the number of amazing performances the coder had throughout his whole history of participating in contests. But the list of earned points turned out long and Vasya can't code... That's why he asks you to help him.",
"input": "",
"output": "```python\ndef main():\n _ = input()\n scores = list(int(_) for _ in input().split())\n amazings = 0\n worst = best = scores[0]\n\n for score in scores:\n if score < worst:\n amazings += 1\n worst = score\n elif score > best:\n amazings += 1\n best = score\n\n print(amazings)\n\n\nif __name__ == \"__main__\":\n main()\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Cucumber boy is fan of Kyubeat, a famous music game.\n\nKyubeat has 16 panels for playing arranged in 4<=×<=4 table. When a panel lights up, he has to press that panel.\n\nEach panel has a timing to press (the preffered time when a player should press it), and Cucumber boy is able to press at most *k* panels in a time with his one hand. Cucumber boy is trying to press all panels in perfect timing, that is he wants to press each panel exactly in its preffered time. If he cannot press the panels with his two hands in perfect timing, his challenge to press all the panels in perfect timing will fail.\n\nYou are given one scene of Kyubeat's panel from the music Cucumber boy is trying. Tell him is he able to press all the panels in perfect timing.",
"input": "",
"output": "```python\nk = 2 * int(input())\r\ntable = [c for c in input().strip() for _ in range(4)]\r\nt = dict()\r\nfor c in table:\r\n if c in t:\r\n t[c] += 1\r\n else:\r\n t[c] = 1\r\nt['.'] = 0\r\nans = True\r\nfor k in t:\r\n v = t[k]\r\n if v > k:\r\n ans = False\r\nprint(\"YES\" if ans else \"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed *w* kilos. They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem.\n\nPete and Billy are great fans of even numbers, that's why they want to divide the watermelon in such a way that each of the two parts weighs even number of kilos, at the same time it is not obligatory that the parts are equal. The boys are extremely tired and want to start their meal as soon as possible, that's why you should help them and find out, if they can divide the watermelon in the way they want. For sure, each of them should get a part of positive weight.",
"input": "",
"output": "```python\nn=int(input())\r\nc=0\r\nd=0\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if((i+j)==n):\r\n c=c+1\r\nif(i%2==0 and j%2==0):\r\n print(\"YES\")\r\nelif(i%2!=0 and j%2!=0):\r\n print(\"NO\")\r\nelif(i%2!=0 or j%2==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Your friend Mishka and you attend a calculus lecture. Lecture lasts *n* minutes. Lecturer tells *a**i* theorems during the *i*-th minute.\n\nMishka is really interested in calculus, though it is so hard to stay awake for all the time of lecture. You are given an array *t* of Mishka's behavior. If Mishka is asleep during the *i*-th minute of the lecture then *t**i* will be equal to 0, otherwise it will be equal to 1. When Mishka is awake he writes down all the theorems he is being told — *a**i* during the *i*-th minute. Otherwise he writes nothing.\n\nYou know some secret technique to keep Mishka awake for *k* minutes straight. However you can use it only once. You can start using it at the beginning of any minute between 1 and *n*<=-<=*k*<=+<=1. If you use it on some minute *i* then Mishka will be awake during minutes *j* such that and will write down all the theorems lecturer tells.\n\nYou task is to calculate the maximum number of theorems Mishka will be able to write down if you use your technique only once to wake him up.",
"input": "",
"output": "```python\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nL = lambda:list(map(int,input().split()))\r\n \r\nn,k = map(int,input().split()) # duration + time stay awake\r\n\r\nt = L() #theorems\r\n\r\nb = L() #behaviour asleep = 0\r\n\r\n\r\nextra = 0 \r\n\r\nfor i in range(n):\r\n if b[i] == 1:\r\n extra += t[i]\r\n \r\ns = extra\r\nfor i in range(k):\r\n if b[i] == 0:\r\n s += t[i]\r\n \r\nbig = s\r\n\r\nfor i in range(1,n-k + 1):\r\n if b[i-1] == 0:\r\n s -= t[i-1]\r\n if b[i+k-1] == 0:\r\n s += t[i+k-1]\r\n #print(\"t= \",t[i],t[i+1],t[i+2])\r\n #print(\"b= \",b[i],b[i+1],b[i+2])\r\n #print(\"s= \",s)\r\n big = max(big,s)\r\n \r\nprint(big)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Today Vasya visited a widely known site and learned that the continuation of his favourite game Codecraft II will appear after exactly *k* months. He looked at the calendar and learned that at the moment is the month number *s*. Vasya immediately got interested in what month Codecraft III will appear. Help him understand that.\n\nAll the twelve months in Vasya's calendar are named using their usual English names: January, February, March, April, May, June, July, August, September, October, November, December.",
"input": "",
"output": "```python\ns=input()\r\nk=int(input())\r\nmonths = ['January','February','March','April','May','June','July','August','September','October','November','December']\r\nind=months.index(s)\r\ntmp=(ind+1+k)%12\r\nprint(months[tmp-1])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "*n* soldiers stand in a circle. For each soldier his height *a**i* is known. A reconnaissance unit can be made of such two neighbouring soldiers, whose heights difference is minimal, i.e. |*a**i*<=-<=*a**j*| is minimal. So each of them will be less noticeable with the other. Output any pair of soldiers that can form a reconnaissance unit.",
"input": "",
"output": "```python\nn = int(input())\r\nl = list(map(int,input().split()))\r\nr = float('Inf')\r\na,b = 0,0\r\nfor i in range(n-1):\r\n if abs(l[i]-l[i+1]) < r:\r\n r = abs(l[i]-l[i+1])\r\n a,b = i,i+1\r\nif abs(l[n-1]-l[0]) < r:\r\n r = abs(l[n-1]-l[0])\r\n a,b = n-1,0\r\nprint(a+1,b+1)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once at a team training Vasya, Petya and Sasha got a problem on implementing linear search in an array.\n\nAccording to the boys, linear search works as follows. The array elements in a pre-selected order are in turn compared with the number that you need to find. Once you find the array element that is equal to the required one, the search ends. The efficiency of the algorithm is the number of performed comparisons. The fewer comparisons the linear search has made, the more effective it is.\n\nVasya believes that a linear search would work better if it sequentially iterates through the elements, starting with the 1-st one (in this problem we consider the elements of the array indexed from 1 to *n*) and ending with the *n*-th one. And Petya says that Vasya is wrong: the search will need less comparisons if it sequentially iterates the elements starting from the *n*-th and ending with the 1-st one. Sasha argues that the two approaches are equivalent.\n\nTo finally begin the task, the teammates decided to settle the debate and compare the two approaches on an example. For this, they took an array that is a permutation of integers from 1 to *n*, and generated *m* queries of the form: find element with value *b**i* in the array. They want to calculate for both approaches how many comparisons in total the linear search will need to respond to all queries. If the first search needs fewer comparisons, then the winner of the dispute is Vasya. If the second one does, then the winner is Petya. If both approaches make the same number of comparisons, then Sasha's got the upper hand.\n\nBut the problem is, linear search is too slow. That's why the boys aren't going to find out who is right before the end of the training, unless you come in here. Help them to determine who will win the dispute.",
"input": "",
"output": "```python\nvar = int(input())\nx = \"\".join(input().split())\ninput()\nsearch = input().split()\ns1 = s2 = 0\nfor val in search:\n s1 += x.index(val) + 1\n s2 += var - x.rindex(val)\nprint(s1,s2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given *n* points on a line with their coordinates *x**i*. Find the point *x* so the sum of distances to the given points is minimal.",
"input": "",
"output": "```python\nn = int(input())\r\na = input().split(\" \")\r\na = sorted([int(i) for i in a])\r\nprint(a[int((n-1) / 2)])\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Yakko, Wakko and Dot, world-famous animaniacs, decided to rest from acting in cartoons, and take a leave to travel a bit. Yakko dreamt to go to Pennsylvania, his Motherland and the Motherland of his ancestors. Wakko thought about Tasmania, its beaches, sun and sea. Dot chose Transylvania as the most mysterious and unpredictable place.\n\nBut to their great regret, the leave turned to be very short, so it will be enough to visit one of the three above named places. That's why Yakko, as the cleverest, came up with a truly genius idea: let each of the three roll an ordinary six-sided die, and the one with the highest amount of points will be the winner, and will take the other two to the place of his/her dreams.\n\nYakko thrown a die and got Y points, Wakko — W points. It was Dot's turn. But she didn't hurry. Dot wanted to know for sure what were her chances to visit Transylvania.\n\nIt is known that Yakko and Wakko are true gentlemen, that's why if they have the same amount of points with Dot, they will let Dot win.",
"input": "",
"output": "```python\nw,y=[int(x) for x in input().split()]\r\nl=[w,y]\r\nl.sort()\r\nn=7-l[1]\r\nfor j in range (1,n+1):\r\n if n%j==0 and 6%j==0:\r\n ans=int(n/j)\r\n ans1=int(6/j)\r\nprint(\"{0}/{1}\".format(ans,ans1)) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Susie listens to fairy tales before bed every day. Today's fairy tale was about wood cutters and the little girl immediately started imagining the choppers cutting wood. She imagined the situation that is described below.\n\nThere are *n* trees located along the road at points with coordinates *x*1,<=*x*2,<=...,<=*x**n*. Each tree has its height *h**i*. Woodcutters can cut down a tree and fell it to the left or to the right. After that it occupies one of the segments [*x**i*<=-<=*h**i*,<=*x**i*] or [*x**i*;*x**i*<=+<=*h**i*]. The tree that is not cut down occupies a single point with coordinate *x**i*. Woodcutters can fell a tree if the segment to be occupied by the fallen tree doesn't contain any occupied point. The woodcutters want to process as many trees as possible, so Susie wonders, what is the maximum number of trees to fell.",
"input": "",
"output": "```python\nfrom itertools import pairwise\r\nfrom math import inf\r\n\r\nn = int(input()) #数量\r\nl = []\r\nfor _ in range(n):\r\n l += list(map(int,input().split())),\r\nl += (inf, 1),\r\n# print(l)\r\ntem = -inf\r\nans = 0\r\nfor (x1, h1), (x2 ,h2) in pairwise(l):\r\n if x1-h1> tem:\r\n tem = x1\r\n ans += 1\r\n elif x1 + h1 < x2:\r\n tem = x1 + h1\r\n ans += 1\r\n else: tem = x1\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A string $s$ of length $n$ can be encrypted by the following algorithm:\n - iterate over all divisors of $n$ in decreasing order (i.e. from $n$ to $1$), - for each divisor $d$, reverse the substring $s[1 \\dots d]$ (i.e. the substring which starts at position $1$ and ends at position $d$). \nFor example, the above algorithm applied to the string $s$=\"codeforces\" leads to the following changes: \"codeforces\" $\\to$ \"secrofedoc\" $\\to$ \"orcesfedoc\" $\\to$ \"rocesfedoc\" $\\to$ \"rocesfedoc\" (obviously, the last reverse operation doesn't change the string because $d=1$).\n\nYou are given the encrypted string $t$. Your task is to decrypt this string, i.e., to find a string $s$ such that the above algorithm results in string $t$. It can be proven that this string $s$ always exists and is unique.",
"input": "",
"output": "```python\ndef solve():\r\n size = int(input())\r\n s = input()\r\n \r\n for i in range(1, size + 1):\r\n if not (size % i):\r\n s = s[0:i][::-1] + s[i:]\r\n \r\n print(s)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. \"Piece of cake\" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.",
"input": "",
"output": "```python\nans=[0,0,0]\r\nf=0\r\nn=int(input())\r\ns=[list(map(int,input().split())) for i in range(n)]\r\nfor i in range(n):\r\n ans[0]=+s[i][0]\r\n ans[1]=+s[i][1]\r\n ans[2]=+s[i][2]\r\nfor x in ans:\r\n if x!=0:\r\n f=1\r\nif f==1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.\n\nLet us remind you that lucky numbers are positive integers whose decimal representation only contains lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.\n\nRoma's got *n* positive integers. He wonders, how many of those integers have not more than *k* lucky digits? Help him, write the program that solves the problem.",
"input": "",
"output": "```python\na,b= map(int,input().split())\nc=list(map(int,input().split()))\nd=0\nfor j in range(a):\n if str(c[j]).count('4')+str(c[j]).count('7')<=b:\n d+=1\nprint(d)\n\t\t \t \t \t \t\t \t \t\t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Companies always have a lot of equipment, furniture and other things. All of them should be tracked. To do this, there is an inventory number assigned with each item. It is much easier to create a database by using those numbers and keep the track of everything.\n\nDuring an audit, you were surprised to find out that the items are not numbered sequentially, and some items even share the same inventory number! There is an urgent need to fix it. You have chosen to make the numbers of the items sequential, starting with 1. Changing a number is quite a time-consuming process, and you would like to make maximum use of the current numbering.\n\nYou have been given information on current inventory numbers for *n* items in the company. Renumber items so that their inventory numbers form a permutation of numbers from 1 to *n* by changing the number of as few items as possible. Let us remind you that a set of *n* numbers forms a permutation if all the numbers are in the range from 1 to *n*, and no two numbers are equal.",
"input": "",
"output": "```python\ndef main():\n n = int(input())\n a = list(map(int,input().split()))\n used = set()\n original = set(a)\n not_used = set(range(1,n+1)) - original\n\n for i in range(n):\n if a[i] > n or a[i] in used:\n temp = next(iter(not_used),None)\n if temp is not None:\n a[i] = temp\n not_used.remove(temp)\n used.add(temp)\n else:\n used.add(a[i])\n print(*a)\nif __name__ == '__main__':\n main()\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he organized a New Year party at his place and invited *n* his friends there.\n\nIf there's one thing Petya likes more that receiving gifts, that's watching others giving gifts to somebody else. Thus, he safely hid the laptop until the next New Year and made up his mind to watch his friends exchanging gifts while he does not participate in the process. He numbered all his friends with integers from 1 to *n*. Petya remembered that a friend number *i* gave a gift to a friend number *p**i*. He also remembered that each of his friends received exactly one gift.\n\nNow Petya wants to know for each friend *i* the number of a friend who has given him a gift.",
"input": "",
"output": "```python\nx=int(input())\r\ngift=list(map(int,input().split(' ')))\r\narray=[]\r\nfor t in range(x):\r\n array.append(0)\r\nfor a,b in enumerate(gift):\r\n array[b-1]=a+1\r\nfor d in array:\r\n print(d,end=' ')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Lolek and Bolek are about to travel abroad by plane. The local airport has a special \"Choose Your Plane\" offer. The offer's conditions are as follows:\n - it is up to a passenger to choose a plane to fly on; - if the chosen plane has *x* (*x*<=><=0) empty seats at the given moment, then the ticket for such a plane costs *x* zlotys (units of Polish currency). \nThe only ticket office of the airport already has a queue of *n* passengers in front of it. Lolek and Bolek have not stood in the queue yet, but they are already wondering what is the maximum and the minimum number of zlotys the airport administration can earn if all *n* passengers buy tickets according to the conditions of this offer?\n\nThe passengers buy tickets in turn, the first person in the queue goes first, then goes the second one, and so on up to *n*-th person.",
"input": "",
"output": "```python\nimport queue\r\ndef get_ans():\r\n qlo = queue.PriorityQueue()\r\n qhi = queue.PriorityQueue()\r\n n,m = map(int,input().split())\r\n l = list(map(int,input().split()))\r\n for i in l:\r\n qlo.put(i)\r\n qhi.put(-i)\r\n\r\n # MAX\r\n hi = 0\r\n nhi = 0\r\n while nhi < n and not qhi.empty():\r\n nhi+=1\r\n x = qhi.get()\r\n hi-=x\r\n x = x + 1\r\n if x != 0:\r\n qhi.put(x)\r\n\r\n\r\n # MIN\r\n lo = 0\r\n nlo = 0\r\n while nlo < n and not qlo.empty():\r\n nlo+=1\r\n x = qlo.get()\r\n lo+=x\r\n x = x - 1\r\n if x != 0:\r\n qlo.put(x)\r\n\r\n return hi,lo\r\n\r\nhi,lo = get_ans()\r\nprint(hi, lo)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Fox Ciel is playing a game with numbers now. \n\nCiel has *n* positive integers: *x*1, *x*2, ..., *x**n*. She can do the following operation as many times as needed: select two different indexes *i* and *j* such that *x**i* > *x**j* hold, and then apply assignment *x**i* = *x**i* - *x**j*. The goal is to make the sum of all numbers as small as possible.\n\nPlease help Ciel to find this minimal sum.",
"input": "",
"output": "```python\ncasos = int(input())\r\nlimite = int(input())\r\nnumeros = [x for x in range(0,limite+1)]\r\ncontadorCorrectos = 0\r\nfor k in range(casos):\r\n #Comparar cada numero\r\n numero = int(input())\r\n contadorDigito = 0\r\n while numero>0:\r\n #Procesar el ultimo dgito\r\n digito = numero%10\r\n numero//=10\r\n if digito in numeros:\r\n contadorDigito+=1\r\n if contadorDigito >=limite+1:\r\n contadorCorrectos+=1\r\nprint(contadorCorrectos)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\ns=input()\nu=0\nl=0\nfor i in s:\n if i.islower()==True:\n l+=1\nelse:\n u +=1\n if l >= u :\n print(s.lower())\nelse:\n print(s.upper())\n\t \t\t \t\t\t \t\t \t\t\t \t\t\t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ann and Borya have *n* piles with candies and *n* is even number. There are *a**i* candies in pile with number *i*.\n\nAnn likes numbers which are square of some integer and Borya doesn't like numbers which are square of any integer. During one move guys can select some pile with candies and add one candy to it (this candy is new and doesn't belong to any other pile) or remove one candy (if there is at least one candy in this pile). \n\nFind out minimal number of moves that is required to make exactly *n*<=/<=2 piles contain number of candies that is a square of some integer and exactly *n*<=/<=2 piles contain number of candies that is not a square of any integer.",
"input": "",
"output": "```python\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nans = 0\r\nB = []\r\nC = []\r\nfor a in A:\r\n t = int(a**0.5)\r\n if t*t!=a:\r\n B.append(a)\r\n else:\r\n C.append(a)\r\n\r\n \r\nif len(B) max(PowersOfThePlayer[1:]):\r\n PowerOfTheWinner=PowersOfThePlayer[0]\r\n\r\nif PowerOfTheWinner == None:\r\n WinsOfThePlayer=[0]*len(PowersOfThePlayer)\r\n while True:\r\n Winer=None\r\n Loser=None\r\n Player1=PowersOfThePlayer[0]\r\n Player2=PowersOfThePlayer[1]\r\n if Player1 > Player2:\r\n Winer=Player1\r\n Loser=Player2 \r\n WinsOfThePlayer[0]=WinsOfThePlayer[0]+1\r\n else:\r\n Winer=Player2\r\n Loser=Player1\r\n WinsOfThePlayer[1]=WinsOfThePlayer[1]+1\r\n \r\n if max(WinsOfThePlayer)==k or PowersOfThePlayer[0]==max(PowersOfThePlayer):\r\n IndexPowerWin=WinsOfThePlayer.index(max(WinsOfThePlayer))\r\n PowerOfTheWinner=PowersOfThePlayer[IndexPowerWin]\r\n break\r\n else:\r\n IndexLoser=PowersOfThePlayer.index(Loser)\r\n TempPower=PowersOfThePlayer.pop(IndexLoser)\r\n PowersOfThePlayer.append(TempPower)\r\n \r\n TempWin=WinsOfThePlayer.pop(IndexLoser)\r\n WinsOfThePlayer.append(TempWin)\r\nprint(PowerOfTheWinner)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.\n\nOne day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.\n\nIn his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The *i*-th digit of the answer is 1 if and only if the *i*-th digit of the two given numbers differ. In the other case the *i*-th digit of the answer is 0.\n\nShapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.\n\nNow you are going to take part in Shapur's contest. See if you are faster and more accurate.",
"input": "",
"output": "```python\nn1 = input()\r\nn2 = input()\r\nfinal = \"\"\r\nx = list(zip(n1,n2))\r\nprint(list(x))\r\nfor i in x:\r\n a,b = i\r\n if a==b:\r\n final+=\"0\"\r\n else:\r\n final+=\"1\"\r\nprint(final)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp has $n$ coins, the value of the $i$-th coin is $a_i$. It is guaranteed that all the values are integer powers of $2$ (i.e. $a_i = 2^d$ for some non-negative integer number $d$).\n\nPolycarp wants to know answers on $q$ queries. The $j$-th query is described as integer number $b_j$. The answer to the query is the minimum number of coins that is necessary to obtain the value $b_j$ using some subset of coins (Polycarp can use only coins he has). If Polycarp can't obtain the value $b_j$, the answer to the $j$-th query is -1.\n\nThe queries are independent (the answer on the query doesn't affect Polycarp's coins).",
"input": "",
"output": "```python\n\r\nn, q = map(int, input().split())\r\ntemp = 0\r\nat = 1\r\nd = {}\r\ndd = {}\r\nfor i in range(32):\r\n d[at] = [temp, 0]\r\n dd[temp] = [at, 0]\r\n temp+=1\r\n at*=2\r\nl = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n dd[d[l[i]][0]][1]+=1\r\n# print(d)\r\n# print(dd)\r\nfor _ in range(q):\r\n t = int(input())\r\n c = 0\r\n coin = 0\r\n for i in range(30, -1, -1):\r\n # print(i)\r\n c = min(dd[i][1], (t//dd[i][0]))\r\n t-= (c*(dd[i][0]))\r\n coin+=c\r\n # print(i, t)\r\n # print(t)\r\n if(t !=0):\r\n print(-1)\r\n else:\r\n print(coin)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Young Timofey has a birthday today! He got kit of *n* cubes as a birthday present from his parents. Every cube has a number *a**i*, which is written on it. Timofey put all the cubes in a row and went to unpack other presents.\n\nIn this time, Timofey's elder brother, Dima reordered the cubes using the following rule. Suppose the cubes are numbered from 1 to *n* in their order. Dima performs several steps, on step *i* he reverses the segment of cubes from *i*-th to (*n*<=-<=*i*<=+<=1)-th. He does this while *i*<=≤<=*n*<=-<=*i*<=+<=1.\n\nAfter performing the operations Dima went away, being very proud of himself. When Timofey returned to his cubes, he understood that their order was changed. Help Timofey as fast as you can and save the holiday — restore the initial order of the cubes using information of their current location.",
"input": "",
"output": "```python\nN = int(input()) - 1\n\n_arr = list(map(int, input().split()))\n\ni = 0\n\nwhile i < N - i:\n if (i + 1) % 2 != 0:\n _t = _arr[i]\n\n _arr[i] = _arr[N - i]\n _arr[N - i] = _t\n i += 1\n\n_arr = list(map(str, _arr))\n\nprint(' '.join(_arr))\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Jack is working on his jumping skills recently. Currently he's located at point zero of the number line. He would like to get to the point *x*. In order to train, he has decided that he'll first jump by only one unit, and each subsequent jump will be exactly one longer than the previous one. He can go either left or right with each jump. He wonders how many jumps he needs to reach *x*.",
"input": "",
"output": "```python\n#****************************************\r\n\r\n#** Solution by BAZOOKA **\r\n\r\n#** Sponsored by RED BULL**\r\n\r\n#** Team Galaxy **\r\n\r\n#** I love ❤Kateryna Gret❤ **\r\n\r\n#****************************************/\r\nn, i=abs(int(input())), 0\r\nwhile n>0 or n%2==1:\r\n i+=1; n-=i\r\nprint(i)\r\n#****************************************\r\n\r\n#** Solution by BAZOOKA **\r\n\r\n#** Sponsored by RED BULL**\r\n\r\n#** Team Galaxy **\r\n\r\n#** I love ❤Kateryna Gret❤ **\r\n\r\n#****************************************/\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "«Polygon» is a system which allows to create programming tasks in a simple and professional way. When you add a test to the problem, the corresponding form asks you for the test index. As in most cases it is clear which index the next test will have, the system suggests the default value of the index. It is calculated as the smallest positive integer which is not used as an index for some previously added test.\n\nYou are to implement this feature. Create a program which determines the default index of the next test, given the indexes of the previously added tests.",
"input": "",
"output": "```python\n# Read input\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\nif arr[0] != 1:\r\n print(1)\r\nelse:\r\n f = 0\r\n for i in range(len(arr)-1):\r\n if arr[i+1] - arr[i] > 1:\r\n f= 1\r\n break\r\n if f:\r\n print(arr[i]+1)\r\n else:\r\n print(arr[-1]+1)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A string is called a *k*-string if it can be represented as *k* concatenated copies of some string. For example, the string \"aabaabaabaab\" is at the same time a 1-string, a 2-string and a 4-string, but it is not a 3-string, a 5-string, or a 6-string and so on. Obviously any string is a 1-string.\n\nYou are given a string *s*, consisting of lowercase English letters and a positive integer *k*. Your task is to reorder the letters in the string *s* in such a way that the resulting string is a *k*-string.",
"input": "",
"output": "```python\nk = int(input())\r\ns = input()\r\na = set()\r\nfor i in s:\r\n a.add(i)\r\na = list(a)\r\ncheck = -1\r\nfor i in a:\r\n if(s.count(i)!=k):\r\n print(check)\r\n else:\r\n check = 1\r\n \r\nif(check == 1):\r\n for i in range(k):\r\n \t\tfor j in a:\r\n\t\t\t print(j,end=\"\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Iahub and Iahubina went to a date at a luxury restaurant. Everything went fine until paying for the food. Instead of money, the waiter wants Iahub to write a Hungry sequence consisting of *n* integers. \n\nA sequence *a*1, *a*2, ..., *a**n*, consisting of *n* integers, is Hungry if and only if: \n - Its elements are in increasing order. That is an inequality *a**i*<=<<=*a**j* holds for any two indices *i*,<=*j* (*i*<=<<=*j*). - For any two indices *i* and *j* (*i*<=<<=*j*), *a**j* must not be divisible by *a**i*. \nIahub is in trouble, so he asks you for help. Find a Hungry sequence with *n* elements.",
"input": "",
"output": "```python\nimport sys\nn=int(input())\nsys.stdout.write(str(n))\na=n+1\nb=n*2\nfor idx in range(a, b):\n sys.stdout.write(\" \" + str(idx))\n \t\t \t \t\t\t\t \t\t\t\t\t \t \t \t\t \t\t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\ns = input()\r\nU = 0\r\nL = 0\r\nfor i in range(len(s) - 1):\r\n if s[i].isupper():\r\n U += 1\r\n else:\r\n L += 1\r\nif L < U:\r\n print(s.upper())\r\nelif U < L:\r\n print(s.lower())\r\nelif U == L:\r\n print(s.lower())\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya decided to have a look at the results of Berland 1910 Football Championship’s finals. Unfortunately he didn't find the overall score of the match; however, he got hold of a profound description of the match's process. On the whole there are *n* lines in that description each of which described one goal. Every goal was marked with the name of the team that had scored it. Help Vasya, learn the name of the team that won the finals. It is guaranteed that the match did not end in a tie.",
"input": "",
"output": "```python\nfrom collections import Counter\r\ndef ans(arr):\r\n dummy = Counter(arr)\r\n max_ = max(list(dummy.values()))\r\n for i in dummy.keys():\r\n if(dummy[i] == max_):\r\n return(i)\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n temp = []\r\n for _ in range(n):\r\n temp.append(input())\r\n print(ans(temp))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* kangaroos with pockets. Each kangaroo has a size (integer number). A kangaroo can go into another kangaroo's pocket if and only if the size of kangaroo who hold the kangaroo is at least twice as large as the size of kangaroo who is held.\n\nEach kangaroo can hold at most one kangaroo, and the kangaroo who is held by another kangaroo cannot hold any kangaroos.\n\nThe kangaroo who is held by another kangaroo cannot be visible from outside. Please, find a plan of holding kangaroos with the minimal number of kangaroos who is visible.",
"input": "",
"output": "```python\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(int(input()))\r\narr.sort()\r\nans = 0\r\na,b =0,n//2\r\nwhile a= k:\r\n rb = mid\r\n else:\r\n l = mid+1\r\n return l\r\n\r\n\r\ndef bsr(l, r, k):\r\n while l < r:\r\n mid = (l + r + 1) // 2\r\n if nums[mid] <= k:\r\n l = mid\r\n else:\r\n r = mid - 1\r\n return l\r\n\r\n\r\nif __name__ == '__main__':\r\n stop = int(2e9)\r\n\r\n nums = []\r\n i = 1\r\n while i <= stop:\r\n nums.append(i)\r\n i *= 2\r\n\r\n ts = len(nums)\r\n\r\n for i in range(ts):\r\n cur = nums[i] * 3\r\n while cur <= stop:\r\n nums.append(cur)\r\n cur *= 3\r\n nums.sort()\r\n\r\n ln = len(nums)\r\n l, r = map(int, input().split())\r\n\r\n le, re = 0, ln-1\r\n\r\n while le < ln and nums[le] < l:\r\n le += 1\r\n\r\n while re >= 0 and nums[re] > r:\r\n re -= 1\r\n\r\n #print(le, re, nums[le], nums[re], nums[le:re+1])\r\n\r\n # if l == r and nums[le] == l:\r\n # print(1)\r\n #else:\r\n # print(re - le + 1 )\r\n print(re-le+1)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Imp likes his plush toy a lot.\n\nRecently, he found a machine that can clone plush toys. Imp knows that if he applies the machine to an original toy, he additionally gets one more original toy and one copy, and if he applies the machine to a copied toy, he gets two additional copies.\n\nInitially, Imp has only one original toy. He wants to know if it is possible to use machine to get exactly *x* copied toys and *y* original toys? He can't throw toys away, and he can't apply the machine to a copy if he doesn't currently have any copies.",
"input": "",
"output": "```python\nx,y=[int(i) for i in input().split()]\r\nz=y-1\r\nif y==2 and x%2==0:\r\n print ('No')\r\nelif x%z==0:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Lolek and Bolek are about to travel abroad by plane. The local airport has a special \"Choose Your Plane\" offer. The offer's conditions are as follows:\n - it is up to a passenger to choose a plane to fly on; - if the chosen plane has *x* (*x*<=><=0) empty seats at the given moment, then the ticket for such a plane costs *x* zlotys (units of Polish currency). \nThe only ticket office of the airport already has a queue of *n* passengers in front of it. Lolek and Bolek have not stood in the queue yet, but they are already wondering what is the maximum and the minimum number of zlotys the airport administration can earn if all *n* passengers buy tickets according to the conditions of this offer?\n\nThe passengers buy tickets in turn, the first person in the queue goes first, then goes the second one, and so on up to *n*-th person.",
"input": "",
"output": "```python\nn = int(input())\r\n\r\ndef cus_fact(na):\r\n l = []\r\n sr = \"\"\r\n for j in range(na):\r\n sr += str(j) + \" \"\r\n l.append(str(j))\r\n if n >= 1:\r\n sr += str(na)\r\n sr += \" \" + ' '.join(l[::-1])\r\n sr = sr.rstrip()\r\n # print(\"S : \", s)\r\n return sr\r\n\r\nlst = []\r\nfor i in range(n+1):\r\n s = cus_fact(i)\r\n print(\" \"*(n-i)*2, end=\"\")\r\n print(s)\r\n lst.append(s)\r\nfor i in range(n-1, -1, -1):\r\n print(\" \"*(n-i)*2, end=\"\")\r\n print(lst[i])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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).\n\n*q* events are about to happen (in chronological order). They are of three types:\n 1. Application *x* generates a notification (this new notification is unread). 1. Thor reads all notifications generated so far by application *x* (he may re-read some notifications). 1. Thor reads the first *t* notifications generated by phone applications (notifications generated in first *t* events of the first type). It's guaranteed that there were at least *t* events of the first type before this event. Please note that he doesn't read first *t* unread notifications, he just reads the very first *t* notifications generated on his phone and he may re-read some of them in this operation. \nPlease help Thor and tell him the number of unread notifications after each event. You may assume that initially there are no notifications in the phone.",
"input": "",
"output": "```python\n#code\r\nn=int(input())\r\ns1=input()\r\nx1=s1.split()\r\ns2=input()\r\nx2=s2.split()\r\ndic=dict()\r\nst=set()\r\nm=0\r\nfor i in range(n):\r\n if int(x1[i])==0:\r\n continue\r\n elif int(x2[i])==0:\r\n if 0 in st:\r\n dic[0]=dic[0]+1 \r\n m=max(m,dic[0])\r\n else:\r\n st.add(0)\r\n dic[0]=1\r\n m=max(m,dic[0])\r\n elif int(x1[i])/int(x2[i]) in st:\r\n dic[int(x1[i])/int(x2[i])]=dic[int(x1[i])/int(x2[i])]+1 \r\n m=max(m,dic[int(x1[i])/int(x2[i])])\r\n else:\r\n st.add(int(x1[i])/int(x2[i]))\r\n dic[int(x1[i])/int(x2[i])]=1\r\n m=max(m,dic[int(x1[i])/int(x2[i])])\r\nprint(m)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of *n* distinct integers. And then they take turns to make the following moves. During each move, either Alice or Bob (the player whose turn is the current) can choose two distinct integers *x* and *y* from the set, such that the set doesn't contain their absolute difference |*x*<=-<=*y*|. Then this player adds integer |*x*<=-<=*y*| to the set (so, the size of the set increases by one).\n\nIf the current player has no valid move, he (or she) loses the game. The question is who will finally win the game if both players play optimally. Remember that Alice always moves first.",
"input": "",
"output": "```python\nimport random\r\nimport time\r\nn = int(input())\r\nlist = list(map(int, input().split()))\r\na=max(list)\r\nc=len(list)\r\nif c%2==0:\r\n print(\"Bob\")\r\nelse:\r\n print(\"Alice\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Given an array *a*1,<=*a*2,<=...,<=*a**n* of *n* integers, find the largest number in the array that is not a perfect square.\n\nA number *x* is said to be a perfect square if there exists an integer *y* such that *x*<==<=*y*2.",
"input": "",
"output": "```python\nfrom math import *\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nfor i in l:\r\n if i > 0 and sqrt(i)!=int(sqrt(i)):\r\n print(i)\r\n exit()\r\nfor i in l:\r\n if i < 0:\r\n print(i)\r\n exit()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed *w* kilos. They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem.\n\nPete and Billy are great fans of even numbers, that's why they want to divide the watermelon in such a way that each of the two parts weighs even number of kilos, at the same time it is not obligatory that the parts are equal. The boys are extremely tired and want to start their meal as soon as possible, that's why you should help them and find out, if they can divide the watermelon in the way they want. For sure, each of them should get a part of positive weight.",
"input": "",
"output": "```python\nli='doG is mY fAv'\r\nli=li.swapcase()\r\nli=li.split(' ')\r\nprint(li)\r\ns=''\r\nfor i in li[::-1]:\r\n s+=i+' '\r\nprint(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\nt = int(input()) #test cases\r\n\r\nfor i in range(t):\r\n word_list = input().split()\r\n # print (word_list)\r\n\r\n for word in word_list:\r\n if len(word) > 10:\r\n word_letters = [*word]\r\n print(f\"{word_letters[0]}{len(word)-2}{word_letters[-1]}\")\r\n else:\r\n print(word)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Natasha is going to fly on a rocket to Mars and return to Earth. Also, on the way to Mars, she will land on $n - 2$ intermediate planets. Formally: we number all the planets from $1$ to $n$. $1$ is Earth, $n$ is Mars. Natasha will make exactly $n$ flights: $1 \\to 2 \\to \\ldots n \\to 1$.\n\nFlight from $x$ to $y$ consists of two phases: take-off from planet $x$ and landing to planet $y$. This way, the overall itinerary of the trip will be: the $1$-st planet $\\to$ take-off from the $1$-st planet $\\to$ landing to the $2$-nd planet $\\to$ $2$-nd planet $\\to$ take-off from the $2$-nd planet $\\to$ $\\ldots$ $\\to$ landing to the $n$-th planet $\\to$ the $n$-th planet $\\to$ take-off from the $n$-th planet $\\to$ landing to the $1$-st planet $\\to$ the $1$-st planet.\n\nThe mass of the rocket together with all the useful cargo (but without fuel) is $m$ tons. However, Natasha does not know how much fuel to load into the rocket. Unfortunately, fuel can only be loaded on Earth, so if the rocket runs out of fuel on some other planet, Natasha will not be able to return home. Fuel is needed to take-off from each planet and to land to each planet. It is known that $1$ ton of fuel can lift off $a_i$ tons of rocket from the $i$-th planet or to land $b_i$ tons of rocket onto the $i$-th planet. \n\nFor example, if the weight of rocket is $9$ tons, weight of fuel is $3$ tons and take-off coefficient is $8$ ($a_i = 8$), then $1.5$ tons of fuel will be burnt (since $1.5 \\cdot 8 = 9 + 3$). The new weight of fuel after take-off will be $1.5$ tons. \n\nPlease note, that it is allowed to burn non-integral amount of fuel during take-off or landing, and the amount of initial fuel can be non-integral as well.\n\nHelp Natasha to calculate the minimum mass of fuel to load into the rocket. Note, that the rocket must spend fuel to carry both useful cargo and the fuel itself. However, it doesn't need to carry the fuel which has already been burnt. Assume, that the rocket takes off and lands instantly.",
"input": "",
"output": "```python\nn = int(input())\r\nm = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nflag = 1\r\nfor i in range(n):\r\n if a[i] == 1 or b[i] == 1:\r\n print(-1)\r\n flag = 0\r\n break\r\n\r\nif flag:\r\n wt = m\r\n wt += wt/(b[0]-1)\r\n for i in range(n-1,0,-1):\r\n wt += wt/(a[i]-1)\r\n wt += wt/(b[i]-1)\r\n \r\n wt += wt/(a[0]-1)\r\n print(wt-m)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are a lover of bacteria. You want to raise some bacteria in a box. \n\nInitially, the box is empty. Each morning, you can put any number of bacteria into the box. And each night, every bacterium in the box will split into two bacteria. You hope to see exactly *x* bacteria in the box at some moment. \n\nWhat is the minimum number of bacteria you need to put into the box across those days?",
"input": "",
"output": "```python\nx=int(input())\r\nd=0\r\nif n%2==0:\r\n d=1\r\nelse:\r\n d=2\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In Python, code blocks don't have explicit begin/end or curly braces to mark beginning and end of the block. Instead, code blocks are defined by indentation.\n\nWe will consider an extremely simplified subset of Python with only two types of statements.\n\nSimple statements are written in a single line, one per line. An example of a simple statement is assignment.\n\nFor statements are compound statements: they contain one or several other statements. For statement consists of a header written in a separate line which starts with \"for\" prefix, and loop body. Loop body is a block of statements indented one level further than the header of the loop. Loop body can contain both types of statements. Loop body can't be empty.\n\nYou are given a sequence of statements without indentation. Find the number of ways in which the statements can be indented to form a valid Python program.",
"input": "",
"output": "```python\ndp = [1]\r\nfor i in range(int(input()) - 1):\r\n if input() == 's':\r\n for j in range(1, i + 1):\r\n dp[j - 1] += dp[j]\r\n dp.append(0)\r\n else:\r\n dp.append(0)\r\n for j in range(i + 1, 0, -1):\r\n dp[j] = dp[j - 1]\r\n dp[0] = 0\r\n print(dp)\r\ninput()\r\nprint(sum(dp))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bitwise exclusive OR (or bitwise addition modulo two) is a binary operation which is equivalent to applying logical exclusive OR to every pair of bits located on the same positions in binary notation of operands. In other words, a binary digit of the result is equal to 1 if and only if bits on the respective positions in the operands are different.\n\nFor example, if *X*<==<=10910<==<=11011012, *Y*<==<=4110<==<=1010012, then: \n\nWrite a program, which takes two non-negative integers *A* and *B* as an input and finds two non-negative integers *X* and *Y*, which satisfy the following conditions: \n - *A*<==<=*X*<=+<=*Y* - *B* <==<= *X* xor *Y*, where xor is bitwise exclusive or. - *X* is the smallest number among all numbers for which the first two conditions are true.",
"input": "",
"output": "```python\na,b=int(input()),int(input())\r\nif a str:\r\n if len(word) > 10:\r\n ans = word[0] + str(len(word) - 2) + word[-1]\r\n else:\r\n ans = word\r\n return ans\r\n\r\n\r\nnum = int(input())\r\nwhile num != 0:\r\n word = input()\r\n anss = check_word(word)\r\n num -= 1\r\n print(anss)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A long time ago, in a galaxy far far away two giant IT-corporations Pineapple and Gogol continue their fierce competition. Crucial moment is just around the corner: Gogol is ready to release it's new tablet Lastus 3000.\n\nThis new device is equipped with specially designed artificial intelligence (AI). Employees of Pineapple did their best to postpone the release of Lastus 3000 as long as possible. Finally, they found out, that the name of the new artificial intelligence is similar to the name of the phone, that Pineapple released 200 years ago. As all rights on its name belong to Pineapple, they stand on changing the name of Gogol's artificial intelligence.\n\nPineapple insists, that the name of their phone occurs in the name of AI as a substring. Because the name of technology was already printed on all devices, the Gogol's director decided to replace some characters in AI name with \"#\". As this operation is pretty expensive, you should find the minimum number of characters to replace with \"#\", such that the name of AI doesn't contain the name of the phone as a substring.\n\nSubstring is a continuous subsequence of a string.",
"input": "",
"output": "```python\nimport sys\r\n\r\ndef main():\r\n s1 = input()\r\n s2 = input()\r\n print(s1.count(s2))\r\n\r\nmain()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* cities situated along the main road of Berland. Cities are represented by their coordinates — integer numbers *a*1,<=*a*2,<=...,<=*a**n*. All coordinates are pairwise distinct.\n\nIt is possible to get from one city to another only by bus. But all buses and roads are very old, so the Minister of Transport decided to build a new bus route. The Minister doesn't want to spend large amounts of money — he wants to choose two cities in such a way that the distance between them is minimal possible. The distance between two cities is equal to the absolute value of the difference between their coordinates.\n\nIt is possible that there are multiple pairs of cities with minimal possible distance, so the Minister wants to know the quantity of such pairs. \n\nYour task is to write a program that will calculate the minimal possible distance between two pairs of cities and the quantity of pairs which have this distance.",
"input": "",
"output": "```python\nn = int(input())\r\ndist = list(map(int, input().rstrip().split()))\r\ndist.sort()\r\nmin_dist = 10**9\r\ncount = 0\r\nfor i in range(n-1):\r\n\tx = dist[i+1] - dist[i]\r\n\tif x < min_dist:\r\n\t\tmin_dist = x\r\n\t\tcount = 1\r\n\telif x == min_dist:\r\n\t\tcount += 1\r\nprint(min_dist , count)\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "*n* people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next person from the line, and so on. They play until someone wins *k* games in a row. This player becomes the winner.\n\nFor each of the participants, you know the power to play table tennis, and for all players these values are different. In a game the player with greater power always wins. Determine who will be the winner.",
"input": "",
"output": "```python\n# n = number of people\n# k = number of wins in a row\n# p = power of player\n\nn, k = map(int, input().split())\np = list(map(int, input().split()))\n\ncurrent_player_power = p[0]\ncurrent_player_wins = 0\n\nfor i in range(1, n):\n\n if p[i] < current_player_power:\n current_player_wins +=1\n else:\n current_player_power = p[i]\n current_player_wins =1\n\n if current_player_wins == k:\n break\n\nprint(current_player_power)\n \t \t \t\t\t \t \t \t\t \t\t \t \t \t\t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Valera is a little boy. Yesterday he got a huge Math hometask at school, so Valera didn't have enough time to properly learn the English alphabet for his English lesson. Unfortunately, the English teacher decided to have a test on alphabet today. At the test Valera got a square piece of squared paper. The length of the side equals *n* squares (*n* is an odd number) and each unit square contains some small letter of the English alphabet.\n\nValera needs to know if the letters written on the square piece of paper form letter \"X\". Valera's teacher thinks that the letters on the piece of paper form an \"X\", if:\n - on both diagonals of the square paper all letters are the same; - all other squares of the paper (they are not on the diagonals) contain the same letter that is different from the letters on the diagonals. \nHelp Valera, write the program that completes the described task for him.",
"input": "",
"output": "```python\nn = int(input())\r\nli = []\r\nfor _ in range(n):\r\n li.append(input())\r\n#print(li)\r\ncorner = li[0][0]\r\nmiddle = li[0][1]\r\nfor a in range(n):\r\n for b in range(n):\r\n if a==b or a+b == n-1:\r\n if li[a][b] != corner:\r\n #print(0,a,b)\r\n print(\"NO\")\r\n exit()\r\n else:\r\n if li[a][b] != middle:\r\n #print(1,a,b)\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Iahub got bored, so he invented a game to be played on paper. \n\nHe writes *n* integers *a*1,<=*a*2,<=...,<=*a**n*. Each of those integers can be either 0 or 1. He's allowed to do exactly one move: he chooses two indices *i* and *j* (1<=≤<=*i*<=≤<=*j*<=≤<=*n*) and flips all values *a**k* for which their positions are in range [*i*,<=*j*] (that is *i*<=≤<=*k*<=≤<=*j*). Flip the value of *x* means to apply operation *x*<==<=1 - *x*.\n\nThe goal of the game is that after exactly one move to obtain the maximum number of ones. Write a program to solve the little game of Iahub.",
"input": "",
"output": "```python\nimport sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nd = [0 for _ in range(n)]\r\nmx = 0\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n if a[i] == 1:\r\n a[i] = -1\r\n cnt += 1\r\n else:\r\n a[i] = 1\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n d[i] = max(a[i],0)\r\n else:\r\n d[i] = max(d[i-1] + a[i],0)\r\n \r\n mx = max(mx,d[i])\r\n\r\nprint(cnt - 1 if cnt == n else cnt+mx)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have *n* distinct points on a plane, none of them lie on *OY* axis. Check that there is a point after removal of which the remaining points are located on one side of the *OY* axis.",
"input": "",
"output": "```python\n# https://codeforces.com/problemset/problem/900/A\r\n\r\nleft = 0\r\nright = 0\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if x < 0:\r\n left += 1\r\n if x > 0:\r\n right += 1\r\n\r\n if left > 1 and right > 1:\r\n print(\"NO\")\r\n break\r\n\r\nelse:\r\n print(\"YES\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink \"Beecola\", which can be bought in *n* different shops in the city. It's known that the price of one bottle in the shop *i* is equal to *x**i* coins.\n\nVasiliy plans to buy his favorite drink for *q* consecutive days. He knows, that on the *i*-th day he will be able to spent *m**i* coins. Now, for each of the days he want to know in how many different shops he can buy a bottle of \"Beecola\".",
"input": "",
"output": "```python\n# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Nov 13 22:31:05 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\nn = int(input())\r\nbeecola_price = list(map(int, input().split()))\r\nbeecola_price.sort()\r\nq = int(input())\r\n\r\ndef binary_search(arr, target):\r\n left, right = 0, len(arr) - 1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if arr[mid] <= target:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n return left\r\n\r\nfor _ in range(q):\r\n m = int(input())\r\n num = binary_search(beecola_price, m)\r\n print(num)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Roma works in a company that sells TVs. Now he has to prepare a report for the last year.\n\nRoma has got a list of the company's incomes. The list is a sequence that consists of *n* integers. The total income of the company is the sum of all integers in sequence. Roma decided to perform exactly *k* changes of signs of several numbers in the sequence. He can also change the sign of a number one, two or more times.\n\nThe operation of changing a number's sign is the operation of multiplying this number by -1.\n\nHelp Roma perform the changes so as to make the total income of the company (the sum of numbers in the resulting sequence) maximum. Note that Roma should perform exactly *k* changes.",
"input": "",
"output": "```python\nn, k = map(int, input().split())\n\na = list(map(int, input().split()))\n\nfor i in range(n):\n if k > 0 and a[i] < 0:\n k -= 1\n a[i] *= -1\n\na.sort()\n\na[0] *= (-1)**k\nprint(sum(a))\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Vasya went to the supermarket to get some groceries. He walked about the supermarket for a long time and got a basket full of products. Now he needs to choose the cashier to pay for the products.\n\nThere are *n* cashiers at the exit from the supermarket. At the moment the queue for the *i*-th cashier already has *k**i* people. The *j*-th person standing in the queue to the *i*-th cashier has *m**i*,<=*j* items in the basket. Vasya knows that:\n - the cashier needs 5 seconds to scan one item; - after the cashier scans each item of some customer, he needs 15 seconds to take the customer's money and give him the change. \nOf course, Vasya wants to select a queue so that he can leave the supermarket as soon as possible. Help him write a program that displays the minimum number of seconds after which Vasya can get to one of the cashiers.",
"input": "",
"output": "```python\nn=int(input())\r\na=input().split()\r\nb=[int(i) for i in a]\r\nmin1=float('inf')\r\nfor i in range(n):\r\n c=input().split()\r\n d=[int(j) for j in c]\r\n e=[j*5 for j in d]\r\n if sum(e)+len(d)*15 x:\r\n break\r\n if (x % i == 0):\r\n return False\r\n return True\r\n\r\n#?############################################################\r\n\r\n\r\ndef ncr(n, r, p):\r\n num = den = 1\r\n for i in range(r):\r\n num = (num * (n - i)) % p\r\n den = (den * (i + 1)) % p\r\n return (num * pow(den, p - 2, p)) % p\r\n\r\n\r\n#?############################################################\r\n\r\ndef primeFactors(n):\r\n l = []\r\n while n % 2 == 0:\r\n l.append(2)\r\n n = n / 2\r\n for i in range(3, int(math.sqrt(n))+1, 2):\r\n while n % i == 0:\r\n l.append(int(i))\r\n n = n / i\r\n if n > 2:\r\n l.append(n)\r\n return list(set(l))\r\n\r\n\r\n#?############################################################\r\n\r\ndef power(x, y, p):\r\n res = 1\r\n x = x % p\r\n if (x == 0):\r\n return 0\r\n while (y > 0):\r\n if ((y & 1) == 1):\r\n res = (res * x) % p\r\n y = y >> 1\r\n x = (x * x) % p\r\n return res\r\n\r\n#?############################################################\r\n\r\n\r\ndef sieve(n):\r\n prime = [True for i in range(n+1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n+1, p):\r\n prime[i] = False\r\n p += 1\r\n return prime\r\n\r\n\r\n#?############################################################\r\n\r\ndef digits(n):\r\n c = 0\r\n while (n > 0):\r\n n //= 10\r\n c += 1\r\n return c\r\n\r\n#?############################################################\r\n\r\n\r\ndef ceil(n, x):\r\n if (n % x == 0):\r\n return n//x\r\n return n//x+1\r\n\r\n#?############################################################\r\n\r\n\r\ndef mapin():\r\n return map(int, input().split())\r\n\r\n#?############################################################\r\n\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n# python3 15.pyopgf\r\nn, m, x, y = mapin()\r\nl = [[0, 0] for i in range(m)]\r\nfor i in range(n):\r\n dd = input()\r\n l.append([0, 0])\r\n for j in range(m):\r\n if(dd[j] == \".\"):\r\n l[j][0] += 1\r\n else:\r\n l[j][1] += 1\r\n\r\n\r\ndp = [[0, 0] for i in range(m+1)]\r\npb, pw = [0], [0]\r\nfor i in range(m):\r\n pb.append(pb[-1]+l[i][0])\r\n pw.append(pw[-1]+l[i][1])\r\n \r\n\r\ndp = [[float('inf')]*(m+1) for i in range(2)]\r\ndp[0][0] = dp[1][0] = 0\r\nfor i in range(1, m+1):\r\n for j in range(x, y+1):\r\n if i-j >= 0:\r\n dp[0][i] = min(dp[0][i], dp[1][i-j]+pb[i]-pb[i-j])\r\n dp[1][i] = min(dp[1][i], dp[0][i-j]+pw[i]-pw[i-j])\r\nprint(min(dp[0][-1], dp[1][-1]))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* stones on the table in a row, each of them can be red, green or blue. Count the minimum number of stones to take from the table so that any two neighboring stones had different colors. Stones in a row are considered neighboring if there are no other stones between them.",
"input": "",
"output": "```python\n\n# Inicializar un contador para llevar un registro de las piedras que se deben quitar\ncontador = 0\n\n# Recorrer los colores de las piedras\nfor i in range(1, n):\n if s[i] == s[i - 1]:\n contador += 1\n\n# Imprimir la respuesta\nprint(contador)\n\t\t\t\t\t\t\t\t \t\t\t \t\t \t\t\t \t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Alice likes word \"nineteen\" very much. She has a string *s* and wants the string to contain as many such words as possible. For that reason she can rearrange the letters of the string.\n\nFor example, if she has string \"xiineteenppnnnewtnee\", she can get string \"xnineteenppnineteenw\", containing (the occurrences marked) two such words. More formally, word \"nineteen\" occurs in the string the number of times you can read it starting from some letter of the string. Of course, you shouldn't skip letters.\n\nHelp her to find the maximum number of \"nineteen\"s that she can get in her string.",
"input": "",
"output": "```python\ns=input()\r\nprint(min(s.count('i'),s.count('t'),s.count('n')//3,s.count('e')//3))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are quite a lot of ways to have fun with inflatable balloons. For example, you can fill them with water and see what happens.\n\nGrigory and Andrew have the same opinion. So, once upon a time, they went to the shop and bought $n$ packets with inflatable balloons, where $i$-th of them has exactly $a_i$ balloons inside.\n\nThey want to divide the balloons among themselves. In addition, there are several conditions to hold:\n - Do not rip the packets (both Grigory and Andrew should get unbroken packets); - Distribute all packets (every packet should be given to someone); - Give both Grigory and Andrew at least one packet; - To provide more fun, the total number of balloons in Grigory's packets should not be equal to the total number of balloons in Andrew's packets. \nHelp them to divide the balloons or determine that it's impossible under these conditions.",
"input": "",
"output": "```python\nn=int(input())\r\na=list(map(int, input().split()))\r\nm=min(a)\r\nif m*2=0 and (start+i+k) <= n):\r\n valid = True\r\n for j in range(k):\r\n if (mat[x][start+i+j] != 1):\r\n valid = False\r\n if valid:\r\n total+=1\r\n start = x - k+1\r\n for i in range(k):\r\n if ((start+i)>=0 and (start+i+k) <= n):\r\n valid = True\r\n for j in range(k):\r\n if (mat[start+i+j][y] != 1):\r\n valid = False\r\n if valid:\r\n total+=1\r\n return total\r\nstrr = input()\r\nnums = strr.split()\r\nn = int(nums[0])\r\nk = int(nums[1])\r\nmatr = []\r\nfor i in range(n):\r\n lines = input()\r\n line = []\r\n for j in range(n):\r\n if (lines[j] == '#'):\r\n line.append(0)\r\n else:\r\n line.append(1)\r\n matr.append(line)\r\ncell = [1,1]\r\nmaxp = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n pos = possible(i,j,matr)\r\n if (pos > maxp):\r\n maxp = pos\r\n cell = [i+1, j+1]\r\nprint(cell[0], cell[1])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\nc=input()\r\nif len(c)>10:\r\n print(c[1]+(len(c)-2)+c[-1])\r\nelse:\r\n print(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vitaly is a diligent student who never missed a lesson in his five years of studying in the university. He always does his homework on time and passes his exams in time. \n\nDuring the last lesson the teacher has provided two strings *s* and *t* to Vitaly. The strings have the same length, they consist of lowercase English letters, string *s* is lexicographically smaller than string *t*. Vitaly wondered if there is such string that is lexicographically larger than string *s* and at the same is lexicographically smaller than string *t*. This string should also consist of lowercase English letters and have the length equal to the lengths of strings *s* and *t*. \n\nLet's help Vitaly solve this easy problem!",
"input": "",
"output": "```python\ns = input()\r\nt = input()\r\n\r\nn = len(s)\r\n\r\nans = list(s)\r\nfor i in range(n):\r\n c = ans[i] \r\n ans[i] = chr(ord(c) + 1) \r\n a = ''.join(ans) \r\n if(a > s and a < t):\r\n print(a)\r\n break \r\n ans[i] = c \r\nelse:\r\n print(\"No such string\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A burglar got into a matches warehouse and wants to steal as many matches as possible. In the warehouse there are *m* containers, in the *i*-th container there are *a**i* matchboxes, and each matchbox contains *b**i* matches. All the matchboxes are of the same size. The burglar's rucksack can hold *n* matchboxes exactly. Your task is to find out the maximum amount of matches that a burglar can carry away. He has no time to rearrange matches in the matchboxes, that's why he just chooses not more than *n* matchboxes so that the total amount of matches in them is maximal.",
"input": "",
"output": "```python\nn, m = map(int, input().split())\r\nnum = []\r\nfor _ in range(m):\r\n num.append(list(reversed(list(map(int, input().split())))))\r\nnum.sort(reverse=True)\r\n\r\n# print(num)\r\nsum = 0\r\nfor i in range(len(num)):\r\n for x in range(num[i][1]):\r\n if n == 0: break\r\n else:\r\n sum += num[i][0]\r\n n -= 1\r\n\r\nprint(sum)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Innokentiy decides to change the password in the social net \"Contact!\", but he is too lazy to invent a new password by himself. That is why he needs your help. \n\nInnokentiy decides that new password should satisfy the following conditions:\n - the length of the password must be equal to *n*, - the password should consist only of lowercase Latin letters, - the number of distinct symbols in the password must be equal to *k*, - any two consecutive symbols in the password must be distinct. \nYour task is to help Innokentiy and to invent a new password which will satisfy all given conditions.",
"input": "",
"output": "```python\na = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\nn,k = map(int, input().split())\r\npassword = \"\"\r\na = a[:k]\r\n\r\nwhile len(a) < n:\r\n\ta = a+a[:1]\r\n\r\nprint(a[:n])\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Xenia the mathematician has a sequence consisting of *n* (*n* is divisible by 3) positive integers, each of them is at most 7. She wants to split the sequence into groups of three so that for each group of three *a*,<=*b*,<=*c* the following conditions held:\n - *a*<=<<=*b*<=<<=*c*; - *a* divides *b*, *b* divides *c*. \nNaturally, Xenia wants each element of the sequence to belong to exactly one group of three. Thus, if the required partition exists, then it has groups of three.\n\nHelp Xenia, find the required partition or else say that it doesn't exist.",
"input": "",
"output": "```python\ndef solve(ans):\r\n #print(ans)\r\n for l in ans:\r\n for i in range(len(l) - 1):\r\n if (l[i] >= l[i + 1] or l[i + 1] % l[i] != 0):\r\n return 0\r\n return 1\r\nn = int(input())\r\na = list(map(int,input().split()))\r\njump = n//3\r\nans=[]\r\na.sort()\r\n#print(a)\r\nfor i in range(n//3):\r\n tem=[]\r\n for j in range(i,n,jump):\r\n tem.append(a[j])\r\n ans.append(tem)\r\nf=solve(ans)\r\nif(f==0):\r\n print(-1)\r\nelse:\r\n for i in ans:\r\n print(*i)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vitya has just started learning Berlanese language. It is known that Berlanese uses the Latin alphabet. Vowel letters are \"a\", \"o\", \"u\", \"i\", and \"e\". Other letters are consonant.\n\nIn Berlanese, there has to be a vowel after every consonant, but there can be any letter after any vowel. The only exception is a consonant \"n\"; after this letter, there can be any letter (not only a vowel) or there can be no letter at all. For example, the words \"harakiri\", \"yupie\", \"man\", and \"nbo\" are Berlanese while the words \"horse\", \"king\", \"my\", and \"nz\" are not.\n\nHelp Vitya find out if a word $s$ is Berlanese.",
"input": "",
"output": "```python\ns=input()+''\r\noutput='YES'\r\nt='aeiou'\r\nn=len(s)\r\nfor i in range(n-1):\r\n if s[i] not in t+'n' and s[i+1] not in t:\r\n output='NO'\r\n break\r\nprint(output)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Eleven wants to choose a new name for herself. As a bunch of geeks, her friends suggested an algorithm to choose a name for her. Eleven wants her name to have exactly *n* characters. \n\nHer friend suggested that her name should only consist of uppercase and lowercase letters 'O'. More precisely, they suggested that the *i*-th letter of her name should be 'O' (uppercase) if *i* is a member of Fibonacci sequence, and 'o' (lowercase) otherwise. The letters in the name are numbered from 1 to *n*. Fibonacci sequence is the sequence *f* where\n - *f*1<==<=1, - *f*2<==<=1, - *f**n*<==<=*f**n*<=-<=2<=+<=*f**n*<=-<=1 (*n*<=><=2). \nAs her friends are too young to know what Fibonacci sequence is, they asked you to help Eleven determine her new name.",
"input": "",
"output": "```python\nn = int(input())\r\na = 1\r\nb = 1\r\nc = [1, 1]\r\nwhile a < n and b < n:\r\n a = a+b\r\n c.append(a)\r\n b = a+b\r\n c.append(b)\r\nd = []\r\nfor i in range(1, n+1):\r\n if i in c:\r\n d.append('O')\r\n else:\r\n d.append('o')\r\nprint(''.join(d))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Leha somehow found an array consisting of *n* integers. Looking at it, he came up with a task. Two players play the game on the array. Players move one by one. The first player can choose for his move a subsegment of non-zero length with an odd sum of numbers and remove it from the array, after that the remaining parts are glued together into one array and the game continues. The second player can choose a subsegment of non-zero length with an even sum and remove it. Loses the one who can not make a move. Who will win if both play optimally?",
"input": "",
"output": "```python\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n if a[i]%2==1:c+=1\r\n if c>0:break\r\nif c>0:print('First')\r\nelse:print('Second')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Having watched the last Harry Potter film, little Gerald also decided to practice magic. He found in his father's magical book a spell that turns any number in the sum of its digits. At the moment Gerald learned that, he came across a number *n*. How many times can Gerald put a spell on it until the number becomes one-digit?",
"input": "",
"output": "```python\nnum=input()\r\nnumOfTran=0\r\nwhile len(num) > 1 :\r\n sumDig=0\r\n for curr in num :\r\n sumDig+=int(curr)\r\n numOfTran+=1\r\n num=str(sumDig)\r\n \r\nprint(numOfTran)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Luke Skywalker gave Chewbacca an integer number *x*. Chewbacca isn't good at numbers but he loves inverting digits in them. Inverting digit *t* means replacing it with digit 9<=-<=*t*. \n\nHelp Chewbacca to transform the initial number *x* to the minimum possible positive number by inverting some (possibly, zero) digits. The decimal representation of the final number shouldn't start with a zero.",
"input": "",
"output": "```python\nx = input()\r\nl = []\r\nfor i in str(x):\r\n l.append(int(i))\r\n\r\n\r\nfor i in range(len(l)):\r\n \r\n a=9-l[i]\r\n if(a 0:\n two_count += next_number.two_count\n five_count += next_number.five_count\n number_counts[next_number.number] -= 1\n taken += 1\n\n print(min(two_count, five_count))\n\n\ndef cmp_to_key(mycmp):\n class K:\n def __init__(self, obj, *args):\n self.obj = obj\n\n def __lt__(self, other):\n return mycmp(self.obj, other.obj) < 0\n\n def __gt__(self, other):\n return mycmp(self.obj, other.obj) > 0\n\n def __eq__(self, other):\n return mycmp(self.obj, other.obj) == 0\n\n def __le__(self, other):\n return mycmp(self.obj, other.obj) <= 0\n\n def __ge__(self, other):\n return mycmp(self.obj, other.obj) >= 0\n\n def __ne__(self, other):\n return mycmp(self.obj, other.obj) != 0\n\n return K\n\n\ndef two_first_comparator(product_count_1, product_count_2):\n if product_count_1.two_count < product_count_2.two_count:\n return -1\n if product_count_1.two_count > product_count_2.two_count:\n return 1\n if product_count_1.five_count < product_count_2.five_count:\n return -1\n if product_count_1.five_count > product_count_2.five_count:\n return 1\n return 0\n\n\ndef five_first_comparator(product_count_1, product_count_2):\n if product_count_1.five_count < product_count_2.five_count:\n return -1\n if product_count_1.five_count > product_count_2.five_count:\n return 1\n if product_count_1.two_count < product_count_2.two_count:\n return -1\n if product_count_1.two_count > product_count_2.two_count:\n return 1\n return 0\n\n\ndef get_product_count(number):\n two_count = calculate_product_count(number, 2)\n five_count = calculate_product_count(number, 5)\n\n return ProductCount(two_count, five_count, number)\n\n\ndef calculate_product_count(number, base):\n product_count = 0\n while number % base == 0:\n product_count += 1\n number //= base\n\n return product_count\n\n\nclass ProductCount(object):\n def __init__(self, two_count, five_count, number):\n self.two_count = two_count\n self.five_count = five_count\n self.number = number\n\n\nif __name__ == '__main__':\n main()\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After winning gold and silver in IOI 2014, Akshat and Malvika want to have some fun. Now they are playing a game on a grid made of *n* horizontal and *m* vertical sticks.\n\nAn intersection point is any point on the grid which is formed by the intersection of one horizontal stick and one vertical stick.\n\nIn the grid shown below, *n*<==<=3 and *m*<==<=3. There are *n*<=+<=*m*<==<=6 sticks in total (horizontal sticks are shown in red and vertical sticks are shown in green). There are *n*·*m*<==<=9 intersection points, numbered from 1 to 9.\n\nThe rules of the game are very simple. The players move in turns. Akshat won gold, so he makes the first move. During his/her move, a player must choose any remaining intersection point and remove from the grid all sticks which pass through this point. A player will lose the game if he/she cannot make a move (i.e. there are no intersection points remaining on the grid at his/her move).\n\nAssume that both players play optimally. Who will win the game?",
"input": "",
"output": "```python\nn , m = [int(i) for i in input().split()]\r\nif n == 1 and m == 1 :\r\n total = n + m\r\nelif n == 1 or m == 1:\r\n total = n + m - 1\r\nelse:\r\n total = n + m\r\nif int(total / 2) % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number *n*. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that *n* is the answer to the arithmetic task for first-graders. In the textbook, a certain positive integer *x* was given. The task was to add *x* to the sum of the digits of the number *x* written in decimal numeral system.\n\nSince the number *n* on the board was small, Vova quickly guessed which *x* could be in the textbook. Now he wants to get a program which will search for arbitrary values of the number *n* for all suitable values of *x* or determine that such *x* does not exist. Write such a program for Vova.",
"input": "",
"output": "```python\n'''\n http://codeforces.com/problemset/problem/875/A \n'''\n\nvalue = int(input())\n\ndef display(lst):\n\tfor item in lst.sort():\n\t\tprint(item)\n\ndef sum_a_string(str_digit):\n\tresult = 0\n\tfor i in str_digit:\n\t\tresult+=int(i)\n\treturn result\n\n\ndef get_sum(value):\n\tcount = 0\n\tpossible_digits = []\n\tfor num in range(value+1):\n\t\tnum = str(num)\n\t\tresult = int(num) + sum_a_string(num)\n\t\tif result == value:\n\t\t\tcount += 1\n\t\t\tpossible_digits.append(int(num))\n\tprint(count)\n\treturn display(possible_digits)\n\nget_sum(value)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In this problem you will have to deal with a real algorithm that is used in the VK social network.\n\nAs in any other company that creates high-loaded websites, the VK developers have to deal with request statistics regularly. An important indicator reflecting the load of the site is the mean number of requests for a certain period of time of *T* seconds (for example, *T*<==<=60 *seconds*<==<=1 *min* and *T*<==<=86400 *seconds*<==<=1 *day*). For example, if this value drops dramatically, that shows that the site has access problem. If this value grows, that may be a reason to analyze the cause for the growth and add more servers to the website if it is really needed.\n\nHowever, even such a natural problem as counting the mean number of queries for some period of time can be a challenge when you process the amount of data of a huge social network. That's why the developers have to use original techniques to solve problems approximately, but more effectively at the same time.\n\nLet's consider the following formal model. We have a service that works for *n* seconds. We know the number of queries to this resource *a**t* at each moment of time *t* (1<=≤<=*t*<=≤<=*n*). Let's formulate the following algorithm of calculating the mean with exponential decay. Let *c* be some real number, strictly larger than one.\n\nThus, the mean variable is recalculated each second using the number of queries that came at that second. We can make some mathematical calculations and prove that choosing the value of constant *c* correctly will make the value of mean not very different from the real mean value *a**x* at *t*<=-<=*T*<=+<=1<=≤<=*x*<=≤<=*t*. \n\nThe advantage of such approach is that it only uses the number of requests at the current moment of time and doesn't require storing the history of requests for a large time range. Also, it considers the recent values with the weight larger than the weight of the old ones, which helps to react to dramatic change in values quicker.\n\nHowever before using the new theoretical approach in industrial programming, there is an obligatory step to make, that is, to test its credibility practically on given test data sets. Your task is to compare the data obtained as a result of the work of an approximate algorithm to the real data. \n\nYou are given *n* values *a**t*, integer *T* and real number *c*. Also, you are given *m* moments *p**j* (1<=≤<=*j*<=≤<=*m*), where we are interested in the mean value of the number of queries for the last *T* seconds. Implement two algorithms. The first one should calculate the required value by definition, i.e. by the formula . The second algorithm should calculate the mean value as is described above. Print both values and calculate the relative error of the second algorithm by the formula , where *approx* is the approximate value, obtained by the second algorithm, and *real* is the exact value obtained by the first algorithm.",
"input": "",
"output": "```python\nn,T,c=map(float,input().split())\r\n#n=int(n)\r\n#T=int(T)\r\na=list(map(int,input().split()))\r\nm=int(input())\r\np=list(map(int,input().split()))\r\nreal=0\r\nsumm=0\r\nfor i in range(m):\r\n mean=0\r\n for j in range(p[i]):\r\n mean=(mean+a[j]/T)/c\r\n\r\n k=p[i]-int(T)\r\n if k<0:\r\n k=0\r\n summ=sum(a[k:(p[i])])\r\n real=float(summ)/T\r\n print('{:.6}'.format(real),'{:.6}'.format(float(mean)),'{:.6}'.format(float(abs(mean-real)/real)))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "An elephant decided to visit his friend. It turned out that the elephant's house is located at point 0 and his friend's house is located at point *x*(*x*<=><=0) of the coordinate line. In one step the elephant can move 1, 2, 3, 4 or 5 positions forward. Determine, what is the minimum number of steps he need to make in order to get to his friend's house.",
"input": "",
"output": "```python\na=input()\r\nb=int((a/5)+1)\r\nc=int(a/5)\r\nif a<5:\r\n print(1)\r\nelif a//5==0:\r\n print(c)\r\nelse:\r\n print(b)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a straight snowy road, divided into *n* blocks. The blocks are numbered from 1 to *n* from left to right. If one moves from the *i*-th block to the (*i*<=+<=1)-th block, he will leave a right footprint on the *i*-th block. Similarly, if one moves from the *i*-th block to the (*i*<=-<=1)-th block, he will leave a left footprint on the *i*-th block. If there already is a footprint on the *i*-th block, the new footprint will cover the old one.\n\nAt the beginning, there were no footprints. Then polar bear Alice starts from the *s*-th block, makes a sequence of moves and ends in the *t*-th block. It is known that Alice never moves outside of the road. \n\nYou are given the description of Alice's footprints. Your task is to find a pair of possible values of *s*,<=*t* by looking at the footprints.",
"input": "",
"output": "```python\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\nif 'R' in s:\r\n if 'L' in s:\r\n print(s.index('R')+1, s.index('L'))\r\n else:\r\n print(s.index('R')+1, s.rindex('R') + 2)\r\nelse:\r\n print(s.rindex('L')+1, s.index('L'))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.\n\nHe wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence corners at a single angle *a*.\n\nWill the robot be able to build the fence Emuskald wants? In other words, is there a regular polygon which angles are equal to *a*?",
"input": "",
"output": "```python\n#include \r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n int t, a;\r\n cin >> t;\r\n while (t--)\r\n {\r\n cin >> a;\r\n if (360 % (180 - a) == 0)\r\n {\r\n cout << \"YES\" << endl;\r\n }\r\n else\r\n {\r\n cout << \"NO\" << endl;\r\n }\r\n }\r\n return 0;\r\n}\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Arpa is taking a geometry exam. Here is the last problem of the exam.\n\nYou are given three points *a*,<=*b*,<=*c*.\n\nFind a point and an angle such that if we rotate the page around the point by the angle, the new position of *a* is the same as the old position of *b*, and the new position of *b* is the same as the old position of *c*.\n\nArpa is doubting if the problem has a solution or not (i.e. if there exists a point and an angle satisfying the condition). Help Arpa determine if the question has a solution or not.",
"input": "",
"output": "```python\ndef vector_product(v1x, v1y, v2x, v2y):\r\n return (v1x * v2y - v1y * v2x)\r\n\r\ndef len_sq(vx, vy):\r\n return (vx * vx + vy * vy)\r\n \r\nax, ay, bx, by, cx, cy = (int(x) for x in input().split())\r\nabx = bx - ax\r\naby = by - ay\r\nbcx = cx - bx\r\nbcy = cy - by\r\nif vector_product(abx, aby, bcx, bcy) == 0:\r\n print('No')\r\nelif len_sq(abx, aby) != len_sq(bcx, bcy):\r\n print('No')\r\nelse:\r\n print('Yes')\r\n\r\n\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Xenia lives in a city that has *n* houses built along the main ringroad. The ringroad houses are numbered 1 through *n* in the clockwise order. The ringroad traffic is one way and also is clockwise.\n\nXenia has recently moved into the ringroad house number 1. As a result, she's got *m* things to do. In order to complete the *i*-th task, she needs to be in the house number *a**i* and complete all tasks with numbers less than *i*. Initially, Xenia is in the house number 1, find the minimum time she needs to complete all her tasks if moving from a house to a neighboring one along the ringroad takes one unit of time.",
"input": "",
"output": "```python\n# Función para calcular el tiempo necesario para una tarea especÃfica\r\ndef calcular_tiempo_para_tarea(posicion_actual, tarea, n):\r\n distancia = tarea - posicion_actual\r\n\r\n if distancia >= 0:\r\n tiempo_necesario = distancia\r\n else:\r\n tiempo_necesario = n + distancia\r\n\r\n return tiempo_necesario\r\n\r\n# Lectura de la entrada\r\nn, m = map(int, input().split())\r\ntareas = list(map(int, input().split()))\r\n\r\n# Inicialización de variables\r\nposicion_actual = 1\r\ntiempo_total = 0\r\n\r\n# Procesamiento de las tareas\r\nfor tarea in tareas:\r\n tiempo_para_tarea_actual = calcular_tiempo_para_tarea(posicion_actual, tarea, n)\r\n tiempo_total += tiempo_para_tarea_actual\r\n posicion_actual = tarea\r\n\r\n# Imprimir el resultado\r\nprint(tiempo_total)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A country has *n* cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants those roads to be constructed in such a way that it is possible to go from each city to any other city by traversing at most two roads. You are also given *m* pairs of cities — roads cannot be constructed between these pairs of cities.\n\nYour task is to construct the minimum number of roads that still satisfy the above conditions. The constraints will guarantee that this is always possible.",
"input": "",
"output": "```python\nn, m = map(int, input().split())\r\nmassa = []\r\nx = 0\r\ny = 0\r\nz = 0\r\nfor i in range ( m ):\r\n x, y = map(int, input().split())\r\n if not( x in massa ):\r\n massa.append( x )\r\n if not ( y in massa ):\r\n massa.append ( x )\r\nfor i in range( 1, ( n + 1 )):\r\n if not ( i in massa ):\r\n z = i\r\n break\r\nprint( n - 1 )\r\nfor i in range( 1, ( n + 1 )):\r\n if ( i != z ):\r\n print ( z , i )\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A prime number is a number which has exactly two distinct divisors: one and itself. For example, numbers 2, 7, 3 are prime, and 1, 6, 4 are not.\n\nThe next prime number after *x* is the smallest prime number greater than *x*. For example, the next prime number after 2 is 3, and the next prime number after 3 is 5. Note that there is exactly one next prime number after each number. So 5 is not the next prime number for 2.\n\nOne cold April morning Panoramix predicted that soon Kakofonix will break free from his straitjacket, and this will be a black day for the residents of the Gallic countryside.\n\nPanoramix's prophecy tells that if some day Asterix and Obelix beat exactly *x* Roman soldiers, where *x* is a prime number, and next day they beat exactly *y* Roman soldiers, where *y* is the next prime number after *x*, then it's time to wait for Armageddon, for nothing can shut Kakofonix up while he sings his infernal song.\n\nYesterday the Gauls beat *n* Roman soldiers and it turned out that the number *n* was prime! Today their victims were a troop of *m* Romans (*m*<=><=*n*). Determine whether the Gauls should wait for the black day after today's victory of Asterix and Obelix?",
"input": "",
"output": "```python\nn, m = map(int, input().split())\r\nwhile n <= m:\r\n n += 1\r\n count = 0\r\n for i in range(1, n+1):\r\n if n % i == 0:\r\n count += 1\r\n if count == 2 and n == m:\r\n print(\"YES\")\r\n break\r\n elif count == 2 and n != m:\r\n print(\"NO\")\r\n break\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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 number of balloons of each color?\n\nYour task is to write a program that for given values *r*, *g* and *b* will find the maximum number *t* of tables, that can be decorated in the required manner.",
"input": "",
"output": "```python\na,b,c = sorted(list(map(int,input().split())))\r\nscore = 0 \r\nwhile a>0 or b>0:\r\n if a!=0 and c>b+1:\r\n x = 2*a \r\n a = 0 \r\n y = c-b\r\n c = c-b+y%2 \r\n if y>=x:\r\n score+=x//2\r\n y = y-x \r\n c+=y \r\n else:\r\n score +=y//2\r\n a = x//2-y//2 \r\n elif a!=0 and c<=b+1:\r\n score+=a \r\n \r\n b = b-a\r\n c = c-a \r\n a = 0\r\n elif a==0:\r\n score+= min(b,c//2)\r\n b = 0 \r\n else:\r\n break \r\n \r\nprint(score)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A has a string consisting of some number of lowercase English letters 'a'. He gives it to his friend B who appends some number of letters 'b' to the end of this string. Since both A and B like the characters 'a' and 'b', they have made sure that at this point, at least one 'a' and one 'b' exist in the string.\n\nB now gives this string to C and he appends some number of letters 'c' to the end of the string. However, since C is a good friend of A and B, the number of letters 'c' he appends is equal to the number of 'a' or to the number of 'b' in the string. It is also possible that the number of letters 'c' equals both to the number of letters 'a' and to the number of letters 'b' at the same time.\n\nYou have a string in your hands, and you want to check if it is possible to obtain the string in this way or not. If it is possible to obtain the string, print \"YES\", otherwise print \"NO\" (without the quotes).",
"input": "",
"output": "```python\ns=input().strip()\r\na_count=s.count('a')\r\nb_count=s.count('b')\r\nc_count=s.count('c')\r\narr=list(s)\r\narr1=arr.copy()\r\narr1.sort()\r\nif a_count>0 and b_count>0 and (a_count==c_count or b_count==c_count) and arr==arr1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Permutation *p* is an ordered set of integers *p*1,<=<=*p*2,<=<=...,<=<=*p**n*, consisting of *n* distinct positive integers, each of them doesn't exceed *n*. We'll denote the *i*-th element of permutation *p* as *p**i*. We'll call number *n* the size or the length of permutation *p*1,<=<=*p*2,<=<=...,<=<=*p**n*.\n\nThe decreasing coefficient of permutation *p*1,<=*p*2,<=...,<=*p**n* is the number of such *i* (1<=≤<=*i*<=<<=*n*), that *p**i*<=><=*p**i*<=+<=1.\n\nYou have numbers *n* and *k*. Your task is to print the permutation of length *n* with decreasing coefficient *k*.",
"input": "",
"output": "```python\nn, k = map(int, input().split())\r\n\r\nif k == 0:\r\n lst1 = []\r\n for b in range(1, n+1):\r\n lst1.append(b)\r\n res1 = [str(r) for r in lst1]\r\n print(' '.join(res1))\r\nelse:\r\n lst = []\r\n for x in range(k):\r\n lst.append(n - x)\r\n for y in range(k, n):\r\n lst.append(y - k + 1)\r\n res = [str(b) for b in lst]\r\n print(' '.join(res))\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sereja loves number sequences very much. That's why he decided to make himself a new one following a certain algorithm.\n\nSereja takes a blank piece of paper. Then he starts writing out the sequence in *m* stages. Each time he either adds a new number to the end of the sequence or takes *l* first elements of the current sequence and adds them *c* times to the end. More formally, if we represent the current sequence as *a*1,<=*a*2,<=...,<=*a**n*, then after we apply the described operation, the sequence transforms into *a*1,<=*a*2,<=...,<=*a**n*[,<=*a*1,<=*a*2,<=...,<=*a**l*] (the block in the square brackets must be repeated *c* times). \n\nA day has passed and Sereja has completed the sequence. He wonders what are the values of some of its elements. Help Sereja.",
"input": "",
"output": "```python\nn,k=map(int,input().split(\" \"))\r\nli=list(map(int,input().split(\" \",n)[:n]))\r\nhs=[[0 for i in range(k)] for i in range(n//k)]\r\nfor i in range(n//k):\r\n for j in range(k):\r\n hs[i][j]=li[i+j]\r\nans=0\r\nfor i in range(k):\r\n for j in range(n//k):\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\ns=input()\r\nupp=0\r\nlow=0\r\nfor i in range(len(s)):\r\n if 'a'<=s[i]<='z':\r\n low+=1\r\n else:\r\n upp+=1\r\nif low \nif nums == sorted_ascend:\n print('yes')\n print('1 1')\nelif sorted_ascend[::-1] == nums:\n print(1, n)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two players are playing a game. First each of them writes an integer from 1 to 6, and then a dice is thrown. The player whose written number got closer to the number on the dice wins. If both payers have the same difference, it's a draw.\n\nThe first player wrote number *a*, the second player wrote number *b*. How many ways to throw a dice are there, at which the first player wins, or there is a draw, or the second player wins?",
"input": "",
"output": "```python\na,b=map(int,input().split())\r\nwin,draw,lose=0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i)n_2:\r\n print(a)\r\nelse:\r\n print(b)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink \"Beecola\", which can be bought in *n* different shops in the city. It's known that the price of one bottle in the shop *i* is equal to *x**i* coins.\n\nVasiliy plans to buy his favorite drink for *q* consecutive days. He knows, that on the *i*-th day he will be able to spent *m**i* coins. Now, for each of the days he want to know in how many different shops he can buy a bottle of \"Beecola\".",
"input": "",
"output": "```python\nn = int(input())\nx = sorted(list(map(int, input().split())))\nq = int(input())\nfor _ in range(q):\n k = int(input())\n l, r = 0, len(x)-1\n while l <= r:\n m = (l+r) // 2\n if x[m] > k:\n r = m - 1\n elif x[m] < k:\n l = m + 1\n elif x[m] == k:\n print(m+1)\n break\n else:\n print(m)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word *s*. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word *s*.",
"input": "",
"output": "```python\nneed = \"hello\"\r\nj = 0\r\nfor i in input():\r\n\tif i == need[j]:\r\n\t\tj += 1\r\n\tif j == len(need):\r\n\t\tbreak\r\n\t\t\r\nprint(\"YES\" if j == len(need) else \"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ternary numeric notation is quite popular in Berland. To telegraph the ternary number the Borze alphabet is used. Digit 0 is transmitted as «.», 1 as «-.» and 2 as «--». You are to decode the Borze code, i.e. to find out the ternary number given its representation in Borze alphabet.",
"input": "",
"output": "```python\ns = input(\"this is input\")\r\n\r\nund = False\r\n\r\nfor x in s:\r\n if x == '-' and not und:\r\n und = True\r\n \r\n elif und and x == '-':\r\n und = False\r\n print(\"2\", end='')\r\n elif und and x == '.':\r\n print('1', end='')\r\n und = False\r\n else:\r\n print('0', end='')\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word *s*. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word *s*.",
"input": "",
"output": "```python\nword = input()\r\nindexh = word.rindex(\"h\")\r\nindexe = word.rindex(\"e\")\r\nindexl1 = indexe + word[indexe:].find(\"l\")\r\nindexl2 = word.rindex(\"l\")\r\nindexo = word.rindex(\"o\")\r\n\r\nif indexh < indexe and indexe < indexl1 and indexl1=2 and y ==10:\r\n for i in range((x)):\r\n print('1',end=\"\")\r\n print(0)\r\nelse:\r\n for i in range((x)):\r\n print(y,end=\"\") \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\ndef check():\r\n word = input()\r\n if len(word) > 10:\r\n word = word[0] + str(len(word) - 2) + word[len(word)-1]\r\n return word\r\n\r\nn = int(input())\r\na = []\r\nfor _ in range(n):\r\n a.append(check())\r\n\r\nprint(\"\\n\".join(a))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Andrewid the Android is a galaxy-famous detective. In his free time he likes to think about strings containing zeros and ones.\n\nOnce he thought about a string of length *n* consisting of zeroes and ones. Consider the following operation: we choose any two adjacent positions in the string, and if one them contains 0, and the other contains 1, then we are allowed to remove these two digits from the string, obtaining a string of length *n*<=-<=2 as a result.\n\nNow Andreid thinks about what is the minimum length of the string that can remain after applying the described operation several times (possibly, zero)? Help him to calculate this number.",
"input": "",
"output": "```python\ns = input.split()[1]\r\n\r\nwhile '01' in s or '10' in s:\r\n if '01' in s:\r\n i = s.index('01')\r\n else:\r\n i = s.index('10')\r\n s = s[:i] + s[i+2:]\r\n\r\nprint(len(s))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You've got a 5<=×<=5 matrix, consisting of 24 zeroes and a single number one. Let's index the matrix rows by numbers from 1 to 5 from top to bottom, let's index the matrix columns by numbers from 1 to 5 from left to right. In one move, you are allowed to apply one of the two following transformations to the matrix:\n 1. Swap two neighboring matrix rows, that is, rows with indexes *i* and *i*<=+<=1 for some integer *i* (1<=≤<=*i*<=<<=5). 1. Swap two neighboring matrix columns, that is, columns with indexes *j* and *j*<=+<=1 for some integer *j* (1<=≤<=*j*<=<<=5). \nYou think that a matrix looks beautiful, if the single number one of the matrix is located in its middle (in the cell that is on the intersection of the third row and the third column). Count the minimum number of moves needed to make the matrix beautiful.",
"input": "",
"output": "```python\narray = []\nfor j in range(5):\n x = [int(i)for i in input().split()]\n array.append(x)\n\nfor x in range(5):\n for y in range(5):\n if array[x][y] == 1:\n print(abs(x - 2) + abs(y - 2))\n\t \t\t\t\t\t \t \t\t \t\t \t \t\t\t\t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mike and some bears are playing a game just for fun. Mike is the judge. All bears except Mike are standing in an *n*<=×<=*m* grid, there's exactly one bear in each cell. We denote the bear standing in column number *j* of row number *i* by (*i*,<=*j*). Mike's hands are on his ears (since he's the judge) and each bear standing in the grid has hands either on his mouth or his eyes.\n\nThey play for *q* rounds. In each round, Mike chooses a bear (*i*,<=*j*) and tells him to change his state i. e. if his hands are on his mouth, then he'll put his hands on his eyes or he'll put his hands on his mouth otherwise. After that, Mike wants to know the score of the bears.\n\nScore of the bears is the maximum over all rows of number of consecutive bears with hands on their eyes in that row.\n\nSince bears are lazy, Mike asked you for help. For each round, tell him the score of these bears after changing the state of a bear selected in that round.",
"input": "",
"output": "```python\nimport re\n\ndef maxString(a,n):\n\ty = 0\n\tfor i in range(n):\n\t\ts2 = ''.join(a[i])\n\t\tif '1' not in s2:\n\t\t\tr = 0\n\t\telse:\n\t\t\tr = len(max(re.findall(\"1+\",s2),key=len))\n\t\tif(r > y):\n\t\t\ty = r\n\treturn y\n\ndef flip(x):\n\tif(x == '1'):\n\t\treturn '0'\n\telse:\n\t\treturn '1'\n\nn,m,q = map(int,input().split())\n\na = []\nx = []\n\nfor i in range(n):\n\tx = list(input().split())\n\ta.append(x)\n\n#y = maxString(a,n)\n\n#print('y =',y)\n\nfor i in range(q):\n\tp,q = map(int,input().split())\n\ta[p-1][q-1] = flip(a[p-1][q-1])\n\tprint(maxString(a,n))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock.\n\nThe combination lock is represented by *n* rotating disks with digits from 0 to 9 written on them. Scrooge McDuck has to turn some disks so that the combination of digits on the disks forms a secret combination. In one move, he can rotate one disk one digit forwards or backwards. In particular, in one move he can go from digit 0 to digit 9 and vice versa. What minimum number of actions does he need for that?",
"input": "",
"output": "```python\nn = input()\r\nstart_pos = input()\r\nopen_pos = input()\r\n\r\ncounter = 0\r\nfor i, j in zip(start_pos, open_pos):\r\n i, j = int(i), int(j)\r\n count_pos = 0\r\n if i == j:\r\n continue\r\n elif i < j:\r\n while i < j:\r\n i += 1\r\n count_pos += 1\r\n else:\r\n while i > j:\r\n i -= 1\r\n count_pos += 1\r\n \r\n if count_pos > 5:\r\n count_pos = 10 - count_pos\r\n\r\n counter += count_pos\r\n\r\nprint(counter)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Let us define two functions *f* and *g* on positive integer numbers. \n\n \n\nYou need to process *Q* queries. In each query, you will be given three integers *l*, *r* and *k*. You need to print the number of integers *x* between *l* and *r* inclusive, such that *g*(*x*)<==<=*k*.",
"input": "",
"output": "```python\ndef muli(n):\r\n x = 1\r\n for i in range(len(n)):\r\n if(n[i]=='0'):\r\n continue\r\n x = x*(int(n[i]))\r\n return (x)\r\n \r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n l,r,k = input().split(\" \")\r\n count = 0\r\n for j in range(int(l),int(r)+1):\r\n x = j\r\n while(x>=10):\r\n x = muli(str(x))\r\n if(x == int(k)):\r\n count+=1\r\n print (count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Today on a math lesson the teacher told Vovochka that the Euler function of a positive integer φ(*n*) is an arithmetic function that counts the positive integers less than or equal to n that are relatively prime to n. The number 1 is coprime to all the positive integers and φ(1)<==<=1.\n\nNow the teacher gave Vovochka an array of *n* positive integers *a*1,<=*a*2,<=...,<=*a**n* and a task to process *q* queries *l**i* *r**i* — to calculate and print modulo 109<=+<=7. As it is too hard for a second grade school student, you've decided to help Vovochka.",
"input": "",
"output": "```python\nprint(\"_RANDOM_GUESS_1689429994.5419617\")# 1689429994.5419815\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "People in the Tomskaya region like magic formulas very much. You can see some of them below.\n\nImagine you are given a sequence of positive integer numbers *p*1, *p*2, ..., *p**n*. Lets write down some magic formulas:\n\nHere, \"mod\" means the operation of taking the residue after dividing.\n\nThe expression means applying the bitwise *xor* (excluding \"OR\") operation to integers *x* and *y*. The given operation exists in all modern programming languages. For example, in languages C++ and Java it is represented by \"^\", in Pascal — by \"xor\".\n\nPeople in the Tomskaya region like magic formulas very much, but they don't like to calculate them! Therefore you are given the sequence *p*, calculate the value of *Q*.",
"input": "",
"output": "```python\nn=int(input())\r\n\r\nL=list(map(int,input().split()))\r\nQ=0\r\n\r\nX=[0]*1000001\r\n\r\nfor i in range(1,1000001):\r\n X[i]=X[i-1]^i\r\n\r\nfor i in range(1,n+1):\r\n Q^=L[i-1]\r\n x=n%i\r\n y=n//i\r\n if(y%2==1):\r\n Q^=X[i-1]\r\n Q^=X[x]\r\nprint(Q)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) reversely. For example, a Berlandish word code corresponds to a Birlandish word edoc. However, it's easy to make a mistake during the «translation». Vasya translated word *s* from Berlandish into Birlandish as *t*. Help him: find out if he translated the word correctly.",
"input": "",
"output": "```python\nlang1=input()\r\nlang2=input()\r\ndef reverse(st):\r\n i=0\r\n j=len(st)-1\r\n st=list(st)\r\n while(i0:\r\n if math.sqrt(i)**2 != i:\r\n print(i)\r\n break\r\n else:\r\n print(i)\r\n break\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sereja has an *n*<=×<=*m* rectangular table *a*, each cell of the table contains a zero or a number one. Sereja wants his table to meet the following requirement: each connected component of the same values forms a rectangle with sides parallel to the sides of the table. Rectangles should be filled with cells, that is, if a component form a rectangle of size *h*<=×<=*w*, then the component must contain exactly *hw* cells.\n\nA connected component of the same values is a set of cells of the table that meet the following conditions:\n - every two cells of the set have the same value; - the cells of the set form a connected region on the table (two cells are connected if they are adjacent in some row or some column of the table); - it is impossible to add any cell to the set unless we violate the two previous conditions. \nCan Sereja change the values of at most *k* cells of the table so that the table met the described requirement? What minimum number of table cells should he change in this case?",
"input": "",
"output": "```python\n# Idea is that all rows are either A or B where A flipped = B (same is true for columns)\r\n#\r\n# Thus, either n and m <= k and since max value of k == 10, we can just brute force all A\r\n#\r\n# Or, n or m > k. WLOG say m <= n.\r\n# Then, if A/B is not one of the existing rows, the number of flips to change each row\r\n# is at least 1 and thus total changes is at least m > k, which is impossible.\r\n#\r\n# Thus, if any A/B yields <= k changes, A/B must be one of the exiting rows.\r\n# (WLOG we can assume A is since if B is, we can just swap A and B\r\n# and this doesn't affect the possible values for the rows = {A, B} obviously)\r\n\r\nn, m, k = map(int, input().split())\r\n\r\na = [list(map(int, input().split())) for i in range(n)]\r\n\r\n# In the case of n or m > k, we will be iterating over rows/columns whichever is shorter\r\n# It is easier to iterate over rows, so we transpose if we need to iterate over columns\r\nif m > n:\r\n b = [[0]*n for i in range(m)]\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n b[j][i] = a[i][j]\r\n\r\n a = b\r\n n, m = m, n\r\n\r\n\r\ndef cost_change(common_row):\r\n cost = 0\r\n\r\n for row in a:\r\n diff = 0\r\n\r\n for j, val in enumerate(row):\r\n diff += common_row[j] != val\r\n\r\n cost += min(diff, (m-diff))\r\n\r\n return cost\r\n\r\n\r\nans = k+1\r\n\r\nif n > k:\r\n # row we change to must be a current row (otherwise the cost to change each row must be at least 1, so the total\r\n # cost is at least m > k, which is impossible\r\n\r\n for row in a:\r\n ans = min(ans, cost_change(row))\r\nelse:\r\n # row could be anything\r\n for msk in range(1<>k&1 for k in range(m)]\r\n\r\n ans = min(ans, cost_change(row))\r\n\r\nprint(-1 if ans == k+1 else ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\n# your code goes here\ntest = int(input())\nfor i in range(test):\n\tn = input()\n\tl = len(n)\n\tif(int(l)>10):\n\t\tprint(n[0]+str(l-2)+n[l-1])\n\telse:\n\t\tprint(n)\n\t \t \t\t \t\t\t\t\t \t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One beautiful July morning a terrible thing happened in Mainframe: a mean virus Megabyte somehow got access to the memory of his not less mean sister Hexadecimal. He loaded there a huge amount of *n* different natural numbers from 1 to *n* to obtain total control over her energy.\n\nBut his plan failed. The reason for this was very simple: Hexadecimal didn't perceive any information, apart from numbers written in binary format. This means that if a number in a decimal representation contained characters apart from 0 and 1, it was not stored in the memory. Now Megabyte wants to know, how many numbers were loaded successfully.",
"input": "",
"output": "```python\ndef main():\r\n n = int(input())\r\n ans = 0\r\n for i in range(1, 2**10-1):\r\n x = int(''.join(list(bin(i))[2:]))\r\n if x <= n:\r\n ans += 1\r\n else:\r\n break\r\n print(ans)\r\n\r\nmain()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he organized a New Year party at his place and invited *n* his friends there.\n\nIf there's one thing Petya likes more that receiving gifts, that's watching others giving gifts to somebody else. Thus, he safely hid the laptop until the next New Year and made up his mind to watch his friends exchanging gifts while he does not participate in the process. He numbered all his friends with integers from 1 to *n*. Petya remembered that a friend number *i* gave a gift to a friend number *p**i*. He also remembered that each of his friends received exactly one gift.\n\nNow Petya wants to know for each friend *i* the number of a friend who has given him a gift.",
"input": "",
"output": "```python\nn=int(input())\r\ngift=list(map9int,input().split()))\r\n\r\nres=[0]*n\r\n\r\nfor i in range(n):\r\n res[gift[i]-1]=i+1\r\n \r\nprint(*res)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given array consisting of *n* integers. Your task is to find the maximum length of an increasing subarray of the given array.\n\nA subarray is the sequence of consecutive elements of the array. Subarray is called increasing if each element of this subarray strictly greater than previous.",
"input": "",
"output": "```python\nn=int(input())\r\na=list(map(int,input().split()))\r\nif n==1:\r\n print(1)\r\nelse:\r\n l=[]\r\n c=0\r\n for i in range(n-1):\r\n if a[i]a[-2]:\r\n c+=1\r\n l.append(c)\r\n print(max(l))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Valera has got *n* domino pieces in a row. Each piece consists of two halves — the upper one and the lower one. Each of the halves contains a number from 1 to 6. Valera loves even integers very much, so he wants the sum of the numbers on the upper halves and the sum of the numbers on the lower halves to be even.\n\nTo do that, Valera can rotate the dominoes by 180 degrees. After the rotation the upper and the lower halves swap places. This action takes one second. Help Valera find out the minimum time he must spend rotating dominoes to make his wish come true.",
"input": "",
"output": "```python\nodd1=0\r\nodd2=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a%2!=0:\r\n odd1+=1\r\n if b%2!=0:\r\n odd2+=1\r\nif odd1%2==0 and odd2%2==0:\r\n print(0)\r\nelif odd1%2!=0 and odd2%2!=0:\r\n print(1)\r\nelse:\r\n print(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "When new students come to the Specialized Educational and Scientific Centre (SESC) they need to start many things from the beginning. Sometimes the teachers say (not always unfairly) that we cannot even count. So our teachers decided to teach us arithmetics from the start. And what is the best way to teach students add and subtract? — That's right, using counting sticks! An here's our new task: \n\nAn expression of counting sticks is an expression of type:\n\nSign + consists of two crossed sticks: one vertical and one horizontal. Sign = consists of two horizontal sticks. The expression is arithmetically correct if *A*<=+<=*B*<==<=*C*.\n\nWe've got an expression that looks like *A*<=+<=*B*<==<=*C* given by counting sticks. Our task is to shift at most one stick (or we can shift nothing) so that the expression became arithmetically correct. Note that we cannot remove the sticks from the expression, also we cannot shift the sticks from the signs + and =.\n\nWe really aren't fabulous at arithmetics. Can you help us?",
"input": "",
"output": "```python\n#||+|=|||||\r\na = input()\r\nlist2 = list(a)\r\nb = int(len(list2))\r\nif b/2 != int(b/2):\r\n print('Impossible')\r\nelse:\r\n for i in range(b):\r\n list2[i] = '|'\r\n list2[int(b/2)] = '='\r\n list2[1] = '+'\r\n for i in range(b):\r\n print(list2[i],end = '')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word *s*. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word *s*.",
"input": "",
"output": "```python\ns = str(input())\r\n\r\nwant_string = 'hello'\r\n\r\ncnt = len(want_string)\r\n\r\nli = []\r\n\r\ncnt2 = 0\r\n\r\nfor i in s:\r\n if i == want_string[cnt2]:\r\n cnt2 += 1\r\n cnt -= 1\r\n\r\nif cnt == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number *n*. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that *n* is the answer to the arithmetic task for first-graders. In the textbook, a certain positive integer *x* was given. The task was to add *x* to the sum of the digits of the number *x* written in decimal numeral system.\n\nSince the number *n* on the board was small, Vova quickly guessed which *x* could be in the textbook. Now he wants to get a program which will search for arbitrary values of the number *n* for all suitable values of *x* or determine that such *x* does not exist. Write such a program for Vova.",
"input": "",
"output": "```python\na=input()\r\na=int(a)\r\n\r\ncount=0\r\ntotal=0\r\nresult=[]\r\n\r\nfor x in range(a):\r\n count=0\r\n for y in str(x):\r\n count+=int(y)\r\n if(count+x==a):\r\n total+=1\r\n result.append(x)\r\n\r\nprint(total)\r\nfor z in result:\r\n print(z)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Holidays have finished. Thanks to the help of the hacker Leha, Noora managed to enter the university of her dreams which is located in a town Pavlopolis. It's well known that universities provide students with dormitory for the period of university studies. Consequently Noora had to leave Vičkopolis and move to Pavlopolis. Thus Leha was left completely alone in a quiet town Vičkopolis. He almost even fell into a depression from boredom!\n\nLeha came up with a task for himself to relax a little. He chooses two integers *A* and *B* and then calculates the greatest common divisor of integers \"*A* factorial\" and \"*B* factorial\". Formally the hacker wants to find out GCD(*A*!,<=*B*!). It's well known that the factorial of an integer *x* is a product of all positive integers less than or equal to *x*. Thus *x*!<==<=1·2·3·...·(*x*<=-<=1)·*x*. For example 4!<==<=1·2·3·4<==<=24. Recall that GCD(*x*,<=*y*) is the largest positive integer *q* that divides (without a remainder) both *x* and *y*.\n\nLeha has learned how to solve this task very effective. You are able to cope with it not worse, aren't you?",
"input": "",
"output": "```python\ndef fact(n):\r\n\tif n <= 1:\r\n\t\treturn 1\r\n\telse:\r\n\t\treturn n*fact(n-1)\r\n\t\t\r\na, b = map(int, input().split())\r\nprint(fact(min(a, b)))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp thinks about the meaning of life very often. He does this constantly, even when typing in the editor. Every time he starts brooding he can no longer fully concentrate and repeatedly presses the keys that need to be pressed only once. For example, instead of the phrase \"how are you\" he can type \"hhoow aaaare yyoouu\". \n\nPolycarp decided to automate the process of correcting such errors. He decided to write a plug-in to the text editor that will remove pairs of identical consecutive letters (if there are any in the text). Of course, this is not exactly what Polycarp needs, but he's got to start from something! \n\nHelp Polycarp and write the main plug-in module. Your program should remove from a string all pairs of identical letters, which are consecutive. If after the removal there appear new pairs, the program should remove them as well. Technically, its work should be equivalent to the following: while the string contains a pair of consecutive identical letters, the pair should be deleted. Note that deleting of the consecutive identical letters can be done in any order, as any order leads to the same result.",
"input": "",
"output": "```python\nclass solve:\r\n def __init__(self):\r\n s=input()\r\n n=len(s)\r\n ans=\"\"\r\n for i in range(n):\r\n if ans==\"\" or ans[-1]!=s[i]:\r\n ans+=s[i]\r\n l+=1\r\n else:\r\n ans[-1]=0\r\n final=\"\"\r\n for i in ans:\r\n if i!=0:\r\n final+=i\r\n print(final)\r\n\r\nobj=solve()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day shooshuns found a sequence of *n* integers, written on a blackboard. The shooshuns can perform one operation with it, the operation consists of two steps:\n 1. Find the number that goes *k*-th in the current sequence and add the same number to the end of the sequence; 1. Delete the first number of the current sequence. \nThe shooshuns wonder after how many operations all numbers on the board will be the same and whether all numbers will ever be the same.",
"input": "",
"output": "```python\nn, k = map(int,input().split())\nl = [int(i) for i in input().split()]\nif len(set(l[k-1:n])) != 1:\n print(-1)\nelse:\n last=l[-1]\n ans=-1\n for i in range(n):\n if l[i] !=last:\n ans=i\n print(ans+1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "So, the New Year holidays are over. Santa Claus and his colleagues can take a rest and have guests at last. When two \"New Year and Christmas Men\" meet, thear assistants cut out of cardboard the letters from the guest's name and the host's name in honor of this event. Then the hung the letters above the main entrance. One night, when everyone went to bed, someone took all the letters of our characters' names. Then he may have shuffled the letters and put them in one pile in front of the door.\n\nThe next morning it was impossible to find the culprit who had made the disorder. But everybody wondered whether it is possible to restore the names of the host and his guests from the letters lying at the door? That is, we need to verify that there are no extra letters, and that nobody will need to cut more letters.\n\nHelp the \"New Year and Christmas Men\" and their friends to cope with this problem. You are given both inscriptions that hung over the front door the previous night, and a pile of letters that were found at the front door next morning.",
"input": "",
"output": "```python\n\nline1 = list(map(str, input().strip()))\nline2 = list(map(str, input().strip()))\nline3 = list(map(str, input().strip()))\nline3.sort()\n\nline = line1+line2\nline.sort()\n\nif line == line3:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t\t\t \t \t\t\t\t \t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Bolek has found a picture with *n* mountain peaks painted on it. The *n* painted peaks are represented by a non-closed polyline, consisting of 2*n* segments. The segments go through 2*n*<=+<=1 points with coordinates (1,<=*y*1), (2,<=*y*2), ..., (2*n*<=+<=1,<=*y*2*n*<=+<=1), with the *i*-th segment connecting the point (*i*,<=*y**i*) and the point (*i*<=+<=1,<=*y**i*<=+<=1). For any even *i* (2<=≤<=*i*<=≤<=2*n*) the following condition holds: *y**i*<=-<=1<=<<=*y**i* and *y**i*<=><=*y**i*<=+<=1. \n\nWe shall call a vertex of a polyline with an even *x* coordinate a mountain peak.\n\nBolek fancied a little mischief. He chose exactly *k* mountain peaks, rubbed out the segments that went through those peaks and increased each peak's height by one (that is, he increased the *y* coordinate of the corresponding points). Then he painted the missing segments to get a new picture of mountain peaks. Let us denote the points through which the new polyline passes on Bolek's new picture as (1,<=*r*1), (2,<=*r*2), ..., (2*n*<=+<=1,<=*r*2*n*<=+<=1).\n\nGiven Bolek's final picture, restore the initial one.",
"input": "",
"output": "```python\nn,k=map(int,input().split())\r\nr=list(map(int,input().split()))\r\nc=0\r\nfor i in range(len(r)//2):\r\n if c==k:\r\n break\r\n elif r[(2*i)]r[(2*i)+2]:\r\n r[(2*i)+1]=r[(2*i)+1]-1\r\n c=c+1\r\n \r\nprint(*r)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n \r\n\r\n \r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.\n\nLet us remind you that lucky numbers are positive integers whose decimal representation only contains lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.\n\nRoma's got *n* positive integers. He wonders, how many of those integers have not more than *k* lucky digits? Help him, write the program that solves the problem.",
"input": "",
"output": "```python\n# # RED CODER # #\r\nn, k = map(int, input().split())\r\nx = list(map(str, input().split()))[:n]\r\ncount = 0\r\nfor i in range(n):\r\n if len(x[i]) <= k:\r\n count += 1\r\nprint(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two players are playing a game. First each of them writes an integer from 1 to 6, and then a dice is thrown. The player whose written number got closer to the number on the dice wins. If both payers have the same difference, it's a draw.\n\nThe first player wrote number *a*, the second player wrote number *b*. How many ways to throw a dice are there, at which the first player wins, or there is a draw, or the second player wins?",
"input": "",
"output": "```python\nnum_1, num_2 = map(int, input().split())\r\nnum_3, num_4, num_5 = 0, 0, 0\r\nfor i in range(1, 6 + 1):\r\n if abs(num_1 - i) < abs(num_2 - i):\r\n num_3 += 1\r\n elif abs(num_1 - i) == abs(num_2 - i):\r\n num_4 += 1\r\n elif abs(num_1 - i) > abs(num_2 - i):\r\n num_5 += 1\r\nprint(num_3, num_4, num_5)\n# Wed Mar 09 2022 07:02:36 GMT+0000 (Coordinated Universal Time)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for $n$ flowers and so it looks like a pipe with $n$ holes. Arkady can only use the water that flows from the first hole.\n\nArkady can block some of the holes, and then pour $A$ liters of water into the pipe. After that, the water will flow out from the non-blocked holes proportionally to their sizes $s_1, s_2, \\ldots, s_n$. In other words, if the sum of sizes of non-blocked holes is $S$, and the $i$-th hole is not blocked, $\\frac{s_i \\cdot A}{S}$ liters of water will flow out of it.\n\nWhat is the minimum number of holes Arkady should block to make at least $B$ liters of water flow out of the first hole?",
"input": "",
"output": "```python\nnh,totl,finl=[int(i) for i in input().split()]\r\nl=[int(i) for i in input().split()]\r\ncount=0\r\nfl=0\r\nnewl=l[1:]\r\nk=0\r\nsumm=l[0]+sum(newl)\r\nnewl=sorted(newl,reverse=True)\r\nwhile(True):\r\n ans=(totl*l[0])/summ\r\n if(ans>=finl):\r\n break\r\n else: \r\n summ=summ-newl[k]\r\n count+=1\r\n k+=1\r\nprint(count) \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Jafar has *n* cans of cola. Each can is described by two integers: remaining volume of cola *a**i* and can's capacity *b**i* (*a**i* <=≤<= *b**i*).\n\nJafar has decided to pour all remaining cola into just 2 cans, determine if he can do this or not!",
"input": "",
"output": "```python\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nx=sum(a)\r\ny=max(b)\r\nb.remove(y)\r\nz=max(b)\r\nif y+z1):\r\n MinL=max(MinL,pos[pos_len]-pos[pos_len-1])\r\n else :\r\n MinL=i+1;\r\n#print(MinL)\r\n#print(pos)\r\n#print(length,' ',pos[pos_len])\r\nif (pos_len == 0):\r\n print(length+1)\r\nelse:\r\n MinL=max(MinL,length-pos[pos_len]+1)\r\n print(MinL)\r\n print(pos)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Those days, many boys use beautiful girls' photos as avatars in forums. So it is pretty hard to tell the gender of a user at the first glance. Last year, our hero went to a forum and had a nice chat with a beauty (he thought so). After that they talked very often and eventually they became a couple in the network. \n\nBut yesterday, he came to see \"her\" in the real world and found out \"she\" is actually a very strong man! Our hero is very sad and he is too tired to love again now. So he came up with a way to recognize users' genders by their user names.\n\nThis is his method: if the number of distinct characters in one's user name is odd, then he is a male, otherwise she is a female. You are given the string that denotes the user name, please help our hero to determine the gender of this user by his method.",
"input": "",
"output": "```python\nnom = set(map(str,input()))\r\nn = len(nom)\r\nif(n%2==0):\r\n print(\"CHAT WITH HER!\")\r\nelse:\r\n print(\"IGNORE HIM!\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp has interviewed Oleg and has written the interview down without punctuation marks and spaces to save time. Thus, the interview is now a string *s* consisting of *n* lowercase English letters.\n\nThere is a filler word ogo in Oleg's speech. All words that can be obtained from ogo by adding go several times to the end of it are also considered to be fillers. For example, the words ogo, ogogo, ogogogo are fillers, but the words go, og, ogog, ogogog and oggo are not fillers.\n\nThe fillers have maximal size, for example, for ogogoo speech we can't consider ogo a filler and goo as a normal phrase. We should consider ogogo as a filler here.\n\nTo print the interview, Polycarp has to replace each of the fillers with three asterisks. Note that a filler word is replaced with exactly three asterisks regardless of its length.\n\nPolycarp has dealt with this problem in no time. Can you do the same? The clock is ticking!",
"input": "",
"output": "```python\ndef main():\r\n n = int(input())\r\n a = input()\r\n i = 0\r\n while i <= n - 1:\r\n if a[i] != 'o':\r\n print(a[i], end = '')\r\n i += 1\r\n elif i < n - 2:\r\n if a[i + 1] == 'g' and a[i + 2] == 'o':\r\n i += 3\r\n while i < n - 1:\r\n if a[i] == 'g' and a[i + 1] == 'o':\r\n i += 2\r\n else:\r\n print(\"***\", end = '')\r\n break\r\n else:\r\n print(\"***\", end ='')\r\n \r\n \r\n else:\r\n print(a[i], end = '')\r\n i += 1\r\n\r\nmain()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One way to create a task is to learn from math. You can generate some random math statement or modify some theorems to get something new and build a new task from that.\n\nFor example, there is a statement called the \"Goldbach's conjecture\". It says: \"each even number no less than four can be expressed as the sum of two primes\". Let's modify it. How about a statement like that: \"each integer no less than 12 can be expressed as the sum of two composite numbers.\" Not like the Goldbach's conjecture, I can prove this theorem.\n\nYou are given an integer *n* no less than 12, express it as a sum of two composite numbers.",
"input": "",
"output": "```python\n\r\n\r\nn = int(input())\r\n\r\ndef compite(x):\r\n total = 0\r\n for j in range(1,x+1):\r\n if x % j == 0:\r\n total += 1\r\n if total > 2:\r\n return x\r\n break\r\n else:\r\n total = total\r\n \r\n return total\r\n\r\ntotal1 = []\r\n\r\nif n % 2 == 0:\r\n a = int(n / 2)\r\n if compite(a) == a:\r\n total1.append([a,a])\r\n else:\r\n a = int(n/2) + 1\r\n while True:\r\n if compite(a) == a:\r\n b = n - a\r\n if compite(b) == b:\r\n total1.append([a,b])\r\n break\r\n else:\r\n a += 1\r\n else:\r\n a += 1\r\n \r\nelse:\r\n c = int(n/2) + 1\r\n while True:\r\n if compite(c) == c:\r\n d = n - c\r\n if compite(d) == d:\r\n total1.append([c,d])\r\n break\r\n else:\r\n c += 1\r\n else:\r\n c += 1\r\n\r\nfor i in total1:\r\n print(*i)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One fine October day a mathematics teacher Vasily Petrov went to a class and saw there *n* pupils who sat at the desks, two people at each desk. Vasily quickly realized that number *n* is even. Like all true mathematicians, Vasily has all students numbered from 1 to *n*.\n\nBut Vasily Petrov did not like the way the children were seated at the desks. According to him, the students whose numbers differ by 1, can not sit together, as they talk to each other all the time, distract others and misbehave.\n\nOn the other hand, if a righthanded student sits at the left end of the desk and a lefthanded student sits at the right end of the desk, they hit elbows all the time and distract each other. In other cases, the students who sit at the same desk, do not interfere with each other.\n\nVasily knows very well which students are lefthanders and which ones are righthanders, and he asks you to come up with any order that meets these two uncomplicated conditions (students do not talk to each other and do not bump their elbows). It is guaranteed that the input is such that at least one way to seat the students always exists.",
"input": "",
"output": "```python\n#include\n#include\n#include\n \nchar st[110];\nint i,l;\n \nint main()\n{\n\tfreopen(\"input.txt\",\"r\",stdin);\n\tfreopen(\"output.txt\",\"w\",stdout);\n\tscanf(\"%d\",&l);\n\tscanf(\"%s\",st+1);\n\tfor(i=1;i<=l/2;i++)\n\t{\n\t\tif(st[i]=='L')\n\t\t{\n\t\t\tprintf(\"%d %d\\n\",i,i+l/2);\n\t\t}\n\t\tif(st[i]=='R')\n\t\t{\n\t\t\tprintf(\"%d %d\\n\",i+l/2,i);\n\t\t}\n\t}\n\treturn 0;\n}\n\t \t\t\t \t\t \t \t \t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "According to an old legeng, a long time ago Ankh-Morpork residents did something wrong to miss Fortune, and she cursed them. She said that at some time *n* snacks of distinct sizes will fall on the city, and the residents should build a Snacktower of them by placing snacks one on another. Of course, big snacks should be at the bottom of the tower, while small snacks should be at the top.\n\nYears passed, and once different snacks started to fall onto the city, and the residents began to build the Snacktower.\n\nHowever, they faced some troubles. Each day exactly one snack fell onto the city, but their order was strange. So, at some days the residents weren't able to put the new stack on the top of the Snacktower: they had to wait until all the bigger snacks fell. Of course, in order to not to anger miss Fortune again, the residents placed each snack on the top of the tower immediately as they could do it.\n\nWrite a program that models the behavior of Ankh-Morpork residents.",
"input": "",
"output": "```python\nm=int(input())\r\nlist1=list(map(int,input().split(' ')))\r\nlist2=list()\r\nlist3=list1.copy()\r\nfor i in range(len(list1)):\r\n _max=max(list3)\r\n list2.append(list1[i])\r\n list3.remove(list1[i])\r\n if(list1[i]== _max):\r\n list2.sort(reverse=True)\r\n for x in list2:\r\n print(f'{x} ',end=' ')\r\n list2.clear()\r\n continue\r\n print('')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The only king stands on the standard chess board. You are given his position in format \"cd\", where *c* is the column from 'a' to 'h' and *d* is the row from '1' to '8'. Find the number of moves permitted for the king.\n\nCheck the king's moves here [https://en.wikipedia.org/wiki/King_(chess)](https://en.wikipedia.org/wiki/King_(chess)).",
"input": "",
"output": "```python\npos_king= input()\r\ncol= pos_king[0]\r\nfil= int(pos_king[1])\r\nmoves=0\r\n\r\nif fil==8 or fil==1:\r\n if col==\"a\" or col==\"h\":\r\n moves=3\r\n else:\r\n moves=5\r\nelif 1= k\r\nlakes = sorted((len(lake), lake) for lake in lakes)\r\nw = {rc for _,lake in lakes[:len(lakes)-k] for rc in lake}\r\nfor r,c in w:\r\n mp[r][c]=\"#\"\r\nprint(len(w))\r\nfor row in mp:\r\n print(\"\".join(row))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bear Limak examines a social network. Its main functionality is that two members can become friends (then they can talk with each other and share funny pictures).\n\nThere are *n* members, numbered 1 through *n*. *m* pairs of members are friends. Of course, a member can't be a friend with themselves.\n\nLet A-B denote that members A and B are friends. Limak thinks that a network is reasonable if and only if the following condition is satisfied: For every three distinct members (X, Y, Z), if X-Y and Y-Z then also X-Z.\n\nFor example: if Alan and Bob are friends, and Bob and Ciri are friends, then Alan and Ciri should be friends as well.\n\nCan you help Limak and check if the network is reasonable? Print \"YES\" or \"NO\" accordingly, without the quotes.",
"input": "",
"output": "```python\n\r\ndef find(p):\r\n if id[p] == p: \r\n return p \r\n else:\r\n id[p] = find(id[p]);\r\n return id[p]\r\n \r\ndef union(u,v):\r\n u = find(u)\r\n v = find(v)\r\n\r\n if u == v:\r\n return\r\n if size[u] > size[v]: \r\n u,v=v,u\r\n\r\n id[u] = v\r\n size[v] += size[u]\r\n \r\n\r\n\r\nn,m = map(int,input().split())\r\nvisited = [False]*(n+1)\r\narestas = [0] * (n+1)\r\n\r\n\r\nsize= [1] * (n+1)\r\nid = [i for i in range(n+1)] \r\n \r\n\r\nfor i in range(m):\r\n u,v = map(int,input().split())\r\n arestas[u] +=1\r\n arestas[v] +=1\r\n union(u,v)\r\n\r\n\r\nans = 'YES'\r\nfor i in range(1,n):\r\n if arestas[i] != 0:\r\n if arestas[i] != size[find(i)] -1:\r\n ans = 'NO'\r\n break\r\n\r\nprint(ans)\r\n \r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Very soon there will be a parade of victory over alien invaders in Berland. Unfortunately, all soldiers died in the war and now the army consists of entirely new recruits, many of whom do not even know from which leg they should begin to march. The civilian population also poorly understands from which leg recruits begin to march, so it is only important how many soldiers march in step.\n\nThere will be *n* columns participating in the parade, the *i*-th column consists of *l**i* soldiers, who start to march from left leg, and *r**i* soldiers, who start to march from right leg.\n\nThe beauty of the parade is calculated by the following formula: if *L* is the total number of soldiers on the parade who start to march from the left leg, and *R* is the total number of soldiers on the parade who start to march from the right leg, so the beauty will equal |*L*<=-<=*R*|.\n\nNo more than once you can choose one column and tell all the soldiers in this column to switch starting leg, i.e. everyone in this columns who starts the march from left leg will now start it from right leg, and vice versa. Formally, you can pick no more than one index *i* and swap values *l**i* and *r**i*. \n\nFind the index of the column, such that switching the starting leg for soldiers in it will maximize the the beauty of the parade, or determine, that no such operation can increase the current beauty.",
"input": "",
"output": "```python\nn=int(input())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n\tl,r=map(int,input().split())\r\n\ta.append((l,r))\r\n\tb.append((l,r))\r\na.sort(key=lambda x:(x[0],x[1]))\r\ns1=0\r\ns2=0\r\ns3=0\r\ns4=0\r\nfor i in range(n):\r\n\ts1=s1+a[i][0]\r\n\ts2=s2+a[i][1]\r\ny1=abs(s1-s2)\r\nz1=a[n-1][0]\r\nz2=a[n-1][1]\r\nx=abs(a[n-1][0]-a[n-1][1])\r\nfor i in range(n-2,-1,-1):\r\n\tif((a[i][0]>a[i][1])):\r\n\t\tif(abs(a[i][0]-a[i][1])>x):\r\n\t\t\tz1=a[i][0]\r\n\t\t\tz2=a[i][1]\r\n\r\nfor i in range(n):\r\n\ts3=s3+a[i][0]\r\n\ts4=s4+a[i][1]\r\ns3=s3-z1+z2\r\ns4=s4-z2+z1\r\ny2=abs(s3-s4)\r\nif(y1>=y2):\r\n\tprint(0)\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif(b[i][0]==z1 and b[i][1]==z2):\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Manao is trying to open a rather challenging lock. The lock has *n* buttons on it and to open it, you should press the buttons in a certain order to open the lock. When you push some button, it either stays pressed into the lock (that means that you've guessed correctly and pushed the button that goes next in the sequence), or all pressed buttons return to the initial position. When all buttons are pressed into the lock at once, the lock opens.\n\nConsider an example with three buttons. Let's say that the opening sequence is: {2, 3, 1}. If you first press buttons 1 or 3, the buttons unpress immediately. If you first press button 2, it stays pressed. If you press 1 after 2, all buttons unpress. If you press 3 after 2, buttons 3 and 2 stay pressed. As soon as you've got two pressed buttons, you only need to press button 1 to open the lock.\n\nManao doesn't know the opening sequence. But he is really smart and he is going to act in the optimal way. Calculate the number of times he's got to push a button in order to open the lock in the worst-case scenario.",
"input": "",
"output": "```python\nn = int(input())\r\nprint(n*(n*n+5)//6)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coordinate axes and two opposite vertices lay in the points (0,<=0,<=0) and (1,<=1,<=1). Two flies live on the planet. At the moment they are sitting on two different vertices of the cubical planet. Your task is to determine whether they see each other or not. The flies see each other when the vertices they occupy lie on the same face of the cube.",
"input": "",
"output": "```python\n# LUOGU_RID: 128753035\na,b,c=map(int,input().split())\nd,e,f=map(int,input().split())\nif ((a==d) or (b==e) or (c==f)):\n print('YES')\nelse:\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Tavak and Seyyed are good friends. Seyyed is very funny and he told Tavak to solve the following problem instead of longest-path.\n\nYou are given *l* and *r*. For all integers from *l* to *r*, inclusive, we wrote down all of their integer divisors except 1. Find the integer that we wrote down the maximum number of times.\n\nSolve the problem to show that it's not a NP problem.",
"input": "",
"output": "```python\nfrom math import sqrt\n\n\nnums = input()\n\nesp = nums.find(' ')\n\nn1 = int(nums[0:esp])\nn2 = int(nums[esp+1:])\n\nvzs = [0,0,0,0,0]\n\ndef incrementa(i):\n if(i==2):\n vzs[0]+=1\n elif(i==3):\n vzs[1]+=1\n elif(i==5):\n vzs[2]+=1\n elif(i==7):\n vzs[3]+=1\n else:\n vzs[4]+=1\n\n\ndef divisors(n):\n raiz = int(sqrt(n))\n for i in [2,3,5,7,11]:\n if(n % i == 0):\n incrementa(i)\n if((raiz*raiz) == n):\n incrementa(raiz)\n\nfor i in range(n1,n2+1):\n divisors(i)\n\nmaior=0\nfor i in range(1,len(vzs)):\n if(vzs[i]>vzs[maior]):\n maior=i\nprint(maior+2)\n \t \t\t \t \t \t\t\t\t \t \t\t \t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Little Elephant has an integer *a*, written in the binary notation. He wants to write this number on a piece of paper.\n\nTo 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* in the binary record. At that a new number appears. It consists of the remaining binary digits, written in the corresponding order (possible, with leading zeroes).\n\nThe Little Elephant wants the number he is going to write on the paper to be as large as possible. Help him find the maximum number that he can obtain after deleting exactly one binary digit and print it in the binary notation.",
"input": "",
"output": "```python\nbin = input()\r\n\r\nok = 1\r\nfor i in range(len(bin)):\r\n if bin[i] == '0':\r\n bin = bin[0:i] + bin[i + 1: len(bin)]\r\n ok = 0\r\n break\r\n\r\nif ok == 1:\r\n bin = bin[0:-1]\r\n\r\nprint(bin)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.\n\nAt some points on the road there are *n* friends, and *i*-th of them is standing at the point *x**i* meters and can move with any speed no greater than *v**i* meters per second in any of the two directions along the road: south or north.\n\nYou are to compute the minimum time needed to gather all the *n* friends at some point on the road. Note that the point they meet at doesn't need to have integer coordinate.",
"input": "",
"output": "```python\ndef cnt(pos):\r\n ret = 0\r\n \r\n for i in range(n):\r\n ret = max(ret, abs(pos - x[i])/v[i])\r\n \r\n return ret\r\n\r\nn = int(input())\r\nx = list(map(int ,input().split()))\r\nv = list(map(int ,input().split()))\r\n\r\nlo, hi = min(x), max(x)\r\n\r\n\r\nfor _ in range(50):\r\n le = (lo + lo + hi) / 3\r\n ri = (lo + hi + hi) / 3\r\n \r\n if (cnt(le) < cnt(ri)):\r\n hi = ri\r\n else:\r\n lo = le\r\n\r\nprint(\"%.13f\" % cnt(lo))\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* children in Jzzhu's school. Jzzhu is going to give some candies to them. Let's number all the children from 1 to *n*. The *i*-th child wants to get at least *a**i* candies.\n\nJzzhu asks children to line up. Initially, the *i*-th child stands at the *i*-th place of the line. Then Jzzhu start distribution of the candies. He follows the algorithm:\n 1. Give *m* candies to the first child of the line. 1. If this child still haven't got enough candies, then the child goes to the end of the line, else the child go home. 1. Repeat the first two steps while the line is not empty. \nConsider all the children in the order they go home. Jzzhu wants to know, which child will be the last in this order?",
"input": "",
"output": "```python\nfrom collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\ndef count_otr(nums):\r\n cnt = 0\r\n for i in nums:\r\n if i <= 0:\r\n cnt +=1\r\n\r\n return cnt\r\nsimp = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\ndef main():\r\n n, m = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n a = [i//m if i % m == 0 else i//m + 1 for i in a]\r\n for i in range(n-1, -1, -1):\r\n if a[i] == max(a):\r\n print(i+1)\r\n break\r\nif __name__ == \"__main__\":\r\n main()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Summer holidays! Someone is going on trips, someone is visiting grandparents, but someone is trying to get a part-time job. This summer Noora decided that she wants to earn some money, and took a job in a shop as an assistant.\n\nShop, where Noora is working, has a plan on the following *n* days. For each day sales manager knows exactly, that in *i*-th day *k**i* products will be put up for sale and exactly *l**i* clients will come to the shop that day. Also, the manager is sure, that everyone, who comes to the shop, buys exactly one product or, if there aren't any left, leaves the shop without buying anything. Moreover, due to the short shelf-life of the products, manager established the following rule: if some part of the products left on the shelves at the end of the day, that products aren't kept on the next day and are sent to the dump.\n\nFor advertising purposes manager offered to start a sell-out in the shop. He asked Noora to choose any *f* days from *n* next for sell-outs. On each of *f* chosen days the number of products were put up for sale would be doubled. Thus, if on *i*-th day shop planned to put up for sale *k**i* products and Noora has chosen this day for sell-out, shelves of the shop would keep 2·*k**i* products. Consequently, there is an opportunity to sell two times more products on days of sell-out.\n\nNoora's task is to choose *f* days to maximize total number of sold products. She asks you to help her with such a difficult problem.",
"input": "",
"output": "```python\nline = [int(x) for x in input().split()]\nn = line[0]\nf = line[1]\n\nresult = 0\ndiffs = []\nfor case in range(n):\n day = [int(x) for x in input().split()]\n k = day[0]\n l = day[1]\n sold = min(k,l)\n result += sold\n diffs.append(min(2*k,l)-sold)\n\ndiffs.sort(reverse = True)\nfor i in range(f):\n result += diffs[i]\nprint(result)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Some days ago, I learned the concept of LCM (least common multiple). I've played with it for several times and I want to make a big number with it.\n\nBut I also don't want to use many numbers, so I'll choose three positive integers (they don't have to be distinct) which are not greater than *n*. Can you help me to find the maximum possible least common multiple of these three integers?",
"input": "",
"output": "```python\nfrom math import lcm\r\nn = int(input())\r\nmaxi = 0\r\nfor i in range(n,max(n-60,0),-1):\r\n maxi = max(maxi,lcm(i,i-1,i-2))\r\n\r\nprint(maxi)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two positive integer numbers *a* and *b*. Permute (change order) of the digits of *a* to construct maximal number not exceeding *b*. No number in input and/or output can start with the digit 0.\n\nIt is allowed to leave *a* as it is.",
"input": "",
"output": "```python\na = (input())\r\nb_str = (input())\r\nb_int = int(b_str)\r\nnums = [0] * 10\r\nfor char in b_str:\r\n nums[int(char)] +=1\r\nprint(nums)\r\nansw = \"\"\r\nif len(a)< len(b_str):\r\n for i in range(9,0,-1):\r\n while nums[i]!=0:\r\n answ += str(i)\r\n nums[i] -=1\r\n print(answ)\r\n exit(0)\r\n\r\nfor i in b_str :\r\n if nums[int(i)] != 0:\r\n\r\n nums[int(i)] -= 1\r\n answ += i\r\n else:\r\n pass\r\n\r\nprint(nums)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarpus has a ribbon, its length is *n*. He wants to cut the ribbon in a way that fulfils the following two conditions: \n - After the cutting each ribbon piece should have length *a*, *b* or *c*. - After the cutting the number of ribbon pieces should be maximum. \nHelp Polycarpus and find the number of ribbon pieces after the required cutting.",
"input": "",
"output": "```python\nz = []\r\nz[0:] = map(int ,input().split())\r\ncount = 0\r\ncounter = z[0]\r\nfor i in range(1,4):\r\n if counter - z[i] == z[1] or counter - z[i] == z[2] or counter - z[i] == z[3]:\r\n count +=1\r\n counter -=z[i]\r\n print(counter)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "During the break the schoolchildren, boys and girls, formed a queue of *n* people in the canteen. Initially the children stood in the order they entered the canteen. However, after a while the boys started feeling awkward for standing in front of the girls in the queue and they started letting the girls move forward each second. \n\nLet's describe the process more precisely. Let's say that the positions in the queue are sequentially numbered by integers from 1 to *n*, at that the person in the position number 1 is served first. Then, if at time *x* a boy stands on the *i*-th position and a girl stands on the (*i*<=+<=1)-th position, then at time *x*<=+<=1 the *i*-th position will have a girl and the (*i*<=+<=1)-th position will have a boy. The time is given in seconds.\n\nYou've got the initial position of the children, at the initial moment of time. Determine the way the queue is going to look after *t* seconds.",
"input": "",
"output": "```python\nn, t = map(int, input().split())\r\ns = input()\r\nfor _ in range(t):\r\n for i in range(n - 1):\r\n if i != 0:\r\n if i != (n - 2):\r\n if s[-(i + 2):-i] == \"BG\":\r\n s = s[:-(i + 2)] + \"GB\" + s[-i:]\r\n else:\r\n if s[:-i] == \"BG\":\r\n s = \"GB\" + s[-i:]\r\n else:\r\n if s[-(i + 2):] == \"BG\":\r\n s = s[:-(i + 2)] + \"GB\"\r\nprint(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "We consider a positive integer perfect, if and only if the sum of its digits is exactly $10$. Given a positive integer $k$, your task is to find the $k$-th smallest perfect positive integer.",
"input": "",
"output": "```python\nn=int(input())\r\nprint((n+1)*10 - n)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Roma works in a company that sells TVs. Now he has to prepare a report for the last year.\n\nRoma has got a list of the company's incomes. The list is a sequence that consists of *n* integers. The total income of the company is the sum of all integers in sequence. Roma decided to perform exactly *k* changes of signs of several numbers in the sequence. He can also change the sign of a number one, two or more times.\n\nThe operation of changing a number's sign is the operation of multiplying this number by -1.\n\nHelp Roma perform the changes so as to make the total income of the company (the sum of numbers in the resulting sequence) maximum. Note that Roma should perform exactly *k* changes.",
"input": "",
"output": "```python\n\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\ncountn = 0\r\nfor i in range(min(k, n)):\r\n if (a[i] < 0):\r\n countn += 1\r\n a[i] = -a[i]\r\na.sort()\r\nif (k - countn) % 2 != 0:\r\n a[0] = - a[0]\r\nprint(sum(a))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vitaly is a very weird man. He's got two favorite digits *a* and *b*. Vitaly calls a positive integer good, if the decimal representation of this integer only contains digits *a* and *b*. Vitaly calls a good number excellent, if the sum of its digits is a good number.\n\nFor example, let's say that Vitaly's favourite digits are 1 and 3, then number 12 isn't good and numbers 13 or 311 are. Also, number 111 is excellent and number 11 isn't. \n\nNow Vitaly is wondering, how many excellent numbers of length exactly *n* are there. As this number can be rather large, he asks you to count the remainder after dividing it by 1000000007 (109<=+<=7).\n\nA number's length is the number of digits in its decimal representation without leading zeroes.",
"input": "",
"output": "```python\nfrom math import factorial\r\n \r\nMOD = 10**9+7\r\nfact = {}\r\n \r\na, b, n = map(int, input().split())\r\nfact[0]=1\r\nfor i in range(1, n+1):\r\n fact[i] = fact[i-1]*i%MOD\r\n \r\nans = 0\r\nfor (i, j) in zip(range(n+1), range(n, -1, -1)):\r\n if set(str(a*i + b*j)) <= {f'{a}', f'{b}'}:\r\n ans+=(fact[n]*pow(fact[n-i]*fact[i]%MOD, MOD-2, MOD) % MOD)\r\nprint(ans%MOD)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Johny likes numbers *n* and *k* very much. Now Johny wants to find the smallest integer *x* greater than *n*, so it is divisible by the number *k*.",
"input": "",
"output": "```python\nk,n=map(int,input().split())\r\nr=k%n\r\nr=(k-r)+n\r\nprint(r)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A and B are preparing themselves for programming contests.\n\nTo train their logical thinking and solve problems better, A and B decided to play chess. During the game A wondered whose position is now stronger.\n\nFor each chess piece we know its weight: \n - the queen's weight is 9, - the rook's weight is 5, - the bishop's weight is 3, - the knight's weight is 3, - the pawn's weight is 1, - the king's weight isn't considered in evaluating position. \nThe player's weight equals to the sum of weights of all his pieces on the board.\n\nAs A doesn't like counting, he asked you to help him determine which player has the larger position weight.",
"input": "",
"output": "```python\nwhite = 0\nblack = 0\nboard = input()\n\nwhite += board.count('p')\nblack += board.count('P')\n\nwhite += board.count('r')*5\nblack += board.count('R')*5\n\nwhite += board.count('n')*3\nblack += board.count('N')*3\n\nwhite += board.count('b')*3\nblack += board.count('B')*3\n\nwhite += board.count('q')*9\nblack += board.count('Q')*9\nif white > black:\n print(\"White\")\nelif black > white:\n print(\"Black\")\nelse:\n print(\"Draw\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kitahara Haruki has bought *n* apples for Touma Kazusa and Ogiso Setsuna. Now he wants to divide all the apples between the friends.\n\nEach apple weights 100 grams or 200 grams. Of course Kitahara Haruki doesn't want to offend any of his friend. Therefore the total weight of the apples given to Touma Kazusa must be equal to the total weight of the apples given to Ogiso Setsuna.\n\nBut unfortunately Kitahara Haruki doesn't have a knife right now, so he cannot split any apple into some parts. Please, tell him: is it possible to divide all the apples in a fair way between his friends?",
"input": "",
"output": "```python\nn = int(input())\r\narr = list(map(int,input().split()))\r\ns = int(str(sum(arr))[0])\r\nif (s % 2 == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ternary numeric notation is quite popular in Berland. To telegraph the ternary number the Borze alphabet is used. Digit 0 is transmitted as «.», 1 as «-.» and 2 as «--». You are to decode the Borze code, i.e. to find out the ternary number given its representation in Borze alphabet.",
"input": "",
"output": "```python\nstring = input()\r\ntext = ''\r\ni = 0\r\nwhile i < len(string):\r\n if string[i] == '.':\r\n text += '0'\r\n i += 1\r\n elif string[i] == '-' and string[i+1] == '.':\r\n text += '1'\r\n i += 2\r\n else:\r\n text += '2'\r\n i += 2\r\nprint(text)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya lives in a strange world. The year has *n* months and the *i*-th month has *a**i* days. Vasya got a New Year present — the clock that shows not only the time, but also the date.\n\nThe clock's face can display any number from 1 to *d*. It is guaranteed that *a**i*<=≤<=*d* for all *i* from 1 to *n*. The clock does not keep information about the current month, so when a new day comes, it simply increases the current day number by one. The clock cannot display number *d*<=+<=1, so after day number *d* it shows day 1 (the current day counter resets). The mechanism of the clock allows you to increase the day number by one manually. When you execute this operation, day *d* is also followed by day 1.\n\nVasya begins each day checking the day number on the clock. If the day number on the clock does not match the actual day number in the current month, then Vasya manually increases it by one. Vasya is persistent and repeats this operation until the day number on the clock matches the actual number of the current day in the current month.\n\nA year passed and Vasya wonders how many times he manually increased the day number by one, from the first day of the first month to the last day of the *n*-th month inclusive, considering that on the first day of the first month the clock display showed day 1.",
"input": "",
"output": "```python\nimport math\r\n\r\ndef add(disp,m):\r\n\tdisp+=m\r\n\tif disp>d:\r\n\t\tdisp = disp-d\r\n\treturn disp\r\n\r\n\r\nd = int(input())\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\ndisp = 0\r\ncount = 0\r\n\r\nfor i in range(n):\r\n\tif disp == 0:\r\n\t\tdisp+=a[i]\r\n\telse:\r\n\t\t#\r\n\t\tif disp+a[i]*2 <= d:\t\r\n\t\t\tdisp+=a[i]*2\r\n\t\t\tcount+=a[i]\r\n\r\n\t\t#\r\n\t\telse:\r\n\t\t\tif add(disp,2*a[i]) <= a[i]:\r\n\t\t\t\tdisp = add(disp,2*a[i])\r\n\t\t\t\tcount+=a[i]\r\n\t\t\telse:\r\n\t\t\t\tk = add(disp,2*a[i]) - a[i]\r\n\t\t\t\tcount+= a[i]-k\r\n\t\t\t\tdisp = a[i]\r\n\t\r\nprint(count)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Amr has got a large array of size *n*. Amr doesn't like large arrays so he intends to make it smaller.\n\nAmr doesn't care about anything in the array except the beauty of it. The beauty of the array is defined to be the maximum number of times that some number occurs in this array. He wants to choose the smallest subsegment of this array such that the beauty of it will be the same as the original array.\n\nHelp Amr by choosing the smallest subsegment possible.",
"input": "",
"output": "```python\nn=int(input())\r\na=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n if(a[i] in d):\r\n d[a[i]]=[d[a[i]][0],i+1]\r\n else:\r\n d[a[i]]=[i+1,i+1]\r\nd1={}\r\nfor i in a:\r\n if(i in d1):\r\n d1[i]+=1\r\n else:\r\n d1[i]=1\r\nb=list(d1.items())\r\nb.sort(reverse=True,key=lambda x:x[1])\r\nym=b[0][1]\r\nm=9999999\r\ns=e=-1\r\nfor i in b:\r\n x,y=i[0],i[1]\r\n if(y!=ym):\r\n break\r\n if(d[x][1]-d[x][0]3:\r\n print('NO')\r\nelif len(set(l))<3:\r\n print('YES')\r\nelse:\r\n for i in set(l):\r\n if i!=ma and i!=mi:\r\n me=i\r\n if ma-me==me-mi:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Year 2118. Androids are in mass production for decades now, and they do all the work for humans. But androids have to go to school to be able to solve creative tasks. Just like humans before.\n\nIt turns out that high school struggles are not gone. If someone is not like others, he is bullied. Vasya-8800 is an economy-class android which is produced by a little-known company. His design is not perfect, his characteristics also could be better. So he is bullied by other androids.\n\nOne of the popular pranks on Vasya is to force him to compare $x^y$ with $y^x$. Other androids can do it in milliseconds while Vasya's memory is too small to store such big numbers.\n\nPlease help Vasya! Write a fast program to compare $x^y$ with $y^x$ for Vasya, maybe then other androids will respect him.",
"input": "",
"output": "```python\n\r\nx , y = map(int,input().split())\r\n\r\nif x == y :\r\n print('=')\r\n exit()\r\n\r\nif x == 1 :\r\n print('<')\r\n exit()\r\n\r\nif y == 1 :\r\n print('>')\r\n exit()\r\n\r\nelse:\r\n if x > y :\r\n print('<')\r\n\r\n else:\r\n print('>')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The School №0 of the capital of Berland has *n* children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each child we know value *t**i*:\n - *t**i*<==<=1, if the *i*-th child is good at programming, - *t**i*<==<=2, if the *i*-th child is good at maths, - *t**i*<==<=3, if the *i*-th child is good at PE \nEach child happens to be good at exactly one of these three subjects.\n\nThe Team Scientific Decathlon Olympias requires teams of three students. The school teachers decided that the teams will be composed of three children that are good at different subjects. That is, each team must have one mathematician, one programmer and one sportsman. Of course, each child can be a member of no more than one team.\n\nWhat is the maximum number of teams that the school will be able to present at the Olympiad? How should the teams be formed for that?",
"input": "",
"output": "```python\nn = int(input())\r\nins = [int(x) for x in input().split(\" \")]\r\nins123 = [[] , [] , []]\r\n\r\nfor index in range(n):\r\n ins123[ins[index] - 1].append(index)\r\n\r\nminSize = min([len(x) for x in ins123])\r\n\r\nprint(minSize)\r\nfor i in range(minSize):\r\n for j in ins123:\r\n print(j.pop(0)+1 , end = \" \")\r\n print()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A permutation is a sequence of integers from 1 to *n* of length *n* containing each number exactly once. For example, (1), (4,<=3,<=5,<=1,<=2), (3,<=2,<=1) are permutations, and (1,<=1), (4,<=3,<=1), (2,<=3,<=4) are not. \n\nThere are many tasks on permutations. Today you are going to solve one of them. Let’s imagine that somebody took several permutations (perhaps, with a different number of elements), wrote them down consecutively as one array and then shuffled the resulting array. The task is to restore the initial permutations if it is possible.",
"input": "",
"output": "```python\nfrom collections import Counter\n\ndef permutations(n, array):\n\tperms = []\n\tcounter = Counter(array)\n\tperms = [[] for x in range(counter.most_common(1)[0][1])]\n\n\tsorted_a = sorted(array)\n\t\n\tprev = 0\n\tj = 0\n\tfor i in range(0, len(sorted_a)):\n\t\tif sorted_a[i] == prev:\n\t\t\tj = j+1\n\t\telif sorted_a[i] == prev + 1:\n\t\t\tj = 0\n\t\telse:\n\t\t\tprint(-1)\n\t\t\treturn\n\t\tperms[j].append(sorted_a[i])\n\t\tprev = sorted_a[i]\n\n\tif len(perms) > counter.get(1):\n\t\tprint(-1)\n\t\treturn\n\n\ts = \"\"\n\tfor i in array:\n\t\tfor index, j in enumerate(perms):\n\t\t\tif i in j:\n\t\t\t\ts += str(index + 1) + \" \"\n\t\t\t\tj.remove(i)\n\t\t\t\tbreak\n\n\tprint(len(perms))\n\tprint(s)\n\treturn \n\n\nnb = int(input())\nnumbers = [int(i) for i in input().split(' ')]\n\n\npermutations(nb, numbers)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sengoku still remembers the mysterious \"colourful meteoroids\" she discovered with Lala-chan when they were little. In particular, one of the nights impressed her deeply, giving her the illusion that all her fancies would be realized.\n\nOn that night, Sengoku constructed a permutation *p*1,<=*p*2,<=...,<=*p**n* of integers from 1 to *n* inclusive, with each integer representing a colour, wishing for the colours to see in the coming meteor outburst. Two incredible outbursts then arrived, each with *n* meteorids, colours of which being integer sequences *a*1,<=*a*2,<=...,<=*a**n* and *b*1,<=*b*2,<=...,<=*b**n* respectively. Meteoroids' colours were also between 1 and *n* inclusive, and the two sequences were not identical, that is, at least one *i* (1<=≤<=*i*<=≤<=*n*) exists, such that *a**i*<=≠<=*b**i* holds.\n\nWell, she almost had it all — each of the sequences *a* and *b* matched exactly *n*<=-<=1 elements in Sengoku's permutation. In other words, there is exactly one *i* (1<=≤<=*i*<=≤<=*n*) such that *a**i*<=≠<=*p**i*, and exactly one *j* (1<=≤<=*j*<=≤<=*n*) such that *b**j*<=≠<=*p**j*.\n\nFor now, Sengoku is able to recover the actual colour sequences *a* and *b* through astronomical records, but her wishes have been long forgotten. You are to reconstruct any possible permutation Sengoku could have had on that night.",
"input": "",
"output": "```python\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nrazl = []\r\nfor i in range(n):\r\n\tif a[i]!=b[i]:\r\n\t\trazl.append(i)\r\nif len(razl)==1:\r\n\tfor i in range(n):\r\n\t\tif i!=a[razl[0]] and i!=b[razl[0]] and (i not in a):\r\n\t\t\ta[razl[0]]=i \r\n\t\t\tbreak\r\nelse:\r\n\tif (b[razl[0]] not in a) and (a.count(a[razl[1]])==1) and (a[razl[1]]!=b[razl[0]]):\r\n\t\ta[razl[0]] = b[razl[0]]\r\n\telse:\r\n\t\ta[razl[1]] = b[razl[1]]\r\nfor i in a:\r\n\tprint(i, end=' ')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You're given a row with $n$ chairs. We call a seating of people \"maximal\" if the two following conditions hold:\n 1. There are no neighbors adjacent to anyone seated. 1. It's impossible to seat one more person without violating the first rule. \nThe seating is given as a string consisting of zeros and ones ($0$ means that the corresponding seat is empty, $1$ — occupied). The goal is to determine whether this seating is \"maximal\".\n\nNote that the first and last seats are not adjacent (if $n \\ne 2$).",
"input": "",
"output": "```python\nn = int(input())\r\ns = input()\r\nadj_ones = False\r\nbig_gap = False\r\ngap = 0 if s[0]=='1' else 1\r\n\r\nif n == 1:\r\n print('Yes' if s[0]=='1' else 'No')\r\nelse:\r\n for i in range(1, n):\r\n if s[i]=='1':\r\n if s[i-1] == '1':\r\n adj_ones = True \r\n break \r\n gap = 0 \r\n else:\r\n gap += 1\r\n if gap > 2:\r\n big_gap = True \r\n break \r\n \r\n if big_gap or adj_ones:\r\n print('No')\r\n else:\r\n print('Yes')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* walruses standing in a queue in an airport. They are numbered starting from the queue's tail: the 1-st walrus stands at the end of the queue and the *n*-th walrus stands at the beginning of the queue. The *i*-th walrus has the age equal to *a**i*.\n\nThe *i*-th walrus becomes displeased if there's a younger walrus standing in front of him, that is, if exists such *j* (*i*<=<<=*j*), that *a**i*<=><=*a**j*. The displeasure of the *i*-th walrus is equal to the number of walruses between him and the furthest walrus ahead of him, which is younger than the *i*-th one. That is, the further that young walrus stands from him, the stronger the displeasure is.\n\nThe airport manager asked you to count for each of *n* walruses in the queue his displeasure.",
"input": "",
"output": "```python\n#!/usr/bin/env python3\n\nnum_lines = input()\nraw = input()\nitems = raw.split(\" \")\ntemp = []\n\nfor i in range(len(items)):\n count = len(items) - i - 2\n j = len(items) - 1\n while (j > i):\n if(int(items[j]) < int(items[i])):\n break\n count = count - 1\n j = j - 1\n temp.append(count)\n\nprint(temp)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In Berland it is the holiday of equality. In honor of the holiday the king decided to equalize the welfare of all citizens in Berland by the expense of the state treasury. \n\nTotally in Berland there are *n* citizens, the welfare of each of them is estimated as the integer in *a**i* burles (burle is the currency in Berland).\n\nYou are the royal treasurer, which needs to count the minimum charges of the kingdom on the king's present. The king can only give money, he hasn't a power to take away them.",
"input": "",
"output": "```python\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = max(welfare_values)\r\nc = sum(b - welfare for welfare in a)\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Quite recently, a very smart student named Jury decided that lectures are boring, so he downloaded a game called \"Black Square\" on his super cool touchscreen phone.\n\nIn this game, the phone's screen is divided into four vertical strips. Each second, a black square appears on some of the strips. According to the rules of the game, Jury must use this second to touch the corresponding strip to make the square go away. As Jury is both smart and lazy, he counted that he wastes exactly *a**i* calories on touching the *i*-th strip.\n\nYou've got a string *s*, describing the process of the game and numbers *a*1,<=*a*2,<=*a*3,<=*a*4. Calculate how many calories Jury needs to destroy all the squares?",
"input": "",
"output": "```python\ns1=input()\r\ns1=s1.split()\r\na1=int(s1[0])\r\nb1=int(s1[1])\r\nc1=int(s1[2])\r\nd1=int(s1[3])\r\ns2=input()\r\na=0\r\nb=0\r\nc=0\r\nd=0\r\nfor i in range(len(s2)):\r\n if s2[i]=='1':\r\n a=a+1\r\n elif s2[i]=='2':\r\n b=b+1\r\n elif s2[i]=='3':\r\n c=c+1\r\n else:\r\n d=d+1\r\nA=a1*a\r\nB=b1*b\r\nC=c1*c\r\nD=d1*d\r\no=A+B+C+D\r\nprint(o)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Consider some square matrix *A* with side *n* consisting of zeros and ones. There are *n* rows numbered from 1 to *n* from top to bottom and *n* columns numbered from 1 to *n* from left to right in this matrix. We'll denote the element of the matrix which is located at the intersection of the *i*-row and the *j*-th column as *A**i*,<=*j*.\n\nLet's call matrix *A* clear if no two cells containing ones have a common side.\n\nLet's call matrix *A* symmetrical if it matches the matrices formed from it by a horizontal and/or a vertical reflection. Formally, for each pair (*i*,<=*j*) (1<=≤<=*i*,<=*j*<=≤<=*n*) both of the following conditions must be met: *A**i*,<=*j*<==<=*A**n*<=-<=*i*<=+<=1,<=*j* and *A**i*,<=*j*<==<=*A**i*,<=*n*<=-<=*j*<=+<=1.\n\nLet's define the sharpness of matrix *A* as the number of ones in it.\n\nGiven integer *x*, your task is to find the smallest positive integer *n* such that there exists a clear symmetrical matrix *A* with side *n* and sharpness *x*.",
"input": "",
"output": "```python\nx = int(input())\r\nfor i in range(100):\r\n if (i % 2 == 1):\r\n if ((i * i + 1) // 2 >= x):\r\n print(i)\r\n break\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bob is a farmer. He has a large pasture with many sheep. Recently, he has lost some of them due to wolf attacks. He thus decided to place some shepherd dogs in such a way that all his sheep are protected.\n\nThe pasture is a rectangle consisting of *R*<=×<=*C* cells. Each cell is either empty, contains a sheep, a wolf or a dog. Sheep and dogs always stay in place, but wolves can roam freely around the pasture, by repeatedly moving to the left, right, up or down to a neighboring cell. When a wolf enters a cell with a sheep, it consumes it. However, no wolf can enter a cell with a dog.\n\nInitially there are no dogs. Place dogs onto the pasture in such a way that no wolf can reach any sheep, or determine that it is impossible. Note that since you have many dogs, you do not need to minimize their number.",
"input": "",
"output": "```python\nR=raw_input\r\nr,c=map(int,R().split())\r\ns='\\n'.join(R().replace('.','D')for _ in[0]*r)\r\nprint'No'if['S','W']in map(sorted,zip(s,s[1:])+zip(s,s[c+1:]))else'Yes\\n'+s\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a weighted undirected graph. The vertices are enumerated from 1 to *n*. Your task is to find the shortest path between the vertex 1 and the vertex *n*.",
"input": "",
"output": "```python\nfrom collections import defaultdict\r\nfrom heapq import *\r\n\r\ndef dijkstra(edges, f, t):\r\n g = defaultdict(list)\r\n for l,r,c in edges:\r\n g[l].append((c,r))\r\n\r\n q = [(0,f,())]\r\n seen = set()\r\n mins = {f: 0}\r\n while q:\r\n (cost,v1,path) = heappop(q)\r\n if v1 not in seen:\r\n seen.add(v1)\r\n path = (v1, path)\r\n if v1 == t: \r\n return (cost, path)\r\n\r\n for c, v2 in g.get(v1, ()):\r\n if v2 in seen: \r\n continue\r\n prev = mins.get(v2, None)\r\n next = cost + c\r\n \r\n if prev is None or next < prev:\r\n mins[v2] = next\r\n heappush(q, (next, v2, path))\r\n\r\n return float(\"inf\")\r\n\r\nif __name__ == \"__main__\":\r\n FirstInput = input()\r\n FirstInput=[int(s) for s in FirstInput.split(' ')]\r\n\r\n Element = FirstInput[0]\r\n SecondEle = FirstInput[1]\r\n edges = []\r\n for x in range(SecondEle):\r\n vertices = input()\r\n vertices=[int(s) for s in vertices.split(' ')]\r\n edges.append(tuple([vertices[0], vertices[1], vertices[2]]))\r\n edges.append(list([vertices[1], vertices[0], vertices[2]]))\r\n\r\n make_path = lambda list: (*make_path(list[1]), list[0]) if list else ()\r\n\r\n out = dijkstra(edges, 1, Element)\r\n if(str(out)==\"inf\"):\r\n print( -1)\r\n else:\r\n path = make_path(out[1])\r\n length = len(path)\r\n for p in path: \r\n print (p, end=\" \")\r\n print()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Oleg writes down the history of the days he lived. For each day he decides if it was good or bad. Oleg calls a non-empty sequence of days a zebra, if it starts with a bad day, ends with a bad day, and good and bad days are alternating in it. Let us denote bad days as 0 and good days as 1. Then, for example, sequences of days 0, 010, 01010 are zebras, while sequences 1, 0110, 0101 are not.\n\nOleg tells you the story of days he lived in chronological order in form of string consisting of 0 and 1. Now you are interested if it is possible to divide Oleg's life history into several subsequences, each of which is a zebra, and the way it can be done. Each day must belong to exactly one of the subsequences. For each of the subsequences, days forming it must be ordered chronologically. Note that subsequence does not have to be a group of consecutive days.",
"input": "",
"output": "```python\n# Codeforces Submission\n# User : sudoSieg\n# Time : 14:50:08\n# Date : 21/10/2020\n\nimport io\nimport os\n#input = lambda: io.BytesIO(os.read(0, os.fstat(0).st_size)).readline().strip()\nvalid = True\ns = input()\nze = []\noe = []\n\nfor i, j in enumerate(s):\n if j == '0':\n if len(oe) != 0:\n x = oe.pop()\n x.append(i + 1)\n ze.append(x)\n else:\n ze.append([i + 1])\n else:\n if len(ze) != 0:\n x = ze.pop()\n x.append(i + 1)\n oe.append(x)\n else:\n print(\"-1\")\n exit()\nif len(oe) != 0:\n print(-1)\nelse:\n print(len(ze))\n for i in ze:\n print(len(i), end=' ')\n print(*i)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given *n*<=×<=*m* table. Each cell of the table is colored white or black. Find the number of non-empty sets of cells such that:\n 1. All cells in a set have the same color. 1. Every two cells in a set share row or column.",
"input": "",
"output": "```python\nn, m = map(int, input().split())\r\ns = n*m\r\na = []\r\nfor i in range(n):\r\n b = [int(c) for c in input().split()]\r\n s1 = 0\r\n s2 = 0\r\n a.append(b)\r\n for i in range(m):\r\n if b[i]==1:\r\n s1+=1\r\n else:\r\n s2+=1\r\n s+=((s1-1)*s1)//2\r\n s+=((s2-1)*s2)//2\r\nfor i in range(m):\r\n s1 = 0\r\n s2 = 0\r\n for j in range(n):\r\n if a[j][i]==1:\r\n s1+=1\r\n else:\r\n s2+=1\r\n s += ((s1 - 1) * s1) // 2\r\n s += ((s2 - 1) * s2) // 2\r\nprint(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Joty has got a task to do. She has a line of *n* tiles indexed from 1 to *n*. She has to paint them in a strange pattern.\n\nAn unpainted tile should be painted Red if it's index is divisible by *a* and an unpainted tile should be painted Blue if it's index is divisible by *b*. So the tile with the number divisible by *a* and *b* can be either painted Red or Blue.\n\nAfter her painting is done, she will get *p* chocolates for each tile that is painted Red and *q* chocolates for each tile that is painted Blue.\n\nNote that she can paint tiles in any order she wants.\n\nGiven the required information, find the maximum number of chocolates Joty can get.",
"input": "",
"output": "```python\ndef compute():\n\n def gcd(a,b):\n return a if b==0 else gcd(b,a%b)\n\n def lcm(a,b):\n return a*(b//gcd(a,b))\n\n n, a, b, p, q = map(int,input().split())\n return (n//a)*p + (n//b)*q - (n//(lcm(a,b)))*min(p,q)\n\nif __name__==\"__main__\":\n print(compute())\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ternary numeric notation is quite popular in Berland. To telegraph the ternary number the Borze alphabet is used. Digit 0 is transmitted as «.», 1 as «-.» and 2 as «--». You are to decode the Borze code, i.e. to find out the ternary number given its representation in Borze alphabet.",
"input": "",
"output": "```python\ns=input()\r\nindex=0\r\nans=\"\"\r\nwhile index a[1]:\r\n Chris += 1\r\n timer += 1\r\nif Mishka == Chris:\r\n print('Friendship is magic!^^')\r\nelif Mishka > Chris:\r\n print('Mishka')\r\nelif Mishka < Chris:\r\n print('Chris')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two integers *n* and *k*. Find *k*-th smallest divisor of *n*, or report that it doesn't exist.\n\nDivisor of *n* is any such natural number, that *n* can be divided by it without remainder.",
"input": "",
"output": "```python\nimport math as m\r\nn,k = map(int,input().split())\r\nf = []\r\ns = []\r\nfor x in range(1,int(m.sqrt(n))+1):\r\n\tif n%x == 0:\r\n\t\tf.append(x)\r\n\t\tif n//x not in f:\r\n\t\t\ts.append(n//x)\r\nc = f+s[::-1]\r\ntry:\r\n\tprint(c[k-1])\r\nexcept:\r\n\tprint(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kefa decided to make some money doing business on the Internet for exactly *n* days. He knows that on the *i*-th day (1<=≤<=*i*<=≤<=*n*) he makes *a**i* money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence *a**i*. Let us remind you that the subsegment of the sequence is its continuous fragment. A subsegment of numbers is called non-decreasing if all numbers in it follow in the non-decreasing order.\n\nHelp Kefa cope with this task!",
"input": "",
"output": "```python\nn = int(input())\r\nx = [int(x) for x in input().split(' ')]\r\n\r\nl = []\r\ncount = 1\r\n\r\nfor i in range (1,n) :\r\n if x[i] >= x[i-1] :\r\n count += 1\r\n else :\r\n l.append(count)\r\n count = 1\r\n\r\nl.sort\r\n\r\nprint(l[(len(l)-1)])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once little Vasya read an article in a magazine on how to make beautiful handmade garland from colored paper. Vasya immediately went to the store and bought *n* colored sheets of paper, the area of each sheet is 1 square meter.\n\nThe garland must consist of exactly *m* pieces of colored paper of arbitrary area, each piece should be of a certain color. To make the garland, Vasya can arbitrarily cut his existing colored sheets into pieces. Vasya is not obliged to use all the sheets to make the garland.\n\nVasya wants the garland to be as attractive as possible, so he wants to maximize the total area of *m* pieces of paper in the garland. Calculate what the maximum total area of the pieces of paper in the garland Vasya can get.",
"input": "",
"output": "```python\ns, a, b = 0, defaultdict(int), defaultdict(int)\r\nfor i in input(): a[i] += 1\r\nfor i in input(): b[i] += 1\r\nfor i in b:\r\n if i in a: s += min(a[i], b[i])\r\n else:\r\n s = -1\r\n break\r\nprint(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently, you bought a brand new smart lamp with programming features. At first, you set up a schedule to the lamp. Every day it will turn power on at moment $0$ and turn power off at moment $M$. Moreover, the lamp allows you to set a program of switching its state (states are \"lights on\" and \"lights off\"). Unfortunately, some program is already installed into the lamp.\n\nThe lamp allows only good programs. Good program can be represented as a non-empty array $a$, where $0 < a_1 < a_2 < \\dots < a_{|a|} < M$. All $a_i$ must be integers. Of course, preinstalled program is a good program.\n\nThe lamp follows program $a$ in next manner: at moment $0$ turns power and light on. Then at moment $a_i$ the lamp flips its state to opposite (if it was lit, it turns off, and vice versa). The state of the lamp flips instantly: for example, if you turn the light off at moment $1$ and then do nothing, the total time when the lamp is lit will be $1$. Finally, at moment $M$ the lamp is turning its power off regardless of its state.\n\nSince you are not among those people who read instructions, and you don't understand the language it's written in, you realize (after some testing) the only possible way to alter the preinstalled program. You can insert at most one element into the program $a$, so it still should be a good program after alteration. Insertion can be done between any pair of consecutive elements of $a$, or even at the begining or at the end of $a$.\n\nFind such a way to alter the program that the total time when the lamp is lit is maximum possible. Maybe you should leave program untouched. If the lamp is lit from $x$ till moment $y$, then its lit for $y - x$ units of time. Segments of time when the lamp is lit are summed up.",
"input": "",
"output": "```python\nimport copy\r\nn, m = map(int, input().split())\r\ns = [int(x) for x in input().split()]\r\ns=[0]+s+[m]\r\ncount_set = set()\r\n\r\ns1=copy.copy(s)\r\ns2=copy.copy(s)\r\n\r\ncount2=0\r\ncount3=0\r\nif n>1:\r\n for i2 in range(2, n+2,2):\r\n s2.insert(i2,s[i2-1]+1)\r\n \r\n for j2 in range(1,n+3,2):\r\n count2 = count2+s2[j2]-s2[j2-1]\r\n count_set.add(count2)\r\n count2=0\r\n s2=copy.copy(s)\r\n for i3 in range(1,n+2,2):\r\n count3=count3+s[i3]-s[i3-1]\r\n count_set.add(count3)\r\n print(max(count_set))\r\nelse:\r\n print(m-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are *n* drinks in his fridge, the volume fraction of orange juice in the *i*-th drink equals *p**i* percent.\n\nOne day Vasya decided to make himself an orange cocktail. He took equal proportions of each of the *n* drinks and mixed them. Then he wondered, how much orange juice the cocktail has.\n\nFind the volume fraction of orange juice in the final drink.",
"input": "",
"output": "```python\nx=int(input())\r\np=[int(x) for x in input().split()]\r\nprint(p/sum(p))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have a positive integer *m* and a non-negative integer *s*. Your task is to find the smallest and the largest of the numbers that have length *m* and sum of digits *s*. The required numbers should be non-negative integers written in the decimal base without leading zeroes.",
"input": "",
"output": "```python\nn, sum = map(int, input().split())\nfrom copy import deepcopy\nif sum > (n*9) or sum == 0:\n print(-1, -1)\nelse:\n max_nums = []\n min_nums = []\n total_sum = sum\n for i in range(n):\n if sum >= 9:\n to_append = 9\n else:\n to_append = sum\n sum -= to_append\n max_nums.append(to_append)\n for i in range(n):\n m = total_sum - (n-(i+1))\n to_append = abs(min(9, m))\n total_sum -= to_append\n min_nums.append(to_append)\n min_nums.reverse()\n if min_nums[0] == 0:\n for i in range(n):\n if min_nums[i] > 0:\n min_nums[0], min_nums[i] = min_nums[i], min_nums[0]\n break\n \n print(''.join(str(i) for i in min_nums), ''.join(str(i) for i in max_nums))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp is a beginner programmer. He is studying how to use a command line.\n\nPolycarp faced the following problem. There are *n* files in a directory and he needs to delete some of them. Polycarp wants to run a single delete command with filename pattern as an argument. All the files to be deleted should match the pattern and all other files shouldn't match the pattern.\n\nPolycarp doesn't know about an asterisk '*', the only special character he knows is a question mark '?' which matches any single character. All other characters in the pattern match themselves only.\n\nFormally, a pattern matches a filename if and only if they have equal lengths and all characters in the corresponding positions are equal except when the character in the pattern is '?', in which case the corresponding filename character does not matter.\n\nFor example, the filename pattern \"a?ba?\":\n - matches filenames \"aabaa\", \"abba.\", \"a.ba9\" and \"a.ba.\"; - does not match filenames \"aaba\", \"abaab\", \"aabaaa\" and \"aabaa.\". \nHelp Polycarp find a pattern which matches files to be deleted and only them or report if there is no such pattern.",
"input": "",
"output": "```python\nnum_file,num_delete = map(int, input().split())\r\nlist_file = []\r\nfor i in range(num_file):\r\n list_file.append(input())\r\ndelete_file = [int(i)-1 for i in input().split()]\r\nans=\"\"\r\ndelete_list = sorted([list_file[i]for i in delete_file],key=len)\r\ntmp = list(delete_list[0])\r\nlenght = len(tmp)\r\nno = 0\r\nfor i in delete_list[1:]:\r\n name = list(i)\r\n if lenght != len(i):\r\n no = 1\r\n for j in range(len(tmp)):\r\n if name[j] != tmp[j]:\r\n tmp[j] = \"?\"\r\nif tmp == ['?'] or no:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n for c in tmp:\r\n print(c,end=\"\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Some dwarves that are finishing the StUDY (State University for Dwarven Youngsters) Bachelor courses, have been told \"no genome, no degree\". That means that all dwarves should write a thesis on genome. Dwarven genome is far from simple. It is represented by a string that consists of lowercase Latin letters.\n\nDwarf Misha has already chosen the subject for his thesis: determining by two dwarven genomes, whether they belong to the same race. Two dwarves belong to the same race if we can swap two characters in the first dwarf's genome and get the second dwarf's genome as a result. Help Dwarf Misha and find out whether two gnomes belong to the same race or not.",
"input": "",
"output": "```python\ns1 = input()\r\ns2 = input()\r\nif len(s1) != len(s2):\r\n\tprint('NO')\r\n\texit()\r\nc = 0\r\nfor i in range(len(s1)):\r\n\tif s1[i] != s2[i]:\r\n\t\tc += 1\r\nif len(s1) <= 2:\r\n\tif c == 2 or c == 0:\r\n\t\tprint('YES')\r\n\t\texit()\r\n\telse:\r\n\t\tprint('NO')\r\n\t\texit()\r\nif c > 2:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.\n\nHowever, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every *k*-th dragon got punched in the face with a frying pan. Every *l*-th dragon got his tail shut into the balcony door. Every *m*-th dragon got his paws trampled with sharp heels. Finally, she threatened every *n*-th dragon to call her mom, and he withdrew in panic.\n\nHow many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of *d* dragons?",
"input": "",
"output": "```python\nimport sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x))\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10\r\n# from functools import cmp_to_key\r\n\r\np=[]\r\nfor i in range(4):\r\n p.append(int(input()))\r\nd=int(input())\r\nN=d+10\r\nst=[0]*N\r\nfor i in range(4):\r\n x=p[i]\r\n while x<=d:\r\n st[x]=1\r\n x+=p[i]\r\ncnt=0\r\nfor i in range(1,d+1):\r\n cnt+=st[i]\r\nprint(cnt)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera has got four horseshoes left from the last year, but maybe some of them have the same color. In this case he needs to go to the store and buy some few more horseshoes, not to lose face in front of his stylish comrades.\n\nFortunately, the store sells horseshoes of all colors under the sun and Valera has enough money to buy any four of them. However, in order to save the money, he would like to spend as little money as possible, so you need to help Valera and determine what is the minimum number of horseshoes he needs to buy to wear four horseshoes of different colors to a party.",
"input": "",
"output": "```python\na=list(set(list(map(int,input().split()))))\r\nprint(4-len(a))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. *n* of the students use pieces made of two blocks and *m* of the students use pieces made of three blocks.\n\nThe students don’t want to use too many blocks, but they also want to be unique, so no two students’ towers may contain the same number of blocks. Find the minimum height necessary for the tallest of the students' towers.",
"input": "",
"output": "```python\nn, m = [int(x) for x in input().split()]\nh1 = lambda k: 6*((k-1)//2) + 2*((k-1)%2+1) if k > 0 else 0\nh2 = lambda k: 3 + (k-1)*6 if k > 0 else 0\nh3 = lambda l: 6*k\nnewx = lambda k: k - 2 if k%6 == 4 else k - 4\nnewy = lambda k: k - 6\nx, y, z = h1(n), h2(m), 0\nwhile max(x, y) > z + 6:\n z += 6\n if x > y:\n x = newx(x)\n else:\n y = newy(y)\nprint(max(x, y, z))\n \n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "New Year is coming in Line World! In this world, there are *n* cells numbered by integers from 1 to *n*, as a 1<=×<=*n* board. People live in cells. However, it was hard to move between distinct cells, because of the difficulty of escaping the cell. People wanted to meet people who live in other cells.\n\nSo, user tncks0121 has made a transportation system to move between these cells, to celebrate the New Year. First, he thought of *n*<=-<=1 positive integers *a*1,<=*a*2,<=...,<=*a**n*<=-<=1. For every integer *i* where 1<=≤<=*i*<=≤<=*n*<=-<=1 the condition 1<=≤<=*a**i*<=≤<=*n*<=-<=*i* holds. Next, he made *n*<=-<=1 portals, numbered by integers from 1 to *n*<=-<=1. The *i*-th (1<=≤<=*i*<=≤<=*n*<=-<=1) portal connects cell *i* and cell (*i*<=+<=*a**i*), and one can travel from cell *i* to cell (*i*<=+<=*a**i*) using the *i*-th portal. Unfortunately, one cannot use the portal backwards, which means one cannot move from cell (*i*<=+<=*a**i*) to cell *i* using the *i*-th portal. It is easy to see that because of condition 1<=≤<=*a**i*<=≤<=*n*<=-<=*i* one can't leave the Line World using portals.\n\nCurrently, I am standing at cell 1, and I want to go to cell *t*. However, I don't know whether it is possible to go there. Please determine whether I can go to cell *t* by only using the construted transportation system.",
"input": "",
"output": "```python\na,b=map(int,input().split())\r\nq=[int(w)for w in input().split()]\r\n\r\ne=q[0]\r\n\r\n\r\n\r\n\r\n\r\nfor i in range(a):\r\n e=e+q[e-1]\r\n\r\n if e==b:\r\n print('YES')\r\n exit()\r\n e=q[e-1]\r\n\r\nprint('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A string is called a *k*-string if it can be represented as *k* concatenated copies of some string. For example, the string \"aabaabaabaab\" is at the same time a 1-string, a 2-string and a 4-string, but it is not a 3-string, a 5-string, or a 6-string and so on. Obviously any string is a 1-string.\n\nYou are given a string *s*, consisting of lowercase English letters and a positive integer *k*. Your task is to reorder the letters in the string *s* in such a way that the resulting string is a *k*-string.",
"input": "",
"output": "```python\nimport sys\r\nk = int(input())\r\ns = input()\r\n\r\ncount = {}\r\nfor i in s:\r\n if i in count:\r\n count[i] += 1\r\n else:\r\n count[i] = 1\r\n\r\nbuild = \"\"\r\nfor letter in count:\r\n if count[letter] % k != 0:\r\n print(-1)\r\n sys.exit()\r\n else:\r\n build += letter*(int(count[letter] / k))\r\n\r\nprint(build*k)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer.\n\nAt the start of the day they have *x* ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and Gerda's house even in the night. Each person in the queue wants either to take several ice cream packs for himself and his friends or to give several ice cream packs to Kay and Gerda (carriers that bring ice cream have to stand in the same queue).\n\nIf a carrier with *d* ice cream packs comes to the house, then Kay and Gerda take all his packs. If a child who wants to take *d* ice cream packs comes to the house, then Kay and Gerda will give him *d* packs if they have enough ice cream, otherwise the child will get no ice cream at all and will leave in distress.\n\nKay wants to find the amount of ice cream they will have after all people will leave from the queue, and Gerda wants to find the number of distressed kids.",
"input": "",
"output": "```python\nimport sys\r\nn1,n2 = input().split()\r\nn1,n2=int(n1),int(n2)\r\nnum_in_distress = 0\r\nfor i in range(n1):\r\n n4,n3=input().split()\r\n n3 = int(n3)\r\n if n4==\"-\":\r\n if n2>=n3:\r\n n2 -= n3\r\n else:\r\n num_in_distress += 1\r\n elif n4==\"+\":\r\n n2+=n3\r\nprint(str(n2)+\" \"+str(num_in_distress))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Natasha is going to fly to Mars. She needs to build a rocket, which consists of several stages in some order. Each of the stages is defined by a lowercase Latin letter. This way, the rocket can be described by the string — concatenation of letters, which correspond to the stages.\n\nThere are $n$ stages available. The rocket must contain exactly $k$ of them. Stages in the rocket should be ordered by their weight. So, after the stage with some letter can go only stage with a letter, which is at least two positions after in the alphabet (skipping one letter in between, or even more). For example, after letter 'c' can't go letters 'a', 'b', 'c' and 'd', but can go letters 'e', 'f', ..., 'z'.\n\nFor the rocket to fly as far as possible, its weight should be minimal. The weight of the rocket is equal to the sum of the weights of its stages. The weight of the stage is the number of its letter in the alphabet. For example, the stage 'a 'weighs one ton,' b 'weighs two tons, and' z' — $26$ tons.\n\nBuild the rocket with the minimal weight or determine, that it is impossible to build a rocket at all. Each stage can be used at most once.",
"input": "",
"output": "```python\ndef stages()\t\n\tn=int(input())\n\tk=int(input())\n\ts=input()\n\tw=0\n\tcount1=0\n\tcount2=0\n\tx=[]\n\tfor i in range(n):\n\t\tx.append(ord(s[i])-96)\n\tx.sort()\n\tj=x[0]\n\tw+=x[0]\n\tfor l in range(n):\n\t\tif x[l]-j>=2 and x[l]<=26:\n\t\t\tj=x[l]\n\t\t\tcount1+=1\n\t\t\tif count1<=k-1:\n\t\t\t\tw+=x[l]\n\t\t\t\tcount2+=1\n\tif count2==k-1:\n\t\tprint(w)\n\telse:\n\t\tprint(-1)\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "\"Contestant who earns a score equal to or greater than the *k*-th place finisher's score will advance to the next round, as long as the contestant earns a positive score...\" — an excerpt from contest rules.\n\nA total of *n* participants took part in the contest (*n*<=≥<=*k*), and you already know their scores. Calculate how many participants will advance to the next round.",
"input": "",
"output": "```python\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n if arr[i] > m:\r\n count += 1\r\nprint(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once at a team training Vasya, Petya and Sasha got a problem on implementing linear search in an array.\n\nAccording to the boys, linear search works as follows. The array elements in a pre-selected order are in turn compared with the number that you need to find. Once you find the array element that is equal to the required one, the search ends. The efficiency of the algorithm is the number of performed comparisons. The fewer comparisons the linear search has made, the more effective it is.\n\nVasya believes that a linear search would work better if it sequentially iterates through the elements, starting with the 1-st one (in this problem we consider the elements of the array indexed from 1 to *n*) and ending with the *n*-th one. And Petya says that Vasya is wrong: the search will need less comparisons if it sequentially iterates the elements starting from the *n*-th and ending with the 1-st one. Sasha argues that the two approaches are equivalent.\n\nTo finally begin the task, the teammates decided to settle the debate and compare the two approaches on an example. For this, they took an array that is a permutation of integers from 1 to *n*, and generated *m* queries of the form: find element with value *b**i* in the array. They want to calculate for both approaches how many comparisons in total the linear search will need to respond to all queries. If the first search needs fewer comparisons, then the winner of the dispute is Vasya. If the second one does, then the winner is Petya. If both approaches make the same number of comparisons, then Sasha's got the upper hand.\n\nBut the problem is, linear search is too slow. That's why the boys aren't going to find out who is right before the end of the training, unless you come in here. Help them to determine who will win the dispute.",
"input": "",
"output": "```python\nfrom sys import stdin\r\n\r\ndef main():\r\n n = int(stdin.readline().strip())\r\n a = list(map(int, stdin.readline().strip().split()))\r\n stdin.readline().strip()\r\n b = list(map(int, stdin.readline().strip().split()))\r\n totalV = 0\r\n totalP = 0\r\n for i in b:\r\n pos = a.index(i)\r\n totalV += pos + 1\r\n totalP += n - pos\r\n print(f\"{totalV} {totalP}\")\r\n\r\nmain()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "While Mahmoud and Ehab were practicing for IOI, they found a problem which name was Longest common subsequence. They solved it, and then Ehab challenged Mahmoud with another problem.\n\nGiven two strings *a* and *b*, find the length of their longest uncommon subsequence, which is the longest string that is a subsequence of one of them and not a subsequence of the other.\n\nA subsequence of some string is a sequence of characters that appears in the same order in the string, The appearances don't have to be consecutive, for example, strings \"ac\", \"bc\", \"abc\" and \"a\" are subsequences of string \"abc\" while strings \"abbc\" and \"acb\" are not. The empty string is a subsequence of any string. Any string is a subsequence of itself.",
"input": "",
"output": "```python\na = list(map(str, input()))\r\nb = list(map(str, input()))\r\n\r\n\r\n\r\ndef solve(second, first):\r\n if first == [] or second == first:\r\n return -1\r\n for i in range(len(first)):\r\n if first[i] not in second:\r\n return max(len(second), len(first[i:]))\r\n else:\r\n return solve(second, first[i + 1:])\r\n\r\nprint(solve(a, b))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Let's consider a table consisting of *n* rows and *n* columns. The cell located at the intersection of *i*-th row and *j*-th column contains number *i*<=×<=*j*. The rows and columns are numbered starting from 1.\n\nYou are given a positive integer *x*. Your task is to count the number of cells in a table that contain number *x*.",
"input": "",
"output": "```python\na,b = map(int, input().split())\r\n\r\ny=0\r\nfor i in range(1, a+1):\r\n for j in range(1, a+1):\r\n if int(i*j) == int(b):\r\n y=y+1\r\n\r\nprint(y)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp is a big lover of killing time in social networks. A page with a chatlist in his favourite network is made so that when a message is sent to some friend, his friend's chat rises to the very top of the page. The relative order of the other chats doesn't change. If there was no chat with this friend before, then a new chat is simply inserted to the top of the list.\n\nAssuming that the chat list is initially empty, given the sequence of Polycaprus' messages make a list of chats after all of his messages are processed. Assume that no friend wrote any message to Polycarpus.",
"input": "",
"output": "```python\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n s = input()\r\n arr.append(s)\r\nst = []\r\nfor i in range(n-1,-1,-1):\r\n if arr[i] in st:\r\n continue\r\n else:\r\n st.append(arr[i])\r\n print(arr[i])\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Valera is a collector. Once he wanted to expand his collection with exactly one antique item.\n\nValera knows *n* sellers of antiques, the *i*-th of them auctioned *k**i* items. Currently the auction price of the *j*-th object of the *i*-th seller is *s**ij*. Valera gets on well with each of the *n* sellers. He is perfectly sure that if he outbids the current price of one of the items in the auction (in other words, offers the seller the money that is strictly greater than the current price of the item at the auction), the seller of the object will immediately sign a contract with him.\n\nUnfortunately, Valera has only *v* units of money. Help him to determine which of the *n* sellers he can make a deal with.",
"input": "",
"output": "```python\nn,v = [int(i) for i in input().split()]\r\ncount = 0\r\nans = []\r\narr = []\r\nfor _ in range(n):\r\n lst = [int(i) for i in input().split()]\r\n arr.append(lst)\r\n\r\nfor i in range(len(arr)):\r\n for j in range(1,len(arr[i])):\r\n if arr[i][j]1:\r\n if n%k == 0:\r\n if (n-n//k)*a < b:\r\n\r\n tot+=(n-1)*a\r\n n = 1\r\n break\r\n else:\r\n\r\n tot+=b\r\n n //= k\r\n else:\r\n\r\n tot+=(n%k)*a\r\n n -= n%k\r\nif n == 0:\r\n tot-=a\r\nprint(int(tot))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The bear decided to store some raspberry for the winter. He cunningly found out the price for a barrel of honey in kilos of raspberry for each of the following *n* days. According to the bear's data, on the *i*-th (1<=≤<=*i*<=≤<=*n*) day, the price for one barrel of honey is going to is *x**i* kilos of raspberry.\n\nUnfortunately, the bear has neither a honey barrel, nor the raspberry. At the same time, the bear's got a friend who is ready to lend him a barrel of honey for exactly one day for *c* kilograms of raspberry. That's why the bear came up with a smart plan. He wants to choose some day *d* (1<=≤<=*d*<=<<=*n*), lent a barrel of honey and immediately (on day *d*) sell it according to a daily exchange rate. The next day (*d*<=+<=1) the bear wants to buy a new barrel of honey according to a daily exchange rate (as he's got some raspberry left from selling the previous barrel) and immediately (on day *d*<=+<=1) give his friend the borrowed barrel of honey as well as *c* kilograms of raspberry for renting the barrel.\n\nThe bear wants to execute his plan at most once and then hibernate. What maximum number of kilograms of raspberry can he earn? Note that if at some point of the plan the bear runs out of the raspberry, then he won't execute such a plan.",
"input": "",
"output": "```python\nI=lambda:list(map(int,input().split()))\r\nn,c=I()\r\na=I()\r\nprint(max([a[i]-a[i+1]-c for i in range(n-1)]+[0]))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A string is a palindrome if it reads the same from the left to the right and from the right to the left. For example, the strings \"kek\", \"abacaba\", \"r\" and \"papicipap\" are palindromes, while the strings \"abb\" and \"iq\" are not.\n\nA substring $s[l \\ldots r]$ ($1<=\\leq<=l<=\\leq<=r<=\\leq<=|s|$) of a string $s<==<=s_{1}s_{2} \\ldots s_{|s|}$ is the string $s_{l}s_{l<=+<=1} \\ldots s_{r}$.\n\nAnna does not like palindromes, so she makes her friends call her Ann. She also changes all the words she reads in a similar way. Namely, each word $s$ is changed into its longest substring that is not a palindrome. If all the substrings of $s$ are palindromes, she skips the word at all.\n\nSome time ago Ann read the word $s$. What is the word she changed it into?",
"input": "",
"output": "```python\ns=input(); ans=0; flag=0;\r\nfor t in range(1, len(s)):\r\n for i in range(t):\r\n \r\n p=s[i:t+1]\r\n if len(p)%2==0:\r\n if p[0:(len(p)//2)]!=p[len(p)//2:][::-1]:\r\n ans=max(t-i+1, ans)\r\n else:\r\n if p[0:(len(p)//2)]!=p[len(p)//2+1:][::-1]:\r\n ans=max(len(p), ans)\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.\n\nThe language is that peculiar as it has exactly one variable, called *x*. Also, there are two operations:\n - Operation ++ increases the value of variable *x* by 1. - Operation -- decreases the value of variable *x* by 1. \nA statement in language Bit++ is a sequence, consisting of exactly one operation and one variable *x*. The statement is written without spaces, that is, it can only contain characters \"+\", \"-\", \"X\". Executing a statement means applying the operation it contains.\n\nA programme in Bit++ is a sequence of statements, each of them needs to be executed. Executing a programme means executing all the statements it contains.\n\nYou're given a programme in language Bit++. The initial value of *x* is 0. Execute the programme and find its final value (the value of the variable when this programme is executed).",
"input": "",
"output": "```python\nx=0\nn=input()\nn=int(n)\nkaram=input()\nif karam==(\"++X\")or karam==(\"X++\"):\n x=x+1\nelse:\n x=x-1\nprint(x)\n\t\t \t \t \t \t\t\t\t\t \t \t \t \t\t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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 from any city to any other city using only the given roads. There are *m* cities being attacked by humans. So Ari... we meant Super M have to immediately go to each of the cities being attacked to scare those bad humans. Super M can pass from one city to another only using the given roads. Moreover, passing through one road takes her exactly one kron - the time unit used in Byteforces. \n\nHowever, Super M is not on Byteforces now - she is attending a training camp located in a nearby country Codeforces. Fortunately, there is a special device in Codeforces that allows her to instantly teleport from Codeforces to any city of Byteforces. The way back is too long, so for the purpose of this problem teleportation is used exactly once.\n\nYou are to help Super M, by calculating the city in which she should teleport at the beginning in order to end her job in the minimum time (measured in krons). Also, provide her with this time so she can plan her way back to Codeforces.",
"input": "",
"output": "```python\nimport sys\r\n\r\ndef dfs(v, h):\r\n v.color = True\r\n s = 0\r\n for g in v.nodes:\r\n if not g.color:\r\n s += dfs(g, h + 1)\r\n\r\n if v.a:\r\n s += h\r\n\r\n v.color = False\r\n return s\r\n\r\nclass Node:\r\n def __init__(self, id_):\r\n self.id = id_\r\n self.nodes = []\r\n self.a = False\r\n self.color = False\r\n\r\n#sys.stdin = open('input.txt')\r\n\r\ngoals = []\r\ntowns = []\r\n\r\nn, m = map(int, input().split())\r\nfor i in range(n):\r\n towns.append(Node(i + 1))\r\n goals.append(False)\r\n\r\ni = 0\r\nwhile i < n - 1:\r\n u, v = map(int, input().split())\r\n towns[u - 1].nodes.append(towns[v - 1])\r\n towns[v - 1].nodes.append(towns[u - 1])\r\n i += 1\r\n\r\nst = input().split()\r\nfor t in st:\r\n towns[int(t) - 1].a = True\r\n\r\nmin_p = 123457\r\nmin_id = 123457\r\nfor v in towns:\r\n if len(v.nodes) == 1:\r\n res = dfs(v, 0)\r\n\r\n if res < min_p:\r\n min_p = res\r\n min_id = v.id\r\n\r\nprint(min_id, min_p, sep='\\n')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "An elephant decided to visit his friend. It turned out that the elephant's house is located at point 0 and his friend's house is located at point *x*(*x*<=><=0) of the coordinate line. In one step the elephant can move 1, 2, 3, 4 or 5 positions forward. Determine, what is the minimum number of steps he need to make in order to get to his friend's house.",
"input": "",
"output": "```python\nx= int(input())\r\n\r\nif x < 6:\r\n print(1)\r\nelse:\r\n if x%5 == 0:\r\n print((x//5))\r\n else:\r\n print((x//5)+1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "DZY loves collecting special strings which only contain lowercase letters. For each lowercase letter *c* DZY knows its value *w**c*. For each special string *s*<==<=*s*1*s*2... *s*|*s*| (|*s*| is the length of the string) he represents its value with a function *f*(*s*), where \n\nNow DZY has a string *s*. He wants to insert *k* lowercase letters into this string in order to get the largest possible value of the resulting string. Can you help him calculate the largest possible value he could get?",
"input": "",
"output": "```python\ns = input()\nk = eval(input())\nd = {}\nn = input()\nlst = n.split()\nfor x in range(ord('a'), ord('z') + 1):\n d[chr(x)] = lst[x-ord('a')]\na = 0\nj = 1\nfor i in s:\n a = j*int(d[i]) + a\n j=j+1\na = int(d[max(d, key = d.get)])*k*(len(s) + (k+1)/2) + a\nprint(int(a))\n\n \t\t\t\t\t\t\t \t\t\t \t\t \t \t\t \t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Merge sort is a well-known sorting algorithm. The main function that sorts the elements of array *a* with indices from [*l*,<=*r*) can be implemented as follows:\n 1. If the segment [*l*,<=*r*) is already sorted in non-descending order (that is, for any *i* such that *l*<=≤<=*i*<=<<=*r*<=-<=1 *a*[*i*]<=≤<=*a*[*i*<=+<=1]), then end the function call; 1. Let ; 1. Call *mergesort*(*a*,<=*l*,<=*mid*); 1. Call *mergesort*(*a*,<=*mid*,<=*r*); 1. Merge segments [*l*,<=*mid*) and [*mid*,<=*r*), making the segment [*l*,<=*r*) sorted in non-descending order. The merge algorithm doesn't call any other functions. \nThe array in this problem is 0-indexed, so to sort the whole array, you need to call *mergesort*(*a*,<=0,<=*n*).\n\nThe number of calls of function *mergesort* is very important, so Ivan has decided to calculate it while sorting the array. For example, if *a*<==<={1,<=2,<=3,<=4}, then there will be 1 call of *mergesort* — *mergesort*(0,<=4), which will check that the array is sorted and then end. If *a*<==<={2,<=1,<=3}, then the number of calls is 3: first of all, you call *mergesort*(0,<=3), which then sets *mid*<==<=1 and calls *mergesort*(0,<=1) and *mergesort*(1,<=3), which do not perform any recursive calls because segments (0,<=1) and (1,<=3) are sorted.\n\nIvan has implemented the program that counts the number of *mergesort* calls, but now he needs to test it. To do this, he needs to find an array *a* such that *a* is a permutation of size *n* (that is, the number of elements in *a* is *n*, and every integer number from [1,<=*n*] can be found in this array), and the number of *mergesort* calls when sorting the array is exactly *k*.\n\nHelp Ivan to find an array he wants!",
"input": "",
"output": "```python\nn, k = map(int, input().split())\r\n\r\nif k > n:\r\n print(\"-1\")\r\nelif k == 1:\r\n print(*list(range(1, n+1)))\r\nelse:\r\n l = list(range(1, n+1))\r\n print(*(sorted(l[:k-1], reverse = True)+l[k-1:]))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given *n* numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given *n* numbers finds one that is different in evenness.",
"input": "",
"output": "```python\nimport sys\nmy_file = sys.stdin\n#my_file = open(\"input.txt\", \"r\")\nn = int(my_file.readline())\na = [int(i) for i in my_file.readline().strip().split()]\neven = 0\nodd = 0\nfor i in range(n):\n if a[i]%2 == 0:\n even += 1\n if even == 2:\n break\nif even == 2:\n for i in range(n):\n if a[i]%2 != 0:\n print(i+1)\n break\nelse:\n for i in range(n):\n if a[i]%2 == 0:\n print(i+1)\n break\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\nnums = list(int(input('arr :')))\r\nmulti = nums[0] * nums[1]\r\nprint (multi // 2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mr. Santa asks all the great programmers of the world to solve a trivial problem. He gives them an integer *m* and asks for the number of positive integers *n*, such that the factorial of *n* ends with exactly *m* zeroes. Are you among those great programmers who can solve this problem?",
"input": "",
"output": "```python\ndef factorial(n):\r\n m = n\r\n while n>1:\r\n n -= 1\r\n m = m*n\r\n return m\r\nzeros = int(input())\r\nx = 10**zeros\r\nflag = True\r\ncounter = 0\r\nn = zeros*5\r\n#print(n)\r\nfor i in range(n):\r\n i += 1\r\n if i%78125 == 0:\r\n n-=35\r\n elif i%(5**6) == 0:\r\n n-=25\r\n elif i%(5**5) == 0:\r\n n-=20\r\n elif i%(5**4) == 0:\r\n n-=15\r\n elif i%(5**3) == 0:\r\n n-=10\r\n elif i%(5**2) == 0:\r\n n-=5\r\n #print(i,n)\r\nanswers = []\r\nwhile flag:\r\n if factorial(n)%(x*10) == 0:\r\n flag = False\r\n elif factorial(n)%x == 0:\r\n counter += 1\r\n answers.append(str(n))\r\n n += 1\r\nprint(counter)\r\nprint(\" \".join(answers))\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Due to the increase in the number of students of Berland State University it was decided to equip a new computer room. You were given the task of buying mouses, and you have to spend as little as possible. After all, the country is in crisis!\n\nThe computers bought for the room were different. Some of them had only USB ports, some — only PS/2 ports, and some had both options.\n\nYou have found a price list of a certain computer shop. In it, for *m* mouses it is specified the cost and the type of the port that is required to plug the mouse in (USB or PS/2). Each mouse from the list can be bought at most once.\n\nYou want to buy some set of mouses from the given price list in such a way so that you maximize the number of computers equipped with mouses (it is not guaranteed that you will be able to equip all of the computers), and in case of equality of this value you want to minimize the total cost of mouses you will buy.",
"input": "",
"output": "```python\nusb=[]\r\nps=[]\r\nnc=0\r\npr=0\r\ns=input()\r\ns=s.split()\r\nu=int(s[0])\r\np=int(s[1])\r\nup=int(s[2])\r\nm=int(input())\r\nfor i in range(m):\r\n b=input()\r\n b=b.split()\r\n pri=int(b[0])\r\n ty=b[1]\r\n if ty=='USB':\r\n usb.append(pri)\r\n else:\r\n ps.append(pri)\r\nusb.sort()\r\nps.sort()\r\nif len(usb)<=u:\r\n pr+=sum(usb)\r\n nc+=len(usb)\r\n k1=[]\r\nelse:\r\n for t in range(u):\r\n pr+=usb[t] #itll take the values till u-1 and values from u to len-1 r still not taken\r\n nc+=1\r\n k1=usb[u:len(usb)]\r\nif len(ps)<=p:\r\n pr+=sum(ps)\r\n nc+=len(ps)\r\n k2=[]\r\nelse:\r\n for h in range(p):\r\n pr+=ps[h] #itll take the values till p-1 and values from u to len-1 r still not taken\r\n nc+=1\r\n k2=ps[p:len(ps)]\r\nk=k1+k2\r\nk.sort()\r\n#print('usb:',usb)\r\n#print('ps:',ps)\r\n#print('NC=',nc,'PR=',pr)\r\n#print(k)\r\nif len(k)<=up:\r\n pr+=sum(k)\r\n nc+=len(k)\r\nelse:\r\n for g in range(up):\r\n pr+=k[g] #itll take the values till u-1 and values from u to len-1 r still not taken\r\n nc+=1\r\n \r\nans=str(nc)+' '+str(pr)\r\nprint(ans)\r\n\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular cake, represented as an *r*<=×<=*c* grid. Each cell either has an evil strawberry, or is empty. For example, a 3<=×<=4 cake may look as follows:\n\nThe cakeminator is going to eat the cake! Each time he eats, he chooses a row or a column that does not contain any evil strawberries and contains at least one cake cell that has not been eaten before, and eats all the cake cells there. He may decide to eat any number of times.\n\nPlease output the maximum number of cake cells that the cakeminator can eat.",
"input": "",
"output": "```python\nb = input().split()\nm = int(b[0])\nn = int(b[1])\nst = []\nsr = []\nfor i in range(m):\n g = input()\n for j in range(n):\n if g[j] == 'S':\n st.append(i)\n sr.append(j)\n break\nn1 = len(sr)\nm1 = len(st)\nsum = (m - m1) * n + (n-n1) * m1\nprint(st,sr,sum)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kyoya Ootori is selling photobooks of the Ouran High School Host Club. He has 26 photos, labeled \"a\" to \"z\", and he has compiled them into a photo booklet with some photos in some order (possibly with some photos being duplicated). A photo booklet can be described as a string of lowercase letters, consisting of the photos in the booklet in order. He now wants to sell some \"special edition\" photobooks, each with one extra photo inserted anywhere in the book. He wants to make as many distinct photobooks as possible, so he can make more money. He asks Haruhi, how many distinct photobooks can he make by inserting one extra photo into the photobook he already has?\n\nPlease help Haruhi solve this problem.",
"input": "",
"output": "```python\nl = len(input())\r\nprint((l+1)*26 - l)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Manao works on a sports TV. He's spent much time watching the football games of some country. After a while he began to notice different patterns. For example, each team has two sets of uniforms: home uniform and guest uniform. When a team plays a game at home, the players put on the home uniform. When a team plays as a guest on somebody else's stadium, the players put on the guest uniform. The only exception to that rule is: when the home uniform color of the host team matches the guests' uniform, the host team puts on its guest uniform as well. For each team the color of the home and guest uniform is different.\n\nThere are *n* teams taking part in the national championship. The championship consists of *n*·(*n*<=-<=1) games: each team invites each other team to its stadium. At this point Manao wondered: how many times during the championship is a host team going to put on the guest uniform? Note that the order of the games does not affect this number.\n\nYou know the colors of the home and guest uniform for each team. For simplicity, the colors are numbered by integers in such a way that no two distinct colors have the same number. Help Manao find the answer to his question.",
"input": "",
"output": "```python\nn=int(input())\r\nx,y=zip(*[input().split() for i in ' '*n])\r\nprint(sum([x.count(i) for i in y]))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Squirrel Liss loves nuts. There are *n* trees (numbered 1 to *n* from west to east) along a street and there is a delicious nut on the top of each tree. The height of the tree *i* is *h**i*. Liss wants to eat all nuts.\n\nNow Liss is on the root of the tree with the number 1. In one second Liss can perform one of the following actions:\n - Walk up or down one unit on a tree. - Eat a nut on the top of the current tree. - Jump to the next tree. In this action the height of Liss doesn't change. More formally, when Liss is at height *h* of the tree *i* (1<=≤<=*i*<=≤<=*n*<=-<=1), she jumps to height *h* of the tree *i*<=+<=1. This action can't be performed if *h*<=><=*h**i*<=+<=1. \nCompute the minimal time (in seconds) required to eat all nuts.",
"input": "",
"output": "```python\nn = int(input())\r\n\r\nheight = []\r\ntemp = n\r\n\r\nwhile temp > 0:\r\n height.append(int(input()))\r\n temp -= 1\r\n \r\neat = n\r\njump = n-1\r\n\r\nud = height[0]\r\n\r\nfor i in range(n-1):\r\n ud += abs(height[i] - height[i+1])\r\n \r\nprint(ud + eat + jump)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* cities and *n*<=-<=1 roads in the Seven Kingdoms, each road connects two cities and we can reach any city from any other by the roads.\n\nTheon and Yara Greyjoy are on a horse in the first city, they are starting traveling through the roads. But the weather is foggy, so they can’t see where the horse brings them. When the horse reaches a city (including the first one), it goes to one of the cities connected to the current city. But it is a strange horse, it only goes to cities in which they weren't before. In each such city, the horse goes with equal probabilities and it stops when there are no such cities. \n\nLet the length of each road be 1. The journey starts in the city 1. What is the expected length (expected value of length) of their journey? You can read about expected (average) value by the link [https://en.wikipedia.org/wiki/Expected_value](https://en.wikipedia.org/wiki/Expected_value).",
"input": "",
"output": "```python\nimport collections\r\n\r\n\r\ndef LI():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef I():\r\n return int(input())\r\n\r\n\r\ndef solve():\r\n n = I()\r\n g = {i: collections.deque() for i in range(n)}\r\n for i in range(1, n):\r\n u, v = LI()\r\n u, v = u - 1, v - 1\r\n g[u].append(v)\r\n g[v].append(u)\r\n dp = [0] * n\r\n\r\n def dfs(u: int, f: int):\r\n son = 0\r\n for v in g[u]:\r\n if v == f:\r\n continue\r\n dfs(v, u)\r\n son += 1\r\n dp[u] += dp[v] + 1\r\n if son:\r\n dp[u] /= son\r\n\r\n dfs(0, 0)\r\n print(\"{0:.7f}\".format(dp[0]))\r\n\r\n\r\nsolve()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\nword = input()\r\nn = len(word)\r\nif n > 10:\r\n print(word[0], n, word[n-1],sep=\"\")\r\nelse:\r\n print(word) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp is crazy about round numbers. He especially likes the numbers divisible by 10*k*.\n\nIn the given number of *n* Polycarp wants to remove the least number of digits to get a number that is divisible by 10*k*. For example, if *k*<==<=3, in the number 30020 it is enough to delete a single digit (2). In this case, the result is 3000 that is divisible by 103<==<=1000.\n\nWrite a program that prints the minimum number of digits to be deleted from the given integer number *n*, so that the result is divisible by 10*k*. The result should not start with the unnecessary leading zero (i.e., zero can start only the number 0, which is required to be written as exactly one digit).\n\nIt is guaranteed that the answer exists.",
"input": "",
"output": "```python\ndef solve():\r\n if n == '0':\r\n return 0\r\n cur = 0\r\n for i in range(len(n) - 1, -1, -1):\r\n if n[i] == '0':\r\n cur += 1\r\n if cur == k:\r\n return (len(n) - i - k)\r\n return len(n) - 1\r\n\r\nread = lambda: map(int, input().split())\r\nn, k = read()\r\nn = str(n)\r\nprint(solve())\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Harry Potter is on a mission to destroy You-Know-Who's Horcruxes. The first Horcrux that he encountered in the Chamber of Secrets is Tom Riddle's diary. The diary was with Ginny and it forced her to open the Chamber of Secrets. Harry wants to know the different people who had ever possessed the diary to make sure they are not under its influence.\n\nHe has names of *n* people who possessed the diary in order. You need to tell, for each person, if he/she possessed the diary at some point before or not.\n\nFormally, for a name *s**i* in the *i*-th line, output \"YES\" (without quotes) if there exists an index *j* such that *s**i*<==<=*s**j* and *j*<=<<=*i*, otherwise, output \"NO\" (without quotes).",
"input": "",
"output": "```python\nnumber_of_names = int(input()) # Number of names\nnames = set([\"lucius\", \"ginny\", \"harry\"]) # Initialize the set with specific names\n\nfor i in range(number_of_names):\n name = input().lower() # Convert the name to lowercase for case-insensitive comparison\n if name in names:\n print(\"YES\")\n else:\n print(\"NO\")\n names.add(name) \n\t\t\t\t\t\t \t \t\t\t\t\t \t \t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory. \n\nGeorge and Alex want to live in the same room. The dormitory has *n* rooms in total. At the moment the *i*-th room has *p**i* people living in it and the room can accommodate *q**i* people in total (*p**i*<=≤<=*q**i*). Your task is to count how many rooms has free place for both George and Alex.",
"input": "",
"output": "```python\nnum = int(input())\r\ncount = 0\r\nfor i in range(num):\r\n num1,num2 = map(int,input().split())\r\n if(num1+2 <= num2):\r\n count +=1\r\nprint(count) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "We'll define *S*(*n*) for positive integer *n* as follows: the number of the *n*'s digits in the decimal base. For example, *S*(893)<==<=3, *S*(114514)<==<=6.\n\nYou want to make a consecutive integer sequence starting from number *m* (*m*,<=*m*<=+<=1,<=...). But you need to pay *S*(*n*)·*k* to add the number *n* to the sequence.\n\nYou can spend a cost up to *w*, and you want to make the sequence as long as possible. Write a program that tells sequence's maximum length.",
"input": "",
"output": "```python\ndef S(n):\n lista = [number for number in str(n)]\n return len(lista)\n\nline = input()\nnumbers = line.split(\" \")\nnumbers = [int(x) for x in numbers]\n\nw = numbers[0]\nm = numbers[1]\nk = numbers[2]\n\noutput = 0\nwhile w > 0:\n if w - S(m)*k > 0:\n w -= S(m)*k\n else:\n break\n m += 1\n output += 1\n\nprint(output)\n\n\t\t \t \t \t \t \t \t\t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a straight snowy road, divided into *n* blocks. The blocks are numbered from 1 to *n* from left to right. If one moves from the *i*-th block to the (*i*<=+<=1)-th block, he will leave a right footprint on the *i*-th block. Similarly, if one moves from the *i*-th block to the (*i*<=-<=1)-th block, he will leave a left footprint on the *i*-th block. If there already is a footprint on the *i*-th block, the new footprint will cover the old one.\n\nAt the beginning, there were no footprints. Then polar bear Alice starts from the *s*-th block, makes a sequence of moves and ends in the *t*-th block. It is known that Alice never moves outside of the road. \n\nYou are given the description of Alice's footprints. Your task is to find a pair of possible values of *s*,<=*t* by looking at the footprints.",
"input": "",
"output": "```python\na=int(input())\r\nb=list(input())\r\nprint((a-b.count('R')),(a.b.count('L')))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Those days, many boys use beautiful girls' photos as avatars in forums. So it is pretty hard to tell the gender of a user at the first glance. Last year, our hero went to a forum and had a nice chat with a beauty (he thought so). After that they talked very often and eventually they became a couple in the network. \n\nBut yesterday, he came to see \"her\" in the real world and found out \"she\" is actually a very strong man! Our hero is very sad and he is too tired to love again now. So he came up with a way to recognize users' genders by their user names.\n\nThis is his method: if the number of distinct characters in one's user name is odd, then he is a male, otherwise she is a female. You are given the string that denotes the user name, please help our hero to determine the gender of this user by his method.",
"input": "",
"output": "```python\nif len(input()) % 2 == 0 print(\"CHAT WITH HER!\") else print(\"IGNORE HIM!\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarpus has a ribbon, its length is *n*. He wants to cut the ribbon in a way that fulfils the following two conditions: \n - After the cutting each ribbon piece should have length *a*, *b* or *c*. - After the cutting the number of ribbon pieces should be maximum. \nHelp Polycarpus and find the number of ribbon pieces after the required cutting.",
"input": "",
"output": "```python\nn, a, b, c = map(int, input().split())\r\ndp = [0]*(n+1)\r\nfor i in range(n+1):\r\n if i==0 or dp[i]:\r\n if i+a<=n: dp[i+a] = dp[i]+1\r\n if i+c<=n: dp[i+c] = dp[i]+1\r\n if i+b<=n: dp[i+b] = dp[i]+1\r\nprint(dp[n])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a tree with *n* vertexes and *n* points on a plane, no three points lie on one straight line.\n\nYour task is to paint the given tree on a plane, using the given points as vertexes. \n\nThat is, you should correspond each vertex of the tree to exactly one point and each point should correspond to a vertex. If two vertexes of the tree are connected by an edge, then the corresponding points should have a segment painted between them. The segments that correspond to non-adjacent edges, should not have common points. The segments that correspond to adjacent edges should have exactly one common point.",
"input": "",
"output": "```python\nprint(\"_RANDOM_GUESS_1692431221.2318246\")# 1692431221.231841\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya learns to type. He has an unusual keyboard at his disposal: it is rectangular and it has *n* rows of keys containing *m* keys in each row. Besides, the keys are of two types. Some of the keys have lowercase Latin letters on them and some of the keys work like the \"Shift\" key on standard keyboards, that is, they make lowercase letters uppercase.\n\nVasya can press one or two keys with one hand. However, he can only press two keys if the Euclidean distance between the centers of the keys does not exceed *x*. The keys are considered as squares with a side equal to 1. There are no empty spaces between neighbouring keys.\n\nVasya is a very lazy boy, that's why he tries to type with one hand as he eats chips with his other one. However, it is possible that some symbol can't be typed with one hand only, because the distance between it and the closest \"Shift\" key is strictly larger than *x*. In this case he will have to use his other hand. Having typed the symbol, Vasya returns other hand back to the chips.\n\nYou are given Vasya's keyboard and the text. Count the minimum number of times Vasya will have to use the other hand.",
"input": "",
"output": "```python\nfrom math import floor\r\n\r\n\r\ndef gcd(x, y):\r\n if y == 0:\r\n return x\r\n\r\n return gcd(y, x % y)\r\n\r\n\r\n# =======================================================\r\nn, m, x = map(int, input().split(\" \"))\r\nkeyboard = []\r\nd = {}\r\nfor i in range(n):\r\n keyboard.append(input())\r\n for j in range(m):\r\n if keyboard[i][j] in d:\r\n #print(d.get(keyboard[i][j]))\r\n d.get(keyboard[i][j]).append([i, j])\r\n\r\n else:\r\n d.__setitem__(keyboard[i][j], [[i, j]])\r\nq = int(input())\r\nword = input()\r\nans = 0\r\nx = x * x\r\nfor i in range(q):\r\n found = False\r\n if word[i:i+1].lower() in d:\r\n if word[i:i+1].isupper():\r\n for c_index in d.get(word[i:i+1].lower()):\r\n if 'S' in d:\r\n for s_index in d.get('S'):\r\n if pow(c_index[0] - s_index[0], 2) + pow(c_index[1] - s_index[1], 2) <= x:\r\n found = True\r\n break\r\n if found:\r\n break\r\n else:\r\n print(-1)\r\n exit(0)\r\n if not found:\r\n ans += 1\r\n else:\r\n print(-1)\r\n exit(0)\r\n\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After finishing eating her bun, Alyona came up with two integers *n* and *m*. She decided to write down two columns of integers — the first column containing integers from 1 to *n* and the second containing integers from 1 to *m*. Now the girl wants to count how many pairs of integers she can choose, one from the first column and the other from the second column, such that their sum is divisible by 5.\n\nFormally, Alyona wants to count the number of pairs of integers (*x*,<=*y*) such that 1<=≤<=*x*<=≤<=*n*, 1<=≤<=*y*<=≤<=*m* and equals 0.\n\nAs usual, Alyona has some troubles and asks you to help.",
"input": "",
"output": "```python\na=0\r\nt=0\r\nc,x=map(int,input().split())\r\na=x//5\r\n#print('a=',a)\r\nif x%5==0:\r\n print(a*c)\r\nelif a==0:\r\n print(int((c/5)*x)) \r\nelse:\r\n lst=list(range((a*5)+1,x+1))\r\n #print('lst=',lst) \r\n for z in lst:\r\n # print('z=',z)\r\n e=5-(z%5)\r\n # print('e=',e)\r\n while e<=c : \r\n t+=1\r\n e+=5\r\n# print('t=',t)\r\n# print('eeeeeee=',e)\r\n print((a*c)+t)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a rectangular grid of size $n \\times m$. Each cell has a number written on it; the number on the cell ($i, j$) is $a_{i, j}$. Your task is to calculate the number of paths from the upper-left cell ($1, 1$) to the bottom-right cell ($n, m$) meeting the following constraints:\n - You can move to the right or to the bottom only. Formally, from the cell ($i, j$) you may move to the cell ($i, j + 1$) or to the cell ($i + 1, j$). The target cell can't be outside of the grid. - The xor of all the numbers on the path from the cell ($1, 1$) to the cell ($n, m$) must be equal to $k$ (xor operation is the bitwise exclusive OR, it is represented as '^' in Java or C++ and \"xor\" in Pascal). \nFind the number of such paths in the given grid.",
"input": "",
"output": "```python\nn, m, k = map(int, input().split())\r\na = [list(map(int, input().split())) for i in range(n)]\r\n\r\nma = {}\r\nn1 = (n + m - 2) // 2\r\nfor mask in range(1 << n1):\r\n\ts, x, y = 0, 0, 0\r\n\tfor i in range(n1):\r\n\t\tif not(0 <= x < n and 0 <= y < m):\r\n\t\t\tbreak\r\n\t\ts ^= a[x][y]\r\n\t\tif (mask >> i) & 1:\r\n\t\t\tx += 1\r\n\t\telse:\r\n\t\t\ty += 1\r\n\telse:\r\n\t\tif not(0 <= x < n and 0 <= y < m):\r\n\t\t\tcontinue\r\n\t\ts ^= a[x][y]\r\n\t\tma[(x, y)] = ma.get((x, y), set()) | {s}\r\n\r\nrez = 0\r\nn2 = n + m - 2 - n1\r\nfor mask in range(1 << n2):\r\n\ts, x, y = 0, n-1, m-1\r\n\tfor i in range(n2):\r\n\t\tif not(0 <= x < n and 0 <= y < m):\r\n\t\t\tbreak\r\n\t\ts ^= a[x][y]\r\n\t\tif (mask >> i) & 1:\r\n\t\t\tx -= 1\r\n\t\telse:\r\n\t\t\ty -= 1\r\n\telse:\r\n\t\tif not(0 <= x < n and 0 <= y < m):\r\n\t\t\tcontinue\r\n\t\tif s ^ k in ma[(x, y)]:\r\n\t\t\trez += 1\r\n\r\nprint(rez)\r\n\n# Mon Dec 14 2020 22:02:50 GMT+0300 (Москва, стандартное время)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Valera loves to participate in competitions. Especially in programming contests. Today he has participated in the contest with his team, consisting of *n* students (including Valera). This contest was an individual competition, so each student in the team solved problems individually.\n\nAfter the contest was over, Valera was interested in results. He found out that:\n - each student in the team scored at least *l* points and at most *r* points; - in total, all members of the team scored exactly *s**all* points; - the total score of the *k* members of the team who scored the most points is equal to exactly *s**k*; more formally, if *a*1,<=*a*2,<=...,<=*a**n* is the sequence of points earned by the team of students in the non-increasing order (*a*1<=≥<=*a*2<=≥<=...<=≥<=*a**n*), then *s**k*<==<=*a*1<=+<=*a*2<=+<=...<=+<=*a**k*. \nHowever, Valera did not find out exactly how many points each of *n* students scored. Valera asked you to recover any distribution of scores between the students of the team, such that all the conditions above are met.",
"input": "",
"output": "```python\n\r\n\r\n\r\nfrom collections import deque\r\n\r\nn , k , l , r , st , sk = map(int,input().split())\r\nd = deque()\r\n\r\nif (sk % k == 0):\r\n for i in range(k):\r\n d.append(sk // k)\r\n\r\n rem = st - sk\r\n nums = n - k\r\n if (rem % nums == 0):\r\n for i in range(nums):\r\n d.append(rem // nums)\r\n\r\n else:\r\n v = nums\r\n sm = 0\r\n for j in range(nums):\r\n if (v != 1 ):\r\n d.append(l)\r\n v -=1\r\n sm += l\r\n else:\r\n d.append(rem - sm)\r\n\r\nelse:\r\n r1 = sk // k\r\n r2 = k * r1\r\n r3 = sk - r2\r\n d.append(r3+r1)\r\n for i in range(k - 1):\r\n d.append(r1)\r\n\r\n rem = st - sk\r\n nums = n - k\r\n if (rem % nums == 0):\r\n for i in range(nums):\r\n d.append(rem // nums)\r\n\r\n else:\r\n v = nums\r\n sm = 0\r\n for j in range(nums):\r\n if (v != 1 ):\r\n d.append(l)\r\n v -=1\r\n sm += l\r\n else:\r\n d.append(rem - sm)\r\n\r\n\r\n#print(d)\r\nfor i in d :\r\n print(i , end = ' ')\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently, Anton has found a set. The set consists of small English letters. Anton carefully wrote out all the letters from the set in one line, separated by a comma. He also added an opening curved bracket at the beginning of the line and a closing curved bracket at the end of the line. \n\nUnfortunately, from time to time Anton would forget writing some letter and write it again. He asks you to count the total number of distinct letters in his set.",
"input": "",
"output": "```python\ninput_string = input()\r\nletters = input_string.split(\", \")\r\nset_of_letters = set(letters)\r\nprint(len(set_of_letters))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once Bob took a paper stripe of *n* squares (the height of the stripe is 1 square). In each square he wrote an integer number, possibly negative. He became interested in how many ways exist to cut this stripe into two pieces so that the sum of numbers from one piece is equal to the sum of numbers from the other piece, and each piece contains positive integer amount of squares. Would you help Bob solve this problem?",
"input": "",
"output": "```python\ninput()\nans =0\narr = list(map(int,input().split()))\nfor i in range(len(arr)-1):\n temp = sum(arr[:i+1])\n temp2 = sum(arr[i+1:])\n if temp ==temp2:\n ans +=1\n\nprint(ans)\n \t\t \t \t \t \t \t \t\t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently, Anton has found a set. The set consists of small English letters. Anton carefully wrote out all the letters from the set in one line, separated by a comma. He also added an opening curved bracket at the beginning of the line and a closing curved bracket at the end of the line. \n\nUnfortunately, from time to time Anton would forget writing some letter and write it again. He asks you to count the total number of distinct letters in his set.",
"input": "",
"output": "```python\nprint(len(set(map(str,input()[1:-1].split(',')))))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pasha decided to invite his friends to a tea party. For that occasion, he has a large teapot with the capacity of *w* milliliters and 2*n* tea cups, each cup is for one of Pasha's friends. The *i*-th cup can hold at most *a**i* milliliters of water.\n\nIt turned out that among Pasha's friends there are exactly *n* boys and exactly *n* girls and all of them are going to come to the tea party. To please everyone, Pasha decided to pour the water for the tea as follows:\n - Pasha can boil the teapot exactly once by pouring there at most *w* milliliters of water; - Pasha pours the same amount of water to each girl; - Pasha pours the same amount of water to each boy; - if each girl gets *x* milliliters of water, then each boy gets 2*x* milliliters of water. \nIn the other words, each boy should get two times more water than each girl does.\n\nPasha is very kind and polite, so he wants to maximize the total amount of the water that he pours to his friends. Your task is to help him and determine the optimum distribution of cups between Pasha's friends.",
"input": "",
"output": "```python\np=input().split()\r\nn=int(p[0])\r\nw=int(p[1])\r\nq=input().split()\r\na=[]\r\ns=0\r\nfor i in range(2*n):\r\n a.append(int(q[i]))\r\na.sort()\r\nif a[n]>=2*a[0]:\r\n s=n*a[0]+n*2*a[0]\r\nelse:\r\n s=n*a[n]+n*(a[n]/2)\r\nif s>w:\r\n print(w)\r\nelse:\r\n print(s)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "So, the New Year holidays are over. Santa Claus and his colleagues can take a rest and have guests at last. When two \"New Year and Christmas Men\" meet, thear assistants cut out of cardboard the letters from the guest's name and the host's name in honor of this event. Then the hung the letters above the main entrance. One night, when everyone went to bed, someone took all the letters of our characters' names. Then he may have shuffled the letters and put them in one pile in front of the door.\n\nThe next morning it was impossible to find the culprit who had made the disorder. But everybody wondered whether it is possible to restore the names of the host and his guests from the letters lying at the door? That is, we need to verify that there are no extra letters, and that nobody will need to cut more letters.\n\nHelp the \"New Year and Christmas Men\" and their friends to cope with this problem. You are given both inscriptions that hung over the front door the previous night, and a pile of letters that were found at the front door next morning.",
"input": "",
"output": "```python\na = input()\r\nb = input()\r\nc = input()\r\n\r\nmissing_list = []\r\nachive_words = a+b\r\n\r\n\r\nfor i in achive_words :\r\n if i in c:\r\n c = c.replace(i,\"\",1)\r\n else:\r\n missing_list.append(i)\r\n\r\n\r\nif len(c) > 0 or len(missing_list)> 0 :\r\n print(\"NO\")\r\nelse:\r\n print(\"Yes\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya loves football very much. One day, as he was watching a football match, he was writing the players' current positions on a piece of paper. To simplify the situation he depicted it as a string consisting of zeroes and ones. A zero corresponds to players of one team; a one corresponds to players of another team. If there are at least 7 players of some team standing one after another, then the situation is considered dangerous. For example, the situation 00100110111111101 is dangerous and 11110111011101 is not. You are given the current situation. Determine whether it is dangerous or not.",
"input": "",
"output": "```python\ns = input()\n\ncount = 1\nlast_char = s[0]\ndangerous = False\n\nfor i in range(1, len(s)):\n if s[i] == last_char:\n count += 1\n if count >= 7:\n dangerous = True\n break\n else:\n count = 1\n last_char = s[i]\n\nif dangerous:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\ns = input()\r\n\r\nupper = 0\r\nfor i in s:\r\n\tif i.upper() == i:\r\n\t\tupper += 1\r\n\telse:\r\n\t\tcontinue\r\n\r\nif upper > len(s)-upper:\r\n\tprint(s.upper())\r\nelse:\r\n\tprint(s.lower())\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are *n* drinks in his fridge, the volume fraction of orange juice in the *i*-th drink equals *p**i* percent.\n\nOne day Vasya decided to make himself an orange cocktail. He took equal proportions of each of the *n* drinks and mixed them. Then he wondered, how much orange juice the cocktail has.\n\nFind the volume fraction of orange juice in the final drink.",
"input": "",
"output": "```python\nn=int(input())\r\ns=list(map(int, input().split(' ')))\r\nsum=0\r\nfor i in range(n):\r\n sum+=s[i]\r\nprint(sum/n)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A group of university students wants to get to the top of a mountain to have a picnic there. For that they decided to use a cableway.\n\nA cableway is represented by some cablecars, hanged onto some cable stations by a cable. A cable is scrolled cyclically between the first and the last cable stations (the first of them is located at the bottom of the mountain and the last one is located at the top). As the cable moves, the cablecar attached to it move as well.\n\nThe number of cablecars is divisible by three and they are painted three colors: red, green and blue, in such manner that after each red cablecar goes a green one, after each green cablecar goes a blue one and after each blue cablecar goes a red one. Each cablecar can transport no more than two people, the cablecars arrive with the periodicity of one minute (i. e. every minute) and it takes exactly 30 minutes for a cablecar to get to the top.\n\nAll students are divided into three groups: *r* of them like to ascend only in the red cablecars, *g* of them prefer only the green ones and *b* of them prefer only the blue ones. A student never gets on a cablecar painted a color that he doesn't like,\n\nThe first cablecar to arrive (at the moment of time 0) is painted red. Determine the least time it will take all students to ascend to the mountain top.",
"input": "",
"output": "```python\nr,g,b= list(map(int, input().split(\" \")))\r\nr = ((r+1)/2-1)* 3 + 30\r\ng = ((g+1)/2-1)* 3 + 31\r\nb = ((b+1)/2-1)* 3 + 32\r\nprint(int(max(r,g,b)))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "To make a paper airplane, one has to use a rectangular piece of paper. From a sheet of standard size you can make $s$ airplanes.\n\nA group of $k$ people decided to make $n$ airplanes each. They are going to buy several packs of paper, each of them containing $p$ sheets, and then distribute the sheets between the people. Each person should have enough sheets to make $n$ airplanes. How many packs should they buy?",
"input": "",
"output": "```python\nimport math\nk, s ,n,p = map(int, input().split())\nf=math.ceil(((math.ceil(s/n))*k)/p)\nprint(f)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Yet another Armageddon is coming! This time the culprit is the Julya tribe calendar. \n\nThe beavers in this tribe knew math very well. Smart Beaver, an archaeologist, got a sacred plate with a magic integer on it. The translation from Old Beaverish is as follows: \n\n\"May the Great Beaver bless you! May your chacres open and may your third eye never turn blind from beholding the Truth! Take the magic number, subtract a digit from it (the digit must occur in the number) and get a new magic number. Repeat this operation until a magic number equals zero. The Earth will stand on Three Beavers for the time, equal to the number of subtractions you perform!\"\n\nDistinct subtraction sequences can obviously get you different number of operations. But the Smart Beaver is ready to face the worst and is asking you to count the minimum number of operations he needs to reduce the magic number to zero.",
"input": "",
"output": "```python\nn = int(input())\r\nans = 0\r\nwhile n>0:\r\n i = n\r\n s = 0\r\n while i>0:\r\n s = max(s,i%10)\r\n i=i//10\r\n ans+=1\r\n n-=s\r\n\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Squirrel Liss lived in a forest peacefully, but unexpected trouble happens. Stones fall from a mountain. Initially Squirrel Liss occupies an interval [0,<=1]. Next, *n* stones will fall and Liss will escape from the stones. The stones are numbered from 1 to *n* in order.\n\nThe stones always fall to the center of Liss's interval. When Liss occupies the interval [*k*<=-<=*d*,<=*k*<=+<=*d*] and a stone falls to *k*, she will escape to the left or to the right. If she escapes to the left, her new interval will be [*k*<=-<=*d*,<=*k*]. If she escapes to the right, her new interval will be [*k*,<=*k*<=+<=*d*].\n\nYou are given a string *s* of length *n*. If the *i*-th character of *s* is \"l\" or \"r\", when the *i*-th stone falls Liss will escape to the left or to the right, respectively. Find the sequence of stones' numbers from left to right after all the *n* stones falls.",
"input": "",
"output": "```python\ns = input()\r\ns = list(s)\r\na = [0]*len(s)\r\ni = 0\r\nj = len(s)-1\r\n\r\nfor ij in range(len(s)):\r\n if(s[ij]=='r'):\r\n a[i]=ij+1\r\n i+=1\r\n else:\r\n a[j]=ij+1\r\n j-=1\r\nfor i in a:\r\n print(i) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In the city of Ultima Thule job applicants are often offered an IQ test. \n\nThe test is as follows: the person gets a piece of squared paper with a 4<=×<=4 square painted on it. Some of the square's cells are painted black and others are painted white. Your task is to repaint at most one cell the other color so that the picture has a 2<=×<=2 square, completely consisting of cells of the same color. If the initial picture already has such a square, the person should just say so and the test will be completed. \n\nYour task is to write a program that determines whether it is possible to pass the test. You cannot pass the test if either repainting any cell or no action doesn't result in a 2<=×<=2 square, consisting of cells of the same color.",
"input": "",
"output": "```python\ndef read_multi_dimensional_array(dimension):\r\n return [[int(item) for item in input().split(\" \")] for j in range(dimension)]\r\n\r\ndef iq_test(array):\r\n for i in range(3):\r\n for j in range(3):\r\n if int(array[i][j] == \"#\") + int(array[i][j + 1] == \"#\") \\\r\n + int(array[i + 1][j] == \"#\") + int(array[i + 1][j + 1] == \"#\") >= 3:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\narray = [[item for item in input()] for j in range(4)]\r\niq_test(array)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Some natural number was written on the board. Its sum of digits was not less than *k*. But you were distracted a bit, and someone changed this number to *n*, replacing some digits with others. It's known that the length of the number didn't change.\n\nYou have to find the minimum number of digits in which these two numbers can differ.",
"input": "",
"output": "```python\nk = int(input())\r\nn = [int(i) for i in input()]\r\n\r\ncs=0\r\nfor i in n:\r\n\tcs+=i\r\n\r\n\r\nn.sort()\r\nv = k-cs\r\nres = 0\r\nfor i in n:\r\n\tif v<=0:\r\n\t\tbreak\r\n\telse:\r\n\t\tv-=(9-i)\r\n\t\tres+=1\r\nprint(res)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You took a peek on Thanos wearing Infinity Gauntlet. In the Gauntlet there is a place for six Infinity Gems:\n - the Power Gem of purple color, - the Time Gem of green color, - the Space Gem of blue color, - the Soul Gem of orange color, - the Reality Gem of red color, - the Mind Gem of yellow color. \nUsing colors of Gems you saw in the Gauntlet determine the names of absent Gems.",
"input": "",
"output": "```python\ndicc={'purple':'Power','green':'Time','blue':'Space','orange':'Soul','red':'Reality','yellow':'Mind'}\n\nuser=int(input())\nfor i in range(user):\n user2=input()\n dicc.pop(user2)\n \nprint(len(dicc))\nfor i,j in dicc.items():\n print(j)\n \t \t\t\t\t\t \t\t \t \t \t\t \t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Those days, many boys use beautiful girls' photos as avatars in forums. So it is pretty hard to tell the gender of a user at the first glance. Last year, our hero went to a forum and had a nice chat with a beauty (he thought so). After that they talked very often and eventually they became a couple in the network. \n\nBut yesterday, he came to see \"her\" in the real world and found out \"she\" is actually a very strong man! Our hero is very sad and he is too tired to love again now. So he came up with a way to recognize users' genders by their user names.\n\nThis is his method: if the number of distinct characters in one's user name is odd, then he is a male, otherwise she is a female. You are given the string that denotes the user name, please help our hero to determine the gender of this user by his method.",
"input": "",
"output": "```python\ns = input()\nd = {}\nfor i in s:\n if i not in d:\n d[i] = None\n\n\nprint(\"CHAT WITH HER!\") if len(d) % 2 == 0 else print(\"IGNORE HIM!\")\n\t\t\t\t\t \t \t\t \t\t \t \t \t\t\t\t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "As it's the first of April, Heidi is suspecting that the news she reads today are fake, and she does not want to look silly in front of all the contestants. She knows that a newspiece is fake if it contains heidi as a subsequence. Help Heidi assess whether the given piece is true, but please be discreet about it...",
"input": "",
"output": "```python\nstring = input()\r\ns = ['h', 'e', 'i', 'd', 'i']\r\nans = list()\r\nfor c in string:\r\n if c in s:\r\n ans.append(c)\r\nans = ''.join(ans)\r\nif ans == 'heidi':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Top-model Izabella participates in the competition. She wants to impress judges and show her mathematical skills.\n\nHer problem is following: for given string, consisting of only 0 and 1, tell if it's possible to remove some digits in such a way, that remaining number is a representation of some positive integer, divisible by 64, in the binary numerical system.",
"input": "",
"output": "```python\na = input()\r\n\r\ns = 6\r\nind = 0\r\n\r\nfor i in range(len(a)):\r\n if a[i] == \"1\":\r\n ind = i\r\n break\r\n\r\nfor i in range(ind,len(a)):\r\n if s == 0:\r\n break\r\n elif a[i] == \"0\":\r\n s -= 1\r\n\r\nif s == 0:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n \r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Dima and his friends have been playing hide and seek at Dima's place all night. As a result, Dima's place got messy. In the morning they decided that they need to clean the place.\n\nTo decide who exactly would clean the apartment, the friends want to play a counting-out game. First, all the guys stand in a circle, and then each of them shows some number of fingers on one hand (one to five), and then the boys count in a circle, starting from Dima, the number of people, respective to the total number of fingers shown. The person on who the countdown stops will clean the apartment.\n\nFor example, if Dima and one of his friends played hide and seek, and 7 fingers were shown during the counting-out, then Dima would clean the place. If there were 2 or say, 8 fingers shown, then his friend would clean the place.\n\nDima knows how many fingers each of his friends will show during the counting-out. Now he is interested in the number of ways to show some number of fingers on one hand (one to five), so that he did not have to clean the place. Help Dima.",
"input": "",
"output": "```python\nfrom functools import reduce\r\n\r\ndef main():\r\n n = int(input())\r\n cs = list(map(int, input().split()))\r\n s = reduce(lambda x, y: x + y, cs)\r\n\r\n sol = 0\r\n for i in range(1, 6):\r\n if ((i + s - 1) % (n + 1)) != 0:\r\n sol += 1\r\n print(sol)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "*n* people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next person from the line, and so on. They play until someone wins *k* games in a row. This player becomes the winner.\n\nFor each of the participants, you know the power to play table tennis, and for all players these values are different. In a game the player with greater power always wins. Determine who will be the winner.",
"input": "",
"output": "```python\nn, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\ncurrent_streak = 0\r\n\r\nfor i in range(1,n):\r\n if current_streak >= k or a[0] == n:\r\n print(a[0])\r\n break\r\n elif a[i] == n:\r\n print(a[i])\r\n break\r\n elif a[i] > a[0]:\r\n a[0] = a[i]\r\n current_streak = 1\r\n else:\r\n current_streak += 1\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In a Berland's zoo there is an enclosure with camels. It is known that camels like to spit. Bob watched these interesting animals for the whole day and registered in his notepad where each animal spitted. Now he wants to know if in the zoo there are two camels, which spitted at each other. Help him to solve this task.\n\nThe trajectory of a camel's spit is an arc, i.e. if the camel in position *x* spits *d* meters right, he can hit only the camel in position *x*<=+<=*d*, if such a camel exists.",
"input": "",
"output": "```python\ndef solve():\n n = int(input())\n dados = {}\n yes = False\n for i in range(n):\n x,d = map(int,input().split())\n dados[x] = (x+d)\n if((x+d) in list(dados.keys()) and yes == False):\n if(dados[x+d]==x):\n print(\"YES\")\n yes = True\n if(yes == False):\n print(\"NO\")\n \nsolve()\n\t\t\t \t\t\t \t \t \t\t \t \t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Heidi's friend Jenny is asking Heidi to deliver an important letter to one of their common friends. Since Jenny is Irish, Heidi thinks that this might be a prank. More precisely, she suspects that the message she is asked to deliver states: \"Send the fool further!\", and upon reading it the recipient will ask Heidi to deliver the same message to yet another friend (that the recipient has in common with Heidi), and so on.\n\nHeidi believes that her friends want to avoid awkward situations, so she will not be made to visit the same person (including Jenny) twice. She also knows how much it costs to travel between any two of her friends who know each other. She wants to know: what is the maximal amount of money she will waste on travel if it really is a prank?\n\nHeidi's *n* friends are labeled 0 through *n*<=-<=1, and their network of connections forms a tree. In other words, every two of her friends *a*, *b* know each other, possibly indirectly (there is a sequence of friends starting from *a* and ending on *b* and such that each two consecutive friends in the sequence know each other directly), and there are exactly *n*<=-<=1 pairs of friends who know each other directly.\n\nJenny is given the number 0.",
"input": "",
"output": "```python\nn=int(input())\r\nl={}\r\nk={0}\r\nr={}\r\no=[]\r\ncc=set()\r\nfor i in range(n):\r\n cc.add(i)\r\nfor i in range(n-1):\r\n q,w,z=map(int,input().split())\r\n if q in k:\r\n r[w]=q\r\n k.add(w)\r\n cc.discard(q)\r\n l[(w,q)]=z\r\n elif w in k:\r\n r[q]=w\r\n k.add(q)\r\n cc.discard(w)\r\n l[(q,w)]=z\r\n else:\r\n o+=[[q,w,z]]\r\nfor i in o:\r\n q,w,z=i[0],i[1],i[2]\r\n if q in k:\r\n r[w]=q\r\n k.add(w)\r\n cc.discard(q)\r\n l[(w,q)]=z\r\n elif w in k:\r\n r[q]=w\r\n k.add(q)\r\n cc.discard(w)\r\n l[(q,w)]=z\r\ns=0\r\nfor i in cc:\r\n aa=0\r\n pp=-1\r\n while pp!=0:\r\n pp=r[i]\r\n aa+=l[(i,pp)]\r\n i=pp\r\n s=max(s,aa)\r\nprint(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "According to an old legeng, a long time ago Ankh-Morpork residents did something wrong to miss Fortune, and she cursed them. She said that at some time *n* snacks of distinct sizes will fall on the city, and the residents should build a Snacktower of them by placing snacks one on another. Of course, big snacks should be at the bottom of the tower, while small snacks should be at the top.\n\nYears passed, and once different snacks started to fall onto the city, and the residents began to build the Snacktower.\n\nHowever, they faced some troubles. Each day exactly one snack fell onto the city, but their order was strange. So, at some days the residents weren't able to put the new stack on the top of the Snacktower: they had to wait until all the bigger snacks fell. Of course, in order to not to anger miss Fortune again, the residents placed each snack on the top of the tower immediately as they could do it.\n\nWrite a program that models the behavior of Ankh-Morpork residents.",
"input": "",
"output": "```python\nn = int(input())\r\nnum = input()\r\nnum = list(int(x) for x in num.split(\" \"))\r\ni = 0\r\nwhile n > 0 and i < len(num):\r\n if num[i] == n:\r\n print(n, end=\" \")\r\n n -= 1\r\n while n > 0:\r\n if num.index(n) < i:\r\n print(n, end=\" \")\r\n n -= 1\r\n else:\r\n print(\"\\n\", end =\"\")\r\n break\r\n else:\r\n print(\" \")\r\n i += 1\r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. \"Piece of cake\" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.",
"input": "",
"output": "```python\nt=int(input())\r\nl=[]\r\nc=0\r\nfor i in range(0,t):\r\n x=int(input())\r\n y=int(input())\r\n z=int(input())\r\n l.append([x,y,z])\r\nfor j in range(0,3):\r\n sum=0\r\n for i in range(0,t):\r\n sum=sum+l[i][j]\r\n if sum=-=0:\r\n c=c+1\r\nif c==3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Iahub likes chess very much. He even invented a new chess piece named Coder. A Coder can move (and attack) one square horizontally or vertically. More precisely, if the Coder is located at position (*x*,<=*y*), he can move to (or attack) positions (*x*<=+<=1,<=*y*), (*x*–1,<=*y*), (*x*,<=*y*<=+<=1) and (*x*,<=*y*–1).\n\nIahub wants to know how many Coders can be placed on an *n*<=×<=*n* chessboard, so that no Coder attacks any other Coder.",
"input": "",
"output": "```python\nchessboard = input()\r\nchessboard = int(chessboard)\r\n\r\n#odd = n^2 - 1 / 2\r\n#even = n^2 / 2\r\n\r\nif chessboard % 2 == 0:\r\n print(int((chessboard ** 2) / 2))\r\nelse:\r\n print(int(((chessboard ** 2) - 1) / 2))\r\n\r\ntemp = 0\r\n\r\nfor i in range(0,chessboard):\r\n for j in range(0,chessboard):\r\n if temp == 0:\r\n print('C',end='')\r\n temp = temp + 1\r\n else:\r\n print('.',end='')\r\n temp = 0\r\n#special case for even\r\n if chessboard % 2 == 0:\r\n temp = 1 - temp\r\n print('')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Harry Potter is on a mission to destroy You-Know-Who's Horcruxes. The first Horcrux that he encountered in the Chamber of Secrets is Tom Riddle's diary. The diary was with Ginny and it forced her to open the Chamber of Secrets. Harry wants to know the different people who had ever possessed the diary to make sure they are not under its influence.\n\nHe has names of *n* people who possessed the diary in order. You need to tell, for each person, if he/she possessed the diary at some point before or not.\n\nFormally, for a name *s**i* in the *i*-th line, output \"YES\" (without quotes) if there exists an index *j* such that *s**i*<==<=*s**j* and *j*<=<<=*i*, otherwise, output \"NO\" (without quotes).",
"input": "",
"output": "```python\ns = (str(input())) \nfor str in s: \n print(\"NO\")\nif str == str in s:\n print(\"YES\")\n\n\t\t \t \t\t\t \t\t\t\t\t \t\t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Your friend has *n* cards.\n\nYou know that each card has a lowercase English letter on one side and a digit on the other.\n\nCurrently, your friend has laid out the cards on a table so only one side of each card is visible.\n\nYou would like to know if the following statement is true for cards that your friend owns: \"If a card has a vowel on one side, then it has an even digit on the other side.\" More specifically, a vowel is one of 'a', 'e', 'i', 'o' or 'u', and even digit is one of '0', '2', '4', '6' or '8'.\n\nFor example, if a card has 'a' on one side, and '6' on the other side, then this statement is true for it. Also, the statement is true, for example, for a card with 'b' and '4', and for a card with 'b' and '3' (since the letter is not a vowel). The statement is false, for example, for card with 'e' and '5'. You are interested if the statement is true for all cards. In particular, if no card has a vowel, the statement is true.\n\nTo determine this, you can flip over some cards to reveal the other side. You would like to know what is the minimum number of cards you need to flip in the worst case in order to verify that the statement is true.",
"input": "",
"output": "```python\ncards = input()\n\nl = \"02468aeiou\"\noutput = 0\n\nfor i in cards:\n\tif(i in l):\n\t\toutput += 1\n\nprint(output)\n \t \t\t \t \t \t \t\t \t \t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A frog lives on the axis *Ox* and needs to reach home which is in the point *n*. She starts from the point 1. The frog can jump to the right at a distance not more than *d*. So, after she jumped from the point *x* she can reach the point *x*<=+<=*a*, where *a* is an integer from 1 to *d*.\n\nFor each point from 1 to *n* is known if there is a lily flower in it. The frog can jump only in points with a lilies. Guaranteed that there are lilies in the points 1 and *n*.\n\nDetermine the minimal number of jumps that the frog needs to reach home which is in the point *n* from the point 1. Consider that initially the frog is in the point 1. If the frog can not reach home, print -1.",
"input": "",
"output": "```python\nn, d = list(map(int, input().split()))\ns = input()\n\ncount = 0\ni = 0\nwhile(i < n):\n countStart = count\n for _d in range(d, 0, -1):\n if i+_d < n and s[i+_d] == '1':\n i += _d\n count += 1\n break\n if countStart == count: \n count = -1\n break\n if i == n-1: break\n \nprint(count)\n \n\n\n\n\t \t \t\t \t\t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given positive integer number *n*. You should create such strictly increasing sequence of *k* positive numbers *a*1,<=*a*2,<=...,<=*a**k*, that their sum is equal to *n* and greatest common divisor is maximal.\n\nGreatest common divisor of sequence is maximum of such numbers that every element of sequence is divisible by them.\n\nIf there is no possible sequence then output -1.",
"input": "",
"output": "```python\nfrom math import sqrt\r\ndef factors(n,k):\r\n i=2;p=(k*(k-1))//2;s=0\r\n while i<=sqrt(n):\r\n if n%i==0:\r\n if n//i-p>k-1:s=max(s,i)\r\n if i-p>k-1:s=max(s,n//i)\r\n i+=1\r\n return 1 if s==0 else s\r\ndef solve(n,k):\r\n p=(2*n)/(k*(k+1));m=factors(n,k)\r\n if p<1 or k>=n:return [-1]\r\n if p%1==0:return [x*int(p) for x in range(1,k+1)]\r\n return [x*m for x in range(1,k)]+[n-(m*k*(k-1))//2]\r\nn,k=map(int,input().split())\r\nprint(n) if k==1 else print(*solve(n,k))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya loves football very much. One day, as he was watching a football match, he was writing the players' current positions on a piece of paper. To simplify the situation he depicted it as a string consisting of zeroes and ones. A zero corresponds to players of one team; a one corresponds to players of another team. If there are at least 7 players of some team standing one after another, then the situation is considered dangerous. For example, the situation 00100110111111101 is dangerous and 11110111011101 is not. You are given the current situation. Determine whether it is dangerous or not.",
"input": "",
"output": "```python\nS = list(input()); S.sort(); S = ''.join(S); print(\"YES\" if \"1111111\" in S or \"0000000\" in S else \"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp is a big lover of killing time in social networks. A page with a chatlist in his favourite network is made so that when a message is sent to some friend, his friend's chat rises to the very top of the page. The relative order of the other chats doesn't change. If there was no chat with this friend before, then a new chat is simply inserted to the top of the list.\n\nAssuming that the chat list is initially empty, given the sequence of Polycaprus' messages make a list of chats after all of his messages are processed. Assume that no friend wrote any message to Polycarpus.",
"input": "",
"output": "```python\nn = int(input())\r\ns = []\r\nfor i in range(n):\r\n if len(s) == 0:\r\n s.append(input())\r\n else:\r\n v = input()\r\n if v in s:\r\n s.remove(v)\r\n s += [v]\r\n else:\r\n s += [v]\r\n[print(s[x]) for x in range(len(s) - 1, -1, -1)]\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed *w* kilos. They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem.\n\nPete and Billy are great fans of even numbers, that's why they want to divide the watermelon in such a way that each of the two parts weighs even number of kilos, at the same time it is not obligatory that the parts are equal. The boys are extremely tired and want to start their meal as soon as possible, that's why you should help them and find out, if they can divide the watermelon in the way they want. For sure, each of them should get a part of positive weight.",
"input": "",
"output": "```python\nnumber = input(\"put numbers of watermelon: \")\r\n\r\nwatermelon = float(number)\r\n\r\nmodulo = watermelon / 2\r\n\r\nif watermelon%2 == 0:\r\n if modulo % 2 == 0:\r\n print(\"YES\")\r\n \r\n else:\r\n print(\"NO\")\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given *n* numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given *n* numbers finds one that is different in evenness.",
"input": "",
"output": "```python\nn=raw_input(n)\r\nnumber_of_evens=0\r\nfor i in range(0,len(n)):\r\n if n[i]%2==0:\r\n number_of_evens+=1\r\n index_even=(n.index(n[i]))+1\r\n else:\r\n index_odd=(n.index(n[i]))+1\r\nnumber_of_odds=len(n)-number_of_evens\r\nif number_of_odds==1:\r\n print(index_odd)\r\nif number_of_evens==1:\r\n print( index_even)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be *n* problems, sorted by difficulty, i.e. problem 1 is the easiest and problem *n* is the hardest. Limak knows it will take him 5·*i* minutes to solve the *i*-th problem.\n\nLimak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs *k* minutes to get there from his house, where he will participate in the contest first.\n\nHow many problems can Limak solve if he wants to make it to the party?",
"input": "",
"output": "```python\na, b = map(int,input().split())\r\nb = 240 - b\r\nval = 0\r\nfor i in range(1, a+1):\r\n if b >= 5*i:\r\n b -= 5*i\r\n val += 1\r\nprint(val)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A sum of *p* rubles is charged from Arkady's mobile phone account every day in the morning. Among the following *m* days, there are *n* days when Arkady will top up the account: in the day *d**i* he will deposit *t**i* rubles on his mobile phone account. Arkady will always top up the account before the daily payment will be done. There will be no other payments nor tops up in the following *m* days.\n\nDetermine the number of days starting from the 1-st to the *m*-th such that the account will have a negative amount on it after the daily payment (i. e. in evening). Initially the account's balance is zero rubles.",
"input": "",
"output": "```python\nn, p, m = input().split()\r\nn = int(n)\r\np = int(p)\r\nm = int(m)\r\n\r\nans = 0\r\ncurb = 0\r\ncurd = 1\r\nfor i in range(0, n):\r\n #print(curb)\r\n tday, tplus = input().split()\r\n tday = int(tday)\r\n tplus = int(tplus)\r\n if curb < 0:\r\n ans += (tday - curd)\r\n curb -= p * (tday - curd)\r\n elif curb - p * (tday - curd) < 0:\r\n curb -= p * (tday - curd)\r\n x = -curb\r\n xx = x // p\r\n if xx * p < x:\r\n xx += 1\r\n x = xx\r\n ans += x\r\n else:\r\n curb -= p * (tday - curd)\r\n curd = tday\r\n #print(curb)\r\n curb += tplus\r\n\r\ntday = m + 1\r\nif curb < 0:\r\n ans += (tday - curd)\r\n curb -= p * (tday - curd)\r\nelif curb - p * (tday - curd) < 0:\r\n curb -= p * (tday - curd)\r\n x = -curb\r\n xx = x // p\r\n if xx * p < x:\r\n xx += 1\r\n x = xx\r\n ans += x\r\n\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Iahub is a big fan of tourists. He wants to become a tourist himself, so he planned a trip. There are *n* destinations on a straight road that Iahub wants to visit. Iahub starts the excursion from kilometer 0. The *n* destinations are described by a non-negative integers sequence *a*1, *a*2, ..., *a**n*. The number *a**k* represents that the *k*th destination is at distance *a**k* kilometers from the starting point. No two destinations are located in the same place. \n\nIahub wants to visit each destination only once. Note that, crossing through a destination is not considered visiting, unless Iahub explicitly wants to visit it at that point. Also, after Iahub visits his last destination, he doesn't come back to kilometer 0, as he stops his trip at the last destination. \n\nThe distance between destination located at kilometer *x* and next destination, located at kilometer *y*, is |*x*<=-<=*y*| kilometers. We call a \"route\" an order of visiting the destinations. Iahub can visit destinations in any order he wants, as long as he visits all *n* destinations and he doesn't visit a destination more than once. \n\nIahub starts writing out on a paper all possible routes and for each of them, he notes the total distance he would walk. He's interested in the average number of kilometers he would walk by choosing a route. As he got bored of writing out all the routes, he asks you to help him.",
"input": "",
"output": "```python\nimport math \r\nn = int(input())\r\nl = [int(x) for x in input().split()]\r\na1 = sum(l)\r\na2 = n\r\na3 = 0\r\ntemp = 0\r\nfor i in range(n):\r\n temp += l[n-i-1] \r\n a3-=(a1-temp)\r\n a3+=(n-i-1)*(l[n-i-1])\r\n\r\na1 = a1+a3+a3\r\na4 = math.gcd(a1, a2)\r\nprint(a1//a4, a2//a4)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In one little known, but very beautiful country called Waterland, lives a lovely shark Valerie. Like all the sharks, she has several rows of teeth, and feeds on crucians. One of Valerie's distinguishing features is that while eating one crucian she uses only one row of her teeth, the rest of the teeth are \"relaxing\".\n\nFor a long time our heroine had been searching the sea for crucians, but a great misfortune happened. Her teeth started to ache, and she had to see the local dentist, lobster Ashot. As a professional, Ashot quickly relieved Valerie from her toothache. Moreover, he managed to determine the cause of Valerie's developing caries (for what he was later nicknamed Cap).\n\nIt turned that Valerie eats too many crucians. To help Valerie avoid further reoccurrence of toothache, Ashot found for each Valerie's tooth its residual viability. Residual viability of a tooth is a value equal to the amount of crucians that Valerie can eat with this tooth. Every time Valerie eats a crucian, viability of all the teeth used for it will decrease by one. When the viability of at least one tooth becomes negative, the shark will have to see the dentist again. \n\nUnhappy, Valerie came back home, where a portion of crucians was waiting for her. For sure, the shark couldn't say no to her favourite meal, but she had no desire to go back to the dentist. That's why she decided to eat the maximum amount of crucians from the portion but so that the viability of no tooth becomes negative. \n\nAs Valerie is not good at mathematics, she asked you to help her to find out the total amount of crucians that she can consume for dinner.\n\nWe should remind you that while eating one crucian Valerie uses exactly one row of teeth and the viability of each tooth from this row decreases by one.",
"input": "",
"output": "```python\n(((( return\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Theatre Square in the capital city of Berland has a rectangular shape with the size *n*<=×<=*m* meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size *a*<=×<=*a*.\n\nWhat is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.",
"input": "",
"output": "```python\nimport math\r\ndef domino(numbers):\r\n num = numbers.split(\" \")\r\n n= int(num[0])\r\n m=int(num[1])\r\n a=int(num[2])\r\n return (math.ceil(n/a) * math.ceil(m/a))\r\nnumbers=input(\"\")\r\nprint(domino(numbers))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Fox Ciel saw a large field while she was on a bus. The field was a *n*<=×<=*m* rectangle divided into 1<=×<=1 cells. Some cells were wasteland, and other each cell contained crop plants: either carrots or kiwis or grapes. \n\nAfter seeing the field carefully, Ciel found that the crop plants of each cell were planted in following procedure:\n - Assume that the rows are numbered 1 to *n* from top to bottom and the columns are numbered 1 to *m* from left to right, and a cell in row *i* and column *j* is represented as (*i*,<=*j*). - First, each field is either cultivated or waste. Crop plants will be planted in the cultivated cells in the order of (1,<=1)<=→<=...<=→<=(1,<=*m*)<=→<=(2,<=1)<=→<=...<=→<=(2,<=*m*)<=→<=...<=→<=(*n*,<=1)<=→<=...<=→<=(*n*,<=*m*). Waste cells will be ignored. - Crop plants (either carrots or kiwis or grapes) will be planted in each cell one after another cyclically. Carrots will be planted in the first cell, then kiwis in the second one, grapes in the third one, carrots in the forth one, kiwis in the fifth one, and so on. \nThe following figure will show you the example of this procedure. Here, a white square represents a cultivated cell, and a black square represents a waste cell.\n\nNow she is wondering how to determine the crop plants in some certain cells.",
"input": "",
"output": "```python\nn,m,k,t = [int(x) for x in input().split()]\r\nmapp ={0:'Carrots',1:'Kiwis',2:'Grapes'}\r\niamdistruption = []\r\nfor i in range(k):\r\n x,y = [int(x) for x in input().split()]\r\n iamdistruption.append((x,y))\r\n\r\nfor i in range(t):\r\n x,y = [int(x) for x in input().split()]\r\n orig = ((m*(x-1))+y-1)\r\n disbeforeme = 0\r\n for x,y in iamdistruption:\r\n if m*(x-1)+y-1==orig:\r\n print(\"Waste\")\r\n break\r\n elif m*(x-1)+y-1 1e-6 and abs(round(x1) - x1) < 1e-6:\r\n return round(x1)\r\n elif x2 > 1e-6 and abs(round(x2) - x2) < 1e-6:\r\n return round(x2)\r\n return -1\r\n\r\n\r\na00, a01, a10, a11 = map(int, input().split())\r\nif a01 == 0 and a10 == 0:\r\n if a00 != 0 and a11 != 0:\r\n print('Impossible')\r\n exit(0)\r\n if a00 != 0:\r\n kol_0 = getxs(a00 * 2)\r\n if kol_0 != -1:\r\n print(kol_0 * '0')\r\n exit(0)\r\n else:\r\n print('Impossible')\r\n exit(0)\r\n if a11 != 0:\r\n kol_1 = getxs(a11 * 2)\r\n if kol_1 != -1:\r\n print(kol_1 * '1')\r\n exit(0)\r\n else:\r\n print('Impossible')\r\n exit(0)\r\nkol_0 = getxs(a00 * 2)\r\nkol_1 = getxs(a11 * 2)\r\nif kol_1 < 0 or kol_0 < 0 or kol_1 * kol_0 != a10 + a01:\r\n print('Impossible')\r\n exit(0)\r\n\r\nzeros_right = a10 // kol_1\r\nlast_zero = a10 % kol_1\r\nprint('0' * (kol_0 - zeros_right - 1) + '1' * last_zero + '0' + '1' * (kol_1 - last_zero) + '0' * zeros_right)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Luke Skywalker gave Chewbacca an integer number *x*. Chewbacca isn't good at numbers but he loves inverting digits in them. Inverting digit *t* means replacing it with digit 9<=-<=*t*. \n\nHelp Chewbacca to transform the initial number *x* to the minimum possible positive number by inverting some (possibly, zero) digits. The decimal representation of the final number shouldn't start with a zero.",
"input": "",
"output": "```python\nnumber = input()\r\n\r\nfor i in range(len(number)):\r\n if i == 0 and number[i] == '9':\r\n print(9, end='')\r\n elif int(number[i]) >= 5:\r\n print(9 - int(number[i]), end='')\r\n else:\r\n print(number[i], end='')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given *n* numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given *n* numbers finds one that is different in evenness.",
"input": "",
"output": "```python\nimport sys\nn=[ ]\na=int(input())\nn=list(map(int,input().split()))\nn1=n2=0\nfor i in range (len(n)):\n if n[i] %2==0:\n n1=n1+1\n c=i+1\n else :\n n2=n2+1\n b=i+1\nif n1>n2 :\n print(b)\nelse :\n print(c)\n \n\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* pictures delivered for the new exhibition. The *i*-th painting has beauty *a**i*. We know that a visitor becomes happy every time he passes from a painting to a more beautiful one.\n\nWe are allowed to arranged pictures in any order. What is the maximum possible number of times the visitor may become happy while passing all pictures from first to last? In other words, we are allowed to rearrange elements of *a* in any order. What is the maximum possible number of indices *i* (1<=≤<=*i*<=≤<=*n*<=-<=1), such that *a**i*<=+<=1<=><=*a**i*.",
"input": "",
"output": "```python\nn=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\nlst.sort()\r\nl=[[lst[0]]]\r\nfor i in range(1,n):\r\n j=0\r\n while(True):\r\n if j==len(l):\r\n l.append([lst[i]])\r\n break\r\n else:\r\n if l[j][-1]!=lst[i]:\r\n l[j].append(lst[i])\r\n break\r\n else:\r\n j+=1\r\ns=0\r\nfor i in range(len(l)):\r\n s+=len(l[i])-1\r\nprint(s)\r\n \r\n \r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A country has *n* cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants those roads to be constructed in such a way that it is possible to go from each city to any other city by traversing at most two roads. You are also given *m* pairs of cities — roads cannot be constructed between these pairs of cities.\n\nYour task is to construct the minimum number of roads that still satisfy the above conditions. The constraints will guarantee that this is always possible.",
"input": "",
"output": "```python\nn, m = map(int,input().split())\r\nno_connections = list(map(int,input().split()))\r\n\r\nroot = 1\r\nfor i in range(1,n+1):\r\n if i not in no_connections:\r\n root = i\r\n break\r\n\r\nprint(n-1)\r\nfor i in range(1,n+1):\r\n if i!=root:\r\n print(f'{root} {i}')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Now it's time of Olympiads. Vanya and Egor decided to make his own team to take part in a programming Olympiad. They've been best friends ever since primary school and hopefully, that can somehow help them in teamwork.\n\nFor each team Olympiad, Vanya takes his play cards with numbers. He takes only the cards containing numbers 1 and 0. The boys are very superstitious. They think that they can do well at the Olympiad if they begin with laying all the cards in a row so that:\n - there wouldn't be a pair of any side-adjacent cards with zeroes in a row; - there wouldn't be a group of three consecutive cards containing numbers one. \nToday Vanya brought *n* cards with zeroes and *m* cards with numbers one. The number of cards was so much that the friends do not know how to put all those cards in the described way. Help them find the required arrangement of the cards or else tell the guys that it is impossible to arrange cards in such a way.",
"input": "",
"output": "```python\nn,m = map(int,input().split())\r\nif n > m:\r\n ans = '001'*(m)\r\n n -=(m*2)\r\n ans += '0'*(n)\r\nelif n < m:\r\n ans = '110'*(n)\r\n m -= (n*2)\r\n ans += '1'*(m)\r\nelse:\r\n ans = '10'*(m)\r\nflag = True\r\nfor i in range(len(ans)-2):\r\n a = ans[i]+ans[i+1]+ans[i+2]\r\n if a == '000' or a == '111':\r\n flag = False\r\n break\r\nprint(ans if flag else -1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Dwarfs have planted a very interesting plant, which is a triangle directed \"upwards\". This plant has an amusing feature. After one year a triangle plant directed \"upwards\" divides into four triangle plants: three of them will point \"upwards\" and one will point \"downwards\". After another year, each triangle plant divides into four triangle plants: three of them will be directed in the same direction as the parent plant, and one of them will be directed in the opposite direction. Then each year the process repeats. The figure below illustrates this process.\n\nHelp the dwarfs find out how many triangle plants that point \"upwards\" will be in *n* years.",
"input": "",
"output": "```python\ndef main():\n year = int(input())\n end = pow(2,year)\n ans = sum(range(1,end+1))\n print(ans)\n\nmain()\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* beacons located at distinct positions on a number line. The *i*-th beacon has position *a**i* and power level *b**i*. When the *i*-th beacon is activated, it destroys all beacons to its left (direction of decreasing coordinates) within distance *b**i* inclusive. The beacon itself is not destroyed however. Saitama will activate the beacons one at a time from right to left. If a beacon is destroyed, it cannot be activated.\n\nSaitama wants Genos to add a beacon strictly to the right of all the existing beacons, with any position and any power level, such that the least possible number of beacons are destroyed. Note that Genos's placement of the beacon means it will be the first beacon activated. Help Genos by finding the minimum number of beacons that could be destroyed.",
"input": "",
"output": "```python\nn = int(input())\r\na = [tuple(map(int, input().split())) for _ in range(n)]\r\na.sort()\r\ndp = [1] * n\r\nres = n - 1\r\nfor i in range(n):\r\n j = i - 1\r\n while j >= 0 and a[j][0] + a[j][1] <= a[i][0]:\r\n j -= 1\r\n if j >= 0:\r\n dp[i] = dp[j] + 1\r\n else:\r\n dp[i] = 1\r\n res = min(res, n - dp[i])\r\n\r\nprint(res)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Twilight Sparkle was playing Ludo with her friends Rainbow Dash, Apple Jack and Flutter Shy. But she kept losing. Having returned to the castle, Twilight Sparkle became interested in the dice that were used in the game.\n\nThe dice has *m* faces: the first face of the dice contains a dot, the second one contains two dots, and so on, the *m*-th face contains *m* dots. Twilight Sparkle is sure that when the dice is tossed, each face appears with probability . Also she knows that each toss is independent from others. Help her to calculate the expected maximum number of dots she could get after tossing the dice *n* times.",
"input": "",
"output": "```python\nm, n = [int(i) for i in input().split()]\n\nres = 0\nfor i in range(1,m+1):\n res += i*(pow(i,n) - pow((i-1),n))/pow(m,n)\nprint(res)\n \t\t\t \t\t \t \t\t\t\t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Tonio has a keyboard with only two letters, \"V\" and \"K\".\n\nOne day, he has typed out a string *s* with only these two letters. He really likes it when the string \"VK\" appears, so he wishes to change at most one letter in the string (or do no changes) to maximize the number of occurrences of that string. Compute the maximum number of times \"VK\" can appear as a substring (i. e. a letter \"K\" right after a letter \"V\") in the resulting string.",
"input": "",
"output": "```python\n\r\ns=input()\r\n\r\nvisited=False\r\nt=l=0\r\n\r\nif len(s)==2:\r\n if s[0]==\"V\" and s[1]==\"K\":\r\n t+=1\r\n elif s[0]==\"V\" and s[1]==\"V\":\r\n t+=1\r\n\r\n elif s[0]==\"K\" and s[1]==\"K\":\r\n t+=1\r\n\r\nelse:\r\n \r\n i=1\r\n\r\n while i0:\r\n t+=1\r\n \r\nprint(t)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.\n\nPetya calls a number almost lucky if it could be evenly divided by some lucky number. Help him find out if the given number *n* is almost lucky.",
"input": "",
"output": "```python\na = [4, 7]\r\nfor i in ('47'):\r\n for j in ('47'):\r\n a.append(int(i + j))\r\nfor t in ('47'):\r\n for i in ('47'):\r\n for j in ('47'):\r\n a.append(int(i + j + t))\r\nn = int(input())\r\nflag = False\r\nfor i in a:\r\n if n % i == 0:\r\n print('YES')\r\n flag = True\r\n break\r\nif flag == False:\r\n print('NO')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two villages are separated by a river that flows from the north to the south. The villagers want to build a bridge across the river to make it easier to move across the villages.\n\nThe river banks can be assumed to be vertical straight lines *x*<==<=*a* and *x*<==<=*b* (0<=<<=*a*<=<<=*b*).\n\nThe west village lies in a steppe at point *O*<==<=(0,<=0). There are *n* pathways leading from the village to the river, they end at points *A**i*<==<=(*a*,<=*y**i*). The villagers there are plain and simple, so their pathways are straight segments as well.\n\nThe east village has reserved and cunning people. Their village is in the forest on the east bank of the river, but its exact position is not clear. There are *m* twisted paths leading from this village to the river and ending at points *B**i*<==<=(*b*,<=*y*'*i*). The lengths of all these paths are known, the length of the path that leads from the eastern village to point *B**i*, equals *l**i*.\n\nThe villagers want to choose exactly one point on the left bank of river *A**i*, exactly one point on the right bank *B**j* and connect them by a straight-line bridge so as to make the total distance between the villages (the sum of |*OA**i*|<=+<=|*A**i**B**j*|<=+<=*l**j*, where |*XY*| is the Euclidean distance between points *X* and *Y*) were minimum. The Euclidean distance between points (*x*1,<=*y*1) and (*x*2,<=*y*2) equals .\n\nHelp them and find the required pair of points.",
"input": "",
"output": "```python\n__author__ = 'Michael Ilyin'\r\n\r\nimport math\r\n\r\n# debug = True\r\ndebug = False\r\n\r\n\r\ndef dist(x1, y1, x2, y2):\r\n return math.sqrt(math.pow(x1 - x2, 2) + math.pow(y1 - y2, 2))\r\n\r\n\r\ndef get_y(x1, y1, x2, y2, x):\r\n return (((x - x1) * (y2 - y1)) / (x2 - x1)) + y1\r\n\r\nif debug:\r\n with open(\"input.txt\", \"r\") as inp:\r\n firstLine = inp.readline()\r\n secondLine = inp.readline()\r\n thirdLine = inp.readline()\r\n fourthLine = inp.readline()\r\nelse:\r\n firstLine = input()\r\n secondLine = input()\r\n thirdLine = input()\r\n fourthLine = input()\r\n\r\nfirst = firstLine.split()\r\nn = int(first[0])\r\nm = int(first[1])\r\na = int(first[2])\r\nb = int(first[3])\r\n\r\nA = [int(x) for x in secondLine.split()]\r\nB = [int(x) for x in thirdLine.split()]\r\nL = [int(x) for x in fourthLine.split()]\r\n\r\noptimalLen = float(\"inf\")\r\noptimalBIdx = -1\r\nfor i, bi in enumerate(B):\r\n d = dist(0, 0, b, bi) + L[i]\r\n if d < optimalLen:\r\n optimalLen = d\r\n optimalBIdx = i\r\n\r\nif debug:\r\n print(optimalBIdx + 1, optimalLen)\r\n\r\nintersectY = get_y(0, 0, b, B[optimalBIdx], a)\r\n\r\nif debug:\r\n print(intersectY)\r\n\r\npointDist = float(\"inf\")\r\noptimalAIdx = -1\r\nfor i, ai in enumerate(A):\r\n d = dist(a, ai, a, intersectY)\r\n if d < pointDist:\r\n pointDist = d\r\n optimalAIdx = i\r\n\r\nif debug:\r\n print(optimalAIdx + 1, pointDist)\r\n\r\nprint(optimalAIdx + 1, optimalBIdx + 1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "User ainta has a stack of *n* red and blue balls. He can apply a certain operation which changes the colors of the balls inside the stack.\n - While the top ball inside the stack is red, pop the ball from the top of the stack. - Then replace the blue ball on the top with a red ball. - And finally push some blue balls to the stack until the stack has total of *n* balls inside. \nIf there are no blue balls inside the stack, ainta can't apply this operation. Given the initial state of the stack, ainta wants to know the maximum number of operations he can repeatedly apply.",
"input": "",
"output": "```python\nn, b = input(), input().replace('R', '0').replace('B', '1')\r\nprint(int(b[:: -1], 2))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The little girl loves the problems on array queries very much.\n\nOne day she came across a rather well-known problem: you've got an array of $n$ elements (the elements of the array are indexed starting from 1); also, there are $q$ queries, each one is defined by a pair of integers $l_i$, $r_i$ $(1 \\le l_i \\le r_i \\le n)$. You need to find for each query the sum of elements of the array with indexes from $l_i$ to $r_i$, inclusive.\n\nThe little girl found the problem rather boring. She decided to reorder the array elements before replying to the queries in a way that makes the sum of query replies maximum possible. Your task is to find the value of this maximum sum.",
"input": "",
"output": "```python\nn,m=[int(x) for x in input().split()]\r\narr=[int(x) for x in input().split()]\r\nans=[0 for _ in range(n)]\r\nfor _ in range(m):\r\n x,y=[int(x) for x in input().split()]\r\n ans[x-1]+=1\r\n if y!=n:\r\n ans[y]-=1\r\nfor i in range(1,n):\r\n ans[i]+=ans[i-1]\r\nans.sort()\r\narr.sort()\r\n# print(arr)\r\n# print(ans)\r\nsolution=0\r\nfor i in range(n):\r\n solution+=(ans[i]*arr[i])\r\nprint(solution)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Bad Luck Island is inhabited by three kinds of species: *r* rocks, *s* scissors and *p* papers. At some moments of time two random individuals meet (all pairs of individuals can meet equiprobably), and if they belong to different species, then one individual kills the other one: a rock kills scissors, scissors kill paper, and paper kills a rock. Your task is to determine for each species what is the probability that this species will be the only one to inhabit this island after a long enough period of time.",
"input": "",
"output": "```python\nn = int(input())\na = [i for i in range(1, 2 * n + 1)]\nb = [0] * (n * 2 + 1)\ncnt = 0\nfor _ in range(n):\n x, y = map(int, input().split())\n a[x - 1], a[y - 1] = a[y - 1], a[x - 1]\n\ndef merge(l, mid, r):\n i, j, k = l, mid + 1, l\n while i <= mid and j <= r:\n if a[i] <= a[j]:\n b[k] = a[i]\n i += 1\n else:\n b[k] = a[j] # 存在逆序对\n j += 1\n global cnt\n cnt += mid - i + 1\n k += 1\n while i <= mid or j <= r: # 归并到b中\n if i <= mid:\n b[k] = a[i]\n i += 1\n else:\n b[k] = a[j]\n j += 1\n k += 1\n a[l:r + 1] = b[l:r + 1] # 合并\n\ndef merge_sort(l, r):\n if l >= r:return\n mid = l + r >> 1\n merge_sort(l, mid)\n merge_sort(mid + 1, r)\n merge(l, mid, r)\nmerge_sort(0, n * 2 - 1)\nprint(cnt)\n\n# n = int(input())\n# a = [i for i in range(1, 2 * n + 1)]\n# b = [0] * (n * 2 + 1)\n# cnt = 0\n# for _ in range(n):\n# x, y = map(int, input().split())\n# a[x - 1], a[y - 1] = a[y - 1], a[x - 1]\n#\n# def merge(l, mid, r):\n# i, j, k = l, mid + 1, l\n# while i <= mid and j <= r:\n# if a[i] <= a[j]: # 小于填到b中\n# b[k] = a[i]\n# i += 1\n# else:\n# b[k] = a[j] # 存在逆序对\n# j += 1\n# global cnt\n# cnt += mid - i + 1 # 计入答案\n# k += 1\n# b[k:k + mid + 1 - i] = a[i:mid + 1] # 合并\n# b[k:k + r + 1 - j] = a[j:r + 1]\n# a[l:r + 1] = b[l:r + 1]\n#\n# def merge_sort(l, r):\n# if l >= r: return\n# mid = l + r >> 1\n# merge_sort(l, mid)\n# merge_sort(mid + 1, r)\n# merge(l, mid, r)\n# merge_sort(0, n * 2 - 1)\n# print(cnt)\n\n \t \t \t\t \t \t\t \t \t\t\t \t\t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* walruses sitting in a circle. All of them are numbered in the clockwise order: the walrus number 2 sits to the left of the walrus number 1, the walrus number 3 sits to the left of the walrus number 2, ..., the walrus number 1 sits to the left of the walrus number *n*.\n\nThe presenter has *m* chips. The presenter stands in the middle of the circle and starts giving the chips to the walruses starting from walrus number 1 and moving clockwise. The walrus number *i* gets *i* chips. If the presenter can't give the current walrus the required number of chips, then the presenter takes the remaining chips and the process ends. Determine by the given *n* and *m* how many chips the presenter will get in the end.",
"input": "",
"output": "```python\nn,m=input(\"\").split(\" \")\r\nn=int(n);m=int(m)\r\nm%=(n*(n+1)/2)\r\nfor i in range(1,n+1):\r\n if(mb and ac:\r\n for i in ed[bas:son]:\r\n if i!=b and i!=c:\r\n say+=1\r\nprint(say)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day, the Grasshopper was jumping on the lawn and found a piece of paper with a string. Grasshopper became interested what is the minimum jump ability he should have in order to be able to reach the far end of the string, jumping only on vowels of the English alphabet. Jump ability is the maximum possible length of his jump. \n\nFormally, consider that at the begginning the Grasshopper is located directly in front of the leftmost character of the string. His goal is to reach the position right after the rightmost character of the string. In one jump the Grasshopper could jump to the right any distance from 1 to the value of his jump ability.\n\nThe following letters are vowels: 'A', 'E', 'I', 'O', 'U' and 'Y'.",
"input": "",
"output": "```python\n#https://codeforces.com/problemset/problem/733/A\r\na = input()\r\nvow = [\"A\",\"E\",\"I\",\"O\",\"U\",\"Y\"]\r\nmind = 1\r\ncdist= 1\r\n\r\nif (all(map(lambda x: x not in vow, a))):\r\n print(len(a)+1)\r\nelse:\r\n for x in a:\r\n if x not in vow:\r\n cdist+=1\r\n else:\r\n if mind0 and len(n)<=100:\r\n f=n[0]\r\n l=n[-1]\r\n m=n[1:-1]\r\n b=len(m)\r\n print(f\"{f}{b}{l}\")\r\nn=input() \r\ntoo_long(n)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two positive integer numbers *a* and *b*. Permute (change order) of the digits of *a* to construct maximal number not exceeding *b*. No number in input and/or output can start with the digit 0.\n\nIt is allowed to leave *a* as it is.",
"input": "",
"output": "```python\na=sorted(input())\r\nb=int(input())\r\na=a[::-1]\r\np=\"\"\r\nwhile a:\r\n\tfor i, z in enumerate(a):\r\n\t\tn=p+a[i]+\"\".join(sorted(a[:i]+a[i+1:]))\r\n\t\tif int(n)<=b:\r\n\t\t\tp+=z\r\n\t\t\ta.pop(i)\r\n\t\t\tbreak\r\nprint(p)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are *n* showplaces in the city, numbered from 1 to *n*, and some of them are connected by one-directional roads. The roads in Berlatov are designed in a way such that there are no cyclic routes between showplaces.\n\nInitially Irina stands at the showplace 1, and the endpoint of her journey is the showplace *n*. Naturally, Irina wants to visit as much showplaces as she can during her journey. However, Irina's stay in Berlatov is limited and she can't be there for more than *T* time units.\n\nHelp Irina determine how many showplaces she may visit during her journey from showplace 1 to showplace *n* within a time not exceeding *T*. It is guaranteed that there is at least one route from showplace 1 to showplace *n* such that Irina will spend no more than *T* time units passing it.",
"input": "",
"output": "```python\n\r\n\r\n# n,m,T=map(int, input().split())\r\n# d={i:[] for i in range(n)}\r\n# for i in range(m):\r\n# a,b,t=map(int, input().split())\r\n# a-=1 ; b-=1 \r\n# d[a].append([b,t])\r\n\r\n\r\n# dp=[[[float('inf'),-1] for _ in range(n)] for _ in range(n)]\r\n# dp[0][0]=[0,-1]\r\n\r\n# q=[0]\r\n# while q:\r\n# q1=[]\r\n# for node in q:\r\n# for child, t in d[node]:\r\n# for count in range(1,n):\r\n# if dp[child][count][0]>dp[node][count-1][0]+t:\r\n# dp[child][count][0] = dp[node][count-1][0]+t\r\n# dp[child][count][1] = node\r\n\r\n# q1.append(child)\r\n# q=q1 \r\n# # print(dp[n-1])\r\n# ans=-1 \r\n# for i in range(n):\r\n# if dp[n-1][i][0]<=T:\r\n# ans=i\r\n# l=[]\r\n# node=n-1 \r\n# for i in range(ans,-1,-1):\r\n# l.append(node+1)\r\n# node=dp[node][i][1]\r\n\r\n# l=l[::-1]\r\n# print(ans+1)\r\n# print(*l)\r\n\r\n\r\nn, m, T = map(int, input().split())\r\nadj = [[] for _ in range(n+1)]\r\nadw = [[] for _ in range(n+1)]\r\ndp = [[0 for _ in range(n+1)] for _ in range(n+1)]\r\npv = [[0 for _ in range(n+1)] for _ in range(n+1)]\r\n\r\nfor i in range(m):\r\n a, b, t = map(int, input().split())\r\n adj[b].append(a)\r\n adw[b].append(t)\r\n if a == 1:\r\n dp[b][2] = t\r\n pv[b][2] = 1\r\n\r\nfor c in range(3, n+1):\r\n for v in range(2, n+1):\r\n for i, nx in enumerate(adj[v]):\r\n if dp[nx][c-1]:\r\n dist = dp[nx][c-1] + adw[v][i]\r\n if dist <= T and (not dp[v][c] or dist < dp[v][c]):\r\n dp[v][c] = dist\r\n pv[v][c] = nx\r\n\r\nfor i in range(n,0,-1):\r\n if pv[n][i]:\r\n break\r\n\r\nres = [n]\r\nwhile pv[res[-1]][i] != 1:\r\n res.append(pv[res[-1]][i])\r\n i -= 1\r\nres += [1]\r\nprint(len(res))\r\nprint(' '.join(map(str, res[::-1])))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vlad likes to eat in cafes very much. During his life, he has visited cafes *n* times. Unfortunately, Vlad started to feel that his last visits are not any different from each other. To fix that Vlad had a small research.\n\nFirst of all, Vlad assigned individual indices to all cafes. Then, he wrote down indices of cafes he visited in a row, in order of visiting them. Now, Vlad wants to find such a cafe that his last visit to that cafe was before his last visits to every other cafe. In other words, he wants to find such a cafe that he hasn't been there for as long as possible. Help Vlad to find that cafe.",
"input": "",
"output": "```python\nn = int(input())\r\na = list(map(int, input().split()))\r\nc = len(set(a))\r\n\r\nwas = set()\r\nans = -1\r\nfor i in a[::-1]:\r\n if i not in was:\r\n was.add(i)\r\n ans = i\r\n if len(was) == c:\r\n print(ans)\r\n exit()\r\n\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A and B are preparing themselves for programming contests.\n\nB loves to debug his code. But before he runs the solution and starts debugging, he has to first compile the code.\n\nInitially, the compiler displayed *n* compilation errors, each of them is represented as a positive integer. After some effort, B managed to fix some mistake and then another one mistake.\n\nHowever, despite the fact that B is sure that he corrected the two errors, he can not understand exactly what compilation errors disappeared — the compiler of the language which B uses shows errors in the new order every time! B is sure that unlike many other programming languages, compilation errors for his programming language do not depend on each other, that is, if you correct one error, the set of other error does not change.\n\nCan you help B find out exactly what two errors he corrected?",
"input": "",
"output": "```python\nn=int(input());\r\nl1=[];l2=[];l3=[];\r\nsum1=0;sum2=0;sum3=0;\r\nl1 = list(map(int, input().split()))\r\nsum1=sum(l1);\r\nl2 = list(map(int, input().split()))\r\nsum2=sum(l2);\r\nl3 = list(map(int, input().split()))\r\nsum3=sum(l3);\r\nprint(abs(sum1-sum2))\r\nprint(abs(sum2-sum3))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Throughout Igor K.'s life he has had many situations worthy of attention. We remember the story with the virus, the story of his mathematical career and of course, his famous programming achievements. However, one does not always adopt new hobbies, one can quit something as well.\n\nThis time Igor K. got disappointed in one of his hobbies: editing and voicing videos. Moreover, he got disappointed in it so much, that he decided to destroy his secret archive for good. \n\nIgor K. use Pindows XR operation system which represents files and folders by small icons. At that, *m* icons can fit in a horizontal row in any window.\n\nIgor K.'s computer contains *n* folders in the D: disk's root catalog. The folders are numbered from 1 to *n* in the order from the left to the right and from top to bottom (see the images). At that the folders with secret videos have numbers from *a* to *b* inclusive. Igor K. wants to delete them forever, at that making as few frame selections as possible, and then pressing Shift+Delete exactly once. What is the minimum number of times Igor K. will have to select the folder in order to select folders from *a* to *b* and only them? Let us note that if some selected folder is selected repeatedly, then it is deselected. Each selection possesses the shape of some rectangle with sides parallel to the screen's borders.",
"input": "",
"output": "```python\n'''input\n20 5 2 20\n'''\nfrom sys import stdin\nimport math\n\n\n# main starts\nn, m, a, b = list(map(int, stdin.readline().split()))\nif n < m:\n\tprint(1)\n\texit()\nupper = math.ceil(a / m)\nlower = math.ceil(b / m)\ncount = 0\nif (upper - 1) * m + 1 == a:\n\tpass\nelse:\n\tcount += 1\n\nif (lower)* m == b:\n\tpass\nelse:\n\tcount += 1\nif upper + 1 <= lower - 1:\n\tcount += 1\nprint(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has a non-negative integer *n*. He wants to round it to nearest integer, which ends up with 0. If *n* already ends up with 0, Vasya considers it already rounded.\n\nFor example, if *n*<==<=4722 answer is 4720. If *n*<==<=5 Vasya can round it to 0 or to 10. Both ways are correct.\n\nFor given *n* find out to which integer will Vasya round it.",
"input": "",
"output": "```python\ndef rounding(num):\r\n num=str(num)\r\n v=num\r\n rounddown=[\"1\",\"2\",\"3\",\"4\",\"5\"]\r\n roundup=[\"6\",\"7\",\"8\",\"9\"]\r\n if num[-1]==\"0\":\r\n return(num)\r\n elif num[-1] in rounddown:\r\n return(num[:-1:]+\"0\")\r\n elif num[-1] in roundup:\r\n return(num[:-2:]+str(int(v[-2])+2)+\"0\")\r\na=int(input())\r\nprint(rounding(a))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Max wants to buy a new skateboard. He has calculated the amount of money that is needed to buy a new skateboard. He left a calculator on the floor and went to ask some money from his parents. Meanwhile his little brother Yusuf came and started to press the keys randomly. Unfortunately Max has forgotten the number which he had calculated. The only thing he knows is that the number is divisible by 4.\n\nYou are given a string *s* consisting of digits (the number on the display of the calculator after Yusuf randomly pressed the keys). Your task is to find the number of substrings which are divisible by 4. A substring can start with a zero.\n\nA substring of a string is a nonempty sequence of consecutive characters.\n\nFor example if string *s* is 124 then we have four substrings that are divisible by 4: 12, 4, 24 and 124. For the string 04 the answer is three: 0, 4, 04.\n\nAs input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use gets/scanf/printf instead of getline/cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java.",
"input": "",
"output": "```python\ncount = 0\nx = input()\nfor i in range(len(x)-1):\n z = x[i:i+2]\n if int(z)%4 == 0:\n count += i+1\nfor j in range(len(x)):\n if x[j] in ['0', '4', '8']:\n count+= 1\nprint(count) \n \n \n\n\t \t\t \t \t\t \t \t\t\t\t\t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Andrewid the Android is a galaxy-famous detective. In his free time he likes to think about strings containing zeros and ones.\n\nOnce he thought about a string of length *n* consisting of zeroes and ones. Consider the following operation: we choose any two adjacent positions in the string, and if one them contains 0, and the other contains 1, then we are allowed to remove these two digits from the string, obtaining a string of length *n*<=-<=2 as a result.\n\nNow Andreid thinks about what is the minimum length of the string that can remain after applying the described operation several times (possibly, zero)? Help him to calculate this number.",
"input": "",
"output": "```python\nn=int(input())\r\ns=input()\r\nc0=0\r\nc1=0\r\nfor i in s:\r\n if i=='0':\r\n c0+=1\r\n\r\nc1=n-c0\r\nans=abs(c1-c0)\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A frog lives on the axis *Ox* and needs to reach home which is in the point *n*. She starts from the point 1. The frog can jump to the right at a distance not more than *d*. So, after she jumped from the point *x* she can reach the point *x*<=+<=*a*, where *a* is an integer from 1 to *d*.\n\nFor each point from 1 to *n* is known if there is a lily flower in it. The frog can jump only in points with a lilies. Guaranteed that there are lilies in the points 1 and *n*.\n\nDetermine the minimal number of jumps that the frog needs to reach home which is in the point *n* from the point 1. Consider that initially the frog is in the point 1. If the frog can not reach home, print -1.",
"input": "",
"output": "```python\nfrom sys import stdin \r\n\r\nn,d=map(int,stdin.readline().split())\r\ns=input()\r\nlast=0\r\njump=0\r\nwhile last!=n-1:\r\n for i in range(n-1,last,-1):\r\n if s[i]=='1':\r\n if i-last<=d:\r\n last=i\r\n jump+=1\r\n break\r\n if jump==0:\r\n break\r\n\r\nprint(jump if jump>0 else -1) \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya has *n* integers: 1,<=2,<=3,<=...,<=*n*. He wants to split these integers in two non-empty groups in such a way that the absolute difference of sums of integers in each group is as small as possible. \n\nHelp Petya to split the integers. Each of *n* integers should be exactly in one group.",
"input": "",
"output": "```python\nn = int(input())\nif n % 4 == 0:\n print(0)\n ans = []\n x = 1\n for i in range(n // 4):\n ans.append(x)\n ans.append(n + 1 - x)\n x += 1\n print(len(ans), *ans)\nelif n % 4 == 1:\n x = 2\n ans = []\n print(1)\n for i in range(n // 4):\n ans.append(x)\n ans.append(n + 1 - x)\n x += 1\n print(len(ans), *ans)\nelif n % 4 == 2:\n x = 3\n ans = [2]\n print(1)\n for i in range(n // 4):\n ans.append(x)\n ans.append(n + 1 - x)\n x += 1\n print(len(ans), *ans)\nelse:\n print(0)\n x = 2\n ans = [3]\n print(1)\n for i in range(n // 4):\n ans.append(x)\n ans.append(n + 1 - x)\n x += 1\n print(len(ans), *ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "\"QAQ\" is a word to denote an expression of crying. Imagine \"Q\" as eyes with tears and \"A\" as a mouth.\n\nNow Diamond has given Bort a string consisting of only uppercase English letters of length *n*. There is a great number of \"QAQ\" in the string (Diamond is so cute!).\n\nBort wants to know how many subsequences \"QAQ\" are in the string Diamond has given. Note that the letters \"QAQ\" don't have to be consecutive, but the order of letters should be exact.",
"input": "",
"output": "```python\nstring = input()\r\nres = 0\r\nfor i in range(len(string)):\r\n if string[i] == 'A':\r\n res += (string[:i].count('Q') * string[i:].count('Q'))\r\nprint(res)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "On the planet Mars a year lasts exactly *n* days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible number of days off per year on Mars.",
"input": "",
"output": "```python\nq=int(input())\r\nif q==1 or q==6:\r\n print(0,1)\r\nelif q%7==0:\r\n print(q//7*2,q//7*2)\r\nelif q<7:\r\n print(0,0)\r\nelif q%7==6:\r\n print(q//7*2+1,q//7*2+2)\r\nelif q%7>2:\r\n print(q//7*2,q//7*2+2)\r\nelse:\r\n print(q//7*2,q//7*2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "This problem's actual name, \"Lexicographically Largest Palindromic Subsequence\" is too long to fit into the page headline.\n\nYou are given string *s* consisting of lowercase English letters only. Find its lexicographically largest palindromic subsequence.\n\nWe'll call a non-empty string *s*[*p*1*p*2... *p**k*] = *s**p*1*s**p*2... *s**p**k* (1 <=≤<= *p*1<=<<=*p*2<=<<=...<=<<=*p**k* <=≤<= |*s*|) a subsequence of string *s* = *s*1*s*2... *s*|*s*|, where |*s*| is the length of string *s*. For example, strings \"abcb\", \"b\" and \"abacaba\" are subsequences of string \"abacaba\".\n\nString *x* = *x*1*x*2... *x*|*x*| is lexicographically larger than string *y* = *y*1*y*2... *y*|*y*| if either |*x*| > |*y*| and *x*1<==<=*y*1, *x*2<==<=*y*2, ...,<=*x*|*y*|<==<=*y*|*y*|, or there exists such number *r* (*r*<=<<=|*x*|, *r*<=<<=|*y*|) that *x*1<==<=*y*1, *x*2<==<=*y*2, ..., *x**r*<==<=*y**r* and *x**r*<=<=+<=<=1<=><=*y**r*<=<=+<=<=1. Characters in the strings are compared according to their ASCII codes. For example, string \"ranger\" is lexicographically larger than string \"racecar\" and string \"poster\" is lexicographically larger than string \"post\".\n\nString *s* = *s*1*s*2... *s*|*s*| is a palindrome if it matches string *rev*(*s*) = *s*|*s*|*s*|*s*|<=-<=1... *s*1. In other words, a string is a palindrome if it reads the same way from left to right and from right to left. For example, palindromic strings are \"racecar\", \"refer\" and \"z\".",
"input": "",
"output": "```python\ns=input()\r\np=''\r\nk=max(s)\r\nfor i in range(len(s)):\r\n if(s[i]==k):\r\n p+=s[i]\r\n i+=1\r\nprint(p)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A burglar got into a matches warehouse and wants to steal as many matches as possible. In the warehouse there are *m* containers, in the *i*-th container there are *a**i* matchboxes, and each matchbox contains *b**i* matches. All the matchboxes are of the same size. The burglar's rucksack can hold *n* matchboxes exactly. Your task is to find out the maximum amount of matches that a burglar can carry away. He has no time to rearrange matches in the matchboxes, that's why he just chooses not more than *n* matchboxes so that the total amount of matches in them is maximal.",
"input": "",
"output": "```python\nn,m=map(int,input().split(\" \"))\r\nlist=[]\r\nfor i in range (m):\r\n temp_list=[int(k) for k in input().split()]\r\n for j in range(temp_list[0]):\r\n list.append(temp_list[1])\r\n\r\nlist.sort(reverse=True)\r\nprint(list)\r\nsum=0\r\nfor k in range(n):\r\n sum+=int(list[k])\r\nprint(sum,end=\" \")\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Leha decided to move to a quiet town Vičkopolis, because he was tired by living in Bankopolis. Upon arrival he immediately began to expand his network of hacked computers. During the week Leha managed to get access to *n* computers throughout the town. Incidentally all the computers, which were hacked by Leha, lie on the same straight line, due to the reason that there is the only one straight street in Vičkopolis.\n\nLet's denote the coordinate system on this street. Besides let's number all the hacked computers with integers from 1 to *n*. So the *i*-th hacked computer is located at the point *x**i*. Moreover the coordinates of all computers are distinct. \n\nLeha is determined to have a little rest after a hard week. Therefore he is going to invite his friend Noora to a restaurant. However the girl agrees to go on a date with the only one condition: Leha have to solve a simple task.\n\nLeha should calculate a sum of *F*(*a*) for all *a*, where *a* is a non-empty subset of the set, that consists of all hacked computers. Formally, let's denote *A* the set of all integers from 1 to *n*. Noora asks the hacker to find value of the expression . Here *F*(*a*) is calculated as the maximum among the distances between all pairs of computers from the set *a*. Formally, . Since the required sum can be quite large Noora asks to find it modulo 109<=+<=7.\n\nThough, Leha is too tired. Consequently he is not able to solve this task. Help the hacker to attend a date.",
"input": "",
"output": "```python\nimport math\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\ns = list(sorted(s, reverse = True))\r\nres = 0\r\nfor i in range(0, len(s)-1):\r\n for j in range(i+1, len(s)):\r\n res = res + (s[i] - s[j])*int(math.pow(2,(j-i-1)))\r\nprint(res % 1000000007)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "It's the year 4527 and the tanks game that we all know and love still exists. There also exists Great Gena's code, written in 2016. The problem this code solves is: given the number of tanks that go into the battle from each country, find their product. If it is turns to be too large, then the servers might have not enough time to assign tanks into teams and the whole game will collapse!\n\nThere are exactly *n* distinct countries in the world and the *i*-th country added *a**i* tanks to the game. As the developers of the game are perfectionists, the number of tanks from each country is beautiful. A beautiful number, according to the developers, is such number that its decimal representation consists only of digits '1' and '0', moreover it contains at most one digit '1'. However, due to complaints from players, some number of tanks of one country was removed from the game, hence the number of tanks of this country may not remain beautiful.\n\nYour task is to write the program that solves exactly the same problem in order to verify Gena's code correctness. Just in case.",
"input": "",
"output": "```python\nn = int(input())\r\nans = 1 \r\nlst = list(map(int, input().split()))\r\nfor it in lst:\r\n ans = ans * it\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Olga came to visit the twins Anna and Maria and saw that they have many cookies. The cookies are distributed into bags. As there are many cookies, Olga decided that it's no big deal if she steals a bag. However, she doesn't want the sisters to quarrel because of nothing when they divide the cookies. That's why Olga wants to steal a bag with cookies so that the number of cookies in the remaining bags was even, that is, so that Anna and Maria could evenly divide it into two (even 0 remaining cookies will do, just as any other even number). How many ways there are to steal exactly one cookie bag so that the total number of cookies in the remaining bags was even?",
"input": "",
"output": "```python\nn = int(input())\r\ncnt = 0\r\na = list(map(int, input().split()))\r\nfor i in range(len(a)):\r\n if (sum(a) - a[i]) % 2 == 0:\r\n cnt = cnt + 1\r\nprint(cnt)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "PolandBall lives in a forest with his family. There are some trees in the forest. Trees are undirected acyclic graphs with *k* vertices and *k*<=-<=1 edges, where *k* is some integer. Note that one vertex is a valid tree.\n\nThere is exactly one relative living in each vertex of each tree, they have unique ids from 1 to *n*. For each Ball *i* we know the id of its most distant relative living on the same tree. If there are several such vertices, we only know the value of the one with smallest id among those.\n\nHow many trees are there in the forest?",
"input": "",
"output": "```python\nfrom collections import defaultdict\r\nclass Graph:\r\n def __init__(self):\r\n self.graph=defaultdict(list)\r\n def addedge(self,u,v):\r\n self.graph[u].append(v)\r\n self.graph[v].append(u)\r\n\r\n def dfs(self,s):\r\n stack=[]\r\n stack.append(s)\r\n #print(self.visited)\r\n while len(stack)!=0:\r\n a=stack[-1]\r\n #print(a,self.visited,s)\r\n #print(stack)\r\n stack.pop()\r\n if(self.visited[a]==False):\r\n #print(a)\r\n self.visited[a]=True\r\n for node in self.graph[a]:\r\n if(self.visited[node]==False):\r\n stack.append(node)\r\n return\r\n def dfsutill(self):\r\n l=list(self.graph.keys())\r\n self.visited=[False for i in range(len(l)+1)]\r\n #print(self.visited)\r\n #print(l)\r\n c=0\r\n for v in l:\r\n if(self.visited[v]==False):\r\n c+=1\r\n self.dfs(v)\r\n #print(self.visited)\r\n return c\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ng=Graph()\r\nfor i in range(1,n+1):\r\n g.addedge(i,l[i-1])\r\nprint(g.dfsutill())\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp thinks about the meaning of life very often. He does this constantly, even when typing in the editor. Every time he starts brooding he can no longer fully concentrate and repeatedly presses the keys that need to be pressed only once. For example, instead of the phrase \"how are you\" he can type \"hhoow aaaare yyoouu\". \n\nPolycarp decided to automate the process of correcting such errors. He decided to write a plug-in to the text editor that will remove pairs of identical consecutive letters (if there are any in the text). Of course, this is not exactly what Polycarp needs, but he's got to start from something! \n\nHelp Polycarp and write the main plug-in module. Your program should remove from a string all pairs of identical letters, which are consecutive. If after the removal there appear new pairs, the program should remove them as well. Technically, its work should be equivalent to the following: while the string contains a pair of consecutive identical letters, the pair should be deleted. Note that deleting of the consecutive identical letters can be done in any order, as any order leads to the same result.",
"input": "",
"output": "```python\ns = list(input())\r\nout = [s[0]]\r\nfor i in range(1, len(s)):\r\n if len(out) > 0 and s[i] == out[-1]:\r\n out.pop()\r\n else:\r\n out.append(s[i])\r\nprint(''.join(out))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each direction) and 3 lanes getting out of the intersection, so we have 4 parts in total. Each part has 4 lights, one for each lane getting into the intersection (*l* — left, *s* — straight, *r* — right) and a light *p* for a pedestrian crossing. \n\nAn accident is possible if a car can hit a pedestrian. This can happen if the light of a pedestrian crossing of some part and the light of a lane that can get to or from that same part are green at the same time.\n\nNow, Sagheer is monitoring the configuration of the traffic lights. Your task is to help him detect whether an accident is possible.",
"input": "",
"output": "```python\nmatrix = [list(map(int, input().split())) for _ in range(4)]\n\np1 = any([matrix[0][1], matrix[0][2], matrix[0][0], matrix[1][0], matrix[2][1], matrix[3][2]])\np2 = any([matrix[0][2], matrix[1][0], matrix[1][2], matrix[1][1], matrix[2][0], matrix[3][1]])\np3 = any([matrix[0][1], matrix[1][2], matrix[2][0], matrix[2][1], matrix[2][2], matrix[3][0]])\np4 = any([matrix[0][0], matrix[1][1], matrix[2][2], matrix[3][0], matrix[3][1], matrix[3][2]])\n\nif (matrix[0][3] and p1) or (matrix[1][3] and p2) or (matrix[2][3] and p3) or (matrix[3][3] and p4):\n\tprint('Yes')\nelse:\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pashmak has fallen in love with an attractive girl called Parmida since one year ago...\n\nToday, Pashmak set up a meeting with his partner in a romantic garden. Unfortunately, Pashmak has forgotten where the garden is. But he remembers that the garden looks like a square with sides parallel to the coordinate axes. He also remembers that there is exactly one tree on each vertex of the square. Now, Pashmak knows the position of only two of the trees. Help him to find the position of two remaining ones.",
"input": "",
"output": "```python\ndef pashmak_and_garden():\r\n points = [int(point) for point in input().split()]\r\n conj_points = (points[0] == points[2]) or (points[1] == points[3])\r\n diff = [points[i] - points[i+2] for i in range(2)]\r\n print(diff)\r\n unique_diff = list(set(diff))\r\n nunique_diff = len(unique_diff)\r\n if (nunique_diff == 1):\r\n other_points = [str(points[0]), str(points[1] - unique_diff[0]), str(points[0] - unique_diff[0]), str(points[1])]\r\n print(\" \".join(other_points))\r\n elif (conj_points):\r\n other_points = [[points[i]+diff[i-1], points[i+2]+diff[i-1]] for i in range(2)]\r\n other_points = [str(point[0]) for point in other_points] + [str(point[1]) for point in other_points]\r\n print(\" \".join(other_points))\r\n else:\r\n print(-1)\r\n \r\npashmak_and_garden()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little penguin Polo has an *n*<=×<=*m* matrix, consisting of integers. Let's index the matrix rows from 1 to *n* from top to bottom and let's index the columns from 1 to *m* from left to right. Let's represent the matrix element on the intersection of row *i* and column *j* as *a**ij*.\n\nIn one move the penguin can add or subtract number *d* from some matrix element. Find the minimum number of moves needed to make all matrix elements equal. If the described plan is impossible to carry out, say so.",
"input": "",
"output": "```python\nn, m, d = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a += list(map(int, input().split()))\r\na = sorted(a)\r\n\r\nmod = a[0] % d\r\npiv = a[(n*m)//2]\r\nans = 0\r\nfor i in range(n*m):\r\n if a[i] % d != mod:\r\n print(-1)\r\n break\r\n ans += abs(a[i]-piv) // d\r\nelse:\r\n print(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "An elephant decided to visit his friend. It turned out that the elephant's house is located at point 0 and his friend's house is located at point *x*(*x*<=><=0) of the coordinate line. In one step the elephant can move 1, 2, 3, 4 or 5 positions forward. Determine, what is the minimum number of steps he need to make in order to get to his friend's house.",
"input": "",
"output": "```python\nnum = int(input())\r\ntime = 0\r\n\r\nwhile num > 0:\r\n for i in range(5,0,-1):\r\n if (num-i) >= 0: \r\n num -= i\r\n time += 1\r\n break\r\n\r\nprint(time)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.\n\nOne day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.\n\nIn his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The *i*-th digit of the answer is 1 if and only if the *i*-th digit of the two given numbers differ. In the other case the *i*-th digit of the answer is 0.\n\nShapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.\n\nNow you are going to take part in Shapur's contest. See if you are faster and more accurate.",
"input": "",
"output": "```python\na = input()\r\nb = input()\r\n\r\nt1 = list(a)\r\nt2 = list(b)\r\nans = ''\r\nfor i in range(len(t1)):\r\n\tif(t1[i] != t2[i]):\r\n\t\tans += '1'\r\n\telse:\r\n\t\tans += '0'\t\r\n\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Xenia the beginner programmer has a sequence *a*, consisting of 2*n* non-negative integers: *a*1,<=*a*2,<=...,<=*a*2*n*. Xenia is currently studying bit operations. To better understand how they work, Xenia decided to calculate some value *v* for *a*.\n\nNamely, it takes several iterations to calculate value *v*. At the first iteration, Xenia writes a new sequence *a*1 *or* *a*2,<=*a*3 *or* *a*4,<=...,<=*a*2*n*<=-<=1 *or* *a*2*n*, consisting of 2*n*<=-<=1 elements. In other words, she writes down the bit-wise OR of adjacent elements of sequence *a*. At the second iteration, Xenia writes the bitwise exclusive OR of adjacent elements of the sequence obtained after the first iteration. At the third iteration Xenia writes the bitwise OR of the adjacent elements of the sequence obtained after the second iteration. And so on; the operations of bitwise exclusive OR and bitwise OR alternate. In the end, she obtains a sequence consisting of one element, and that element is *v*.\n\nLet's consider an example. Suppose that sequence *a*<==<=(1,<=2,<=3,<=4). Then let's write down all the transformations (1,<=2,<=3,<=4) <=→<= (1 *or* 2<==<=3,<=3 *or* 4<==<=7) <=→<= (3 *xor* 7<==<=4). The result is *v*<==<=4.\n\nYou are given Xenia's initial sequence. But to calculate value *v* for a given sequence would be too easy, so you are given additional *m* queries. Each query is a pair of integers *p*,<=*b*. Query *p*,<=*b* means that you need to perform the assignment *a**p*<==<=*b*. After each query, you need to print the new value *v* for the new sequence *a*.",
"input": "",
"output": "```python\n#IXABO \n\nimport sys\nLINES = sys.stdin.read().splitlines()[::-1]\ninput = lambda: LINES.pop()\n \n \ndef get_list_of_ints():\n return list(map(lambda x: int(x), input().split()))\n \n \ndef get_tree_index(n, i):\n return 2 ** n - 2 + i\n \n \ndef set_op_value(tree, i, parity):\n if parity % 2:\n tree[i] = tree[2 * (i + 1) - 1] ^ tree[2 * (i + 1)]\n else:\n tree[i] = tree[2 * (i + 1) - 1] | tree[2 * (i + 1)]\n \n \ndef update_tree(tree, n, query):\n p, b = query\n start = get_tree_index(n, p)\n tree[start] = b\n i = int((start - 1) / 2)\n parity = 0\n while True:\n set_op_value(tree, i, parity)\n if i == 0:\n break\n i = int((i - 1) / 2)\n parity += 1\n \n \ndef create_tree(n, a):\n tree = [0] * (2 ** n - 1) + a\n level = n - 1\n while True:\n i = 2 ** level - 1\n parity = n - level + 1\n while i < 2 ** (level + 1) - 1:\n set_op_value(tree, i, parity)\n i += 1\n if level == 0:\n break\n level -= 1\n return tree\n \n \nif __name__ == '__main__':\n n, m = get_list_of_ints()\n a = get_list_of_ints()\n queries = []\n for i in range(0, m):\n queries.append(get_list_of_ints())\n tree = create_tree(n, a)\n for q in queries:\n update_tree(tree, n, q)\n print(tree[0])\n\n\t \t \t \t\t\t\t \t\t\t \t \t\t \t \t\n\t\t\t\t\t \t\t\t \t \t\t \t\t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink \"Beecola\", which can be bought in *n* different shops in the city. It's known that the price of one bottle in the shop *i* is equal to *x**i* coins.\n\nVasiliy plans to buy his favorite drink for *q* consecutive days. He knows, that on the *i*-th day he will be able to spent *m**i* coins. Now, for each of the days he want to know in how many different shops he can buy a bottle of \"Beecola\".",
"input": "",
"output": "```python\ndef shops(n, prices, q, money):\r\n s = []\r\n for i in range(q):\r\n d = 0\r\n for j in range(n):\r\n if prices[j] <= money[i]:\r\n d += 1\r\n s.append(d)\r\n return s\r\nn = int(input())\r\nprices = list(map(int, input().split()))\r\nq = int(input())\r\nmoney = [int(input()) for _ in range(q)]\r\na = shops(n, prices, q, money)\r\nfor i in a:\r\n print(i)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are *n* drinks in his fridge, the volume fraction of orange juice in the *i*-th drink equals *p**i* percent.\n\nOne day Vasya decided to make himself an orange cocktail. He took equal proportions of each of the *n* drinks and mixed them. Then he wondered, how much orange juice the cocktail has.\n\nFind the volume fraction of orange juice in the final drink.",
"input": "",
"output": "```python\ninput()\r\na = input().split()\r\nsumm = 0\r\nfor i in range(len(a)):\r\n summ += int(a[i])\r\nprint(round(summ / len(a)), 10)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sheldon, Leonard, Penny, Rajesh and Howard are in the queue for a \"Double Cola\" drink vending machine; there are no other people in the queue. The first one in the queue (Sheldon) buys a can, drinks it and doubles! The resulting two Sheldons go to the end of the queue. Then the next in the queue (Leonard) buys a can, drinks it and gets to the end of the queue as two Leonards, and so on. This process continues ad infinitum.\n\nFor example, Penny drinks the third can of cola and the queue will look like this: Rajesh, Howard, Sheldon, Sheldon, Leonard, Leonard, Penny, Penny.\n\nWrite a program that will print the name of a man who will drink the *n*-th can.\n\nNote that in the very beginning the queue looks like that: Sheldon, Leonard, Penny, Rajesh, Howard. The first person is Sheldon.",
"input": "",
"output": "```python\nimport math\r\nfrom collections import OrderedDict\r\nfrom collections import Counter\r\nfrom itertools import combinations\r\nfrom itertools import accumulate\r\nimport operator\r\nimport bisect\r\nimport copy\r\n#a= list(map(int, input(\"\").strip().split()))[:n]\r\n\r\n'''\r\ndef solve(a,x):\r\n \r\nt=int(input(\"\"))\r\nfor _ in range(t):\r\n n,x= list(map(int, input(\"\").strip().split()))[:2]\r\n a= list(map(int, input(\"\").strip().split()))[:n]\r\n solve(a,x)\r\n\r\n'''\r\ndef solve(n):\r\n d={0:\"Sheldon\",1:\"Leonard\",2:\"Penny\",3:\"Rajesh\",4:\"Howard\"}\r\n while n>4:\r\n n=(n-5)//2\r\n print(d[n])\r\nn=int(input(\"\"))\r\nsolve(n-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Jeff's friends know full well that the boy likes to get sequences and arrays for his birthday. Thus, Jeff got sequence *p*1,<=*p*2,<=...,<=*p**n* for his birthday.\n\nJeff hates inversions in sequences. An inversion in sequence *a*1,<=*a*2,<=...,<=*a**n* is a pair of indexes *i*,<=*j* (1<=≤<=*i*<=<<=*j*<=≤<=*n*), such that an inequality *a**i*<=><=*a**j* holds.\n\nJeff can multiply some numbers of the sequence *p* by -1. At that, he wants the number of inversions in the sequence to be minimum. Help Jeff and find the minimum number of inversions he manages to get.",
"input": "",
"output": "```python\nn = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\ninversions = 0\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if sequence[i] > sequence[j]:\r\n inversions += 1\r\n\r\nprint(inversions)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two players play a simple game. Each player is provided with a box with balls. First player's box contains exactly *n*1 balls and second player's box contains exactly *n*2 balls. In one move first player can take from 1 to *k*1 balls from his box and throw them away. Similarly, the second player can take from 1 to *k*2 balls from his box in his move. Players alternate turns and the first player starts the game. The one who can't make a move loses. Your task is to determine who wins if both players play optimally.",
"input": "",
"output": "```python\ndef mod():\r\n a=int(input())\r\n b=int(input())\r\n c=int(input())\r\n d=int(input())\r\n if a+c>b+d:\r\n print(\"frist\")\r\n else:\r\n print(\"second\")\r\n\r\nmod() \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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 each value. Such sum is called unfortunate. Gerald wondered: what is the minimum unfortunate sum?",
"input": "",
"output": "```python\nn=int(input())\r\nnotes = list(map(int,input().split()))\r\nprint((min(notes),-1)[min(notes)==1])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp is a big lover of killing time in social networks. A page with a chatlist in his favourite network is made so that when a message is sent to some friend, his friend's chat rises to the very top of the page. The relative order of the other chats doesn't change. If there was no chat with this friend before, then a new chat is simply inserted to the top of the list.\n\nAssuming that the chat list is initially empty, given the sequence of Polycaprus' messages make a list of chats after all of his messages are processed. Assume that no friend wrote any message to Polycarpus.",
"input": "",
"output": "```python\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Jul 12 14:41:22 2021\n\n@author: lcarv\n\"\"\"\n\n\n\nm = {}\nl = []\nn = int(input())\n\nfor i in range(n):\n s = str(input())\n l.append(s)\n m[s] = 0\n \n\n \nfor j in range(n-1, -1, -1):\n k = l[j]\n if m[k] == 0:\n print(k)\n m[k] = 1\n \n \n\t \t \t \t \t \t\t\t\t\t\t\t\t\t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "For a positive integer *n* let's define a function *f*:\n\n*f*(*n*)<==<=<=-<=1<=+<=2<=-<=3<=+<=..<=+<=(<=-<=1)*n**n* \n\nYour task is to calculate *f*(*n*) for a given integer *n*.",
"input": "",
"output": "```python\nn = int(input())\r\nt = 0\r\nfor i in range(n+1):\r\n if i % 2 == 0:\r\n t += i\r\n else:\r\n t -= i\r\nprint(t)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Haiku is a genre of Japanese traditional poetry.\n\nA haiku poem consists of 17 syllables split into three phrases, containing 5, 7 and 5 syllables correspondingly (the first phrase should contain exactly 5 syllables, the second phrase should contain exactly 7 syllables, and the third phrase should contain exactly 5 syllables). A haiku masterpiece contains a description of a moment in those three phrases. Every word is important in a small poem, which is why haiku are rich with symbols. Each word has a special meaning, a special role. The main principle of haiku is to say much using a few words.\n\nTo simplify the matter, in the given problem we will consider that the number of syllable in the phrase is equal to the number of vowel letters there. Only the following letters are regarded as vowel letters: \"a\", \"e\", \"i\", \"o\" and \"u\".\n\nThree phases from a certain poem are given. Determine whether it is haiku or not.",
"input": "",
"output": "```python\ndef haiku(line):\n\tvowel = 'aiueo'\n\tcount = 0\n\tfor i in line:\n\t\tif i in vowel:\n\t\t\tcount = count + 1\n\treturn count\n\n\nfirst = input().lower()\nsecond = input().lower()\nthird = input().lower()\n\n\n\nif haiku(first) == 5 and haiku(second) == 7 and haiku(third) == 5:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.\n\nHe wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence corners at a single angle *a*.\n\nWill the robot be able to build the fence Emuskald wants? In other words, is there a regular polygon which angles are equal to *a*?",
"input": "",
"output": "```python\n# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 11 16:51:30 2022\r\n\r\n@author: 帝落梦魂\r\n\"\"\"\r\n\r\nt = int(input())\r\nfor i in range(0,t):\r\n a = int(input())\r\n if 360%(180-a)==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Let's call a string \"s-palindrome\" if it is symmetric about the middle of the string. For example, the string \"oHo\" is \"s-palindrome\", but the string \"aa\" is not. The string \"aa\" is not \"s-palindrome\", because the second half of it is not a mirror reflection of the first half.\n\nYou are given a string *s*. Check if the string is \"s-palindrome\".",
"input": "",
"output": "```python\n[print(\"TAK\" if [s[i]+s[-1-i] in \"AA.HH.II.MM.OO.oo.TT.UU.VV.vv.WW.ww.XX.xx.YY.bd.db.pq.qp\" for i in range(len(s))]==[True]*len(s) else \"NIE\") for s in [(input())]]\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp is practicing his problem solving skill. He has a list of $n$ problems with difficulties $a_1, a_2, \\dots, a_n$, respectively. His plan is to practice for exactly $k$ days. Each day he has to solve at least one problem from his list. Polycarp solves the problems in the order they are given in his list, he cannot skip any problem from his list. He has to solve all $n$ problems in exactly $k$ days.\n\nThus, each day Polycarp solves a contiguous sequence of (consecutive) problems from the start of the list. He can't skip problems or solve them multiple times. As a result, in $k$ days he will solve all the $n$ problems.\n\nThe profit of the $j$-th day of Polycarp's practice is the maximum among all the difficulties of problems Polycarp solves during the $j$-th day (i.e. if he solves problems with indices from $l$ to $r$ during a day, then the profit of the day is $\\max\\limits_{l \\le i \\le r}a_i$). The total profit of his practice is the sum of the profits over all $k$ days of his practice.\n\nYou want to help Polycarp to get the maximum possible total profit over all valid ways to solve problems. Your task is to distribute all $n$ problems between $k$ days satisfying the conditions above in such a way, that the total profit is maximum.\n\nFor example, if $n = 8, k = 3$ and $a = [5, 4, 2, 6, 5, 1, 9, 2]$, one of the possible distributions with maximum total profit is: $[5, 4, 2], [6, 5], [1, 9, 2]$. Here the total profit equals $5 + 6 + 9 = 20$.",
"input": "",
"output": "```python\ndef main():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = a.copy()\r\n b.sort()\r\n sum_ = 0\r\n j = n - k\r\n b = b[j: n]\r\n for i in range(n - j):\r\n sum_ += b[i]\r\n count = 0\r\n ans = []\r\n for i in range(n):\r\n if a[i] in b:\r\n j = b.index(a[i])\r\n b.pop(j)\r\n if len(b) == 0:\r\n ans.append(str(abs(count - n)))\r\n else:\r\n ans.append(str(abs(count - i - 1)))\r\n\r\n count = i + 1\r\n s_ans = ' '.join(ans)\r\n print(sum_)\r\n print(s_ans)\r\n\r\n\r\nmain()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "When new students come to the Specialized Educational and Scientific Centre (SESC) they need to start many things from the beginning. Sometimes the teachers say (not always unfairly) that we cannot even count. So our teachers decided to teach us arithmetics from the start. And what is the best way to teach students add and subtract? — That's right, using counting sticks! An here's our new task: \n\nAn expression of counting sticks is an expression of type:\n\nSign + consists of two crossed sticks: one vertical and one horizontal. Sign = consists of two horizontal sticks. The expression is arithmetically correct if *A*<=+<=*B*<==<=*C*.\n\nWe've got an expression that looks like *A*<=+<=*B*<==<=*C* given by counting sticks. Our task is to shift at most one stick (or we can shift nothing) so that the expression became arithmetically correct. Note that we cannot remove the sticks from the expression, also we cannot shift the sticks from the signs + and =.\n\nWe really aren't fabulous at arithmetics. Can you help us?",
"input": "",
"output": "```python\ns=input()\r\na,b=s.split('+')\r\nb,c=b.split('=')\r\na=list(a)\r\nb=list(b)\r\nc=list(c)\r\nif len(a)+len(b)==len(c):\r\n stp=''\r\n for i in a:\r\n stp=stp+i\r\n stp=stp+'+'\r\n for i in b:\r\n stp=stp+i\r\n stp=stp+'='\r\n for i in c:\r\n stp=stp+i\r\nelif len(a)+len(b)x):\n x,y=y,x\n\n while(y>0):\n ans+=x//y\n x=x%y\n x,y=y,x\n print(ans)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Where do odds begin, and where do they end? Where does hope emerge, and will they ever break?\n\nGiven an integer sequence *a*1,<=*a*2,<=...,<=*a**n* of length *n*. Decide whether it is possible to divide it into an odd number of non-empty subsegments, the each of which has an odd length and begins and ends with odd numbers.\n\nA subsegment is a contiguous slice of the whole sequence. For example, {3,<=4,<=5} and {1} are subsegments of sequence {1,<=2,<=3,<=4,<=5,<=6}, while {1,<=2,<=4} and {7} are not.",
"input": "",
"output": "```python\nn = int(input())\r\ndata = list(map(int, input().split()))\r\nif n % 2 == 1 and data[0] % 2 == 1 and data[-1] % 2 == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vladik often travels by trains. He remembered some of his trips especially well and I would like to tell you about one of these trips:\n\nVladik is at initial train station, and now *n* people (including Vladik) want to get on the train. They are already lined up in some order, and for each of them the city code *a**i* is known (the code of the city in which they are going to).\n\nTrain chief selects some number of disjoint segments of the original sequence of people (covering entire sequence by segments is not necessary). People who are in the same segment will be in the same train carriage. The segments are selected in such way that if at least one person travels to the city *x*, then all people who are going to city *x* should be in the same railway carriage. This means that they can’t belong to different segments. Note, that all people who travel to the city *x*, either go to it and in the same railway carriage, or do not go anywhere at all.\n\nComfort of a train trip with people on segment from position *l* to position *r* is equal to XOR of all distinct codes of cities for people on the segment from position *l* to position *r*. XOR operation also known as exclusive OR.\n\nTotal comfort of a train trip is equal to sum of comfort for each segment.\n\nHelp Vladik to know maximal possible total comfort.",
"input": "",
"output": "```python\ndef dp(curi):\n\tglobal cache\n\ttry:\n\t\treturn cache[curi]\n\texcept KeyError:\n\t\tif curi >= len(sections):\n\t\t\tcache[curi] = 0\n\t\telse:\n\t\t\t_, curend, curcomfort = sections[curi]\n\t\t\tnextsection = curi + 1\n\t\t\ttry:\n\t\t\t\twhile sections[nextsection][0] <= curend:\n\t\t\t\t\tnextsection += 1\n\t\t\texcept IndexError:\n\t\t\t\t# Loop til end\n\t\t\t\tinc = curcomfort\n\t\t\telse:\n\t\t\t\tinc = curcomfort + dp(nextsection)\n\t\t\texc = dp(curi + 1)\n\t\t\tcache[curi] = max(inc, exc)\n\treturn cache[curi]\n\n\nn = int(input())\nzs = list(map(int, input().split()))\nsections = []\nseenstartz = set()\nfirst = {z: i for i, z in reversed(list(enumerate(zs)))}\nlast = {z: i for i, z in enumerate(zs)}\nfor start, z in enumerate(zs):\n\tif z in seenstartz:\n\t\tcontinue\n\tend = last[z]\n\tcomfort = z\n\tseen = set([z])\n\ti = start + 1\n\twhile i <= end:\n\t\tif zs[i] not in seen:\n\t\t\tseen.add(zs[i])\n\t\t\tcomfort ^= zs[i]\n\t\tend = max(end, last[zs[i]])\n\t\ti += 1\n\tsections.append((start, end, comfort))\n\tseenstartz.add(z)\n\ncache = {}\nans = dp(0)\nprint(ans)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In a small but very proud high school it was decided to win ACM ICPC. This goal requires to compose as many teams of three as possible, but since there were only 6 students who wished to participate, the decision was to build exactly two teams.\n\nAfter practice competition, participant number *i* got a score of *a**i*. Team score is defined as sum of scores of its participants. High school management is interested if it's possible to build two teams with equal scores. Your task is to answer that question.",
"input": "",
"output": "```python\nimport math\r\nA = list(map(int,input().split()))\r\nfor i in range(len(A)):\r\n A[i]=math.fabs(A[i])\r\nA.sort()\r\ncmnd1=A[0]+A[3]\r\ncmnd2=A[1]+A[2]\r\nif(cmnd1>cmnd2):\r\n cmnd1+=A[4]\r\n cmnd2+=A[5]\r\nelse:\r\n cmnd1+=A[5]\r\n cmnd2+=A[4]\r\nif(cmnd1==cmnd2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After finishing eating her bun, Alyona came up with two integers *n* and *m*. She decided to write down two columns of integers — the first column containing integers from 1 to *n* and the second containing integers from 1 to *m*. Now the girl wants to count how many pairs of integers she can choose, one from the first column and the other from the second column, such that their sum is divisible by 5.\n\nFormally, Alyona wants to count the number of pairs of integers (*x*,<=*y*) such that 1<=≤<=*x*<=≤<=*n*, 1<=≤<=*y*<=≤<=*m* and equals 0.\n\nAs usual, Alyona has some troubles and asks you to help.",
"input": "",
"output": "```python\nif __name__ == '__main__':\r\n A = list(map(int, input().split()))\r\n n = A[0]\r\n m = A[1]\r\n\r\n first = max(n, m)\r\n second = min(n, m)\r\n\r\n totaldevisors = 0\r\n for i in range(5):\r\n if i != 0:\r\n totaldevisors += ((second + 5 - i) // 5) * ((first + i) // 5)\r\n else:\r\n totaldevisors += (((second + 5 - i) // 5) - 1) * ((first + i) // 5)\r\n print(totaldevisors)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word *s*. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word *s*.",
"input": "",
"output": "```python\nword = input().lower()\r\nword = word[word.find('h'):]\r\n#print(word)\r\n\r\nif len(word[1:word.find('e')]) == 1 and word[1:word.find('e')] == 'h':\r\n word = word[0]+word[2:]\r\nelse:\r\n word = word.replace(word[1:word.find('e')],'')\r\n#print(word)\r\n\r\n\r\nif len(word[2:word.find('l')]) ==1 and word[2:word.find('l')] == 'e':\r\n word = word[0:2] + word[3:]\r\nelse:\r\n word = word.replace(word[2:word.find('l')],'')\r\n#print(word)\r\n\r\n\r\nwordd = word[:2]+word[3:]\r\nif len(wordd)<4:\r\n print('NO')\r\nelse:\r\n if wordd[2] == 'l':\r\n if len(word[4:word.find('o')]) == 1 and word[4:word.find('o')] == 'l':\r\n word = word[:4]+word[5]\r\n else:\r\n word = word[:4]+word[word.find('o')]\r\n# print(word)\r\n else:\r\n word = word.replace(word[3:wordd.find('l')+1],'')\r\n if len(word[4:word.find('o')]) == 1 and word[4:word.find('o')] == 'l':\r\n word = word[:4]+word[word.find('o')]\r\n else:\r\n word = word.replace(word[4:word.find('o')],'')\r\n word = word[:5]\r\n# print(word)\r\n \r\n if word == 'hello':\r\n print('YES')\r\n else:\r\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A long time ago in some far country lived king Copa. After the recent king's reform, he got so large powers that started to keep the books by himself.\n\nThe total income *A* of his kingdom during 0-th year is known, as well as the total income *B* during *n*-th year (these numbers can be negative — it means that there was a loss in the correspondent year). \n\nKing wants to show financial stability. To do this, he needs to find common coefficient *X* — the coefficient of income growth during one year. This coefficient should satisfy the equation:\n\nSurely, the king is not going to do this job by himself, and demands you to find such number *X*.\n\nIt is necessary to point out that the fractional numbers are not used in kingdom's economy. That's why all input numbers as well as coefficient *X* must be integers. The number *X* may be zero or negative.",
"input": "",
"output": "```python\nimport math\r\n# import sys\r\ndef cal(q,a,b,n):\r\n if q*a==b:\r\n h=math.pow(q,1/n)\r\n h=int(h)\r\n print(q,h**n)\r\n if q==h**n:\r\n # print('helkjl')\r\n return h,True\r\n return 0,False\r\n\r\n\r\n\r\n\r\na=0\r\nb=0\r\nn=10\r\nab=False\r\n\r\nif a==0:\r\n # print('no solution')\r\n ab=False\r\n # sys.exit(0)\r\nif (a==0 and b==0 or b==0 and a>0):\r\n ab=True\r\n x=0\r\n # print(0)\r\n # sys.exit(0)\r\nif a!=0:\r\n q=int(math.fabs(b//a))\r\nif a>0 and b>0:\r\n f=cal(q,a,b,n)\r\n x=f[0]\r\nelif a<0:\r\n # print('kldk')\r\n if b<0:\r\n f= cal(q,a,b,n)\r\n else:\r\n if n&1==1:\r\n # print('kdk')\r\n f=cal(q,-a,b,n)\r\n x=-f[0]\r\n # print(q,a,b,n)\r\nelif b>0:\r\n if a<0:\r\n f= cal(q,a,b,n)\r\n else:\r\n if n&1==1:\r\n f=cal(q,a,-b,n)\r\n x=-f[0]\r\n \r\nif ab or f[1] :\r\n print(x)\r\nelse:\r\n print(f[1])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Given a positive integer *n*, find *k* integers (not necessary distinct) such that all these integers are strictly greater than 1, and their product is equal to *n*.",
"input": "",
"output": "```python\nn,k=map(int,input().split())\r\nl=[]\r\nfor i in range(2,n+1):\r\n\tif n%i==0:\r\n\t\twhile n%i==0 and len(l)<(k-1):\r\n\t\t\tn//=i\r\n\t\t\tl.append(i)\r\nif n>1:\r\n\tl.append(n)\r\nif len(l)==k:\r\n\tprint(*l)\r\nelse:\r\n\tprint(-1)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya's bicycle chain drive consists of two parts: *n* stars are attached to the pedal axle, *m* stars are attached to the rear wheel axle. The chain helps to rotate the rear wheel by transmitting the pedal rotation.\n\nWe know that the *i*-th star on the pedal axle has *a**i* (0<=<<=*a*1<=<<=*a*2<=<<=...<=<<=*a**n*) teeth, and the *j*-th star on the rear wheel axle has *b**j* (0<=<<=*b*1<=<<=*b*2<=<<=...<=<<=*b**m*) teeth. Any pair (*i*,<=*j*) (1<=≤<=*i*<=≤<=*n*; 1<=≤<=*j*<=≤<=*m*) is called a gear and sets the indexes of stars to which the chain is currently attached. Gear (*i*,<=*j*) has a gear ratio, equal to the value .\n\nSince Vasya likes integers, he wants to find such gears (*i*,<=*j*), that their ratios are integers. On the other hand, Vasya likes fast driving, so among all \"integer\" gears (*i*,<=*j*) he wants to choose a gear with the maximum ratio. Help him to find the number of such gears.\n\nIn the problem, fraction denotes division in real numbers, that is, no rounding is performed.",
"input": "",
"output": "```python\nn = int(input())\r\nstarsPedal = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nstarsRear = list(map(int, input().split()))\r\n\r\nmaxVal = -1\r\ntotalGears = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if starsRear[j] % starsPedal[i] == 0:\r\n if starsRear[j]//starsPedal[i] == maxVal:\r\n totalGears += 1\r\n elif starsRear[j]//starsPedal[i] > maxVal:\r\n maxVal = starsRear[j]//starsPedal[i]\r\n totalGears = 1\r\nprint(totalGears)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Rock... Paper!\n\nAfter Karen have found the deterministic winning (losing?) strategy for rock-paper-scissors, her brother, Koyomi, comes up with a new game as a substitute. The game works as follows.\n\nA positive integer *n* is decided first. Both Koyomi and Karen independently choose *n* distinct positive integers, denoted by *x*1,<=*x*2,<=...,<=*x**n* and *y*1,<=*y*2,<=...,<=*y**n* respectively. They reveal their sequences, and repeat until all of 2*n* integers become distinct, which is the only final state to be kept and considered.\n\nThen they count the number of ordered pairs (*i*,<=*j*) (1<=≤<=*i*,<=*j*<=≤<=*n*) such that the value *x**i* xor *y**j* equals to one of the 2*n* integers. Here xor means the [bitwise exclusive or](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) operation on two integers, and is denoted by operators ^ and/or xor in most programming languages.\n\nKaren claims a win if the number of such pairs is even, and Koyomi does otherwise. And you're here to help determine the winner of their latest game.",
"input": "",
"output": "```python\nn = int(input())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\ni=0\r\ncount=0\r\nwhile icost:\r\n r=r-cost\r\n count+=nb//B\r\n ns=0\r\n nc=0\r\n nb-=B*(nb//B)\r\n else:\r\n cost=ps*(S-ns)+pc*(C-nc)\r\n if r>cost:\r\n count+=1\r\n r=r-cost\r\n count+=r//(ps*S+pc*C)\r\n print(count)\r\n exit()\r\n else:\r\n print(count)\r\n exit()\r\nif ns//S:\r\n #B and C not there\r\n cost=pb*(B*(ns//S)-nb)+pc*(C*(ns//S)-nc)\r\n if r>cost:\r\n r=r-cost\r\n count+=ns//S\r\n nb=0\r\n nc=0\r\n ns-=S*(ns//S)\r\n else:\r\n cost=pb*(S-nb)+pc*(C-nc)\r\n if r>cost:\r\n count+=1\r\n r=r-cost\r\n count+=r//(pb*B+pc*C)\r\n print(count)\r\n else:\r\n print(count)\r\n exit() \r\nif nc//C:\r\n #B and S not there\r\n cost=pb*(B*(nc//C)-nb)+ps*(S*(nc//C)-ns)\r\n if r>cost:\r\n r=r-cost\r\n count+=nc//C\r\n nb=0\r\n nc-=nc//C\r\n ns=0\r\n else:\r\n cost=pb*(S-nb)+ps*(S-ns)\r\n if r>cost:\r\n count+=1\r\n r=r-cost\r\n count+=r//(pb*B+ps*S)\r\n print(count)\r\n else:\r\n print(count)\r\n exit() \r\ncost=(B-nb)*pb+(C-nc)*pc+(S-ns)*ps\r\nif cost>r:\r\n print(count)\r\nelse:\r\n r=r-cost\r\n count+=1\r\n count+=r//(pb*B+ps*S+pc*C)\r\n print(count)\r\n\r\n \r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are *n* planes on Earth, numbered from 1 to *n*, and the plane with number *i* likes the plane with number *f**i*, where 1<=≤<=*f**i*<=≤<=*n* and *f**i*<=≠<=*i*.\n\nWe call a love triangle a situation in which plane *A* likes plane *B*, plane *B* likes plane *C* and plane *C* likes plane *A*. Find out if there is any love triangle on Earth.",
"input": "",
"output": "```python\ndef soln(inp):\n lines = inp.strip('\\n').split('\\n')[:-1]\n # print(lines)\n output_string=\"\"\n for line in lines[1:]:\n # print(\"---\",line)\n line_split=line.split()\n elm = 1\n len_line = len(line_split)\n sign_flag=True\n one_flag=False\n # if line_split[0]==\"0\":\n # # one_flag=True\n # sign_flag=not sign_flag\n for i in range(len_line-2):\n elm=i+1\n el=elm\n for i in range(3):\n el=int(line_split[el-1])\n if el==elm:\n print(\"YES\")\n return None\n print(\"NO\")\n\t \t\t\t\t \t \t\t \t \t\t\t\t \t\t\t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Given an array *a*1,<=*a*2,<=...,<=*a**n* of *n* integers, find the largest number in the array that is not a perfect square.\n\nA number *x* is said to be a perfect square if there exists an integer *y* such that *x*<==<=*y*2.",
"input": "",
"output": "```python\nimport math\r\ndef solve():\r\n garbo = input()\r\n numbers = input().split()\r\n new = []\r\n for number in numbers:\r\n new.append(int(number))\r\n new = sorted(new)\r\n largest = 0\r\n for number in new:\r\n if math.sqrt(number) % 1 == 0:\r\n pass\r\n else:\r\n largest = number\r\n print(largest)\r\n # print(new)\r\n\r\n\r\n# for _ in range(int(input())):\r\nsolve()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.\n\nUnfortunately, not all numbers are lucky. Petya calls a number nearly lucky if the number of lucky digits in it is a lucky number. He wonders whether number *n* is a nearly lucky number.",
"input": "",
"output": "```python\nnumber = 0\r\nn = input()\r\nfor i in range(len(n)):\r\n if str(n)[i] == '7' or str(n)[i] == '4':\r\n number += 1\r\nif str(len(str(number))) in '47 74 444 447 474 477 744 747 774 777 4444 4447 \\\r\n4474 4477 4744 4747 4774 4777 7444':\r\n print('YES')\r\nelse:\r\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little penguin Polo adores integer segments, that is, pairs of integers [*l*; *r*] (*l*<=≤<=*r*). \n\nHe has a set that consists of *n* integer segments: [*l*1; *r*1],<=[*l*2; *r*2],<=...,<=[*l**n*; *r**n*]. We know that no two segments of this set intersect. In one move Polo can either widen any segment of the set 1 unit to the left or 1 unit to the right, that is transform [*l*; *r*] to either segment [*l*<=-<=1; *r*], or to segment [*l*; *r*<=+<=1].\n\nThe value of a set of segments that consists of *n* segments [*l*1; *r*1],<=[*l*2; *r*2],<=...,<=[*l**n*; *r**n*] is the number of integers *x*, such that there is integer *j*, for which the following inequality holds, *l**j*<=≤<=*x*<=≤<=*r**j*.\n\nFind the minimum number of moves needed to make the value of the set of Polo's segments divisible by *k*.",
"input": "",
"output": "```python\nn,k=map(int,input().split())\nx=0\nfor i in range(0,n):\n a,b=map(int,input().split())\n if a=k:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\n\r\n\r\n\r\nsolve()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Jon fought bravely to rescue the wildlings who were attacked by the white-walkers at Hardhome. On his arrival, Sam tells him that he wants to go to Oldtown to train at the Citadel to become a maester, so he can return and take the deceased Aemon's place as maester of Castle Black. Jon agrees to Sam's proposal and Sam sets off his journey to the Citadel. However becoming a trainee at the Citadel is not a cakewalk and hence the maesters at the Citadel gave Sam a problem to test his eligibility. \n\nInitially Sam has a list with a single element *n*. Then he has to perform certain operations on this list. In each operation Sam must remove any element *x*, such that *x*<=><=1, from the list and insert at the same position , , sequentially. He must continue with these operations until all the elements in the list are either 0 or 1.\n\nNow the masters want the total number of 1s in the range *l* to *r* (1-indexed). Sam wants to become a maester but unfortunately he cannot solve this problem. Can you help Sam to pass the eligibility test?",
"input": "",
"output": "```python\ndef countOnes(n):\r\n count = [0] * (n + 1)\r\n count[1] = 1\r\n for i in range(2, n + 1):\r\n if i % 2 == 0:\r\n count[i] = count[i // 2]\r\n else:\r\n count[i] = count[i // 2] + 1\r\n return count\r\n\r\ndef solve(n, l, r):\r\n count = countOnes(n)\r\n return sum(count[l:r + 1])\r\n\r\nn, l, r = map(int, input().split())\r\nprint(solve(n, l, r))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have probably registered on Internet sites many times. And each time you should enter your invented password. Usually the registration form automatically checks the password's crypt resistance. If the user's password isn't complex enough, a message is displayed. Today your task is to implement such an automatic check.\n\nWeb-developers of the company Q assume that a password is complex enough, if it meets all of the following conditions:\n - the password length is at least 5 characters; - the password contains at least one large English letter; - the password contains at least one small English letter; - the password contains at least one digit. \nYou are given a password. Please implement the automatic check of its complexity for company Q.",
"input": "",
"output": "```python\ninp=input()\r\nsmall=0\r\nuper=0\r\ninnt=0\r\nfor i in inp:\r\n if i.islower():\r\n small+=1\r\n elif i.isupper():\r\n uper+=1\r\n elif i.isdigit():\r\n innt+=1\r\nprint(small,uper,innt)\r\nif small>=1 and uper>=1 and innt>=1 and len(inp)>=5:\r\n print('Correct')\r\nelse:\r\n print('Too weak')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) reversely. For example, a Berlandish word code corresponds to a Birlandish word edoc. However, it's easy to make a mistake during the «translation». Vasya translated word *s* from Berlandish into Birlandish as *t*. Help him: find out if he translated the word correctly.",
"input": "",
"output": "```python\ns= input()\r\nt= input()\r\ndef rev(s):\r\n return s[::-1]\r\nre=rev(s)\r\n\r\nif(s !=' ' and t !=' '):\r\n if re== t:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Year 2118. Androids are in mass production for decades now, and they do all the work for humans. But androids have to go to school to be able to solve creative tasks. Just like humans before.\n\nIt turns out that high school struggles are not gone. If someone is not like others, he is bullied. Vasya-8800 is an economy-class android which is produced by a little-known company. His design is not perfect, his characteristics also could be better. So he is bullied by other androids.\n\nOne of the popular pranks on Vasya is to force him to compare $x^y$ with $y^x$. Other androids can do it in milliseconds while Vasya's memory is too small to store such big numbers.\n\nPlease help Vasya! Write a fast program to compare $x^y$ with $y^x$ for Vasya, maybe then other androids will respect him.",
"input": "",
"output": "```python\nimport math\na,b = map(int, input().split())\nx = a * (math.log(b)); \ny = b * (math.log(a));\nif y > x:\n print(\">\")\nelif x > y:\n print(\"<\")\nelif x == y:\n print(\"=\")\n\t \t\t \t \t \t \t\t\t \t \t\t \t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In this problem we consider a special type of an auction, which is called the second-price auction. As in regular auction *n* bidders place a bid which is price a bidder ready to pay. The auction is closed, that is, each bidder secretly informs the organizer of the auction price he is willing to pay. After that, the auction winner is the participant who offered the highest price. However, he pay not the price he offers, but the highest price among the offers of other participants (hence the name: the second-price auction).\n\nWrite a program that reads prices offered by bidders and finds the winner and the price he will pay. Consider that all of the offered prices are different.",
"input": "",
"output": "```python\nn=int(input())\r\nl=list(map(int,input().split())) \r\ndic={}\r\nfor i in range(n):\r\n a=l[:]\r\n a.pop(i)\r\n dic[i+1]=max(a) \r\nc=list(dic.values())\r\nc=list(set(c))\r\nc.remove(max(c))\r\nm=max(c)\r\nfor i in dic:\r\n if dic[i]==m:\r\n k=i \r\nprint(k,m)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya's bicycle chain drive consists of two parts: *n* stars are attached to the pedal axle, *m* stars are attached to the rear wheel axle. The chain helps to rotate the rear wheel by transmitting the pedal rotation.\n\nWe know that the *i*-th star on the pedal axle has *a**i* (0<=<<=*a*1<=<<=*a*2<=<<=...<=<<=*a**n*) teeth, and the *j*-th star on the rear wheel axle has *b**j* (0<=<<=*b*1<=<<=*b*2<=<<=...<=<<=*b**m*) teeth. Any pair (*i*,<=*j*) (1<=≤<=*i*<=≤<=*n*; 1<=≤<=*j*<=≤<=*m*) is called a gear and sets the indexes of stars to which the chain is currently attached. Gear (*i*,<=*j*) has a gear ratio, equal to the value .\n\nSince Vasya likes integers, he wants to find such gears (*i*,<=*j*), that their ratios are integers. On the other hand, Vasya likes fast driving, so among all \"integer\" gears (*i*,<=*j*) he wants to choose a gear with the maximum ratio. Help him to find the number of such gears.\n\nIn the problem, fraction denotes division in real numbers, that is, no rounding is performed.",
"input": "",
"output": "```python\nn=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nratio=[]\r\nfor i in a:\r\n for j in b:\r\n if(j%i==0):\r\n ratio.appennd(j//i)\r\nn=max(ratio)\r\nprint(ratio.count(n))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "They say \"years are like dominoes, tumbling one after the other\". But would a year fit into a grid? I don't think so.\n\nLimak is a little polar bear who loves to play. He has recently got a rectangular grid with *h* rows and *w* columns. Each cell is a square, either empty (denoted by '.') or forbidden (denoted by '#'). Rows are numbered 1 through *h* from top to bottom. Columns are numbered 1 through *w* from left to right.\n\nAlso, Limak has a single domino. He wants to put it somewhere in a grid. A domino will occupy exactly two adjacent cells, located either in one row or in one column. Both adjacent cells must be empty and must be inside a grid.\n\nLimak needs more fun and thus he is going to consider some queries. In each query he chooses some rectangle and wonders, how many way are there to put a single domino inside of the chosen rectangle?",
"input": "",
"output": "```python\nh, w = map(int, input().split())\r\ns = []\r\nfor i in range(h):\r\n s.append(list(input()))\r\n s[i].append('#')\r\ns.append(['#']*(w+1))\r\nv = [[0]*(w+2)]\r\ng = [[0]*(w+2)]\r\nfor i in range(h+1):\r\n v.append([0]*(w+2))\r\n g.append([0]*(w+2))\r\nfor i in range(len(s)):\r\n count = 0\r\n for j in range(1, len(s[0])):\r\n if s[i][j] == '.' and s[i][j-1] == '.':\r\n count += 1\r\n if i == 0:\r\n g[i][j] = count\r\n else:\r\n g[i][j] = count + g[i-1][j]\r\nfor j in range(len(s[0])):\r\n count = 0\r\n for i in range(1, len(s)):\r\n if s[i][j] == '.' and s[i-1][j] == '.':\r\n count += 1\r\n if j == 0:\r\n v[i][j] = count\r\n else:\r\n v[i][j] = count + v[i][j-1]\r\nq = int(input())\r\ng = g[:h]\r\ng.insert(0, [0]*(w+1))\r\nfor i in range(len(g)):\r\n g[i] = g[i][:w]\r\n g[i].insert(0, 0)\r\nv = v[:h]\r\nv.insert(0, [0]*(w+1))\r\nfor i in range(len(v)):\r\n v[i] = v[i][:w]\r\n v[i] .insert(0, 0)\r\nfor i in g:\r\n print(i)\r\nprint()\r\nfor i in v:\r\n print(i)\r\nfor i in range(q):\r\n count = 0\r\n u1, u2, d1, d2 = map(int, input().split())\r\n count += g[d1][d2]\r\n count -= g[d1][u2]\r\n count -= g[u1-1][d2]\r\n count += g[u1-1][u2]\r\n count += v[d1][d2]\r\n count -= v[u1][d2]\r\n count -= v[d1][u2-1]\r\n count += v[u1][u2]\r\n print(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A has a string consisting of some number of lowercase English letters 'a'. He gives it to his friend B who appends some number of letters 'b' to the end of this string. Since both A and B like the characters 'a' and 'b', they have made sure that at this point, at least one 'a' and one 'b' exist in the string.\n\nB now gives this string to C and he appends some number of letters 'c' to the end of the string. However, since C is a good friend of A and B, the number of letters 'c' he appends is equal to the number of 'a' or to the number of 'b' in the string. It is also possible that the number of letters 'c' equals both to the number of letters 'a' and to the number of letters 'b' at the same time.\n\nYou have a string in your hands, and you want to check if it is possible to obtain the string in this way or not. If it is possible to obtain the string, print \"YES\", otherwise print \"NO\" (without the quotes).",
"input": "",
"output": "```python\np=input()\r\nx=p.find(\"b\")\r\ny=p.find(\"c\")\r\n\r\na=p[:x]\r\nb=p[x:y]\r\nc=p[y:]\r\n\r\nif(a==\"\" or b==\"\" or c==\"\"): print(\"NO\")\r\nelse:\r\n if(len(c)==len(a) or len(c)==len(b)): print(\"YES\")\r\n else: print(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a multiset of *n* integers. You should select exactly *k* of them in a such way that the difference between any two of them is divisible by *m*, or tell that it is impossible.\n\nNumbers can be repeated in the original multiset and in the multiset of selected numbers, but number of occurrences of any number in multiset of selected numbers should not exceed the number of its occurrences in the original multiset.",
"input": "",
"output": "```python\nn,k,m=[int(i) for i in input().split()]\r\nl=[int(i) for i in input().split()]\r\nlmain=[]\r\nfor i in range(n):\r\n lmain.append(l[i])\r\n l[i] = l[i]%m\r\nl1=[]\r\nfor i in range(m):\r\n l1.append(0)\r\nfor i in range(n):\r\n l1[l[i]]+=1\r\nf=0\r\nsave=-1\r\nfor i in range(m):\r\n if (l1[i]>=k):\r\n f=1\r\n save=i\r\n break\r\nif (f==0):\r\n print ('No')\r\nelse:\r\n print ('Yes',end= \"\\n\")\r\n count=0\r\n l3=[]\r\n for i in range(n):\r\n if (count==k):\r\n break\r\n if (l[i]==save):\r\n l3.append(lmain[i])\r\n count+=1\r\n for i in l3:\r\n print (i, end=\" \")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little girl Susie went shopping with her mom and she wondered how to improve service quality. \n\nThere are *n* people in the queue. For each person we know time *t**i* needed to serve him. A person will be disappointed if the time he waits is more than the time needed to serve him. The time a person waits is the total time when all the people who stand in the queue in front of him are served. Susie thought that if we swap some people in the queue, then we can decrease the number of people who are disappointed. \n\nHelp Susie find out what is the maximum number of not disappointed people can be achieved by swapping people in the queue.",
"input": "",
"output": "```python\ndef max_happy_people(n, times):\r\n times.sort() # Сортировка времен обслуживания по возрастанию\r\n happy_count = 0 # Счетчик довольных людей\r\n total_waiting_time = 0 # Общее время ожидания\r\n\r\n for i in range(n):\r\n if times[i] >= total_waiting_time: # Проверка условия для довольного человека\r\n happy_count += 1\r\n total_waiting_time += times[i] # Обновление общего времени ожидания\r\n else:\r\n # Человек будет недоволен, переносим его в конец очереди без увеличения времени ожидания\r\n times.append(times[i])\r\n\r\n return happy_count\r\n\r\n\r\n# Чтение входных данных\r\nn = int(input())\r\ntimes = list(map(int, input().split()))\r\n\r\n# Вызов функции и вывод результата\r\nprint(max_happy_people(n, times))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Dwarfs have planted a very interesting plant, which is a triangle directed \"upwards\". This plant has an amusing feature. After one year a triangle plant directed \"upwards\" divides into four triangle plants: three of them will point \"upwards\" and one will point \"downwards\". After another year, each triangle plant divides into four triangle plants: three of them will be directed in the same direction as the parent plant, and one of them will be directed in the opposite direction. Then each year the process repeats. The figure below illustrates this process.\n\nHelp the dwarfs find out how many triangle plants that point \"upwards\" will be in *n* years.",
"input": "",
"output": "```python\nn=int(input())\nm=pow(10,9)+7\nif n==0:\n print(1)\nelse:\n print((pow(2,2*n-1,m)+pow(2,n-1,m))%m)\n\t \t \t\t\t\t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Eleven wants to choose a new name for herself. As a bunch of geeks, her friends suggested an algorithm to choose a name for her. Eleven wants her name to have exactly *n* characters. \n\nHer friend suggested that her name should only consist of uppercase and lowercase letters 'O'. More precisely, they suggested that the *i*-th letter of her name should be 'O' (uppercase) if *i* is a member of Fibonacci sequence, and 'o' (lowercase) otherwise. The letters in the name are numbered from 1 to *n*. Fibonacci sequence is the sequence *f* where\n - *f*1<==<=1, - *f*2<==<=1, - *f**n*<==<=*f**n*<=-<=2<=+<=*f**n*<=-<=1 (*n*<=><=2). \nAs her friends are too young to know what Fibonacci sequence is, they asked you to help Eleven determine her new name.",
"input": "",
"output": "```python\na=int(input())\r\nf=[1,1]\r\nif a>2:\r\n for i in range(3,a+1):\r\n p=f[i-3]+f[i-2]\r\n f.append(p)\r\nfor x in range(1,a+1):\r\n if x in f:\r\n print(\"O\",end=\"\")\r\n else:\r\n print(\"o\",end=\"\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.\n\nOne day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.\n\nIn his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The *i*-th digit of the answer is 1 if and only if the *i*-th digit of the two given numbers differ. In the other case the *i*-th digit of the answer is 0.\n\nShapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.\n\nNow you are going to take part in Shapur's contest. See if you are faster and more accurate.",
"input": "",
"output": "```python\na = input()\r\nb = input()\r\nc = (bin(int(a,2)+int(b,2)))\r\nc = c.replace(\"0b\",\"\")\r\nprint(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There always is something to choose from! And now, instead of \"Noughts and Crosses\", Inna choose a very unusual upgrade of this game. The rules of the game are given below:\n\nThere is one person playing the game. Before the beginning of the game he puts 12 cards in a row on the table. Each card contains a character: \"X\" or \"O\". Then the player chooses two positive integers *a* and *b* (*a*·*b*<==<=12), after that he makes a table of size *a*<=×<=*b* from the cards he put on the table as follows: the first *b* cards form the first row of the table, the second *b* cards form the second row of the table and so on, the last *b* cards form the last (number *a*) row of the table. The player wins if some column of the table contain characters \"X\" on all cards. Otherwise, the player loses.\n\nInna has already put 12 cards on the table in a row. But unfortunately, she doesn't know what numbers *a* and *b* to choose. Help her win the game: print to her all the possible ways of numbers *a*,<=*b* that she can choose and win.",
"input": "",
"output": "```python\nn = int(input())\r\notv = []\r\nresult = \"\"\r\ncounter = 0\r\nflag = True\r\nfor _ in range(n):\r\n temp = input()\r\n for i in range(12):\r\n if 12 % (i+1) == 0 and temp[i] == \"X\":\r\n for j in range((i*2)+1, 12, i+1):\r\n if temp[j] != temp[i]:\r\n flag = False\r\n break\r\n if flag:\r\n counter += 1\r\n otv.append(f\"{round(12/(i+1))} x {i+1} \")\r\n flag = True\r\n otv = sorted(otv, key=lambda x: int(x.split()[0].strip('x')))\r\n result += str(counter) + \" \" + \"\".join(otv) + \"\\n\"\r\n result = result.replace(\" x \", \"x\")\r\n counter = 0\r\n otv = []\r\nelse:\r\n print(result)# 1689471988.4487488\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A triangular number is the number of dots in an equilateral triangle uniformly filled with dots. For example, three dots can be arranged in a triangle; thus three is a triangular number. The *n*-th triangular number is the number of dots in a triangle with *n* dots on a side. . You can learn more about these numbers from Wikipedia (http://en.wikipedia.org/wiki/Triangular_number).\n\nYour task is to find out if a given integer is a triangular number.",
"input": "",
"output": "```python\nn=int(input())\r\nif n<0:\r\n print('NO')\r\nelse:\r\n sum,a=0,1\r\n while(sum<=n):\r\n sum=sum+a\r\n if sum==n:\r\n print('YES')\r\n break\r\n a=a+1\r\n print('NO') \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are *n* planes on Earth, numbered from 1 to *n*, and the plane with number *i* likes the plane with number *f**i*, where 1<=≤<=*f**i*<=≤<=*n* and *f**i*<=≠<=*i*.\n\nWe call a love triangle a situation in which plane *A* likes plane *B*, plane *B* likes plane *C* and plane *C* likes plane *A*. Find out if there is any love triangle on Earth.",
"input": "",
"output": "```python\nt= int(input()) \r\nl=list(map(int,(input().split())))\r\n\r\nfound=False\r\nfor i in range(len(l)):\r\n \r\n start=l[i]-1\r\n count=0\r\n \r\n while count<2:\r\n \r\n start=l[start]-1\r\n count+=1\r\n if start==i:\r\n found=True\r\n print(\"YES\")\r\n break\r\n \r\nif not found:\r\n print(\"NO\")\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently Adaltik discovered japanese crosswords. Japanese crossword is a picture, represented as a table sized *a*<=×<=*b* squares, and each square is colored white or black. There are integers to the left of the rows and to the top of the columns, encrypting the corresponding row or column. The number of integers represents how many groups of black squares there are in corresponding row or column, and the integers themselves represents the number of consecutive black squares in corresponding group (you can find more detailed explanation in Wikipedia [https://en.wikipedia.org/wiki/Japanese_crossword](https://en.wikipedia.org/wiki/Japanese_crossword)).\n\nAdaltik decided that the general case of japanese crossword is too complicated and drew a row consisting of *n* squares (e.g. japanese crossword sized 1<=×<=*n*), which he wants to encrypt in the same way as in japanese crossword.\n\nHelp Adaltik find the numbers encrypting the row he drew.",
"input": "",
"output": "```python\nn = int(input())\ns = tuple(input())\nbCount = 0\ntemp = []\nans = []\nfor b in s:\n n -= 1\n if b == \"B\":\n bCount += 1\n elif b == \"W\":\n ans.append(bCount)\n \n bCount -= bCount\n if n == 0:\n ans.append(bCount)\n print(ans)\n\t\t \t \t \t \t\t\t \t \t\t\t \t\t\t\t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In Berland it is the holiday of equality. In honor of the holiday the king decided to equalize the welfare of all citizens in Berland by the expense of the state treasury. \n\nTotally in Berland there are *n* citizens, the welfare of each of them is estimated as the integer in *a**i* burles (burle is the currency in Berland).\n\nYou are the royal treasurer, which needs to count the minimum charges of the kingdom on the king's present. The king can only give money, he hasn't a power to take away them.",
"input": "",
"output": "```python\nn = int(input())\r\na = [int(a) for a in input().split()]\r\nm = max(a)\r\nadd = 0\r\nfor i in a:\r\n add += (m-i)\r\nprint(add)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given array *a* with *n* elements and the number *m*. Consider some subsequence of *a* and the value of least common multiple (LCM) of its elements. Denote LCM as *l*. Find any longest subsequence of *a* with the value *l*<=≤<=*m*.\n\nA subsequence of *a* is an array we can get by erasing some elements of *a*. It is allowed to erase zero or all elements.\n\nThe LCM of an empty array equals 1.",
"input": "",
"output": "```python\nimport sys\r\n\r\n\r\nn, m = map(int, sys.stdin.buffer.readline().decode('utf-8').split())\r\na = list(map(int, sys.stdin.buffer.readline().decode('utf-8').split()))\r\ndp = [0]*(m+1)\r\n\r\nfor x in a:\r\n if x <= m:\r\n dp[x] += 1\r\n\r\nfor i in range(m, 0, -1):\r\n for j in range(2, m+1):\r\n if i*j > m:\r\n break\r\n dp[i*j] += dp[i]\r\n\r\nlcm = dp.index(max(dp))\r\nans = [i for i, x in enumerate(a, start=1) if lcm % x == 0]\r\n\r\nsys.stdout.buffer.write(\r\n (str(lcm) + ' ' + str(len(ans)) + '\\n' +\r\n ' '.join(map(str, ans))).encode('utf-8')\r\n)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Luke Skywalker gave Chewbacca an integer number *x*. Chewbacca isn't good at numbers but he loves inverting digits in them. Inverting digit *t* means replacing it with digit 9<=-<=*t*. \n\nHelp Chewbacca to transform the initial number *x* to the minimum possible positive number by inverting some (possibly, zero) digits. The decimal representation of the final number shouldn't start with a zero.",
"input": "",
"output": "```python\nx = int(input())\n\nx_str = str(x)\nresult = ''\n\nif x_str[0] > '4':\n result += str(9 - int(x_str[0]))\nelse:\n result += x_str[0]\n\nfor digit in x_str[1:]:\n result += min(digit, str(9 - int(digit)))\n\nresult_int = int(result)\n\nprint(result_int)\n\n \t\t\t \t\t \t \t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "According to Berland laws it is only allowed to sell alcohol to people not younger than 18 years. Vasya's job is to monitor the law's enforcement. Tonight he entered a bar and saw *n* people sitting there. For every one of them Vasya happened to determine either the age or the drink the person is having. Vasya can check any person, i.e. learn his age and the drink he is having at the same time. What minimal number of people should Vasya check additionally to make sure that there are no clients under 18 having alcohol drinks?\n\nThe list of all alcohol drinks in Berland is: ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE",
"input": "",
"output": "```python\nn = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n s = input()\r\n a.append(s)\r\nfor j in a:\r\n if(j==\"ABSINTH\" or j==\"BEER\" or j==\"BRANDY\" or j==\"CHAMPAGNE\" or j==\"GIN\" or j==\"RUM\" or j==\"SAKE\" or j==\"TEQUILA\" or j==\"VODKA\" or j==\"WHISKEY\" or j==\"WINE\"):\r\n b.append(j)\r\n if(j==\"0\" or j==\"1\" or j==\"2\" or j==\"3\" or j==\"4\" or j==\"5\" or j==\"6\" or j==\"7\" or j==\"8\" or j==\"9\" or j==\"10\" or j==\"11\" or j==\"12\" or j==\"13\" or j==\"14\" or j==\"15\" or j==\"16\" or j==\"17\"):\r\n b.append(j)\r\nprint(len(b))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Limak and Radewoosh are going to compete against each other in the upcoming algorithmic contest. They are equally skilled but they won't solve problems in the same order.\n\nThere will be *n* problems. The *i*-th problem has initial score *p**i* and it takes exactly *t**i* minutes to solve it. Problems are sorted by difficulty — it's guaranteed that *p**i*<=<<=*p**i*<=+<=1 and *t**i*<=<<=*t**i*<=+<=1.\n\nA constant *c* is given too, representing the speed of loosing points. Then, submitting the *i*-th problem at time *x* (*x* minutes after the start of the contest) gives *max*(0,<= *p**i*<=-<=*c*·*x*) points.\n\nLimak is going to solve problems in order 1,<=2,<=...,<=*n* (sorted increasingly by *p**i*). Radewoosh is going to solve them in order *n*,<=*n*<=-<=1,<=...,<=1 (sorted decreasingly by *p**i*). Your task is to predict the outcome — print the name of the winner (person who gets more points at the end) or a word \"Tie\" in case of a tie.\n\nYou may assume that the duration of the competition is greater or equal than the sum of all *t**i*. That means both Limak and Radewoosh will accept all *n* problems.",
"input": "",
"output": "```python\ndef score(p, t, c):\r\n x, s = 0, 0\r\n for pi, ti in zip(p, t):\r\n x += ti\r\n s += max(0, pi - c * x)\r\n return s\r\n\r\nn, c = map(int, input().split())\r\np = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\n\r\ns1 = score(p, t, c)\r\n\r\np.reverse()\r\nt.reverse()\r\ns2 = score(p, t, c)\r\n\r\nprint(\"Tie\" if s1 == s2 else [\"Radewoosh\",\"Limak\"][s1 > s2])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.\n\nHe bought *n* pieces of jewelry. The *i*-th piece has price equal to *i*<=+<=1, that is, the prices of the jewelry are 2,<=3,<=4,<=... *n*<=+<=1.\n\nWatson gave Sherlock a challenge to color these jewelry pieces such that two pieces don't have the same color if the price of one piece is a prime divisor of the price of the other piece. Also, Watson asked him to minimize the number of different colors used.\n\nHelp Sherlock complete this trivial task.",
"input": "",
"output": "```python\n# https://codeforces.com/problemset/problem/776/B\n\nfrom math import sqrt\n\ndef is_prime(x):\n if x == 2 or x == 3:\n return True\n if x%2 == 0 or x%3 == 0:\n return False\n \n tmp = 5\n\n while tmp < sqrt(x) + 1:\n if x % tmp == 0:\n return False\n tmp += 2\n\n if x % tmp == 0:\n return False\n tmp += 4\n \n return True\n\nif __name__ == '__main__':\n n = int(input())\n\n A = [2]*n\n\n for i in range(n):\n if is_prime(i+2):\n A[i] = 1\n \n print(2)\n for i in range(n):\n print(A[i], end=' ')\n print()\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A and B are preparing themselves for programming contests.\n\nB loves to debug his code. But before he runs the solution and starts debugging, he has to first compile the code.\n\nInitially, the compiler displayed *n* compilation errors, each of them is represented as a positive integer. After some effort, B managed to fix some mistake and then another one mistake.\n\nHowever, despite the fact that B is sure that he corrected the two errors, he can not understand exactly what compilation errors disappeared — the compiler of the language which B uses shows errors in the new order every time! B is sure that unlike many other programming languages, compilation errors for his programming language do not depend on each other, that is, if you correct one error, the set of other error does not change.\n\nCan you help B find out exactly what two errors he corrected?",
"input": "",
"output": "```python\nn=int(input())\r\na=sum(list(map(int,input().split())))\r\nb=sum(list(map(int,input().split())))\r\nc=sum(list(map(int,input().split())))\r\nprint(a-b)\r\nprint(b-c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Xenia the beginner mathematician is a third year student at elementary school. She is now learning the addition operation.\n\nThe teacher has written down the sum of multiple numbers. Pupils should calculate the sum. To make the calculation easier, the sum only contains numbers 1, 2 and 3. Still, that isn't enough for Xenia. She is only beginning to count, so she can calculate a sum only if the summands follow in non-decreasing order. For example, she can't calculate sum 1+3+2+1 but she can calculate sums 1+1+2 and 3+3.\n\nYou've got the sum that was written on the board. Rearrange the summans and print the sum in such a way that Xenia can calculate the sum.",
"input": "",
"output": "```python\nword = input()\r\nznak = word[1]\r\nword = word.replace(znak,'')\r\ns=[]\r\nfor i in range(len(word)):\r\n s.append(word[i])\r\ns = sorted(s)\r\nprint(*s,sep=znak)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a string *A*. Find a string *B*, where *B* is a palindrome and *A* is a subsequence of *B*.\n\nA subsequence of a string is a string that can be derived from it by deleting some (not necessarily consecutive) characters without changing the order of the remaining characters. For example, \"cotst\" is a subsequence of \"contest\".\n\nA palindrome is a string that reads the same forward or backward.\n\nThe length of string *B* should be at most 104. It is guaranteed that there always exists such string.\n\nYou do not need to find the shortest answer, the only restriction is that the length of string *B* should not exceed 104.",
"input": "",
"output": "```python\na=input()\na1=[]\na2=[]\nfor i in a:\n\ta1.append(i)\n\ta2.append(i)\na2.reverse()\nif a1==a2:\n\tprint(a)\nelse:\n\ta3=a1+a2\n\tprint(*a3,sep='')\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "It seems that Borya is seriously sick. He is going visit *n* doctors to find out the exact diagnosis. Each of the doctors needs the information about all previous visits, so Borya has to visit them in the prescribed order (i.e. Borya should first visit doctor 1, then doctor 2, then doctor 3 and so on). Borya will get the information about his health from the last doctor.\n\nDoctors have a strange working schedule. The doctor *i* goes to work on the *s**i*-th day and works every *d**i* day. So, he works on days *s**i*,<=*s**i*<=+<=*d**i*,<=*s**i*<=+<=2*d**i*,<=....\n\nThe doctor's appointment takes quite a long time, so Borya can not see more than one doctor per day. What is the minimum time he needs to visit all doctors?",
"input": "",
"output": "```python\nn = int(input())\r\nfor i in range(n):\r\n si, di = list(map(int, input().split()))\r\n if i == 0:\r\n sum = si\r\n else:\r\n while si < sum:\r\n si += di\r\n sum = si\r\nprint(sum)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pasha has a wooden stick of some positive integer length *n*. He wants to perform exactly three cuts to get four parts of the stick. Each part must have some positive integer length and the sum of these lengths will obviously be *n*. \n\nPasha likes rectangles but hates squares, so he wonders, how many ways are there to split a stick into four parts so that it's possible to form a rectangle using these parts, but is impossible to form a square.\n\nYour task is to help Pasha and count the number of such ways. Two ways to cut the stick are considered distinct if there exists some integer *x*, such that the number of parts of length *x* in the first way differ from the number of parts of length *x* in the second way.",
"input": "",
"output": "```python\nn = int(input())\r\nif n%2==0:\r\n n=n//5\r\nprint(n) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little penguin Polo adores strings. But most of all he adores strings of length *n*.\n\nOne day he wanted to find a string that meets the following conditions:\n 1. The string consists of *n* lowercase English letters (that is, the string's length equals *n*), exactly *k* of these letters are distinct. 1. No two neighbouring letters of a string coincide; that is, if we represent a string as *s*<==<=*s*1*s*2... *s**n*, then the following inequality holds, *s**i*<=≠<=*s**i*<=+<=1(1<=≤<=*i*<=<<=*n*). 1. Among all strings that meet points 1 and 2, the required string is lexicographically smallest. \nHelp him find such string or state that such string doesn't exist.\n\nString *x*<==<=*x*1*x*2... *x**p* is lexicographically less than string *y*<==<=*y*1*y*2... *y**q*, if either *p*<=<<=*q* and *x*1<==<=*y*1,<=*x*2<==<=*y*2,<=... ,<=*x**p*<==<=*y**p*, or there is such number *r* (*r*<=<<=*p*,<=*r*<=<<=*q*), that *x*1<==<=*y*1,<=*x*2<==<=*y*2,<=... ,<=*x**r*<==<=*y**r* and *x**r*<=+<=1<=<<=*y**r*<=+<=1. The characters of the strings are compared by their ASCII codes.",
"input": "",
"output": "```python\nn,k=map(int,input().split())\r\nif k>n:\r\n\tprint(-1)\r\nelif k==1:\r\n\tif n==1:\r\n\t\tprint('a')\r\n\telse:\r\n\t\tprint(-1)\r\nelse:\r\n\talph=\"\"\r\n\tfor i in range(26):\r\n\t\talph+=(chr(i+97))\r\n\tans=alph[:k]\r\n\tn-=k\r\n\tif n%2:\r\n\t\tz=ans[0]+ans[1]+'ab'*(n//2)+'a'+ans[2:]\r\n\telse:\r\n\t\tz=ans[0]+ans[1]+'ab'*(n//2)+ans[2:]\r\n\tprint(z)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Phone number in Berland is a sequence of *n* digits. Often, to make it easier to memorize the number, it is divided into groups of two or three digits. For example, the phone number 1198733 is easier to remember as 11-987-33. Your task is to find for a given phone number any of its divisions into groups of two or three digits.",
"input": "",
"output": "```python\nn = int(input())\r\ns = input()\r\nif n <= 3: print(s); exit()\r\nelse:\r\n if n&1:\r\n print(s[:3] + \"-\", end = \"\")\r\n for i in range(3, n - 2, 2):\r\n print(s[i:i+2] + \"-\", end = \"\")\r\n print(s[n-2:])\r\n else:\r\n for i in range(0, n - 2, 2):\r\n print(s[i:i+2] + \"-\", end = \"\")\r\n print(s[n-2:])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have *n* devices that you want to use simultaneously.\n\nThe *i*-th device uses *a**i* units of power per second. This usage is continuous. That is, in λ seconds, the device will use λ·*a**i* units of power. The *i*-th device currently has *b**i* units of power stored. All devices can store an arbitrary amount of power.\n\nYou have a single charger that can plug to any single device. The charger will add *p* units of power per second to a device. This charging is continuous. That is, if you plug in a device for λ seconds, it will gain λ·*p* units of power. You can switch which device is charging at any arbitrary unit of time (including real numbers), and the time it takes to switch is negligible.\n\nYou are wondering, what is the maximum amount of time you can use the devices until one of them hits 0 units of power.\n\nIf you can use the devices indefinitely, print -1. Otherwise, print the maximum amount of time before any one device hits 0 power.",
"input": "",
"output": "```python\ndef max_usage_time(n, p, devices):\n total_power = sum(a for a, _ in devices)\n min_time = min(b / (total_power - a) for a, b in devices)\n return min_time if min_time * p >= 1 else -1\n\n# Input\nn, p = map(int, input().split())\ndevices = [tuple(map(int, input().split())) for _ in range(n)]\n\n# Calculate and print the result\nresult = max_usage_time(n, p, devices)\nprint(f'{result:.10f}')\n\t\t\t \t\t\t \t \t \t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A boy Bob likes to draw. Not long ago he bought a rectangular graph (checked) sheet with *n* rows and *m* columns. Bob shaded some of the squares on the sheet. Having seen his masterpiece, he decided to share it with his elder brother, who lives in Flatland. Now Bob has to send his picture by post, but because of the world economic crisis and high oil prices, he wants to send his creation, but to spend as little money as possible. For each sent square of paper (no matter whether it is shaded or not) Bob has to pay 3.14 burles. Please, help Bob cut out of his masterpiece a rectangle of the minimum cost, that will contain all the shaded squares. The rectangle's sides should be parallel to the sheet's sides.",
"input": "",
"output": "```python\nn, m = list(map(int, input().split()))\r\n\r\nlst = [list(input()) for i in range(n)]\r\n\r\na = []\r\nb = []\r\n\r\nfor i in range(n):\r\n flag = True\r\n for j in lst[i]:\r\n if j == '*':\r\n flag = False\r\n if not flag:\r\n a.append(i)\r\n \r\nfor x in range(m):\r\n flag = True\r\n for i in lst:\r\n if i[x] == '*':\r\n flag = False\r\n if not flag:\r\n b.append(x)\r\n\r\n# print(a, b)\r\n\r\ntmp = a[-1] + 1\r\nlst = lst[a[0]:tmp]\r\n\r\ntmp = b[-1] + 1\r\nfor i in range(len(lst)):\r\n lst[i] = lst[i][b[0]:tmp]\r\n \r\nfor i in lst:\r\n print(' '.join(i))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After passing a test, Vasya got himself a box of $n$ candies. He decided to eat an equal amount of candies each morning until there are no more candies. However, Petya also noticed the box and decided to get some candies for himself.\n\nThis means the process of eating candies is the following: in the beginning Vasya chooses a single integer $k$, same for all days. After that, in the morning he eats $k$ candies from the box (if there are less than $k$ candies in the box, he eats them all), then in the evening Petya eats $10\\%$ of the candies remaining in the box. If there are still candies left in the box, the process repeats — next day Vasya eats $k$ candies again, and Petya — $10\\%$ of the candies left in a box, and so on.\n\nIf the amount of candies in the box is not divisible by $10$, Petya rounds the amount he takes from the box down. For example, if there were $97$ candies in the box, Petya would eat only $9$ of them. In particular, if there are less than $10$ candies in a box, Petya won't eat any at all.\n\nYour task is to find out the minimal amount of $k$ that can be chosen by Vasya so that he would eat at least half of the $n$ candies he initially got. Note that the number $k$ must be integer.",
"input": "",
"output": "```python\nn = int(input())\r\n \r\nl = 1\r\nr = n\r\nwhile(l != r):\r\n mid = (l+r) // 2\r\n k = n\r\n t1 = 0\r\n while(k > 0):\r\n t1 +=min(mid,k)\r\n k -= min(mid,k)\r\n k -= k//10\r\n if(t1 >= (n+1)//2):\r\n r = mid\r\n else:\r\n l = mid+1\r\nprint(l)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ivan's classes at the university have just finished, and now he wants to go to the local CFK cafe and eat some fried chicken.\n\nCFK sells chicken chunks in small and large portions. A small portion contains 3 chunks; a large one — 7 chunks. Ivan wants to eat exactly *x* chunks. Now he wonders whether he can buy exactly this amount of chicken.\n\nFormally, Ivan wants to know if he can choose two non-negative integers *a* and *b* in such a way that *a* small portions and *b* large ones contain exactly *x* chunks.\n\nHelp Ivan to answer this question for several values of *x*!",
"input": "",
"output": "```python\nfor _ in range(int(input())):\r\n x=int(input())\r\n if x%3==0 or x%7==0 or (x%7)%3==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two players play a simple game. Each player is provided with a box with balls. First player's box contains exactly *n*1 balls and second player's box contains exactly *n*2 balls. In one move first player can take from 1 to *k*1 balls from his box and throw them away. Similarly, the second player can take from 1 to *k*2 balls from his box in his move. Players alternate turns and the first player starts the game. The one who can't make a move loses. Your task is to determine who wins if both players play optimally.",
"input": "",
"output": "```python\ninputs = input()\r\nn1 = int(inputs[0])\r\nn2 = int(inputs[2])\r\nk1 = int(inputs[4])\r\nk2 = int(inputs[6])\r\n\r\nif n1 >= n2 or n2 >= n1:\r\n if k1 > k2:\r\n print(\"First\")\r\n elif k2 > k1:\r\n print(\"Second\")\r\n elif k1 == k2:\r\n if n1 > n2:\r\n print(\"First\")\r\n elif n2 > n1:\r\n print(\"Second\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ternary numeric notation is quite popular in Berland. To telegraph the ternary number the Borze alphabet is used. Digit 0 is transmitted as «.», 1 as «-.» and 2 as «--». You are to decode the Borze code, i.e. to find out the ternary number given its representation in Borze alphabet.",
"input": "",
"output": "```python\nfrom math import ceil\r\n\r\n\r\ndef main():\r\n\r\n trans = {\r\n \"--\" : \"2\",\r\n \"-.\" : \"1\",\r\n \".\" : \"0\",\r\n }\r\n \r\n code = input()\r\n res = \"\"\r\n\r\n ch = 0\r\n while ch < len(code):\r\n for key in trans:\r\n if code[ch:ch+len(key)] == key:\r\n ch += len(key)\r\n res += trans[key]\r\n\r\n print(res)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main() \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You've got an *n*<=×<=*m* pixel picture. Each pixel can be white or black. Your task is to change the colors of as few pixels as possible to obtain a barcode picture.\n\nA picture is a barcode if the following conditions are fulfilled: \n - All pixels in each column are of the same color. - The width of each monochrome vertical line is at least *x* and at most *y* pixels. In other words, if we group all neighbouring columns of the pixels with equal color, the size of each group can not be less than *x* or greater than *y*.",
"input": "",
"output": "```python\nfrom sys import stdin\r\ninput = stdin.readline\r\nn,m,x,y=map(int,input().split())\r\nA=[input() for i in range(n)]\r\nZ=[]\r\nfor j in range(m):\r\n cnt=0\r\n for i in range(n):\r\n if A[i][j]==\"#\":\r\n cnt+=1\r\n Z.append(cnt)\r\n# print(Z)\r\ndef rec(last,streak,i):\r\n if i==m:\r\n return 0 if x<=streak<=y else 10**10\r\n if last==1:\r\n if streak\r\n#include \r\n#define _USE_MATH_DEFINES\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nint main() {\r\n\tint n;\r\n\tcin >> n;\r\n\tint razlozhenie, cur;\r\n\tcin >> razlozhenie;\r\n\twhile(razlozhenie % 2 == 0)\r\n\t\trazlozhenie /= 2;\r\n\twhile(razlozhenie % 3 == 0)\r\n\t\trazlozhenie /= 3;\r\n\t\r\n\tfor(int i = 1; i < n; i++) {\r\n\t\tcin >> cur;\r\n\t\twhile(cur % 2 == 0)\r\n\t\t\tcur /= 2;\r\n\t\twhile(cur % 3 == 0)\r\n\t\t\tcur /= 3;\r\n\t\tif(cur != razlozhenie) {\r\n\t\t\tcout << \"No\" << endl;\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t}\r\n\tcout << \"Yes\" << endl;\r\n}\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer.\n\nAt the start of the day they have *x* ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and Gerda's house even in the night. Each person in the queue wants either to take several ice cream packs for himself and his friends or to give several ice cream packs to Kay and Gerda (carriers that bring ice cream have to stand in the same queue).\n\nIf a carrier with *d* ice cream packs comes to the house, then Kay and Gerda take all his packs. If a child who wants to take *d* ice cream packs comes to the house, then Kay and Gerda will give him *d* packs if they have enough ice cream, otherwise the child will get no ice cream at all and will leave in distress.\n\nKay wants to find the amount of ice cream they will have after all people will leave from the queue, and Gerda wants to find the number of distressed kids.",
"input": "",
"output": "```python\nn,x=input().split()\nn=int(n);x=int(x)\ndistressed=0\nfor i in range(n):\n a,b=input().split()\n b=int(b)\n if a=='+':\n x+=b\n elif x>=b:\n x-=b\n else:\n distressed+=1\nprint(x,distressed)\n\t\t \t \t\t \t \t \t \t\t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A dice is a cube, its faces contain distinct integers from 1 to 6 as black points. The sum of numbers at the opposite dice faces always equals 7. Please note that there are only two dice (these dices are mirror of each other) that satisfy the given constraints (both of them are shown on the picture on the left).\n\nAlice and Bob play dice. Alice has built a tower from *n* dice. We know that in this tower the adjacent dice contact with faces with distinct numbers. Bob wants to uniquely identify the numbers written on the faces of all dice, from which the tower is built. Unfortunately, Bob is looking at the tower from the face, and so he does not see all the numbers on the faces. Bob sees the number on the top of the tower and the numbers on the two adjacent sides (on the right side of the picture shown what Bob sees).\n\nHelp Bob, tell whether it is possible to uniquely identify the numbers on the faces of all the dice in the tower, or not.",
"input": "",
"output": "```python\nn = int(input())\r\nx = int(input())\r\nhid = 7-x\r\nfor i in range(n):\r\n hid = 7-x\r\n a, b = map(int, input().split())\r\n if hid in [7-a, 7-b, a, b]:\r\n print(\"NO\")\r\n break\r\n else:\r\n x = hid\r\nelse:\r\n print('YES')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ilya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam.\n\nYou've got string *s*<==<=*s*1*s*2... *s**n* (*n* is the length of the string), consisting only of characters \".\" and \"#\" and *m* queries. Each query is described by a pair of integers *l**i*,<=*r**i* (1<=≤<=*l**i*<=<<=*r**i*<=≤<=*n*). The answer to the query *l**i*,<=*r**i* is the number of such integers *i* (*l**i*<=≤<=*i*<=<<=*r**i*), that *s**i*<==<=*s**i*<=+<=1.\n\nIlya the Lion wants to help his friends but is there anyone to help him? Help Ilya, solve the problem.",
"input": "",
"output": "```python\ndef count_pref(s: str) -> list[int]:\n pref = [0] * (len(s))\n for i in range(1, len(pref)):\n pref[i] += pref[i-1]\n if s[i-1] == s[i]:\n pref[i] += 1\n\n return pref\n\n\ndef process(pref: list[int], queries: list[list[int]]) -> list[int]:\n res = []\n for query in queries:\n i, j = query\n value = pref[j-1] - pref[i-1]\n res.append(value)\n\n return res\n\nif __name__ == \"__main__\":\n sequence = input().strip()\n n = int(input().strip())\n pref = count_pref(sequence)\n queries = []\n for _ in range(n):\n query = list(map(int, input().strip().split()))\n queries.append(query)\n ans = process(pref, queries)\n print(\"\\n\".join(map(str, ans)))\n\t \t \t \t\t \t \t \t\t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Little Elephant has an integer *a*, written in the binary notation. He wants to write this number on a piece of paper.\n\nTo 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* in the binary record. At that a new number appears. It consists of the remaining binary digits, written in the corresponding order (possible, with leading zeroes).\n\nThe Little Elephant wants the number he is going to write on the paper to be as large as possible. Help him find the maximum number that he can obtain after deleting exactly one binary digit and print it in the binary notation.",
"input": "",
"output": "```python\nn=input()\r\na=[x for x in n]\r\nif n.count('0')>0:\r\n a.remove('0')\r\n print(''.join(a))\r\nelse:\r\n del a[-1]\r\n print(''.join(a))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Alice likes word \"nineteen\" very much. She has a string *s* and wants the string to contain as many such words as possible. For that reason she can rearrange the letters of the string.\n\nFor example, if she has string \"xiineteenppnnnewtnee\", she can get string \"xnineteenppnineteenw\", containing (the occurrences marked) two such words. More formally, word \"nineteen\" occurs in the string the number of times you can read it starting from some letter of the string. Of course, you shouldn't skip letters.\n\nHelp her to find the maximum number of \"nineteen\"s that she can get in her string.",
"input": "",
"output": "```python\ndef printMatrix(matrix):\r\n for matrixrow in matrix:\r\n row = ''\r\n for value in matrixrow:\r\n row += str(value) + ' '\r\n print(row)\r\n\r\n\r\nn = int(input())\r\nw = [[0 for i in range(n)] for i in range(n)]\r\na = [[0 for i in range(n)] for i in range(n)]\r\nb = [[0 for i in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n row = input().split(' ')\r\n for e in range(n):\r\n w[i][e] = int(row[e])\r\nfor i in range(n):\r\n for e in range(n):\r\n a[e][i] = a[i][e] = (w[i][e]+w[e][i]) / 2\r\n b[e][i] = w[e][i] - a[e][i]\r\nprintMatrix(a)\r\nprintMatrix(b)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "While Mike was walking in the subway, all the stuff in his back-bag dropped on the ground. There were several fax messages among them. He concatenated these strings in some order and now he has string *s*.\n\nHe is not sure if this is his own back-bag or someone else's. He remembered that there were exactly *k* messages in his own bag, each was a palindrome string and all those strings had the same length.\n\nHe asked you to help him and tell him if he has worn his own back-bag. Check if the given string *s* is a concatenation of *k* palindromes of the same length.",
"input": "",
"output": "```python\ns=input()\r\ns=list(s)\r\np=int(input())\r\nf=0\r\n#lst = list(map(int, input().strip().split(' ')))\r\ni=0\r\nk=len(s)//p\r\nwhile(i<=len(s)-k):\r\n t=[]\r\n for j in range(i,i+k):\r\n t.append(s[j])\r\n\r\n if s[i:i+k]==t[::-1]:\r\n i+=k \r\n \r\n else:\r\n print('NO')\r\n f=1\r\n break\r\nif f==0:\r\n print('YES')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In a Berland's zoo there is an enclosure with camels. It is known that camels like to spit. Bob watched these interesting animals for the whole day and registered in his notepad where each animal spitted. Now he wants to know if in the zoo there are two camels, which spitted at each other. Help him to solve this task.\n\nThe trajectory of a camel's spit is an arc, i.e. if the camel in position *x* spits *d* meters right, he can hit only the camel in position *x*<=+<=*d*, if such a camel exists.",
"input": "",
"output": "```python\nx = []\r\nd = []\r\nfor i in ' '*int(input()):\r\n x2, d2 = map(int, input().split())\r\n x.append(x2)\r\n d.append(d2)\r\nf = 0\r\nkol = 0\r\nfor i in range(len(x)):\r\n for j in range(len(x)):\r\n if x[i]+d[i] == x[j] and x[j] + d[j] == x[i] and kol != 2:\r\n f = 1\r\n kol += 1\r\nprint('YES' if f == 1 else 'NO')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a game called \"I Wanna Be the Guy\", consisting of *n* levels. Little X and his friend Little Y are addicted to the game. Each of them wants to pass the whole game.\n\nLittle X can pass only *p* levels of the game. And Little Y can pass only *q* levels of the game. You are given the indices of levels Little X can pass and the indices of levels Little Y can pass. Will Little X and Little Y pass the whole game, if they cooperate each other?",
"input": "",
"output": "```python\nn=int(input())\r\nlist1=list( map(int,input().split()))\r\nlist2= list (map(int,input().split()))\r\nMergedList=list1+list2\r\nX=set(MergedList())\r\nif len(X)==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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 *v*1 milliseconds and has ping *t*1 milliseconds. The second participant types one character in *v*2 milliseconds and has ping *t*2 milliseconds.\n\nIf connection ping (delay) is *t* milliseconds, the competition passes for a participant as follows: \n 1. Exactly after *t* milliseconds after the start of the competition the participant receives the text to be entered. 1. Right after that he starts to type it. 1. Exactly *t* milliseconds after he ends typing all the text, the site receives information about it. \nThe winner is the participant whose information on the success comes earlier. If the information comes from both participants at the same time, it is considered that there is a draw.\n\nGiven the length of the text and the information about participants, determine the result of the game.",
"input": "",
"output": "```python\ns,v1,v2,t1,t2=map(int,input().split())\r\nz1=s*v1+2*t1\r\nz2=s*v2+2*t2\r\nif z1>z2:\r\n print(\"Second\")\r\nelif z2>z1:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp is mad about coding, that is why he writes Sveta encoded messages. He calls the median letter in a word the letter which is in the middle of the word. If the word's length is even, the median letter is the left of the two middle letters. In the following examples, the median letter is highlighted: contest, info. If the word consists of single letter, then according to above definition this letter is the median letter. \n\nPolycarp encodes each word in the following way: he writes down the median letter of the word, then deletes it and repeats the process until there are no letters left. For example, he encodes the word volga as logva.\n\nYou are given an encoding *s* of some word, your task is to decode it.",
"input": "",
"output": "```python\n\"\"\"\r\nabcd \r\n\r\nbcad\r\n\r\nabcd \r\n\"\"\"\r\n\r\nn = int(input()) \r\ns = input() \r\nans = [' '] * n \r\nif len(s) % 2 == 0:\r\n l = (n - 1) // 2 \r\n r = (n) // 2 \r\n i = 0\r\n j = 1 \r\n ans[l] = s[i] \r\n ans[r] = s[j] \r\n while j + 2 < n:\r\n j += 2\r\n i += 2 \r\n l -= 1 \r\n r += 1 \r\n ans[l] = s[i] \r\n ans[r] = s[j]\r\nelse: \r\n m = n // 2 \r\n ans[m] = s[0] \r\n l = m - 1 \r\n r = m + 1\r\n i = 1 \r\n j = 2 \r\n while i + 1 < n:\r\n ans[l] = s[i] \r\n ans[r] = s[j] \r\n l -= 1 \r\n r += 1 \r\n i += 2 \r\n j += 2 \r\n\r\nprint(\"\".join(ans))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Eugeny has array *a*<==<=*a*1,<=*a*2,<=...,<=*a**n*, consisting of *n* integers. Each integer *a**i* equals to -1, or to 1. Also, he has *m* queries:\n - Query number *i* is given as a pair of integers *l**i*, *r**i* (1<=≤<=*l**i*<=≤<=*r**i*<=≤<=*n*). - The response to the query will be integer 1, if the elements of array *a* can be rearranged so as the sum *a**l**i*<=+<=*a**l**i*<=+<=1<=+<=...<=+<=*a**r**i*<==<=0, otherwise the response to the query will be integer 0. \nHelp Eugeny, answer all his queries.",
"input": "",
"output": "```python\nimport sys\r\n\r\n(n, m) = [int(x) for x in sys.stdin.readline().split()]\r\nn_one = sys.stdin.readline().count(\"-\")\r\none = n - n_one\r\n\r\nfor i in range(0, m):\r\n (l, r) = [int(x) for x in sys.stdin.readline().split()]\r\n q = r - l + 1\r\n if q % 2 == 1:\r\n print(0)\r\n else:\r\n if q / 2 <= one and q / 2 <= n_one:\r\n print(1)\r\n else:\r\n print(0)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given $n$ strings. Each string consists of lowercase English letters. Rearrange (reorder) the given strings in such a way that for every string, all strings that are placed before it are its substrings.\n\nString $a$ is a substring of string $b$ if it is possible to choose several consecutive letters in $b$ in such a way that they form $a$. For example, string \"for\" is contained as a substring in strings \"codeforces\", \"for\" and \"therefore\", but is not contained as a substring in strings \"four\", \"fofo\" and \"rof\".",
"input": "",
"output": "```python\nn = int(input())\nstrings = dict()\nlength = []\nfor i in range(n):\n a = input()\n strings[len(a)] = a\n length.append(len(a))\n\nlength.sort()\nfor j in range(n):\n length[j] = strings[length[j]]\n\npos = True\nfor k in range(n - 1):\n if length[k] not in length[k + 1]:\n pos = False\n\nif pos:\n print(\"YES\")\n for o in length:\n print(o)\nelse:\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Duff is in love with lovely numbers! A positive integer *x* is called lovely if and only if there is no such positive integer *a*<=><=1 such that *a*2 is a divisor of *x*.\n\nMalek has a number store! In his store, he has only divisors of positive integer *n* (and he has all of them). As a birthday present, Malek wants to give her a lovely number from his store. He wants this number to be as big as possible.\n\nMalek always had issues in math, so he asked for your help. Please tell him what is the biggest lovely number in his store.",
"input": "",
"output": "```python\nimport math\r\n\r\n\r\ndef check_square_division(n):\r\n for i in range(2, math.floor(math.sqrt(n))):\r\n if n % (i ** 2) == 0:\r\n return False\r\n return True\r\n\r\ndef main():\r\n n= int(input())\r\n\r\n divisors = []\r\n for i in range(1, n+1):\r\n if n % i == 0:\r\n divisors.append(i)\r\n \r\n final_answer = -1\r\n for divisor in reversed(divisors):\r\n if check_square_division(divisor):\r\n final_answer = divisor\r\n break\r\n\r\n print(final_answer)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory. \n\nGeorge and Alex want to live in the same room. The dormitory has *n* rooms in total. At the moment the *i*-th room has *p**i* people living in it and the room can accommodate *q**i* people in total (*p**i*<=≤<=*q**i*). Your task is to count how many rooms has free place for both George and Alex.",
"input": "",
"output": "```python\nn =input()\nn =int(n)\nX = 0\nfor i in range(1,n+1):\n a, b =input().split()\n a =int(a)\n b =int(b)\n if(b - a >= 2):\n x=x+1\nprint(x)\n \t \t\t \t\t \t\t\t\t\t\t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Fedya studies in a gymnasium. Fedya's maths hometask is to calculate the following expression:\n\nfor given value of *n*. Fedya managed to complete the task. Can you? Note that given number *n* can be extremely large (e.g. it can exceed any integer type of your programming language).",
"input": "",
"output": "```python\ndef expression(n):\n if (n%4):\n return 0\n else:\n return 4\n\nn = int(input())\nresult = expression(n)\nprint(result)\n\t\t\t\t\t \t \t \t\t\t \t\t \t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Your friend has recently learned about coprime numbers. A pair of numbers {*a*,<=*b*} is called coprime if the maximum number that divides both *a* and *b* is equal to one. \n\nYour friend often comes up with different statements. He has recently supposed that if the pair (*a*,<=*b*) is coprime and the pair (*b*,<=*c*) is coprime, then the pair (*a*,<=*c*) is coprime. \n\nYou want to find a counterexample for your friend's statement. Therefore, your task is to find three distinct numbers (*a*,<=*b*,<=*c*), for which the statement is false, and the numbers meet the condition *l*<=≤<=*a*<=<<=*b*<=<<=*c*<=≤<=*r*. \n\nMore specifically, you need to find three numbers (*a*,<=*b*,<=*c*), such that *l*<=≤<=*a*<=<<=*b*<=<<=*c*<=≤<=*r*, pairs (*a*,<=*b*) and (*b*,<=*c*) are coprime, and pair (*a*,<=*c*) is not coprime.",
"input": "",
"output": "```python\ndef gcd(a, b):\r\n rem = 0\r\n while b != 0:\r\n rem = a%b\r\n a = b\r\n b = rem\r\n return a\r\n\r\n\r\na, b = map(int, input().split())\r\nif b-a == 1:\r\n print (-1)\r\nelse: \r\n found = False\r\n for i in range(a, b+1):\r\n for j in range(i+1, b+1):\r\n for k in range(j+1, b+1):\r\n if gcd(i, j) == 1 and gcd(j, k) == 1 and gcd(i, k) != 1:\r\n found = True\r\n print (i, j, k)\r\n break\r\n if found:\r\n break\r\n if found:\r\n break\r\n if not found:\r\n print (-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "String can be called correct if it consists of characters \"0\" and \"1\" and there are no redundant leading zeroes. Here are some examples: \"0\", \"10\", \"1001\".\n\nYou are given a correct string *s*.\n\nYou can perform two different operations on this string: \n 1. swap any pair of adjacent characters (for example, \"101\" \"110\"); 1. replace \"11\" with \"1\" (for example, \"110\" \"10\"). \nLet *val*(*s*) be such a number that *s* is its binary representation.\n\nCorrect string *a* is less than some other correct string *b* iff *val*(*a*)<=<<=*val*(*b*).\n\nYour task is to find the minimum correct string that you can obtain from the given one using the operations described above. You can use these operations any number of times in any order (or even use no operations at all).",
"input": "",
"output": "```python\n\r\nn = int(input())\r\nst = list(input())\r\nif not \"1\" in st:\r\n print(0)\r\n quit()\r\nprint(\"1\", end = \"\")\r\nfor i in st:\r\n if i == \"0\": \r\n print(i, end = \"\")\r\nprint()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\ndata = input()\r\n\r\nl=u = 0\r\n\r\nfor x in data:\r\n if x.islower():\r\n l+=1\r\n else:\r\n u+=1\r\n\r\nif l>=u:\r\n print(data.lower())\r\nelse:\r\n print(data.upper())\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "«Polygon» is a system which allows to create programming tasks in a simple and professional way. When you add a test to the problem, the corresponding form asks you for the test index. As in most cases it is clear which index the next test will have, the system suggests the default value of the index. It is calculated as the smallest positive integer which is not used as an index for some previously added test.\n\nYou are to implement this feature. Create a program which determines the default index of the next test, given the indexes of the previously added tests.",
"input": "",
"output": "```python\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif l[0]>1:\r\n print(1)\r\nelse:\r\n for i in range(len(l)-1):\r\n if l[i+1]-l[i]>1:\r\n print(l[i]+1)\r\n break\r\n else:\r\n print(l[-1]+1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "On the way to Rio de Janeiro Ostap kills time playing with a grasshopper he took with him in a special box. Ostap builds a line of length *n* such that some cells of this line are empty and some contain obstacles. Then, he places his grasshopper to one of the empty cells and a small insect in another empty cell. The grasshopper wants to eat the insect.\n\nOstap knows that grasshopper is able to jump to any empty cell that is exactly *k* cells away from the current (to the left or to the right). Note that it doesn't matter whether intermediate cells are empty or not as the grasshopper makes a jump over them. For example, if *k*<==<=1 the grasshopper can jump to a neighboring cell only, and if *k*<==<=2 the grasshopper can jump over a single cell.\n\nYour goal is to determine whether there is a sequence of jumps such that grasshopper will get from his initial position to the cell with an insect.",
"input": "",
"output": "```python\nn,k = map(int,input().split())\r\ns = input()\r\nfirst = s.index('G')\r\nlast = s.index('T')\r\nif first < last:\r\n if s[first+k] == 'T':\r\n print(\"YES\")\r\n elif s[first+k] == '#':\r\n print(\"NO\")\r\n elif first+k > last:\r\n print(\"NO\")\r\n elif s[first+k] == '.':\r\n if s[(first+k)+1] == '#':\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\nelse:\r\n if s[first-k] == 'T':\r\n print(\"YES\")\r\n elif s[first-k] == '#':\r\n print(\"NO\")\r\n elif s[first-k] == '.':\r\n if s[(first-k)-1] == '#':\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "An exam for *n* students will take place in a long and narrow room, so the students will sit in a line in some order. The teacher suspects that students with adjacent numbers (*i* and *i*<=+<=1) always studied side by side and became friends and if they take an exam sitting next to each other, they will help each other for sure.\n\nYour task is to choose the maximum number of students and make such an arrangement of students in the room that no two students with adjacent numbers sit side by side.",
"input": "",
"output": "```python\nn=int(input())\r\nif n==3:\r\n print (2)\r\n print ('1 3')\r\n exit()\r\nif n==2:\r\n print (1)\r\n print (1)\r\na=[]\r\nb=[]\r\nfor i in range (1,n+1):\r\n if i%2==0:\r\n a.append(i)\r\n else :\r\n b.append(i)\r\nc=a+b\r\nprint (n)\r\nprint (\" \".join(map(str,c)))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\np=int(input())\r\nfor i in range(p):\r\n sedd=input()\r\n if(len(sedd)<=10):\r\n print(sedd)\r\n else:\r\n print(sedd[0]+str(len(sedd)-2)+sedd[len(sedd)-1])\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A sum of *p* rubles is charged from Arkady's mobile phone account every day in the morning. Among the following *m* days, there are *n* days when Arkady will top up the account: in the day *d**i* he will deposit *t**i* rubles on his mobile phone account. Arkady will always top up the account before the daily payment will be done. There will be no other payments nor tops up in the following *m* days.\n\nDetermine the number of days starting from the 1-st to the *m*-th such that the account will have a negative amount on it after the daily payment (i. e. in evening). Initially the account's balance is zero rubles.",
"input": "",
"output": "```python\nn,p,m=map(int,input().split())\n\nl2=[]\nld=[]\nlt=[]\nk=0\nfor i in range(n):\n d,t=map(int,input().split())\n ld.append(d)\n lt.append(t)\nfor i in range(1,m+1):\n if i in ld:\n k+=lt[ld.index(i)]\n l2.append(k)\ns=0\nfor i in range(m):\n if l2[i]= dista[w]:\r\n distb[w] = d + 1\r\n continue\r\n dfsb(w, u, d + 1)\r\n\r\n\r\ndfsa(0, -1, 0)\r\ndfsb(x, -1, 0)\r\nnum = 0\r\nfor i in range(n):\r\n if distb[i] != -1:\r\n num = max(num, dista[i] * 2)\r\nprint(num)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The floor was tiled with hexagonal tiles.\n\nThe hall also turned out hexagonal in its shape. The King walked along the perimeter of the hall and concluded that each of the six sides has *a*, *b*, *c*, *a*, *b* and *c* adjacent tiles, correspondingly.\n\nTo better visualize the situation, look at the picture showing a similar hexagon for *a*<==<=2, *b*<==<=3 and *c*<==<=4.\n\nAccording to the legend, as the King of Berland obtained the values *a*, *b* and *c*, he almost immediately calculated the total number of tiles on the hall floor. Can you do the same?",
"input": "",
"output": "```python\n\r\n\r\n\r\na,b,c = map(int,input().split())\r\n\r\n\r\n\r\nt = min(a,b,c)-1\r\n\r\ns=a+b+c\r\n\r\n\r\np=0\r\n\r\nfor k in range(t):\r\n s+=(s-3)\r\n\r\n\r\n\r\nprint(s*2-((t+1)*6))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a string *s* consisting only of characters 0 and 1. A substring [*l*,<=*r*] of *s* is a string *s**l**s**l*<=+<=1*s**l*<=+<=2... *s**r*, and its length equals to *r*<=-<=*l*<=+<=1. A substring is called balanced if the number of zeroes (0) equals to the number of ones in this substring.\n\nYou have to determine the length of the longest balanced substring of *s*.",
"input": "",
"output": "```python\nn=int(input())\r\nc=[]\r\nmaxx=[]\r\nfor i in range(n):\r\n m=int(input())\r\n c.append(m)\r\n\r\nif len(c)==2 :\r\n if c.count(1)==c.count(0):\r\n print(2)\r\n \r\nelse : \r\n for a in range(n):\r\n for b in range(n):\r\n q=c[a:b]\r\n if q.count(1)==q.count(0):\r\n maxx.append(len(q))\r\n else :\r\n pass\r\n print (max(maxx))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sereja and Dima play a game. The rules of the game are very simple. The players have *n* cards in a row. Each card contains a number, all numbers on the cards are distinct. The players take turns, Sereja moves first. During his turn a player can take one card: either the leftmost card in a row, or the rightmost one. The game ends when there is no more cards. The player who has the maximum sum of numbers on his cards by the end of the game, wins.\n\nSereja and Dima are being greedy. Each of them chooses the card with the larger number during his move.\n\nInna is a friend of Sereja and Dima. She knows which strategy the guys are using, so she wants to determine the final score, given the initial state of the game. Help her.",
"input": "",
"output": "```python\nn=int(input())\r\nl1=list(map(int,input().split()))\r\ns=0\r\nd=0\r\nle=len(l1)\r\nif(le%2==0):\r\n while len(l1)>0:\r\n if(l1[0]>=l1[-1]):\r\n s=s+l1[0]\r\n l1.pop(0)\r\n else:\r\n s=s+l1[-1]\r\n l1.pop(-1)\r\n if(l1[0]>=l1[-1]):\r\n d=d+l1[0]\r\n l1.pop(0)\r\n else:\r\n d=d+l1[-1]\r\n l1.pop(-1)\r\nelse:\r\n while len(l1)>1:\r\n if(l1[0]>=l1[-1]):\r\n s=s+l1[0]\r\n l1.pop(0)\r\n else:\r\n s=s+l1[-1]\r\n l1.pop(-1)\r\n if(l1[0]>=l1[-1]):\r\n d=d+l1[0]\r\n l1.pop(0)\r\n else:\r\n d=d+l1[-1]\r\n l1.pop(-1)\r\n s=s+l1[0]\r\nprint(s,d)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Natasha is going to fly on a rocket to Mars and return to Earth. Also, on the way to Mars, she will land on $n - 2$ intermediate planets. Formally: we number all the planets from $1$ to $n$. $1$ is Earth, $n$ is Mars. Natasha will make exactly $n$ flights: $1 \\to 2 \\to \\ldots n \\to 1$.\n\nFlight from $x$ to $y$ consists of two phases: take-off from planet $x$ and landing to planet $y$. This way, the overall itinerary of the trip will be: the $1$-st planet $\\to$ take-off from the $1$-st planet $\\to$ landing to the $2$-nd planet $\\to$ $2$-nd planet $\\to$ take-off from the $2$-nd planet $\\to$ $\\ldots$ $\\to$ landing to the $n$-th planet $\\to$ the $n$-th planet $\\to$ take-off from the $n$-th planet $\\to$ landing to the $1$-st planet $\\to$ the $1$-st planet.\n\nThe mass of the rocket together with all the useful cargo (but without fuel) is $m$ tons. However, Natasha does not know how much fuel to load into the rocket. Unfortunately, fuel can only be loaded on Earth, so if the rocket runs out of fuel on some other planet, Natasha will not be able to return home. Fuel is needed to take-off from each planet and to land to each planet. It is known that $1$ ton of fuel can lift off $a_i$ tons of rocket from the $i$-th planet or to land $b_i$ tons of rocket onto the $i$-th planet. \n\nFor example, if the weight of rocket is $9$ tons, weight of fuel is $3$ tons and take-off coefficient is $8$ ($a_i = 8$), then $1.5$ tons of fuel will be burnt (since $1.5 \\cdot 8 = 9 + 3$). The new weight of fuel after take-off will be $1.5$ tons. \n\nPlease note, that it is allowed to burn non-integral amount of fuel during take-off or landing, and the amount of initial fuel can be non-integral as well.\n\nHelp Natasha to calculate the minimum mass of fuel to load into the rocket. Note, that the rocket must spend fuel to carry both useful cargo and the fuel itself. However, it doesn't need to carry the fuel which has already been burnt. Assume, that the rocket takes off and lands instantly.",
"input": "",
"output": "```python\nimport sys\r\nfrom math import *\r\nfrom collections import Counter,defaultdict,deque\r\ninput=sys.stdin.readline\r\nmod=10**9+7\r\ndef get_ints():return map(int,input().split())\r\ndef get_int():return int(input())\r\ndef get_array():return list(map(int,input().split()))\r\ndef input():return sys.stdin.readline().strip()\r\n\r\n# for _ in range(int(input())):\r\nn=get_int()\r\nm=get_int()\r\no=m\r\na=get_array()\r\nb=get_array()\r\ns=[a[0]]\r\nfor i in range(1,n-1):\r\n s.append(b[i])\r\n s.append(a[i])\r\ns.append(b[-1])\r\ns.append(a[-1])\r\ns.append(b[0])\r\nif 1 in s:\r\n print(-1)\r\nfor j in s[::-1]:\r\n m=m*j/(j-1)\r\nprint(m-o)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "So, the New Year holidays are over. Santa Claus and his colleagues can take a rest and have guests at last. When two \"New Year and Christmas Men\" meet, thear assistants cut out of cardboard the letters from the guest's name and the host's name in honor of this event. Then the hung the letters above the main entrance. One night, when everyone went to bed, someone took all the letters of our characters' names. Then he may have shuffled the letters and put them in one pile in front of the door.\n\nThe next morning it was impossible to find the culprit who had made the disorder. But everybody wondered whether it is possible to restore the names of the host and his guests from the letters lying at the door? That is, we need to verify that there are no extra letters, and that nobody will need to cut more letters.\n\nHelp the \"New Year and Christmas Men\" and their friends to cope with this problem. You are given both inscriptions that hung over the front door the previous night, and a pile of letters that were found at the front door next morning.",
"input": "",
"output": "```python\na = list(input())\nb= list(input())\nc = list(input())\n\nfor i in c:\n if i in a:\n a.remove(i)\n elif i in b:\n b.remove(i)\n else:\n print(\"NO\")\n quit()\nif len(a) ==0 and len(b)==0:\n print(\"YES\")\nelse:\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.\n\nOne day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.\n\nIn his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The *i*-th digit of the answer is 1 if and only if the *i*-th digit of the two given numbers differ. In the other case the *i*-th digit of the answer is 0.\n\nShapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.\n\nNow you are going to take part in Shapur's contest. See if you are faster and more accurate.",
"input": "",
"output": "```python\nn=list(map(str,input().split()))\r\nm=list(map(str,input().split()))\r\nlst=[]\r\nfor i in n:\r\n for j in m:\r\n if i!=j:\r\n x=1\r\n lst.append(x)\r\n else:\r\n y=0\r\n lst.append(y)\r\n \r\nprint(''.join(lst))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya loves lucky numbers. Everybody knows that positive integers are lucky if their decimal representation doesn't contain digits other than 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.\n\nLucky number is super lucky if it's decimal representation contains equal amount of digits 4 and 7. For example, numbers 47, 7744, 474477 are super lucky and 4, 744, 467 are not.\n\nOne day Petya came across a positive integer *n*. Help him to find the least super lucky number which is not less than *n*.",
"input": "",
"output": "```python\nimport sys\r\n\r\nn = sys.stdin.readline()\r\nt = map(int, sys.stdin.readline().split())\r\n\r\ncount = {}\r\nfor i in xrange(-10, 11):\r\n count[i] = 0;\r\n\r\nret = 0\r\nfor x in t:\r\n count[x] += 1\r\n\r\nfor x in t:\r\n ret += count[-x]\r\n if x == 0:\r\n ret -= 1\r\n\r\nprint ret / 2\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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: Vaporeon, Jolteon, Flareon, Espeon, Umbreon, Leafeon, Glaceon, and Sylveon.\n\nYou know the length of the word in the crossword, and you already know some letters. Designers of the crossword made sure that the answer is unambiguous, so you can assume that exactly one pokemon out of the 8 that Eevee evolves into fits the length and the letters given. Your task is to find it.",
"input": "",
"output": "```python\nimport re\ninput()\ns = input()\narr = ['vaporeon', 'jolteon', 'flareon', 'espeon', 'umbreon', 'leafeon', 'glaceon', 'sylveon']\nfor res in arr:\n\tif re.match(s, res):\n\t\tprint(res)\n\t\tbreak\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya wants to turn on Christmas lights consisting of *m* bulbs. Initially, all bulbs are turned off. There are *n* buttons, each of them is connected to some set of bulbs. Vasya can press any of these buttons. When the button is pressed, it turns on all the bulbs it's connected to. Can Vasya light up all the bulbs?\n\nIf Vasya presses the button such that some bulbs connected to it are already turned on, they do not change their state, i.e. remain turned on.",
"input": "",
"output": "```python\nn,m=map(int,input().split())\r\nnum=[(int(x) for x in input().split())for i in range(n)]\r\nx=0\r\nfor i in range(m):\r\n if i in num:\r\n x+=1\r\nprint(['NO','YES'][x!=m])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Lolek and Bolek are about to travel abroad by plane. The local airport has a special \"Choose Your Plane\" offer. The offer's conditions are as follows:\n - it is up to a passenger to choose a plane to fly on; - if the chosen plane has *x* (*x*<=><=0) empty seats at the given moment, then the ticket for such a plane costs *x* zlotys (units of Polish currency). \nThe only ticket office of the airport already has a queue of *n* passengers in front of it. Lolek and Bolek have not stood in the queue yet, but they are already wondering what is the maximum and the minimum number of zlotys the airport administration can earn if all *n* passengers buy tickets according to the conditions of this offer?\n\nThe passengers buy tickets in turn, the first person in the queue goes first, then goes the second one, and so on up to *n*-th person.",
"input": "",
"output": "```python\ndef get_cost(command,zlotys,passengers,cost = 0):\r\n while passengers:\r\n\r\n cost += command(zlotys)\r\n\r\n zlotys[zlotys.index(command(zlotys))] -= 1\r\n\r\n if not zlotys[zlotys.index(command(zlotys))]:\r\n zlotys.pop(zlotys.index(command(zlotys)))\r\n \r\n passengers -= 1\r\n \r\n return cost\r\n\r\npassengers,planes = map(int,input().split())\r\nzlotys = [int(x) for x in input().split()]\r\n\r\nexpensive = get_cost(max,zlotys[:],passengers)\r\ncheap = get_cost(min,zlotys,passengers)\r\n\r\nprint (expensive,cheap)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* cards (*n* is even) in the deck. Each card has a positive integer written on it. *n*<=/<=2 people will play new card game. At the beginning of the game each player gets two cards, each card is given to exactly one player. \n\nFind the way to distribute cards such that the sum of values written of the cards will be equal for each player. It is guaranteed that it is always possible.",
"input": "",
"output": "```python\ndef division():\r\n\tn = int(input())\r\n\ta = [(int(num), i) for i, num in enumerate(input().split(), 1)]\r\n\r\n\ta.sort()\r\n\tfor i in range(n // 2):\r\n\t\tprint(a[i][1], a[n - 1 - i][1])\r\n\r\ndivision()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya loves presents. His mum bought him two strings of the same size for his birthday. The strings consist of uppercase and lowercase Latin letters. Now Petya wants to compare those two strings lexicographically. The letters' case does not matter, that is an uppercase letter is considered equivalent to the corresponding lowercase letter. Help Petya perform the comparison.",
"input": "",
"output": "```python\nword1 = str(input()).lower()\r\nword2 = str(input()).lower()\r\n\r\nif (word1 == word2): print(0)\r\nelif (word1 < word2): print(-1)\r\nelse: print(1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vitaly is a diligent student who never missed a lesson in his five years of studying in the university. He always does his homework on time and passes his exams in time. \n\nDuring the last lesson the teacher has provided two strings *s* and *t* to Vitaly. The strings have the same length, they consist of lowercase English letters, string *s* is lexicographically smaller than string *t*. Vitaly wondered if there is such string that is lexicographically larger than string *s* and at the same is lexicographically smaller than string *t*. This string should also consist of lowercase English letters and have the length equal to the lengths of strings *s* and *t*. \n\nLet's help Vitaly solve this easy problem!",
"input": "",
"output": "```python\ndef charToInt(c): #'a'->0\r\n return ord(c)-ord('a')\r\ndef intToChar(x): #0->'a'\r\n return chr(ord('a')+x)\r\n\r\ns=input()\r\nt=input()\r\n\r\ntt=[charToInt(c) for c in t]\r\nss=[charToInt(c) for c in s]\r\nn=len(tt)\r\n\r\nfor i in range(n-1,-1,-1):\r\n ss[i]+=1\r\n if ss[i]==26:\r\n ss[i]-=1\r\n else:\r\n break\r\n\r\ns=''.join([intToChar(x) for x in ss])\r\nif s==t:\r\n print('No such string')\r\nelse:\r\n print(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given *n* numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given *n* numbers finds one that is different in evenness.",
"input": "",
"output": "```python\ndef main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n even = 0\r\n odd = 0\r\n\r\n for i in arr:\r\n if i % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\n for i in range(n):\r\n if even == 1:\r\n if arr[i] % 2 == 0:\r\n print(i + 1)\r\n exit()\r\n else:\r\n if arr[i] % 2 != 0:\r\n print(i + 1)\r\n exit()\r\n\r\n\r\nmain()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Furik loves math lessons very much, so he doesn't attend them, unlike Rubik. But now Furik wants to get a good mark for math. For that Ms. Ivanova, his math teacher, gave him a new task. Furik solved the task immediately. Can you?\n\nYou are given a system of equations: \n\nYou should count, how many there are pairs of integers (*a*,<=*b*) (0<=≤<=*a*,<=*b*) which satisfy the system.",
"input": "",
"output": "```python\n# your code goes here# your code goes her\r\nn,m=map(int,input().split())\r\ndiff= n-m\r\nans=0\r\nfor i in range(1001):\r\n\tfor j in range(1001):\r\n\t\teq=(i-j)*(i+j-1)\r\n\t\tif eq==diff and (i*i+j)==n and (j*j+i)==m:\r\n\t\t\tans=ans+1\r\n\t\t\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Jon fought bravely to rescue the wildlings who were attacked by the white-walkers at Hardhome. On his arrival, Sam tells him that he wants to go to Oldtown to train at the Citadel to become a maester, so he can return and take the deceased Aemon's place as maester of Castle Black. Jon agrees to Sam's proposal and Sam sets off his journey to the Citadel. However becoming a trainee at the Citadel is not a cakewalk and hence the maesters at the Citadel gave Sam a problem to test his eligibility. \n\nInitially Sam has a list with a single element *n*. Then he has to perform certain operations on this list. In each operation Sam must remove any element *x*, such that *x*<=><=1, from the list and insert at the same position , , sequentially. He must continue with these operations until all the elements in the list are either 0 or 1.\n\nNow the masters want the total number of 1s in the range *l* to *r* (1-indexed). Sam wants to become a maester but unfortunately he cannot solve this problem. Can you help Sam to pass the eligibility test?",
"input": "",
"output": "```python\nn,l,r = map(int,input().split(' '))\nx = n\nlen = 0\ndef lon(c):\n if c > 0:\n return 1 + lon(c // 2) + lon(c // 2)\n else:\n return 0\nlen =lon(x)\n\ndef f(n,left,right):\n if right < l or left > r:\n return 0\n else:\n mid = (left + right) // 2\n if mid <= r and mid >= l:\n if n == 1:\n return 1\n else:\n return n % 2 + f(n // 2,left,mid - 1) + f(n // 2,mid + 1,right)\n elif mid > r:\n return 0 + f(n // 2,left,mid - 1)\n elif mid < l:\n return 0 + f(n // 2,mid + 1,right)\n\nprint(f(n,1,len))\n\t\t\t \t \t \t\t \t \t\t\t \t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp is working on a new project called \"Polychat\". Following modern tendencies in IT, he decided, that this project should contain chat as well. To achieve this goal, Polycarp has spent several hours in front of his laptop and implemented a chat server that can process three types of commands:\n - Include a person to the chat ('Add' command). - Remove a person from the chat ('Remove' command). - Send a message from a person to all people, who are currently in the chat, including the one, who sends the message ('Send' command). \nNow Polycarp wants to find out the amount of outgoing traffic that the server will produce while processing a particular set of commands.\n\nPolycarp knows that chat server sends no traffic for 'Add' and 'Remove' commands. When 'Send' command is processed, server sends *l* bytes to each participant of the chat, where *l* is the length of the message.\n\nAs Polycarp has no time, he is asking for your help in solving this problem.",
"input": "",
"output": "```python\nans = 0\ntry:\n\tn = 0\n\twhile True:\n\t\ts = input()\n\t\tif s[0] == '+':\n\t\t\tn += 1\n\t\telif s[0] == '-':\n\t\t\tn -= 1\n\t\telse:\n\t\t\tans += len(s.split(':')[1]) * n\nexcept:\n\tpass\nprint(ans)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little girl Tanya is learning how to decrease a number by one, but she does it wrong with a number consisting of two or more digits. Tanya subtracts one from a number by the following algorithm:\n - if the last digit of the number is non-zero, she decreases the number by one; - if the last digit of the number is zero, she divides the number by 10 (i.e. removes the last digit). \nYou are given an integer number $n$. Tanya will subtract one from it $k$ times. Your task is to print the result after all $k$ subtractions.\n\nIt is guaranteed that the result will be positive integer number.",
"input": "",
"output": "```python\n# for _ in range(int(input())):\r\nn,k = input().split()\r\nn = int(n)\r\nk=int(k)\r\nwhile k !=0:\r\n if n%10 >=k:\r\n n = n-k\r\n k=0\r\n elif n%10 ==0:\r\n n = n//10\r\n k -=1\r\n else:\r\n temp = n%10\r\n n -= temp\r\n k -=temp\r\n # print(n)\r\nprint(n)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Yaroslav has an array that consists of *n* integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring elements would be distinct in a finite time.\n\nHelp Yaroslav.",
"input": "",
"output": "```python\n\r\nn = int( input() )\r\n\r\na = list( map( int, input().strip().split( ' ' ) ) )\r\n\r\nm = max( set( a ), key=a.count )\r\nif (n == 1):\r\n print( \"YES\" )\r\nelif (m > n / 2):\r\n print( \"NO\" )\r\nelse:\r\n print( \"YES\" )\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A sequence *a*0,<=*a*1,<=...,<=*a**t*<=-<=1 is called increasing if *a**i*<=-<=1<=<<=*a**i* for each *i*:<=0<=<<=*i*<=<<=*t*.\n\nYou are given a sequence *b*0,<=*b*1,<=...,<=*b**n*<=-<=1 and a positive integer *d*. In each move you may choose one element of the given sequence and add *d* to it. What is the least number of moves required to make the given sequence increasing?",
"input": "",
"output": "```python\nn,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = 1\r\nfor i in range(1,n):\r\n if a[i] <= a[i-1]:\r\n ans += (a[i - 1] - a[i]) // d + 1\r\n a[i] = d*((a[i - 1] - a[i]) // d + 1)\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given *n* switches and *m* lamps. The *i*-th switch turns on some subset of the lamps. This information is given as the matrix *a* consisting of *n* rows and *m* columns where *a**i*,<=*j*<==<=1 if the *i*-th switch turns on the *j*-th lamp and *a**i*,<=*j*<==<=0 if the *i*-th switch is not connected to the *j*-th lamp.\n\nInitially all *m* lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all *n* switches then all *m* lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other *n*<=-<=1 switches then all the *m* lamps will be turned on.",
"input": "",
"output": "```python\ndef adding(a, b):\r\n res = \"\"\r\n tracker = True\r\n for i in range(len(a)):\r\n res += str(int(a[i]) + int(b[i]))\r\n if int(a[i]) == 0 and int(b[i]) == 1:\r\n tracker = False\r\n return res, tracker\r\n\r\nif __name__ == \"__main__\":\r\n n, m = list(map(int, input().rstrip().split()))\r\n \r\n switches = []\r\n \r\n while n > 0:\r\n switches.append(input().rstrip())\r\n n -= 1\r\n \r\n total = \"\" \r\n for i in range(m):\r\n total += \"0\"\r\n \r\n #print(total)\r\n #print(switches)\r\n \r\n tracker = False\r\n \r\n for i in range(len(switches)):\r\n total, tracker = adding(total, switches[i])\r\n \r\n #print(total)\r\n \r\n \r\n if tracker:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In the beginning of the new year Keivan decided to reverse his name. He doesn't like palindromes, so he changed Naviek to Navick.\n\nHe is too selfish, so for a given *n* he wants to obtain a string of *n* characters, each of which is either 'a', 'b' or 'c', with no palindromes of length 3 appearing in the string as a substring. For example, the strings \"abc\" and \"abca\" suit him, while the string \"aba\" doesn't. He also want the number of letters 'c' in his string to be as little as possible.",
"input": "",
"output": "```python\nimport random\r\nn = int(input()) # the length of the string\r\noptions = ['a', 'b', 'c']\r\noutput = []\r\n\r\ni = 0\r\n\r\nwhile len(output) < n:\r\n if i % 3 == 0:\r\n i = 0\r\n\r\n next = options[i]\r\n output.append(next)\r\n i += 1\r\n\r\nprint(\"\".join(output))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day shooshuns found a sequence of *n* integers, written on a blackboard. The shooshuns can perform one operation with it, the operation consists of two steps:\n 1. Find the number that goes *k*-th in the current sequence and add the same number to the end of the sequence; 1. Delete the first number of the current sequence. \nThe shooshuns wonder after how many operations all numbers on the board will be the same and whether all numbers will ever be the same.",
"input": "",
"output": "```python\nimport math\r\n\r\ndef input_list_int():\r\n return list(map(int, input().split()))\r\n\r\n\r\nn, _k = input_list_int()\r\na = input_list_int()\r\n\r\nk = _k - 1\r\n\r\ns = False\r\nel = a[k]\r\nfor i in range(k, n):\r\n if a[i] != el:\r\n print(-1)\r\n exit()\r\n\r\nj = 0\r\nfor i in range(k):\r\n if a[i] != a[k+1]:\r\n j = i\r\n\r\nprint(j+1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "This problem's actual name, \"Lexicographically Largest Palindromic Subsequence\" is too long to fit into the page headline.\n\nYou are given string *s* consisting of lowercase English letters only. Find its lexicographically largest palindromic subsequence.\n\nWe'll call a non-empty string *s*[*p*1*p*2... *p**k*] = *s**p*1*s**p*2... *s**p**k* (1 <=≤<= *p*1<=<<=*p*2<=<<=...<=<<=*p**k* <=≤<= |*s*|) a subsequence of string *s* = *s*1*s*2... *s*|*s*|, where |*s*| is the length of string *s*. For example, strings \"abcb\", \"b\" and \"abacaba\" are subsequences of string \"abacaba\".\n\nString *x* = *x*1*x*2... *x*|*x*| is lexicographically larger than string *y* = *y*1*y*2... *y*|*y*| if either |*x*| > |*y*| and *x*1<==<=*y*1, *x*2<==<=*y*2, ...,<=*x*|*y*|<==<=*y*|*y*|, or there exists such number *r* (*r*<=<<=|*x*|, *r*<=<<=|*y*|) that *x*1<==<=*y*1, *x*2<==<=*y*2, ..., *x**r*<==<=*y**r* and *x**r*<=<=+<=<=1<=><=*y**r*<=<=+<=<=1. Characters in the strings are compared according to their ASCII codes. For example, string \"ranger\" is lexicographically larger than string \"racecar\" and string \"poster\" is lexicographically larger than string \"post\".\n\nString *s* = *s*1*s*2... *s*|*s*| is a palindrome if it matches string *rev*(*s*) = *s*|*s*|*s*|*s*|<=-<=1... *s*1. In other words, a string is a palindrome if it reads the same way from left to right and from right to left. For example, palindromic strings are \"racecar\", \"refer\" and \"z\".",
"input": "",
"output": "```python\nans = \"\"\r\ns = input()\r\nfor m in range(1 << len(s)):\r\n f = \"\".join([s[i] for i in range(len(s)) if m & (1 << i)])\r\n if f == f[::-1]:\r\n ans = max(ans,f)\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The input contains a single integer *a* (0<=≤<=*a*<=≤<=35).\n\nOutput a single integer.",
"input": "",
"output": "```python\nn = int(input())\r\nprint(2 ** n if n < 35 else 33940307968)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) reversely. For example, a Berlandish word code corresponds to a Birlandish word edoc. However, it's easy to make a mistake during the «translation». Vasya translated word *s* from Berlandish into Birlandish as *t*. Help him: find out if he translated the word correctly.",
"input": "",
"output": "```python\ns=input()\nt=input()\nprint(\"YES\") if s[::-1]==t else print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number *a* and Antisimon receives number *b*. They also have a heap of *n* stones. The players take turns to make a move and Simon starts. During a move a player should take from the heap the number of stones equal to the greatest common divisor of the fixed number he has received and the number of stones left in the heap. A player loses when he cannot take the required number of stones (i. e. the heap has strictly less stones left than one needs to take). \n\nYour task is to determine by the given *a*, *b* and *n* who wins the game.",
"input": "",
"output": "```python\na, b, n = map(int, input().split())\r\n\r\n\r\nwhile n > 0:\r\n temp_a, temp_n = a, n\r\n\r\n while temp_n > 0:\r\n temp_a, temp_n = temp_n, temp_a % temp_n\r\n\r\n n -= temp_a\r\n\r\n if n > 0:\r\n temp_b, temp_n = b, n\r\n\r\n while temp_n > 0:\r\n temp_b, temp_n = temp_b, temp_b % temp_n\r\n\r\n n -= temp_b\r\n if n == 0:\r\n print(1)\r\n elif n < 0:\r\n print(0)\r\n elif n == 0:\r\n print(0)\r\n else:\r\n print(1)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Today Vasya visited a widely known site and learned that the continuation of his favourite game Codecraft II will appear after exactly *k* months. He looked at the calendar and learned that at the moment is the month number *s*. Vasya immediately got interested in what month Codecraft III will appear. Help him understand that.\n\nAll the twelve months in Vasya's calendar are named using their usual English names: January, February, March, April, May, June, July, August, September, October, November, December.",
"input": "",
"output": "```python\n#include\r\nusing namespace std;\r\n\r\nint main(void){\r\n string s;\r\n cin>>s;\r\n int k;\r\n cin>>k;\r\n mapm;\r\n m[\"January\"]=1;\r\n m[\"February\"]=2;\r\n m[\"March\"]=3;\r\n m[\"April\"]=4;\r\n m[\"May\"]=5;\r\n m[\"June\"]=6;\r\n m[\"July\"]=7;\r\n m[\"August\"]=8;\r\n m[\"September\"]=9;\r\n m[\"October\"]=10;\r\n m[\"November\"]=11;\r\n m[\"December\"]=12;\r\n int y;\r\n int z;\r\n for(auto x:m){\r\n if(x.first==s){\r\n y=x.second+k;\r\n z=y%12;\r\n }\r\n }\r\n for(auto y:m){\r\n if(y.second==z){\r\n cout<=0\r\nc1,c2,x,y=map(int,input().strip().split())\r\n\r\nlo=1\r\nhi=10**9\r\nans=-1\r\nwhile lo<=hi:\r\n mid=(lo+hi)//2\r\n if check(mid,c1,c2,x,y):\r\n hi=mid-1\r\n ans=mid\r\n else:\r\n lo=mid+1\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "ZS the Coder is coding on a crazy computer. If you don't type in a word for a *c* consecutive seconds, everything you typed disappear! \n\nMore formally, if you typed a word at second *a* and then the next word at second *b*, then if *b*<=-<=*a*<=≤<=*c*, just the new word is appended to other words on the screen. If *b*<=-<=*a*<=><=*c*, then everything on the screen disappears and after that the word you have typed appears on the screen.\n\nFor example, if *c*<==<=5 and you typed words at seconds 1,<=3,<=8,<=14,<=19,<=20 then at the second 8 there will be 3 words on the screen. After that, everything disappears at the second 13 because nothing was typed. At the seconds 14 and 19 another two words are typed, and finally, at the second 20, one more word is typed, and a total of 3 words remain on the screen.\n\nYou're given the times when ZS the Coder typed the words. Determine how many words remain on the screen after he finished typing everything.",
"input": "",
"output": "```python\nn,c=map(int,input().split())\r\nsum=1\r\nwords=list(map(int,input().split()))\r\nfor k in range(1,n):\r\n if words[k]-words[k-1]<=c:\r\n sum+=1\r\n else:\r\n sum=1\r\nprint(sum)\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Your security guard friend recently got a new job at a new security company. The company requires him to patrol an area of the city encompassing exactly *N* city blocks, but they let him choose which blocks. That is, your friend must walk the perimeter of a region whose area is exactly *N* blocks. Your friend is quite lazy and would like your help to find the shortest possible route that meets the requirements. The city is laid out in a square grid pattern, and is large enough that for the sake of the problem it can be considered infinite.",
"input": "",
"output": "```python\n#http://codeforces.com/problemset/problem/859/B\r\n\r\n#not done\r\n\r\nimport math\r\n\r\ndef GCD(a,b):\r\n #print(a,b)\r\n if a < b:\r\n a, b = b, a\r\n if a%b == 0:\r\n return b\r\n else:\r\n return GCD(b,a%b)\r\n\r\ndef minLengthsCall(n):\r\n RA = minLengths(n)\r\n #if len(RA) > 2:\r\n #RA.pop()\r\n return RA\r\n\r\ndef minLengths(n):\r\n #print(n)\r\n if n <= 0:\r\n return []\r\n has = n\r\n while has > n//2:\r\n if math.sqrt(has)%1 == 0:\r\n if has == n:\r\n return [int(math.sqrt(has)),int(math.sqrt(has))]\r\n else:\r\n return [int(math.sqrt(has)),int(math.sqrt(has))]+minLengths(n-has)\r\n has -= 1\r\n else:\r\n maxVol = 1*n\r\n pos = [1,n]\r\n #print(pos)\r\n for i in range(1,n+1):\r\n if i*(n-i) > maxVol:\r\n #print(\"HERE\")\r\n maxVol = i*(n-i)\r\n pos = [i,n-i]\r\n return pos\r\n #RA = [int(math.sqrt(n)),int(math.sqrt(n))]+minLengths(n-int(math.sqrt(n))**2)\r\n #return RA\r\n x = 0\r\n\r\ndef minStreets(n):\r\n lengths = minLengthsCall(n)\r\n streets = []\r\n i = 0\r\n while i < len(lengths):\r\n #print(lengths[i],lengths[i+1])\r\n streets.append(2*lengths[i]+2*lengths[i+1])\r\n i += 2\r\n i = 0\r\n j = 2\r\n total = 0\r\n if len(streets) == 1:\r\n return streets[0]\r\n currentStreets = 2*lengths[0]+2*lengths[1]\r\n if streets[0] > streets[1]:\r\n maxW = streets[0]\r\n else:\r\n maxW = streets[1]\r\n #print((lengths))\r\n del lengths[0]\r\n del lengths[0]\r\n currentW = 0\r\n while len(lengths) > 0:\r\n if lengths[0] > lengths[1]:\r\n addW = lengths[0]\r\n width = lengths[0]\r\n height = lengths[1]\r\n else:\r\n addW = lengths[1]\r\n width = lengths[1]\r\n height = lengths[0]\r\n #print(currentStreets,height)\r\n if currentW == 0:\r\n currentStreets += 2*height\r\n currentW = addW\r\n elif addW + currentW <= maxW:\r\n currentStreets += 0\r\n currentW += addW\r\n if currentW > maxW:\r\n currentW = 0\r\n else:\r\n currentStreets += height\r\n currentW += addW\r\n if currentW > maxWL:\r\n currentW = 0\r\n del lengths[0]\r\n del lengths[0]\r\n return currentStreets\r\n \r\nwhile True:\r\n try:\r\n case = input()\r\n temp = int(case)\r\n print(minStreets(temp))\r\n except EOFError:\r\n break\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasily the bear has a favorite rectangle, it has one vertex at point (0,<=0), and the opposite vertex at point (*x*,<=*y*). Of course, the sides of Vasya's favorite rectangle are parallel to the coordinate axes. \n\nVasya also loves triangles, if the triangles have one vertex at point *B*<==<=(0,<=0). That's why today he asks you to find two points *A*<==<=(*x*1,<=*y*1) and *C*<==<=(*x*2,<=*y*2), such that the following conditions hold:\n - the coordinates of points: *x*1, *x*2, *y*1, *y*2 are integers. Besides, the following inequation holds: *x*1<=<<=*x*2; - the triangle formed by point *A*, *B* and *C* is rectangular and isosceles ( is right); - all points of the favorite rectangle are located inside or on the border of triangle *ABC*; - the area of triangle *ABC* is as small as possible. \nHelp the bear, find the required points. It is not so hard to proof that these points are unique.",
"input": "",
"output": "```python\n# coding: utf-8\nx, y = [int(i) for i in input().split()]\nlength = abs(x)+abs(y)\nans = []\nif x < 0:\n ans.append([-length,0])\nelse:\n ans.append([length,0])\nif y < 0:\n ans.append([0,-length])\nelse:\n ans.append([0,length])\nans.sort()\nprint(ans[0][0],ans[0][1],ans[1][0],ans[1][1])\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "DZY loves chessboard, and he enjoys playing with it.\n\nHe has a chessboard of *n* rows and *m* columns. Some cells of the chessboard are bad, others are good. For every good cell, DZY wants to put a chessman on it. Each chessman is either white or black. After putting all chessmen, DZY wants that no two chessmen with the same color are on two adjacent cells. Two cells are adjacent if and only if they share a common edge.\n\nYou task is to find any suitable placement of chessmen on the given chessboard.",
"input": "",
"output": "```python\nvalues = input().split()\r\nrows = int(values[0])\r\ncols = int(values[1])\r\n\r\nchessboard = []\r\nfor i in range(rows):\r\n row = []\r\n for j in range(cols):\r\n if i % 2 == 0:\r\n if j % 2 == 0:\r\n row.append('B')\r\n else:\r\n row.append('W')\r\n else:\r\n if j % 2 == 0:\r\n row.append('W')\r\n else:\r\n row.append('B')\r\n chessboard.append(row)\r\n\r\nfor i in range(rows):\r\n row = input()\r\n for j in range(cols):\r\n if row[j] == '-':\r\n chessboard[i][j] = '-'\r\n\r\nfor i in range(rows):\r\n for j in range(cols):\r\n print(chessboard[i][j], end = \"\")\r\n print()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little boy Valera studies an algorithm of sorting an integer array. After studying the theory, he went on to the practical tasks. As a result, he wrote a program that sorts an array of *n* integers *a*1,<=*a*2,<=...,<=*a**n* in the non-decreasing order. The pseudocode of the program, written by Valera, is given below. The input of the program gets number *n* and array *a*.\n\nBut Valera could have made a mistake, because he hasn't yet fully learned the sorting algorithm. If Valera made a mistake in his program, you need to give a counter-example that makes his program work improperly (that is, the example that makes the program sort the array not in the non-decreasing order). If such example for the given value of *n* doesn't exist, print -1.",
"input": "",
"output": "```python\nn = int(input())\nif n < 3:\n print(-1)\nelse:\n print(2, 2, *([1] * (n-2)))\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You're given a string of lower-case Latin letters. Your task is to find the length of its longest substring that can be met in the string at least twice. These occurrences can overlap (see sample test 2).",
"input": "",
"output": "```python\ns=input()\r\no=len(s)\r\nk=0\r\nfor i in range(o):\r\n r={0}\r\n for j in range(o-i+1):\r\n if s[j:j+i] in r:k=max(i,k)\r\n else:r.add(s[j:j+i])\r\nprint(k)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "While Mike was walking in the subway, all the stuff in his back-bag dropped on the ground. There were several fax messages among them. He concatenated these strings in some order and now he has string *s*.\n\nHe is not sure if this is his own back-bag or someone else's. He remembered that there were exactly *k* messages in his own bag, each was a palindrome string and all those strings had the same length.\n\nHe asked you to help him and tell him if he has worn his own back-bag. Check if the given string *s* is a concatenation of *k* palindromes of the same length.",
"input": "",
"output": "```python\ntar = input()\r\nk = int(input())\r\nn = len(tar)\r\nall = []\r\nans = True\r\nfor i in range(0,k):\r\n\tall.append(tar[int(i*n/k):int((i+1)*(n/k))])\r\n\t# print(all[i])\r\n\tx = int(n/k/2)\r\n\t# print(all[i][0:x])\r\n\t# print(all[i][x:x*2][::-1])\r\n\tans &= (all[i][0:x] == all[i][x:x*2][::-1])\r\nif ans:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You will receive 3 points for solving this problem.\n\nManao is designing the genetic code for a new type of algae to efficiently produce fuel. Specifically, Manao is focusing on a stretch of DNA that encodes one protein. The stretch of DNA is represented by a string containing only the characters 'A', 'T', 'G' and 'C'.\n\nManao has determined that if the stretch of DNA contains a maximal sequence of consecutive identical nucleotides that is of even length, then the protein will be nonfunctional. For example, consider a protein described by DNA string \"GTTAAAG\". It contains four maximal sequences of consecutive identical nucleotides: \"G\", \"TT\", \"AAA\", and \"G\". The protein is nonfunctional because sequence \"TT\" has even length.\n\nManao is trying to obtain a functional protein from the protein he currently has. Manao can insert additional nucleotides into the DNA stretch. Each additional nucleotide is a character from the set {'A', 'T', 'G', 'C'}. Manao wants to determine the minimum number of insertions necessary to make the DNA encode a functional protein.",
"input": "",
"output": "```python\ns=input()\r\nl=len(s)\r\nans=0\r\ni=0\r\nwhile i odd else '0') + 1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has a non-negative integer *n*. He wants to round it to nearest integer, which ends up with 0. If *n* already ends up with 0, Vasya considers it already rounded.\n\nFor example, if *n*<==<=4722 answer is 4720. If *n*<==<=5 Vasya can round it to 0 or to 10. Both ways are correct.\n\nFor given *n* find out to which integer will Vasya round it.",
"input": "",
"output": "```python\nn=int(input())\r\na=n%10\r\nif a<=5:\r\n print(n-a)\r\nelse:\r\n print(n+(10-a))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:\n\n In any right-angled triangle, the area of the square whose side is the hypotenuse (the side opposite the right angle) is equal to the sum of the areas of the squares whose sides are the two legs (the two sides that meet at a right angle). \n\nThe theorem can be written as an equation relating the lengths of the sides *a*, *b* and *c*, often called the Pythagorean equation:\n\nwhere *c* represents the length of the hypotenuse, and *a* and *b* represent the lengths of the other two sides.\n\nGiven *n*, your task is to count how many right-angled triangles with side-lengths *a*, *b* and *c* that satisfied an inequality 1<=≤<=*a*<=≤<=*b*<=≤<=*c*<=≤<=*n*.",
"input": "",
"output": "```python\nfrom math import ceil,sqrt\r\nn=int(input())\r\namt=0\r\nfor a in range(1,n+1):\r\n for b in range(a,n+1):\r\n if (sqrt(a**2+b**2))==ceil((sqrt(a**2+b**2))) and (sqrt(a**2+b**2))<=n:\r\n amt+=1\r\nprint(amt) \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A big company decided to launch a new series of rectangular displays, and decided that the display must have exactly *n* pixels. \n\nYour task is to determine the size of the rectangular display — the number of lines (rows) of pixels *a* and the number of columns of pixels *b*, so that:\n - there are exactly *n* pixels on the display; - the number of rows does not exceed the number of columns, it means *a*<=≤<=*b*; - the difference *b*<=-<=*a* is as small as possible.",
"input": "",
"output": "```python\nn=int(input())\r\ndmin=100000000\r\na=0\r\nb=0\r\nfor i in range(1,n+1,1):\r\n\tfor k in range(1,n+1,1):\r\n\t\tj=k\r\n\t\t#print(i,j,sep=\" \")\r\n\t\tif i*j==n:\r\n\t\t\t#print(i,j,sep=\" \")\r\n\r\n\t\t\tif i<=j:\r\n\t\t\t\t#print(i,j,sep=\" \")\r\n\r\n\t\t\t\tminn=j-i\r\n\t\t\t\tif minn x_now:\r\n if x_now + step_size > x:\r\n x_now -= step_size\r\n else:\r\n x_now += step_size\r\n else:\r\n if x_now - step_size < x:\r\n x_now += step_size\r\n else:\r\n x_now -= step_size\r\n\r\n step_num += 1\r\n step_size += 1\r\n\r\nprint(step_num)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are three friend living on the straight line *Ox* in Lineland. The first friend lives at the point *x*1, the second friend lives at the point *x*2, and the third friend lives at the point *x*3. They plan to celebrate the New Year together, so they need to meet at one point. What is the minimum total distance they have to travel in order to meet at some point and celebrate the New Year?\n\nIt's guaranteed that the optimal answer is always integer.",
"input": "",
"output": "```python\n\ninput_str = input(\"Enter space-separated integers: \")\n\n\ninput_list = list(map(int, input_str.split()))\n\nmax_value = max(input_list)\nmin_value = min(input_list)\n\ndifference = max_value - min_value\n\nprint(\"The difference between the maximum and minimum values is:\", difference)\n\n\t\t\t \t\t\t \t \t\t \t \t \t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\nm, n = map(int, input().split())\r\nprint(m * (n - (n%2))//2 + (n%2) * m//2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Iahub got bored, so he invented a game to be played on paper. \n\nHe writes *n* integers *a*1,<=*a*2,<=...,<=*a**n*. Each of those integers can be either 0 or 1. He's allowed to do exactly one move: he chooses two indices *i* and *j* (1<=≤<=*i*<=≤<=*j*<=≤<=*n*) and flips all values *a**k* for which their positions are in range [*i*,<=*j*] (that is *i*<=≤<=*k*<=≤<=*j*). Flip the value of *x* means to apply operation *x*<==<=1 - *x*.\n\nThe goal of the game is that after exactly one move to obtain the maximum number of ones. Write a program to solve the little game of Iahub.",
"input": "",
"output": "```python\nn = int(input())\r\nlis = list(map(int, input().split()))\r\ncnt = 0\r\nmx = 0\r\nmxx = 0\r\nfor i in lis:\r\n if i == 1:\r\n cnt += 1\r\n if mx:\r\n mx -= 1\r\n else:\r\n mx += 1\r\n mxx = max(mx, mxx)\r\nprint(cnt + mxx)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "This task is very simple. Given a string *S* of length *n* and *q* queries each query is on the format *i* *j* *k* which means sort the substring consisting of the characters from *i* to *j* in non-decreasing order if *k*<==<=1 or in non-increasing order if *k*<==<=0.\n\nOutput the final string after applying the queries.",
"input": "",
"output": "```python\nstrLength, n = list(map(int, input().split()))\ninputString = input()\n\nfor i in range(n):\n start, end, method = list(map(int, input().split()))\n\n firstPart = inputString[:start - 1]\n lastPart = inputString[end:]\n\n mainPart = inputString[start -1: end]\n\n if method == 1:\n reverseOrder = 0\n else:\n reverseOrder = 1\n\n mainPart = ''.join(sorted(list(mainPart), reverse=reverseOrder))\n\n inputString = firstPart + mainPart + lastPart\n\n\n\nprint(inputString)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "\"QAQ\" is a word to denote an expression of crying. Imagine \"Q\" as eyes with tears and \"A\" as a mouth.\n\nNow Diamond has given Bort a string consisting of only uppercase English letters of length *n*. There is a great number of \"QAQ\" in the string (Diamond is so cute!).\n\nBort wants to know how many subsequences \"QAQ\" are in the string Diamond has given. Note that the letters \"QAQ\" don't have to be consecutive, but the order of letters should be exact.",
"input": "",
"output": "```python\ns = input()\r\nc = 0\r\nfirst_q_count = 0\r\nlast_q_count = s.count(\"Q\")\r\nfor i in range(len(s)):\r\n char = s[i]\r\n if char == \"Q\":\r\n first_q_count += 1\r\n last_q_count -= 1\r\n if char == \"A\":\r\n c += first_q_count * last_q_count\r\nprint(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "What joy! Petya's parents went on a business trip for the whole year and the playful kid is left all by himself. Petya got absolutely happy. He jumped on the bed and threw pillows all day long, until... \n\nToday Petya opened the cupboard and found a scary note there. His parents had left him with duties: he should water their favourite flower all year, each day, in the morning, in the afternoon and in the evening. \"Wait a second!\" — thought Petya. He know for a fact that if he fulfills the parents' task in the *i*-th (1<=≤<=*i*<=≤<=12) month of the year, then the flower will grow by *a**i* centimeters, and if he doesn't water the flower in the *i*-th month, then the flower won't grow this month. Petya also knows that try as he might, his parents won't believe that he has been watering the flower if it grows strictly less than by *k* centimeters. \n\nHelp Petya choose the minimum number of months when he will water the flower, given that the flower should grow no less than by *k* centimeters.",
"input": "",
"output": "```python\nlength = int(input())\r\nmonth = list(map(int, input().split()))\r\nmonth.sort(reverse=True)\r\nbig = month[0]\r\ndays = 1\r\nif length == 0:\r\n print(0)\r\n exit()\r\nfor i in range(1, 12):\r\n if big >= length:\r\n break\r\n else:\r\n big += month[i]\r\n days += 1\r\n\r\n\r\nif big >= length:\r\n print(days)\r\nelse:\r\n print(-1)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Given an array *a*1,<=*a*2,<=...,<=*a**n* of *n* integers, find the largest number in the array that is not a perfect square.\n\nA number *x* is said to be a perfect square if there exists an integer *y* such that *x*<==<=*y*2.",
"input": "",
"output": "```python\ndef isPerfect(num):\r\n cnt = 0\r\n for i in range(2,num):\r\n if num%i==0:\r\n cnt += 1\r\n if cnt%2==0:\r\n return False\r\n else:\r\n return True\r\n\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\ndata.sort(reverse=True)\r\n\r\nfor num in data:\r\n if not isPerfect(num):\r\n print(num)\r\n break\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Santa Claus decided to disassemble his keyboard to clean it. After he returned all the keys back, he suddenly realized that some pairs of keys took each other's place! That is, Santa suspects that each key is either on its place, or on the place of another key, which is located exactly where the first key should be. \n\nIn order to make sure that he's right and restore the correct order of keys, Santa typed his favorite patter looking only to his keyboard.\n\nYou are given the Santa's favorite patter and the string he actually typed. Determine which pairs of keys could be mixed. Each key must occur in pairs at most once.",
"input": "",
"output": "```python\np = input()\ntec = input()\n\nres = {}\n\nfudeu = 0\n\nfor i in range(len(p)):\n\n\tif p[i] != tec[i]:\n\t\tif p[i] in res:\n\t\t\tif res[p[i]] != tec[i]:\n\t\t\t\tfudeu=1\n\t\telif tec[i] in res:\n\t\t\tif res[tec[i]] != p[i]:\n\t\t\t\tfudeu = 1\n\t\telse:\n\t\t\tres[p[i]] = tec[i]\n\n\nif fudeu == 0:\n\tprint(len(res))\n\tfor i in res:\n\t\tprint(i,res[i])\nelse:\n\tprint(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given *n* segments on the Ox-axis. You can drive a nail in any integer point on the Ox-axis line nail so, that all segments containing this point, are considered nailed down. If the nail passes through endpoint of some segment, this segment is considered to be nailed too. What is the smallest number of nails needed to nail all the segments down?",
"input": "",
"output": "```python\nn=int(input())\r\nc=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if x>y: x,y=y,x\r\n c.append([x,0,i])\r\n c.append([y,1,i])\r\nc.sort()\r\nans=0\r\nstack=[]\r\nb=[]\r\nfor z in c:\r\n if z[1]==0:\r\n stack.append(z[2])\r\n else:\r\n if z[2] in stack:\r\n ans+=1\r\n b.append(z[0])\r\n stack=[]\r\nprint(ans)\r\nprint(*b)\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Cucumber boy is fan of Kyubeat, a famous music game.\n\nKyubeat has 16 panels for playing arranged in 4<=×<=4 table. When a panel lights up, he has to press that panel.\n\nEach panel has a timing to press (the preffered time when a player should press it), and Cucumber boy is able to press at most *k* panels in a time with his one hand. Cucumber boy is trying to press all panels in perfect timing, that is he wants to press each panel exactly in its preffered time. If he cannot press the panels with his two hands in perfect timing, his challenge to press all the panels in perfect timing will fail.\n\nYou are given one scene of Kyubeat's panel from the music Cucumber boy is trying. Tell him is he able to press all the panels in perfect timing.",
"input": "",
"output": "```python\nk = int(input())\r\nd={}\r\nt=[]\r\nfor i in range(10):\r\n d[i]=0\r\nfor i in range(4):\r\n arr=input()\r\n t.append(arr)\r\nfor i in range(4):\r\n for j in range(4):\r\n if t[i][j]==\".\":\r\n continue\r\n else:\r\n d[int(t[i][j])]+=1\r\nfor i in range(9):\r\n if d[i]>2*k:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Patrick has just finished writing a message to his sweetheart Stacey when he noticed that the message didn't look fancy. Patrick was nervous while writing the message, so some of the letters there were lowercase and some of them were uppercase.\n\nPatrick believes that a message is fancy if any uppercase letter stands to the left of any lowercase one. In other words, this rule describes the strings where first go zero or more uppercase letters, and then — zero or more lowercase letters.\n\nTo make the message fancy, Patrick can erase some letter and add the same letter in the same place in the opposite case (that is, he can replace an uppercase letter with the lowercase one and vice versa). Patrick got interested in the following question: what minimum number of actions do we need to make a message fancy? Changing a letter's case in the message counts as one action. Patrick cannot perform any other actions.",
"input": "",
"output": "```python\ndef min_changes(s: str) -> int:\n n = len(s)\n dp = [0] * (n + 1)\n for i in range(1, n + 1):\n if s[i - 1].isupper():\n dp[i] = dp[i - 1]\n else:\n dp[i] = min(dp[i - 1] + 1, sum(1 for c in s if c.isupper()))\n return dp[n]\n\ns = input().strip()\nprint(min_changes(s))\n \t \t \t \t \t\t \t \t\t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp has created his own training plan to prepare for the programming contests. He will train for $n$ days, all days are numbered from $1$ to $n$, beginning from the first.\n\nOn the $i$-th day Polycarp will necessarily solve $a_i$ problems. One evening Polycarp plans to celebrate the equator. He will celebrate it on the first evening of such a day that from the beginning of the training and to this day inclusive he will solve half or more of all the problems.\n\nDetermine the index of day when Polycarp will celebrate the equator.",
"input": "",
"output": "```python\nn=int(input())\r\na=list(map(int,input().split()))\r\ns=sum(a)/2\r\nss=0\r\nfor i in range(n):\r\n ss+=a[i]\r\n if(ss>=s):\r\n print(i+1)\r\n break\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mishka started participating in a programming contest. There are $n$ problems in the contest. Mishka's problem-solving skill is equal to $k$.\n\nMishka arranges all problems from the contest into a list. Because of his weird principles, Mishka only solves problems from one of the ends of the list. Every time, he chooses which end (left or right) he will solve the next problem from. Thus, each problem Mishka solves is either the leftmost or the rightmost problem in the list.\n\nMishka cannot solve a problem with difficulty greater than $k$. When Mishka solves the problem, it disappears from the list, so the length of the list decreases by $1$. Mishka stops when he is unable to solve any problem from any end of the list.\n\nHow many problems can Mishka solve?",
"input": "",
"output": "```python\nn, k = map(int, input().split())\r\nls = list(map(int, input().split()))\r\ncount = 0\r\nwhile len(ls) > 0:\r\n if ls[0] <= k:\r\n count+=1\r\n ls.pop(0)\r\n else: break\r\nwhile len(ls) > 0:\r\n if ls[len(ls)-1] <= k:\r\n count+=1\r\n ls.pop(len(ls)-1)\r\n else: break\r\n\r\nprint(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vladik often travels by trains. He remembered some of his trips especially well and I would like to tell you about one of these trips:\n\nVladik is at initial train station, and now *n* people (including Vladik) want to get on the train. They are already lined up in some order, and for each of them the city code *a**i* is known (the code of the city in which they are going to).\n\nTrain chief selects some number of disjoint segments of the original sequence of people (covering entire sequence by segments is not necessary). People who are in the same segment will be in the same train carriage. The segments are selected in such way that if at least one person travels to the city *x*, then all people who are going to city *x* should be in the same railway carriage. This means that they can’t belong to different segments. Note, that all people who travel to the city *x*, either go to it and in the same railway carriage, or do not go anywhere at all.\n\nComfort of a train trip with people on segment from position *l* to position *r* is equal to XOR of all distinct codes of cities for people on the segment from position *l* to position *r*. XOR operation also known as exclusive OR.\n\nTotal comfort of a train trip is equal to sum of comfort for each segment.\n\nHelp Vladik to know maximal possible total comfort.",
"input": "",
"output": "```python\nn = int(input())\r\na = list(map(int,input().split()))\r\ndl = dict()\r\ndr = dict()\r\nfor i in range(n):\r\n if a[i] not in dl:\r\n dl[a[i]] = i\r\n dr[a[i]] = i\r\ndef XOR(l):\r\n c = list(set(l))\r\n k = len(c)\r\n x = c[0]\r\n for i in range(1,k):\r\n x ^= c[i]\r\n return x\r\nfrom collections import defaultdict\r\nDP = defaultdict(int)\r\nfor i in range(n):\r\n if dr[a[i]] > i:\r\n DP[i] = DP[i-1]\r\n else:\r\n k = dl[a[i]]\r\n xor = XOR(a[k:i+1])\r\n DP[i] = max(DP[i-1],DP[k-1]+xor)\r\n for j in range(k-1,-1,-1):\r\n if dl[a[j]] == j and dr[a[j]] <= i:\r\n xor ^= a[j]\r\n DP[i] = max(DP[i],DP[j-1] + xor)\r\nprint(DP[n-1])\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "This problem's actual name, \"Lexicographically Largest Palindromic Subsequence\" is too long to fit into the page headline.\n\nYou are given string *s* consisting of lowercase English letters only. Find its lexicographically largest palindromic subsequence.\n\nWe'll call a non-empty string *s*[*p*1*p*2... *p**k*] = *s**p*1*s**p*2... *s**p**k* (1 <=≤<= *p*1<=<<=*p*2<=<<=...<=<<=*p**k* <=≤<= |*s*|) a subsequence of string *s* = *s*1*s*2... *s*|*s*|, where |*s*| is the length of string *s*. For example, strings \"abcb\", \"b\" and \"abacaba\" are subsequences of string \"abacaba\".\n\nString *x* = *x*1*x*2... *x*|*x*| is lexicographically larger than string *y* = *y*1*y*2... *y*|*y*| if either |*x*| > |*y*| and *x*1<==<=*y*1, *x*2<==<=*y*2, ...,<=*x*|*y*|<==<=*y*|*y*|, or there exists such number *r* (*r*<=<<=|*x*|, *r*<=<<=|*y*|) that *x*1<==<=*y*1, *x*2<==<=*y*2, ..., *x**r*<==<=*y**r* and *x**r*<=<=+<=<=1<=><=*y**r*<=<=+<=<=1. Characters in the strings are compared according to their ASCII codes. For example, string \"ranger\" is lexicographically larger than string \"racecar\" and string \"poster\" is lexicographically larger than string \"post\".\n\nString *s* = *s*1*s*2... *s*|*s*| is a palindrome if it matches string *rev*(*s*) = *s*|*s*|*s*|*s*|<=-<=1... *s*1. In other words, a string is a palindrome if it reads the same way from left to right and from right to left. For example, palindromic strings are \"racecar\", \"refer\" and \"z\".",
"input": "",
"output": "```python\ns=input()\r\nm=max(s)\r\nwhile s.count(max(s))==1:\r\n s.remove(max(s))\r\n if s==\"\":\r\n break\r\nif s==\"\":\r\n print(m)\r\nelse:\r\n print(max(s)*s.count(max(s)))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.\n\nA tree is a connected acyclic graph. A bipartite graph is a graph, whose vertices can be partitioned into 2 sets in such a way, that for each edge (*u*,<=*v*) that belongs to the graph, *u* and *v* belong to different sets. You can find more formal definitions of a tree and a bipartite graph in the notes section below.\n\nDr. Evil gave Mahmoud and Ehab a tree consisting of *n* nodes and asked them to add edges to it in such a way, that the graph is still bipartite. Besides, after adding these edges the graph should be simple (doesn't contain loops or multiple edges). What is the maximum number of edges they can add?\n\nA loop is an edge, which connects a node with itself. Graph doesn't contain multiple edges when for each pair of nodes there is no more than one edge between them. A cycle and a loop aren't the same .",
"input": "",
"output": "```python\nimport pprint\r\n\r\nclass Bipartite_Graph:\r\n\r\n def __init__(self):\r\n self.graph={\r\n # 1:[2,4,3],\r\n # 2:[1,3,5],\r\n # 3:[2,4,1],\r\n # 4:[5,3,1],\r\n # 5:[4,2]\r\n }\r\n self.vis=set()\r\n self.colored={}\r\n self.bipartite=True\r\n \r\n\r\n def add_edge(self,a,b): \r\n if(not a in self.graph):\r\n self.graph[a] = set()\r\n if(not b in self.graph):\r\n self.graph[b] = set()\r\n\r\n self.graph[a].add(b)\r\n self.graph[b].add(a)\r\n\r\n\r\n def del_edge(self, a, b): #if not making bipartiness then delete\r\n self.graph[a].remove(b)\r\n self.graph[b].remove(a)\r\n\r\n\r\n def dfs_util(self,v,visited,color=1):\r\n # print(v)\r\n visited.add(v)\r\n self.vis=visited\r\n\r\n if(v in self.colored and self.colored[v]!=color):\r\n self.bipartite=False\r\n return False\r\n\r\n self.colored[v]=color\r\n\r\n for neighbour in self.graph[v]:\r\n if neighbour not in visited:\r\n self.dfs_util(neighbour,visited,color*-1)\r\n else:\r\n if(self.colored[neighbour]==color): #if parent and child have the same color \r\n self.bipartite=False\r\n return False\r\n\r\n\r\n def dfs(self): #handling disconnected graph DFS\r\n visited = set()\r\n self.vis=set()\r\n\r\n for vertex in self.graph:\r\n if vertex not in visited:\r\n self.dfs_util(vertex, visited)\r\n \r\n\r\n\r\n\r\nN=int(input())\r\narr=[int(x) for x in range(1,N+1)]\r\n\r\nedges={}\r\n\r\nfor i in range(N-1): #making all the possible edges regardless of bipartiness\r\n for j in range(i+1,N):\r\n a,b=arr[i],arr[j]\r\n key=str(a)+str(b)\r\n edges[key]=[a,b]\r\n\r\n\r\n# pprint.pprint(edges)\r\n# #creating object of the class\r\nGraph=Bipartite_Graph() \r\n\r\nfor i in range(N-1): #adding edges\r\n a,b=[int(x) for x in input().split()]\r\n Graph.add_edge(a,b)\r\n\r\n# # #remove from the edges dictionary\r\n key=str(a)+str(b)\r\n if(key in edges):\r\n del edges[key]\r\n\r\n\r\nGraph.dfs()\r\n\r\nprint(Graph.graph)\r\nprint(Graph.colored)\r\n\r\ncount=0\r\n\r\nfor edge in edges:\r\n a=int(edge[0])\r\n b=int(edge[1])\r\n\r\n if(Graph.colored[a]!=Graph.colored[b]):\r\n # print(a,b)\r\n count+=1\r\nprint(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In a Berland's zoo there is an enclosure with camels. It is known that camels like to spit. Bob watched these interesting animals for the whole day and registered in his notepad where each animal spitted. Now he wants to know if in the zoo there are two camels, which spitted at each other. Help him to solve this task.\n\nThe trajectory of a camel's spit is an arc, i.e. if the camel in position *x* spits *d* meters right, he can hit only the camel in position *x*<=+<=*d*, if such a camel exists.",
"input": "",
"output": "```python\nn=int(input())\r\nX=set()\r\nXD=set()\r\nfor i in range(n):\r\n x,d=list(map(int,input().split(' ')))\r\n X.add(x)\r\n XD.add(x+d)\r\nif X&XD: print('YES')\r\nelse: print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular cake, represented as an *r*<=×<=*c* grid. Each cell either has an evil strawberry, or is empty. For example, a 3<=×<=4 cake may look as follows:\n\nThe cakeminator is going to eat the cake! Each time he eats, he chooses a row or a column that does not contain any evil strawberries and contains at least one cake cell that has not been eaten before, and eats all the cake cells there. He may decide to eat any number of times.\n\nPlease output the maximum number of cake cells that the cakeminator can eat.",
"input": "",
"output": "```python\nr, c = map(int, input().split())\r\n\r\ncake = []\r\nfor i in range(r):\r\n row = input()\r\n cake.append(list(row))\r\n\r\nrow_count = 0\r\ncol_count = 0\r\n\r\nfor i in range(r):\r\n has_strawberry = False\r\n for j in range(c):\r\n if cake[i][j] == 'S':\r\n has_strawberry = True\r\n break\r\n if not has_strawberry:\r\n row_count += 1\r\n\r\nfor j in range(c):\r\n has_strawberry = False\r\n for i in range(r):\r\n if cake[i][j] == 'S':\r\n has_strawberry = True\r\n break\r\n if not has_strawberry:\r\n col_count += 1\r\n\r\nmax_cells = row_count * c + col_count * (r - row_count)\r\nprint(max_cells)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The nation of Panel holds an annual show called The Number Games, where each district in the nation will be represented by one contestant.\n\nThe nation has $n$ districts numbered from $1$ to $n$, each district has exactly one path connecting it to every other district. The number of fans of a contestant from district $i$ is equal to $2^i$.\n\nThis year, the president decided to reduce the costs. He wants to remove $k$ contestants from the games. However, the districts of the removed contestants will be furious and will not allow anyone to cross through their districts. \n\nThe president wants to ensure that all remaining contestants are from districts that can be reached from one another. He also wishes to maximize the total number of fans of the participating contestants.\n\nWhich contestants should the president remove?",
"input": "",
"output": "```python\nfrom typing import *\n\nV = TypeVar(\"V\")\nclass graph:\n vertices:List[V]\n graphDict:Dict[V,Set[V]]\n def __init__(self,vertices,graphDict):\n self.vertices = vertices\n self.graphDict = graphDict\n\n for v in vertices:\n if not v in self.graphDict:\n self.graphDict[v] = set()\n\n def isEdge(self,a:V,b:V):\n return b in self.graphDict[a]\n\n def neighbours(self,a:V)->List[V]:\n return self.graphDict.get(a,[])\n\n def appendEdge(self,a:V,b:V):\n assert not self.isEdge(a,b)\n self.graphDict[a].add(b)\n self.graphDict[b].add(a)\n\n def deleteEdge(self,a:V,b:V):\n assert self.isEdge(a,b)\n self.graphDict[a].remove(b)\n self.graphDict[b].remove(a)\n\n def rootedEnumeration(self,root:V):\n # Make sure graph is connected\n S:Set[V] = set([root])\n discovered:Set[V] = set()\n decendentDict: Dict[V, List[V]] = dict()\n ordering:List[V] = []\n while bool(S):\n v = S.pop()\n if not v in discovered:\n discovered.add(v)\n ordering.append(v)\n decendentDict[v] = self.graphDict[v] - discovered\n for n in self.graphDict[v]:\n S.add(n)\n\n return decendentDict,ordering\n\n def DFS(self,root:V):\n return self.rootedEnumeration(root)[1]\n\n def spanningTree(self,root:V):\n decendents,order = self.rootedEnumeration(root)\n return rootedTree(root,self.vertices,decendents,order)\n\n @property\n def connected(self)->bool:\n v = self.vertices[0]\n dfs = self.rootedEnumeration(v)\n return (len(dfs) == len(self.vertices))\n\n @staticmethod\n def typicalTree():\n G = graph([1,2,3,4,5],dict())\n G.appendEdge(1,3)\n G.appendEdge(1,4)\n G.appendEdge(4,2)\n G.appendEdge(4,5)\n\n return G\n #Custom Implementations here\n\nclass rootedTree:\n vertices:List[V]\n root:V\n decendents:Dict[V,Set[V]]\n parents:Dict[V,V]\n order:List[V]\n\n def __init__(self,root,vertices,decendents,order):\n self.root = root\n self.vertices = vertices\n self.decendents = decendents\n self.order = order\n\n self.parents = dict()\n\n for v in decendents:\n for child in decendents[v]:\n self.parents[child] = v\n\n\n\ndef decendentMax(G:graph,k:int):\n T = G.spanningTree(len(G.vertices))\n available:List[V] = [v for v in T.vertices if not bool(T.decendents[v])]\n eliminated:Set[V] = set()\n chosen:List[int] = []\n\n while len(chosen) < k:\n taking = min(available)\n eliminated.add(taking)\n chosen.append(taking)\n available.remove(taking)\n\n assert taking != T.root\n p = T.parents[taking]\n\n if(eliminated.issuperset(T.decendents[p])):\n available.append(p)\n\n assert len(chosen) == k\n return chosen\n\ndef readInt():\n return int(input())\n\ndef readLine():\n return [int(s) for s in input().split(\" \")]\n\n\nvertices, k = readLine()\nnewGraph = graph(range(1,vertices+1),dict())\n\nfor _ in range(vertices-1):\n a,b = readLine()\n newGraph.appendEdge(a,b)\n\nchosen = decendentMax(newGraph,k)\nchosen.sort()\nprint(\" \".join([str(c) for c in chosen]))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A string is called a *k*-string if it can be represented as *k* concatenated copies of some string. For example, the string \"aabaabaabaab\" is at the same time a 1-string, a 2-string and a 4-string, but it is not a 3-string, a 5-string, or a 6-string and so on. Obviously any string is a 1-string.\n\nYou are given a string *s*, consisting of lowercase English letters and a positive integer *k*. Your task is to reorder the letters in the string *s* in such a way that the resulting string is a *k*-string.",
"input": "",
"output": "```python\nk = int(input())\r\nvisited = {}\r\nword = input()\r\n\r\nfor c in word:\r\n if not c in visited:\r\n visited[c] = 0\r\n visited[c] += 1\r\n\r\nresult = []\r\n\r\nfor c in visited:\r\n if visited[c] % k == 0:\r\n result.append(c * (visited[c] // k))\r\n else:\r\n print(-1)\r\n exit(0)\r\nprint(''.join(result) * k)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two strings $s$ and $t$. In a single move, you can choose any of two strings and delete the first (that is, the leftmost) character. After a move, the length of the string decreases by $1$. You can't choose a string if it is empty.\n\nFor example:\n - by applying a move to the string \"where\", the result is the string \"here\", - by applying a move to the string \"a\", the result is an empty string \"\". \nYou are required to make two given strings equal using the fewest number of moves. It is possible that, in the end, both strings will be equal to the empty string, and so, are equal to each other. In this case, the answer is obviously the sum of the lengths of the initial strings.\n\nWrite a program that finds the minimum number of moves to make two given strings $s$ and $t$ equal.",
"input": "",
"output": "```python\na=str(input())\r\nb=str(input())\r\nff=0\r\nc=0\r\nfor l,i in enumerate(a):\r\n for f,j in enumerate(b):\r\n if(i==j):\r\n ia=l\r\n ib=f\r\n stra=a[ia:]\r\n strb=b[ib:]\r\n if(stra==strb):\r\n ff=ia+ib\r\n c=1\r\n break\r\n if c==1:\r\n break\r\nprint(ff) \r\n #EEEEEEEEEEEEEEEEEE\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently bought some land and decided to surround it with a wooden fence.\n\nHe went to a company called \"Wooden board\" that produces wooden boards for fences. Vasya read in the catalog of products that the company has at its disposal *n* different types of wood. The company uses the *i*-th type of wood to produce a board of this type that is a rectangular *a**i* by *b**i* block.\n\nVasya decided to order boards in this company and build a fence from them. It turned out that the storehouse of the company is so large that Vasya can order arbitrary number of boards of every type. Note that Vasya is allowed to turn the boards as he builds the fence. However, Vasya cannot turn square boards.\n\nVasya is required to construct a fence of length *l*, however, an arbitrary fence won't do. Vasya wants his fence to look beautiful. We'll say that a fence is beautiful if and only if the following two conditions are fulfilled:\n - there are no two successive boards of the same type - the first board of the fence has an arbitrary length, and the length of each subsequent board equals the width of the previous one \nIn other words, the fence is considered beautiful, if the type of the *i*-th board in the fence is different from the *i*<=-<=1-th board's type; besides, the *i*-th board's length is equal to the *i*<=-<=1-th board's width (for all *i*, starting from 2).\n\nNow Vasya wonders, how many variants of arranging a fence for his land exist. Your task is to count the number of different beautiful fences of length *l*.\n\nTwo fences will be considered the same if the corresponding sequences of fence boards types and rotations are the same, otherwise the fences are different. Since the sought number can be large enough, you need to calculate the answer modulo 1000000007 (109<=+<=7).",
"input": "",
"output": "```python\nmod = int(1e9+7)\r\n\r\nn, len = map(int, input().split())\r\n\r\na = [0] * n\r\nb = [0] * n\r\n\r\nf = [[[0] * 2 for i in range(len+1)] for j in range(n)]\r\nfor i in range(n):\r\n a[i], b[i] = map(int, input().split())\r\n if a[i] <= len:\r\n f[i][a[i]][0] += 1\r\n if a[i] != b[i] and b[i] <= len:\r\n f[i][b[i]][1] += 1\r\n\r\nfor i in range(len + 1):\r\n for j in range(n):\r\n for k in range(n):\r\n if j == k: continue\r\n\r\n if a[k] == a[j] and i + a[k] <= len:\r\n f[k][i + a[k]][0] += f[j][i][1]\r\n f[k][i + a[k]][0] %= mod\r\n\r\n if a[k] == b[j] and i + a[k] <= len:\r\n f[k][i + a[k]][0] += f[j][i][0]\r\n f[k][i + a[k]][0] %= mod\r\n\r\n if a[k] == b[k]: continue\r\n\r\n if b[k] == a[j] and i + b[k] <= len:\r\n f[k][i + b[k]][1] += f[j][i][1]\r\n f[k][i + b[k]][1] %= mod\r\n\r\n if b[k] == b[j] and i + b[k] <= len:\r\n f[k][i + b[k]][1] += f[j][i][0]\r\n f[k][i + b[k]][1] %= mod\r\n\r\nans = sum([(f[i][len][0] + f[i][len][1]) % mod for i in range(n)]) % mod\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has got two number: *a* and *b*. However, Vasya finds number *a* too short. So he decided to repeat the operation of lengthening number *a* *n* times.\n\nOne operation of lengthening a number means adding exactly one digit to the number (in the decimal notation) to the right provided that the resulting number is divisible by Vasya's number *b*. If it is impossible to obtain the number which is divisible by *b*, then the lengthening operation cannot be performed.\n\nYour task is to help Vasya and print the number he can get after applying the lengthening operation to number *a* *n* times.",
"input": "",
"output": "```python\nimport sys,os,io,time,copy,math\r\nfrom functools import lru_cache\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w') \r\n\r\ndef is_sorted(arr):\r\n if all(arr[i]<=arr[i+1] for i in range(len(arr)-1)):\r\n return True\r\n else:\r\n return False\r\n\r\ndef main(): \r\n a,b,n=map(int,input().split())\r\n if b<=10:\r\n a1=-1\r\n for i in range(10):\r\n a1=a*10+i\r\n if a1&b==0:\r\n break\r\n if a1==-1:\r\n print(-1)\r\n else:\r\n print(a1,end=\"\")\r\n for i in range(n-2):\r\n print(b,end=\"\")\r\n print(\"\")\r\n else:\r\n a1=-1\r\n for i in range(10):\r\n a1=a*10+i\r\n if a1&b==0:\r\n break\r\n print(a1)\r\n \r\n\r\n\r\n\r\n\r\nmain()\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once Bob needed to find the second order statistics of a sequence of integer numbers. Lets choose each number from the sequence exactly once and sort them. The value on the second position is the second order statistics of the given sequence. In other words it is the smallest element strictly greater than the minimum. Help Bob solve this problem.",
"input": "",
"output": "```python\ni = int(input())\nl = [int(x) for x in input().split()]\nl = sorted(set(l))\nif len(l)==1:\n print('NO')\nelse:\n print(l[1])\n\n\t\t \t\t \t\t \t\t\t \t \t\t \t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "As technologies develop, manufacturers are making the process of unlocking a phone as user-friendly as possible. To unlock its new phone, Arkady's pet dog Mu-mu has to bark the password once. The phone represents a password as a string of two lowercase English letters.\n\nMu-mu's enemy Kashtanka wants to unlock Mu-mu's phone to steal some sensible information, but it can only bark *n* distinct words, each of which can be represented as a string of two lowercase English letters. Kashtanka wants to bark several words (not necessarily distinct) one after another to pronounce a string containing the password as a substring. Tell if it's possible to unlock the phone in this way, or not.",
"input": "",
"output": "```python\ndef solution():\r\n password = input()\r\n num_words = int(input())\r\n words = []\r\n for _ in range(num_words):\r\n words.append(input())\r\n\r\n for x in range(num_words):\r\n for y in range(num_words):\r\n possible = words[x] + words[y]\r\n if password in possible:\r\n print('YES')\r\n return\r\n print('NO')\r\n\r\n\r\nsolution()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Someday, Drazil wanted to go on date with Varda. Drazil and Varda live on Cartesian plane. Drazil's home is located in point (0,<=0) and Varda's home is located in point (*a*,<=*b*). In each step, he can move in a unit distance in horizontal or vertical direction. In other words, from position (*x*,<=*y*) he can go to positions (*x*<=+<=1,<=*y*), (*x*<=-<=1,<=*y*), (*x*,<=*y*<=+<=1) or (*x*,<=*y*<=-<=1). \n\nUnfortunately, Drazil doesn't have sense of direction. So he randomly chooses the direction he will go to in each step. He may accidentally return back to his house during his travel. Drazil may even not notice that he has arrived to (*a*,<=*b*) and continue travelling. \n\nLuckily, Drazil arrived to the position (*a*,<=*b*) successfully. Drazil said to Varda: \"It took me exactly *s* steps to travel from my house to yours\". But Varda is confused about his words, she is not sure that it is possible to get from (0,<=0) to (*a*,<=*b*) in exactly *s* steps. Can you find out if it is possible for Varda?",
"input": "",
"output": "```python\na,b,s =map(int,input().split())\r\nx = abs(a) + abs(b)\r\nprint(\"NO\" if s0:\n m=m-1\n else:\n washed=washed+1\n elif a==2:\n if k>0:\n k=k-1\n elif k<=0 and m>0:\n m=m-1\n else:\n washed=washed+1\nprint(washed)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In Arcady's garden there grows a peculiar apple-tree that fruits one time per year. Its peculiarity can be explained in following way: there are *n* inflorescences, numbered from 1 to *n*. Inflorescence number 1 is situated near base of tree and any other inflorescence with number *i* (*i*<=><=1) is situated at the top of branch, which bottom is *p**i*-th inflorescence and *p**i*<=<<=*i*.\n\nOnce tree starts fruiting, there appears exactly one apple in each inflorescence. The same moment as apples appear, they start to roll down along branches to the very base of tree. Each second all apples, except ones in first inflorescence simultaneously roll down one branch closer to tree base, e.g. apple in *a*-th inflorescence gets to *p**a*-th inflorescence. Apples that end up in first inflorescence are gathered by Arcady in exactly the same moment. Second peculiarity of this tree is that once two apples are in same inflorescence they annihilate. This happens with each pair of apples, e.g. if there are 5 apples in same inflorescence in same time, only one will not be annihilated and if there are 8 apples, all apples will be annihilated. Thus, there can be no more than one apple in each inflorescence in each moment of time.\n\nHelp Arcady with counting number of apples he will be able to collect from first inflorescence during one harvest.",
"input": "",
"output": "```python\nfrom collections import Counter,UserString\r\nimport sys\r\nimport threading\r\nsys.setrecursionlimit(10000000)\r\ntry:\r\n pass\r\n #sys.stdin=open('test','r')\r\nexcept:\r\n pass\r\ndef main():\r\n n=int(input())\r\n a=[0,-1]+list(map(int,input().split()))\r\n b=[[] for i in range(n+1)]\r\n for i in range(2,n+1):\r\n b[a[i]].append(i)\r\n a.clear()\r\n d=[0 for i in range(n)]\r\n\r\n\r\n def dfs(i,l):\r\n d[l]=d[l]+1\r\n for i0 in b[i]:\r\n dfs(i0,l+1)\r\n\r\n def deff(a):\r\n return a%2\r\n dfs(1,0)\r\n print(sum(list(map(deff,d))))\r\nthreading.stack_size=10000000\r\nth=threading.Thread(target=main)\r\nth.run()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One fine October day a mathematics teacher Vasily Petrov went to a class and saw there *n* pupils who sat at the desks, two people at each desk. Vasily quickly realized that number *n* is even. Like all true mathematicians, Vasily has all students numbered from 1 to *n*.\n\nBut Vasily Petrov did not like the way the children were seated at the desks. According to him, the students whose numbers differ by 1, can not sit together, as they talk to each other all the time, distract others and misbehave.\n\nOn the other hand, if a righthanded student sits at the left end of the desk and a lefthanded student sits at the right end of the desk, they hit elbows all the time and distract each other. In other cases, the students who sit at the same desk, do not interfere with each other.\n\nVasily knows very well which students are lefthanders and which ones are righthanders, and he asks you to come up with any order that meets these two uncomplicated conditions (students do not talk to each other and do not bump their elbows). It is guaranteed that the input is such that at least one way to seat the students always exists.",
"input": "",
"output": "```python\nfr = open('input.txt','r')\r\nstudents = int(fr.readline())\r\ntext = fr.readline()\r\nprint(students)\r\nprint(text)\r\nfw = open(\"output.txt\",\"w\")\r\nfw.write(\"Ay 7AGA\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kolya is going to make fresh orange juice. He has *n* oranges of sizes *a*1,<=*a*2,<=...,<=*a**n*. Kolya will put them in the juicer in the fixed order, starting with orange of size *a*1, then orange of size *a*2 and so on. To be put in the juicer the orange must have size not exceeding *b*, so if Kolya sees an orange that is strictly greater he throws it away and continues with the next one.\n\nThe juicer has a special section to collect waste. It overflows if Kolya squeezes oranges of the total size strictly greater than *d*. When it happens Kolya empties the waste section (even if there are no more oranges) and continues to squeeze the juice. How many times will he have to empty the waste section?",
"input": "",
"output": "```python\na, b, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nans = 0\r\nbin = 0\r\nfor n in arr:\r\n if n <= b:\r\n bin += n\r\n if bin > d:\r\n ans += 1\r\n bin = 0\r\n\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "This winter is so cold in Nvodsk! A group of *n* friends decided to buy *k* bottles of a soft drink called \"Take-It-Light\" to warm up a bit. Each bottle has *l* milliliters of the drink. Also they bought *c* limes and cut each of them into *d* slices. After that they found *p* grams of salt.\n\nTo make a toast, each friend needs *nl* milliliters of the drink, a slice of lime and *np* grams of salt. The friends want to make as many toasts as they can, provided they all drink the same amount. How many toasts can each friend make?",
"input": "",
"output": "```python\nn, k, l, c, d, p, nl, np = list(map(int, input().split()))\r\n\r\ntotML = k * l\r\ntotLP = c * d\r\n\r\ntoastML = totML // nl\r\ntotSalt = p // np\r\n\r\nprint(min(toastML, totLP, totSalt) // n)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mahmoud has *n* line segments, the *i*-th of them has length *a**i*. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is sure he can win, so he asked you to tell him if he should accept the challenge. Given the lengths of the line segments, check if he can choose exactly 3 of them to form a non-degenerate triangle.\n\nMahmoud should use exactly 3 line segments, he can't concatenate two line segments or change any length. A non-degenerate triangle is a triangle with positive area.",
"input": "",
"output": "```python\n#accumalated 2d matrix\r\n# listy=[list(accumulate(row)) for row in accumulate([[i for i in list(map(int,input().split()))] for j in range(n)])] \r\n\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nx=int(input())\r\nlisty=list(map(int,input().split()))\r\nlisty.sort()\r\ncheck =0\r\nfor i in range(0,x-2,3):\r\n if((listy[i]+listy[i+1])>=listy[i+2]):\r\n check =1\r\n break\r\nif(check):\r\n print(\"YES\")\r\n \r\nelse :\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A group of *n* friends enjoys playing popular video game Toda 2. There is a rating system describing skill level of each player, initially the rating of the *i*-th friend is *r**i*.\n\nThe friends decided to take part in the championship as a team. But they should have equal ratings to be allowed to compose a single team consisting of all *n* friends. So the friends are faced with the problem: how to make all their ratings equal.\n\nOne way to change ratings is to willingly lose in some matches. Friends can form a party consisting of two to five (but not more than *n*) friends and play a match in the game. When the party loses, the rating of each of its members decreases by 1. A rating can't become negative, so *r**i*<==<=0 doesn't change after losing.\n\nThe friends can take part in multiple matches, each time making a party from any subset of friends (but remember about constraints on party size: from 2 to 5 members).\n\nThe friends want to make their ratings equal but as high as possible.\n\nHelp the friends develop a strategy of losing the matches so that all their ratings become equal and the resulting rating is maximum possible.",
"input": "",
"output": "```python\n# coding=utf-8\r\n\"\"\"Codeforces 730a solution.\"\"\"\r\n\r\nfrom operator import itemgetter\r\n\r\n\r\nclass CodeforcesTask730ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.players = 0\r\n self.rating = []\r\n\r\n def read_input(self):\r\n self.players = int(input())\r\n self.rating = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n\r\n if self.players > 2:\r\n moves = []\r\n players = [[x + 1, self.rating[x]] for x in range(self.players)]\r\n players.sort(key=itemgetter(1), reverse=True)\r\n while players[1][1] != players[-1][1]:\r\n players[0][1] = max(0, players[0][1] - 1)\r\n players[1][1] = max(0, players[1][1] - 1)\r\n moves.append([players[0][0], players[1][0]])\r\n players.sort(key=itemgetter(1), reverse=True)\r\n if players[0][1] != players[-1][1]:\r\n added = False\r\n for m in moves:\r\n if not players[0][0] in m:\r\n m.append(players[0][0])\r\n players[0][1] = max(0, players[0][1] - 1)\r\n added = True\r\n break\r\n if not added:\r\n #print(\"edge case 1\")\r\n #print(players)\r\n moves.append([players[-1][0], players[0][0]])\r\n players[0][1] = max(0, players[0][1] - 1)\r\n players[-1][1] = max(0, players[-1][1] - 1)\r\n while players[0][1] != players[-1][1]:\r\n players[0][1] = max(0, players[0][1] - 1)\r\n players[1][1] = max(0, players[1][1] - 1)\r\n moves.append([players[0][0], players[1][0]])\r\n players.sort(key=itemgetter(1), reverse=True)\r\n if players[0][1] != players[-1][1]:\r\n added = False\r\n for m in moves:\r\n if not players[0][0] in m:\r\n m.append(players[0][0])\r\n players[0][1] = max(0, players[0][1] - 1)\r\n added = True\r\n break\r\n if not added:\r\n #print(players)\r\n print(\"edge case 2\")\r\n players.sort(key=itemgetter(1), reverse=True)\r\n print(players[-1][1])\r\n print(len(moves))\r\n for m in moves:\r\n print(\"\".join([\"1\" if x + 1 in m else \"0\" for x in range(self.players)]))\r\n else:\r\n if self.rating[0] == self.rating[1]:\r\n print(self.rating[0])\r\n print(\"0\")\r\n else:\r\n print(\"0\")\r\n for x in range(max(self.rating)):\r\n print(\"11\")\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask730ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mishka is a little polar bear. As known, little bears loves spending their free time playing dice for chocolates. Once in a wonderful sunny morning, walking around blocks of ice, Mishka met her friend Chris, and they started playing the game.\n\nRules of the game are very simple: at first number of rounds *n* is defined. In every round each of the players throws a cubical dice with distinct numbers from 1 to 6 written on its faces. Player, whose value after throwing the dice is greater, wins the round. In case if player dice values are equal, no one of them is a winner.\n\nIn average, player, who won most of the rounds, is the winner of the game. In case if two players won the same number of rounds, the result of the game is draw.\n\nMishka is still very little and can't count wins and losses, so she asked you to watch their game and determine its result. Please help her!",
"input": "",
"output": "```python\nca,cb = 0,0\r\nt = int(input())\r\nwhile t!=0:\r\n a,b = map(int,input().split())\r\n if a>b:\r\n ca = ca + 1\r\n if b>a:\r\n cb = cb + 1\r\n t-=1\r\nif ca > cb:\r\n print(\"Mishka\")\r\nelif cb > ca:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word \"tma\" (which now means \"too much to be counted\") used to stand for a thousand and \"tma tmyschaya\" (which literally means \"the tma of tmas\") used to stand for a million.\n\nPetya wanted to modernize the words we use for numbers and invented a word petricium that represents number *k*. Moreover, petricium la petricium stands for number *k*2, petricium la petricium la petricium stands for *k*3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.\n\nPetya's invention brought on a challenge that needed to be solved quickly: does some number *l* belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.",
"input": "",
"output": "```python\nfrom math import log\r\nn = int(input())\r\nl = int(input())\r\ns = int(log(l,n))\r\ny = s+1\r\nif n**s==l:\r\n print(\"YES\")\r\n print(s-1)\r\nelif n**y==l:\r\n print(\"YES\")\r\n print(y-1)\r\nelse:\r\n print(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Now Fox Ciel becomes a commander of Tree Land. Tree Land, like its name said, has *n* cities connected by *n*<=-<=1 undirected roads, and for any two cities there always exists a path between them.\n\nFox Ciel needs to assign an officer to each city. Each officer has a rank — a letter from 'A' to 'Z'. So there will be 26 different ranks, and 'A' is the topmost, so 'Z' is the bottommost.\n\nThere are enough officers of each rank. But there is a special rule must obey: if *x* and *y* are two distinct cities and their officers have the same rank, then on the simple path between *x* and *y* there must be a city *z* that has an officer with higher rank. The rule guarantee that a communications between same rank officers will be monitored by higher rank officer.\n\nHelp Ciel to make a valid plan, and if it's impossible, output \"Impossible!\".",
"input": "",
"output": "```python\nPrint(\"I am jocking\");;;\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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 *v*1 milliseconds and has ping *t*1 milliseconds. The second participant types one character in *v*2 milliseconds and has ping *t*2 milliseconds.\n\nIf connection ping (delay) is *t* milliseconds, the competition passes for a participant as follows: \n 1. Exactly after *t* milliseconds after the start of the competition the participant receives the text to be entered. 1. Right after that he starts to type it. 1. Exactly *t* milliseconds after he ends typing all the text, the site receives information about it. \nThe winner is the participant whose information on the success comes earlier. If the information comes from both participants at the same time, it is considered that there is a draw.\n\nGiven the length of the text and the information about participants, determine the result of the game.",
"input": "",
"output": "```python\nx,y,z,w=map(int,input().split())\r\np=max(x,y,z,w)\r\nif (p-x)!=0:\r\n print(p-x,end=' ')\r\nif (p-y)!=0:\r\n print(p-y,end=' ')\r\nif (p-z)!=0:\r\n print(p-z,end=' ')\r\nif (p-w)!=0:\r\n print(p-w,end=' ')\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a very secret base in Potatoland where potato mash is made according to a special recipe. The neighbours from Porridgia decided to seize this recipe and to sell it to Pilauland. For this mission they have been preparing special agent Pearlo for many years. When, finally, Pearlo learned all secrets of espionage, he penetrated into the Potatoland territory and reached the secret base.\n\nNow he is standing at the entrance, but to get inside he need to pass combination lock. Minute ago one of the workers entered the password on the terminal and opened the door. The terminal is a square digital keyboard 3<=×<=3 with digits from 1 to 9.\n\nPearlo knows that the password consists from distinct digits and is probably symmetric with respect to the central button of the terminal. He has heat sensor which allowed him to detect the digits which the worker pressed. Now he wants to check whether the password entered by the worker is symmetric with respect to the central button of the terminal. This fact can Help Pearlo to reduce the number of different possible password combinations.",
"input": "",
"output": "```python\nstr1=\"\"\r\nfor i in range(3):\r\n str1+=input()\r\nif str1==str1[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for $n$ flowers and so it looks like a pipe with $n$ holes. Arkady can only use the water that flows from the first hole.\n\nArkady can block some of the holes, and then pour $A$ liters of water into the pipe. After that, the water will flow out from the non-blocked holes proportionally to their sizes $s_1, s_2, \\ldots, s_n$. In other words, if the sum of sizes of non-blocked holes is $S$, and the $i$-th hole is not blocked, $\\frac{s_i \\cdot A}{S}$ liters of water will flow out of it.\n\nWhat is the minimum number of holes Arkady should block to make at least $B$ liters of water flow out of the first hole?",
"input": "",
"output": "```python\nimport sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print fast\r\npt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn,a,b = get_int_list()\r\nlst = get_int_list()\r\n\r\ns = a*(lst[0])/b\r\n\r\nl = sorted(lst[1:])\r\ntotal = lst[0]\r\ncount = 1\r\nfor i in l:\r\n if total+i <= s:\r\n total += i\r\n count += 1\r\n else:\r\n break\r\n\r\nprint(n-count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a given string *S* consisting of *N* symbols. Your task is to find the number of ordered pairs of integers *i* and *j* such that\n\n1. 1<=≤<=*i*,<=*j*<=≤<=*N*\n\n2. *S*[*i*]<==<=*S*[*j*], that is the *i*-th symbol of string *S* is equal to the *j*-th.",
"input": "",
"output": "```python\ns = str(input())\r\nlist1 = []\r\nsum = 0\r\nfor x in s:\r\n if x not in list1:\r\n list1.append(x)\r\n if s.count(x) > 1:\r\n sum += (s.count(x) * s.count(x))\r\nif sum == 0:\r\n print(len(s))\r\nelse:\r\n print(sum)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The winner of the card game popular in Berland \"Berlogging\" is determined according to the following rules. If at the end of the game there is only one player with the maximum number of points, he is the winner. The situation becomes more difficult if the number of such players is more than one. During each round a player gains or loses a particular number of points. In the course of the game the number of points is registered in the line \"name score\", where name is a player's name, and score is the number of points gained in this round, which is an integer number. If score is negative, this means that the player has lost in the round. So, if two or more players have the maximum number of points (say, it equals to *m*) at the end of the game, than wins the one of them who scored at least *m* points first. Initially each player has 0 points. It's guaranteed that at the end of the game at least one player has a positive number of points.",
"input": "",
"output": "```python\nimport sys \n#from math import gcd\n#from bisect import bisect_left, bisect_right\n\nread_line = lambda: sys.stdin.readline().strip()\nread_intmap = lambda: map(int, read_line().split())\n\ndef testCase():\n n = int(input())\n players = dict()\n for ind in range(1, n + 1):\n name, score = read_line().split()\n score = int(score)\n\n if not name in players:\n players[name] = [0, {0:0}] #curr score, rounds at which score acheived\n\n curr, rec = players[name]\n\n curr += score\n if not curr in rec:\n rec[curr] = ind\n\n players[name] = [curr, rec]\n \n maxScore = max([v[0] for k,v in players.items()])\n minInd = n + 100\n winner = None\n\n for k,v in players.items():\n rec = v[1]\n \n tmpInd = 1e9\n for k2, v2 in rec.items():\n if k2 >= maxScore and v2 < tmpInd:\n tmpInd = v2\n\n if tmpInd < minInd:\n minInd = tmpInd\n winner = k\n\n print(winner)\n\n\nt = 1\n#t = int(input())\nfor i in range(t):\n testCase()\n\n \n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Greatest common divisor *GCD*(*a*,<=*b*) of two positive integers *a* and *b* is equal to the biggest integer *d* such that both integers *a* and *b* are divisible by *d*. There are many efficient algorithms to find greatest common divisor *GCD*(*a*,<=*b*), for example, Euclid algorithm. \n\nFormally, find the biggest integer *d*, such that all integers *a*,<=*a*<=+<=1,<=*a*<=+<=2,<=...,<=*b* are divisible by *d*. To make the problem even more complicated we allow *a* and *b* to be up to googol, 10100 — such number do not fit even in 64-bit integer type!",
"input": "",
"output": "```python\nstart , end = list(map(int ,input().split()))\r\n\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\nres = start\r\nfor i in range(start +1 ,end):\r\n res = gcd(res, i)\r\nprint(res)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently, a start up by two students of a state university of city F gained incredible popularity. Now it's time to start a new company. But what do we call it?\n\nThe market analysts came up with a very smart plan: the name of the company should be identical to its reflection in a mirror! In other words, if we write out the name of the company on a piece of paper in a line (horizontally, from left to right) with large English letters, then put this piece of paper in front of the mirror, then the reflection of the name in the mirror should perfectly match the line written on the piece of paper.\n\nThere are many suggestions for the company name, so coming up to the mirror with a piece of paper for each name wouldn't be sensible. The founders of the company decided to automatize this process. They asked you to write a program that can, given a word, determine whether the word is a 'mirror' word or not.",
"input": "",
"output": "```python\n# https://codeforces.com/contest/421/problem/B\r\n# 1000\r\ndef palin(n,k):\r\n for i in range(k//2):\r\n if n[i]!=n[k-i-1]:\r\n return False\r\n return True\r\ns=input()\r\nl=['A','H','W','I','M','Y','X','O','T','U','V']\r\nif palin(s,len(s)):\r\n for i in s:\r\n if i not in l:\r\n print(\"NO\")\r\n exit()\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarpus has a ribbon, its length is *n*. He wants to cut the ribbon in a way that fulfils the following two conditions: \n - After the cutting each ribbon piece should have length *a*, *b* or *c*. - After the cutting the number of ribbon pieces should be maximum. \nHelp Polycarpus and find the number of ribbon pieces after the required cutting.",
"input": "",
"output": "```python\nimport sys \r\n \r\nsys.setrecursionlimit(500000000) \r\n \r\ndef f(n): \r\n\r\n if n in memo.keys(): \r\n return memo[n] \r\n \r\n ans = float(\"-inf\") \r\n if n == 0: \r\n return 0 \r\n for length in l: \r\n\r\n if n >= length: \r\n ans = max(ans, 1 + f(n - length)) \r\n\r\n memo[n] = ans \r\n return ans \r\n \r\n\r\nmemo = dict() \r\n \r\nl = list(map(int, input().split())) \r\nn, l = l[0], l[1:] \r\nprint(f(n)) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* parliamentarians in Berland. They are numbered with integers from 1 to *n*. It happened that all parliamentarians with odd indices are Democrats and all parliamentarians with even indices are Republicans.\n\nNew parliament assembly hall is a rectangle consisting of *a*<=×<=*b* chairs — *a* rows of *b* chairs each. Two chairs are considered neighbouring if they share as side. For example, chair number 5 in row number 2 is neighbouring to chairs number 4 and 6 in this row and chairs with number 5 in rows 1 and 3. Thus, chairs have four neighbours in general, except for the chairs on the border of the hall\n\nWe know that if two parliamentarians from one political party (that is two Democrats or two Republicans) seat nearby they spent all time discussing internal party issues.\n\nWrite the program that given the number of parliamentarians and the sizes of the hall determine if there is a way to find a seat for any parliamentarian, such that no two members of the same party share neighbouring seats.",
"input": "",
"output": "```python\nimport sys\r\nn, a, b = map(int, input().split())\r\nif n > a*b:\r\n print(-1)\r\n sys.exit(0)\r\npar = []\r\nfor i in range(1, n+1, b):\r\n s = ['0']*b\r\n for j in range(b):\r\n if i+j <= n:\r\n s[j] = str(i+j)\r\n par.append(s)\r\nwhile len(par) < a:\r\n par.append(['0']*b)\r\nfor i in range(a):\r\n if i%2 == 0:\r\n par[i].reverse()\r\n print(' '.join(par[i]))\r\n else:\r\n print(' '.join(par[i]))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One way to create a task is to learn from math. You can generate some random math statement or modify some theorems to get something new and build a new task from that.\n\nFor example, there is a statement called the \"Goldbach's conjecture\". It says: \"each even number no less than four can be expressed as the sum of two primes\". Let's modify it. How about a statement like that: \"each integer no less than 12 can be expressed as the sum of two composite numbers.\" Not like the Goldbach's conjecture, I can prove this theorem.\n\nYou are given an integer *n* no less than 12, express it as a sum of two composite numbers.",
"input": "",
"output": "```python\na=int(input())\r\nif a%2==0:\r\n print('4',a-4)\r\nelse:\r\n print('9',a-9)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Karen is getting ready for a new school day!\n\nIt is currently hh:mm, given in a 24-hour format. As you know, Karen loves palindromes, and she believes that it is good luck to wake up when the time is a palindrome.\n\nWhat is the minimum number of minutes she should sleep, such that, when she wakes up, the time is a palindrome?\n\nRemember that a palindrome is a string that reads the same forwards and backwards. For instance, 05:39 is not a palindrome, because 05:39 backwards is 93:50. On the other hand, 05:50 is a palindrome, because 05:50 backwards is 05:50.",
"input": "",
"output": "```python\nc = [70, 140, 210, 280, 350, 601, 671, 741, 811, 881, 951, 1202, 1272, 1342, 1412, 1440]\r\nd = input().split(':')\r\nd = int(d[0]) * 60 + int(d[1])\r\nm = 10000\r\nfor i in c:\r\n if (i - d) >= 0 and (i - d) <= m:\r\n m = i - d\r\nprint(m)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Elements of Harmony are six supernatural artifacts representing subjective aspects of harmony. They are arguably the most powerful force in Equestria. The inside of Elements of Harmony can be seen as a complete graph with *n* vertices labeled from 0 to *n*<=-<=1, where *n* is a power of two, equal to 2*m*.\n\nThe energy in Elements of Harmony is in constant movement. According to the ancient book, the energy of vertex *u* in time *i* (*e**i*[*u*]) equals to: \n\nHere *b*[] is the transformation coefficient — an array of *m*<=+<=1 integers and *f*(*u*,<=*v*) is the number of ones in the binary representation of number (*u* *xor* *v*).\n\nGiven the transformation coefficient and the energy distribution at time 0 (*e*0[]). Help Twilight Sparkle predict the energy distribution at time *t* (*e**t*[]). The answer can be quite large, so output it modulo *p*.",
"input": "",
"output": "```python\ndef Bit(n) :\r\n cnt = 0\r\n while n :\r\n if n & 1 : cnt += 1\r\n n >>= 1\r\n return cnt\r\nb = [];\r\ntmp = input().split();\r\nm = int(tmp[0]); t = int(tmp[1]); kMod = int(tmp[2]);\r\nn = 1 << m\r\na = input().split()\r\nfor i in range(n) : a[i] = int(a[i])\r\nfor i in range(n) : b.append(0)\r\nv = input().split()\r\nfor i in range(m + 1) : v[i] = int(v[i])\r\nfor i in range(n) : b[i] = v[Bit(i)]\r\nkMod <<= m\r\ndef Pow(a, b) :\r\n ans = 1\r\n while b :\r\n if b & 1 : ans = ans * a % kMod\r\n a = a * a % kMod\r\n b >>= 1\r\n return ans;\r\ni = 2\r\nwhile i <= n :\r\n for j in range(0, n, i) :\r\n for k in range(j, j + (i >> 1)) :\r\n tx = (a[k] + a[k + (i >> 1)]) % kMod\r\n ty = (kMod + a[k] - a[k + (i >> 1)]) % kMod\r\n a[k] = tx; a[k + (i >> 1)] = ty\r\n i <<= 1\r\ni = 2\r\nwhile i <= n :\r\n for j in range(0, n, i) :\r\n for k in range(j, j + (i >> 1)) :\r\n tx = (b[k] + b[k + (i >> 1)]) % kMod\r\n ty = (kMod + b[k] - b[k + (i >> 1)]) % kMod\r\n b[k] = tx; b[k + (i >> 1)] = ty\r\n i <<= 1\r\nfor i in range(n) : a[i] = a[i] * Pow(b[i], t) % kMod\r\ni = 2\r\nwhile i <= n :\r\n for j in range(0, n, i) :\r\n for k in range(j, j + (i >> 1)) :\r\n tx = (a[k] + a[k + (i >> 1)]) % kMod\r\n ty = (kMod + a[k] - a[k + (i >> 1)]) % kMod\r\n a[k] = tx; a[k + (i >> 1)] = ty\r\n i <<= 1\r\nfor i in range(n) : a[i] >>= m\r\nkMod >>= m\r\nfor i in range(n) : print(a[i] % kMod)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\ndef domino_piling(m: int, n: int) -> int:\r\n\treturn int((m * n) / 2)\r\n\r\nif __name__ == '__main__':\r\n\t[m, n] = [int(s) for s in input().split()]\r\n\tprint(domino_piling(m, n))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You've got array *a*[1],<=*a*[2],<=...,<=*a*[*n*], consisting of *n* integers. Count the number of ways to split all the elements of the array into three contiguous parts so that the sum of elements in each part is the same. \n\nMore formally, you need to find the number of such pairs of indices *i*,<=*j* (2<=≤<=*i*<=≤<=*j*<=≤<=*n*<=-<=1), that .",
"input": "",
"output": "```python\nn = int(input())\r\n\r\narr = [0]*n\r\ntemp = 0\r\ninp = input().split()\r\nfor i in range(n):\r\n arr[i] = int(inp[i])\r\n temp += arr[i]\r\n arr[i] = temp\r\nif temp%3 != 0:\r\n print(0)\r\n exit()\r\nfirst = 0\r\nsecond = 0\r\nthird = 0\r\nif temp == 0:\r\n for i in arr:\r\n if i == 0:\r\n first += 1\r\n print(first*(first-1)*(first-2)//6)\r\n exit()\r\nfor i in arr:\r\n if i == temp/3:\r\n first += 1\r\n elif i == (temp/3)*2:\r\n second += 1\r\n elif i == temp:\r\n third += 1\r\nprint(first*second*third)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pig is visiting a friend.\n\nPig's house is located at point 0, and his friend's house is located at point *m* on an axis.\n\nPig can use teleports to move along the axis.\n\nTo use a teleport, Pig should come to a certain point (where the teleport is located) and choose where to move: for each teleport there is the rightmost point it can move Pig to, this point is known as the limit of the teleport.\n\nFormally, a teleport located at point *x* with limit *y* can move Pig from point *x* to any point within the segment [*x*;<=*y*], including the bounds.\n\nDetermine if Pig can visit the friend using teleports only, or he should use his car.",
"input": "",
"output": "```python\nli = []\nn, m = map(int, input().split())\nfor i in range(n):\n a, b = map(int, input().split())\n li.append([a, b])\n\nli.sort()\ni = 0\n\nwhile len(li) != 1 and li[i][1] >= li[i + 1][0]:\n li[i][1] = max(li[i][1], li[i + 1][1])\n del li[i + 1]\n\n\nif len(li) == 0 and m == 0:\n print(\"YES\")\nelif len(li) == 1 and li[-1][-1] >= m and li[-1][0] == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\t \t \t\t \t \t \t\t \t\t \t\t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\nw = input()\n\ns = 0\nfor i in w:\n \n s += 1\ntry:\n w = int(w)\n quit()\nexcept:\n\n if s>=10:\n print(w[0]+str(s-2)+w[-1])\n else:print(w)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A rare article in the Internet is posted without a possibility to comment it. On a Polycarp's website each article has comments feed.\n\nEach comment on Polycarp's website is a non-empty string consisting of uppercase and lowercase letters of English alphabet. Comments have tree-like structure, that means each comment except root comments (comments of the highest level) has exactly one parent comment.\n\nWhen Polycarp wants to save comments to his hard drive he uses the following format. Each comment he writes in the following format: \n - at first, the text of the comment is written; - after that the number of comments is written, for which this comment is a parent comment (i. e. the number of the replies to this comments); - after that the comments for which this comment is a parent comment are written (the writing of these comments uses the same algorithm). \nFor example, if the comments look like:\n\nthen the first comment is written as \"hello,2,ok,0,bye,0\", the second is written as \"test,0\", the third comment is written as \"one,1,two,2,a,0,b,0\". The whole comments feed is written as: \"hello,2,ok,0,bye,0,test,0,one,1,two,2,a,0,b,0\". For a given comments feed in the format specified above print the comments in a different format: \n - at first, print a integer *d* — the maximum depth of nesting comments; - after that print *d* lines, the *i*-th of them corresponds to nesting level *i*; - for the *i*-th row print comments of nesting level *i* in the order of their appearance in the Policarp's comments feed, separated by space.",
"input": "",
"output": "```python\ndef find_depth(line,depth,tree):\r\n if(len(tree) < depth):\r\n branch = list()\r\n tree.append(branch)\r\n tree[depth-1].append(line[0])\r\n if(int(line[1]) == 0):\r\n if(len(line)>0):\r\n return [1,1,line[2:]]\r\n else:\r\n return [1,1]\r\n else:\r\n a = list()\r\n length = int()\r\n temp_line = line[2:]\r\n for i in range(0,int(line[1])):\r\n ans = find_depth(temp_line,depth+1,tree)\r\n a.append(ans[0])\r\n length += ans[1]\r\n temp_line = ans[2]\r\n return [max(a)+1,length+1,temp_line]\r\n\r\ntext = input().split(',')\r\ntotal_word = int(len(text)/2)\r\nmax_depth = 1\r\ndepth = 1\r\ntree = list()\r\ntemp_line = text[:]\r\n\r\nwhile(total_word > 0):\r\n ans = find_depth(temp_line,depth,tree)\r\n max_depth = max(max_depth, ans[0])\r\n temp_line = ans[2]\r\n total_word -= ans[1]\r\n\r\n\r\nprint(max_depth)\r\nfor x in tree:\r\n print(' '.join(str(y) for y in x))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya works as a DJ in the best Berland nightclub, and he often uses dubstep music in his performance. Recently, he has decided to take a couple of old songs and make dubstep remixes from them.\n\nLet's assume that a song consists of some number of words. To make the dubstep remix of this song, Vasya inserts a certain number of words \"WUB\" before the first word of the song (the number may be zero), after the last word (the number may be zero), and between words (at least one between any pair of neighbouring words), and then the boy glues together all the words, including \"WUB\", in one string and plays the song at the club.\n\nFor example, a song with words \"I AM X\" can transform into a dubstep remix as \"WUBWUBIWUBAMWUBWUBX\" and cannot transform into \"WUBWUBIAMWUBX\".\n\nRecently, Petya has heard Vasya's new dubstep track, but since he isn't into modern music, he decided to find out what was the initial song that Vasya remixed. Help Petya restore the original song.",
"input": "",
"output": "```python\ns = input()\r\n\r\nans = s.replace(\"WUB\", \" \").strip() #strip removes spaces at the beginning and end of the string\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given *n* numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given *n* numbers finds one that is different in evenness.",
"input": "",
"output": "```python\nn = int(input())\r\nline = list(map(int, input().split()))\r\ni = 0\r\nj = 1\r\nk = 2\r\n\r\nif (line[0] % 2 == 0) and (line[1] % 2 == 0):\r\n while k < n:\r\n if (line[k] % 2 != 0):\r\n print(k+1)\r\n break\r\n k += 1\r\n \r\nelif ((line[0] % 2 != 0) or (line[1] % 2 == 0)) or ((line[0] % 2 == 0) or (line[1] % 2 != 0)):\r\n while j < 2:\r\n x = 1\r\n if line[j-1] % 2 != 0:\r\n print(x)\r\n break\r\n x += 1\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.\n\nIn the given sequence moving up is described by character U and moving right is described by character R. Mikhail can replace any pair of consecutive moves RU or UR with a diagonal move (described as character D). After that, he can go on and do some other replacements, until there is no pair of consecutive moves RU or UR left.\n\nYour problem is to print the minimum possible length of the sequence of moves after the replacements.",
"input": "",
"output": "```python\n\r\n1.\ty=int(input())\r\n2.\ttxt=input()\r\n3.\tn=len(txt)\r\n4.\tD=['RU','UR']\r\n5.\ti=0\r\n6.\twhile i < y-1:\r\n7.\t if txt[i]+txt[i+1] in D:\r\n8.\t n=n-1\r\n9.\t i=i+2\r\n10.\t else:\r\n11.\t i=i+1\r\n12.\tprint(n)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Your friend has *n* cards.\n\nYou know that each card has a lowercase English letter on one side and a digit on the other.\n\nCurrently, your friend has laid out the cards on a table so only one side of each card is visible.\n\nYou would like to know if the following statement is true for cards that your friend owns: \"If a card has a vowel on one side, then it has an even digit on the other side.\" More specifically, a vowel is one of 'a', 'e', 'i', 'o' or 'u', and even digit is one of '0', '2', '4', '6' or '8'.\n\nFor example, if a card has 'a' on one side, and '6' on the other side, then this statement is true for it. Also, the statement is true, for example, for a card with 'b' and '4', and for a card with 'b' and '3' (since the letter is not a vowel). The statement is false, for example, for card with 'e' and '5'. You are interested if the statement is true for all cards. In particular, if no card has a vowel, the statement is true.\n\nTo determine this, you can flip over some cards to reveal the other side. You would like to know what is the minimum number of cards you need to flip in the worst case in order to verify that the statement is true.",
"input": "",
"output": "```python\ns = input()\ncount = 0\nfor c in s:\n if c in \"aeiou\":\n count+=1\n if c in \"13579\":\n count += 1\nprint(count)\n\t \t\t \t \t \t \t \t\t \t\t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A family consisting of father bear, mother bear and son bear owns three cars. Father bear can climb into the largest car and he likes it. Also, mother bear can climb into the middle car and she likes it. Moreover, son bear can climb into the smallest car and he likes it. It's known that the largest car is strictly larger than the middle car, and the middle car is strictly larger than the smallest car. \n\nMasha came to test these cars. She could climb into all cars, but she liked only the smallest car. \n\nIt's known that a character with size *a* can climb into some car with size *b* if and only if *a*<=≤<=*b*, he or she likes it if and only if he can climb into this car and 2*a*<=≥<=*b*.\n\nYou are given sizes of bears and Masha. Find out some possible integer non-negative sizes of cars.",
"input": "",
"output": "```python\npai, mae, filho, maria = [int(x) for x in input().split(' ')]\r\n \r\n \r\ndef solve():\r\n if filho > 2*maria or maria > 2*filho or maria >= mae:\r\n return -1\r\n \r\n if filho > maria:\r\n return max(pai, 2*maria + 2), max(mae, 2*maria + 1), filho\r\n \r\n return max(pai, 2*maria + 2), max(mae, 2*maria + 1), maria\r\n \r\n \r\nx = solve()\r\nif x == -1:\r\n print(-1)\r\nelse:\r\n print(x[0])\r\n print(x[1])\r\n print(x[2])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vanya got an important task — he should enumerate books in the library and label each book with its number. Each of the *n* books should be assigned with a number from 1 to *n*. Naturally, distinct books should be assigned distinct numbers.\n\nVanya wants to know how many digits he will have to write down as he labels the books.",
"input": "",
"output": "```python\nfrom sys import stdin, stdout\r\nimport math\r\n\r\nn=int(stdin.readline())\r\ni=0\r\nj=1\r\nans=0\r\nfinal=9*pow(10,i)\r\nif(n<=9):\r\n ans=n\r\nelse:\r\n while(n>final):\r\n n = n - final\r\n ans+=final*j\r\n j+=1\r\n i+=1\r\n final = 9 * pow(10, i)\r\n ans+=n*j\r\nstdout.write(str(ans)+\"\\n\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mishka is a little polar bear. As known, little bears loves spending their free time playing dice for chocolates. Once in a wonderful sunny morning, walking around blocks of ice, Mishka met her friend Chris, and they started playing the game.\n\nRules of the game are very simple: at first number of rounds *n* is defined. In every round each of the players throws a cubical dice with distinct numbers from 1 to 6 written on its faces. Player, whose value after throwing the dice is greater, wins the round. In case if player dice values are equal, no one of them is a winner.\n\nIn average, player, who won most of the rounds, is the winner of the game. In case if two players won the same number of rounds, the result of the game is draw.\n\nMishka is still very little and can't count wins and losses, so she asked you to watch their game and determine its result. Please help her!",
"input": "",
"output": "```python\nl=0\r\nm=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n l=l+1\r\n elif b>a:\r\n m=m+1\r\nif l>m:\r\n print(\"Miskha\")\r\nelif(l 0:\r\n mid += d * n * (n - 1) / 2.0\r\n else:\r\n mid += (n*n - 1) / 4 * d\r\n else:\r\n if d > 0:\r\n mid += d * n * (n - 1) / 2.0\r\n else:\r\n mid += n*n / 4 * d\r\n\r\nprint(\"%.15f\" % (mid / n))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Greatest common divisor *GCD*(*a*,<=*b*) of two positive integers *a* and *b* is equal to the biggest integer *d* such that both integers *a* and *b* are divisible by *d*. There are many efficient algorithms to find greatest common divisor *GCD*(*a*,<=*b*), for example, Euclid algorithm. \n\nFormally, find the biggest integer *d*, such that all integers *a*,<=*a*<=+<=1,<=*a*<=+<=2,<=...,<=*b* are divisible by *d*. To make the problem even more complicated we allow *a* and *b* to be up to googol, 10100 — such number do not fit even in 64-bit integer type!",
"input": "",
"output": "```python\na , b = map(int, input().split())\r\n\r\ndef gcd(a,b):\r\n if b < a:\r\n a , b = b, a\r\n if b%a == 0:\r\n return a\r\n return gcd(a,b%a)\r\nprint(gcd(a,b))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vitya has just started learning Berlanese language. It is known that Berlanese uses the Latin alphabet. Vowel letters are \"a\", \"o\", \"u\", \"i\", and \"e\". Other letters are consonant.\n\nIn Berlanese, there has to be a vowel after every consonant, but there can be any letter after any vowel. The only exception is a consonant \"n\"; after this letter, there can be any letter (not only a vowel) or there can be no letter at all. For example, the words \"harakiri\", \"yupie\", \"man\", and \"nbo\" are Berlanese while the words \"horse\", \"king\", \"my\", and \"nz\" are not.\n\nHelp Vitya find out if a word $s$ is Berlanese.",
"input": "",
"output": "```python\nn=input()+\"*\"\r\ns=\"Yes\"\r\nfor i in range(len(s)-1):\r\n if n[i] not in \"aeiou\" and n[i+1] not in \"aeiou\":\r\n s=\"No\"\r\n else:\r\n s=\"Yes\"\r\nprint(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word *s*. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word *s*.",
"input": "",
"output": "```python\nz = 0\nm = input()\nls = ['h', 'e', 'l', 'l', 'o']\nfor i in range(len(m)):\n if len(ls) == 0:\n tm=\"YES\"\n break\n\n if ls[0] == m[i]:\n ls.remove(ls[0])\n\nif len(ls) == 0:\n tm = \"YES\"\n\nif len(ls) != 0:\n tm = \"NO\"\n\nprint(tm)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two players are playing a game. First each of them writes an integer from 1 to 6, and then a dice is thrown. The player whose written number got closer to the number on the dice wins. If both payers have the same difference, it's a draw.\n\nThe first player wrote number *a*, the second player wrote number *b*. How many ways to throw a dice are there, at which the first player wins, or there is a draw, or the second player wins?",
"input": "",
"output": "```python\nimport math\r\na,b=map(int,input().split())\r\nx=y=z=0\r\nfor n in range(1,7):\r\n if math.fabs(n-a)>math.fabs(n-b):\r\n x+=1\r\n elif math.fabs(n-a)= 6:\r\n c += n // 4\r\n else:\r\n c = -1\r\n print(c)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\nt = int(input())\nfor _ in range(t):\n s = input()\n l = len(s)\n if l > 10:\n r = s[0] + str(l - 2) + s[l-1]\n print(r)\n else:\n print(s)\n \t \t \t\t\t \t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently found out what a digital root of a number is and he decided to share his knowledge with you.\n\nLet's assume that *S*(*n*) is the sum of digits of number *n*, for example, *S*(4098)<==<=4<=+<=0<=+<=9<=+<=8<==<=21. Then the digital root of number *n* equals to: \n 1. *dr*(*n*)<==<=*S*(*n*), if *S*(*n*)<=<<=10; 1. *dr*(*n*)<==<=*dr*(<=*S*(*n*)<=), if *S*(*n*)<=≥<=10. \nFor example, *dr*(4098)<=<==<=<=*dr*(21)<=<==<=<=3.\n\nVasya is afraid of large numbers, so the numbers he works with are at most 101000. For all such numbers, he has proved that *dr*(*n*)<=<==<=<=*S*(<=*S*(<=*S*(<=*S*(*n*)<=)<=)<=) (*n*<=≤<=101000).\n\nNow Vasya wants to quickly find numbers with the given digital root. The problem is, he hasn't learned how to do that and he asked you to help him. You task is, given numbers *k* and *d*, find the number consisting of exactly *k* digits (the leading zeroes are not allowed), with digital root equal to *d*, or else state that such number does not exist.",
"input": "",
"output": "```python\nk,d=map(int,input().split())\r\nx=1\r\nfor i in range(1,k):\r\n x=x*10\r\nprint(x*d) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "According to rules of the Berland fashion, a jacket should be fastened by all the buttons except only one, but not necessarily it should be the last one. Also if the jacket has only one button, it should be fastened, so the jacket will not swinging open.\n\nYou are given a jacket with *n* buttons. Determine if it is fastened in a right way.",
"input": "",
"output": "```python\nn=int(input())\r\nl=list(map(int,input().split()))\r\nif l.count(0)==1 and l[-1]!=0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "DZY has a sequence *a*, consisting of *n* integers.\n\nWe'll call a sequence *a**i*,<=*a**i*<=+<=1,<=...,<=*a**j* (1<=≤<=*i*<=≤<=*j*<=≤<=*n*) a subsegment of the sequence *a*. The value (*j*<=-<=*i*<=+<=1) denotes the length of the subsegment.\n\nYour task is to find the longest subsegment of *a*, such that it is possible to change at most one number (change one number to any integer you want) from the subsegment to make the subsegment strictly increasing.\n\nYou only need to output the length of the subsegment you find.",
"input": "",
"output": "```python\nfrom collections import deque\nfrom sys import stdin\nlines = deque(line.strip() for line in stdin.readlines())\n\ndef nextline():\n return lines.popleft()\n\ndef types(cast):\n return tuple(int(x) for x in nextline().split())\n\ndef ints():\n return types(int)\n\ndef strs():\n return nextline().split()\n\ndef main():\n # lines will now contain all of the input's lines in a list\n (n,) = ints()\n nums = ints()\n if n == 1:\n return n\n inc = [1]*n\n for i in range(1, n):\n if nums[i] > nums[i-1]:\n inc[i] = inc[i-1]+1\n dec = [1]*n\n for i in range(n-2, -1, -1):\n if nums[i] < nums[i+1]:\n dec[i] = dec[i+1]+1\n m = max(inc[1], dec[-2])+1\n for i in range(1, n-1):\n if nums[i-1]+1 < nums[i+1]:\n length = inc[i-1]+dec[i+1]+1\n if length > m:\n m = length\n return m\n\nif __name__ == '__main__':\n print(main())\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pashmak decided to give Parmida a pair of flowers from the garden. There are *n* flowers in the garden and the *i*-th of them has a beauty number *b**i*. Parmida is a very strange girl so she doesn't want to have the two most beautiful flowers necessarily. She wants to have those pairs of flowers that their beauty difference is maximal possible!\n\nYour task is to write a program which calculates two things:\n 1. The maximum beauty difference of flowers that Pashmak can give to Parmida. 1. The number of ways that Pashmak can pick the flowers. Two ways are considered different if and only if there is at least one flower that is chosen in the first way and not chosen in the second way.",
"input": "",
"output": "```python\nnum = int(input())\r\nflowers = sorted(list(map(int, input().split())))\r\nfirstdigit = [e for e in flowers[0:num//2] if e == flowers[0]]\r\nlastdigit = [e for e in flowers[num//2::] if e == flowers[-1]]\r\ndifference = lastdigit[0] - firstdigit[0]\r\nprint(difference, len(firstdigit)*len(lastdigit))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You can not just take the file and send it. When Polycarp trying to send a file in the social network \"Codehorses\", he encountered an unexpected problem. If the name of the file contains three or more \"x\" (lowercase Latin letters \"x\") in a row, the system considers that the file content does not correspond to the social network topic. In this case, the file is not sent and an error message is displayed.\n\nDetermine the minimum number of characters to remove from the file name so after that the name does not contain \"xxx\" as a substring. Print 0 if the file name does not initially contain a forbidden substring \"xxx\".\n\nYou can delete characters in arbitrary positions (not necessarily consecutive). If you delete a character, then the length of a string is reduced by $1$. For example, if you delete the character in the position $2$ from the string \"exxxii\", then the resulting string is \"exxii\".",
"input": "",
"output": "```python\nn = int(input())\r\ns = input()\r\nk = \"\"\r\nfor var in s:\r\n if var == \"x\":\r\n k += \"x\"\r\n else:\r\n k += \" \"\r\ncnt = 0\r\nfor var in k.split():\r\n cnt += max(0, len(var)-2)\r\nprint(cnt)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are well-known formulas: , , . Also mathematicians found similar formulas for higher degrees.\n\nFind the value of the sum modulo 109<=+<=7 (so you should find the remainder after dividing the answer by the value 109<=+<=7).",
"input": "",
"output": "```python\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = [int(i) for i in input().split()]\r\nN = 10 ** 9 + 7\r\n\r\ny = [0]\r\nfor i in range(1, k + 2):\r\n y.append((y[-1] + pow(i, k, N)) % N)\r\n\r\nif n < k + 2:\r\n print(y[n] % N)\r\nelse:\r\n m = k + 2\r\n x = n\r\n modinv = [1] * m\r\n for i in range(2, m):\r\n modinv[i] = (-(N // i) * modinv[N % i]) % N\r\n\r\n invfac = [1]\r\n for i in range(1, m):\r\n invfac.append((invfac[-1]* modinv[i]) % N)\r\n invneg_fac = [invfac[i] * (1 - 2 * (i & 1)) for i in range(m)]\r\n\r\n xfac_down = [1]\r\n for j in reversed(range(x - (m - 1), x + 1)):\r\n xfac_down.append((xfac_down[-1]* j) % N)\r\n\r\n xfac_up = [1]\r\n for j in range(x - (m - 1), x + 1):\r\n xfac_up.append((xfac_up[-1] * j) % N)\r\n\r\n s = 0\r\n for i, pr in enumerate(y):\r\n pr = (pr * xfac_down[i]) % N\r\n pr = (pr * xfac_up[m - 1 - i]) % N\r\n pr = (pr * invfac[i]) % N\r\n pr = (pr * invneg_fac[m - i - 1]) % N\r\n s = (s + pr) % N\r\n\r\n print(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* pictures delivered for the new exhibition. The *i*-th painting has beauty *a**i*. We know that a visitor becomes happy every time he passes from a painting to a more beautiful one.\n\nWe are allowed to arranged pictures in any order. What is the maximum possible number of times the visitor may become happy while passing all pictures from first to last? In other words, we are allowed to rearrange elements of *a* in any order. What is the maximum possible number of indices *i* (1<=≤<=*i*<=≤<=*n*<=-<=1), such that *a**i*<=+<=1<=><=*a**i*.",
"input": "",
"output": "```python\ninput()\nl=list(map(int,input().split()))\nl=sorted(l)\ncount=0\nfor i in range(0,len(l)-1):\n if l[0] n*(n - 1)//2:\r\n print('Impossible')\r\nelse:\r\n ans = []\r\n cur = 0\r\n acc = 0\r\n for i in range(n):\r\n while cur + acc > m:\r\n ans.append(')')\r\n acc -= 1\r\n ans.append('(')\r\n cur += acc\r\n acc += 1\r\n left_cnt = 0\r\n for i in ans:\r\n if i == '(':\r\n left_cnt += 1\r\n else:\r\n left_cnt -= 1\r\n for i in range(left_cnt):\r\n ans.append(')')\r\n print(''.join(ans))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a set of points on a straight line. Each point has a color assigned to it. For point *a*, its neighbors are the points which don't have any other points between them and *a*. Each point has at most two neighbors - one from the left and one from the right.\n\nYou perform a sequence of operations on this set of points. In one operation, you delete all points which have a neighbor point of a different color than the point itself. Points are deleted simultaneously, i.e. first you decide which points have to be deleted and then delete them. After that you can perform the next operation etc. If an operation would not delete any points, you can't perform it.\n\nHow many operations will you need to perform until the next operation does not have any points to delete?",
"input": "",
"output": "```python\ns = list(input())\r\nk = 0\r\n\r\n\r\ndef check(s):\r\n ind = []\r\n for i, elem in enumerate(s):\r\n if i == 0:\r\n if s[i + 1] != elem:\r\n ind.append(i)\r\n elif i == len(s) - 1:\r\n if s[i - 1] != elem:\r\n ind.append(i)\r\n else:\r\n if s[i + 1] != elem:\r\n ind.append(i)\r\n elif s[i - 1] != elem:\r\n ind.append(i)\r\n return ind\r\n\r\n\r\nn = 0\r\nwhile s:\r\n len_now = len(s)\r\n delete = check(s)\r\n for index in delete:\r\n s.pop(index - n)\r\n n += 1\r\n n = 0\r\n if len(s) == len_now:\r\n break\r\n k += 1\r\n\r\nprint(k)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Slastyona and her loyal dog Pushok are playing a meaningless game that is indeed very interesting.\n\nThe game consists of multiple rounds. Its rules are very simple: in each round, a natural number *k* is chosen. Then, the one who says (or barks) it faster than the other wins the round. After that, the winner's score is multiplied by *k*2, and the loser's score is multiplied by *k*. In the beginning of the game, both Slastyona and Pushok have scores equal to one.\n\nUnfortunately, Slastyona had lost her notepad where the history of all *n* games was recorded. She managed to recall the final results for each games, though, but all of her memories of them are vague. Help Slastyona verify their correctness, or, to put it another way, for each given pair of scores determine whether it was possible for a game to finish with such result or not.",
"input": "",
"output": "```python\nn=int(input())\r\nfor i in range(n):\r\n a,b=[int(s) for s in input().split()]\r\n l=0\r\n a=a*b\r\n r=10**6+1\r\n while r-l>1:\r\n m=(l+r)//2\r\n k=m**3\r\n if ka:\r\n r=m\r\n else:\r\n print('Yes')\r\n break\r\n else:\r\n if l**3==a or r**3==a:\r\n print('Yes')\r\n else:\r\n print('No')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest. \n\nIn total, *n* students will attend, and before the start, every one of them has some positive integer rating. Students are indexed from 1 to *n*. Let's denote the rating of *i*-th student as *a**i*. After the contest ends, every student will end up with some positive integer position. GukiZ expects that his students will take places according to their ratings. \n\nHe thinks that each student will take place equal to . In particular, if student *A* has rating strictly lower then student *B*, *A* will get the strictly better position than *B*, and if two students have equal ratings, they will share the same position. \n\nGukiZ would like you to reconstruct the results by following his expectations. Help him and determine the position after the end of the contest for each of his students if everything goes as expected.",
"input": "",
"output": "```python\nx=int(input())\nstudents=\"\"\nplace=[]\n\n\nstudents=raw_input()\nstudent=list(students)\n\n\n\nfor i in range(x + (x-1)):\n place.append(0)\nfor i in range(x):\n for j in range(x + (x-1)):\n if student[i] mx:\r\n mx = c \r\nprint(mx)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be *n* problems, sorted by difficulty, i.e. problem 1 is the easiest and problem *n* is the hardest. Limak knows it will take him 5·*i* minutes to solve the *i*-th problem.\n\nLimak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs *k* minutes to get there from his house, where he will participate in the contest first.\n\nHow many problems can Limak solve if he wants to make it to the party?",
"input": "",
"output": "```python\nenter=list(map(int,input().split()))\r\n\r\nre_minute=240-enter[1]\r\nlist_of_five=[ x*5 for x in range(1,enter[0]+1)]\r\nres=0\r\n\r\nfor i in range(0,enter[0]):\r\n if re_minute >= list_of_five[i]:\r\n re_minute=re_minute-list_of_five[i]\r\n \r\n res+=1\r\n else:break\r\nprint(res)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Every year, hundreds of people come to summer camps, they learn new algorithms and solve hard problems.\n\nThis is your first year at summer camp, and you are asked to solve the following problem. All integers starting with 1 are written in one line. The prefix of these line is \"123456789101112131415...\". Your task is to print the *n*-th digit of this string (digits are numbered starting with 1.",
"input": "",
"output": "```python\nt=int(input())\r\nchk=\"123456789101112131415\"\r\nif t<=21:\r\n print(chk[t-1])\r\nelse:\r\n print(chk[(t//2)-1])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Reca company makes monitors, the most popular of their models is AB999 with the screen size *a*<=×<=*b* centimeters. Because of some production peculiarities a screen parameters are integer numbers. Recently the screen sides ratio *x*:<=*y* became popular with users. That's why the company wants to reduce monitor AB999 size so that its screen sides ratio becomes *x*:<=*y*, at the same time they want its total area to be maximal of all possible variants. Your task is to find the screen parameters of the reduced size model, or find out that such a reduction can't be performed.",
"input": "",
"output": "```python\ndef f(a,b,x,y):\r\n if a>=b and a%x ==0 and (a*y//x)<=b :\r\n return (a,(a*y//x))\r\n if a= c):\r\n\t\t\tarr[j] = max(arr[j], arr[j - c] + d)\r\n\t\t\tj -= 1\r\nprint arr[n]\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The little girl loves the problems on array queries very much.\n\nOne day she came across a rather well-known problem: you've got an array of $n$ elements (the elements of the array are indexed starting from 1); also, there are $q$ queries, each one is defined by a pair of integers $l_i$, $r_i$ $(1 \\le l_i \\le r_i \\le n)$. You need to find for each query the sum of elements of the array with indexes from $l_i$ to $r_i$, inclusive.\n\nThe little girl found the problem rather boring. She decided to reorder the array elements before replying to the queries in a way that makes the sum of query replies maximum possible. Your task is to find the value of this maximum sum.",
"input": "",
"output": "```python\nn,q=map(int,input().split())\na=sorted(map(int,input().split()))\nb=[0]*n\nfor _ in[0]*q:\n l,r=map(int,input().split())\n b[l-1]+=1\n if r f[1]):\r\n maxf = f[1]\r\nmaxs = x - maxf - t[0]\r\nif(maxs > s[1]):\r\n maxs = s[1]\r\nmaxt = x - maxs - maxf\r\nprint(\"{0} {1} {2}\".format(maxf, maxs, maxt))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.\n\nUnfortunately, not all numbers are lucky. Petya calls a number nearly lucky if the number of lucky digits in it is a lucky number. He wonders whether number *n* is a nearly lucky number.",
"input": "",
"output": "```python\nn = input()\r\nlucky_digits = n.count('4') + n.count('7')\r\n\r\nlucky_count = 0\r\nfor digit in str(lucky_digits):\r\n if digit == '4' or digit == '7':\r\n lucky_count += 1\r\n\r\nif lucky_count == len(str(lucky_digits)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "DZY loves chessboard, and he enjoys playing with it.\n\nHe has a chessboard of *n* rows and *m* columns. Some cells of the chessboard are bad, others are good. For every good cell, DZY wants to put a chessman on it. Each chessman is either white or black. After putting all chessmen, DZY wants that no two chessmen with the same color are on two adjacent cells. Two cells are adjacent if and only if they share a common edge.\n\nYou task is to find any suitable placement of chessmen on the given chessboard.",
"input": "",
"output": "```python\ndef sol(row, col, board, new_board = \"\"):\r\n for i in range(row):\r\n for j in range(col):\r\n if board[i][j] == \"-\": new_board += \"-\"\r\n elif (i + j) % 2 == 0: new_board += \"B\"\r\n else: new_board += \"W\"\r\n new_board += \"\\n\"\r\n \r\n return new_board\r\n\r\n\r\nif __name__ == \"__main__\":\r\n row, col = map(int, input().split())\r\n board = [[x for x in input()] for _ in range(row)]\r\n board = sol(row, col, board)\r\n print (board)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya likes numbers a lot. He found that number 123 in base 16 consists of two digits: the first is 7 and the second is 11. So the sum of digits of 123 in base 16 is equal to 18.\n\nNow he wonders what is an average value of sum of digits of the number *A* written in all bases from 2 to *A*<=-<=1.\n\nNote that all computations should be done in base 10. You should find the result as an irreducible fraction, written in base 10.",
"input": "",
"output": "```python\na, f = int(input()), 0\r\nk = a - 2\r\nfor i in range(2, a):\r\n s = 0\r\n b = a\r\n while True:\r\n s = s * 10 + b%i\r\n if b // i == 0:\r\n break\r\n b = b//i\r\n f += sum([int(i) for i in str(s)])\r\nr = 2\r\nwhile True:\r\n if f%r == 0 and k%r == 0:\r\n f //= r\r\n k //= r\r\n r = 2\r\n else:\r\n r = r + 1\r\n if r > k:\r\n break\r\nprint(f, \"/\", k, sep=\"\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given an array of *n* elements, you must make it a co-prime array in as few moves as possible.\n\nIn each move you can insert any positive integral number you want not greater than 109 in any place in the array.\n\nAn array is co-prime if any two adjacent numbers of it are co-prime.\n\nIn the number theory, two integers *a* and *b* are said to be co-prime if the only positive integer that divides both of them is 1.",
"input": "",
"output": "```python\n\nfrom math import *\n\nn=int(input())\na=list(map(int,input().split(\" \")))\n\nl=[]\nl.append(a[0])\n\nfor i in range(1,n):\n\tif(gcd(a[i],a[i-1])!=1):\n\t\tl.append(1)\n\n\tl.append(a[i])\n\nprint(len(l)-n)\nprint(*l)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a tetrahedron. Let's mark its vertices with letters *A*, *B*, *C* and *D* correspondingly.\n\nAn ant is standing in the vertex *D* of the tetrahedron. The ant is quite active and he wouldn't stay idle. At each moment of time he makes a step from one vertex to another one along some edge of the tetrahedron. The ant just can't stand on one place.\n\nYou do not have to do much to solve the problem: your task is to count the number of ways in which the ant can go from the initial vertex *D* to itself in exactly *n* steps. In other words, you are asked to find out the number of different cyclic paths with the length of *n* from vertex *D* to itself. As the number can be quite large, you should print it modulo 1000000007 (109<=+<=7).",
"input": "",
"output": "```python\n#!/usr/bin/env python3\ndef pow(b,e):\n if e == 1:\n return b\n if e%2 == 0:\n result = pow(b,e//2)\n result = result * result\n return result\n else:\n result = pow(b,e//2)\n result = result * result * b\n return result\n return result\n\nn = int(input(\"\"))\nif n%2 == 0:\n print(((pow(3,n)+3)//4)%1000000007)\nelse:\n print(((pow(3,n)-3)//4)%1000000007)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Kefa found *n* baloons. For convenience, we denote color of *i*-th baloon as *s**i* — lowercase letter of the Latin alphabet. Also Kefa has *k* friends. Friend will be upset, If he get two baloons of the same color. Kefa want to give out all baloons to his friends. Help Kefa to find out, can he give out all his baloons, such that no one of his friens will be upset — print «YES», if he can, and «NO», otherwise. Note, that Kefa's friend will not upset, if he doesn't get baloons at all.",
"input": "",
"output": "```python\nn, k = [int(x) for x in input().split()]\r\nl = list(input())\r\ns = list(set(l))\r\nf = -1\r\nfor i in s:\r\n count = 0\r\n for j in l:\r\n if i == j:\r\n count -= -1\r\n f = max(f, count)\r\nif f > k: print(\"NO\")\r\nelse: print(\"YES\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Let's consider a table consisting of *n* rows and *n* columns. The cell located at the intersection of *i*-th row and *j*-th column contains number *i*<=×<=*j*. The rows and columns are numbered starting from 1.\n\nYou are given a positive integer *x*. Your task is to count the number of cells in a table that contain number *x*.",
"input": "",
"output": "```python\nn, x = map(int, input().split())\r\ncn = 0\r\nif n >= x:\r\n cn += 2\r\n n = x // 2+1\r\nif x == 1:\r\n cn -= 1\r\nfor i in range(2, n):\r\n if x % i == 0:\r\n cn += 1\r\nprint(cn)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Alice and Bob love playing one-dimensional battle ships. They play on the field in the form of a line consisting of *n* square cells (that is, on a 1<=×<=*n* table).\n\nAt the beginning of the game Alice puts *k* ships on the field without telling their positions to Bob. Each ship looks as a 1<=×<=*a* rectangle (that is, it occupies a sequence of *a* consecutive squares of the field). The ships cannot intersect and even touch each other.\n\nAfter that Bob makes a sequence of \"shots\". He names cells of the field and Alice either says that the cell is empty (\"miss\"), or that the cell belongs to some ship (\"hit\").\n\nBut here's the problem! Alice like to cheat. May be that is why she responds to each Bob's move with a \"miss\". \n\nHelp Bob catch Alice cheating — find Bob's first move, such that after it you can be sure that Alice cheated.",
"input": "",
"output": "```python\nfrom bisect import bisect_left\r\n\r\ndef solve(n, k, a, m, x):\r\n pre = [0]*(n+2)\r\n pos = [0]*(n+2)\r\n d = [-1]*(n+2)\r\n \r\n for i in range(1, n+1):\r\n pre[i] = pre[i-1] + (i in x)\r\n pos[i] = pos[i-1] + ((i%(a+1)==0) and (i+a <= n) and (i-1 not in x) and (i+a not in x))\r\n \r\n l = 1\r\n r = m\r\n while l <= r:\r\n mid = (l+r)//2\r\n d[mid] = pre[n] - pre[mid] - (pos[n] - pos[mid])\r\n \r\n if d[mid] < k:\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n \r\n if l > m:\r\n return -1\r\n else:\r\n return l\r\nn, b, a = map(int, input().split())\r\nm = int(input())\r\nx = list(map(int, input().split()))\r\nprint(solve(n,b,a,m,x))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. \"Piece of cake\" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.",
"input": "",
"output": "```python\nn=int(input())\r\nx,y,z=[],[],[]\r\nfor i in range(n):\r\n s=list(map(int,input().split()))\r\n x.append(s[0])\r\n y.append(s[1])\r\n z.append(s[2])\r\nif sum(x)==0 and sum(y)==0 and sum(z)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.\n\nThe country where Sonya lives is an endless line. There is a city in each integer coordinate on this line. She has $n$ hotels, where the $i$-th hotel is located in the city with coordinate $x_i$. Sonya is a smart girl, so she does not open two or more hotels in the same city.\n\nSonya understands that her business needs to be expanded by opening new hotels, so she decides to build one more. She wants to make the minimum distance from this hotel to all others to be equal to $d$. The girl understands that there are many possible locations to construct such a hotel. Thus she wants to know the number of possible coordinates of the cities where she can build a new hotel. \n\nBecause Sonya is lounging in a jacuzzi in one of her hotels, she is asking you to find the number of cities where she can build a new hotel so that the minimum distance from the original $n$ hotels to the new one is equal to $d$.",
"input": "",
"output": "```python\nn,l=map(int,input().split())\r\nli=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(1,n):\r\n k= li[i]-li[i-1]\r\n if k-(2*l)==0:\r\n count+=1\r\n if k-(2*l)>0:\r\n count+=2\r\nprint(count+2)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word *s*. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word *s*.",
"input": "",
"output": "```python\nstring = str(input())\r\ntext = 'hello'\r\npointer = 0\r\nfor j in range(len(string)):\r\n if string[j] == text[pointer]:\r\n pointer += 1\r\n if pointer == len(text):\r\n break\r\nif pointer == len(text):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Winnie-the-Pooh likes honey very much! That is why he decided to visit his friends. Winnie has got three best friends: Rabbit, Owl and Eeyore, each of them lives in his own house. There are winding paths between each pair of houses. The length of a path between Rabbit's and Owl's houses is *a* meters, between Rabbit's and Eeyore's house is *b* meters, between Owl's and Eeyore's house is *c* meters.\n\nFor enjoying his life and singing merry songs Winnie-the-Pooh should have a meal *n* times a day. Now he is in the Rabbit's house and has a meal for the first time. Each time when in the friend's house where Winnie is now the supply of honey is about to end, Winnie leaves that house. If Winnie has not had a meal the required amount of times, he comes out from the house and goes to someone else of his two friends. For this he chooses one of two adjacent paths, arrives to the house on the other end and visits his friend. You may assume that when Winnie is eating in one of his friend's house, the supply of honey in other friend's houses recover (most probably, they go to the supply store).\n\nWinnie-the-Pooh does not like physical activity. He wants to have a meal *n* times, traveling minimum possible distance. Help him to find this distance.",
"input": "",
"output": "```python\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nm = min(a,b,c)\r\n\r\nif m == a:\r\n n -= 1\r\n dist = 0\r\n if n > 0:\r\n dist += n*a\r\n print(dist)\r\nelif m == b:\r\n n -= 1\r\n dist = 0\r\n if n > 0:\r\n dist += n*b\r\n print(dist)\r\nelse:\r\n n -= 1\r\n dist = 0\r\n if n>0:\r\n n -= 1\r\n dist += min(a,b)\r\n if n>0:\r\n dist += n*c\r\n print(dist)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarpus has been working in the analytic department of the \"F.R.A.U.D.\" company for as much as *n* days. Right now his task is to make a series of reports about the company's performance for the last *n* days. We know that the main information in a day report is value *a**i*, the company's profit on the *i*-th day. If *a**i* is negative, then the company suffered losses on the *i*-th day.\n\nPolycarpus should sort the daily reports into folders. Each folder should include data on the company's performance for several consecutive days. Of course, the information on each of the *n* days should be exactly in one folder. Thus, Polycarpus puts information on the first few days in the first folder. The information on the several following days goes to the second folder, and so on.\n\nIt is known that the boss reads one daily report folder per day. If one folder has three or more reports for the days in which the company suffered losses (*a**i*<=<<=0), he loses his temper and his wrath is terrible.\n\nTherefore, Polycarpus wants to prepare the folders so that none of them contains information on three or more days with the loss, and the number of folders is minimal.\n\nWrite a program that, given sequence *a**i*, will print the minimum number of folders.",
"input": "",
"output": "```python\nn=int(input())\r\na=list(map(int,input().split()))\r\npo=0\r\nne=0\r\nno=0\r\nl=[]\r\nfor i in range(n):\r\n\tif(a[i]<0):\r\n\t\tne=ne+1\r\n\tif(a[i]>=0):\r\n\t\tpo=po+1\r\n\tif(ne==2):\r\n\t\tl.append(po+ne)\r\n\t\tpo=0\r\n\t\tne=0\r\nif(len(l)>0):\r\n\tif(po>0 and ne==0 ):\r\n\t\tl[-1]=l[-1]+po\r\n\tif(ne>0 and po>0):\r\n\t\tl.append(ne+po)\r\n\tif(ne>0 and po==0):\r\n\t\tl.append(ne)\r\n\r\nelse:\r\n\tl.append(po+ne)\r\nprint(len(l))\r\nprint(*l)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Patrick has just finished writing a message to his sweetheart Stacey when he noticed that the message didn't look fancy. Patrick was nervous while writing the message, so some of the letters there were lowercase and some of them were uppercase.\n\nPatrick believes that a message is fancy if any uppercase letter stands to the left of any lowercase one. In other words, this rule describes the strings where first go zero or more uppercase letters, and then — zero or more lowercase letters.\n\nTo make the message fancy, Patrick can erase some letter and add the same letter in the same place in the opposite case (that is, he can replace an uppercase letter with the lowercase one and vice versa). Patrick got interested in the following question: what minimum number of actions do we need to make a message fancy? Changing a letter's case in the message counts as one action. Patrick cannot perform any other actions.",
"input": "",
"output": "```python\ns = input()\r\nn = len(s)\r\nsml = list(map(lambda i: int('a' <= i <= 'z'), s))\r\ncap = list(map(lambda i: int('A' <= i <= 'Z'), s))\r\nprefsml = [0] * (n+1)\r\nfor i in range(n):\r\n prefsml[i+1] = prefsml[i] + sml[i]\r\nsuffcap = [0] * (n+1)\r\nfor i in range(n-1, -1, -1):\r\n suffcap[i] = suffcap[i+1] + cap[i]\r\nres = 2e9\r\nfor i in range(n):\r\n res = min(res, prefsml[i+1] + suffcap[i])\r\nprint(res - 1)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently, a chaotic virus Hexadecimal advanced a new theorem which will shake the Universe. She thinks that each Fibonacci number can be represented as sum of three not necessary different Fibonacci numbers.\n\nLet's remember how Fibonacci numbers can be calculated. *F*0<==<=0, *F*1<==<=1, and all the next numbers are *F**i*<==<=*F**i*<=-<=2<=+<=*F**i*<=-<=1.\n\nSo, Fibonacci numbers make a sequence of numbers: 0, 1, 1, 2, 3, 5, 8, 13, ...\n\nIf you haven't run away from the PC in fear, you have to help the virus. Your task is to divide given Fibonacci number *n* by three not necessary different Fibonacci numbers or say that it is impossible.",
"input": "",
"output": "```python\nn = int(input())\r\n\r\na=0\r\nb=1\r\n\r\nfibs = [a,b]\r\n\r\nwhile(b 10:\r\n print(word[0] + str(len(word) - 2) + word[-1])\r\n else:\r\n print(word)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "When Xellos was doing a practice course in university, he once had to measure the intensity of an effect that slowly approached equilibrium. A good way to determine the equilibrium intensity would be choosing a sufficiently large number of consecutive data points that seems as constant as possible and taking their average. Of course, with the usual sizes of data, it's nothing challenging — but why not make a similar programming contest problem while we're at it?\n\nYou're given a sequence of *n* data points *a*1,<=...,<=*a**n*. There aren't any big jumps between consecutive data points — for each 1<=≤<=*i*<=<<=*n*, it's guaranteed that |*a**i*<=+<=1<=-<=*a**i*|<=≤<=1.\n\nA range [*l*,<=*r*] of data points is said to be almost constant if the difference between the largest and the smallest value in that range is at most 1. Formally, let *M* be the maximum and *m* the minimum value of *a**i* for *l*<=≤<=*i*<=≤<=*r*; the range [*l*,<=*r*] is almost constant if *M*<=-<=*m*<=≤<=1.\n\nFind the length of the longest almost constant range.",
"input": "",
"output": "```python\nINT_MAX = float('inf')\r\n\r\ndef main():\r\n\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n\r\n mx = -INT_MAX\r\n l = 0\r\n r = 1\r\n while l < n:\r\n while r < n:\r\n if max(a[l:r + 1]) - min(a[l:r + 1]) <= 1:\r\n mx = max(mx, r - l + 1)\r\n r += 1\r\n else:\r\n break\r\n l += 1\r\n\r\n\r\n print(mx)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have *n* distinct points on a plane, none of them lie on *OY* axis. Check that there is a point after removal of which the remaining points are located on one side of the *OY* axis.",
"input": "",
"output": "```python\nn=int(input())\r\na=0\r\ny1=0\r\nfor i in range(n):\r\n x,y=[int(i) for i in input().split()]\r\n if x<0:\r\n a+=1\r\n else:\r\n y1+=1\r\nif a<=1 or y1<=1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The farmer Polycarp has a warehouse with hay, which can be represented as an *n*<=×<=*m* rectangular table, where *n* is the number of rows, and *m* is the number of columns in the table. Each cell of the table contains a haystack. The height in meters of the hay located in the *i*-th row and the *j*-th column is equal to an integer *a**i*,<=*j* and coincides with the number of cubic meters of hay in the haystack, because all cells have the size of the base 1<=×<=1. Polycarp has decided to tidy up in the warehouse by removing an arbitrary integer amount of cubic meters of hay from the top of each stack. You can take different amounts of hay from different haystacks. Besides, it is allowed not to touch a stack at all, or, on the contrary, to remove it completely. If a stack is completely removed, the corresponding cell becomes empty and no longer contains the stack.\n\nPolycarp wants the following requirements to hold after the reorganization:\n - the total amount of hay remaining in the warehouse must be equal to *k*, - the heights of all stacks (i.e., cells containing a non-zero amount of hay) should be the same, - the height of at least one stack must remain the same as it was, - for the stability of the remaining structure all the stacks should form one connected region. \nThe two stacks are considered adjacent if they share a side in the table. The area is called connected if from any of the stack in the area you can get to any other stack in this area, moving only to adjacent stacks. In this case two adjacent stacks necessarily belong to the same area.\n\nHelp Polycarp complete this challenging task or inform that it is impossible.",
"input": "",
"output": "```python\nprint(\"_RANDOM_GUESS_1689592554.5392647\")# 1689592554.539285\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "wHAT DO WE NEED cAPS LOCK FOR?\n\nCaps lock is a computer keyboard key. Pressing it sets an input mode in which typed letters are capital by default. If it is pressed by accident, it leads to accidents like the one we had in the first passage. \n\nLet's consider that a word has been typed with the Caps lock key accidentally switched on, if: \n - either it only contains uppercase letters; - or all letters except for the first one are uppercase. \nIn this case we should automatically change the case of all letters. For example, the case of the letters that form words \"hELLO\", \"HTTP\", \"z\" should be changed.\n\nWrite a program that applies the rule mentioned above. If the rule cannot be applied, the program should leave the word unchanged.",
"input": "",
"output": "```python\ns = str(input())\r\nuppercase_test = 0\r\nuppercase_except_1 = 0\r\n\r\nfor i in range(len(s)):\r\n if ord(s[i])>=65 and ord(s[i])<=90:\r\n uppercase_test += 1\r\nfor i in range(1,len(s)):\r\n if ord(s[i])>=65 and ord(s[i])<=90:\r\n uppercase_except_1 += 1\r\n\r\nif uppercase_except_1 == len(s)-1:\r\n print(str(s[0]).upper()+str(s[1:]).lower())\r\nelif uppercase_test == len(s):\r\n print(str(s[0]).upper()+str(s[1:]).lower())\r\nelse:\r\n print(s)\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Linear Kingdom has exactly one tram line. It has *n* stops, numbered from 1 to *n* in the order of tram's movement. At the *i*-th stop *a**i* passengers exit the tram, while *b**i* passengers enter it. The tram is empty before it arrives at the first stop. Also, when the tram arrives at the last stop, all passengers exit so that it becomes empty.\n\nYour task is to calculate the tram's minimum capacity such that the number of people inside the tram at any time never exceeds this capacity. Note that at each stop all exiting passengers exit before any entering passenger enters the tram.",
"input": "",
"output": "```python\nstations = int(input())\r\nexist =0\r\nprivious_exist=0\r\nfor _ in range(stations):\r\n privious_exist = exist\r\n exit,enter = map(int,input().split(\" \"))\r\n if _ == stations :\r\n enter =0\r\n exist = privious_exist + (enter - exit)\r\n print(exist)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Tom is interested in power consumption of his favourite laptop. His laptop has three modes. In normal mode laptop consumes *P*1 watt per minute. *T*1 minutes after Tom moved the mouse or touched the keyboard for the last time, a screensaver starts and power consumption changes to *P*2 watt per minute. Finally, after *T*2 minutes from the start of the screensaver, laptop switches to the \"sleep\" mode and consumes *P*3 watt per minute. If Tom moves the mouse or touches the keyboard when the laptop is in the second or in the third mode, it switches to the first (normal) mode. Tom's work with the laptop can be divided into *n* time periods [*l*1,<=*r*1],<=[*l*2,<=*r*2],<=...,<=[*l**n*,<=*r**n*]. During each interval Tom continuously moves the mouse and presses buttons on the keyboard. Between the periods Tom stays away from the laptop. Find out the total amount of power consumed by the laptop during the period [*l*1,<=*r**n*].",
"input": "",
"output": "```python\nn, p1, p2, p3, t1, t2 = list(map(int, input().split(\" \")))\r\n\r\nl = []\r\nfor _ in range(n):\r\n l += list(map(int, input().split(\" \")))\r\n\r\np = 0\r\nfor i in range(len(l) // 2 - 1):\r\n x = l[2 * i + 2] - l[2 * i + 1]\r\n p += p1 * min(t1, x) + p2 * min(t2, max(0, x - t1)) + p3 * max(0, x - t1 - t2)\r\n\r\nfor i in range(len(l) // 2):\r\n x = l[2 * i + 1] - l[2 * i]\r\n p += p1 * x \r\n\r\nprint(p)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "As a result of Pinky and Brain's mysterious experiments in the Large Hadron Collider some portals or black holes opened to the parallel dimension. And the World Evil has crept to the veil between their world and ours. Brain quickly evaluated the situation and he understood that the more evil tentacles creep out and become free, the higher is the possibility that Brain will rule the world.\n\nThe collider's constriction is a rectangular grid rolled into a cylinder and consisting of *n* rows and *m* columns such as is shown in the picture below:\n\nIn this example *n*<==<=4, *m*<==<=5. Dotted lines are corridores that close each column to a ring, i. e. connect the *n*-th and the 1-th rows of the grid.\n\nIn the leftmost column of the grid the portals are situated and the tentacles of the World Evil are ready to creep out from there. In the rightmost column the exit doors are located. The tentacles can only get out through those doors. The segments joining the nodes of the grid are corridors.\n\nBrain would be glad to let all the tentacles out but he faces a problem: the infinite number of tentacles can creep out of the portals, every tentacle possesses infinite length and some width and the volume of the corridors are, unfortunately, quite limited. Brain could approximately evaluate the maximal number of tentacles that will be able to crawl through every corridor.\n\nNow help the mice to determine the maximal number of tentacles of the World Evil that will crawl out of the Large Hadron Collider.",
"input": "",
"output": "```python\nprint(\"_RANDOM_GUESS_1689416376.18644\")# 1689416376.1864593\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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 network.\n\nWe know that each server takes one second to recompress a one minute fragment. Thus, any server takes *m* seconds to recompress a *m* minute video.\n\nWe know the time when each of the *n* videos were uploaded to the network (in seconds starting from the moment all servers started working). All videos appear at different moments of time and they are recompressed in the order they appear. If some video appeared at time *s*, then its recompressing can start at that very moment, immediately. Some videos can await recompressing when all the servers are busy. In this case, as soon as a server is available, it immediately starts recompressing another video. The videos that await recompressing go in a queue. If by the moment the videos started being recompressed some servers are available, then any of them starts recompressing the video.\n\nFor each video find the moment it stops being recompressed.",
"input": "",
"output": "```python\nn, k = (int(p) for p in input().split())\nInputVideo = [] \nDownLoad = []\nOutputVideo = []\nfor o in range(n):\n I, D = (int(v) for v in input().split())\n InputVideo.append(I)\n DownLoad.append(D)\ni = 0\nfor j in range(k):\n OutputVideo.append(InputVideo[i] + DownLoad[i])\n i += 1\n if i == n:\n break\nbzzz=len(OutputVideo)-k\nwhile(i != n):\n flag = 0\n for l in range(bzzz,k):\n if (InputVideo[i] >= OutputVideo[l]):\n OutputVideo.append(InputVideo[i] + DownLoad[i])\n flag = 1\n break\n if (flag == 0):\n OutputVideo.append(min(OutputVideo[len(OutputVideo)-k:]) + DownLoad[i])\n i += 1\nfor elem in OutputVideo:\n print(elem)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two players play a game.\n\nInitially there are $n$ integers $a_1, a_2, \\ldots, a_n$ written on the board. Each turn a player selects one number and erases it from the board. This continues until there is only one number left on the board, i. e. $n - 1$ turns are made. The first player makes the first move, then players alternate turns.\n\nThe first player wants to minimize the last number that would be left on the board, while the second player wants to maximize it.\n\nYou want to know what number will be left on the board after $n - 1$ turns if both players make optimal moves.",
"input": "",
"output": "```python\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nfor i in range(n - 1):\r\n if i % 2 == 0:\r\n del a[-1]\r\n elif i % 2 == 1:\r\n del a[0]\r\n\r\nprint(a[0])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "This problem differs from one which was on the online contest.\n\nThe sequence *a*1,<=*a*2,<=...,<=*a**n* is called increasing, if *a**i*<=<<=*a**i*<=+<=1 for *i*<=<<=*n*.\n\nThe sequence *s*1,<=*s*2,<=...,<=*s**k* is called the subsequence of the sequence *a*1,<=*a*2,<=...,<=*a**n*, if there exist such a set of indexes 1<=≤<=*i*1<=<<=*i*2<=<<=...<=<<=*i**k*<=≤<=*n* that *a**i**j*<==<=*s**j*. In other words, the sequence *s* can be derived from the sequence *a* by crossing out some elements.\n\nYou are given two sequences of integer numbers. You are to find their longest common increasing subsequence, i.e. an increasing sequence of maximum length that is the subsequence of both sequences.",
"input": "",
"output": "```python\nn = int(input())\r\nA = list(map(int, input().split()))\r\nm = int(input())\r\nB = list(map(int, input().split()))\r\nF = [[0 for j in range(m)] for i in range(n)]\r\nP = [0 for j in range(m)]\r\nfor i in range(n):\r\n s = -1\r\n t = 0\r\n for j in range(m):\r\n F[i][j] = F[i-1][j]\r\n if A[i] > B[j] and F[i-1][j] > t:\r\n s = j\r\n t = F[i-1][j] \r\n elif A[i] == B[j] and F[i-1][j] < t+1:\r\n F[i][j] = t + 1 \r\n P[j] = s \r\nR = []\r\nl = 0\r\nfor j in range(m):\r\n if F[n-1][l] < F[n-1][j]:\r\n l = j\r\nwhile l != -1:\r\n R.append(B[l])\r\n l = P[l]\r\nprint(len(R))\r\nprint(*R[::-1])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Little Elephant has an integer *a*, written in the binary notation. He wants to write this number on a piece of paper.\n\nTo 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* in the binary record. At that a new number appears. It consists of the remaining binary digits, written in the corresponding order (possible, with leading zeroes).\n\nThe Little Elephant wants the number he is going to write on the paper to be as large as possible. Help him find the maximum number that he can obtain after deleting exactly one binary digit and print it in the binary notation.",
"input": "",
"output": "```python\na = input()\r\nfor i in range(len(a)):\r\n if a[i] == \"0\":\r\n print(a[:i] + a[i + 1:])\r\n quit()\r\nprint(a[:len(a) - 1])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their competitions in peaceful game of Credit Cards.\n\nRules of this game are simple: each player bring his favourite *n*-digit credit card. Then both players name the digits written on their cards one by one. If two digits are not equal, then the player, whose digit is smaller gets a flick (knock in the forehead usually made with a forefinger) from the other player. For example, if *n*<==<=3, Sherlock's card is 123 and Moriarty's card has number 321, first Sherlock names 1 and Moriarty names 3 so Sherlock gets a flick. Then they both digit 2 so no one gets a flick. Finally, Sherlock names 3, while Moriarty names 1 and gets a flick.\n\nOf course, Sherlock will play honestly naming digits one by one in the order they are given, while Moriary, as a true villain, plans to cheat. He is going to name his digits in some other order (however, he is not going to change the overall number of occurences of each digit). For example, in case above Moriarty could name 1, 2, 3 and get no flicks at all, or he can name 2, 3 and 1 to give Sherlock two flicks.\n\nYour goal is to find out the minimum possible number of flicks Moriarty will get (no one likes flicks) and the maximum possible number of flicks Sherlock can get from Moriarty. Note, that these two goals are different and the optimal result may be obtained by using different strategies.",
"input": "",
"output": "```python\nimport bisect\nn = int(input())\n\ns = list(input())\nt = list(input())\n\ns1 = ''\nt1 = ''\n\nfor i in range(len(s)):\n s1+=s[i]\n t1+=t[i]\n\nfor i in range(len(s)):\n s[i] = int(s[i])\n t[i] = int(t[i])\ns = sorted(s)\nt = sorted(t)\ns1 = sorted(s1)\nt1 = sorted(t1)\nwin = 0\ni = 0\nwhile is[i]:\n win+=1\n del t[j]\n break\n else:\n j+=1\n i+=1\nmark = 0\nfor i in range(len(t1)):\n k = bisect.bisect_right(s1,t1[i])\n if k-1>=0:\n if t1[i] >= s1[k-1]:\n mark+=1\n del s1[k-1]\n\nprint(len(s1))\nprint(win)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A well-known art union called \"Kalevich is Alive!\" manufactures objects d'art (pictures). The union consists of *n* painters who decided to organize their work as follows.\n\nEach painter uses only the color that was assigned to him. The colors are distinct for all painters. Let's assume that the first painter uses color 1, the second one uses color 2, and so on. Each picture will contain all these *n* colors. Adding the *j*-th color to the *i*-th picture takes the *j*-th painter *t**ij* units of time.\n\nOrder is important everywhere, so the painters' work is ordered by the following rules:\n - Each picture is first painted by the first painter, then by the second one, and so on. That is, after the *j*-th painter finishes working on the picture, it must go to the (*j*<=+<=1)-th painter (if *j*<=<<=*n*); - each painter works on the pictures in some order: first, he paints the first picture, then he paints the second picture and so on; - each painter can simultaneously work on at most one picture. However, the painters don't need any time to have a rest; - as soon as the *j*-th painter finishes his part of working on the picture, the picture immediately becomes available to the next painter. \nGiven that the painters start working at time 0, find for each picture the time when it is ready for sale.",
"input": "",
"output": "```python\nm,n=map(int,input().split())\r\nf=[[0 for i in range(0,n)] for j in range(0,m)]\r\nfor i in range(0,m):\r\n a=list( map(int,input().split()) )\r\n for j in range(0,n):\r\n if i>0:\r\n f[i][j]=max(f[i-1][j], f[i][j])\r\n if j>0:\r\n f[i][j]=max(f[i][j-1], f[i][j])\r\n f[i][j]+=a[j]\r\n print(f[i][n-1])\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Alice got an array of length $n$ as a birthday present once again! This is the third year in a row! \n\nAnd what is more disappointing, it is overwhelmengly boring, filled entirely with zeros. Bob decided to apply some changes to the array to cheer up Alice.\n\nBob has chosen $m$ changes of the following form. For some integer numbers $x$ and $d$, he chooses an arbitrary position $i$ ($1 \\le i \\le n$) and for every $j \\in [1, n]$ adds $x + d \\cdot dist(i, j)$ to the value of the $j$-th cell. $dist(i, j)$ is the distance between positions $i$ and $j$ (i.e. $dist(i, j) = |i - j|$, where $|x|$ is an absolute value of $x$).\n\nFor example, if Alice currently has an array $[2, 1, 2, 2]$ and Bob chooses position $3$ for $x = -1$ and $d = 2$ then the array will become $[2 - 1 + 2 \\cdot 2,~1 - 1 + 2 \\cdot 1,~2 - 1 + 2 \\cdot 0,~2 - 1 + 2 \\cdot 1]$ = $[5, 2, 1, 3]$. Note that Bob can't choose position $i$ outside of the array (that is, smaller than $1$ or greater than $n$).\n\nAlice will be the happiest when the elements of the array are as big as possible. Bob claimed that the arithmetic mean value of the elements will work fine as a metric.\n\nWhat is the maximum arithmetic mean value Bob can achieve?",
"input": "",
"output": "```python\nn, m = map(int, input().split())\nx = y = z = 0\nwhile m != 0:\n m -= 1\n a, b = map(int, input().split())\n x += a\n if b > 0:\n y += b\n else:\n z += b\n##print(x, y, z)\nans = (n * (n - 1) // 2) * y\nif n & 1:\n ans += ((n // 2) * ((n // 2) - 1) // 2) * z\nelse:\n ans += ((((n - 1) // 2) * (((n - 1) // 2) - 1) // 2) + (n // 2)) * z\nans += x * n\nprint(ans / n)\n\n\t\t\t \t\t \t \t \t\t \t\t\t \t\t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given *n* integers *a*1,<=*a*2,<=...,<=*a**n*. Find the number of pairs of indexes *i*,<=*j* (*i*<=<<=*j*) that *a**i*<=+<=*a**j* is a power of 2 (i. e. some integer *x* exists so that *a**i*<=+<=*a**j*<==<=2*x*).",
"input": "",
"output": "```python\nfrom math import log2\r\n\r\nn = int(input())\r\nlista = [*map(int, input().split())]\r\n\r\na = 0\r\n\r\nfor _ in lista:\r\n num = log2(_)\r\n if num.is_integer() == True:\r\n a += 1\r\n\r\nprint(a)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two integers *n* and *k*. Find *k*-th smallest divisor of *n*, or report that it doesn't exist.\n\nDivisor of *n* is any such natural number, that *n* can be divided by it without remainder.",
"input": "",
"output": "```python\nfrom math import sqrt\r\ndef kthDivisor(n, k):\r\n p=int(sqrt(n))\r\n \r\n alist=[]\r\n for i in range(1,p+1,1):\r\n if (n%i==0):\r\n alist.append(i)\r\n if (i !=p):\r\n alist.append(int(n/i))\r\n alist.sort()\r\n print(alist)\r\n if k >len(alist):\r\n print(-1)\r\n else:\r\n return alist[k-1]\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a following process. \n\nThere is a platform with $n$ columns. $1 \\times 1$ squares are appearing one after another in some columns on this platform. If there are no squares in the column, a square will occupy the bottom row. Otherwise a square will appear at the top of the highest square of this column. \n\nWhen all of the $n$ columns have at least one square in them, the bottom row is being removed. You will receive $1$ point for this, and all the squares left will fall down one row. \n\nYou task is to calculate the amount of points you will receive.",
"input": "",
"output": "```python\nif __name__ == '__main__':\n n, m = input().split()\n n = int(n)\n m = int(m)\n\n squares = input().split(\" \")\n cont = [0] * n\n for i in squares:\n cont[int(i) - 1] += 1\n print(min(cont))\n\n\n\t \t \t\t\t\t\t \t\t\t \t \t \t\t\t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kefa decided to make some money doing business on the Internet for exactly *n* days. He knows that on the *i*-th day (1<=≤<=*i*<=≤<=*n*) he makes *a**i* money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence *a**i*. Let us remind you that the subsegment of the sequence is its continuous fragment. A subsegment of numbers is called non-decreasing if all numbers in it follow in the non-decreasing order.\n\nHelp Kefa cope with this task!",
"input": "",
"output": "```python\ndias = int(input())\r\ndinero = list(map(int,input().split()))\r\n\r\ncanti_num_ord = 1\r\nj = 1\r\n\r\nfor i in range(1,dias):\r\n if dinero[i] >= dinero[i-1]:\r\n j += 1\r\n else:\r\n canti_num_ord = j\r\n j = 1\r\n\r\n\r\nprint(max(canti_num_ord,j))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Every year, hundreds of people come to summer camps, they learn new algorithms and solve hard problems.\n\nThis is your first year at summer camp, and you are asked to solve the following problem. All integers starting with 1 are written in one line. The prefix of these line is \"123456789101112131415...\". Your task is to print the *n*-th digit of this string (digits are numbered starting with 1.",
"input": "",
"output": "```python\nn = int(input())\r\nif n < 10:\r\n print(n)\r\nelif n < 90 * 2 + 9:\r\n x = (n - 10) // 2 + 10\r\n if n % 2:\r\n print(x % 10)\r\n else:\r\n print(x // 10)\r\nelif n < 900 * 3 + 90 * 2 + 9:\r\n x = (n - 10 - 90 * 2) // 3 + 100\r\n print(x)\r\n if (n - 10 - 90 * 2) % 3 == 1:\r\n print(x % 10)\r\n elif (n - 10 - 90 * 2) % 3 == 2:\r\n print(x // 10 % 10)\r\n else:\r\n print(x // 100)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Tavas is a cheerleader in the new sports competition named \"Pashmaks\".\n\nThis competition consists of two part: swimming and then running. People will immediately start running *R* meters after they finished swimming exactly *S* meters. A winner is a such person that nobody else finishes running before him/her (there may be more than one winner).\n\nBefore the match starts, Tavas knows that there are *n* competitors registered for the match. Also, he knows that *i*-th person's swimming speed is *s**i* meters per second and his/her running speed is *r**i* meters per second. Unfortunately, he doesn't know the values of *R* and *S*, but he knows that they are real numbers greater than 0.\n\nAs a cheerleader, Tavas wants to know who to cheer up. So, he wants to know all people that might win. We consider a competitor might win if and only if there are some values of *R* and *S* such that with these values, (s)he will be a winner.\n\nTavas isn't really familiar with programming, so he asked you to help him.",
"input": "",
"output": "```python\nprint(\"_RANDOM_GUESS_1689183198.028277\")# 1689183198.0283232\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Zxr960115 is owner of a large farm. He feeds *m* cute cats and employs *p* feeders. There's a straight road across the farm and *n* hills along the road, numbered from 1 to *n* from left to right. The distance between hill *i* and (*i*<=-<=1) is *d**i* meters. The feeders live in hill 1.\n\nOne day, the cats went out to play. Cat *i* went on a trip to hill *h**i*, finished its trip at time *t**i*, and then waited at hill *h**i* for a feeder. The feeders must take all the cats. Each feeder goes straightly from hill 1 to *n* without waiting at a hill and takes all the waiting cats at each hill away. Feeders walk at a speed of 1 meter per unit time and are strong enough to take as many cats as they want.\n\nFor example, suppose we have two hills (*d*2<==<=1) and one cat that finished its trip at time 3 at hill 2 (*h*1<==<=2). Then if the feeder leaves hill 1 at time 2 or at time 3, he can take this cat, but if he leaves hill 1 at time 1 he can't take it. If the feeder leaves hill 1 at time 2, the cat waits him for 0 time units, if the feeder leaves hill 1 at time 3, the cat waits him for 1 time units.\n\nYour task is to schedule the time leaving from hill 1 for each feeder so that the sum of the waiting time of all cats is minimized.",
"input": "",
"output": "```python\nprint(\"_RANDOM_GUESS_1693418570.8905473\")# 1693418570.8905644\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\nn=input()\r\nupp=0\r\n\r\nfor i in n:\r\n if i.isupper():\r\n upp+=1\r\nif upp>len(n)/2:\r\n n=n.upper()\r\nelse:\r\n n=n.lower()\r\nprint(n)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings *a* and *b* of equal length are called equivalent in one of the two cases: \n 1. They are equal. 1. If we split string *a* into two halves of the same size *a*1 and *a*2, and string *b* into two halves of the same size *b*1 and *b*2, then one of the following is correct: *a*1 is equivalent to *b*1, and *a*2 is equivalent to *b*2 1. *a*1 is equivalent to *b*2, and *a*2 is equivalent to *b*1 \nAs a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.\n\nGerald has already completed this home task. Now it's your turn!",
"input": "",
"output": "```python\ntry:\r\n import sys\r\n from functools import lru_cache, cmp_to_key\r\n from heapq import merge, heapify, heappop, heappush\r\n # from math import *\r\n from collections import defaultdict as dd, deque, Counter as C\r\n from itertools import combinations as comb, permutations as perm\r\n from bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\n from time import perf_counter\r\n from fractions import Fraction\r\n import copy\r\n from copy import deepcopy\r\n import time\r\n starttime = time.time()\r\n mod = int(pow(10, 9) + 7)\r\n mod2 = 998244353\r\n\r\n def data(): return sys.stdin.readline().strip()\r\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\n def L(): return list(sp())\r\n def sl(): return list(ssp())\r\n def sp(): return map(int, data().split())\r\n def ssp(): return map(str, data().split())\r\n def l1d(n, val=0): return [val for i in range(n)]\r\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\n def A2(n,m): return [[0]*m for i in range(n)]\r\n def A(n):return [0]*n\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n # from sys import stdin\r\n # input = stdin.buffer.readline\r\n # I = lambda : list(map(int,input().split()))\r\n # import sys\r\n # input=sys.stdin.readline\r\n import math\r\n import string\r\n\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\n\r\ndef compute_hash( s ):\r\n\r\n \"\"\"\r\n This will work work string consisting of only lower characters\r\n If you want to do it for \r\n - only upper characters: change ord(\"a\") to ord(\"A\")\r\n - both lower and upper: change p to 53\r\n \"\"\"\r\n\r\n p = 31\r\n mod = 10**9 + 7\r\n hash_value = 0\r\n p_pow = 1\r\n H = [0]\r\n for c in s:\r\n hash_value = ( hash_value + ( ord(c) - ord(\"a\") + 1) * p_pow ) % mod\r\n p_pow = ( p_pow * p ) % mod\r\n H.append(hash_value)\r\n\r\n return H\r\na = input()\r\nb = input()\r\n\r\n\r\nHa = compute_hash(a)\r\nHb = compute_hash(b)\r\n\r\nn = len(a)\r\ndef rec(al,ar,bl,br):\r\n\r\n if ar-al!=br-bl:\r\n return False\r\n\r\n hash_a = ((Ha[ar] - Ha[al-1])*pow(pow(31,al-1,mod),mod-2,mod))%mod\r\n hash_b = ((Hb[br] - Hb[bl-1])*pow(pow(31,bl-1,mod),mod-2,mod))%mod\r\n\r\n if hash_a == hash_b:\r\n return True\r\n if (ar-al+1)%2:\r\n return False\r\n mid = (ar-al+1)//2\r\n \r\n ans = ( rec(al,al+mid-1,bl,bl+mid-1) & rec(al+mid,ar,bl+mid,br) ) | ( rec(al,al+mid-1,bl+mid,br) & rec(al+mid,ar,bl,bl+mid-1) )\r\n # print(al, ar, bl, br, ans, hash_a, hash_b)\r\n return ans\r\n\r\nif rec(1,n,1,n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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.\n\nThere 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 contain exactly one flower: a rose or a lily.\n\nShe knows that exactly $m$ people will visit this exhibition. The $i$-th visitor will visit all flowers from $l_i$ to $r_i$ inclusive. The girl knows that each segment has its own beauty that is equal to the product of the number of roses and the number of lilies.\n\nSonya wants her exhibition to be liked by a lot of people. That is why she wants to put the flowers in such way that the sum of beauties of all segments would be maximum possible.",
"input": "",
"output": "```python\ntd=list(map(int,input().split()))\r\nt=td[0]\r\nd=td[1]\r\nl=[]\r\nfor i in range(1,t+1):\r\n if(i%2==0):\r\n l.append(\"1\")\r\n else:\r\n l.append(\"0\")\r\nfor i in l:\r\n print(i,end='')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After the lessons *n* groups of schoolchildren went outside and decided to visit Polycarpus to celebrate his birthday. We know that the *i*-th group consists of *s**i* friends (1<=≤<=*s**i*<=≤<=4), and they want to go to Polycarpus together. They decided to get there by taxi. Each car can carry at most four passengers. What minimum number of cars will the children need if all members of each group should ride in the same taxi (but one taxi can take more than one group)?",
"input": "",
"output": "```python\ndef min_number_of_taxis(n, groups):\r\n count = [0] * 5\r\n for group in groups:\r\n count[group] += 1\r\n\r\n taxis = count[4]\r\n taxis += count[3]\r\n count[1] = max(0, count[1] - count[3])\r\n taxis += count[2] // 2\r\n count[2] %= 2\r\n\r\n if count[2] == 1:\r\n taxis += 1\r\n count[1] = max(0, count[1] - 2)\r\n\r\n taxis += (count[1] + 3) // 4\r\n\r\n return taxis\r\n\r\nn = int(input())\r\ngroups = list(map(int, input().split()))\r\nresult = min_number_of_taxis(n, groups)\r\nprint(result)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Eleven wants to choose a new name for herself. As a bunch of geeks, her friends suggested an algorithm to choose a name for her. Eleven wants her name to have exactly *n* characters. \n\nHer friend suggested that her name should only consist of uppercase and lowercase letters 'O'. More precisely, they suggested that the *i*-th letter of her name should be 'O' (uppercase) if *i* is a member of Fibonacci sequence, and 'o' (lowercase) otherwise. The letters in the name are numbered from 1 to *n*. Fibonacci sequence is the sequence *f* where\n - *f*1<==<=1, - *f*2<==<=1, - *f**n*<==<=*f**n*<=-<=2<=+<=*f**n*<=-<=1 (*n*<=><=2). \nAs her friends are too young to know what Fibonacci sequence is, they asked you to help Eleven determine her new name.",
"input": "",
"output": "```python\ndef fib(limit):\r\n a=[1,2]\r\n while a[-1]<=limit:\r\n a.append(a[-1]+a[-2])\r\n return a\r\n\r\nn=int(input())\r\nlst=fib(n)\r\ns=\"\"\r\npos=0\r\nfor i in range(1,n+1):\r\n if lst[pos]==i:\r\n pos+=1\r\n s+=\"O\"\r\n else:\r\n s+=\"o\"\r\nprint(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Consider the function *p*(*x*), where *x* is an array of *m* integers, which returns an array *y* consisting of *m*<=+<=1 integers such that *y**i* is equal to the sum of first *i* elements of array *x* (0<=≤<=*i*<=≤<=*m*).\n\nYou have an infinite sequence of arrays *A*0,<=*A*1,<=*A*2..., where *A*0 is given in the input, and for each *i*<=≥<=1 *A**i*<==<=*p*(*A**i*<=-<=1). Also you have a positive integer *k*. You have to find minimum possible *i* such that *A**i* contains a number which is larger or equal than *k*.",
"input": "",
"output": "```python\nn, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\ncnt, ind, mx = 0, [], 0\r\nfor i in range(n):\r\n if a[i] > 0:\r\n cnt += 1\r\n ind.append(i)\r\n mx = max(mx, a[i])\r\ndef p(a):\r\n pref = [0]\r\n for i in range(len(a)):\r\n pref.append(pref[-1] + a[i])\r\n return pref\r\nif cnt > 7 or mx >= k:\r\n it = 0\r\n while True:\r\n mx = 0\r\n for i in range(len(a)):\r\n mx = max(mx, a[i])\r\n if mx >= k:\r\n print(it)\r\n exit()\r\n a = p(a)\r\n it += 1\r\nl, r = 0, k\r\nwhile r - l > 1:\r\n m = (l + r) >> 1\r\n sum = 0\r\n f = False\r\n for i in ind:\r\n c, j = a[i], n - 1 - i\r\n if j > m:\r\n continue\r\n while j > 0:\r\n c *= m + j - 1\r\n j -= 1\r\n j = i\r\n while j > 0:\r\n c //= j\r\n j -= 1\r\n sum += c\r\n if sum >= k:\r\n f = True\r\n break\r\n if f:\r\n r = m\r\n else:\r\n l = m\r\nprint(r)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be *n* problems, sorted by difficulty, i.e. problem 1 is the easiest and problem *n* is the hardest. Limak knows it will take him 5·*i* minutes to solve the *i*-th problem.\n\nLimak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs *k* minutes to get there from his house, where he will participate in the contest first.\n\nHow many problems can Limak solve if he wants to make it to the party?",
"input": "",
"output": "```python\nn, m = list(map(int, input().split()))\r\n\r\ntotal_time_dk = 4 * 60\r\n\r\nmin_time_dk = total_time_dk - m\r\n\r\ntotal = 0\r\ny = 0\r\n\r\nfor i in range(1, n+1):\r\n answer_time = 5\r\n x = answer_time * i\r\n y += x\r\n if min_time_dk - y >= 0:\r\n total += 1\r\n\r\nprint(total)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Summer holidays! Someone is going on trips, someone is visiting grandparents, but someone is trying to get a part-time job. This summer Noora decided that she wants to earn some money, and took a job in a shop as an assistant.\n\nShop, where Noora is working, has a plan on the following *n* days. For each day sales manager knows exactly, that in *i*-th day *k**i* products will be put up for sale and exactly *l**i* clients will come to the shop that day. Also, the manager is sure, that everyone, who comes to the shop, buys exactly one product or, if there aren't any left, leaves the shop without buying anything. Moreover, due to the short shelf-life of the products, manager established the following rule: if some part of the products left on the shelves at the end of the day, that products aren't kept on the next day and are sent to the dump.\n\nFor advertising purposes manager offered to start a sell-out in the shop. He asked Noora to choose any *f* days from *n* next for sell-outs. On each of *f* chosen days the number of products were put up for sale would be doubled. Thus, if on *i*-th day shop planned to put up for sale *k**i* products and Noora has chosen this day for sell-out, shelves of the shop would keep 2·*k**i* products. Consequently, there is an opportunity to sell two times more products on days of sell-out.\n\nNoora's task is to choose *f* days to maximize total number of sold products. She asks you to help her with such a difficult problem.",
"input": "",
"output": "```python\nplanDays,chosenDays=map(int,input().split())\r\ntotal=[0 for _ in range(planDays)]\r\nfor i in range(planDays):\r\n products,clients=map(int,input().split())\r\n if (i+1)% chosenDays ==0:\r\n products=2*products\r\n if products >= clients:\r\n total[i]= clients\r\n elif products < clients and products !=0 :\r\n total[i]=clients\r\nprint(sum(total))\r\n \r\n \r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Amr is a young coder who likes music a lot. He always wanted to learn how to play music but he was busy coding so he got an idea.\n\nAmr has *n* instruments, it takes *a**i* days to learn *i*-th instrument. Being busy, Amr dedicated *k* days to learn how to play the maximum possible number of instruments.\n\nAmr asked for your help to distribute his free days between instruments so that he can achieve his goal.",
"input": "",
"output": "```python\nn, k = map(int,input().split()) \r\nsum=0 \r\nl2=[]\r\nl=sorted([(x,i) for i,x in enumerate(map(int,input().split()),1)])\r\n \r\nfor i,j in l:\r\n sum=sum+i \r\n if(sum<=k): \r\n l2.append(j) \r\nprint(len(l2)) \r\nfor h in l2:\r\n print(h, end=' ') \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The new operating system BerOS has a nice feature. It is possible to use any number of characters '/' as a delimiter in path instead of one traditional '/'. For example, strings //usr///local//nginx/sbin// and /usr/local/nginx///sbin are equivalent. The character '/' (or some sequence of such characters) at the end of the path is required only in case of the path to the root directory, which can be represented as single character '/'.\n\nA path called normalized if it contains the smallest possible number of characters '/'.\n\nYour task is to transform a given path to the normalized form.",
"input": "",
"output": "```python\ns=input()\r\nx=[s[0]]\r\nfor i in range(1,len(s)-1):\r\n if s[i]!='/':\r\n x.append(s[i])\r\n elif s[i]=='/' and s[i+1]!='/':\r\n x.append('/')\r\nfor k in range(len(x)):\r\n print(x[k],end='')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are *n* flights that must depart today, the *i*-th of them is planned to depart at the *i*-th minute of the day.\n\nMetropolis airport is the main transport hub of Metropolia, so it is difficult to keep the schedule intact. This is exactly the case today: because of technical issues, no flights were able to depart during the first *k* minutes of the day, so now the new departure schedule must be created.\n\nAll *n* scheduled flights must now depart at different minutes between (*k*<=+<=1)-th and (*k*<=+<=*n*)-th, inclusive. However, it's not mandatory for the flights to depart in the same order they were initially scheduled to do so — their order in the new schedule can be different. There is only one restriction: no flight is allowed to depart earlier than it was supposed to depart in the initial schedule.\n\nHelen knows that each minute of delay of the *i*-th flight costs airport *c**i* burles. Help her find the order for flights to depart in the new schedule that minimizes the total cost for the airport.",
"input": "",
"output": "```python\nimport itertools\r\nk, n = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\nmin_v = []\r\nmin_value = 99999\r\nv = []\r\nfor i in range(k):\r\n v.append(i + n + 1)\r\nvariants = list(itertools.permutations(v, k))\r\nfor variant in variants:\r\n summ = 0\r\n for i in range(len(variant)):\r\n summ += (variant[i] - i - 1) * data[i]\r\n if variant[i] - i - 1 < 0:\r\n summ = 9999999\r\n break\r\n if summ <= min_value:\r\n min_value = summ\r\n min_v = variant\r\nprint(min_value)\r\nprint(min_v)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\nn=int(input())\r\nm=int(input())\r\nparameter=m*n\r\nMaximum_number_of_dominoes=parameter//2\r\nprint(Maximum_number_of_dominoes)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Polycarp published a funny picture in a social network making a poll about the color of his handle. Many of his friends started reposting Polycarp's joke to their news feed. Some of them reposted the reposts and so on.\n\nThese events are given as a sequence of strings \"name1 reposted name2\", where name1 is the name of the person who reposted the joke, and name2 is the name of the person from whose news feed the joke was reposted. It is guaranteed that for each string \"name1 reposted name2\" user \"name1\" didn't have the joke in his feed yet, and \"name2\" already had it in his feed by the moment of repost. Polycarp was registered as \"Polycarp\" and initially the joke was only in his feed.\n\nPolycarp measures the popularity of the joke as the length of the largest repost chain. Print the popularity of Polycarp's joke.",
"input": "",
"output": "```python\nfrom collections import defaultdict\r\n\r\npost = defaultdict(list)\r\nn = int(input())\r\n\r\nfor _ in range(n):\r\n c, b, a = input().split()\r\n post[a.lower()].append(c.lower())\r\n\r\nposters = set([\"polycarp\"])\r\n\r\ndef dfs(person, count):\r\n c = count \r\n for friend in post[person]:\r\n if friend in posters:\r\n continue\r\n posters.add(friend)\r\n c = max(c, dfs(friend, count + 1))\r\n # print(person, c)\r\n return c\r\n\r\nprint(dfs(\"polycarp\", 1))\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "During the winter holidays, the demand for Christmas balls is exceptionally high. Since it's already 2018, the advances in alchemy allow easy and efficient ball creation by utilizing magic crystals.\n\nGrisha needs to obtain some yellow, green and blue balls. It's known that to produce a yellow ball one needs two yellow crystals, green — one yellow and one blue, and for a blue ball, three blue crystals are enough.\n\nRight now there are *A* yellow and *B* blue crystals in Grisha's disposal. Find out how many additional crystals he should acquire in order to produce the required number of balls.",
"input": "",
"output": "```python\nsh = [int(w) for w in input().split()]\r\ne = [int(q) for q in input().split()]\r\na = sh[0]\r\nb = sh[1]\r\nx = e[0]\r\ny = e[1]\r\nz = e[2]\r\nn = a+b\r\nka = 2*x+1*y\r\nkb = 1*y+3*z\r\nd = (ka+kb)-n\r\nprint(d)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number *a* and Antisimon receives number *b*. They also have a heap of *n* stones. The players take turns to make a move and Simon starts. During a move a player should take from the heap the number of stones equal to the greatest common divisor of the fixed number he has received and the number of stones left in the heap. A player loses when he cannot take the required number of stones (i. e. the heap has strictly less stones left than one needs to take). \n\nYour task is to determine by the given *a*, *b* and *n* who wins the game.",
"input": "",
"output": "```python\nx=list(map(int,input().split()))\r\na=x[0]\r\nb=x[1]\r\nn=x[2]\r\nif(n%2==0):\r\n print(\"1\")\r\nelse:\r\n print(\"0\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After seeing the \"ALL YOUR BASE ARE BELONG TO US\" meme for the first time, numbers *X* and *Y* realised that they have different bases, which complicated their relations.\n\nYou're given a number *X* represented in base *b**x* and a number *Y* represented in base *b**y*. Compare those two numbers.",
"input": "",
"output": "```python\nn1 = 0\r\nn, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.reverse()\r\nfor i in range(n):\r\n n1 += a[i] * (b ** i)\r\nn2 = 0\r\nn, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.reverse()\r\nfor i in range(n):\r\n n2 += a[i] * (b ** i)\r\nif n1 < n2:\r\n print(\"<\")\r\nif n1 == n2:\r\n print(\"=\")\r\nif n1 > n2:\r\n print(\">\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\ndef sol():\r\n s=input()\r\n u=0\r\n l=0\r\n for i in s:\r\n if ord(i)<93:\r\n u=u+1\r\n else:\r\n l=l+1\r\n if l>=u:\r\n print(s.lower())\r\n else:\r\n print(s.upper())\r\n\r\n\r\n\r\nsol()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Maria participates in a bicycle race.\n\nThe speedway takes place on the shores of Lake Lucerne, just repeating its contour. As you know, the lake shore consists only of straight sections, directed to the north, south, east or west.\n\nLet's introduce a system of coordinates, directing the *Ox* axis from west to east, and the *Oy* axis from south to north. As a starting position of the race the southernmost point of the track is selected (and if there are several such points, the most western among them). The participants start the race, moving to the north. At all straight sections of the track, the participants travel in one of the four directions (north, south, east or west) and change the direction of movement only in bends between the straight sections. The participants, of course, never turn back, that is, they do not change the direction of movement from north to south or from east to west (or vice versa).\n\nMaria is still young, so she does not feel confident at some turns. Namely, Maria feels insecure if at a failed or untimely turn, she gets into the water. In other words, Maria considers the turn dangerous if she immediately gets into the water if it is ignored.\n\nHelp Maria get ready for the competition — determine the number of dangerous turns on the track.",
"input": "",
"output": "```python\nn = int(intput())\r\n\r\nfor i in range(n+1):\r\n m = input()\r\n\r\nprint((n-4)/2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Gargari is jealous that his friend Caisa won the game from the previous problem. He wants to prove that he is a genius.\n\nHe has a *n*<=×<=*n* chessboard. Each cell of the chessboard has a number written on it. Gargari wants to place two bishops on the chessboard in such a way that there is no cell that is attacked by both of them. Consider a cell with number *x* written on it, if this cell is attacked by one of the bishops Gargari will get *x* dollars for it. Tell Gargari, how to place bishops on the chessboard to get maximum amount of money.\n\nWe assume a cell is attacked by a bishop, if the cell is located on the same diagonal with the bishop (the cell, where the bishop is, also considered attacked by it).",
"input": "",
"output": "```python\nimport itertools\n\nn = int(input())\narr = [list(map(int, input().split())) for i in range(n)]\nr_diag = {}\nfor i in range(-n+1, n):\n diag_total = 0\n # for j in range(0, n):\n # x, y = i+j, j\n # if 0 <= x < n and 0 <= y < n:\n # diag_total += arr[x][y]\n r_diag[i%(2*n-1)] = sum([arr[i+j][j] for j in range(0, n) if 0<=(i+j)= best_val:\n# best_val = val\n# best_pos = x, y\n# best_val_black = best_val\n# best_pos_black = best_pos\n\nbest_val_black, black_x, black_y = max([\n (l_diag[(x+y) % (2*n-1)] + r_diag[(x-y) % (2*n-1)] - arr[x][y], x, y)\n for x, y in itertools.product(range(0, n), range(0, n))\n if (x+y) % 2 == 0\n])\n\nbest_val_white, white_x, white_y = max([\n (l_diag[(x+y) % (2*n-1)] + r_diag[(x-y) % (2*n-1)] - arr[x][y], x, y)\n for x, y in itertools.product(range(0, n), range(0, n))\n if (x+y) % 2 == 1\n])\n\n\n# best_val = None\n# best_pos = None, None\n# for x in range(0, n):\n# for y in range(0, n):\n# if not ((x+y) % 2):\n# continue\n# r = (x-y) % (2*n-1)\n# l = (x+y) % (2*n-1)\n# val = l_diag[l] + r_diag[r] - arr[x][y]\n# if best_val is None or val >= best_val:\n# best_val = val\n# best_pos = x, y\n\nprint(best_val_black + best_val_white)\nprint(*[i+1 for i in [black_x, black_y, white_x, white_y]])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "People in the Tomskaya region like magic formulas very much. You can see some of them below.\n\nImagine you are given a sequence of positive integer numbers *p*1, *p*2, ..., *p**n*. Lets write down some magic formulas:\n\nHere, \"mod\" means the operation of taking the residue after dividing.\n\nThe expression means applying the bitwise *xor* (excluding \"OR\") operation to integers *x* and *y*. The given operation exists in all modern programming languages. For example, in languages C++ and Java it is represented by \"^\", in Pascal — by \"xor\".\n\nPeople in the Tomskaya region like magic formulas very much, but they don't like to calculate them! Therefore you are given the sequence *p*, calculate the value of *Q*.",
"input": "",
"output": "```python\ndef main():\n n = int(input())\n nums = map(int, input().split())\n\n chunk = []\n base = 0\n for i in range(n + 1):\n base ^= i\n chunk.append(base)\n\n Q = 0\n for i, num in enumerate(nums):\n q = num\n chunks, res = divmod(n, i + 1)\n q ^= chunk[res]\n if chunks % 2 == 1:\n q ^= chunk[i]\n Q ^= q\n\n print(Q)\n\n\nmain()\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A wise man told Kerem \"Different is good\" once, so Kerem wants all things in his life to be different. \n\nKerem recently got a string *s* consisting of lowercase English letters. Since Kerem likes it when things are different, he wants all substrings of his string *s* to be distinct. Substring is a string formed by some number of consecutive characters of the string. For example, string \"aba\" has substrings \"\" (empty substring), \"a\", \"b\", \"a\", \"ab\", \"ba\", \"aba\".\n\nIf string *s* has at least two equal substrings then Kerem will change characters at some positions to some other lowercase English letters. Changing characters is a very tiring job, so Kerem want to perform as few changes as possible.\n\nYour task is to find the minimum number of changes needed to make all the substrings of the given string distinct, or determine that it is impossible.",
"input": "",
"output": "```python\nn = int(input())\r\nstring = input()\r\nalphabets = \"abcdefghijklmnopqrstuvwxyz\"\r\ncount = 0\r\nflag = 1\r\nfor i in alphabets:\r\n if i not in string:\r\n count += 1\r\n\r\nlength = len(set(string))\r\nif length > count or n > 26:\r\n flag = 0\r\nif(flag == 1):\r\n print(n - len(string))\r\nelse:\r\n print(\"-1\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are *n* drinks in his fridge, the volume fraction of orange juice in the *i*-th drink equals *p**i* percent.\n\nOne day Vasya decided to make himself an orange cocktail. He took equal proportions of each of the *n* drinks and mixed them. Then he wondered, how much orange juice the cocktail has.\n\nFind the volume fraction of orange juice in the final drink.",
"input": "",
"output": "```python\ndef code(*args):\r\n arr, n = args\r\n\r\n result = float(sum(arr)/n) \r\n\r\n return \"{:.12f}\".format(result) \r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # Take inputs here\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n result = code(arr, n) # Pass arguments\r\n print(result)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed *w* kilos. They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem.\n\nPete and Billy are great fans of even numbers, that's why they want to divide the watermelon in such a way that each of the two parts weighs even number of kilos, at the same time it is not obligatory that the parts are equal. The boys are extremely tired and want to start their meal as soon as possible, that's why you should help them and find out, if they can divide the watermelon in the way they want. For sure, each of them should get a part of positive weight.",
"input": "",
"output": "```python\nn,w=list(map(int,input().split()))\nwhile(n%2==0 and w%2==0):\n if((n+w)%2==0)\n print(\"YES\")\n else:\n print(\"NO\")\nprint(\"NO\")\n#5l7\n \t\t\t \t\t\t \t\t\t \t\t\t\t\t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Holidays have finished. Thanks to the help of the hacker Leha, Noora managed to enter the university of her dreams which is located in a town Pavlopolis. It's well known that universities provide students with dormitory for the period of university studies. Consequently Noora had to leave Vičkopolis and move to Pavlopolis. Thus Leha was left completely alone in a quiet town Vičkopolis. He almost even fell into a depression from boredom!\n\nLeha came up with a task for himself to relax a little. He chooses two integers *A* and *B* and then calculates the greatest common divisor of integers \"*A* factorial\" and \"*B* factorial\". Formally the hacker wants to find out GCD(*A*!,<=*B*!). It's well known that the factorial of an integer *x* is a product of all positive integers less than or equal to *x*. Thus *x*!<==<=1·2·3·...·(*x*<=-<=1)·*x*. For example 4!<==<=1·2·3·4<==<=24. Recall that GCD(*x*,<=*y*) is the largest positive integer *q* that divides (without a remainder) both *x* and *y*.\n\nLeha has learned how to solve this task very effective. You are able to cope with it not worse, aren't you?",
"input": "",
"output": "```python\n\r\na, b = map(int, input().split())\r\nans = 0\r\nmn = min(a, b)\r\nfor i in range(1, mn + 1):\r\n ans += i\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Reca company makes monitors, the most popular of their models is AB999 with the screen size *a*<=×<=*b* centimeters. Because of some production peculiarities a screen parameters are integer numbers. Recently the screen sides ratio *x*:<=*y* became popular with users. That's why the company wants to reduce monitor AB999 size so that its screen sides ratio becomes *x*:<=*y*, at the same time they want its total area to be maximal of all possible variants. Your task is to find the screen parameters of the reduced size model, or find out that such a reduction can't be performed.",
"input": "",
"output": "```python\nimport sys\r\nfrom collections import defaultdict as dd\r\nfrom collections import deque\r\n\r\ndef eprint(*args):\r\n print(*args, file=sys.stderr)\r\npl=1\r\nfrom math import *\r\nimport copy\r\n#sys.setrecursionlimit(10**6)\r\nif pl:\r\n\tinput=sys.stdin.readline\r\n\r\ndef li():\r\n\treturn [int(xxx) for xxx in input().split()]\r\ndef fi():\r\n\treturn int(input())\r\ndef si():\r\n\treturn list(input().rstrip())\t\r\ndef mi():\r\n\treturn \tmap(int,input().split())\t\r\n \r\n\r\nd=[]\t\t\r\nfrom bisect import *\t\t\r\n\r\nfrom itertools import permutations \r\nfrom bisect import *\r\nf=[0 for i in range(100)]\r\n\r\nfor i in range(1,100):\r\n\tif i==1:\r\n\t\tf[i]=1\r\n\telse:\r\n\t\tf[i]=2*f[i-1]+1\r\n\r\n#print(f[:15])\r\ndef rec(n,k):\r\n\ts=[]\r\n\twhile n!=0:\r\n\t\tn,r=n//k,n%k\r\n\t\t#print(n,r)\r\n\t\tif r<0:\r\n\t\t\tr-=k\r\n\t\t\tn+=1\r\n\t\t#print(s,n,r)\t\r\n\t\ts.append(r)\t\t\r\n\treturn s\t\t\r\na,b,x,y=mi()\r\na,b=max(a,b),min(a,b)\r\nx,y=max(x,y),min(x,y)\r\nl=1\r\nr=10**10\r\nans=0\r\naa=[0,0]\r\nwhile l<=r:\r\n\tmid=(l+r)//2\r\n\tif x*mid<=a and y*mid<=b:\r\n\t\tans=max(ans,x*y*mid**2)\r\n\t\taa=[x*mid,y*mid]\r\n\t\tl=mid+1\r\n\telse:\r\n\t\tr=mid-1\r\nprint(*aa)\t\t\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "\"Night gathers, and now my watch begins. It shall not end until my death. I shall take no wife, hold no lands, father no children. I shall wear no crowns and win no glory. I shall live and die at my post. I am the sword in the darkness. I am the watcher on the walls. I am the shield that guards the realms of men. I pledge my life and honor to the Night's Watch, for this night and all the nights to come.\" — The Night's Watch oath.\n\nWith that begins the watch of Jon Snow. He is assigned the task to support the stewards.\n\nThis time he has *n* stewards with him whom he has to provide support. Each steward has his own strength. Jon Snow likes to support a steward only if there exists at least one steward who has strength strictly less than him and at least one steward who has strength strictly greater than him.\n\nCan you find how many stewards will Jon support?",
"input": "",
"output": "```python\nn = int(input()) \r\nx = list(map(int,input().split())) \r\nn = int(input()) \r\nx = list(map(int,input().split())) \r\nx = [*set(x)] \r\nc = 0 \r\nfor i in x: \r\n if i > min(x) and i len(s)/2])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mike is trying rock climbing but he is awful at it. \n\nThere are *n* holds on the wall, *i*-th hold is at height *a**i* off the ground. Besides, let the sequence *a**i* increase, that is, *a**i*<=<<=*a**i*<=+<=1 for all *i* from 1 to *n*<=-<=1; we will call such sequence a track. Mike thinks that the track *a*1, ..., *a**n* has difficulty . In other words, difficulty equals the maximum distance between two holds that are adjacent in height.\n\nToday Mike decided to cover the track with holds hanging on heights *a*1, ..., *a**n*. To make the problem harder, Mike decided to remove one hold, that is, remove one element of the sequence (for example, if we take the sequence (1,<=2,<=3,<=4,<=5) and remove the third element from it, we obtain the sequence (1,<=2,<=4,<=5)). However, as Mike is awful at climbing, he wants the final difficulty (i.e. the maximum difference of heights between adjacent holds after removing the hold) to be as small as possible among all possible options of removing a hold. The first and last holds must stay at their positions.\n\nHelp Mike determine the minimum difficulty of the track after removing one hold.",
"input": "",
"output": "```python\nn = int(input())\na = [int(x) for x in input().split()]\nval = []\nmv = 0\nfor i in range(1,n):\n mv = max(mv,a[i]-a[i-1])\n \nz = 1000\nfor i in range(1,n-1):\n z = min(z, a[i+1]-a[i-1])\n\nif z <= mv:\n print(mv)\nelse:\n print(z)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In Aramic language words can only represent objects.\n\nWords in Aramic have special properties: \n - A word is a root if it does not contain the same letter more than once. - A root and all its permutations represent the same object. - The root $x$ of a word $y$ is the word that contains all letters that appear in $y$ in a way that each letter appears once. For example, the root of \"aaaa\", \"aa\", \"aaa\" is \"a\", the root of \"aabb\", \"bab\", \"baabb\", \"ab\" is \"ab\". - Any word in Aramic represents the same object as its root. \nYou have an ancient script in Aramic. What is the number of different objects mentioned in the script?",
"input": "",
"output": "```python\nn = int(input())\r\na = []\r\ns = input().split()\r\nans = 0\r\nfor i in range(n):\r\n if set(s[i]) not in a:\r\n a.append(set(s[i]))\r\n ans += 1\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* cities and *n*<=-<=1 roads in the Seven Kingdoms, each road connects two cities and we can reach any city from any other by the roads.\n\nTheon and Yara Greyjoy are on a horse in the first city, they are starting traveling through the roads. But the weather is foggy, so they can’t see where the horse brings them. When the horse reaches a city (including the first one), it goes to one of the cities connected to the current city. But it is a strange horse, it only goes to cities in which they weren't before. In each such city, the horse goes with equal probabilities and it stops when there are no such cities. \n\nLet the length of each road be 1. The journey starts in the city 1. What is the expected length (expected value of length) of their journey? You can read about expected (average) value by the link [https://en.wikipedia.org/wiki/Expected_value](https://en.wikipedia.org/wiki/Expected_value).",
"input": "",
"output": "```python\nfrom collections import defaultdict\r\n\r\ndef solve():\r\n n = int(input())\r\n graph = defaultdict(list)\r\n for _ in range(n-1):\r\n \tx,y = map(int, input().split())\r\n \tgraph[x].append(y)\r\n \tgraph[y].append(x)\r\n \r\n dep = defaultdict(int)\r\n \r\n dep[0]=-1\r\n \r\n sum=0\r\n total=0\r\n \r\n def dfs(curr, par):\r\n nonlocal sum\r\n nonlocal total\r\n dep[curr]=dep[par]+1\r\n for nxt in graph[curr]:\r\n \t if nxt!=par: dfs(nxt, curr)\r\n \t\r\n if len(graph[curr])==1 :\r\n \t sum+=dep[curr]\r\n \t total+=1\r\n \r\n dfs(1, 0)\r\n print(sum/total)\r\n\r\nsolve()\r\n\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pasha loves his phone and also putting his hair up... But the hair is now irrelevant.\n\nPasha has installed a new game to his phone. The goal of the game is following. There is a rectangular field consisting of *n* row with *m* pixels in each row. Initially, all the pixels are colored white. In one move, Pasha can choose any pixel and color it black. In particular, he can choose the pixel that is already black, then after the boy's move the pixel does not change, that is, it remains black. Pasha loses the game when a 2<=×<=2 square consisting of black pixels is formed. \n\nPasha has made a plan of *k* moves, according to which he will paint pixels. Each turn in his plan is represented as a pair of numbers *i* and *j*, denoting respectively the row and the column of the pixel to be colored on the current move.\n\nDetermine whether Pasha loses if he acts in accordance with his plan, and if he does, on what move the 2<=×<=2 square consisting of black pixels is formed.",
"input": "",
"output": "```python\nn,m,k=map(int,input().split())\r\nl = [[0 for _ in range(n+2)] for _ in range(m+2)]#baohuquan\r\ntemp=1\r\nif k<=3:\r\n print(0)\r\nelse:\r\n for c in range(1,k+1):\r\n j,i=map(int,input().split())\r\n l[i][j]=1\r\n if l[i][j+1]+l[i+1][j]+l[i+1][j+1]==3 or l[i][j+1]+l[i-1][j]+l[i-1][j+1]==3 or l[i][j-1]+l[i+1][j]+l[i][j-1]==3 or l[i][j-1]+l[i-1][j]+l[i-1][j-1]==3:\r\n print(c)\r\n temp=0\r\n break\r\n if temp==1:\r\n print(0)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The cows have just learned what a primitive root is! Given a prime *p*, a primitive root is an integer *x* (1<=≤<=*x*<=<<=*p*) such that none of integers *x*<=-<=1,<=*x*2<=-<=1,<=...,<=*x**p*<=-<=2<=-<=1 are divisible by *p*, but *x**p*<=-<=1<=-<=1 is. \n\nUnfortunately, computing primitive roots can be time consuming, so the cows need your help. Given a prime *p*, help the cows find the number of primitive roots .",
"input": "",
"output": "```python\ndef power(x, y, p):\r\n result = 1\r\n x = x % p\r\n while y > 0:\r\n if y % 2 == 1:\r\n result = (result * x) % p\r\n y = y // 2\r\n x = (x * x) % p\r\n return result\r\n\r\ndef phi(n):\r\n result = n\r\n p = 2\r\n while p * p <= n:\r\n if n % p == 0:\r\n while n % p == 0:\r\n n //= p\r\n result -= result // p\r\n p += 1\r\n if n > 1:\r\n result -= result // n\r\n return result\r\n\r\ndef count_primitive_roots(p):\r\n phi_p = phi(p)\r\n primitive_roots = 0\r\n for x in range(2, p):\r\n if power(x, phi_p, p) == 1:\r\n primitive_roots += 1\r\n return primitive_roots\r\n\r\np = int(input())\r\nresult = count_primitive_roots(p)\r\nprint(result)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After waking up at *hh*:*mm*, Andrew realised that he had forgotten to feed his only cat for yet another time (guess why there's only one cat). The cat's current hunger level is *H* points, moreover each minute without food increases his hunger by *D* points.\n\nAt any time Andrew can visit the store where tasty buns are sold (you can assume that is doesn't take time to get to the store and back). One such bun costs *C* roubles and decreases hunger by *N* points. Since the demand for bakery drops heavily in the evening, there is a special 20% discount for buns starting from 20:00 (note that the cost might become rational). Of course, buns cannot be sold by parts.\n\nDetermine the minimum amount of money Andrew has to spend in order to feed his cat. The cat is considered fed if its hunger level is less than or equal to zero.",
"input": "",
"output": "```python\nimport math\r\nfirst = input().split(\" \")\r\nhh = int(first[0])\r\nmm = int(first[1])\r\nt = hh * 60 + mm\r\ndisc = 20 * 60\r\n\r\nsecond = input().split(\" \")\r\nh = int(second[0])\r\nd = int(second[1])\r\nc = int(second[2])\r\nn = int(second[3])\r\n\r\nif(t > disc):\r\n print(0.8 * math.ceil(h/float(n)) * c)\r\nelse:\r\n wait = 0.8 * math.ceil((h + d * (disc-t))/float(n))\r\n imme = math.ceil(h/float(n))\r\n print(min(c * imme, c * wait))\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Furik loves math lessons very much, so he doesn't attend them, unlike Rubik. But now Furik wants to get a good mark for math. For that Ms. Ivanova, his math teacher, gave him a new task. Furik solved the task immediately. Can you?\n\nYou are given a set of digits, your task is to find the maximum integer that you can make from these digits. The made number must be divisible by 2, 3, 5 without a residue. It is permitted to use not all digits from the set, it is forbidden to use leading zeroes.\n\nEach digit is allowed to occur in the number the same number of times it occurs in the set.",
"input": "",
"output": "```python\nimport decimal\r\nfrom errno import ETIMEDOUT\r\nimport heapq as hq\r\nimport os\r\nimport sys\r\nfrom collections import Counter as ctr, deque as dq\r\netd=dq()\r\nfrom io import BytesIO, IOBase\r\n \r\n \r\nBUFSIZE = 8192\r\n \r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = 'x' in file.mode or 'r' not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b'\\n') + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode('ascii'))\r\n self.read = lambda: self.buffer.read().decode('ascii')\r\n self.readline = lambda: self.buffer.readline().decode('ascii')\r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n')\r\n \r\nfrom math import *\r\nfrom bisect import bisect_left as bl, insort\r\nfrom bisect import bisect_right as br\r\nfrom itertools import permutations\r\n\r\ninp = lambda: int(input())\r\nli = lambda: list(map(int, input().split()))\r\nlb = lambda: list(map(int, input()))\r\nls = lambda: list(input())\r\nbi = lambda n: bin(n).replace(\"0b\", \"0\"*(18-int(log(n,2))-1))\r\ndef yn(f):\r\n print('NYOE S'[f::2])\r\n\r\n\r\n\r\ndef main(__=1):\r\n for _ in range(__):\r\n n=inp()\r\n a=li()\r\n a.sort(reverse=True)\r\n if a[-1]!=0:\r\n print(-1)\r\n else:\r\n rmd1=[]\r\n rmd2=[]\r\n s=0\r\n for i in range(n):\r\n t=a[i]%3\r\n s=(s+t)%3\r\n if t==1:\r\n rmd1.append(i)\r\n elif t==2:\r\n rmd2.append(i)\r\n if s==0:\r\n print(\"\".join(map(str,a)))\r\n elif s==1:\r\n if len(rmd1)>0:\r\n a.pop(rmd1[-1])\r\n elif len(rmd2)>1:\r\n a.pop(rmd2[-1])\r\n a.pop(rmd2[-2])\r\n else:\r\n a=[0]\r\n print(\"\".join(map(str,a)))\r\n else:\r\n if len(rmd2)>0:\r\n a.pop(rmd2[-1])\r\n elif len(rmd1)>1:\r\n a.pop(rmd1[-1])\r\n a.pop(rmd1[-2])\r\n else:\r\n a=[0]\r\n print(\"\".join(map(str,a)))\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n #main(inp())\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* pearls in a row. Let's enumerate them with integers from 1 to *n* from the left to the right. The pearl number *i* has the type *a**i*.\n\nLet's call a sequence of consecutive pearls a segment. Let's call a segment good if it contains two pearls of the same type.\n\nSplit the row of the pearls to the maximal number of good segments. Note that each pearl should appear in exactly one segment of the partition.\n\nAs input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java.",
"input": "",
"output": "```python\n#!/usr/bin/python3\n\nn = int(input())\na = [int(x) for x in input().split()]\n\nr = []\ns = set()\nl = 0\nfor i, x in enumerate(a):\n if x in s:\n r.append([l + 1, i + 1])\n l = i + 1\n s = set()\n else:\n s.add(x)\nif l == 0:\n print(-1)\nelse:\n if s:\n r[-1][1] = n\n print(len(r))\n print('\\n'.join('{0} {1}'.format(p, q) for (p, q) in r))\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Alex doesn't like boredom. That's why whenever he gets bored, he comes up with games. One long winter evening he came up with a game and decided to play it.\n\nGiven a sequence *a* consisting of *n* integers. The player can make several steps. In a single step he can choose an element of the sequence (let's denote it *a**k*) and delete it, at that all elements equal to *a**k*<=+<=1 and *a**k*<=-<=1 also must be deleted from the sequence. That step brings *a**k* points to the player. \n\nAlex is a perfectionist, so he decided to get as many points as possible. Help him.",
"input": "",
"output": "```python\n# Read the number of elements in the sequence\r\nn = int(input())\r\n\r\n# Read the sequence of elements\r\nelements = list(map(int, input().split()))\r\n\r\n# Count the frequency of each element\r\nfrequency = {}\r\nfor num in elements:\r\n frequency[num] = frequency.get(num, 0) + 1\r\n\r\n# Initialize the dp array\r\ndp = [0] * n\r\n\r\n# Initialize dp[0] with the product of frequency and the value of the first element\r\ndp[0] = frequency.get(elements[0], 0) * elements[0]\r\n\r\n# Iterate through the sequence to calculate dp[i]\r\nfor i in range(1, n):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + frequency.get(elements[i], 0) * elements[i])\r\n\r\n# The maximum points that can be earned will be the maximum value in the dp array\r\nmax_points = max(dp)\r\n\r\n# Print the maximum points\r\nprint(max_points)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day shooshuns found a sequence of *n* integers, written on a blackboard. The shooshuns can perform one operation with it, the operation consists of two steps:\n 1. Find the number that goes *k*-th in the current sequence and add the same number to the end of the sequence; 1. Delete the first number of the current sequence. \nThe shooshuns wonder after how many operations all numbers on the board will be the same and whether all numbers will ever be the same.",
"input": "",
"output": "```python\nn = [int(x) for x in input().split()]\r\np = [int(x) for x in input().split()]\r\ni = 0\r\nfor j in range(len(p) - 1):\r\n num = p[n[1]-1]\r\n p.append(num)\r\n p.pop(0)\r\n i = i+1\r\nif len(set(p)) == 1:\r\n print(i)\r\nelse:\r\n print(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "PolandBall is a young, clever Ball. He is interested in prime numbers. He has stated a following hypothesis: \"There exists such a positive integer *n* that for each positive integer *m* number *n*·*m*<=+<=1 is a prime number\".\n\nUnfortunately, PolandBall is not experienced yet and doesn't know that his hypothesis is incorrect. Could you prove it wrong? Write a program that finds a counterexample for any *n*.",
"input": "",
"output": "```python\nn = int(input())\r\n\r\nflag = False\r\n\r\nfor i in range(1, n + 1):\r\n \r\n tempNum = n * i + i\r\n \r\n for j in range(2, int(tempNum / 2) + 1):\r\n \r\n if tempNum % j == 0:\r\n flag = True\r\n break\r\n \r\n if flag == True:\r\n print(i)\r\n break\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Array of integers is unimodal, if:\n - it is strictly increasing in the beginning; - after that it is constant; - after that it is strictly decreasing. \nThe first block (increasing) and the last block (decreasing) may be absent. It is allowed that both of this blocks are absent.\n\nFor example, the following three arrays are unimodal: [5,<=7,<=11,<=11,<=2,<=1], [4,<=4,<=2], [7], but the following three are not unimodal: [5,<=5,<=6,<=6,<=1], [1,<=2,<=1,<=2], [4,<=5,<=5,<=6].\n\nWrite a program that checks if an array is unimodal.",
"input": "",
"output": "```python\narr=[]\r\nn=int(input(\"Number of elements in array:\"))\r\nfor i in range(0,n):\r\n ele=int(input())\r\n arr.append(ele)\r\n\r\ndef f(m,n,flag):\r\n if flag==1:\r\n return mn\r\n\r\ndef is_unimodal(a, lst):\r\n flag=1\r\n for i in range(1,n):\r\n if f(lst[i-1], lst[i], flag):\r\n continue\r\n else:\r\n flag += 1\r\n if f(lst[i-1], lst[i], flag):\r\n continue\r\n else:\r\n flag += 1\r\n if f(lst[i-1], lst[i], flag):\r\n continue\r\n else:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\nprint(is_unimodal(n, arr))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "What joy! Petya's parents went on a business trip for the whole year and the playful kid is left all by himself. Petya got absolutely happy. He jumped on the bed and threw pillows all day long, until... \n\nToday Petya opened the cupboard and found a scary note there. His parents had left him with duties: he should water their favourite flower all year, each day, in the morning, in the afternoon and in the evening. \"Wait a second!\" — thought Petya. He know for a fact that if he fulfills the parents' task in the *i*-th (1<=≤<=*i*<=≤<=12) month of the year, then the flower will grow by *a**i* centimeters, and if he doesn't water the flower in the *i*-th month, then the flower won't grow this month. Petya also knows that try as he might, his parents won't believe that he has been watering the flower if it grows strictly less than by *k* centimeters. \n\nHelp Petya choose the minimum number of months when he will water the flower, given that the flower should grow no less than by *k* centimeters.",
"input": "",
"output": "```python\nn=int(input())\r\nf=list(map(int,input().split()))\r\ns=k=0\r\nwhile k=n:\r\n\tans=sum(l)/(n-k+1)\r\n\tprint(ans)\r\nelse:\r\n\ti=n-k+1\r\n\tj=[l[i] for i in range(n-k+1)]\r\n\ts=sum(j)\r\n\twhile i= 1:\r\n ans += AIB[pos]\r\n pos -= pos & (-pos)\r\n return ans\r\n\r\ndef query2(pos):\r\n ans = 0\r\n if pos < 0: return 0\r\n while pos >= 1:\r\n ans += AIB2[pos]\r\n pos -= pos & (-pos)\r\n return ans\r\n\r\nv = [int(x) for x in input().split()]\r\nfor i in range(len(v)):\r\n v[i] = n - v[i] + 1\r\n\r\nv.insert(0,0)\r\nans = 0; ans2 = 0\r\nfor i in range(1, n+1):\r\n ans += 1 * (n-i+1) * query1(v[i]-1)\r\n add1(v[i], i)\r\n ans2 += query2(v[i]-1)\r\n add2(v[i], 1)\r\n\r\nans3 = 0\r\nfor i in range(1, n+1):\r\n ans3 += ((n-i+1) * (i-1) * i / 4) / (n * (n+1) / 2)\r\n\r\nans /= (n * (n+1) / 2)\r\nans = ans2 - ans + ans3\r\nprint(\"{:.10f}\".format(ans))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a non-negative integer *n*, its decimal representation consists of at most 100 digits and doesn't contain leading zeroes.\n\nYour task is to determine if it is possible in this case to remove some of the digits (possibly not remove any digit at all) so that the result contains at least one digit, forms a non-negative integer, doesn't have leading zeroes and is divisible by 8. After the removing, it is forbidden to rearrange the digits.\n\nIf a solution exists, you should print it.",
"input": "",
"output": "```python\ns = \"00\" + input()\r\nl = len(s)\r\nfor i in range(l):\r\n\tfor j in range(i + 1, l):\r\n\t\tfor k in range(j + 1, l):\r\n\t\t\tans = s[i] + s[j] + s[k]\r\n\t\t\tif (int(ans) % 8 == 0):\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\tprint(int(ans))\r\n\t\t\t\texit()\r\nprint(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In a building where Polycarp lives there are equal number of flats on each floor. Unfortunately, Polycarp don't remember how many flats are on each floor, but he remembers that the flats are numbered from 1 from lower to upper floors. That is, the first several flats are on the first floor, the next several flats are on the second and so on. Polycarp don't remember the total number of flats in the building, so you can consider the building to be infinitely high (i.e. there are infinitely many floors). Note that the floors are numbered from 1.\n\nPolycarp remembers on which floors several flats are located. It is guaranteed that this information is not self-contradictory. It means that there exists a building with equal number of flats on each floor so that the flats from Polycarp's memory have the floors Polycarp remembers.\n\nGiven this information, is it possible to restore the exact floor for flat *n*?",
"input": "",
"output": "```python\nn, m = map(int, input().split())\n\nflats = {}\n\nfor i in range(m):\n flat, floor = map(int, input().split())\n if floor not in flats.keys():\n flats[floor] = []\n flats[floor].append(flat)\n\n\nfloors = sorted(flats.keys())\n\ndef check():\n for i in range(1, len(floors)):\n a,b=min(flats[floors[i]]), max(flats[floors[i-1]])\n if a-b == 1:\n return b, floors[i-1]\n return False\n\nside_flat=check()\nif not side_flat:\n print(-1)\n exit()\nelse:\n n_flats_floor=side_flat[0]//side_flat[1]\n\nprint((n-1)//n_flats_floor + 1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "As you may know, MemSQL has American offices in both San Francisco and Seattle. Being a manager in the company, you travel a lot between the two cities, always by plane.\n\nYou prefer flying from Seattle to San Francisco than in the other direction, because it's warmer in San Francisco. You are so busy that you don't remember the number of flights you have made in either direction. However, for each of the last *n* days you know whether you were in San Francisco office or in Seattle office. You always fly at nights, so you never were at both offices on the same day. Given this information, determine if you flew more times from Seattle to San Francisco during the last *n* days, or not.",
"input": "",
"output": "```python\ni = input()\r\ni = int(i)\r\ns = input()\r\n\r\nif s[0] == 'S' and s[i-1] == 'F':\r\n\tprint ('YES')\r\nelse:\r\n\tprint ('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Fox Ciel saw a large field while she was on a bus. The field was a *n*<=×<=*m* rectangle divided into 1<=×<=1 cells. Some cells were wasteland, and other each cell contained crop plants: either carrots or kiwis or grapes. \n\nAfter seeing the field carefully, Ciel found that the crop plants of each cell were planted in following procedure:\n - Assume that the rows are numbered 1 to *n* from top to bottom and the columns are numbered 1 to *m* from left to right, and a cell in row *i* and column *j* is represented as (*i*,<=*j*). - First, each field is either cultivated or waste. Crop plants will be planted in the cultivated cells in the order of (1,<=1)<=→<=...<=→<=(1,<=*m*)<=→<=(2,<=1)<=→<=...<=→<=(2,<=*m*)<=→<=...<=→<=(*n*,<=1)<=→<=...<=→<=(*n*,<=*m*). Waste cells will be ignored. - Crop plants (either carrots or kiwis or grapes) will be planted in each cell one after another cyclically. Carrots will be planted in the first cell, then kiwis in the second one, grapes in the third one, carrots in the forth one, kiwis in the fifth one, and so on. \nThe following figure will show you the example of this procedure. Here, a white square represents a cultivated cell, and a black square represents a waste cell.\n\nNow she is wondering how to determine the crop plants in some certain cells.",
"input": "",
"output": "```python\nfrom queue import Queue\r\nimport numpy as np\r\nimport pandas as pd\r\nfrom bisect import bisect_left\r\nfrom sortedcontainers import SortedSet\r\n\r\n\r\ndef ColorfulFields():\r\n n, m, k, t = map(int, input().split())\r\n wastes = SortedSet()\r\n for i in range(k):\r\n x, y = map(int, input().split())\r\n wastes.add((x-1) * m + y)\r\n \r\n fruits = [\"Carrots\", \"Kiwis\", \"Grapes\"]\r\n for i in range(t):\r\n x, y = map(int, input().split())\r\n cellNO = (x-1) * m + y\r\n if cellNO in wastes:\r\n print(\"Waste\")\r\n else:\r\n wasteCount = bisect_left(wastes, cellNO)\r\n print(fruits[(cellNO % 3 - 1) - wasteCount])\r\n \r\n \r\nColorfulFields()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mishka is a little polar bear. As known, little bears loves spending their free time playing dice for chocolates. Once in a wonderful sunny morning, walking around blocks of ice, Mishka met her friend Chris, and they started playing the game.\n\nRules of the game are very simple: at first number of rounds *n* is defined. In every round each of the players throws a cubical dice with distinct numbers from 1 to 6 written on its faces. Player, whose value after throwing the dice is greater, wins the round. In case if player dice values are equal, no one of them is a winner.\n\nIn average, player, who won most of the rounds, is the winner of the game. In case if two players won the same number of rounds, the result of the game is draw.\n\nMishka is still very little and can't count wins and losses, so she asked you to watch their game and determine its result. Please help her!",
"input": "",
"output": "```python\nusing namespace std;\r\nint main()\r\n{\r\n int n;\r\n while(cin>>n)\r\n {\r\n int p1=0,p2=0;\r\n while(n--)\r\n {\r\n int P1,P2;\r\n cin>>P1>>P2;\r\n p1+=(P1>P2);\r\n p2+=(P2>P1);\r\n }\r\n if(p1>p2)\r\n cout<<\"Mishka\"< score:\r\n score = r_score\r\n pos +=1\r\n out[r[0]] = pos\r\nprint (' '.join(str(x) for x in out))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a multiset of *n* integers. You should select exactly *k* of them in a such way that the difference between any two of them is divisible by *m*, or tell that it is impossible.\n\nNumbers can be repeated in the original multiset and in the multiset of selected numbers, but number of occurrences of any number in multiset of selected numbers should not exceed the number of its occurrences in the original multiset.",
"input": "",
"output": "```python\nn, k, m = [int(z) for z in input().split()]\r\na = [int(z) for z in input().split()]\r\nd = dict()\r\nfor i in range(n):\r\n mod = a[i] % m\r\n if mod in d:\r\n d[mod].append(a[i])\r\n else:\r\n d[mod] = [a[i]]\r\nfor elem in d:\r\n if len(d[elem]) >= k:\r\n print(\"Yes\")\r\n for i in range(k):\r\n print(d[elem][i], end=\" \")\r\n exit(0)\r\nprint(\"No\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.\n\nEmbosser is a special devise that allows to \"print\" the text of a plastic tape. Text is printed sequentially, character by character. The device consists of a wheel with a lowercase English letters written in a circle, static pointer to the current letter and a button that print the chosen letter. At one move it's allowed to rotate the alphabetic wheel one step clockwise or counterclockwise. Initially, static pointer points to letter 'a'. Other letters are located as shown on the picture:\n\nAfter Grigoriy add new item to the base he has to print its name on the plastic tape and attach it to the corresponding exhibit. It's not required to return the wheel to its initial position with pointer on the letter 'a'.\n\nOur hero is afraid that some exhibits may become alive and start to attack him, so he wants to print the names as fast as possible. Help him, for the given string find the minimum number of rotations of the wheel required to print it.",
"input": "",
"output": "```python\ndef main():\r\n aname = input()\r\n anum = []\r\n for char in aname:\r\n num = ord(char) - 96\r\n anum.append(num)\r\n steps = 0\r\n stnum = 1\r\n for i in range(len(anum)):\r\n let1 = stnum\r\n let2 = anum[i]\r\n a1 = abs(let1 - let2)\r\n a2 = 26 - a1\r\n step1 = min(a1, a2)\r\n steps += step1\r\n stnum = let2\r\n print(steps)\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.\n\nYou know two languages, and the professor is giving the lecture in the first one. The words in both languages consist of lowercase English characters, each language consists of several words. For each language, all words are distinct, i.e. they are spelled differently. Moreover, the words of these languages have a one-to-one correspondence, that is, for each word in each language, there exists exactly one word in the other language having has the same meaning.\n\nYou can write down every word the professor says in either the first language or the second language. Of course, during the lecture you write down each word in the language in which the word is shorter. In case of equal lengths of the corresponding words you prefer the word of the first language.\n\nYou are given the text of the lecture the professor is going to read. Find out how the lecture will be recorded in your notes.",
"input": "",
"output": "```python\nn,m = map(int,input().split())\r\nd = dict(input().split() for _ in range(m))\r\nprint(' '.join(min((w,d[w]), key=len) for w in input().split()))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given *n* numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given *n* numbers finds one that is different in evenness.",
"input": "",
"output": "```python\nn = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nflag = nums[0] % 2 + nums[1] % 2 + nums[2] % 2\r\n\r\nif flag == 3:\r\n flag = 0\r\nelif flag == 2:\r\n print((nums[0] % 2 == 0) * 1 + (nums[1] % 2 == 0) * 2 + (nums[2] % 2 == 0) * 3)\r\n exit(0)\r\nelif flag == 1:\r\n print((nums[0] % 2 == 1) * 1 + (nums[1] % 2 == 1) * 2 + (nums[2] % 2 == 1) * 3)\r\n exit(0)\r\nelse:\r\n flag = 1\r\n \r\nfor i in range(3, n):\r\n if nums[i] % 2 == flag:\r\n print(i+1)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given an equation: \n\nYour task is to find the number of distinct roots of the equation and print all of them in ascending order.",
"input": "",
"output": "```python\nfrom math import *\r\na,b,c= map(int,input().split())\r\n\r\nd=b**2-4*a*c\r\nif d>=0:\r\n x2 = (-b - sqrt(b ** 2 - 4 * a * c)) / (2 * a)\r\n x1 = (-b + sqrt(b ** 2 - 4 * a * c)) / (2 * a)\r\n if x1==x2:\r\n c=1\r\n print(c)\r\n print('-1')\r\n else:\r\n c=2\r\n print(c)\r\n print(x2)\r\n print(x1)\r\nelse: print('0')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After waking up at *hh*:*mm*, Andrew realised that he had forgotten to feed his only cat for yet another time (guess why there's only one cat). The cat's current hunger level is *H* points, moreover each minute without food increases his hunger by *D* points.\n\nAt any time Andrew can visit the store where tasty buns are sold (you can assume that is doesn't take time to get to the store and back). One such bun costs *C* roubles and decreases hunger by *N* points. Since the demand for bakery drops heavily in the evening, there is a special 20% discount for buns starting from 20:00 (note that the cost might become rational). Of course, buns cannot be sold by parts.\n\nDetermine the minimum amount of money Andrew has to spend in order to feed his cat. The cat is considered fed if its hunger level is less than or equal to zero.",
"input": "",
"output": "```python\nh, m = map(int, input().split())\r\nH, D, C, N = map(int, input().split())\r\nafter = C * 0.8\r\nans = (H + N - 1) // N * C\r\ntm = h * 60 + m\r\ntm1 = 20 * 60 + 0\r\ntm2 = 23 * 60 + 59\r\nif tm1 < tm < tm2:\r\n print('{:.16f}'.format((H + N - 1) // N * after))\r\nelse:\r\n tm3 = tm1 - tm\r\n print('{:.16f}'.format(min(ans, (H + N - 1 + D * tm3) // N * after)))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Galois is one of the strongest chess players of Byteforces. He has even invented a new variant of chess, which he named «PawnChess».\n\nThis new game is played on a board consisting of 8 rows and 8 columns. At the beginning of every game some black and white pawns are placed on the board. The number of black pawns placed is not necessarily equal to the number of white pawns placed. \n\nLets enumerate rows and columns with integers from 1 to 8. Rows are numbered from top to bottom, while columns are numbered from left to right. Now we denote as (*r*,<=*c*) the cell located at the row *r* and at the column *c*.\n\nThere are always two players A and B playing the game. Player A plays with white pawns, while player B plays with black ones. The goal of player A is to put any of his pawns to the row 1, while player B tries to put any of his pawns to the row 8. As soon as any of the players completes his goal the game finishes immediately and the succeeded player is declared a winner.\n\nPlayer A moves first and then they alternate turns. On his move player A must choose exactly one white pawn and move it one step upward and player B (at his turn) must choose exactly one black pawn and move it one step down. Any move is possible only if the targeted cell is empty. It's guaranteed that for any scenario of the game there will always be at least one move available for any of the players.\n\nMoving upward means that the pawn located in (*r*,<=*c*) will go to the cell (*r*<=-<=1,<=*c*), while moving down means the pawn located in (*r*,<=*c*) will go to the cell (*r*<=+<=1,<=*c*). Again, the corresponding cell must be empty, i.e. not occupied by any other pawn of any color.\n\nGiven the initial disposition of the board, determine who wins the game if both players play optimally. Note that there will always be a winner due to the restriction that for any game scenario both players will have some moves available.",
"input": "",
"output": "```python\nimport sys\n\nm = []\nfor i in range(8):\n m.append(input())\n\na = -1\nb = -1\nfor i in range(8):\n col = m[i].find('W')\n if col >= 0:\n a = i\n for j in range(i):\n if m[j][col] != '.':\n a = -1\n break\n\n if a != -1:\n break\n\ni = 7\nwhile i >= 0:\n col = m[i].find('B')\n if col >= 0:\n b = i\n j = i+1\n while j < 8:\n if m[j][col] != '.':\n b = -1\n break\n j += 1\n\n if b != -1:\n break\n i -= 1\n\nif a <= (7-b):\n print(\"A\")\nelse:\n print(\"B\")\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Toastman came up with a very easy task. He gives it to Appleman, but Appleman doesn't know how to solve it. Can you help him?\n\nGiven a *n*<=×<=*n* checkerboard. Each cell of the board has either character 'x', or character 'o'. Is it true that each cell of the board has even number of adjacent cells with 'o'? Two cells of the board are adjacent if they share a side.",
"input": "",
"output": "```python\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l1=input()\r\n l.append(l1)\r\nflag=0\r\nfor i in range(n):\r\n for j in range(n):\r\n s=0\r\n if(i!=0):\r\n if(l[i-1][j]=='o'):\r\n s+=1\r\n if(j!=0):\r\n if(l[i][j-1]=='o'):\r\n s+=1\r\n if(i!=n-1):\r\n if(l[i+1][j]=='o'):\r\n s+=1\r\n if(j!=n-1):\r\n if(l[i][j+1]=='o'):\r\n s+=1\r\n if(s%2!=0):\r\n flag=1\r\n break\r\nif(flag):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mancala is a game famous in the Middle East. It is played on a board that consists of 14 holes. \n\nInitially, each hole has $a_i$ stones. When a player makes a move, he chooses a hole which contains a positive number of stones. He takes all the stones inside it and then redistributes these stones one by one in the next holes in a counter-clockwise direction.\n\nNote that the counter-clockwise order means if the player takes the stones from hole $i$, he will put one stone in the $(i+1)$-th hole, then in the $(i+2)$-th, etc. If he puts a stone in the $14$-th hole, the next one will be put in the first hole.\n\nAfter the move, the player collects all the stones from holes that contain even number of stones. The number of stones collected by player is the score, according to Resli.\n\nResli is a famous Mancala player. He wants to know the maximum score he can obtain after one move.",
"input": "",
"output": "```python\nholes = list(map(int, input().split()))\r\nmx = -1\r\nfor i in range(14):\r\n if holes[i]>0:\r\n temp2 = holes[i]\r\n temp = list(holes)\r\n temp[i] = 0\r\n while(temp2>0):\r\n if i+1 == 14:\r\n i = 0\r\n else:\r\n i+=1\r\n temp[i]+=1\r\n temp2-=1\r\n #print(temp)\r\n sm = 0\r\n for i in temp:\r\n if i%2 == 0:\r\n sm+=i\r\n mx = max(mx,sm)\r\nprint(mx)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pikachu had an array with him. He wrote down all the non-empty subsequences of the array on paper. Note that an array of size *n* has 2*n*<=-<=1 non-empty subsequences in it. \n\nPikachu being mischievous as he always is, removed all the subsequences in which Maximum_element_of_the_subsequence <=-<= Minimum_element_of_subsequence <=≥<=*d*\n\nPikachu was finally left with *X* subsequences. \n\nHowever, he lost the initial array he had, and now is in serious trouble. He still remembers the numbers *X* and *d*. He now wants you to construct any such array which will satisfy the above conditions. All the numbers in the final array should be positive integers less than 1018. \n\nNote the number of elements in the output array should not be more than 104. If no answer is possible, print <=-<=1.",
"input": "",
"output": "```python\nimport math\r\nx,d=map(int,input().split())\r\n\r\nn=math.floor(math.log(x+1,2))\r\nif (n-1>=d and x>10000):\r\n print(-1)\r\nelif (x<=10000 or n-1>=d):\r\n print(x)\r\n for i in range(1,x*d+2-d,d):\r\n print(i,end=' ')\r\n print()\r\nelse:\r\n tb=2**n-1\r\n diff=x-tb\r\n g=1\r\n arr=[]\r\n c=tb\r\n while diff>0:\r\n for i in range(g,g+n):\r\n arr.append(i)\r\n g=g+n+d-1\r\n n=math.floor(math.log(diff+1,2))\r\n tb=2**n-1\r\n diff=diff-tb\r\n c+=tb\r\n for i in range(g,g+n):\r\n arr.append(i)\r\n print(c)\r\n print(*arr)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Alice and Bob like games. And now they are ready to start a new game. They have placed *n* chocolate bars in a line. Alice starts to eat chocolate bars one by one from left to right, and Bob — from right to left. For each chocololate bar the time, needed for the player to consume it, is known (Alice and Bob eat them with equal speed). When the player consumes a chocolate bar, he immediately starts with another. It is not allowed to eat two chocolate bars at the same time, to leave the bar unfinished and to make pauses. If both players start to eat the same bar simultaneously, Bob leaves it to Alice as a true gentleman.\n\nHow many bars each of the players will consume?",
"input": "",
"output": "```python\nn=int(input())\r\nl=list(map(int, input().split()))\r\na,b,i,j=0,0,0,n-1\r\nwhile isum(l[j:])):\r\n\t\tb+=1\r\n\t\tj+=1\r\n\telif(sum(l[:i+1])>sum(l[j:])):\r\n\t\ta+=1\r\n\t\ti+=1\r\n\telse:\r\n\t\ta+=1\r\n\t\tb+=1\r\n\t\ti+=1\r\n\t\tj+=1\r\nprint(a,b)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Having watched the last Harry Potter film, little Gerald also decided to practice magic. He found in his father's magical book a spell that turns any number in the sum of its digits. At the moment Gerald learned that, he came across a number *n*. How many times can Gerald put a spell on it until the number becomes one-digit?",
"input": "",
"output": "```python\nn = input()\n\nc = 0\n\nwhile len(n) > 1:\n\tn = str(sum([int(i) for i in n]))\n\tc += 1\n\nprint(c)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Top-model Izabella participates in the competition. She wants to impress judges and show her mathematical skills.\n\nHer problem is following: for given string, consisting of only 0 and 1, tell if it's possible to remove some digits in such a way, that remaining number is a representation of some positive integer, divisible by 64, in the binary numerical system.",
"input": "",
"output": "```python\na=input()\r\narray=list(a)\r\nbirBulundu=False\r\nsifirSayisi=0\r\nfor i in array:\r\n if(i=='1'):\r\n birBulundu=True\r\n else:\r\n if(birBulundu==True):\r\n sifirSayisi=sifirSayisi+1\r\n \r\nif (sifirSayisi>5):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The recent All-Berland Olympiad in Informatics featured *n* participants with each scoring a certain amount of points.\n\nAs the head of the programming committee, you are to determine the set of participants to be awarded with diplomas with respect to the following criteria: \n - At least one participant should get a diploma. - None of those with score equal to zero should get awarded. - When someone is awarded, all participants with score not less than his score should also be awarded. \nDetermine the number of ways to choose a subset of participants that will receive the diplomas.",
"input": "",
"output": "```python\nif __name__ == '__main__':\r\n input()\r\n s = set(input().split())\r\n print(len(s) - ('0' in s))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Fedya studies in a gymnasium. Fedya's maths hometask is to calculate the following expression:\n\nfor given value of *n*. Fedya managed to complete the task. Can you? Note that given number *n* can be extremely large (e.g. it can exceed any integer type of your programming language).",
"input": "",
"output": "```python\ndef dsd(a):\r\n sl = list(str(a))\r\n ls = [] \r\n for i in range(len(sl)):\r\n ls.append(int(sl[i]))\r\n return ls \r\n\r\nfor _ in range(int(input())):\r\n a, k = map(int,input().split())\r\n ans = a \r\n while k > 1 and '0' not in list(str(a)):\r\n maxi = max(dsd(ans))\r\n mini = min(dsd(ans))\r\n ans = ans + maxi*mini \r\n k-=1\r\n print(ans)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "*n* people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next person from the line, and so on. They play until someone wins *k* games in a row. This player becomes the winner.\n\nFor each of the participants, you know the power to play table tennis, and for all players these values are different. In a game the player with greater power always wins. Determine who will be the winner.",
"input": "",
"output": "```python\nimport bisect\r\nimport os\r\nfrom collections import Counter\r\nimport bisect\r\nfrom collections import defaultdict\r\nimport math\r\nimport random\r\nimport heapq as hq\r\nfrom math import sqrt\r\nimport sys\r\nfrom functools import reduce, cmp_to_key\r\nfrom collections import deque\r\nimport threading\r\nfrom itertools import combinations\r\nfrom io import BytesIO, IOBase\r\nfrom itertools import accumulate\r\n\r\n# sys.setrecursionlimit(200000)\r\n# mod = 10**9+7\r\n# mod = 987\r\n\r\ndef lcm(a,b):\r\n return (a*b)//math.gcd(a,b)\r\n\r\ndef sort_dict(key_value):\r\n return sorted(key_value.items(), key = lambda kv:(kv[1], kv[0]))\r\n\r\ndef list_input():\r\n return list(map(int,input().split()))\r\n \r\ndef num_input():\r\n return map(int,input().split())\r\n \r\ndef string_list():\r\n return list(input())\r\n \r\n \r\ndef solve():\r\n n,k = num_input()\r\n arr = list_input()\r\n if k < n:\r\n for i in range(n):\r\n j = (i+1)%n\r\n count = 0\r\n while arr[i] > arr[j]:\r\n count += 1\r\n if count == k:\r\n print(arr[i])\r\n return\r\n j = (j+1)%n\r\n else:\r\n print(max(arr))\r\n\r\n\r\n#t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n solve()\r\n\r\n\r\n \r\n \r\n \r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After the big birthday party, Katie still wanted Shiro to have some more fun. Later, she came up with a game called treasure hunt. Of course, she invited her best friends Kuro and Shiro to play with her.\n\nThe three friends are very smart so they passed all the challenges very quickly and finally reached the destination. But the treasure can only belong to one cat so they started to think of something which can determine who is worthy of the treasure. Instantly, Kuro came up with some ribbons.\n\nA random colorful ribbon is given to each of the cats. Each color of the ribbon can be represented as an uppercase or lowercase Latin letter. Let's call a consecutive subsequence of colors that appears in the ribbon a subribbon. The beauty of a ribbon is defined as the maximum number of times one of its subribbon appears in the ribbon. The more the subribbon appears, the more beautiful is the ribbon. For example, the ribbon aaaaaaa has the beauty of $7$ because its subribbon a appears $7$ times, and the ribbon abcdabc has the beauty of $2$ because its subribbon abc appears twice.\n\nThe rules are simple. The game will have $n$ turns. Every turn, each of the cats must change strictly one color (at one position) in his/her ribbon to an arbitrary color which is different from the unchanged one. For example, a ribbon aaab can be changed into acab in one turn. The one having the most beautiful ribbon after $n$ turns wins the treasure.\n\nCould you find out who is going to be the winner if they all play optimally?",
"input": "",
"output": "```python\n# Why do we fall ? So we can learn to pick ourselves up.\r\n\r\n\r\nfrom collections import Counter\r\nn = int(input())\r\nss = []\r\nfor _ in range(0,3):\r\n ss.append(input())\r\nans = [\"Kuro\",\"Shiro\",\"Katie\"]\r\nmaxi = [0,0,0]\r\nfor i in range(0,3):\r\n c = Counter(ss[i])\r\n mx = max(c.values())\r\n to = min(len(ss[i])-mx,n)\r\n maxi[i] = mx+to\r\n if n == 1 and mx == len(ss[i]):\r\n maxi[i] -= 1\r\n# print(maxi)\r\nif maxi.count(max(maxi)) > 1:\r\n print(\"Draw\")\r\nelse:\r\n print(ans[maxi.index(max(maxi))])\r\n\r\n\r\n\r\n\r\n\"\"\"\r\n\r\n1\r\nooooo\r\nabcde\r\nabcde\r\n\r\n3\r\nKuroo\r\nShiro\r\nKatie\r\n\r\n\r\n\r\n\"\"\"\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vanya loves playing. He even has a special set of cards to play with. Each card has a single integer. The number on the card can be positive, negative and can even be equal to zero. The only limit is, the number on each card doesn't exceed *x* in the absolute value.\n\nNatasha doesn't like when Vanya spends a long time playing, so she hid all of his cards. Vanya became sad and started looking for the cards but he only found *n* of them. Vanya loves the balance, so he wants the sum of all numbers on found cards equal to zero. On the other hand, he got very tired of looking for cards. Help the boy and say what is the minimum number of cards does he need to find to make the sum equal to zero?\n\nYou can assume that initially Vanya had infinitely many cards with each integer number from <=-<=*x* to *x*.",
"input": "",
"output": "```python\nn, x = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nsums = sum(a)\r\n# print(sums)\r\n\r\ndiv = abs(sums) // x\r\nif (abs(sums) % x == 0):\r\n print(div)\r\nelse:\r\n print(div + 1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "It's that time of the year when the Russians flood their countryside summer cottages (dachas) and the bus stop has a lot of people. People rarely go to the dacha on their own, it's usually a group, so the people stand in queue by groups.\n\nThe bus stop queue has *n* groups of people. The *i*-th group from the beginning has *a**i* people. Every 30 minutes an empty bus arrives at the bus stop, it can carry at most *m* people. Naturally, the people from the first group enter the bus first. Then go the people from the second group and so on. Note that the order of groups in the queue never changes. Moreover, if some group cannot fit all of its members into the current bus, it waits for the next bus together with other groups standing after it in the queue.\n\nYour task is to determine how many buses is needed to transport all *n* groups to the dacha countryside.",
"input": "",
"output": "```python\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=sum(a)\r\nif(l%m==0):\r\n print(l//m)\r\nelse:\r\n print(l//m+1)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Over time, Alexey's mail box got littered with too many letters. Some of them are read, while others are unread.\n\nAlexey's mail program can either show a list of all letters or show the content of a single letter. As soon as the program shows the content of an unread letter, it becomes read letter (if the program shows the content of a read letter nothing happens). In one click he can do any of the following operations:\n- Move from the list of letters to the content of any single letter.- Return to the list of letters from single letter viewing mode.- In single letter viewing mode, move to the next or to the previous letter in the list. You cannot move from the first letter to the previous one or from the last letter to the next one.\nThe program cannot delete the letters from the list or rearrange them.\n\nAlexey wants to read all the unread letters and go watch football. Now he is viewing the list of all letters and for each letter he can see if it is read or unread. What minimum number of operations does Alexey need to perform to read all unread letters?",
"input": "",
"output": "```python\nn = int(input())\r\nx = list(map(int,input().split()))\r\notv = 0\r\nfor i in range(n):\r\n\tif x[i] == 1:\r\n\t\totv += 1\r\n\t\tif i < n-1 and x[i+1] != 1:\r\n\t\t\totv += 1\r\nif x[i] != 1:\r\n\tprint(max(otv-1,0))\r\nelse:\r\n\tprint(otv)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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 newspaper contains string *t*, consisting of uppercase and lowercase English letters. We know that the length of string *t* greater or equal to the length of the string *s*.\n\nThe newspaper may possibly have too few of some letters needed to make the text and too many of some other letters. That's why Tanya wants to cut some *n* letters out of the newspaper and make a message of length exactly *n*, so that it looked as much as possible like *s*. If the letter in some position has correct value and correct letter case (in the string *s* and in the string that Tanya will make), then she shouts joyfully \"YAY!\", and if the letter in the given position has only the correct value but it is in the wrong case, then the girl says \"WHOOPS\".\n\nTanya wants to make such message that lets her shout \"YAY!\" as much as possible. If there are multiple ways to do this, then her second priority is to maximize the number of times she says \"WHOOPS\". Your task is to help Tanya make the message.",
"input": "",
"output": "```python\nTM = input()\r\nNM = input()\r\nLTM = list(TM)\r\nLNM = list(NM)\r\ncnt1 = 0\r\ncnt2 = 0\r\nfor i in range(len(LTM)):\r\n\tfor j in range(len(LNM)):\r\n\t\tif LTM[i] == LNM[j]:\r\n\t\t\tpass\r\n\t\t\tcnt1 += 1\r\n\t\t\tLNM[j] = ' '\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tif LTM[i] == LNM[j].upper():\r\n\t\t\t\tcnt2 += 1\r\n\t\t\t\tLNM[j] = 'A4'\r\n\t\t\t\tbreak\r\n\t\t\telif(LTM[i] == LNM[j].lower()):\r\n\t\t\t\tcnt2 += 1\r\n\t\t\t\tLNM[j] = 'A4'\r\n\t\t\t\tbreak\r\nprint(cnt1,cnt2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp is working on a new project called \"Polychat\". Following modern tendencies in IT, he decided, that this project should contain chat as well. To achieve this goal, Polycarp has spent several hours in front of his laptop and implemented a chat server that can process three types of commands:\n - Include a person to the chat ('Add' command). - Remove a person from the chat ('Remove' command). - Send a message from a person to all people, who are currently in the chat, including the one, who sends the message ('Send' command). \nNow Polycarp wants to find out the amount of outgoing traffic that the server will produce while processing a particular set of commands.\n\nPolycarp knows that chat server sends no traffic for 'Add' and 'Remove' commands. When 'Send' command is processed, server sends *l* bytes to each participant of the chat, where *l* is the length of the message.\n\nAs Polycarp has no time, he is asking for your help in solving this problem.",
"input": "",
"output": "```python\nfrom sys import stdin \r\ninputs = []\r\ninputs = stdin.read().splitlines()\r\ns1=set()\r\nans=0\r\nfor i in inputs:\r\n if i[0]==\"+\":\r\n s1.add(i[1:])\r\n elif i[0]=='-':\r\n s1.remove(i[1:])\r\n else:\r\n ind=i.index(':')\r\n msglen=len(i[ind:])-1\r\n ans+=msglen*len(s1)\r\nprint(ans) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed *w* kilos. They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem.\n\nPete and Billy are great fans of even numbers, that's why they want to divide the watermelon in such a way that each of the two parts weighs even number of kilos, at the same time it is not obligatory that the parts are equal. The boys are extremely tired and want to start their meal as soon as possible, that's why you should help them and find out, if they can divide the watermelon in the way they want. For sure, each of them should get a part of positive weight.",
"input": "",
"output": "```python\na=input()\r\na=int(a)\r\nif a%2!=0:\r\n print(\"NO\")\r\nelse:\r\n if a==2:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are *n* flights that must depart today, the *i*-th of them is planned to depart at the *i*-th minute of the day.\n\nMetropolis airport is the main transport hub of Metropolia, so it is difficult to keep the schedule intact. This is exactly the case today: because of technical issues, no flights were able to depart during the first *k* minutes of the day, so now the new departure schedule must be created.\n\nAll *n* scheduled flights must now depart at different minutes between (*k*<=+<=1)-th and (*k*<=+<=*n*)-th, inclusive. However, it's not mandatory for the flights to depart in the same order they were initially scheduled to do so — their order in the new schedule can be different. There is only one restriction: no flight is allowed to depart earlier than it was supposed to depart in the initial schedule.\n\nHelen knows that each minute of delay of the *i*-th flight costs airport *c**i* burles. Help her find the order for flights to depart in the new schedule that minimizes the total cost for the airport.",
"input": "",
"output": "```python\nn, k = map(int, input().split())\r\nc = list(map(int, input().split()))\r\ns = []\r\nmax_elem = 0\r\nmax_elem_i = 0\r\nfor i in range(n):\r\n if c[i] > max_elem:\r\n max_elem_i = i\r\n max_elem = c[i]\r\nfor i in range(n):\r\n s.append((c[i], i))\r\ns.sort(reverse=True)\r\nres = [0] * n\r\np = 0\r\nq = 0\r\nfor i, pair in enumerate(s):\r\n if pair[1] + k < max_elem_i:\r\n res[q] = pair[1] + k + 1\r\n q += 1\r\nfor i, pair in enumerate(s):\r\n if pair[1] + k >= max_elem_i:\r\n res[q] = pair[1] + k + 1\r\n q += 1\r\nfor i in range(n):\r\n p += (res[i] - i - 1) * c[i]\r\nprint(p)\r\nprint(' '.join(map(str, res)))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given three integers $a$, $b$ and $x$. Your task is to construct a binary string $s$ of length $n = a + b$ such that there are exactly $a$ zeroes, exactly $b$ ones and exactly $x$ indices $i$ (where $1 \\le i < n$) such that $s_i \\ne s_{i + 1}$. It is guaranteed that the answer always exists.\n\nFor example, for the string \"01010\" there are four indices $i$ such that $1 \\le i < n$ and $s_i \\ne s_{i + 1}$ ($i = 1, 2, 3, 4$). For the string \"111001\" there are two such indices $i$ ($i = 3, 5$).\n\nRecall that binary string is a non-empty sequence of characters where each character is either 0 or 1.",
"input": "",
"output": "```python\nfrom math import*\r\nimport os\r\n\r\na,b,x=map(int,input().split())\r\nc=0\r\nd=0\r\nif x%2==0:\r\n\tvar=x//2\r\n\tfor i in range(var):\r\n\t\tif a>b:\r\n\t\t\tprint(\"01\",end='')\r\n\t\telse:\r\n\t\t\tprint(\"10\",end='')\r\n\tfor i in range(min(a,b)-var):\r\n\t\tprint(\"1\" if a>b else 0,end='')\r\n\tfor i in range(max(a,b)-var):\r\n\t\tprint(\"0\" if a>b else 1,end='')\r\nelse:\r\n\tvar=(x-1)//2\r\n\tfor i in range(var):\r\n\t\tif a>b:\r\n\t\t\tprint(\"01\",end='')\r\n\t\telse:\r\n\t\t\tprint(\"10\",end='')\r\n\tfor i in range(max(a,b)-var):\r\n\t\tprint(\"0\" if a>b else \"1\",end='')\r\n\tfor i in range(min(a,b)-var):\r\n\t\tprint(\"1\" if a>b else 0,end='')\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Have you ever tried to explain to the coordinator, why it is eight hours to the contest and not a single problem has been prepared yet? Misha had. And this time he has a really strong excuse: he faced a space-time paradox! Space and time replaced each other.\n\nThe entire universe turned into an enormous clock face with three hands — hour, minute, and second. Time froze, and clocks now show the time *h* hours, *m* minutes, *s* seconds.\n\nLast time Misha talked with the coordinator at *t*1 o'clock, so now he stands on the number *t*1 on the clock face. The contest should be ready by *t*2 o'clock. In the terms of paradox it means that Misha has to go to number *t*2 somehow. Note that he doesn't have to move forward only: in these circumstances time has no direction.\n\nClock hands are very long, and Misha cannot get round them. He also cannot step over as it leads to the collapse of space-time. That is, if hour clock points 12 and Misha stands at 11 then he cannot move to 1 along the top arc. He has to follow all the way round the clock center (of course, if there are no other hands on his way).\n\nGiven the hands' positions, *t*1, and *t*2, find if Misha can prepare the contest on time (or should we say on space?). That is, find if he can move from *t*1 to *t*2 by the clock face.",
"input": "",
"output": "```python\nx=list(map(int,input().split()))\r\nx[0]=int((x[0]*(60/12))) % 60 \r\nm=x[1]\r\ns=x[2]\r\nx[3]=int((x[3]*(60/12))) % 60 \r\nx[4]=int((x[4]*(60/12))) % 60 \r\n\r\nz=[x[1],x[2],x[0]]\r\nz.sort()\r\nx1=[]\r\nx2=[]\r\nfor i in range(1,3):\r\n if z[i-1]==z[i]:\r\n del(z[i])\r\n break\r\nif len(z)==3:\r\n if x[3]>z[0] and x[3]z[1] and x[3]z[0] and x[4]z[1] and x[4]z[0] and x[3]z[0] and x[4]=2400 and after >before:\r\n count+=1\r\n else :\r\n break\r\nif count>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You can not just take the file and send it. When Polycarp trying to send a file in the social network \"Codehorses\", he encountered an unexpected problem. If the name of the file contains three or more \"x\" (lowercase Latin letters \"x\") in a row, the system considers that the file content does not correspond to the social network topic. In this case, the file is not sent and an error message is displayed.\n\nDetermine the minimum number of characters to remove from the file name so after that the name does not contain \"xxx\" as a substring. Print 0 if the file name does not initially contain a forbidden substring \"xxx\".\n\nYou can delete characters in arbitrary positions (not necessarily consecutive). If you delete a character, then the length of a string is reduced by $1$. For example, if you delete the character in the position $2$ from the string \"exxxii\", then the resulting string is \"exxii\".",
"input": "",
"output": "```python\nn=int(input())\r\ns=input()\r\ncount=0\r\nfor i in range(n-2):\r\n if s[i]+s[i+1]+s[i+2]==\"xxx\":\r\n count+=1\r\nprint(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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*.\n\nYou're given a set of *n* distinct positive integers. Your task is to find the size of it's largest *k*-multiple free subset.",
"input": "",
"output": "```python\ndef solve(arr, n, k):\r\n dp = [1 for i in range(n)]\r\n \r\n for i in range(1,n):\r\n temp = 0\r\n for j in range(i):\r\n if arr[i]%arr[j]!=0:\r\n temp += 1\r\n dp[i] = temp\r\n \r\n return max(dp)\r\n \r\nif __name__==\"__main__\":\r\n n,k = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n arr.sort()\r\n \r\n ans = solve(arr,n,k)\r\n print(ans)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "*n* children are standing in a circle and playing a game. Children's numbers in clockwise order form a permutation *a*1,<=*a*2,<=...,<=*a**n* of length *n*. It is an integer sequence such that each integer from 1 to *n* appears exactly once in it.\n\nThe game consists of *m* steps. On each step the current leader with index *i* counts out *a**i* people in clockwise order, starting from the next person. The last one to be pointed at by the leader becomes the new leader.\n\nYou are given numbers *l*1,<=*l*2,<=...,<=*l**m* — indices of leaders in the beginning of each step. Child with number *l*1 is the first leader in the game. \n\nWrite a program which will restore a possible permutation *a*1,<=*a*2,<=...,<=*a**n*. If there are multiple solutions then print any of them. If there is no solution then print -1.",
"input": "",
"output": "```python\nn,m = map(int, input().split())\r\nl = list(map(int,input().split()))\r\na = [0 for i in range(n+1)]\r\ncur = l[0]\r\nfor i in range(1,m):\r\n nx = l[i%m]\r\n if nx > l[i-1]:\r\n val = nx - l[i-1]\r\n else:\r\n val = n - l[i-1] + nx\r\n if not a[l[i-1]]:\r\n a[l[i-1]] = val \r\n elif a[l[i-1]] != val:\r\n print(\"-1\")\r\n quit()\r\ncnt = [0 for i in range(n+1)]\r\nfor i in range(1,n+1):\r\n cnt[a[i]] += 1 \r\n if cnt[a[i]] > 1:\r\n print(\"-1\") \r\n quit()\r\ncr = 1 \r\nfor i in range(1,n+1):\r\n if a[i]: continue\r\n while cnt[cr]:\r\n cr += 1 \r\n a[i] = cr \r\n cr += 1 \r\nfor i in range(1, n+1):\r\n print(a[i],end=\" \")\r\n\r\n \r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Each New Year Timofey and his friends cut down a tree of *n* vertices and bring it home. After that they paint all the *n* its vertices, so that the *i*-th vertex gets color *c**i*.\n\nNow it's time for Timofey birthday, and his mother asked him to remove the tree. Timofey removes the tree in the following way: he takes some vertex in hands, while all the other vertices move down so that the tree becomes rooted at the chosen vertex. After that Timofey brings the tree to a trash can.\n\nTimofey doesn't like it when many colors are mixing together. A subtree annoys him if there are vertices of different color in it. Timofey wants to find a vertex which he should take in hands so that there are no subtrees that annoy him. He doesn't consider the whole tree as a subtree since he can't see the color of the root vertex.\n\nA subtree of some vertex is a subgraph containing that vertex and all its descendants.\n\nYour task is to determine if there is a vertex, taking which in hands Timofey wouldn't be annoyed.",
"input": "",
"output": "```python\nR=lambda:map(int,input().split())\r\nt,=R()\r\n\r\nfor _ in range(t-1):\r\n x=list(R())\r\na=list(R())\r\ns=set(a)\r\nc=0\r\nd=0\r\nfor i in s:\r\n if(a.count(i)>1):\r\n c+=1\r\n if(a.count(i)==1):\r\n d=i\r\nif(c>1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(d)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Iahub helps his grandfather at the farm. Today he must milk the cows. There are *n* cows sitting in a row, numbered from 1 to *n* from left to right. Each cow is either facing to the left or facing to the right. When Iahub milks a cow, all the cows that see the current cow get scared and lose one unit of the quantity of milk that they can give. A cow facing left sees all the cows with lower indices than her index, and a cow facing right sees all the cows with higher indices than her index. A cow that got scared once can get scared again (and lose one more unit of milk). A cow that has been milked once cannot get scared and lose any more milk. You can assume that a cow never loses all the milk she can give (a cow gives an infinitely amount of milk).\n\nIahub can decide the order in which he milks the cows. But he must milk each cow exactly once. Iahub wants to lose as little milk as possible. Print the minimum amount of milk that is lost.",
"input": "",
"output": "```python\nfrom functools import reduce\n\n\nclass GukziString:\n chars = 'abcdefghijklmnopqrstuvwxyz'\n\n def __init__(self, string=''):\n super(GukziString, self).__init__()\n for ch in GukziString.chars:\n setattr(self, ch, 0)\n for ch in string:\n setattr(self, ch, getattr(self, ch) + 1)\n\n def __sub__(self, other):\n ans = GukziString()\n for ch in GukziString.chars:\n setattr(ans, ch, getattr(self, ch) - getattr(other, ch))\n return ans\n\n def __mul__(self, number):\n ans = GukziString()\n for ch in GukziString.chars:\n setattr(ans, ch, getattr(self, ch) * number)\n return ans\n\n def __floordiv__(self, other):\n valid_chars = filter(lambda ch: getattr(other, ch) != 0, GukziString.chars)\n return reduce(lambda x, y: min(x, y), [getattr(self, ch) // getattr(other, ch) for ch in valid_chars])\n\n def __mod__(self, other):\n return self - other * (self // other)\n\n def __str__(self):\n ans = ''\n for ch in GukziString.chars:\n ans += ch * getattr(self, ch)\n return ans\n\n\na_str = input()\nb_str = input()\nc_str = input()\n\na = GukziString(a_str)\nb = GukziString(b_str)\nc = GukziString(c_str)\n\nb_count = max(b_count + (a - b * b_count) // c for b_count in range(a // b + 1))\nprint(f'{b_str * b_count}{c_str * ((a - b * b_count) // c)}{(a - b * b_count) % c}')\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amount of energy. Initially every accumulator has some amount of energy: the *i*-th accumulator has *a**i* units of energy. Energy can be transferred from one accumulator to the other. Every time *x* units of energy are transferred (*x* is not necessarily an integer) *k* percent of it is lost. That is, if *x* units were transferred from one accumulator to the other, amount of energy in the first one decreased by *x* units and in other increased by units.\n\nYour task is to help Petya find what maximum equal amount of energy can be stored in each accumulator after the transfers.",
"input": "",
"output": "```python\ndef energy(acc, level, perc_loss):\n surplus = sum([max(x - level, 0) for x in acc])\n en_cost = sum([(abs(min(0, x - level)) * 100) / (100 - perc_loss) for x in acc])\n return surplus >= en_cost\n\n\nclass CodeforcesTask68BSolution:\n def __init__(self):\n self.result = ''\n self.n_k = []\n self.accumulators = []\n\n def read_input(self):\n self.n_k = [int(x) for x in input().split(\" \")]\n self.accumulators = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n l = 0\n r = sum(self.accumulators) / self.n_k[0]\n while r - l >= 0.000_0001:\n mid = l + (r - l) / 2\n if energy(self.accumulators, mid, self.n_k[1]):\n l = mid\n else:\n r = mid\n self.result = str(r)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask68BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petr stands in line of *n* people, but he doesn't know exactly which position he occupies. He can say that there are no less than *a* people standing in front of him and no more than *b* people standing behind him. Find the number of different positions Petr can occupy.",
"input": "",
"output": "```python\nn,a,b = map(int,input().split())\nans = a+1\nprint(ans)\n \t\t\t \t \t \t\t\t\t\t \t\t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.\n\nThere are *n* columns of toy cubes in the box arranged in a line. The *i*-th column contains *a**i* cubes. At first, the gravity in the box is pulling the cubes downwards. When Chris switches the gravity, it begins to pull all the cubes to the right side of the box. The figure shows the initial and final configurations of the cubes in the box: the cubes that have changed their position are highlighted with orange.\n\nGiven the initial configuration of the toy cubes in the box, find the amounts of cubes in each of the *n* columns after the gravity switch!",
"input": "",
"output": "```python\nn = int(input())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\nfor i in range(n):\r\n print(x[i], end=' ')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Manao works on a sports TV. He's spent much time watching the football games of some country. After a while he began to notice different patterns. For example, each team has two sets of uniforms: home uniform and guest uniform. When a team plays a game at home, the players put on the home uniform. When a team plays as a guest on somebody else's stadium, the players put on the guest uniform. The only exception to that rule is: when the home uniform color of the host team matches the guests' uniform, the host team puts on its guest uniform as well. For each team the color of the home and guest uniform is different.\n\nThere are *n* teams taking part in the national championship. The championship consists of *n*·(*n*<=-<=1) games: each team invites each other team to its stadium. At this point Manao wondered: how many times during the championship is a host team going to put on the guest uniform? Note that the order of the games does not affect this number.\n\nYou know the colors of the home and guest uniform for each team. For simplicity, the colors are numbered by integers in such a way that no two distinct colors have the same number. Help Manao find the answer to his question.",
"input": "",
"output": "```python\nN = int(input())\r\nM = N*(N - 1)\r\n\r\nMISS = []\r\nFI = []\r\nC = 0\r\nfor i in range(N):\r\n \r\n T = input().split()\r\n MISS.append(T[1])\r\n FI.append(T[0])\r\n \r\n \r\nfor i in range(N):\r\n for j in (FI) : \r\n if j == MISS[i]:\r\n C+=1\r\n \r\nprint(C)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A and B are preparing themselves for programming contests.\n\nTo train their logical thinking and solve problems better, A and B decided to play chess. During the game A wondered whose position is now stronger.\n\nFor each chess piece we know its weight: \n - the queen's weight is 9, - the rook's weight is 5, - the bishop's weight is 3, - the knight's weight is 3, - the pawn's weight is 1, - the king's weight isn't considered in evaluating position. \nThe player's weight equals to the sum of weights of all his pieces on the board.\n\nAs A doesn't like counting, he asked you to help him determine which player has the larger position weight.",
"input": "",
"output": "```python\nw=0\r\nb=0\r\nm=[input() for i in range(8)]\r\nfor line in m:\r\n for p in line:\r\n if p==\"Q\":\r\n w+=9\r\n elif p==\"R\":\r\n w+=5\r\n elif p==\"B\" or p==\"N\":\r\n w+=3\r\n elif p==\"P\":\r\n w+=1\r\n if p==\"q\":\r\n b+=9\r\n elif p==\"r\":\r\n b+=5\r\n elif p==\"b\" or p==\"n\":\r\n b+=3\r\n elif p==\"p\":\r\n b+=1\r\nif w>b:\r\n print(\"White\")\r\nelif b>w:\r\n print(\"Black\")\r\nelse:\r\n print(\"Draw\")\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One rainy gloomy evening when all modules hid in the nearby cafes to drink hot energetic cocktails, the Hexadecimal virus decided to fly over the Mainframe to look for a Great Idea. And she has found one!\n\nWhy not make her own Codeforces, with blackjack and other really cool stuff? Many people will surely be willing to visit this splendid shrine of high culture.\n\nIn Mainframe a standard pack of 52 cards is used to play blackjack. The pack contains cards of 13 values: 2, 3, 4, 5, 6, 7, 8, 9, 10, jacks, queens, kings and aces. Each value also exists in one of four suits: hearts, diamonds, clubs and spades. Also, each card earns some value in points assigned to it: cards with value from two to ten earn from 2 to 10 points, correspondingly. An ace can either earn 1 or 11, whatever the player wishes. The picture cards (king, queen and jack) earn 10 points. The number of points a card earns does not depend on the suit. The rules of the game are very simple. The player gets two cards, if the sum of points of those cards equals *n*, then the player wins, otherwise the player loses.\n\nThe player has already got the first card, it's the queen of spades. To evaluate chances for victory, you should determine how many ways there are to get the second card so that the sum of points exactly equals *n*.",
"input": "",
"output": "```python\nn = int(input())\r\n\r\nif n <= 10 :\r\n print(0)\r\nelse:\r\n if n <= 19:\r\n print(4)\r\n elif n == 20:\r\n print(15)\r\n elif n == 21:\r\n print(4)\r\n else:\r\n print(0)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Some dwarves that are finishing the StUDY (State University for Dwarven Youngsters) Bachelor courses, have been told \"no genome, no degree\". That means that all dwarves should write a thesis on genome. Dwarven genome is far from simple. It is represented by a string that consists of lowercase Latin letters.\n\nDwarf Misha has already chosen the subject for his thesis: determining by two dwarven genomes, whether they belong to the same race. Two dwarves belong to the same race if we can swap two characters in the first dwarf's genome and get the second dwarf's genome as a result. Help Dwarf Misha and find out whether two gnomes belong to the same race or not.",
"input": "",
"output": "```python\ns1=input()\r\ns2=input()\r\ns1=[s1[k] for k in range(len(s1))]\r\ns2=[s2[k] for k in range(len(s2))]\r\nx=0\r\nans=\"\"\r\nif len(s1)!=len(s2):\r\n print(\"NO\")\r\nfor i in range(len(s1)):\r\n for j in range(i+1,len(s1)):\r\n \r\n s1[i],s1[j]=s1[j],s1[i]\r\n if s1==s2:\r\n x+=1\r\n ans=\"YES\"\r\n break\r\n else:\r\n s1[i],s1[j]=s1[j],s1[i]\r\n \r\nif x==1 and ans==\"YES\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "It's holiday. Mashmokh and his boss, Bimokh, are playing a game invented by Mashmokh. \n\nIn this game Mashmokh writes sequence of *n* distinct integers on the board. Then Bimokh makes several (possibly zero) moves. On the first move he removes the first and the second integer from from the board, on the second move he removes the first and the second integer of the remaining sequence from the board, and so on. Bimokh stops when the board contains less than two numbers. When Bimokh removes numbers *x* and *y* from the board, he gets *gcd*(*x*,<=*y*) points. At the beginning of the game Bimokh has zero points.\n\nMashmokh wants to win in the game. For this reason he wants his boss to get exactly *k* points in total. But the guy doesn't know how choose the initial sequence in the right way. \n\nPlease, help him. Find *n* distinct integers *a*1,<=*a*2,<=...,<=*a**n* such that his boss will score exactly *k* points. Also Mashmokh can't memorize too huge numbers. Therefore each of these integers must be at most 109.",
"input": "",
"output": "```python\nn,k=map(int,input().split())\r\n\r\nif(k0)):\r\n print(-1)\r\nelse:\r\n v=[]\r\n v.append(k-int(n/2)+1)\r\n v.append(2*(k-int(n/2)+1))\r\n i=1\r\n while(len(v)1000000000):\r\n f=1\r\n print(-1)\r\n if(f==0):\r\n for i in v:\r\n print(i,end=\" \")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\nm,n=input().split()\r\nm=int(m)\r\nn=int(n)\r\nif(1<=m and m<=n and n<=16):\r\n p=m*n\r\n t=p//2\r\n print(t)\r\nelse:\r\n print('Invalid Input')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string *s*. \n\nString *p* is called a substring of string *s* if you can read it starting from some position in the string *s*. For example, string \"aba\" has six substrings: \"a\", \"b\", \"a\", \"ab\", \"ba\", \"aba\".\n\nDr. Moriarty plans to take string *s* and cut out some substring from it, let's call it *t*. Then he needs to change the substring *t* zero or more times. As a result, he should obtain a fixed string *u* (which is the string that should be sent to Sherlock Holmes). One change is defined as making one of the following actions: \n - Insert one letter to any end of the string. - Delete one letter from any end of the string. - Change one letter into any other one. \nMoriarty is very smart and after he chooses some substring *t*, he always makes the minimal number of changes to obtain *u*. \n\nHelp Moriarty choose the best substring *t* from all substrings of the string *s*. The substring *t* should minimize the number of changes Moriarty should make to obtain the string *u* from it.",
"input": "",
"output": "```python\nprint(\"_RANDOM_GUESS_1689418688.3535597\")# 1689418688.3535807\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Iahub and Iahubina went to a date at a luxury restaurant. Everything went fine until paying for the food. Instead of money, the waiter wants Iahub to write a Hungry sequence consisting of *n* integers. \n\nA sequence *a*1, *a*2, ..., *a**n*, consisting of *n* integers, is Hungry if and only if: \n - Its elements are in increasing order. That is an inequality *a**i*<=<<=*a**j* holds for any two indices *i*,<=*j* (*i*<=<<=*j*). - For any two indices *i* and *j* (*i*<=<<=*j*), *a**j* must not be divisible by *a**i*. \nIahub is in trouble, so he asks you for help. Find a Hungry sequence with *n* elements.",
"input": "",
"output": "```python\n# for _ in range(1,int(input())+1):\r\nn=int(input())\r\n # n,k=map(int,input().split()) \r\n # s=(input()) \r\n # a=list(map(int,input().split()))\r\narr=[True]*(10**7)\r\n# arr[0],arr[1]=True,True\r\nfor i in range(2,10**5):\r\n if arr[i]==True:\r\n print(i,end=\" \")\r\n n-=1\r\n if n==0:\r\n exit()\r\n for j in range(i*i,10**5+1,i):\r\n arr[j]=False\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Igor is in the museum and he wants to see as many pictures as possible.\n\nMuseum can be represented as a rectangular field of *n*<=×<=*m* cells. Each cell is either empty or impassable. Empty cells are marked with '.', impassable cells are marked with '*'. Every two adjacent cells of different types (one empty and one impassable) are divided by a wall containing one picture.\n\nAt the beginning Igor is in some empty cell. At every moment he can move to any empty cell that share a side with the current one.\n\nFor several starting positions you should calculate the maximum number of pictures that Igor can see. Igor is able to see the picture only if he is in the cell adjacent to the wall with this picture. Igor have a lot of time, so he will examine every picture he can see.",
"input": "",
"output": "```python\ndef dfs(x, y):\r\n vis[x][y] = True\r\n path.append((x, y))\r\n paintings = 0\r\n for dx, dy in ((-1, 0), (1, 0), (0, -1), (0, 1)):\r\n x1, y1 = x+dx, y+dy\r\n if x1 < 0 or x1 >= n or y1 < 0 or y1 >= m or vis[x1][y1]:\r\n continue\r\n if grid[x1][y1] == \"*\":\r\n paintings += 1\r\n else:\r\n vis[x1][y1] = True\r\n paintings += dfs(x1, y1)\r\n return paintings\r\n\r\nif __name__ == \"__main__\":\r\n n, m, k = map(int, input().split())\r\n grid = [input() for _ in range(n)]\r\n count = [[0 for _ in range(m)] for _ in range(n)]\r\n vis = [[False for _ in range(m)] for _ in range(n)]\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if not vis[i][j] and grid[i][j] != \"*\":\r\n path = list()\r\n paintings = dfs(i, j)\r\n for x, y in path:\r\n count[x][y] = paintings\r\n\r\n for _ in range(k):\r\n x, y = map(int, input().split())\r\n print(count[x-1][y-1])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer.\n\nAt the start of the day they have *x* ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and Gerda's house even in the night. Each person in the queue wants either to take several ice cream packs for himself and his friends or to give several ice cream packs to Kay and Gerda (carriers that bring ice cream have to stand in the same queue).\n\nIf a carrier with *d* ice cream packs comes to the house, then Kay and Gerda take all his packs. If a child who wants to take *d* ice cream packs comes to the house, then Kay and Gerda will give him *d* packs if they have enough ice cream, otherwise the child will get no ice cream at all and will leave in distress.\n\nKay wants to find the amount of ice cream they will have after all people will leave from the queue, and Gerda wants to find the number of distressed kids.",
"input": "",
"output": "```python\nn,x=map(int,input().split())\r\ncount=0\r\nfor i in range(0,n,1):\r\n s,c=map(str,input().split())\r\n c=int(c)\r\n if s=='+':\r\n x=x+c\r\n else:\r\n if x-c<0:\r\n count=count+1\r\n else:\r\n x=x-c\r\nprint(str(x)+\" \"+str(count))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There exists an island called Arpa’s land, some beautiful girls live there, as ugly ones do.\n\nMehrdad wants to become minister of Arpa’s land. Arpa has prepared an exam. Exam has only one question, given *n*, print the last digit of 1378*n*. \n\nMehrdad has become quite confused and wants you to help him. Please help, although it's a naive cheat.",
"input": "",
"output": "```python\nn=int(input())\r\nif n==0:\r\n print(1)\r\nelse:\r\n w=n%4\r\n if w==1:\r\n print(8)\r\n elif w==2:\r\n print(4)\r\n elif w==3:\r\n print(2)\r\n else:\r\n print(6)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pig is visiting a friend.\n\nPig's house is located at point 0, and his friend's house is located at point *m* on an axis.\n\nPig can use teleports to move along the axis.\n\nTo use a teleport, Pig should come to a certain point (where the teleport is located) and choose where to move: for each teleport there is the rightmost point it can move Pig to, this point is known as the limit of the teleport.\n\nFormally, a teleport located at point *x* with limit *y* can move Pig from point *x* to any point within the segment [*x*;<=*y*], including the bounds.\n\nDetermine if Pig can visit the friend using teleports only, or he should use his car.",
"input": "",
"output": "```python\nn,m = map(int,input().split())\r\nst = 0\r\na,b = map(int,input().split())\r\nif a != 0:\r\n print(\"NO\")\r\nelse:\r\n st = a\r\n end = b\r\n flag = True\r\n for i in range(n-1):\r\n a,b = map(int,input().split())\r\n if end>=m:\r\n break\r\n if end>=a:\r\n st = a\r\n end = b\r\n else:\r\n flag = False\r\n break\r\n if flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\nfor _ in range(1):\r\n string = list(input())\r\n n = len(string)\r\n upperCase = 0\r\n lowerCase = 0\r\n for i in range(n):\r\n if string[i].isupper();\r\n upperCase += 1\r\n else:\r\n lowerCase += 1\r\n\r\n \r\n if upperCase <= lowerCase:\r\n print(string.lower()) \r\n\r\n else:\r\n print(string.upper())\r\n\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.\n\nRight now, Limak and Bob weigh *a* and *b* respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight.\n\nLimak eats a lot and his weight is tripled after every year, while Bob's weight is doubled after every year.\n\nAfter how many full years will Limak become strictly larger (strictly heavier) than Bob?",
"input": "",
"output": "```python\nraj,shiv= list(map(int, input().split()))\r\nr = int()\r\nwhile raj 0:\r\n ai2[j] += 1\r\n temp2 -= 1\r\n j = (j+1)%14\r\n j = 0\r\n while j < 14:\r\n if ai2[j] % 2 == 0:\r\n tempans += ai2[j]\r\n j += 1\r\n ans = max(ans,tempans)\r\n i += 1\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The bear has a string *s*<==<=*s*1*s*2... *s*|*s*| (record |*s*| is the string's length), consisting of lowercase English letters. The bear wants to count the number of such pairs of indices *i*,<=*j* (1<=≤<=*i*<=≤<=*j*<=≤<=|*s*|), that string *x*(*i*,<=*j*)<==<=*s**i**s**i*<=+<=1... *s**j* contains at least one string \"bear\" as a substring.\n\nString *x*(*i*,<=*j*) contains string \"bear\", if there is such index *k* (*i*<=≤<=*k*<=≤<=*j*<=-<=3), that *s**k*<==<=*b*, *s**k*<=+<=1<==<=*e*, *s**k*<=+<=2<==<=*a*, *s**k*<=+<=3<==<=*r*.\n\nHelp the bear cope with the given problem.",
"input": "",
"output": "```python\ndef bear(s):\r\n\tb =0\r\n\tfor i in range(len(s)):\r\n\t\tc = s.find('bear' , i)\r\n\t\tif c >=0:\r\n\t\t\tb+=len(s)-c-3\r\n\treturn b\r\nif __name__ == '__main__':\r\n\ts = input()\r\n\tprint(bear(s))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) reversely. For example, a Berlandish word code corresponds to a Birlandish word edoc. However, it's easy to make a mistake during the «translation». Vasya translated word *s* from Berlandish into Birlandish as *t*. Help him: find out if he translated the word correctly.",
"input": "",
"output": "```python\ns = input()\r\nt = input()\r\ns = ' '.join(s)\r\ns = list(s.split())\r\ns.reverse()\r\nt = ' '.join(t)\r\nt = list(t.split())\r\nif s == t:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The polar bears are going fishing. They plan to sail from (*s**x*,<=*s**y*) to (*e**x*,<=*e**y*). However, the boat can only sail by wind. At each second, the wind blows in one of these directions: east, south, west or north. Assume the boat is currently at (*x*,<=*y*).\n - If the wind blows to the east, the boat will move to (*x*<=+<=1,<=*y*). - If the wind blows to the south, the boat will move to (*x*,<=*y*<=-<=1). - If the wind blows to the west, the boat will move to (*x*<=-<=1,<=*y*). - If the wind blows to the north, the boat will move to (*x*,<=*y*<=+<=1). \nAlternatively, they can hold the boat by the anchor. In this case, the boat stays at (*x*,<=*y*). Given the wind direction for *t* seconds, what is the earliest time they sail to (*e**x*,<=*e**y*)?",
"input": "",
"output": "```python\nt, s_x, s_y, e_x, e_y = map(int, input().split())\ndirections = list(input())\n\nx_dir = e_x - s_x\ny_dir = e_y - s_y\n\nduration = 0\nreached = False\ncur_point = [s_x, s_y]\nfor d in directions:\n if x_dir == 0 and y_dir == 0:\n reached = True\n break\n if d == 'S' and y_dir<0:\n y_dir +=1\n elif d == \"N\" and y_dir > 0:\n y_dir -=1\n elif d == \"E\" and x_dir > 0:\n x_dir -=1\n elif d == 'W' and x_dir < 0:\n x_dir += 1\n duration += 1\n\nif not reached:\n print('-1')\nelse:\n print(duration)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.\n\nOne day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.\n\nIn his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The *i*-th digit of the answer is 1 if and only if the *i*-th digit of the two given numbers differ. In the other case the *i*-th digit of the answer is 0.\n\nShapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.\n\nNow you are going to take part in Shapur's contest. See if you are faster and more accurate.",
"input": "",
"output": "```python\nnum1,num2 = input(),input()\r\nstr1 = ''\r\nfor i in range(0,len(num1)):\r\n if num1[i] != num2[i]:\r\n str1 += '1'\r\n else:\r\n str1 += '0'\r\nprint(str1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pig is visiting a friend.\n\nPig's house is located at point 0, and his friend's house is located at point *m* on an axis.\n\nPig can use teleports to move along the axis.\n\nTo use a teleport, Pig should come to a certain point (where the teleport is located) and choose where to move: for each teleport there is the rightmost point it can move Pig to, this point is known as the limit of the teleport.\n\nFormally, a teleport located at point *x* with limit *y* can move Pig from point *x* to any point within the segment [*x*;<=*y*], including the bounds.\n\nDetermine if Pig can visit the friend using teleports only, or he should use his car.",
"input": "",
"output": "```python\n\nt, f = [int(x) for x in input().split()]\nl = []\nwhile(t):\n a, b = [int(x) for x in input().split()]\n l.append([a, b])\n t -= 1\nprev_a = 0\nprev_d = 0\nflag = \"NO\"\nfor point in l:\n if(prev_a == 0 and prev_d == 0):\n prev_a = point[0]\n prev_d = point[1]\n else:\n if(point[1] > prev_d and point[1] != f):\n prev_a = point[0]\n prev_d = point[1]\n elif(point[1] > prev_d and point[1] == f):\n if(point[0] >= prev_a and point[0] <= prev_d):\n flag = \"YES\"\n break\nprint(flag)\n\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "*n* soldiers stand in a circle. For each soldier his height *a**i* is known. A reconnaissance unit can be made of such two neighbouring soldiers, whose heights difference is minimal, i.e. |*a**i*<=-<=*a**j*| is minimal. So each of them will be less noticeable with the other. Output any pair of soldiers that can form a reconnaissance unit.",
"input": "",
"output": "```python\nn = int(input())\r\narr = list(map(int, input().split()))\r\npair = []\r\ndif = float(\"inf\")\r\nfor i in range(1, n):\r\n temp = abs(arr[i] - arr[i - 1])\r\n if temp < dif:\r\n dif = temp\r\n pair = [i, i+1]\r\nif abs(arr[0] - arr[-1]) < dif:\r\n pair = [n, 1]\r\nprint(*pair, sep=\" \")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "An exam for *n* students will take place in a long and narrow room, so the students will sit in a line in some order. The teacher suspects that students with adjacent numbers (*i* and *i*<=+<=1) always studied side by side and became friends and if they take an exam sitting next to each other, they will help each other for sure.\n\nYour task is to choose the maximum number of students and make such an arrangement of students in the room that no two students with adjacent numbers sit side by side.",
"input": "",
"output": "```python\nn = int(input())\n\ndef main():\n if n in [1, 2]:\n print(1)\n print(1)\n return\n elif n == 3:\n print(2)\n print(1, 3)\n return\n elif n == 4:\n print(3)\n print(1, 4, 2)\n return\n\n print(n)\n\n for i in range(1, n+1, 2):\n print(i, end=' ')\n\n for i in range(2, n+1, 2):\n print(i, end=' ')\n\nmain()\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "ZS the Coder is coding on a crazy computer. If you don't type in a word for a *c* consecutive seconds, everything you typed disappear! \n\nMore formally, if you typed a word at second *a* and then the next word at second *b*, then if *b*<=-<=*a*<=≤<=*c*, just the new word is appended to other words on the screen. If *b*<=-<=*a*<=><=*c*, then everything on the screen disappears and after that the word you have typed appears on the screen.\n\nFor example, if *c*<==<=5 and you typed words at seconds 1,<=3,<=8,<=14,<=19,<=20 then at the second 8 there will be 3 words on the screen. After that, everything disappears at the second 13 because nothing was typed. At the seconds 14 and 19 another two words are typed, and finally, at the second 20, one more word is typed, and a total of 3 words remain on the screen.\n\nYou're given the times when ZS the Coder typed the words. Determine how many words remain on the screen after he finished typing everything.",
"input": "",
"output": "```python\n\"\"\"\r\nhttps://codeforces.com/problemset/problem/716/A\r\n\"\"\"\r\n\r\ndef ints(inp):\r\n return list(map(int, inp.split()))\r\n\r\n\r\nw = list()\r\nn, c = ints(input())\r\nnums = ints(input())\r\nfor i in range(n - 1):\r\n if nums[i+1] - nums[i] <= c:\r\n w.append(nums[i+1])\r\n w.append(nums[i])\r\n else:\r\n w.clear()\r\n \r\nprint(len(set(w)))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vanya got bored and he painted *n* distinct points on the plane. After that he connected all the points pairwise and saw that as a result many triangles were formed with vertices in the painted points. He asks you to count the number of the formed triangles with the non-zero area.",
"input": "",
"output": "```python\nimport functools\r\n\r\nclass Point:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n\r\n def area_triangle(self, p1, p2):\r\n vector_1 = [p1.x - self.x, p1.y - self.y]\r\n vector_2 = [p2.x - self.x, p2.y - self.y]\r\n return vector_1[0] * vector_2[1] - vector_1[1] * vector_2[0]\r\n\r\nclass NumberTriangles: \r\n def solution(self):\r\n num_points = int(input())\r\n points = []\r\n for _ in range(num_points):\r\n point = input()\r\n point = point.split(\" \")\r\n points.append(Point(int(point[0]), int(point[1])))\r\n\r\n num_triangles = 0\r\n for i in range(num_points):\r\n for j in range(i + 1, num_points):\r\n for k in range(j + 1, num_points):\r\n area = points[i].area_triangle(points[j], points[k])\r\n if area != 0:\r\n num_triangles += 1\r\n \r\n print(num_triangles)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n num_triangles = NumberTriangles()\r\n num_triangles.solution()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Valera runs a 24/7 fast food cafe. He magically learned that next day *n* people will visit his cafe. For each person we know the arrival time: the *i*-th person comes exactly at *h**i* hours *m**i* minutes. The cafe spends less than a minute to serve each client, but if a client comes in and sees that there is no free cash, than he doesn't want to wait and leaves the cafe immediately. \n\nValera is very greedy, so he wants to serve all *n* customers next day (and get more profit). However, for that he needs to ensure that at each moment of time the number of working cashes is no less than the number of clients in the cafe. \n\nHelp Valera count the minimum number of cashes to work at his cafe next day, so that they can serve all visitors.",
"input": "",
"output": "```python\nt=int(input())\r\ncount=1\r\na=-1\r\nb=-1\r\nfor i in range(t):\r\n n=int(input())\r\n m=int(input())\r\n if n==a and m==b:\r\n count=count+1\r\n a=n\r\n b=m\r\nprint(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "\"Contestant who earns a score equal to or greater than the *k*-th place finisher's score will advance to the next round, as long as the contestant earns a positive score...\" — an excerpt from contest rules.\n\nA total of *n* participants took part in the contest (*n*<=≥<=*k*), and you already know their scores. Calculate how many participants will advance to the next round.",
"input": "",
"output": "```python\nn,k=map(int,input().split())\r\nx=list(input().split())\r\nmw=0\r\n\r\nfor i in range(0,n):\r\n a=x[i]\r\n if a=='0':\r\n break\r\n if i\r\n#define mem(a,b) memset(a,b,sizeof a);\r\n#define rep(i,a,b) for(int i = a; i <= b; i++)\r\n#define per(i,a,b) for(int i = a; i >= b; i--)\r\n#define __ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)\r\ntypedef long long ll;\r\ntypedef double db;\r\nconst int inf = 1e8;\r\nconst int N = 5e5+10;\r\nconst db EPS = 1e-9;\r\nusing namespace std;\r\n\r\nvoid dbg() {cout << \"\\n\";}\r\ntemplate void dbg(T a, A... x) {cout << a << ' '; dbg(x...);}\r\n#define logs(x...) {cout << #x << \" -> \"; dbg(x);}\r\n\r\nint n,a[N],tot,head[N],sz[N],son[N],f[1<<22],dep[N],ans[N]; //f[i]:表示子树中异或和为f[i]的最大深度\r\nstruct Node{\r\n int to,next;\r\n}e[N];\r\n\r\nvoid add(int x,int y){\r\n e[++tot].to = y, e[tot].next = head[x], head[x] = tot;\r\n}\r\n\r\nvoid dfs1(int x){\r\n ans[x] = -inf; sz[x] = 1;\r\n for(int i = head[x]; i; i = e[i].next){\r\n int y = e[i].to;\r\n dep[y] = dep[x]+1; a[y] ^= a[x];\r\n dfs1(y); sz[x] += sz[y];\r\n if(sz[y] > sz[son[x]]) son[x] = y;\r\n }\r\n}\r\n\r\nvoid Delete(int x){\r\n f[a[x]] = -inf;\r\n for(int i = head[x]; i; i = e[i].next) Delete(e[i].to);\r\n}\r\n\r\nvoid modify(int x,int fa){\r\n ans[fa] = max(ans[fa],f[a[x]]+dep[x]-2*dep[fa]);\r\n for(int i = 0; i < 22; i++)\r\n ans[fa] = max(ans[fa],f[a[x]^(1<1 and ilc):\r\n print(n.upper())\r\nelse:\r\n print(n.lower())\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer.\n\nAt the start of the day they have *x* ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and Gerda's house even in the night. Each person in the queue wants either to take several ice cream packs for himself and his friends or to give several ice cream packs to Kay and Gerda (carriers that bring ice cream have to stand in the same queue).\n\nIf a carrier with *d* ice cream packs comes to the house, then Kay and Gerda take all his packs. If a child who wants to take *d* ice cream packs comes to the house, then Kay and Gerda will give him *d* packs if they have enough ice cream, otherwise the child will get no ice cream at all and will leave in distress.\n\nKay wants to find the amount of ice cream they will have after all people will leave from the queue, and Gerda wants to find the number of distressed kids.",
"input": "",
"output": "```python\nn, ans = map(int, input().split())\r\nd = 0\r\nfor i in range(n):\r\n p = input()\r\n if \"+ \" in p:\r\n p = p.replace(\"+ \", \"\")\r\n ans += int(p)\r\n else:\r\n p = p.replace(\"- \", \"\")\r\n p = int(p)\r\n if ans >= p:\r\n ans -= p\r\n else:\r\n d += 1\r\nprint(ans, d)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A string is a palindrome if it reads the same from the left to the right and from the right to the left. For example, the strings \"kek\", \"abacaba\", \"r\" and \"papicipap\" are palindromes, while the strings \"abb\" and \"iq\" are not.\n\nA substring $s[l \\ldots r]$ ($1<=\\leq<=l<=\\leq<=r<=\\leq<=|s|$) of a string $s<==<=s_{1}s_{2} \\ldots s_{|s|}$ is the string $s_{l}s_{l<=+<=1} \\ldots s_{r}$.\n\nAnna does not like palindromes, so she makes her friends call her Ann. She also changes all the words she reads in a similar way. Namely, each word $s$ is changed into its longest substring that is not a palindrome. If all the substrings of $s$ are palindromes, she skips the word at all.\n\nSome time ago Ann read the word $s$. What is the word she changed it into?",
"input": "",
"output": "```python\nimport re\r\nimport sys\r\ns=input()\r\nif s==s[::-1]:\r\n s=s.replace(s[-1],\"\",1)\r\n if s==s[::-1]:\r\n print(\"0\")\r\n else:\r\n print(len(s))\r\nelse:\r\n print(len(s))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.\n\nOne day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.\n\nIn his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The *i*-th digit of the answer is 1 if and only if the *i*-th digit of the two given numbers differ. In the other case the *i*-th digit of the answer is 0.\n\nShapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.\n\nNow you are going to take part in Shapur's contest. See if you are faster and more accurate.",
"input": "",
"output": "```python\nnum1=input()\r\nnum2=input()\r\nfor i in range(0,len(num1)):\r\n if(num1[i]==num2[i]):print(0,end='')\r\n else:print(1,end='')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A little boy Gerald entered a clothes shop and found out something very unpleasant: not all clothes turns out to match. For example, Gerald noticed that he looks rather ridiculous in a smoking suit and a baseball cap.\n\nOverall the shop sells *n* clothing items, and exactly *m* pairs of clothing items match. Each item has its price, represented by an integer number of rubles. Gerald wants to buy three clothing items so that they matched each other. Besides, he wants to spend as little money as possible. Find the least possible sum he can spend.",
"input": "",
"output": "```python\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=[]\r\nfor i in range(m):\r\n x=list(map(int,input().split()))\r\n a.append(x)\r\nif m==2:\r\n print(-1)\r\nelse:\r\n r=[]\r\n for i in range(len(a)):\r\n for j in range(i+1,len(a)):\r\n for k in range(j+1,len(a)):\r\n q=list(set(a[i])|set(a[j])|set(a[k]))\r\n if q not in r and len(q)==3:\r\n r.append(q)\r\n if len(r)==0:\r\n print(-1)\r\n else:\r\n t=[]\r\n for i in r:\r\n s=0\r\n for j in i:\r\n s=s+l[j-1]\r\n t.append(s)\r\n print(min(t))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* boys and *m* girls studying in the class. They should stand in a line so that boys and girls alternated there as much as possible. Let's assume that positions in the line are indexed from left to right by numbers from 1 to *n*<=+<=*m*. Then the number of integers *i* (1<=≤<=*i*<=<<=*n*<=+<=*m*) such that positions with indexes *i* and *i*<=+<=1 contain children of different genders (position *i* has a girl and position *i*<=+<=1 has a boy or vice versa) must be as large as possible. \n\nHelp the children and tell them how to form the line.",
"input": "",
"output": "```python\nnm = input(\"\").split(\" \")\r\nnm = [int(x) for x in nm]\r\nn, m = nm\r\nfinalString = \"\"\r\nif n > m:\r\n for item in range(m):\r\n finalString += \"BG\"\r\n for item in range(n-m):\r\n finalString += \"B\"\r\nelse:\r\n for item in range(n):\r\n finalString += \"GB\"\r\n for item in range(m-n):\r\n finalString += \"G\"\r\nprint(finalString)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Yakko, Wakko and Dot, world-famous animaniacs, decided to rest from acting in cartoons, and take a leave to travel a bit. Yakko dreamt to go to Pennsylvania, his Motherland and the Motherland of his ancestors. Wakko thought about Tasmania, its beaches, sun and sea. Dot chose Transylvania as the most mysterious and unpredictable place.\n\nBut to their great regret, the leave turned to be very short, so it will be enough to visit one of the three above named places. That's why Yakko, as the cleverest, came up with a truly genius idea: let each of the three roll an ordinary six-sided die, and the one with the highest amount of points will be the winner, and will take the other two to the place of his/her dreams.\n\nYakko thrown a die and got Y points, Wakko — W points. It was Dot's turn. But she didn't hurry. Dot wanted to know for sure what were her chances to visit Transylvania.\n\nIt is known that Yakko and Wakko are true gentlemen, that's why if they have the same amount of points with Dot, they will let Dot win.",
"input": "",
"output": "```python\nfrom fractions import Fraction\r\nYakko, Wakko = input().split()\r\nYakko = int(Yakko)\r\nWakko = int(Wakko)\r\nmax_v = max(Yakko, Wakko)\r\n\r\nDie_Roll = 6 - max_v + 1\r\n\r\nfor i in range(6, 0, -1):\r\n if(Yakko == 1 and Wakko == 1):\r\n print(str(Yakko) + \"/\" + str(Wakko))\r\n break\r\n elif(Die_Roll == 5):\r\n print(Fraction(Die_Roll / i).limit_denominator())\r\n break\r\n elif(Die_Roll == 4):\r\n print(Fraction(Die-Roll / i).limit_denominator())\r\n break\r\n elif(i % Die_Roll == 0):\r\n print(Fraction(Die_Roll / i).limit_denominator())\r\n break\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are *n* drinks in his fridge, the volume fraction of orange juice in the *i*-th drink equals *p**i* percent.\n\nOne day Vasya decided to make himself an orange cocktail. He took equal proportions of each of the *n* drinks and mixed them. Then he wondered, how much orange juice the cocktail has.\n\nFind the volume fraction of orange juice in the final drink.",
"input": "",
"output": "```python\nt=int(input())\r\nx=list(map(int,input().split()))\r\nb=sum(x)\r\na=len(x)\r\nc=\"{:.12f}\".format(b/a)\r\nprint(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Noora is a student of one famous high school. It's her final year in school — she is going to study in university next year. However, she has to get an «A» graduation certificate in order to apply to a prestigious one.\n\nIn school, where Noora is studying, teachers are putting down marks to the online class register, which are integers from 1 to *k*. The worst mark is 1, the best is *k*. Mark that is going to the certificate, is calculated as an average of all the marks, rounded to the closest integer. If several answers are possible, rounding up is produced. For example, 7.3 is rounded to 7, but 7.5 and 7.8784 — to 8. \n\nFor instance, if Noora has marks [8,<=9], then the mark to the certificate is 9, because the average is equal to 8.5 and rounded to 9, but if the marks are [8,<=8,<=9], Noora will have graduation certificate with 8.\n\nTo graduate with «A» certificate, Noora has to have mark *k*.\n\nNoora got *n* marks in register this year. However, she is afraid that her marks are not enough to get final mark *k*. Noora decided to ask for help in the internet, where hacker Leha immediately responded to her request. He is ready to hack class register for Noora and to add Noora any number of additional marks from 1 to *k*. At the same time, Leha want his hack be unseen to everyone, so he decided to add as less as possible additional marks. Please help Leha to calculate the minimal number of marks he has to add, so that final Noora's mark will become equal to *k*.",
"input": "",
"output": "```python\nimport math\r\nn, k = map(int, input().split())\r\namt = 0\r\nnums = [int(x) for x in input().split()]\r\namt = sum(nums)\r\nans = 2*n*k - n - 2*amt\r\nprint(math.ceil(ans) if ans >=0 else 0)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The New Year is coming! That's why many people today are busy preparing New Year presents. Vasily the Programmer is no exception.\n\nVasily knows that the best present is (no, it's not a contest) money. He's put *n* empty wallets from left to right in a row and decided how much money to put in what wallet. Vasily decided to put *a**i* coins to the *i*-th wallet from the left.\n\nVasily is a very busy man, so the money are sorted into the bags by his robot. Initially, the robot stands by the leftmost wallet in the row. The robot can follow instructions of three types: go to the wallet that is to the left of the current one (if such wallet exists), go to the wallet that is to the right of the current one (if such wallet exists), put a coin to the current wallet. Due to some technical malfunctions the robot cannot follow two \"put a coin\" instructions in a row.\n\nVasily doesn't want to wait for long, so he wants to write a program for the robot that contains at most 106 operations (not necessarily minimum in length) the robot can use to put coins into the wallets. Help him.",
"input": "",
"output": "```python\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\n\r\nd = ''\r\nfor i in range(n-1):\r\n d += 'PRL'*w[i]\r\n d += 'R'\r\n\r\nd += 'PLR'*w[-1]\r\nprint(d)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sereja and Dima play a game. The rules of the game are very simple. The players have *n* cards in a row. Each card contains a number, all numbers on the cards are distinct. The players take turns, Sereja moves first. During his turn a player can take one card: either the leftmost card in a row, or the rightmost one. The game ends when there is no more cards. The player who has the maximum sum of numbers on his cards by the end of the game, wins.\n\nSereja and Dima are being greedy. Each of them chooses the card with the larger number during his move.\n\nInna is a friend of Sereja and Dima. She knows which strategy the guys are using, so she wants to determine the final score, given the initial state of the game. Help her.",
"input": "",
"output": "```python\nn=int(input())\na=list(map(int,input().split()))\ns=0\nd=0\nfor i in range(n):\n\tb=max(a[0],a[-1])\n\tif i%2==0:\n\t\ts+=b\n\telse:\n\t\td+=b\t\n\ta.remove(b)\nprint(s,d)\n \t\t \t\t \t \t \t\t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Professor Dumbledore is helping Harry destroy the Horcruxes. He went to Gaunt Shack as he suspected a Horcrux to be present there. He saw Marvolo Gaunt's Ring and identified it as a Horcrux. Although he destroyed it, he is still affected by its curse. Professor Snape is helping Dumbledore remove the curse. For this, he wants to give Dumbledore exactly *x* drops of the potion he made. \n\nValue of *x* is calculated as maximum of *p*·*a**i*<=+<=*q*·*a**j*<=+<=*r*·*a**k* for given *p*,<=*q*,<=*r* and array *a*1,<=*a*2,<=... *a**n* such that 1<=≤<=*i*<=≤<=*j*<=≤<=*k*<=≤<=*n*. Help Snape find the value of *x*. Do note that the value of *x* may be negative.",
"input": "",
"output": "```python\nclass MarvoloGauntRing:\r\n def __init__(self, p, q, r, arr):\r\n self.arr = arr\r\n self.p = p\r\n self.q = q\r\n self.r = r\r\n \r\n def give_x_potions(self):\r\n p_max = self.prefix_max()\r\n print(p_max)\r\n \r\n s_max = self.sufix_max()\r\n print(s_max)\r\n \r\n x = float('-inf')\r\n \r\n for i in range(0, len(self.arr)):\r\n x = max(x, p_max[i] + self.q * self.arr[i] + s_max[i])\r\n \r\n return x\r\n \r\n def prefix_max(self):\r\n \r\n p_max = [0]*len(self.arr)\r\n p_max[0] = self.arr[0] * self.p \r\n \r\n for i in range(1, len(self.arr)):\r\n p_max[i] = max(p_max[i-1], self.p * self.arr[i])\r\n \r\n return p_max\r\n \r\n def sufix_max(self):\r\n \r\n s_max = [0]*len(self.arr)\r\n s_max[len(self.arr)-1] = self.arr[len(self.arr)-1] * self.r \r\n \r\n for i in range(len(self.arr)-2, -1, -1):\r\n s_max[i] = max(s_max[i+1], self.r * self.arr[i])\r\n \r\n return s_max\r\n \r\n \r\n \r\nn,p,q,r = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nprint(MarvoloGauntRing(p,q,r, arr).give_x_potions())\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Last week, Hamed learned about a new type of equations in his math class called Modular Equations. Lets define *i* modulo *j* as the remainder of division of *i* by *j* and denote it by . A Modular Equation, as Hamed's teacher described, is an equation of the form in which *a* and *b* are two non-negative integers and *x* is a variable. We call a positive integer *x* for which a solution of our equation.\n\nHamed didn't pay much attention to the class since he was watching a movie. He only managed to understand the definitions of these equations.\n\nNow he wants to write his math exercises but since he has no idea how to do that, he asked you for help. He has told you all he knows about Modular Equations and asked you to write a program which given two numbers *a* and *b* determines how many answers the Modular Equation has.",
"input": "",
"output": "```python\na, b = map(int, input().split(\" \"))\na1 = a - b\nif a == b:\n print(\"infinity\")\nelse:\n cont = 0\n i = 1\n while i ** 2 <= a1:\n if a1 % i == 0 and i > b: cont += 1\n if a1 % i == 0 and b < a1 // i != i: cont += 1\n i += 1\n print(cont)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bash wants to become a Pokemon master one day. Although he liked a lot of Pokemon, he has always been fascinated by Bulbasaur the most. Soon, things started getting serious and his fascination turned into an obsession. Since he is too young to go out and catch Bulbasaur, he came up with his own way of catching a Bulbasaur.\n\nEach day, he takes the front page of the newspaper. He cuts out the letters one at a time, from anywhere on the front page of the newspaper to form the word \"Bulbasaur\" (without quotes) and sticks it on his wall. Bash is very particular about case — the first letter of \"Bulbasaur\" must be upper case and the rest must be lower case. By doing this he thinks he has caught one Bulbasaur. He then repeats this step on the left over part of the newspaper. He keeps doing this until it is not possible to form the word \"Bulbasaur\" from the newspaper.\n\nGiven the text on the front page of the newspaper, can you tell how many Bulbasaurs he will catch today?\n\nNote: uppercase and lowercase letters are considered different.",
"input": "",
"output": "```python\ns = input()\r\nb1 = u = b = l = a = s1 = u = r = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'B':\r\n b1 +=1\r\n if s[i] == 'u':\r\n u +=1\r\n if s[i] == 'l':\r\n l +=1\r\n if s[i] == 'b':\r\n b +=1\r\n if s[i] == 'a':\r\n a +=1\r\n if s[i] == 's':\r\n s1 +=1\r\n if s[i] == 'r':\r\n r +=1\r\na = a//2\r\nu = u//2\r\nprint (min(b1,u,b,l,a,s1,u,r))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "When Valera has got some free time, he goes to the library to read some books. Today he's got *t* free minutes to read. That's why Valera took *n* books in the library and for each book he estimated the time he is going to need to read it. Let's number the books by integers from 1 to *n*. Valera needs *a**i* minutes to read the *i*-th book.\n\nValera decided to choose an arbitrary book with number *i* and read the books one by one, starting from this book. In other words, he will first read book number *i*, then book number *i*<=+<=1, then book number *i*<=+<=2 and so on. He continues the process until he either runs out of the free time or finishes reading the *n*-th book. Valera reads each book up to the end, that is, he doesn't start reading the book if he doesn't have enough free time to finish reading it. \n\nPrint the maximum number of books Valera can read.",
"input": "",
"output": "```python\nn,t=map(int,input().split())\r\nm=list(map(int,input().split()))\r\na=-1\r\nfor i in range(len(m)):\r\n\r\n count=0\r\n sum=0\r\n while(i<=len(m)-1 and (sum+m[i])<=t):\r\n sum=sum+m[i]\r\n count=count+1\r\n i=i+1\r\n if(count>a):\r\n a=count\r\nprint(a)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Do you remember a kind cartoon \"Beauty and the Beast\"? No, no, there was no firing from machine guns or radiation mutants time-travels!\n\nThere was a beauty named Belle. Once she had violated the Beast's order and visited the West Wing. After that she was banished from the castle... \n\nEverybody was upset. The beautiful Belle was upset, so was the Beast, so was Lumiere the candlestick. But the worst thing was that Cogsworth was upset. Cogsworth is not a human, but is the mantel clock, which was often used as an alarm clock.\n\nDue to Cogsworth's frustration all the inhabitants of the castle were in trouble: now they could not determine when it was time to drink morning tea, and when it was time for an evening stroll. \n\nFortunately, deep in the basement are lying digital clock showing the time in the format HH:MM. Now the residents of the castle face a difficult task. They should turn Cogsworth's hour and minute mustache hands in such a way, that Cogsworth began to show the correct time. Moreover they need to find turn angles in degrees for each mustache hands. The initial time showed by Cogsworth is 12:00.\n\nYou can only rotate the hands forward, that is, as is shown in the picture: \n\nAs since there are many ways too select such angles because of full rotations, choose the smallest angles in the right (non-negative) direction.\n\nNote that Cogsworth's hour and minute mustache hands move evenly and continuously. Hands are moving independently, so when turning one hand the other hand remains standing still.",
"input": "",
"output": "```python\ntime = input()\r\nh = int(time[0])*10 + int(time[1])\r\nm = int(time[3])*10 + int(time[4])\r\nh = h % 12\r\nangle1 = h*30 + m//2\r\nif m%2 == 1:\r\n angle1 += 0.5\r\nangle2 = m*6\r\nprint(angle1, angle2)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Let's define the sum of two permutations *p* and *q* of numbers 0,<=1,<=...,<=(*n*<=-<=1) as permutation , where *Perm*(*x*) is the *x*-th lexicographically permutation of numbers 0,<=1,<=...,<=(*n*<=-<=1) (counting from zero), and *Ord*(*p*) is the number of permutation *p* in the lexicographical order.\n\nFor example, *Perm*(0)<==<=(0,<=1,<=...,<=*n*<=-<=2,<=*n*<=-<=1), *Perm*(*n*!<=-<=1)<==<=(*n*<=-<=1,<=*n*<=-<=2,<=...,<=1,<=0)\n\nMisha has two permutations, *p* and *q*. Your task is to find their sum.\n\nPermutation *a*<==<=(*a*0,<=*a*1,<=...,<=*a**n*<=-<=1) is called to be lexicographically smaller than permutation *b*<==<=(*b*0,<=*b*1,<=...,<=*b**n*<=-<=1), if for some *k* following conditions hold: *a*0<==<=*b*0,<=*a*1<==<=*b*1,<=...,<=*a**k*<=-<=1<==<=*b**k*<=-<=1,<=*a**k*<=<<=*b**k*.",
"input": "",
"output": "```python\nnum=1\r\nfor i in range(1, 200001):num*=i\r\nprint(\"Done\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp is mad about coding, that is why he writes Sveta encoded messages. He calls the median letter in a word the letter which is in the middle of the word. If the word's length is even, the median letter is the left of the two middle letters. In the following examples, the median letter is highlighted: contest, info. If the word consists of single letter, then according to above definition this letter is the median letter. \n\nPolycarp encodes each word in the following way: he writes down the median letter of the word, then deletes it and repeats the process until there are no letters left. For example, he encodes the word volga as logva.\n\nYou are given an encoding *s* of some word, your task is to decode it.",
"input": "",
"output": "```python\nl=int(input())\r\nstr=input()\r\nstr1=\"\"\r\nlst=list(str)\r\nwhile len(lst)>=3:\r\n if l%2==0:\r\n str1+=lst[(l//2)-1]\r\n lst.pop((l//2)-1]\r\n else:\r\n str1+=lst[l//2]\r\n lst.pop((l//2))\r\nstr1+=lst[0]+lst[1]\r\nprint(str1)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Do you know a story about the three musketeers? Anyway, you will learn about its origins now.\n\nRichelimakieu is a cardinal in the city of Bearis. He is tired of dealing with crime by himself. He needs three brave warriors to help him to fight against bad guys.\n\nThere are *n* warriors. Richelimakieu wants to choose three of them to become musketeers but it's not that easy. The most important condition is that musketeers must know each other to cooperate efficiently. And they shouldn't be too well known because they could be betrayed by old friends. For each musketeer his recognition is the number of warriors he knows, excluding other two musketeers.\n\nHelp Richelimakieu! Find if it is possible to choose three musketeers knowing each other, and what is minimum possible sum of their recognitions.",
"input": "",
"output": "```python\ndef dfs(knights,k,st,cycle,limit=2):\n if limit == 0:\n if st not in knights[k]:\n return\n total=0\n for k in cycle:\n total+=len(knights[k])-2\n cycles.append(total)\n return\n for i in knights[k]:\n cycle.append(i)\n dfs(knights,i,st,cycle,limit-1)\n cycle.pop(-1)\n\n \n\nn,m=map(int,input().split())\nknights={str(i):[] for i in range(1,n+1)}\nfor _ in range(m):\n key,value=input().split()\n knights[key].append(value)\n knights[value].append(key)\ncycles=[]\nfor k in knights:\n dfs(knights,k,k,[k])\nprint(min(cycles) if cycles else -1)\n\t\t \t \t \t \t\t\t \t\t\t\t\t \t\t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed *w* kilos. They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem.\n\nPete and Billy are great fans of even numbers, that's why they want to divide the watermelon in such a way that each of the two parts weighs even number of kilos, at the same time it is not obligatory that the parts are equal. The boys are extremely tired and want to start their meal as soon as possible, that's why you should help them and find out, if they can divide the watermelon in the way they want. For sure, each of them should get a part of positive weight.",
"input": "",
"output": "```python\nn = int(input())\r\nif n%2==0 and n>=2:print(\"Yes\")\r\nelse:print(\"No\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "While swimming at the beach, Mike has accidentally dropped his cellphone into the water. There was no worry as he bought a cheap replacement phone with an old-fashioned keyboard. The keyboard has only ten digital equal-sized keys, located in the following way:\n\nTogether with his old phone, he lost all his contacts and now he can only remember the way his fingers moved when he put some number in. One can formally consider finger movements as a sequence of vectors connecting centers of keys pressed consecutively to put in a number. For example, the finger movements for number \"586\" are the same as finger movements for number \"253\":\n\nMike has already put in a number by his \"finger memory\" and started calling it, so he is now worrying, can he be sure that he is calling the correct number? In other words, is there any other number, that has the same finger movements?",
"input": "",
"output": "```python\n# LUOGU_RID: 101608072\n_, s = input(), input()\r\nprint(all(set(t) & set(s) for t in '0147 0369 079 123'.split()) and 'YES' or 'NO')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The on-board computer on Polycarp's car measured that the car speed at the beginning of some section of the path equals *v*1 meters per second, and in the end it is *v*2 meters per second. We know that this section of the route took exactly *t* seconds to pass.\n\nAssuming that at each of the seconds the speed is constant, and between seconds the speed can change at most by *d* meters per second in absolute value (i.e., the difference in the speed of any two adjacent seconds does not exceed *d* in absolute value), find the maximum possible length of the path section in meters.",
"input": "",
"output": "```python\nv1,v2 = map(int,input().split())\nt,d = map(int,input().split())\nif v1>v2:\n z = v1\n v1 = v2\n v2 = z\nans = v1\ncur = v1\nfor i in range(2,t+1):\n temp = (t-i)*d\n f = 0\n for j in range(d,-1,-1):\n if abs((cur+j)-v2)<=temp:\n f=1\n cur += j\n ans+=cur\n break\n #print(cur,ans,i)\n if f==0:\n req = cur-v2\n z = i\n if (req%d)!=0:\n cur-=(req%d)\n z = i+1\n ans+=cur\n for j in range(z,t+1):\n cur-=d\n if cur>=v2:\n ans+=cur\n else:\n ans+=v2\n break\n#print(j)\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given an array *a* with *n* elements. Each element of *a* is either 0 or 1.\n\nLet's denote the length of the longest subsegment of consecutive elements in *a*, consisting of only numbers one, as *f*(*a*). You can change no more than *k* zeroes to ones to maximize *f*(*a*).",
"input": "",
"output": "```python\ndef maximize_subsegment_length(n, k, a):\n left = 0\n right = 0\n max_length = 0\n max_zeros = k\n best_left = 0\n best_right = 0\n\n while right < n:\n if a[right] == 0:\n max_zeros -= 1\n\n while max_zeros < 0:\n if a[left] == 0:\n max_zeros += 1\n left += 1\n\n if right - left + 1 > max_length:\n max_length = right - left + 1\n best_left = left\n best_right = right\n\n right += 1\n\n for i in range(best_left, best_right + 1):\n a[i] = 1\n\n print(max_length)\n print(*a)\n\n# Read input\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\n# Call the function\nmaximize_subsegment_length(n, k, a)\n\n\t \t\t \t\t\t \t\t \t\t\t\t\t\t \t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number *a* and Antisimon receives number *b*. They also have a heap of *n* stones. The players take turns to make a move and Simon starts. During a move a player should take from the heap the number of stones equal to the greatest common divisor of the fixed number he has received and the number of stones left in the heap. A player loses when he cannot take the required number of stones (i. e. the heap has strictly less stones left than one needs to take). \n\nYour task is to determine by the given *a*, *b* and *n* who wins the game.",
"input": "",
"output": "```python\nimport math\r\n\r\ntest_case=input().split(' ')\r\n\r\n\r\ndef heap_left(fixed,gcd):return gcd-math.gcd(fixed,gcd)\r\n\r\n\r\ndef assignment(p1,p2,n):\r\n list=[int(n)]\r\n flag=int(n)\r\n count=0\r\n while flag!=0:\r\n if count%2==0:flag=heap_left(int(p1),list[count]);list.append(heap_left(int(p1),list[count]))\r\n else:flag=heap_left(int(p2),list[count]);list.append(heap_left(int(p2),list[count]))\r\n count+=1\r\n\r\n if len(list)%2==0:print(0)\r\n else:print(1)\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n assignment(test_case[0],test_case[1],test_case[2])\r\n #print(test_case[0],test_case[1],)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\ns=input()\r\nlow=0\r\nupp=0\r\nfor i in s:\r\n if i==i.upper():\r\n upp=upp+1\r\n else:\r\n low=low+1\r\nif upp>low:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a very secret base in Potatoland where potato mash is made according to a special recipe. The neighbours from Porridgia decided to seize this recipe and to sell it to Pilauland. For this mission they have been preparing special agent Pearlo for many years. When, finally, Pearlo learned all secrets of espionage, he penetrated into the Potatoland territory and reached the secret base.\n\nNow he is standing at the entrance, but to get inside he need to pass combination lock. Minute ago one of the workers entered the password on the terminal and opened the door. The terminal is a square digital keyboard 3<=×<=3 with digits from 1 to 9.\n\nPearlo knows that the password consists from distinct digits and is probably symmetric with respect to the central button of the terminal. He has heat sensor which allowed him to detect the digits which the worker pressed. Now he wants to check whether the password entered by the worker is symmetric with respect to the central button of the terminal. This fact can Help Pearlo to reduce the number of different possible password combinations.",
"input": "",
"output": "```python\na = input()\nb = input()\nc = input()\n\ns = a+b+c\n\nif s == s[::-1]:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t\t\t\t \t \t\t\t\t \t\t\t\t\t\t\t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Patrick has just finished writing a message to his sweetheart Stacey when he noticed that the message didn't look fancy. Patrick was nervous while writing the message, so some of the letters there were lowercase and some of them were uppercase.\n\nPatrick believes that a message is fancy if any uppercase letter stands to the left of any lowercase one. In other words, this rule describes the strings where first go zero or more uppercase letters, and then — zero or more lowercase letters.\n\nTo make the message fancy, Patrick can erase some letter and add the same letter in the same place in the opposite case (that is, he can replace an uppercase letter with the lowercase one and vice versa). Patrick got interested in the following question: what minimum number of actions do we need to make a message fancy? Changing a letter's case in the message counts as one action. Patrick cannot perform any other actions.",
"input": "",
"output": "```python\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip())\r\ncnt = [0]\r\nfor i in s:\r\n cnt.append(cnt[-1] + i // 97)\r\nn = len(s)\r\nans = n\r\nfor i in range(n + 1):\r\n u, v = cnt[i], n - i - (cnt[n] - cnt[i])\r\n ans = min(ans, u + v)\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two very long integers *a*,<=*b* (leading zeroes are allowed). You should check what number *a* or *b* is greater or determine that they are equal.\n\nThe input size is very large so don't use the reading of symbols one by one. Instead of that use the reading of a whole line or token.\n\nAs input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java. Don't use the function input() in Python2 instead of it use the function raw_input().",
"input": "",
"output": "```python\n# LUOGU_RID: 126991992\na=input().lstrip('0');b=input().lstrip()\nif len(a)>len(b):print('>')\nelif len(a)b:print('>')\nelif a=0:\r\n if arr[i]= 0 and board[i-1][j] == board[i][j]:\r\n return False\r\n if i+1 < len(board) and board[i+1][j] == board[i][j]:\r\n return False\r\n if j-1 >= 0 and board[i][j-1] == board[i][j]:\r\n return False\r\n if j+1 < len(board[i]) and board[i][j+1] == board[i][j]:\r\n return False\r\n \r\n return True\r\n\r\ndef make_a_copy(board):\r\n result = []\r\n for i in board:\r\n r = []\r\n for j in i:\r\n r.append(j)\r\n result.append(r)\r\n return result\r\n\r\ndef print_board(board):\r\n for row in board:\r\n result = ''\r\n for element in row:\r\n result += element\r\n print(result)\r\n\r\ndef all_binary_combinations(k, arr, i, solution_space):\r\n if i == k:\r\n solution_space.append(arr.copy())\r\n else: \r\n arr[i] = False\r\n all_binary_combinations(k, arr, i + 1, solution_space)\r\n arr[i] = True\r\n all_binary_combinations(k, arr, i + 1, solution_space)\r\n\r\ndef main():\r\n size = input().split()\r\n n = int(size[0])\r\n m = int(size[1])\r\n\r\n board = []\r\n white_places = []\r\n\r\n for i in range(n):\r\n board.append(list(input().replace('.', 'B')))\r\n \r\n for i in range(n):\r\n for j in range(m):\r\n if board[i][j] == 'B':\r\n white_places.append((i, j))\r\n \r\n solution_space = []\r\n k = len(white_places)\r\n arr = [None] * k\r\n all_binary_combinations(k, arr, 0, solution_space)\r\n \r\n solutions = []\r\n \r\n for possible_solution in solution_space:\r\n board_copy = board.copy()\r\n for i, val in enumerate(possible_solution):\r\n if val:\r\n board_copy[white_places[i][0]][white_places[i][1]] = 'W'\r\n \r\n if is_valid(board_copy):\r\n print_board(board)\r\n return\r\n \r\n\r\nmain()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.\n\nNow the party is ready to start its journey, but firstly they have to choose kayaks. There are 2·*n* people in the group (including Vadim), and they have exactly *n*<=-<=1 tandem kayaks (each of which, obviously, can carry two people) and 2 single kayaks. *i*-th person's weight is *w**i*, and weight is an important matter in kayaking — if the difference between the weights of two people that sit in the same tandem kayak is too large, then it can crash. And, of course, people want to distribute their seats in kayaks in order to minimize the chances that kayaks will crash.\n\nFormally, the instability of a single kayak is always 0, and the instability of a tandem kayak is the absolute difference between weights of the people that are in this kayak. Instability of the whole journey is the total instability of all kayaks.\n\nHelp the party to determine minimum possible total instability!",
"input": "",
"output": "```python\ndef work():\n diffs = sorted([weight[i]-weight[i-1] for i in range(1, len(weight), 2)])\n sep_diffs = sorted([weight[i]-weight[i-1] for i in range(2, len(weight), 2)])\n diffs.pop()\n print(min(sum(diffs), sum(sep_diffs)))\n\n\nn = int(input())\nweight = sorted([int(i) for i in input().strip().split()])\nwork()\n# for i in range(10)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "As you very well know, this year's funkiest numbers are so called triangular numbers (that is, integers that are representable as , where *k* is some positive integer), and the coolest numbers are those that are representable as a sum of two triangular numbers.\n\nA well-known hipster Andrew adores everything funky and cool but unfortunately, he isn't good at maths. Given number *n*, help him define whether this number can be represented by a sum of two triangular numbers (not necessarily different)!",
"input": "",
"output": "```python\ndef triangular(num):\n # Funcion para ver si es triangular o no el numero\n n = 1\n while num > 0:\n num -= n\n n += 1\n return num == 0\n\ndef suma_triangulres(n):\n for t1 in range(1, n + 1):\n # Funcion para revisar que t1 sea triangular\n if triangular(t1):\n diff = n - t1\n # Funcion para revisar si la diferencia tambien es triangular\n if triangular(diff):\n return \"YES\"\n return \"NO\"\n\nn = int(input())\nresult = suma_triangulres(n)\nprint(result)\n\t \t \t\t \t \t\t\t \t\t \t\t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a given string *S* consisting of *N* symbols. Your task is to find the number of ordered pairs of integers *i* and *j* such that\n\n1. 1<=≤<=*i*,<=*j*<=≤<=*N*\n\n2. *S*[*i*]<==<=*S*[*j*], that is the *i*-th symbol of string *S* is equal to the *j*-th.",
"input": "",
"output": "```python\nS=input()\nd={}\ncnt=0\nfor i in S:\n d[i]=d.get(i,0)+1\nfor i in S:\n cnt+=d.get(i,0)\nprint(cnt)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently Luba bought a very interesting book. She knows that it will take *t* seconds to read the book. Luba wants to finish reading as fast as she can.\n\nBut she has some work to do in each of *n* next days. The number of seconds that Luba has to spend working during *i*-th day is *a**i*. If some free time remains, she can spend it on reading.\n\nHelp Luba to determine the minimum number of day when she finishes reading.\n\nIt is guaranteed that the answer doesn't exceed *n*.\n\nRemember that there are 86400 seconds in a day.",
"input": "",
"output": "```python\nn,t = map(int,input().split())\r\nd = [*((86400-int(x)) for x in input().split())]\r\ncnt = 0\r\ni = 0\r\nwhile cnt < t:\r\n cnt += d[i]\r\n i += 1\r\nprint(i)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sereja has an array *a*, consisting of *n* integers *a*1, *a*2, ..., *a**n*. The boy cannot sit and do nothing, he decided to study an array. Sereja took a piece of paper and wrote out *m* integers *l*1,<=*l*2,<=...,<=*l**m* (1<=≤<=*l**i*<=≤<=*n*). For each number *l**i* he wants to know how many distinct numbers are staying on the positions *l**i*, *l**i*<=+<=1, ..., *n*. Formally, he want to find the number of distinct numbers among *a**l**i*,<=*a**l**i*<=+<=1,<=...,<=*a**n*.?\n\nSereja wrote out the necessary array elements but the array was so large and the boy was so pressed for time. Help him, find the answer for the described question for each *l**i*.",
"input": "",
"output": "```python\n\"\"\"n,m=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nB=list(map(int,input().split()))\r\ni=1\r\ns=0\r\nfor tot_num in B:\r\n tot_num-=s\r\n while i<=n:\r\n if tot_num<=A[i-1]:\r\n j=tot_num\r\n break\r\n else:\r\n tot_num-=A[i-1] \r\n s+=A[i-1]\r\n i+=1\r\n print(i,j)\r\n\r\n\r\n\r\n#from collections import Counter\r\nn,m=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nfor _ in range(m):\r\n #C=[]\r\n #j=0\r\n l=int(input())\r\n #print(len(Counter(A[l-1:])))\r\n #for i in range(l-1,n):\r\n # if A[i] not in C:\r\n # C.append(A[i])\r\n # j+=1\r\n #print(len(set(A[l-1:])))\r\n\r\n\r\nn,m=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nB=[]\r\nfor _ in range(m):\r\n B.append(int(input()))\r\n\r\n#D=sorted(B,reverse=True)\r\nd=[0]*m\r\nC=[]\r\nj=0\r\ni=n-1\r\n#for l in D:\r\nfor king in range(m): #l is B[-king-1]\r\n while i>=B[-king-1]-1:\r\n if A[i] not in C:\r\n C.append(A[i])\r\n j+=1\r\n i-=1\r\n d[-king-1]=j\r\nfor l in d:\r\n print(l)\"\"\"\r\n\r\n\r\n\r\n# Read input values\r\nn, m = map(int, input().split())\r\narray = list(map(int, input().split()))\r\n\r\nqueries = []\r\nfor _ in range(m):\r\n queries.append(int(input()))\r\nans=[]\r\n\r\nd=set()\r\nfor i in range(n):\r\n d.add(array[-i-1])\r\n ans.append(len(d))\r\nfor l in queries:\r\n print(ans[-l])\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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 \"-\".\n\nWe'll say that some date is mentioned in the Prophesy if there is a substring in the Prophesy that is the date's record in the format \"dd-mm-yyyy\". We'll say that the number of the date's occurrences is the number of such substrings in the Prophesy. For example, the Prophesy \"0012-10-2012-10-2012\" mentions date 12-10-2012 twice (first time as \"0012-10-2012-10-2012\", second time as \"0012-10-2012-10-2012\").\n\nThe date of the Apocalypse is such correct date that the number of times it is mentioned in the Prophesy is strictly larger than that of any other correct date.\n\nA date is correct if the year lies in the range from 2013 to 2015, the month is from 1 to 12, and the number of the day is strictly more than a zero and doesn't exceed the number of days in the current month. Note that a date is written in the format \"dd-mm-yyyy\", that means that leading zeroes may be added to the numbers of the months or days if needed. In other words, date \"1-1-2013\" isn't recorded in the format \"dd-mm-yyyy\", and date \"01-01-2013\" is recorded in it.\n\nNotice, that any year between 2013 and 2015 is not a leap year.",
"input": "",
"output": "```python\np=input()\ndata={}\nfor i in range(len(p)-9):\n if p[i+2] == p[i+5] and (p[i+6:i+10]).isdecimal():\n print(p[i:i+10])\n if p[i:i+10] in data:\n data[p[i:i+10]]+=1\n else:\n data[p[i:i+10]]=1\n\n\nmax_item=None\nmaximum=0\n\nfor i in data.keys():\n if data[i] > maximum:\n maximum = data[i]\n max_item=i\n\n\nprint(max_item)\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Susie listens to fairy tales before bed every day. Today's fairy tale was about wood cutters and the little girl immediately started imagining the choppers cutting wood. She imagined the situation that is described below.\n\nThere are *n* trees located along the road at points with coordinates *x*1,<=*x*2,<=...,<=*x**n*. Each tree has its height *h**i*. Woodcutters can cut down a tree and fell it to the left or to the right. After that it occupies one of the segments [*x**i*<=-<=*h**i*,<=*x**i*] or [*x**i*;*x**i*<=+<=*h**i*]. The tree that is not cut down occupies a single point with coordinate *x**i*. Woodcutters can fell a tree if the segment to be occupied by the fallen tree doesn't contain any occupied point. The woodcutters want to process as many trees as possible, so Susie wonders, what is the maximum number of trees to fell.",
"input": "",
"output": "```python\nn=int(input())\r\ns=[[int(x) for x in input().split( )] for i in range(n)]\r\ncount=2\r\n\r\nif n == 1:\r\n print('1')\r\nif n!= 1:\r\n for j in range(1,n-1):\r\n if s[j][0]-s[j-1][0] > s[j][1]:\r\n count+=1\r\n elif s[j+1][0]-s[j][0] > s[j][1]:\r\n count+=1\r\n s[j][0]+=s[j][1]\r\n\r\n print(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\nimport math\nimport sys\nimport collections\n\nn = int(input())\n\ndef solve():\n s = input()\n if len(s) < 10:\n print(s)\n return\n res = ''\n dig = str(len(s) - 2)\n res += s[0] + dig + s[len(s) - 1]\n print(res)\n\nfor _ in range(n):\n solve()\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Jzzhu has picked *n* apples from his big apple tree. All the apples are numbered from 1 to *n*. Now he wants to sell them to an apple store. \n\nJzzhu will pack his apples into groups and then sell them. Each group must contain two apples, and the greatest common divisor of numbers of the apples in each group must be greater than 1. Of course, each apple can be part of at most one group.\n\nJzzhu wonders how to get the maximum possible number of groups. Can you help him?",
"input": "",
"output": "```python\n#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nfrom math import *\r\ndef prm(x):\r\n s = int(sqrt(x+0.5))\r\n for i in range(2, s+1):\r\n if not (x%i): return False\r\n return True\r\ndef ap(a):\r\n while(len(a) >= 2):\r\n print(a[-1], a[-2])\r\n a.pop()\r\n a.pop()\r\nn, cnt, ans, vis, ansl, ansr = int(input()), 0, 0, [False]*100100, [], []\r\nprime = filter(prm, range(3, n//2+1))\r\nfor x in prime:\r\n tcnt, nlst = 0, []\r\n for i in range(1, n//x+1):\r\n if not vis[i*x]:\r\n vis[i*x] = True\r\n nlst.append(i)\r\n tcnt += 1\r\n ans += tcnt >> 1\r\n cnt += tcnt & 1\r\n if tcnt & 1 :\r\n nlst = nlst[0:1] + nlst[2:]\r\n ansr.append(x<<1)\r\n ansl += list(map(lambda k : x*k, nlst))\r\nfor i in range(1, n+1):\r\n if not vis[i] and not (i&1):\r\n ansr.append(i)\r\n cnt += 1\r\nprint(ans+(cnt>>1))\r\nap(ansl)\r\nap(ansr)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "$k$ people want to split $n$ candies between them. Each candy should be given to exactly one of them or be thrown away.\n\nThe people are numbered from $1$ to $k$, and Arkady is the first of them. To split the candies, Arkady will choose an integer $x$ and then give the first $x$ candies to himself, the next $x$ candies to the second person, the next $x$ candies to the third person and so on in a cycle. The leftover (the remainder that is not divisible by $x$) will be thrown away.\n\nArkady can't choose $x$ greater than $M$ as it is considered greedy. Also, he can't choose such a small $x$ that some person will receive candies more than $D$ times, as it is considered a slow splitting.\n\nPlease find what is the maximum number of candies Arkady can receive by choosing some valid $x$.",
"input": "",
"output": "```python\ns = list(map(int, input().split()))\nn=int(s[0])\nk=int(s[1])\nm=int(s[2])\nd=int(s[3])\nans=int(0)\nfor i in range(1,d+1):\n if (n-1)/k < (i-1):\n break\n op=k*(i-1)+1\n ans=max(ans,min(m,n/op)*i)\nprint(int(ans))\n\t \t\t \t\t \t \t \t\t \t \t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp has created his own training plan to prepare for the programming contests. He will train for $n$ days, all days are numbered from $1$ to $n$, beginning from the first.\n\nOn the $i$-th day Polycarp will necessarily solve $a_i$ problems. One evening Polycarp plans to celebrate the equator. He will celebrate it on the first evening of such a day that from the beginning of the training and to this day inclusive he will solve half or more of all the problems.\n\nDetermine the index of day when Polycarp will celebrate the equator.",
"input": "",
"output": "```python\ndays = int(input())\r\nproblems = list(map(int, input().split()))\r\nsumma = sum(problems)\r\nif summa % 2 == 0:\r\n half_sum = summa // 2\r\nelse:\r\n half_sum = summa // 2 + 1\r\nproblems_sum = 0\r\ni = 0\r\nwhile problems_sum < half_sum:\r\n problems_sum += problems[i]\r\n i += 1\r\nprint(i)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.\n\nYou know two languages, and the professor is giving the lecture in the first one. The words in both languages consist of lowercase English characters, each language consists of several words. For each language, all words are distinct, i.e. they are spelled differently. Moreover, the words of these languages have a one-to-one correspondence, that is, for each word in each language, there exists exactly one word in the other language having has the same meaning.\n\nYou can write down every word the professor says in either the first language or the second language. Of course, during the lecture you write down each word in the language in which the word is shorter. In case of equal lengths of the corresponding words you prefer the word of the first language.\n\nYou are given the text of the lecture the professor is going to read. Find out how the lecture will be recorded in your notes.",
"input": "",
"output": "```python\nn,m = [int(x) for x in input().split()]\r\nwords = {}\r\nfor i in range(m):\r\n word = input().split()\r\n words[word[0]] = word[0] if len(word[0]) < len(word[1]) else word[1]\r\n\r\nlecture = input().split()\r\nnote = \"\"\r\nfor word in lecture:\r\n note += words[word] + \" \"\r\nprint(note[:-1])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Codeforces user' handle color depends on his rating — it is red if his rating is greater or equal to 2400; it is orange if his rating is less than 2400 but greater or equal to 2200, etc. Each time participant takes part in a rated contest, his rating is changed depending on his performance.\n\nAnton wants the color of his handle to become red. He considers his performance in the rated contest to be good if he outscored some participant, whose handle was colored red before the contest and his rating has increased after it.\n\nAnton has written a program that analyses contest results and determines whether he performed good or not. Are you able to do the same?",
"input": "",
"output": "```python\n\r\nimport sys,bisect\r\n\r\nfrom sys import stdin,stdout\r\n\r\nfrom bisect import bisect_left,bisect_right,bisect,insort,insort_left,insort_right\r\n\r\nfrom math import gcd,ceil,floor,sqrt\r\n\r\nfrom collections import Counter,defaultdict,deque,OrderedDict\r\n\r\nfrom queue import Queue,PriorityQueue\r\n\r\nfrom string import ascii_lowercase\r\n\r\nfrom heapq import *\r\n\r\nfrom itertools import islice\r\n\r\n\r\nsys.setrecursionlimit(10**6)\r\nINF = float('inf')\r\nMOD = 998244353\r\nmod = 10**9+7\r\n\r\ndef isPrime(n):\r\n if (n <= 1) :return False\r\n if (n <= 3) :return True\r\n if (n%2 == 0 or n%3 == 0):return False\r\n for i in range(5,ceil(sqrt(n))+1,6):\r\n if (n%i==0 or n%(i+2)==0):\r\n return False\r\n return True\r\n\r\ndef st():\r\n return list(stdin.readline().strip())\r\n\r\ndef inp():\r\n return int(stdin.readline())\r\n\r\ndef li():\r\n return list(map(int,stdin.readline().split()))\r\n\r\ndef mp():\r\n return map(int,stdin.readline().split())\r\n\r\ndef pr(n):\r\n stdout.write(str(n)+\"\\n\")\r\n \r\ndef DFS(dictionary,vertex,visited):\r\n visited[vertex]=True\r\n stack=[vertex]\r\n print(vertex)\r\n while stack:\r\n a=stack.pop()\r\n for i in dictionary[a]:\r\n if not visited[i]:\r\n print(i)\r\n visited[i]=True\r\n stack.append(i)\r\n\r\n\r\ndef BFS(dictionary, vertex,visited):\r\n visited[vertex]=True\r\n q=deque()\r\n q.append(vertex)\r\n while q:\r\n a=q.popleft()\r\n for i in dictionary[a]:\r\n if not visited[i]:\r\n visited[i]=True\r\n q.append(i)\r\n print(i)\r\n\r\n \r\n\r\n\r\ndef soe(limit):\r\n l=[1]*(limit+1)\r\n l[0]=0\r\n l[1]=0\r\n prime=[]\r\n for i in range(2,limit+1):\r\n if l[i]:\r\n for j in range(i*i,limit+1,i):\r\n l[j]=0\r\n \r\n for i in range(2,limit+1):\r\n if l[i]:\r\n prime.append(i)\r\n return prime\r\n\r\ndef segsoe(low,high):\r\n limit=int(high**0.5)+1\r\n prime=soe(limit)\r\n n=high-low+1\r\n l=[0]*(n+1)\r\n for i in range(len(prime)):\r\n lowlimit=(low//prime[i])*prime[i]\r\n if lowlimit>1\r\n return r\r\n\r\ndef don(d,ans,vi,i):\r\n vi[i]=True\r\n stack=[i]\r\n while stack:\r\n a=stack.pop()\r\n for x in d[a]:\r\n if not vi[x]:\r\n ans[i]+=1\r\n vi[x]=True\r\n stack.append(x)\r\n \r\n\r\ndef solve():\r\n n=inp()\r\n c=0\r\n for i in range(n):\r\n s=input().split()\r\n a,b=int(s[1]),int(s[2])\r\n if a>=2400 and b>a:\r\n c=1\r\n if c:\r\n pr('YES')\r\n else:\r\n pr('NO')\r\n\r\nfor _ in range(1):\r\n solve()\r\n## print(\"Case #{}:\".format(_+1),c)\r\n## \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all *n* squad soldiers to line up on the parade ground.\n\nBy the military charter the soldiers should stand in the order of non-increasing of their height. But as there's virtually no time to do that, the soldiers lined up in the arbitrary order. However, the general is rather short-sighted and he thinks that the soldiers lined up correctly if the first soldier in the line has the maximum height and the last soldier has the minimum height. Please note that the way other solders are positioned does not matter, including the case when there are several soldiers whose height is maximum or minimum. Only the heights of the first and the last soldier are important.\n\nFor example, the general considers the sequence of heights (4, 3, 4, 2, 1, 1) correct and the sequence (4, 3, 1, 2, 2) wrong.\n\nWithin one second the colonel can swap any two neighboring soldiers. Help him count the minimum time needed to form a line-up which the general will consider correct.",
"input": "",
"output": "```python\nn = int(input())\r\nvls = list(map(int, input().split()))\r\n\r\nx = min(vls)\r\niX = len(vls) - 1 - vls[::-1].index(x)\r\ndel vls[iX]\r\nvls.append(x)\r\n\r\nr = len(vls) - iX - 1\r\nr += vls.index(max(vls))\r\nprint(r)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A + B is often used as an example of the easiest problem possible to show some contest platform. However, some scientists have observed that sometimes this problem is not so easy to get accepted. Want to try?",
"input": "",
"output": "```python\na = input()\r\nb = input()\r\nif int(a) >=0 and int(b)<=1000:\r\n print(int(a)+int(b))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. \"Piece of cake\" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.",
"input": "",
"output": "```python\nimport sys\r\nn = int(input())\r\nx = []\r\ny = []\r\nz = []\r\nfor i in range(0, n):\r\n force = list(map(int, input().split()))\r\n x.append(force[0])\r\n y.append(force[1])\r\n z.append(force[2])\r\nif((sum(x)+sum(y)+sum(z)) == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A bus moves along the coordinate line *Ox* from the point *x*<==<=0 to the point *x*<==<=*a*. After starting from the point *x*<==<=0, it reaches the point *x*<==<=*a*, immediately turns back and then moves to the point *x*<==<=0. After returning to the point *x*<==<=0 it immediately goes back to the point *x*<==<=*a* and so on. Thus, the bus moves from *x*<==<=0 to *x*<==<=*a* and back. Moving from the point *x*<==<=0 to *x*<==<=*a* or from the point *x*<==<=*a* to *x*<==<=0 is called a bus journey. In total, the bus must make *k* journeys.\n\nThe petrol tank of the bus can hold *b* liters of gasoline. To pass a single unit of distance the bus needs to spend exactly one liter of gasoline. The bus starts its first journey with a full petrol tank.\n\nThere is a gas station in point *x*<==<=*f*. This point is between points *x*<==<=0 and *x*<==<=*a*. There are no other gas stations on the bus route. While passing by a gas station in either direction the bus can stop and completely refuel its tank. Thus, after stopping to refuel the tank will contain *b* liters of gasoline.\n\nWhat is the minimum number of times the bus needs to refuel at the point *x*<==<=*f* to make *k* journeys? The first journey starts in the point *x*<==<=0.",
"input": "",
"output": "```python\na, b, f, k=map(int,input().split())\r\nd=b\r\nn=0\r\ns=0\r\nx=a-f\r\nd -= f\r\nif (x*2>b) or (f*2>b):\r\n if k<3:\r\n if k==1:\r\n if a<=b:\r\n print(0)\r\n elif (f<=b) and (x<=b):\r\n print(1)\r\n else:\r\n print(-1)\r\n if k==2:\r\n if a+x<=b:\r\n print(1)\r\n elif (f<=b) and (x*2<=b):\r\n print(2)\r\n else:\r\n print(-1)\r\n else:\r\n print(-1)\r\nelse:\r\n while n=n-1:\n if k==n-1:\n print('0',end='')\n n+=1\n while(True):\n if k==n:\n print('10',end='')\n k-=1\n n-=1\n else:\n print('110',end='')\n k-=2\n n-=1\n if k==0:\n break\n if n==0:\n break\nelse:\n print(-1)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Drazil is playing a math game with Varda.\n\nLet's define for positive integer *x* as a product of factorials of its digits. For example, .\n\nFirst, they choose a decimal number *a* consisting of *n* digits that contains at least one digit larger than 1. This number may possibly start with leading zeroes. Then they should find maximum positive number *x* satisfying following two conditions:\n\n1. *x* doesn't contain neither digit 0 nor digit 1.\n\n2. = .\n\nHelp friends find such number.",
"input": "",
"output": "```python\ndef findNum(a):\r\n numCount = [0]*11\r\n for num in a:\r\n for i in range(2, num+1):\r\n numCount[i] += 1\r\n\r\n # print(numCount)\r\n\r\n for i in range(9, 3, -1):\r\n shifts = max(0, numCount[i]-numCount[i+1])\r\n if i == 4:\r\n numCount[2] += 2*shifts\r\n numCount[i] -= shifts\r\n elif i == 6:\r\n numCount[2] += shifts\r\n numCount[3] += shifts\r\n numCount[i] -= shifts\r\n elif i == 8:\r\n numCount[2] += 3*shifts\r\n numCount[i] -= shifts\r\n elif i == 9:\r\n numCount[3] += 3*shifts\r\n numCount[i] -= shifts\r\n\r\n # print(numCount)\r\n\r\n res = []\r\n for i in range(9, 1, -1):\r\n for j in range(numCount[i]):\r\n res.append(str(i))\r\n for k in range(2, i):\r\n numCount[k] -= 1\r\n return ''.join(res)\r\n\r\nn = int(input())\r\na = list(map(int, input()))\r\nprint(findNum(a))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "At regular competition Vladik and Valera won *a* and *b* candies respectively. Vladik offered 1 his candy to Valera. After that Valera gave Vladik 2 his candies, so that no one thought that he was less generous. Vladik for same reason gave 3 candies to Valera in next turn.\n\nMore formally, the guys take turns giving each other one candy more than they received in the previous turn.\n\nThis continued until the moment when one of them couldn’t give the right amount of candy. Candies, which guys got from each other, they don’t consider as their own. You need to know, who is the first who can’t give the right amount of candy.",
"input": "",
"output": "```python\nX = list(map(int, input().split()))\r\nTurn = True\r\nN = 1\r\nwhile True:\r\n if True:\r\n if X[0] - N < 0:\r\n print(\"Valera\")\r\n exit()\r\n X[1] += X[0] - N\r\n X[0] -= N\r\n N += 1\r\n Turn = False\r\n else:\r\n if X[1] - N < 0:\r\n print(\"Vladik\")\r\n exit()\r\n X[0] += X[1] - N\r\n X[1] -= N\r\n N += 1\r\n Turn = True\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Santa Claus has *n* candies, he dreams to give them as gifts to children.\n\nWhat is the maximal number of children for whose he can give candies if Santa Claus want each kid should get distinct positive integer number of candies. Santa Class wants to give all *n* candies he has.",
"input": "",
"output": "```python\n# http://codeforces.com/problemset/problem/753/A\n\ndef getSweets(sweetCount):\n sweetsList = []\n sumN = 0\n n = 1\n while sumN + n < sweetCount:\n sumN += n\n sweetsList.append(n)\n n += 1\n\n sweetsList[-1] += sweetCount - sumN\n return sweetsList\n\n\nif __name__ == '__main__':\n sweetCount = int(input())\n sweets = getSweets(sweetCount)\n sweets = list(map(str, sweets))\n\n print(len(sweets))\n print(' '.join(sweets))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\ns=input()\r\nl=len(s)\r\nc=0\r\nfor i in range (l):\r\n if i>='a' and i<='z':\r\n c+=1\r\nif c>=l/2:\r\n print(s.lower)\r\nelse:\r\n print(s.upper) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vanya plays a game of balloons on the field of size *n*<=×<=*n*, where each cell contains a balloon with one of the values 0, 1, 2 or 3. The goal is to destroy a cross, such that the product of all values of balloons in the cross is maximum possible. There are two types of crosses: normal and rotated. For example:\n\nor\n\nFormally, the cross is given by three integers *r*, *c* and *d*, such that *d*<=≤<=*r*,<=*c*<=≤<=*n*<=-<=*d*<=+<=1. The normal cross consists of balloons located in cells (*x*,<=*y*) (where *x* stay for the number of the row and *y* for the number of the column), such that |*x*<=-<=*r*|·|*y*<=-<=*c*|<==<=0 and |*x*<=-<=*r*|<=+<=|*y*<=-<=*c*|<=<<=*d*. Rotated cross consists of balloons located in cells (*x*,<=*y*), such that |*x*<=-<=*r*|<==<=|*y*<=-<=*c*| and |*x*<=-<=*r*|<=<<=*d*.\n\nVanya wants to know the maximum possible product of the values of balls forming one cross. As this value can be large, output it modulo 109<=+<=7.",
"input": "",
"output": "```python\nprint(\"_RANDOM_GUESS_1690489311.5176659\")# 1690489311.5176845\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Maxim wants to buy some games at the local game shop. There are $n$ games in the shop, the $i$-th game costs $c_i$.\n\nMaxim has a wallet which can be represented as an array of integers. His wallet contains $m$ bills, the $j$-th bill has value $a_j$.\n\nGames in the shop are ordered from left to right, Maxim tries to buy every game in that order.\n\nWhen Maxim stands at the position $i$ in the shop, he takes the first bill from his wallet (if his wallet is empty then he proceeds to the next position immediately) and tries to buy the $i$-th game using this bill. After Maxim tried to buy the $n$-th game, he leaves the shop.\n\nMaxim buys the $i$-th game if and only if the value of the first bill (which he takes) from his wallet is greater or equal to the cost of the $i$-th game. If he successfully buys the $i$-th game, the first bill from his wallet disappears and the next bill becomes first. Otherwise Maxim leaves the first bill in his wallet (this bill still remains the first one) and proceeds to the next game.\n\nFor example, for array $c = [2, 4, 5, 2, 4]$ and array $a = [5, 3, 4, 6]$ the following process takes place: Maxim buys the first game using the first bill (its value is $5$), the bill disappears, after that the second bill (with value $3$) becomes the first one in Maxim's wallet, then Maxim doesn't buy the second game because $c_2 > a_2$, the same with the third game, then he buys the fourth game using the bill of value $a_2$ (the third bill becomes the first one in Maxim's wallet) and buys the fifth game using the bill of value $a_3$.\n\nYour task is to get the number of games Maxim will buy.",
"input": "",
"output": "```python\nn,m = list(map(int, input().split()))\nc = list(map(int, input().split()))\na = list(map(int, input().split()))\n\ni=0\nj=0\nb=0\nwhile i lis [i+1] - lis[i]):\n print(f'{lis[i+1] - lis[i]}', end = ' ')\n else:\n print(f'{lis[i] - lis[i-1]}', end = ' ')\n if(lis[i] - lis[0] > lis [x-1] - lis[i]):\n print(f'{lis[i] - lis[0]}')\n else:\n print(f'{lis[x-1] - lis[i]}')\n \t \t\t\t \t \t\t\t\t\t\t\t \t \t \t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya decided to have a look at the results of Berland 1910 Football Championship’s finals. Unfortunately he didn't find the overall score of the match; however, he got hold of a profound description of the match's process. On the whole there are *n* lines in that description each of which described one goal. Every goal was marked with the name of the team that had scored it. Help Vasya, learn the name of the team that won the finals. It is guaranteed that the match did not end in a tie.",
"input": "",
"output": "```python\nn=int(input(\"\"))\r\ndict1={}\r\nm=0\r\ns=''\r\nfor i in range(n):\r\n a=input(\"\")\r\n if a not in dict1.keys():\r\n dict1[a]=1\r\n else:\r\n dict1[a]+=1 \r\n\r\nfor j in dict1.keys():\r\n if dict1[j]>m:\r\n m=dict1[j]\r\n s=j\r\n \r\nprint(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Valera is a little boy. Yesterday he got a huge Math hometask at school, so Valera didn't have enough time to properly learn the English alphabet for his English lesson. Unfortunately, the English teacher decided to have a test on alphabet today. At the test Valera got a square piece of squared paper. The length of the side equals *n* squares (*n* is an odd number) and each unit square contains some small letter of the English alphabet.\n\nValera needs to know if the letters written on the square piece of paper form letter \"X\". Valera's teacher thinks that the letters on the piece of paper form an \"X\", if:\n - on both diagonals of the square paper all letters are the same; - all other squares of the paper (they are not on the diagonals) contain the same letter that is different from the letters on the diagonals. \nHelp Valera, write the program that completes the described task for him.",
"input": "",
"output": "```python\nn=int(input())\r\nmat=[]\r\nc=0\r\nfor i in range(n):\r\n s=input()\r\n mat+=[s]\r\nfor i in range(n):\r\n if mat[i][i]==mat[i][n-i-1]:\r\n c+=1\r\nif c==n and len(set(mat))==2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all *n* squad soldiers to line up on the parade ground.\n\nBy the military charter the soldiers should stand in the order of non-increasing of their height. But as there's virtually no time to do that, the soldiers lined up in the arbitrary order. However, the general is rather short-sighted and he thinks that the soldiers lined up correctly if the first soldier in the line has the maximum height and the last soldier has the minimum height. Please note that the way other solders are positioned does not matter, including the case when there are several soldiers whose height is maximum or minimum. Only the heights of the first and the last soldier are important.\n\nFor example, the general considers the sequence of heights (4, 3, 4, 2, 1, 1) correct and the sequence (4, 3, 1, 2, 2) wrong.\n\nWithin one second the colonel can swap any two neighboring soldiers. Help him count the minimum time needed to form a line-up which the general will consider correct.",
"input": "",
"output": "```python\nn = int(input())\na = list(map(int, input().split()))\n\nmin_val = max_val = a[0]\nmin_index = max_index = 0\n\nfor i in range(n):\n if min_val >= a[i]:\n min_val = a[i]\n min_index = i\n if max_val < a[i]:\n max_val = a[i]\n max_index = i\n\nif min_index < max_index:\n min_index = (n - 1) - min_index\n print(min_index + max_index - 1)\nelse:\n min_index = (n - 1) - min_index\n print(min_index + max_index)\n\n \t \t\t\t\t\t \t\t \t \t \t \t \t\t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Natasha is planning an expedition to Mars for $n$ people. One of the important tasks is to provide food for each participant.\n\nThe warehouse has $m$ daily food packages. Each package has some food type $a_i$.\n\nEach participant must eat exactly one food package each day. Due to extreme loads, each participant must eat the same food type throughout the expedition. Different participants may eat different (or the same) types of food.\n\nFormally, for each participant $j$ Natasha should select his food type $b_j$ and each day $j$-th participant will eat one food package of type $b_j$. The values $b_j$ for different participants may be different.\n\nWhat is the maximum possible number of days the expedition can last, following the requirements above?",
"input": "",
"output": "```python\n\r\n# Main\r\ndef main():\r\n n, m = map(int, input().split())\r\n food = list(map(int, input().split()))\r\n\r\n arr = dict()\r\n for i in food:\r\n if i not in arr:\r\n arr[i] = 1\r\n else:\r\n arr[i] += 1\r\n \r\n maxD = 0\r\n for d in range(1, 101, 1):\r\n temp = arr\r\n k = 0\r\n flag = 0\r\n for key, val in temp.items():\r\n while val >= d:\r\n flag += 1\r\n k += 1\r\n val -= d\r\n if k >= n and d > maxD:\r\n maxD = d\r\n if flag == 0:\r\n break\r\n \r\n print(maxD)\r\n\r\n# End main\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Yet another Armageddon is coming! This time the culprit is the Julya tribe calendar. \n\nThe beavers in this tribe knew math very well. Smart Beaver, an archaeologist, got a sacred plate with a magic integer on it. The translation from Old Beaverish is as follows: \n\n\"May the Great Beaver bless you! May your chacres open and may your third eye never turn blind from beholding the Truth! Take the magic number, subtract a digit from it (the digit must occur in the number) and get a new magic number. Repeat this operation until a magic number equals zero. The Earth will stand on Three Beavers for the time, equal to the number of subtractions you perform!\"\n\nDistinct subtraction sequences can obviously get you different number of operations. But the Smart Beaver is ready to face the worst and is asking you to count the minimum number of operations he needs to reduce the magic number to zero.",
"input": "",
"output": "```python\nt=int(input())\r\nrem=t%10\r\nc=1\r\nno=t-rem\r\nc+=(no/10)*2\r\nprint(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has *n* pairs of socks. In the morning of each day Vasya has to put on a pair of socks before he goes to school. When he comes home in the evening, Vasya takes off the used socks and throws them away. Every *m*-th day (at days with numbers *m*,<=2*m*,<=3*m*,<=...) mom buys a pair of socks to Vasya. She does it late in the evening, so that Vasya cannot put on a new pair of socks before the next day. How many consecutive days pass until Vasya runs out of socks?",
"input": "",
"output": "```python\nn,m = list(map(int,input().split()))\r\nn += (n//m)\r\nif n%m == 0:\r\n n += 1\r\nprint(n)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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 number of balloons of each color?\n\nYour task is to write a program that for given values *r*, *g* and *b* will find the maximum number *t* of tables, that can be decorated in the required manner.",
"input": "",
"output": "```python\nl = list(map(int,input().split()))\r\nl.sort()\r\nl[2]-=l[0]\r\nl[1]-=l[0]\r\nans = l[0]\r\n\r\nans += min(l[1],l[2]//2)\r\n\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\ntests = int(input())\r\nfor _ in range (0,tests):\r\n s = input()\r\n if len(s)>10:\r\n print(s[0],len(s)-2,s[-1],sep=\"\")\r\n else:\r\n print(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "SmallR is an archer. SmallR is taking a match of archer with Zanoes. They try to shoot in the target in turns, and SmallR shoots first. The probability of shooting the target each time is for SmallR while for Zanoes. The one who shoots in the target first should be the winner.\n\nOutput the probability that SmallR will win the match.",
"input": "",
"output": "```python\na, b, c, d = (int(s) for s in input().split(\" \"))\n\nMAX = 100\ncoef = sum((((c - d) * (a - b)) / (b * d)) ** i for i in range(MAX + 1))\nptotal = (a/b) * coef\n\nprint(\"{:.15f}\".format(ptotal))\n\n \t\t\t \t\t\t \t\t\t \t \t\t\t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are a lover of bacteria. You want to raise some bacteria in a box. \n\nInitially, the box is empty. Each morning, you can put any number of bacteria into the box. And each night, every bacterium in the box will split into two bacteria. You hope to see exactly *x* bacteria in the box at some moment. \n\nWhat is the minimum number of bacteria you need to put into the box across those days?",
"input": "",
"output": "```python\n'''\nx = 2345234\nprint(bin(x)[2:])\n\ns = '101110011100'\nprint(int(s, 2))\n'''\n\nn = int(input())\n\nk = bin(n)[2:]\n\nprint(k.count('1'))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Beroffice text editor has a wide range of features that help working with text. One of the features is an automatic search for typos and suggestions of how to fix them.\n\nBeroffice works only with small English letters (i.e. with 26 letters from a to z). Beroffice thinks that a word is typed with a typo if there are three or more consonants in a row in the word. The only exception is that if the block of consonants has all letters the same, then this block (even if its length is greater than three) is not considered a typo. Formally, a word is typed with a typo if there is a block of not less that three consonants in a row, and there are at least two different letters in this block.\n\nFor example:\n - the following words have typos: \"hellno\", \"hackcerrs\" and \"backtothefutttture\"; - the following words don't have typos: \"helllllooooo\", \"tobeornottobe\" and \"oooooo\". \nWhen Beroffice editor finds a word with a typo, it inserts as little as possible number of spaces in this word (dividing it into several words) in such a way that each of the resulting words is typed without any typos.\n\nImplement this feature of Beroffice editor. Consider the following letters as the only vowels: 'a', 'e', 'i', 'o' and 'u'. All the other letters are consonants in this problem.",
"input": "",
"output": "```python\ndef insert_spacebar(s,n):\n\ts1=''\n\ts2=''\n\tfor i in range(n+1):\n\t s1+=s[i]\n\tfor i in range(n+1,len(s)):\n\t s2+=s[i]\n\treturn s1+' '+s2\n\n\ns=input()\nglas_arr=['a','i','e','u','o']\n\n\nfor i in range(len(s)-2):\n\tif(s[i]==' ' or s[i] in glas_arr):\n\t\tcontinue\n\telse:\n\t\tif((s[i] not in glas_arr)and (s[i+1] not in glas_arr) and (s[i+2] not in glas_arr)):\n\t\t\tif(s[i]==s[i+1]==s[i+2]):\n\t\t\t\tcontinue\n\t\t\telse:\n\t\t\t\ts=insert_spacebar(s,i+1)\n\nif((s[len(s)-1] not in glas_arr)and (s[len(s)-2] not in glas_arr) and (s[len(s)-3] not in glas_arr)):\n\tif((s[len(s)-1]==s[len(s)-2]==s[len(s)-3])==False):\n\t\ts=insert_spacebar(s,len(s)-2)\n\n\nprint(s)\n\t\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings *a* and *b* of equal length are called equivalent in one of the two cases: \n 1. They are equal. 1. If we split string *a* into two halves of the same size *a*1 and *a*2, and string *b* into two halves of the same size *b*1 and *b*2, then one of the following is correct: *a*1 is equivalent to *b*1, and *a*2 is equivalent to *b*2 1. *a*1 is equivalent to *b*2, and *a*2 is equivalent to *b*1 \nAs a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.\n\nGerald has already completed this home task. Now it's your turn!",
"input": "",
"output": "```python\na = input()\nb = input()\n\ndef equivalente(a,b):\n if(a == b):\n return 1\n elif(len(a) > 1):\n half = int(len(a)/2)\n end = int(len(a))\n\n if(len(a) > 1):\n ax = a[0:half]\n ay = a[half:end]\n bx = b[0:half]\n by = b[half:end]\n else:\n ax, ay, bx, by = a, a, b, b\n\n if(equivalente(ax,bx) * equivalente(ay,by) == 1):\n return 1\n elif(equivalente(ax,by) * equivalente(ay,bx) == 1):\n return 1\n else:\n return 0\n else:\n return 0\n\nx = equivalente(a,b)\nif(x == 1):\n print(\"YES\")\nelse:\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mad scientist Mike entertains himself by arranging rows of dominoes. He doesn't need dominoes, though: he uses rectangular magnets instead. Each magnet has two poles, positive (a \"plus\") and negative (a \"minus\"). If two magnets are put together at a close distance, then the like poles will repel each other and the opposite poles will attract each other.\n\nMike starts by laying one magnet horizontally on the table. During each following step Mike adds one more magnet horizontally to the right end of the row. Depending on how Mike puts the magnet on the table, it is either attracted to the previous one (forming a group of multiple magnets linked together) or repelled by it (then Mike lays this magnet at some distance to the right from the previous one). We assume that a sole magnet not linked to others forms a group of its own.\n\nMike arranged multiple magnets in a row. Determine the number of groups that the magnets formed.",
"input": "",
"output": "```python\nn = int(input())\r\ncontrol = n\r\ncount = 0\r\ntemp = 0\r\n\r\nwhile n > 0:\r\n magnet = input()\r\n if n != control and temp != magnet:\r\n count += 1\r\n temp = magnet\r\n n -= 1\r\n\r\nprint(count + 1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* students in a class working on group projects. The students will divide into groups (some students may be in groups alone), work on their independent pieces, and then discuss the results together. It takes the *i*-th student *a**i* minutes to finish his/her independent piece.\n\nIf students work at different paces, it can be frustrating for the faster students and stressful for the slower ones. In particular, the imbalance of a group is defined as the maximum *a**i* in the group minus the minimum *a**i* in the group. Note that a group containing a single student has an imbalance of 0. How many ways are there for the students to divide into groups so that the total imbalance of all groups is at most *k*?\n\nTwo divisions are considered distinct if there exists a pair of students who work in the same group in one division but different groups in the other.",
"input": "",
"output": "```python\nimport sys, math\r\nfrom functools import lru_cache\r\ninput = sys.stdin.readline\r\n\r\nif __name__ == \"__main__\":\r\n MOD = 10 ** 9 + 7\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n a.sort()\r\n a.append(0)\r\n\r\n @lru_cache(None)\r\n def dfs(i, groups, leftK):\r\n if leftK < 0 or groups > i+1:\r\n return 0\r\n if i < 0:\r\n if groups == 0: return 1\r\n return 0\r\n leftK -= (a[i+1] - a[i]) * groups \r\n res = dfs(i-1, groups+1, leftK)\r\n res += dfs(i-1, groups, leftK) * (groups + 1)\r\n if groups > 0:\r\n res += dfs(i-1, groups-1, leftK) * groups \r\n \r\n res %= MOD\r\n return res\r\n \r\n res = dfs(n-1, 0, k)\r\n print(res)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are *n* planes on Earth, numbered from 1 to *n*, and the plane with number *i* likes the plane with number *f**i*, where 1<=≤<=*f**i*<=≤<=*n* and *f**i*<=≠<=*i*.\n\nWe call a love triangle a situation in which plane *A* likes plane *B*, plane *B* likes plane *C* and plane *C* likes plane *A*. Find out if there is any love triangle on Earth.",
"input": "",
"output": "```python\n# cook your dish here\r\nimport bisect \r\nn=int(input())\r\nA=[0]\r\nfor k in input().split():\r\n A.append(int(k))\r\n# s=input()\r\n\r\nfor k in range(1,n+1):\r\n if A[A[A[k]]]==k:\r\n print(\"YES\")\r\n break \r\nelse:\r\n print(\"NO\")\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "For a positive integer *n* let's define a function *f*:\n\n*f*(*n*)<==<=<=-<=1<=+<=2<=-<=3<=+<=..<=+<=(<=-<=1)*n**n* \n\nYour task is to calculate *f*(*n*) for a given integer *n*.",
"input": "",
"output": "```python\nn = int(input())\r\nf = 0\r\nfor i in range(1,n+1):\r\n f += ((-1)**i)*i \r\nprint(f)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a ternary string (it is a string which consists only of characters '0', '1' and '2').\n\nYou can swap any two adjacent (consecutive) characters '0' and '1' (i.e. replace \"01\" with \"10\" or vice versa) or any two adjacent (consecutive) characters '1' and '2' (i.e. replace \"12\" with \"21\" or vice versa).\n\nFor example, for string \"010210\" we can perform the following moves: \n - \"010210\" $\\rightarrow$ \"100210\"; - \"010210\" $\\rightarrow$ \"001210\"; - \"010210\" $\\rightarrow$ \"010120\"; - \"010210\" $\\rightarrow$ \"010201\". \nNote than you cannot swap \"02\" $\\rightarrow$ \"20\" and vice versa. You cannot perform any other operations with the given string excluding described above.\n\nYou task is to obtain the minimum possible (lexicographically) string by using these swaps arbitrary number of times (possibly, zero).\n\nString $a$ is lexicographically less than string $b$ (if strings $a$ and $b$ have the same length) if there exists some position $i$ ($1 \\le i \\le |a|$, where $|s|$ is the length of the string $s$) such that for every $j < i$ holds $a_j = b_j$, and $a_i < b_i$.",
"input": "",
"output": "```python\ns=list(input())\r\na=[]\r\nt=0\r\nl=0\r\nfor i in range(len(s)):\r\n if s[i]=='2':t=1\r\n if s[i]=='0'and t==1:\r\n t=0\r\n a+=sorted(s[l:i])\r\n l=i\r\n if i==len(s)-1:a+=sorted(s[l:])\r\nprint(''.join(a))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Gerald has *n* younger brothers and their number happens to be even. One day he bought *n*2 candy bags. One bag has one candy, one bag has two candies, one bag has three candies and so on. In fact, for each integer *k* from 1 to *n*2 he has exactly one bag with *k* candies. \n\nHelp him give *n* bags of candies to each brother so that all brothers got the same number of candies.",
"input": "",
"output": "```python\nn=int(input())\r\nx=n*(n**2+1)//2\r\nfor i in range(1,n+1):\r\n print(i,x-i)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Natasha is going to fly to Mars. She needs to build a rocket, which consists of several stages in some order. Each of the stages is defined by a lowercase Latin letter. This way, the rocket can be described by the string — concatenation of letters, which correspond to the stages.\n\nThere are $n$ stages available. The rocket must contain exactly $k$ of them. Stages in the rocket should be ordered by their weight. So, after the stage with some letter can go only stage with a letter, which is at least two positions after in the alphabet (skipping one letter in between, or even more). For example, after letter 'c' can't go letters 'a', 'b', 'c' and 'd', but can go letters 'e', 'f', ..., 'z'.\n\nFor the rocket to fly as far as possible, its weight should be minimal. The weight of the rocket is equal to the sum of the weights of its stages. The weight of the stage is the number of its letter in the alphabet. For example, the stage 'a 'weighs one ton,' b 'weighs two tons, and' z' — $26$ tons.\n\nBuild the rocket with the minimal weight or determine, that it is impossible to build a rocket at all. Each stage can be used at most once.",
"input": "",
"output": "```python\nfrom math import *\r\nfrom collections import *\r\nfrom operator import itemgetter\r\nimport bisect\r\nii = lambda: int(input())\r\niia = lambda: list(map(int,input().split()))\r\nisa = lambda: list(input().split())\r\nI = lambda:list(map(int,input().split()))\r\nchrIdx = lambda x: ord(x)-96\r\nidxChr = lambda x: chr(96+x)\r\n\r\nn, k = iia()\r\ns = input()\r\ns = sorted(s)\r\n#print(s)\r\nx = 1\r\nflag = -1\r\nprev = s[0]\r\nval = chrIdx(s[0])\r\nif(k==1):\r\n flag = val\r\n#print(val)\r\nfor i in range(1,n):\r\n if(chrIdx(s[i])-chrIdx(prev)>2):\r\n x+=1\r\n prev = s[i]\r\n val += chrIdx(s[i])\r\n #print(s[i], x , val)\r\n if(x>=k):\r\n flag = val\r\n break\r\nprint(flag)\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Luba has a ticket consisting of 6 digits. In one move she can choose digit in any position and replace it with arbitrary digit. She wants to know the minimum number of digits she needs to replace in order to make the ticket lucky.\n\nThe ticket is considered lucky if the sum of first three digits equals to the sum of last three digits.",
"input": "",
"output": "```python\nl=[int(i) for i in input()]\r\na=sum(l[:3]);b=sum(l[3:])\r\nif a==b:\r\n print(0)\r\nelse:\r\n print(abs(a-b)//9+1)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a sequence *a* consisting of *n* integers. You may partition this sequence into two sequences *b* and *c* in such a way that every element belongs exactly to one of these sequences. \n\nLet *B* be the sum of elements belonging to *b*, and *C* be the sum of elements belonging to *c* (if some of these sequences is empty, then its sum is 0). What is the maximum possible value of *B*<=-<=*C*?",
"input": "",
"output": "```python\nraw_input()\r\nprint(eval(input().replace(\"-\",\"\").replace(\" \",\"+\")))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A monster is chasing after Rick and Morty on another planet. They're so frightened that sometimes they scream. More accurately, Rick screams at times *b*,<=*b*<=+<=*a*,<=*b*<=+<=2*a*,<=*b*<=+<=3*a*,<=... and Morty screams at times *d*,<=*d*<=+<=*c*,<=*d*<=+<=2*c*,<=*d*<=+<=3*c*,<=.... \n\nThe Monster will catch them if at any point they scream at the same time, so it wants to know when it will catch them (the first time they scream at the same time) or that they will never scream at the same time.",
"input": "",
"output": "```python\nimport math\r\nimport cmath\r\nimport string\r\n# how to find minimum prime factor in log(n)\r\ndef sieve(n):\r\n l = [0]*(n+1)\r\n l[0] = l[1] = 1 \r\n for i in range(2,int(n**.5)+1):\r\n if not l[i]:\r\n for j in range(i*i,n+1,i):\r\n l[j] = 1 \r\n return [i for i in range(n+1) if l[i] == 0]\r\n#pass n+1 \r\ndef sieveOptemised(n,prime):\r\n l = [0]*(n+1)\r\n l[0] = l[1] = 1 \r\n for i in range(2,n):\r\n if not l[i] : prime.append(i) \r\n for j in range(len(prime)):\r\n if i*prime[j] >= n :\r\n break\r\n l[i*prime[j]] = 1 \r\n if i % prime[j] == 0 : break \r\ndef XOR(n):\r\n return [n, 1, n + 1, 0][n % 4]\r\ndef isprime(n):\r\n return all([False for i in range(2, n) if n % i == 0]) and not n < 2\r\ndef searchBinary(lis, l, r, e):\r\n ans = 0\r\n while l <= r:\r\n m = (l + r) // 2\r\n if lis[m][0] > e:\r\n r = m - 1\r\n else:\r\n l = m + 1\r\n ans = l\r\n return ans\r\ndef f(l, i, j, n, m):\r\n c = l[i][j]\r\n i1 = i\r\n j1 = j\r\n i2 = i\r\n j2 = j\r\n i3 = i\r\n j3 = j\r\n i4 = i\r\n j4 = j\r\n while i1 > 0 and j1 > 0:\r\n i1 -= 1\r\n j1 -= 1\r\n c += l[i1][j1]\r\n while i2 < n - 1 and j2 < m - 1:\r\n i2 += 1\r\n j2 += 1\r\n c += l[i2][j2]\r\n while i3 > 0 and j3 < m - 1:\r\n i3 -= 1\r\n j3 += 1\r\n c += l[i3][j3]\r\n while i4 < n - 1 and j4 > 0:\r\n i4 += 1\r\n j4 -= 1\r\n c += l[i4][j4]\r\n\r\n return c\r\ndef gcd(a,b):\r\n if b == 0 :\r\n return a \r\n else :\r\n return gcd(b,a%b) \r\ndef binarySearch(lis, l, r, e):\r\n while l <= r:\r\n m = (l + r) // 2\r\n if lis[m] == e:\r\n return 1\r\n elif lis[m] > e:\r\n r = m - 1\r\n else:\r\n l = m + 1\r\n return 0\r\ndef isSqrt(n):\r\n for i in range(1,int(n**.5)+2):\r\n if i*i == n :\r\n return True \r\n return False\r\n# math.ceil(n/i) = (n-1)//i+1\r\nresult = list(string.ascii_lowercase)\r\nalpha = {}\r\nfor i in range(26):\r\n alpha[result[i]] = i + 1\r\naa = []\r\n\r\na,b = map(int,input().split())\r\nc,d = map(int,input().split())\r\nl1 = []\r\nl2 = []\r\nfor i in range(100000):\r\n l1.append(b+i*a)\r\n l2.append(d+i*c)\r\n\r\ns = list(set(set(l1).intersection(set(l2))))\r\ns.sort()\r\nif s :\r\n aa.append(s[0])\r\nelse :\r\n aa.append(-1) \r\nfor i in aa :\r\n print(i)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.\n\nYou know two languages, and the professor is giving the lecture in the first one. The words in both languages consist of lowercase English characters, each language consists of several words. For each language, all words are distinct, i.e. they are spelled differently. Moreover, the words of these languages have a one-to-one correspondence, that is, for each word in each language, there exists exactly one word in the other language having has the same meaning.\n\nYou can write down every word the professor says in either the first language or the second language. Of course, during the lecture you write down each word in the language in which the word is shorter. In case of equal lengths of the corresponding words you prefer the word of the first language.\n\nYou are given the text of the lecture the professor is going to read. Find out how the lecture will be recorded in your notes.",
"input": "",
"output": "```python\nn,m=map(int,input().split())\r\nmp={}\r\nfor i in range(m):\r\n s1,s2=input().split()\r\n mp[s1]=s2\r\n\r\nl=input().split()\r\nfor i in range(n) :\r\n if len(mp[l[i]])d:\r\n print(-1)\r\nelse:\r\n print((len(l)-1)*2+(d-temp)//5)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Devu is a renowned classical singer. He is invited to many big functions/festivals. Recently he was invited to \"All World Classical Singing Festival\". Other than Devu, comedian Churu was also invited.\n\nDevu has provided organizers a list of the songs and required time for singing them. He will sing *n* songs, *i**th* song will take *t**i* minutes exactly. \n\nThe Comedian, Churu will crack jokes. All his jokes are of 5 minutes exactly.\n\nPeople have mainly come to listen Devu. But you know that he needs rest of 10 minutes after each song. On the other hand, Churu being a very active person, doesn't need any rest.\n\nYou as one of the organizers should make an optimal sсhedule for the event. For some reasons you must follow the conditions:\n - The duration of the event must be no more than *d* minutes; - Devu must complete all his songs; - With satisfying the two previous conditions the number of jokes cracked by Churu should be as many as possible. \nIf it is not possible to find a way to conduct all the songs of the Devu, output -1. Otherwise find out maximum number of jokes that Churu can crack in the grand event.",
"input": "",
"output": "```python\nt = input()\r\ntemp = t.split()\r\nn = int(temp[0])\r\nd = int(temp[1])\r\nsongLenthList = []\r\nsongLength = input()\r\nList = songLength.split()\r\nsongLenthList = [int(i) for i in List]\r\ndevuBreaktime = (n-1)*10\r\ndevuTotalTime = devuBreaktime + sum(songLenthList)\r\nchuruTime = d - devuTotalTime + devuBreaktime\r\nif (devuTotalTime > d):\r\n print(-1)\r\nelse:\r\n print(int(churuTime/5))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Top-model Izabella participates in the competition. She wants to impress judges and show her mathematical skills.\n\nHer problem is following: for given string, consisting of only 0 and 1, tell if it's possible to remove some digits in such a way, that remaining number is a representation of some positive integer, divisible by 64, in the binary numerical system.",
"input": "",
"output": "```python\nstr=input()\r\nif len(str)>6:\r\n print('yes')\r\nelse:\r\n print('no')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Om Nom really likes candies and doesn't like spiders as they frequently steal candies. One day Om Nom fancied a walk in a park. Unfortunately, the park has some spiders and Om Nom doesn't want to see them at all.\n\nThe park can be represented as a rectangular *n*<=×<=*m* field. The park has *k* spiders, each spider at time 0 is at some cell of the field. The spiders move all the time, and each spider always moves in one of the four directions (left, right, down, up). In a unit of time, a spider crawls from his cell to the side-adjacent cell in the corresponding direction. If there is no cell in the given direction, then the spider leaves the park. The spiders do not interfere with each other as they move. Specifically, one cell can have multiple spiders at the same time.\n\nOm Nom isn't yet sure where to start his walk from but he definitely wants:\n - to start walking at time 0 at an upper row cell of the field (it is guaranteed that the cells in this row do not contain any spiders); - to walk by moving down the field towards the lowest row (the walk ends when Om Nom leaves the boundaries of the park). \nWe know that Om Nom moves by jumping. One jump takes one time unit and transports the little monster from his cell to either a side-adjacent cell on the lower row or outside the park boundaries.\n\nEach time Om Nom lands in a cell he sees all the spiders that have come to that cell at this moment of time. Om Nom wants to choose the optimal cell to start the walk from. That's why he wonders: for each possible starting cell, how many spiders will he see during the walk if he starts from this cell? Help him and calculate the required value for each possible starting cell.",
"input": "",
"output": "```python\nn,m,k = map(int,input().split())\r\ngrid = [list(input()) for _ in range(n)]\r\nsol = []\r\nfor col in range(m):\r\n ans = 0\r\n for t in range(1,n):\r\n x,y = t,col\r\n try:\r\n if grid[x][y+t] == 'L':\r\n ans += 1\r\n except: pass\r\n try:\r\n if grid[x][y-t] == 'R':\r\n ans += 1\r\n except: pass\r\n try:\r\n if grid[x+t][y] == 'U':\r\n ans += 1\r\n except: pass\r\n try:\r\n if grid[x-t][y] == 'D':\r\n ans += 1\r\n except: pass\r\n sol.append(ans)\r\nprint(\" \".join(map(str,sol)))\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Imagine that there is a group of three friends: A, B and С. A owes B 20 rubles and B owes C 20 rubles. The total sum of the debts is 40 rubles. You can see that the debts are not organized in a very optimal manner. Let's rearrange them like that: assume that A owes C 20 rubles and B doesn't owe anything to anybody. The debts still mean the same but the total sum of the debts now equals 20 rubles.\n\nThis task is a generalisation of a described example. Imagine that your group of friends has *n* people and you know the debts between the people. Optimize the given debts without changing their meaning. In other words, finally for each friend the difference between the total money he should give and the total money he should take must be the same. Print the minimum sum of all debts in the optimal rearrangement of the debts. See the notes to the test samples to better understand the problem.",
"input": "",
"output": "```python\nn, m = map(int, input().split())\r\n\r\nown = dict()\r\n\r\nfor _ in range(m):\r\n a, b, c = map(int, input().split())\r\n if a in own:\r\n own[a] += c\r\n else:\r\n own[a] = c\r\n\r\n if b in own:\r\n own[b] -= c\r\n else:\r\n own[b] = -c\r\n\r\nans = 0\r\n\r\nfor i in own.values():\r\n ans += i if i > 0 else 0\r\n\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There will be a launch of a new, powerful and unusual collider very soon, which located along a straight line. *n* particles will be launched inside it. All of them are located in a straight line and there can not be two or more particles located in the same point. The coordinates of the particles coincide with the distance in meters from the center of the collider, *x**i* is the coordinate of the *i*-th particle and its position in the collider at the same time. All coordinates of particle positions are even integers.\n\nYou know the direction of each particle movement — it will move to the right or to the left after the collider's launch start. All particles begin to move simultaneously at the time of the collider's launch start. Each particle will move straight to the left or straight to the right with the constant speed of 1 meter per microsecond. The collider is big enough so particles can not leave it in the foreseeable time.\n\nWrite the program which finds the moment of the first collision of any two particles of the collider. In other words, find the number of microseconds before the first moment when any two particles are at the same point.",
"input": "",
"output": "```python\n\"\"\"\r\n4\r\nRLRL\r\n2 4 6 10\r\n\r\n\r\n3\r\nLLR\r\n40 50 60\r\n\r\n\r\n4\r\nLRLR\r\n2 4 8 10\r\n\r\n\r\n5\r\nLRLRL\r\n2 4 16 20 22\r\n\r\n\r\n5\r\nLRRRL\r\n2 4 16 20 22\r\n\r\n\r\n\"\"\"\r\nn = int(input())\r\ndirs = input()\r\nfirst_right = dirs.index(\"R\")\r\nlast_left = dirs.rfind(\"L\")\r\nbens = [int(i) for i in input().split()]\r\ndirs = dirs[first_right:last_left + 1]\r\nbens = bens[first_right:last_left+1]\r\n\r\nleft = []\r\nright = []\r\nfor i in range(len(dirs)):\r\n if dirs[i] == 'R':\r\n right.append(bens[i])\r\n else:\r\n left.append(bens[i])\r\n\r\nif len(right) == 0 or len(left) == 0:\r\n print(-1)\r\n\r\nelse:\r\n res = float('inf')\r\n for i in left:\r\n for j in right:\r\n dis = abs(i - j) // 2\r\n if dis < res:\r\n res = dis\r\n print(res)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Squirrel Liss loves nuts. There are *n* trees (numbered 1 to *n* from west to east) along a street and there is a delicious nut on the top of each tree. The height of the tree *i* is *h**i*. Liss wants to eat all nuts.\n\nNow Liss is on the root of the tree with the number 1. In one second Liss can perform one of the following actions:\n - Walk up or down one unit on a tree. - Eat a nut on the top of the current tree. - Jump to the next tree. In this action the height of Liss doesn't change. More formally, when Liss is at height *h* of the tree *i* (1<=≤<=*i*<=≤<=*n*<=-<=1), she jumps to height *h* of the tree *i*<=+<=1. This action can't be performed if *h*<=><=*h**i*<=+<=1. \nCompute the minimal time (in seconds) required to eat all nuts.",
"input": "",
"output": "```python\nn = int(input())\n\n# Assume squirrel has had nut on the prev tree and is at it's top. \n# In this, compute time to jump to next tree, go to top and have nut\n\nh_prev = int(input())\ntime = h_prev + 1\n\nfor i in range(n-1):\n\th_cur = int(input())\n\ttime += abs((h_prev-h_cur)) + 2\n\th_prev = h_cur\n\nprint(time)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Arya has *n* opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have some fighting plan that guarantees they will win, but implementing this plan requires presence of them all. That means if one day at least one of Arya's opponents is absent at the school, then Arya will beat all present opponents. Otherwise, if all opponents are present, then they will beat Arya.\n\nFor each opponent Arya knows his schedule — whether or not he is going to present on each particular day. Tell him the maximum number of consecutive days that he will beat all present opponents.\n\nNote, that if some day there are no opponents present, Arya still considers he beats all the present opponents.",
"input": "",
"output": "```python\nio = input().split()\r\n\r\nn = int(io[0])\r\nd = int(io[1])\r\n\r\nl = []\r\n\r\nstreak = 0\r\nnew_streak = 0\r\n\r\nfor _ in range(d):\r\n l.append(list(map(int, input())))\r\n\r\nfor i in l:\r\n if 0 in i:\r\n streak += 1\r\n else:\r\n new_streak = streak\r\n streak = 0\r\nif streak > new_streak:\r\n print(streak)\r\nelse:\r\n print(new_streak)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya likes everything infinite. Now he is studying the properties of a sequence *s*, such that its first element is equal to *a* (*s*1<==<=*a*), and the difference between any two neighbouring elements is equal to *c* (*s**i*<=-<=*s**i*<=-<=1<==<=*c*). In particular, Vasya wonders if his favourite integer *b* appears in this sequence, that is, there exists a positive integer *i*, such that *s**i*<==<=*b*. Of course, you are the person he asks for a help.",
"input": "",
"output": "```python\na,b,c=map(int,input().split(\" \"))\r\ni=0\r\nX=[a]\r\nif(a==b):\r\n print(\"YES\")\r\nelif((a>b and c<=0) or (a=0)):\r\n\r\n if(c!=0):\r\n if(max(abs(b),abs(c))%min(abs(b),abs(c))==a):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\n\r\n if(c==0):\r\n if(a==b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\n\r\n\r\nelse:\r\n print(\"NO\") \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera has got four horseshoes left from the last year, but maybe some of them have the same color. In this case he needs to go to the store and buy some few more horseshoes, not to lose face in front of his stylish comrades.\n\nFortunately, the store sells horseshoes of all colors under the sun and Valera has enough money to buy any four of them. However, in order to save the money, he would like to spend as little money as possible, so you need to help Valera and determine what is the minimum number of horseshoes he needs to buy to wear four horseshoes of different colors to a party.",
"input": "",
"output": "```python\narr = list(map(int,input().split()))\r\narrS = set(arr)\r\nprint(len(arr)-len(arrS))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One way to create a task is to learn from math. You can generate some random math statement or modify some theorems to get something new and build a new task from that.\n\nFor example, there is a statement called the \"Goldbach's conjecture\". It says: \"each even number no less than four can be expressed as the sum of two primes\". Let's modify it. How about a statement like that: \"each integer no less than 12 can be expressed as the sum of two composite numbers.\" Not like the Goldbach's conjecture, I can prove this theorem.\n\nYou are given an integer *n* no less than 12, express it as a sum of two composite numbers.",
"input": "",
"output": "```python\n\r\n\r\ndef iscomposite(n):\r\n for i in range(2,int(n/2 +1)):\r\n if n % i == 0 :\r\n return False\r\n else:\r\n continue\r\n return True\r\n\r\nm= int(input())\r\nfor i in range(4,m):\r\n if iscomposite(i):\r\n #print(\"{} is composite\".format(i))\r\n continue\r\n else:\r\n if iscomposite(m -i):\r\n #print(\"{} is composite\".format(m-i))\r\n continue\r\n else:\r\n print(m-i,i)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day a well-known sponsor of a well-known contest decided to give every participant of the contest a T-shirt as a present. A natural problem occurred: on the one hand, it is not clear how many T-shirts of what sizes should be ordered, and on the other hand, one doesn't want to order too many T-shirts (and we do not exactly paper the walls with the oversupply). After considerable brain racking and some pre-estimating, the sponsor representatives ordered a certain number of T-shirts of sizes S, M, L, XL and XXL. The T-shirts turned out to bring good luck, that's why on the contest day there built up a line of *K* participants willing to get one. Every contestant is characterized by his/her desired T-shirt size (so it happens that for all the participants it is also one of the sizes S, M, L, XL and XXL). The participants come up to get a T-shirt one by one and try to choose the most suitable one, choosing it like this. If there is still a T-shirt of the optimal size left, that he/she takes it without further ado. Otherwise the contestant would prefer to choose a T-shirt with the size as close to the optimal one as possible (the distance between neighboring sizes is considered equal to one). If the variant of choice is not unique, the contestant will take a T-shirt of a bigger size (in case he/she grows more). For example, for a person whose optimal size is L the preference list looks like this: L, XL, M, XXL, S. Using the data on how many T-shirts of every size had been ordered by the organizers, on the size of contestants in the line determine who got a T-shirt of what size.",
"input": "",
"output": "```python\nsizes = list(map(int, input().split()))\r\nf = {\"S\":0, \"M\":1, \"L\":2, \"XL\":3, \"XXL\":4}\r\ng = [\"S\", \"M\", \"L\", \"XL\", \"XXL\"]\r\nfor i in range(int(input())):\r\n size = input()\r\n idx = f[size]\r\n for j in range(5):\r\n try:\r\n #print(\"...\")\r\n if sizes[idx+j]>0:\r\n print(g[idx+j])\r\n sizes[idx+j] -= 1\r\n break\r\n if sizes[max(0, idx-j)]>0:\r\n print(g[max(0, idx-j)])\r\n sizes[max(0, idx-j)] -= 1\r\n break\r\n except:\r\n if sizes[max(0, idx-j)]>0:\r\n print(g[max(0, idx-j)])\r\n sizes[max(0, idx-j)] -= 1\r\n break\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You've got a rectangular table with length *a* and width *b* and the infinite number of plates of radius *r*. Two players play the following game: they take turns to put the plates on the table so that the plates don't lie on each other (but they can touch each other), and so that any point on any plate is located within the table's border. During the game one cannot move the plates that already lie on the table. The player who cannot make another move loses. Determine which player wins, the one who moves first or the one who moves second, provided that both players play optimally well.",
"input": "",
"output": "```python\na, b, r = map(int, input().split())\r\nr *= 2\r\nprint('Second' if r > a or b < r else 'First')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Your security guard friend recently got a new job at a new security company. The company requires him to patrol an area of the city encompassing exactly *N* city blocks, but they let him choose which blocks. That is, your friend must walk the perimeter of a region whose area is exactly *N* blocks. Your friend is quite lazy and would like your help to find the shortest possible route that meets the requirements. The city is laid out in a square grid pattern, and is large enough that for the sake of the problem it can be considered infinite.",
"input": "",
"output": "```python\nimport math\ndef Solution(N):\n N = math.sqrt(N)\n perimeter = 4 * N\n return perimeter\nN = int(input())\nSolution(N)\n\t\t \t\t \t\t \t\t \t\t\t \t\t\t \t\t \t\t\t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he organized a New Year party at his place and invited *n* his friends there.\n\nIf there's one thing Petya likes more that receiving gifts, that's watching others giving gifts to somebody else. Thus, he safely hid the laptop until the next New Year and made up his mind to watch his friends exchanging gifts while he does not participate in the process. He numbered all his friends with integers from 1 to *n*. Petya remembered that a friend number *i* gave a gift to a friend number *p**i*. He also remembered that each of his friends received exactly one gift.\n\nNow Petya wants to know for each friend *i* the number of a friend who has given him a gift.",
"input": "",
"output": "```python\nn = input()\r\na = list(map(int, input().split()))\r\ndic = {i: g for i, g in enumerate(a, start=1)}\r\nnew_dict = {v: k for k, v in dic.items()}\r\nsorted_dict = sorted(new_dict.items())\r\nfor key, value in sorted_dict:\r\n print(value, end=\" \")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is now assumed to be an integer.\n\nReliable sources have informed the financier Anton of some information about the exchange rate of currency you all know against the burle for tomorrow. Now Anton knows that tomorrow the exchange rate will be an even number, which can be obtained from the present rate by swapping exactly two distinct digits in it. Of all the possible values that meet these conditions, the exchange rate for tomorrow will be the maximum possible. It is guaranteed that today the exchange rate is an odd positive integer *n*. Help Anton to determine the exchange rate of currency you all know for tomorrow!",
"input": "",
"output": "```python\n\n\nif __name__ == '__main__':\n s = list(input())\n smallest_even = -1\n has_even = False\n for i in range(len(s)):\n if int(s[i]) % 2 == 0:\n has_even = True\n if int(s[i]) < int(s[-1]):\n s[i], s[-1] = s[-1], s[i]\n print(''.join(s))\n break\n smallest_even = i\n\n if smallest_even == -1:\n print(\"-1\")\n else:\n s[smallest_even], s[-1] = s[-1], s[smallest_even]\n print(''.join(s))\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. \"Piece of cake\" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.",
"input": "",
"output": "```python\nsum = [0, 0, 0]\r\n\r\nfor _ in range(int(input())):\r\n a, b, c = map(int, input().split())\r\n sum[0] += a\r\n sum[1] += b\r\n sum[2] += c\r\n\r\nprint(\"YES\" if sum == [0, 0, 0] else \"NO\")\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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 newspaper contains string *t*, consisting of uppercase and lowercase English letters. We know that the length of string *t* greater or equal to the length of the string *s*.\n\nThe newspaper may possibly have too few of some letters needed to make the text and too many of some other letters. That's why Tanya wants to cut some *n* letters out of the newspaper and make a message of length exactly *n*, so that it looked as much as possible like *s*. If the letter in some position has correct value and correct letter case (in the string *s* and in the string that Tanya will make), then she shouts joyfully \"YAY!\", and if the letter in the given position has only the correct value but it is in the wrong case, then the girl says \"WHOOPS\".\n\nTanya wants to make such message that lets her shout \"YAY!\" as much as possible. If there are multiple ways to do this, then her second priority is to maximize the number of times she says \"WHOOPS\". Your task is to help Tanya make the message.",
"input": "",
"output": "```python\nfrom collections import *\r\n\r\ns, t = deque(input()), input()\r\nmem, a1, a2 = Counter(t), 0, 0\r\n\r\nfor i in range(len(s)):\r\n if mem[s[0]]:\r\n a1 += 1\r\n mem[s[0]] -= 1\r\n s.popleft()\r\n else:\r\n s.rotate(-1)\r\n# print(s)\r\nfor i in s:\r\n if i.isupper() and mem[i.lower()]:\r\n a2 += 1\r\n mem[i.lower()] = 0\r\n elif i.islower() and mem[i.upper()]:\r\n a2 += 1\r\n mem[i.upper()] = 0\r\n\r\nprint(a1, a2)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Hongcow is learning to spell! One day, his teacher gives him a word that he needs to learn to spell. Being a dutiful student, he immediately learns how to spell the word.\n\nHongcow has decided to try to make new words from this one. He starts by taking the word he just learned how to spell, and moves the last character of the word to the beginning of the word. He calls this a cyclic shift. He can apply cyclic shift many times. For example, consecutively applying cyclic shift operation to the word \"abracadabra\" Hongcow will get words \"aabracadabr\", \"raabracadab\" and so on.\n\nHongcow is now wondering how many distinct words he can generate by doing the cyclic shift arbitrarily many times. The initial string is also counted.",
"input": "",
"output": "```python\na = input()\r\nt = a\r\nr1 = len(a)\r\nfor i in range(len(a)):\r\n\ta = a[r1-1] + a[0:r1-1]\r\n\tif a == t:\r\n\t\tbreak\r\nprint(i+1)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (*x*1,<=*y*1),<=(*x*2,<=*y*2),<=...,<=(*x**n*,<=*y**n*). Let's define neighbors for some fixed point from the given set (*x*,<=*y*): \n - point (*x*',<=*y*') is (*x*,<=*y*)'s right neighbor, if *x*'<=><=*x* and *y*'<==<=*y* - point (*x*',<=*y*') is (*x*,<=*y*)'s left neighbor, if *x*'<=<<=*x* and *y*'<==<=*y* - point (*x*',<=*y*') is (*x*,<=*y*)'s lower neighbor, if *x*'<==<=*x* and *y*'<=<<=*y* - point (*x*',<=*y*') is (*x*,<=*y*)'s upper neighbor, if *x*'<==<=*x* and *y*'<=><=*y* \nWe'll consider point (*x*,<=*y*) from the given set supercentral, if it has at least one upper, at least one lower, at least one left and at least one right neighbor among this set's points.\n\nVasya marked quite many points on the paper. Analyzing the picture manually is rather a challenge, so Vasya asked you to help him. Your task is to find the number of supercentral points in the given set.",
"input": "",
"output": "```python\ntests = int(input())\r\nsetlist = []\r\n\r\ndef solution(setlist):\r\n points = 0\r\n for i in range(len(setlist)):\r\n right = 0\r\n left = 0\r\n upper = 0\r\n lower = 0\r\n for j in range(len(setlist)):\r\n \r\n if setlist[i][0] == setlist[j][0] and setlist[j][1] setlist[j][0] and setlist[j][1] == setlist[i][1]:\r\n left+=1\r\n \r\n if right>=1 and left>=1 and upper>=1 and lower>=1:\r\n points+=1\r\n return points\r\n\r\nfor _ in range(tests):\r\n sets = list(map(int,input().split()))\r\n setlist.append(sets)\r\n \r\nprint(solution(setlist))\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The administration of the Tomsk Region firmly believes that it's time to become a megacity (that is, get population of one million). Instead of improving the demographic situation, they decided to achieve its goal by expanding the boundaries of the city.\n\nThe city of Tomsk can be represented as point on the plane with coordinates (0; 0). The city is surrounded with *n* other locations, the *i*-th one has coordinates (*x**i*, *y**i*) with the population of *k**i* people. You can widen the city boundaries to a circle of radius *r*. In such case all locations inside the circle and on its border are included into the city.\n\nYour goal is to write a program that will determine the minimum radius *r*, to which is necessary to expand the boundaries of Tomsk, so that it becomes a megacity.",
"input": "",
"output": "```python\nimport math\r\nx,y=map(int,input().split())\r\nr=dict()\r\nfor i in range(x):\r\n a,b,c = map(int, input().split())\r\n a=math.sqrt(pow(a,2)+pow(b,2))\r\n r[a]=c\r\nif(y>=1000000):\r\n print(\"0\")\r\nelse:\r\n for key in sorted(r):\r\n y+=r[key]\r\n if(y>=1000000):\r\n print(key)\r\n break\r\n #print(\"%s %s\"%(key,r[key]))\r\n else:\r\n print(\"-1\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Okabe and Super Hacker Daru are stacking and removing boxes. There are *n* boxes numbered from 1 to *n*. Initially there are no boxes on the stack.\n\nOkabe, being a control freak, gives Daru 2*n* commands: *n* of which are to add a box to the top of the stack, and *n* of which are to remove a box from the top of the stack and throw it in the trash. Okabe wants Daru to throw away the boxes in the order from 1 to *n*. Of course, this means that it might be impossible for Daru to perform some of Okabe's remove commands, because the required box is not on the top of the stack.\n\nThat's why Daru can decide to wait until Okabe looks away and then reorder the boxes in the stack in any way he wants. He can do it at any point of time between Okabe's commands, but he can't add or remove boxes while he does it.\n\nTell Daru the minimum number of times he needs to reorder the boxes so that he can successfully complete all of Okabe's commands. It is guaranteed that every box is added before it is required to be removed.",
"input": "",
"output": "```python\nn = int(input())\r\nst = 1\r\nstack = []\r\nans = 0\r\nfor _ in range(2*n):\r\n ops = input()\r\n if ops[0]=='a':\r\n _,k = ops.split()\r\n stack.append(int(k))\r\n else:\r\n if stack[-1]!=st:\r\n stack.sort(reverse=True)\r\n ans+=1\r\n stack.pop()\r\n st+=1\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Anton's favourite geometric figures are regular polyhedrons. Note that there are five kinds of regular polyhedrons: \n - Tetrahedron. Tetrahedron has 4 triangular faces. - Cube. Cube has 6 square faces. - Octahedron. Octahedron has 8 triangular faces. - Dodecahedron. Dodecahedron has 12 pentagonal faces. - Icosahedron. Icosahedron has 20 triangular faces. \nAll five kinds of polyhedrons are shown on the picture below:\n\nAnton has a collection of *n* polyhedrons. One day he decided to know, how many faces his polyhedrons have in total. Help Anton and find this number!",
"input": "",
"output": "```python\nn = int(input())\r\ntotal_faces = 0\r\nfor _ in range(n):\r\n shape = input().capitalize()\r\n if shape == \"Tetrahedron\" :\r\n total_faces +=4\r\n if shape == \"Cube\" :\r\n total_faces +=6\r\n if shape == \"Octahedron\" :\r\n total_faces +=8\r\n if shape == \"Dodecahedron\" :\r\n total_faces +=12\r\n if shape == \"Icosahedron\" :\r\n total_faces +=20\r\nprint(total_faces)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The School №0 of the capital of Berland has *n* children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each child we know value *t**i*:\n - *t**i*<==<=1, if the *i*-th child is good at programming, - *t**i*<==<=2, if the *i*-th child is good at maths, - *t**i*<==<=3, if the *i*-th child is good at PE \nEach child happens to be good at exactly one of these three subjects.\n\nThe Team Scientific Decathlon Olympias requires teams of three students. The school teachers decided that the teams will be composed of three children that are good at different subjects. That is, each team must have one mathematician, one programmer and one sportsman. Of course, each child can be a member of no more than one team.\n\nWhat is the maximum number of teams that the school will be able to present at the Olympiad? How should the teams be formed for that?",
"input": "",
"output": "```python\ndef finder(point, x):\r\n inx = 0\r\n for i in range(len(point)):\r\n if point[i] == x:\r\n inx = i\r\n break\r\n return inx\r\n\r\ndef main():\r\n n = int(input())\r\n num = list(range(1, n + 1))\r\n point = list(map(int, input().split()))\r\n count = [0, 0, 0]\r\n\r\n for i in range(n):\r\n count[point[i] - 1] += 1\r\n\r\n min_count = min(count)\r\n print(min_count)\r\n \r\n for i in range(n - 1):\r\n swapped = True\r\n for j in range(n - 1 - i):\r\n if point[j] > point[j + 1]:\r\n point[j], point[j + 1] = point[j + 1], point[j]\r\n num[j], num[j + 1] = num[j + 1], num[j]\r\n swapped = False\r\n if swapped:\r\n break\r\n \r\n one_ind = finder(point, 1)\r\n two_ind = finder(point, 2)\r\n three_ind = finder(point, 3)\r\n\r\n for i in range(min_count):\r\n print(num[one_ind], num[two_ind], num[three_ind])\r\n one_ind += 1\r\n two_ind += 1\r\n three_ind += 1\r\n\r\nif __name__ == \"__main__\":\r\n main()# 1698230401.854687\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Limak is a little polar bear. He has *n* balls, the *i*-th ball has size *t**i*.\n\nLimak wants to give one ball to each of his three friends. Giving gifts isn't easy — there are two rules Limak must obey to make friends happy:\n - No two friends can get balls of the same size. - No two friends can get balls of sizes that differ by more than 2. \nFor example, Limak can choose balls with sizes 4, 5 and 3, or balls with sizes 90, 91 and 92. But he can't choose balls with sizes 5, 5 and 6 (two friends would get balls of the same size), and he can't choose balls with sizes 30, 31 and 33 (because sizes 30 and 33 differ by more than 2).\n\nYour task is to check whether Limak can choose three balls that satisfy conditions above.",
"input": "",
"output": "```python\nn = int(input())\na = sorted(map(int, input().split()))\nq = 0\np = -1\nans = False\nfor i in a:\n if i == p + 1:\n q += 1\n else:\n q = 1\n if q == 3:\n ans = True\n p = i\nprint('YES' if ans else 'NO')\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Hooray! Berl II, the king of Berland is making a knight tournament. The king has already sent the message to all knights in the kingdom and they in turn agreed to participate in this grand event.\n\nAs for you, you're just a simple peasant. There's no surprise that you slept in this morning and were late for the tournament (it was a weekend, after all). Now you are really curious about the results of the tournament. This time the tournament in Berland went as follows:\n - There are *n* knights participating in the tournament. Each knight was assigned his unique number — an integer from 1 to *n*. - The tournament consisted of *m* fights, in the *i*-th fight the knights that were still in the game with numbers at least *l**i* and at most *r**i* have fought for the right to continue taking part in the tournament. - After the *i*-th fight among all participants of the fight only one knight won — the knight number *x**i*, he continued participating in the tournament. Other knights left the tournament. - The winner of the last (the *m*-th) fight (the knight number *x**m*) became the winner of the tournament. \nYou fished out all the information about the fights from your friends. Now for each knight you want to know the name of the knight he was conquered by. We think that the knight number *b* was conquered by the knight number *a*, if there was a fight with both of these knights present and the winner was the knight number *a*.\n\nWrite the code that calculates for each knight, the name of the knight that beat him.",
"input": "",
"output": "```python\n#!/usr/bin/env python3\n#-*- encoding: utf-8 -*-\n\nimport sys\n\ndef main():\n n, m = map(int, sys.stdin.readline().split())\n res = [0 for _ in range(n)]\n for i in range(m):\n l, r, x = map(int, sys.stdin.readline().split())\n for j in range(l,r+1):\n if res[j-1] == 0 and j !=x:\n res[j-1] = x\n print(' '.join(map(str, res)))\n return\n\nmain()\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Find an *n*<=×<=*n* matrix with different numbers from 1 to *n*2, so the sum in each row, column and both main diagonals are odd.",
"input": "",
"output": "```python\nN = int(input())\ncnt = 0\nthe_odd = -1\nthe_eve = 0\ndef get_with_eve_N(x, y) :\n\treturn -1\ndef get_with_odd_N(x, y) :\n\tglobal the_odd\n\tglobal the_eve\n\tif (x + y <= N + 1 >> 1 or x + y >= N + (N + 1 >> 1) + 1 or y - x >= N + 1 >> 1 or x - y >= N + 1 >> 1) :\n\t\tthe_eve += 2\n\t\treturn the_eve\n\telse :\n\t\tthe_odd += 2\n\t\treturn the_odd\nif N % 2 == 0 :\n\tfor i in range(1, N + 1) :\n\t\tfor j in range(1, N + 1) :\n\t\t\tif j == N :\n\t\t\t\tprint(get_with_eve_N(i, j))\n\t\t\telse :\n\t\t\t\tprint(get_with_eve_N(i, j), end = ' ')\nelse :\n\tfor i in range(1, N + 1) :\n\t\tfor j in range(1, N + 1) :\n\t\t\tif j == N :\n\t\t\t\tprint(get_with_odd_N(i, j))\n\t\t\telse :\n\t\t\t\tprint(get_with_odd_N(i, j), end = ' ')\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\na = str(input()).split()\r\n#for i in a:\r\nif (int(a[0]) * int(a[1]))%2 == 0:\r\n print((int(a[0]) * int(a[1]))//2)\r\nelif (int(a[0]) * int(a[1]))%2 != 0:\r\n print((int(a[0]) * int(a[1]))//2 )\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vova promised himself that he would never play computer games... But recently Firestorm — a well-known game developing company — published their newest game, World of Farcraft, and it became really popular. Of course, Vova started playing it.\n\nNow he tries to solve a quest. The task is to come to a settlement named Overcity and spread a rumor in it.\n\nVova knows that there are *n* characters in Overcity. Some characters are friends to each other, and they share information they got. Also Vova knows that he can bribe each character so he or she starts spreading the rumor; *i*-th character wants *c**i* gold in exchange for spreading the rumor. When a character hears the rumor, he tells it to all his friends, and they start spreading the rumor to their friends (for free), and so on.\n\nThe quest is finished when all *n* characters know the rumor. What is the minimum amount of gold Vova needs to spend in order to finish the quest?\n\nTake a look at the notes if you think you haven't understood the problem completely.",
"input": "",
"output": "```python\n\r\n\r\n''' Depth First Search (DFS) '''\r\ndef dfs(x, menor, a):\r\n\ta.append(prec[x])\r\n\tif prec[x] < menor:\r\n\t\tmenor = prec[x]\r\n\tvisited[x] = True\r\n\tfor y in graph[x]:\r\n\t\tif not(visited[y]):\r\n\t\t\tdfs(y, menor, a)\r\n \r\n \r\n \r\n \r\nn, m = map(int, input().split())\r\nprec = list(map(int, input().split()))\r\nprec = [0] + prec\r\ngraph = [[] for _ in range(n + 1)]\r\nvisited = [False] * (n + 1)\r\ntotal = 0\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n graph[x].append(y)\r\n graph[y].append(x)\r\n \r\n\r\nfor i in range(1, n+1):\r\n\r\n\tif visited[i] == False:\r\n\t\tr = []\r\n\t\tdfs(i, 10**10, r)\r\n\t\ttotal += min(r)\r\n\t\t\r\nprint(total)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "As you may know, MemSQL has American offices in both San Francisco and Seattle. Being a manager in the company, you travel a lot between the two cities, always by plane.\n\nYou prefer flying from Seattle to San Francisco than in the other direction, because it's warmer in San Francisco. You are so busy that you don't remember the number of flights you have made in either direction. However, for each of the last *n* days you know whether you were in San Francisco office or in Seattle office. You always fly at nights, so you never were at both offices on the same day. Given this information, determine if you flew more times from Seattle to San Francisco during the last *n* days, or not.",
"input": "",
"output": "```python\nip_no_days=int(input())\r\ndata_diff_days=input()\r\n\r\ncountSF=0\r\ncountFS=0\r\n\r\nfor i in range(1,len(data_diff_days)):\r\n if data_diff_days[i-1]=='S' and data_diff_days[i]=='F':\r\n countSF+=1\r\n elif data_diff_days[i-1]=='F' and data_diff_days[i]=='S':\r\n countFS+=1\r\n else:\r\n continue\r\n\r\nif countSF>countFS:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a \"crime\" and find out what is happening. He can ask any questions whatsoever that can be answered with \"Yes\" or \"No\". All the rest agree beforehand to answer the questions like that: if the question’s last letter is a vowel, they answer \"Yes\" and if the last letter is a consonant, they answer \"No\". Of course, the sleuth knows nothing about it and his task is to understand that.\n\nUnfortunately, Vasya is not very smart. After 5 hours of endless stupid questions everybody except Vasya got bored. That’s why Vasya’s friends ask you to write a program that would give answers instead of them.\n\nThe English alphabet vowels are: A, E, I, O, U, Y\n\nThe English alphabet consonants are: B, C, D, F, G, H, J, K, L, M, N, P, Q, R, S, T, V, W, X, Z",
"input": "",
"output": "```python\ns=input().upper().split()\r\ns=\"\".join(s)\r\nl=['A','E','I','O','U','Y']\r\nn=len(s)\r\nif s[n-2] in l:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "This winter is so cold in Nvodsk! A group of *n* friends decided to buy *k* bottles of a soft drink called \"Take-It-Light\" to warm up a bit. Each bottle has *l* milliliters of the drink. Also they bought *c* limes and cut each of them into *d* slices. After that they found *p* grams of salt.\n\nTo make a toast, each friend needs *nl* milliliters of the drink, a slice of lime and *np* grams of salt. The friends want to make as many toasts as they can, provided they all drink the same amount. How many toasts can each friend make?",
"input": "",
"output": "```python\nn, k, l, c, d, p, nl, np = map(int, input().split())\r\nres = min(((k*l)//nl), (c*d), (p//np))//n\r\nprint(int(res))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\nn,b=map(int,input().split())\r\ncount=0\r\nif n%2==0 or b%2==0:\r\n count=(n*b)//2\r\nelse:\r\n count=((n*b)-1)//2\r\nprint(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. \"Piece of cake\" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.",
"input": "",
"output": "```python\nn=int(input())\r\nsum1=sum2=sum3=0\r\nfor i in range(n):\r\n x,y,z=map(int,input().split())\r\n sum1+=x\r\n sum2+=y\r\n sum3+=z\r\nif sum1==0 and sum2==0 and sum3==0:\r\n print('YES')\r\nelse:\r\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Appleman and Toastman play a game. Initially Appleman gives one group of *n* numbers to the Toastman, then they start to complete the following tasks:\n - Each time Toastman gets a group of numbers, he sums up all the numbers and adds this sum to the score. Then he gives the group to the Appleman. - Each time Appleman gets a group consisting of a single number, he throws this group out. Each time Appleman gets a group consisting of more than one number, he splits the group into two non-empty groups (he can do it in any way) and gives each of them to Toastman. \nAfter guys complete all the tasks they look at the score value. What is the maximum possible value of score they can get?",
"input": "",
"output": "```python\ndef f(x):\r\n i =-1\r\n while 2**(i+1) <= x:\r\n i += 1\r\n return i\r\nn = int(input())\r\ns = list(map(int,input().split()))\r\nadd = 0\r\nfor i in range(len(s)):\r\n add += s[i]\r\n\r\ntotal = 0\r\ns.sort(reverse = True)\r\nline = []\r\nwhile n > 0:\r\n t = f(n)\r\n line.append(t)\r\n n -= 2**t\r\n\r\na,b = 0,0\r\nfor i in range(len(line)):\r\n b += 2**line[i]\r\n sum = 0\r\n for j in range(a,b):\r\n sum += s[j]\r\n total += sum*(1+line[i])\r\n a = b\r\n\r\nif 2**line[0] < add:\r\n total += add\r\n \r\nprint(total)\r\n \r\n \r\n \r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "According to a new ISO standard, a flag of every country should have a chequered field *n*<=×<=*m*, each square should be of one of 10 colours, and the flag should be «striped»: each horizontal row of the flag should contain squares of the same colour, and the colours of adjacent horizontal rows should be different. Berland's government asked you to find out whether their flag meets the new ISO standard.",
"input": "",
"output": "```python\nn, m = [int(i) for i in input().split()]\r\nlast = '.'\r\n\r\nfor i in range(n):\r\n s = input()\r\n if last == s[0]:\r\n print('NO')\r\n exit(0)\r\n if s != s[0] * m:\r\n print('NO')\r\n exit(0)\r\n last = s[0]\r\nprint('YES')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) reversely. For example, a Berlandish word code corresponds to a Birlandish word edoc. However, it's easy to make a mistake during the «translation». Vasya translated word *s* from Berlandish into Birlandish as *t*. Help him: find out if he translated the word correctly.",
"input": "",
"output": "```python\ns = list(input())\nt = input()\nn = len(s)\nfor i in range(n//2):\n temp = s[i]\n s[i] = s[n - (i+1)]\n s[n - (i+1)] = temp\nnew_s = ''.join(map(str, s))\nif t == new_s:\n print('YES')\nelse:\n print('NO')\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Let's consider one interesting word game. In this game you should transform one word into another through special operations. \n\nLet's say we have word *w*, let's split this word into two non-empty parts *x* and *y* so, that *w*<==<=*xy*. A split operation is transforming word *w*<==<=*xy* into word *u*<==<=*yx*. For example, a split operation can transform word \"wordcut\" into word \"cutword\".\n\nYou are given two words *start* and *end*. Count in how many ways we can transform word *start* into word *end*, if we apply exactly *k* split operations consecutively to word *start*. \n\nTwo ways are considered different if the sequences of applied operations differ. Two operation sequences are different if exists such number *i* (1<=≤<=*i*<=≤<=*k*), that in the *i*-th operation of the first sequence the word splits into parts *x* and *y*, in the *i*-th operation of the second sequence the word splits into parts *a* and *b*, and additionally *x*<=≠<=*a* holds.",
"input": "",
"output": "```python\nMOD=10**9+7\r\n\r\n# @cache\r\ndef slove():\r\n # if v==0: return 0\r\n # n=int(input())\r\n a=str(input())\r\n b=str(input())\r\n n=len(a)\r\n k=int(input())\r\n if n==2:\r\n if a==b: \r\n print('1' if k&1==0 else '0')\r\n elif a[::-1]==b:\r\n print('1' if k&1 else '0')\r\n else:\r\n print('0')\r\n return \r\n if k==0:\r\n print('1' if a==b else '0')\r\n return \r\n \r\n cut=[]\r\n for i in range(n):\r\n w=a[i:]+a[:i]\r\n if w==b:\r\n cut.append(i)\r\n if len(cut)==0:\r\n print('0')\r\n # elif len(cut)>=1:\r\n else:\r\n f=1 if a==b else 0\r\n for i in range(k):\r\n f=pow(n-1,i)*len(cut)-f\r\n f%=MOD\r\n print(f)\r\n return \r\n return \r\n\r\n \r\n \r\n# t=int(input())\r\nt=1\r\n# M=1<<30\r\nfor _ in range(t):\r\n # v=int(input())\r\n slove()\r\n # print(ans)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Email address in Berland is a string of the form *A*@*B*, where *A* and *B* are arbitrary strings consisting of small Latin letters. \n\nBob is a system administrator in «Bersoft» company. He keeps a list of email addresses of the company's staff. This list is as a large string, where all addresses are written in arbitrary order, separated by commas. The same address can be written more than once.\n\nSuddenly, because of unknown reasons, all commas in Bob's list disappeared. Now Bob has a string, where all addresses are written one after another without any separators, and there is impossible to determine, where the boundaries between addresses are. Unfortunately, on the same day his chief asked him to bring the initial list of addresses. Now Bob wants to disjoin addresses in some valid way. Help him to do that.",
"input": "",
"output": "```python\ns = input()\nindexsi = []\nfor i in range(len(s)):\n if s[i] == \"@\":\n indexsi.append(i)\nans = \"\"\nleft = 0\ntemp = True\n#print(*indexsi)\nfor i in range(len(indexsi)):\n if indexsi[i] == 0 or indexsi[i] == len(s)-1:\n temp = False\n break\n if i != 0 and indexsi[i] - indexsi[i-1] <= 2:\n temp = False\n break\n ans += s[left:indexsi[i]+2]\n left = indexsi[i]+2\n if i != len(indexsi)-1:\n ans += ','\n\nif temp:\n print(ans)\nelse:\n print(\"No solution\")\n\n\n \t\t \t \t\t \t\t\t \t \t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Being a programmer, you like arrays a lot. For your birthday, your friends have given you an array *a* consisting of *n* distinct integers.\n\nUnfortunately, the size of *a* is too small. You want a bigger array! Your friends agree to give you a bigger array, but only if you are able to answer the following question correctly: is it possible to sort the array *a* (in increasing order) by reversing exactly one segment of *a*? See definitions of segment and reversing in the notes.",
"input": "",
"output": "```python\ndef check(arr):\r\n \r\n temp = sorted(arr)\r\n n = len(arr)\r\n\r\n cnt = 0 \r\n\r\n segment = False \r\n\r\n p1 = -1 \r\n p2 = -2 \r\n for i in range(n):\r\n if arr[i] != temp[i]:\r\n if not segment :\r\n segment = True \r\n p1 = i \r\n elif segment :\r\n segment = False \r\n p2 = i \r\n cnt += 1 \r\n \r\n if cnt > 1: \r\n print(\"no\")\r\n return \r\n\r\n if cnt == 0 : \r\n print(\"yes\")\r\n print(\"1 1\")\r\n return \r\n for i in range(p2-1, p1+1, -1):\r\n if arr[i] > arr[i-1] : \r\n print(\"no\")\r\n return \r\n\r\n print(\"yes\")\r\n\r\n p1 += 1 \r\n if p1 > p2 :\r\n p1, p2 = p2, p1\r\n print(f\"{p1} {p2}\")\r\n \r\n\r\n\r\nn = int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\nispossible = check(arr)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Susie loves strings. Today she calculates distances between them. As Susie is a small girl after all, her strings contain only digits zero and one. She uses the definition of Hamming distance:\n\nWe will define the distance between two strings *s* and *t* of the same length consisting of digits zero and one as the number of positions *i*, such that *s**i* isn't equal to *t**i*. \n\nAs besides everything else Susie loves symmetry, she wants to find for two strings *s* and *t* of length *n* such string *p* of length *n*, that the distance from *p* to *s* was equal to the distance from *p* to *t*.\n\nIt's time for Susie to go to bed, help her find such string *p* or state that it is impossible.",
"input": "",
"output": "```python\na = input()\r\nb = input() \r\nx = str(int(a) ^ int(b))\r\nif x.count(\"1\") %2 != 0 :\r\n print(\"IMPOSSIBLE\")\r\nelse : \r\n res = \"\"\r\n flag1 = True \r\n for idx , value in enumerate(x) : \r\n if value == \"0\":\r\n res += str(a)[idx] \r\n else: \r\n if flag1 :\r\n res += \"1\"\r\n flag1 =False\r\n else:\r\n res += \"0\"\r\n flag1 = True\r\n print(res) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "— I experienced so many great things.\n\n— You gave me memories like dreams... But I have to leave now...\n\n— One last request, can you...\n\n— Help me solve a Codeforces problem?\n\n— ......\n\n— What?\n\nChtholly has been thinking about a problem for days:\n\nIf a number is palindrome and length of its decimal representation without leading zeros is even, we call it a zcy number. A number is palindrome means when written in decimal representation, it contains no leading zeros and reads the same forwards and backwards. For example 12321 and 1221 are palindromes and 123 and 12451 are not. Moreover, 1221 is zcy number and 12321 is not.\n\nGiven integers *k* and *p*, calculate the sum of the *k* smallest zcy numbers and output this sum modulo *p*.\n\nUnfortunately, Willem isn't good at solving this kind of problems, so he asks you for help!",
"input": "",
"output": "```python\ndef main(length, r, num, rev, length2):\r\n global left, res, p\r\n if length == 0:\r\n if left == 0:\r\n return\r\n res += num * r * 10 + rev\r\n res %= p\r\n left -= 1\r\n else:\r\n for j in range(10):\r\n if left == 0:\r\n return\r\n main(length - 1, r, num * 10 + j, j * (10 ** length2) + rev, length2 + 1)\r\n\r\nk, p = map(int, input().split())\r\nleft = k\r\nres = 0\r\nindicator = True\r\nfor length in range(1, 100):\r\n if not indicator:\r\n break\r\n r = 10 ** (length - 1)\r\n for i in range(1, 10):\r\n if left == 0:\r\n indicator = False\r\n break\r\n main(length - 1, r, i, i, 1)\r\nprint(res)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given an array of positive integers *a*1,<=*a*2,<=...,<=*a**n*<=×<=*T* of length *n*<=×<=*T*. We know that for any *i*<=><=*n* it is true that *a**i*<==<=*a**i*<=-<=*n*. Find the length of the longest non-decreasing sequence of the given array.",
"input": "",
"output": "```python\nf = lambda: map(int, input().split())\r\nn, m = f()\r\nt = list(f())\r\ns = [0] * 301\r\nd = s[:]\r\nfor i in t: d[i] += 1\r\nfor i in t * min(m, 2 * n): s[i] = max(s[:i + 1]) + 1\r\nprint(max(s) + max((m - n * 2) * max(d), 0))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A and B are preparing themselves for programming contests.\n\nB loves to debug his code. But before he runs the solution and starts debugging, he has to first compile the code.\n\nInitially, the compiler displayed *n* compilation errors, each of them is represented as a positive integer. After some effort, B managed to fix some mistake and then another one mistake.\n\nHowever, despite the fact that B is sure that he corrected the two errors, he can not understand exactly what compilation errors disappeared — the compiler of the language which B uses shows errors in the new order every time! B is sure that unlike many other programming languages, compilation errors for his programming language do not depend on each other, that is, if you correct one error, the set of other error does not change.\n\nCan you help B find out exactly what two errors he corrected?",
"input": "",
"output": "```python\nn = int(input())\r\nlst = [int(i) for i in input().split()]\r\nlst.sort()\r\nfor i in range(2):\r\n new_lst = [int(i) for i in input().split()]\r\n new_lst.sort()\r\n #print(new_lst)\r\n #print(lst)\r\n fl = True\r\n for i in range(len(new_lst)):\r\n if new_lst[i] != lst[i]:\r\n print(lst[i])\r\n fl = False\r\n break\r\n if fl:\r\n print(lst[-1])\r\n lst = new_lst.copy()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little girl Alyona is in a shop to buy some copybooks for school. She study four subjects so she wants to have equal number of copybooks for each of the subjects. There are three types of copybook's packs in the shop: it is possible to buy one copybook for *a* rubles, a pack of two copybooks for *b* rubles, and a pack of three copybooks for *c* rubles. Alyona already has *n* copybooks.\n\nWhat is the minimum amount of rubles she should pay to buy such number of copybooks *k* that *n*<=+<=*k* is divisible by 4? There are infinitely many packs of any type in the shop. Alyona can buy packs of different type in the same purchase.",
"input": "",
"output": "```python\nn, a, b, c = map(int, input().split())\r\nx = n%4\r\nans = 0\r\nif x == 0:\r\n\tans = 0\r\nelif x == 3:\r\n\tans = a\r\nelif x == 2:\r\n\tans = min(a*2,b)\r\nelse:\r\n\tans = min(a*3,a+b,c)\r\nprint (ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarpus takes part in the \"Field of Wonders\" TV show. The participants of the show have to guess a hidden word as fast as possible. Initially all the letters of the word are hidden.\n\nThe game consists of several turns. At each turn the participant tells a letter and the TV show host responds if there is such letter in the word or not. If there is such letter then the host reveals all such letters. For example, if the hidden word is \"abacaba\" and the player tells the letter \"a\", the host will reveal letters at all positions, occupied by \"a\": 1, 3, 5 and 7 (positions are numbered from left to right starting from 1).\n\nPolycarpus knows *m* words of exactly the same length as the hidden word. The hidden word is also known to him and appears as one of these *m* words.\n\nAt current moment a number of turns have already been made and some letters (possibly zero) of the hidden word are already revealed. Previously Polycarp has told exactly the letters which are currently revealed.\n\nIt is Polycarpus' turn. He wants to tell a letter in such a way, that the TV show host will assuredly reveal at least one more letter. Polycarpus cannot tell the letters, which are already revealed.\n\nYour task is to help Polycarpus and find out the number of letters he can tell so that the show host will assuredly reveal at least one of the remaining letters.",
"input": "",
"output": "```python\nn=int(input())\r\ns=input()\r\nlet=dict()\r\na=[]\r\nc=0\r\nfor i in range(n):\r\n let[s[i]]=let.get(s[i],0)+1\r\nm=int(input())\r\nfor i in range(m):\r\n a.append(input())\r\nfor i in range(ord('a'),ord('z')+1):\r\n if let.get(chr(i),0)!=0: continue\r\n flag2=1\r\n for j in range(m):\r\n flag1=1\r\n letc=dict()\r\n for k in range(n):\r\n if s[k]==\"*\" and let.get(a[j][k],0)!=0:\r\n flag1=0\r\n break\r\n if s[k]==\"*\":\r\n letc[a[j][k]]=letc.get(a[j][k],0)+1\r\n elif s[k]!=a[j][k]:\r\n flag1=0\r\n if flag1 and letc.get(chr(i),0)==0:\r\n flag2=0\r\n if flag2:\r\n c=+1\r\nprint(c)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "wHAT DO WE NEED cAPS LOCK FOR?\n\nCaps lock is a computer keyboard key. Pressing it sets an input mode in which typed letters are capital by default. If it is pressed by accident, it leads to accidents like the one we had in the first passage. \n\nLet's consider that a word has been typed with the Caps lock key accidentally switched on, if: \n - either it only contains uppercase letters; - or all letters except for the first one are uppercase. \nIn this case we should automatically change the case of all letters. For example, the case of the letters that form words \"hELLO\", \"HTTP\", \"z\" should be changed.\n\nWrite a program that applies the rule mentioned above. If the rule cannot be applied, the program should leave the word unchanged.",
"input": "",
"output": "```python\nword = input()\n\nif word == word.upper():\n print(word.swapcase())\nelif word == word.capitalize().swapcase():\n print(word.swapcase())\nelse:\n print(word)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer.\n\nAt the start of the day they have *x* ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and Gerda's house even in the night. Each person in the queue wants either to take several ice cream packs for himself and his friends or to give several ice cream packs to Kay and Gerda (carriers that bring ice cream have to stand in the same queue).\n\nIf a carrier with *d* ice cream packs comes to the house, then Kay and Gerda take all his packs. If a child who wants to take *d* ice cream packs comes to the house, then Kay and Gerda will give him *d* packs if they have enough ice cream, otherwise the child will get no ice cream at all and will leave in distress.\n\nKay wants to find the amount of ice cream they will have after all people will leave from the queue, and Gerda wants to find the number of distressed kids.",
"input": "",
"output": "```python\n#####--------------Template Begin-------------------####\r\nimport math\r\nimport sys\r\n#input = sys.stdin.readline\r\ndef ri(): #Regular input\r\n\treturn input()\r\ndef ii(): #integer input\r\n\treturn int(input())\r\ndef li(): #list input\r\n\treturn input().split()\r\ndef mi(): #map input\r\n\treturn list(map(int, input().split()))\r\n#####---------------Template Ends-------------------######\r\nn,x=mi()\r\nd=0\r\nfor i in range(n):\r\n\tline=ri().split()\r\n\tif line[0]==\"+\":\r\n\t\tx+=int(line[1])\r\n\telse:\r\n\t\tif x>=int(line[1]):\r\n\t\t\tx-=int(line[1])\r\n\t\telse:\r\n\t\t\td+=1\r\n\r\n\r\nprint(x, d)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two arrays of integers *a* and *b*. For each element of the second array *b**j* you should find the number of elements in array *a* that are less than or equal to the value *b**j*.",
"input": "",
"output": "```python\nlengths = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nres = []\n\na.sort()\nfor i in range(len(b)):\n low = 0\n high = lengths[0]\n chosen = 0\n control = 0\n while low < high:\n mid = int((low + high) // 2)\n if a[mid] <= b[i]:\n chosen = mid + 1\n low = mid\n else:\n high = mid\n\n if control == mid: break\n control = mid\n res.append(chosen)\n\nprint(*res)\n\t\t \t\t\t\t\t \t \t\t\t\t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Furik loves math lessons very much, so he doesn't attend them, unlike Rubik. But now Furik wants to get a good mark for math. For that Ms. Ivanova, his math teacher, gave him a new task. Furik solved the task immediately. Can you?\n\nYou are given a system of equations: \n\nYou should count, how many there are pairs of integers (*a*,<=*b*) (0<=≤<=*a*,<=*b*) which satisfy the system.",
"input": "",
"output": "```python\nimport math\n\nn, m = [int(x) for x in input().split()]\ncount = 0\na_limit = min(math.floor(math.sqrt(n)), m)\nb_limit = min(math.floor(math.sqrt(m)), n)\nfor a in range(0, a_limit + 1):\n for b in range(0, b_limit + 1):\n if (a**2 + b) == n and (a + b**2) == m:\n count+=1\nprint(count)\n \t \t\t\t\t \t\t \t \t\t\t \t\t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You're given a row with $n$ chairs. We call a seating of people \"maximal\" if the two following conditions hold:\n 1. There are no neighbors adjacent to anyone seated. 1. It's impossible to seat one more person without violating the first rule. \nThe seating is given as a string consisting of zeros and ones ($0$ means that the corresponding seat is empty, $1$ — occupied). The goal is to determine whether this seating is \"maximal\".\n\nNote that the first and last seats are not adjacent (if $n \\ne 2$).",
"input": "",
"output": "```python\ndef is_maximal(seating):\r\n # Count the number of zeros and ones in the seating\r\n zeros = seating.count(\"0\")\r\n ones = seating.count(\"1\")\r\n\r\n # Check if the seating is maximal\r\n if (zeros == 1 and ones == 0) or (ones == 1 and zeros == 0):\r\n return \"Yes\"\r\n else:\r\n return \"No\"\r\n\r\n# Test the function with some examples\r\nprint(is_maximal(\"001\")) # Should print \"Yes\"\r\nprint(is_maximal(\"101\")) # Should print \"No\"\r\nprint(is_maximal(\"110\")) # Should print \"Yes\"\r\nprint(is_maximal(\"010\")) # Should print \"No\"\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "— Willem...\n\n— What's the matter?\n\n— It seems that there's something wrong with Seniorious...\n\n— I'll have a look...\n\n\n\nSeniorious is made by linking special talismans in particular order.\n\nAfter over 500 years, the carillon is now in bad condition, so Willem decides to examine it thoroughly.\n\nSeniorious has *n* pieces of talisman. Willem puts them in a line, the *i*-th of which is an integer *a**i*.\n\nIn order to maintain it, Willem needs to perform *m* operations.\n\nThere are four types of operations:\n- 1 *l* *r* *x*: For each *i* such that *l*<=≤<=*i*<=≤<=*r*, assign *a**i*<=+<=*x* to *a**i*.- 2 *l* *r* *x*: For each *i* such that *l*<=≤<=*i*<=≤<=*r*, assign *x* to *a**i*.- 3 *l* *r* *x*: Print the *x*-th smallest number in the index range [*l*,<=*r*], i.e. the element at the *x*-th position if all the elements *a**i* such that *l*<=≤<=*i*<=≤<=*r* are taken and sorted into an array of non-decreasing integers. It's guaranteed that 1<=≤<=*x*<=≤<=*r*<=-<=*l*<=+<=1.- 4 *l* *r* *x* *y*: Print the sum of the *x*-th power of *a**i* such that *l*<=≤<=*i*<=≤<=*r*, modulo *y*, i.e. .",
"input": "",
"output": "```python\n#warning By KonJAC_xrs\n#warning ( testing == 0 ) ? Yes : No\n\n#include\n#define ll long long\n#define ull unsigned long long\n#define ld long double\nusing namespace std;\n\ninline ll read()\n{\n ll x=0,f=1; char ch=getchar();\n while (!isdigit(ch)) {if(ch=='-') f=-1; ch=getchar();}\n while ( isdigit(ch)) {x = x * 10+ch-48; ch=getchar();}\n return x*f;\n}\n\ninline void xrs(ll x)\n{\n if(x<0) putchar('-') , x=-x;\n if(x>9) xrs(x/10);\n putchar(x%10+'0');\n}\n\n//const ll inf=;\nconst ll mod=1e9+7;\nconst ll nore=2e5+20;\n\nll n,m,sed,vmax;\n\nstruct Chtholly_Tree{\n\t\n\tstruct node{\n\t\tll l,r;\n\t\tmutable ll val;\n\t\tnode (ll x,ll y,ll z) : l(x),r(y),val(z) {}\n\t\tnode (ll x) : l(x) {}\n\t\tbool operator < (const node &b) const {return l s;\n\t#define ss set < node > :: iterator\n\t\n\tinline ss spilt(ll pos)\n\t{\n\t\t#define louwo_bengda lower_bound\n\t\tss it=s.louwo_bengda(node(pos));\n\t\tif(it!=s.end() and it->l==pos)\n\t\t\treturn it;\n\t\tit--;\n\t\tll l=it->l , r=it->r , val=it->val;\n\t\ts.erase(it);\n\t\ts.insert(node(l,pos-1,val));\n\t\treturn s.insert(node(pos,r,val)).first;\n\t}\n\t\n\tinline void assign(ll l,ll r,ll val)\n\t{\n\t\tss it_r=spilt(r+1); ss it_l=spilt(l);\n\t\ts.erase(it_l,it_r);\n\t\ts.insert(node(l,r,val));\n\t}\n\t\n\tinline void add(ll l,ll r,ll val)\n\t{\n\t\tss it_r=spilt(r+1); ss it_l=spilt(l);\n\t\tfor(register ss it=it_l;it!=it_r;it++)\n\t\t\tit->val+=val;\n\t}\n\t\n\tinline ll kth(ll l,ll r,ll k)\n\t{\n\t\tss it_r=spilt(r+1); ss it_l=spilt(l);\n\t\tvector < pair < ll , ll > > v;\n\t\tfor(register ss it=it_l;it!=it_r;it++)\n\t\t\tv.push_back(make_pair(it->val,it->r-it->l+1));\n\t\tsort(v.begin(),v.end());\n\t\tfor(register ll i=0;i>=1;\n\t\t}\n\t\treturn ans;\n\t}\n\t\n\tinline ll ask(ll l,ll r,ll x,ll y)\n\t{\n\t\tss it_r=spilt(r+1); ss it_l=spilt(l);\n\t\tll ans=0;\n\t\tfor(register ss it=it_l;it!=it_r;it++)\n\t\t\tans=(ans+((it->r-it->l+1)*ksm(it->val,x,y)))%y;\n\t\treturn ans;\n\t}\n\t\n}ODT;\n\ninline ll randd()\n{\n\tll ret=sed;\n\tsed=(sed*7+13)%mod;\n\treturn ret;\n}\n\nint main()\n{\n//\tfreopen(\".in\",\"r\",stdin);\n//\tfreopen(\".out\",\"w\",stdout);\n\tn=read(); m=read(); sed=read(); vmax=read();\n\tfor(register ll i=1;i<=n;i++)\n\t{\n\t\tll a=randd()%vmax+1;\n\t\tODT.s.insert(Chtholly_Tree::node(i,i,a));\n\t}\n//\tODT.s.insert(Chtholly_Tree::node(n+1,n+1,0));\n\tfor(register ll i=1;i<=m;i++)\n\t{\n\t\tshort int opt=randd()%4+1;\n\t\tll l=randd()%n+1; ll r=randd()%n+1;\n\t\tll x,y;\n\t\tif(l>r) swap(l,r);\n\t\tif(opt==3)\n\t\t\tx=randd()%(r-l+1)+1;\n\t\telse\n\t\t\tx=randd()%vmax+1;\n\t\tif(opt==4)\n\t\t\ty=randd()%vmax+1;\n\t\tif(opt==1)\n\t\t\tODT.add(l,r,x);\n\t\telse if(opt==2)\n\t\t\tODT.assign(l,r,x);\n\t\telse if(opt==3)\n\t\t\txrs(ODT.kth(l,r,x)) , puts(\"\");\n\t\telse\n\t\t\txrs(ODT.ask(l,r,x,y)) , puts(\"\");\n\t}\n getchar();\n return 0;\n}\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "В самолёте есть *n* рядов мест. Если смотреть на ряды сверху, то в каждом ряду есть 3 места слева, затем проход между рядами, затем 4 центральных места, затем ещё один проход между рядами, а затем ещё 3 места справа.\n\nИзвестно, что некоторые места уже заняты пассажирами. Всего есть два вида пассажиров — статусные (те, которые часто летают) и обычные. \n\nПеред вами стоит задача рассадить ещё *k* обычных пассажиров так, чтобы суммарное число соседей у статусных пассажиров было минимально возможным. Два пассажира считаются соседями, если они сидят в одном ряду и между ними нет других мест и прохода между рядами. Если пассажир является соседним пассажиром для двух статусных пассажиров, то его следует учитывать в сумме соседей дважды.",
"input": "",
"output": "```python\nfrom collections import Counter\r\nn,k=list(map(int,input().split()))\r\n#n,k=1,2\r\na=set()\r\nc=[set() for i in range(3)]\r\nb=set()\r\nz=0\r\nfor i in range(n):\r\n s=input()\r\n for i0 in range(len(s)):\r\n if s[i0]=='.':\r\n a.add(tuple([i,i0]))\r\n elif s[i0]=='S':\r\n b.add(tuple([i,i0]))\r\n for i0 in range(len(s)):\r\n if s[i0]=='.':\r\n zz=0\r\n if tuple([i,i0+1]) in b:\r\n zz=zz+1\r\n if tuple([i,i0-1]) in b:\r\n zz=zz+1\r\n c[zz].add(tuple([i,i0]))\r\nc=list(c[0])+list(c[1])+list(c[2])\r\nfor i in range(k):\r\n a.remove(c[i])\r\nfor i in b:\r\n if (i[1]!=2)and(i[1]!=7)and(i[1]!=11):\r\n if not(tuple([i[0],i[1]+1])in a):\r\n z=z+1\r\n if (i[1]!=4)and(i[1]!=9)and(i[1]!=0):\r\n if not(tuple([i[0],i[1]-1])in a):\r\n z=z+1\r\nc=set(c)\r\n\r\nprint(z)\r\nfor i in range(n):\r\n s=''\r\n for i0 in range(12):\r\n if i0==3 or i0==8:\r\n s=s+'-'\r\n elif tuple([i,i0])in a:\r\n s=s+'.'\r\n elif tuple([i,i0])in b:\r\n s=s+'S'\r\n elif tuple([i,i0])in c:\r\n s=s+'x'\r\n else:\r\n s=s+'P'\r\n print(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Jon fought bravely to rescue the wildlings who were attacked by the white-walkers at Hardhome. On his arrival, Sam tells him that he wants to go to Oldtown to train at the Citadel to become a maester, so he can return and take the deceased Aemon's place as maester of Castle Black. Jon agrees to Sam's proposal and Sam sets off his journey to the Citadel. However becoming a trainee at the Citadel is not a cakewalk and hence the maesters at the Citadel gave Sam a problem to test his eligibility. \n\nInitially Sam has a list with a single element *n*. Then he has to perform certain operations on this list. In each operation Sam must remove any element *x*, such that *x*<=><=1, from the list and insert at the same position , , sequentially. He must continue with these operations until all the elements in the list are either 0 or 1.\n\nNow the masters want the total number of 1s in the range *l* to *r* (1-indexed). Sam wants to become a maester but unfortunately he cannot solve this problem. Can you help Sam to pass the eligibility test?",
"input": "",
"output": "```python\nn, l, r = map(int, input().split())\r\narr = [n]\r\ndef helper(n):\r\n if n <=1:\r\n return\r\n elif n>1:\r\n substitute = [n//2, n%2,n//2]\r\n i = arr.index(n)\r\n arr[i:i+1] = substitute\r\n helper(n//2)\r\n helper(n%2)\r\n helper(n//2)\r\nhelper(n)\r\n\r\nprint(sum(arr[l-1:r]))\r\n \r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given *n* numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given *n* numbers finds one that is different in evenness.",
"input": "",
"output": "```python\nn=int(input())\r\nl=list(map(int,input().split()))\r\neven,odd,evenind,oddind=0,0,0,0\r\nfor i in range(n):\r\n if (l[i]%2==0):\r\n even += 1\r\n evenind = i\r\n else:\r\n even -= 1\r\n oddind = i\r\nif(even > 0):\r\n print(oddind+1)\r\nelse:\r\n print(evenind+1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has become interested in wrestling. In wrestling wrestlers use techniques for which they are awarded points by judges. The wrestler who gets the most points wins.\n\nWhen the numbers of points of both wrestlers are equal, the wrestler whose sequence of points is lexicographically greater, wins.\n\nIf the sequences of the awarded points coincide, the wrestler who performed the last technique wins. Your task is to determine which wrestler won.",
"input": "",
"output": "```python\nimport math\r\nfrom decimal import *\r\nimport random\r\nmod = int(1e9)+7\r\n\r\nf, s = 0,0\r\nx, y= [],[]\r\nlast = -1\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n if(n>0):\r\n x.append(n)\r\n f+=n\r\n last = 1\r\n else:\r\n y.append(abs(n))\r\n s+=abs(n)\r\n last = 0\r\nif(f>s):\r\n print('first')\r\nif(s>f):\r\n print('second')\r\nif(s==f):\r\n if(len(x)>len(y)):\r\n fnd = True\r\n for i in range(len(y)):\r\n if(x[i]!=y[i]):\r\n fnd = False\r\n break\r\n if(fnd):\r\n print('first')\r\n else:\r\n fwin = True\r\n pnt=0\r\n while(pnty[pnt]):\r\n fwin = True\r\n break\r\n elif(x[pnt]==y[pnt]):\r\n pnt+=1\r\n else:\r\n fwin =False\r\n if(fwin and pnt!= len(y)):\r\n print('first')\r\n elif(not fwin and pnt!= len(y)):\r\n print('second')\r\n else:\r\n if(last):\r\n print('first')\r\n else:\r\n print('second')\r\n elif(len(y)>len(x)):\r\n fnd = True\r\n for i in range(len(x)):\r\n if(x[i]!=y[i]):\r\n fnd = False\r\n break\r\n if(fnd):\r\n print('second')\r\n else:\r\n fwin = True\r\n pnt=0\r\n while(pnty[pnt]):\r\n fwin = True\r\n break\r\n elif(x[pnt]==y[pnt]):\r\n pnt+=1\r\n else:\r\n fwin =False\r\n if(fwin and pnt!= len(y)):\r\n print('first')\r\n elif(not fwin and pnt!= len(y)):\r\n print('second')\r\n else:\r\n if(last):\r\n print('first')\r\n else:\r\n print('second') \r\n else:\r\n fwin = True\r\n pnt=0\r\n while(pnty[pnt]):\r\n fwin = True\r\n break\r\n elif(x[pnt]==y[pnt]):\r\n pnt+=1\r\n else:\r\n fwin =False\r\n if(fwin and pnt!= len(y)):\r\n print('first')\r\n elif(not fwin and pnt!= len(y)):\r\n print('second')\r\n else:\r\n if(last):\r\n print('first')\r\n else:\r\n print('second')\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pasha loves his phone and also putting his hair up... But the hair is now irrelevant.\n\nPasha has installed a new game to his phone. The goal of the game is following. There is a rectangular field consisting of *n* row with *m* pixels in each row. Initially, all the pixels are colored white. In one move, Pasha can choose any pixel and color it black. In particular, he can choose the pixel that is already black, then after the boy's move the pixel does not change, that is, it remains black. Pasha loses the game when a 2<=×<=2 square consisting of black pixels is formed. \n\nPasha has made a plan of *k* moves, according to which he will paint pixels. Each turn in his plan is represented as a pair of numbers *i* and *j*, denoting respectively the row and the column of the pixel to be colored on the current move.\n\nDetermine whether Pasha loses if he acts in accordance with his plan, and if he does, on what move the 2<=×<=2 square consisting of black pixels is formed.",
"input": "",
"output": "```python\nn,m,k=map(int,input().split());l=[];ans=0\r\nfor i in range(n+2):\r\n t=[]\r\n for j in range(m+2):\r\n t.append(0)\r\n l.append(t)\r\nfor i in range(k):\r\n p,q=map(int,input().split())\r\n l[p][q]=1\r\n if l[p-1][q-1]+l[p][q-1]+l[p-1][q]==3:\r\n ans=i+1;break\r\n if l[p-1][q]+l[p-1][q+1]+l[p][q]==3:\r\n ans=i+1;break\r\n if l[p][q-1]+l[p+1][q-1]+l[p+1][q]==3:\r\n ans=i+1;break\r\n if l[p][q+1]+l[p+1][q]+l[p+1][q+1]==3:\r\n ans=i+1;break\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.\n\nThere are *n* columns of toy cubes in the box arranged in a line. The *i*-th column contains *a**i* cubes. At first, the gravity in the box is pulling the cubes downwards. When Chris switches the gravity, it begins to pull all the cubes to the right side of the box. The figure shows the initial and final configurations of the cubes in the box: the cubes that have changed their position are highlighted with orange.\n\nGiven the initial configuration of the toy cubes in the box, find the amounts of cubes in each of the *n* columns after the gravity switch!",
"input": "",
"output": "```python\nn = input()\r\nli= list(map(int,input().split()))\r\nli.sort()\r\nfor i in li:\r\n print(i,end=\" \")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Elephant loves magic squares very much.\n\nA magic square is a 3<=×<=3 table, each cell contains some positive integer. At that the sums of integers in all rows, columns and diagonals of the table are equal. The figure below shows the magic square, the sum of integers in all its rows, columns and diagonals equals 15.\n\nThe Little Elephant remembered one magic square. He started writing this square on a piece of paper, but as he wrote, he forgot all three elements of the main diagonal of the magic square. Fortunately, the Little Elephant clearly remembered that all elements of the magic square did not exceed 105. \n\nHelp the Little Elephant, restore the original magic square, given the Elephant's notes.",
"input": "",
"output": "```python\na =[]\r\nfor i in range(3):\r\n\ta.append(list(map(int,input().split())))\r\n\r\nfor n in range(1,10**5):\r\n\ts = n+ a[0][1] + a[0][2]\r\n\tk = s - a[1][0] - a[1][2]\r\n\tw = s - a[2][0] - a[2][1]\r\n\tif n+k+w==s:\r\n\t\ta[0][0] = n\r\n\t\ta[1][1] = k\r\n\t\ta[2][2] = w\r\n\t\tbreak\r\nfor i in range(3):\r\n\tprint(*a[i])\r\n\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Valera runs a 24/7 fast food cafe. He magically learned that next day *n* people will visit his cafe. For each person we know the arrival time: the *i*-th person comes exactly at *h**i* hours *m**i* minutes. The cafe spends less than a minute to serve each client, but if a client comes in and sees that there is no free cash, than he doesn't want to wait and leaves the cafe immediately. \n\nValera is very greedy, so he wants to serve all *n* customers next day (and get more profit). However, for that he needs to ensure that at each moment of time the number of working cashes is no less than the number of clients in the cafe. \n\nHelp Valera count the minimum number of cashes to work at his cafe next day, so that they can serve all visitors.",
"input": "",
"output": "```python\nt=int(input())\r\ncash=1\r\ni=0\r\nM=[]\r\nfor j in range(t):\r\n L=list(map(int,input().split(\" \")))\r\n M.append(L)\r\n if j!=0:\r\n if M[j]==M[j-1]:\r\n i+=1\r\n else:\r\n i=0\r\n if i>=cash:\r\n cash+=1\r\nprint(cash)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "\"Hey, it's homework time\" — thought Polycarpus and of course he started with his favourite subject, IT. Polycarpus managed to solve all tasks but for the last one in 20 minutes. However, as he failed to solve the last task after some considerable time, the boy asked you to help him.\n\nThe sequence of *n* integers is called a permutation if it contains all integers from 1 to *n* exactly once.\n\nYou are given an arbitrary sequence *a*1,<=*a*2,<=...,<=*a**n* containing *n* integers. Each integer is not less than 1 and not greater than 5000. Determine what minimum number of elements Polycarpus needs to change to get a permutation (he should not delete or add numbers). In a single change he can modify any single sequence element (i. e. replace it with another integer).",
"input": "",
"output": "```python\nn = int(input())\r\nok = [False]*n\r\ninp = input().split(' ')\r\ncount = n\r\nfor i in inp:\r\n i = int(i)-1\r\n if not ok[i]:\r\n count -= 1\r\n ok[i] = True\r\nprint(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "$k$ people want to split $n$ candies between them. Each candy should be given to exactly one of them or be thrown away.\n\nThe people are numbered from $1$ to $k$, and Arkady is the first of them. To split the candies, Arkady will choose an integer $x$ and then give the first $x$ candies to himself, the next $x$ candies to the second person, the next $x$ candies to the third person and so on in a cycle. The leftover (the remainder that is not divisible by $x$) will be thrown away.\n\nArkady can't choose $x$ greater than $M$ as it is considered greedy. Also, he can't choose such a small $x$ that some person will receive candies more than $D$ times, as it is considered a slow splitting.\n\nPlease find what is the maximum number of candies Arkady can receive by choosing some valid $x$.",
"input": "",
"output": "```python\nn, k, M, D = map(int, input().split())\r\n\r\nans = 0\r\nfor i in range(1, D+1):\r\n\tx = n //((i-1)*k+1)\r\n\r\n\tif x <= M:\t\r\n\t\tans = max(ans, x*i)\r\n\r\nif n//k <= M:\r\n ans = max(ans, n//k)\r\nelse:\r\n ans = max(ans, M)\r\n\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Luba thinks about watering her garden. The garden can be represented as a segment of length *k*. Luba has got *n* buckets, the *i*-th bucket allows her to water some continuous subsegment of garden of length exactly *a**i* each hour. Luba can't water any parts of the garden that were already watered, also she can't water the ground outside the garden.\n\nLuba has to choose one of the buckets in order to water the garden as fast as possible (as mentioned above, each hour she will water some continuous subsegment of length *a**i* if she chooses the *i*-th bucket). Help her to determine the minimum number of hours she has to spend watering the garden. It is guaranteed that Luba can always choose a bucket so it is possible water the garden.\n\nSee the examples for better understanding.",
"input": "",
"output": "```python\nimport re\r\n\r\nx = input()\r\nres = 0\r\nlist_1 = re.split('\\s', x,0)\r\nm = int(list_1[0])\r\ny = int(list_1[1])\r\nres = 0\r\nstr = input()\r\nlist_2 = re.split('\\s',str,0)\r\nfor i in list_2:\r\n if y % int(i) == 0:\r\n res = int(i)\r\nprint(int(y / res))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a sequence *a* consisting of *n* integers. You may partition this sequence into two sequences *b* and *c* in such a way that every element belongs exactly to one of these sequences. \n\nLet *B* be the sum of elements belonging to *b*, and *C* be the sum of elements belonging to *c* (if some of these sequences is empty, then its sum is 0). What is the maximum possible value of *B*<=-<=*C*?",
"input": "",
"output": "```python\ninput()\r\na = sorted(list(map(int, input().split())))\r\nprint(a[-1] - a[0] if a[0] < 1 else sum(a))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Having watched the last Harry Potter film, little Gerald also decided to practice magic. He found in his father's magical book a spell that turns any number in the sum of its digits. At the moment Gerald learned that, he came across a number *n*. How many times can Gerald put a spell on it until the number becomes one-digit?",
"input": "",
"output": "```python\nn = input()\r\nc = 0\r\n\r\nwhile int(n) > 9:\r\n\ttemp = 0\r\n\r\n\tc += 1\r\n\r\n\tfor i in n :\r\n\t\ttemp += int(i)\r\n\r\n\tn = str(temp)\r\n\t# print(temp)\r\n\r\n\r\nprint(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer.\n\nAt the start of the day they have *x* ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and Gerda's house even in the night. Each person in the queue wants either to take several ice cream packs for himself and his friends or to give several ice cream packs to Kay and Gerda (carriers that bring ice cream have to stand in the same queue).\n\nIf a carrier with *d* ice cream packs comes to the house, then Kay and Gerda take all his packs. If a child who wants to take *d* ice cream packs comes to the house, then Kay and Gerda will give him *d* packs if they have enough ice cream, otherwise the child will get no ice cream at all and will leave in distress.\n\nKay wants to find the amount of ice cream they will have after all people will leave from the queue, and Gerda wants to find the number of distressed kids.",
"input": "",
"output": "```python\nn, x = list(map(int, input().split(' ')))\r\nd = 0\r\nfor i in range(n):\r\n a, b = input().split(' ')\r\n b = int(b)\r\n if a == '+':\r\n x += b\r\n elif a == '-' and b <= x:\r\n x -= b\r\n else:\r\n d += 1\r\nprint(x, d)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Artem got *n* stones on his birthday and now wants to give some of them to Masha. He knows that Masha cares more about the fact of receiving the present, rather than the value of that present, so he wants to give her stones as many times as possible. However, Masha remembers the last present she received, so Artem can't give her the same number of stones twice in a row. For example, he can give her 3 stones, then 1 stone, then again 3 stones, but he can't give her 3 stones and then again 3 stones right after that.\n\nHow many times can Artem give presents to Masha?",
"input": "",
"output": "```python\nn = int(input())\r\na = [1, 1]\r\nfor i in range(2, n):\r\n a.append(a[i - 1] + a[i - 2])\r\nprint(a[n - 1])\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word *s*. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word *s*.",
"input": "",
"output": "```python\ns = input()\r\na = []\r\nfor i in range(len(s)):\r\n if s[i] == 'h' and 1 not in a:\r\n a.append(1)\r\n elif s[i] == 'e' and a[-1] == 1:\r\n a.append(2)\r\n elif s[i] == 'l' and a[-1] == 2:\r\n a.append(3)\r\n elif s[i] == 'l' and a[-1] == 3:\r\n a.append(4)\r\n elif s[i] == 'o' and a[-1] == 4:\r\n a.append(5)\r\nif a[-1] == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "We consider a positive integer perfect, if and only if the sum of its digits is exactly $10$. Given a positive integer $k$, your task is to find the $k$-th smallest perfect positive integer.",
"input": "",
"output": "```python\n\r\n\r\nn = int(input())\r\ni = 10\r\nwhile n>0:\r\n i += 9\r\n if sum(map(int, str(i))) == 10: n-=1\r\nprint(i)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Nick is interested in prime numbers. Once he read about Goldbach problem. It states that every even integer greater than 2 can be expressed as the sum of two primes. That got Nick's attention and he decided to invent a problem of his own and call it Noldbach problem. Since Nick is interested only in prime numbers, Noldbach problem states that at least *k* prime numbers from 2 to *n* inclusively can be expressed as the sum of three integer numbers: two neighboring prime numbers and 1. For example, 19 = 7 + 11 + 1, or 13 = 5 + 7 + 1.\n\nTwo prime numbers are called neighboring if there are no other prime numbers between them.\n\nYou are to help Nick, and find out if he is right or wrong.",
"input": "",
"output": "```python\ndef f(rangeint):\r\n List = []\r\n for j in range(2, rangeint+1):\r\n List.append(j)\r\n \r\n z = 2*len(List)\r\n a = 0 \r\n for i in range(0, int(rangeint**(1/2))):\r\n \r\n a += 1\r\n \r\n \r\n m = List[a-1]\r\n\r\n for k in List:\r\n \r\n if k % m == 0 and k > m :\r\n List.remove(k)\r\n \r\n \r\n return List \r\n \r\n\r\ninnput = input()\r\ninputspl = innput.split()\r\nn = int(inputspl[0])\r\nk = int(inputspl[1])\r\ncounter = 0\r\nListprime = f(n)\r\nfor d in range(0, len(Listprime)-1):\r\n if ((Listprime[d]+Listprime[d+1]+1) in Listprime) and ((Listprime[d]+Listprime[d+1]+1) <= n):\r\n counter += 1\r\nif counter >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) reversely. For example, a Berlandish word code corresponds to a Birlandish word edoc. However, it's easy to make a mistake during the «translation». Vasya translated word *s* from Berlandish into Birlandish as *t*. Help him: find out if he translated the word correctly.",
"input": "",
"output": "```python\ns=input()\r\nt=input()\r\nl=len(s)\r\nf=0\r\nfor i in range(l):\r\n if s[i]!=t[l-i-1]:\r\n f=1\r\n break\r\nif f==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Caisa solved the problem with the sugar and now he is on the way back to home. \n\nCaisa is playing a mobile game during his path. There are (*n*<=+<=1) pylons numbered from 0 to *n* in this game. The pylon with number 0 has zero height, the pylon with number *i* (*i*<=><=0) has height *h**i*. The goal of the game is to reach *n*-th pylon, and the only move the player can do is to jump from the current pylon (let's denote its number as *k*) to the next one (its number will be *k*<=+<=1). When the player have made such a move, its energy increases by *h**k*<=-<=*h**k*<=+<=1 (if this value is negative the player loses energy). The player must have non-negative amount of energy at any moment of the time. \n\nInitially Caisa stand at 0 pylon and has 0 energy. The game provides a special opportunity: one can pay a single dollar and increase the height of anyone pylon by one. Caisa may use that opportunity several times, but he doesn't want to spend too much money. What is the minimal amount of money he must paid to reach the goal of the game?",
"input": "",
"output": "```python\n_ = input()\nl = list(map(int, input().split()))\n\nprint(max(l))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock.\n\nThe combination lock is represented by *n* rotating disks with digits from 0 to 9 written on them. Scrooge McDuck has to turn some disks so that the combination of digits on the disks forms a secret combination. In one move, he can rotate one disk one digit forwards or backwards. In particular, in one move he can go from digit 0 to digit 9 and vice versa. What minimum number of actions does he need for that?",
"input": "",
"output": "```python\nN = int(input())\r\norg = input()\r\nfin = input()\r\n\r\nsol = 0\r\nfor i in range(N):\r\n a, b = int(min(org[i],fin[i])), int(max(org[i],fin[i]))\r\n sol += min(abs(b-a), a+10-b)\r\nprint(sol)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Catherine has a deck of *n* cards, each of which is either red, green, or blue. As long as there are at least two cards left, she can do one of two actions: \n - take any two (not necessarily adjacent) cards with different colors and exchange them for a new card of the third color; - take any two (not necessarily adjacent) cards with the same color and exchange them for a new card with that color. \nShe repeats this process until there is only one card left. What are the possible colors for the final card?",
"input": "",
"output": "```python\nint(input())\r\nb=set(input())\r\nif len(b)==1:print(''.join(b))\r\nelif len(b)==2:print(*[i for i in 'GRB' if i not in b])\r\nelse:print('B')\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.\n\nYou know two languages, and the professor is giving the lecture in the first one. The words in both languages consist of lowercase English characters, each language consists of several words. For each language, all words are distinct, i.e. they are spelled differently. Moreover, the words of these languages have a one-to-one correspondence, that is, for each word in each language, there exists exactly one word in the other language having has the same meaning.\n\nYou can write down every word the professor says in either the first language or the second language. Of course, during the lecture you write down each word in the language in which the word is shorter. In case of equal lengths of the corresponding words you prefer the word of the first language.\n\nYou are given the text of the lecture the professor is going to read. Find out how the lecture will be recorded in your notes.",
"input": "",
"output": "```python\nn,m = map(int,input().split())\r\n\r\na = []\r\nb = []\r\nans = []\r\n\r\nfor i in range(0,m):\r\n w1,w2 = [str(x) for x in input().split()]\r\n a.append(w1)\r\n b.append(w2)\r\n\r\ns = input()\r\ns = s.split()\r\n\r\n\r\nfor word in s:\r\n cnt = a.index(word)\r\n if len(a[cnt]) <= len(b[cnt]):\r\n ans.append(a[cnt])\r\n else:\r\n ans.append(b[cnt])\r\n\r\nprint(\" \".join(ans))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Our brave travelers reached an island where pirates had buried treasure. However as the ship was about to moor, the captain found out that some rat ate a piece of the treasure map.\n\nThe treasure map can be represented as a rectangle *n*<=×<=*m* in size. Each cell stands for an islands' square (the square's side length equals to a mile). Some cells stand for the sea and they are impenetrable. All other cells are penetrable (i.e. available) and some of them contain local sights. For example, the large tree on the hills or the cave in the rocks.\n\nBesides, the map also has a set of *k* instructions. Each instruction is in the following form:\n\n\"Walk *n* miles in the *y* direction\"\n\nThe possible directions are: north, south, east, and west. If you follow these instructions carefully (you should fulfill all of them, one by one) then you should reach exactly the place where treasures are buried. \n\nUnfortunately the captain doesn't know the place where to start fulfilling the instructions — as that very piece of the map was lost. But the captain very well remembers that the place contained some local sight. Besides, the captain knows that the whole way goes through the island's penetrable squares.\n\nThe captain wants to know which sights are worth checking. He asks you to help him with that.",
"input": "",
"output": "```python\nprint(\"_RANDOM_GUESS_1689180180.4521961\")# 1689180180.4522119\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vanya and his friends are walking along the fence of height *h* and they do not want the guard to notice them. In order to achieve this the height of each of the friends should not exceed *h*. If the height of some person is greater than *h* he can bend down and then he surely won't be noticed by the guard. The height of the *i*-th person is equal to *a**i*.\n\nConsider the width of the person walking as usual to be equal to 1, while the width of the bent person is equal to 2. Friends want to talk to each other while walking, so they would like to walk in a single row. What is the minimum width of the road, such that friends can walk in a row and remain unattended by the guard?",
"input": "",
"output": "```python\nn = input().split()\r\na = input().split()\r\nMP=0\r\nfor i in range(0,int(n[0])):\r\n if int(a[i]) > int(n[1]) :\r\n MP+=2\r\n else:\r\n MP+=1\r\n\r\nprint(MP)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "On his trip to Luxor and Aswan, Sagheer went to a Nubian market to buy some souvenirs for his friends and relatives. The market has some strange rules. It contains *n* different items numbered from 1 to *n*. The *i*-th item has base cost *a**i* Egyptian pounds. If Sagheer buys *k* items with indices *x*1,<=*x*2,<=...,<=*x**k*, then the cost of item *x**j* is *a**x**j*<=+<=*x**j*·*k* for 1<=≤<=*j*<=≤<=*k*. In other words, the cost of an item is equal to its base cost in addition to its index multiplied by the factor *k*.\n\nSagheer wants to buy as many souvenirs as possible without paying more than *S* Egyptian pounds. Note that he cannot buy a souvenir more than once. If there are many ways to maximize the number of souvenirs, he will choose the way that will minimize the total cost. Can you help him with this task?",
"input": "",
"output": "```python\nn, s = map(int, input().split())\r\nv = list(map(int, input().split()))\r\n#for i in range(n):\r\nr = n + 1\r\nl = 0\r\no = 0\r\nwhile r - l != 1:\r\n s1 = s\r\n b = []\r\n t = True\r\n for i in range(n):\r\n b.append(v[i] + (i + 1) * ((r + l) // 2))\r\n b.sort()\r\n i = 0\r\n sum = 0\r\n for i in range((r + l) // 2):\r\n sum += b[i]\r\n if sum <= s:\r\n l = (r + l) // 2\r\n o = sum\r\n else:\r\n r = (r + l) // 2\r\n s = s1\r\nprint(l, o)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.\n\nWe can think Central Perk as coordinate plane. There are *n* bottles on the ground, the *i*-th bottle is located at position (*x**i*,<=*y**i*). Both Adil and Bera can carry only one bottle at once each. \n\nFor both Adil and Bera the process looks as follows: \n 1. Choose to stop or to continue to collect bottles. 1. If the choice was to continue then choose some bottle and walk towards it. 1. Pick this bottle and walk to the recycling bin. 1. Go to step 1. \nAdil and Bera may move independently. They are allowed to pick bottles simultaneously, all bottles may be picked by any of the two, it's allowed that one of them stays still while the other one continues to pick bottles.\n\nThey want to organize the process such that the total distance they walk (the sum of distance walked by Adil and distance walked by Bera) is minimum possible. Of course, at the end all bottles should lie in the recycling bin.",
"input": "",
"output": "```python\nimport math\r\nAx , Ay , Bx , By , Rx , Ry = map(int,input().split())\r\na , b = [100009] , [100009]\r\nmaxDis ,mDx,mDy ,res ,mx , my ,minDis,x1,y1= 0,0,0,0,0,0,10000000000,0,0\r\nn = int(input())\r\nfor i in range(n):\r\n x , y = map(int,input().split())\r\n a.append(x)\r\n b.append(y)\r\n d = math.dist([x,y] , [Rx,Ry])\r\n if d > maxDis:\r\n maxDis = d\r\n mDx = x\r\n mDy = y\r\n res += 2 * d\r\nd1 = math . dist([mDx , mDy] , [Ax , Ay])\r\nd2 = math . dist([mDx , mDy] , [Bx , By])\r\nif d1 < d2 :\r\n mx = Bx\r\n my = By\r\nelse:\r\n mx = Ax\r\n my = Ay\r\nres +=min(d1,d2)\r\nres -= math . dist([mDx , mDy] , [Rx , Ry])\r\nfor i in range(1,n+1):\r\n x = a[i]\r\n y = b[i]\r\n d = math.dist([x,y] , [mx,my])\r\n if d abc:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.\n\nEmbosser is a special devise that allows to \"print\" the text of a plastic tape. Text is printed sequentially, character by character. The device consists of a wheel with a lowercase English letters written in a circle, static pointer to the current letter and a button that print the chosen letter. At one move it's allowed to rotate the alphabetic wheel one step clockwise or counterclockwise. Initially, static pointer points to letter 'a'. Other letters are located as shown on the picture:\n\nAfter Grigoriy add new item to the base he has to print its name on the plastic tape and attach it to the corresponding exhibit. It's not required to return the wheel to its initial position with pointer on the letter 'a'.\n\nOur hero is afraid that some exhibits may become alive and start to attack him, so he wants to print the names as fast as possible. Help him, for the given string find the minimum number of rotations of the wheel required to print it.",
"input": "",
"output": "```python\nn=input()\r\nrotations=0\r\nstarting_point=\"a\"\r\nfor i in n:\r\n r=(abs(ord(i)-ord(starting_point)))%26\r\n if r>13:\r\n rotations+=26-r\r\n else:\r\n rotations+=r\r\n starting_point=i\r\nprint(rotations)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "*n* soldiers stand in a circle. For each soldier his height *a**i* is known. A reconnaissance unit can be made of such two neighbouring soldiers, whose heights difference is minimal, i.e. |*a**i*<=-<=*a**j*| is minimal. So each of them will be less noticeable with the other. Output any pair of soldiers that can form a reconnaissance unit.",
"input": "",
"output": "```python\nn = int(input())\r\na = list(map(int, input().split()))\r\nx = 99999\r\nfor i in range(n):\r\n if abs(a[i] - a[(i+1)%n]) < x:\r\n x = abs(a[i%n] - a[(i+1)%n])\r\n x1 = i%n\r\n x2 = (i+1)%n\r\n\r\nprint(x1, x2, sep=\" \")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any longer, so he decided to get some food in the house.\n\nKarlsson's gaze immediately fell on *n* wooden cupboards, standing in the kitchen. He immediately realized that these cupboards have hidden jam stocks. Karlsson began to fly greedily around the kitchen, opening and closing the cupboards' doors, grab and empty all the jars of jam that he could find.\n\nAnd now all jars of jam are empty, Karlsson has had enough and does not want to leave traces of his stay, so as not to let down his friend. Each of the cupboards has two doors: the left one and the right one. Karlsson remembers that when he rushed to the kitchen, all the cupboards' left doors were in the same position (open or closed), similarly, all the cupboards' right doors were in the same position (open or closed). Karlsson wants the doors to meet this condition as well by the time the family returns. Karlsson does not remember the position of all the left doors, also, he cannot remember the position of all the right doors. Therefore, it does not matter to him in what position will be all left or right doors. It is important to leave all the left doors in the same position, and all the right doors in the same position. For example, all the left doors may be closed, and all the right ones may be open.\n\nKarlsson needs one second to open or close a door of a cupboard. He understands that he has very little time before the family returns, so he wants to know the minimum number of seconds *t*, in which he is able to bring all the cupboard doors in the required position.\n\nYour task is to write a program that will determine the required number of seconds *t*.",
"input": "",
"output": "```python\nn = int(input())\r\nleft_open = 0\r\nright_open = 0\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n left_open += l\r\n right_open += r\r\ncase1 = min(left_open, n - left_open) + min(right_open, n - right_open)\r\ncase2 = min(left_open, n - left_open) + min(right_open, n - right_open) + abs(left_open - right_open)\r\nprint(min(case1, case2))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The ship crashed into a reef and is sinking. Now the entire crew must be evacuated. All *n* crew members have already lined up in a row (for convenience let's label them all from left to right with positive integers from 1 to *n*) and await further instructions. However, one should evacuate the crew properly, in a strict order. Specifically:\n\nThe first crew members to leave the ship are rats. Then women and children (both groups have the same priority) leave the ship. After that all men are evacuated from the ship. The captain leaves the sinking ship last.\n\nIf we cannot determine exactly who should leave the ship first for any two members of the crew by the rules from the previous paragraph, then the one who stands to the left in the line leaves the ship first (or in other words, the one whose number in the line is less).\n\nFor each crew member we know his status as a crew member, and also his name. All crew members have different names. Determine the order in which to evacuate the crew.",
"input": "",
"output": "```python\ndict={}\r\nd={'captain':4,'man':3,'child':2,'woman':2,'rat':1}\r\nn=int(input())\r\nfor i in range(n):\r\n ip=list(map(str,input().split(' ')))\r\n name=ip[0]\r\n dict[name]=d[ip[1]]\r\nfor i in sorted(dict.items(), key=lambda kv:(kv[1], kv[0])):\r\n print(i[0])\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Travelling Salesman spends a lot of time travelling so he tends to get bored. To pass time, he likes to perform operations on numbers. One such operation is to take a positive integer *x* and reduce it to the number of bits set to 1 in the binary representation of *x*. For example for number 13 it's true that 1310<==<=11012, so it has 3 bits set and 13 will be reduced to 3 in one operation.\n\nHe calls a number special if the minimum number of operations to reduce it to 1 is *k*.\n\nHe wants to find out how many special numbers exist which are not greater than *n*. Please help the Travelling Salesman, as he is about to reach his destination!\n\nSince the answer can be large, output it modulo 109<=+<=7.",
"input": "",
"output": "```python\nMX = 1030\r\nM = 1000 * 1000 * 1000 + 7\r\nc = [[0] * MX for i in range(MX)]\r\nfor i in range(MX):\r\n c[i][0] = 1\r\nfor i in range(1, MX):\r\n for j in range(1, MX):\r\n c[i][j] = c[i - 1][j] + c[i - 1][j - 1]\r\n c[i][j] %= M\r\n \r\nnum = list(map(int, list(input())))\r\ncnt = int(input())\r\ndp = [0] * MX\r\nfor i in range(2, MX):\r\n dp[i] = dp[bin(i).count('1')] + 1\r\n \r\nif cnt == 0:\r\n print(1)\r\n exit()\r\n \r\nres = 0\r\n \r\nfor i in range(1, MX):\r\n if dp[i] != cnt - 1: continue\r\n n = len(num) - 1\r\n k = i\r\n for pos in range(len(num)):\r\n if num[pos] == 1:\r\n # print(n, k)\r\n #if we put 0 here\r\n res += c[n][k]\r\n res %= M\r\n k -= 1\r\n n -= 1 \r\n # print(k) \r\n if n == -1 and k == 0:\r\n res += 1\r\nif cnt == 1: res -= 1\r\nprint(res)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You're given a list of *n* strings *a*1,<=*a*2,<=...,<=*a**n*. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest.\n\nGiven the list of strings, output the lexicographically smallest concatenation.",
"input": "",
"output": "```python\n\r\ndef function():\r\n temp=input().split()\r\n customers=int(temp[0])\r\n cost=int(temp[1])\r\n custArray=[]\r\n for customer in range(customers):\r\n temp=input()\r\n custArray.append(temp)\r\n apples=0\r\n profit=0\r\n for index in range(customers):\r\n if(custArray[customers-1-index]=='half'):\r\n if(apples==0):\r\n apples=1\r\n profit=cost\r\n else:\r\n profit+=cost*apples\r\n apples=2*apples\r\n else:\r\n if(apples==0):\r\n apples=1\r\n profit=cost/2\r\n else:\r\n profit+=(apples+.5)*cost\r\n apples=apples*2+1\r\n return int(profit)\r\n\r\ndef concat():\r\n size=int(input())\r\n stringArray=[]\r\n for temp in range(size):\r\n stringArray.append(input())\r\n superString=''\r\n for index in range(len(stringArray)):\r\n if superString=='':\r\n superString=stringArray[index]\r\n else:\r\n if superString.find(stringArray[index])==-1:\r\n flag=False\r\n for innerIndex in range (len(stringArray[index])):\r\n if(superString[-(len(stringArray[index])-1-innerIndex):]==stringArray[index][:len(stringArray[index])-1-innerIndex]):\r\n superString+=stringArray[index][len(stringArray[index])-1-innerIndex:]\r\n flag=True\r\n break\r\n if(not flag):\r\n superString+=stringArray[index]\r\n return superString\r\n \r\n\r\n'''\r\ndef lcmString():\r\n temp=input().split()\r\n size=int(temp[0])\r\n m=int(temp[1])\r\n temp=input().split()\r\n for index in range(len(temp)):\r\n if \r\n'''\r\nprint(concat())\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "DZY loves collecting special strings which only contain lowercase letters. For each lowercase letter *c* DZY knows its value *w**c*. For each special string *s*<==<=*s*1*s*2... *s*|*s*| (|*s*| is the length of the string) he represents its value with a function *f*(*s*), where \n\nNow DZY has a string *s*. He wants to insert *k* lowercase letters into this string in order to get the largest possible value of the resulting string. Can you help him calculate the largest possible value he could get?",
"input": "",
"output": "```python\ns=input()\r\nk=int(input())\r\nw=list(map(int,input().split()))\r\ns=list(s)\r\nq=0\r\nfor i in range(len(s)):\r\n q=q+(i+1)*w[i]\r\na=max(w)\r\nb=len(s)+1\r\nfor i in range(k):\r\n q=q+b*a\r\n b=b+1\r\nprint(q)\r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given *n* numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given *n* numbers finds one that is different in evenness.",
"input": "",
"output": "```python\n#25A IQ Test\r\nimport sys\r\nimport math\r\n\r\ninputs = int(input())\r\ninput2 = sys.stdin.readline().split()\r\ni = 0\r\na = 0\r\nb = 0\r\n\r\nif inputs == 2:\r\n print(\"1\")\r\n sys.exit()\r\n\r\nfor i in range(inputs):\r\n if int(input2[i])%2 == 0:\r\n \r\n a = a + 1\r\n else:\r\n b = b + 1\r\n \r\n\r\nif a>b: #Even\r\n for i in range(inputs):\r\n if int(input2[i])%2 == 1:\r\n print(i + 1)\r\nelse: #Even\r\n for i in range(inputs):\r\n if int(input2[i])%2 == 0:\r\n print(i + 1)\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently, Mike was very busy with studying for exams and contests. Now he is going to chill a bit by doing some sight seeing in the city.\n\nCity consists of *n* intersections numbered from 1 to *n*. Mike starts walking from his house located at the intersection number 1 and goes along some sequence of intersections. Walking from intersection number *i* to intersection *j* requires |*i*<=-<=*j*| units of energy. The total energy spent by Mike to visit a sequence of intersections *p*1<==<=1,<=*p*2,<=...,<=*p**k* is equal to units of energy.\n\nOf course, walking would be boring if there were no shortcuts. A shortcut is a special path that allows Mike walking from one intersection to another requiring only 1 unit of energy. There are exactly *n* shortcuts in Mike's city, the *i**th* of them allows walking from intersection *i* to intersection *a**i* (*i*<=≤<=*a**i*<=≤<=*a**i*<=+<=1) (but not in the opposite direction), thus there is exactly one shortcut starting at each intersection. Formally, if Mike chooses a sequence *p*1<==<=1,<=*p*2,<=...,<=*p**k* then for each 1<=≤<=*i*<=<<=*k* satisfying *p**i*<=+<=1<==<=*a**p**i* and *a**p**i*<=≠<=*p**i* Mike will spend only 1 unit of energy instead of |*p**i*<=-<=*p**i*<=+<=1| walking from the intersection *p**i* to intersection *p**i*<=+<=1. For example, if Mike chooses a sequence *p*1<==<=1,<=*p*2<==<=*a**p*1,<=*p*3<==<=*a**p*2,<=...,<=*p**k*<==<=*a**p**k*<=-<=1, he spends exactly *k*<=-<=1 units of total energy walking around them.\n\nBefore going on his adventure, Mike asks you to find the minimum amount of energy required to reach each of the intersections from his home. Formally, for each 1<=≤<=*i*<=≤<=*n* Mike is interested in finding minimum possible total energy of some sequence *p*1<==<=1,<=*p*2,<=...,<=*p**k*<==<=*i*.",
"input": "",
"output": "```python\nfrom collections import defaultdict\r\n\r\nclass Graph:\r\n def __init__(self):\r\n self.node=set()\r\n self.edges= defaultdict(list)\r\n self.distance={}\r\n\r\n def addNode(self,value):\r\n self.node.add(value)\r\n\r\n def addEdge(self,start,end,distance):\r\n self.edges[start].append(end)\r\n self.distance[(start,end)]=distance\r\n\r\n\r\ndef dij(graph,ini):\r\n visited={ini:0}\r\n path= defaultdict(list)\r\n nodes=set(graph.node)\r\n\r\n while nodes:\r\n minNode=None\r\n for node in nodes:\r\n if node in visited:\r\n if(minNode is None):\r\n minNode=node\r\n elif(visited[node] 0:\n # pega o valor medio, valores entre (m+1)/2 até m\n print(str(int((m+i%m+1)/2)))\n else:\n # Pega o valor médio que seja menor ou igual a metade de m.\n # Portanto valores entre 1 até m/2\n print(str(int((m-(i%m))/2)))\n \t\t \t\t\t\t\t \t\t\t\t \t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.\n\nUnfortunately, not all numbers are lucky. Petya calls a number nearly lucky if the number of lucky digits in it is a lucky number. He wonders whether number *n* is a nearly lucky number.",
"input": "",
"output": "```python\nn = input()\r\n\r\nif n.count('4') + n.count('7') in [4,7]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) reversely. For example, a Berlandish word code corresponds to a Birlandish word edoc. However, it's easy to make a mistake during the «translation». Vasya translated word *s* from Berlandish into Birlandish as *t*. Help him: find out if he translated the word correctly.",
"input": "",
"output": "```python\ntext = str(input())\r\ntext2 = str(input())\r\nif text2 == text[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coordinate axes and two opposite vertices lay in the points (0,<=0,<=0) and (1,<=1,<=1). Two flies live on the planet. At the moment they are sitting on two different vertices of the cubical planet. Your task is to determine whether they see each other or not. The flies see each other when the vertices they occupy lie on the same face of the cube.",
"input": "",
"output": "```python\nif (int(input()[::2], 2) + int(input()[::2], 2)) == 7:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A burglar got into a matches warehouse and wants to steal as many matches as possible. In the warehouse there are *m* containers, in the *i*-th container there are *a**i* matchboxes, and each matchbox contains *b**i* matches. All the matchboxes are of the same size. The burglar's rucksack can hold *n* matchboxes exactly. Your task is to find out the maximum amount of matches that a burglar can carry away. He has no time to rearrange matches in the matchboxes, that's why he just chooses not more than *n* matchboxes so that the total amount of matches in them is maximal.",
"input": "",
"output": "```python\nn,m=map(int,input().split())\r\nl=[]\r\nfor i in range(m):\r\n l.append(list(map(int,input().split())))\r\nl.sort(key= lambda x : (x[1],x[0]), reverse= True)\r\nprint(l)\r\nans=0\r\nfor i in l:\r\n a=min(n,i[0])\r\n ans+=a*i[1]\r\n n-=a\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In Aramic language words can only represent objects.\n\nWords in Aramic have special properties: \n - A word is a root if it does not contain the same letter more than once. - A root and all its permutations represent the same object. - The root $x$ of a word $y$ is the word that contains all letters that appear in $y$ in a way that each letter appears once. For example, the root of \"aaaa\", \"aa\", \"aaa\" is \"a\", the root of \"aabb\", \"bab\", \"baabb\", \"ab\" is \"ab\". - Any word in Aramic represents the same object as its root. \nYou have an ancient script in Aramic. What is the number of different objects mentioned in the script?",
"input": "",
"output": "```python\nn = int(input())\r\na = input().split()\r\nb = set()\r\nfor i in a:\r\n c = [0] * 37\r\n for j in i:\r\n c[ord(j) - ord('a')] = 1\r\n now = 0\r\n p = 37\r\n for j in range(26):\r\n if c[j] == 1:\r\n now += p * (j + 1)\r\n p *= 37\r\n b.add(now)\r\nprint(len(b))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Misha and Andrew were playing a very simple game. First, each player chooses an integer in the range from 1 to *n*. Let's assume that Misha chose number *m*, and Andrew chose number *a*.\n\nThen, by using a random generator they choose a random integer *c* in the range between 1 and *n* (any integer from 1 to *n* is chosen with the same probability), after which the winner is the player, whose number was closer to *c*. The boys agreed that if *m* and *a* are located on the same distance from *c*, Misha wins.\n\nAndrew wants to win very much, so he asks you to help him. You know the number selected by Misha, and number *n*. You need to determine which value of *a* Andrew must choose, so that the probability of his victory is the highest possible.\n\nMore formally, you need to find such integer *a* (1<=≤<=*a*<=≤<=*n*), that the probability that is maximal, where *c* is the equiprobably chosen integer from 1 to *n* (inclusive).",
"input": "",
"output": "```python\nimport sys, collections, bisect, heapq, functools, itertools, math\r\ninput = sys.stdin.readline\r\n\r\nn, m = [int(x) for x in input().split()]\r\n\r\nif n - m > m - 1:\r\n print(min(n, m + 1))\r\nelse:\r\n print(max(1, m - 1))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Amr loves Geometry. One day he came up with a very interesting problem.\n\nAmr has a circle of radius *r* and center in point (*x*,<=*y*). He wants the circle center to be in new position (*x*',<=*y*').\n\nIn one step Amr can put a pin to the border of the circle in a certain point, then rotate the circle around that pin by any angle and finally remove the pin.\n\nHelp Amr to achieve his goal in minimum number of steps.",
"input": "",
"output": "```python\nimport math\r\n \r\nr,x0,y0,x1,y1=map(int,input().split())\r\nd = math.sqrt((x1-x0)^2+(y1-y0)^2)\r\ns = d/(r<<1)\r\nprint(math.ceil(s))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Dima and his friends have been playing hide and seek at Dima's place all night. As a result, Dima's place got messy. In the morning they decided that they need to clean the place.\n\nTo decide who exactly would clean the apartment, the friends want to play a counting-out game. First, all the guys stand in a circle, and then each of them shows some number of fingers on one hand (one to five), and then the boys count in a circle, starting from Dima, the number of people, respective to the total number of fingers shown. The person on who the countdown stops will clean the apartment.\n\nFor example, if Dima and one of his friends played hide and seek, and 7 fingers were shown during the counting-out, then Dima would clean the place. If there were 2 or say, 8 fingers shown, then his friend would clean the place.\n\nDima knows how many fingers each of his friends will show during the counting-out. Now he is interested in the number of ways to show some number of fingers on one hand (one to five), so that he did not have to clean the place. Help Dima.",
"input": "",
"output": "```python\nn = int(input())\ntotal = 0\nz = [x for x in map(int,input().split())]\nfor i in z:\n total += i\nanswer = 0\nfor i in range(1,5+1):\n if(total+i) % (n+1) != 1:\n answer += 1\nprint(answer)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest. \n\nIn total, *n* students will attend, and before the start, every one of them has some positive integer rating. Students are indexed from 1 to *n*. Let's denote the rating of *i*-th student as *a**i*. After the contest ends, every student will end up with some positive integer position. GukiZ expects that his students will take places according to their ratings. \n\nHe thinks that each student will take place equal to . In particular, if student *A* has rating strictly lower then student *B*, *A* will get the strictly better position than *B*, and if two students have equal ratings, they will share the same position. \n\nGukiZ would like you to reconstruct the results by following his expectations. Help him and determine the position after the end of the contest for each of his students if everything goes as expected.",
"input": "",
"output": "```python\nfrom sys import stdin\n\nn=int(stdin.readline())\na=[int(x) for x in stdin.readline().split()]\nfor i in range(n):\n c=0\n for j in range(n):\n if a[i]q):\r\n print((n//a)*p+(n//b)*q-(n//x)*q)\r\nelse:\r\n print((n//a)*p+(n//b)*q-(n//x)*p)\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a \"crime\" and find out what is happening. He can ask any questions whatsoever that can be answered with \"Yes\" or \"No\". All the rest agree beforehand to answer the questions like that: if the question’s last letter is a vowel, they answer \"Yes\" and if the last letter is a consonant, they answer \"No\". Of course, the sleuth knows nothing about it and his task is to understand that.\n\nUnfortunately, Vasya is not very smart. After 5 hours of endless stupid questions everybody except Vasya got bored. That’s why Vasya’s friends ask you to write a program that would give answers instead of them.\n\nThe English alphabet vowels are: A, E, I, O, U, Y\n\nThe English alphabet consonants are: B, C, D, F, G, H, J, K, L, M, N, P, Q, R, S, T, V, W, X, Z",
"input": "",
"output": "```python\nf = str(input())\ng = f[::-1]\ng = g.lower()\ng= g.replace(\"?\",\" \")\nl1= ['a','e','y','i','o','u']\nx=0\nl = ''\nfor y in g:\n if ord(y) in range(97,123):\n l =y\n break\n else:\n pass\n\nif l in l1:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Hongcow really likes the color red. Hongcow doesn't like the color blue.\n\nHongcow is standing in an infinite field where there are *n* red points and *m* blue points.\n\nHongcow wants to draw a circle in the field such that this circle contains at least one red point, and no blue points. Points that line exactly on the boundary of the circle can be counted as either inside or outside.\n\nCompute the radius of the largest circle that satisfies this condition. If this circle can have arbitrarily large size, print <=-<=1. Otherwise, your answer will be accepted if it has relative or absolute error at most 10<=-<=4.",
"input": "",
"output": "```python\n\nimport itertools\nred = []\nblue = []\n\ninput_ = input()\nx = input_.split(\" \")\ni = 0\nj = 0\npoints = []\n#blue = []\nwhile i < int(x[0]):\n k = input()\n points.append(k)\n red.append(k)\n i+=1\nwhile j < int(x[1]):\n l = input()\n points.append(l)\n blue.append(l)\n j+=1\n# print(\"red: \",red)\n# print(\"blue: \",blue)\n# print(\"points: \",points)\n\ndef GetRadandCenter(x):\n x1, y1, x2, y2, x3, y3 = map(float, x.split(\" \"))\n c = (x1-x2)**2 + (y1-y2)**2\n a = (x2-x3)**2 + (y2-y3)**2\n b = (x3-x1)**2 + (y3-y1)**2\n s = 2*(a*b + b*c + c*a) - (a*a + b*b + c*c) \n if s == 0:\n return -1,1,1\n else:\n px = (a*(b+c-a)*x1 + b*(c+a-b)*x2 + c*(a+b-c)*x3) / s\n py = (a*(b+c-a)*y1 + b*(c+a-b)*y2 + c*(a+b-c)*y3) / s \n ar = a**0.5\n br = b**0.5\n cr = c**0.5 \n r = ar*br*cr / ((ar+br+cr)*(-ar+br+cr)*(ar-br+cr)*(ar+br-cr))**0.5\n return r,px,py\n\n#Create all possible permutations\nperm = []\nfor comb in itertools.combinations(points, 3):\n perm.append(comb)\n# print(\"perm: \",perm)\n\nvalidity = []\nradii = []\n\n#Special case if no limit\nfor z in red:\n for q in blue:\n # print(\"---------------\")\n # print(\"red: \",z)\n # print(\"blue: \",q)\n # print(\"blue whole list: \",blue)\n side1 = \"No\"\n side2 = \"No\"\n # other_blue = blue\n # other_blue.remove(q)\n # print(\"q: \",q)\n z_temp = z.split(\" \")\n x1 = int(z_temp[0])\n y1 = int(z_temp[1])\n q_temp = q.split(\" \")\n x2 = int(q_temp[0])\n y2 = int(q_temp[1])\n if (x2 - x1) == 0:\n side1,side2 = \"Yes\",\"Yes\"\n continue\n slope = (y2 - y1)/(x2 - x1)\n b = y1 - slope*x1\n for o in blue:\n o_temp = o.split(\" \")\n x3 = int(o_temp[0])\n y3 = int(o_temp[1])\n # print(\"Test Coordinates: \", x3,y3)\n if y3 > slope*x3 + b:\n side1 = \"Yes\"\n # print(\"Blue point: \", o)\n if y3 < slope*x3 + b:\n side2 = \"Yes\"\n # print(\"Blue point: \", o)\n # print(\"side1: \", side1)\n # print(\"side2: \", side2)\n if side1 == \"No\" or side2 == \"No\":\n print(\"-1\")\n else:\n \n #If red is not included, check if red is inside\n for t in perm:\n status = \"Invalid\"\n r,px,py = GetRadandCenter(t[0]+\" \"+t[1]+\" \"+t[2])\n # print(\"------------------------\")\n # print(\"radius: \",r)\n # print(\"center: \",px,py)\n # print(\"points: \", t)\n #Check if arc contains a red point\n for u in t:\n if u in red:\n status = \"Valid\"\n break\n #Check if any red is inside it\n if status == \"Invalid\":\n for m in red:\n m = m.split(\" \")\n x = int(m[0])\n y = int(m[1])\n # print(x,y,px,py,r)\n if ((x-int(px))**2) +((y-int(py))**2) <= int(r)**2:\n status = \"Valid\"\n break\n #Check if there are any blue dots within the circle\n if status == \"Valid\":\n for c in blue:\n if c in t:\n continue\n c = c.split(\" \")\n x = int(c[0])\n y = int(c[1])\n if int(((x-int(px))**2) +((y-int(py))**2)) < int(int(r)**2):\n status = \"Invalid\"\n # print(\"x,y: \",x,y)\n # print(\"LHS: \",((x-int(px))**2) +((y-int(py))**2))\n # print(\"RHS: \",int(r)**2 )\n break\n if status == \"Invalid\":\n r = -1\n # print(status)\n validity.append(status)\n radii.append(r)\n # print(validity)\n # print(radii)\n print(max(radii))\n exit()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Robber Girl likes to scare animals in her zoo for fun. She decided to arrange the animals in a row in the order of non-decreasing height. However, the animals were so scared that they couldn't stay in the right places.\n\nThe robber girl was angry at first, but then she decided to arrange the animals herself. She repeatedly names numbers *l* and *r* such that *r*<=-<=*l*<=+<=1 is even. After that animals that occupy positions between *l* and *r* inclusively are rearranged as follows: the animal at position *l* swaps places with the animal at position *l*<=+<=1, the animal *l*<=+<=2 swaps with the animal *l*<=+<=3, ..., finally, the animal at position *r*<=-<=1 swaps with the animal *r*.\n\nHelp the robber girl to arrange the animals in the order of non-decreasing height. You should name at most 20<=000 segments, since otherwise the robber girl will become bored and will start scaring the animals again.",
"input": "",
"output": "```python\ndef solve(a):\r\n segments = []\r\n while True:\r\n changed = False\r\n\r\n for i in range(len(a) - 1):\r\n if a[i] > a[i + 1]:\r\n a[i], a[i + 1] = a[i + 1], a[i]\r\n\r\n segments.append(f\"{i + 1} {i + 2}\")\r\n changed = True\r\n\r\n if not changed:\r\n break\r\n\r\n return \"\\n\".join(segments)\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n result = solve(a)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number *a* and Antisimon receives number *b*. They also have a heap of *n* stones. The players take turns to make a move and Simon starts. During a move a player should take from the heap the number of stones equal to the greatest common divisor of the fixed number he has received and the number of stones left in the heap. A player loses when he cannot take the required number of stones (i. e. the heap has strictly less stones left than one needs to take). \n\nYour task is to determine by the given *a*, *b* and *n* who wins the game.",
"input": "",
"output": "```python\nfor t in range(int(input())):\r\n\r\n a,b,c = map(int, input().split())\r\n\r\n if c%2==0:\r\n print(1)\r\n else:\r\n print(0)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The School №0 of the capital of Berland has *n* children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each child we know value *t**i*:\n - *t**i*<==<=1, if the *i*-th child is good at programming, - *t**i*<==<=2, if the *i*-th child is good at maths, - *t**i*<==<=3, if the *i*-th child is good at PE \nEach child happens to be good at exactly one of these three subjects.\n\nThe Team Scientific Decathlon Olympias requires teams of three students. The school teachers decided that the teams will be composed of three children that are good at different subjects. That is, each team must have one mathematician, one programmer and one sportsman. Of course, each child can be a member of no more than one team.\n\nWhat is the maximum number of teams that the school will be able to present at the Olympiad? How should the teams be formed for that?",
"input": "",
"output": "```python\nimport sys; R = sys.stdin.readline\r\nfor _ in range(int(R())):\r\n s = R().split()[0]\r\n sys.stdin.flush()\r\n for i in range(1, len(s) - 1):\r\n sub1 = s[:i]\r\n sub2 = s[i]\r\n sub3 = s[i + 1:]\r\n if (sub2 >= sub1 and sub2 >= sub3) or (sub2 <= sub1 and sub2 <= sub3):\r\n print(sub1, sub2, sub3)\r\n break\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "We've got no test cases. A big olympiad is coming up. But the problemsetters' number one priority should be adding another problem to the round. \n\nThe diameter of a multiset of points on the line is the largest distance between two points from this set. For example, the diameter of the multiset {1,<=3,<=2,<=1} is 2.\n\nDiameter of multiset consisting of one point is 0.\n\nYou are given *n* points on the line. What is the minimum number of points you have to remove, so that the diameter of the multiset of the remaining points will not exceed *d*?",
"input": "",
"output": "```python\nn, d = list(map(int, input().split()))\na = list(map(int, input().split()))\na.sort()\n\ni = 0\nj = 1\nl = 0\ntl = 1\n\nwhile True:\n\tif abs(a[i] - a[j]) <= d:\n\t\ttl += 1\n\t\tj += 1\n\telse:\n\t\tif tl > l:\n\t\t\tl = tl\n\t\ttl = 1\n\t\ti += 1\n\t\tj = i + 1\n\n\tif i >= n - 1 or j >= n:\n\t\tif tl > l:\n\t\t\tl = tl\n\t\tbreak\n\n\nprint(n - l)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The School №0 of the capital of Berland has *n* children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each child we know value *t**i*:\n - *t**i*<==<=1, if the *i*-th child is good at programming, - *t**i*<==<=2, if the *i*-th child is good at maths, - *t**i*<==<=3, if the *i*-th child is good at PE \nEach child happens to be good at exactly one of these three subjects.\n\nThe Team Scientific Decathlon Olympias requires teams of three students. The school teachers decided that the teams will be composed of three children that are good at different subjects. That is, each team must have one mathematician, one programmer and one sportsman. Of course, each child can be a member of no more than one team.\n\nWhat is the maximum number of teams that the school will be able to present at the Olympiad? How should the teams be formed for that?",
"input": "",
"output": "```python\nNoOfstudents=int(input())\r\nstudents=[int(x) for x in input().split()]\r\nmaths=[]\r\nprogramming=[]\r\nPE=[]\r\nif NoOfstudents>=3:\r\n for i in range(len(students)):\r\n if students[i]==1:\r\n programming.append(i+1)\r\n elif students[i]==2:\r\n maths.append(i+1)\r\n elif students[i]==3:\r\n PE.append(i+1)\r\nNoOfTeams=min(len(programming),len(maths),len(PE))\r\nprint(NoOfTeams)\r\nfor i in range(NoOfTeams):\r\n print(programming[i],maths[i],PE[i])\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.\n\nVasya wants to construct the minimal number of towers from the bars. Help Vasya to use the bars in the best way possible.",
"input": "",
"output": "```python\nfrom collections import defaultdict\r\n\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=defaultdict(int)\r\nfor i in a:\r\n d[i]+=1\r\ndata,l=0,0\r\nfor i in d:\r\n data=max(data,i*d[i])\r\n l+=1\r\nprint(data,l)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\narea = [int(x) for x in input().split(\" \")]\narea = (area[0] * area[1]) - (area[0] * area[1] % 2)\nprint(area // 2)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Unfortunately, Vasya can only sum pairs of integers (*a*, *b*), such that for any decimal place at least one number has digit 0 in this place. For example, Vasya can sum numbers 505 and 50, but he cannot sum 1 and 4.\n\nVasya has a set of *k* distinct non-negative integers *d*1,<=*d*2,<=...,<=*d**k*.\n\nVasya wants to choose some integers from this set so that he could sum any two chosen numbers. What maximal number of integers can he choose in the required manner?",
"input": "",
"output": "```python\nfrom collections import defaultdict\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\nans = []\r\nd = defaultdict(bool)\r\nfor i in arr:\r\n if(i % 100 == 0 and not d[100]):\r\n d[100] = True\r\n ans.append(i)\r\n elif(i % 10 == 0 and not d[10]):\r\n d[10] = True\r\n ans.append(i)\r\n elif(i == 0):\r\n ans.append(i)\r\nif(d[10]):\r\n for i in arr:\r\n if('0' not in str(i) and len(str(i)) == 1):\r\n ans.append(i)\r\n break\r\nelse:\r\n for i in arr:\r\n if('0' not in str(i)):\r\n ans.append(i)\r\n break\r\nprint(len(ans))\r\nprint(*ans)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a right triangle with legs of length *a* and *b*. Your task is to determine whether it is possible to locate the triangle on the plane in such a way that none of its sides is parallel to the coordinate axes. All the vertices must have integer coordinates. If there exists such a location, you have to output the appropriate coordinates of vertices.",
"input": "",
"output": "```python\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(x):\r\n s = set()\r\n for i in range(1, x):\r\n y = (x**2 - i**2)**0.5\r\n if y == int(y):\r\n s.add((i, int(y)))\r\n return s\r\n\r\n\r\na, b = map(int, input().split())\r\nd = f(a)\r\nq = f(b)\r\nfor i1, i2 in d:\r\n for i3, i4 in q:\r\n if i1*i4 == i2*i3:\r\n print('YES')\r\n print(0, 0)\r\n print(-i1, i2)\r\n print(i4, i3)\r\n exit()\r\nprint('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "wHAT DO WE NEED cAPS LOCK FOR?\n\nCaps lock is a computer keyboard key. Pressing it sets an input mode in which typed letters are capital by default. If it is pressed by accident, it leads to accidents like the one we had in the first passage. \n\nLet's consider that a word has been typed with the Caps lock key accidentally switched on, if: \n - either it only contains uppercase letters; - or all letters except for the first one are uppercase. \nIn this case we should automatically change the case of all letters. For example, the case of the letters that form words \"hELLO\", \"HTTP\", \"z\" should be changed.\n\nWrite a program that applies the rule mentioned above. If the rule cannot be applied, the program should leave the word unchanged.",
"input": "",
"output": "```python\nss=\"aeiou\"\ns=input()\nnum=0\nfor i in range(0,len(s)):\n if s[i] in ss:\n num=i\naa=s[0:num+1]+'ntry'\nprint (aa.capitalize ())\n\n \t\t \t\t \t\t \t \t \t \t\t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp is mad about coding, that is why he writes Sveta encoded messages. He calls the median letter in a word the letter which is in the middle of the word. If the word's length is even, the median letter is the left of the two middle letters. In the following examples, the median letter is highlighted: contest, info. If the word consists of single letter, then according to above definition this letter is the median letter. \n\nPolycarp encodes each word in the following way: he writes down the median letter of the word, then deletes it and repeats the process until there are no letters left. For example, he encodes the word volga as logva.\n\nYou are given an encoding *s* of some word, your task is to decode it.",
"input": "",
"output": "```python\nn=int(input())\r\ns=input()\r\na=list(s)\r\nif len(a)%2!=0:\r\n p=\"\"\r\n f=\"\"\r\n for i in range(len(s)):\r\n if i%2==0:\r\n p+=a[i]\r\n else:\r\n f+=a[i]\r\n print(f[::-1]+p)\r\nelse:\r\n p=\"\"\r\n f=\"\"\r\n for i in range(len(s)):\r\n if i%2==0:\r\n f+=a[i]\r\n else:\r\n p+=a[i]\r\n print(f[::-1]+p)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given string *s* consists of opening and closing brackets of four kinds <>, {}, [], (). There are two types of brackets: opening and closing. You can replace any bracket by another of the same type. For example, you can replace < by the bracket {, but you can't replace it by ) or >.\n\nThe following definition of a regular bracket sequence is well-known, so you can be familiar with it.\n\nLet's define a regular bracket sequence (RBS). Empty string is RBS. Let *s*1 and *s*2 be a RBS then the strings <*s*1>*s*2, {*s*1}*s*2, [*s*1]*s*2, (*s*1)*s*2 are also RBS.\n\nFor example the string \"[[(){}]<>]\" is RBS, but the strings \"[)()\" and \"][()()\" are not.\n\nDetermine the least number of replaces to make the string *s* RBS.",
"input": "",
"output": "```python\nS = input()\r\n\r\ndef is_open(x):\r\n return x == '<' or x == '{' or x == '[' or x == '('\r\n\r\ndef is_match(x, y):\r\n if x == '<':\r\n return y == '>'\r\n elif x == '{':\r\n return y == '}'\r\n elif x == '[':\r\n return y == ']'\r\n else:\r\n return y == ')'\r\n \r\n\r\nopen_cnt = 0\r\nclose_cnt = 0\r\n\r\nstack = []\r\nfor s in S:\r\n if not is_open(s):\r\n if len(stack) > 0 and is_open(stack[-1]) and is_match(stack[-1], s):\r\n stack.pop()\r\n open_cnt-= 1\r\n else:\r\n close_cnt+= 1\r\n stack.append(s)\r\n else:\r\n open_cnt+= 1\r\n stack.append(s)\r\n \r\nprint(stack)\r\n \r\nif(open_cnt == close_cnt):\r\n print(open_cnt)\r\nelse:\r\n print('Impossible')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\nn = int (input())\r\nfor i in range (n):\r\n word = input()\r\n if len (word) <= 10:\r\n print (word)\r\n else:\r\n print (word[0] + str (len (word) - 2) + word[len(word) - 1])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.\n\nThe toy consists of *n* parts and *m* ropes. Each rope links two parts, but every pair of parts is linked by at most one rope. To split the toy, the child must remove all its parts. The child can remove a single part at a time, and each remove consume an energy. Let's define an energy value of part *i* as *v**i*. The child spend *v**f*1<=+<=*v**f*2<=+<=...<=+<=*v**f**k* energy for removing part *i* where *f*1,<=*f*2,<=...,<=*f**k* are the parts that are directly connected to the *i*-th and haven't been removed.\n\nHelp the child to find out, what is the minimum total energy he should spend to remove all *n* parts.",
"input": "",
"output": "```python\nn, m = map(int, input().split())\r\nf = [int(x) for x in input().split()]\r\nans = 0\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n ans += min(f[a - 1], f[b - 1])\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There were *n* groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in the same team.\n\nThe coach decided to form teams of exactly three people for this training. Determine the maximum number of teams of three people he can form. It is possible that he can't use all groups to form teams. For groups of two, either both students should write the contest, or both should not. If two students from a group of two will write the contest, they should be in the same team.",
"input": "",
"output": "```python\nn=int(input())\r\na=list(map(int,input().split()))\r\nif 1 not in a:\r\n print(\"0\")\r\nelif 2 not in a:\r\n print(n//3)\r\nelse:\r\n x=a.count(1)\r\n y=a.count(2)\r\n if y>=x:\r\n print(x)\r\n else:\r\n print(x + ((x-y)//3))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vanya walks late at night along a straight street of length *l*, lit by *n* lanterns. Consider the coordinate system with the beginning of the street corresponding to the point 0, and its end corresponding to the point *l*. Then the *i*-th lantern is at the point *a**i*. The lantern lights all points of the street that are at the distance of at most *d* from it, where *d* is some positive number, common for all lanterns. \n\nVanya wonders: what is the minimum light radius *d* should the lanterns have to light the whole street?",
"input": "",
"output": "```python\nn,l = map(int, input().split())\r\nlntr = list(map(int,input().split()))\r\nlntr.sort()\r\nmaxi = 0\r\n\r\nfor i in range(n-1):\r\n maxi = max(maxi,lntr[i+1]-lntr[i])\r\nres = max([maxi/2, lntr[0]-0, l-lntr[n-1]])\r\nprint(float(res))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Hooray! Berl II, the king of Berland is making a knight tournament. The king has already sent the message to all knights in the kingdom and they in turn agreed to participate in this grand event.\n\nAs for you, you're just a simple peasant. There's no surprise that you slept in this morning and were late for the tournament (it was a weekend, after all). Now you are really curious about the results of the tournament. This time the tournament in Berland went as follows:\n - There are *n* knights participating in the tournament. Each knight was assigned his unique number — an integer from 1 to *n*. - The tournament consisted of *m* fights, in the *i*-th fight the knights that were still in the game with numbers at least *l**i* and at most *r**i* have fought for the right to continue taking part in the tournament. - After the *i*-th fight among all participants of the fight only one knight won — the knight number *x**i*, he continued participating in the tournament. Other knights left the tournament. - The winner of the last (the *m*-th) fight (the knight number *x**m*) became the winner of the tournament. \nYou fished out all the information about the fights from your friends. Now for each knight you want to know the name of the knight he was conquered by. We think that the knight number *b* was conquered by the knight number *a*, if there was a fight with both of these knights present and the winner was the knight number *a*.\n\nWrite the code that calculates for each knight, the name of the knight that beat him.",
"input": "",
"output": "```python\ndef update(v,l,r,src,p_src,kl,kr):\r\n if(l>r or la[v]==-1):\r\n return\r\n if(kl==kr):\r\n la[v]=src\r\n visited[kl]=src\r\n return\r\n else:\r\n km=(kl+kr)//2\r\n update(2*v,l,min(r,km),src,p_src,kl,km)\r\n update(2*v+1,max(km+1,l),r,src,p_src,km+1,kr)\r\n if(la[2*v]>-2 and la[2*v+1]>-2):\r\n la[v]=-1\r\n visited[p_src]=src\r\n\r\n\r\nn,m=map(int,input().split())\r\ni=1\r\nwhile(2**i 1:\r\n print(\"LEFT\")\r\n k -= 1\r\n print(\"\\nRIGHT\\n\".join((\"PRINT \" + c) for c in s))\r\nelse:\r\n while k < n:\r\n print(\"RIGHT\")\r\n k += 1\r\n print(\"\\nLEFT\\n\".join((\"PRINT \" + c) for c in reversed(s)))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After celebrating the midcourse the students of one of the faculties of the Berland State University decided to conduct a vote for the best photo. They published the photos in the social network and agreed on the rules to choose a winner: the photo which gets most likes wins. If multiple photoes get most likes, the winner is the photo that gets this number first.\n\nHelp guys determine the winner photo by the records of likes.",
"input": "",
"output": "```python\ndef run(n, arr):\n photos = []\n top = dict(id=arr.pop(0), likes=1)\n\n for id in arr:\n found = False\n for photo in photos:\n if photo['id'] == id:\n found = True\n photo['likes'] += 1\n if photo['likes'] > top['likes']:\n top = photo\n break\n if not found:\n photos.append(dict(id=id, likes=1))\n\n return top['id']\n\n\ndef read_data():\n n = int(input())\n arr = [int(x) for x in input().split(\" \")]\n return n, arr\n\n\nn, arr = read_data()\n\nprint(run(n, arr))\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sengoku still remembers the mysterious \"colourful meteoroids\" she discovered with Lala-chan when they were little. In particular, one of the nights impressed her deeply, giving her the illusion that all her fancies would be realized.\n\nOn that night, Sengoku constructed a permutation *p*1,<=*p*2,<=...,<=*p**n* of integers from 1 to *n* inclusive, with each integer representing a colour, wishing for the colours to see in the coming meteor outburst. Two incredible outbursts then arrived, each with *n* meteorids, colours of which being integer sequences *a*1,<=*a*2,<=...,<=*a**n* and *b*1,<=*b*2,<=...,<=*b**n* respectively. Meteoroids' colours were also between 1 and *n* inclusive, and the two sequences were not identical, that is, at least one *i* (1<=≤<=*i*<=≤<=*n*) exists, such that *a**i*<=≠<=*b**i* holds.\n\nWell, she almost had it all — each of the sequences *a* and *b* matched exactly *n*<=-<=1 elements in Sengoku's permutation. In other words, there is exactly one *i* (1<=≤<=*i*<=≤<=*n*) such that *a**i*<=≠<=*p**i*, and exactly one *j* (1<=≤<=*j*<=≤<=*n*) such that *b**j*<=≠<=*p**j*.\n\nFor now, Sengoku is able to recover the actual colour sequences *a* and *b* through astronomical records, but her wishes have been long forgotten. You are to reconstruct any possible permutation Sengoku could have had on that night.",
"input": "",
"output": "```python\nn = int(input())\r\nai = list(map(int,input().split()))\r\nbi = list(map(int,input().split()))\r\nci = [0]*n\r\nfor i in range(n):\r\n ci[i] = ai[i]\r\nnums = [0]*n\r\nind = [0]*2\r\nj = 0\r\nnum = 0\r\nfor i in range(n):\r\n nums[ai[i]-1] += 1\r\nfor i in range(n):\r\n if nums[ai[i]-1] == 2:\r\n ind[j] = i\r\n j += 1\r\n if nums[i] == 0:\r\n num = i+1 \r\n \r\nci[ind[0]] = num\r\ndif = 0\r\ndif2 = 0\r\nfor i in range(n):\r\n if ci[i] != bi[i]:\r\n dif += 1\r\n if ci[i] != ai[i]:\r\n dif2 += 1\r\nif dif != 1 or dif2 != 1:\r\n ci[ind[0]] = ai[ind[0]]\r\n ci[ind[1]] = num\r\nfor i in range(n):\r\n print(ci[i],end=\" \")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second — number B, etc. till column 26 that is marked by Z. Then there are two-letter numbers: column 27 has number AA, 28 — AB, column 52 is marked by AZ. After ZZ there follow three-letter numbers, etc.\n\nThe rows are marked by integer numbers starting with 1. The cell name is the concatenation of the column and the row numbers. For example, BC23 is the name for the cell that is in column 55, row 23. \n\nSometimes another numeration system is used: RXCY, where X and Y are integer numbers, showing the column and the row numbers respectfully. For instance, R23C55 is the cell from the previous example.\n\nYour task is to write a program that reads the given sequence of cell coordinates and produce each item written according to the rules of another numeration system.",
"input": "",
"output": "```python\nimport sys\r\ninput=sys.stdin.readline\r\nm=1000000007\r\n\r\n#------------------------------------#\r\n\r\nfor _ in range(int(input())):\r\n cell=input().strip()\r\n if cell[0]==\"R\":\r\n #convert to AA format\r\n secindex=cell.index(\"C\")\r\n number1=int(cell[1:secindex])\r\n number2=int(cell[secindex+1:])-1\r\n column=\"\"\r\n while(number2>0):\r\n column+=chr(ord(\"A\")+number2%26)\r\n number2=number2//26-1\r\n print(column[::-1],number1,sep=\"\")\r\n else:\r\n i=0\r\n column=0\r\n while(not cell[i].isdigit()):\r\n column=column*26+ord(cell[i])-ord(\"A\")+1\r\n i+=1\r\n print(\"R\"+cell[i:]+\"C\"+str(column))\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Iahub is very proud of his recent discovery, propagating trees. Right now, he invented a new tree, called xor-tree. After this new revolutionary discovery, he invented a game for kids which uses xor-trees.\n\nThe game is played on a tree having *n* nodes, numbered from 1 to *n*. Each node *i* has an initial value *init**i*, which is either 0 or 1. The root of the tree is node 1.\n\nOne can perform several (possibly, zero) operations on the tree during the game. The only available type of operation is to pick a node *x*. Right after someone has picked node *x*, the value of node *x* flips, the values of sons of *x* remain the same, the values of sons of sons of *x* flips, the values of sons of sons of sons of *x* remain the same and so on.\n\nThe goal of the game is to get each node *i* to have value *goal**i*, which can also be only 0 or 1. You need to reach the goal of the game by using minimum number of operations.",
"input": "",
"output": "```python\nn=int(input())\r\nfrom collections import defaultdict\r\ngraph=defaultdict(list)\r\nfor i in range(n-1):\r\n u,v=[int(i) for i in input().split()]\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\ncurr=[int(i) for i in input().split()]\r\ngoal=[int(i) for i in input().split()]\r\n\r\nops=[]\r\ndef dfs(parent,ver,odd,even,lev):\r\n par=lev%2\r\n temp=curr[ver-1]\r\n changed=0\r\n if par and odd%2:\r\n temp=curr[ver-1]^1\r\n if par==0 and even%2:\r\n temp=curr[ver-1]^1\r\n #print(curr[ver-1],goal[ver-1])\r\n if temp!=goal[ver-1]:\r\n ops.append(ver)\r\n changed=1\r\n \r\n\r\n for ne in graph[ver]:\r\n if ne!=parent:\r\n if changed:\r\n if lev%2:\r\n dfs(ver,ne,odd+1,even,lev+1)\r\n else:\r\n dfs(ver,ne,odd,even+1,lev+1)\r\n else:\r\n dfs(ver,ne,odd,even,lev+1)\r\n\r\ndfs(-1,1,0,0,0)\r\nprint(len(ops))\r\nfor i in ops:\r\n print(i)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mahmoud has an array *a* consisting of *n* integers. He asked Ehab to find another array *b* of the same length such that:\n - *b* is lexicographically greater than or equal to *a*. - *b**i*<=≥<=2. - *b* is pairwise coprime: for every 1<=≤<=*i*<=<<=*j*<=≤<=*n*, *b**i* and *b**j* are coprime, i. e. *GCD*(*b**i*,<=*b**j*)<==<=1, where *GCD*(*w*,<=*z*) is the greatest common divisor of *w* and *z*. \nEhab wants to choose a special array so he wants the lexicographically minimal array between all the variants. Can you find it?\n\nAn array *x* is lexicographically greater than an array *y* if there exists an index *i* such than *x**i*<=><=*y**i* and *x**j*<==<=*y**j* for all 1<=≤<=*j*<=<<=*i*. An array *x* is equal to an array *y* if *x**i*<==<=*y**i* for all 1<=≤<=*i*<=≤<=*n*.",
"input": "",
"output": "```python\nprint(\"Even\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bachgold problem is very easy to formulate. Given a positive integer *n* represent it as a sum of maximum possible number of prime numbers. One can prove that such representation exists for any integer greater than 1.\n\nRecall that integer *k* is called prime if it is greater than 1 and has exactly two positive integer divisors — 1 and *k*.",
"input": "",
"output": "```python\ndef isprime(n):\r\n for n in range(n,100001):\r\n s=int(n**(0.5))\r\n f=1\r\n for j in range(2,s+1):\r\n if(n%j==0):\r\n f=0\r\n break\r\n if(f==1):\r\n return(n)\r\n\r\nprint(isprime(20))\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A company has *n* employees numbered from 1 to *n*. Each employee either has no immediate manager or exactly one immediate manager, who is another employee with a different number. An employee *A* is said to be the superior of another employee *B* if at least one of the following is true:\n - Employee *A* is the immediate manager of employee *B* - Employee *B* has an immediate manager employee *C* such that employee *A* is the superior of employee *C*. \nThe company will not have a managerial cycle. That is, there will not exist an employee who is the superior of his/her own immediate manager.\n\nToday the company is going to arrange a party. This involves dividing all *n* employees into several groups: every employee must belong to exactly one group. Furthermore, within any single group, there must not be two employees *A* and *B* such that *A* is the superior of *B*.\n\nWhat is the minimum number of groups that must be formed?",
"input": "",
"output": "```python\ndic = dict()\nnum = int(input())\ncount = 0\ncheck = list()\nfor n in range(1, num + 1):\n employee = n\n manager = int(input())\n if manager in dic:\n dic[manager].append(employee)\n else:\n dic[manager] = list()\n dic[manager].append(employee)\ncheck = dic[-1]\nsize = len(check)\nwhile size > 0:\n for i in range(size):\n employee = check.pop()\n if employee in dic:\n for elem in dic[employee]:\n check.append(elem)\n size = len(check)\n count += 1\nprint(count)\n\n\n\n\n\n\t \t \t\t \t \t \t\t\t \t \t\t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.\n\nIn the given sequence moving up is described by character U and moving right is described by character R. Mikhail can replace any pair of consecutive moves RU or UR with a diagonal move (described as character D). After that, he can go on and do some other replacements, until there is no pair of consecutive moves RU or UR left.\n\nYour problem is to print the minimum possible length of the sequence of moves after the replacements.",
"input": "",
"output": "```python\nn-int(input())\r\nx=input().lower()\r\ni-0\r\nwhile i < len(x) -1:\r\nif x[i]+x[i+1] in ('ur', 'ru'):\r\n i=i+2\r\n n=n-1\r\nelse:\r\n i=i+1\r\nprint (n)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Translator's note: in Russia's most widespread grading system, there are four grades: 5, 4, 3, 2, the higher the better, roughly corresponding to A, B, C and F respectively in American grading system.\n\nThe term is coming to an end and students start thinking about their grades. Today, a professor told his students that the grades for his course would be given out automatically — he would calculate the simple average (arithmetic mean) of all grades given out for lab works this term and round to the nearest integer. The rounding would be done in favour of the student — $4.5$ would be rounded up to $5$ (as in example 3), but $4.4$ would be rounded down to $4$.\n\nThis does not bode well for Vasya who didn't think those lab works would influence anything, so he may receive a grade worse than $5$ (maybe even the dreaded $2$). However, the professor allowed him to redo some of his works of Vasya's choosing to increase his average grade. Vasya wants to redo as as few lab works as possible in order to get $5$ for the course. Of course, Vasya will get $5$ for the lab works he chooses to redo.\n\nHelp Vasya — calculate the minimum amount of lab works Vasya has to redo.",
"input": "",
"output": "```python\nn=int(input())\r\na=list(map(int,input().split()))\r\nk=sum(a)\r\nav=k/n\r\nc=0\r\nif(av<4.5):\r\n a.sort()\r\n s=int(n*4.5)-k\r\n if(n%2!=0):\r\n s+=1\r\n q=0\r\n for i in range(n):\r\n if(q>=s):\r\n break\r\n else:\r\n q+=5-a[i]\r\n c+=1\r\nprint(c)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Harry Potter is on a mission to destroy You-Know-Who's Horcruxes. The first Horcrux that he encountered in the Chamber of Secrets is Tom Riddle's diary. The diary was with Ginny and it forced her to open the Chamber of Secrets. Harry wants to know the different people who had ever possessed the diary to make sure they are not under its influence.\n\nHe has names of *n* people who possessed the diary in order. You need to tell, for each person, if he/she possessed the diary at some point before or not.\n\nFormally, for a name *s**i* in the *i*-th line, output \"YES\" (without quotes) if there exists an index *j* such that *s**i*<==<=*s**j* and *j*<=<<=*i*, otherwise, output \"NO\" (without quotes).",
"input": "",
"output": "```python\nn=int(input())\r\nlista=[]\r\nfor i in range(n):\r\n\tnam=input()\r\n\tif nam in lista:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tlista.append(nam)\r\n\t\tprint(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sereja has an array *a*, consisting of *n* integers *a*1, *a*2, ..., *a**n*. The boy cannot sit and do nothing, he decided to study an array. Sereja took a piece of paper and wrote out *m* integers *l*1,<=*l*2,<=...,<=*l**m* (1<=≤<=*l**i*<=≤<=*n*). For each number *l**i* he wants to know how many distinct numbers are staying on the positions *l**i*, *l**i*<=+<=1, ..., *n*. Formally, he want to find the number of distinct numbers among *a**l**i*,<=*a**l**i*<=+<=1,<=...,<=*a**n*.?\n\nSereja wrote out the necessary array elements but the array was so large and the boy was so pressed for time. Help him, find the answer for the described question for each *l**i*.",
"input": "",
"output": "```python\n#采用预处理策略，避免每一次都遍历一遍列表\r\nn,m = map(int,input().split())\r\nline = list(map(int,input().split()))\r\ndistinct_nums = []\r\nvisited = [0]*100001 #用于标记每一个数字是否被访问过\r\ndistinct = 0\r\nfor i in range(n-1,-1,-1):\r\n if visited[line[i]] == 0:\r\n distinct += 1\r\n distinct_nums.append(distinct)\r\n visited[line[i]] = 1\r\n else:\r\n distinct_nums.append(distinct)\r\n\r\nfor i in range(m):\r\n l = int(input())\r\n print(distinct_nums[l-1])\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Indian summer is such a beautiful time of the year! A girl named Alyona is walking in the forest and picking a bouquet from fallen leaves. Alyona is very choosy — she doesn't take a leaf if it matches the color and the species of the tree of one of the leaves she already has. Find out how many leaves Alyona has picked.",
"input": "",
"output": "```python\nlis=[]\nfor _ in range(int(input())):\n a,b=map(str,input().split())\n lis.append([a,b])\nans = []\nfor i in range(len(lis)):\n if lis[i] in ans:\n pass\n else:\n ans.append(lis[i])\nprint(len(ans))\n\n \t\t \t\t\t\t \t \t \t \t\t\t\t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "New Year is coming in Line World! In this world, there are *n* cells numbered by integers from 1 to *n*, as a 1<=×<=*n* board. People live in cells. However, it was hard to move between distinct cells, because of the difficulty of escaping the cell. People wanted to meet people who live in other cells.\n\nSo, user tncks0121 has made a transportation system to move between these cells, to celebrate the New Year. First, he thought of *n*<=-<=1 positive integers *a*1,<=*a*2,<=...,<=*a**n*<=-<=1. For every integer *i* where 1<=≤<=*i*<=≤<=*n*<=-<=1 the condition 1<=≤<=*a**i*<=≤<=*n*<=-<=*i* holds. Next, he made *n*<=-<=1 portals, numbered by integers from 1 to *n*<=-<=1. The *i*-th (1<=≤<=*i*<=≤<=*n*<=-<=1) portal connects cell *i* and cell (*i*<=+<=*a**i*), and one can travel from cell *i* to cell (*i*<=+<=*a**i*) using the *i*-th portal. Unfortunately, one cannot use the portal backwards, which means one cannot move from cell (*i*<=+<=*a**i*) to cell *i* using the *i*-th portal. It is easy to see that because of condition 1<=≤<=*a**i*<=≤<=*n*<=-<=*i* one can't leave the Line World using portals.\n\nCurrently, I am standing at cell 1, and I want to go to cell *t*. However, I don't know whether it is possible to go there. Please determine whether I can go to cell *t* by only using the construted transportation system.",
"input": "",
"output": "```python\nl=(input().split())\r\nm=[int(l[0]),int(l[1])]\r\nn=input().split()\r\np=[]\r\na=0\r\nfor i in range(len(n)):\r\n p=p+[n[i]]\r\nfor j in range(len(n)):\r\n a=a+p[j]\r\n if a==l[1]:\r\n print('YES')\r\n break\r\n elif a>l[1]:\r\n print('NO')\r\n break\r\n\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest. \n\nIn total, *n* students will attend, and before the start, every one of them has some positive integer rating. Students are indexed from 1 to *n*. Let's denote the rating of *i*-th student as *a**i*. After the contest ends, every student will end up with some positive integer position. GukiZ expects that his students will take places according to their ratings. \n\nHe thinks that each student will take place equal to . In particular, if student *A* has rating strictly lower then student *B*, *A* will get the strictly better position than *B*, and if two students have equal ratings, they will share the same position. \n\nGukiZ would like you to reconstruct the results by following his expectations. Help him and determine the position after the end of the contest for each of his students if everything goes as expected.",
"input": "",
"output": "```python\nstudents = int(input())\nratings = list(map(int, input().split(' ')))\ndifferent_ratings = list(reversed(sorted(set(ratings))))\nrankings = {}\n\nfor i in range(len(different_ratings)):\n if i == 0:\n rankings[different_ratings[i]] = 1\n else:\n rankings[different_ratings[i]] = rankings[different_ratings[i - 1]] + ratings.count(different_ratings[i - 1])\n\npositions = []\n\nfor rating in ratings:\n positions.append(rankings[rating])\n\nprint(*positions)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The input contains two integers *a*1,<=*a*2 (0<=≤<=*a**i*<=≤<=109), separated by a single space.\n\nOutput a single integer.",
"input": "",
"output": "```python\nn=input().split()\nc=int(n[1])\na=[]\nb=[]\nl=\"\"\no=\"\"\nd=[]\nfor i in n[1]:\n\ta.append(int(i))\na.reverse()\nfor i in n[0]:\n\tb.append(i)\nif len(n[0]) < len(n[1]):\n\tb.insert(0,'0')\nfor i in range (len(a)):\n\tl+= str(a[i])\n\to+= str(b[i])\np = int(l)\nq = int(o)\nprint(p+q)\n\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You're given a row with $n$ chairs. We call a seating of people \"maximal\" if the two following conditions hold:\n 1. There are no neighbors adjacent to anyone seated. 1. It's impossible to seat one more person without violating the first rule. \nThe seating is given as a string consisting of zeros and ones ($0$ means that the corresponding seat is empty, $1$ — occupied). The goal is to determine whether this seating is \"maximal\".\n\nNote that the first and last seats are not adjacent (if $n \\ne 2$).",
"input": "",
"output": "```python\nn=input()\r\nl='0'+input()+'0'\r\nprint('No' if '000' in l or '11' in l else 'Yes')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After a hard day Vitaly got very hungry and he wants to eat his favorite potato pie. But it's not that simple. Vitaly is in the first room of the house with *n* room located in a line and numbered starting from one from left to right. You can go from the first room to the second room, from the second room to the third room and so on — you can go from the (*n*<=-<=1)-th room to the *n*-th room. Thus, you can go to room *x* only from room *x*<=-<=1.\n\nThe potato pie is located in the *n*-th room and Vitaly needs to go there. \n\nEach pair of consecutive rooms has a door between them. In order to go to room *x* from room *x*<=-<=1, you need to open the door between the rooms with the corresponding key. \n\nIn total the house has several types of doors (represented by uppercase Latin letters) and several types of keys (represented by lowercase Latin letters). The key of type *t* can open the door of type *T* if and only if *t* and *T* are the same letter, written in different cases. For example, key f can open door F.\n\nEach of the first *n*<=-<=1 rooms contains exactly one key of some type that Vitaly can use to get to next rooms. Once the door is open with some key, Vitaly won't get the key from the keyhole but he will immediately run into the next room. In other words, each key can open no more than one door.\n\nVitaly realizes that he may end up in some room without the key that opens the door to the next room. Before the start his run for the potato pie Vitaly can buy any number of keys of any type that is guaranteed to get to room *n*.\n\nGiven the plan of the house, Vitaly wants to know what is the minimum number of keys he needs to buy to surely get to the room *n*, which has a delicious potato pie. Write a program that will help Vitaly find out this number.",
"input": "",
"output": "```python\nn=int(input())\ns=list(input())\n\nkeys=[0]*26\ncount=0\nfor i in range(0, (len(s)//2)):\n key = s[i*2]\n door = s[i*2+1]\n keys[ord(key)-97] += 1\n if (keys[ord(door)-65] > 0):\n keys[ord(door)-65] -= 1\n else:\n count+=1\nprint(count)\n\t \t \t \t\t \t \t\t \t\t\t \t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.\n\nCatacombs consist of several rooms and bidirectional passages between some pairs of them. Some passages can connect a room to itself and since the passages are built on different depths they do not intersect each other. Every minute Petya arbitrary chooses a passage from the room he is currently in and then reaches the room on the other end of the passage in exactly one minute. When he enters a room at minute *i*, he makes a note in his logbook with number *t**i*: \n - If Petya has visited this room before, he writes down the minute he was in this room last time; - Otherwise, Petya writes down an arbitrary non-negative integer strictly less than current minute *i*. \nInitially, Petya was in one of the rooms at minute 0, he didn't write down number *t*0.\n\nAt some point during his wandering Petya got tired, threw out his logbook and went home. Vasya found his logbook and now he is curious: what is the minimum possible number of rooms in Paris catacombs according to Petya's logbook?",
"input": "",
"output": "```python\nn = int(input())\r\nt = [int(x) for x in input().split()]\r\nans = 0\r\nistime = [0] * (2 * 10 ** 5 + 13)\r\nistime[0] = 1\r\nfor i in range(n):\r\n if istime[t[i]] > 0:\r\n istime[t[i]] -= 1\r\n else:\r\n ans += 1\r\n istime[i + 1] += 1\r\nprint(ans + 1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Arkady and Kirill visited an exhibition of rare coins. The coins were located in a row and enumerated from left to right from 1 to *k*, each coin either was laid with its obverse (front) side up, or with its reverse (back) side up.\n\nArkady and Kirill made some photos of the coins, each photo contained a segment of neighboring coins. Akrady is interested in obverses, so on each photo made by him there is at least one coin with obverse side up. On the contrary, Kirill is interested in reverses, so on each photo made by him there is at least one coin with its reverse side up.\n\nThe photos are lost now, but Arkady and Kirill still remember the bounds of the segments of coins each photo contained. Given this information, compute the remainder of division by 109<=+<=7 of the number of ways to choose the upper side of each coin in such a way, that on each Arkady's photo there is at least one coin with obverse side up, and on each Kirill's photo there is at least one coin with reverse side up.",
"input": "",
"output": "```python\nprint(\"_RANDOM_GUESS_1692552615.5669065\")# 1692552615.566924\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once at a team training Vasya, Petya and Sasha got a problem on implementing linear search in an array.\n\nAccording to the boys, linear search works as follows. The array elements in a pre-selected order are in turn compared with the number that you need to find. Once you find the array element that is equal to the required one, the search ends. The efficiency of the algorithm is the number of performed comparisons. The fewer comparisons the linear search has made, the more effective it is.\n\nVasya believes that a linear search would work better if it sequentially iterates through the elements, starting with the 1-st one (in this problem we consider the elements of the array indexed from 1 to *n*) and ending with the *n*-th one. And Petya says that Vasya is wrong: the search will need less comparisons if it sequentially iterates the elements starting from the *n*-th and ending with the 1-st one. Sasha argues that the two approaches are equivalent.\n\nTo finally begin the task, the teammates decided to settle the debate and compare the two approaches on an example. For this, they took an array that is a permutation of integers from 1 to *n*, and generated *m* queries of the form: find element with value *b**i* in the array. They want to calculate for both approaches how many comparisons in total the linear search will need to respond to all queries. If the first search needs fewer comparisons, then the winner of the dispute is Vasya. If the second one does, then the winner is Petya. If both approaches make the same number of comparisons, then Sasha's got the upper hand.\n\nBut the problem is, linear search is too slow. That's why the boys aren't going to find out who is right before the end of the training, unless you come in here. Help them to determine who will win the dispute.",
"input": "",
"output": "```python\nn1=int(input())\r\nl1=list(map(int,input().split()))\r\nn2=int(input())\r\nl2=list(map(int,input().split()))\r\ns1=0\r\ns2=0\r\nd={}\r\nfor i in range(len(l1)):\r\n d[l1[i]]=i\r\nfor i in range(len(l2)):\r\n if l2[i] in d:\r\n s1+=d[l2[i]]+1\r\n s2+=n1-d[l2[i]]\r\nprint(s1,end=\" \")\r\nprint(s2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Fox Ciel has a board with *n* rows and *n* columns, there is one integer in each cell.\n\nIt's known that *n* is an odd number, so let's introduce . Fox Ciel can do the following operation many times: she choose a sub-board with size *x* rows and *x* columns, then all numbers in it will be multiplied by -1.\n\nReturn the maximal sum of numbers in the board that she can get by these operations.",
"input": "",
"output": "```python\nn = int(input())\r\n\r\nm = []\r\nfor _ in range(n):\r\n m.append(list(map(int, input().split())))\r\n m[-1].append(0)\r\nm.append([0]*(n+1))\r\nx = (n+1)//2\r\nf = [0,0]\r\n\r\ndef flip(v,k):\r\n return -v if k > 0 else v\r\n\r\nsol = int(-1e9)\r\nfor s in range(1<>i&1) + flip(m[i+x][j+x],(s>>i&1 ^ s>>(x-1)&1) ^ k)\r\n if j == x - 1:\r\n f[k] += flip(sum, s>>i & 1)\r\n elif i == x - 1:\r\n f[k] += flip(sum,k)\r\n else:\r\n f[k] += max(sum, -sum)\r\n current_sol += (max(f[0],f[1]) if j != x-1 else f[s>>(x-1)])\r\n sol = max(sol, current_sol)\r\n\r\n\r\nprint(sol)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (*x*1,<=*y*1),<=(*x*2,<=*y*2),<=...,<=(*x**n*,<=*y**n*). Let's define neighbors for some fixed point from the given set (*x*,<=*y*): \n - point (*x*',<=*y*') is (*x*,<=*y*)'s right neighbor, if *x*'<=><=*x* and *y*'<==<=*y* - point (*x*',<=*y*') is (*x*,<=*y*)'s left neighbor, if *x*'<=<<=*x* and *y*'<==<=*y* - point (*x*',<=*y*') is (*x*,<=*y*)'s lower neighbor, if *x*'<==<=*x* and *y*'<=<<=*y* - point (*x*',<=*y*') is (*x*,<=*y*)'s upper neighbor, if *x*'<==<=*x* and *y*'<=><=*y* \nWe'll consider point (*x*,<=*y*) from the given set supercentral, if it has at least one upper, at least one lower, at least one left and at least one right neighbor among this set's points.\n\nVasya marked quite many points on the paper. Analyzing the picture manually is rather a challenge, so Vasya asked you to help him. Your task is to find the number of supercentral points in the given set.",
"input": "",
"output": "```python\ncount = int(input())\r\npoints = []\r\nfor i in range(count):\r\n point = tuple(input().split())\r\n points.append(point)\r\n\r\nanswer = 0\r\n\r\nfor (x, y) in points:\r\n left = False\r\n right = False\r\n up = False\r\n low = False\r\n for (x1, y1) in points:\r\n if x1 > x and y1 == y:\r\n right = True\r\n if x1 < x and y1 == y:\r\n left = True\r\n if x1 == x and y1 > y:\r\n up = True\r\n if x1 == x and y1 < y:\r\n low = True\r\n \r\n if left and right and up and low:\r\n answer += 1\r\n\r\nprint(answer)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.\n\nA tree is a connected acyclic graph. A bipartite graph is a graph, whose vertices can be partitioned into 2 sets in such a way, that for each edge (*u*,<=*v*) that belongs to the graph, *u* and *v* belong to different sets. You can find more formal definitions of a tree and a bipartite graph in the notes section below.\n\nDr. Evil gave Mahmoud and Ehab a tree consisting of *n* nodes and asked them to add edges to it in such a way, that the graph is still bipartite. Besides, after adding these edges the graph should be simple (doesn't contain loops or multiple edges). What is the maximum number of edges they can add?\n\nA loop is an edge, which connects a node with itself. Graph doesn't contain multiple edges when for each pair of nodes there is no more than one edge between them. A cycle and a loop aren't the same .",
"input": "",
"output": "```python\nn = int(input())\r\ng = [[] for i in range(n+1)]\r\nfor _ in range(n-1):\r\n u, v = map(int, input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\n \r\nvisited = [False for _ in range(n+1)]\r\ndef dfs(node, prev):\r\n if prev:\r\n visited[node] = 1\r\n else:\r\n visited[node] = 0\r\n for w in g[node]:\r\n if not visited[w]:\r\n dfs(w, 1 - prev)\r\n \r\ndfs(1, 0)\r\nc = [0, 0]\r\nfor visit in visited:\r\n if visit == 1:\r\n c[1] += 1\r\n else:\r\n c[0] += 1\r\n \r\nprint(c[0]*c[1]-n+1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In Aramic language words can only represent objects.\n\nWords in Aramic have special properties: \n - A word is a root if it does not contain the same letter more than once. - A root and all its permutations represent the same object. - The root $x$ of a word $y$ is the word that contains all letters that appear in $y$ in a way that each letter appears once. For example, the root of \"aaaa\", \"aa\", \"aaa\" is \"a\", the root of \"aabb\", \"bab\", \"baabb\", \"ab\" is \"ab\". - Any word in Aramic represents the same object as its root. \nYou have an ancient script in Aramic. What is the number of different objects mentioned in the script?",
"input": "",
"output": "```python\nd=set()\r\ninput()\r\nfor i in input().split():\r\n x=set()\r\n for j in i: x.add(j)\r\n d.add(''.join(sorted(x)))\r\nprint(len(d))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Not so long ago the Codecraft-17 contest was held on Codeforces. The top 25 participants, and additionally random 25 participants out of those who got into top 500, will receive a Codeforces T-shirt.\n\nUnfortunately, you didn't manage to get into top 25, but you got into top 500, taking place *p*.\n\nNow the elimination round of 8VC Venture Cup 2017 is being held. It has been announced that the Codecraft-17 T-shirt winners will be chosen as follows. Let *s* be the number of points of the winner of the elimination round of 8VC Venture Cup 2017. Then the following pseudocode will be executed: \n\nHere \"div\" is the integer division operator, \"mod\" is the modulo (the remainder of division) operator.\n\nAs the result of pseudocode execution, 25 integers between 26 and 500, inclusive, will be printed. These will be the numbers of places of the participants who get the Codecraft-17 T-shirts. It is guaranteed that the 25 printed integers will be pairwise distinct for any value of *s*.\n\nYou're in the lead of the elimination round of 8VC Venture Cup 2017, having *x* points. You believe that having at least *y* points in the current round will be enough for victory.\n\nTo change your final score, you can make any number of successful and unsuccessful hacks. A successful hack brings you 100 points, an unsuccessful one takes 50 points from you. It's difficult to do successful hacks, though.\n\nYou want to win the current round and, at the same time, ensure getting a Codecraft-17 T-shirt. What is the smallest number of successful hacks you have to do to achieve that?",
"input": "",
"output": "```python\np, x, y = map(int, input().split())\r\n\r\ndef shirtpicking(s, test):\r\n i = (s // 50) % 475\r\n res = []\r\n for t in range(25):\r\n i = (i * 96 + 42) % 475\r\n res.append(i+26)\r\n\r\n if test in res:\r\n return True\r\n else:\r\n return False\r\n\r\nif x >= y:\r\n for x1 in range((x - y) // 50 + 1):\r\n if shirtpicking(x - x1 * 50, p):\r\n print(0)\r\n exit()\r\n\r\nans = 0\r\n\r\ns = x\r\nints = 0\r\n\r\nwhile ans == 0:\r\n\r\n s += 50\r\n\r\n ints += 1\r\n if shirtpicking(s, p):\r\n print((ints + 1) // 2)\r\n exit()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this movement. \n\nUCDHP stores some secret information about meteors as an *n*<=×<=*m* table with integers in its cells. The order of meteors in the Universe is changing. That's why the main UCDHP module receives the following queries:\n - The query to swap two table rows; - The query to swap two table columns; - The query to obtain a secret number in a particular table cell. \nAs the main UCDHP module is critical, writing the functional of working with the table has been commissioned to you.",
"input": "",
"output": "```python\nimport sys\ninput = sys.stdin.readline\nn ,m ,k = map(int ,input().split())\nrow ,col ,Data = [], [],[]\nfor i in range(n):\n row.append(i)\n a = list(input().split())\n Data.append(a)\nfor i in range(m):\n col.append(i)\nfor _ in range(k):\n s ,x ,y = input().split()\n x , y = int(x) ,int(y)\n if s == 'g':\n print(Data[row[x-1]][col[y-1]])\n elif s == 'r':\n tmp = row[x-1]\n row[x-1] = row[y-1]\n row[y-1] = tmp\n else :\n tmp = col[x-1]\n col[x-1] = col[y-1]\n col[y-1] = col[x-1]\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* boys and *m* girls studying in the class. They should stand in a line so that boys and girls alternated there as much as possible. Let's assume that positions in the line are indexed from left to right by numbers from 1 to *n*<=+<=*m*. Then the number of integers *i* (1<=≤<=*i*<=<<=*n*<=+<=*m*) such that positions with indexes *i* and *i*<=+<=1 contain children of different genders (position *i* has a girl and position *i*<=+<=1 has a boy or vice versa) must be as large as possible. \n\nHelp the children and tell them how to form the line.",
"input": "",
"output": "```python\nfile=open(\"input.txt\",'r');c=open(\"output.txt\",'w')\na,b=map(int,file.readline().split())\nc.write(['BG'*b+'B'*(a-b),'GB'*a+'G'*(b-a)][a list[2] or list[1] + list[2] > list[3]:\n print(\"TRIANGLE\")\nelif list[0] + list[1] == list[2] or list[1] + list[2] == list[3]:\n print(\"SEGMENT\")\nelse:\n print(\"IMPOSSIBLE\")\n\n \t\t \t\t \t \t \t\t \t \t \t\t \t\t\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The year of 2012 is coming...\n\nAccording to an ancient choradrican legend in this very year, in 2012, Diablo and his brothers Mephisto and Baal will escape from hell, and innumerable hordes of demons will enslave the human world. But seven brave heroes have already gathered on the top of a mountain Arreat to protect us mere mortals from the effect of this terrible evil.\n\nThe seven great heroes are: amazon Anka, barbarian Chapay, sorceress Cleo, druid Troll, necromancer Dracul, paladin Snowy and a professional hit girl Hexadecimal. Heroes already know how much experience will be given for each of the three megabosses: *a* for Mephisto, *b* for Diablo and *c* for Baal.\n\nHere's the problem: heroes are as much as seven and megabosses are only three! Then our heroes decided to split into three teams, where each team will go to destroy their own megaboss. Each team member will receive a of experience, rounded down, where *x* will be the amount of experience for the killed megaboss and *y* — the number of people in the team.\n\nHeroes do not want to hurt each other's feelings, so they want to split into teams so that the difference between the hero who received the maximum number of experience and the hero who received the minimum number of experience were minimal. Since there can be several divisions into teams, then you need to find the one in which the total amount of liking in teams were maximum.\n\nIt is known that some heroes like others. But if hero *p* likes hero *q*, this does not mean that the hero *q* likes hero *p*. No hero likes himself.\n\nThe total amount of liking in teams is the amount of ordered pairs (*p*,<=*q*), such that heroes *p* and *q* are in the same group, and hero *p* likes hero *q* (but it is not important if hero *q* likes hero *p*). In case of heroes *p* and *q* likes each other and they are in the same group, this pair should be counted twice, as (*p*,<=*q*) and (*q*,<=*p*).\n\nA team can consist even of a single hero, but it is important that every megaboss was destroyed. All heroes must be involved in the campaign against evil. None of the heroes can be in more than one team.\n\nIt is guaranteed that every hero is able to destroy any megaboss alone.",
"input": "",
"output": "```python\nimport math\nimport itertools\n\nif __name__ == '__main__':\n N = int(input())\n likes = [input() for i in range(N)]\n likes = [line.split() for line in likes]\n likes = [(words[0], words[2]) for words in likes]\n a, b, c = (float(val) for val in input().split())\n\n min_diff = max(a, b, c)\n possible_groups = []\n for i in range(1, 7 - 1):\n for j in range(1, 7 - i):\n a_e = math.floor(a / i)\n b_e = math.floor(b / j)\n c_e = math.floor(c / (7 - i - j))\n diff = max(a_e, b_e, c_e) - min(a_e, b_e, c_e)\n if diff < min_diff:\n min_diff = diff\n possible_groups = [(i, j)]\n elif diff == min_diff:\n possible_groups.append((i, j))\n max_likes = 0\n for order in itertools.permutations(['Anka', 'Chapay', 'Cleo', 'Troll', 'Dracul', 'Snowy', 'Hexadecimal']):\n for i, j in possible_groups:\n likes_count = 0\n seta = set(order[:i])\n setb = set(order[i:(i + j)])\n setc = set(order[(i + j):])\n for p, q in likes:\n if p in seta and q in seta:\n likes_count += 1 \n if p in setb and q in setb:\n likes_count += 1 \n if p in setc and q in setc:\n likes_count += 1 \n max_likes = max(max_likes, likes_count)\n print(f'{min_diff} {max_likes}')\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular cake, represented as an *r*<=×<=*c* grid. Each cell either has an evil strawberry, or is empty. For example, a 3<=×<=4 cake may look as follows:\n\nThe cakeminator is going to eat the cake! Each time he eats, he chooses a row or a column that does not contain any evil strawberries and contains at least one cake cell that has not been eaten before, and eats all the cake cells there. He may decide to eat any number of times.\n\nPlease output the maximum number of cake cells that the cakeminator can eat.",
"input": "",
"output": "```python\na,b=list(map(int,input().split()))\r\nr=0\r\ng=0\r\nh=0\r\nl=[]\r\nfor i in range(a):\r\n s=input()\r\n if \"S\" in s:\r\n r+=s.count(\"S\")\r\n l.append(list(s))\r\n h+=1\r\n else:\r\n l.append(list(s))\r\n g+=1\r\nif h!=0 and g!=0:\r\n \r\n print(b*r) \r\nelif r==(a*b) :\r\n print(0)\r\nelif g==a:\r\n print(a*b) \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Manao works on a sports TV. He's spent much time watching the football games of some country. After a while he began to notice different patterns. For example, each team has two sets of uniforms: home uniform and guest uniform. When a team plays a game at home, the players put on the home uniform. When a team plays as a guest on somebody else's stadium, the players put on the guest uniform. The only exception to that rule is: when the home uniform color of the host team matches the guests' uniform, the host team puts on its guest uniform as well. For each team the color of the home and guest uniform is different.\n\nThere are *n* teams taking part in the national championship. The championship consists of *n*·(*n*<=-<=1) games: each team invites each other team to its stadium. At this point Manao wondered: how many times during the championship is a host team going to put on the guest uniform? Note that the order of the games does not affect this number.\n\nYou know the colors of the home and guest uniform for each team. For simplicity, the colors are numbered by integers in such a way that no two distinct colors have the same number. Help Manao find the answer to his question.",
"input": "",
"output": "```python\nhs = []\r\nass = []\r\nfor _ in range(int(input())):\r\n h, a = map(int, input().split())\r\n hs.append(h)\r\n ass.append(a)\r\ncount = 0\r\nfor c in hs:\r\n for g in ass:\r\n if c== g:\r\n count+=1\r\n else:\r\n pass\r\nprint(count)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A company has *n* employees numbered from 1 to *n*. Each employee either has no immediate manager or exactly one immediate manager, who is another employee with a different number. An employee *A* is said to be the superior of another employee *B* if at least one of the following is true:\n - Employee *A* is the immediate manager of employee *B* - Employee *B* has an immediate manager employee *C* such that employee *A* is the superior of employee *C*. \nThe company will not have a managerial cycle. That is, there will not exist an employee who is the superior of his/her own immediate manager.\n\nToday the company is going to arrange a party. This involves dividing all *n* employees into several groups: every employee must belong to exactly one group. Furthermore, within any single group, there must not be two employees *A* and *B* such that *A* is the superior of *B*.\n\nWhat is the minimum number of groups that must be formed?",
"input": "",
"output": "```python\n# https://codeforces.com/problemset/problem/115/A\r\n\r\nimport sys\r\n\r\n\r\ninp = tuple(int(line) for line in sys.stdin)\r\nhave_parent, have_child = set(), set()\r\n\r\nflag = -1\r\nfor i in range(1, len(inp)):\r\n if inp[i] == -1:\r\n continue\r\n else:\r\n have_parent.add(i)\r\n if i in have_child:\r\n flag = 3\r\n break\r\n\r\n have_child.add(inp[i])\r\n if inp[i] in have_parent:\r\n flag = 3\r\n break\r\n \r\nif not have_parent and not have_child:\r\n print(1)\r\nelif flag == 3:\r\n print(3)\r\nelse:\r\n print(2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Phone number in Berland is a sequence of *n* digits. Often, to make it easier to memorize the number, it is divided into groups of two or three digits. For example, the phone number 1198733 is easier to remember as 11-987-33. Your task is to find for a given phone number any of its divisions into groups of two or three digits.",
"input": "",
"output": "```python\n\r\nn = int(input())\r\ns = input()\r\n\r\nwhile (len(s) > 4):\r\n print (s[0:2], end='-')\r\n s = s[2:]\r\n\r\nif (len(s) <=3):\r\n print (s)\r\nelse:\r\n print (s[0:2], s[2:4], sep='-')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pasha has many hamsters and he makes them work out. Today, *n* hamsters (*n* is even) came to work out. The hamsters lined up and each hamster either sat down or stood up.\n\nFor another exercise, Pasha needs exactly hamsters to stand up and the other hamsters to sit down. In one minute, Pasha can make some hamster ether sit down or stand up. How many minutes will he need to get what he wants if he acts optimally well?",
"input": "",
"output": "```python\nn = int(input())\na = raw_input().strip()\n\n\nup = 0\n\n\nfor i in a:\n if i == 'X':\n up +=1\n\ndiff = (n // 2) - up\n\nprint(abs(diff))\n\nif diff >= 0:\n print(a.replace('x', 'X', diff))\nelse:\n print(a.replace('X', 'x', abs(diff)))\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Fox Ciel and her friends are in a dancing room. There are *n* boys and *m* girls here, and they never danced before. There will be some songs, during each song, there must be exactly one boy and one girl are dancing. Besides, there is a special rule:\n - either the boy in the dancing pair must dance for the first time (so, he didn't dance with anyone before); - or the girl in the dancing pair must dance for the first time. \nHelp Fox Ciel to make a schedule that they can dance as many songs as possible.",
"input": "",
"output": "```python\nx,y=map(int,input().split())\r\nz,x1,y1=[],[],[]\r\nfor i in range(1,x+1):\r\n\tfor j in range(1,y+1):\r\n\t\tif (i not in x1) or (j not in y1):\r\n\t\t\tx1.append(i)\r\n\t\t\ty1.append(j)\r\n\t\t\tz.append((i,j))\r\nprint(len(z))\r\nfor i in z:print(*i)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Let's denote as the number of bits set ('1' bits) in the binary representation of the non-negative integer *x*.\n\nYou are given multiple queries consisting of pairs of integers *l* and *r*. For each query, find the *x*, such that *l*<=≤<=*x*<=≤<=*r*, and is maximum possible. If there are multiple such numbers find the smallest of them.",
"input": "",
"output": "```python\nimport math\r\n\r\nn = int(input())\r\n\r\nfor _ in range(n):\r\n l, r = tuple(map(int, input().split()))\r\n t = int(math.log2(r + 1))\r\n if 2**t - 1 >= l and 2 ** t - 1 <= r:\r\n print(2 ** t - 1)\r\n else:\r\n print(r)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have *m*<==<=*n*·*k* wooden staves. The *i*-th stave has length *a**i*. You have to assemble *n* barrels consisting of *k* staves each, you can use any *k* staves to construct a barrel. Each stave must belong to exactly one barrel.\n\nLet volume *v**j* of barrel *j* be equal to the length of the minimal stave in it.\n\nYou want to assemble exactly *n* barrels with the maximal total sum of volumes. But you have to make them equal enough, so a difference between volumes of any pair of the resulting barrels must not exceed *l*, i.e. |*v**x*<=-<=*v**y*|<=≤<=*l* for any 1<=≤<=*x*<=≤<=*n* and 1<=≤<=*y*<=≤<=*n*.\n\nPrint maximal total sum of volumes of equal enough barrels or 0 if it's impossible to satisfy the condition above.",
"input": "",
"output": "```python\nfrom bisect import bisect_right\r\n\r\n\r\ndef bad():\r\n print(0)\r\n exit()\r\n\r\n\r\nn, k, l_ = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\n\r\nif n == 1:\r\n print(min(a))\r\n exit()\r\n\r\nif a[1] - a[0] > l_:\r\n bad()\r\n\r\nb = bisect_right(a, a[0] + l_)\r\n\r\nif b < n:\r\n bad()\r\n\r\nto_sum = [0]\r\n\r\nif n == 2:\r\n print(a[0] + a[n // 2])\r\n exit()\r\n\r\nto_sum += [min(k * i, b - n + i) for i in range(1, n)]\r\n\r\nprint(sum(a[i] for i in to_sum))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "An exam for *n* students will take place in a long and narrow room, so the students will sit in a line in some order. The teacher suspects that students with adjacent numbers (*i* and *i*<=+<=1) always studied side by side and became friends and if they take an exam sitting next to each other, they will help each other for sure.\n\nYour task is to choose the maximum number of students and make such an arrangement of students in the room that no two students with adjacent numbers sit side by side.",
"input": "",
"output": "```python\nn = int(input())\r\nl = [i for i in range(1, n+1) if i%2!=0]+[i for i in range(1, n+1) if i%2==0]\r\nfor i in range(n):\r\n try:\r\n if l[i]+1 == l[i+1] or l[i]-1 == l[i+1]:\r\n l.remove(l[i+1])\r\n except IndexError:\r\n break\r\nprint(len(l))\r\nprint(*l)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Stepan has a very big positive integer.\n\nLet's consider all cyclic shifts of Stepan's integer (if we look at his integer like at a string) which are also integers (i.e. they do not have leading zeros). Let's call such shifts as good shifts. For example, for the integer 10203 the good shifts are the integer itself 10203 and integers 20310 and 31020.\n\nStepan wants to know the minimum remainder of the division by the given number *m* among all good shifts. Your task is to determine the minimum remainder of the division by *m*.",
"input": "",
"output": "```python\ns = input()\nm = int(input())\nn = len(s)\ns = s + s\npot = []\npot.append(1)\nfor i in range(1, 200000):\n\tpot.append((pot[i - 1] * 10) % m)\ncur = 0\nmn = 1000000000\nfor i in range(0, 2 * n - 1):\n\tcur = (cur * 10 + ord(s[i]) - ord('0')) % m\n\tif i >= n:\n\t\tcur = (cur - (pot[n] * (ord(s[i]) - ord('0'))) % m + m) % m\n\tif i >= n - 1 and s[i - (n - 1)] != '0':\n\t\tmn = min(mn, cur)\nprint(mn)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Hands that shed innocent blood!\n\nThere are *n* guilty people in a line, the *i*-th of them holds a claw with length *L**i*. The bell rings and every person kills some of people in front of him. All people kill others at the same time. Namely, the *i*-th person kills the *j*-th person if and only if *j*<=<<=*i* and *j*<=≥<=*i*<=-<=*L**i*.\n\nYou are given lengths of the claws. You need to find the total number of alive people after the bell rings.",
"input": "",
"output": "```python\ntest = 1\r\n#test = int(input())\r\nfor _ in range(test):\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n x = 1\r\n k = n-1 - l[n-1]\r\n ind = n-2\r\n while ind >= 0:\r\n if k > ind:\r\n x+=1\r\n k = min(k,ind-l[ind])\r\n ind-=1\r\n print(x)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mr Keks is a typical white-collar in Byteland.\n\nHe has a bookshelf in his office with some books on it, each book has an integer positive price.\n\nMr Keks defines the value of a shelf as the sum of books prices on it. \n\nMiraculously, Mr Keks was promoted and now he is moving into a new office.\n\nHe learned that in the new office he will have not a single bookshelf, but exactly $k$ bookshelves. He decided that the beauty of the $k$ shelves is the [bitwise AND](https://en.wikipedia.org/wiki/Bitwise_operation#AND) of the values of all the shelves.\n\nHe also decided that he won't spend time on reordering the books, so he will place several first books on the first shelf, several next books on the next shelf and so on. Of course, he will place at least one book on each shelf. This way he will put all his books on $k$ shelves in such a way that the beauty of the shelves is as large as possible. Compute this maximum possible beauty.",
"input": "",
"output": "```python\n#!/usr/bin/python3.7\n\nimport sys\n\n\nn, k = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\n\ncur = 0\n\ndef is_submask(n, mask):\n return (n & mask) == mask\n\ndef f(mask):\n s = [[False for j in range(n)] for i in range(n)]\n for l in range(n):\n cur = 0\n for r in range(l, n):\n cur += a[r]\n s[l][r] = is_submask(cur, mask)\n dp = [[False for j in range(n)] for i in range(k)]\n dp[0] = s[0][:]\n for k1 in range(1, k):\n for r in range(n):\n for l in range(1, r + 1):\n dp[k1][r] |= dp[k1 - 1][l - 1] & s[l][r]\n return dp[k - 1][n - 1]\n\ncur = 0\nfor i in range(50, -1, -1):\n if f(cur + 2 ** i):\n cur += 2 ** i\nprint(cur)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In this task you need to process a set of stock exchange orders and use them to create order book.\n\nAn order is an instruction of some participant to buy or sell stocks on stock exchange. The order number *i* has price *p**i*, direction *d**i* — buy or sell, and integer *q**i*. This means that the participant is ready to buy or sell *q**i* stocks at price *p**i* for one stock. A value *q**i* is also known as a volume of an order.\n\nAll orders with the same price *p* and direction *d* are merged into one aggregated order with price *p* and direction *d*. The volume of such order is a sum of volumes of the initial orders.\n\nAn order book is a list of aggregated orders, the first part of which contains sell orders sorted by price in descending order, the second contains buy orders also sorted by price in descending order.\n\nAn order book of depth *s* contains *s* best aggregated orders for each direction. A buy order is better if it has higher price and a sell order is better if it has lower price. If there are less than *s* aggregated orders for some direction then all of them will be in the final order book.\n\nYou are given *n* stock exhange orders. Your task is to print order book of depth *s* for these orders.",
"input": "",
"output": "```python\nn, s = list(map(int, input().split()))\r\nB = []\r\nS = []\r\nfor i in range(n):\r\n st = list(input().split())\r\n st[1], st[2] = int(st[1]), int(st[2])\r\n if st[0] == 'B':\r\n B.append(st)\r\n else:\r\n S.append(st)\r\nB.sort()\r\nS.sort()\r\ni = 0\r\nwhile i < len(B) - 1:\r\n if B[i][1] == B[i + 1][1]:\r\n B[i][2] += B[i + 1][2]\r\n del(B[i + 1])\r\n else:\r\n i += 1\r\ni = 0\r\nwhile i < len(S) - 1:\r\n if S[i][1] == S[i + 1][1]:\r\n S[i][2] += S[i + 1][2]\r\n del(S[i + 1])\r\n else:\r\n i += 1\r\nB.reverse()\r\nfor i in range(min(s, len(S))):\r\n print(*S[i])\r\nfor i in range(min(s, len(B))):\r\n print(*B[i])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Iahub and Iahubina went to a date at a luxury restaurant. Everything went fine until paying for the food. Instead of money, the waiter wants Iahub to write a Hungry sequence consisting of *n* integers. \n\nA sequence *a*1, *a*2, ..., *a**n*, consisting of *n* integers, is Hungry if and only if: \n - Its elements are in increasing order. That is an inequality *a**i*<=<<=*a**j* holds for any two indices *i*,<=*j* (*i*<=<<=*j*). - For any two indices *i* and *j* (*i*<=<<=*j*), *a**j* must not be divisible by *a**i*. \nIahub is in trouble, so he asks you for help. Find a Hungry sequence with *n* elements.",
"input": "",
"output": "```python\nfrom queue import PriorityQueue\r\n\r\n\r\ndef isPrime(n):\r\n if(n==1 or n==0):\r\n return False\r\n for i in range(2,int(n**(1/2))+1):\r\n if(n%i==0):\r\n return False\r\n \r\n return True\r\n\r\ncount = int(input())\r\ns = ''\r\nfor i in range(1, 100000000):\r\n if count == 0:\r\n break\r\n if(isPrime(i)):\r\n s = s+ str(i) + ' '\r\n count -= 1\r\n\r\nprint(s.strip())\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Fox Ciel has *n* boxes in her room. They have the same size and weight, but they might have different strength. The *i*-th box can hold at most *x**i* boxes on its top (we'll call *x**i* the strength of the box). \n\nSince all the boxes have the same size, Ciel cannot put more than one box directly on the top of some box. For example, imagine Ciel has three boxes: the first has strength 2, the second has strength 1 and the third has strength 1. She cannot put the second and the third box simultaneously directly on the top of the first one. But she can put the second box directly on the top of the first one, and then the third box directly on the top of the second one. We will call such a construction of boxes a pile.\n\nFox Ciel wants to construct piles from all the boxes. Each pile will contain some boxes from top to bottom, and there cannot be more than *x**i* boxes on the top of *i*-th box. What is the minimal number of piles she needs to construct?",
"input": "",
"output": "```python\nn = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\ns=[]\r\n\r\nfor i in range(n):\r\n s.sort(reverse = True)\r\n for j in range(len(s)):\r\n if i >= s[j]:\r\n s[j] += 1\r\n break\r\n else:\r\n s.append(1)\r\n\r\nprint(len(s))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "An elephant decided to visit his friend. It turned out that the elephant's house is located at point 0 and his friend's house is located at point *x*(*x*<=><=0) of the coordinate line. In one step the elephant can move 1, 2, 3, 4 or 5 positions forward. Determine, what is the minimum number of steps he need to make in order to get to his friend's house.",
"input": "",
"output": "```python\npos = int(input())\r\nif pos % 5 == 0:\r\n steps = int(pos/5)\r\n print(steps)\r\nelse:\r\n min = int(pos/5)\r\n stepss = min+1\r\n print(stepss)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You've got an array *a*, consisting of *n* integers: *a*1,<=*a*2,<=...,<=*a**n*. Your task is to find a minimal by inclusion segment [*l*,<=*r*] (1<=≤<=*l*<=≤<=*r*<=≤<=*n*) such, that among numbers *a**l*,<= *a**l*<=+<=1,<= ...,<= *a**r* there are exactly *k* distinct numbers.\n\nSegment [*l*,<=*r*] (1<=≤<=*l*<=≤<=*r*<=≤<=*n*; *l*,<=*r* are integers) of length *m*<==<=*r*<=-<=*l*<=+<=1, satisfying the given property, is called minimal by inclusion, if there is no segment [*x*,<=*y*] satisfying the property and less then *m* in length, such that 1<=≤<=*l*<=≤<=*x*<=≤<=*y*<=≤<=*r*<=≤<=*n*. Note that the segment [*l*,<=*r*] doesn't have to be minimal in length among all segments, satisfying the given property.",
"input": "",
"output": "```python\nn, k = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\nfreq = [0] * (100001)\r\ndist = 0\r\nfor i in range(1, n+1):\r\n if freq[a[i]] == 0:\r\n dist += 1\r\n freq[a[i]] += 1\r\nl = 1 \r\nr = n\r\n\r\nif dist < k:\r\n print(-1, -1)\r\nelse:\r\n while dist >= k:\r\n freq[a[r]] -= 1\r\n if freq[a[r]] == 0:\r\n dist -= 1\r\n r -= 1\r\n r += 1\r\n dist += 1\r\n\r\n while dist >= k:\r\n freq[a[l]] -= 1\r\n if freq[a[l]] == 0:\r\n dist -= 1\r\n l += 1\r\n l -= 1\r\n print(l, r)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A dice is a cube, its faces contain distinct integers from 1 to 6 as black points. The sum of numbers at the opposite dice faces always equals 7. Please note that there are only two dice (these dices are mirror of each other) that satisfy the given constraints (both of them are shown on the picture on the left).\n\nAlice and Bob play dice. Alice has built a tower from *n* dice. We know that in this tower the adjacent dice contact with faces with distinct numbers. Bob wants to uniquely identify the numbers written on the faces of all dice, from which the tower is built. Unfortunately, Bob is looking at the tower from the face, and so he does not see all the numbers on the faces. Bob sees the number on the top of the tower and the numbers on the two adjacent sides (on the right side of the picture shown what Bob sees).\n\nHelp Bob, tell whether it is possible to uniquely identify the numbers on the faces of all the dice in the tower, or not.",
"input": "",
"output": "```python\nn = int(input())\nx = int(input())\nfaces = []\ndefault = {1,2,3,4,5,6}\nfor i in range(n):\n raw = set(map(int, input().split()))\n impr = set()\n for v in raw:\n impr.add(v)\n impr.add(7-v)\n if i == 0:\n impr.add(x)\n faces.append(default - impr)\n\ni = 1\nif n == 1:\n print(\"YES\")\n exit()\nfaces[1] = faces[1] - faces[0]\nif len(faces[1]) == 2:\n print(\"NO\")\n exit()\n\ni = 2\nwhile i < n:\n exc = faces[i] - faces[i-1]\n if len(exc) == 0:\n print(\"NO\")\n exit()\n i += 1\n \n \nprint(\"YES\")\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya loves presents. His mum bought him two strings of the same size for his birthday. The strings consist of uppercase and lowercase Latin letters. Now Petya wants to compare those two strings lexicographically. The letters' case does not matter, that is an uppercase letter is considered equivalent to the corresponding lowercase letter. Help Petya perform the comparison.",
"input": "",
"output": "```python\n# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 5 23:07:21 2023\r\n\r\n@author: risha\r\n\"\"\"\r\n\r\ns1=list(input().lower())\r\ns2=list(input().lower())\r\nc=0\r\nfor i in range(len(s1)):\r\n if s1[i]==s2[i]:\r\n c=1\r\n else:\r\n if s1[i]s2[i]:\r\n print(\"1\")\r\n c=0\r\n break\r\nif c==1:\r\n print(0)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Dr. Evil kidnapped Mahmoud and Ehab in the evil land because of their performance in the Evil Olympiad in Informatics (EOI). He decided to give them some problems to let them go.\n\nDr. Evil is interested in sets, He has a set of *n* integers. Dr. Evil calls a set of integers evil if the MEX of it is exactly *x*. the MEX of a set of integers is the minimum non-negative integer that doesn't exist in it. For example, the MEX of the set {0,<=2,<=4} is 1 and the MEX of the set {1,<=2,<=3} is 0 .\n\nDr. Evil is going to make his set evil. To do this he can perform some operations. During each operation he can add some non-negative integer to his set or erase some element from it. What is the minimal number of operations Dr. Evil has to perform to make his set evil?",
"input": "",
"output": "```python\nn, m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nc = 0\r\nfor i in l :\r\n if i < m :\r\n c = c + 1\r\nif m in l :\r\n print(abs(m - c) + 1 )\r\nelse:\r\n print(abs(m - c) )\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mr. Funt now lives in a country with a very specific tax laws. The total income of mr. Funt during this year is equal to *n* (*n*<=≥<=2) burles and the amount of tax he has to pay is calculated as the maximum divisor of *n* (not equal to *n*, of course). For example, if *n*<==<=6 then Funt has to pay 3 burles, while for *n*<==<=25 he needs to pay 5 and if *n*<==<=2 he pays only 1 burle.\n\nAs mr. Funt is a very opportunistic person he wants to cheat a bit. In particular, he wants to split the initial *n* in several parts *n*1<=+<=*n*2<=+<=...<=+<=*n**k*<==<=*n* (here *k* is arbitrary, even *k*<==<=1 is allowed) and pay the taxes for each part separately. He can't make some part equal to 1 because it will reveal him. So, the condition *n**i*<=≥<=2 should hold for all *i* from 1 to *k*.\n\nOstap Bender wonders, how many money Funt has to pay (i.e. minimal) if he chooses and optimal way to split *n* in parts.",
"input": "",
"output": "```python\nfrom sys import exit\r\nn=int(input())\r\ni=2\r\nwhile i*i<=n:\r\n if n%i==0:\r\n if n%2==0:\r\n print(2)\r\n else:\r\n print(3)\r\n exit()\r\n i+=1\r\nprint(1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You've got a string *s*<==<=*s*1*s*2... *s*|*s*| of length |*s*|, consisting of lowercase English letters. There also are *q* queries, each query is described by two integers *l**i*,<=*r**i* (1<=≤<=*l**i*<=≤<=*r**i*<=≤<=|*s*|). The answer to the query is the number of substrings of string *s*[*l**i*... *r**i*], which are palindromes.\n\nString *s*[*l*... *r*]<==<=*s**l**s**l*<=+<=1... *s**r* (1<=≤<=*l*<=≤<=*r*<=≤<=|*s*|) is a substring of string *s*<==<=*s*1*s*2... *s*|*s*|.\n\nString *t* is called a palindrome, if it reads the same from left to right and from right to left. Formally, if *t*<==<=*t*1*t*2... *t*|*t*|<==<=*t*|*t*|*t*|*t*|<=-<=1... *t*1.",
"input": "",
"output": "```python\nfrom array import array\r\nfrom sys import stdin ,stdout ,setrecursionlimit\r\nfrom threading import stack_size , Thread\r\nsetrecursionlimit(2**31-1)\r\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\n\r\ndef palindrome(lef , righ):\r\n while (lef<=righ):\r\n if (st[lef]!=st[righ]):return 0 \r\n lef+=1 \r\n righ-=1\r\n return 1 \r\n \r\n\r\ndef dp(ind ,last):\r\n if ind==lenth:return \r\n if (last,ind) in mem :return\r\n mem[(last,ind)]=palindrome(last , ind)\r\n dp(ind+1,ind+1)\r\n if ind!=lenth-1:\r\n dp(ind+1 , last )\r\n\r\n\r\nst=input().strip() ; lenth=len(st) ; mem={}\r\n\r\n\r\ndef solve():\r\n dp(0,0) \r\n for i in range(lenth):\r\n for j in range(i,lenth):\r\n if j==i :continue\r\n mem[(i,j)]+=mem[(i,j-1 )]\r\n \r\n for i in range(lenth):\r\n for j in range(1,i+1):\r\n mem[(j,i)]+=mem[(j-1,i)]\r\n for _ in range(int(input())):\r\n l,r=map(int,input().split())\r\n l-=1 ; r-=1 \r\n if (l==0): print(mem[(r,r)])\r\n else: print(mem[(r,r)]-mem[(l-1,r)])\r\n\r\nstack_size(10**8) \r\nThread(target=solve).start()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Alena has successfully passed the entrance exams to the university and is now looking forward to start studying.\n\nOne two-hour lesson at the Russian university is traditionally called a pair, it lasts for two academic hours (an academic hour is equal to 45 minutes).\n\nThe University works in such a way that every day it holds exactly *n* lessons. Depending on the schedule of a particular group of students, on a given day, some pairs may actually contain classes, but some may be empty (such pairs are called breaks).\n\nThe official website of the university has already published the schedule for tomorrow for Alena's group. Thus, for each of the *n* pairs she knows if there will be a class at that time or not.\n\nAlena's House is far from the university, so if there are breaks, she doesn't always go home. Alena has time to go home only if the break consists of at least two free pairs in a row, otherwise she waits for the next pair at the university.\n\nOf course, Alena does not want to be sleepy during pairs, so she will sleep as long as possible, and will only come to the first pair that is presented in her schedule. Similarly, if there are no more pairs, then Alena immediately goes home.\n\nAlena appreciates the time spent at home, so she always goes home when it is possible, and returns to the university only at the beginning of the next pair. Help Alena determine for how many pairs she will stay at the university. Note that during some pairs Alena may be at the university waiting for the upcoming pair.",
"input": "",
"output": "```python\nn = int(input(''))\r\nclasses = input('').split(' ')\r\n\r\n#stay = '1 0 1'\r\n\r\ncount = 0\r\nfor j in range(n-2):\r\n if((classes[j] == '1') and (classes[j+1] == '0') and (classes[j+2] == '1')):\r\n count = count + 1\r\n\r\nprint (count + classes.count('1'))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Only *T* milliseconds left before the start of well-known online programming contest Codehorses Round 2017.\n\nPolycarp needs to download B++ compiler to take part in the contest. The size of the file is *f* bytes.\n\nPolycarp's internet tariff allows to download data at the rate of one byte per *t*0 milliseconds. This tariff is already prepaid, and its use does not incur any expense for Polycarp. In addition, the Internet service provider offers two additional packages:\n - download *a*1 bytes at the rate of one byte per *t*1 milliseconds, paying *p*1 burles for the package; - download *a*2 bytes at the rate of one byte per *t*2 milliseconds, paying *p*2 burles for the package. \nPolycarp can buy any package many times. When buying a package, its price (*p*1 or *p*2) is prepaid before usage. Once a package is bought it replaces the regular tariff until package data limit is completely used. After a package is consumed Polycarp can immediately buy a new package or switch to the regular tariff without loosing any time. While a package is in use Polycarp can't buy another package or switch back to the regular internet tariff.\n\nFind the minimum amount of money Polycarp has to spend to download an *f* bytes file no more than in *T* milliseconds.\n\nNote that because of technical reasons Polycarp can download only integer number of bytes using regular tariff and both packages. I.e. in each of three downloading modes the number of downloaded bytes will be integer. It means that Polycarp can't download a byte partially using the regular tariff or/and both packages.",
"input": "",
"output": "```python\nf, T, t0 = map(int, input().split())\r\na1, t1, p1= map(int, input().split())\r\na2, t2, p2= map(int, input().split())\r\n \r\ndef check(x, y):\r\n\tglobal f,T,t0,a1,t1,p1,a2,t2,p2\r\n\tz = f - x*a1-y*a2\r\n\ttemp = x*a1*t1 + y*a2*t2 + z*t0\r\n\tif temp<=T:\r\n\t\treturn p1*x + p2*y\r\n\treturn 1000000000000000004\r\n \r\n\r\nk = min(t0,min(t1,t2))\r\nif(f*k>T):\r\n print(-1)\r\nelif f*t0 <= T:\r\n print(0)\r\nelse:\r\n u1 = a1*t1 - a1*t0\r\n u2 = a2*t2 - a2*t0\r\n j = T - t0*f\r\n val = 1000000000000000004\r\n if(u1>=0):\r\n s = j\r\n if(s%u2==0):\r\n s//=u2\r\n val= min(val,check(0, s))\r\n else:\r\n s//=u2\r\n val= min(val,check(0, s))\r\n s+=1\r\n val= min(val,check(0, s))\r\n \r\n elif(u2>=0):\r\n s = j\r\n if(s%u1==0):\r\n s//=u1\r\n val= min(val,check(s, 0))\r\n else:\r\n s//=u1\r\n val= min(val,check(s, 0))\r\n s+=1\r\n val= min(val,check(s, 0))\r\n else:\r\n for x in range(0, 10000001):\r\n\t s = j - x*u1\r\n\t if(s%u2==0):\r\n\t s//=u2\r\n\t else:\r\n\t s//=u2\r\n\t s+=1\r\n\t if(s<0):\r\n\t break\r\n\t val= min(val,check(x, s))\r\n\t \r\n for x in range(0, 10000001):\r\n\t s = j - x*u2\r\n\t if(s%u1==0):\r\n\t s/=u1\r\n\t else:\r\n\t s//=u1\r\n\t s+=1\r\n\t if(s<0):\r\n\t break\r\n\t val= min(val,check(s,x))\r\n\t \r\n if(val==1000000000000000004):\r\n print(-1)\r\n else:\r\n \tprint(val)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kolya is going to make fresh orange juice. He has *n* oranges of sizes *a*1,<=*a*2,<=...,<=*a**n*. Kolya will put them in the juicer in the fixed order, starting with orange of size *a*1, then orange of size *a*2 and so on. To be put in the juicer the orange must have size not exceeding *b*, so if Kolya sees an orange that is strictly greater he throws it away and continues with the next one.\n\nThe juicer has a special section to collect waste. It overflows if Kolya squeezes oranges of the total size strictly greater than *d*. When it happens Kolya empties the waste section (even if there are no more oranges) and continues to squeeze the juice. How many times will he have to empty the waste section?",
"input": "",
"output": "```python\nn,b,d = map(int,input().split())\r\ns = list(map(int,input().split()))\r\nv = 0\r\not = 0\r\nfor i in range(n):\r\n if s[i] <= b:\r\n v += s[i]\r\n if v > d:\r\n ot += 1\r\n v = 0\r\nif v > d:\r\n ot += 1\r\nprint(ot)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "We consider a positive integer perfect, if and only if the sum of its digits is exactly $10$. Given a positive integer $k$, your task is to find the $k$-th smallest perfect positive integer.",
"input": "",
"output": "```python\ndef truee():\r\n l=sum(map(int,str(j)))\r\n if l==10:\r\n return 1\r\n return 0\r\nn=int(input())\r\nj=19\r\nk=1\r\nwhile k!=n:\r\n j+=9\r\n if truee()==1:\r\n k+=1\r\nprint(j)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mr. Kitayuta has just bought an undirected graph consisting of *n* vertices and *m* edges. The vertices of the graph are numbered from 1 to *n*. Each edge, namely edge *i*, has a color *c**i*, connecting vertex *a**i* and *b**i*.\n\nMr. Kitayuta wants you to process the following *q* queries.\n\nIn the *i*-th query, he gives you two integers — *u**i* and *v**i*.\n\nFind the number of the colors that satisfy the following condition: the edges of that color connect vertex *u**i* and vertex *v**i* directly or indirectly.",
"input": "",
"output": "```python\nfrom collections import defaultdict\r\n\r\ndef dfs(adjlist, start, visited, color):\r\n if start in visited:\r\n return\r\n \r\n for (v,c) in adjlist[start]:\r\n if c == color:\r\n visited.add(start)\r\n visited.add(v)\r\n dfs(adjlist, v, visited, color)\r\n \r\nif __name__ =='__main__':\r\n n,m = map(int, input().split())\r\n adjlist = defaultdict(list)\r\n all_color = set()\r\n for i in range(0,m):\r\n tmp = list(map(int, input().split()))\r\n adjlist[tmp[0]].append((tmp[1],tmp[2]))\r\n adjlist[tmp[1]].append((tmp[0],tmp[2]))\r\n all_color.add(tmp[2])\r\n num_queries = int(input())\r\n queries = []\r\n for i in range(0,num_queries):\r\n queries.append(list(map(int, input().split())))\r\n \r\n color_map = {}\r\n for c in all_color:\r\n visited = set()\r\n for src in range(1,n+1):\r\n dfs(adjlist, src, visited, c)\r\n color_map[c] = visited\r\n \r\n for q in queries:\r\n count = 0\r\n for c in all_color:\r\n if q[0] in color_map[c] and q[1] in color_map[c]:\r\n count += 1\r\n print(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Dwarfs have planted a very interesting plant, which is a triangle directed \"upwards\". This plant has an amusing feature. After one year a triangle plant directed \"upwards\" divides into four triangle plants: three of them will point \"upwards\" and one will point \"downwards\". After another year, each triangle plant divides into four triangle plants: three of them will be directed in the same direction as the parent plant, and one of them will be directed in the opposite direction. Then each year the process repeats. The figure below illustrates this process.\n\nHelp the dwarfs find out how many triangle plants that point \"upwards\" will be in *n* years.",
"input": "",
"output": "```python\nn = int(input())\r\n\r\nmod = 10**9 +7\r\n\r\ndef power_2_k(k):\r\n if k == 0:\r\n return 1\r\n if k % 2 == 0:\r\n lower = power_2_k(k // 2)\r\n return (lower * lower) % mod\r\n else:\r\n k -= 1\r\n lower = power_2_k(k // 2)\r\n return (((lower * lower) % mod) * 2) % mod\r\n\r\np = power_2_k(n)\r\nprint((p * (p + 1) // 2) % mod)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Lolek and Bolek are about to travel abroad by plane. The local airport has a special \"Choose Your Plane\" offer. The offer's conditions are as follows:\n - it is up to a passenger to choose a plane to fly on; - if the chosen plane has *x* (*x*<=><=0) empty seats at the given moment, then the ticket for such a plane costs *x* zlotys (units of Polish currency). \nThe only ticket office of the airport already has a queue of *n* passengers in front of it. Lolek and Bolek have not stood in the queue yet, but they are already wondering what is the maximum and the minimum number of zlotys the airport administration can earn if all *n* passengers buy tickets according to the conditions of this offer?\n\nThe passengers buy tickets in turn, the first person in the queue goes first, then goes the second one, and so on up to *n*-th person.",
"input": "",
"output": "```python\nn, m = map(int, input().split())\r\n\r\nseats = sorted([int(x) for x in input().split()])\r\nseatsc = [s for s in seats]\r\nif n >= sum(seats):\r\n sm = sum([(x * (x + 1)) // 2 for x in seats])\r\n print(sm, sm)\r\nelse:\r\n pc = 0\r\n mncost = 0\r\n mxcost = 0\r\n while pc < n:\r\n ind = seats.index(max(seats))\r\n mxcost += seats[ind]\r\n seats[ind] -= 1\r\n pc += 1\r\n pc = 0\r\n while pc < n:\r\n ind = seatsc.index(min(seatsc))\r\n mncost += seatsc[ind]\r\n seatsc[ind] -= 1\r\n if seatsc[ind] == 0:\r\n seatsc.pop(ind)\r\n pc += 1\r\n print(mxcost,mncost)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The prison of your city has *n* prisoners. As the prison can't accommodate all of them, the city mayor has decided to transfer *c* of the prisoners to a prison located in another city.\n\nFor this reason, he made the *n* prisoners to stand in a line, with a number written on their chests. The number is the severity of the crime he/she has committed. The greater the number, the more severe his/her crime was.\n\nThen, the mayor told you to choose the *c* prisoners, who will be transferred to the other prison. He also imposed two conditions. They are,\n - The chosen *c* prisoners has to form a contiguous segment of prisoners. - Any of the chosen prisoner's crime level should not be greater then *t*. Because, that will make the prisoner a severe criminal and the mayor doesn't want to take the risk of his running away during the transfer. \nFind the number of ways you can choose the *c* prisoners.",
"input": "",
"output": "```python\nn=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nc2=0\r\nway=0\r\nfor i in k:\r\n if i<=n[1]:\r\n c2+=1\r\n else:\r\n c2=0\r\n if c2>n[2]:\r\n way+=1\r\nprint(way)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.\n\nSuppose the graph *G* is given. Subset *A* of its vertices is called a vertex cover of this graph, if for each edge *uv* there is at least one endpoint of it in this set, i.e. or (or both).\n\nPari and Arya have won a great undirected graph as an award in a team contest. Now they have to split it in two parts, but both of them want their parts of the graph to be a vertex cover.\n\nThey have agreed to give you their graph and you need to find two disjoint subsets of its vertices *A* and *B*, such that both *A* and *B* are vertex cover or claim it's impossible. Each vertex should be given to no more than one of the friends (or you can even keep it for yourself).",
"input": "",
"output": "```python\nnVertices, nEdges = map(int, input().split())\r\ng = [[] for _ in range(nVertices)]\r\nedges = []\r\nfor _ in range(nEdges):\r\n u, v = map(lambda x: int(x) - 1, input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\n edges.append((u, v))\r\n\r\ndef dfs(v, m):\r\n mark[v] = m\r\n for to in g[v]:\r\n if not mark[to]:\r\n dfs(to, m ^ 1)\r\n\r\nmark = [None] * nVertices\r\nfor v in range(nVertices):\r\n if not mark[v]:\r\n dfs(v, 0)\r\ncnt1 = cnt2 = 0\r\nfor u, v in edges:\r\n cnt1 += mark[u] == 0 or mark[v] == 0\r\n cnt2 += mark[u] == 1 or mark[v] == 1\r\nif cnt1 != nEdges or cnt2 != nEdges:\r\n print(-1)\r\nelse:\r\n ret = []\r\n ret.append('%d\\n' % mark.count(0))\r\n vertices = []\r\n for v in range(nVertices):\r\n if mark[v] == 0:\r\n vertices.append(v + 1)\r\n ret.append('%s\\n' % ' '.join(map(str, vertices)))\r\n ret.append('%d\\n' % mark.count(1))\r\n vertices = []\r\n for v in range(nVertices):\r\n if mark[v] == 1:\r\n vertices.append(v + 1)\r\n ret.append('%s\\n' % ' '.join(map(str, vertices)))\r\n print(''.join(ret))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "While Mahmoud and Ehab were practicing for IOI, they found a problem which name was Longest common subsequence. They solved it, and then Ehab challenged Mahmoud with another problem.\n\nGiven two strings *a* and *b*, find the length of their longest uncommon subsequence, which is the longest string that is a subsequence of one of them and not a subsequence of the other.\n\nA subsequence of some string is a sequence of characters that appears in the same order in the string, The appearances don't have to be consecutive, for example, strings \"ac\", \"bc\", \"abc\" and \"a\" are subsequences of string \"abc\" while strings \"abbc\" and \"acb\" are not. The empty string is a subsequence of any string. Any string is a subsequence of itself.",
"input": "",
"output": "```python\na=input()\r\nb=input()\r\nif any(i not in iter(a) for i in b): print(max(len(b),len(a)))\r\nelse: print(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all *n* squad soldiers to line up on the parade ground.\n\nBy the military charter the soldiers should stand in the order of non-increasing of their height. But as there's virtually no time to do that, the soldiers lined up in the arbitrary order. However, the general is rather short-sighted and he thinks that the soldiers lined up correctly if the first soldier in the line has the maximum height and the last soldier has the minimum height. Please note that the way other solders are positioned does not matter, including the case when there are several soldiers whose height is maximum or minimum. Only the heights of the first and the last soldier are important.\n\nFor example, the general considers the sequence of heights (4, 3, 4, 2, 1, 1) correct and the sequence (4, 3, 1, 2, 2) wrong.\n\nWithin one second the colonel can swap any two neighboring soldiers. Help him count the minimum time needed to form a line-up which the general will consider correct.",
"input": "",
"output": "```python\nn = int(input())\r\nheights = list(map(int, input().split()))\r\n\r\nposition_max = -1\r\nposition_min = -1\r\n\r\n# Find the positions of maximum and minimum heights\r\nfor i in range(n):\r\n if heights[i] == max(heights):\r\n position_max = i\r\n if heights[i] == min(heights):\r\n position_min = i\r\n\r\n# Calculate the minimum number of swaps needed\r\nif position_max > position_min:\r\n min_swaps = position_max + (n - 1 - position_min) - 1\r\nelse:\r\n min_swaps = position_max + (n - 1 - position_min)\r\n\r\nprint(min_swaps)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Petya often travels to his grandmother in the countryside. The grandmother has a large garden, which can be represented as a rectangle 1<=×<=*n* in size, when viewed from above. This rectangle is divided into *n* equal square sections. The garden is very unusual as each of the square sections possesses its own fixed height and due to the newest irrigation system we can create artificial rain above each section.\n\nCreating artificial rain is an expensive operation. That's why we limit ourselves to creating the artificial rain only above one section. At that, the water from each watered section will flow into its neighbouring sections if their height does not exceed the height of the section. That is, for example, the garden can be represented by a 1<=×<=5 rectangle, where the section heights are equal to 4, 2, 3, 3, 2. Then if we create an artificial rain over any of the sections with the height of 3, the water will flow over all the sections, except the ones with the height of 4. See the illustration of this example at the picture:\n\nAs Petya is keen on programming, he decided to find such a section that if we create artificial rain above it, the number of watered sections will be maximal. Help him.",
"input": "",
"output": "```python\n\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\n\r\ndef rain(arr,n, index):\r\n counter = 1\r\n lindex = index - 1\r\n rindex = index + 1 \r\n currentL = arr[index]\r\n currentR = arr[index]\r\n while(lindex >= 0):\r\n \r\n if arr[lindex] <= currentL:\r\n counter += 1\r\n currentL = arr[lindex]\r\n lindex -= 1\r\n \r\n else:\r\n break\r\n \r\n \r\n while(rindex < n):\r\n if arr[rindex] <= currentR:\r\n counter += 1\r\n currentR = arr[rindex]\r\n rindex += 1 \r\n \r\n\r\n else:\r\n break\r\n\r\n \r\n return counter \r\n \r\n \r\nmax_rain = rain(arr,n, 0)\r\nfor i in range(1,n):\r\n r = rain(arr,n, i) \r\n if r > max_rain:\r\n max_rain = r\r\n \r\nprint(max_rain)\r\n \r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Levko loves tables that consist of *n* rows and *n* columns very much. He especially loves beautiful tables. A table is beautiful to Levko if the sum of elements in each row and column of the table equals *k*.\n\nUnfortunately, he doesn't know any such table. Your task is to help him to find at least one of them.",
"input": "",
"output": "```python\na,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nl=[]\r\nfor i in range(a):\r\n if i!=0:\r\n print(*l)\r\n l=[]\r\n for j in range(a):\r\n if j==0:l.append(b)\r\n else:l.append(0)\r\nprint(*l)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two polar bears Menshykov and Uslada from the St.Petersburg zoo and elephant Horace from the Kiev zoo got six sticks to play with and assess the animals' creativity. Menshykov, Uslada and Horace decided to make either an elephant or a bear from those sticks. They can make an animal from sticks in the following way: \n - Four sticks represent the animal's legs, these sticks should have the same length. - Two remaining sticks represent the animal's head and body. The bear's head stick must be shorter than the body stick. The elephant, however, has a long trunk, so his head stick must be as long as the body stick. Note that there are no limits on the relations between the leg sticks and the head and body sticks. \nYour task is to find out which animal can be made from the given stick set. The zoo keeper wants the sticks back after the game, so they must never be broken, even bears understand it.",
"input": "",
"output": "```python\nssticks = list()\r\nssticks[:] = map(int,input().split(' '))\r\nssticks.sort()\r\nssdict = dict()\r\nfor i in ssticks:\r\n ssdict[i] = 0\r\nfor i in ssticks:\r\n ssdict[i] += 1\r\nssticks = []\r\nfor k in ssdict:\r\n ssticks.append(ssdict[k])\r\n \r\nif ssticks.count(4) > 0:\r\n if ssticks.count(2) > 0:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\nelse: print('Alien')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has a sequence of cubes and exactly one integer is written on each cube. Vasya exhibited all his cubes in a row. So the sequence of numbers written on the cubes in the order from the left to the right equals to *a*1,<=*a*2,<=...,<=*a**n*.\n\nWhile Vasya was walking, his little brother Stepan played with Vasya's cubes and changed their order, so now the sequence of numbers written on the cubes became equal to *b*1,<=*b*2,<=...,<=*b**n*. \n\nStepan said that he swapped only cubes which where on the positions between *l* and *r*, inclusive, and did not remove or add any other cubes (i. e. he said that he reordered cubes between positions *l* and *r*, inclusive, in some way).\n\nYour task is to determine if it is possible that Stepan said the truth, or it is guaranteed that Stepan deceived his brother.",
"input": "",
"output": "```python\nimport sys\r\nn,l,r=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nfor il in range(0,l):\r\n for ir in range(r,n):\r\n if a[il]==b[il] and a[ir]==b[ir]:\r\n print('TRUTH')\r\n exit()\r\n else:\r\n print('LIE')\r\n exit()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pashmak decided to give Parmida a pair of flowers from the garden. There are *n* flowers in the garden and the *i*-th of them has a beauty number *b**i*. Parmida is a very strange girl so she doesn't want to have the two most beautiful flowers necessarily. She wants to have those pairs of flowers that their beauty difference is maximal possible!\n\nYour task is to write a program which calculates two things:\n 1. The maximum beauty difference of flowers that Pashmak can give to Parmida. 1. The number of ways that Pashmak can pick the flowers. Two ways are considered different if and only if there is at least one flower that is chosen in the first way and not chosen in the second way.",
"input": "",
"output": "```python\nfrom collections import Counter\r\n\r\nn=int(input())\r\nb=list(map(int,input().split()))\r\ncnt=Counter(b)\r\nlst=list(cnt)\r\nl,r=lst[0],lst[-1]\r\nprint(cnt[r]-cnt[l],cnt[r]*cnt[l])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given *n* numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given *n* numbers finds one that is different in evenness.",
"input": "",
"output": "```python\nn=int(input())\r\na=list(map(int,input().split(' ')))\r\nfor i in range(n):\r\n if a[0]%2!=a[1]%2 and a[0]%2!=a[2]%2:\r\n print('0')\r\n break\r\n if a[i]%2!=a[i+1]%2 and a[i]%2!=a[i-1]%2:\r\n print(i+1)\r\n break\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "ZS the Coder is coding on a crazy computer. If you don't type in a word for a *c* consecutive seconds, everything you typed disappear! \n\nMore formally, if you typed a word at second *a* and then the next word at second *b*, then if *b*<=-<=*a*<=≤<=*c*, just the new word is appended to other words on the screen. If *b*<=-<=*a*<=><=*c*, then everything on the screen disappears and after that the word you have typed appears on the screen.\n\nFor example, if *c*<==<=5 and you typed words at seconds 1,<=3,<=8,<=14,<=19,<=20 then at the second 8 there will be 3 words on the screen. After that, everything disappears at the second 13 because nothing was typed. At the seconds 14 and 19 another two words are typed, and finally, at the second 20, one more word is typed, and a total of 3 words remain on the screen.\n\nYou're given the times when ZS the Coder typed the words. Determine how many words remain on the screen after he finished typing everything.",
"input": "",
"output": "```python\nq=[int(a)for a in input().split()]\r\nw=[int(a)for a in input().split()]\r\ne=1\r\nif q[0]>1:\r\n for r in range(1,len(w)):\r\n if w[r]-w[r-1]>q[1]:\r\n e=1\r\n else:\r\n e+=1\r\n print(e)\r\nelse:\r\n print(1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kolya has a string *s* of length *n* consisting of lowercase and uppercase Latin letters and digits.\n\nHe wants to rearrange the symbols in *s* and cut it into the minimum number of parts so that each part is a palindrome and all parts have the same lengths. A palindrome is a string which reads the same backward as forward, such as madam or racecar.\n\nYour task is to help Kolya and determine the minimum number of palindromes of equal lengths to cut *s* into, if it is allowed to rearrange letters in *s* before cuttings.",
"input": "",
"output": "```python\nmp,a,p={},[],[]\r\nn=int(input())\r\nfor i in input():\r\n if i in mp:mp[i]+=1\r\n else:mp[i]=1\r\nodd=0\r\nfor i in mp:\r\n if mp[i]&1:\r\n a.append(i)\r\n mp[i]-=1\r\n odd+=1\r\n if mp[i]:\r\n p.append(i)\r\nm=max(1,odd)\r\nfor i in range(m,n+1):\r\n if not n%i:\r\n d=n//i\r\n if odd and not d&1:continue\r\n print(i)\r\n for K in range(i-m):\r\n a.append(p[-1])\r\n if mp[p[-1]]>1:mp[p[-1]]-=1\r\n else:p.pop()\r\n for k in range(i):\r\n s=''\r\n for j in range(d//2):\r\n s+=p[-1]\r\n mp[p[-1]]-=2\r\n if not mp[p[-1]]:p.pop()\r\n if odd:print(s+a.pop()+s[::-1],end=' ')\r\n else:print(s+s[::-1],end=' ')\r\n exit()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer.\n\nAt the start of the day they have *x* ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and Gerda's house even in the night. Each person in the queue wants either to take several ice cream packs for himself and his friends or to give several ice cream packs to Kay and Gerda (carriers that bring ice cream have to stand in the same queue).\n\nIf a carrier with *d* ice cream packs comes to the house, then Kay and Gerda take all his packs. If a child who wants to take *d* ice cream packs comes to the house, then Kay and Gerda will give him *d* packs if they have enough ice cream, otherwise the child will get no ice cream at all and will leave in distress.\n\nKay wants to find the amount of ice cream they will have after all people will leave from the queue, and Gerda wants to find the number of distressed kids.",
"input": "",
"output": "```python\nn,x=list(map(int, input().split()))\r\ndistress=0\r\nfor i in range(n):\r\n query=input().split()\r\n if query[0]=='+':\r\n x+=int(query[1])\r\n else:\r\n if x>=int(query[1]):\r\n x-=int(query[1])\r\n else:\r\n distress+=1\r\nprint(x, distress)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A simple recommendation system would recommend a user things liked by a certain number of their friends. In this problem you will implement part of such a system.\n\nYou are given user's friends' opinions about a list of items. You are also given a threshold *T* — the minimal number of \"likes\" necessary for an item to be recommended to the user.\n\nOutput the number of items in the list liked by at least *T* of user's friends.",
"input": "",
"output": "```python\n\r\nn, m, t = map(int,raw_input().strip().split())\r\nx = []\r\nfor i in xrange(n):\r\n x.append(raw_input().strip())\r\nprint sum([sum([x[i][j] == 'Y' for i in xrange(n)]) >= t for j in xrange(m)])\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pig is visiting a friend.\n\nPig's house is located at point 0, and his friend's house is located at point *m* on an axis.\n\nPig can use teleports to move along the axis.\n\nTo use a teleport, Pig should come to a certain point (where the teleport is located) and choose where to move: for each teleport there is the rightmost point it can move Pig to, this point is known as the limit of the teleport.\n\nFormally, a teleport located at point *x* with limit *y* can move Pig from point *x* to any point within the segment [*x*;<=*y*], including the bounds.\n\nDetermine if Pig can visit the friend using teleports only, or he should use his car.",
"input": "",
"output": "```python\n\r\n\r\nn, m = map(int, input().split())\r\na = []\r\n\r\nfor i in range(m):\r\n\ta.append(False)\r\na[0] = True\r\n\r\nfor _ in range(n):\r\n\tx, y = map(int, input().split())\r\n\tfor i in range(x,y):\r\n\t\ta[i] = True\r\n\r\n\r\nif False in a:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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.\n\nLittle Tommy has *n* lanterns and Big Banban has *m* lanterns. Tommy's lanterns have brightness *a*1,<=*a*2,<=...,<=*a**n*, and Banban's have brightness *b*1,<=*b*2,<=...,<=*b**m* respectively.\n\nTommy intends to hide one of his lanterns, then Banban picks one of Tommy's non-hidden lanterns and one of his own lanterns to form a pair. The pair's brightness will be the product of the brightness of two lanterns.\n\nTommy wants to make the product as small as possible, while Banban tries to make it as large as possible.\n\nYou are asked to find the brightness of the chosen pair if both of them choose optimally.",
"input": "",
"output": "```python\ni,j=map(int,input().split())\r\nli=list(map(int,input().split()))\r\nli.sort()\r\nlj=list(map(int,input().split()))\r\nlj.sort()\r\nprint(li[i-2]*lj[j-1])\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once Bob needed to find the second order statistics of a sequence of integer numbers. Lets choose each number from the sequence exactly once and sort them. The value on the second position is the second order statistics of the given sequence. In other words it is the smallest element strictly greater than the minimum. Help Bob solve this problem.",
"input": "",
"output": "```python\n#rOkY\r\n#FuCk\r\n\r\n################################## kOpAl #####################################\r\n\r\nt=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nx=list(dict.fromkeys(l))\r\n\r\nif(len(x)>1):\r\n print(x[1])\r\nelse:\r\n print('NO')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number *a* and Antisimon receives number *b*. They also have a heap of *n* stones. The players take turns to make a move and Simon starts. During a move a player should take from the heap the number of stones equal to the greatest common divisor of the fixed number he has received and the number of stones left in the heap. A player loses when he cannot take the required number of stones (i. e. the heap has strictly less stones left than one needs to take). \n\nYour task is to determine by the given *a*, *b* and *n* who wins the game.",
"input": "",
"output": "```python\na, b, n = map(int, input().split())\r\na1 = a\r\nb1 = b\r\nn1 = n\r\ncount = 0\r\nc = 0\r\nwhile c != n:\r\n d = n1 - c\r\n while d > 0:\r\n a, d = d, a % d\r\n c += a\r\n a = a1\r\n b = b1\r\n a, b = b, a\r\n count += 1\r\nif count % 2 == 0:\r\n print(1)\r\nelse:\r\n print(0)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "An elephant decided to visit his friend. It turned out that the elephant's house is located at point 0 and his friend's house is located at point *x*(*x*<=><=0) of the coordinate line. In one step the elephant can move 1, 2, 3, 4 or 5 positions forward. Determine, what is the minimum number of steps he need to make in order to get to his friend's house.",
"input": "",
"output": "```python\nimport sys\r\ndef I(): return int(sys.stdin.readline().rstrip())\r\ndef LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\r\ndef MI(): return map(int, sys.stdin.readline().rstrip().split())\r\ndef SI(): return sys.stdin.readline().rstrip()\r\n\r\n\r\ndef main():\r\n n = I()\r\n count = 0\r\n while n > 0:\r\n if n > 5:\r\n count += 1\r\n n -= 5\r\n else:\r\n count += 1\r\n n -= n\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya has got 2*n* cards, each card contains some integer. The numbers on the cards can be the same. Let's index all cards by consecutive integers from 1 to 2*n*. We'll denote the number that is written on a card with number *i*, as *a**i*. In order to play one entertaining game with his friends, Petya needs to split the cards into pairs so that each pair had equal numbers on the cards. Help Petya do that.",
"input": "",
"output": "```python\nimport re\r\nimport sys\r\nexit=sys.exit\r\nfrom bisect import bisect_left as bsl,bisect_right as bsr\r\nfrom collections import Counter,defaultdict as ddict,deque\r\nfrom functools import lru_cache\r\ncache=lru_cache(None)\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom math import inf\r\nfrom pprint import pprint as pp\r\nenum=enumerate\r\nri=lambda:int(rln())\r\nris=lambda:list(map(int,rfs()))\r\nrln=sys.stdin.readline\r\nrl=lambda:rln().rstrip('\\n')\r\nrfs=lambda:rln().split()\r\ncat=''.join\r\ncatn='\\n'.join\r\nmod=1000000007\r\nd4=[(0,-1),(1,0),(0,1),(-1,0)]\r\nd8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\n########################################################################\r\n\r\nn=ri()\r\na=ris()\r\nd=ddict(set)\r\nfor i in range(2*n):\r\n d[a[i]].add(i)\r\nans=[]\r\nfor x in d:\r\n if len(d[x])%2:\r\n print(-1)\r\n exit()\r\n while d[x]:\r\n j=d[x].pop()\r\n i=d[x].pop()\r\n ans.append((i,j))\r\nfor i,j in ans:\r\n print(1+i,1+j)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A median in an array with the length of *n* is an element which occupies position number after we sort the elements in the non-decreasing order (the array elements are numbered starting with 1). A median of an array (2,<=6,<=1,<=2,<=3) is the number 2, and a median of array (0,<=96,<=17,<=23) — the number 17.\n\nWe define an expression as the integer part of dividing number *a* by number *b*.\n\nOne day Vasya showed Petya an array consisting of *n* integers and suggested finding the array's median. Petya didn't even look at the array and said that it equals *x*. Petya is a very honest boy, so he decided to add several numbers to the given array so that the median of the resulting array would be equal to *x*.\n\nPetya can add any integers from 1 to 105 to the array, including the same numbers. Of course, he can add nothing to the array. If a number is added multiple times, then we should consider it the number of times it occurs. It is not allowed to delete of change initial numbers of the array. \n\nWhile Petya is busy distracting Vasya, your task is to find the minimum number of elements he will need.",
"input": "",
"output": "```python\n\"\"\"\nModule which implements the search of the minimum number of elements to be inserted\nin order to make the given number the median of this array.\n\"\"\"\ndef min_num(positions: list, length: int, count: int):\n \"\"\"\n Return the minimum number of elements.\n \"\"\"\n result = count\n if ((length+1) // 2 - 1) in positions:\n return result\n if positions[-1] < ((length+1) // 2 - 1):\n while positions[-1] != ((length+1) // 2 - 1):\n result += 1\n positions[-1] += 1\n length += 1\n if positions[0] > ((length+1) // 2 - 1):\n while positions[0] != ((length+1) // 2 - 1):\n result += 1\n length += 1\n return result\n\nif __name__ == \"__main__\":\n settings = [int(x) for x in input().split(\" \")]\n array = [int(x) for x in input().split(\" \")]\n count = 0\n if settings[1] not in array:\n array.append(settings[1])\n count += 1\n settings[0] += 1\n array.sort()\n positions = []\n for i in range(len(array)):\n if array[i] == settings[1]:\n positions.append(i)\n print(min_num(positions, settings[0], count))\n\t \t\t \t \t\t\t\t \t \t\t\t \t\t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kefa decided to make some money doing business on the Internet for exactly *n* days. He knows that on the *i*-th day (1<=≤<=*i*<=≤<=*n*) he makes *a**i* money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence *a**i*. Let us remind you that the subsegment of the sequence is its continuous fragment. A subsegment of numbers is called non-decreasing if all numbers in it follow in the non-decreasing order.\n\nHelp Kefa cope with this task!",
"input": "",
"output": "```python\nn=int(input())\r\n\r\nsub=[]\r\nseq=list (map (int , input().split()))\r\n\r\ns=1\r\nfor i in range(1,len(seq)):\r\n if seq[i]>=seq[i-1]:\r\n s=s+1\r\n else:\r\n sub.append(s)\r\n s=1\r\n sub.append(s)\r\nprint(max(sub))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently Adaltik discovered japanese crosswords. Japanese crossword is a picture, represented as a table sized *a*<=×<=*b* squares, and each square is colored white or black. There are integers to the left of the rows and to the top of the columns, encrypting the corresponding row or column. The number of integers represents how many groups of black squares there are in corresponding row or column, and the integers themselves represents the number of consecutive black squares in corresponding group (you can find more detailed explanation in Wikipedia [https://en.wikipedia.org/wiki/Japanese_crossword](https://en.wikipedia.org/wiki/Japanese_crossword)).\n\nAdaltik decided that the general case of japanese crossword is too complicated and drew a row consisting of *n* squares (e.g. japanese crossword sized 1<=×<=*n*), which he wants to encrypt in the same way as in japanese crossword.\n\nHelp Adaltik find the numbers encrypting the row he drew.",
"input": "",
"output": "```python\ninput()\r\nx = input().split('W')\r\ny= [len(i) for i in x if len(i)>0]\r\nprint(len(y))\r\nprint(*y)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You have an array *a* consisting of *n* integers. Each integer from 1 to *n* appears exactly once in this array.\n\nFor some indices *i* (1<=≤<=*i*<=≤<=*n*<=-<=1) it is possible to swap *i*-th element with (*i*<=+<=1)-th, for other indices it is not possible. You may perform any number of swapping operations any order. There is no limit on the number of times you swap *i*-th element with (*i*<=+<=1)-th (if the position is not forbidden).\n\nCan you make this array sorted in ascending order performing some sequence of swapping operations?",
"input": "",
"output": "```python\nR = lambda:map(int,input().split())\r\nn = int(input())\r\nC = list(R())\r\ns = input()\r\ntt = 0\r\nfor i in range(n - 1):\r\n\tif C[i] > C[i + 1]:\r\n\t\tif s[i] == '0':\r\n\t\t\tprint(\"no\")\r\n\t\t\ttt = 1\r\n\t\t\tbreak\r\n\t\telse: \r\n\t\t\tt = i\r\n\t\t\twhile t >= 0 and C[t] > C[t + 1] and s[t] == '1':\r\n\t\t\t\tC[t + 1], C[t] = C[t], C[t + 1]\r\n\t\t\t\tt -= 1\r\n\t\t\tif C[t] > C[t + 1]:\r\n\t\t\t\tprint(\"no\")\r\n\t\t\t\ttt = 1\r\n\t\t\t\tbreak\r\nf = [i for i in range(1,n + 1)]\r\nif tt == 0:\r\n if f == C:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\nn1=(input(\"Enter a word : \"))\nu=0\nl=0\nfor i in n1:\n if 65<=ord(i)<=90:\n u+=1\n else:\n l+=1\nif u>l:\n print(n1.upper())\nelse:\n print(n1.lower()) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently, Vladimir got bad mark in algebra again. To avoid such unpleasant events in future he decided to train his arithmetic skills. He wrote four integer numbers *a*, *b*, *c*, *d* on the blackboard. During each of the next three minutes he took two numbers from the blackboard (not necessarily adjacent) and replaced them with their sum or their product. In the end he got one number. Unfortunately, due to the awful memory he forgot that number, but he remembers four original numbers, sequence of the operations and his surprise because of the very small result. Help Vladimir remember the forgotten number: find the smallest number that can be obtained from the original numbers by the given sequence of operations.",
"input": "",
"output": "```python\nimport itertools\r\nimport math\r\nimport time\r\nfrom builtins import input, range\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nimport collections\r\nfrom heapq import heappop, heappush\r\nimport random\r\nimport os\r\nfrom random import randint\r\nimport decimal\r\n\r\n# from sys import stdin, stdout\r\n# input, print = stdin.readline, stdout.write\r\n\r\ndecimal.getcontext().prec = 18\r\n\r\n\r\ndef solve():\r\n def rec(op, arr):\r\n mn = 1 << 60\r\n for f in range(len(arr)):\r\n for s in range(f + 1, len(arr)):\r\n if len(arr) == 2:\r\n if op == \"+\":\r\n return arr[f] + arr[s]\r\n else:\r\n return arr[f] * arr[s]\r\n\r\n new_arr = arr * 1\r\n new_arr.remove(arr[f])\r\n new_arr.remove(arr[s])\r\n\r\n if op == \"+\":\r\n new_arr.append(arr[f] + arr[s])\r\n else:\r\n new_arr.append(arr[f] * arr[s])\r\n\r\n mn = min(mn, rec(ops[4 - len(arr) + 1], new_arr))\r\n\r\n return mn\r\n\r\n a = list(map(int, input().split()))\r\n ops = list(map(str, input().split()))\r\n\r\n print(rec(ops[0], a))\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "DZY loves chemistry, and he enjoys mixing chemicals.\n\nDZY has *n* chemicals, and *m* pairs of them will react. He wants to pour these chemicals into a test tube, and he needs to pour them in one by one, in any order. \n\nLet's consider the danger of a test tube. Danger of an empty test tube is 1. And every time when DZY pours a chemical, if there are already one or more chemicals in the test tube that can react with it, the danger of the test tube will be multiplied by 2. Otherwise the danger remains as it is.\n\nFind the maximum possible danger after pouring all the chemicals one by one in optimal order.",
"input": "",
"output": "```python\ndef get(Array, Item):\r\n if Array[Item] == Item: return Item\r\n Array[Item] = get(Array, Array[Item]);\r\n return Array[Item]\r\n\r\nn ,m = map(int , input().split(' '))\r\nchem = [i for i in range(1+n)]\r\nans = 0\r\nrank = [1]*(n+1)\r\nfor _ in range(m):\r\n a, b = map(int , input().split(' '))\r\n chem[get(chem , a)] = get(chem , b)\r\nrec = [0]*(n+1)\r\nfor x in chem:\r\n rec[get(chem ,x)]+= 1\r\nfor x in rec:\r\n if x > 1:\r\n ans+=(x-1)\r\nprint(2**ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has a beautiful garden where wonderful fruit trees grow and yield fantastic harvest every year. But lately thieves started to sneak into the garden at nights and steal the fruit too often. Vasya can’t spend the nights in the garden and guard the fruit because there’s no house in the garden! Vasya had been saving in for some time and finally he decided to build the house. The rest is simple: he should choose in which part of the garden to build the house. In the evening he sat at his table and drew the garden’s plan. On the plan the garden is represented as a rectangular checkered field *n*<=×<=*m* in size divided into squares whose side length is 1. In some squares Vasya marked the trees growing there (one shouldn’t plant the trees too close to each other that’s why one square contains no more than one tree). Vasya wants to find a rectangular land lot *a*<=×<=*b* squares in size to build a house on, at that the land lot border should go along the lines of the grid that separates the squares. All the trees that grow on the building lot will have to be chopped off. Vasya loves his garden very much, so help him choose the building land lot location so that the number of chopped trees would be as little as possible.",
"input": "",
"output": "```python\ndef calc_trees(cont: list, start_row: int, start_col: int, area_h, area_w) -> int:\r\n trees = 0\r\n for i in range(start_row, start_row + area_h):\r\n for j in range(start_col, start_col + area_w):\r\n trees += cont[i][j]\r\n\r\n\r\nn, m = [int(item) for item in input().split(' ')]\r\ncont = []\r\nfor i in range(n):\r\n # subArr = [int(item) for item in input().split(' ')]\r\n # cont.append(subArr)\r\n cont.append([int(item) for item in input().split(' ')])\r\n\r\na, b = [int(item) for item in input().split(' ')]\r\n\r\n# print(f'cont => {cont}')\r\nans = n * m\r\nfor i in range(n):\r\n for j in range(m):\r\n if i <= n - a and j <= m - b:\r\n temp = calc_trees(cont, i, j, a, b)\r\n if ans > temp:\r\n ans = temp\r\n if i <= n - b and j <= m - a:\r\n temp = calc_trees(cont, i, j, b, a)\r\n if ans > temp:\r\n ans = temp\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A tennis tournament with *n* participants is running. The participants are playing by an olympic system, so the winners move on and the losers drop out.\n\nThe tournament takes place in the following way (below, *m* is the number of the participants of the current round):\n - let *k* be the maximal power of the number 2 such that *k*<=≤<=*m*, - *k* participants compete in the current round and a half of them passes to the next round, the other *m*<=-<=*k* participants pass to the next round directly, - when only one participant remains, the tournament finishes. \nEach match requires *b* bottles of water for each participant and one bottle for the judge. Besides *p* towels are given to each participant for the whole tournament.\n\nFind the number of bottles and towels needed for the tournament.\n\nNote that it's a tennis tournament so in each match two participants compete (one of them will win and the other will lose).",
"input": "",
"output": "```python\nn,b,p = [int(c) for c in input().split()]\n\n\nprint((n-1)*(2*b+1), n*p)\n\n\t \t\t\t\t\t \t\t \t \t\t \t \t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Hag is a very talented person. He has always had an artist inside him but his father forced him to study mechanical engineering.\n\nYesterday he spent all of his time cutting a giant piece of wood trying to make it look like a goose. Anyway, his dad found out that he was doing arts rather than studying mechanics and other boring subjects. He confronted Hag with the fact that he is a spoiled son that does not care about his future, and if he continues to do arts he will cut his 25 Lira monthly allowance.\n\nHag is trying to prove to his dad that the wooden piece is a project for mechanics subject. He also told his dad that the wooden piece is a strictly convex polygon with $n$ vertices.\n\nHag brought two pins and pinned the polygon with them in the $1$-st and $2$-nd vertices to the wall. His dad has $q$ queries to Hag of two types. \n - $1$ $f$ $t$: pull a pin from the vertex $f$, wait for the wooden polygon to rotate under the gravity force (if it will rotate) and stabilize. And then put the pin in vertex $t$. - $2$ $v$: answer what are the coordinates of the vertex $v$. \nPlease help Hag to answer his father's queries.\n\nYou can assume that the wood that forms the polygon has uniform density and the polygon has a positive thickness, same in all points. After every query of the 1-st type Hag's dad tries to move the polygon a bit and watches it stabilize again.",
"input": "",
"output": "```python\n#!/usr/bin/env python3\n\n\nfrom math import hypot\n\n[n, q] = map(int, input().strip().split())\nxys = [tuple(map(int, input().strip().split())) for _ in range(n)]\nqis = [tuple(map(int, input().strip().split())) for _ in range(q)]\n\ndxys = [(xys[(i + 1) % n][0] - xys[i][0], xys[(i + 1) % n][1] - xys[i][1]) for i in range(n)]\n\nS = 3 * sum((x*dy - y*dx) for (x, y), (dx, dy) in zip(xys, dxys))\nSx = sum((dx + 2*x) * (x*dy - y*dx) for (x, y), (dx, dy) in zip(xys, dxys))\nSy = sum((dy + 2*y) * (x*dy - y*dx) for (x, y), (dx, dy) in zip(xys, dxys))\n#Sy = sum((2*dx*dy + 3*x*dx + 3*x*dy + 6*x*y)*dy for (x, y), (dx, dy) in zip(xys, dxys))\nfor p in [2, 3]:\n\twhile S % p == Sx % p == Sy % p == 0:\n\t\tS //= p\n\t\tSx //= p\n\t\tSy //= p\n\nxyms = [(S*x - Sx, S*y - Sy) for x, y in xys]\nhs = [hypot(x, y) for x, y in xyms]\n\ndef to_coord(x, y):\n\treturn (x + Sx) / S, (y + Sy) / S\n\nhangs = (0, 1)\nhang_on = None\ncx, cy = 0.0, 0.0\n\n# hang on u\ndef get_v(v):\n\tif hang_on is None:\n\t\treturn xyms[v]\n\telse:\n\t\tux, uy = xyms[hang_on]\n\t\tvx, vy = xyms[v]\n\t\th = hs[hang_on]\n\t\treturn ((uy * vx - ux * vy) / h, (ux * vx + uy * vy) / h)\n\n#def ss(v1, v2):\n#\treturn tuple(vi + vj for vi, vj in zip(v1, v2))\n\n#def disp():\n#\tprint ('hangs on', hang_on, 'of', hangs)\n#\tprint ('center', to_coord(cx, cy))\n#\tprint ({i: to_coord(*ss(get_v(i), (cx, cy))) for i in range(n)})\n\t\n#disp()\nfor qi in qis:\n\tif qi[0] == 1:\n\t\t_, f, t = qi # 1-indexation\n\t\ts = hangs[1 - hangs.index(f - 1)]\n\t\tdx, dy = get_v(s)\n\t\tcx += dx\n\t\tcy += dy - hs[s]\n\t\thang_on = s\n\t\thangs = (s, t - 1)\n#\t\tprint ('{} --> {}'.format(f - 1, t - 1))\n#\t\tdisp()\n\telse:\n\t\t_, v = qi # 1-indexation\n\t\tdx, dy = get_v(v - 1)\n\t\tprint (*to_coord(cx + dx, cy + dy))\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "We call a string good, if after merging all the consecutive equal characters, the resulting string is palindrome. For example, \"aabba\" is good, because after the merging step it will become \"aba\".\n\nGiven a string, you have to find two values:\n 1. the number of good substrings of even length; 1. the number of good substrings of odd length.",
"input": "",
"output": "```python\ns=input()\r\nans_odd=0\r\nans_even=0\r\ncnt_odd=[0,0]\r\ncnt_even=[0,0]\r\nfor i in range(len(s)):\r\n id=ord(s[i])-ord(\"a\")\r\n ans_odd+=1\r\n if i%2==0:\r\n ans_even+=cnt_odd[id]\r\n ans_odd+=cnt_even[id]\r\n cnt_even[id]+=1\r\n else:\r\n ans_odd+=cnt_odd[id]\r\n ans_even+=cnt_even[id]\r\n cnt_odd[id]+=1\r\nprint(ans_even,ans_odd)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day the Codeforces round author sat exams. He had *n* exams and he needed to get an integer from 2 to 5 for each exam. He will have to re-sit each failed exam, i.e. the exam that gets mark 2. \n\nThe author would need to spend too much time and effort to make the sum of his marks strictly more than *k*. That could have spoilt the Codeforces round. On the other hand, if the sum of his marks is strictly less than *k*, the author's mum won't be pleased at all. \n\nThe Codeforces authors are very smart and they always get the mark they choose themselves. Also, the Codeforces authors just hate re-sitting exams. \n\nHelp the author and find the minimum number of exams he will have to re-sit if he passes the exams in the way that makes the sum of marks for all *n* exams equal exactly *k*.",
"input": "",
"output": "```python\nn, k = map(int, input().split())\n\nresult = 51\n\n\ndef dfs(remain_exams: int, slate: list):\n global result\n if remain_exams == 0:\n if sum(slate) == k:\n num_2 = len([score for score in slate if score == 2])\n if num_2 < result:\n result = num_2\n else:\n for i in range(2, 6):\n slate.append(i)\n dfs(remain_exams - 1, slate)\n slate.pop()\n\n\ndfs(n, [])\nprint(result)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Your friend has *n* cards.\n\nYou know that each card has a lowercase English letter on one side and a digit on the other.\n\nCurrently, your friend has laid out the cards on a table so only one side of each card is visible.\n\nYou would like to know if the following statement is true for cards that your friend owns: \"If a card has a vowel on one side, then it has an even digit on the other side.\" More specifically, a vowel is one of 'a', 'e', 'i', 'o' or 'u', and even digit is one of '0', '2', '4', '6' or '8'.\n\nFor example, if a card has 'a' on one side, and '6' on the other side, then this statement is true for it. Also, the statement is true, for example, for a card with 'b' and '4', and for a card with 'b' and '3' (since the letter is not a vowel). The statement is false, for example, for card with 'e' and '5'. You are interested if the statement is true for all cards. In particular, if no card has a vowel, the statement is true.\n\nTo determine this, you can flip over some cards to reveal the other side. You would like to know what is the minimum number of cards you need to flip in the worst case in order to verify that the statement is true.",
"input": "",
"output": "```python\nneeds_flipping = ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9']\r\n \r\ndef flip(s):\r\n flip_count = 0\r\n for letter in s:\r\n if letter in needs_flipping:\r\n flip_count += 1\r\n return flip_count\r\n \r\nprint(flip(input()))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Valera had two bags of potatoes, the first of these bags contains *x* (*x*<=≥<=1) potatoes, and the second — *y* (*y*<=≥<=1) potatoes. Valera — very scattered boy, so the first bag of potatoes (it contains *x* potatoes) Valera lost. Valera remembers that the total amount of potatoes (*x*<=+<=*y*) in the two bags, firstly, was not gerater than *n*, and, secondly, was divisible by *k*.\n\nHelp Valera to determine how many potatoes could be in the first bag. Print all such possible numbers in ascending order.",
"input": "",
"output": "```python\ndef solver(y, k, n):\r\n x = n - y\r\n\r\n ans = []\r\n for i in range(0,x):\r\n if (y+i+1) % k == 0:\r\n ans.append(str(i+1))\r\n\r\n return '-1' if ans == [] else ' '.join(ans)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n y, k, n = map(int, input().split(\" \"))\r\n print(solver(y, k, n))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Natasha is planning an expedition to Mars for $n$ people. One of the important tasks is to provide food for each participant.\n\nThe warehouse has $m$ daily food packages. Each package has some food type $a_i$.\n\nEach participant must eat exactly one food package each day. Due to extreme loads, each participant must eat the same food type throughout the expedition. Different participants may eat different (or the same) types of food.\n\nFormally, for each participant $j$ Natasha should select his food type $b_j$ and each day $j$-th participant will eat one food package of type $b_j$. The values $b_j$ for different participants may be different.\n\nWhat is the maximum possible number of days the expedition can last, following the requirements above?",
"input": "",
"output": "```python\n\r\ndef get_longest(left_num, cur_depth, max_depth):\r\n if(cur_depth == max_depth):\r\n if left_num == 0:\r\n return 9999999\r\n else:\r\n return int(food_dict[sorted_food_key[max_depth - 1]] / left_num)\r\n else:\r\n cur_long = 0\r\n for i in range(0, left_num + 1):\r\n if i == 0:\r\n this_food_alive = 9999999\r\n else:\r\n this_food_alive = int(food_dict[sorted_food_key[cur_depth - 1]] / i)\r\n next_food_alive = get_longest(left_num - i, cur_depth + 1, max_depth)\r\n min_val = min(next_food_alive, this_food_alive)\r\n cur_long = max(min_val, cur_long)\r\n return cur_long\r\n \r\n \r\n\r\n\r\n\r\n\r\ninput_list = list(map(int, input().split()))\r\nfoods = list(map(int, input().split()))\r\n\r\nparticip_count = input_list[0]\r\npackage_count = input_list[1]\r\n\r\nif package_count < particip_count:\r\n print(0)\r\nelse:\r\n food_dict = dict()\r\n for food in foods:\r\n if food in food_dict:\r\n food_dict[food] = food_dict[food] + 1\r\n else:\r\n food_dict[food] = 1\r\n\r\n sorted_food_key = sorted(food_dict, key=lambda food: food_dict[food], reverse=True)\r\n\r\n if particip_count < len(sorted_food_key):\r\n sorted_food_key = sorted_food_key[:particip_count]\r\n elif particip_count > len(sorted_food_key):\r\n key_offset = 1\r\n while particip_count > len(food_dict):\r\n food_dict[999 + key_offset] = 0\r\n key_offset = key_offset + 1\r\n sorted_food_key = sorted(food_dict, key=lambda food: food_dict[food], reverse=True)\r\n else:\r\n key_offset = 1\r\n\r\n print(get_longest(particip_count, 1, particip_count));\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Our old friend Alexey has finally entered the University of City N — the Berland capital. Alexey expected his father to get him a place to live in but his father said it was high time for Alexey to practice some financial independence. So, Alexey is living in a dorm. \n\nThe dorm has exactly one straight dryer — a 100 centimeter long rope to hang clothes on. The dryer has got a coordinate system installed: the leftmost end of the dryer has coordinate 0, and the opposite end has coordinate 100. Overall, the university has *n* students. Dean's office allows *i*-th student to use the segment (*l**i*,<=*r**i*) of the dryer. However, the dean's office actions are contradictory and now one part of the dryer can belong to multiple students!\n\nAlexey don't like when someone touch his clothes. That's why he want make it impossible to someone clothes touch his ones. So Alexey wonders: what is the total length of the parts of the dryer that he may use in a such way that clothes of the others (*n*<=-<=1) students aren't drying there. Help him! Note that Alexey, as the most respected student, has number 1.",
"input": "",
"output": "```python\nimport numpy as np\n\nnum_of_student = int(input())\nsush = list()\n\nfor i in range(0, num_of_student):\n inp = input()\n inp_spl = inp.split(\" \")\n sush.append(int(inp_spl[0]))\n sush.append(int(inp_spl[1]))\n\none_range = np.zeros((np.max(sush)+1,))\n\nfor i in range(0, num_of_student*2, 2):\n one_range[sush[i]:sush[i+1]] = i+1\n\ncount = 0\nfor i in one_range:\n if i == 1:\n count += 1\n\nprint(count)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Permutation *p* is an ordered set of integers *p*1,<=<=*p*2,<=<=...,<=<=*p**n*, consisting of *n* distinct positive integers, each of them doesn't exceed *n*. We'll denote the *i*-th element of permutation *p* as *p**i*. We'll call number *n* the size or the length of permutation *p*1,<=<=*p*2,<=<=...,<=<=*p**n*.\n\nYou have a sequence of integers *a*1,<=*a*2,<=...,<=*a**n*. In one move, you are allowed to decrease or increase any number by one. Count the minimum number of moves, needed to build a permutation from this sequence.",
"input": "",
"output": "```python\nt = int(input())\r\nres = 0\r\ns = sorted(list(map(int, input().split())))\r\nfor i in range(0, t):\r\n res+=abs(i+1 - s[i])\r\nprint(res)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You may have heard of the pie rule before. It states that if two people wish to fairly share a slice of pie, one person should cut the slice in half, and the other person should choose who gets which slice. Alice and Bob have many slices of pie, and rather than cutting the slices in half, each individual slice will be eaten by just one person.\n\nThe way Alice and Bob decide who eats each slice is as follows. First, the order in which the pies are to be handed out is decided. There is a special token called the \"decider\" token, initially held by Bob. Until all the pie is handed out, whoever has the decider token will give the next slice of pie to one of the participants, and the decider token to the other participant. They continue until no slices of pie are left.\n\nAll of the slices are of excellent quality, so each participant obviously wants to maximize the total amount of pie they get to eat. Assuming both players make their decisions optimally, how much pie will each participant receive?",
"input": "",
"output": "```python\n\n\nimport sys\n\ncache = {}\n\ndef max_possible(pie_slices, current_slice):\n\n if current_slice in cache:\n return cache[current_slice]\n\n if len(pie_slices) - 1 == current_slice:\n return pie_slices[current_slice]\n\n opp = pie_slices[current_slice]\n for cs in range(current_slice + 1, len(pie_slices)):\n c1 = max_possible(pie_slices, cs)\n if opp > c1:\n return opp\n\n opp += pie_slices[cs]\n\n return pie_slices[current_slice] + sum(pie_slices[current_slice + 1:]) - max_possible(pie_slices, current_slice + 1)\n\ndef main():\n n = int(sys.stdin.readline().strip())\n\n pie_slices = [int(tok) for tok in sys.stdin.readline().strip().split()]\n\n b = max_possible(pie_slices, 0)\n print(sum(pie_slices) - b, b)\n\n\n\n\n\n\n\n\nif __name__ == '__main__':\n main()\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a fence in front of Polycarpus's home. The fence consists of *n* planks of the same width which go one after another from left to right. The height of the *i*-th plank is *h**i* meters, distinct planks can have distinct heights.\n\nPolycarpus has bought a posh piano and is thinking about how to get it into the house. In order to carry out his plan, he needs to take exactly *k* consecutive planks from the fence. Higher planks are harder to tear off the fence, so Polycarpus wants to find such *k* consecutive planks that the sum of their heights is minimal possible.\n\nWrite the program that finds the indexes of *k* consecutive planks with minimal total height. Pay attention, the fence is not around Polycarpus's home, it is in front of home (in other words, the fence isn't cyclic).",
"input": "",
"output": "```python\nn,k=map(int,input().split())\r\nh=list(map(int,input().split()))\r\nj_min=sum(h[0:k])\r\nj=0\r\nfor i in range(1,n-k):\r\n p=j_min-h[i-1]+h[i+k]\r\n if p15:\r\n print(now+15)\r\n sys.exit(0)\r\n else:\r\n now=i\r\nprint(90)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.\n\nA little later they found a string *s*, carved on a rock below the temple's gates. Asterix supposed that that's the password that opens the temple and read the string aloud. However, nothing happened. Then Asterix supposed that a password is some substring *t* of the string *s*.\n\nPrefix supposed that the substring *t* is the beginning of the string *s*; Suffix supposed that the substring *t* should be the end of the string *s*; and Obelix supposed that *t* should be located somewhere inside the string *s*, that is, *t* is neither its beginning, nor its end.\n\nAsterix chose the substring *t* so as to please all his companions. Besides, from all acceptable variants Asterix chose the longest one (as Asterix loves long strings). When Asterix read the substring *t* aloud, the temple doors opened. \n\nYou know the string *s*. Find the substring *t* or determine that such substring does not exist and all that's been written above is just a nice legend.",
"input": "",
"output": "```python\n\r\nfrom sys import stdin, stdout\r\n\r\ns=stdin.readline()\r\ns=s[:-1]\r\nl=len(s)\r\nans,p,pp=set(),set(),set()\r\nd=0\r\nfor i in range(l-1,0,-1):\r\n\tif s[:i]==s[-i:]:\r\n\t\tans=s[:i]\r\n\t\tx=len(ans)\r\n\t\tfor j in range(1,l-x):\r\n\t\t\tif s[j:j+x] in ans:\r\n\t\t\t\tstdout.write(str(s[j:j+x]))\r\n\t\t\t\td=1\r\n\t\t\t\tbreak\r\n\tif d:\r\n\t\tbreak\r\nif not d:\r\n\tstdout.write(\"Just a legend\")\r\n\r\n\t\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "An *n*<=×<=*n* table *a* is defined as follows:\n - The first row and the first column contain ones, that is: *a**i*,<=1<==<=*a*1,<=*i*<==<=1 for all *i*<==<=1,<=2,<=...,<=*n*. - Each of the remaining numbers in the table is equal to the sum of the number above it and the number to the left of it. In other words, the remaining elements are defined by the formula *a**i*,<=*j*<==<=*a**i*<=-<=1,<=*j*<=+<=*a**i*,<=*j*<=-<=1. \nThese conditions define all the values in the table.\n\nYou are given a number *n*. You need to determine the maximum value in the *n*<=×<=*n* table defined by the rules above.",
"input": "",
"output": "```python\ndef m(n):\r\n a=[[0]*n]*n\r\n a[0]=[1]*n\r\n for i in range(n):a[i][0]=1\r\n for i in range(1, n):\r\n for u in range(1, n):\r\n a[i][u]=a[i-1][u]+a[i][u-1]\r\n print(a[n-1][n-1])\r\nn=int(input())\r\nif n==1: print(1)\r\nelse: m(n)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "So, the New Year holidays are over. Santa Claus and his colleagues can take a rest and have guests at last. When two \"New Year and Christmas Men\" meet, thear assistants cut out of cardboard the letters from the guest's name and the host's name in honor of this event. Then the hung the letters above the main entrance. One night, when everyone went to bed, someone took all the letters of our characters' names. Then he may have shuffled the letters and put them in one pile in front of the door.\n\nThe next morning it was impossible to find the culprit who had made the disorder. But everybody wondered whether it is possible to restore the names of the host and his guests from the letters lying at the door? That is, we need to verify that there are no extra letters, and that nobody will need to cut more letters.\n\nHelp the \"New Year and Christmas Men\" and their friends to cope with this problem. You are given both inscriptions that hung over the front door the previous night, and a pile of letters that were found at the front door next morning.",
"input": "",
"output": "```python\nword1=input()\r\nword2=input()\r\ntotal=input()\r\narr1=[]\r\narr2=[]\r\ntot=[]\r\nfor x,let in enumerate(word1):\r\n arr1.append(let)\r\nfor x,let in enumerate(word2):\r\n arr2.append(let)\r\n\r\nfor x,let in enumerate(total):\r\n tot.append(let)\r\n\r\n\r\narr1.extend(arr2)\r\narr1.sort()\r\ntot.sort()\r\n\r\nif arr1 == tot:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Okabe needs to renovate the Future Gadget Laboratory after he tried doing some crazy experiments! The lab is represented as an *n* by *n* square grid of integers. A good lab is defined as a lab in which every number not equal to 1 can be expressed as the sum of a number in the same row and a number in the same column. In other words, for every *x*,<=*y* such that 1<=≤<=*x*,<=*y*<=≤<=*n* and *a**x*,<=*y*<=≠<=1, there should exist two indices *s* and *t* so that *a**x*,<=*y*<==<=*a**x*,<=*s*<=+<=*a**t*,<=*y*, where *a**i*,<=*j* denotes the integer in *i*-th row and *j*-th column.\n\nHelp Okabe determine whether a given lab is good!",
"input": "",
"output": "```python\ndef r():\r\n return list(map(int, input().split()))\r\nn = int(input())\r\nmatr = [r() for i in range(n)]\r\nans = True\r\ncolumns = list(map(set,zip(*matr)))\r\nfor row in matr:\r\n\tans &= all(x == 1 or any(x - a in row for a in col) for x, col in zip(row, columns))\r\nprint(\"Yes\" if ans else \"No\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "We know that lucky digits are digits 4 and 7, however Vasya's got another favorite digit 0 and he assumes it also is lucky! Lucky numbers are such non-negative integers whose decimal record only contains lucky digits. For example, numbers 0,<=47,<=7074 are lucky, but 1,<=7377,<=895,<= -7 are not.\n\nVasya has *t* important positive integers he needs to remember. Vasya is quite superstitious and he wants to remember lucky numbers only, so he is asking you for each important number to represent it as a sum of exactly six lucky numbers (Vasya just can't remember more numbers). Then Vasya can just remember these six numbers and calculate the important number at any moment.\n\nFor each of *t* important integers represent it as the sum of six lucky numbers or state that this is impossible.",
"input": "",
"output": "```python\nprint(\"_RANDOM_GUESS_1691495004.1477993\")# 1691495004.1478186\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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*.\n\nYou're given a set of *n* distinct positive integers. Your task is to find the size of it's largest *k*-multiple free subset.",
"input": "",
"output": "```python\ndef main():\n n, k = map(int, input().split())\n l = list(map(int, input().split()))\n s = set(l)\n for p in l:\n s.discard(p * k)\n print(len(s))\n\n\nif __name__ == '__main__':\n main()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Lenny is playing a game on a 3<=×<=3 grid of lights. In the beginning of the game all lights are switched on. Pressing any of the lights will toggle it and all side-adjacent lights. The goal of the game is to switch all the lights off. We consider the toggling as follows: if the light was switched on then it will be switched off, if it was switched off then it will be switched on.\n\nLenny has spent some time playing with the grid and by now he has pressed each light a certain number of times. Given the number of times each light is pressed, you have to print the current state of each light.",
"input": "",
"output": "```python\ninp=[]\r\nout=[[True,True,True],[True,True,True],[True,True,True]]\r\n\r\nfor i in range(3):\r\n inp.append(list(map(int,input().split())))\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n if inp[i][j]%2==0:\r\n inp[i][j]=0\r\n else:\r\n inp[i][j]=1\r\nfor i in range(3):\r\n for j in range(3):\r\n k=out\r\n if inp[i][j]==1:\r\n out[i][j]=(not out[i][j])\r\n if i-1>=0:\r\n out[i-1][j]=(not out[i-1][j])\r\n if i+1<3:\r\n out[i+1][j]=(not out[i+1][j])\r\n if j-1>=0:\r\n out[i][j-1]=(not out[i][j-1])\r\n if j+1<3:\r\n out[i][j+1]=(not out[i][j+1])\r\nfor i in range(3):\r\n for j in range(3):\r\n if out[i][j]==True:\r\n out[i][j]=str(1)\r\n else:\r\n out[i][j]=str(0)\r\nprint(''.join(out[0]))\r\nprint(''.join(out[1]))\r\nprint(''.join(out[2]))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mad scientist Mike entertains himself by arranging rows of dominoes. He doesn't need dominoes, though: he uses rectangular magnets instead. Each magnet has two poles, positive (a \"plus\") and negative (a \"minus\"). If two magnets are put together at a close distance, then the like poles will repel each other and the opposite poles will attract each other.\n\nMike starts by laying one magnet horizontally on the table. During each following step Mike adds one more magnet horizontally to the right end of the row. Depending on how Mike puts the magnet on the table, it is either attracted to the previous one (forming a group of multiple magnets linked together) or repelled by it (then Mike lays this magnet at some distance to the right from the previous one). We assume that a sole magnet not linked to others forms a group of its own.\n\nMike arranged multiple magnets in a row. Determine the number of groups that the magnets formed.",
"input": "",
"output": "```python\ngroups = 0 \r\nlast = '00'\r\nfor i in range(int(input())):\r\n new = input()\r\n if new != last:\r\n groups +=1\r\n last = new\r\n \r\n \r\nprint(groups)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya decided to have a look at the results of Berland 1910 Football Championship’s finals. Unfortunately he didn't find the overall score of the match; however, he got hold of a profound description of the match's process. On the whole there are *n* lines in that description each of which described one goal. Every goal was marked with the name of the team that had scored it. Help Vasya, learn the name of the team that won the finals. It is guaranteed that the match did not end in a tie.",
"input": "",
"output": "```python\nfrom collections import Counter\r\n\r\nn = int(input())\r\n\r\nlst=[]\r\n\r\nfor i in range(n):\r\n lst.append(input())\r\n\r\nc = Counter(lst)\r\nwinner = c.most_common(1)\r\n\r\nprint(winner[0][0])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Given an array *a*1,<=*a*2,<=...,<=*a**n* of *n* integers, find the largest number in the array that is not a perfect square.\n\nA number *x* is said to be a perfect square if there exists an integer *y* such that *x*<==<=*y*2.",
"input": "",
"output": "```python\nimport math\r\nn = int(input())\r\narr = list(map(int,filter(None,input().split(' '))))\r\narr = sorted(arr,reverse=True)\r\nnum = -1\r\nfor a in arr:\r\n sq = math.sqrt(a)\r\n if sq-math.floor(sq)==0:\r\n continue\r\n else:\r\n num = a\r\n break\r\nprint(num)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasily the bear has a favorite rectangle, it has one vertex at point (0,<=0), and the opposite vertex at point (*x*,<=*y*). Of course, the sides of Vasya's favorite rectangle are parallel to the coordinate axes. \n\nVasya also loves triangles, if the triangles have one vertex at point *B*<==<=(0,<=0). That's why today he asks you to find two points *A*<==<=(*x*1,<=*y*1) and *C*<==<=(*x*2,<=*y*2), such that the following conditions hold:\n - the coordinates of points: *x*1, *x*2, *y*1, *y*2 are integers. Besides, the following inequation holds: *x*1<=<<=*x*2; - the triangle formed by point *A*, *B* and *C* is rectangular and isosceles ( is right); - all points of the favorite rectangle are located inside or on the border of triangle *ABC*; - the area of triangle *ABC* is as small as possible. \nHelp the bear, find the required points. It is not so hard to proof that these points are unique.",
"input": "",
"output": "```python\ndef main():\r\n x, y = list(map(int, input().split()))\r\n if x >= 0 and y >= 0:\r\n x1, x2, y1, y2 = 0, x+y, x+y, 0\r\n elif x <= 0 and y >= 0:\r\n x1, x2, y1, y2 = x-y, 0, 0, -(x-y)\r\n elif x <= 0 and y <= 0:\r\n x1, x2, y1, y2 = x+y, 0, 0, x+y\r\n elif x >= 0 and y <= 0:\r\n x1, x2, y1, y2 = 0, x - y, -(x-y), 0\r\n print(x1, y1, x2, y2)\r\n\r\nif __name__ == \"__main__\":\r\n main()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the total penalty time. However, for no team we are shown its final place.\n\nYou know the rules of comparing the results of two given teams very well. Let's say that team *a* solved *p**a* problems with total penalty time *t**a* and team *b* solved *p**b* problems with total penalty time *t**b*. Team *a* gets a higher place than team *b* in the end, if it either solved more problems on the contest, or solved the same number of problems but in less total time. In other words, team *a* gets a higher place than team *b* in the final results' table if either *p**a*<=><=*p**b*, or *p**a*<==<=*p**b* and *t**a*<=<<=*t**b*. \n\nIt is considered that the teams that solve the same number of problems with the same penalty time share all corresponding places. More formally, let's say there is a group of *x* teams that solved the same number of problems with the same penalty time. Let's also say that *y* teams performed better than the teams from this group. In this case all teams from the group share places *y*<=+<=1, *y*<=+<=2, ..., *y*<=+<=*x*. The teams that performed worse than the teams from this group, get their places in the results table starting from the *y*<=+<=*x*<=+<=1-th place.\n\nYour task is to count what number of teams from the given list shared the *k*-th place.",
"input": "",
"output": "```python\nnk = list(map(int ,input().split()))\r\nn = nk[0]\r\nk = nk[1]\r\narr = []\r\nsolved = []\r\npts = []\r\nfor i in range(n):\r\n x = list(map(int, input().split()))\r\n arr.append(x)\r\nfor i in range(len(arr)):\r\n minval = i\r\n for j in range(i+1, len(arr)):\r\n if arr[minval][0] < arr[j][0]:\r\n minval = j\r\n elif arr[minval][0] == arr[j][0]:\r\n if arr[minval][1] < arr[j][1]:\r\n minval = j\r\n\r\n temp = arr[i]\r\n arr[i] = arr[minval]\r\n arr[minval] = temp\r\n\r\nkth = arr[k]\r\nprint(arr.count(kth))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.\n\nVasya wants to construct the minimal number of towers from the bars. Help Vasya to use the bars in the best way possible.",
"input": "",
"output": "```python\nn = int(input())\r\nnums = list(map(int,input().split()))\r\ndiff = set(nums)\r\n\r\nres1 = max(nums.count(i) for i in diff)\r\nres2 = len(diff)\r\n\r\nprint(res1,res2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "For some time the program of rounding numbers that had been developed by the Codeforces participants during one of the previous rounds, helped the citizens of Far Far Away to convert numbers into a more easily readable format. However, as time went by, the economy of the Far Far Away developed and the scale of operations grew. So the King ordered to found the Bank of Far Far Away and very soon even the rounding didn't help to quickly determine even the order of the numbers involved in operations. Besides, rounding a number to an integer wasn't very convenient as a bank needed to operate with all numbers with accuracy of up to 0.01, and not up to an integer.\n\nThe King issued yet another order: to introduce financial format to represent numbers denoting amounts of money. The formal rules of storing a number in the financial format are as follows: \n - A number contains the integer part and the fractional part. The two parts are separated with a character \".\" (decimal point). - To make digits in the integer part of a number easier to read, they are split into groups of three digits, starting from the least significant ones. The groups are separated with the character \",\" (comma). For example, if the integer part of a number equals 12345678, then it will be stored in the financial format as 12,345,678 - In the financial format a number's fractional part should contain exactly two digits. So, if the initial number (the number that is converted into the financial format) contains less than two digits in the fractional part (or contains no digits at all), it is complemented with zeros until its length equals 2. If the fractional part contains more than two digits, the extra digits are simply discarded (they are not rounded: see sample tests). - When a number is stored in the financial format, the minus sign is not written. Instead, if the initial number had the minus sign, the result is written in round brackets. - Please keep in mind that the bank of Far Far Away operates using an exotic foreign currency — snakes ($), that's why right before the number in the financial format we should put the sign \"$\". If the number should be written in the brackets, then the snake sign should also be inside the brackets. \nFor example, by the above given rules number 2012 will be stored in the financial format as \"$2,012.00\" and number -12345678.9 will be stored as \"($12,345,678.90)\".\n\nThe merchants of Far Far Away visited you again and expressed much hope that you supply them with the program that can convert arbitrary numbers to the financial format. Can you help them?",
"input": "",
"output": "```python\n\r\ns=input().strip()\r\na=[]\r\nif s[0]=='-':\r\n p='($'\r\n s=s[1:]\r\nelse:\r\n p='$'\r\nj=0\r\nt='.'\r\nn=len(s)\r\nwhile j<(n):\r\n if s[j]=='.':\r\n t=t+s[j+1]\r\n if j+2=0:\r\n a.append(',')\r\n u=0\r\n else:\r\n a.append(s[k])\r\na=p+''.join(a[::-1])+t\r\nif a[0]=='(':\r\n a=a+')'\r\nprint(a)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two players are playing a game. First each of them writes an integer from 1 to 6, and then a dice is thrown. The player whose written number got closer to the number on the dice wins. If both payers have the same difference, it's a draw.\n\nThe first player wrote number *a*, the second player wrote number *b*. How many ways to throw a dice are there, at which the first player wins, or there is a draw, or the second player wins?",
"input": "",
"output": "```python\ndef get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\na, b = gets(int)\ni = a + b >> 1\nif a + b & 1:\n print(i, 0, 6 - i)\nelse:\n print(i - 1, 1, 6 - i)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Hongcow is learning to spell! One day, his teacher gives him a word that he needs to learn to spell. Being a dutiful student, he immediately learns how to spell the word.\n\nHongcow has decided to try to make new words from this one. He starts by taking the word he just learned how to spell, and moves the last character of the word to the beginning of the word. He calls this a cyclic shift. He can apply cyclic shift many times. For example, consecutively applying cyclic shift operation to the word \"abracadabra\" Hongcow will get words \"aabracadabr\", \"raabracadab\" and so on.\n\nHongcow is now wondering how many distinct words he can generate by doing the cyclic shift arbitrarily many times. The initial string is also counted.",
"input": "",
"output": "```python\ns = input().strip()\r\nn = len(s)\r\n\r\n# Generate all possible cyclic shifts\r\nshifts = [s[i:] + s[:i] for i in range(n)]\r\n\r\n# Add shifts to a set to remove duplicates\r\ndistinct_shifts = set(shifts)\r\n\r\n# Return the size of the set as the answer\r\nprint(len(distinct_shifts))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Saratov State University Olympiad Programmers Training Center (SSU OPTC) has *n* students. For each student you know the number of times he/she has participated in the ACM ICPC world programming championship. According to the ACM ICPC rules, each person can participate in the world championship at most 5 times.\n\nThe head of the SSU OPTC is recently gathering teams to participate in the world championship. Each team must consist of exactly three people, at that, any person cannot be a member of two or more teams. What maximum number of teams can the head make if he wants each team to participate in the world championship with the same members at least *k* times?",
"input": "",
"output": "```python\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\nresult = 0\r\nfor i in a:\r\n if i == 0:\r\n count += 1\r\n if count == k:\r\n count = 0\r\n result += 1\r\nif count != 0:\r\n result += 1\r\nprint(result)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Formula One championship consists of series of races called Grand Prix. After every race drivers receive points according to their final position. Only the top 10 drivers receive points in the following order 25, 18, 15, 12, 10, 8, 6, 4, 2, 1. At the conclusion of the championship the driver with most points is the champion. If there is a tie, champion is the one with most wins (i.e. first places). If a tie still exists, it is chosen the one with most second places, and so on, until there are no more place to use for compare.\n\n Last year another scoring system was proposed but rejected. In it the champion is the one with most wins. If there is tie, champion is the one with most points. If a tie still exists it is proceeded the same way as in the original scoring system, that is comparing number of second, third, forth, and so on, places.\n\nYou are given the result of all races during the season and you are to determine the champion according to both scoring systems. It is guaranteed, that both systems will produce unique champion.",
"input": "",
"output": "```python\nN=int(input())\r\n# S={\"name\":[0,0,0,......],}\r\nsoc=[25,18,15,12,10,8,6,4,2,1]\r\nS={}\r\nfor i in range(N):\r\n\tn=int(input())\r\n\tfor y in range(n):\r\n\t\tif y<10:\r\n\t\t\ts=input()\r\n\t\t\tif s in S:\r\n\t\t\t\tS[s][0]+=soc[y]\r\n\t\t\t\tS[s][y+1]+=1\r\n\t\t\telse:\r\n\t\t\t\tS[s]=[soc[y],0,0,0,0,0,0,0,0,0,0]\r\n\t\t\t\tS[s][y+1]+=1\r\n#print(S)\r\n###A\r\nmas=[0]\r\nm=0\r\nfor i in S:\r\n\t#print(type(S[i][0]))\r\n\tif S[i][0]>m:\r\n\t\tmas=[0]\r\n\t\tm=S[i][0]\r\n\t\tmas[0]=i\r\n\telif S[i][0]==m:\r\n\t\tmas.append(i)\r\n#print(mas,m)\r\nif len(mas)>1:\r\n\tzz=1\r\n\tn=0\r\n\tM=[0]\r\n\twhile n==0:\r\n\t\tmaxx=0\r\n\t\tfor i in range(len(mas)):\r\n\t\t\tt=S[mas[i]][zz]\r\n\t\t\tif t>maxx and t!=0:\r\n\t\t\t\tM=[0]\r\n\t\t\t\tmaxx=t\r\n\t\t\t\tM[0]=(mas[i])\r\n\t\t\telif t==maxx and t!=0:\r\n\t\t\t\tM.append(mas[i])\r\n\t\tzz=zz+1\r\n\t\tif len(M)==1:\r\n\t\t\tbreak\r\n\tprint(M[0]) \t\t\r\nelse:\r\n\tprint(mas[0])\r\n####B\r\n\r\nmas=[0]\r\nm=0\r\nfor i in S:\r\n\tif S[i][1]>m:\r\n\t\tmas=[0]\r\n\t\tm=S[i][1]\r\n\t\tmas[0]=i\r\n\telif S[i][0]==m:\r\n\t\tmas.append(i)\r\nif len(mas)>1:\r\n\tmas1=[0]\r\n\tm1=0\r\n\tfor i in range(len(mas)):\r\n\t#print(type(S[i][0]))\r\n\t\tif S[mas[i]][0]>m:\r\n\t\t\tmas1=[0]\r\n\t\t\tm1=S[mas[i]][0]\r\n\t\t\tmas1[0]=mas[i]\r\n\t\telif S[mas[i]][0]==m1:\r\n\t\t\tmas1.append(mas[i])\t\r\n\tif len(mas1)>1:\r\n\t\tzz=2\r\n\t\tn=0\r\n\t\tM=[0]\r\n\t\twhile n==0:\r\n\t\t\tmaxx=0\r\n\t\t\tfor i in range(len(mas)):\r\n\t\t\t\tt=S[mas[i]][zz]\r\n\t\t\t\tif t>maxx and t!=0:\r\n\t\t\t\t\tM=[0]\r\n\t\t\t\t\tmaxx=t\r\n\t\t\t\t\tM[0]=(mas[i])\r\n\t\t\t\telif t==maxx and t!=0:\r\n\t\t\t\t\tM.append(mas[i])\r\n\t\t\tzz=zz+1\r\n\t\t\tif len(M)==1:\r\n\t\t\t\tbreak\r\n\t\tprint(M[0]) \r\n\telse:\r\n\t\tprint(mas1[0])\r\nelse:\r\n\tprint(mas[0])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya the Hipster decided to count how many socks he had. It turned out that he had *a* red socks and *b* blue socks.\n\nAccording to the latest fashion, hipsters should wear the socks of different colors: a red one on the left foot, a blue one on the right foot.\n\nEvery day Vasya puts on new socks in the morning and throws them away before going to bed as he doesn't want to wash them.\n\nVasya wonders, what is the maximum number of days when he can dress fashionable and wear different socks, and after that, for how many days he can then wear the same socks until he either runs out of socks or cannot make a single pair from the socks he's got.\n\nCan you help him?",
"input": "",
"output": "```python\nn,k=map(int,input().split())\r\nprint(min(n,k),abs(n-k)//2)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has got two number: *a* and *b*. However, Vasya finds number *a* too short. So he decided to repeat the operation of lengthening number *a* *n* times.\n\nOne operation of lengthening a number means adding exactly one digit to the number (in the decimal notation) to the right provided that the resulting number is divisible by Vasya's number *b*. If it is impossible to obtain the number which is divisible by *b*, then the lengthening operation cannot be performed.\n\nYour task is to help Vasya and print the number he can get after applying the lengthening operation to number *a* *n* times.",
"input": "",
"output": "```python\na,b,n=input().split(\" \")\r\nno_iterations={\r\n 0:[a]\r\n}\r\ndigits=[str(x) for x in range(10)]\r\nfound=False\r\nfor i in range(1,int(n)+1):\r\n new_iterations=[]\r\n for x in no_iterations[i-1]:\r\n for y in digits:\r\n if i==int(n):\r\n if int(x+y)%int(b)==0 and found==False:\r\n print(x+y)\r\n found=True\r\n else:\r\n new_iterations.append(x+y)\r\n no_iterations[i]=new_iterations\r\nif found==False:\r\n print(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little X has *n* distinct integers: *p*1,<=*p*2,<=...,<=*p**n*. He wants to divide all of them into two sets *A* and *B*. The following two conditions must be satisfied:\n - If number *x* belongs to set *A*, then number *a*<=-<=*x* must also belong to set *A*. - If number *x* belongs to set *B*, then number *b*<=-<=*x* must also belong to set *B*. \nHelp Little X divide the numbers into two sets or determine that it's impossible.",
"input": "",
"output": "```python\nimport sys\nsys.setrecursionlimit(1000000)\n\nset_a = 0\nset_b = 10**9 + 1\n\ndef find_set(u):\n if u not in parent:\n parent[u] = u\n parent[u] = u if parent[u] == u else find_set(parent[u])\n return parent[u]\n\ndef union(u, v):\n up = find_set(u)\n vp = find_set(v)\n parent[up] = vp\n\n\"\"\"\n4 5 7\n2 3 5 4\n\"\"\"\nparent = dict() # range 0 to 10**9 + 1\nparent[0] = 0\nparent[10**9 + 1] = 10**9 + 1\nn, a, b = map(int, input().split())\np = list(map(int, input().split()))\nset_p = set()\nfor i in range(n):\n set_p.add(p[i])\n\nans = [-1] * (n)\nno = False\n\nfor i in range(n):\n if a - p[i] in set_p and b - p[i] in set_p: # in both set\n union(a - p[i], p[i])\n union(b - p[i], p[i])\n elif a - p[i] in set_p and b - p[i] not in set_p: #only in set a\n union(a - p[i], set_a)\n union(p[i], set_a)\n elif b - p[i] in set_p and a - p[i] not in set_p: #only in set a\n union(b - p[i], set_b)\n union(p[i], set_b)\n else:\n no = True\n\nif no:\n print(\"NO\")\nelse:\n print('YES')\n for idx in p:\n if find_set(idx) == 0 :\n print('0', end = ' ')\n else:\n print('1', end = ' ')\n\n\t\t \t\t \t\t \t\t\t \t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "As the guys fried the radio station facilities, the school principal gave them tasks as a punishment. Dustin's task was to add comments to nginx configuration for school's website. The school has *n* servers. Each server has a name and an ip (names aren't necessarily unique, but ips are). Dustin knows the ip and name of each server. For simplicity, we'll assume that an nginx command is of form \"command ip;\" where command is a string consisting of English lowercase letter only, and ip is the ip of one of school servers.\n\nEach ip is of form \"a.b.c.d\" where *a*, *b*, *c* and *d* are non-negative integers less than or equal to 255 (with no leading zeros). The nginx configuration file Dustin has to add comments to has *m* commands. Nobody ever memorizes the ips of servers, so to understand the configuration better, Dustin has to comment the name of server that the ip belongs to at the end of each line (after each command). More formally, if a line is \"command ip;\" Dustin has to replace it with \"command ip; #name\" where name is the name of the server with ip equal to ip.\n\nDustin doesn't know anything about nginx, so he panicked again and his friends asked you to do his task for him.",
"input": "",
"output": "```python\nm,n=input().split(' ')\r\nIP={}\r\nfor i in range(int(m)):\r\n x,y=input().split(' ')\r\n IP[y]=x\r\nfor i in range(int(n)):\r\n s,r=input().split(' ')\r\n f=s+' '+r+' #'+IP[r[:-1]]\r\n print(f)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Is it rated?\n\nHere it is. The Ultimate Question of Competitive Programming, Codeforces, and Everything. And you are here to answer it.\n\nAnother Codeforces round has been conducted. No two participants have the same number of points. For each participant, from the top to the bottom of the standings, their rating before and after the round is known.\n\nIt's known that if at least one participant's rating has changed, then the round was rated for sure.\n\nIt's also known that if the round was rated and a participant with lower rating took a better place in the standings than a participant with higher rating, then at least one round participant's rating has changed.\n\nIn this problem, you should not make any other assumptions about the rating system.\n\nDetermine if the current round is rated, unrated, or it's impossible to determine whether it is rated of not.",
"input": "",
"output": "```python\nn=int(input())\r\nl=0\r\nr=0\r\nll=[]\r\nll1=[]\r\nfor i in range(n):\r\n \r\n a=input().split(\" \")\r\n l+=int(a[0])\r\n r+=int(a[1])\r\n ll.append(list(map(int,a)))\r\nll1=list(ll)\r\nflag=0\r\nif(l!=r):\r\n print(\"rated\")\r\nelse:\r\n ll.sort(reverse=True)\r\n for j in range(n):\r\n #print(ll[j],ll1[j])\r\n if(ll[j]==ll1[j]):\r\n flag=1\r\n else:\r\n flag=0\r\n break\r\n if(flag==0):\r\n print(\"unrated\")\r\n else:\r\n print(\"maybe\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (*x*1,<=*y*1),<=(*x*2,<=*y*2),<=...,<=(*x**n*,<=*y**n*). Let's define neighbors for some fixed point from the given set (*x*,<=*y*): \n - point (*x*',<=*y*') is (*x*,<=*y*)'s right neighbor, if *x*'<=><=*x* and *y*'<==<=*y* - point (*x*',<=*y*') is (*x*,<=*y*)'s left neighbor, if *x*'<=<<=*x* and *y*'<==<=*y* - point (*x*',<=*y*') is (*x*,<=*y*)'s lower neighbor, if *x*'<==<=*x* and *y*'<=<<=*y* - point (*x*',<=*y*') is (*x*,<=*y*)'s upper neighbor, if *x*'<==<=*x* and *y*'<=><=*y* \nWe'll consider point (*x*,<=*y*) from the given set supercentral, if it has at least one upper, at least one lower, at least one left and at least one right neighbor among this set's points.\n\nVasya marked quite many points on the paper. Analyzing the picture manually is rather a challenge, so Vasya asked you to help him. Your task is to find the number of supercentral points in the given set.",
"input": "",
"output": "```python\ndef process(A):\r\n d_x = {}\r\n d_y = {}\r\n for x,y in A:\r\n if x not in d_x:\r\n d_x[x] = [y, y]\r\n else:\r\n d_x[x][0] = min(d_x[x][0], y)\r\n d_x[x][1] = max(d_x[x][1], y)\r\n if y not in d_y:\r\n d_y[y] = [x, x]\r\n else:\r\n d_y[y][0] = min(d_y[y][0], x)\r\n d_y[y][1] = max(d_y[y][1], x)\r\n answer = 0\r\n for x, y in A:\r\n if d_x[x][0] < y < d_x[x][1]:\r\n if d_y[y][0] < x < d_y[y][1]:\r\n answer+=1\r\n return answer\r\n\r\nn = int(input())\r\nA = []\r\nfor i in range(n):\r\n x, y = [int(x) for x in input().split()]\r\n A.append([x, y])\r\nprint(process(A))\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink \"Beecola\", which can be bought in *n* different shops in the city. It's known that the price of one bottle in the shop *i* is equal to *x**i* coins.\n\nVasiliy plans to buy his favorite drink for *q* consecutive days. He knows, that on the *i*-th day he will be able to spent *m**i* coins. Now, for each of the days he want to know in how many different shops he can buy a bottle of \"Beecola\".",
"input": "",
"output": "```python\nfrom bisect import *\n\nN = int(input())\na = sorted(list(map(int, input().split())))\nQ = int(input())\nfor _ in range(Q):\n budget = int(input())\n print(bisect_right(a, budget))\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya loves football very much. One day, as he was watching a football match, he was writing the players' current positions on a piece of paper. To simplify the situation he depicted it as a string consisting of zeroes and ones. A zero corresponds to players of one team; a one corresponds to players of another team. If there are at least 7 players of some team standing one after another, then the situation is considered dangerous. For example, the situation 00100110111111101 is dangerous and 11110111011101 is not. You are given the current situation. Determine whether it is dangerous or not.",
"input": "",
"output": "```python\nplayers = input()\r\nif \"1\" * 7 in players or \"0\" * 7 in players:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all *n* squad soldiers to line up on the parade ground.\n\nBy the military charter the soldiers should stand in the order of non-increasing of their height. But as there's virtually no time to do that, the soldiers lined up in the arbitrary order. However, the general is rather short-sighted and he thinks that the soldiers lined up correctly if the first soldier in the line has the maximum height and the last soldier has the minimum height. Please note that the way other solders are positioned does not matter, including the case when there are several soldiers whose height is maximum or minimum. Only the heights of the first and the last soldier are important.\n\nFor example, the general considers the sequence of heights (4, 3, 4, 2, 1, 1) correct and the sequence (4, 3, 1, 2, 2) wrong.\n\nWithin one second the colonel can swap any two neighboring soldiers. Help him count the minimum time needed to form a line-up which the general will consider correct.",
"input": "",
"output": "```python\nimport sys\r\nnum = int(sys.stdin.readline().strip())\r\nlst = sys.stdin.readline().strip().split()\r\n# print(lst)\r\nlst1 = map(int, lst)\r\nmp = list(lst1)\r\n# print(mp)\r\nmaxi = max(mp)\r\nmini = min(mp)\r\n# print(maxi)\r\n# print(mini)\r\nmaxi_inx = []\r\nmini_inx = []\r\nfor i in range(len(mp)):\r\n if mp[i] == maxi:\r\n maxi_inx.append(i)\r\n if mp[i] == mini:\r\n mini_inx.append(i)\r\n# print(maxi_inx)\r\n# print(mini_inx)\r\nif min(maxi_inx) < max(mini_inx):\r\n summ = min(maxi_inx) + len(lst) - (max(mini_inx) + 1)\r\n print(summ)\r\nelse:\r\n summ = min(maxi_inx) + len(lst) - (max(mini_inx) + 1) - 1\r\n print(summ)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* students living in the campus. Every morning all students wake up at the same time and go to wash. There are *m* rooms with wash basins. The *i*-th of these rooms contains *a**i* wash basins. Every student independently select one the rooms with equal probability and goes to it. After all students selected their rooms, students in each room divide into queues by the number of wash basins so that the size of the largest queue is the least possible. Calculate the expected value of the size of the largest queue among all rooms.",
"input": "",
"output": "```python\nimport functools,math,itertools,time\nu=functools.lru_cache(maxsize=None)\nn,m=map(int,input().split())\ns=[*map(int,input().split())]\nt=u(lambda x:1 if x<2 else x*t(x-1))\nc=u(lambda r,n:t(n)/t(r)/t(n-r))\np=u(lambda n,k:n**k)\nw=u(lambda n,k:math.ceil(n/k))\nr=u(lambda k,n:max(k,n))\nh=u(lambda i,j,l:c(l,i)*p(j-1,i-l)/p(j,i))\n\nfor i,j in itertools.product(range(1,n+1),range(1,m+1)):\n for l in range(i+1):\n h(i,j,l)\n@u\ndef d(i,j,k):\n if j:\n q=0\n for l in range(i + 1):\n q+=h(i,j,l)*d(i-l,j-1,r(k,w(l,s[j-1])))\n return q\n return k\nprint(d(n,m,0))\n\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Johnny has a younger sister Anne, who is very clever and smart. As she came home from the kindergarten, she told his brother about the task that her kindergartener asked her to solve. The task was just to construct a triangle out of four sticks of different colours. Naturally, one of the sticks is extra. It is not allowed to break the sticks or use their partial length. Anne has perfectly solved this task, now she is asking Johnny to do the same.\n\nThe boy answered that he would cope with it without any difficulty. However, after a while he found out that different tricky things can occur. It can happen that it is impossible to construct a triangle of a positive area, but it is possible to construct a degenerate triangle. It can be so, that it is impossible to construct a degenerate triangle even. As Johnny is very lazy, he does not want to consider such a big amount of cases, he asks you to help him.",
"input": "",
"output": "```python\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\na=l[0]\r\nb=l[1]\r\nc=l[2]\r\nd=l[3]\r\n\r\nif(b+c>a or b+d>a or c+d>a or c+d>b):\r\n print(\"TRIANGLE\")\r\nelif(b+c==a or b+d==a or c+d==a or c+d==b):\r\n print(\"SEGMENT\")\r\nelse: \r\n print(\"IMPOSSIBLE\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Allen has a LOT of money. He has $n$ dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are $1$, $5$, $10$, $20$, $100$. What is the minimum number of bills Allen could receive after withdrawing his entire balance?",
"input": "",
"output": "```python\n# https://codeforces.com/problemset/problem/996/A\r\n\r\ndef main():\r\n n = int(input())\r\n sum = 0\r\n bills = [100, 20, 10, 5, 1]\r\n for i in bills:\r\n sum += n // i\r\n n %= i\r\n print(sum)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a fence in front of Polycarpus's home. The fence consists of *n* planks of the same width which go one after another from left to right. The height of the *i*-th plank is *h**i* meters, distinct planks can have distinct heights.\n\nPolycarpus has bought a posh piano and is thinking about how to get it into the house. In order to carry out his plan, he needs to take exactly *k* consecutive planks from the fence. Higher planks are harder to tear off the fence, so Polycarpus wants to find such *k* consecutive planks that the sum of their heights is minimal possible.\n\nWrite the program that finds the indexes of *k* consecutive planks with minimal total height. Pay attention, the fence is not around Polycarpus's home, it is in front of home (in other words, the fence isn't cyclic).",
"input": "",
"output": "```python\n\nplanksAmount, k = map(int, input().split())\n\nplanksHeight = list(map(int, input().split()))\n\n\nplanksHeight.sort()\n\nif len(planksAmount) == 1:\n print(1)\nelse:\n \n print(sum(planksHeight[:k]))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "All cities of Lineland are located on the *Ox* coordinate axis. Thus, each city is associated with its position *x**i* — a coordinate on the *Ox* axis. No two cities are located at a single point.\n\nLineland residents love to send letters to each other. A person may send a letter only if the recipient lives in another city (because if they live in the same city, then it is easier to drop in).\n\nStrange but true, the cost of sending the letter is exactly equal to the distance between the sender's city and the recipient's city.\n\nFor each city calculate two values *min**i* and *max**i*, where *min**i* is the minimum cost of sending a letter from the *i*-th city to some other city, and *max**i* is the the maximum cost of sending a letter from the *i*-th city to some other city",
"input": "",
"output": "```python\nn = int(input()) # number of cities\r\nx = list(map(int, input().split())) # list of city coordinates\r\n\r\nmini = [0]*n\r\nmaxi = [0]*n\r\n\r\n# calculate mini values\r\nfor i in range(n):\r\n if i == 0:\r\n mini[i] = x[1] - x[0]\r\n elif i == n-1:\r\n mini[i] = x[n-1] - x[n-2]\r\n else:\r\n mini[i] = min(x[i]-x[i-1], x[i+1]-x[i])\r\n\r\n# calculate maxi values\r\nfor i in range(n):\r\n maxi[i] = max(x[i]-x[0], x[n-1]-x[i])\r\n\r\n# print mini and maxi values\r\nfor i in range(n):\r\n print(mini[i], maxi[i])\r\n\r\nThis code first reads the input values, calculates the mini and maxi values using the algorithm discussed above, and then prints these values in the required format. The output will consist of n lines, where the i-th line contains the mini and maxi values for the i-th city separated by a space.\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Nikolay has *a* lemons, *b* apples and *c* pears. He decided to cook a compote. According to the recipe the fruits should be in the ratio 1:<=2:<=4. It means that for each lemon in the compote should be exactly 2 apples and exactly 4 pears. You can't crumble up, break up or cut these fruits into pieces. These fruits — lemons, apples and pears — should be put in the compote as whole fruits.\n\nYour task is to determine the maximum total number of lemons, apples and pears from which Nikolay can cook the compote. It is possible that Nikolay can't use any fruits, in this case print 0.",
"input": "",
"output": "```python\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nif (b < 2*a):\r\n # Constraint is b, rather than a\r\n if (c < 2*b):\r\n # Constraint is c, not a or b \r\n a = c//4\r\n b = 2*a \r\n c = 2*b \r\n else: \r\n # c >= 2b, so constraint is b, not a or c \r\n a = b//2 \r\n b = 2*a \r\n c = 2*b \r\nelse: \r\n # b >= 2a, constraint is a, rather than b \r\n if (c < 4*a):\r\n # Constraint is c, not a or b \r\n a = c//4\r\n b = 2*a \r\n c = 2*b \r\n else:\r\n # c >= 4a, so constraint is a, not b or c \r\n a = a \r\n b = 2*a \r\n c = 2*b \r\n \r\nprint(a+b+c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two friends are on the coordinate axis *Ox* in points with integer coordinates. One of them is in the point *x*1<==<=*a*, another one is in the point *x*2<==<=*b*. \n\nEach of the friends can move by one along the line in any direction unlimited number of times. When a friend moves, the tiredness of a friend changes according to the following rules: the first move increases the tiredness by 1, the second move increases the tiredness by 2, the third — by 3 and so on. For example, if a friend moves first to the left, then to the right (returning to the same point), and then again to the left his tiredness becomes equal to 1<=+<=2<=+<=3<==<=6.\n\nThe friends want to meet in a integer point. Determine the minimum total tiredness they should gain, if they meet in the same point.",
"input": "",
"output": "```python\na = int(input())\r\nb = int(input())\r\nb, a = max(a, b), min(a, b)\r\nif (b - a) % 2 == 0:\r\n print((1 + (b - a) // 2) * (b - a) // 2) \r\nelse:\r\n print((1 + (b - a + 1) // 2) * ((b - a + 1) // 2) // 2 + (1 + (b - a - 1) // 2) * ((b - a - 1) // 2) // 2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\nn=input()\r\nc=0\r\nfor i in n:\r\n if i.isupper():\r\n c=c+1\r\n \r\nif c>len(n)//2:\r\n n=n.upper()\r\nelse:\r\n n=n.lower()\r\n \r\nprint(n)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarpus has a ribbon, its length is *n*. He wants to cut the ribbon in a way that fulfils the following two conditions: \n - After the cutting each ribbon piece should have length *a*, *b* or *c*. - After the cutting the number of ribbon pieces should be maximum. \nHelp Polycarpus and find the number of ribbon pieces after the required cutting.",
"input": "",
"output": "```python\n# https://codeforces.com/problemset/problem/189/A\n\nfrom functools import lru_cache\nimport sys\nsys.setrecursionlimit(4000)\n\ndef helper() -> int:\n n, a, b, c = [int(s) for s in input().split(\" \")]\n a, b, c = sorted([a, b, c])\n\n dp = [0] * n\n dp[-a] = 1\n dp[-b] = 1\n dp[-c] = 1\n\n for i in range(len(dp) - 1, -1, -1):\n for value in [a,b,c]:\n if i + value < len(dp) and dp[i + value] > 0:\n dp[i] = max(dp[i], 1 + dp[i + value])\n\n return dp[0]\n\nprint(helper())\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sean is trying to save a large file to a USB flash drive. He has *n* USB flash drives with capacities equal to *a*1,<=*a*2,<=...,<=*a**n* megabytes. The file size is equal to *m* megabytes. \n\nFind the minimum number of USB flash drives needed to write Sean's file, if he can split the file between drives.",
"input": "",
"output": "```python\nn = int(input())\r\nfile_size = int(input())\r\nflash_size = [int(input()) for i in range(n)]\r\nflash_size.sort(reverse=True)\r\ni = 0\r\ns = 0\r\nwhile i < n:\r\n s += flash_size[i]\r\n i += 1\r\n if s >= file_size:\r\n break\r\nprint(i)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has *n* rows of seats. There are 4 seats in each row, and the seats are separated into pairs by a walkway. When ZS and Chris came, some places in the bus was already occupied.\n\nZS and Chris are good friends. They insist to get a pair of neighbouring empty seats. Two seats are considered neighbouring if they are in the same row and in the same pair. Given the configuration of the bus, can you help ZS and Chris determine where they should sit?",
"input": "",
"output": "```python\nn=int(input())\r\nli_st=[]\r\nfor i in range(0,n-1):\r\n m=input()\r\n li_st.append(m)\r\nans = \"NO\"\r\nfor i in range(0,n-1):\r\n m = li_st[i]\r\n if ans==\"NO\":\r\n for j in range(0,4):\r\n if m[j]==m[j+1] and m[j]=='O':\r\n m=m.replace(\"OO\",\"++\")\r\n ans = \"YES\"\r\n break\r\n li_st[i] = m\r\nprint(ans)\r\nif ans==\"YES\":\r\n for x in (li_st):\r\n print(x)\r\n\r\n \r\n \r\n \r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vanya and his friends are walking along the fence of height *h* and they do not want the guard to notice them. In order to achieve this the height of each of the friends should not exceed *h*. If the height of some person is greater than *h* he can bend down and then he surely won't be noticed by the guard. The height of the *i*-th person is equal to *a**i*.\n\nConsider the width of the person walking as usual to be equal to 1, while the width of the bent person is equal to 2. Friends want to talk to each other while walking, so they would like to walk in a single row. What is the minimum width of the road, such that friends can walk in a row and remain unattended by the guard?",
"input": "",
"output": "```python\ns=input()\r\nt=s.split()\r\nn=int(t[0])\r\nh=int(t[1])\r\ns=input()\r\nt=s.split()\r\nw=0\r\nfor i in t:\r\n if int(i)>h:\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Gennady is one of the best child dentists in Berland. Today *n* children got an appointment with him, they lined up in front of his office.\n\nAll children love to cry loudly at the reception at the dentist. We enumerate the children with integers from 1 to *n* in the order they go in the line. Every child is associated with the value of his cofidence *p**i*. The children take turns one after another to come into the office; each time the child that is the first in the line goes to the doctor.\n\nWhile Gennady treats the teeth of the *i*-th child, the child is crying with the volume of *v**i*. At that the confidence of the first child in the line is reduced by the amount of *v**i*, the second one — by value *v**i*<=-<=1, and so on. The children in the queue after the *v**i*-th child almost do not hear the crying, so their confidence remains unchanged.\n\nIf at any point in time the confidence of the *j*-th child is less than zero, he begins to cry with the volume of *d**j* and leaves the line, running towards the exit, without going to the doctor's office. At this the confidence of all the children after the *j*-th one in the line is reduced by the amount of *d**j*.\n\nAll these events occur immediately one after the other in some order. Some cries may lead to other cries, causing a chain reaction. Once in the hallway it is quiet, the child, who is first in the line, goes into the doctor's office.\n\nHelp Gennady the Dentist to determine the numbers of kids, whose teeth he will cure. Print their numbers in the chronological order.",
"input": "",
"output": "```python\nn = int(input())\r\nlist_child = []\r\nlist_output = []\r\nfor i in range(n):\r\n s = [int(j) for j in input().split()]\r\n list_child.append([s[0],s[1],s[2],i+1])\r\nt = 0\r\nwhile t < n:\r\n if list_child[t][2] >= 0:\r\n for i in range(list_child[t][0]):\r\n if t+i < n-1:\r\n list_child[t+i+1][2] -= list_child[t][0]-i\r\n list_output.append(list_child[t][3])\r\n elif t < n-1:\r\n for j in range(t+1,n):\r\n list_child[j][2] -= list_child[t][1]\r\n t += 1\r\nprint (len(list_output))\r\nfor i in range(len(list_output)-1):\r\n print (list_output[i],end=' ')\r\nprint (list_output[len(list_output)-1])\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Eugeny has array *a*<==<=*a*1,<=*a*2,<=...,<=*a**n*, consisting of *n* integers. Each integer *a**i* equals to -1, or to 1. Also, he has *m* queries:\n - Query number *i* is given as a pair of integers *l**i*, *r**i* (1<=≤<=*l**i*<=≤<=*r**i*<=≤<=*n*). - The response to the query will be integer 1, if the elements of array *a* can be rearranged so as the sum *a**l**i*<=+<=*a**l**i*<=+<=1<=+<=...<=+<=*a**r**i*<==<=0, otherwise the response to the query will be integer 0. \nHelp Eugeny, answer all his queries.",
"input": "",
"output": "```python\nn , m = map(int,input().split())\r\narr = input().split()\r\nx = arr.count('1')\r\ny = n - x\r\nans = ''\r\nfor j in range(m):\r\n l , r = map(int,input().split())\r\n if (r - l + 1) % 2 == 0 and min(x , y) >= (r - l + 1)//2 :\r\n ans += '1\\n'\r\n else:\r\n ans += '0\\n'\r\nprint(ans)\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Small, but very brave, mouse Brain was not accepted to summer school of young villains. He was upset and decided to postpone his plans of taking over the world, but to become a photographer instead.\n\nAs you may know, the coolest photos are on the film (because you can specify the hashtag #film for such).\n\nBrain took a lot of colourful pictures on colored and black-and-white film. Then he developed and translated it into a digital form. But now, color and black-and-white photos are in one folder, and to sort them, one needs to spend more than one hour!\n\nAs soon as Brain is a photographer not programmer now, he asks you to help him determine for a single photo whether it is colored or black-and-white.\n\nPhoto can be represented as a matrix sized *n*<=×<=*m*, and each element of the matrix stores a symbol indicating corresponding pixel color. There are only 6 colors: \n - 'C' (cyan)- 'M' (magenta)- 'Y' (yellow)- 'W' (white)- 'G' (grey)- 'B' (black) \nThe photo is considered black-and-white if it has only white, black and grey pixels in it. If there are any of cyan, magenta or yellow pixels in the photo then it is considered colored.",
"input": "",
"output": "```python\n#!/usr/bin/env python3\n# coding:utf-8\n\nif __name__ == \"__main__\":\n n, m = [int(item) for item in input().split()]\n for i in n:\n arr = input().split()\n if \"C\" in arr or \"Y\" in arr or \"M\" in arr:\n print(\"#Color\")\n exit(0)\n print(\"#Black&White\")\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After a hard day Vitaly got very hungry and he wants to eat his favorite potato pie. But it's not that simple. Vitaly is in the first room of the house with *n* room located in a line and numbered starting from one from left to right. You can go from the first room to the second room, from the second room to the third room and so on — you can go from the (*n*<=-<=1)-th room to the *n*-th room. Thus, you can go to room *x* only from room *x*<=-<=1.\n\nThe potato pie is located in the *n*-th room and Vitaly needs to go there. \n\nEach pair of consecutive rooms has a door between them. In order to go to room *x* from room *x*<=-<=1, you need to open the door between the rooms with the corresponding key. \n\nIn total the house has several types of doors (represented by uppercase Latin letters) and several types of keys (represented by lowercase Latin letters). The key of type *t* can open the door of type *T* if and only if *t* and *T* are the same letter, written in different cases. For example, key f can open door F.\n\nEach of the first *n*<=-<=1 rooms contains exactly one key of some type that Vitaly can use to get to next rooms. Once the door is open with some key, Vitaly won't get the key from the keyhole but he will immediately run into the next room. In other words, each key can open no more than one door.\n\nVitaly realizes that he may end up in some room without the key that opens the door to the next room. Before the start his run for the potato pie Vitaly can buy any number of keys of any type that is guaranteed to get to room *n*.\n\nGiven the plan of the house, Vitaly wants to know what is the minimum number of keys he needs to buy to surely get to the room *n*, which has a delicious potato pie. Write a program that will help Vitaly find out this number.",
"input": "",
"output": "```python\nn = int(input())\r\np = []\r\na = list(input())\r\nsum = 0\r\nfor i in range(len(a)):\r\n if i % 2 == 0:\r\n p.append((chr(ord(a[i]) - 32)))\r\n else:\r\n if a[i] in p:\r\n p.remove(a[i])\r\n else:\r\n sum += 1\r\nprint(sum)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A + B is often used as an example of the easiest problem possible to show some contest platform. However, some scientists have observed that sometimes this problem is not so easy to get accepted. Want to try?",
"input": "",
"output": "```python\na, b = map(int,input().split(\" \"))\r\nprint(str(a+b))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Iahub isn't well prepared on geometry problems, but he heard that this year there will be a lot of geometry problems on the IOI selection camp. Scared, Iahub locked himself in the basement and started thinking of new problems of this kind. One of them is the following.\n\nIahub wants to draw *n* distinct points and *m* segments on the *OX* axis. He can draw each point with either red or blue. The drawing is good if and only if the following requirement is met: for each segment [*l**i*,<=*r**i*] consider all the red points belong to it (*r**i* points), and all the blue points belong to it (*b**i* points); each segment *i* should satisfy the inequality |*r**i*<=-<=*b**i*|<=≤<=1.\n\nIahub thinks that point *x* belongs to segment [*l*,<=*r*], if inequality *l*<=≤<=*x*<=≤<=*r* holds.\n\nIahub gives to you all coordinates of points and segments. Please, help him to find any good drawing.",
"input": "",
"output": "```python\n#input\r\nn,m=map(int,input().split())\r\nxlist=[int(x) for x in input().split()]\r\nfor i in range(m):\r\n\tsegment=[int(x) for x in input().split()]\r\n\r\n#variables\r\ncolor=''\r\n\r\n#main\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\tcolor+='0 '\r\n\telse:\r\n\t\tcolor+='1 '\r\n\r\nprint(color)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any longer, so he decided to get some food in the house.\n\nKarlsson's gaze immediately fell on *n* wooden cupboards, standing in the kitchen. He immediately realized that these cupboards have hidden jam stocks. Karlsson began to fly greedily around the kitchen, opening and closing the cupboards' doors, grab and empty all the jars of jam that he could find.\n\nAnd now all jars of jam are empty, Karlsson has had enough and does not want to leave traces of his stay, so as not to let down his friend. Each of the cupboards has two doors: the left one and the right one. Karlsson remembers that when he rushed to the kitchen, all the cupboards' left doors were in the same position (open or closed), similarly, all the cupboards' right doors were in the same position (open or closed). Karlsson wants the doors to meet this condition as well by the time the family returns. Karlsson does not remember the position of all the left doors, also, he cannot remember the position of all the right doors. Therefore, it does not matter to him in what position will be all left or right doors. It is important to leave all the left doors in the same position, and all the right doors in the same position. For example, all the left doors may be closed, and all the right ones may be open.\n\nKarlsson needs one second to open or close a door of a cupboard. He understands that he has very little time before the family returns, so he wants to know the minimum number of seconds *t*, in which he is able to bring all the cupboard doors in the required position.\n\nYour task is to write a program that will determine the required number of seconds *t*.",
"input": "",
"output": "```python\nfrom sys import stdin,stdout\nfrom math import gcd,sqrt,floor,ceil\n# Fast I/O\ninput = stdin.readline\nprint = stdout.write\n\ndef list_inp(x):return list(map(x,input().split()))\ndef map_inp(x):return map(x,input().split())\n\ndef lcm(a,b): return (a*b)/gcd(a,b)\n\ndef solve(x):\n return x[len(x)//2]-x[(len(x)-1)//2]+1\nt = int(input())\ncnt = 0\nfor _ in range(t):\n a,b = map_inp(int)\n if a == b:\n continue\n elif a == 0 and b == 1:\n cnt+=1\nprint(cnt)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Luke Skywalker gave Chewbacca an integer number *x*. Chewbacca isn't good at numbers but he loves inverting digits in them. Inverting digit *t* means replacing it with digit 9<=-<=*t*. \n\nHelp Chewbacca to transform the initial number *x* to the minimum possible positive number by inverting some (possibly, zero) digits. The decimal representation of the final number shouldn't start with a zero.",
"input": "",
"output": "```python\nimport sys, threading\r\nimport math\r\nfrom math import log2,floor\r\nimport heapq\r\nfrom collections import defaultdict,deque\r\ninput = sys.stdin.readline\r\n \r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\nn = str(inp())\r\ns = \"\"\r\nfor i in range(len(n)):\r\n if 9 - int(n[i]) < int(n[i]):\r\n if 9 - int(n[i]) == 0 and len(s) == 0:\r\n s += n[i]\r\n else:\r\n s += str(9 - int(n[i]))\r\n else:\r\n s += n[i]\r\nprint(int(s))\r\n# def main(): \r\n# threading.stack_size(1 << 27)\r\n# sys.setrecursionlimit(1 << 30)\r\n# main_thread = threading.Thread(target=main)\r\n# main_thread.start()\r\n# main_thread.join()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya and Vasya are playing a game. Petya's got *n* non-transparent glasses, standing in a row. The glasses' positions are indexed with integers from 1 to *n* from left to right. Note that the positions are indexed but the glasses are not.\n\nFirst Petya puts a marble under the glass in position *s*. Then he performs some (possibly zero) shuffling operations. One shuffling operation means moving the glass from the first position to position *p*1, the glass from the second position to position *p*2 and so on. That is, a glass goes from position *i* to position *p**i*. Consider all glasses are moving simultaneously during one shuffling operation. When the glasses are shuffled, the marble doesn't travel from one glass to another: it moves together with the glass it was initially been put in.\n\nAfter all shuffling operations Petya shows Vasya that the ball has moved to position *t*. Vasya's task is to say what minimum number of shuffling operations Petya has performed or determine that Petya has made a mistake and the marble could not have got from position *s* to position *t*.",
"input": "",
"output": "```python\n#B. Find Marble\r\nn,s,t = map(int,input().split())\r\np = list(map(int,input().split()))\r\na = list(range(1,n+1))\r\nm = a[s-1]\r\nx = 0\r\nif s == t:\r\n print(0)\r\nelse:\r\n while True:\r\n tmp = [0]*n\r\n for i in range(n):\r\n tmp[p[i]-1] = a[i]\r\n x += 1\r\n if tmp[t-1] == m:\r\n print(x)\r\n break\r\n elif tmp[s-1] == m:\r\n print(-1)\r\n break\r\n a = tmp\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp is a big lover of killing time in social networks. A page with a chatlist in his favourite network is made so that when a message is sent to some friend, his friend's chat rises to the very top of the page. The relative order of the other chats doesn't change. If there was no chat with this friend before, then a new chat is simply inserted to the top of the list.\n\nAssuming that the chat list is initially empty, given the sequence of Polycaprus' messages make a list of chats after all of his messages are processed. Assume that no friend wrote any message to Polycarpus.",
"input": "",
"output": "```python\nfrom sys import stdin\nfrom collections import Counter,defaultdict,deque\nimport sys\nimport math\nimport os\nimport operator\nimport random\nfrom fractions import Fraction\nimport functools\nimport bisect\nimport itertools\nfrom heapq import *\nimport copy\n\n\nans = []\nfor _ in range(int(input())):\n ans.append(input())\nans = ans[::-1]\nvisit = set()\nfor i in ans:\n if i not in visit:\n print(i)\n visit.add(i)\n\n\n'''\nn = int(input())\narr = list(map(int,input().split()))\ndp = [[0 for i in range(11)] for j in range(n+2)]\nprint(dp)\ndp[1][arr[1]] = 1\nfor i in range(1,n):\n for j in range(10):\n dp[i+1][(j+arr[i+1])%10]+=dp[i][j]\n dp[i+1][(j*arr[i+1])%10]+=dp[i][j]\nfor i in range(10):\n print(dp[n][i])\n\n\n\ndef error(n):\n return (n - int(n))<1\n\na = [5,4,3,2,1]\nk = 300\nleft,right = 0,k\nmid = (left + right) / 2\nwhile left<=right:\n square = (mid*mid)\n if int(square) == k and error(square) == True:\n print(mid)\n break\n elif square <= k:\n left = mid\n else:\n right = mid\n mid = (left + right) / 2\n'''\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Natasha is going to fly to Mars. She needs to build a rocket, which consists of several stages in some order. Each of the stages is defined by a lowercase Latin letter. This way, the rocket can be described by the string — concatenation of letters, which correspond to the stages.\n\nThere are $n$ stages available. The rocket must contain exactly $k$ of them. Stages in the rocket should be ordered by their weight. So, after the stage with some letter can go only stage with a letter, which is at least two positions after in the alphabet (skipping one letter in between, or even more). For example, after letter 'c' can't go letters 'a', 'b', 'c' and 'd', but can go letters 'e', 'f', ..., 'z'.\n\nFor the rocket to fly as far as possible, its weight should be minimal. The weight of the rocket is equal to the sum of the weights of its stages. The weight of the stage is the number of its letter in the alphabet. For example, the stage 'a 'weighs one ton,' b 'weighs two tons, and' z' — $26$ tons.\n\nBuild the rocket with the minimal weight or determine, that it is impossible to build a rocket at all. Each stage can be used at most once.",
"input": "",
"output": "```python\nimport sys\r\nimport math\r\n\r\n\r\ndef scan(input_type='int'):\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef solution():\r\n # for _ in range(int(input())):\r\n n, k = scan()\r\n s = input()\r\n a = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v',\r\n 'w', 'x', 'y', 'z']\r\n c = {}\r\n for i in range(26):\r\n c[a[i]] = i+1\r\n b = [i for i in s]\r\n b.sort()\r\n s = 1000000000\r\n for i in range(n):\r\n e = k\r\n j = i+1\r\n w = c[b[i]]\r\n q = b[i]\r\n p = 0\r\n while e > 1 and j < n:\r\n if c[b[j]] - c[q[p]] > 2:\r\n w += c[b[j]]\r\n q += b[j]\r\n p += 1\r\n e -= 1\r\n j += 1\r\n if e == 1:\r\n s = min(s, w)\r\n break\r\n if s == 1000000000:\r\n print(-1)\r\n else:\r\n print(s)\r\n\r\n\r\nif __name__ == '__main__':\r\n solution()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second — number B, etc. till column 26 that is marked by Z. Then there are two-letter numbers: column 27 has number AA, 28 — AB, column 52 is marked by AZ. After ZZ there follow three-letter numbers, etc.\n\nThe rows are marked by integer numbers starting with 1. The cell name is the concatenation of the column and the row numbers. For example, BC23 is the name for the cell that is in column 55, row 23. \n\nSometimes another numeration system is used: RXCY, where X and Y are integer numbers, showing the column and the row numbers respectfully. For instance, R23C55 is the cell from the previous example.\n\nYour task is to write a program that reads the given sequence of cell coordinates and produce each item written according to the rules of another numeration system.",
"input": "",
"output": "```python\nt = int(input())\r\nl = []\r\nfor i in range(t):\r\n m = input()\r\n l.append(m)\r\nfor i in range(len(l) , 0 , -1):\r\n print(l[i-1])\r\n \r\n \r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day *n* cells of some array decided to play the following game. Initially each cell contains a number which is equal to it's ordinal number (starting from 1). Also each cell determined it's favourite number. On it's move *i*-th cell can exchange it's value with the value of some other *j*-th cell, if |*i*<=-<=*j*|<==<=*d**i*, where *d**i* is a favourite number of *i*-th cell. Cells make moves in any order, the number of moves is unlimited.\n\nThe favourite number of each cell will be given to you. You will also be given a permutation of numbers from 1 to *n*. You are to determine whether the game could move to this state.",
"input": "",
"output": "```python\nfrom __future__ import division\r\nfrom sys import stdin, stdout\r\nfrom queue import PriorityQueue\r\nfrom heapq import *\r\nfrom collections import deque, defaultdict, Counter\r\nfrom bitarray import bitarray\r\ninput_int = lambda: int(stdin.readline())\r\ninput_1D_int = lambda: [int(x) for x in stdin.readline().split()]\r\ninput_2D_int = lambda n: [input_1D_int() for _ in range(n)]\r\ninput_string = lambda: stdin.readline().strip()\r\ninput_1D_string = lambda: [str(x) for x in stdin.readline().split()]\r\ninput_2D_string = lambda n: [input_1D_string() for _ in range(n)]\r\npr = lambda args, sep: stdout.write(sep.join(map(str, args)) + '\\n')\r\nchars, oo = 'abcdefghijklmnopqrstuvwxyz', int(1000000000000000000)\r\nclass DSU:\r\n def __init__(self, n):\r\n self.groupSize = [0] * (n + 1)\r\n self.parent = [0] * (n + 1)\r\n self.rank = [0] * (n + 1)\r\n self.mx = [0] * (n + 1)\r\n self.mn = [0] * (n + 1)\r\n for i in range(n + 1):\r\n self.parent[i] = i\r\n self.mx[i] = self.mn[i] = i\r\n self.groupSize[i] = 1\r\n self.rank[i] = 0\r\n def make_set(self, u):\r\n self.parent[u] = u\r\n self.groupSize[u] = 1\r\n def find_set(self, x):\r\n if self.parent[x] == x: return x\r\n self.parent[x] = self.find_set(self.parent[x])\r\n return self.parent[x]\r\n def union_set(self, u, v):\r\n leader1 = self.find_set(u)\r\n leader2 = self.find_set(v)\r\n if leader1 == leader2: return\r\n if self.groupSize[leader1] < self.groupSize[leader2]:\r\n leader1, leader2 = leader2, leader1\r\n self.parent[leader2] = leader1\r\n self.groupSize[leader1] += self.groupSize[leader2]\r\n if self.rank[leader1] == self.rank[leader2]:\r\n self.rank[leader1] += 1\r\n self.mx[leader1] = max(self.mx[leader1], self.mx[leader2])\r\n self.mn[leader1] = min(self.mn[leader1], self.mn[leader2])\r\n def samegroup(self, u, v):\r\n leader1 = self.find_set(u)\r\n leader2 = self.find_set(v)\r\n return leader1 == leader2\r\n def sizeGroup(self, u):\r\n leader = self.find_set(u)\r\n return self.groupSize[leader]\r\n def get_max(self, u):\r\n return self.mx[self.find_set(u)]\r\n def get_min(self, u):\r\n return self.mn[self.find_set(u)]\r\nn = input_int()\r\na = input_1D_int()\r\nb = input_1D_int()\r\ndsu = DSU(n + 10)\r\nfor i in range(0, n):\r\n r = (i + 1) + b[i]\r\n l = (i + 1) - b[i]\r\n if r > 0 and r <= n:dsu.union_set(r, i + 1)\r\n if l <= n and l > 0:dsu.union_set(l, i + 1)\r\nfor i in range(0, n):\r\n if dsu.find_set(a[i]) != dsu.find_set(i + 1):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "wHAT DO WE NEED cAPS LOCK FOR?\n\nCaps lock is a computer keyboard key. Pressing it sets an input mode in which typed letters are capital by default. If it is pressed by accident, it leads to accidents like the one we had in the first passage. \n\nLet's consider that a word has been typed with the Caps lock key accidentally switched on, if: \n - either it only contains uppercase letters; - or all letters except for the first one are uppercase. \nIn this case we should automatically change the case of all letters. For example, the case of the letters that form words \"hELLO\", \"HTTP\", \"z\" should be changed.\n\nWrite a program that applies the rule mentioned above. If the rule cannot be applied, the program should leave the word unchanged.",
"input": "",
"output": "```python\ns = input()\r\ns1 = ''\r\n\r\nif s.isupper():\r\n s1 += s[0]\r\n s= s[1:].lower()\r\n s1 += s\r\n print(s1)\r\nelif s[0] >= 'a' and s[0] <= 'z':\r\n s1 += s[0]\r\n s1 = s1.upper()\r\n if s[1:].isupper():\r\n s = s[1:].lower()\r\n s1 += s\r\n print(s1)\r\nelse:\r\n print(s)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two friends are on the coordinate axis *Ox* in points with integer coordinates. One of them is in the point *x*1<==<=*a*, another one is in the point *x*2<==<=*b*. \n\nEach of the friends can move by one along the line in any direction unlimited number of times. When a friend moves, the tiredness of a friend changes according to the following rules: the first move increases the tiredness by 1, the second move increases the tiredness by 2, the third — by 3 and so on. For example, if a friend moves first to the left, then to the right (returning to the same point), and then again to the left his tiredness becomes equal to 1<=+<=2<=+<=3<==<=6.\n\nThe friends want to meet in a integer point. Determine the minimum total tiredness they should gain, if they meet in the same point.",
"input": "",
"output": "```python\na = int(input())\r\nb = int(input())\r\nc = abs(a - b)\r\nans = 0\r\nfor i in range(c // 2 + 1):\r\n ans += 2 * i\r\nif c % 2 == 1:\r\n ans += i + 1\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "DZY loves collecting special strings which only contain lowercase letters. For each lowercase letter *c* DZY knows its value *w**c*. For each special string *s*<==<=*s*1*s*2... *s*|*s*| (|*s*| is the length of the string) he represents its value with a function *f*(*s*), where \n\nNow DZY has a string *s*. He wants to insert *k* lowercase letters into this string in order to get the largest possible value of the resulting string. Can you help him calculate the largest possible value he could get?",
"input": "",
"output": "```python\nn = input()\r\nk = int(input())\r\na = list(map(int , input().split()))\r\ns = 0\r\nfor i in range(len(n)):\r\n s+=(a[ord(n[i])-97])*(i+1)\r\nx = max(a)\r\nj = len(n)+1\r\nfor i in range(k):\r\n s+=j*x\r\n j+=1\r\nprint(s)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Caisa solved the problem with the sugar and now he is on the way back to home. \n\nCaisa is playing a mobile game during his path. There are (*n*<=+<=1) pylons numbered from 0 to *n* in this game. The pylon with number 0 has zero height, the pylon with number *i* (*i*<=><=0) has height *h**i*. The goal of the game is to reach *n*-th pylon, and the only move the player can do is to jump from the current pylon (let's denote its number as *k*) to the next one (its number will be *k*<=+<=1). When the player have made such a move, its energy increases by *h**k*<=-<=*h**k*<=+<=1 (if this value is negative the player loses energy). The player must have non-negative amount of energy at any moment of the time. \n\nInitially Caisa stand at 0 pylon and has 0 energy. The game provides a special opportunity: one can pay a single dollar and increase the height of anyone pylon by one. Caisa may use that opportunity several times, but he doesn't want to spend too much money. What is the minimal amount of money he must paid to reach the goal of the game?",
"input": "",
"output": "```python\ndef ii(): return int(input())\r\ndef mi(): return map(int,input().split())\r\ndef li(): return list(mi())\r\ndef main():\r\n n=ii()\r\n v=li()\r\n c=0\r\n ans=v[0]\r\n for i in range(0,n-1):\r\n c+=v[i]-v[i+1]\r\n if(c<=0):\r\n ans+=(-c)\r\n c=0\r\n print(ans) \r\n \r\nif __name__ == \"__main__\":\r\n main() \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Let's call a number *k*-good if it contains all digits not exceeding *k* (0,<=...,<=*k*). You've got a number *k* and an array *a* containing *n* numbers. Find out how many *k*-good numbers are in *a* (count each number every time it occurs in array *a*).",
"input": "",
"output": "```python\nn,k=map(int,input().split())\r\nc=0\r\nfor i in range (n):\r\n a = input()\r\n m = 0\r\n for j in range (k+7):\r\n if str(j) in a:\r\n m = m+1\r\n if m == k+1:\r\n c=c+1\r\nprint(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular cake, represented as an *r*<=×<=*c* grid. Each cell either has an evil strawberry, or is empty. For example, a 3<=×<=4 cake may look as follows:\n\nThe cakeminator is going to eat the cake! Each time he eats, he chooses a row or a column that does not contain any evil strawberries and contains at least one cake cell that has not been eaten before, and eats all the cake cells there. He may decide to eat any number of times.\n\nPlease output the maximum number of cake cells that the cakeminator can eat.",
"input": "",
"output": "```python\nr, c = map(int, input().split())\ncake = []\ncc = [True for i in range(c)]\ncr = [True for i in range(r)]\nt = 0\nfor i in range(r):\n cake.append(input())\nfor row in range(r):\n for col in range(c):\n if cake[row][col] == 'S': \n cc[col] = False\n cr[row] = False\n \nfor i in range(r):\n for j in range(c):\n if cc[j] or cr[i]:\n t += 1\nprint(t)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Calculate the minimum number of characters you need to change in the string *s*, so that it contains at least *k* different letters, or print that it is impossible.\n\nString *s* consists only of lowercase Latin letters, and it is allowed to change characters only to lowercase Latin letters too.",
"input": "",
"output": "```python\na = input()\r\nb = int(input())\r\nif len(a) >= b and b - len(set(list(a))) <= 0 and len(set(list(a))) < 26:\r\n if b - len(set(list(a))) > 0:\r\n print(b - len(set(list(a))))\r\n else:\r\n print(0)\r\nelse:\r\n print(\"impossible\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once Bob got to a sale of old TV sets. There were *n* TV sets at that sale. TV set with index *i* costs *a**i* bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV sets he wants. Though he's very strong, Bob can carry at most *m* TV sets, and he has no desire to go to the sale for the second time. Please, help Bob find out the maximum sum of money that he can earn.",
"input": "",
"output": "```python\nn,m=map(int,input().split())\r\nli=list(map(int,input().split()))\r\nli.sort()\r\nt=0\r\nfor x in range(m):\r\n if li[x]<0:\r\n t+=-li[x]\r\n else:\r\n t-=li[x]\r\nprint(t)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "An African crossword is a rectangular table *n*<=×<=*m* in size. Each cell of the table contains exactly one letter. This table (it is also referred to as grid) contains some encrypted word that needs to be decoded.\n\nTo solve the crossword you should cross out all repeated letters in rows and columns. In other words, a letter should only be crossed out if and only if the corresponding column or row contains at least one more letter that is exactly the same. Besides, all such letters are crossed out simultaneously.\n\nWhen all repeated letters have been crossed out, we should write the remaining letters in a string. The letters that occupy a higher position follow before the letters that occupy a lower position. If the letters are located in one row, then the letter to the left goes first. The resulting word is the answer to the problem.\n\nYou are suggested to solve an African crossword and print the word encrypted there.",
"input": "",
"output": "```python\nfrom collections import defaultdict\r\ndef main():\r\n n, m = map(int, input().split())\r\n matrix = []\r\n \r\n for i in range(n):\r\n matrix.append(input())\r\n \r\n row_freq = defaultdict(dict)\r\n col_freq = defaultdict(dict)\r\n \r\n for i in range(n):\r\n for j in range(m):\r\n letter = matrix[i][j]\r\n if letter not in row_freq[i]:\r\n row_freq[i][letter] = 0\r\n \r\n if letter not in col_freq[j]:\r\n col_freq[j][letter] = 0\r\n row_freq[i][letter] += 1\r\n col_freq[j][letter] += 1\r\n \r\n encrypted = []\r\n for i in range(n):\r\n for j in range(m):\r\n letter = matrix[i][j]\r\n if row_freq[i][letter] == 1 and col_freq[j][letter] == 1:\r\n encrypted.append(letter)\r\n \r\n print(''.join(encrypted))\r\n \r\nmain()\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "So, the New Year holidays are over. Santa Claus and his colleagues can take a rest and have guests at last. When two \"New Year and Christmas Men\" meet, thear assistants cut out of cardboard the letters from the guest's name and the host's name in honor of this event. Then the hung the letters above the main entrance. One night, when everyone went to bed, someone took all the letters of our characters' names. Then he may have shuffled the letters and put them in one pile in front of the door.\n\nThe next morning it was impossible to find the culprit who had made the disorder. But everybody wondered whether it is possible to restore the names of the host and his guests from the letters lying at the door? That is, we need to verify that there are no extra letters, and that nobody will need to cut more letters.\n\nHelp the \"New Year and Christmas Men\" and their friends to cope with this problem. You are given both inscriptions that hung over the front door the previous night, and a pile of letters that were found at the front door next morning.",
"input": "",
"output": "```python\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\ns11 = s1+s2\r\ndef checking(s1,s2):\r\n count1 = {}\r\n count2 = {}\r\n for char in s1:\r\n count1[char] = count1.get(char,0) + 1\r\n\r\n for char in s2:\r\n count2[char] = count2.get(char,0) +1\r\n\r\n if count2 == count1:\r\n print('YES')\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nchecking(s11,s3)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.\n\nPetya has a number consisting of *n* digits without leading zeroes. He represented it as an array of digits without leading zeroes. Let's call it *d*. The numeration starts with 1, starting from the most significant digit. Petya wants to perform the following operation *k* times: find the minimum *x* (1<=≤<=*x*<=<<=*n*) such that *d**x*<==<=4 and *d**x*<=+<=1<==<=7, if *x* is odd, then to assign *d**x*<==<=*d**x*<=+<=1<==<=4, otherwise to assign *d**x*<==<=*d**x*<=+<=1<==<=7. Note that if no *x* was found, then the operation counts as completed and the array doesn't change at all.\n\nYou are given the initial number as an array of digits and the number *k*. Help Petya find the result of completing *k* operations.",
"input": "",
"output": "```python\nn,k = map(int,input().split())\narr = list(input())\n\nwhile k>0:\n flag=True\n for i in range(n-1):\n if arr[i]=='4' and arr[i+1]=='7':\n if (i+1)%2==1:\n arr[i]='4'\n arr[i+1]='4'\n else:\n arr[i]='7'\n arr[i+1]='7'\n flag=False\n break\n if flag:\n break\n k-=1\nprint (''.join(arr))\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sergey is testing a next-generation processor. Instead of bytes the processor works with memory cells consisting of *n* bits. These bits are numbered from 1 to *n*. An integer is stored in the cell in the following way: the least significant bit is stored in the first bit of the cell, the next significant bit is stored in the second bit, and so on; the most significant bit is stored in the *n*-th bit.\n\nNow Sergey wants to test the following instruction: \"add 1 to the value of the cell\". As a result of the instruction, the integer that is written in the cell must be increased by one; if some of the most significant bits of the resulting number do not fit into the cell, they must be discarded.\n\nSergey wrote certain values of the bits in the cell and is going to add one to its value. How many bits of the cell will change after the operation?",
"input": "",
"output": "```python\n\n\nn = int(input())\nc = input()[::-1]\nnc = format(int(c, 2)+1, f\"0{len(c)}b\")[::-1]\n\no = 0\n\nprint(nc)\nfor cb, ncb in zip(c, nc):\n if cb != ncb:\n o += 1\n\nprint(o)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vanya and his friends are walking along the fence of height *h* and they do not want the guard to notice them. In order to achieve this the height of each of the friends should not exceed *h*. If the height of some person is greater than *h* he can bend down and then he surely won't be noticed by the guard. The height of the *i*-th person is equal to *a**i*.\n\nConsider the width of the person walking as usual to be equal to 1, while the width of the bent person is equal to 2. Friends want to talk to each other while walking, so they would like to walk in a single row. What is the minimum width of the road, such that friends can walk in a row and remain unattended by the guard?",
"input": "",
"output": "```python\na,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nl=0\r\nfor i in range(a):\r\n if b>=c[i]:\r\n l=l+1\r\n else:\r\n l=l+(c[i]//b)\r\nprint(l)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Dima and his friends have been playing hide and seek at Dima's place all night. As a result, Dima's place got messy. In the morning they decided that they need to clean the place.\n\nTo decide who exactly would clean the apartment, the friends want to play a counting-out game. First, all the guys stand in a circle, and then each of them shows some number of fingers on one hand (one to five), and then the boys count in a circle, starting from Dima, the number of people, respective to the total number of fingers shown. The person on who the countdown stops will clean the apartment.\n\nFor example, if Dima and one of his friends played hide and seek, and 7 fingers were shown during the counting-out, then Dima would clean the place. If there were 2 or say, 8 fingers shown, then his friend would clean the place.\n\nDima knows how many fingers each of his friends will show during the counting-out. Now he is interested in the number of ways to show some number of fingers on one hand (one to five), so that he did not have to clean the place. Help Dima.",
"input": "",
"output": "```python\nn = int(input())\r\nl = [int(i) for i in input().split()]\r\ntotal = n+1\r\ns = sum(l)\r\nans = 0\r\nfor i in range(5):\r\n s+=1\r\n if(s%(n+1)==1):\r\n pass\r\n else:\r\n ans+=1\r\n \r\nprint(ans)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A newspaper is published in Walrusland. Its heading is *s*1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them one to another in order to get one big string. After that walrus erase several letters from this string in order to get a new word *s*2. It is considered that when Fangy erases some letter, there's no whitespace formed instead of the letter. That is, the string remains unbroken and it still only consists of lowercase Latin letters.\n\nFor example, the heading is \"abc\". If we take two such headings and glue them one to the other one, we get \"abcabc\". If we erase the letters on positions 1 and 5, we get a word \"bcac\".\n\nWhich least number of newspaper headings *s*1 will Fangy need to glue them, erase several letters and get word *s*2?",
"input": "",
"output": "```python\nfrom math import *\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nfrom bisect import *\r\nfrom collections import *\r\ninput = lambda: stdin.readline().strip()\r\nprint = stdout.write\r\n\r\ns1=input()\r\ns2=input()\r\n\r\nal=defaultdict(list)\r\ncount=1;index=0;count=0\r\n\r\nfor i in range(len(s1)):\r\n al[s1[i]].append(i)\r\n\r\nfor i in range(len(s2)):\r\n if(len(al[s2[i]])==0):\r\n print(str(-1))\r\n exit()\r\n\r\nfor i in range(len(s2)):\r\n\r\n r=bisect_left(al[s2[i]],index)\r\n if(r==len(al[s2[i]])):\r\n count+=1\r\n index=al[s2[i]][0]+1\r\n else:\r\n index=al[s2[i]][r]+1\r\n\r\nprint(str(count))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "\"QAQ\" is a word to denote an expression of crying. Imagine \"Q\" as eyes with tears and \"A\" as a mouth.\n\nNow Diamond has given Bort a string consisting of only uppercase English letters of length *n*. There is a great number of \"QAQ\" in the string (Diamond is so cute!).\n\nBort wants to know how many subsequences \"QAQ\" are in the string Diamond has given. Note that the letters \"QAQ\" don't have to be consecutive, but the order of letters should be exact.",
"input": "",
"output": "```python\nimport math\r\ncnt=0\r\nst=\"\"\r\nfrom itertools import combinations \r\ndef powerset(string):\r\n global cnt\r\n for i in range(0,len(string)+1):\r\n for element in combinations(string,i):\r\n if(''.join(element)==\"QAQ\"):\r\n cnt+=1\r\ndef powerSet(arr, n) :\r\n global cnt\r\n global st\r\n opsize = math.pow(2, n)\r\n for counter in range( 1, (int)(opsize)) :\r\n st=\"\"\r\n for j in range(0, n) : \r\n if (counter & (1< len(word) - count_caps:\r\n for i in range(len(word)):\r\n char = word[i].upper()\r\n word[i] = char\r\nelse:\r\n for i in range(len(word)):\r\n char = word[i].lower()\r\n word[i] = char\r\n\r\nword = ''.join(word)\r\nprint(word)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Luke Skywalker gave Chewbacca an integer number *x*. Chewbacca isn't good at numbers but he loves inverting digits in them. Inverting digit *t* means replacing it with digit 9<=-<=*t*. \n\nHelp Chewbacca to transform the initial number *x* to the minimum possible positive number by inverting some (possibly, zero) digits. The decimal representation of the final number shouldn't start with a zero.",
"input": "",
"output": "```python\nn=int(input())\r\nres=0\r\narr=[int(x) for x in str(n)]\r\nfor i in range(0,len(arr)-1):\r\n if(i==0 and arr[i]==9):\r\n continue\r\n elif(arr[i]>=5):\r\n arr[i]=9-arr[i]\r\nfor i in range(0,len(arr)):\r\n res=res+(10**(len(arr)-1-i))*arr[i]\r\nprint(res)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given an array *a*1,<=*a*2,<=...,<=*a**n* consisting of *n* integers, and an integer *k*. You have to split the array into exactly *k* non-empty subsegments. You'll then compute the minimum integer on each subsegment, and take the maximum integer over the *k* obtained minimums. What is the maximum possible integer you can get?\n\nDefinitions of subsegment and array splitting are given in notes.",
"input": "",
"output": "```python\nn,k=map(int,input().split())\nip=list(map(int,input().split()))\na=max(ip)\nb=min(ip)\nif k==1:\n print(b)\nelif k>2:\n print(a)\nelse:\n if ip[0]==a or ip[-1]==a:\n print(a)\n else:\n if ip[0]>ip[-1]:\n print(max(ip[0], min(ip[1:])))\n else:\n print(max(ip[-1], min(ip[:-1])))\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In a Berland's zoo there is an enclosure with camels. It is known that camels like to spit. Bob watched these interesting animals for the whole day and registered in his notepad where each animal spitted. Now he wants to know if in the zoo there are two camels, which spitted at each other. Help him to solve this task.\n\nThe trajectory of a camel's spit is an arc, i.e. if the camel in position *x* spits *d* meters right, he can hit only the camel in position *x*<=+<=*d*, if such a camel exists.",
"input": "",
"output": "```python\nn = int(input())\r\na = 0\r\nm = []\r\nfor i in range(n):\r\n x, d = map(int, input().split())\r\n\r\n a = x + d\r\n m.append(a)\r\n if m.count(d) == True:\r\n print('YES')\r\n else:\r\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "At the children's day, the child came to Picks's house, and messed his house up. Picks was angry at him. A lot of important things were lost, in particular the favorite set of Picks.\n\nFortunately, Picks remembers something about his set *S*:\n - its elements were distinct integers from 1 to *limit*; - the value of was equal to *sum*; here *lowbit*(*x*) equals 2*k* where *k* is the position of the first one in the binary representation of *x*. For example, *lowbit*(100102)<==<=102,<=*lowbit*(100012)<==<=12,<=*lowbit*(100002)<==<=100002 (binary representation). \nCan you help Picks and find any set *S*, that satisfies all the above conditions?",
"input": "",
"output": "```python\ns,t = map(int,input().split())\r\nc = {}\r\nfor i in range(1,t+1):\r\n l = 0\r\n tmp = i\r\n while tmp%2==0:\r\n tmp /= 2\r\n l += 1\r\n if l in c:\r\n c[l] += 1\r\n else:\r\n c[l] = 1\r\n\r\nb = bin(s)[2:][::-1]\r\n\r\nused = {}\r\nfor i in range(len(b)):\r\n if b[i] == '1':\r\n if i in c and c[i] > 0:\r\n c[i] -= 1\r\n if i in used:\r\n used[i] += 1\r\n else:\r\n used[i] = 1\r\n else:\r\n sm = 0\r\n for j in range(i):\r\n if j in c and c[j] > 0:\r\n sm += c[j]*(2**j)\r\n if sm < 2**i:\r\n print(-1)\r\n break\r\n else:\r\n sm = 0\r\n for j in range(i-1,-1,-1):\r\n if j in c and c[j] > 0:\r\n if sm+c[j]*(2**j) == 2**i:\r\n if j in used:\r\n used[j] += c[j]\r\n else:\r\n used[j] = c[j]\r\n c[j] = 0\r\n sm += c[j]*(2**j)\r\n break\r\n elif sm+c[j]*(2**j)<2**i:\r\n if j in used:\r\n used[j] += c[j]\r\n else:\r\n used[j] = c[j]\r\n c[j] = 0\r\n sm += c[j]*(2**j)\r\n else:\r\n d = (2**i-sm)//(2**j)\r\n if j in used:\r\n used[j] += d\r\n else:\r\n used[j] = d\r\n c[j] -= d\r\n sm += d*(2**j)\r\nelse:\r\n lst = []\r\n nonz = sum([used[i] for i in used])\r\n for i in range(1,t+1):\r\n if nonz == 0:\r\n break\r\n l = 0\r\n tmp = i\r\n while tmp%2==0:\r\n tmp /= 2\r\n l += 1\r\n if l in used and used[l] >0:\r\n used[l] -= 1\r\n nonz -= 1\r\n lst.append(i) \r\n print(len(lst))\r\n print(*lst)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word *s*. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word *s*.",
"input": "",
"output": "```python\ns = input()\r\ncheck = False\r\nwhile s.count(\"h\") > 1:\r\n s = s.replace(\"h\", \"\",1) \r\nwhile s.count(\"h\") == 1:\r\n for i in s:\r\n if i == \"h\":\r\n a , b = s.split(i)\r\n s = b\r\n if s[0] == \"e\":\r\n while s.count(\"e\") > 1:\r\n s = s.replace(\"e\", \"\",1) \r\n while s.count(\"e\") == 1:\r\n for i in s:\r\n if i == \"e\":\r\n a , b = s.split(i)\r\n s = b\r\n if s[0] == \"l\" and s[1] == \"l\" :\r\n while s.count(\"l\") > 1:\r\n s = s.replace(\"l\", \"\",1) \r\n while s.count(\"l\") == 1:\r\n for i in s:\r\n if i == \"l\":\r\n a , b = s.split(i)\r\n s = b \r\n if s[0] == \"o\" :\r\n while s.count(\"o\") > 1:\r\n s = s.replace(\"o\", \"\",1) \r\n while s.count(\"o\") == 1:\r\n for i in s:\r\n if i == \"o\":\r\n a , b = s.split(i)\r\n s = b\r\n check = True\r\nif check:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The last stage of Football World Cup is played using the play-off system.\n\nThere are *n* teams left in this stage, they are enumerated from 1 to *n*. Several rounds are held, in each round the remaining teams are sorted in the order of their ids, then the first in this order plays with the second, the third — with the fourth, the fifth — with the sixth, and so on. It is guaranteed that in each round there is even number of teams. The winner of each game advances to the next round, the loser is eliminated from the tournament, there are no draws. In the last round there is the only game with two remaining teams: the round is called the Final, the winner is called the champion, and the tournament is over.\n\nArkady wants his two favorite teams to play in the Final. Unfortunately, the team ids are already determined, and it may happen that it is impossible for teams to meet in the Final, because they are to meet in some earlier stage, if they are strong enough. Determine, in which round the teams with ids *a* and *b* can meet.",
"input": "",
"output": "```python\nn, a, b = map(int, input().split())\r\nans = 0\r\na -= 1\r\nb -= 1\r\nwhile n > 2:\r\n n //= 2\r\n a //= 2\r\n b //= 2\r\n ans += 1\r\n if a == b:\r\n print(ans)\r\n break\r\nelse:\r\n print(\"Final!\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.\n\nMarmot brought Mole *n* ordered piles of worms such that *i*-th pile contains *a**i* worms. He labeled all these worms with consecutive integers: worms in first pile are labeled with numbers 1 to *a*1, worms in second pile are labeled with numbers *a*1<=+<=1 to *a*1<=+<=*a*2 and so on. See the example for a better understanding.\n\nMole can't eat all the worms (Marmot brought a lot) and, as we all know, Mole is blind, so Marmot tells him the labels of the best juicy worms. Marmot will only give Mole a worm if Mole says correctly in which pile this worm is contained.\n\nPoor Mole asks for your help. For all juicy worms said by Marmot, tell Mole the correct answers.",
"input": "",
"output": "```python\ndef solucion(num_W, label_j_W):\r\n lista_int = []\r\n valor = 0\r\n lista_2 = []\r\n for i in range(len(num_W)):\r\n lista_int.append(valor+num_W[i])\r\n valor += num_W[i]\r\n label_j_W_2 = sorted(label_j_W)\r\n for i in range(len(label_j_W_2)):\r\n contador = lista_int[0]\r\n for j in range(len(lista_int)):\r\n if label_j_W_2[i] <= contador:\r\n lista_2.append(j+1)\r\n break\r\n else:\r\n if j+1 < len(lista_int):\r\n contador = lista_int[j+1]\r\n else:\r\n break\r\n for i in range(len(lista_2)):\r\n if label_j_W[i] != label_j_W_2[i]:\r\n print(lista_2[label_j_W_2.index(label_j_W[i])])\r\n else:\r\n print(lista_2[i])\r\ndef main():\r\n '''Funcion principal'''\r\n input()\r\n num_W = [int(x) for x in input().split()]\r\n input()\r\n label_j_W = [int(x) for x in input().split()]\r\n solucion(num_W, label_j_W)\r\n\r\nmain()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little boy Petya loves stairs very much. But he is bored from simple going up and down them — he loves jumping over several stairs at a time. As he stands on some stair, he can either jump to the next one or jump over one or two stairs at a time. But some stairs are too dirty and Petya doesn't want to step on them.\n\nNow Petya is on the first stair of the staircase, consisting of *n* stairs. He also knows the numbers of the dirty stairs of this staircase. Help Petya find out if he can jump through the entire staircase and reach the last stair number *n* without touching a dirty stair once.\n\nOne has to note that anyway Petya should step on the first and last stairs, so if the first or the last stair is dirty, then Petya cannot choose a path with clean steps only.",
"input": "",
"output": "```python\nn,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nif n in x:\r\n print(\"NO\")\r\nelse:\r\n for i in range(1,len(x)):\r\n if x[i]-x[i-1]>3:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two positive integers *a* and *b* have a sum of *s* and a bitwise XOR of *x*. How many possible values are there for the ordered pair (*a*,<=*b*)?",
"input": "",
"output": "```python\nfor _ in range(1):\r\n add,xor_n=map(int,input().split())\r\n if add < xor_n:\r\n print(0)\r\n continue\r\n d=add-xor_n\r\n if d % 2==1:\r\n print(0)\r\n continue\r\n d//=2\r\n xor=bin(xor_n).replace(\"0b\",\"\")\r\n sub=0\r\n if xor_n & d==0:\r\n if add==xor_n:\r\n sub=2\r\n print(2**xor.count('1')-sub)\r\n else:\r\n print(0)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "An African crossword is a rectangular table *n*<=×<=*m* in size. Each cell of the table contains exactly one letter. This table (it is also referred to as grid) contains some encrypted word that needs to be decoded.\n\nTo solve the crossword you should cross out all repeated letters in rows and columns. In other words, a letter should only be crossed out if and only if the corresponding column or row contains at least one more letter that is exactly the same. Besides, all such letters are crossed out simultaneously.\n\nWhen all repeated letters have been crossed out, we should write the remaining letters in a string. The letters that occupy a higher position follow before the letters that occupy a lower position. If the letters are located in one row, then the letter to the left goes first. The resulting word is the answer to the problem.\n\nYou are suggested to solve an African crossword and print the word encrypted there.",
"input": "",
"output": "```python\nn,m=map(int,input().split()) ; arr=[]\r\nfor i in range(n):\r\n x=input()\r\n arr.append(x)\r\nfor h in range(n):\r\n for i in range(m):\r\n c=0\r\n let=arr[h][i]\r\n if let.isalpha():\r\n for j in range(h+1,n):\r\n if arr[j][i]==let:\r\n arr[j]=arr[j].replace(let,\"0\") ; c+=1\r\n if c>0:\r\n arr[h]=arr[h].replace(let,\"0\")\r\n\r\n \r\n \r\n \r\ns=\"\" \r\nfor i in range(n):\r\n for j in range(m):\r\n let=arr[i][j]\r\n if let.isalpha():\r\n if arr[i].count(let)>1:\r\n arr[i]=arr[i].replace(let,'0')\r\n else:\r\n s+=let\r\nprint(s)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The winner of the card game popular in Berland \"Berlogging\" is determined according to the following rules. If at the end of the game there is only one player with the maximum number of points, he is the winner. The situation becomes more difficult if the number of such players is more than one. During each round a player gains or loses a particular number of points. In the course of the game the number of points is registered in the line \"name score\", where name is a player's name, and score is the number of points gained in this round, which is an integer number. If score is negative, this means that the player has lost in the round. So, if two or more players have the maximum number of points (say, it equals to *m*) at the end of the game, than wins the one of them who scored at least *m* points first. Initially each player has 0 points. It's guaranteed that at the end of the game at least one player has a positive number of points.",
"input": "",
"output": "```python\nimport sys\r\n\r\n\r\ndef parse_line(line):\r\n line = line.strip().split()\r\n name = line[0]\r\n score = int(line[1])\r\n return name, score\r\n\r\n\r\ndef update_scores(name, score, scores, winner):\r\n if name not in scores:\r\n scores[name] = score\r\n else:\r\n scores[name] += score\r\n if winner == '':\r\n winner = name\r\n else:\r\n if scores[name] > scores[winner]:\r\n winner = name\r\n return winner\r\n\r\n\r\nlines = sys.stdin.readlines()\r\nrounds = int(lines[0].strip())\r\n\r\n\r\nscores = {}\r\nwinner = ''\r\nfor round in range(1, rounds+1):\r\n name, score = parse_line(lines[round])\r\n winner = update_scores(name, score, scores, winner)\r\n\r\n\r\nprint(winner)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Lenny is playing a game on a 3<=×<=3 grid of lights. In the beginning of the game all lights are switched on. Pressing any of the lights will toggle it and all side-adjacent lights. The goal of the game is to switch all the lights off. We consider the toggling as follows: if the light was switched on then it will be switched off, if it was switched off then it will be switched on.\n\nLenny has spent some time playing with the grid and by now he has pressed each light a certain number of times. Given the number of times each light is pressed, you have to print the current state of each light.",
"input": "",
"output": "```python\nn = int(input())\ndef dd(n):\n if len(str(n)) != len(set(list(str(n)))):\n return False\n else:\n return True\nn += 1\nwhile not dd(n):\n n += 1\n\nprint(n)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two arrays *A* and *B* consisting of integers, sorted in non-decreasing order. Check whether it is possible to choose *k* numbers in array *A* and choose *m* numbers in array *B* so that any number chosen in the first array is strictly less than any number chosen in the second array.",
"input": "",
"output": "```python\nfrom sys import stdin\r\n_input = stdin.readline\r\n_int = int\r\ncount, cnt = [_int(i) for i in _input().split()]\r\nk, m = [_int(i) for i in _input().split()]\r\na = [_int(i) for i in _input().split()]\r\nb = [_int(i) for i in _input().split()]\r\na = a[k-1]\r\nb = b[cnt - m]\r\nif a < b:\r\n print('YES')\r\nelse:\r\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her *n* students and give each of them a jigsaw puzzle (which, as wikipedia states, is a tiling puzzle that requires the assembly of numerous small, often oddly shaped, interlocking and tessellating pieces).\n\nThe shop assistant told the teacher that there are *m* puzzles in the shop, but they might differ in difficulty and size. Specifically, the first jigsaw puzzle consists of *f*1 pieces, the second one consists of *f*2 pieces and so on.\n\nMs. Manana doesn't want to upset the children, so she decided that the difference between the numbers of pieces in her presents must be as small as possible. Let *A* be the number of pieces in the largest puzzle that the teacher buys and *B* be the number of pieces in the smallest such puzzle. She wants to choose such *n* puzzles that *A*<=-<=*B* is minimum possible. Help the teacher and find the least possible value of *A*<=-<=*B*.",
"input": "",
"output": "```python\nn,m=map(int,input().split())\r\nf=list(map(int,input().split()))\r\nf.sort()\r\nleast=f[n-1]-f[0]\r\nfor i in range(1,m-n+1):\r\n dif=f[i+n-1]-f[i]\r\n if dif2:\r\n print('NO')\r\n else:\r\n if ans==2 or ans==4:\r\n print('YES')\r\n else:\r\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. \"Do I give such a hard task?\" — the HR manager thought. \"Just raise number 5 to the power of *n* and get last two digits of the number. Yes, of course, *n* can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions.\"\n\nCould you pass the interview in the machine vision company in IT City?",
"input": "",
"output": "```python\na=input()\r\nb=5**int(a)\r\nlasttwodigit=b%100\r\nprint(lasttwodigit)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya and Vasya are brothers. Today is a special day for them as their parents left them home alone and commissioned them to do *n* chores. Each chore is characterized by a single parameter — its complexity. The complexity of the *i*-th chore equals *h**i*.\n\nAs Petya is older, he wants to take the chores with complexity larger than some value *x* (*h**i*<=><=*x*) to leave to Vasya the chores with complexity less than or equal to *x* (*h**i*<=≤<=*x*). The brothers have already decided that Petya will do exactly *a* chores and Vasya will do exactly *b* chores (*a*<=+<=*b*<==<=*n*).\n\nIn how many ways can they choose an integer *x* so that Petya got exactly *a* chores and Vasya got exactly *b* chores?",
"input": "",
"output": "```python\n# Wadea #\r\n\r\nn,a,b=map(int ,input().split())\r\narr=list(map(int ,input().split()))\r\narr.sort()\r\nk=arr[b-1]\r\ng=arr[b]\r\nprint(int(abs(k-g)))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\nN,M = input().split()\r\nprint(int(N)*int(M)//2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.\n\nOverall the group has *n* students. They received marks for *m* subjects. Each student got a mark from 1 to 9 (inclusive) for each subject.\n\nLet's consider a student the best at some subject, if there is no student who got a higher mark for this subject. Let's consider a student successful, if there exists a subject he is the best at.\n\nYour task is to find the number of successful students in the group.",
"input": "",
"output": "```python\nn,m = map(int,input().split())\r\nll = []\r\nl = [0] * m\r\nfor i in range(n):\r\n ll.append(input().strip())\r\n for j in range(m):\r\n l[j] = max(l[j],int(ll[-1][j]))\r\nans = 0\r\nfor i in ll:\r\n for j in range(m):\r\n if int(i[j]) == l[j]:\r\n ans += 1\r\n break\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "So, the New Year holidays are over. Santa Claus and his colleagues can take a rest and have guests at last. When two \"New Year and Christmas Men\" meet, thear assistants cut out of cardboard the letters from the guest's name and the host's name in honor of this event. Then the hung the letters above the main entrance. One night, when everyone went to bed, someone took all the letters of our characters' names. Then he may have shuffled the letters and put them in one pile in front of the door.\n\nThe next morning it was impossible to find the culprit who had made the disorder. But everybody wondered whether it is possible to restore the names of the host and his guests from the letters lying at the door? That is, we need to verify that there are no extra letters, and that nobody will need to cut more letters.\n\nHelp the \"New Year and Christmas Men\" and their friends to cope with this problem. You are given both inscriptions that hung over the front door the previous night, and a pile of letters that were found at the front door next morning.",
"input": "",
"output": "```python\na=input()\r\na=list(a)\r\nb=input()\r\nb=list(b)\r\nc=input()\r\nl=list(c)\r\nfor i in a:\r\n if i in l:\r\n l.remove(i)\r\n a.remove(i)\r\nfor i in b:\r\n if i in l:\r\n l.remove(i)\r\n b.remove(i)\r\nprint('YES' if len(l)==0 and len(a)==0 and len(b)==0 else 'NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once Bob got to a sale of old TV sets. There were *n* TV sets at that sale. TV set with index *i* costs *a**i* bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV sets he wants. Though he's very strong, Bob can carry at most *m* TV sets, and he has no desire to go to the sale for the second time. Please, help Bob find out the maximum sum of money that he can earn.",
"input": "",
"output": "```python\n# -*- coding: utf-8 -*-\n\"\"\"Codeforce\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1vkqd1IDYYeIi4VIH6yqQEhbS4qcGMzLO\n\"\"\"\n\nn , m = map(int , input().split())\ntv_price = list(map(int , input().split()))\ntv_price = sorted(tv_price)\n\n\nearning = 0\n\nfor i in range(m):\n if tv_price[i] < 0:\n earning += tv_price[i]\n else:\n break\n\nprint(earning)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Being a programmer, you like arrays a lot. For your birthday, your friends have given you an array *a* consisting of *n* distinct integers.\n\nUnfortunately, the size of *a* is too small. You want a bigger array! Your friends agree to give you a bigger array, but only if you are able to answer the following question correctly: is it possible to sort the array *a* (in increasing order) by reversing exactly one segment of *a*? See definitions of segment and reversing in the notes.",
"input": "",
"output": "```python\nn=int(input())\r\nA=input().split()\r\nN={}\r\nfor x in range(n):\r\n N[int(A[x])]=x\r\nM=sorted(N.items())\r\nP=[]\r\nQ=[]\r\nfor x in range(n):\r\n if x!=M[x][1]:\r\n P.append(M[x][1])\r\n Q.append(x)\r\nif P==sorted(Q, reverse=True):\r\n print('yes')\r\nelse:\r\n print('no')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little boy Petya loves stairs very much. But he is bored from simple going up and down them — he loves jumping over several stairs at a time. As he stands on some stair, he can either jump to the next one or jump over one or two stairs at a time. But some stairs are too dirty and Petya doesn't want to step on them.\n\nNow Petya is on the first stair of the staircase, consisting of *n* stairs. He also knows the numbers of the dirty stairs of this staircase. Help Petya find out if he can jump through the entire staircase and reach the last stair number *n* without touching a dirty stair once.\n\nOne has to note that anyway Petya should step on the first and last stairs, so if the first or the last stair is dirty, then Petya cannot choose a path with clean steps only.",
"input": "",
"output": "```python\nn, m=map (int, input ().split ())\r\nl=[]\r\nif m>0:\r\n\tk=list(map (int, input ().split ()))\r\n\tl=k\r\nif (1 in l) or (n in l):\r\n\tprint ('NO')\r\nelif m==0:\r\n\tprint ('YES' ) \r\nelse:\r\n\tl.sort() \r\n\tflag =0\r\n\tfor i in range(m-2):\r\n\t\tif l[i+1]-l[i] ==1 and l[i+2]-l[i+1] ==1:\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\n\tif flag ==1:\r\n\t\tprint ('NO')\r\n\telse:\r\n\t\tprint ('YES')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ted has a pineapple. This pineapple is able to bark like a bulldog! At time *t* (in seconds) it barks for the first time. Then every *s* seconds after it, it barks twice with 1 second interval. Thus it barks at times *t*, *t*<=+<=*s*, *t*<=+<=*s*<=+<=1, *t*<=+<=2*s*, *t*<=+<=2*s*<=+<=1, etc.\n\nBarney woke up in the morning and wants to eat the pineapple, but he can't eat it when it's barking. Barney plans to eat it at time *x* (in seconds), so he asked you to tell him if it's gonna bark at that time.",
"input": "",
"output": "```python\nt,s,x=map(int,input().split())\r\ni=1\r\nwhile i= 6:\r\n print(6)\r\n else:\r\n print(5)\r\nelif m in lst2:\r\n if d == 1:\r\n print(4)\r\n else:\r\n print(5)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Olga came to visit the twins Anna and Maria and saw that they have many cookies. The cookies are distributed into bags. As there are many cookies, Olga decided that it's no big deal if she steals a bag. However, she doesn't want the sisters to quarrel because of nothing when they divide the cookies. That's why Olga wants to steal a bag with cookies so that the number of cookies in the remaining bags was even, that is, so that Anna and Maria could evenly divide it into two (even 0 remaining cookies will do, just as any other even number). How many ways there are to steal exactly one cookie bag so that the total number of cookies in the remaining bags was even?",
"input": "",
"output": "```python\nn=int(input())\na=list(map(int,input().split()))\nk=sum(a)%2\nc=0\nfor i in range(n):\n if a[i]%2==k:\n c+=1\nprint(c)\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "As it's the first of April, Heidi is suspecting that the news she reads today are fake, and she does not want to look silly in front of all the contestants. She knows that a newspiece is fake if it contains heidi as a subsequence. Help Heidi assess whether the given piece is true, but please be discreet about it...",
"input": "",
"output": "```python\nx = input()\nif (\"h\" in x):\n if (\"e\" in x):\n if (\"i\" in x):\n if (\"d\" in x):\n if (\"i\" in x):\n print (\"YES\")\nelse:\n print (\"NO\")\n \t \t \t\t\t \t\t \t \t\t \t\t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The following problem is well-known: given integers *n* and *m*, calculate\n\nwhere 2*n*<==<=2·2·...·2 (*n* factors), and denotes the remainder of division of *x* by *y*.\n\nYou are asked to solve the \"reverse\" problem. Given integers *n* and *m*, calculate",
"input": "",
"output": "```python\nn = int(input())\r\nm = int(input())\r\n\r\nif m == 1:\r\n print(1)\r\nelse:\r\n x = str(bin(m))\r\n print(int(x[-n:],2))\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a \"crime\" and find out what is happening. He can ask any questions whatsoever that can be answered with \"Yes\" or \"No\". All the rest agree beforehand to answer the questions like that: if the question’s last letter is a vowel, they answer \"Yes\" and if the last letter is a consonant, they answer \"No\". Of course, the sleuth knows nothing about it and his task is to understand that.\n\nUnfortunately, Vasya is not very smart. After 5 hours of endless stupid questions everybody except Vasya got bored. That’s why Vasya’s friends ask you to write a program that would give answers instead of them.\n\nThe English alphabet vowels are: A, E, I, O, U, Y\n\nThe English alphabet consonants are: B, C, D, F, G, H, J, K, L, M, N, P, Q, R, S, T, V, W, X, Z",
"input": "",
"output": "```python\ns = input()\r\nc = len(s)-1\r\n \r\nif (s[c].isalpha()):\r\n\tif (s[c].upper()=='A' or s[c].upper()=='E' or s[c].upper()=='I' or s[c].upper()=='O' or s[c].upper()=='U' or s[c].upper()=='Y'):\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nelse:\r\n\tif (s[c-1].upper()=='A' or s[c-1].upper()=='E' or s[c-1].upper()=='I' or s[c-1].upper()=='O' or s[c-1].upper()=='U'or s[c-1].upper()=='Y'):\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t\texit()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Winnie-the-Pooh likes honey very much! That is why he decided to visit his friends. Winnie has got three best friends: Rabbit, Owl and Eeyore, each of them lives in his own house. There are winding paths between each pair of houses. The length of a path between Rabbit's and Owl's houses is *a* meters, between Rabbit's and Eeyore's house is *b* meters, between Owl's and Eeyore's house is *c* meters.\n\nFor enjoying his life and singing merry songs Winnie-the-Pooh should have a meal *n* times a day. Now he is in the Rabbit's house and has a meal for the first time. Each time when in the friend's house where Winnie is now the supply of honey is about to end, Winnie leaves that house. If Winnie has not had a meal the required amount of times, he comes out from the house and goes to someone else of his two friends. For this he chooses one of two adjacent paths, arrives to the house on the other end and visits his friend. You may assume that when Winnie is eating in one of his friend's house, the supply of honey in other friend's houses recover (most probably, they go to the supply store).\n\nWinnie-the-Pooh does not like physical activity. He wants to have a meal *n* times, traveling minimum possible distance. Help him to find this distance.",
"input": "",
"output": "```python\nfrom sys import stdin, stdout\r\nfrom functools import reduce\r\n\r\ndef main():\r\n n=int(stdin.readline().strip())-1\r\n a=int(stdin.readline().strip())\r\n b=int(stdin.readline().strip())\r\n c=int(stdin.readline().strip())\r\n if n<=0: return 0\r\n x=min(a, min(b, c))\r\n if x==a or x==b: return x*n\r\n else: return min(a,b)+c*n-1\r\n\r\nstdout.write(str(main()))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya adores sport programming. He can't write programs but he loves to watch the contests' progress. Vasya even has a favorite coder and Vasya pays special attention to him.\n\nOne day Vasya decided to collect the results of all contests where his favorite coder participated and track the progress of his coolness. For each contest where this coder participated, he wrote out a single non-negative number — the number of points his favorite coder earned in the contest. Vasya wrote out the points for the contest in the order, in which the contests run (naturally, no two contests ran simultaneously).\n\nVasya considers a coder's performance in a contest amazing in two situations: he can break either his best or his worst performance record. First, it is amazing if during the contest the coder earns strictly more points that he earned on each past contest. Second, it is amazing if during the contest the coder earns strictly less points that he earned on each past contest. A coder's first contest isn't considered amazing. Now he wants to count the number of amazing performances the coder had throughout his whole history of participating in contests. But the list of earned points turned out long and Vasya can't code... That's why he asks you to help him.",
"input": "",
"output": "```python\nn = int(input())\na = [int(x) for x in input().split()]\nans = 0\nmn = mx = a[0]\nfor x in a:\n if x > mx:\n ans += 1\n mx = x\n if x < mn:\n ans += 1\n mn = x\nprint(ans)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Saratov State University Olympiad Programmers Training Center (SSU OPTC) has *n* students. For each student you know the number of times he/she has participated in the ACM ICPC world programming championship. According to the ACM ICPC rules, each person can participate in the world championship at most 5 times.\n\nThe head of the SSU OPTC is recently gathering teams to participate in the world championship. Each team must consist of exactly three people, at that, any person cannot be a member of two or more teams. What maximum number of teams can the head make if he wants each team to participate in the world championship with the same members at least *k* times?",
"input": "",
"output": "```python\nn, k = map(int, input().split())\r\narr= list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\nfor i in arr:\r\n if 5-i >= k:\r\n count += 1\r\n\r\nans= count // 3\r\n\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.\n\nPetya calls a number almost lucky if it could be evenly divided by some lucky number. Help him find out if the given number *n* is almost lucky.",
"input": "",
"output": "```python\ns=input()\r\nc=0\r\nfor i in s:\r\n if i=='4' or i=='7':\r\n c+=1\r\nl=[4,7,47,74,447,444,474,744,747,774,477]\r\nd=0\r\nfor j in l:\r\n if int(s)>j:\r\n if int(s)%j==0:\r\n d+=1\r\nif d!=0 or c==len(s):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. \"Piece of cake\" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.",
"input": "",
"output": "```python\na=int(input())\r\nb=[]\r\nfor i in range(a):\r\n b.append(list(map(int,input().split(\" \")[:3])))\r\nr=0\r\nfor j in range(len(b)):\r\n r=r+sum(b[j])\r\nif(r==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Theatre Square in the capital city of Berland has a rectangular shape with the size *n*<=×<=*m* meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size *a*<=×<=*a*.\n\nWhat is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.",
"input": "",
"output": "```python\nimport math\r\nm,n,a=map(int,input().split())\r\nx=math.ceil(m/a)\r\ny=math.ceil(n/a)\r\nif x>1 and y>1:\r\n t=x+y\r\nif x<=1 and y<=1:\r\n t=1\r\nif x>1 and y<=1:\r\n t=x\r\nif x<=1 and y>1:\r\n t=y\r\nprint(t)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a very secret base in Potatoland where potato mash is made according to a special recipe. The neighbours from Porridgia decided to seize this recipe and to sell it to Pilauland. For this mission they have been preparing special agent Pearlo for many years. When, finally, Pearlo learned all secrets of espionage, he penetrated into the Potatoland territory and reached the secret base.\n\nNow he is standing at the entrance, but to get inside he need to pass combination lock. Minute ago one of the workers entered the password on the terminal and opened the door. The terminal is a square digital keyboard 3<=×<=3 with digits from 1 to 9.\n\nPearlo knows that the password consists from distinct digits and is probably symmetric with respect to the central button of the terminal. He has heat sensor which allowed him to detect the digits which the worker pressed. Now he wants to check whether the password entered by the worker is symmetric with respect to the central button of the terminal. This fact can Help Pearlo to reduce the number of different possible password combinations.",
"input": "",
"output": "```python\na=input()\r\nb=input()\r\nc=input()\r\na=list(a)\r\nb=list(b)\r\nc=list(c)\r\nif c[::-1]==a:\r\n print(\"YES\")\r\nelif b[0]==b[2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One spring day on his way to university Lesha found an array *A*. Lesha likes to split arrays into several parts. This time Lesha decided to split the array *A* into several, possibly one, new arrays so that the sum of elements in each of the new arrays is not zero. One more condition is that if we place the new arrays one after another they will form the old array *A*.\n\nLesha is tired now so he asked you to split the array. Help Lesha!",
"input": "",
"output": "```python\n#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nn = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\ns = sum(l)\r\nif s != 0:\r\n\tprint('YES')\r\n\tprint(1)\r\n\tprint(1,n)\r\nelse:\r\n\tpossible = False\r\n\r\n\tfor i in range(n):\r\n\t\tif l[i] != 0:\r\n\t\t\tpossible = True\r\n\t\t\tprint('YES')\r\n\t\t\tprint(2)\r\n\t\t\tprint(1,i+1)\r\n\t\t\tprint(i+2,n)\r\n\t\t\tbreak\r\n\r\n\tif not possible:\r\n\t\tprint('NO')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya is preparing for IQ test and he has noticed that there many problems like: you are given a sequence, find the next number. Now Petya can solve only problems with arithmetic or geometric progressions.\n\nArithmetic progression is a sequence *a*1, *a*1<=+<=*d*, *a*1<=+<=2*d*, ..., *a*1<=+<=(*n*<=-<=1)*d*, where *a*1 and *d* are any numbers.\n\nGeometric progression is a sequence *b*1, *b*2<==<=*b*1*q*, ..., *b**n*<==<=*b**n*<=-<=1*q*, where *b*1<=≠<=0, *q*<=≠<=0, *q*<=≠<=1. \n\nHelp Petya and write a program to determine if the given sequence is arithmetic or geometric. Also it should found the next number. If the sequence is neither arithmetic nor geometric, print 42 (he thinks it is impossible to find better answer). You should also print 42 if the next element of progression is not integer. So answer is always integer.",
"input": "",
"output": "```python\nnumbers = list(map(int,input().split()))\r\narithmetic_prog = numbers[1] - numbers[0]\r\ngeometric_prog = numbers[1] / numbers[0]\r\n\r\nif numbers[3]-numbers[2] == arithmetic_prog and numbers[2]-numbers[1] == arithmetic_prog:\r\n print(int(numbers[-1]+arithmetic_prog))\r\nelif numbers[3]/numbers[2] == geometric_prog and numbers[2]/numbers[1] == geometric_prog:\r\n print(int(numbers[-1]*geometric_prog))\r\nelse:\r\n print(42)\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A soldier wants to buy *w* bananas in the shop. He has to pay *k* dollars for the first banana, 2*k* dollars for the second one and so on (in other words, he has to pay *i*·*k* dollars for the *i*-th banana). \n\nHe has *n* dollars. How many dollars does he have to borrow from his friend soldier to buy *w* bananas?",
"input": "",
"output": "```python\nk,n,w=map(int,input().split())\nsum=0\ntc=0\nfor i in range(w+1):\n sum=sum+i\ntc=sum*k\nprint(tc-n) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Some days ago, I learned the concept of LCM (least common multiple). I've played with it for several times and I want to make a big number with it.\n\nBut I also don't want to use many numbers, so I'll choose three positive integers (they don't have to be distinct) which are not greater than *n*. Can you help me to find the maximum possible least common multiple of these three integers?",
"input": "",
"output": "```python\nfrom math import gcd\r\n\r\nn = int(input())\r\n\r\nif n <= 3:\r\n print([0, 1, 2, 6][n])\r\n exit()\r\n\r\nprint(\r\n max(\r\n n * (n-1) * (n-2) // gcd(n, n-2),\r\n (n-1) * (n-2) * (n-3) // gcd(n-1, n-3)\r\n )\r\n)\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You helped Dima to have a great weekend, but it's time to work. Naturally, Dima, as all other men who have girlfriends, does everything wrong.\n\nInna and Dima are now in one room. Inna tells Dima off for everything he does in her presence. After Inna tells him off for something, she goes to another room, walks there in circles muttering about how useless her sweetheart is. During that time Dima has time to peacefully complete *k*<=-<=1 tasks. Then Inna returns and tells Dima off for the next task he does in her presence and goes to another room again. It continues until Dima is through with his tasks.\n\nOverall, Dima has *n* tasks to do, each task has a unique number from 1 to *n*. Dima loves order, so he does tasks consecutively, starting from some task. For example, if Dima has 6 tasks to do in total, then, if he starts from the 5-th task, the order is like that: first Dima does the 5-th task, then the 6-th one, then the 1-st one, then the 2-nd one, then the 3-rd one, then the 4-th one.\n\nInna tells Dima off (only lovingly and appropriately!) so often and systematically that he's very well learned the power with which she tells him off for each task. Help Dima choose the first task so that in total he gets told off with as little power as possible.",
"input": "",
"output": "```python\ndef read():\r\n n, k = list(map(int, input().split()))\r\n powers = list(map(int, input().split()))\r\n return n, k, powers\r\n\r\n\r\ndef get_min_power(n, k, powers):\r\n start_task = 0\r\n mins = []\r\n for i in range(k):\r\n s = 0\r\n for j in range(i, n, k):\r\n s += powers[j]\r\n mins.append(s)\r\n task = min(mins)\r\n return mins.index(task) + 1\r\n\r\ndef main():\r\n n, k, powers = read()\r\n print(get_min_power(n, k, powers))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "An *n*<=×<=*n* table *a* is defined as follows:\n - The first row and the first column contain ones, that is: *a**i*,<=1<==<=*a*1,<=*i*<==<=1 for all *i*<==<=1,<=2,<=...,<=*n*. - Each of the remaining numbers in the table is equal to the sum of the number above it and the number to the left of it. In other words, the remaining elements are defined by the formula *a**i*,<=*j*<==<=*a**i*<=-<=1,<=*j*<=+<=*a**i*,<=*j*<=-<=1. \nThese conditions define all the values in the table.\n\nYou are given a number *n*. You need to determine the maximum value in the *n*<=×<=*n* table defined by the rules above.",
"input": "",
"output": "```python\nn = int(input())\r\nx = [0,1,2,6,20,70,252,924,3432,12870,48620]\r\nprint(x[n])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A bracket sequence is a string, containing only characters \"(\", \")\", \"[\" and \"]\".\n\nA correct bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inserting characters \"1\" and \"+\" between the original characters of the sequence. For example, bracket sequences \"()[]\", \"([])\" are correct (the resulting expressions are: \"(1)+[1]\", \"([1+1]+1)\"), and \"](\" and \"[\" are not. The empty string is a correct bracket sequence by definition.\n\nA substring *s*[*l*... *r*] (1<=≤<=*l*<=≤<=*r*<=≤<=|*s*|) of string *s*<==<=*s*1*s*2... *s*|*s*| (where |*s*| is the length of string *s*) is the string *s**l**s**l*<=+<=1... *s**r*. The empty string is a substring of any string by definition.\n\nYou are given a bracket sequence, not necessarily correct. Find its substring which is a correct bracket sequence and contains as many opening square brackets «[» as possible.",
"input": "",
"output": "```python\n'''input\n((()))([]\n'''\nfrom sys import stdin\n\n\ndef check_valid(string):\n\tstack = []\n\tfor i in string:\n\t\tif i in ['(', '[']:\n\t\t\tstack.append(i)\n\t\telif i == ')':\n\t\t\tif len(stack) > 0:\n\t\t\t\tif stack[-1] == '(':\n\t\t\t\t\tstack.pop()\n\t\t\t\t\tcontinue\n\t\t\treturn False\n\t\telif i == ']':\n\t\t\tif len(stack) > 0:\n\t\t\t\tif stack[-1] == '[':\n\t\t\t\t\tstack.pop()\n\t\t\t\t\tcontinue\n\t\t\treturn False\n \n\treturn len(stack) == 0\n \n\ndef merge(index):\n\t# refining\n\taux = []\n\tif len(index) > 0:\n\t\tstart = index[0][0]\n\t\tend = index[0][1]\n\t\tfor i in range(1, len(index)):\n\t\t\ts, e = index[i]\n\t\t\tif e <= end:\n\t\t\t\tpass\n\t\t\telif s >= end:\n\t\t\t\taux.append([start, end])\n\t\t\t\tstart, end = s, e\n\t\taux.append([start, end])\n\tindex = aux\n\n\n\n\n\t# acutal merging\n\taux = []\n\tif len(index) > 0:\n\t\taux = [index[0]]\n\t\tfor i in range(1, len(index)):\n\t\t\tif index[i][0] == aux[-1][1] + 1:\n\t\t\t\taux[-1][1] = index[i][1]\n\t\t\telse:\n\t\t\t\tif check_valid(string[aux[-1][1] + 1: index[i][0]]):\n\t\t\t\t\taux[-1][1] = index[i][1]\n\t\t\t\telse:\n\t\t\t\t\taux.append(index[i])\n\treturn aux\n \n\n# main starts\nstring = stdin.readline().strip()\nstack = []\nindex = []\nstart = -1\nend = -1\nfor i in range(len(string)):\n\tif string[i] == '(':\n\t\tstack.append(i)\n\telif string[i] == '[':\n\t\tstack.append(i)\n\n\telif string[i] == ')':\n\t\tif len(stack) > 0 and string[stack[-1]] == '(':\n\t\t\tindex.append([stack[-1], i])\n\t\t\tstack.pop()\n\t\telse:\n\t\t\tstack = []\n\telif string[i] == ']':\n\t\tif len(stack) > 0 and string[stack[-1]] == '[':\n\t\t\tindex.append([stack[-1], i])\n\t\t\tstack.pop()\t\n\t\telse:\n\t\t\tstack = []\n\nindex.sort(key = lambda x:(x[0], x[1]))\n\n\nindex = merge(index)\ndiff = 0\nans = [-1, -1]\nfor i in index:\n\tstart, end = i\n\tc = string[start: end + 1].count('[')\n\tif diff < c :\n\t\tans = [start, end + 1]\n\t\tdiff = c\n\n\nprint(diff)\nprint(string[ans[0]: ans[1]])\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given the current time in 24-hour format hh:mm. Find and print the time after *a* minutes.\n\nNote that you should find only the time after *a* minutes, see the examples to clarify the problem statement.\n\nYou can read more about 24-hour format here [https://en.wikipedia.org/wiki/24-hour_clock](https://en.wikipedia.org/wiki/24-hour_clock).",
"input": "",
"output": "```python\nl1 = [int(x) for x in input().split(\":\")]\r\nn = int(input())\r\nfinal = l1[0]*60+l1[1]+n\r\ntotal = 24*60\r\nthing = final%total\r\nprint(str(int(thing/60))+str(\":\")+str(thing%60))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kitahara Haruki has bought *n* apples for Touma Kazusa and Ogiso Setsuna. Now he wants to divide all the apples between the friends.\n\nEach apple weights 100 grams or 200 grams. Of course Kitahara Haruki doesn't want to offend any of his friend. Therefore the total weight of the apples given to Touma Kazusa must be equal to the total weight of the apples given to Ogiso Setsuna.\n\nBut unfortunately Kitahara Haruki doesn't have a knife right now, so he cannot split any apple into some parts. Please, tell him: is it possible to divide all the apples in a fair way between his friends?",
"input": "",
"output": "```python\nx = int(input())\r\nfrom collections import Counter\r\ny = map(int,input().split())\r\ny = Counter(y)\r\n# print(y)\r\ns = y[100]+y[200]*2\r\n# print(s)\r\nif s%2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two integers $a$ and $b$. Moreover, you are given a sequence $s_0, s_1, \\dots, s_{n}$. All values in $s$ are integers $1$ or $-1$. It's known that sequence is $k$-periodic and $k$ divides $n+1$. In other words, for each $k \\leq i \\leq n$ it's satisfied that $s_{i} = s_{i - k}$.\n\nFind out the non-negative remainder of division of $\\sum \\limits_{i=0}^{n} s_{i} a^{n - i} b^{i}$ by $10^{9} + 9$.\n\nNote that the modulo is unusual!",
"input": "",
"output": "```python\nn, a, b, k = map(int,input().split())\r\ns = input()\r\n\r\ni = 0\r\nsu = []\r\n\r\nfor i in range(k):\r\n t = 0\r\n if s[i] == '+':\r\n for j in range(n // k + 1):\r\n if 0 <= n-k*j-i <= n:\r\n t += pow(a, n-k*j-i, 10**9+9)*pow(b, k*j+i, 10**9+9)\r\n else:\r\n for j in range(n // k + 1):\r\n if 0 <= n-k*j-i <= n:\r\n t -= pow(a, n-k*j-i, 10**9+9)*pow(b, k*j+i, 10**9+9)\r\n su.append(t)\r\n\r\nprint(sum(su) % (10**9+9))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Fox Ciel saw a large field while she was on a bus. The field was a *n*<=×<=*m* rectangle divided into 1<=×<=1 cells. Some cells were wasteland, and other each cell contained crop plants: either carrots or kiwis or grapes. \n\nAfter seeing the field carefully, Ciel found that the crop plants of each cell were planted in following procedure:\n - Assume that the rows are numbered 1 to *n* from top to bottom and the columns are numbered 1 to *m* from left to right, and a cell in row *i* and column *j* is represented as (*i*,<=*j*). - First, each field is either cultivated or waste. Crop plants will be planted in the cultivated cells in the order of (1,<=1)<=→<=...<=→<=(1,<=*m*)<=→<=(2,<=1)<=→<=...<=→<=(2,<=*m*)<=→<=...<=→<=(*n*,<=1)<=→<=...<=→<=(*n*,<=*m*). Waste cells will be ignored. - Crop plants (either carrots or kiwis or grapes) will be planted in each cell one after another cyclically. Carrots will be planted in the first cell, then kiwis in the second one, grapes in the third one, carrots in the forth one, kiwis in the fifth one, and so on. \nThe following figure will show you the example of this procedure. Here, a white square represents a cultivated cell, and a black square represents a waste cell.\n\nNow she is wondering how to determine the crop plants in some certain cells.",
"input": "",
"output": "```python\n\r\ndef mi():\r\n\treturn map(int, input().split())\r\nn,m,k,t = mi()\r\nwasterowscount = [0]*(n+1)\r\nd = {0:'Carrots',1:'Kiwis',2:'Grapes'}\r\n\r\nwaste = [[]]*(n+1)\r\ndef fun(x,y):\r\n\tglobal waste\r\n\tif y in waste[x]:\r\n\t\tprint ('Waste')\r\n\t\treturn 0\r\n\tcur = (((x-1)*m-wasterowscount[x-1]))\r\n\tcur+=(y)\r\n\tfor i in range(wasterowscount[x]-wasterowscount[x-1]):\r\n\t\tif waste[x][i]countU:\r\n \r\n print(T.lower())\r\nif countLmaximum):\r\n maximum=col\r\n \r\n\r\nprint(maximum)\r\n\r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a connected weighted undirected graph without any loops and multiple edges. \n\nLet us remind you that a graph's spanning tree is defined as an acyclic connected subgraph of the given graph that includes all of the graph's vertexes. The weight of a tree is defined as the sum of weights of the edges that the given tree contains. The minimum spanning tree (MST) of a graph is defined as the graph's spanning tree having the minimum possible weight. For any connected graph obviously exists the minimum spanning tree, but in the general case, a graph's minimum spanning tree is not unique.\n\nYour task is to determine the following for each edge of the given graph: whether it is either included in any MST, or included at least in one MST, or not included in any MST.",
"input": "",
"output": "```python\nN = 100010\r\nn, m = map(int, input().split())\r\n\r\nx = [0] * (N)\r\ny = [0] * (N)\r\nz = [0] * (N)\r\np = [0] * (N)\r\nans = [0] * (N)\r\nf = [False] * (N)\r\nh = [0] * (N)\r\npe = [0] * (N)\r\nd = [0] * (N)\r\nv = [[] for _ in range(N)]\r\n\r\n# Função para comparar arestas com base em seus pesos (z)\r\ndef cmp(i, j):\r\n return z[i] < z[j]\r\n\r\n# Função para encontrar o representante de um conjunto\r\ndef par(x):\r\n while pe[x]:\r\n x = pe[x]\r\n return x\r\n\r\n# Função para unir dois conjuntos\r\ndef uni(x, y):\r\n x = par(x)\r\n y = par(y)\r\n v[x].clear()\r\n v[y].clear()\r\n f[x] = False\r\n f[y] = False\r\n if x == y:\r\n return\r\n if h[x] > h[y]:\r\n pe[y] = x\r\n else:\r\n pe[x] = y\r\n if h[x] == h[y]:\r\n h[y] += 1\r\n\r\n# Função para adicionar uma aresta ao grafo\r\ndef add_edge(x, y, i):\r\n if x == y:\r\n return\r\n ans[i] = 1\r\n v[x].append((y, i))\r\n v[y].append((x, i))\r\n\r\n# Função de busca em profundidade (DFS)\r\ndef dfs(c, g, h):\r\n f[c] = True\r\n d[c] = h\r\n for i in v[c]:\r\n if not f[i[0]]:\r\n dfs(i[0], i[1], h + 1)\r\n d[c] = min(d[c], d[i[0]])\r\n elif i[1] != g:\r\n d[c] = min(d[c], d[i[0]])\r\n if d[c] == h:\r\n ans[g] = 2\r\n\r\n# Leitura das informações das arestas\r\nfor i in range(1, m + 1):\r\n x[i], y[i], z[i] = map(int, input().split())\r\n p[i] = i\r\n\r\n# Ordena as arestas com base em seus pesos\r\np.sort(key=lambda i: z[i])\r\n\r\ni = 1\r\nwhile i <= m:\r\n j = i\r\n while j <= m and z[p[j]] == z[p[i]]:\r\n add_edge(par(x[p[j]]), par(y[p[j]]), p[j])\r\n j += 1\r\n j = i\r\n while j <= m and z[p[j]] == z[p[i]]:\r\n k = par(x[p[j]])\r\n if not f[k]:\r\n dfs(k, 0, 0)\r\n j += 1\r\n j = i\r\n while j <= m and z[p[j]] == z[p[i]]:\r\n uni(x[p[j]], y[p[j]])\r\n j += 1\r\n i = j\r\n\r\n# Imprime o tipo de conectividade para cada aresta\r\nfor i in range(1, m + 1):\r\n if ans[i] == 0:\r\n print(\"none\")\r\n elif ans[i] == 1:\r\n print(\"at least one\")\r\n else:\r\n print(\"any\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Unlike Knights of a Round Table, Knights of a Polygonal Table deprived of nobility and happy to kill each other. But each knight has some power and a knight can kill another knight if and only if his power is greater than the power of victim. However, even such a knight will torment his conscience, so he can kill no more than $k$ other knights. Also, each knight has some number of coins. After a kill, a knight can pick up all victim's coins.\n\nNow each knight ponders: how many coins he can have if only he kills other knights?\n\nYou should answer this question for each knight.",
"input": "",
"output": "```python\nimport heapq\n\nif __name__ == '__main__':\n rd = lambda: map(int, input().split())\n n, k = rd()\n a = sorted(zip(rd(), rd(), range(n)))\n\n minH = []\n total = 0\n ans = [0] * n\n for i in range(len(a)):\n if len(minH) >= k + 1:\n (coins, index) = heapq.heappop(minH)\n total -= coins\n\n heapq.heappush(minH, (a[i][1], i))\n\n total += a[i][1]\n ans[a[i][2]] = total\n\n\n\n print(*ans)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "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 *h**i*. 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. for all *i*'s from 1 to *n*<=-<=1 the inequality |*h**i*<=-<=*h**i*<=+<=1|<=≤<=1 holds.\n\nAt the end of the route the tourist rafted down a mountain river and some notes in the journal were washed away. Moreover, the numbers in the notes could have been distorted. Now the tourist wonders what could be the maximum height during his hike. Help him restore the maximum possible value of the maximum height throughout the hike or determine that the notes were so much distorted that they do not represent any possible height values that meet limits |*h**i*<=-<=*h**i*<=+<=1|<=≤<=1.",
"input": "",
"output": "```python\nn,m = map(int,input().split())\r\nl = []\r\nfor i in range(m):\r\n l.append(list(map(int,input().split())))\r\nans = max(l[0][1]+l[0][0],l[-1][1]+n-l[-1][0])\r\nfor i in range(m-1):\r\n if abs(l[i][1]-l[i+1][1]) > abs(l[i][0]-l[i+1][0]):\r\n ans = 'IMPOSSIBLE'\r\n break\r\n if l[i][1] > l[i+1][1]:\r\n ans = max(ans,l[i][1]+(-(l[i][1]-l[i+1][1])+(l[i+1][0]-l[i][0]))//2)\r\n else:\r\n ans = max(ans,l[i][1]+(-(l[i][1]-l[i+1][1])+(l[i+1][0]-l[i][0]))//2)\r\nprint(ans)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sean is trying to save a large file to a USB flash drive. He has *n* USB flash drives with capacities equal to *a*1,<=*a*2,<=...,<=*a**n* megabytes. The file size is equal to *m* megabytes. \n\nFind the minimum number of USB flash drives needed to write Sean's file, if he can split the file between drives.",
"input": "",
"output": "```python\nn=int(input())\r\nm=int(input())\r\ncount=0\r\nc=[]\r\nfor i in range(n):\r\n a = int(input())\r\n c.append(a)\r\nc.sort(reverse=True)\r\nif sum(c)=m:\r\n coumt=0\r\n break\r\n s=c[i]+c[i+1]\r\n if s=m:\r\n count+=1\r\n break\r\n\r\nprint(count+1)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Andrew often reads articles in his favorite magazine 2Char. The main feature of these articles is that each of them uses at most two distinct letters. Andrew decided to send an article to the magazine, but as he hasn't written any article, he just decided to take a random one from magazine 26Char. However, before sending it to the magazine 2Char, he needs to adapt the text to the format of the journal. To do so, he removes some words from the chosen article, in such a way that the remaining text can be written using no more than two distinct letters.\n\nSince the payment depends from the number of non-space characters in the article, Andrew wants to keep the words with the maximum total length.",
"input": "",
"output": "```python\ndef get_letters(word):\n letters = set(word)\n return ''.join(sorted(letters))\n\n\ndef main():\n n = int(input())\n words = [input() for _ in range(n)]\n\n two_letter_maps = {}\n single_letter_maps = {}\n for word in words:\n letters = get_letters(word)\n if len(letters) == 2:\n increase_count(letters, two_letter_maps, len(word))\n elif len(letters) == 1:\n increase_count(letters, single_letter_maps, len(word))\n\n for pairs in two_letter_maps:\n for letter in pairs:\n two_letter_maps[pairs] += get_count(letter, single_letter_maps)\n\n double_count = get_max(two_letter_maps)\n single_count = get_max(single_letter_maps)\n\n count = max(double_count, single_count)\n print(count)\n\n\ndef get_count(key, dictionary):\n if key not in dictionary:\n return 0\n return dictionary[key]\n\n\ndef get_max(dictionary):\n if len(dictionary) == 0:\n return 0\n return max(dictionary.values())\n\n\ndef increase_count(key, dictionary, value):\n if key not in dictionary:\n dictionary[key] = 0\n dictionary[key] += value\n\n\nif __name__ == '__main__':\n main()\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The input contains a single integer *a* (0<=≤<=*a*<=≤<=35).\n\nOutput a single integer.",
"input": "",
"output": "```python\nn = (int)(input());\r\nprint(2 ** n);\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Linear Kingdom has exactly one tram line. It has *n* stops, numbered from 1 to *n* in the order of tram's movement. At the *i*-th stop *a**i* passengers exit the tram, while *b**i* passengers enter it. The tram is empty before it arrives at the first stop. Also, when the tram arrives at the last stop, all passengers exit so that it becomes empty.\n\nYour task is to calculate the tram's minimum capacity such that the number of people inside the tram at any time never exceeds this capacity. Note that at each stop all exiting passengers exit before any entering passenger enters the tram.",
"input": "",
"output": "```python\nn=int(input())\r\nc=0\r\nm=0\r\nwhile(n):\r\n\ta,b=map(int,input().split())\r\n\tc=c-a+b\r\n\tm=max(m,c)\r\n\tn-=1\r\nprint(m)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "These days Arkady works as an air traffic controller at a large airport. He controls a runway which is usually used for landings only. Thus, he has a schedule of planes that are landing in the nearest future, each landing lasts $1$ minute.\n\nHe was asked to insert one takeoff in the schedule. The takeoff takes $1$ minute itself, but for safety reasons there should be a time space between the takeoff and any landing of at least $s$ minutes from both sides.\n\nFind the earliest time when Arkady can insert the takeoff.",
"input": "",
"output": "```python\nn,s = map(int,input().split())\r\na = []\r\nfor i in range(n):\r\n\th , m = map(int,input().split())\r\n\ta.append((h*60)+m)\r\n\r\ntime = a[n-1]+s+1\r\nfor i in range(n-1):\r\n\tdif = a[i+1] - a[i]\r\n\tif(dif > s*2+1):\r\n\t\ttime = a[i]+s+1\r\n\t\tbreak\r\n\r\nh = int(time/60)\r\nm = time%60\r\n\r\nprint(\"{} {}\".format(h,m))\r\n\r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A sequence of non-negative integers *a*1,<=*a*2,<=...,<=*a**n* of length *n* is called a wool sequence if and only if there exists two integers *l* and *r* (1<=≤<=*l*<=≤<=*r*<=≤<=*n*) such that . In other words each wool sequence contains a subsequence of consecutive elements with xor equal to 0.\n\nThe expression means applying the operation of a bitwise xor to numbers *x* and *y*. The given operation exists in all modern programming languages, for example, in languages C++ and Java it is marked as \"^\", in Pascal — as \"xor\".\n\nIn this problem you are asked to compute the number of sequences made of *n* integers from 0 to 2*m*<=-<=1 that are not a wool sequence. You should print this number modulo 1000000009 (109<=+<=9).",
"input": "",
"output": "```python\nx = input()\r\ni = 3\r\ny = \"\"\r\nwhile (i < len(x)-3):\r\n if (x[i]==\"W\" and x[i+1]==\"U\" and x[i+2]==\"P\"):\r\n y = y + \" \"\r\n i += 3\r\n else:\r\n y = y + x[i]\r\n i += 1\r\nprint(y)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A large banner with word CODEFORCES was ordered for the 1000-th onsite round of Codeforcesω that takes place on the Miami beach. Unfortunately, the company that made the banner mixed up two orders and delivered somebody else's banner that contains someone else's word. The word on the banner consists only of upper-case English letters.\n\nThere is very little time to correct the mistake. All that we can manage to do is to cut out some substring from the banner, i.e. several consecutive letters. After that all the resulting parts of the banner will be glued into a single piece (if the beginning or the end of the original banner was cut out, only one part remains); it is not allowed change the relative order of parts of the banner (i.e. after a substring is cut, several first and last letters are left, it is allowed only to glue the last letters to the right of the first letters). Thus, for example, for example, you can cut a substring out from string 'TEMPLATE' and get string 'TEMPLE' (if you cut out string AT), 'PLATE' (if you cut out TEM), 'T' (if you cut out EMPLATE), etc.\n\nHelp the organizers of the round determine whether it is possible to cut out of the banner some substring in such a way that the remaining parts formed word CODEFORCES.",
"input": "",
"output": "```python\na = input()\r\nc = 'CODEFORCES'\r\nif len(a)<10:print('NO')\r\nelse:\r\n t = 0\r\n for i in range(10):\r\n if a[i] == c[i]:\r\n t+=1\r\n for i in range(10):\r\n if a[(-1)*(i+1)] == c[(-1)*(i+1)]:t+=1\r\n print('YES' if t>=10 else 'NO')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In this problem we consider a special type of an auction, which is called the second-price auction. As in regular auction *n* bidders place a bid which is price a bidder ready to pay. The auction is closed, that is, each bidder secretly informs the organizer of the auction price he is willing to pay. After that, the auction winner is the participant who offered the highest price. However, he pay not the price he offers, but the highest price among the offers of other participants (hence the name: the second-price auction).\n\nWrite a program that reads prices offered by bidders and finds the winner and the price he will pay. Consider that all of the offered prices are different.",
"input": "",
"output": "```python\nnums=int(input())\r\na=list(map(int, input().split()))\r\n\r\nm=a[0];mi=0 #m=Largest bid; mi=index of largest bid\r\nn=0\t#Second largest number\r\n\r\nfor i in range(1, nums):\r\n\tif a[i]>=m:\r\n\t\tn=m #Second largest bacomes equal to the previous largest one\r\n\t\tm=a[i] #New largest number\r\n\t\tmi=i #index of the largest bid\r\n\telse:\r\n\t\tif a[i]>=n:\r\n\t\t\tn=a[i] #Second largest number changes if there exists a number between 'n' and 'm'\r\nprint(mi+1, n)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp takes part in a math show. He is given *n* tasks, each consists of *k* subtasks, numbered 1 through *k*. It takes him *t**j* minutes to solve the *j*-th subtask of any task. Thus, time required to solve a subtask depends only on its index, but not on the task itself. Polycarp can solve subtasks in any order.\n\nBy solving subtask of arbitrary problem he earns one point. Thus, the number of points for task is equal to the number of solved subtasks in it. Moreover, if Polycarp completely solves the task (solves all *k* of its subtasks), he recieves one extra point. Thus, total number of points he recieves for the complete solution of the task is *k*<=+<=1.\n\nPolycarp has *M* minutes of time. What is the maximum number of points he can earn?",
"input": "",
"output": "```python\ndef I(): return(list(map(int,input().split())))\r\ndef sieve(n):\r\n\ta=[1]*n\r\n\tfor i in range(2,n):\r\n\t if a[i]:\r\n\t for j in range(i*i,n,i):\r\n\t a[j]=0\r\n\treturn a\r\n\r\n\r\n\r\n\r\nn,k,m=I()\r\narr=I()\r\narr.sort()\r\npts=0\r\nf=0\r\nfor i in range(k-2):\r\n\tcurrm=m\r\n\tpts+=min(n,currm//arr[i])\r\n\r\n\tm-=min(currm//arr[i],n)*arr[i]\r\n\tif m<=0:\r\n\t\tf=1\r\n\t\tbreak\r\n# print(m)\r\nif f or m=n:\r\n\t\t\tpts+=(m//arr[-1])*2\r\n\tprint(pts)\r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kefa decided to make some money doing business on the Internet for exactly *n* days. He knows that on the *i*-th day (1<=≤<=*i*<=≤<=*n*) he makes *a**i* money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence *a**i*. Let us remind you that the subsegment of the sequence is its continuous fragment. A subsegment of numbers is called non-decreasing if all numbers in it follow in the non-decreasing order.\n\nHelp Kefa cope with this task!",
"input": "",
"output": "```python\nn=int(input())\r\nm=list(map(int,input().split()))\r\nc1=1\r\nc2=1\r\nfor i in range(0,n-1):\r\n if m[i]<=m[i+1]:\r\n #print(m[i],m[i+1])\r\n c2 +=1\r\n elif m[i]>m[i+1]:\r\n if c2>c1:\r\n c1=c2\r\n c2=1\r\nif c2 > c1:\r\n c1 = c2\r\nprint(c1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once again Tavas started eating coffee mix without water! Keione told him that it smells awful, but he didn't stop doing that. That's why Keione told his smart friend, SaDDas to punish him! SaDDas took Tavas' headphones and told him: \"If you solve the following problem, I'll return it to you.\"\n\nThe problem is: \n\nYou are given a lucky number *n*. Lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.\n\nIf we sort all lucky numbers in increasing order, what's the 1-based index of *n*? \n\nTavas is not as smart as SaDDas, so he asked you to do him a favor and solve this problem so he can have his headphones back.",
"input": "",
"output": "```python\nd = {'4':1 ,'7':2}\r\nres =0\r\nfor i in input():\r\n res = res * 2 + d[i]\r\n #print(res)\r\nprint(res)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.\n\nUnfortunately, not all numbers are lucky. Petya calls a number nearly lucky if the number of lucky digits in it is a lucky number. He wonders whether number *n* is a nearly lucky number.",
"input": "",
"output": "```python\ndef main():\r\n\r\n inp = input()\r\n\r\n IL = len(inp)\r\n\r\n if IL == 7 or IL == 4:\r\n print(\"YES\")\r\n\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n\r\nmain()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The array *a* with *n* integers is given. Let's call the sequence of one or more consecutive elements in *a* segment. Also let's call the segment k-good if it contains no more than *k* different values.\n\nFind any longest k-good segment.\n\nAs the input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java.",
"input": "",
"output": "```python\nfrom collections import Counter\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nc=Counter()\r\ncount=0\r\nans=[-1,-1]\r\nl=0\r\nfor r,el in enumerate(arr):\r\n c[el]+=1\r\n if c[el]==1:\r\n count+=1\r\n while count>k:\r\n c[arr[l]]-=1\r\n if c[arr[l]]==0:\r\n count-=1\r\n l+=1\r\n if r-l+1>=ans[-1]-ans[0]+1:\r\n ans=[l+1,r+1]\r\n \r\nprint(*ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Ann has recently started commuting by subway. We know that a one ride subway ticket costs *a* rubles. Besides, Ann found out that she can buy a special ticket for *m* rides (she can buy it several times). It costs *b* rubles. Ann did the math; she will need to use subway *n* times. Help Ann, tell her what is the minimum sum of money she will have to spend to make *n* rides?",
"input": "",
"output": "```python\nn, m, a, b = map(int,input().split())\r\nq=int(((n/m)//1))\r\np=n-(q*m)\r\nprint((q*b)+(p*a))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp thinks about the meaning of life very often. He does this constantly, even when typing in the editor. Every time he starts brooding he can no longer fully concentrate and repeatedly presses the keys that need to be pressed only once. For example, instead of the phrase \"how are you\" he can type \"hhoow aaaare yyoouu\". \n\nPolycarp decided to automate the process of correcting such errors. He decided to write a plug-in to the text editor that will remove pairs of identical consecutive letters (if there are any in the text). Of course, this is not exactly what Polycarp needs, but he's got to start from something! \n\nHelp Polycarp and write the main plug-in module. Your program should remove from a string all pairs of identical letters, which are consecutive. If after the removal there appear new pairs, the program should remove them as well. Technically, its work should be equivalent to the following: while the string contains a pair of consecutive identical letters, the pair should be deleted. Note that deleting of the consecutive identical letters can be done in any order, as any order leads to the same result.",
"input": "",
"output": "```python\n# Wadea #\r\n\r\nn = str(input())\r\nr = \"\"\r\nfor i in n:\r\n if n.count(i) > 1:\r\n pass\r\n else:\r\n r += i\r\nif len(r) == 0:\r\n print(n[0])\r\nelse:\r\n print(r)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya lives in a round building, whose entrances are numbered sequentially by integers from 1 to *n*. Entrance *n* and entrance 1 are adjacent.\n\nToday Vasya got bored and decided to take a walk in the yard. Vasya lives in entrance *a* and he decided that during his walk he will move around the house *b* entrances in the direction of increasing numbers (in this order entrance *n* should be followed by entrance 1). The negative value of *b* corresponds to moving |*b*| entrances in the order of decreasing numbers (in this order entrance 1 is followed by entrance *n*). If *b*<==<=0, then Vasya prefers to walk beside his entrance.\n\nHelp Vasya to determine the number of the entrance, near which he will be at the end of his walk.",
"input": "",
"output": "```python\nimport math\ndef solve(n,a,b):\n \n if b< 0:\n res=(n-(-1*b%n))+a\n else: \n res = b%n + a\n return res if res < n else res-n\n\ndef main() :\n arr = list(map(int, input().split(' ')))\n # arr = []\n # for _ in range(3):\n # arr.append(input())\n print(solve(*arr))\nmain()\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp is working on a new project called \"Polychat\". Following modern tendencies in IT, he decided, that this project should contain chat as well. To achieve this goal, Polycarp has spent several hours in front of his laptop and implemented a chat server that can process three types of commands:\n - Include a person to the chat ('Add' command). - Remove a person from the chat ('Remove' command). - Send a message from a person to all people, who are currently in the chat, including the one, who sends the message ('Send' command). \nNow Polycarp wants to find out the amount of outgoing traffic that the server will produce while processing a particular set of commands.\n\nPolycarp knows that chat server sends no traffic for 'Add' and 'Remove' commands. When 'Send' command is processed, server sends *l* bytes to each participant of the chat, where *l* is the length of the message.\n\nAs Polycarp has no time, he is asking for your help in solving this problem.",
"input": "",
"output": "```python\nimport sys\n\nserverTraffic = 0\nactiveUsers = 0\n\nfor line in sys.stdin:\n if line[0] == '+':\n activeUsers += 1\n elif line[0] == '-':\n activeUsers -= 1\n else:\n #serverTraffic += (activeUsers - 1) * (len(line) - line.find(':') - 1)\n serverTraffic += activeUsers * (len(line) - line.find(':') - 2)\n\nprint(serverTraffic)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Manao is trying to open a rather challenging lock. The lock has *n* buttons on it and to open it, you should press the buttons in a certain order to open the lock. When you push some button, it either stays pressed into the lock (that means that you've guessed correctly and pushed the button that goes next in the sequence), or all pressed buttons return to the initial position. When all buttons are pressed into the lock at once, the lock opens.\n\nConsider an example with three buttons. Let's say that the opening sequence is: {2, 3, 1}. If you first press buttons 1 or 3, the buttons unpress immediately. If you first press button 2, it stays pressed. If you press 1 after 2, all buttons unpress. If you press 3 after 2, buttons 3 and 2 stay pressed. As soon as you've got two pressed buttons, you only need to press button 1 to open the lock.\n\nManao doesn't know the opening sequence. But he is really smart and he is going to act in the optimal way. Calculate the number of times he's got to push a button in order to open the lock in the worst-case scenario.",
"input": "",
"output": "```python\na=int(input())\r\ncount=0\r\nj=1\r\narr=[]\r\nfor i in range(a-1):\r\n count=count+j\r\n j=j+1\r\n arr.append(count)\r\nprint(sum(arr)+a)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Misha and Vanya have played several table tennis sets. Each set consists of several serves, each serve is won by one of the players, he receives one point and the loser receives nothing. Once one of the players scores exactly *k* points, the score is reset and a new set begins.\n\nAcross all the sets Misha scored *a* points in total, and Vanya scored *b* points. Given this information, determine the maximum number of sets they could have played, or that the situation is impossible.\n\nNote that the game consisted of several complete sets.",
"input": "",
"output": "```python\nk,a,b=map(int,input().split())\r\nif (a%k==0 or b%k==0) and (a!=0 and b!=0):\r\n print(a//k+b//k)\r\nelse:\r\n print(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vitaly has an array of *n* distinct integers. Vitaly wants to divide this array into three non-empty sets so as the following conditions hold: \n 1. The product of all numbers in the first set is less than zero (<=<<=0). 1. The product of all numbers in the second set is greater than zero (<=><=0). 1. The product of all numbers in the third set is equal to zero. 1. Each number from the initial array must occur in exactly one set. \nHelp Vitaly. Divide the given array.",
"input": "",
"output": "```python\n# -*- coding: utf-8 -*-\n\nN = int(input())\na = []\nfor _ in range(N):\n _a = int(input())\n a.append(_a)\na.sort()\n\nprint('ce pula mea de runtime error iti trebuie')\n \t\t \t\t \t \t \t\t\t\t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "For a positive integer *n* let's define a function *f*:\n\n*f*(*n*)<==<=<=-<=1<=+<=2<=-<=3<=+<=..<=+<=(<=-<=1)*n**n* \n\nYour task is to calculate *f*(*n*) for a given integer *n*.",
"input": "",
"output": "```python\nn=int(input())\r\nc=0\r\nk=0\r\nfor i in range(n+1):\r\n if i>0:\r\n if i%2!=0:\r\n c-=i\r\n else:\r\n k+=i\r\n\r\nprint(c+k)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya's bicycle chain drive consists of two parts: *n* stars are attached to the pedal axle, *m* stars are attached to the rear wheel axle. The chain helps to rotate the rear wheel by transmitting the pedal rotation.\n\nWe know that the *i*-th star on the pedal axle has *a**i* (0<=<<=*a*1<=<<=*a*2<=<<=...<=<<=*a**n*) teeth, and the *j*-th star on the rear wheel axle has *b**j* (0<=<<=*b*1<=<<=*b*2<=<<=...<=<<=*b**m*) teeth. Any pair (*i*,<=*j*) (1<=≤<=*i*<=≤<=*n*; 1<=≤<=*j*<=≤<=*m*) is called a gear and sets the indexes of stars to which the chain is currently attached. Gear (*i*,<=*j*) has a gear ratio, equal to the value .\n\nSince Vasya likes integers, he wants to find such gears (*i*,<=*j*), that their ratios are integers. On the other hand, Vasya likes fast driving, so among all \"integer\" gears (*i*,<=*j*) he wants to choose a gear with the maximum ratio. Help him to find the number of such gears.\n\nIn the problem, fraction denotes division in real numbers, that is, no rounding is performed.",
"input": "",
"output": "```python\nn=int(input())\r\nlist1=list(map(int,input().split()))\r\nm=int(input())\r\nlist2=list(map(int,input().split()))\r\nmax1=0\r\nfor i in list2:\r\n for j in list1:\r\n if i%j==0 and (i//j)>max1:\r\n max1=(i//j)\r\nc=0 \r\nfor i in list2:\r\n for j in list1:\r\n if i%j==0 and i//j==max1:\r\n c=c+1\r\nprint(c) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A robber has attempted to rob a bank but failed to complete his task. However, he had managed to open all the safes.\n\nOleg the bank client loves money (who doesn't), and decides to take advantage of this failed robbery and steal some money from the safes. There are many safes arranged in a line, where the *i*-th safe from the left is called safe *i*. There are *n* banknotes left in all the safes in total. The *i*-th banknote is in safe *x**i*. Oleg is now at safe *a*. There are two security guards, one of which guards the safe *b* such that *b*<=<<=*a*, i.e. the first guard is to the left of Oleg. The other guard guards the safe *c* so that *c*<=><=*a*, i.e. he is to the right of Oleg.\n\nThe two guards are very lazy, so they do not move. In every second, Oleg can either take all the banknotes from the current safe or move to any of the neighboring safes. However, he cannot visit any safe that is guarded by security guards at any time, becaues he might be charged for stealing. Determine the maximum amount of banknotes Oleg can gather.",
"input": "",
"output": "```python\n######################################################\ndef convert_inp_to_int():\n return [int(x) for x in input().strip().split()]\n#######################################################\ndef get_position(flag,n,notes_at,pos):\n\tif(flag):\n\t\ti=0 \n\t\twhile(ipos):\n\t\t\t\treturn (i-1)\n\t\t\ti+=1\t\n\t\treturn (i-1)\n\telse:\n\t\ti=0 \n\t\twhile(i=pos):\n\t\t\t\treturn (i-1)\n\t\t\ti+=1\t\n\t\treturn (i-1)\t\t\n####################################################\nabc=convert_inp_to_int()\na=abc[0]\nb=abc[1]\nc=abc[2]\nn=convert_inp_to_int()[0]\nnotes_at=convert_inp_to_int()\nnotes_at.sort()\n#print(notes_at)\noleg_pos=get_position(0,n,notes_at,a) \ng1_pos=get_position(1,n,notes_at,b)\ng2_pos=get_position(0,n,notes_at,c)\ng1_pos+=1\nprint(oleg_pos,g1_pos,g2_pos)\nif(g1_pos k*b or n < k*a:\r\n print(\"No solution\")\r\n exit()\r\nr = n % k\r\ni, j = 0, n//k\r\nwhile i < n:\r\n if r:\r\n r -= 1\r\n print(s[i:i+j+1])\r\n i += j\r\n i += 1\r\n else:\r\n print(s[i:i+j+1])\r\n i += j\r\n i += 1\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A big company decided to launch a new series of rectangular displays, and decided that the display must have exactly *n* pixels. \n\nYour task is to determine the size of the rectangular display — the number of lines (rows) of pixels *a* and the number of columns of pixels *b*, so that:\n - there are exactly *n* pixels on the display; - the number of rows does not exceed the number of columns, it means *a*<=≤<=*b*; - the difference *b*<=-<=*a* is as small as possible.",
"input": "",
"output": "```python\nn = int(input())\r\na = 1\r\nans = 10**18\r\nwhile a*a <= n:\r\n if n%a == 0:\r\n b = n//a\r\n if b-a < ans:\r\n ans = b-a\r\n ans_a = a\r\n a+=1\r\nprint(ans_a, n//ans_a)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After a hard day Vitaly got very hungry and he wants to eat his favorite potato pie. But it's not that simple. Vitaly is in the first room of the house with *n* room located in a line and numbered starting from one from left to right. You can go from the first room to the second room, from the second room to the third room and so on — you can go from the (*n*<=-<=1)-th room to the *n*-th room. Thus, you can go to room *x* only from room *x*<=-<=1.\n\nThe potato pie is located in the *n*-th room and Vitaly needs to go there. \n\nEach pair of consecutive rooms has a door between them. In order to go to room *x* from room *x*<=-<=1, you need to open the door between the rooms with the corresponding key. \n\nIn total the house has several types of doors (represented by uppercase Latin letters) and several types of keys (represented by lowercase Latin letters). The key of type *t* can open the door of type *T* if and only if *t* and *T* are the same letter, written in different cases. For example, key f can open door F.\n\nEach of the first *n*<=-<=1 rooms contains exactly one key of some type that Vitaly can use to get to next rooms. Once the door is open with some key, Vitaly won't get the key from the keyhole but he will immediately run into the next room. In other words, each key can open no more than one door.\n\nVitaly realizes that he may end up in some room without the key that opens the door to the next room. Before the start his run for the potato pie Vitaly can buy any number of keys of any type that is guaranteed to get to room *n*.\n\nGiven the plan of the house, Vitaly wants to know what is the minimum number of keys he needs to buy to surely get to the room *n*, which has a delicious potato pie. Write a program that will help Vitaly find out this number.",
"input": "",
"output": "```python\nn = int(input())\n\nword = input()\nisKey = True\nkeys = []\nbuy = 0\n\nfor pos in range(len(word)):\n \n if(isKey):\n keys.append(word[pos].upper())\n isKey = False\n else:\n isKey = True\n if (word[pos] not in keys):\n buy += 1\n else:\n keys.remove(word[pos])\n\nprint(buy)\n \t \t \t \t \t\t \t\t \t\t \t \t\t \t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vanya walks late at night along a straight street of length *l*, lit by *n* lanterns. Consider the coordinate system with the beginning of the street corresponding to the point 0, and its end corresponding to the point *l*. Then the *i*-th lantern is at the point *a**i*. The lantern lights all points of the street that are at the distance of at most *d* from it, where *d* is some positive number, common for all lanterns. \n\nVanya wonders: what is the minimum light radius *d* should the lanterns have to light the whole street?",
"input": "",
"output": "```python\nl = input()\r\nl = l.split()\r\nl[0] = int(l[0])\r\nl[1] = int(l[1])\r\n\r\nl1 = input()\r\nl1 = l1.split()\r\nfor i in range(len(l1)):\r\n l1[i] = int(l1[i])\r\n\r\nl1.sort()\r\n\r\nd = float(\"inf\")\r\n\r\nfor j in range(len(l1)-1):\r\n d = min(d, abs(l1[i+1] - l1[i]))\r\n\r\nprint(d)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Two players play a game.\n\nInitially there are $n$ integers $a_1, a_2, \\ldots, a_n$ written on the board. Each turn a player selects one number and erases it from the board. This continues until there is only one number left on the board, i. e. $n - 1$ turns are made. The first player makes the first move, then players alternate turns.\n\nThe first player wants to minimize the last number that would be left on the board, while the second player wants to maximize it.\n\nYou want to know what number will be left on the board after $n - 1$ turns if both players make optimal moves.",
"input": "",
"output": "```python\nn = int(input())\ni = (n // 2) - (n % 2 == 0)\nprint(list(sorted(map(int, input().split())))[i])\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A triangular number is the number of dots in an equilateral triangle uniformly filled with dots. For example, three dots can be arranged in a triangle; thus three is a triangular number. The *n*-th triangular number is the number of dots in a triangle with *n* dots on a side. . You can learn more about these numbers from Wikipedia (http://en.wikipedia.org/wiki/Triangular_number).\n\nYour task is to find out if a given integer is a triangular number.",
"input": "",
"output": "```python\nsum = 0\r\ni = 0\r\nans = \"NO\"\r\nt = int(input())\r\nwhile sum <= t:\r\n i += 1\r\n sum += i\r\n if sum == t:\r\n ans = \"YES\"\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Quite recently, a very smart student named Jury decided that lectures are boring, so he downloaded a game called \"Black Square\" on his super cool touchscreen phone.\n\nIn this game, the phone's screen is divided into four vertical strips. Each second, a black square appears on some of the strips. According to the rules of the game, Jury must use this second to touch the corresponding strip to make the square go away. As Jury is both smart and lazy, he counted that he wastes exactly *a**i* calories on touching the *i*-th strip.\n\nYou've got a string *s*, describing the process of the game and numbers *a*1,<=*a*2,<=*a*3,<=*a*4. Calculate how many calories Jury needs to destroy all the squares?",
"input": "",
"output": "```python\n# SOLUTION 1\r\n# a,b,c,d = map(int,input().split())\r\n# s = input()\r\n# print(s.count(\"1\")*a+s.count(\"2\")*b+s.count(\"3\")*c+s.count(\"4\")*d)\r\n\r\n# SOLUTION 2\r\n# a,b,c,d = map(int,input().split())\r\n# sum = 0\r\n# for w in input():\r\n# if w == \"1\":\r\n# sum += a\r\n# elif w == \"2\":\r\n# sum += b\r\n# elif w == \"3\":\r\n# sum += c\r\n# else :\r\n# sum += d\r\n# print(sum)\r\n\r\n\r\n#SOLUTION 3\r\nl = list(map(int,input().split()))\r\nsum = 0\r\nfor w in input():\r\n sum += l[int(w)-1]\r\nprint(sum)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There exists an island called Arpa’s land, some beautiful girls live there, as ugly ones do.\n\nMehrdad wants to become minister of Arpa’s land. Arpa has prepared an exam. Exam has only one question, given *n*, print the last digit of 1378*n*. \n\nMehrdad has become quite confused and wants you to help him. Please help, although it's a naive cheat.",
"input": "",
"output": "```python\nn=int(input())\r\np=1\r\nfor i in range(n):\r\n p=p*1378\r\nplist=list(str(p))\r\nprint(plist[-1])\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Little Elephant very much loves sums on intervals.\n\nThis time he has a pair of integers *l* and *r* (*l*<=≤<=*r*). The Little Elephant has to find the number of such integers *x* (*l*<=≤<=*x*<=≤<=*r*), that the first digit of integer *x* equals the last one (in decimal notation). For example, such numbers as 101, 477474 or 9 will be included in the answer and 47, 253 or 1020 will not.\n\nHelp him and count the number of described numbers *x* for a given pair *l* and *r*.",
"input": "",
"output": "```python\narr=list(map(int,input().split()))\r\nans=0\r\nfor i in range(arr[0],arr[1]+1):\r\n if(i%10==i//(10**math.log10(i)):\r\n ans+=1\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Little Elephant loves Ukraine very much. Most of all he loves town Rozdol (ukr. \"Rozdil\").\n\nHowever, Rozdil is dangerous to settle, so the Little Elephant wants to go to some other town. The Little Elephant doesn't like to spend much time on travelling, so for his journey he will choose a town that needs minimum time to travel to. If there are multiple such cities, then the Little Elephant won't go anywhere.\n\nFor each town except for Rozdil you know the time needed to travel to this town. Find the town the Little Elephant will go to or print \"Still Rozdil\", if he stays in Rozdil.",
"input": "",
"output": "```python\nn = int(input())\r\nl = list(map(int, input().split()))\r\nl1 = l.copy()\r\nl1.sort()\r\nif l1[0]==l1[1]:\r\n print(\"Still Rozdil\")\r\nelse:\r\n mini = l1[0]\r\n index = 0\r\n for i in range(len(l)):\r\n if l[i] == mini:\r\n index = i\r\n break\r\n print(index+1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are at a water bowling training. There are *l* people who play with their left hand, *r* people, who play with their right hand, and *a* ambidexters, who can play with left or right hand.\n\nThe coach decided to form a team of even number of players, exactly half of the players should play with their right hand, and exactly half of the players should play with their left hand. One player should use only on of his hands.\n\nAmbidexters play as well with their right hand as with their left hand. In the team, an ambidexter can play with their left hand, or with their right hand.\n\nPlease find the maximum possible size of the team, where equal number of players use their left and right hands, respectively.",
"input": "",
"output": "```python\nfrom math import *\r\na,b,c=map(int,input().split())\r\np=min(a,b)\r\nk=max(a,b)\r\ns=k-p\r\nif s>=c:\r\n ans=2*(p+c)\r\nelse:\r\n ans=2*(k+(c-s)//2)\r\nprint(ans)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given string *s*. Your task is to determine if the given string *s* contains two non-overlapping substrings \"AB\" and \"BA\" (the substrings can go in any order).",
"input": "",
"output": "```python\ns = input()\r\nyes = False\r\nleftMostAB = -1\r\nleftMostBA = -1\r\nrightMostAB = -1\r\nrightMostBA = -1\r\nfor i in range(len(s)-1):\r\n if s[i:i+2] == \"AB\":\r\n leftMostAB = i\r\n if s[i:i+2] == \"BA\":\r\n leftMostBA = i\r\n\r\nfor i in range(len(s)-2,-1,-1):\r\n if s[i:i+2] == \"AB\":\r\n rightMostAB = i\r\n if s[i:i+2] == \"BA\":\r\n rightMostBA = i\r\nif leftMostAB+1 < rightMostBA or leftMostBA+1 < rightMostAB:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There is a fence in front of Polycarpus's home. The fence consists of *n* planks of the same width which go one after another from left to right. The height of the *i*-th plank is *h**i* meters, distinct planks can have distinct heights.\n\nPolycarpus has bought a posh piano and is thinking about how to get it into the house. In order to carry out his plan, he needs to take exactly *k* consecutive planks from the fence. Higher planks are harder to tear off the fence, so Polycarpus wants to find such *k* consecutive planks that the sum of their heights is minimal possible.\n\nWrite the program that finds the indexes of *k* consecutive planks with minimal total height. Pay attention, the fence is not around Polycarpus's home, it is in front of home (in other words, the fence isn't cyclic).",
"input": "",
"output": "```python\nn, k = [int(i) for i in input().split()]\r\nh = [int(i) for i in input().split()]\r\nsum_min = sum(h)\r\nj = 0\r\nfor curr_j in range(n-k):\r\n print(curr_j)\r\n if sum(h[curr_j:curr_j+k]) < sum_min:\r\n sum_min = sum(h[curr_j:curr_j+k])\r\n j = curr_j\r\nprint(j+1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "It's the year 4527 and the tanks game that we all know and love still exists. There also exists Great Gena's code, written in 2016. The problem this code solves is: given the number of tanks that go into the battle from each country, find their product. If it is turns to be too large, then the servers might have not enough time to assign tanks into teams and the whole game will collapse!\n\nThere are exactly *n* distinct countries in the world and the *i*-th country added *a**i* tanks to the game. As the developers of the game are perfectionists, the number of tanks from each country is beautiful. A beautiful number, according to the developers, is such number that its decimal representation consists only of digits '1' and '0', moreover it contains at most one digit '1'. However, due to complaints from players, some number of tanks of one country was removed from the game, hence the number of tanks of this country may not remain beautiful.\n\nYour task is to write the program that solves exactly the same problem in order to verify Gena's code correctness. Just in case.",
"input": "",
"output": "```python\nn = int(input())\r\nl = input().split(\" \")\r\nans = 1\r\nfor i in l:\r\n ans = ans * int(i)\r\n\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a sequence *a* consisting of *n* integers. You may partition this sequence into two sequences *b* and *c* in such a way that every element belongs exactly to one of these sequences. \n\nLet *B* be the sum of elements belonging to *b*, and *C* be the sum of elements belonging to *c* (if some of these sequences is empty, then its sum is 0). What is the maximum possible value of *B*<=-<=*C*?",
"input": "",
"output": "```python\n#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=0;c=0\r\nfor i in range(n):\r\n if a[i]<0:c-=a[i]\r\n else:\r\n b+=a[i]\r\nprint(b-c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "High school student Vasya got a string of length *n* as a birthday present. This string consists of letters 'a' and 'b' only. Vasya denotes beauty of the string as the maximum length of a substring (consecutive subsequence) consisting of equal letters.\n\nVasya can change no more than *k* characters of the original string. What is the maximum beauty of the string he can achieve?",
"input": "",
"output": "```python\nA. Vasya and String\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Let's define a forest as a non-directed acyclic graph (also without loops and parallel edges). One day Misha played with the forest consisting of *n* vertices. For each vertex *v* from 0 to *n*<=-<=1 he wrote down two integers, *degree**v* and *s**v*, were the first integer is the number of vertices adjacent to vertex *v*, and the second integer is the XOR sum of the numbers of vertices adjacent to *v* (if there were no adjacent vertices, he wrote down 0). \n\nNext day Misha couldn't remember what graph he initially had. Misha has values *degree**v* and *s**v* left, though. Help him find the number of edges and the edges of the initial graph. It is guaranteed that there exists a forest that corresponds to the numbers written by Misha.",
"input": "",
"output": "```python\nfrom collections import deque\r\nn = int(input())\r\nprocess = deque()\r\nvs = []\r\nfor i in range(n):\r\n d, s = map(int, input().split())\r\n if d == 1:\r\n process.append(i)\r\n vs.append((d, s))\r\nedges = []\r\nwhile process:\r\n a = process.popleft()\r\n d, s = vs[a]\r\n if d == 0:\r\n continue\r\n dd, ss = vs[s]\r\n vs[s] = (dd - 1, ss ^ a)\r\n if dd == 2:\r\n process.append(s)\r\n edges.append((a, s))\r\nprint(len(edges))\r\nfor a, b in edges:\r\n print(a,b)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Andrewid the Android is a galaxy-famous detective. In his free time he likes to think about strings containing zeros and ones.\n\nOnce he thought about a string of length *n* consisting of zeroes and ones. Consider the following operation: we choose any two adjacent positions in the string, and if one them contains 0, and the other contains 1, then we are allowed to remove these two digits from the string, obtaining a string of length *n*<=-<=2 as a result.\n\nNow Andreid thinks about what is the minimum length of the string that can remain after applying the described operation several times (possibly, zero)? Help him to calculate this number.",
"input": "",
"output": "```python\nimport re\r\n\r\nn = int(input())\r\nstring = input()\r\nis_match = re.findall(r'01|10', string)\r\nmatcheo = string\r\nwhile is_match:\r\n matcheo = re.sub(r'01|10', '', matcheo)\r\n is_match = re.findall(r'01|10', matcheo)\r\n\r\nprint(0) if not matcheo else print(len(matcheo))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya has *n* pairs of socks. In the morning of each day Vasya has to put on a pair of socks before he goes to school. When he comes home in the evening, Vasya takes off the used socks and throws them away. Every *m*-th day (at days with numbers *m*,<=2*m*,<=3*m*,<=...) mom buys a pair of socks to Vasya. She does it late in the evening, so that Vasya cannot put on a new pair of socks before the next day. How many consecutive days pass until Vasya runs out of socks?",
"input": "",
"output": "```python\na, b = map(int,input().split())\r\nc = 0\r\nd = a\r\n\r\nfor i in range(0, a):\r\n if i % b == 0:\r\n a = a + 1\r\nprint(int(d + a//b))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "So, the Berland is at war with its eternal enemy Flatland again, and Vasya, an accountant, was assigned to fulfil his duty to the nation. \n\nRight now the situation in Berland is dismal — their both cities are surrounded! The armies of flatlanders stand on the borders of circles, the circles' centers are in the surrounded cities. At any moment all points of the flatland ring can begin to move quickly in the direction of the city — that's the strategy the flatlanders usually follow when they besiege cities.\n\nThe berlanders are sure that they can repel the enemy's attack if they learn the exact time the attack starts. For that they need to construct a radar that would register any movement at the distance of at most *r* from it. Thus, we can install a radar at such point, that at least one point of the enemy ring will be in its detecting range (that is, at a distance of at most *r*). Then the radar can immediately inform about the enemy's attack. \n\nDue to the newest technologies, we can place a radar at any point without any problems. But the problem is that the berlanders have the time to make only one radar. Besides, the larger the detection radius (*r*) is, the more the radar costs.\n\nThat's why Vasya's task (that is, your task) is to find the minimum possible detection radius for the radar. In other words, your task is to find the minimum radius *r* (*r*<=≥<=0) such, that a radar with radius *r* can be installed at some point and it can register the start of the movements of both flatland rings from that point. \n\nIn this problem you can consider the cities as material points, the attacking enemy rings - as circles with centers in the cities, the radar's detection range — as a disk (including the border) with the center at the point where the radar is placed.",
"input": "",
"output": "```python\nimport math\r\n\r\n\r\nclass Point:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n\r\n def __sub__(self, other):\r\n return Point(self.x - other.x, self.y - other.y)\r\n\r\n def distance(self, other):\r\n dx = abs(self.x - other.x)\r\n dy = abs(self.y - other.y)\r\n return math.hypot(dx, dy)\r\n\r\n\r\ndef float_eq(a, b):\r\n return abs(a - b) < 1e-9\r\n\r\n\r\ndef main():\r\n ax, ay, ar = map(int, input().split())\r\n bx, by, br = map(int, input().split())\r\n point_a = Point(ax, ay)\r\n point_b = Point(bx, by)\r\n\r\n p_dist = point_a.distance(point_b)\r\n r_sum = ar + br\r\n\r\n if float_eq(p_dist, r_sum):\r\n return print(0)\r\n if p_dist > r_sum:\r\n return print((p_dist - r_sum) / 2)\r\n if p_dist > ar:\r\n return print(0)\r\n print(abs(ar - br) / 2)\r\n\r\n\r\nmain()\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Vasya decided to have a look at the results of Berland 1910 Football Championship’s finals. Unfortunately he didn't find the overall score of the match; however, he got hold of a profound description of the match's process. On the whole there are *n* lines in that description each of which described one goal. Every goal was marked with the name of the team that had scored it. Help Vasya, learn the name of the team that won the finals. It is guaranteed that the match did not end in a tie.",
"input": "",
"output": "```python\nt=int(input())\r\nd=[]\r\nfor i in range(t):\r\n n=input()\r\n d.append(n)\r\n k=d[0]\r\n for i in range(len(d)):\r\n if(d.count(d[i])>d.count(k)):\r\n k=i \r\nprint(k)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.",
"input": "",
"output": "```python\nstr = input()\nlower, upper = 0, 0\nfor i in range(len(str)):\n if (str[i].isupper()): \n upper += 1\n else:\n lower += 1\n\nif (lower < upper):\n print(str.upper())\nelse:\n print(str.lower())\n\t \t \t\t \t\t\t\t\t\t\t\t \t\t\t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One industrial factory is reforming working plan. The director suggested to set a mythical detail production norm. If at the beginning of the day there were *x* details in the factory storage, then by the end of the day the factory has to produce (remainder after dividing *x* by *m*) more details. Unfortunately, no customer has ever bought any mythical detail, so all the details produced stay on the factory. \n\nThe board of directors are worried that the production by the given plan may eventually stop (that means that there will be а moment when the current number of details on the factory is divisible by *m*). \n\nGiven the number of details *a* on the first day and number *m* check if the production stops at some moment.",
"input": "",
"output": "```python\na,m = map(int,input().split())\r\ns = set()\r\nflag = 0\r\nwhile 1:\r\n if a>m:\r\n a %= m\r\n if a in s:\r\n break\r\n s.add(a)\r\n a *= 2\r\n if a==m:\r\n flag = 1\r\n break\r\nif flag:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two positive integer numbers *a* and *b*. Permute (change order) of the digits of *a* to construct maximal number not exceeding *b*. No number in input and/or output can start with the digit 0.\n\nIt is allowed to leave *a* as it is.",
"input": "",
"output": "```python\na=input()\nb=input()\nna=len(a)\nnb=len(b)\nif(nal[j]:\n\t\t\t\tans1+=l[j]\n\t\t\t\tl.pop(j)\n\t\t\t\tflag=1\n\t\t\t\tbreak\n\t\tif(flag==1):\n\t\t\tbreak\n\tans1+=\"\".join(l)\n\tflag=0\n\tfor i in b:\n\t\tfor j in range(len(l2)):\n\t\t\tif i>l2[j]:\n\t\t\t\tans2+=l2[j]\n\t\t\t\tl2.pop(j)\n\t\t\t\tflag=1\n\t\t\t\tbreak\n\t\tif(flag==1):\n\t\t\tbreak\n\tans2+=\"\".join(l2)\n\tif(int(ans1)<=int(b)):\n\t\tprint(ans1)\n\telse:\n\t\tprint(ans2)\n \t\t\t \t\t\t \t\t \t \t\t\t\t\t \t\t\t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Tonio has a keyboard with only two letters, \"V\" and \"K\".\n\nOne day, he has typed out a string *s* with only these two letters. He really likes it when the string \"VK\" appears, so he wishes to change at most one letter in the string (or do no changes) to maximize the number of occurrences of that string. Compute the maximum number of times \"VK\" can appear as a substring (i. e. a letter \"K\" right after a letter \"V\") in the resulting string.",
"input": "",
"output": "```python\nimport sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\ns=input()\r\nn=len(s)-1\r\nc=s.count('VK')\r\nfor i in range(n):\r\n if(s[i]=='V'):\r\n s1=s[:i]+'K'+s[i+1:]\r\n else:\r\n s1=s[:i]+'V'+s[i+1:]\r\n c=max(c,s1.count('VK'))\r\nprint(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day the Codeforces round author sat exams. He had *n* exams and he needed to get an integer from 2 to 5 for each exam. He will have to re-sit each failed exam, i.e. the exam that gets mark 2. \n\nThe author would need to spend too much time and effort to make the sum of his marks strictly more than *k*. That could have spoilt the Codeforces round. On the other hand, if the sum of his marks is strictly less than *k*, the author's mum won't be pleased at all. \n\nThe Codeforces authors are very smart and they always get the mark they choose themselves. Also, the Codeforces authors just hate re-sitting exams. \n\nHelp the author and find the minimum number of exams he will have to re-sit if he passes the exams in the way that makes the sum of marks for all *n* exams equal exactly *k*.",
"input": "",
"output": "```python\nl=list(input())\r\ncount=0\r\nans=0\r\nfor i in range(len(l)):\r\n if count==0:\r\n count+=1\r\n print(ans,1)\r\n if 0< count<5 and l[i]==l[i-1]:\r\n count+=1\r\n print(ans,2)\r\n if 0< count<5 and l[i]!=l[i-1]:\r\n ans+=1\r\n count=1\r\n print(ans,3)\r\n if count==5:\r\n ans+=1\r\n count=1\r\n print(ans,4)\r\nprint(ans+1) \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "The Little Elephant loves chess very much. \n\nOne day the Little Elephant and his friend decided to play chess. They've got the chess pieces but the board is a problem. They've got an 8<=×<=8 checkered board, each square is painted either black or white. The Little Elephant and his friend know that a proper chessboard doesn't have any side-adjacent cells with the same color and the upper left cell is white. To play chess, they want to make the board they have a proper chessboard. For that the friends can choose any row of the board and cyclically shift the cells of the chosen row, that is, put the last (rightmost) square on the first place in the row and shift the others one position to the right. You can run the described operation multiple times (or not run it at all).\n\nFor example, if the first line of the board looks like that \"BBBBBBWW\" (the white cells of the line are marked with character \"W\", the black cells are marked with character \"B\"), then after one cyclic shift it will look like that \"WBBBBBBW\".\n\nHelp the Little Elephant and his friend to find out whether they can use any number of the described operations to turn the board they have into a proper chessboard.",
"input": "",
"output": "```python\nbad = False\nfor i in range(8):\n row = input().strip()\n if row not in ('WBWBWBWB', 'BWBWBWBW'):\n bad = True\n\nif bad:\n print('NO')\nelse:\n print('YES')\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and featured five problems with maximum point values of 500, 1000, 1500, 2000, and 2500, respectively. Despite the challenging tasks, Kevin was uncowed and bulldozed through all of them, distinguishing himself from the herd as the best cowmputer scientist in all of Bovinia. Kevin knows his submission time for each problem, the number of wrong submissions that he made on each problem, and his total numbers of successful and unsuccessful hacks. Because Codeforces scoring is complicated, Kevin wants you to write a program to compute his final score.\n\nCodeforces scores are computed as follows: If the maximum point value of a problem is *x*, and Kevin submitted correctly at minute *m* but made *w* wrong submissions, then his score on that problem is . His total score is equal to the sum of his scores for each problem. In addition, Kevin's total score gets increased by 100 points for each successful hack, but gets decreased by 50 points for each unsuccessful hack.\n\nAll arithmetic operations are performed with absolute precision and no rounding. It is guaranteed that Kevin's final score is an integer.",
"input": "",
"output": "```python\nm = [int(i) for i in input().split(\" \")]\r\nw = [int(i) for i in input().split(\" \")]\r\nhs, hu = [int(i) for i in input().split(\" \")]\r\nscore = 0\r\nfor i in range(5):\r\n score += max(0.3 * 500 * (i+1), (1 - m[i]/250) * (500 * (i+1)) - 50 * w[i])\r\nscore += 100 * hs\r\nscore -= 50 * hu\r\nprint(int(score))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.\n\nIn the given sequence moving up is described by character U and moving right is described by character R. Mikhail can replace any pair of consecutive moves RU or UR with a diagonal move (described as character D). After that, he can go on and do some other replacements, until there is no pair of consecutive moves RU or UR left.\n\nYour problem is to print the minimum possible length of the sequence of moves after the replacements.",
"input": "",
"output": "```python\nn = input()\r\ns= len(n)\r\nj =n.count('RU' and 'UR')\r\nprint((s-(j*2))+j-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a tetrahedron. Let's mark its vertices with letters *A*, *B*, *C* and *D* correspondingly.\n\nAn ant is standing in the vertex *D* of the tetrahedron. The ant is quite active and he wouldn't stay idle. At each moment of time he makes a step from one vertex to another one along some edge of the tetrahedron. The ant just can't stand on one place.\n\nYou do not have to do much to solve the problem: your task is to count the number of ways in which the ant can go from the initial vertex *D* to itself in exactly *n* steps. In other words, you are asked to find out the number of different cyclic paths with the length of *n* from vertex *D* to itself. As the number can be quite large, you should print it modulo 1000000007 (109<=+<=7).",
"input": "",
"output": "```python\nn=int(input())\r\nm=1000000007\r\nf=0\r\ng=1\r\nfor i in range(1,n):\r\n t=f+0\r\n f=(3*g)%m\r\n g=(2*g+t)%m\r\nprint(f)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "An *n*<=×<=*n* table *a* is defined as follows:\n - The first row and the first column contain ones, that is: *a**i*,<=1<==<=*a*1,<=*i*<==<=1 for all *i*<==<=1,<=2,<=...,<=*n*. - Each of the remaining numbers in the table is equal to the sum of the number above it and the number to the left of it. In other words, the remaining elements are defined by the formula *a**i*,<=*j*<==<=*a**i*<=-<=1,<=*j*<=+<=*a**i*,<=*j*<=-<=1. \nThese conditions define all the values in the table.\n\nYou are given a number *n*. You need to determine the maximum value in the *n*<=×<=*n* table defined by the rules above.",
"input": "",
"output": "```python\nn=int(input())\r\narr=[1,5,15,35,70,126,210,230,395]\r\nprint(arr[n-1])\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "After finishing eating her bun, Alyona came up with two integers *n* and *m*. She decided to write down two columns of integers — the first column containing integers from 1 to *n* and the second containing integers from 1 to *m*. Now the girl wants to count how many pairs of integers she can choose, one from the first column and the other from the second column, such that their sum is divisible by 5.\n\nFormally, Alyona wants to count the number of pairs of integers (*x*,<=*y*) such that 1<=≤<=*x*<=≤<=*n*, 1<=≤<=*y*<=≤<=*m* and equals 0.\n\nAs usual, Alyona has some troubles and asks you to help.",
"input": "",
"output": "```python\nimport sys\n\nn, m = map(int, sys.stdin.readline().split())\nres = (n // 5) * (m // 5) * 5\nres += (n // 5) * (m % 5)\nres += (m // 5) * (n % 5)\nfor i in range(1, (n % 5) + 1):\n for j in range(1, (m % 5) + 1):\n if (i + j) % 5 == 0:\n res += 1\nprint(res)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given $n$ strings. Each string consists of lowercase English letters. Rearrange (reorder) the given strings in such a way that for every string, all strings that are placed before it are its substrings.\n\nString $a$ is a substring of string $b$ if it is possible to choose several consecutive letters in $b$ in such a way that they form $a$. For example, string \"for\" is contained as a substring in strings \"codeforces\", \"for\" and \"therefore\", but is not contained as a substring in strings \"four\", \"fofo\" and \"rof\".",
"input": "",
"output": "```python\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ng = sorted([input()[:-1] for _ in range(int(input()))], key=len)\r\n\r\nfor i in g[:-1]:\r\n if i not in g[-1]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n for i in g:\r\n print(i)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You're given a string of lower-case Latin letters. Your task is to find the length of its longest substring that can be met in the string at least twice. These occurrences can overlap (see sample test 2).",
"input": "",
"output": "```python\ns = input()\r\n\r\nmc = -1\r\n\r\nfor i in range(len(s)):\r\n\tfor j in range(i+1, len(s)):\r\n\t\tcu = 0\r\n\t\tfor cu in range(len(s)-max(i, j)):\r\n\t\t\tif s[i+cu] == s[j+cu]:\r\n\t\t\t\tmc = max(mc, cu)\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\t\r\n\r\nprint(mc + 1)\r\n\t\t\t\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Pasha has a wooden stick of some positive integer length *n*. He wants to perform exactly three cuts to get four parts of the stick. Each part must have some positive integer length and the sum of these lengths will obviously be *n*. \n\nPasha likes rectangles but hates squares, so he wonders, how many ways are there to split a stick into four parts so that it's possible to form a rectangle using these parts, but is impossible to form a square.\n\nYour task is to help Pasha and count the number of such ways. Two ways to cut the stick are considered distinct if there exists some integer *x*, such that the number of parts of length *x* in the first way differ from the number of parts of length *x* in the second way.",
"input": "",
"output": "```python\nn=int(input())\r\nans=0\r\nfor i in range(1,n//2+1):\r\n i1=i\r\n i2=n//2-i\r\n if(i1>1)\r\nprint(mn if mn < 99**99 else~ 0)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "*n* participants of the competition were split into *m* teams in some manner so that each team has at least one participant. After the competition each pair of participants from the same team became friends.\n\nYour task is to write a program that will find the minimum and the maximum number of pairs of friends that could have formed by the end of the competition.",
"input": "",
"output": "```python\nfrom math import comb\r\n\r\na,b = list(map(int,input().split()))\r\n\r\nif b == 1:\r\n print((comb(a,2)),comb(a,2))\r\nelse:\r\n m = a-b+1\r\n if m%2:\r\n mx = comb(m-1,2) + 1\r\n else:\r\n mx = comb(m,2)\r\n \r\n p = a//b\r\n q = a%b\r\n \r\n mn = (b-q)*comb(p,2) + q*(comb(p+1,2))\r\n \r\n print(mn,mx)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "*n* participants of the competition were split into *m* teams in some manner so that each team has at least one participant. After the competition each pair of participants from the same team became friends.\n\nYour task is to write a program that will find the minimum and the maximum number of pairs of friends that could have formed by the end of the competition.",
"input": "",
"output": "```python\nimport math\n\nn, m = map(int, input().split())\nteams = [0] * m\n\nf = n // m\n\nfor i in range(m):\n teams[i] += f\n\nif n % m > 0:\n teams[0] += 1\n\nansMin = 0\nfor i in teams:\n ansMin += math.comb(i, 2)\n\nansMax = math.comb(n-(m-1), 2)\n\nprint(ansMin, ansMax)\n\t \t \t\t \t \t \t \t \t\t\t \t \t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a rectangular board of *M*<=×<=*N* squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.",
"input": "",
"output": "```python\nboard = input().split(\" \")\r\nm = int(board[0])\r\nn = int(board[1])\r\narea = m * n\r\n\r\nprint(area // 2)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Professor Dumbledore is helping Harry destroy the Horcruxes. He went to Gaunt Shack as he suspected a Horcrux to be present there. He saw Marvolo Gaunt's Ring and identified it as a Horcrux. Although he destroyed it, he is still affected by its curse. Professor Snape is helping Dumbledore remove the curse. For this, he wants to give Dumbledore exactly *x* drops of the potion he made. \n\nValue of *x* is calculated as maximum of *p*·*a**i*<=+<=*q*·*a**j*<=+<=*r*·*a**k* for given *p*,<=*q*,<=*r* and array *a*1,<=*a*2,<=... *a**n* such that 1<=≤<=*i*<=≤<=*j*<=≤<=*k*<=≤<=*n*. Help Snape find the value of *x*. Do note that the value of *x* may be negative.",
"input": "",
"output": "```python\nn,p,q,r=map(int,input().split())\r\narr=list(map(int,input().strip().split()))\r\npi,qj,rk= -1000000001,-1000000001,-1000000001\r\nfor i in range(n):\r\n x=arr[i]\r\n pi=max(pi,x*p)\r\n qj=max(qj,x*q)\r\n rk=max(rk,x*r)\r\nprint(pi+qj+rk)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Luba thinks about watering her garden. The garden can be represented as a segment of length *k*. Luba has got *n* buckets, the *i*-th bucket allows her to water some continuous subsegment of garden of length exactly *a**i* each hour. Luba can't water any parts of the garden that were already watered, also she can't water the ground outside the garden.\n\nLuba has to choose one of the buckets in order to water the garden as fast as possible (as mentioned above, each hour she will water some continuous subsegment of length *a**i* if she chooses the *i*-th bucket). Help her to determine the minimum number of hours she has to spend watering the garden. It is guaranteed that Luba can always choose a bucket so it is possible water the garden.\n\nSee the examples for better understanding.",
"input": "",
"output": "```python\ns = list(map(int,input().split()))\r\nlist_of_lengths = list(map(int,input().split()))\r\na = []\r\nfor j in list_of_lengths:\r\n if(s[1]%j ==0):\r\n a.append(int(s[1]//j));\r\nprint(min(a))\r\n \r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Santa Claus decided to disassemble his keyboard to clean it. After he returned all the keys back, he suddenly realized that some pairs of keys took each other's place! That is, Santa suspects that each key is either on its place, or on the place of another key, which is located exactly where the first key should be. \n\nIn order to make sure that he's right and restore the correct order of keys, Santa typed his favorite patter looking only to his keyboard.\n\nYou are given the Santa's favorite patter and the string he actually typed. Determine which pairs of keys could be mixed. Each key must occur in pairs at most once.",
"input": "",
"output": "```python\nimport sys\r\nread = lambda: sys.stdin.readline().strip()\r\nreadi = lambda: map(int, read().split())\r\nfrom collections import *\r\n\r\noriginal = read()\r\noutput = read()\r\n\r\nmapping = dict()\r\nfor i in range(len(original)):\r\n key = original[i]\r\n val = output[i]\r\n\r\n if key in mapping:\r\n if mapping[key] != val:\r\n print(-1)\r\n break\r\n if val in mapping:\r\n if mapping[val] != key:\r\n print(-1)\r\n break\r\n\r\n if key != val:\r\n mapping[key] = val\r\n mapping[val] = key\r\nelse:\r\n n = len(mapping)//2\r\n print(n)\r\n keys = list(mapping.keys())\r\n for key in keys:\r\n if key in mapping:\r\n print(key, mapping[key])\r\n mapping.pop(mapping[key])\r\n mapping.pop(key)\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Allen has a LOT of money. He has $n$ dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are $1$, $5$, $10$, $20$, $100$. What is the minimum number of bills Allen could receive after withdrawing his entire balance?",
"input": "",
"output": "```python\nn = int(input())\r\ncount = n // 100 + (n % 100) // 20 + (n % 20) // 10 + (n % 10) // 5 + (n % 5)\r\nprint(count)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sergey is testing a next-generation processor. Instead of bytes the processor works with memory cells consisting of *n* bits. These bits are numbered from 1 to *n*. An integer is stored in the cell in the following way: the least significant bit is stored in the first bit of the cell, the next significant bit is stored in the second bit, and so on; the most significant bit is stored in the *n*-th bit.\n\nNow Sergey wants to test the following instruction: \"add 1 to the value of the cell\". As a result of the instruction, the integer that is written in the cell must be increased by one; if some of the most significant bits of the resulting number do not fit into the cell, they must be discarded.\n\nSergey wrote certain values of the bits in the cell and is going to add one to its value. How many bits of the cell will change after the operation?",
"input": "",
"output": "```python\nn = int(input())\nbits = input()\n\ncounter = 1\ni = 0\nwhile i < n-1 and bits[i] == '1':\n counter += 1\n i += 1\n\nprint(counter)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.\n\nA tree is a connected acyclic graph. A bipartite graph is a graph, whose vertices can be partitioned into 2 sets in such a way, that for each edge (*u*,<=*v*) that belongs to the graph, *u* and *v* belong to different sets. You can find more formal definitions of a tree and a bipartite graph in the notes section below.\n\nDr. Evil gave Mahmoud and Ehab a tree consisting of *n* nodes and asked them to add edges to it in such a way, that the graph is still bipartite. Besides, after adding these edges the graph should be simple (doesn't contain loops or multiple edges). What is the maximum number of edges they can add?\n\nA loop is an edge, which connects a node with itself. Graph doesn't contain multiple edges when for each pair of nodes there is no more than one edge between them. A cycle and a loop aren't the same .",
"input": "",
"output": "```python\nimport bisect\nimport math\nfrom collections import deque\nimport heapq\nimport functools\nfrom queue import Queue\n\nmod = 998244353 \nN = 200005\n\ndef mul(a, b):\n\treturn (a*b)%mod\n\ndef add(a, b):\n\treturn (a+b) if (a+b=0) else (a-b)+mod\n\ndef powr(a, b):\n\tans = 1\n\twhile b>0:\n\t\tif b & 1:\n\t\t\tans=mul(ans,a)\n\t\ta = mul(a,a) \n\t\tb//=2\n\treturn ans\n\ndef inv(n):\n\treturn powr(n, mod-2)\n\ndef factlist():\n\tfact = [1]\n\tfor i in range(1, N):\n\t\tfact.append(mul(fact[i-1],i))\n\treturn fact\n\ndef invfactlist(fact):\n\tinvfact=[0]*N\n\tinvfact[0]=1\n\tinvfact[N-1]= inv(fact[N-1])\n\tfor i in range(N-2, 0, -1):\n\t\tinvfact[i]= mul(invfact[i+1],(i+1))\n\t\n\treturn invfact\n\ndef rot(S):\n\treturn list(zip(*S[::-1]))\n\ndef gcd(a, b):\n\tif b==0:\n\t\treturn a\n\treturn gcd(b, a%b)\n\ndef generate():\n\tans = [0]\n\twhile ans[-1]<1000000000:\n\t\tans.append(1+ans[-1]*2)\n\treturn ans\n\n\n\ndef main():\n\tn=int(input())\n\tg=[[]*n for _ in range(n)]\n\tfor i in range(n-1):\n\t u,v=map(int,input().split())\n\t g[u-1].append(v-1)\n\t g[v-1].append(u-1)\n\tqueue=Queue()\n\td=[-1]*n\n\tfor i in range(n):\n\t if(d[i]==-1):\n\t d[i]=0\n\t queue.put(i)\n\t while(not queue.empty()):\n\t u=queue.get()\n\t for v in g[u]:\n\t if(d[v]==-1):\n\t d[v]=1-d[u]\n\t queue.put(v)\n\tl=d.count(0)\n\tr=n-l\n\tprint(l*r-(n-1))\n\n\nif __name__ == \"__main__\":\n main()\n \n\t\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.\n\nOne day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.\n\nIn his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The *i*-th digit of the answer is 1 if and only if the *i*-th digit of the two given numbers differ. In the other case the *i*-th digit of the answer is 0.\n\nShapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.\n\nNow you are going to take part in Shapur's contest. See if you are faster and more accurate.",
"input": "",
"output": "```python\n# cook your dish here\r\nn=input()\r\ns=input()\r\nres = ''\r\nfor i in range(len(n)):\r\n res += str(int(s[i])^int(n[i]))\r\nprint(res)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Vanya got bored and he painted *n* distinct points on the plane. After that he connected all the points pairwise and saw that as a result many triangles were formed with vertices in the painted points. He asks you to count the number of the formed triangles with the non-zero area.",
"input": "",
"output": "```python\nimport itertools\r\n\r\nn = int(input())\r\nif n < 3:\r\n print(0)\r\n exit(0)\r\npos = [list(tuple(map(int,input().split())))for _ in range(n)]\r\nmax = 0\r\nfor ss in itertools.combinations(pos, 3):\r\n area = ss[0][0]*(ss[1][1]-ss[2][1]) + ss[1][0]*(ss[2][1]-ss[0][1]) + ss[2][0]*(ss[0][1]-ss[1][1])\r\n if area == 1:\r\n max = max + 1\r\nprint(max)\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.",
"input": "",
"output": "```python\n#刘乐天 2300012105 生命科学学院\r\ni=int(input())\r\nfor i in range(0,i):\r\n a=input()\r\n b=len(a)-2\r\n if b>8:\r\n print(a[0]+str(b)+a[-1])\r\n else:\r\n print(a)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "It's New Year's Eve soon, so Ivan decided it's high time he started setting the table. Ivan has bought two cakes and cut them into pieces: the first cake has been cut into *a* pieces, and the second one — into *b* pieces.\n\nIvan knows that there will be *n* people at the celebration (including himself), so Ivan has set *n* plates for the cakes. Now he is thinking about how to distribute the cakes between the plates. Ivan wants to do it in such a way that all following conditions are met:\n 1. Each piece of each cake is put on some plate; 1. Each plate contains at least one piece of cake; 1. No plate contains pieces of both cakes. \nTo make his guests happy, Ivan wants to distribute the cakes in such a way that the minimum number of pieces on the plate is maximized. Formally, Ivan wants to know the maximum possible number *x* such that he can distribute the cakes according to the aforementioned conditions, and each plate will contain at least *x* pieces of cake.\n\nHelp Ivan to calculate this number *x*!",
"input": "",
"output": "```python\nfrom math import floor\r\n\r\ninputs = input().split(' ')\r\n\r\nn = int(inputs[0])\r\na = int(inputs[1])\r\nb = int(inputs[2])\r\n\r\ncur_max = floor((a + b) / n)\r\n\r\nwhile True:\r\n for i in range(n):\r\n if cur_max * i <= a and cur_max * (n-i) <= b:\r\n print(cur_max)\r\n exit()\r\n cur_max -= 1\r\nprint(1)\r\n \r\n \r\n\r\n\r\n\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "On the way to Rio de Janeiro Ostap kills time playing with a grasshopper he took with him in a special box. Ostap builds a line of length *n* such that some cells of this line are empty and some contain obstacles. Then, he places his grasshopper to one of the empty cells and a small insect in another empty cell. The grasshopper wants to eat the insect.\n\nOstap knows that grasshopper is able to jump to any empty cell that is exactly *k* cells away from the current (to the left or to the right). Note that it doesn't matter whether intermediate cells are empty or not as the grasshopper makes a jump over them. For example, if *k*<==<=1 the grasshopper can jump to a neighboring cell only, and if *k*<==<=2 the grasshopper can jump over a single cell.\n\nYour goal is to determine whether there is a sequence of jumps such that grasshopper will get from his initial position to the cell with an insect.",
"input": "",
"output": "```python\nn, k = [int(x) for x in input().split()]\r\ns = input()\r\nti = s.index('T')\r\ngi = s.index('G')\r\nd = abs(gi - ti)\r\nr = d % k\r\nif r!= 0:\r\n print(\"NO\")\r\nelse:\r\n if ti < gi:\r\n ti, gi = gi, ti\r\n bad = False\r\n for i in range(gi + k, ti, k):\r\n if s[i] == '#':\r\n bad = True\r\n break\r\n if bad:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "This is yet another problem dealing with regular bracket sequences.\n\nWe should remind you that a bracket sequence is called regular, if by inserting «+» and «1» into it we can get a correct mathematical expression. For example, sequences «(())()», «()» and «(()(()))» are regular, while «)(», «(()» and «(()))(» are not. \n\nYou are given a string of «(» and «)» characters. You are to find its longest substring that is a regular bracket sequence. You are to find the number of such substrings as well.",
"input": "",
"output": "```python\ns = input()\r\nstack = []\r\nans = 0\r\nc = 0\r\nc1 = 0\r\nfor i in range(len(s)):\r\n if s[i] == \"(\":\r\n stack.append(s[i])\r\n c+=1\r\n else:\r\n if len(stack) == 0:\r\n pass\r\n else:\r\n p = stack.pop()\r\n if len(stack) == 0:\r\n if ans < (2*c):\r\n ans = (2*c)\r\n c1 = 1\r\n elif ans == (2*c):\r\n ans = (2*c)\r\n c1+=1\r\n c=0\r\nif ans == 0:\r\n print(ans,1)\r\nelse:\r\n print(ans,c1)\r\n \n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.\n\nA little later they found a string *s*, carved on a rock below the temple's gates. Asterix supposed that that's the password that opens the temple and read the string aloud. However, nothing happened. Then Asterix supposed that a password is some substring *t* of the string *s*.\n\nPrefix supposed that the substring *t* is the beginning of the string *s*; Suffix supposed that the substring *t* should be the end of the string *s*; and Obelix supposed that *t* should be located somewhere inside the string *s*, that is, *t* is neither its beginning, nor its end.\n\nAsterix chose the substring *t* so as to please all his companions. Besides, from all acceptable variants Asterix chose the longest one (as Asterix loves long strings). When Asterix read the substring *t* aloud, the temple doors opened. \n\nYou know the string *s*. Find the substring *t* or determine that such substring does not exist and all that's been written above is just a nice legend.",
"input": "",
"output": "```python\ns=input()\r\nb=True\r\nfor x in range(1,len(s)):\r\n\ti=s[:len(s)-x]\r\n\te=s[x:]\r\n\tif(i==e and i in s[1:-1]):\r\n\t\tprint(i)\r\n\t\tb=False\r\n\t\tbreak\r\nif(b):\r\n\tprint(\"Just a legend\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Buses run between the cities *A* and *B*, the first one is at 05:00 AM and the last one departs not later than at 11:59 PM. A bus from the city *A* departs every *a* minutes and arrives to the city *B* in a *t**a* minutes, and a bus from the city *B* departs every *b* minutes and arrives to the city *A* in a *t**b* minutes.\n\nThe driver Simion wants to make his job diverse, so he counts the buses going towards him. Simion doesn't count the buses he meet at the start and finish.\n\nYou know the time when Simion departed from the city *A* to the city *B*. Calculate the number of buses Simion will meet to be sure in his counting.",
"input": "",
"output": "```python\na, ta = map(int, input().split())\nb, tb = map(int, input().split())\nh, m = map(int, input().split(':'))\ntime = h * 60 + m\nbasetime = 300\n\n\nif time - basetime >= tb:\n ans = (ta + tb) // b\n if ta == tb:\n ans -= 1\nelse:\n ans = (time - basetime + ta) // b\n\n\nprint(ans)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Masha really loves algebra. On the last lesson, her strict teacher Dvastan gave she new exercise.\n\nYou are given geometric progression *b* defined by two integers *b*1 and *q*. Remind that a geometric progression is a sequence of integers *b*1,<=*b*2,<=*b*3,<=..., where for each *i*<=><=1 the respective term satisfies the condition *b**i*<==<=*b**i*<=-<=1·*q*, where *q* is called the common ratio of the progression. Progressions in Uzhlyandia are unusual: both *b*1 and *q* can equal 0. Also, Dvastan gave Masha *m* \"bad\" integers *a*1,<=*a*2,<=...,<=*a**m*, and an integer *l*.\n\nMasha writes all progression terms one by one onto the board (including repetitive) while condition |*b**i*|<=≤<=*l* is satisfied (|*x*| means absolute value of *x*). There is an exception: if a term equals one of the \"bad\" integers, Masha skips it (doesn't write onto the board) and moves forward to the next term.\n\nBut the lesson is going to end soon, so Masha has to calculate how many integers will be written on the board. In order not to get into depression, Masha asked you for help: help her calculate how many numbers she will write, or print \"inf\" in case she needs to write infinitely many integers.",
"input": "",
"output": "```python\nimport math\r\n\r\nb, q, l, m = list(map(int,input().split(\" \")))\r\na = set(map(int,input().split(\" \")))\r\n\r\nif q == 1:\r\n if b in a:\r\n ans = 0\r\n else:\r\n ans = \"inf\"\r\nelif q == -1:\r\n if b in a and -b in a:\r\n ans = 0\r\n else:\r\n ans = \"inf\"\r\nelse:\r\n # Finite progression\r\n # b_n = b_1*q^(n-1): |b_n| <= l -> |b_1*q^(n-1)| <= l\r\n # (log(l)-log(|b_1|))/ log(q) + 1 >= n\r\n max_num = int((math.log(l) - math.log(abs(b))) / math.log(q) + 1)\r\n \r\n # a/b == 0 mod (q)\r\n bad_count = sum(map(lambda x: x <= l and (math.log(x/b)/math.log(q)) % 1 == 0, a))\r\n # print(bad_count)\r\n ans = max_num - bad_count\r\n\r\n\r\n\r\n\r\nprint(ans)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* walruses standing in a queue in an airport. They are numbered starting from the queue's tail: the 1-st walrus stands at the end of the queue and the *n*-th walrus stands at the beginning of the queue. The *i*-th walrus has the age equal to *a**i*.\n\nThe *i*-th walrus becomes displeased if there's a younger walrus standing in front of him, that is, if exists such *j* (*i*<=<<=*j*), that *a**i*<=><=*a**j*. The displeasure of the *i*-th walrus is equal to the number of walruses between him and the furthest walrus ahead of him, which is younger than the *i*-th one. That is, the further that young walrus stands from him, the stronger the displeasure is.\n\nThe airport manager asked you to count for each of *n* walruses in the queue his displeasure.",
"input": "",
"output": "```python\nn = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(len(l)-1):\r\n if l[i] > l[i+1]:\r\n j = i\r\n c = 0\r\n while l[i] > l[j+1]:\r\n c += 1\r\n if j+1 == len(l) - 1:\r\n break\r\n j += 1\r\n print(c-1,end=\" \")\r\n else:\r\n print(\"-1 \",end=\"\")\r\nprint(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Berland Football Cup starts really soon! Commentators from all over the world come to the event.\n\nOrganizers have already built $n$ commentary boxes. $m$ regional delegations will come to the Cup. Every delegation should get the same number of the commentary boxes. If any box is left unoccupied then the delegations will be upset. So each box should be occupied by exactly one delegation.\n\nIf $n$ is not divisible by $m$, it is impossible to distribute the boxes to the delegations at the moment.\n\nOrganizers can build a new commentary box paying $a$ burles and demolish a commentary box paying $b$ burles. They can both build and demolish boxes arbitrary number of times (each time paying a corresponding fee). It is allowed to demolish all the existing boxes.\n\nWhat is the minimal amount of burles organizers should pay to satisfy all the delegations (i.e. to make the number of the boxes be divisible by $m$)?",
"input": "",
"output": "```python\na,b,c,d=map(int,input().split())\r\nif a//b==0:print(0)\r\nelif b>a:\r\n k=abs((b-a)*c);l=abs(a*d)\r\n if kb:\r\n k=(b-(a%b))*c;l=(a%b)*d\r\n if k0:\r\n store+=i\r\n if store>0:\r\n if i<0:\r\n store-=1\r\n else:\r\n c+=1\r\nprint(c)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are several days left before the fiftieth birthday of a famous Berland's writer Berlbury. In this connection the local library decided to make an exposition of the works of this famous science-fiction writer. It was decided as well that it is necessary to include into the exposition only those books that were published during a particular time period. It is obvious that if the books differ much in size, the visitors will not like it. That was why the organizers came to the opinion, that the difference between the highest and the lowest books in the exposition should be not more than *k* millimeters.\n\nThe library has *n* volumes of books by Berlbury, arranged in chronological order of their appearance. The height of each book in millimeters is know, it is *h**i*. As Berlbury is highly respected in the city, the organizers want to include into the exposition as many books as possible, and to find out what periods of his creative work they will manage to cover. You are asked to help the organizers cope with this hard task.",
"input": "",
"output": "```python\n################################################################################\r\nn,k=map(int, input().split())\r\nh=list(map(int, input().split()))\r\n\r\n# n=3\r\n# k=3\r\n# h=[14,12,10]\r\n\r\n# n=4\r\n# k=5\r\n# h=[8,19,10,13]\r\n################################################################################\r\nmax_a=0\r\n\r\ni1=0\r\nmincup=h[0]\r\nmaxcup=h[0]\r\nfor i in range(1,n):\r\n if h[i]maxcup:\r\n maxcup=h[i]\r\n\r\n while maxcup-mincup>k and i1!=i:\r\n if mincup==h[i1]:\r\n mincup=min(h[i1+1:i+1])\r\n if maxcup==h[i1]:\r\n maxcup=max(h[i1+1:i+1])\r\n i1+=1\r\n\r\n if i-i1+1>max_a:\r\n max_a=i-i1+1\r\n\r\ni1=0\r\nmincup=h[0]\r\nmaxcup=h[0]\r\nout=[]\r\nfor i in range(1,n):\r\n if h[i]maxcup:\r\n maxcup=h[i]\r\n\r\n while maxcup-mincup>k and i1!=i:\r\n if mincup==h[i1]:\r\n mincup=min(h[i1+1:i+1])\r\n if maxcup==h[i1]:\r\n maxcup=max(h[i1+1:i+1])\r\n i1+=1\r\n\r\n if i-i1+1==max_a:\r\n out.append([i1+1,i+1])\r\n\r\nprint(max_a,len(out))\r\nfor out1 in out:\r\n print(out1[0],out1[1])\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A and B are preparing themselves for programming contests.\n\nB loves to debug his code. But before he runs the solution and starts debugging, he has to first compile the code.\n\nInitially, the compiler displayed *n* compilation errors, each of them is represented as a positive integer. After some effort, B managed to fix some mistake and then another one mistake.\n\nHowever, despite the fact that B is sure that he corrected the two errors, he can not understand exactly what compilation errors disappeared — the compiler of the language which B uses shows errors in the new order every time! B is sure that unlike many other programming languages, compilation errors for his programming language do not depend on each other, that is, if you correct one error, the set of other error does not change.\n\nCan you help B find out exactly what two errors he corrected?",
"input": "",
"output": "```python\nt=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nsumm1=sum(a)\r\nsumm2=sum(b)\r\nsumm3=sum(c)\r\nprint(summ1-summ2)\r\nprint(summ2-summ3)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "For a given positive integer *n* denote its *k*-rounding as the minimum positive integer *x*, such that *x* ends with *k* or more zeros in base 10 and is divisible by *n*.\n\nFor example, 4-rounding of 375 is 375·80<==<=30000. 30000 is the minimum integer such that it ends with 4 or more zeros and is divisible by 375.\n\nWrite a program that will perform the *k*-rounding of *n*.",
"input": "",
"output": "```python\n\r\nfrom math import gcd\r\n\r\n\r\ndef lcm(x, y):\r\n ans = (x*y)//gcd(x, y)\r\n return ans\r\n\r\n\r\nn, k = (map(int, input().split()))\r\nif k == 0:\r\n print(n)\r\nelse:\r\n z = 10**k\r\n print(lcm(n, z))\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "It's the year 4527 and the tanks game that we all know and love still exists. There also exists Great Gena's code, written in 2016. The problem this code solves is: given the number of tanks that go into the battle from each country, find their product. If it is turns to be too large, then the servers might have not enough time to assign tanks into teams and the whole game will collapse!\n\nThere are exactly *n* distinct countries in the world and the *i*-th country added *a**i* tanks to the game. As the developers of the game are perfectionists, the number of tanks from each country is beautiful. A beautiful number, according to the developers, is such number that its decimal representation consists only of digits '1' and '0', moreover it contains at most one digit '1'. However, due to complaints from players, some number of tanks of one country was removed from the game, hence the number of tanks of this country may not remain beautiful.\n\nYour task is to write the program that solves exactly the same problem in order to verify Gena's code correctness. Just in case.",
"input": "",
"output": "```python\n'''input\n3\n5 10 1\n'''\nn = int(input())\np = 1\nfor x in map(int, input().split()):\n\tp *= x\nprint(p)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Little girl Tanya is learning how to decrease a number by one, but she does it wrong with a number consisting of two or more digits. Tanya subtracts one from a number by the following algorithm:\n - if the last digit of the number is non-zero, she decreases the number by one; - if the last digit of the number is zero, she divides the number by 10 (i.e. removes the last digit). \nYou are given an integer number $n$. Tanya will subtract one from it $k$ times. Your task is to print the result after all $k$ subtractions.\n\nIt is guaranteed that the result will be positive integer number.",
"input": "",
"output": "```python\nm,n=map(int,input().split())\r\nfor i in range(n):\r\n if(m%10!=0):\r\n m=m-1\r\n else:\r\n m=m//10\r\nprint(m)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You found a mysterious function *f*. The function takes two strings *s*1 and *s*2. These strings must consist only of lowercase English letters, and must be the same length.\n\nThe output of the function *f* is another string of the same length. The *i*-th character of the output is equal to the minimum of the *i*-th character of *s*1 and the *i*-th character of *s*2.\n\nFor example, *f*(\"ab\", \"ba\") = \"aa\", and *f*(\"nzwzl\", \"zizez\") = \"niwel\".\n\nYou found two strings *x* and *y* of the same length and consisting of only lowercase English letters. Find any string *z* such that *f*(*x*,<=*z*)<==<=*y*, or print -1 if no such string *z* exists.",
"input": "",
"output": "```python\na=input()\r\nb=input()\r\nfor i in range(len(a)):\r\n if b[i]>a[i]:\r\n print(-1)\r\n exit(0)\r\nprint(b)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. \"Piece of cake\" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.",
"input": "",
"output": "```python\nn=int(input())\r\na=b=c=0\r\nfor i in range(n):\r\n s=list(map(int,input().split()))\r\n a+=s[0]\r\n b+=s[1]\r\n c+=s[2]\r\nif a==b==c==0:\r\n print('YES')\r\nelse:\r\n print('NO')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Mike is the president of country What-The-Fatherland. There are *n* bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to *n* from left to right. *i*-th bear is exactly *a**i* feet high. \n\nA group of bears is a non-empty contiguous segment of the line. The size of a group is the number of bears in that group. The strength of a group is the minimum height of the bear in that group.\n\nMike is a curious to know for each *x* such that 1<=≤<=*x*<=≤<=*n* the maximum strength among all groups of size *x*.",
"input": "",
"output": "```python\ndef strength(bears):\r\n return (max(min(bears[displacement:displacement + group_size]) for displacement in range(len(bears) - group_size + 1)) for group_size in range(1, len(bears) + 1))\r\nuseless = input()\r\nbears = input().split(' ')\r\nfor i in strength(bears):\r\n print(i, end = ' ')\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Allen has a LOT of money. He has $n$ dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are $1$, $5$, $10$, $20$, $100$. What is the minimum number of bills Allen could receive after withdrawing his entire balance?",
"input": "",
"output": "```python\nimport math \r\n\r\ndef lotto(money):\r\n\tbills = 0\r\n\twhile money != 0:\r\n\t\tbills += math.floor(money/100) \r\n\t\tmoney %= 100\r\n\t\tbills += math.floor(money/20)\r\n\t\tmoney %= 20\r\n\t\tbills += math.floor(money/10)\r\n\t\tmoney %= 10\r\n\t\tbills += math.floor(money/5)\r\n\t\tmoney %= 5\r\n\t\tbills += math.floor(money/1)\r\n\t\tmoney %= 1\r\n\treturn bills\r\n\r\nprint(lotto(int(input())))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Imagine that there is a group of three friends: A, B and С. A owes B 20 rubles and B owes C 20 rubles. The total sum of the debts is 40 rubles. You can see that the debts are not organized in a very optimal manner. Let's rearrange them like that: assume that A owes C 20 rubles and B doesn't owe anything to anybody. The debts still mean the same but the total sum of the debts now equals 20 rubles.\n\nThis task is a generalisation of a described example. Imagine that your group of friends has *n* people and you know the debts between the people. Optimize the given debts without changing their meaning. In other words, finally for each friend the difference between the total money he should give and the total money he should take must be the same. Print the minimum sum of all debts in the optimal rearrangement of the debts. See the notes to the test samples to better understand the problem.",
"input": "",
"output": "```python\nn,m=map(int,input().split())\r\nd=dict()\r\n\r\nfor i in range(0,m):\r\n a,b,c=map(int,input().split())\r\n if a in d:\r\n d[a]=d[a]+c\r\n else:\r\n d[a]=c\r\n if b in d:\r\n d[b]=d[b]-c\r\n else:\r\n d[b]=-c\r\n\r\n\r\nprint(abs(sum([i for i in d.values() if i<0])))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Having watched the last Harry Potter film, little Gerald also decided to practice magic. He found in his father's magical book a spell that turns any number in the sum of its digits. At the moment Gerald learned that, he came across a number *n*. How many times can Gerald put a spell on it until the number becomes one-digit?",
"input": "",
"output": "```python\ni = int(input())\na = 0\nwhile i >= 10:\n a += 1\n i = sum(int(x) for x in str(i))\nprint(a)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a string *s* consisting of |*s*| small english letters.\n\nIn one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b, s will be replaced with t, etc.). You cannot replace letter z with any other letter.\n\nYour target is to make some number of moves (not necessary minimal) to get string abcdefghijklmnopqrstuvwxyz (english alphabet) as a subsequence. Subsequence of the string is the string that is obtained by deleting characters at some positions. You need to print the string that will be obtained from the given string and will be contain english alphabet as a subsequence or say that it is impossible.",
"input": "",
"output": "```python\nimport string\r\nalf = string.ascii_lowercase\r\ncount = 0\r\ns = list(input())\r\nfor i, el in enumerate(s):\r\n if alf.index(el) <= count:\r\n s[i] = alf[count]\r\n print(''.join(s))\r\n count += 1\r\n if count == 26:\r\n print(''.join(s))\r\n exit(0)\r\nprint(-1)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "In this problem you have to simulate the workflow of one-thread server. There are *n* queries to process, the *i*-th will be received at moment *t**i* and needs to be processed for *d**i* units of time. All *t**i* are guaranteed to be distinct.\n\nWhen a query appears server may react in three possible ways: \n 1. If server is free and query queue is empty, then server immediately starts to process this query. 1. If server is busy and there are less than *b* queries in the queue, then new query is added to the end of the queue. 1. If server is busy and there are already *b* queries pending in the queue, then new query is just rejected and will never be processed. \nAs soon as server finished to process some query, it picks new one from the queue (if it's not empty, of course). If a new query comes at some moment *x*, and the server finishes to process another query at exactly the same moment, we consider that first query is picked from the queue and only then new query appears.\n\nFor each query find the moment when the server will finish to process it or print -1 if this query will be rejected.",
"input": "",
"output": "```python\n#include \r\n#include \r\ntypedef long long ll;\r\ntypedef unsigned long long ull;\r\n#define clr(ma) memset(ma,-1,sizeof ma)\r\n#define inf 30000000;\r\n#define vi vector\r\n#define pi pair\r\n#define T2 pair\r\n#define mk make_pair\r\n#define getBit(m,i) ((m&(1<::iterator\r\n#define itr2 map >::iterator\r\n#define id(k) scanf(\"%9lf\",&k)\r\n#define fi(ss) freopen (ss,\"r\",stdin)\r\n#define fo(ss) freopen (ss,\"w\",stdout)\r\n#define clean(vis) memset(vis,0,sizeof vis)\r\nusing namespace std;\r\nint t [200000+10];\r\nint d[200000+10];\r\nint n,b;\r\nint state;\r\nint pos;\r\nqueue q;\r\nll res[200000+10];\r\nll ct;\r\nint main(){\r\n in2(n,b);\r\n for(int i=0;i=n)break;\r\n if (q.empty()){\r\n res[pos]=t[pos]+d[pos];\r\n ct=t[pos]+d[pos];\r\n pos++;\r\n }\r\n else{\r\n int v=q.front();\r\n q.pop();\r\n res[v]=ct+d[v];\r\n if (pos=1:\r\n print(\"NO\")\r\n quit()\r\n if p>=1:\r\n print(\"NO\")\r\n quit()\r\n elif h[i]>h[i+1]:\r\n p+=1\r\n elif h[i]==h[i+1]:\r\n s+=1\r\n if p>=1:\r\n print(\"NO\")\r\n quit()\r\nprint(\"YES\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* cities situated along the main road of Berland. Cities are represented by their coordinates — integer numbers *a*1,<=*a*2,<=...,<=*a**n*. All coordinates are pairwise distinct.\n\nIt is possible to get from one city to another only by bus. But all buses and roads are very old, so the Minister of Transport decided to build a new bus route. The Minister doesn't want to spend large amounts of money — he wants to choose two cities in such a way that the distance between them is minimal possible. The distance between two cities is equal to the absolute value of the difference between their coordinates.\n\nIt is possible that there are multiple pairs of cities with minimal possible distance, so the Minister wants to know the quantity of such pairs. \n\nYour task is to write a program that will calculate the minimal possible distance between two pairs of cities and the quantity of pairs which have this distance.",
"input": "",
"output": "```python\nn = int(input())\r\nls = list(map(int, input().split()))\r\nls.sort()\r\nk=[]\r\nfor x in range(len(ls)-1):\r\n k.append(ls[x+1] - ls[x])\r\nprint (min(k), k.count(min(k)))\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given a tetrahedron. Let's mark its vertices with letters *A*, *B*, *C* and *D* correspondingly.\n\nAn ant is standing in the vertex *D* of the tetrahedron. The ant is quite active and he wouldn't stay idle. At each moment of time he makes a step from one vertex to another one along some edge of the tetrahedron. The ant just can't stand on one place.\n\nYou do not have to do much to solve the problem: your task is to count the number of ways in which the ant can go from the initial vertex *D* to itself in exactly *n* steps. In other words, you are asked to find out the number of different cyclic paths with the length of *n* from vertex *D* to itself. As the number can be quite large, you should print it modulo 1000000007 (109<=+<=7).",
"input": "",
"output": "```python\nimport sys\r\nimport math\r\nfrom collections import Counter\r\ninput = sys.stdin.readline\r\nN = 1000000007\r\n#use input().strip() \r\n\r\ndef multiply(a, b):\r\n\tmul = [[0 for x in range(2)]\r\n\t\t\tfor y in range(2)]\r\n\tfor i in range(2):\r\n\t\tfor j in range(2):\r\n\t\t\tfor k in range(2):\r\n\t\t\t\tmul[i][j] += a[i][k] * b[k][j]\r\n\r\n\tfor i in range(2):\r\n\t\tfor j in range(2):\r\n\t\t\ta[i][j] = mul[i][j]\r\n\treturn a\r\n\r\n\r\ndef power(F, n):\r\n\tM = [[2, 3], [1, 0]]\r\n\tif (n == 1):\r\n\t\treturn F[0][0]\r\n\tpower(F, int(n / 2))\r\n\tF = multiply(F, F)\r\n\tif (n % 2 != 0):\r\n\t\tF = multiply(F, M)\r\n\treturn F[0][0]\r\n\r\nn = int(input().strip())\r\nif n == 1:\r\n print(0)\r\nelif n == 2:\r\n print(3)\r\nelse:\r\n a = [[2, 3], [1, 0]]\r\n x = power(a, n - 2)\r\n print((x * 3) % N)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?",
"input": "",
"output": "```python\nx,y = input().split()\n\nx = int(x)\ny = int(y)\n\no = list(map(int, input().split()))\np = list(map(int, input().split()))\n\no.sort()\np.sort()\n\na = len(o)\nb = len(p)\n\ni = 0\nj = 0\n\nwhile(i < a):\n while(j < b):\n if(o[i] == p[j]):\n print(o[i])\n break\n\n else:\n j = j+1\n\n i = i+1\n\n\nif(o[0] > p[0]):\n e = (p[0] * 10)+o[0]\n print(e)\n\nelse:\n e = (o[0] * 10)+ p[0]\n print(e)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A prime number is a number which has exactly two distinct divisors: one and itself. For example, numbers 2, 7, 3 are prime, and 1, 6, 4 are not.\n\nThe next prime number after *x* is the smallest prime number greater than *x*. For example, the next prime number after 2 is 3, and the next prime number after 3 is 5. Note that there is exactly one next prime number after each number. So 5 is not the next prime number for 2.\n\nOne cold April morning Panoramix predicted that soon Kakofonix will break free from his straitjacket, and this will be a black day for the residents of the Gallic countryside.\n\nPanoramix's prophecy tells that if some day Asterix and Obelix beat exactly *x* Roman soldiers, where *x* is a prime number, and next day they beat exactly *y* Roman soldiers, where *y* is the next prime number after *x*, then it's time to wait for Armageddon, for nothing can shut Kakofonix up while he sings his infernal song.\n\nYesterday the Gauls beat *n* Roman soldiers and it turned out that the number *n* was prime! Today their victims were a troop of *m* Romans (*m*<=><=*n*). Determine whether the Gauls should wait for the black day after today's victory of Asterix and Obelix?",
"input": "",
"output": "```python\ndef isPrime(n):\r\n \r\n # Corner case\r\n if (n <= 1):\r\n return False\r\n \r\n # Check from 2 to n-1\r\n for i in range(2, n):\r\n if (n % i == 0):\r\n return False\r\n \r\n return True\r\na=[int(i) for i in input().split()]\r\nprimes=[]\r\nfor i in range(a[0],a[1]+1):\r\n primes.append(isPrime(i))\r\nif sum(primes)==2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Polycarp watched TV-show where *k* jury members one by one rated a participant by adding him a certain number of points (may be negative, i. e. points were subtracted). Initially the participant had some score, and each the marks were one by one added to his score. It is known that the *i*-th jury member gave *a**i* points.\n\nPolycarp does not remember how many points the participant had before this *k* marks were given, but he remembers that among the scores announced after each of the *k* judges rated the participant there were *n* (*n*<=≤<=*k*) values *b*1,<=*b*2,<=...,<=*b**n* (it is guaranteed that all values *b**j* are distinct). It is possible that Polycarp remembers not all of the scores announced, i. e. *n*<=<<=*k*. Note that the initial score wasn't announced.\n\nYour task is to determine the number of options for the score the participant could have before the judges rated the participant.",
"input": "",
"output": "```python\n# Jury Marks\r\n\r\nk, n = list(map(int, input().split(' ')))\r\njury_marks = list(map(int, input().split(' ')))\r\npoly_marks = list(map(int, input().split(' ')))\r\npotential = set()\r\ncurrent = poly_marks[0]\r\n\r\nfor mark in jury_marks:\r\n current += -1 * mark\r\n potential.add(current)\r\n\r\ncount = 0\r\n\r\nfor num in potential:\r\n all_vals = set()\r\n current = num\r\n for mark in jury_marks:\r\n current += mark\r\n all_vals.add(current)\r\n # print(all_vals, poly_marks)\r\n for mark in poly_marks:\r\n if not mark in all_vals:\r\n break\r\n else:\r\n count += 1\r\nprint(count)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "There are *n* servers in a laboratory, each of them can perform tasks. Each server has a unique id — integer from 1 to *n*.\n\nIt is known that during the day *q* tasks will come, the *i*-th of them is characterized with three integers: *t**i* — the moment in seconds in which the task will come, *k**i* — the number of servers needed to perform it, and *d**i* — the time needed to perform this task in seconds. All *t**i* are distinct.\n\nTo perform the *i*-th task you need *k**i* servers which are unoccupied in the second *t**i*. After the servers begin to perform the task, each of them will be busy over the next *d**i* seconds. Thus, they will be busy in seconds *t**i*,<=*t**i*<=+<=1,<=...,<=*t**i*<=+<=*d**i*<=-<=1. For performing the task, *k**i* servers with the smallest ids will be chosen from all the unoccupied servers. If in the second *t**i* there are not enough unoccupied servers, the task is ignored.\n\nWrite the program that determines which tasks will be performed and which will be ignored.",
"input": "",
"output": "```python\ndef main():\r\n n, k = map(int, input().split())\r\n ser = [0] * n\r\n for i in range(k):\r\n t, ki, v = map(int, input().split())\r\n ans = 0\r\n for el in ser:\r\n if el < t:\r\n ans += 1\r\n if ans > ki: break\r\n if ans >= ki:\r\n ans = 0\r\n j = 0\r\n while ki > 0:\r\n if ser[j] < t:\r\n ser[j] = t + v - 1\r\n ki -= 1\r\n ans += (j+1)\r\n j += 1\r\n print(ans)\r\n else:\r\n print(-1)\r\n ans = 0\r\n return 0\r\nmain()\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "You are given two positive integer numbers *a* and *b*. Permute (change order) of the digits of *a* to construct maximal number not exceeding *b*. No number in input and/or output can start with the digit 0.\n\nIt is allowed to leave *a* as it is.",
"input": "",
"output": "```python\na = sorted(input())\r\nb = int(input())\r\na = a[::-1]\r\np = \"\"\r\nwhile a:\r\n\tfor i, z in enumerate(a):\r\n\t\tn = p + a[i] + \"\".join(sorted(a[:i]+a[i+1:]))\r\n\t\tif int(n)<=b:\r\n\t\t\tp += z\r\n\t\t\ta.pop(i)\r\n\t\t\tbreak\r\nprint(p)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "A new Berland businessman Vitaly is going to open a household appliances' store. All he's got to do now is to hire the staff.\n\nThe store will work seven days a week, but not around the clock. Every day at least *k* people must work in the store.\n\nBerland has a law that determines the order of working days and non-working days. Namely, each employee must work for exactly *n* consecutive days, then rest for exactly *m* days, then work for *n* more days and rest for *m* more, and so on. Vitaly doesn't want to break the law. Fortunately, there is a loophole: the law comes into force on the day when the employee is hired. For example, if an employee is hired on day *x*, then he should work on days [*x*,<=*x*<=+<=1,<=...,<=*x*<=+<=*n*<=-<=1], [*x*<=+<=*m*<=+<=*n*,<=*x*<=+<=*m*<=+<=*n*<=+<=1,<=...,<=*x*<=+<=*m*<=+<=2*n*<=-<=1], and so on. Day *x* can be chosen arbitrarily by Vitaly.\n\nThere is one more thing: the key to the store. Berland law prohibits making copies of keys, so there is only one key. Vitaly is planning to entrust the key to the store employees. At the same time on each day the key must be with an employee who works that day — otherwise on this day no one can get inside the store. During the day the key holder can give the key to another employee, if he also works that day. The key will handed to the first hired employee at his first working day.\n\nEach employee has to be paid salary. Therefore, Vitaly wants to hire as few employees as possible provided that the store can operate normally on each day from 1 to infinity. In other words, on each day with index from 1 to infinity, the store must have at least *k* working employees, and one of the working employees should have the key to the store.\n\nHelp Vitaly and determine the minimum required number of employees, as well as days on which they should be hired.",
"input": "",
"output": "```python\nn,m,k = map(int,input().split())\n\n\nans = [1 for i in range(k)]\n\ntransition = True\nfor i in range(n-1, n+m):\n\n if transition: \n if ans[-k]+n == i+1:\n ans.append(i)\n if k > 1:\n transition = False\n else: \n if ans[-k]+n == i:\n ans.extend([i]*(max(1, k-1)))\n transition = True\n \nprint(*ans)\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Recently *n* students from city S moved to city P to attend a programming camp.\n\nThey moved there by train. In the evening, all students in the train decided that they want to drink some tea. Of course, no two people can use the same teapot simultaneously, so the students had to form a queue to get their tea.\n\n*i*-th student comes to the end of the queue at the beginning of *l**i*-th second. If there are multiple students coming to the queue in the same moment, then the student with greater index comes after the student with lesser index. Students in the queue behave as follows: if there is nobody in the queue before the student, then he uses the teapot for exactly one second and leaves the queue with his tea; otherwise the student waits for the people before him to get their tea. If at the beginning of *r**i*-th second student *i* still cannot get his tea (there is someone before him in the queue), then he leaves the queue without getting any tea. \n\nFor each student determine the second he will use the teapot and get his tea (if he actually gets it).",
"input": "",
"output": "```python\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n g = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n d = []\r\n c = 1\r\n x = 0\r\n for i in range(n):\r\n if g[i][0] - x >= c:\r\n d.append(g[i][0])\r\n c = g[i][0] + 1\r\n else:\r\n c += 1\r\n if g[i][1] <= c:\r\n d.append(0)\r\n else:\r\n d.append(g[i][0]+c-x)\r\n c -= 1\r\n x = g[i][0]\r\n print(*d)\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Let quasi-palindromic number be such number that adding some leading zeros (possible none) to it produces a palindromic string. \n\nString *t* is called a palindrome, if it reads the same from left to right and from right to left.\n\nFor example, numbers 131 and 2010200 are quasi-palindromic, they can be transformed to strings \"131\" and \"002010200\", respectively, which are palindromes.\n\nYou are given some integer number *x*. Check if it's a quasi-palindromic number.",
"input": "",
"output": "```python\na=input()\r\ni=len(a)-1\r\nwhile(a[i]=='0'):i-=1\r\nif a[:i+1]==a[len(a)-i+1::-1]:print(\"YES\")\r\nelse:print(\"NO\")\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Sometimes one has to spell email addresses over the phone. Then one usually pronounces a dot as dot, an at sign as at. As a result, we get something like vasyaatgmaildotcom. Your task is to transform it into a proper email address ([[email protected]](/cdn-cgi/l/email-protection)). \n\nIt is known that a proper email address contains only such symbols as . @ and lower-case Latin letters, doesn't start with and doesn't end with a dot. Also, a proper email address doesn't start with and doesn't end with an at sign. Moreover, an email address contains exactly one such symbol as @, yet may contain any number (possible, zero) of dots. \n\nYou have to carry out a series of replacements so that the length of the result was as short as possible and it was a proper email address. If the lengths are equal, you should print the lexicographically minimal result. \n\nOverall, two variants of replacement are possible: dot can be replaced by a dot, at can be replaced by an at.",
"input": "",
"output": "```python\nemail = input()\n\n\nidx_at = email.index(\"at\")\nidx_dot = email.index(\"dot\")\n\n\nprint(email[0:idx_at] + \"@\" + email[idx_at+2:idx_dot] + \".\" + email[idx_dot+3:len(email)])\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "One day Kefa found *n* baloons. For convenience, we denote color of *i*-th baloon as *s**i* — lowercase letter of the Latin alphabet. Also Kefa has *k* friends. Friend will be upset, If he get two baloons of the same color. Kefa want to give out all baloons to his friends. Help Kefa to find out, can he give out all his baloons, such that no one of his friens will be upset — print «YES», if he can, and «NO», otherwise. Note, that Kefa's friend will not upset, if he doesn't get baloons at all.",
"input": "",
"output": "```python\nballons, friends = map(int, input().split())\r\ncolor = input()\r\nlencolor = len(color)\r\nx = 0\r\ncount = [0] * 26 # букв всего 26б значит и индекс не мсжет быть болше 26\r\n# tkcb кол-во одного цвета больше чем друзейб кто-то получит два одного цвета\r\nfor i in color:\r\n nomer = ord(i) - 97\r\n count[nomer] += 1 # индексы плюсуются\r\nfor i in range(26):\r\n if count[i] > friends:\r\n # print(chr(i + 97), count[i])\r\n # elif count[i] > friends:\r\n x += 1\r\nif x > 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\n```"
},
{
"source": "MatrixStudio/Codeforces-Python-Submissions",
"instruction": "Once upon a time a child got a test consisting of multiple-choice questions as homework. A multiple-choice question consists of four choices: A, B, C and D. Each choice has a description, and the child should find out the only one that is correct.\n\nFortunately the child knows how to solve such complicated test. The child will follow the algorithm:\n - If there is some choice whose description at least twice shorter than all other descriptions, or at least twice longer than all other descriptions, then the child thinks the choice is great. - If there is exactly one great choice then the child chooses it. Otherwise the child chooses C (the child think it is the luckiest choice). \nYou are given a multiple-choice questions, can you predict child's choose?",
"input": "",
"output": "```python\na=input()\r\nb=input()\r\nc=input()\r\nd=input()\r\nif((len(a)-2)>=(len(b)-2)*2 and (len(a)-2)>=(len(c)-2)*2 and (len(a)-2)>=(len(d)-2)*2):\r\n print(\"A\")\r\nelif((len(b)-2)>=(len(a)-2)*2 and (len(b)-2)>=(len(c)-2)*2 and (len(b)-2)>=(len(d)-2)*2):\r\n print(\"B\")\r\nelif((len(d)-2)>=(len(b)-2)*2 and (len(d)-2)>=(len(c)-2)*2 and (len(d)-2)>=(len(a)-2)*2):\r\n print(\"D\") \r\nelif((len(a)-2)*2