Split (2)

train · 621k rows

contestId int64 0 1.01k	index stringclasses 57 values	name stringlengths 2 58	type stringclasses 2 values	rating int64 0 3.5k	tags listlengths 0 11	title stringclasses 522 values	time-limit stringclasses 8 values	memory-limit stringclasses 8 values	problem-description stringlengths 0 7.15k	input-specification stringlengths 0 2.05k	output-specification stringlengths 0 1.5k	demo-input listlengths 0 7	demo-output listlengths 0 7	note stringlengths 0 5.24k	points float64 0 425k	test_cases listlengths 0 402	creationTimeSeconds int64 1.37B 1.7B	relativeTimeSeconds int64 8 2.15B	programmingLanguage stringclasses 3 values	verdict stringclasses 14 values	testset stringclasses 12 values	passedTestCount int64 0 1k	timeConsumedMillis int64 0 15k	memoryConsumedBytes int64 0 805M	code stringlengths 3 65.5k	prompt stringlengths 262 8.2k	response stringlengths 17 65.5k	score float64 -1 3.99
868	B	Race Against Time	PROGRAMMING	1,400	[ "implementation" ]		null	null	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. The 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. Last time Misha talked with the coordinator at t1 o'clock, so now he stands on the number t1 on the clock face. The contest should be ready by t2 o'clock. In the terms of paradox it means that Misha has to go to number t2 somehow. Note that he doesn't have to move forward only: in these circumstances time has no direction. Clock 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). Given the hands' positions, t1, and t2, find if Misha can prepare the contest on time (or should we say on space?). That is, find if he can move from t1 to t2 by the clock face.	Five integers h, m, s, t1, t2 (1<=≤<=h<=≤<=12, 0<=≤<=m,<=s<=≤<=59, 1<=≤<=t1,<=t2<=≤<=12, t1<=≠<=t2). Misha's position and the target time do not coincide with the position of any hand.	Print "YES" (quotes for clarity), if Misha can prepare the contest on time, and "NO" otherwise. You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").	[ "12 30 45 3 11\n", "12 0 1 12 1\n", "3 47 0 4 9\n" ]	[ "NO\n", "YES\n", "YES\n" ]	The three examples are shown on the pictures below from left to right. The starting position of Misha is shown with green, the ending position is shown with pink. Note that the positions of the hands on the pictures are not exact, but are close to the exact and the answer is the same.	500	[ { "input": "12 30 45 3 11", "output": "NO" }, { "input": "12 0 1 12 1", "output": "YES" }, { "input": "3 47 0 4 9", "output": "YES" }, { "input": "10 22 59 6 10", "output": "YES" }, { "input": "3 1 13 12 3", "output": "NO" }, { "input": "11 19 28 9 10", "output": "YES" }, { "input": "9 38 22 6 1", "output": "NO" }, { "input": "5 41 11 5 8", "output": "NO" }, { "input": "11 2 53 10 4", "output": "YES" }, { "input": "9 41 17 10 1", "output": "YES" }, { "input": "6 54 48 12 6", "output": "YES" }, { "input": "12 55 9 5 1", "output": "NO" }, { "input": "8 55 35 9 3", "output": "NO" }, { "input": "3 21 34 3 10", "output": "YES" }, { "input": "2 52 1 12 3", "output": "NO" }, { "input": "7 17 11 1 7", "output": "NO" }, { "input": "11 6 37 6 4", "output": "YES" }, { "input": "9 6 22 8 1", "output": "NO" }, { "input": "3 10 5 5 9", "output": "YES" }, { "input": "7 12 22 11 2", "output": "YES" }, { "input": "7 19 4 7 3", "output": "NO" }, { "input": "11 36 21 4 6", "output": "NO" }, { "input": "10 32 49 1 3", "output": "YES" }, { "input": "1 9 43 11 3", "output": "NO" }, { "input": "1 8 33 4 8", "output": "NO" }, { "input": "3 0 33 9 4", "output": "NO" }, { "input": "7 15 9 10 3", "output": "NO" }, { "input": "8 3 57 11 1", "output": "NO" }, { "input": "1 33 49 5 9", "output": "NO" }, { "input": "3 40 0 5 7", "output": "YES" }, { "input": "5 50 9 2 7", "output": "NO" }, { "input": "10 0 52 6 1", "output": "YES" }, { "input": "3 10 4 1 11", "output": "NO" }, { "input": "2 41 53 4 6", "output": "YES" }, { "input": "10 29 30 4 7", "output": "NO" }, { "input": "5 13 54 9 11", "output": "NO" }, { "input": "1 0 23 3 9", "output": "NO" }, { "input": "1 0 41 12 1", "output": "NO" }, { "input": "6 30 30 3 9", "output": "YES" }, { "input": "3 7 32 11 10", "output": "YES" }, { "input": "1 0 25 12 4", "output": "NO" }, { "input": "12 0 0 5 6", "output": "YES" }, { "input": "1 5 4 3 2", "output": "YES" }, { "input": "6 30 30 9 10", "output": "YES" }, { "input": "6 0 0 2 8", "output": "NO" }, { "input": "10 50 59 9 10", "output": "YES" }, { "input": "12 59 59 12 6", "output": "NO" }, { "input": "3 0 30 3 4", "output": "NO" }, { "input": "2 10 10 1 11", "output": "YES" }, { "input": "10 5 30 1 12", "output": "YES" }, { "input": "5 29 31 5 10", "output": "YES" }, { "input": "5 2 2 11 2", "output": "NO" }, { "input": "5 15 46 3 10", "output": "YES" }, { "input": "1 30 50 1 2", "output": "NO" }, { "input": "5 26 14 1 12", "output": "YES" }, { "input": "1 58 43 12 1", "output": "YES" }, { "input": "12 0 12 11 1", "output": "NO" }, { "input": "6 52 41 6 5", "output": "YES" }, { "input": "5 8 2 1 3", "output": "NO" }, { "input": "2 0 0 1 3", "output": "NO" }, { "input": "1 5 6 2 1", "output": "YES" }, { "input": "9 5 5 11 12", "output": "YES" }, { "input": "12 5 19 3 4", "output": "NO" }, { "input": "6 14 59 1 3", "output": "NO" }, { "input": "10 38 34 4 12", "output": "YES" }, { "input": "2 54 14 2 12", "output": "YES" }, { "input": "5 31 0 6 7", "output": "NO" }, { "input": "6 15 30 3 9", "output": "YES" }, { "input": "3 54 41 8 10", "output": "NO" }, { "input": "3 39 10 10 12", "output": "YES" }, { "input": "1 11 50 1 2", "output": "NO" }, { "input": "5 40 24 8 1", "output": "NO" }, { "input": "9 5 59 1 3", "output": "NO" }, { "input": "5 0 0 6 7", "output": "YES" }, { "input": "4 40 59 6 8", "output": "YES" }, { "input": "10 13 55 12 1", "output": "YES" }, { "input": "6 50 0 5 6", "output": "YES" }, { "input": "7 59 3 7 4", "output": "YES" }, { "input": "6 0 1 6 7", "output": "NO" }, { "input": "6 15 55 3 5", "output": "NO" }, { "input": "12 9 55 10 2", "output": "YES" }, { "input": "2 0 1 11 2", "output": "NO" }, { "input": "8 45 17 12 9", "output": "NO" }, { "input": "5 30 31 11 3", "output": "YES" }, { "input": "6 43 0 10 6", "output": "NO" }, { "input": "6 30 30 1 11", "output": "YES" }, { "input": "11 59 59 11 12", "output": "YES" }, { "input": "5 45 35 9 5", "output": "NO" }, { "input": "2 43 4 9 7", "output": "NO" }, { "input": "12 30 50 6 9", "output": "NO" }, { "input": "1 10 1 2 3", "output": "NO" }, { "input": "10 5 55 9 1", "output": "NO" }, { "input": "1 59 59 2 3", "output": "YES" }, { "input": "1 49 14 10 3", "output": "NO" }, { "input": "3 15 15 2 4", "output": "YES" }, { "input": "10 5 55 1 5", "output": "NO" }, { "input": "6 33 45 12 6", "output": "YES" }, { "input": "1 20 20 11 1", "output": "YES" }, { "input": "2 30 45 1 11", "output": "YES" }, { "input": "1 55 1 11 10", "output": "YES" }, { "input": "3 0 1 11 1", "output": "NO" }, { "input": "1 5 6 1 12", "output": "YES" }, { "input": "12 10 5 11 4", "output": "YES" }, { "input": "6 5 59 12 1", "output": "YES" }, { "input": "12 0 20 11 12", "output": "YES" }, { "input": "3 25 30 4 5", "output": "YES" }, { "input": "2 15 18 11 1", "output": "YES" }, { "input": "12 5 48 11 9", "output": "NO" }, { "input": "6 30 30 10 2", "output": "YES" }, { "input": "1 0 11 1 2", "output": "NO" }, { "input": "10 0 1 10 11", "output": "NO" }, { "input": "3 30 45 10 1", "output": "YES" }, { "input": "11 21 56 3 12", "output": "YES" }, { "input": "3 16 16 3 4", "output": "YES" }, { "input": "11 55 55 1 12", "output": "YES" }, { "input": "12 12 12 11 12", "output": "YES" }, { "input": "3 5 1 1 2", "output": "NO" }, { "input": "3 30 45 10 11", "output": "YES" }, { "input": "10 0 1 9 10", "output": "YES" }, { "input": "3 0 5 3 6", "output": "NO" }, { "input": "1 1 49 1 10", "output": "NO" }, { "input": "9 45 15 11 12", "output": "YES" }, { "input": "12 15 59 3 8", "output": "NO" }, { "input": "5 0 5 3 6", "output": "NO" }, { "input": "3 30 45 1 2", "output": "YES" }, { "input": "2 10 11 2 4", "output": "YES" }, { "input": "2 10 10 4 3", "output": "YES" }, { "input": "3 30 59 1 2", "output": "YES" }, { "input": "11 59 59 12 11", "output": "YES" }, { "input": "10 25 50 5 6", "output": "NO" }, { "input": "6 30 30 9 3", "output": "YES" }, { "input": "8 14 40 12 3", "output": "NO" }, { "input": "2 10 10 1 6", "output": "YES" } ]	1,507,189,764	2,664	Python 3	WRONG_ANSWER	PRETESTS	6	77	204,800	h,m,s,t1,t2 = map(int, input().split()) if(h==12): h=0 h = h6060 + m60 + s m /= 60 m = 12 m = m6060 + s s /= 60 s = 12 s = s6060 if(t1==12): t1=0 if(t2==12): t2=0 t1 = t16060 t2 = t26060 #print(h,m,s,t1,t2) i = t2 once = True while(True): if i==h or i==m or i==s: break i+=1 if i==126060: if once: i = 0 once = False else: break if i==t1: print("YES") exit(0) i = t1 once = True while(True): if i==h or i==m or i==s: break i+=1 if i==1260*60: if once: i = 0 once = False else: break if i==t2: print("YES") exit(0) print("NO")	Title: Race Against Time Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. The 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. Last time Misha talked with the coordinator at t1 o'clock, so now he stands on the number t1 on the clock face. The contest should be ready by t2 o'clock. In the terms of paradox it means that Misha has to go to number t2 somehow. Note that he doesn't have to move forward only: in these circumstances time has no direction. Clock 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). Given the hands' positions, t1, and t2, find if Misha can prepare the contest on time (or should we say on space?). That is, find if he can move from t1 to t2 by the clock face. Input Specification: Five integers h, m, s, t1, t2 (1<=≤<=h<=≤<=12, 0<=≤<=m,<=s<=≤<=59, 1<=≤<=t1,<=t2<=≤<=12, t1<=≠<=t2). Misha's position and the target time do not coincide with the position of any hand. Output Specification: Print "YES" (quotes for clarity), if Misha can prepare the contest on time, and "NO" otherwise. You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES"). Demo Input: ['12 30 45 3 11\n', '12 0 1 12 1\n', '3 47 0 4 9\n'] Demo Output: ['NO\n', 'YES\n', 'YES\n'] Note: The three examples are shown on the pictures below from left to right. The starting position of Misha is shown with green, the ending position is shown with pink. Note that the positions of the hands on the pictures are not exact, but are close to the exact and the answer is the same.	```python h,m,s,t1,t2 = map(int, input().split()) if(h==12): h=0 h = h6060 + m60 + s m /= 60 m = 12 m = m6060 + s s /= 60 s = 12 s = s6060 if(t1==12): t1=0 if(t2==12): t2=0 t1 = t16060 t2 = t26060 #print(h,m,s,t1,t2) i = t2 once = True while(True): if i==h or i==m or i==s: break i+=1 if i==126060: if once: i = 0 once = False else: break if i==t1: print("YES") exit(0) i = t1 once = True while(True): if i==h or i==m or i==s: break i+=1 if i==1260*60: if once: i = 0 once = False else: break if i==t2: print("YES") exit(0) print("NO") ```	0
38	F	Smart Boy	PROGRAMMING	2,100	[ "dp", "games", "strings" ]	F. Smart Boy	4	256	Once Petya and Vasya invented a new game and called it "Smart Boy". They located a certain set of words — the dictionary — for the game. It is admissible for the dictionary to contain similar words. The rules of the game are as follows: first the first player chooses any letter (a word as long as 1) from any word from the dictionary and writes it down on a piece of paper. The second player adds some other letter to this one's initial or final position, thus making a word as long as 2, then it's the first player's turn again, he adds a letter in the beginning or in the end thus making a word as long as 3 and so on. But the player mustn't break one condition: the newly created word must be a substring of a word from a dictionary. The player who can't add a letter to the current word without breaking the condition loses. Also if by the end of a turn a certain string s is written on paper, then the player, whose turn it just has been, gets a number of points according to the formula: where - is a sequence number of symbol c in Latin alphabet, numbered starting from 1. For example, , and . - is the number of words from the dictionary where the line s occurs as a substring at least once. Your task is to learn who will win the game and what the final score will be. Every player plays optimally and most of all tries to win, then — to maximize the number of his points, then — to minimize the number of the points of the opponent.	The first input line contains an integer n which is the number of words in the located dictionary (1<=≤<=n<=≤<=30). The n lines contain the words from the dictionary — one word is written on one line. Those lines are nonempty, consisting of Latin lower-case characters no longer than 30 characters. Equal words can be in the list of words.	On the first output line print a line "First" or "Second" which means who will win the game. On the second line output the number of points of the first player and the number of points of the second player after the game ends. Separate the numbers by a single space.	[ "2\naba\nabac\n", "3\nartem\nnik\nmax\n" ]	[ "Second\n29 35\n", "First\n2403 1882\n" ]	none	0	[ { "input": "2\naba\nabac", "output": "Second\n29 35" }, { "input": "3\nartem\nnik\nmax", "output": "First\n2403 1882" }, { "input": "1\njyi", "output": "First\n1727 876" }, { "input": "2\naz\nkagim", "output": "First\n1082 678" }, { "input": "3\nskz\nsauy\nrxu", "output": "First\n2134 963" }, { "input": "6\nrdxo\nvpe\npa\nlrlqy\nzj\nicbdch", "output": "First\n4078 2852" }, { "input": "8\nvvdclj\nyvb\nhelty\nb\na\nzwyuvkl\nspqtnqmlx\nrghfmkbt", "output": "First\n10133 8044" }, { "input": "10\nndqlxtrxiftvtji\naoblenbunumdge\nlgkmt\nx\nx\nbg\nds\nnlhdlxeh\nugxufipnaxvkxl\nk", "output": "First\n26161 23191" }, { "input": "14\nym\nbi\nyu\nyb\nvwtb\nsemn\nbyr\nc\nir\nqyx\ngnk\nao\ndzeo\ncd", "output": "First\n2228 1226" }, { "input": "17\ny\nn\njpt\nk\npn\ncphdbn\nvw\nkkip\nhj\ndptlo\notkjxvs\nnkf\ns\nvglbf\nqytz\ncbsvhky\nsf", "output": "First\n7108 5451" }, { "input": "21\nqiiviv\nufvefasdsvaescpjcbaqzszxwrhvqv\nwtcphrk\necxdlrtyftzshnwrieuspjdgfeo\nbmllyuqtxlgjgzzimhwatvzyorknsk\nykqctolfxuomdeqgavelavo\ngklswtnxlir\nguqxequvcapfa\nfdh\ngs\ntxjabkdhaiiaxxelvu\nllmfjnjyzqxu\nttdxkepyoexfrmfbtbrihbdeh\npinksrhsptdtxduxazeqvuvp\nxzsdqyxmocxh\nhyxujcokgjsgqe\nenatexhzy\nihfmbpwmvjfbprw\nnlktmgjnvgjvsulzjehygdjliyb\nwllknlhimuxtmccqkxedlyr\njqqhombitbyouhsrnszrnvvhirnjdx", "output": "Second\n98771 105081" }, { "input": "23\ndcpnjubpjzsl\nngjriwa\nusoctpzjlnm\na\ncdwgavsnnxfyxra\nxpbbbmvsveen\naoimjmsbjedryewog\nduivkwfrxxkrfqcyb\nadvttzqrztsoysddhg\ndowgfmzitsxzfwcrl\noedzctovdfcmnyxo\ndugtkselxsad\nnwopexs\ncrsbpqtwynunf\nzoue\nimpwuhy\npvlsjchpic\nkprgfngigrvpnhjh\nvmxpckkagbvwarig\nhxemegdijylqcfevnvv\nmwln\nqwtos\ntpcgunugerj", "output": "Second\n40314 43585" }, { "input": "25\ncwvkubhsyfcc\naozqfobjrknitn\ndrgymqrbecum\nsmjnogaewohzquk\nnr\nt\nadnuduxdbgivwwlac\ncgypvxjlqztw\nzuukgmzszyxkolf\nyebejdewaqgx\nkxrhkkuuyzlxfojvjftj\nectwyvfwxctfohsuloyebz\nwcjowbrckawmn\nohhpbbfqqnhqmgjxa\noabbtzpmdcpxqo\nmqwh\nnjlonviiqklchdxivfryjyafi\niobcqnbhhqcqigoy\nmtqhfgkhbckhspoc\nwrcloqcxqwxatt\nfnko\niddycfjurpbtohwn\ngagxcaemumdzcezomoyfybiel\nbp\ncsctsfhaeuiyppncjdaswal", "output": "Second\n51645 55834" }, { "input": "27\nlt\nah\nnyypr\nsdz\nx\nvvkha\ned\njanf\nvooha\nvlmbs\nx\nsc\nwa\nybw\nks\nzlyh\ndx\nlwcrpm\nrnfsxa\nhk\ncshnnj\nzgcjb\ndnmywn\nc\nhntkdz\nozmwc\nqtjsvm", "output": "First\n3713 3070" }, { "input": "29\naoqwskoxmfwgle\nzvbeh\nplxky\nlcffeat\nellzisjlkbku\nerurzkthfrdezw\nviduzqepcw\njlsfpbcqqbppr\nisjankri\nw\ntru\nlxxa\nqgrcfdvano\novmijyguu\nbtij\nxkanw\nj\nswythhpaxqejjv\ngiskgeyfsogvj\nlcokosfueesvg\niitydcqlrs\neoct\nwappyw\nqmkwysh\nattoqplskxknh\nbbtfmiidohu\naqbibzifasq\noueseyzgxteg\nuewjwf", "output": "Second\n21124 23641" }, { "input": "30\nzxneuq\nyilmxietdbckayhytgzxwaljwt\nltdsdevcxvfipx\nsvjaldamiuyu\nfkskty\nvncmdfvpoj\nuvlrgfcnscdprkplinixbyuspjcgl\nowptmymdqdxuktvn\nsnejsi\nqlbbesuzunwpaglrqwfzjot\nvqebyeovepgxxmdqigfskvsied\nnfsi\nt\nn\nxlupusurwagdbkxwjakxxireu\nhkobxeywunitn\nlxmhzllqcashkgfikwdgpynbdrpg\nbpumtkhjmfcdnhsmztdkhcvrsa\nvhvigklxcmfx\nfhqlddgaigtehxnccdqsoqj\npi\ngkeldxudfjfwakwyqsthudsyn\ndyokwhdyzqtnsbhigvcizhgdrwsay\nukesuu\nfvgfnaavz\nsxxdftkbqcbsuzahxnnw\nzefl\nwodbjmyqylakjl\ndtsarp\nonafvhikbmeip", "output": "Second\n66841 71774" }, { "input": "1\nbah", "output": "First\n154 73" }, { "input": "2\nfa\nqopji", "output": "First\n2247 1532" }, { "input": "3\ndda\neeec\naac", "output": "First\n54 33" }, { "input": "6\njhfa\nbde\nbi\nfddgc\ndb\ngchfeh", "output": "First\n326 226" }, { "input": "8\nheehgg\nfcd\nfebgh\na\ng\ncdfdbgh\ngbfbdgagc\neeebheah", "output": "First\n772 619" }, { "input": "10\naddlkgekifgigji\nabbleabhahmdge\nlgkmg\nk\nk\nbg\ndf\nalhdlkeh\nhgkhficaakikkl\nk", "output": "First\n5790 5223" }, { "input": "14\nym\nbi\nyu\nyb\nvwtb\nsemn\nbyr\nc\nir\nqyx\ngnk\nao\ndzeo\ncd", "output": "First\n2228 1226" }, { "input": "17\ns\nj\npjb\ng\ndt\nmdjnld\npq\nqoep\ntj\ntnjno\nqtqlpje\nbon\nm\nrmbrn\nseth\nolsjdqg\ngl", "output": "First\n2091 1478" }, { "input": "21\nkkidkd\niddefmglgbegccndkbkcnkjjmfnfgn\nancndbe\ncmbhlfbmjfnajhadceainnbcdia\nnaflkccdnbkdgljgcnkgfhbcglchec\negkmlkbbhmgihmkiininafm\nealgijhnlej\nmaefmeebmcfji\njld\nci\nddhejghdeeiiljijhm\njhillhlcnkli\nlnhlgcfggajdfmdhnffabnhcd\njkbiiblgnlnlndmfcfgalefl\nbjmhemleakhj\njmbmnckmmjieag\nmbgfmjjhi\nejlmfbeijnbhlfk\nlhkjegnfdgfbmejfjghcenhnagh\nadbandfkmmllcicialadbml\nbegbegjkllggmfmfdcbnhnldmlhnnd", "output": "Second\n29652 31262" }, { "input": "23\nhaighjikbbgj\nkcjcbaa\nhebgcbchcba\nb\ncgbeecjggfbgcig\nijhgkjfcchcf\nagaiggjihheaefjfc\ndhjcdaeecekaeacij\nkiicjgjiijbbkaejee\njchjghgfigbffjegh\nfjjaeijgfjdhjfjb\nbfeceeijbiff\nbdkcgfd\njegfkdgaigkgd\ncefc\nkfhkdia\nigidahghij\nbedfadbeifkgcjcd\nkfbejcafkdfhighb\nihbhahhdhfhkcakcfce\nhhdi\nekjgf\ndbdkdjcadcc", "output": "Second\n7061 7665" }, { "input": "25\naaaabaababaa\nabaabbaaabbaaa\nbbbbbbbababa\nabbbbaabababbab\nab\na\naabbababbabbaabbb\nbbbbbbbabbbb\nbabbbaaababbaab\naabbbaabbbaa\nbaabbbbaabbabaaaabaa\nbabaabaaabaabaaabaaaba\nbbabbaaaabbbb\nabababbbbbaaaaaab\nbbabbbabaaaaaa\naaaa\naabbabbababbbaabbbbbaabaa\nbabbbbabbaaabaab\nbaabbbbaabbbabaa\nbabaaabaaaaaaa\nbaab\nabbbbaaabbabaaaa\naaaaaabaaabbbaaababaaaaba\naa\nbbbbbbaaabbbabbabbaaaaa", "output": "Second\n386 400" }, { "input": "27\naa\naa\naaaaa\naaa\na\naaaaa\naa\naaaa\naaaaa\naaaaa\na\naa\naa\naaa\naa\naaaa\naa\naaaaaa\naaaaaa\naa\naaaaaa\naaaaa\naaaaaa\na\naaaaaa\naaaaa\naaaaaa", "output": "Second\n64 56" }, { "input": "29\naagegiifchaiba\nddfib\nfjbae\nbcbfaab\nifhfaahdejgc\nabibdgjjdffibi\nhijadagbgc\nhbihfbicafhjf\naadcfgbi\na\ndhe\nfdbi\nighefjfgdc\ngbccbiiec\nddaj\nbiedi\nf\neegjjdhediajfj\neiacgcajiigfd\njacgaefigaihc\ncifefcgjfi\ngicd\niajhgc\neiciegf\ngddeihhegjifb\nbdfdaichihe\nagjgddifaai\nacgicififbea\ncgejgf", "output": "Second\n3472 3989" }, { "input": "30\nzxneuq\nyilmxietdbckayhytgzxwaljwt\nltdsdevcxvfipx\nsvjaldamiuyu\nfkskty\nvncmdfvpoj\nuvlrgfcnscdprkplinixbyuspjcgl\nowptmymdqdxuktvn\nsnejsi\nqlbbesuzunwpaglrqwfzjot\nvqebyeovepgxxmdqigfskvsied\nnfsi\nt\nn\nxlupusurwagdbkxwjakxxireu\nhkobxeywunitn\nlxmhzllqcashkgfikwdgpynbdrpg\nbpumtkhjmfcdnhsmztdkhcvrsa\nvhvigklxcmfx\nfhqlddgaigtehxnccdqsoqj\npi\ngkeldxudfjfwakwyqsthudsyn\ndyokwhdyzqtnsbhigvcizhgdrwsay\nukesuu\nfvgfnaavz\nsxxdftkbqcbsuzahxnnw\nzefl\nwodbjmyqylakjl\ndtsarp\nonafvhikbmeip", "output": "Second\n66841 71774" }, { "input": "1\njyix", "output": "Second\n2028 2494" }, { "input": "2\nazokag\nmsbwcc", "output": "Second\n3435 4033" }, { "input": "3\nskzv\nauyi\nxurr", "output": "Second\n2212 3278" }, { "input": "6\nrdxoovp\nypailrl\nytzjeic\ndchjlwe\ncwcnydr\nasoholv", "output": "First\n7310 5775" }, { "input": "8\nvvdcljyyvb\nheltysbaay\nwyuvklospq\nnqmlxrrghf\nkbtdbmyhqo\nwdxflksybp\nxzvxwowusn\nfcpjbkjogr", "output": "Second\n14851 17399" }, { "input": "10\nndqlxtrxiftvtji\naoblenbunumdgeq\ngkmtexexnbghdsf\nlhdlxehgugxufip\naxvkxlokduwvica\nvlfllkwmdmdgbpl\njqeidohmzybxpqr\nlzspixmvwcidicp\nlvfhgjjfnlvgbtn\nznlorgtqbgdaamc", "output": "First\n27232 23745" }, { "input": "14\nymrb\nkyuh\nbivw\nbpse\nnqby\ntcgi\nxqyx\ngnks\noddz\nowcd\nzkso\nqunm\nnlhj\nkbwy", "output": "Second\n2281 3477" }, { "input": "17\nybnejpt\nkcpntcp\ndbngvwx\nkipshjb\nptlopot\njxvslnk\nqszvglb\nfqytzgc\nsvhkyys\nomkemoj\nfqebrzv\nhltucwh\nvxfkezp\nmilusjz\nggqoyjd\nolddacs\ndrrpogu", "output": "First\n7652 6042" }, { "input": "23\ndcpnjubpjzslsngjriwa\nusoctpzjlnmgamcdwgav\nnnxfyxrarxpbbbmvsvee\ncaoimjmsbjedryewogkd\nivkwfrxxkrfqcybxadvt\nzqrztsoysddhgedowgfm\nitsxzfwcrlhoedzctovd\ncmnyxoxdugtkselxsady\nwopexswcrsbpqtwynunf\nzouekimpwuhyxpvlsjch\nicbkprgfngigrvpnhjhb\nmxpckkagbvwarigehxem\ngdijylqcfevnvvrmwlng\nwtosctpcgunugerjwbue\ngnsxxlnlsmtldqljzlhk\ntyxvfoqedvhaskmdlnkz\nlzgjqzjljybhtlvgtiom\nizbdtgusykrvpneaevre\njhitxwmhgtvlzciturzj\nwvkblkfchdbysofsysal\nzfuuhnvwmdkeieplbzxo\nhpsksnyfuvgumpzicjmk\nzemvrskfmxnuyhngpdnk", "output": "Second\n44213 47783" }, { "input": "27\nltzahq\nyyprgs\nzoxgvv\nhajedf\nanfovo\nhasvlm\nscxzsc\nwayybw\nkshzly\npdxhlw\nrpmzrn\nsxanhk\ncshnnj\nzgcjbb\nnmywnu\nrhntkd\naozmwc\nqtjsvm\nxidtfw\nsofbnn\npcdlql\nqsjeqp\nhtuyki\ncdjgsu\ntezxuw\nakxtwp\nmnjmhf", "output": "Second\n5106 6841" }, { "input": "29\naoqwskoxmfwgle\nzvbehgplxkyslc\nfeatnellzisjlk\nkuderurzkthfrd\nzwtviduzqepcws\nlsfpbcqqbpprpi\njankriawqtrufl\nxalqgrcfdvanoq\nvmijyguurbtije\nkanwejlswythhp\nxqejjvsgiskgey\nsogvjglcokosfu\nesvghiitydcqlr\nveoctpwappywoq\nkwyshyattoqpls\nxknhmbbtfmiido\nugaqbibzifasqz\nueseyzgxteglue\njwfysnlsuillhx\nimyvaxipieeoep\nxpplmyvmcidvve\nklcdsrgfpjmvlm\ndybyrfhbdorhps\nvmmqvwbipgaymk\nnwbaunaexdcqdu\nsgpcdvduyasovt\nkxbdmtpcqrlnxh\ntjgszfpsmupvwg\nqlknktnpkxcqrv", "output": "Second\n23205 25851" }, { "input": "1\nbahf", "output": "Second\n186 250" }, { "input": "2\nfapqop\nidoidh", "output": "Second\n2213 2859" }, { "input": "3\nddaa\neecd\nacce", "output": "Second\n93 137" }, { "input": "6\njhfaebd\nibiifdd\ncddbegc\nfehfhae\ngegdehj\ngiidihb", "output": "First\n1135 843" }, { "input": "8\nheehggffcd\nfebghhaggd\ndfdbghggbf\ndgagcfeeeb\neahgeghfbh\negcffcfhgd\ndbgfhfcfbb\nhfbfeeadfd", "output": "Second\n1316 1552" }, { "input": "10\naddlkgekifgigji\nabbleabhahmdged\ngkmgekekabghdff\nlhdlkehghgkhfic\nakikklbkdhjiica\nilfllkjmdmdgbcl\njdeidbhmmlbkcde\nlmfcikmijcidicc\nlifhgjjfaligbga\nmalbeggdbgdaamc", "output": "First\n8086 7170" }, { "input": "14\nymrb\nkyuh\nbivw\nbpse\nnqby\ntcgi\nxqyx\ngnks\noddz\nowcd\nzkso\nqunm\nnlhj\nkbwy", "output": "Second\n2281 3477" }, { "input": "17\nsfjqpjb\ngadtbmd\nnldkpqt\noepmtjb\nnjnonqt\nlpjedbo\ngmtrmbr\nhsethmo\nsjdqgag\ncqsskmt\ndmmphjn\nfhjacet\njrhcmnf\nqsfeonr\nmsqkqrp\natdbmmi\nflbpgai", "output": "First\n4972 3905" }, { "input": "23\nhaighjikbbgjdkcjcbaa\nhebgcbchcbaabjcgbeec\nggfbgcigfijhgkjfcchc\ncagaiggjihheaefjfcid\njcdaeecekaeacijfkiic\ngjiijbbkaejeecjchjgh\nfigbffjeghdfjjaeijgf\ndhjfjbkbfeceeijbiffi\ndkcgfdejegfkdgaigkgd\ncefcikfhkdiajigidahg\nijfbedfadbeifkgcjcdc\nfbejcafkdfhighbcihbh\nhhdhfhkcakcfcefhhdig\nkjgfddbdkdjcadcceeec\nhhagagdkkchahdifhdfd\nadikadjeifekaajchdkd\njechjbfbjahgfidegaeb\njdbchegcidickgkgaegi\ngkcfbcciejaadfdjdcbj\ndfbfdbjbagjehcadbhdd\ndfeiecifgfdkbcjidfhg\nbegfhiciicgekkbiejci\ngcgabeajekcddhhfkhcd", "output": "Second\n8376 9086" }, { "input": "27\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa\naaaaaa", "output": "Second\n90 93" }, { "input": "29\naagegiifchaiba\nddfibgfjbaeibc\nfaabbifhfaahde\ngcfabibdgjjdff\nbifhijadagbgca\nbihfbicafhjfba\ndcfgbiiaidhebf\nbihighefjfgdce\nbccbiiechddaji\niedicfbeegjjdh\ndiajfjeeiacgca\niigfdcjacgaefi\naihcfcifefcgjf\ndgicdhiajhgcge\nciegfggddeihhe\njifbcbdfdaichi\necagjgddifaaif\ncgicififbeadcg\njgfggdbgaabbdf\naaghahghaegaaj\ndffdiehegihbbe\nehcdgfgfbdihfc\njihcdbhbhgbdbg\ndgcihadijcgcaa\nfabcajggbjiadg\negbebdfccccefj\najhfchfcihdffj\nhdaebdbeeijfeg\nijgfejbjajgcjd", "output": "Second\n3518 4020" } ]	1,682,055,215	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	21	248	8,806,400	n = int(input()) num = dict() for _ in range(n) : s = input() sub = set() for i in range(len(s)) : for j in range(i, len(s)) : sub.add(s[i:j+1]) for s in sub : if s in num : num[s] += 1 else : num[s] = 1 fs = dict() def f(s) : global fs if s in fs : return fs[s] ans = (False, 0, 0) for x in range(26) : c = chr(x + ord('a')) for t in [c + s, s + c] : if t in num : sm = 0 mx = 0 for c in t : sm += ord(c) - ord('a') + 1 mx = max(mx, ord(c) - ord('a') + 1) (win, a, b) = f(t) ans = max(ans, (not win, b + sm * mx + num[t], a)); fs[s] = ans return ans (win, a, b) = f('') if win : print('First') else : print('Second') print(a, b)	Title: Smart Boy Time Limit: 4 seconds Memory Limit: 256 megabytes Problem Description: Once Petya and Vasya invented a new game and called it "Smart Boy". They located a certain set of words — the dictionary — for the game. It is admissible for the dictionary to contain similar words. The rules of the game are as follows: first the first player chooses any letter (a word as long as 1) from any word from the dictionary and writes it down on a piece of paper. The second player adds some other letter to this one's initial or final position, thus making a word as long as 2, then it's the first player's turn again, he adds a letter in the beginning or in the end thus making a word as long as 3 and so on. But the player mustn't break one condition: the newly created word must be a substring of a word from a dictionary. The player who can't add a letter to the current word without breaking the condition loses. Also if by the end of a turn a certain string s is written on paper, then the player, whose turn it just has been, gets a number of points according to the formula: where - is a sequence number of symbol c in Latin alphabet, numbered starting from 1. For example, , and . - is the number of words from the dictionary where the line s occurs as a substring at least once. Your task is to learn who will win the game and what the final score will be. Every player plays optimally and most of all tries to win, then — to maximize the number of his points, then — to minimize the number of the points of the opponent. Input Specification: The first input line contains an integer n which is the number of words in the located dictionary (1<=≤<=n<=≤<=30). The n lines contain the words from the dictionary — one word is written on one line. Those lines are nonempty, consisting of Latin lower-case characters no longer than 30 characters. Equal words can be in the list of words. Output Specification: On the first output line print a line "First" or "Second" which means who will win the game. On the second line output the number of points of the first player and the number of points of the second player after the game ends. Separate the numbers by a single space. Demo Input: ['2\naba\nabac\n', '3\nartem\nnik\nmax\n'] Demo Output: ['Second\n29 35\n', 'First\n2403 1882\n'] Note: none	```python n = int(input()) num = dict() for _ in range(n) : s = input() sub = set() for i in range(len(s)) : for j in range(i, len(s)) : sub.add(s[i:j+1]) for s in sub : if s in num : num[s] += 1 else : num[s] = 1 fs = dict() def f(s) : global fs if s in fs : return fs[s] ans = (False, 0, 0) for x in range(26) : c = chr(x + ord('a')) for t in [c + s, s + c] : if t in num : sm = 0 mx = 0 for c in t : sm += ord(c) - ord('a') + 1 mx = max(mx, ord(c) - ord('a') + 1) (win, a, b) = f(t) ans = max(ans, (not win, b + sm * mx + num[t], a)); fs[s] = ans return ans (win, a, b) = f('') if win : print('First') else : print('Second') print(a, b) ```	0
873	A	Chores	PROGRAMMING	800	[ "implementation" ]		null	null	Luba has to do n chores today. i-th chore takes ai units of time to complete. It is guaranteed that for every the condition ai<=≥<=ai<=-<=1 is met, so the sequence is sorted. Also Luba can work really hard on some chores. She can choose not more than k any chores and do each of them in x units of time instead of ai (). Luba is very responsible, so she has to do all n chores, and now she wants to know the minimum time she needs to do everything. Luba cannot do two chores simultaneously.	The first line contains three integers n,<=k,<=x (1<=≤<=k<=≤<=n<=≤<=100,<=1<=≤<=x<=≤<=99) — the number of chores Luba has to do, the number of chores she can do in x units of time, and the number x itself. The second line contains n integer numbers ai (2<=≤<=ai<=≤<=100) — the time Luba has to spend to do i-th chore. It is guaranteed that , and for each ai<=≥<=ai<=-<=1.	Print one number — minimum time Luba needs to do all n chores.	[ "4 2 2\n3 6 7 10\n", "5 2 1\n100 100 100 100 100\n" ]	[ "13\n", "302\n" ]	In the first example the best option would be to do the third and the fourth chore, spending x = 2 time on each instead of a<sub class="lower-index">3</sub> and a<sub class="lower-index">4</sub>, respectively. Then the answer is 3 + 6 + 2 + 2 = 13. In the second example Luba can choose any two chores to spend x time on them instead of a<sub class="lower-index">i</sub>. So the answer is 100·3 + 2·1 = 302.	0	[ { "input": "4 2 2\n3 6 7 10", "output": "13" }, { "input": "5 2 1\n100 100 100 100 100", "output": "302" }, { "input": "1 1 1\n100", "output": "1" }, { "input": "100 1 99\n100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100", "output": "9999" }, { "input": "100 100 1\n100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100", "output": "100" }, { "input": "100 50 50\n51 51 52 53 55 55 55 55 56 56 56 57 57 58 58 59 59 59 60 60 61 61 62 62 63 64 64 64 64 65 65 65 65 66 66 66 67 68 68 68 69 69 70 70 70 70 71 71 71 71 71 71 72 72 76 76 76 76 77 79 79 81 81 81 81 82 82 82 82 83 84 85 86 87 87 88 88 88 89 89 89 90 90 90 91 91 91 92 92 93 95 95 96 96 96 97 97 98 99 100", "output": "5618" }, { "input": "100 100 1\n2 4 4 4 5 5 5 6 10 10 11 11 12 12 13 13 13 14 17 18 20 20 21 21 22 22 23 24 24 25 26 29 29 32 32 34 34 35 38 39 39 40 40 42 42 43 45 47 48 49 51 52 52 54 57 59 59 60 61 61 62 63 63 64 65 65 68 70 70 72 74 75 75 76 76 77 77 78 78 78 79 80 81 82 82 83 83 83 84 89 90 92 92 93 94 96 96 97 98 99", "output": "100" }, { "input": "100 1 1\n3 3 5 7 8 8 8 9 9 9 11 13 14 15 18 18 19 20 21 22 22 25 27 27 29 31 32 33 33 34 36 37 37 38 40 42 44 44 46 47 47 48 48 48 50 50 51 51 54 54 54 55 55 56 56 56 60 61 62 62 63 64 65 65 68 70 70 71 71 71 71 75 75 76 76 79 79 79 79 81 81 82 82 86 86 86 86 88 90 90 92 96 97 97 98 98 98 98 100 100", "output": "5202" }, { "input": "100 50 49\n50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51", "output": "4950" }, { "input": "100 50 1\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3", "output": "151" }, { "input": "100 1 1\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2", "output": "199" } ]	1,520,029,780	2,147,483,647	Python 3	OK	TESTS	11	62	5,632,000	if __name__ == "__main__": n, k, x = input().split() time =[int(x) for x in input().split()] total_time = 0 for i in range(int(n) - int(k)): total_time += time[i] total_time = total_time + int(k) * int(x) print(total_time)	Title: Chores Time Limit: None seconds Memory Limit: None megabytes Problem Description: Luba has to do n chores today. i-th chore takes ai units of time to complete. It is guaranteed that for every the condition ai<=≥<=ai<=-<=1 is met, so the sequence is sorted. Also Luba can work really hard on some chores. She can choose not more than k any chores and do each of them in x units of time instead of ai (). Luba is very responsible, so she has to do all n chores, and now she wants to know the minimum time she needs to do everything. Luba cannot do two chores simultaneously. Input Specification: The first line contains three integers n,<=k,<=x (1<=≤<=k<=≤<=n<=≤<=100,<=1<=≤<=x<=≤<=99) — the number of chores Luba has to do, the number of chores she can do in x units of time, and the number x itself. The second line contains n integer numbers ai (2<=≤<=ai<=≤<=100) — the time Luba has to spend to do i-th chore. It is guaranteed that , and for each ai<=≥<=ai<=-<=1. Output Specification: Print one number — minimum time Luba needs to do all n chores. Demo Input: ['4 2 2\n3 6 7 10\n', '5 2 1\n100 100 100 100 100\n'] Demo Output: ['13\n', '302\n'] Note: In the first example the best option would be to do the third and the fourth chore, spending x = 2 time on each instead of a<sub class="lower-index">3</sub> and a<sub class="lower-index">4</sub>, respectively. Then the answer is 3 + 6 + 2 + 2 = 13. In the second example Luba can choose any two chores to spend x time on them instead of a<sub class="lower-index">i</sub>. So the answer is 100·3 + 2·1 = 302.	```python if __name__ == "__main__": n, k, x = input().split() time =[int(x) for x in input().split()] total_time = 0 for i in range(int(n) - int(k)): total_time += time[i] total_time = total_time + int(k) * int(x) print(total_time) ```	3
779	A	Pupils Redistribution	PROGRAMMING	1,000	[ "constructive algorithms", "math" ]		null	null	In Berland each high school student is characterized by academic performance — integer value between 1 and 5. In high school 0xFF there are two groups of pupils: the group A and the group B. Each group consists of exactly n students. An academic performance of each student is known — integer value between 1 and 5. The school director wants to redistribute students between groups so that each of the two groups has the same number of students whose academic performance is equal to 1, the same number of students whose academic performance is 2 and so on. In other words, the purpose of the school director is to change the composition of groups, so that for each value of academic performance the numbers of students in both groups are equal. To achieve this, there is a plan to produce a series of exchanges of students between groups. During the single exchange the director selects one student from the class A and one student of class B. After that, they both change their groups. Print the least number of exchanges, in order to achieve the desired equal numbers of students for each academic performance.	The first line of the input contains integer number n (1<=≤<=n<=≤<=100) — number of students in both groups. The second line contains sequence of integer numbers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=5), where ai is academic performance of the i-th student of the group A. The third line contains sequence of integer numbers b1,<=b2,<=...,<=bn (1<=≤<=bi<=≤<=5), where bi is academic performance of the i-th student of the group B.	Print the required minimum number of exchanges or -1, if the desired distribution of students can not be obtained.	[ "4\n5 4 4 4\n5 5 4 5\n", "6\n1 1 1 1 1 1\n5 5 5 5 5 5\n", "1\n5\n3\n", "9\n3 2 5 5 2 3 3 3 2\n4 1 4 1 1 2 4 4 1\n" ]	[ "1\n", "3\n", "-1\n", "4\n" ]	none	500	[ { "input": "4\n5 4 4 4\n5 5 4 5", "output": "1" }, { "input": "6\n1 1 1 1 1 1\n5 5 5 5 5 5", "output": "3" }, { "input": "1\n5\n3", "output": "-1" }, { "input": "9\n3 2 5 5 2 3 3 3 2\n4 1 4 1 1 2 4 4 1", "output": "4" }, { "input": "1\n1\n2", "output": "-1" }, { "input": "1\n1\n1", "output": "0" }, { "input": "8\n1 1 2 2 3 3 4 4\n4 4 5 5 1 1 1 1", "output": "2" }, { "input": "10\n1 1 1 1 1 1 1 1 1 1\n2 2 2 2 2 2 2 2 2 2", "output": "5" }, { "input": "100\n5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5\n5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5", "output": "0" }, { "input": "2\n1 1\n1 1", "output": "0" }, { "input": "2\n1 2\n1 1", "output": "-1" }, { "input": "2\n2 2\n1 1", "output": "1" }, { "input": "2\n1 2\n2 1", "output": "0" }, { "input": "2\n1 1\n2 2", "output": "1" }, { "input": "5\n5 5 5 5 5\n5 5 5 5 5", "output": "0" }, { "input": "5\n5 5 5 3 5\n5 3 5 5 5", "output": "0" }, { "input": "5\n2 3 2 3 3\n2 3 2 2 2", "output": "1" }, { "input": "5\n4 4 1 4 2\n1 2 4 2 2", "output": "1" }, { "input": "50\n4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4\n4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4", "output": "0" }, { "input": "50\n1 3 1 3 3 3 1 3 3 3 3 1 1 1 3 3 3 1 3 1 1 1 3 1 3 1 3 3 3 1 3 1 1 3 3 3 1 1 1 1 3 3 1 1 1 3 3 1 1 1\n1 3 1 3 3 1 1 3 1 3 3 1 1 1 1 3 3 1 3 1 1 3 1 1 3 1 1 1 1 3 3 1 3 3 3 3 1 3 3 3 3 3 1 1 3 3 1 1 3 1", "output": "0" }, { "input": "50\n1 1 1 4 1 1 4 1 4 1 1 4 1 1 4 1 1 4 1 1 4 1 4 4 4 1 1 4 1 4 4 4 4 4 4 4 1 4 1 1 1 1 4 1 4 4 1 1 1 4\n1 4 4 1 1 4 1 4 4 1 1 4 1 4 1 1 4 1 1 1 4 4 1 1 4 1 4 1 1 4 4 4 4 1 1 4 4 1 1 1 4 1 4 1 4 1 1 1 4 4", "output": "0" }, { "input": "50\n3 5 1 3 3 4 3 4 2 5 2 1 2 2 5 5 4 5 4 2 1 3 4 2 3 3 3 2 4 3 5 5 5 5 5 5 2 5 2 2 5 4 4 1 5 3 4 2 1 3\n3 5 3 2 5 3 4 4 5 2 3 4 4 4 2 2 4 4 4 3 3 5 5 4 3 1 4 4 5 5 4 1 2 5 5 4 1 2 3 4 5 5 3 2 3 4 3 5 1 1", "output": "3" }, { "input": "100\n5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5\n5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5", "output": "0" }, { "input": "100\n1 1 3 1 3 1 1 3 1 1 3 1 3 1 1 3 3 3 3 3 3 3 3 3 3 3 3 1 3 3 1 1 1 3 1 1 1 3 1 1 3 3 1 3 3 1 3 1 3 3 3 3 1 1 3 3 3 1 1 3 1 3 3 3 1 3 3 3 3 3 1 3 3 3 3 1 3 1 3 3 3 3 3 3 3 3 1 3 3 3 3 3 3 3 1 1 3 1 1 1\n1 1 1 3 3 3 3 3 3 3 1 3 3 3 1 3 3 3 3 3 3 1 3 3 1 3 3 1 1 1 3 3 3 3 3 3 3 1 1 3 3 3 1 1 3 3 1 1 1 3 3 3 1 1 3 1 1 3 3 1 1 3 3 3 3 3 3 1 3 3 3 1 1 3 3 3 1 1 3 3 1 3 1 3 3 1 1 3 3 1 1 3 1 3 3 3 1 3 1 3", "output": "0" }, { "input": "100\n2 4 5 2 5 5 4 4 5 4 4 5 2 5 5 4 5 2 5 2 2 4 5 4 4 4 2 4 2 2 4 2 4 2 2 2 4 5 5 5 4 2 4 5 4 4 2 5 4 2 5 4 5 4 5 4 5 5 5 4 2 2 4 5 2 5 5 2 5 2 4 4 4 5 5 2 2 2 4 4 2 2 2 5 5 2 2 4 5 4 2 4 4 2 5 2 4 4 4 4\n4 4 2 5 2 2 4 2 5 2 5 4 4 5 2 4 5 4 5 2 2 2 2 5 4 5 2 4 2 2 5 2 5 2 4 5 5 5 2 5 4 4 4 4 5 2 2 4 2 4 2 4 5 5 5 4 5 4 5 5 5 2 5 4 4 4 4 4 2 5 5 4 2 4 4 5 5 2 4 4 4 2 2 2 5 4 2 2 4 5 4 4 4 4 2 2 4 5 5 2", "output": "0" }, { "input": "100\n3 3 4 3 3 4 3 1 4 2 1 3 1 1 2 4 4 4 4 1 1 4 1 4 4 1 1 2 3 3 3 2 4 2 3 3 3 1 3 4 2 2 1 3 4 4 3 2 2 2 4 2 1 2 1 2 2 1 1 4 2 1 3 2 4 4 4 2 3 1 3 1 3 2 2 2 2 4 4 1 3 1 1 4 2 3 3 4 4 2 4 4 2 4 3 3 1 3 2 4\n3 1 4 4 2 1 1 1 1 1 1 3 1 1 3 4 3 2 2 4 2 1 4 4 4 4 1 2 3 4 2 3 3 4 3 3 2 4 2 2 2 1 2 4 4 4 2 1 3 4 3 3 4 2 4 4 3 2 4 2 4 2 4 4 1 4 3 1 4 3 3 3 3 1 2 2 2 2 4 1 2 1 3 4 3 1 3 3 4 2 3 3 2 1 3 4 2 1 1 2", "output": "0" }, { "input": "100\n2 4 5 2 1 5 5 2 1 5 1 5 1 1 1 3 4 5 1 1 2 3 3 1 5 5 4 4 4 1 1 1 5 2 3 5 1 2 2 1 1 1 2 2 1 2 4 4 5 1 3 2 5 3 5 5 3 2 2 2 1 3 4 4 4 4 4 5 3 1 4 1 5 4 4 5 4 5 2 4 4 3 1 2 1 4 5 3 3 3 3 2 2 2 3 5 3 1 3 4\n3 2 5 1 5 4 4 3 5 5 5 2 1 4 4 3 2 3 3 5 5 4 5 5 2 1 2 4 4 3 5 1 1 5 1 3 2 5 2 4 4 2 4 2 4 2 3 2 5 1 4 4 1 1 1 5 3 5 1 1 4 5 1 1 2 2 5 3 5 1 1 1 2 3 3 2 3 2 4 4 5 4 2 1 3 4 1 1 2 4 1 5 3 1 2 1 3 4 1 3", "output": "0" }, { "input": "100\n5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5\n5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5", "output": "0" }, { "input": "100\n1 4 4 1 4 4 1 1 4 1 1 1 1 4 4 4 4 1 1 1 1 1 1 4 4 4 1 1 4 4 1 1 1 1 4 4 4 4 4 1 1 4 4 1 1 1 4 1 1 1 1 4 4 4 4 4 4 1 4 4 4 4 1 1 1 4 1 4 1 1 1 1 4 1 1 1 4 4 4 1 4 4 1 4 4 4 4 4 1 4 1 1 4 1 4 1 1 1 4 4\n4 1 1 4 4 4 1 4 4 4 1 1 4 1 1 4 1 4 4 4 1 1 4 1 4 1 1 1 4 4 1 4 1 4 1 4 4 1 1 4 1 4 1 1 1 4 1 4 4 4 1 4 1 4 4 4 4 1 4 1 1 4 1 1 4 4 4 1 4 1 4 1 4 4 4 1 1 4 1 4 4 4 4 1 1 1 1 1 4 4 1 4 1 4 1 1 1 4 4 1", "output": "1" }, { "input": "100\n5 2 5 2 2 3 3 2 5 3 2 5 3 3 3 5 2 2 5 5 3 3 5 3 2 2 2 3 2 2 2 2 3 5 3 3 2 3 2 5 3 3 5 3 2 2 5 5 5 5 5 2 3 2 2 2 2 3 2 5 2 2 2 3 5 5 5 3 2 2 2 3 5 3 2 5 5 3 5 5 5 3 2 5 2 3 5 3 2 5 5 3 5 2 3 3 2 2 2 2\n5 3 5 3 3 5 2 5 3 2 3 3 5 2 5 2 2 5 2 5 2 5 3 3 5 3 2 2 2 3 5 3 2 2 3 2 2 5 5 2 3 2 3 3 5 3 2 5 2 2 2 3 3 5 3 3 5 2 2 2 3 3 2 2 3 5 3 5 5 3 3 2 5 3 5 2 3 2 5 5 3 2 5 5 2 2 2 2 3 2 2 5 2 5 2 2 3 3 2 5", "output": "1" }, { "input": "100\n4 4 5 4 3 5 5 2 4 5 5 5 3 4 4 2 5 2 5 3 3 3 3 5 3 2 2 2 4 4 4 4 3 3 4 5 3 2 2 2 4 4 5 3 4 5 4 5 5 2 4 2 5 2 3 4 4 5 2 2 4 4 5 5 5 3 5 4 5 5 5 4 3 3 2 4 3 5 5 5 2 4 2 5 4 3 5 3 2 3 5 2 5 2 2 5 4 5 4 3\n5 4 2 4 3 5 2 5 5 3 4 5 4 5 3 3 5 5 2 3 4 2 3 5 2 2 2 4 2 5 2 4 4 5 2 2 4 4 5 5 2 3 4 2 4 5 2 5 2 2 4 5 5 3 5 5 5 4 3 4 4 3 5 5 3 4 5 3 2 3 4 3 4 4 2 5 3 4 5 5 3 5 3 3 4 3 5 3 2 2 4 5 4 5 5 2 3 4 3 5", "output": "1" }, { "input": "100\n1 4 2 2 2 1 4 5 5 5 4 4 5 5 1 3 2 1 4 5 2 3 4 4 5 4 4 4 4 5 1 3 5 5 3 3 3 3 5 1 4 3 5 1 2 4 1 3 5 5 1 3 3 3 1 3 5 4 4 2 2 5 5 5 2 3 2 5 1 3 5 4 5 3 2 2 3 2 3 3 2 5 2 4 2 3 4 1 3 1 3 1 5 1 5 2 3 5 4 5\n1 2 5 3 2 3 4 2 5 1 2 5 3 4 3 3 4 1 5 5 1 3 3 1 1 4 1 4 2 5 4 1 3 4 5 3 2 2 1 4 5 5 2 3 3 5 5 4 2 3 3 5 3 3 5 4 4 5 3 5 1 1 4 4 4 1 3 5 5 5 4 2 4 5 3 2 2 2 5 5 5 1 4 3 1 3 1 2 2 4 5 1 3 2 4 5 1 5 2 5", "output": "1" }, { "input": "100\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3", "output": "0" }, { "input": "100\n5 2 2 2 5 2 5 5 5 2 5 2 5 5 5 5 5 5 2 2 2 5 5 2 5 2 2 5 2 5 5 2 5 2 5 2 5 5 5 5 5 2 2 2 2 5 5 2 5 5 5 2 5 5 5 2 5 5 5 2 2 2 5 2 2 2 5 5 2 5 5 5 2 5 2 2 5 2 2 2 5 5 5 5 2 5 2 5 2 2 5 2 5 2 2 2 2 5 5 2\n5 5 2 2 5 5 2 5 2 2 5 5 5 5 2 5 5 2 5 2 2 5 2 2 5 2 5 2 2 5 2 5 2 5 5 2 2 5 5 5 2 5 5 2 5 5 5 2 2 5 5 5 2 5 5 5 2 2 2 5 5 5 2 2 5 5 2 2 2 5 2 5 5 2 5 2 5 2 2 5 5 2 2 5 5 2 2 5 2 2 5 2 2 2 5 5 2 2 2 5", "output": "1" }, { "input": "100\n3 3 2 2 1 2 3 3 2 2 1 1 3 3 1 1 1 2 1 2 3 2 3 3 3 1 2 3 1 2 1 2 3 3 2 1 1 1 1 1 2 2 3 2 1 1 3 3 1 3 3 1 3 1 3 3 3 2 1 2 3 1 3 2 2 2 2 2 2 3 1 3 1 2 2 1 2 3 2 3 3 1 2 1 1 3 1 1 1 2 1 2 2 2 3 2 3 2 1 1\n1 3 1 2 1 1 1 1 1 2 1 2 1 3 2 2 3 2 1 1 2 2 2 1 1 3 2 3 2 1 2 2 3 2 3 1 3 1 1 2 3 1 2 1 3 2 1 2 3 2 3 3 3 2 2 2 3 1 3 1 1 2 1 3 1 3 1 3 3 3 1 3 3 2 1 3 3 3 3 3 2 1 2 2 3 3 2 1 2 2 1 3 3 1 3 2 2 1 1 3", "output": "1" }, { "input": "100\n5 3 3 2 5 3 2 4 2 3 3 5 3 4 5 4 3 3 4 3 2 3 3 4 5 4 2 4 2 4 5 3 3 4 5 3 5 3 5 3 3 2 5 3 4 5 2 5 2 2 4 2 2 2 2 5 4 5 4 3 5 4 2 5 5 3 4 5 2 3 2 2 2 5 3 2 2 2 3 3 5 2 3 2 4 5 3 3 3 5 2 3 3 3 5 4 5 5 5 2\n4 4 4 5 5 3 5 5 4 3 5 4 3 4 3 3 5 3 5 5 3 3 3 5 5 4 4 3 2 5 4 3 3 4 5 3 5 2 4 2 2 2 5 3 5 2 5 5 3 3 2 3 3 4 2 5 2 5 2 4 2 4 2 3 3 4 2 2 2 4 4 3 3 3 4 3 3 3 5 5 3 4 2 2 3 5 5 2 3 4 5 4 5 3 4 2 5 3 2 4", "output": "3" }, { "input": "100\n5 3 4 4 2 5 1 1 4 4 3 5 5 1 4 4 2 5 3 2 1 1 3 2 4 4 4 2 5 2 2 3 1 4 1 4 4 5 3 5 1 4 1 4 1 5 5 3 5 5 1 5 3 5 1 3 3 4 5 3 2 2 4 5 2 5 4 2 4 4 1 1 4 2 4 1 2 2 4 3 4 1 1 1 4 3 5 1 2 1 4 5 4 4 2 1 4 1 3 2\n1 1 1 1 4 2 1 4 1 1 3 5 4 3 5 2 2 4 2 2 4 1 3 4 4 5 1 1 2 2 2 1 4 1 4 4 1 5 5 2 3 5 1 5 4 2 3 2 2 5 4 1 1 4 5 2 4 5 4 4 3 3 2 4 3 4 5 5 4 2 4 2 1 2 3 2 2 5 5 3 1 3 4 3 4 4 5 3 1 1 3 5 1 4 4 2 2 1 4 5", "output": "2" }, { "input": "100\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3", "output": "0" }, { "input": "100\n3 3 4 3 3 4 3 3 4 4 3 3 3 4 3 4 3 4 4 3 3 3 3 3 3 4 3 3 4 3 3 3 3 4 3 3 3 4 4 4 3 3 4 4 4 3 4 4 3 3 4 3 3 3 4 4 4 3 4 3 3 3 3 3 3 3 4 4 3 3 3 3 4 3 3 3 3 3 4 4 3 3 3 3 3 4 3 4 4 4 4 3 4 3 4 4 4 4 3 3\n4 3 3 3 3 4 4 3 4 4 4 3 3 4 4 3 4 4 4 4 3 4 3 3 3 4 4 4 3 4 3 4 4 3 3 4 3 3 3 3 3 4 3 3 3 3 4 4 4 3 3 4 3 4 4 4 4 3 4 4 3 3 4 3 3 4 3 4 3 4 4 4 4 3 3 4 3 4 4 4 3 3 4 4 4 4 4 3 3 3 4 3 3 4 3 3 3 3 3 3", "output": "5" }, { "input": "100\n4 2 5 2 5 4 2 5 5 4 4 2 4 4 2 4 4 5 2 5 5 2 2 4 4 5 4 5 5 5 2 2 2 2 4 4 5 2 4 4 4 2 2 5 5 4 5 4 4 2 4 5 4 2 4 5 4 2 4 5 4 4 4 4 4 5 4 2 5 2 5 5 5 5 4 2 5 5 4 4 2 5 2 5 2 5 4 2 4 2 4 5 2 5 2 4 2 4 2 4\n5 4 5 4 5 2 2 4 5 2 5 5 5 5 5 4 4 4 4 5 4 5 5 2 4 4 4 4 5 2 4 4 5 5 2 5 2 5 5 4 4 5 2 5 2 5 2 5 4 5 2 5 2 5 2 4 4 5 4 2 5 5 4 2 2 2 5 4 2 2 4 4 4 5 5 2 5 2 2 4 4 4 2 5 4 5 2 2 5 4 4 5 5 4 5 5 4 5 2 5", "output": "5" }, { "input": "100\n3 4 5 3 5 4 5 4 4 4 2 4 5 4 3 2 3 4 3 5 2 5 2 5 4 3 4 2 5 2 5 3 4 5 2 5 4 2 4 5 4 3 2 4 4 5 2 5 5 3 3 5 2 4 4 2 3 3 2 5 5 5 2 4 5 5 4 2 2 5 3 3 2 4 4 2 4 5 5 2 5 5 3 2 5 2 4 4 3 3 5 4 5 5 2 5 4 5 4 3\n4 3 5 5 2 4 2 4 5 5 5 2 3 3 3 3 5 5 5 5 3 5 2 3 5 2 3 2 2 5 5 3 5 3 4 2 2 5 3 3 3 3 5 2 4 5 3 5 3 4 4 4 5 5 3 4 4 2 2 4 4 5 3 2 4 5 5 4 5 2 2 3 5 4 5 5 2 5 4 3 2 3 2 5 4 5 3 4 5 5 3 5 2 2 4 4 3 2 5 2", "output": "4" }, { "input": "100\n4 1 1 2 1 4 4 1 4 5 5 5 2 2 1 3 5 2 1 5 2 1 2 4 4 2 1 2 2 2 4 3 1 4 2 2 3 1 1 4 4 5 4 4 4 5 1 4 1 4 3 1 2 1 2 4 1 2 5 2 1 4 3 4 1 4 2 1 1 1 5 3 3 1 4 1 3 1 4 1 1 2 2 2 3 1 4 3 4 4 5 2 5 4 3 3 3 2 2 1\n5 1 4 4 3 4 4 5 2 3 3 4 4 2 3 2 3 1 3 1 1 4 1 5 4 3 2 4 3 3 3 2 3 4 1 5 4 2 4 2 2 2 5 3 1 2 5 3 2 2 1 1 2 2 3 5 1 2 5 3 2 1 1 2 1 2 4 3 5 4 5 3 2 4 1 3 4 1 4 4 5 4 4 5 4 2 5 3 4 1 4 2 4 2 4 5 4 5 4 2", "output": "6" }, { "input": "100\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "0" }, { "input": "100\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3", "output": "0" }, { "input": "100\n4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 1 4 4 4 4 4 4 4 4 4 4\n4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 1 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4", "output": "0" }, { "input": "100\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2", "output": "1" }, { "input": "100\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 1 3 3 3 3 3 3 3 3 3 3 3 1 3 3 3 3 3 3 3 3 3 1 3 3 3 3 3 3 3 4 3 3 3 3 3 3 3 3 3 3 1 3 1 3 3 3 3 1 1 1 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n3 3 3 4 3 3 3 1 1 1 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 1 3 3 3 1 3 1 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 1 3 3 3 3 3 3 3 1 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 1 3 3 3 3 3 3 1 3 3 3 3 3 3 3 3 3 3", "output": "1" }, { "input": "100\n5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "50" }, { "input": "100\n3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5\n3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1", "output": "25" }, { "input": "100\n3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5 3 5\n2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 2 4", "output": "50" }, { "input": "100\n1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5\n5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5", "output": "40" }, { "input": "100\n1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5\n2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3", "output": "30" }, { "input": "5\n4 4 4 4 5\n4 5 5 5 5", "output": "-1" }, { "input": "4\n1 1 1 1\n3 3 3 3", "output": "2" }, { "input": "6\n1 1 2 2 3 4\n1 2 3 3 4 4", "output": "-1" }, { "input": "4\n1 1 1 2\n3 3 3 3", "output": "-1" }, { "input": "3\n2 2 2\n4 4 4", "output": "-1" }, { "input": "2\n1 2\n3 4", "output": "-1" }, { "input": "6\n1 1 1 3 3 3\n2 2 2 4 4 4", "output": "-1" }, { "input": "5\n1 2 2 2 2\n1 1 1 1 3", "output": "-1" }, { "input": "2\n1 3\n2 2", "output": "-1" }, { "input": "2\n1 3\n4 5", "output": "-1" }, { "input": "4\n1 2 3 4\n5 5 5 5", "output": "-1" }, { "input": "2\n1 3\n2 4", "output": "-1" }, { "input": "2\n1 2\n4 4", "output": "-1" }, { "input": "2\n1 2\n3 3", "output": "-1" }, { "input": "10\n4 4 4 4 2 3 3 3 3 1\n2 2 2 2 4 1 1 1 1 3", "output": "-1" }, { "input": "6\n1 2 3 3 4 4\n1 1 2 2 3 4", "output": "-1" }, { "input": "5\n3 3 3 3 1\n1 1 1 1 3", "output": "-1" }, { "input": "2\n1 1\n2 3", "output": "-1" }, { "input": "8\n1 1 2 2 3 3 3 3\n2 2 2 2 1 1 1 1", "output": "2" }, { "input": "5\n1 1 1 3 3\n1 1 1 1 2", "output": "-1" }, { "input": "6\n2 2 3 3 4 4\n2 3 4 5 5 5", "output": "-1" }, { "input": "6\n1 1 2 2 3 4\n3 3 4 4 1 2", "output": "-1" }, { "input": "4\n1 2 3 3\n3 3 3 3", "output": "-1" }, { "input": "3\n1 2 3\n3 3 3", "output": "-1" }, { "input": "5\n3 3 3 2 2\n2 2 2 3 3", "output": "-1" }, { "input": "10\n1 2 3 4 1 2 3 4 1 2\n1 2 3 4 1 2 3 4 3 4", "output": "-1" }, { "input": "2\n2 2\n1 3", "output": "-1" }, { "input": "3\n1 2 3\n1 1 4", "output": "-1" }, { "input": "4\n3 4 4 4\n3 3 4 4", "output": "-1" } ]	1,488,107,237	2,147,483,647	PyPy 3	OK	TESTS	81	109	23,142,400	read = lambda: map(int, input().split()) n = int(input()) a = sorted(read()) b = sorted(read()) for i in range(1, 6): if (a.count(i) + b.count(i)) % 2: print(-1) exit() cnt = 0 while 1: flag = False for i in range(n): if a.count(a[i]) > b.count(a[i]): for j in range(n): if a.count(b[j]) < b.count(b[j]) and a[i] != b[j]: a[i], b[j] = b[j], a[i] cnt += 1 break if flag: break if not flag: break print(cnt)	Title: Pupils Redistribution Time Limit: None seconds Memory Limit: None megabytes Problem Description: In Berland each high school student is characterized by academic performance — integer value between 1 and 5. In high school 0xFF there are two groups of pupils: the group A and the group B. Each group consists of exactly n students. An academic performance of each student is known — integer value between 1 and 5. The school director wants to redistribute students between groups so that each of the two groups has the same number of students whose academic performance is equal to 1, the same number of students whose academic performance is 2 and so on. In other words, the purpose of the school director is to change the composition of groups, so that for each value of academic performance the numbers of students in both groups are equal. To achieve this, there is a plan to produce a series of exchanges of students between groups. During the single exchange the director selects one student from the class A and one student of class B. After that, they both change their groups. Print the least number of exchanges, in order to achieve the desired equal numbers of students for each academic performance. Input Specification: The first line of the input contains integer number n (1<=≤<=n<=≤<=100) — number of students in both groups. The second line contains sequence of integer numbers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=5), where ai is academic performance of the i-th student of the group A. The third line contains sequence of integer numbers b1,<=b2,<=...,<=bn (1<=≤<=bi<=≤<=5), where bi is academic performance of the i-th student of the group B. Output Specification: Print the required minimum number of exchanges or -1, if the desired distribution of students can not be obtained. Demo Input: ['4\n5 4 4 4\n5 5 4 5\n', '6\n1 1 1 1 1 1\n5 5 5 5 5 5\n', '1\n5\n3\n', '9\n3 2 5 5 2 3 3 3 2\n4 1 4 1 1 2 4 4 1\n'] Demo Output: ['1\n', '3\n', '-1\n', '4\n'] Note: none	```python read = lambda: map(int, input().split()) n = int(input()) a = sorted(read()) b = sorted(read()) for i in range(1, 6): if (a.count(i) + b.count(i)) % 2: print(-1) exit() cnt = 0 while 1: flag = False for i in range(n): if a.count(a[i]) > b.count(a[i]): for j in range(n): if a.count(b[j]) < b.count(b[j]) and a[i] != b[j]: a[i], b[j] = b[j], a[i] cnt += 1 break if flag: break if not flag: break print(cnt) ```	3
637	C	Promocodes with Mistakes	PROGRAMMING	1,400	[ "*special", "brute force", "constructive algorithms", "implementation" ]		null	null	During a New Year special offer the "Sudislavl Bars" offered n promo codes. Each promo code consists of exactly six digits and gives right to one free cocktail at the bar "Mosquito Shelter". Of course, all the promocodes differ. As the "Mosquito Shelter" opens only at 9, and partying in Sudislavl usually begins at as early as 6, many problems may arise as to how to type a promotional code without errors. It is necessary to calculate such maximum k, that the promotional code could be uniquely identified if it was typed with no more than k errors. At that, k<==<=0 means that the promotional codes must be entered exactly. A mistake in this problem should be considered as entering the wrong numbers. For example, value "123465" contains two errors relative to promocode "123456". Regardless of the number of errors the entered value consists of exactly six digits.	The first line of the output contains number n (1<=≤<=n<=≤<=1000) — the number of promocodes. Each of the next n lines contains a single promocode, consisting of exactly 6 digits. It is guaranteed that all the promocodes are distinct. Promocodes can start from digit "0".	Print the maximum k (naturally, not exceeding the length of the promocode), such that any promocode can be uniquely identified if it is typed with at most k mistakes.	[ "2\n000000\n999999\n", "6\n211111\n212111\n222111\n111111\n112111\n121111\n" ]	[ "2\n", "0\n" ]	In the first sample k < 3, so if a bar customer types in value "090909", then it will be impossible to define which promocode exactly corresponds to it.	1,500	[ { "input": "2\n000000\n999999", "output": "2" }, { "input": "6\n211111\n212111\n222111\n111111\n112111\n121111", "output": "0" }, { "input": "1\n123456", "output": "6" }, { "input": "2\n000000\n099999", "output": "2" }, { "input": "2\n000000\n009999", "output": "1" }, { "input": "2\n000000\n000999", "output": "1" }, { "input": "2\n000000\n000099", "output": "0" }, { "input": "2\n000000\n000009", "output": "0" }, { "input": "1\n000000", "output": "6" }, { "input": "1\n999999", "output": "6" }, { "input": "10\n946965\n781372\n029568\n336430\n456975\n119377\n179098\n925374\n878716\n461563", "output": "1" }, { "input": "10\n878711\n193771\n965021\n617901\n333641\n307811\n989461\n461561\n956811\n253741", "output": "1" }, { "input": "10\n116174\n914694\n615024\n115634\n717464\n910984\n513744\n111934\n915684\n817874", "output": "0" }, { "input": "10\n153474\n155468\n151419\n151479\n158478\n159465\n150498\n157416\n150429\n159446", "output": "0" }, { "input": "10\n141546\n941544\n141547\n041542\n641545\n841547\n941540\n741544\n941548\n641549", "output": "0" }, { "input": "10\n114453\n114456\n114457\n114450\n114459\n114451\n114458\n114452\n114455\n114454", "output": "0" }, { "input": "5\n145410\n686144\n859775\n922809\n470967", "output": "2" }, { "input": "9\n145410\n686144\n859775\n922809\n470967\n234531\n597023\n318298\n701652", "output": "2" }, { "input": "10\n145410\n686144\n859775\n922809\n470967\n234531\n597023\n318298\n701652\n063386", "output": "2" }, { "input": "20\n145410\n686144\n766870\n859775\n922809\n470967\n034349\n318920\n019664\n667953\n295078\n908733\n691385\n774622\n325695\n443254\n817406\n984471\n512092\n635832", "output": "2" }, { "input": "50\n145410\n686144\n766870\n859775\n922809\n470967\n034349\n318920\n019664\n667953\n295078\n908733\n691385\n774622\n325695\n443254\n817406\n984471\n512092\n635832\n303546\n189826\n128551\n720334\n569318\n377719\n281502\n956352\n758447\n207280\n583935\n246631\n160045\n452683\n594100\n806017\n232727\n673001\n799299\n396463\n061796\n538266\n947198\n055121\n080213\n501424\n600679\n254914\n872248\n133173", "output": "2" }, { "input": "58\n145410\n686144\n766870\n859775\n922809\n470967\n034349\n318920\n019664\n667953\n295078\n908733\n691385\n774622\n325695\n443254\n817406\n984471\n512092\n635832\n303546\n189826\n128551\n720334\n569318\n377719\n281502\n956352\n758447\n207280\n583935\n246631\n160045\n452683\n594100\n806017\n232727\n673001\n799299\n396463\n061796\n538266\n947198\n055121\n080213\n501424\n600679\n254914\n872248\n133173\n114788\n742565\n411841\n831650\n868189\n364237\n975584\n023482", "output": "2" }, { "input": "58\n145410\n686144\n766870\n859775\n922809\n470967\n034349\n318920\n019664\n667953\n295078\n908733\n691385\n774622\n325695\n443254\n817406\n984471\n512092\n635832\n303546\n189826\n128551\n720334\n569318\n377719\n281502\n956352\n758447\n207280\n583935\n246631\n160045\n452683\n594100\n806017\n232727\n673001\n799299\n396463\n061796\n538266\n947198\n055121\n080213\n501424\n600679\n254914\n872248\n133173\n114788\n742565\n411841\n831650\n868189\n364237\n975584\n023482", "output": "2" }, { "input": "10\n234531\n597023\n859775\n063388\n701652\n686144\n470967\n145410\n318298\n922809", "output": "2" }, { "input": "10\n234531\n597023\n859775\n063388\n701652\n686144\n470967\n145410\n318298\n922809", "output": "2" }, { "input": "10\n234531\n597023\n859775\n063388\n701652\n686144\n470967\n145410\n318298\n922809", "output": "2" }, { "input": "10\n234531\n597023\n859775\n063388\n701652\n686144\n470967\n145410\n318298\n922809", "output": "2" }, { "input": "10\n234531\n597023\n859775\n063388\n701652\n686144\n470967\n145410\n318298\n922809", "output": "2" }, { "input": "10\n145410\n686144\n859775\n922809\n470967\n234531\n597023\n318298\n701652\n063386", "output": "2" }, { "input": "10\n145410\n686144\n859775\n922809\n470967\n234531\n597023\n318298\n701652\n063386", "output": "2" }, { "input": "10\n145410\n686144\n859775\n922809\n470967\n234531\n597023\n318298\n701652\n063386", "output": "2" }, { "input": "10\n145410\n686144\n859775\n922809\n470967\n234531\n597023\n318298\n701652\n063386", "output": "2" }, { "input": "10\n145410\n686144\n859775\n922809\n470967\n234531\n597023\n318298\n701652\n063386", "output": "2" }, { "input": "58\n114788\n281502\n080213\n093857\n956352\n501424\n512092\n145410\n673001\n128551\n594100\n396463\n758447\n133173\n411841\n538266\n908733\n318920\n872248\n720334\n055121\n691385\n160045\n232727\n947198\n452683\n443254\n859775\n583935\n470967\n742565\n766870\n799299\n061796\n817406\n377719\n034349\n303546\n254914\n635832\n686144\n806017\n295078\n246631\n569318\n831650\n600679\n207280\n325695\n774622\n922809\n975584\n019664\n667953\n189826\n984471\n868189\n364237", "output": "1" }, { "input": "58\n114788\n281502\n080213\n093857\n956352\n501424\n512092\n145410\n673001\n128551\n594100\n396463\n758447\n133173\n411841\n538266\n908733\n318920\n872248\n720334\n055121\n691385\n160045\n232727\n947198\n452683\n443254\n859775\n583935\n470967\n742565\n766870\n799299\n061796\n817406\n377719\n034349\n303546\n254914\n635832\n686144\n806017\n295078\n246631\n569318\n831650\n600679\n207280\n325695\n774622\n922809\n975584\n019664\n667953\n189826\n984471\n868189\n364237", "output": "1" }, { "input": "58\n114788\n281502\n080213\n093857\n956352\n501424\n512092\n145410\n673001\n128551\n594100\n396463\n758447\n133173\n411841\n538266\n908733\n318920\n872248\n720334\n055121\n691385\n160045\n232727\n947198\n452683\n443254\n859775\n583935\n470967\n742565\n766870\n799299\n061796\n817406\n377719\n034349\n303546\n254914\n635832\n686144\n806017\n295078\n246631\n569318\n831650\n600679\n207280\n325695\n774622\n922809\n975584\n019664\n667953\n189826\n984471\n868189\n364237", "output": "1" }, { "input": "58\n114788\n281502\n080213\n093857\n956352\n501424\n512092\n145410\n673001\n128551\n594100\n396463\n758447\n133173\n411841\n538266\n908733\n318920\n872248\n720334\n055121\n691385\n160045\n232727\n947198\n452683\n443254\n859775\n583935\n470967\n742565\n766870\n799299\n061796\n817406\n377719\n034349\n303546\n254914\n635832\n686144\n806017\n295078\n246631\n569318\n831650\n600679\n207280\n325695\n774622\n922809\n975584\n019664\n667953\n189826\n984471\n868189\n364237", "output": "1" }, { "input": "58\n114788\n281502\n080213\n093857\n956352\n501424\n512092\n145410\n673001\n128551\n594100\n396463\n758447\n133173\n411841\n538266\n908733\n318920\n872248\n720334\n055121\n691385\n160045\n232727\n947198\n452683\n443254\n859775\n583935\n470967\n742565\n766870\n799299\n061796\n817406\n377719\n034349\n303546\n254914\n635832\n686144\n806017\n295078\n246631\n569318\n831650\n600679\n207280\n325695\n774622\n922809\n975584\n019664\n667953\n189826\n984471\n868189\n364237", "output": "1" }, { "input": "58\n145410\n686144\n766870\n859775\n922809\n470967\n034349\n318920\n019664\n667953\n295078\n908733\n691385\n774622\n325695\n443254\n817406\n984471\n512092\n635832\n303546\n189826\n128551\n720334\n569318\n377719\n281502\n956352\n758447\n207280\n583935\n246631\n160045\n452683\n594100\n806017\n232727\n673001\n799299\n396463\n061796\n538266\n947198\n055121\n080213\n501424\n600679\n254914\n872248\n133173\n114788\n742565\n411841\n831650\n868189\n364237\n975584\n023482", "output": "2" }, { "input": "58\n145410\n686144\n766870\n859775\n922809\n470967\n034349\n318920\n019664\n667953\n295078\n908733\n691385\n774622\n325695\n443254\n817406\n984471\n512092\n635832\n303546\n189826\n128551\n720334\n569318\n377719\n281502\n956352\n758447\n207280\n583935\n246631\n160045\n452683\n594100\n806017\n232727\n673001\n799299\n396463\n061796\n538266\n947198\n055121\n080213\n501424\n600679\n254914\n872248\n133173\n114788\n742565\n411841\n831650\n868189\n364237\n975584\n023482", "output": "2" }, { "input": "58\n145410\n686144\n766870\n859775\n922809\n470967\n034349\n318920\n019664\n667953\n295078\n908733\n691385\n774622\n325695\n443254\n817406\n984471\n512092\n635832\n303546\n189826\n128551\n720334\n569318\n377719\n281502\n956352\n758447\n207280\n583935\n246631\n160045\n452683\n594100\n806017\n232727\n673001\n799299\n396463\n061796\n538266\n947198\n055121\n080213\n501424\n600679\n254914\n872248\n133173\n114788\n742565\n411841\n831650\n868189\n364237\n975584\n023482", "output": "2" }, { "input": "58\n145410\n686144\n766870\n859775\n922809\n470967\n034349\n318920\n019664\n667953\n295078\n908733\n691385\n774622\n325695\n443254\n817406\n984471\n512092\n635832\n303546\n189826\n128551\n720334\n569318\n377719\n281502\n956352\n758447\n207280\n583935\n246631\n160045\n452683\n594100\n806017\n232727\n673001\n799299\n396463\n061796\n538266\n947198\n055121\n080213\n501424\n600679\n254914\n872248\n133173\n114788\n742565\n411841\n831650\n868189\n364237\n975584\n023482", "output": "2" }, { "input": "58\n145410\n686144\n766870\n859775\n922809\n470967\n034349\n318920\n019664\n667953\n295078\n908733\n691385\n774622\n325695\n443254\n817406\n984471\n512092\n635832\n303546\n189826\n128551\n720334\n569318\n377719\n281502\n956352\n758447\n207280\n583935\n246631\n160045\n452683\n594100\n806017\n232727\n673001\n799299\n396463\n061796\n538266\n947198\n055121\n080213\n501424\n600679\n254914\n872248\n133173\n114788\n742565\n411841\n831650\n868189\n364237\n975584\n023482", "output": "2" } ]	1,457,881,300	10,900	Python 3	TIME_LIMIT_EXCEEDED	PRETESTS	12	1,000	0	import sys n=int(input()) numbers=[] minL=6 for i in range(n): numbers.append(int(input())) if n == 1: print(6) sys.exit(0) for i in range(n): for j in range(i+1,n): sub=int(abs(numbers[i]-numbers[j])) # print(sub) count = 0 while sub > 0: count += int(bool(sub%10)) sub //= 10 minL = min(minL,count) print((minL-1)//2)	Title: Promocodes with Mistakes Time Limit: None seconds Memory Limit: None megabytes Problem Description: During a New Year special offer the "Sudislavl Bars" offered n promo codes. Each promo code consists of exactly six digits and gives right to one free cocktail at the bar "Mosquito Shelter". Of course, all the promocodes differ. As the "Mosquito Shelter" opens only at 9, and partying in Sudislavl usually begins at as early as 6, many problems may arise as to how to type a promotional code without errors. It is necessary to calculate such maximum k, that the promotional code could be uniquely identified if it was typed with no more than k errors. At that, k<==<=0 means that the promotional codes must be entered exactly. A mistake in this problem should be considered as entering the wrong numbers. For example, value "123465" contains two errors relative to promocode "123456". Regardless of the number of errors the entered value consists of exactly six digits. Input Specification: The first line of the output contains number n (1<=≤<=n<=≤<=1000) — the number of promocodes. Each of the next n lines contains a single promocode, consisting of exactly 6 digits. It is guaranteed that all the promocodes are distinct. Promocodes can start from digit "0". Output Specification: Print the maximum k (naturally, not exceeding the length of the promocode), such that any promocode can be uniquely identified if it is typed with at most k mistakes. Demo Input: ['2\n000000\n999999\n', '6\n211111\n212111\n222111\n111111\n112111\n121111\n'] Demo Output: ['2\n', '0\n'] Note: In the first sample k < 3, so if a bar customer types in value "090909", then it will be impossible to define which promocode exactly corresponds to it.	```python import sys n=int(input()) numbers=[] minL=6 for i in range(n): numbers.append(int(input())) if n == 1: print(6) sys.exit(0) for i in range(n): for j in range(i+1,n): sub=int(abs(numbers[i]-numbers[j])) # print(sub) count = 0 while sub > 0: count += int(bool(sub%10)) sub //= 10 minL = min(minL,count) print((minL-1)//2) ```	0
356	A	Knight Tournament	PROGRAMMING	1,500	[ "data structures", "dsu" ]		null	null	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. As 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: - 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 li and at most ri 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 xi, he continued participating in the tournament. Other knights left the tournament. - The winner of the last (the m-th) fight (the knight number xm) became the winner of the tournament. You 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. Write the code that calculates for each knight, the name of the knight that beat him.	The first line contains two integers n, m (2<=≤<=n<=≤<=3·105; 1<=≤<=m<=≤<=3·105) — the number of knights and the number of fights. Each of the following m lines contains three integers li,<=ri,<=xi (1<=≤<=li<=<<=ri<=≤<=n; li<=≤<=xi<=≤<=ri) — the description of the i-th fight. It is guaranteed that the input is correct and matches the problem statement. It is guaranteed that at least two knights took part in each battle.	Print n integers. If the i-th knight lost, then the i-th number should equal the number of the knight that beat the knight number i. If the i-th knight is the winner, then the i-th number must equal 0.	[ "4 3\n1 2 1\n1 3 3\n1 4 4\n", "8 4\n3 5 4\n3 7 6\n2 8 8\n1 8 1\n" ]	[ "3 1 4 0 ", "0 8 4 6 4 8 6 1 " ]	Consider the first test case. Knights 1 and 2 fought the first fight and knight 1 won. Knights 1 and 3 fought the second fight and knight 3 won. The last fight was between knights 3 and 4, knight 4 won.	500	[ { "input": "4 3\n1 2 1\n1 3 3\n1 4 4", "output": "3 1 4 0 " }, { "input": "8 4\n3 5 4\n3 7 6\n2 8 8\n1 8 1", "output": "0 8 4 6 4 8 6 1 " }, { "input": "2 1\n1 2 1", "output": "0 1 " }, { "input": "2 1\n1 2 2", "output": "2 0 " }, { "input": "3 1\n1 3 1", "output": "0 1 1 " }, { "input": "3 1\n1 3 2", "output": "2 0 2 " }, { "input": "3 1\n1 3 3", "output": "3 3 0 " }, { "input": "3 2\n1 2 1\n1 3 3", "output": "3 1 0 " }, { "input": "3 2\n1 2 2\n1 3 2", "output": "2 0 2 " }, { "input": "3 2\n2 3 3\n1 3 3", "output": "3 3 0 " }, { "input": "11 6\n1 2 2\n7 8 7\n3 4 4\n6 9 6\n5 10 10\n2 11 11", "output": "2 11 4 11 10 10 6 7 6 11 0 " }, { "input": "10 6\n9 10 10\n6 7 7\n2 4 2\n2 5 5\n1 7 5\n4 10 8", "output": "5 5 2 2 8 7 5 0 10 8 " }, { "input": "11 8\n3 5 5\n8 9 9\n4 6 6\n8 10 10\n5 7 7\n2 7 2\n10 11 11\n1 11 1", "output": "0 1 5 5 6 7 2 9 10 11 1 " }, { "input": "10 7\n7 8 7\n7 9 9\n5 9 5\n5 10 10\n1 2 2\n3 4 4\n2 10 4", "output": "2 4 4 0 10 5 9 7 5 4 " }, { "input": "11 5\n8 10 9\n6 10 7\n6 11 11\n3 5 5\n1 11 1", "output": "0 1 5 5 1 7 11 9 7 9 1 " }, { "input": "10 6\n6 7 6\n5 7 5\n3 7 4\n2 8 2\n2 10 10\n1 10 10", "output": "10 10 4 2 4 5 6 2 10 0 " }, { "input": "11 7\n7 8 8\n5 6 5\n1 3 3\n7 9 9\n5 10 10\n10 11 11\n1 11 4", "output": "3 3 4 0 10 5 8 9 10 11 4 " }, { "input": "10 7\n8 9 9\n3 4 3\n2 3 2\n1 5 2\n6 7 6\n6 10 10\n1 10 10", "output": "2 10 2 3 2 10 6 9 10 0 " }, { "input": "11 6\n1 2 1\n8 9 9\n3 5 5\n3 6 6\n9 10 10\n1 11 10", "output": "10 1 5 5 6 10 10 9 10 0 10 " }, { "input": "10 5\n1 2 1\n8 10 8\n3 6 4\n4 7 7\n1 8 7", "output": "7 1 4 7 4 4 0 7 8 8 " }, { "input": "4 3\n1 2 2\n1 3 3\n1 4 4", "output": "2 3 4 0 " } ]	1,444,396,723	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	10	3,000	14,028,800	def main(): mode="filee" if mode=="file":f=open("test.txt","r") #f.readline() #input() get = lambda :[int(x) for x in (f.readline() if mode=="file" else input()).split()] [n,m]=get() b=[0](n+1) a=[0](n+1) for i in range(n+1): b[i]=i b=set(b) for z in range(m): [x,y,z]=get() c={i for i in range(x,y+1)} d=b.intersection(c) b-=d for i in d: a[i]=z a[z]=0 b.add(z) for i in a[1:]: print(i,end=' ') if mode=="file":f.close() if __name__=="__main__": main()	Title: Knight Tournament Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. As 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: - 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 li and at most ri 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 xi, he continued participating in the tournament. Other knights left the tournament. - The winner of the last (the m-th) fight (the knight number xm) became the winner of the tournament. You 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. Write the code that calculates for each knight, the name of the knight that beat him. Input Specification: The first line contains two integers n, m (2<=≤<=n<=≤<=3·105; 1<=≤<=m<=≤<=3·105) — the number of knights and the number of fights. Each of the following m lines contains three integers li,<=ri,<=xi (1<=≤<=li<=<<=ri<=≤<=n; li<=≤<=xi<=≤<=ri) — the description of the i-th fight. It is guaranteed that the input is correct and matches the problem statement. It is guaranteed that at least two knights took part in each battle. Output Specification: Print n integers. If the i-th knight lost, then the i-th number should equal the number of the knight that beat the knight number i. If the i-th knight is the winner, then the i-th number must equal 0. Demo Input: ['4 3\n1 2 1\n1 3 3\n1 4 4\n', '8 4\n3 5 4\n3 7 6\n2 8 8\n1 8 1\n'] Demo Output: ['3 1 4 0 ', '0 8 4 6 4 8 6 1 '] Note: Consider the first test case. Knights 1 and 2 fought the first fight and knight 1 won. Knights 1 and 3 fought the second fight and knight 3 won. The last fight was between knights 3 and 4, knight 4 won.	```python def main(): mode="filee" if mode=="file":f=open("test.txt","r") #f.readline() #input() get = lambda :[int(x) for x in (f.readline() if mode=="file" else input()).split()] [n,m]=get() b=[0](n+1) a=[0](n+1) for i in range(n+1): b[i]=i b=set(b) for z in range(m): [x,y,z]=get() c={i for i in range(x,y+1)} d=b.intersection(c) b-=d for i in d: a[i]=z a[z]=0 b.add(z) for i in a[1:]: print(i,end=' ') if mode=="file":f.close() if __name__=="__main__": main() ```	0
820	B	Mister B and Angle in Polygon	PROGRAMMING	1,300	[ "constructive algorithms", "geometry", "math" ]		null	null	On one quiet day all of sudden Mister B decided to draw angle a on his field. Aliens have already visited his field and left many different geometric figures on it. One of the figures is regular convex n-gon (regular convex polygon with n sides). That's why Mister B decided to use this polygon. Now Mister B must find three distinct vertices v1, v2, v3 such that the angle (where v2 is the vertex of the angle, and v1 and v3 lie on its sides) is as close as possible to a. In other words, the value should be minimum possible. If there are many optimal solutions, Mister B should be satisfied with any of them.	First and only line contains two space-separated integers n and a (3<=≤<=n<=≤<=105, 1<=≤<=a<=≤<=180) — the number of vertices in the polygon and the needed angle, in degrees.	Print three space-separated integers: the vertices v1, v2, v3, which form . If there are multiple optimal solutions, print any of them. The vertices are numbered from 1 to n in clockwise order.	[ "3 15\n", "4 67\n", "4 68\n" ]	[ "1 2 3\n", "2 1 3\n", "4 1 2\n" ]	In first sample test vertices of regular triangle can create only angle of 60 degrees, that's why every possible angle is correct. Vertices of square can create 45 or 90 degrees angles only. That's why in second sample test the angle of 45 degrees was chosen, since \|45 - 67\| < \|90 - 67\|. Other correct answers are: "3 1 2", "3 2 4", "4 2 3", "4 3 1", "1 3 4", "1 4 2", "2 4 1", "4 1 3", "3 1 4", "3 4 2", "2 4 3", "2 3 1", "1 3 2", "1 2 4", "4 2 1". In third sample test, on the contrary, the angle of 90 degrees was chosen, since \|90 - 68\| < \|45 - 68\|. Other correct answers are: "2 1 4", "3 2 1", "1 2 3", "4 3 2", "2 3 4", "1 4 3", "3 4 1".	1,000	[ { "input": "3 15", "output": "2 1 3" }, { "input": "4 67", "output": "2 1 3" }, { "input": "4 68", "output": "2 1 4" }, { "input": "3 1", "output": "2 1 3" }, { "input": "3 180", "output": "2 1 3" }, { "input": "100000 1", "output": "2 1 558" }, { "input": "100000 180", "output": "2 1 100000" }, { "input": "100000 42", "output": "2 1 23335" }, { "input": "100000 123", "output": "2 1 68335" }, { "input": "5 1", "output": "2 1 3" }, { "input": "5 36", "output": "2 1 3" }, { "input": "5 54", "output": "2 1 3" }, { "input": "5 55", "output": "2 1 4" }, { "input": "5 70", "output": "2 1 4" }, { "input": "5 89", "output": "2 1 4" }, { "input": "5 90", "output": "2 1 4" }, { "input": "5 91", "output": "2 1 5" }, { "input": "5 111", "output": "2 1 5" }, { "input": "5 126", "output": "2 1 5" }, { "input": "5 127", "output": "2 1 5" }, { "input": "5 141", "output": "2 1 5" }, { "input": "5 162", "output": "2 1 5" }, { "input": "5 180", "output": "2 1 5" }, { "input": "6 46", "output": "2 1 4" }, { "input": "6 33", "output": "2 1 3" }, { "input": "13 4", "output": "2 1 3" }, { "input": "23 11", "output": "2 1 3" }, { "input": "11 119", "output": "2 1 9" }, { "input": "13 117", "output": "2 1 10" }, { "input": "18 174", "output": "2 1 18" }, { "input": "8509 139", "output": "2 1 6573" }, { "input": "29770 76", "output": "2 1 12572" }, { "input": "59115 40", "output": "2 1 13139" }, { "input": "68459 88", "output": "2 1 33471" }, { "input": "85100 129", "output": "2 1 60990" }, { "input": "100000 13", "output": "2 1 7224" }, { "input": "100000 35", "output": "2 1 19446" }, { "input": "100000 49", "output": "2 1 27224" }, { "input": "100000 71", "output": "2 1 39446" }, { "input": "100000 79", "output": "2 1 43891" }, { "input": "100000 101", "output": "2 1 56113" }, { "input": "100000 109", "output": "2 1 60558" }, { "input": "100000 143", "output": "2 1 79446" }, { "input": "100000 148", "output": "2 1 82224" }, { "input": "100000 176", "output": "2 1 97780" }, { "input": "4 16", "output": "2 1 3" } ]	1,498,577,473	3,373	Python 3	WRONG_ANSWER	PRETESTS	1	46	4,608,000	n, a = map(int, input().split()) q = 180/n angle = 0 vars = [abs(q*(i+1)-a) for i in range(n-2)] minIndex = vars.index(min(vars)) print(1,2,3+minIndex)	Title: Mister B and Angle in Polygon Time Limit: None seconds Memory Limit: None megabytes Problem Description: On one quiet day all of sudden Mister B decided to draw angle a on his field. Aliens have already visited his field and left many different geometric figures on it. One of the figures is regular convex n-gon (regular convex polygon with n sides). That's why Mister B decided to use this polygon. Now Mister B must find three distinct vertices v1, v2, v3 such that the angle (where v2 is the vertex of the angle, and v1 and v3 lie on its sides) is as close as possible to a. In other words, the value should be minimum possible. If there are many optimal solutions, Mister B should be satisfied with any of them. Input Specification: First and only line contains two space-separated integers n and a (3<=≤<=n<=≤<=105, 1<=≤<=a<=≤<=180) — the number of vertices in the polygon and the needed angle, in degrees. Output Specification: Print three space-separated integers: the vertices v1, v2, v3, which form . If there are multiple optimal solutions, print any of them. The vertices are numbered from 1 to n in clockwise order. Demo Input: ['3 15\n', '4 67\n', '4 68\n'] Demo Output: ['1 2 3\n', '2 1 3\n', '4 1 2\n'] Note: In first sample test vertices of regular triangle can create only angle of 60 degrees, that's why every possible angle is correct. Vertices of square can create 45 or 90 degrees angles only. That's why in second sample test the angle of 45 degrees was chosen, since \|45 - 67\| < \|90 - 67\|. Other correct answers are: "3 1 2", "3 2 4", "4 2 3", "4 3 1", "1 3 4", "1 4 2", "2 4 1", "4 1 3", "3 1 4", "3 4 2", "2 4 3", "2 3 1", "1 3 2", "1 2 4", "4 2 1". In third sample test, on the contrary, the angle of 90 degrees was chosen, since \|90 - 68\| < \|45 - 68\|. Other correct answers are: "2 1 4", "3 2 1", "1 2 3", "4 3 2", "2 3 4", "1 4 3", "3 4 1".	```python n, a = map(int, input().split()) q = 180/n angle = 0 vars = [abs(q*(i+1)-a) for i in range(n-2)] minIndex = vars.index(min(vars)) print(1,2,3+minIndex) ```	0
844	B	Rectangles	PROGRAMMING	1,300	[ "combinatorics", "math" ]		null	null	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: 1. All cells in a set have the same color. 1. Every two cells in a set share row or column.	The first line of input contains integers n and m (1<=≤<=n,<=m<=≤<=50) — the number of rows and the number of columns correspondingly. The next n lines of input contain descriptions of rows. There are m integers, separated by spaces, in each line. The number equals 0 if the corresponding cell is colored white and equals 1 if the corresponding cell is colored black.	Output single integer — the number of non-empty sets from the problem description.	[ "1 1\n0\n", "2 3\n1 0 1\n0 1 0\n" ]	[ "1\n", "8\n" ]	In the second example, there are six one-element sets. Additionally, there are two two-element sets, the first one consists of the first and the third cells of the first row, the second one consists of the first and the third cells of the second row. To sum up, there are 8 sets.	1,000	[ { "input": "1 1\n0", "output": "1" }, { "input": "2 3\n1 0 1\n0 1 0", "output": "8" }, { "input": "2 2\n1 1\n1 1", "output": "8" }, { "input": "1 10\n0 0 0 0 0 0 0 0 0 0", "output": "1023" }, { "input": "11 1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1", "output": "2047" }, { "input": "10 11\n1 1 0 1 1 0 0 0 1 0 0\n1 0 0 1 1 1 0 0 1 1 0\n0 0 1 0 1 1 0 1 0 1 1\n0 1 1 1 0 1 0 1 0 0 0\n1 1 1 1 1 1 1 0 1 0 0\n1 1 0 1 1 1 1 0 0 1 1\n1 0 1 0 1 0 0 1 1 1 0\n1 1 0 0 0 0 0 1 0 1 1\n1 1 0 1 1 1 0 0 1 1 0\n1 0 1 1 0 0 1 0 0 1 1", "output": "2444" }, { "input": "50 1\n0\n1\n0\n1\n0\n1\n0\n1\n1\n1\n0\n0\n1\n0\n0\n1\n1\n1\n1\n0\n1\n1\n0\n1\n1\n1\n0\n1\n0\n0\n0\n1\n1\n0\n1\n1\n0\n1\n0\n1\n0\n0\n1\n0\n0\n0\n1\n1\n0\n1", "output": "142606334" }, { "input": "1 50\n0 1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1 0 1 1 0 1 1 1 0 1 0 0 0 1 1 0 1 1 0 1 0 1 0 0 1 0 0 0 1 1 0 1", "output": "142606334" }, { "input": "2 20\n0 1 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0", "output": "589853" }, { "input": "5 5\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0", "output": "285" }, { "input": "6 6\n1 1 1 1 1 1\n1 1 1 1 1 1\n1 1 1 1 1 1\n1 1 1 1 1 1\n1 1 1 1 1 1\n1 1 1 1 1 1", "output": "720" }, { "input": "21 2\n0 1\n1 1\n0 1\n0 0\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1", "output": "1310745" }, { "input": "3 15\n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 1 0 1 0 0 0 0 0 1 0\n1 0 0 1 0 0 0 0 0 0 0 0 1 0 1", "output": "22587" }, { "input": "10 11\n0 1 0 0 0 0 0 0 0 0 0\n0 1 0 1 0 0 1 0 0 0 0\n0 0 0 0 0 0 1 1 1 0 0\n0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 1 0 0 0 0 1 0\n0 0 0 0 0 0 1 0 0 0 0\n0 0 0 0 0 0 0 0 0 1 0\n0 0 1 0 0 0 1 1 0 0 0\n0 0 0 0 0 0 0 0 1 0 0\n0 0 1 0 1 0 0 0 0 1 1", "output": "12047" }, { "input": "14 15\n0 1 0 0 0 0 0 0 1 0 0 0 1 0 1\n0 0 0 1 1 1 1 0 1 0 0 1 1 0 0\n1 0 0 0 0 1 1 0 0 0 0 0 0 0 0\n0 1 0 0 0 1 0 1 1 0 0 1 0 0 0\n0 0 1 1 0 1 0 1 0 1 1 0 1 0 0\n0 0 0 1 1 0 0 0 0 0 1 1 0 1 0\n0 0 1 0 0 0 0 0 0 1 0 0 1 1 0\n1 1 0 0 0 1 0 0 0 0 0 0 1 1 0\n0 0 0 0 1 0 1 1 1 0 0 0 1 0 1\n1 0 1 1 0 1 0 0 1 0 0 1 1 1 0\n1 0 0 0 0 1 0 0 0 0 0 1 0 0 0\n0 0 0 1 0 1 0 0 0 0 1 0 0 0 1\n0 0 1 0 1 0 0 0 1 1 1 1 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 1 0 0 0", "output": "53166" }, { "input": "1 50\n0 0 0 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 1 0 0 0 1 0 0", "output": "1099511628798" }, { "input": "50 1\n0\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n0\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n0\n1\n1\n1\n1\n1\n1\n1\n0\n1\n1\n1\n1\n0\n1\n1\n1\n1\n1", "output": "35184372088862" }, { "input": "1 50\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "1125899906842623" }, { "input": "5 50\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "5629499534214415" }, { "input": "32 2\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1", "output": "8589934622" }, { "input": "1 50\n0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "562949953421312" }, { "input": "50 1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1", "output": "1125899906842623" }, { "input": "1 49\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "562949953421311" }, { "input": "2 50\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0", "output": "2251799813685296" }, { "input": "3 50\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "3377699720528069" }, { "input": "1 50\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0", "output": "1125899906842623" }, { "input": "1 40\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "1099511627775" }, { "input": "1 33\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "8589934591" }, { "input": "2 40\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0", "output": "2199023255590" }, { "input": "1 35\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "34359738367" }, { "input": "50 1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0", "output": "1125899906842623" } ]	1,514,078,200	2,147,483,647	Python 3	OK	TESTS	55	62	5,529,600	n,m=map(int,input().split()) a=[] d=[] s=nm for i in range(0,n): b=list(map(int,input().split())) a.append(b) n1=b.count(1) n2=b.count(0) s+=2n1+2n2-n1-n2-2 for k in range(0,m): c=[a[i][k] for i in range(0,n)] d.append(c) m1=c.count(1) m2=c.count(0) s+=2m1+2*m2-m1-m2-2 print(s)	Title: Rectangles Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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: 1. All cells in a set have the same color. 1. Every two cells in a set share row or column. Input Specification: The first line of input contains integers n and m (1<=≤<=n,<=m<=≤<=50) — the number of rows and the number of columns correspondingly. The next n lines of input contain descriptions of rows. There are m integers, separated by spaces, in each line. The number equals 0 if the corresponding cell is colored white and equals 1 if the corresponding cell is colored black. Output Specification: Output single integer — the number of non-empty sets from the problem description. Demo Input: ['1 1\n0\n', '2 3\n1 0 1\n0 1 0\n'] Demo Output: ['1\n', '8\n'] Note: In the second example, there are six one-element sets. Additionally, there are two two-element sets, the first one consists of the first and the third cells of the first row, the second one consists of the first and the third cells of the second row. To sum up, there are 8 sets.	```python n,m=map(int,input().split()) a=[] d=[] s=nm for i in range(0,n): b=list(map(int,input().split())) a.append(b) n1=b.count(1) n2=b.count(0) s+=2n1+2n2-n1-n2-2 for k in range(0,m): c=[a[i][k] for i in range(0,n)] d.append(c) m1=c.count(1) m2=c.count(0) s+=2m1+2*m2-m1-m2-2 print(s) ```	3
157	B	Trace	PROGRAMMING	1,000	[ "geometry", "sortings" ]		null	null	One day, as Sherlock Holmes was tracking down one very important criminal, he found a wonderful painting on the wall. This wall could be represented as a plane. The painting had several concentric circles that divided the wall into several parts. Some parts were painted red and all the other were painted blue. Besides, any two neighboring parts were painted different colors, that is, the red and the blue color were alternating, i. e. followed one after the other. The outer area of the wall (the area that lied outside all circles) was painted blue. Help Sherlock Holmes determine the total area of red parts of the wall. Let us remind you that two circles are called concentric if their centers coincide. Several circles are called concentric if any two of them are concentric.	The first line contains the single integer n (1<=≤<=n<=≤<=100). The second line contains n space-separated integers ri (1<=≤<=ri<=≤<=1000) — the circles' radii. It is guaranteed that all circles are different.	Print the single real number — total area of the part of the wall that is painted red. The answer is accepted if absolute or relative error doesn't exceed 10<=-<=4.	[ "1\n1\n", "3\n1 4 2\n" ]	[ "3.1415926536\n", "40.8407044967\n" ]	In the first sample the picture is just one circle of radius 1. Inner part of the circle is painted red. The area of the red part equals π × 1<sup class="upper-index">2</sup> = π. In the second sample there are three circles of radii 1, 4 and 2. Outside part of the second circle is painted blue. Part between the second and the third circles is painted red. Part between the first and the third is painted blue. And, finally, the inner part of the first circle is painted red. Overall there are two red parts: the ring between the second and the third circles and the inner part of the first circle. Total area of the red parts is equal (π × 4<sup class="upper-index">2</sup> - π × 2<sup class="upper-index">2</sup>) + π × 1<sup class="upper-index">2</sup> = π × 12 + π = 13π	1,000	[ { "input": "1\n1", "output": "3.1415926536" }, { "input": "3\n1 4 2", "output": "40.8407044967" }, { "input": "4\n4 1 3 2", "output": "31.4159265359" }, { "input": "4\n100 10 2 1", "output": "31111.1920484997" }, { "input": "10\n10 9 8 7 6 5 4 3 2 1", "output": "172.7875959474" }, { "input": "1\n1000", "output": "3141592.6535897931" }, { "input": "8\n8 1 7 2 6 3 5 4", "output": "113.0973355292" }, { "input": "100\n1000 999 998 997 996 995 994 993 992 991 990 989 988 987 986 985 984 983 982 981 980 979 978 977 976 975 974 973 972 971 970 969 968 967 966 965 964 963 962 961 960 959 958 957 956 955 954 953 952 951 950 949 948 947 946 945 944 943 942 941 940 939 938 937 936 935 934 933 932 931 930 929 928 927 926 925 924 923 922 921 920 919 918 917 916 915 914 913 912 911 910 909 908 907 906 905 904 903 902 901", "output": "298608.3817237098" }, { "input": "6\n109 683 214 392 678 10", "output": "397266.9574170437" }, { "input": "2\n151 400", "output": "431023.3704798660" }, { "input": "6\n258 877 696 425 663 934", "output": "823521.3902487604" }, { "input": "9\n635 707 108 234 52 180 910 203 782", "output": "1100144.9065826489" }, { "input": "8\n885 879 891 428 522 176 135 983", "output": "895488.9947571954" }, { "input": "3\n269 918 721", "output": "1241695.6467754442" }, { "input": "7\n920 570 681 428 866 935 795", "output": "1469640.1849419588" }, { "input": "2\n517 331", "output": "495517.1260654109" }, { "input": "2\n457 898", "output": "1877274.3981158488" }, { "input": "8\n872 704 973 612 183 274 739 253", "output": "1780774.0965755312" }, { "input": "74\n652 446 173 457 760 847 670 25 196 775 998 279 656 809 883 148 969 884 792 502 641 800 663 938 362 339 545 608 107 184 834 666 149 458 864 72 199 658 618 987 126 723 806 643 689 958 626 904 944 415 427 498 628 331 636 261 281 276 478 220 513 595 510 384 354 561 469 462 799 449 747 109 903 456", "output": "1510006.5089479341" }, { "input": "76\n986 504 673 158 87 332 124 218 714 235 212 122 878 370 938 81 686 323 386 348 410 468 875 107 50 960 82 834 234 663 651 422 794 633 294 771 945 607 146 913 950 858 297 88 882 725 247 872 645 749 799 987 115 394 380 382 971 429 593 426 652 353 351 233 868 598 889 116 71 376 916 464 414 976 138 903", "output": "1528494.7817143100" }, { "input": "70\n12 347 748 962 514 686 192 159 990 4 10 788 602 542 946 215 523 727 799 717 955 796 529 465 897 103 181 515 495 153 710 179 747 145 16 585 943 998 923 708 156 399 770 547 775 285 9 68 713 722 570 143 913 416 663 624 925 218 64 237 797 138 942 213 188 818 780 840 480 758", "output": "1741821.4892636713" }, { "input": "26\n656 508 45 189 561 366 96 486 547 386 703 570 780 689 264 26 11 74 466 76 421 48 982 886 215 650", "output": "1818821.9252031571" }, { "input": "52\n270 658 808 249 293 707 700 78 791 167 92 772 807 502 830 991 945 102 968 376 556 578 326 980 688 368 280 853 646 256 666 638 424 737 321 996 925 405 199 680 953 541 716 481 727 143 577 919 892 355 346 298", "output": "1272941.9273080483" }, { "input": "77\n482 532 200 748 692 697 171 863 586 547 301 149 326 812 147 698 303 691 527 805 681 387 619 947 598 453 167 799 840 508 893 688 643 974 998 341 804 230 538 669 271 404 477 759 943 596 949 235 880 160 151 660 832 82 969 539 708 889 258 81 224 655 790 144 462 582 646 256 445 52 456 920 67 819 631 484 534", "output": "2045673.1891262225" }, { "input": "27\n167 464 924 575 775 97 944 390 297 315 668 296 533 829 851 406 702 366 848 512 71 197 321 900 544 529 116", "output": "1573959.9105970615" }, { "input": "38\n488 830 887 566 720 267 583 102 65 200 884 220 263 858 510 481 316 804 754 568 412 166 374 869 356 977 145 421 500 58 664 252 745 70 381 927 670 772", "output": "1479184.3434235646" }, { "input": "64\n591 387 732 260 840 397 563 136 571 876 831 953 799 493 579 13 559 872 53 678 256 232 969 993 847 14 837 365 547 997 604 199 834 529 306 443 739 49 19 276 343 835 904 588 900 870 439 576 975 955 518 117 131 347 800 83 432 882 869 709 32 950 314 450", "output": "1258248.6984672088" }, { "input": "37\n280 281 169 68 249 389 977 101 360 43 448 447 368 496 125 507 747 392 338 270 916 150 929 428 118 266 589 470 774 852 263 644 187 817 808 58 637", "output": "1495219.0323274869" }, { "input": "97\n768 569 306 968 437 779 227 561 412 60 44 807 234 645 169 858 580 396 343 145 842 723 416 80 456 247 81 150 297 116 760 964 312 558 101 850 549 650 299 868 121 435 579 705 118 424 302 812 970 397 659 565 916 183 933 459 6 593 518 717 326 305 744 470 75 981 824 221 294 324 194 293 251 446 481 215 338 861 528 829 921 945 540 89 450 178 24 460 990 392 148 219 934 615 932 340 937", "output": "1577239.7333274092" }, { "input": "94\n145 703 874 425 277 652 239 496 458 658 339 842 564 699 893 352 625 980 432 121 798 872 499 859 850 721 414 825 543 843 304 111 342 45 219 311 50 748 465 902 781 822 504 985 919 656 280 310 917 438 464 527 491 713 906 329 635 777 223 810 501 535 156 252 806 112 971 719 103 443 165 98 579 554 244 996 221 560 301 51 977 422 314 858 528 772 448 626 185 194 536 66 577 677", "output": "1624269.3753516484" }, { "input": "97\n976 166 649 81 611 927 480 231 998 711 874 91 969 521 531 414 993 790 317 981 9 261 437 332 173 573 904 777 882 990 658 878 965 64 870 896 271 732 431 53 761 943 418 602 708 949 930 130 512 240 363 458 673 319 131 784 224 48 919 126 208 212 911 59 677 535 450 273 479 423 79 807 336 18 72 290 724 28 123 605 287 228 350 897 250 392 885 655 746 417 643 114 813 378 355 635 905", "output": "1615601.7212203942" }, { "input": "91\n493 996 842 9 748 178 1 807 841 519 796 998 84 670 778 143 707 208 165 893 154 943 336 150 761 881 434 112 833 55 412 682 552 945 758 189 209 600 354 325 440 844 410 20 136 665 88 791 688 17 539 821 133 236 94 606 483 446 429 60 960 476 915 134 137 852 754 908 276 482 117 252 297 903 981 203 829 811 471 135 188 667 710 393 370 302 874 872 551 457 692", "output": "1806742.5014501044" }, { "input": "95\n936 736 17 967 229 607 589 291 242 244 29 698 800 566 630 667 90 416 11 94 812 838 668 520 678 111 490 823 199 973 681 676 683 721 262 896 682 713 402 691 874 44 95 704 56 322 822 887 639 433 406 35 988 61 176 496 501 947 440 384 372 959 577 370 754 802 1 945 427 116 746 408 308 391 397 730 493 183 203 871 831 862 461 565 310 344 504 378 785 137 279 123 475 138 415", "output": "1611115.5269110680" }, { "input": "90\n643 197 42 218 582 27 66 704 195 445 641 675 285 639 503 686 242 327 57 955 848 287 819 992 756 749 363 48 648 736 580 117 752 921 923 372 114 313 202 337 64 497 399 25 883 331 24 871 917 8 517 486 323 529 325 92 891 406 864 402 263 773 931 253 625 31 17 271 140 131 232 586 893 525 846 54 294 562 600 801 214 55 768 683 389 738 314 284 328 804", "output": "1569819.2914796301" }, { "input": "98\n29 211 984 75 333 96 840 21 352 168 332 433 130 944 215 210 620 442 363 877 91 491 513 955 53 82 351 19 998 706 702 738 770 453 344 117 893 590 723 662 757 16 87 546 312 669 568 931 224 374 927 225 751 962 651 587 361 250 256 240 282 600 95 64 384 589 813 783 39 918 412 648 506 283 886 926 443 173 946 241 310 33 622 565 261 360 547 339 943 367 354 25 479 743 385 485 896 741", "output": "2042921.1539616778" }, { "input": "93\n957 395 826 67 185 4 455 880 683 654 463 84 258 878 553 592 124 585 9 133 20 609 43 452 725 125 801 537 700 685 771 155 566 376 19 690 383 352 174 208 177 416 304 1000 533 481 87 509 358 233 681 22 507 659 36 859 952 259 138 271 594 779 576 782 119 69 608 758 283 616 640 523 710 751 34 106 774 92 874 568 864 660 998 992 474 679 180 409 15 297 990 689 501", "output": "1310703.8710041976" }, { "input": "97\n70 611 20 30 904 636 583 262 255 501 604 660 212 128 199 138 545 576 506 528 12 410 77 888 783 972 431 188 338 485 148 793 907 678 281 922 976 680 252 724 253 920 177 361 721 798 960 572 99 622 712 466 608 49 612 345 266 751 63 594 40 695 532 789 520 930 825 929 48 59 405 135 109 735 508 186 495 772 375 587 201 324 447 610 230 947 855 318 856 956 313 810 931 175 668 183 688", "output": "1686117.9099228707" }, { "input": "96\n292 235 391 180 840 172 218 997 166 287 329 20 886 325 400 471 182 356 448 337 417 319 58 106 366 764 393 614 90 831 924 314 667 532 64 874 3 434 350 352 733 795 78 640 967 63 47 879 635 272 145 569 468 792 153 761 770 878 281 467 209 208 298 37 700 18 334 93 5 750 412 779 523 517 360 649 447 328 311 653 57 578 767 460 647 663 50 670 151 13 511 580 625 907 227 89", "output": "1419726.5608617242" }, { "input": "100\n469 399 735 925 62 153 707 723 819 529 200 624 57 708 245 384 889 11 639 638 260 419 8 142 403 298 204 169 887 388 241 983 885 267 643 943 417 237 452 562 6 839 149 742 832 896 100 831 712 754 679 743 135 222 445 680 210 955 220 63 960 487 514 824 481 584 441 997 795 290 10 45 510 678 844 503 407 945 850 84 858 934 500 320 936 663 736 592 161 670 606 465 864 969 293 863 868 393 899 744", "output": "1556458.0979239127" }, { "input": "100\n321 200 758 415 190 710 920 992 873 898 814 259 359 66 971 210 838 545 663 652 684 277 36 756 963 459 335 484 462 982 532 423 131 703 307 229 391 938 253 847 542 975 635 928 220 980 222 567 557 181 366 824 900 180 107 979 112 564 525 413 300 422 876 615 737 343 902 8 654 628 469 913 967 785 893 314 909 215 912 262 20 709 363 915 997 954 986 454 596 124 74 159 660 550 787 418 895 786 293 50", "output": "1775109.8050211088" }, { "input": "100\n859 113 290 762 701 63 188 431 810 485 671 673 99 658 194 227 511 435 941 212 551 124 89 222 42 321 657 815 898 171 216 482 707 567 724 491 414 942 820 351 48 653 685 312 586 24 20 627 602 498 533 173 463 262 621 466 119 299 580 964 510 987 40 698 521 998 847 651 746 215 808 563 785 837 631 772 404 923 682 244 232 214 390 350 968 771 517 900 70 543 934 554 681 368 642 575 891 728 478 317", "output": "1447969.4788174964" }, { "input": "100\n941 283 349 457 52 837 299 284 796 305 893 624 101 972 738 204 121 70 17 704 836 791 95 111 162 952 472 724 733 580 878 177 705 804 11 211 463 417 288 409 410 485 896 755 921 267 164 656 505 765 539 439 535 19 991 689 220 474 114 944 884 144 926 849 486 566 117 35 749 499 797 303 362 905 690 890 976 66 590 183 234 683 39 297 769 787 376 541 571 759 495 200 261 352 73 493 831 442 273 339", "output": "1597889.4218394549" }, { "input": "100\n110 868 147 888 291 282 916 542 917 337 235 595 498 621 814 249 261 713 445 666 142 275 319 49 900 543 333 606 487 670 620 769 852 258 230 867 603 491 714 839 879 37 21 74 590 190 397 506 499 967 152 862 200 107 145 23 614 167 857 475 79 598 270 906 626 116 89 59 651 846 723 201 50 699 522 408 634 132 226 414 824 764 513 586 526 238 556 162 667 173 684 415 527 743 10 442 552 274 350 822", "output": "1567230.6191330721" }, { "input": "100\n901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000", "output": "298608.3817237098" } ]	1,646,578,335	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	62	0	import math n = int(input()) R = list(map(int, input().split())) R = sorted(R) sum = 0 cont = 0 for ri in range(len(R)): if cont %2 == 0: sum+= R[ri]2 else: sum-= R[ri]2 cont += 1 print(math.pi * sum)	Title: Trace Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day, as Sherlock Holmes was tracking down one very important criminal, he found a wonderful painting on the wall. This wall could be represented as a plane. The painting had several concentric circles that divided the wall into several parts. Some parts were painted red and all the other were painted blue. Besides, any two neighboring parts were painted different colors, that is, the red and the blue color were alternating, i. e. followed one after the other. The outer area of the wall (the area that lied outside all circles) was painted blue. Help Sherlock Holmes determine the total area of red parts of the wall. Let us remind you that two circles are called concentric if their centers coincide. Several circles are called concentric if any two of them are concentric. Input Specification: The first line contains the single integer n (1<=≤<=n<=≤<=100). The second line contains n space-separated integers ri (1<=≤<=ri<=≤<=1000) — the circles' radii. It is guaranteed that all circles are different. Output Specification: Print the single real number — total area of the part of the wall that is painted red. The answer is accepted if absolute or relative error doesn't exceed 10<=-<=4. Demo Input: ['1\n1\n', '3\n1 4 2\n'] Demo Output: ['3.1415926536\n', '40.8407044967\n'] Note: In the first sample the picture is just one circle of radius 1. Inner part of the circle is painted red. The area of the red part equals π × 1<sup class="upper-index">2</sup> = π. In the second sample there are three circles of radii 1, 4 and 2. Outside part of the second circle is painted blue. Part between the second and the third circles is painted red. Part between the first and the third is painted blue. And, finally, the inner part of the first circle is painted red. Overall there are two red parts: the ring between the second and the third circles and the inner part of the first circle. Total area of the red parts is equal (π × 4<sup class="upper-index">2</sup> - π × 2<sup class="upper-index">2</sup>) + π × 1<sup class="upper-index">2</sup> = π × 12 + π = 13π	```python import math n = int(input()) R = list(map(int, input().split())) R = sorted(R) sum = 0 cont = 0 for ri in range(len(R)): if cont %2 == 0: sum+= R[ri]2 else: sum-= R[ri]2 cont += 1 print(math.pi * sum) ```	0
498	D	Traffic Jams in the Land	PROGRAMMING	2,400	[ "data structures", "dp", "number theory" ]		null	null	Some country consists of (n<=+<=1) cities, located along a straight highway. Let's number the cities with consecutive integers from 1 to n<=+<=1 in the order they occur along the highway. Thus, the cities are connected by n segments of the highway, the i-th segment connects cities number i and i<=+<=1. Every segment of the highway is associated with a positive integer ai<=><=1 — the period of traffic jams appearance on it. In order to get from city x to city y (x<=<<=y), some drivers use the following tactics. Initially the driver is in city x and the current time t equals zero. Until the driver arrives in city y, he perfors the following actions: - if the current time t is a multiple of ax, then the segment of the highway number x is now having traffic problems and the driver stays in the current city for one unit of time (formally speaking, we assign t<==<=t<=+<=1); - if the current time t is not a multiple of ax, then the segment of the highway number x is now clear and that's why the driver uses one unit of time to move to city x<=+<=1 (formally, we assign t<==<=t<=+<=1 and x<==<=x<=+<=1). You are developing a new traffic control system. You want to consecutively process q queries of two types: 1. determine the final value of time t after the ride from city x to city y (x<=<<=y) assuming that we apply the tactics that is described above. Note that for each query t is being reset to 0. 1. replace the period of traffic jams appearing on the segment number x by value y (formally, assign ax<==<=y). Write a code that will effectively process the queries given above.	The first line contains a single integer n (1<=≤<=n<=≤<=105) — the number of highway segments that connect the n<=+<=1 cities. The second line contains n integers a1,<=a2,<=...,<=an (2<=≤<=ai<=≤<=6) — the periods of traffic jams appearance on segments of the highway. The next line contains a single integer q (1<=≤<=q<=≤<=105) — the number of queries to process. The next q lines contain the descriptions of the queries in the format c, x, y (c — the query type). If c is character 'A', then your task is to process a query of the first type. In this case the following constraints are satisfied: 1<=≤<=x<=<<=y<=≤<=n<=+<=1. If c is character 'C', then you need to process a query of the second type. In such case, the following constraints are satisfied: 1<=≤<=x<=≤<=n, 2<=≤<=y<=≤<=6.	For each query of the first type output a single integer — the final value of time t after driving from city x to city y. Process the queries in the order in which they are given in the input.	[ "10\n2 5 3 2 3 5 3 4 2 4\n10\nC 10 6\nA 2 6\nA 1 3\nC 3 4\nA 3 11\nA 4 9\nA 5 6\nC 7 3\nA 8 10\nA 2 5\n" ]	[ "5\n3\n14\n6\n2\n4\n4\n" ]	none	2,000	[]	1,690,488,844	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	0	30	0	print("_RANDOM_GUESS_1690488844.0567067")# 1690488844.056725	Title: Traffic Jams in the Land Time Limit: None seconds Memory Limit: None megabytes Problem Description: Some country consists of (n<=+<=1) cities, located along a straight highway. Let's number the cities with consecutive integers from 1 to n<=+<=1 in the order they occur along the highway. Thus, the cities are connected by n segments of the highway, the i-th segment connects cities number i and i<=+<=1. Every segment of the highway is associated with a positive integer ai<=><=1 — the period of traffic jams appearance on it. In order to get from city x to city y (x<=<<=y), some drivers use the following tactics. Initially the driver is in city x and the current time t equals zero. Until the driver arrives in city y, he perfors the following actions: - if the current time t is a multiple of ax, then the segment of the highway number x is now having traffic problems and the driver stays in the current city for one unit of time (formally speaking, we assign t<==<=t<=+<=1); - if the current time t is not a multiple of ax, then the segment of the highway number x is now clear and that's why the driver uses one unit of time to move to city x<=+<=1 (formally, we assign t<==<=t<=+<=1 and x<==<=x<=+<=1). You are developing a new traffic control system. You want to consecutively process q queries of two types: 1. determine the final value of time t after the ride from city x to city y (x<=<<=y) assuming that we apply the tactics that is described above. Note that for each query t is being reset to 0. 1. replace the period of traffic jams appearing on the segment number x by value y (formally, assign ax<==<=y). Write a code that will effectively process the queries given above. Input Specification: The first line contains a single integer n (1<=≤<=n<=≤<=105) — the number of highway segments that connect the n<=+<=1 cities. The second line contains n integers a1,<=a2,<=...,<=an (2<=≤<=ai<=≤<=6) — the periods of traffic jams appearance on segments of the highway. The next line contains a single integer q (1<=≤<=q<=≤<=105) — the number of queries to process. The next q lines contain the descriptions of the queries in the format c, x, y (c — the query type). If c is character 'A', then your task is to process a query of the first type. In this case the following constraints are satisfied: 1<=≤<=x<=<<=y<=≤<=n<=+<=1. If c is character 'C', then you need to process a query of the second type. In such case, the following constraints are satisfied: 1<=≤<=x<=≤<=n, 2<=≤<=y<=≤<=6. Output Specification: For each query of the first type output a single integer — the final value of time t after driving from city x to city y. Process the queries in the order in which they are given in the input. Demo Input: ['10\n2 5 3 2 3 5 3 4 2 4\n10\nC 10 6\nA 2 6\nA 1 3\nC 3 4\nA 3 11\nA 4 9\nA 5 6\nC 7 3\nA 8 10\nA 2 5\n'] Demo Output: ['5\n3\n14\n6\n2\n4\n4\n'] Note: none	```python print("_RANDOM_GUESS_1690488844.0567067")# 1690488844.056725 ```	0
456	A	Laptops	PROGRAMMING	1,100	[ "sortings" ]		null	null	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. Please, check the guess of Alex. You are given descriptions of n laptops. Determine whether two described above laptops exist.	The first line contains an integer n (1<=≤<=n<=≤<=105) — the number of laptops. Next n lines contain two integers each, ai and bi (1<=≤<=ai,<=bi<=≤<=n), where ai is the price of the i-th laptop, and bi is the number that represents the quality of the i-th laptop (the larger the number is, the higher is the quality). All ai are distinct. All bi are distinct.	If Alex is correct, print "Happy Alex", otherwise print "Poor Alex" (without the quotes).	[ "2\n1 2\n2 1\n" ]	[ "Happy Alex\n" ]	none	500	[ { "input": "2\n1 2\n2 1", "output": "Happy Alex" }, { "input": "2\n1 1\n2 2", "output": "Poor Alex" }, { "input": "3\n2 2\n3 3\n1 1", "output": "Poor Alex" }, { "input": "3\n3 3\n1 2\n2 1", "output": "Happy Alex" }, { "input": "1\n1 1", "output": "Poor Alex" }, { "input": "3\n2 3\n1 1\n3 2", "output": "Happy Alex" }, { "input": "4\n4 1\n3 2\n2 3\n1 4", "output": "Happy Alex" }, { "input": "2\n2 1\n1 2", "output": "Happy Alex" }, { "input": "3\n3 2\n1 1\n2 3", "output": "Happy Alex" }, { "input": "3\n1 2\n2 3\n3 1", "output": "Happy Alex" }, { "input": "3\n1 2\n2 1\n3 3", "output": "Happy Alex" }, { "input": "3\n1 2\n2 3\n3 1", "output": "Happy Alex" } ]	1,674,300,107	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	5	1,000	8,192,000	num_t=int(input()) nums_all=[] for _ in range(num_t): nums=list(map(int,input().split())) nums_all.append(nums) state="Poor Alex" for i in range(num_t): for j in range(i+1,num_t): if nums_all[i][0]<nums_all[j][0] and nums_all[i][1]>nums_all[j][1]: state="Happy Alex" break elif nums_all[i][0]>nums_all[j][0] and nums_all[i][1]<nums_all[j][1]: state="Happy Alex" break print(state)	Title: Laptops Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. Please, check the guess of Alex. You are given descriptions of n laptops. Determine whether two described above laptops exist. Input Specification: The first line contains an integer n (1<=≤<=n<=≤<=105) — the number of laptops. Next n lines contain two integers each, ai and bi (1<=≤<=ai,<=bi<=≤<=n), where ai is the price of the i-th laptop, and bi is the number that represents the quality of the i-th laptop (the larger the number is, the higher is the quality). All ai are distinct. All bi are distinct. Output Specification: If Alex is correct, print "Happy Alex", otherwise print "Poor Alex" (without the quotes). Demo Input: ['2\n1 2\n2 1\n'] Demo Output: ['Happy Alex\n'] Note: none	```python num_t=int(input()) nums_all=[] for _ in range(num_t): nums=list(map(int,input().split())) nums_all.append(nums) state="Poor Alex" for i in range(num_t): for j in range(i+1,num_t): if nums_all[i][0]<nums_all[j][0] and nums_all[i][1]>nums_all[j][1]: state="Happy Alex" break elif nums_all[i][0]>nums_all[j][0] and nums_all[i][1]<nums_all[j][1]: state="Happy Alex" break print(state) ```	0
237	A	Free Cash	PROGRAMMING	1,000	[ "implementation" ]		null	null	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 hi hours mi 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. Valera 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. Help Valera count the minimum number of cashes to work at his cafe next day, so that they can serve all visitors.	The first line contains a single integer n (1<=≤<=n<=≤<=105), that is the number of cafe visitors. Each of the following n lines has two space-separated integers hi and mi (0<=≤<=hi<=≤<=23; 0<=≤<=mi<=≤<=59), representing the time when the i-th person comes into the cafe. Note that the time is given in the chronological order. All time is given within one 24-hour period.	Print a single integer — the minimum number of cashes, needed to serve all clients next day.	[ "4\n8 0\n8 10\n8 10\n8 45\n", "3\n0 12\n10 11\n22 22\n" ]	[ "2\n", "1\n" ]	In the first sample it is not enough one cash to serve all clients, because two visitors will come into cafe in 8:10. Therefore, if there will be one cash in cafe, then one customer will be served by it, and another one will not wait and will go away. In the second sample all visitors will come in different times, so it will be enough one cash.	500	[ { "input": "4\n8 0\n8 10\n8 10\n8 45", "output": "2" }, { "input": "3\n0 12\n10 11\n22 22", "output": "1" }, { "input": "5\n12 8\n15 27\n15 27\n16 2\n19 52", "output": "2" }, { "input": "7\n5 6\n7 34\n7 34\n7 34\n12 29\n15 19\n20 23", "output": "3" }, { "input": "8\n0 36\n4 7\n4 7\n4 7\n11 46\n12 4\n15 39\n18 6", "output": "3" }, { "input": "20\n4 12\n4 21\n4 27\n4 56\n5 55\n7 56\n11 28\n11 36\n14 58\n15 59\n16 8\n17 12\n17 23\n17 23\n17 23\n17 23\n17 23\n17 23\n20 50\n22 32", "output": "6" }, { "input": "10\n1 30\n1 30\n1 30\n1 30\n1 30\n1 30\n1 30\n1 30\n1 30\n1 30", "output": "10" }, { "input": "50\n0 23\n1 21\n2 8\n2 45\n3 1\n4 19\n4 37\n7 7\n7 40\n8 43\n9 51\n10 13\n11 2\n11 19\n11 30\n12 37\n12 37\n12 37\n12 37\n12 37\n12 37\n12 37\n12 37\n12 54\n13 32\n13 42\n14 29\n14 34\n14 48\n15 0\n15 27\n16 22\n16 31\n17 25\n17 26\n17 33\n18 14\n18 16\n18 20\n19 0\n19 5\n19 56\n20 22\n21 26\n22 0\n22 10\n22 11\n22 36\n23 17\n23 20", "output": "8" }, { "input": "10\n0 39\n1 35\n1 49\n1 51\n5 24\n7 40\n7 56\n16 42\n23 33\n23 49", "output": "1" }, { "input": "15\n0 16\n6 15\n8 2\n8 6\n8 7\n10 1\n10 1\n10 3\n10 12\n13 5\n14 16\n14 16\n14 16\n14 16\n14 16", "output": "5" }, { "input": "2\n0 24\n1 0", "output": "1" }, { "input": "1\n0 0", "output": "1" }, { "input": "1\n1 5", "output": "1" }, { "input": "1\n1 1", "output": "1" }, { "input": "3\n0 0\n0 0\n0 0", "output": "3" }, { "input": "1\n5 0", "output": "1" }, { "input": "5\n0 0\n0 0\n0 0\n0 0\n0 0", "output": "5" }, { "input": "1\n10 10", "output": "1" }, { "input": "1\n8 0", "output": "1" }, { "input": "10\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0", "output": "10" }, { "input": "2\n0 0\n0 1", "output": "1" }, { "input": "2\n8 5\n8 5", "output": "2" } ]	1,678,918,018	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	8	2,000	204,800	##nums = map(int, input().split()) ##s1 = list(map(int, input().split())) ##s1 = list(map(int, ' '.join(input()).split())) n = int(input()) s = [] for i in range(n): s.append(input()) count = 0 for i in range(n): t = s.count(s[i]) if count < t: count = t print(count)	Title: Free Cash Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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 hi hours mi 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. Valera 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. Help Valera count the minimum number of cashes to work at his cafe next day, so that they can serve all visitors. Input Specification: The first line contains a single integer n (1<=≤<=n<=≤<=105), that is the number of cafe visitors. Each of the following n lines has two space-separated integers hi and mi (0<=≤<=hi<=≤<=23; 0<=≤<=mi<=≤<=59), representing the time when the i-th person comes into the cafe. Note that the time is given in the chronological order. All time is given within one 24-hour period. Output Specification: Print a single integer — the minimum number of cashes, needed to serve all clients next day. Demo Input: ['4\n8 0\n8 10\n8 10\n8 45\n', '3\n0 12\n10 11\n22 22\n'] Demo Output: ['2\n', '1\n'] Note: In the first sample it is not enough one cash to serve all clients, because two visitors will come into cafe in 8:10. Therefore, if there will be one cash in cafe, then one customer will be served by it, and another one will not wait and will go away. In the second sample all visitors will come in different times, so it will be enough one cash.	```python ##nums = map(int, input().split()) ##s1 = list(map(int, input().split())) ##s1 = list(map(int, ' '.join(input()).split())) n = int(input()) s = [] for i in range(n): s.append(input()) count = 0 for i in range(n): t = s.count(s[i]) if count < t: count = t print(count) ```	0
384	B	Multitasking	PROGRAMMING	1,500	[ "greedy", "implementation", "sortings", "two pointers" ]		null	null	Iahub wants to enhance his multitasking abilities. In order to do this, he wants to sort n arrays simultaneously, each array consisting of m integers. Iahub can choose a pair of distinct indices i and j (1<=≤<=i,<=j<=≤<=m,<=i<=≠<=j). Then in each array the values at positions i and j are swapped only if the value at position i is strictly greater than the value at position j. Iahub wants to find an array of pairs of distinct indices that, chosen in order, sort all of the n arrays in ascending or descending order (the particular order is given in input). The size of the array can be at most (at most pairs). Help Iahub, find any suitable array.	The first line contains three integers n (1<=≤<=<=n<=≤<=1000), m (1<=≤<=m<=≤<=<=100) and k. Integer k is 0 if the arrays must be sorted in ascending order, and 1 if the arrays must be sorted in descending order. Each line i of the next n lines contains m integers separated by a space, representing the i-th array. For each element x of the array i, 1<=≤<=x<=≤<=106 holds.	On the first line of the output print an integer p, the size of the array (p can be at most ). Each of the next p lines must contain two distinct integers i and j (1<=≤<=i,<=j<=≤<=m,<=i<=≠<=j), representing the chosen indices. If there are multiple correct answers, you can print any.	[ "2 5 0\n1 3 2 5 4\n1 4 3 2 5\n", "3 2 1\n1 2\n2 3\n3 4\n" ]	[ "3\n2 4\n2 3\n4 5\n", "1\n2 1\n" ]	Consider the first sample. After the first operation, the arrays become [1, 3, 2, 5, 4] and [1, 2, 3, 4, 5]. After the second operation, the arrays become [1, 2, 3, 5, 4] and [1, 2, 3, 4, 5]. After the third operation they become [1, 2, 3, 4, 5] and [1, 2, 3, 4, 5].	1,000	[ { "input": "2 5 0\n1 3 2 5 4\n1 4 3 2 5", "output": "3\n2 4\n2 3\n4 5" }, { "input": "3 2 1\n1 2\n2 3\n3 4", "output": "1\n2 1" }, { "input": "2 5 0\n836096 600367 472071 200387 79763\n714679 505282 233544 157810 152591", "output": "10\n1 2\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 4\n3 5\n4 5" }, { "input": "2 5 1\n331081 525217 574775 753333 840639\n225591 347017 538639 620341 994088", "output": "10\n2 1\n3 1\n4 1\n5 1\n3 2\n4 2\n5 2\n4 3\n5 3\n5 4" }, { "input": "1 1 0\n1", "output": "0" }, { "input": "1 1 1\n1", "output": "0" }, { "input": "2 1 0\n1\n2", "output": "0" }, { "input": "1 2 1\n2 1", "output": "1\n2 1" }, { "input": "2 2 0\n2 1\n3 1", "output": "1\n1 2" }, { "input": "2 2 0\n2 1\n1 3", "output": "1\n1 2" }, { "input": "2 2 1\n2 1\n3 1", "output": "1\n2 1" } ]	1,656,926,986	2,147,483,647	Python 3	OK	TESTS	31	61	0	n, m, k = map(int, input().split()) print(m * (m - 1) // 2) for i in range(1, m): for j in range(i + 1, m + 1): if k == 0: print (i,j) else: print(j,i) # Mon Jul 04 2022 09:29:45 GMT+0000 (Coordinated Universal Time)	Title: Multitasking Time Limit: None seconds Memory Limit: None megabytes Problem Description: Iahub wants to enhance his multitasking abilities. In order to do this, he wants to sort n arrays simultaneously, each array consisting of m integers. Iahub can choose a pair of distinct indices i and j (1<=≤<=i,<=j<=≤<=m,<=i<=≠<=j). Then in each array the values at positions i and j are swapped only if the value at position i is strictly greater than the value at position j. Iahub wants to find an array of pairs of distinct indices that, chosen in order, sort all of the n arrays in ascending or descending order (the particular order is given in input). The size of the array can be at most (at most pairs). Help Iahub, find any suitable array. Input Specification: The first line contains three integers n (1<=≤<=<=n<=≤<=1000), m (1<=≤<=m<=≤<=<=100) and k. Integer k is 0 if the arrays must be sorted in ascending order, and 1 if the arrays must be sorted in descending order. Each line i of the next n lines contains m integers separated by a space, representing the i-th array. For each element x of the array i, 1<=≤<=x<=≤<=106 holds. Output Specification: On the first line of the output print an integer p, the size of the array (p can be at most ). Each of the next p lines must contain two distinct integers i and j (1<=≤<=i,<=j<=≤<=m,<=i<=≠<=j), representing the chosen indices. If there are multiple correct answers, you can print any. Demo Input: ['2 5 0\n1 3 2 5 4\n1 4 3 2 5\n', '3 2 1\n1 2\n2 3\n3 4\n'] Demo Output: ['3\n2 4\n2 3\n4 5\n', '1\n2 1\n'] Note: Consider the first sample. After the first operation, the arrays become [1, 3, 2, 5, 4] and [1, 2, 3, 4, 5]. After the second operation, the arrays become [1, 2, 3, 5, 4] and [1, 2, 3, 4, 5]. After the third operation they become [1, 2, 3, 4, 5] and [1, 2, 3, 4, 5].	```python n, m, k = map(int, input().split()) print(m * (m - 1) // 2) for i in range(1, m): for j in range(i + 1, m + 1): if k == 0: print (i,j) else: print(j,i) # Mon Jul 04 2022 09:29:45 GMT+0000 (Coordinated Universal Time) ```	3
83	A	Magical Array	PROGRAMMING	1,300	[ "math" ]	A. Magical Array	2	256	Valery is very interested in magic. Magic attracts him so much that he sees it everywhere. He explains any strange and weird phenomenon through intervention of supernatural forces. But who would have thought that even in a regular array of numbers Valera manages to see something beautiful and magical. Valera absolutely accidentally got a piece of ancient parchment on which an array of numbers was written. He immediately thought that the numbers in this array were not random. As a result of extensive research Valera worked out a wonderful property that a magical array should have: an array is defined as magic if its minimum and maximum coincide. He decided to share this outstanding discovery with you, but he asks you for help in return. Despite the tremendous intelligence and wit, Valera counts very badly and so you will have to complete his work. All you have to do is count the number of magical subarrays of the original array of numbers, written on the parchment. Subarray is defined as non-empty sequence of consecutive elements.	The first line of the input data contains an integer n (1<=≤<=n<=≤<=105). The second line contains an array of original integers a1,<=a2,<=...,<=an (<=-<=109<=≤<=ai<=≤<=109).	Print on the single line the answer to the problem: the amount of subarrays, which are magical. Please do not use the %lld specificator to read or write 64-bit numbers in C++. It is recommended to use cin, cout streams (you can also use the %I64d specificator).	[ "4\n2 1 1 4\n", "5\n-2 -2 -2 0 1\n" ]	[ "5\n", "8\n" ]	Notes to sample tests: Magical subarrays are shown with pairs of indices [a;b] of the beginning and the end. In the first sample: [1;1], [2;2], [3;3], [4;4], [2;3]. In the second sample: [1;1], [2;2], [3;3], [4;4], [5;5], [1;2], [2;3], [1;3].	500	[ { "input": "4\n2 1 1 4", "output": "5" }, { "input": "5\n-2 -2 -2 0 1", "output": "8" }, { "input": "1\n10", "output": "1" }, { "input": "2\n5 6", "output": "2" }, { "input": "5\n5 5 4 5 5", "output": "7" }, { "input": "8\n1 2 0 0 0 0 3 3", "output": "15" }, { "input": "12\n-4 3 3 2 3 3 3 -4 2 -4 -4 -4", "output": "19" }, { "input": "10\n7 1 0 10 0 -5 -3 -2 0 0", "output": "11" }, { "input": "20\n6 0 0 -3 1 -3 0 -8 1 3 5 2 -1 -5 -1 9 0 6 -2 4", "output": "21" }, { "input": "100\n0 -18 -9 -15 3 16 -28 0 -28 0 28 -20 -9 9 -11 0 18 -15 -18 -26 0 -27 -25 -22 6 -5 8 14 -17 24 20 3 -6 24 -27 1 -23 0 4 12 -20 0 -10 30 22 -6 13 16 0 15 17 -8 -2 0 -5 13 11 23 -17 -29 10 15 -28 0 -23 4 20 17 -7 -5 -16 -17 16 2 20 19 -8 0 8 -5 12 0 0 -14 -15 -28 -10 20 0 8 -1 10 14 9 0 4 -16 15 13 -10", "output": "101" }, { "input": "50\n2 0 2 0 0 0 0 -1 -2 -2 -2 1 1 2 2 0 2 0 2 -3 0 0 0 0 3 1 -2 0 -1 0 -2 3 -1 2 0 2 0 0 0 0 2 0 1 0 0 3 0 0 -2 0", "output": "75" }, { "input": "2\n-510468670 0", "output": "2" }, { "input": "150\n0 -2 1 -2 0 0 0 0 -2 0 -2 -1 0 0 2 0 1 -2 1 -1 0 0 0 2 -2 2 -1 0 0 0 -2 0 2 0 1 0 -2 0 -2 -1 -1 -2 -2 2 0 0 1 -2 -2 -1 -2 0 2 1 1 -1 1 0 -2 2 0 0 0 1 -1 0 -2 -1 0 -2 2 1 1 0 0 2 0 0 2 -1 0 0 2 0 2 0 -2 -1 1 -2 1 0 0 -2 -1 -1 0 0 2 -1 -1 -1 -1 -2 0 0 2 -1 -1 1 0 0 1 -1 0 0 -1 2 2 0 0 0 -1 -2 0 1 0 -1 0 -1 -1 0 2 0 1 2 0 0 2 0 0 1 2 0 2 -2 2 0 2 2", "output": "196" } ]	1,624,849,676	2,147,483,647	PyPy 3	OK	TESTS	50	404	11,059,200	n = int(input()) l = list(map(int, input().split())) ans = 0 c = 1 temp = l[0] for i in range(1, n): if temp==l[i]: c+=1 else: ans+=((c(c+1))//2) c=1 temp=l[i] print(ans+(c(c+1))//2)	Title: Magical Array Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Valery is very interested in magic. Magic attracts him so much that he sees it everywhere. He explains any strange and weird phenomenon through intervention of supernatural forces. But who would have thought that even in a regular array of numbers Valera manages to see something beautiful and magical. Valera absolutely accidentally got a piece of ancient parchment on which an array of numbers was written. He immediately thought that the numbers in this array were not random. As a result of extensive research Valera worked out a wonderful property that a magical array should have: an array is defined as magic if its minimum and maximum coincide. He decided to share this outstanding discovery with you, but he asks you for help in return. Despite the tremendous intelligence and wit, Valera counts very badly and so you will have to complete his work. All you have to do is count the number of magical subarrays of the original array of numbers, written on the parchment. Subarray is defined as non-empty sequence of consecutive elements. Input Specification: The first line of the input data contains an integer n (1<=≤<=n<=≤<=105). The second line contains an array of original integers a1,<=a2,<=...,<=an (<=-<=109<=≤<=ai<=≤<=109). Output Specification: Print on the single line the answer to the problem: the amount of subarrays, which are magical. Please do not use the %lld specificator to read or write 64-bit numbers in C++. It is recommended to use cin, cout streams (you can also use the %I64d specificator). Demo Input: ['4\n2 1 1 4\n', '5\n-2 -2 -2 0 1\n'] Demo Output: ['5\n', '8\n'] Note: Notes to sample tests: Magical subarrays are shown with pairs of indices [a;b] of the beginning and the end. In the first sample: [1;1], [2;2], [3;3], [4;4], [2;3]. In the second sample: [1;1], [2;2], [3;3], [4;4], [5;5], [1;2], [2;3], [1;3].	```python n = int(input()) l = list(map(int, input().split())) ans = 0 c = 1 temp = l[0] for i in range(1, n): if temp==l[i]: c+=1 else: ans+=((c(c+1))//2) c=1 temp=l[i] print(ans+(c(c+1))//2) ```	3.878401
588	A	Duff and Meat	PROGRAMMING	900	[ "greedy" ]		null	null	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 ai kilograms of meat. There is a big shop uptown and Malek wants to buy meat for her from there. In i-th day, they sell meat for pi dollars per kilogram. Malek knows all numbers a1,<=...,<=an and p1,<=...,<=pn. In each day, he can buy arbitrary amount of meat, also he can keep some meat he has for the future. Malek 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.	The first line of input contains integer n (1<=≤<=n<=≤<=105), the number of days. In the next n lines, i-th line contains two integers ai and pi (1<=≤<=ai,<=pi<=≤<=100), the amount of meat Duff needs and the cost of meat in that day.	Print the minimum money needed to keep Duff happy for n days, in one line.	[ "3\n1 3\n2 2\n3 1\n", "3\n1 3\n2 1\n3 2\n" ]	[ "10\n", "8\n" ]	In the first sample case: An optimal way would be to buy 1 kg on the first day, 2 kg on the second day and 3 kg on the third day. In the second sample case: An optimal way would be to buy 1 kg on the first day and 5 kg (needed meat for the second and third day) on the second day.	750	[ { "input": "3\n1 3\n2 2\n3 1", "output": "10" }, { "input": "3\n1 3\n2 1\n3 2", "output": "8" }, { "input": "1\n39 52", "output": "2028" }, { "input": "2\n25 56\n94 17", "output": "2998" }, { "input": "5\n39 21\n95 89\n73 90\n9 55\n85 32", "output": "6321" }, { "input": "12\n70 11\n74 27\n32 11\n26 83\n57 18\n97 28\n75 43\n75 21\n84 29\n16 2\n89 63\n21 88", "output": "6742" }, { "input": "2\n100 68\n38 80", "output": "9384" } ]	1,589,536,273	2,147,483,647	Python 3	OK	TESTS	30	311	6,656,000	# -- coding: utf-8 -- """ Created on Fri May 15 15:02:59 2020 @author: Administrator """ ndays = int(input()) price = 100 money = 0 while(ndays): need,p = map(int,input().split()) if p<price: price = p money += price*need ndays -=1 print(money)	Title: Duff and Meat Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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 ai kilograms of meat. There is a big shop uptown and Malek wants to buy meat for her from there. In i-th day, they sell meat for pi dollars per kilogram. Malek knows all numbers a1,<=...,<=an and p1,<=...,<=pn. In each day, he can buy arbitrary amount of meat, also he can keep some meat he has for the future. Malek 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 Specification: The first line of input contains integer n (1<=≤<=n<=≤<=105), the number of days. In the next n lines, i-th line contains two integers ai and pi (1<=≤<=ai,<=pi<=≤<=100), the amount of meat Duff needs and the cost of meat in that day. Output Specification: Print the minimum money needed to keep Duff happy for n days, in one line. Demo Input: ['3\n1 3\n2 2\n3 1\n', '3\n1 3\n2 1\n3 2\n'] Demo Output: ['10\n', '8\n'] Note: In the first sample case: An optimal way would be to buy 1 kg on the first day, 2 kg on the second day and 3 kg on the third day. In the second sample case: An optimal way would be to buy 1 kg on the first day and 5 kg (needed meat for the second and third day) on the second day.	```python # -- coding: utf-8 -- """ Created on Fri May 15 15:02:59 2020 @author: Administrator """ ndays = int(input()) price = 100 money = 0 while(ndays): need,p = map(int,input().split()) if p<price: price = p money += price*need ndays -=1 print(money) ```	3
525	B	Pasha and String	PROGRAMMING	1,400	[ "constructive algorithms", "greedy", "math", "strings" ]		null	null	Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to \|s\| from left to right, where \|s\| is the length of the given string. Pasha didn't like his present very much so he decided to change it. After his birthday Pasha spent m days performing the following transformations on his string — each day he chose integer ai and reversed a piece of string (a segment) from position ai to position \|s\|<=-<=ai<=+<=1. It is guaranteed that 2·ai<=≤<=\|s\|. You face the following task: determine what Pasha's string will look like after m days.	The first line of the input contains Pasha's string s of length from 2 to 2·105 characters, consisting of lowercase Latin letters. The second line contains a single integer m (1<=≤<=m<=≤<=105) — the number of days when Pasha changed his string. The third line contains m space-separated elements ai (1<=≤<=ai; 2·ai<=≤<=\|s\|) — the position from which Pasha started transforming the string on the i-th day.	In the first line of the output print what Pasha's string s will look like after m days.	[ "abcdef\n1\n2\n", "vwxyz\n2\n2 2\n", "abcdef\n3\n1 2 3\n" ]	[ "aedcbf\n", "vwxyz\n", "fbdcea\n" ]	none	750	[ { "input": "abcdef\n1\n2", "output": "aedcbf" }, { "input": "vwxyz\n2\n2 2", "output": "vwxyz" }, { "input": "abcdef\n3\n1 2 3", "output": "fbdcea" }, { "input": "jc\n5\n1 1 1 1 1", "output": "cj" }, { "input": "wljqgdlxyc\n13\n3 4 3 3 5 4 4 2 4 4 5 3 3", "output": "wyjldgqxlc" }, { "input": "keicnqmuqinhsmtudqcilocxkbqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlphhboycfavs\n2\n5 12", "output": "keiccyobhhphsmtudqcilocxkbqgzhbkitmqwttdyoyvcbxincwjryzknubpacsngorexaldfurondbednowemnnlniqumqnfavs" }, { "input": "xwcxggxvfqbdklewbxkjzibmufnaywuxsqvwakefxbbkfandvigasbhbatsxyqxicrosatfsfybedklsaztyyiuurfbrzmwumujy\n100\n14 43 30 13 8 19 33 7 8 14 15 35 5 18 44 1 35 1 18 7 50 47 9 49 28 29 39 37 27 17 19 12 5 24 37 42 37 23 35 31 10 26 5 38 40 34 42 47 2 40 43 34 16 25 14 45 35 38 46 48 49 27 49 38 10 49 5 7 3 3 41 25 24 34 37 33 17 50 48 11 40 43 48 10 9 50 18 39 32 13 26 40 37 16 45 50 27 3 7 31", "output": "xjcxggxvfbbruliyyxkjzikdebnfyftxsorcaxqyxbtkfhbdvigasnababsxfekiwvqsauwsayfumblsaztbweukdfqrzmwumuwy" } ]	1,614,300,189	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	27	2,000	10,444,800	s=input() n=int(input()) a=sorted(list(map(int,input().split()))) b=len(s) c=1 d=int(a[0]) for i in range(1,n): if a[i]==d: c+=1 else: if c%2==1: d=int(d) v=s[d-1:b-d+1] v=v[::-1] s=s[0:d-1]+v+s[b-d+1:b] c=1 d=a[i] if c%2==1: d=int(d) v=s[d-1:b-d+1] v=v[::-1] s=s[0:d-1]+v+s[b-d+1:b] print(s)	Title: Pasha and String Time Limit: None seconds Memory Limit: None megabytes Problem Description: Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to \|s\| from left to right, where \|s\| is the length of the given string. Pasha didn't like his present very much so he decided to change it. After his birthday Pasha spent m days performing the following transformations on his string — each day he chose integer ai and reversed a piece of string (a segment) from position ai to position \|s\|<=-<=ai<=+<=1. It is guaranteed that 2·ai<=≤<=\|s\|. You face the following task: determine what Pasha's string will look like after m days. Input Specification: The first line of the input contains Pasha's string s of length from 2 to 2·105 characters, consisting of lowercase Latin letters. The second line contains a single integer m (1<=≤<=m<=≤<=105) — the number of days when Pasha changed his string. The third line contains m space-separated elements ai (1<=≤<=ai; 2·ai<=≤<=\|s\|) — the position from which Pasha started transforming the string on the i-th day. Output Specification: In the first line of the output print what Pasha's string s will look like after m days. Demo Input: ['abcdef\n1\n2\n', 'vwxyz\n2\n2 2\n', 'abcdef\n3\n1 2 3\n'] Demo Output: ['aedcbf\n', 'vwxyz\n', 'fbdcea\n'] Note: none	```python s=input() n=int(input()) a=sorted(list(map(int,input().split()))) b=len(s) c=1 d=int(a[0]) for i in range(1,n): if a[i]==d: c+=1 else: if c%2==1: d=int(d) v=s[d-1:b-d+1] v=v[::-1] s=s[0:d-1]+v+s[b-d+1:b] c=1 d=a[i] if c%2==1: d=int(d) v=s[d-1:b-d+1] v=v[::-1] s=s[0:d-1]+v+s[b-d+1:b] print(s) ```	0
699	A	Launch of Collider	PROGRAMMING	1,000	[ "implementation" ]		null	null	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, xi 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. You 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. Write 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.	The first line contains the positive integer n (1<=≤<=n<=≤<=200<=000) — the number of particles. The second line contains n symbols "L" and "R". If the i-th symbol equals "L", then the i-th particle will move to the left, otherwise the i-th symbol equals "R" and the i-th particle will move to the right. The third line contains the sequence of pairwise distinct even integers x1,<=x2,<=...,<=xn (0<=≤<=xi<=≤<=109) — the coordinates of particles in the order from the left to the right. It is guaranteed that the coordinates of particles are given in the increasing order.	In the first line print the only integer — the first moment (in microseconds) when two particles are at the same point and there will be an explosion. Print the only integer -1, if the collision of particles doesn't happen.	[ "4\nRLRL\n2 4 6 10\n", "3\nLLR\n40 50 60\n" ]	[ "1\n", "-1\n" ]	In the first sample case the first explosion will happen in 1 microsecond because the particles number 1 and 2 will simultaneously be at the same point with the coordinate 3. In the second sample case there will be no explosion because there are no particles which will simultaneously be at the same point.	500	[ { "input": "4\nRLRL\n2 4 6 10", "output": "1" }, { "input": "3\nLLR\n40 50 60", "output": "-1" }, { "input": "4\nRLLR\n46 230 264 470", "output": "92" }, { "input": "6\nLLRLLL\n446 492 650 844 930 970", "output": "97" }, { "input": "8\nRRLLLLLL\n338 478 512 574 594 622 834 922", "output": "17" }, { "input": "10\nLRLRLLRRLR\n82 268 430 598 604 658 670 788 838 1000", "output": "3" }, { "input": "2\nRL\n0 1000000000", "output": "500000000" }, { "input": "12\nLRLLRRRRLRLL\n254 1260 1476 1768 2924 4126 4150 4602 5578 7142 8134 9082", "output": "108" }, { "input": "14\nRLLRRLRLLRLLLR\n698 2900 3476 3724 3772 3948 4320 4798 5680 6578 7754 8034 8300 8418", "output": "88" }, { "input": "16\nRRLLLRLRLLLLRLLR\n222 306 968 1060 1636 1782 2314 2710 3728 4608 5088 6790 6910 7156 7418 7668", "output": "123" }, { "input": "18\nRLRLLRRRLLLRLRRLRL\n1692 2028 2966 3008 3632 4890 5124 5838 6596 6598 6890 8294 8314 8752 8868 9396 9616 9808", "output": "10" }, { "input": "20\nRLLLLLLLRRRRLRRLRRLR\n380 902 1400 1834 2180 2366 2562 2596 2702 2816 3222 3238 3742 5434 6480 7220 7410 8752 9708 9970", "output": "252" }, { "input": "22\nLRRRRRRRRRRRLLRRRRRLRL\n1790 2150 2178 2456 2736 3282 3622 4114 4490 4772 5204 5240 5720 5840 5910 5912 6586 7920 8584 9404 9734 9830", "output": "48" }, { "input": "24\nLLRLRRLLRLRRRRLLRRLRLRRL\n100 360 864 1078 1360 1384 1438 2320 2618 3074 3874 3916 3964 5178 5578 6278 6630 6992 8648 8738 8922 8930 9276 9720", "output": "27" }, { "input": "26\nRLLLLLLLRLRRLRLRLRLRLLLRRR\n908 1826 2472 2474 2728 3654 3716 3718 3810 3928 4058 4418 4700 5024 5768 6006 6128 6386 6968 7040 7452 7774 7822 8726 9338 9402", "output": "59" }, { "input": "28\nRRLRLRRRRRRLLLRRLRRLLLRRLLLR\n156 172 1120 1362 2512 3326 3718 4804 4990 5810 6242 6756 6812 6890 6974 7014 7088 7724 8136 8596 8770 8840 9244 9250 9270 9372 9400 9626", "output": "10" }, { "input": "30\nRLLRLRLLRRRLRRRLLLLLLRRRLRRLRL\n128 610 1680 2436 2896 2994 3008 3358 3392 4020 4298 4582 4712 4728 5136 5900 6088 6232 6282 6858 6934 7186 7224 7256 7614 8802 8872 9170 9384 9794", "output": "7" }, { "input": "10\nLLLLRRRRRR\n0 2 4 6 8 10 12 14 16 18", "output": "-1" }, { "input": "5\nLLLLL\n0 10 20 30 40", "output": "-1" }, { "input": "6\nRRRRRR\n40 50 60 70 80 100", "output": "-1" }, { "input": "1\nR\n0", "output": "-1" }, { "input": "2\nRL\n2 1000000000", "output": "499999999" }, { "input": "2\nRL\n0 400000", "output": "200000" }, { "input": "2\nRL\n0 200002", "output": "100001" }, { "input": "2\nRL\n2 20000000", "output": "9999999" }, { "input": "4\nLLRL\n2 4 10 100", "output": "45" }, { "input": "4\nRLRL\n2 10 12 14", "output": "1" }, { "input": "2\nRL\n0 100000000", "output": "50000000" }, { "input": "2\nRL\n2 600002", "output": "300000" }, { "input": "1\nL\n0", "output": "-1" }, { "input": "2\nRL\n0 600000", "output": "300000" }, { "input": "5\nRRRRR\n0 2 4 6 8", "output": "-1" }, { "input": "2\nRL\n2 200000000", "output": "99999999" }, { "input": "2\nRL\n0 267382766", "output": "133691383" }, { "input": "3\nRRL\n4 8 999999998", "output": "499999995" }, { "input": "2\nRL\n0 2", "output": "1" }, { "input": "2\nRL\n2 400002", "output": "200000" }, { "input": "2\nLL\n2 4", "output": "-1" }, { "input": "2\nLL\n0 2", "output": "-1" }, { "input": "2\nRL\n0 100000", "output": "50000" }, { "input": "2\nRL\n2 200000020", "output": "100000009" }, { "input": "2\nRL\n2000000 4000000", "output": "1000000" }, { "input": "2\nRL\n0 199998", "output": "99999" }, { "input": "3\nLRR\n40 50 60", "output": "-1" }, { "input": "2\nRL\n200 400400", "output": "200100" }, { "input": "2\nRL\n2 400004", "output": "200001" }, { "input": "2\nRL\n0 200000000", "output": "100000000" } ]	1,689,629,783	2,147,483,647	PyPy 3-64	OK	TESTS	85	124	27,136,000	def solve(): n = int(input()) directions = input() positions = list(map(int, input().split())) actual_idx = 0 min_time = 10**9+1 ans = -1 while actual_idx < n-1: if (directions[actual_idx] == 'R' and directions[actual_idx+1] == 'L'): act_time = (positions[actual_idx+1] - positions[actual_idx])//2 if (act_time < min_time): min_time = act_time ans = act_time actual_idx+=1 print (ans) def main(): solve() main()	Title: Launch of Collider Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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, xi 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. You 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. Write 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 Specification: The first line contains the positive integer n (1<=≤<=n<=≤<=200<=000) — the number of particles. The second line contains n symbols "L" and "R". If the i-th symbol equals "L", then the i-th particle will move to the left, otherwise the i-th symbol equals "R" and the i-th particle will move to the right. The third line contains the sequence of pairwise distinct even integers x1,<=x2,<=...,<=xn (0<=≤<=xi<=≤<=109) — the coordinates of particles in the order from the left to the right. It is guaranteed that the coordinates of particles are given in the increasing order. Output Specification: In the first line print the only integer — the first moment (in microseconds) when two particles are at the same point and there will be an explosion. Print the only integer -1, if the collision of particles doesn't happen. Demo Input: ['4\nRLRL\n2 4 6 10\n', '3\nLLR\n40 50 60\n'] Demo Output: ['1\n', '-1\n'] Note: In the first sample case the first explosion will happen in 1 microsecond because the particles number 1 and 2 will simultaneously be at the same point with the coordinate 3. In the second sample case there will be no explosion because there are no particles which will simultaneously be at the same point.	```python def solve(): n = int(input()) directions = input() positions = list(map(int, input().split())) actual_idx = 0 min_time = 10**9+1 ans = -1 while actual_idx < n-1: if (directions[actual_idx] == 'R' and directions[actual_idx+1] == 'L'): act_time = (positions[actual_idx+1] - positions[actual_idx])//2 if (act_time < min_time): min_time = act_time ans = act_time actual_idx+=1 print (ans) def main(): solve() main() ```	3
4	B	Before an Exam	PROGRAMMING	1,200	[ "constructive algorithms", "greedy" ]	B. Before an Exam	0	64	Tomorrow Peter has a Biology exam. He does not like this subject much, but d days ago he learnt that he would have to take this exam. Peter's strict parents made him prepare for the exam immediately, for this purpose he has to study not less than minTimei and not more than maxTimei hours per each i-th day. Moreover, they warned Peter that a day before the exam they would check how he has followed their instructions. So, today is the day when Peter's parents ask him to show the timetable of his preparatory studies. But the boy has counted only the sum of hours sumTime spent him on preparation, and now he wants to know if he can show his parents a timetable sсhedule with d numbers, where each number sсhedulei stands for the time in hours spent by Peter each i-th day on biology studies, and satisfying the limitations imposed by his parents, and at the same time the sum total of all schedulei should equal to sumTime.	The first input line contains two integer numbers d,<=sumTime (1<=≤<=d<=≤<=30,<=0<=≤<=sumTime<=≤<=240) — the amount of days, during which Peter studied, and the total amount of hours, spent on preparation. Each of the following d lines contains two integer numbers minTimei,<=maxTimei (0<=≤<=minTimei<=≤<=maxTimei<=≤<=8), separated by a space — minimum and maximum amount of hours that Peter could spent in the i-th day.	In the first line print YES, and in the second line print d numbers (separated by a space), each of the numbers — amount of hours, spent by Peter on preparation in the corresponding day, if he followed his parents' instructions; or print NO in the unique line. If there are many solutions, print any of them.	[ "1 48\n5 7\n", "2 5\n0 1\n3 5\n" ]	[ "NO\n", "YES\n1 4 " ]	none	0	[ { "input": "1 48\n5 7", "output": "NO" }, { "input": "2 5\n0 1\n3 5", "output": "YES\n1 4 " }, { "input": "1 1\n5 6", "output": "NO" }, { "input": "1 4\n2 4", "output": "YES\n4 " }, { "input": "2 5\n4 6\n0 0", "output": "YES\n5 0 " }, { "input": "27 97\n2 8\n0 5\n5 6\n3 6\n5 5\n1 2\n3 5\n1 8\n0 4\n3 3\n0 2\n0 0\n4 8\n5 6\n5 8\n0 7\n1 4\n0 4\n1 5\n3 7\n2 5\n5 6\n4 7\n3 8\n0 1\n3 4\n5 7", "output": "YES\n8 5 6 6 5 2 5 8 4 3 2 0 6 5 5 0 1 0 1 3 2 5 4 3 0 3 5 " }, { "input": "30 92\n4 5\n4 7\n2 6\n8 8\n7 8\n4 5\n1 5\n7 8\n1 2\n6 8\n2 7\n2 4\n0 0\n1 3\n4 5\n1 1\n0 7\n2 5\n2 5\n3 3\n1 2\n1 7\n5 5\n5 8\n6 7\n0 3\n2 6\n0 7\n5 6\n2 5", "output": "YES\n5 7 2 8 7 4 1 7 1 6 2 2 0 1 4 1 0 2 2 3 1 1 5 5 6 0 2 0 5 2 " }, { "input": "30 178\n1 6\n2 7\n2 5\n2 8\n1 6\n2 8\n3 4\n2 7\n0 2\n0 8\n0 3\n0 2\n2 4\n4 8\n6 8\n0 8\n0 6\n1 8\n0 3\n6 7\n4 8\n2 7\n1 1\n3 7\n3 6\n2 5\n4 7\n2 2\n1 8\n5 6", "output": "NO" }, { "input": "30 71\n1 3\n0 6\n3 5\n3 6\n2 4\n2 8\n2 4\n3 8\n3 5\n2 4\n2 3\n3 7\n0 0\n5 7\n0 2\n5 8\n0 8\n4 7\n0 3\n3 7\n2 3\n4 5\n7 8\n7 7\n2 7\n1 3\n0 1\n1 5\n6 7\n5 8", "output": "NO" }, { "input": "30 119\n2 7\n1 3\n0 3\n3 4\n7 7\n7 7\n0 5\n2 3\n0 8\n0 8\n0 5\n5 7\n2 2\n2 6\n2 5\n3 7\n0 8\n0 2\n1 3\n2 3\n1 4\n0 1\n3 7\n7 8\n1 2\n0 6\n1 8\n1 7\n4 8\n1 4", "output": "YES\n7 3 3 4 7 7 5 3 8 8 5 7 2 6 5 7 8 2 1 2 1 0 3 7 1 0 1 1 4 1 " }, { "input": "1 0\n0 0", "output": "YES\n0 " }, { "input": "30 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0", "output": "YES\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 " }, { "input": "30 240\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8\n8 8", "output": "YES\n8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 " }, { "input": "30 64\n7 7\n3 4\n0 4\n5 8\n1 3\n1 1\n0 2\n0 4\n7 7\n3 5\n4 4\n0 4\n4 5\n1 4\n4 6\n5 7\n1 4\n1 2\n3 3\n0 2\n3 7\n3 4\n0 3\n3 8\n0 8\n0 1\n0 3\n4 5\n1 5\n0 3", "output": "YES\n7 3 0 5 1 1 0 0 7 3 4 0 4 1 4 5 1 1 3 0 3 3 0 3 0 0 0 4 1 0 " }, { "input": "30 189\n0 8\n3 8\n5 8\n2 2\n7 7\n2 8\n7 8\n2 5\n1 7\n0 1\n3 4\n1 7\n1 6\n5 6\n3 7\n4 7\n4 7\n4 7\n5 5\n0 5\n4 7\n3 5\n0 6\n4 8\n2 5\n5 6\n5 6\n2 8\n0 7\n7 8", "output": "YES\n8 8 8 2 7 8 8 5 7 1 4 7 6 6 7 7 7 7 5 5 7 5 6 8 5 6 6 8 7 8 " } ]	1,694,064,794	794	PyPy 3	WRONG_ANSWER	TESTS	1	77	0	d, sumTime = map(int, input().split()) timetable = [] for _ in range(d): minTime, maxTime = map(int, input().split()) timetable.append((minTime, maxTime)) timetable.sort(key=lambda x: x[0]) actual_timetable = [0] * d total_study_time = 0 for i in range(d): minTime, maxTime = timetable[i] if total_study_time + maxTime <= sumTime: actual_timetable[i] = maxTime total_study_time += maxTime elif total_study_time + minTime <= sumTime: actual_timetable[i] = minTime total_study_time += minTime else: print("NO") exit() if total_study_time == sumTime: print("YES") print(*actual_timetable) else: print("NO")	Title: Before an Exam Time Limit: 0 seconds Memory Limit: 64 megabytes Problem Description: Tomorrow Peter has a Biology exam. He does not like this subject much, but d days ago he learnt that he would have to take this exam. Peter's strict parents made him prepare for the exam immediately, for this purpose he has to study not less than minTimei and not more than maxTimei hours per each i-th day. Moreover, they warned Peter that a day before the exam they would check how he has followed their instructions. So, today is the day when Peter's parents ask him to show the timetable of his preparatory studies. But the boy has counted only the sum of hours sumTime spent him on preparation, and now he wants to know if he can show his parents a timetable sсhedule with d numbers, where each number sсhedulei stands for the time in hours spent by Peter each i-th day on biology studies, and satisfying the limitations imposed by his parents, and at the same time the sum total of all schedulei should equal to sumTime. Input Specification: The first input line contains two integer numbers d,<=sumTime (1<=≤<=d<=≤<=30,<=0<=≤<=sumTime<=≤<=240) — the amount of days, during which Peter studied, and the total amount of hours, spent on preparation. Each of the following d lines contains two integer numbers minTimei,<=maxTimei (0<=≤<=minTimei<=≤<=maxTimei<=≤<=8), separated by a space — minimum and maximum amount of hours that Peter could spent in the i-th day. Output Specification: In the first line print YES, and in the second line print d numbers (separated by a space), each of the numbers — amount of hours, spent by Peter on preparation in the corresponding day, if he followed his parents' instructions; or print NO in the unique line. If there are many solutions, print any of them. Demo Input: ['1 48\n5 7\n', '2 5\n0 1\n3 5\n'] Demo Output: ['NO\n', 'YES\n1 4 '] Note: none	```python d, sumTime = map(int, input().split()) timetable = [] for _ in range(d): minTime, maxTime = map(int, input().split()) timetable.append((minTime, maxTime)) timetable.sort(key=lambda x: x[0]) actual_timetable = [0] * d total_study_time = 0 for i in range(d): minTime, maxTime = timetable[i] if total_study_time + maxTime <= sumTime: actual_timetable[i] = maxTime total_study_time += maxTime elif total_study_time + minTime <= sumTime: actual_timetable[i] = minTime total_study_time += minTime else: print("NO") exit() if total_study_time == sumTime: print("YES") print(*actual_timetable) else: print("NO") ```	0
228	A	Is your horseshoe on the other hoof?	PROGRAMMING	800	[ "implementation" ]		null	null	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. Fortunately, 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.	The first line contains four space-separated integers s1,<=s2,<=s3,<=s4 (1<=≤<=s1,<=s2,<=s3,<=s4<=≤<=109) — the colors of horseshoes Valera has. Consider all possible colors indexed with integers.	Print a single integer — the minimum number of horseshoes Valera needs to buy.	[ "1 7 3 3\n", "7 7 7 7\n" ]	[ "1\n", "3\n" ]	none	500	[ { "input": "1 7 3 3", "output": "1" }, { "input": "7 7 7 7", "output": "3" }, { "input": "81170865 673572653 756938629 995577259", "output": "0" }, { "input": "3491663 217797045 522540872 715355328", "output": "0" }, { "input": "251590420 586975278 916631563 586975278", "output": "1" }, { "input": "259504825 377489979 588153796 377489979", "output": "1" }, { "input": "652588203 931100304 931100304 652588203", "output": "2" }, { "input": "391958720 651507265 391958720 651507265", "output": "2" }, { "input": "90793237 90793237 90793237 90793237", "output": "3" }, { "input": "551651653 551651653 551651653 551651653", "output": "3" }, { "input": "156630260 609654355 668943582 973622757", "output": "0" }, { "input": "17061017 110313588 434481173 796661222", "output": "0" }, { "input": "24975422 256716298 337790533 690960249", "output": "0" }, { "input": "255635360 732742923 798648949 883146723", "output": "0" }, { "input": "133315691 265159773 734556507 265159773", "output": "1" }, { "input": "28442865 741657755 978106882 978106882", "output": "1" }, { "input": "131245479 174845575 497483467 131245479", "output": "1" }, { "input": "139159884 616215581 958341883 616215581", "output": "1" }, { "input": "147784432 947653080 947653080 947653080", "output": "2" }, { "input": "94055790 756126496 756126496 94055790", "output": "2" }, { "input": "240458500 511952208 240458500 511952208", "output": "2" }, { "input": "681828506 972810624 972810624 681828506", "output": "2" }, { "input": "454961014 454961014 454961014 454961014", "output": "3" }, { "input": "915819430 915819430 915819430 915819430", "output": "3" }, { "input": "671645142 671645142 671645142 671645142", "output": "3" }, { "input": "132503558 132503558 132503558 132503558", "output": "3" }, { "input": "5 5 999999 6", "output": "1" }, { "input": "1 1 2 5", "output": "1" }, { "input": "2 1 2 3", "output": "1" }, { "input": "1 1 3 5", "output": "1" }, { "input": "1 1 3 3", "output": "2" }, { "input": "2 2 2 1", "output": "2" }, { "input": "3 1 1 1", "output": "2" }, { "input": "1 2 2 2", "output": "2" } ]	1,685,546,253	2,147,483,647	PyPy 3-64	OK	TESTS	34	124	0	num=input().split() numset=set(num) dupe=4-len(numset) print(dupe)	Title: Is your horseshoe on the other hoof? Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. Fortunately, 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 Specification: The first line contains four space-separated integers s1,<=s2,<=s3,<=s4 (1<=≤<=s1,<=s2,<=s3,<=s4<=≤<=109) — the colors of horseshoes Valera has. Consider all possible colors indexed with integers. Output Specification: Print a single integer — the minimum number of horseshoes Valera needs to buy. Demo Input: ['1 7 3 3\n', '7 7 7 7\n'] Demo Output: ['1\n', '3\n'] Note: none	```python num=input().split() numset=set(num) dupe=4-len(numset) print(dupe) ```	3
789	B	Masha and geometric depression	PROGRAMMING	1,700	[ "brute force", "implementation", "math" ]		null	null	Masha really loves algebra. On the last lesson, her strict teacher Dvastan gave she new exercise. You are given geometric progression b defined by two integers b1 and q. Remind that a geometric progression is a sequence of integers b1,<=b2,<=b3,<=..., where for each i<=><=1 the respective term satisfies the condition bi<==<=bi<=-<=1·q, where q is called the common ratio of the progression. Progressions in Uzhlyandia are unusual: both b1 and q can equal 0. Also, Dvastan gave Masha m "bad" integers a1,<=a2,<=...,<=am, and an integer l. Masha writes all progression terms one by one onto the board (including repetitive) while condition \|bi\|<=≤<=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. But 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.	The first line of input contains four integers b1, q, l, m (-109<=≤<=b1,<=q<=≤<=109, 1<=≤<=l<=≤<=109, 1<=≤<=m<=≤<=105) — the initial term and the common ratio of progression, absolute value of maximal number that can be written on the board and the number of "bad" integers, respectively. The second line contains m distinct integers a1,<=a2,<=...,<=am (-109<=≤<=ai<=≤<=109) — numbers that will never be written on the board.	Print the only integer, meaning the number of progression terms that will be written on the board if it is finite, or "inf" (without quotes) otherwise.	[ "3 2 30 4\n6 14 25 48\n", "123 1 2143435 4\n123 11 -5453 141245\n", "123 1 2143435 4\n54343 -13 6 124\n" ]	[ "3", "0", "inf" ]	In the first sample case, Masha will write integers 3, 12, 24. Progression term 6 will be skipped because it is a "bad" integer. Terms bigger than 24 won't be written because they exceed l by absolute value. In the second case, Masha won't write any number because all terms are equal 123 and this is a "bad" integer. In the third case, Masha will write infinitely integers 123.	1,000	[ { "input": "3 2 30 4\n6 14 25 48", "output": "3" }, { "input": "123 1 2143435 4\n123 11 -5453 141245", "output": "0" }, { "input": "123 1 2143435 4\n54343 -13 6 124", "output": "inf" }, { "input": "3 2 25 2\n379195692 -69874783", "output": "4" }, { "input": "3 2 30 3\n-691070108 -934106649 -220744807", "output": "4" }, { "input": "3 3 104 17\n9 -73896485 -290898562 5254410 409659728 -916522518 -435516126 94354167 262981034 -375897180 -80186684 -173062070 -288705544 -699097793 -11447747 320434295 503414250", "output": "3" }, { "input": "-1000000000 -1000000000 1 1\n232512888", "output": "0" }, { "input": "11 0 228 5\n-1 0 1 5 -11245", "output": "1" }, { "input": "11 0 228 5\n-1 -17 1 5 -11245", "output": "inf" }, { "input": "0 0 2143435 5\n-1 -153 1 5 -11245", "output": "inf" }, { "input": "123 0 2143435 4\n5433 0 123 -645", "output": "0" }, { "input": "123 -1 2143435 5\n-123 0 12 5 -11245", "output": "inf" }, { "input": "123 0 21 4\n543453 -123 6 1424", "output": "0" }, { "input": "3 2 115 16\n24 48 12 96 3 720031148 -367712651 -838596957 558177735 -963046495 -313322487 -465018432 -618984128 -607173835 144854086 178041956", "output": "1" }, { "input": "-3 0 92055 36\n-92974174 -486557474 -663622151 695596393 177960746 -563227474 -364263320 -676254242 -614140218 71456762 -764104225 705056581 -106398436 332755134 -199942822 -732751692 658942664 677739866 886535704 183687802 -784248291 -22550621 -938674499 637055091 -704750213 780395802 778342470 -999059668 -794361783 796469192 215667969 354336794 -60195289 -885080928 -290279020 201221317", "output": "inf" }, { "input": "0 -3 2143435 5\n-1 0 1 5 -11245", "output": "0" }, { "input": "123 -1 2143435 5\n-123 0 123 -5453 141245", "output": "0" }, { "input": "123 0 2143435 4\n5433 0 -123 -645", "output": "1" }, { "input": "11 0 2 5\n-1 0 1 5 -11245", "output": "0" }, { "input": "2 2 4 1\n2", "output": "1" }, { "input": "1 -2 1000000000 1\n0", "output": "30" }, { "input": "0 8 10 1\n5", "output": "inf" }, { "input": "-1000 0 10 1\n5", "output": "0" }, { "input": "0 2 2143435 4\n54343 -13 6 124", "output": "inf" }, { "input": "0 8 5 1\n9", "output": "inf" }, { "input": "-10 1 5 1\n100", "output": "0" }, { "input": "123 -1 2143435 4\n54343 -13 6 123", "output": "inf" }, { "input": "-5 -1 10 1\n-5", "output": "inf" }, { "input": "2 0 1 1\n2", "output": "0" }, { "input": "0 5 8 1\n10", "output": "inf" }, { "input": "0 5 100 2\n34 56", "output": "inf" }, { "input": "15 -1 15 4\n15 -15 1 2", "output": "0" }, { "input": "10 -1 2 1\n1", "output": "0" }, { "input": "2 0 2 1\n2", "output": "inf" }, { "input": "4 0 4 1\n0", "output": "1" }, { "input": "10 10 10 1\n123", "output": "1" }, { "input": "2 2 4 1\n3", "output": "2" }, { "input": "0 1 1 1\n0", "output": "0" }, { "input": "3 2 30 1\n3", "output": "3" }, { "input": "1000000000 100000 1000000000 4\n5433 13 6 0", "output": "1" }, { "input": "-2 0 1 1\n1", "output": "0" }, { "input": "2 -1 10 1\n2", "output": "inf" }, { "input": "1 -1 2 1\n1", "output": "inf" }, { "input": "0 10 10 1\n2", "output": "inf" }, { "input": "0 35 2 1\n3", "output": "inf" }, { "input": "3 1 3 1\n5", "output": "inf" }, { "input": "3 2 3 4\n6 14 25 48", "output": "1" }, { "input": "0 69 12 1\n1", "output": "inf" }, { "input": "100 0 100000 1\n100", "output": "inf" }, { "input": "0 4 1000 3\n5 6 7", "output": "inf" }, { "input": "0 2 100 1\n5", "output": "inf" }, { "input": "3 2 24 4\n6 14 25 48", "output": "3" }, { "input": "0 4 1 1\n2", "output": "inf" }, { "input": "1 5 10000 1\n125", "output": "5" }, { "input": "2 -1 1 1\n1", "output": "0" }, { "input": "0 3 100 1\n5", "output": "inf" }, { "input": "0 3 3 1\n1", "output": "inf" }, { "input": "0 2 5 1\n1", "output": "inf" }, { "input": "5 -1 100 1\n5", "output": "inf" }, { "input": "-20 0 10 1\n0", "output": "0" }, { "input": "3 0 1 1\n3", "output": "0" }, { "input": "2 -1 3 1\n2", "output": "inf" }, { "input": "1 1 1000000000 1\n100", "output": "inf" }, { "input": "5 -1 3 1\n0", "output": "0" }, { "input": "0 5 10 1\n2", "output": "inf" }, { "input": "123 0 125 1\n123", "output": "inf" }, { "input": "2 -1 100 1\n2", "output": "inf" }, { "input": "5 2 100 1\n5", "output": "4" }, { "input": "-5 0 1 1\n1", "output": "0" }, { "input": "-3 0 1 1\n-3", "output": "0" }, { "input": "2 -2 10 1\n1", "output": "3" }, { "input": "0 2 30 4\n6 14 25 48", "output": "inf" }, { "input": "1 -1 1 1\n1", "output": "inf" }, { "input": "2 -1 6 1\n2", "output": "inf" }, { "input": "-3 1 100 1\n-3", "output": "0" }, { "input": "1 0 2 1\n1", "output": "inf" }, { "input": "1000000000 999999998 1000000000 1\n0", "output": "1" }, { "input": "1 0 2143435 4\n1 -123 -5453 141245", "output": "inf" }, { "input": "-1000 0 100 1\n-1000", "output": "0" }, { "input": "100 10 2 1\n100", "output": "0" }, { "input": "-3 1 100 1\n3", "output": "inf" }, { "input": "123 -1 10000 1\n123", "output": "inf" }, { "input": "1 -1 2143435 4\n1 -123 -5453 141245", "output": "inf" }, { "input": "5 1 5 5\n1 2 3 4 0", "output": "inf" }, { "input": "-100 -1 1 1\n1", "output": "0" }, { "input": "10 -1 3 2\n10 8", "output": "0" }, { "input": "-10 0 5 1\n0", "output": "0" }, { "input": "3 0 3 1\n0", "output": "1" }, { "input": "2 0 2 1\n-1", "output": "inf" }, { "input": "5 0 20 1\n5", "output": "inf" }, { "input": "-4 1 1 1\n0", "output": "0" }, { "input": "11 0 1111 1\n11", "output": "inf" }, { "input": "2 0 3 1\n2", "output": "inf" }, { "input": "-1 -1 2143435 4\n-1 -123 -5453 141245", "output": "inf" }, { "input": "-100 0 50 1\n0", "output": "0" }, { "input": "5 1 2 1\n2", "output": "0" }, { "input": "3 0 3 1\n4", "output": "inf" }, { "input": "0 23 3 1\n3", "output": "inf" }, { "input": "-1000 0 100 1\n2", "output": "0" }, { "input": "1 -1 10 1\n1", "output": "inf" } ]	1,490,807,690	4,190	Python 3	WRONG_ANSWER	PRETESTS	8	93	14,438,400	b, q, l, m = map(int, input().split()) a = list(map(int, input().split())) l = abs(l) d = {} for e in a: d[e] = True if q == 0 or b == 0: if 0 in d: print(0) else: print('inf') else: if q == 1: if abs(b) > l: print(0) else: if b in d: print(0) else: print('inf') else: if q == -1: if abs(b) > l: print(0) else: if b in d and -b in d: print(0) else: print('inf') else: res = 0 while abs(b) <= l: res += b not in d b *= q print(res)	Title: Masha and geometric depression Time Limit: None seconds Memory Limit: None megabytes Problem Description: Masha really loves algebra. On the last lesson, her strict teacher Dvastan gave she new exercise. You are given geometric progression b defined by two integers b1 and q. Remind that a geometric progression is a sequence of integers b1,<=b2,<=b3,<=..., where for each i<=><=1 the respective term satisfies the condition bi<==<=bi<=-<=1·q, where q is called the common ratio of the progression. Progressions in Uzhlyandia are unusual: both b1 and q can equal 0. Also, Dvastan gave Masha m "bad" integers a1,<=a2,<=...,<=am, and an integer l. Masha writes all progression terms one by one onto the board (including repetitive) while condition \|bi\|<=≤<=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. But 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 Specification: The first line of input contains four integers b1, q, l, m (-109<=≤<=b1,<=q<=≤<=109, 1<=≤<=l<=≤<=109, 1<=≤<=m<=≤<=105) — the initial term and the common ratio of progression, absolute value of maximal number that can be written on the board and the number of "bad" integers, respectively. The second line contains m distinct integers a1,<=a2,<=...,<=am (-109<=≤<=ai<=≤<=109) — numbers that will never be written on the board. Output Specification: Print the only integer, meaning the number of progression terms that will be written on the board if it is finite, or "inf" (without quotes) otherwise. Demo Input: ['3 2 30 4\n6 14 25 48\n', '123 1 2143435 4\n123 11 -5453 141245\n', '123 1 2143435 4\n54343 -13 6 124\n'] Demo Output: ['3', '0', 'inf'] Note: In the first sample case, Masha will write integers 3, 12, 24. Progression term 6 will be skipped because it is a "bad" integer. Terms bigger than 24 won't be written because they exceed l by absolute value. In the second case, Masha won't write any number because all terms are equal 123 and this is a "bad" integer. In the third case, Masha will write infinitely integers 123.	```python b, q, l, m = map(int, input().split()) a = list(map(int, input().split())) l = abs(l) d = {} for e in a: d[e] = True if q == 0 or b == 0: if 0 in d: print(0) else: print('inf') else: if q == 1: if abs(b) > l: print(0) else: if b in d: print(0) else: print('inf') else: if q == -1: if abs(b) > l: print(0) else: if b in d and -b in d: print(0) else: print('inf') else: res = 0 while abs(b) <= l: res += b not in d b *= q print(res) ```	0
784	A	Numbers Joke	PROGRAMMING	1,700	[ "*special" ]		null	null	The input contains a single integer a (1<=≤<=a<=≤<=30). Output a single integer.	The input contains a single integer a (1<=≤<=a<=≤<=30).	Output a single integer.	[ "3\n" ]	[ "27\n" ]	none	0	[ { "input": "3", "output": "27" }, { "input": "1", "output": "4" }, { "input": "2", "output": "22" }, { "input": "4", "output": "58" }, { "input": "5", "output": "85" }, { "input": "6", "output": "94" }, { "input": "7", "output": "121" }, { "input": "8", "output": "166" }, { "input": "9", "output": "202" }, { "input": "10", "output": "265" }, { "input": "11", "output": "274" }, { "input": "12", "output": "319" }, { "input": "13", "output": "346" }, { "input": "14", "output": "355" }, { "input": "15", "output": "378" }, { "input": "16", "output": "382" }, { "input": "17", "output": "391" }, { "input": "18", "output": "438" }, { "input": "19", "output": "454" }, { "input": "20", "output": "483" }, { "input": "21", "output": "517" }, { "input": "22", "output": "526" }, { "input": "23", "output": "535" }, { "input": "24", "output": "562" }, { "input": "25", "output": "576" }, { "input": "26", "output": "588" }, { "input": "27", "output": "627" }, { "input": "28", "output": "634" }, { "input": "29", "output": "636" }, { "input": "30", "output": "645" } ]	1,583,926,959	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	108	0	n = int(input()) res = pow(n,n) print(res)	Title: Numbers Joke Time Limit: None seconds Memory Limit: None megabytes Problem Description: The input contains a single integer a (1<=≤<=a<=≤<=30). Output a single integer. Input Specification: The input contains a single integer a (1<=≤<=a<=≤<=30). Output Specification: Output a single integer. Demo Input: ['3\n'] Demo Output: ['27\n'] Note: none	```python n = int(input()) res = pow(n,n) print(res) ```	0
279	B	Books	PROGRAMMING	1,400	[ "binary search", "brute force", "implementation", "two pointers" ]		null	null	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 ai minutes to read the i-th book. Valera 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. Print the maximum number of books Valera can read.	The first line contains two integers n and t (1<=≤<=n<=≤<=105; 1<=≤<=t<=≤<=109) — the number of books and the number of free minutes Valera's got. The second line contains a sequence of n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=104), where number ai shows the number of minutes that the boy needs to read the i-th book.	Print a single integer — the maximum number of books Valera can read.	[ "4 5\n3 1 2 1\n", "3 3\n2 2 3\n" ]	[ "3\n", "1\n" ]	none	1,000	[ { "input": "4 5\n3 1 2 1", "output": "3" }, { "input": "3 3\n2 2 3", "output": "1" }, { "input": "1 3\n5", "output": "0" }, { "input": "1 10\n4", "output": "1" }, { "input": "2 10\n6 4", "output": "2" }, { "input": "6 10\n2 3 4 2 1 1", "output": "4" }, { "input": "7 13\n6 8 14 9 4 11 10", "output": "2" }, { "input": "10 15\n10 9 1 1 5 10 5 3 7 2", "output": "3" }, { "input": "20 30\n8 1 2 6 9 4 1 9 9 10 4 7 8 9 5 7 1 8 7 4", "output": "6" }, { "input": "30 60\n16 13 22 38 13 35 17 17 20 38 12 19 9 22 20 3 35 34 34 21 35 40 22 3 27 19 12 4 8 19", "output": "4" }, { "input": "100 100\n75 92 18 6 81 67 7 92 100 65 82 32 50 67 85 31 80 91 84 63 39 52 92 81 1 98 24 12 43 48 17 86 51 72 48 95 45 50 12 66 19 79 49 89 34 1 97 75 20 33 96 27 42 23 73 71 93 1 85 19 66 14 17 61 20 39 36 33 42 61 56 64 23 91 80 99 40 74 13 18 98 85 74 39 62 84 46 74 50 23 38 11 79 14 9 25 66 100 25 52", "output": "3" }, { "input": "10 1\n4418 7528 8170 1736 1317 3205 8183 4995 8039 4708", "output": "0" }, { "input": "50 2\n124 214 63 73 996 760 38 571 451 300 970 1 706 937 837 494 619 88 851 411 957 990 842 613 821 649 627 34 693 678 734 116 816 985 705 940 499 493 922 967 854 439 112 644 961 438 189 572 655 550", "output": "1" } ]	1,678,127,906	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	8	2,000	5,734,400	n, t = [int(i) for i in input().split()] k = [int(i) for i in input().split()] s = sum(k) if s <= t: print(n) else: x = -1 mx = 0 while x < n-mx-1: x+=1 y = x s = k[x] c = 1 while s <= t and y != n-1: c += 1 y += 1 s += k[y] if s > t: c -= 1 if mx < c: mx = c print(mx)	Title: Books Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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 ai minutes to read the i-th book. Valera 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. Print the maximum number of books Valera can read. Input Specification: The first line contains two integers n and t (1<=≤<=n<=≤<=105; 1<=≤<=t<=≤<=109) — the number of books and the number of free minutes Valera's got. The second line contains a sequence of n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=104), where number ai shows the number of minutes that the boy needs to read the i-th book. Output Specification: Print a single integer — the maximum number of books Valera can read. Demo Input: ['4 5\n3 1 2 1\n', '3 3\n2 2 3\n'] Demo Output: ['3\n', '1\n'] Note: none	```python n, t = [int(i) for i in input().split()] k = [int(i) for i in input().split()] s = sum(k) if s <= t: print(n) else: x = -1 mx = 0 while x < n-mx-1: x+=1 y = x s = k[x] c = 1 while s <= t and y != n-1: c += 1 y += 1 s += k[y] if s > t: c -= 1 if mx < c: mx = c print(mx) ```	0
808	D	Array Division	PROGRAMMING	1,900	[ "binary search", "data structures", "implementation" ]		null	null	Vasya has an array a consisting of positive integer numbers. Vasya wants to divide this array into two non-empty consecutive parts (the prefix and the suffix) so that the sum of all elements in the first part equals to the sum of elements in the second part. It is not always possible, so Vasya will move some element before dividing the array (Vasya will erase some element and insert it into an arbitrary position). Inserting an element in the same position he was erased from is also considered moving. Can Vasya divide the array after choosing the right element to move and its new position?	The first line contains single integer n (1<=≤<=n<=≤<=100000) — the size of the array. The second line contains n integers a1,<=a2... an (1<=≤<=ai<=≤<=109) — the elements of the array.	Print YES if Vasya can divide the array after moving one element. Otherwise print NO.	[ "3\n1 3 2\n", "5\n1 2 3 4 5\n", "5\n2 2 3 4 5\n" ]	[ "YES\n", "NO\n", "YES\n" ]	In the first example Vasya can move the second element to the end of the array. In the second example no move can make the division possible. In the third example Vasya can move the fourth element by one position to the left.	0	[ { "input": "3\n1 3 2", "output": "YES" }, { "input": "5\n1 2 3 4 5", "output": "NO" }, { "input": "5\n2 2 3 4 5", "output": "YES" }, { "input": "5\n72 32 17 46 82", "output": "NO" }, { "input": "6\n26 10 70 11 69 57", "output": "NO" }, { "input": "7\n4 7 10 7 5 5 1", "output": "NO" }, { "input": "8\n9 5 5 10 4 9 5 8", "output": "NO" }, { "input": "10\n9 6 8 5 5 2 8 9 2 2", "output": "YES" }, { "input": "15\n4 8 10 3 1 4 5 9 3 2 1 7 7 3 8", "output": "NO" }, { "input": "20\n71 83 54 6 10 64 91 98 94 49 65 68 14 39 91 60 74 100 17 13", "output": "NO" }, { "input": "20\n2 8 10 4 6 6 4 1 2 2 6 9 5 1 9 1 9 8 10 6", "output": "NO" }, { "input": "100\n9 9 72 55 14 8 55 58 35 67 3 18 73 92 41 49 15 60 18 66 9 26 97 47 43 88 71 97 19 34 48 96 79 53 8 24 69 49 12 23 77 12 21 88 66 9 29 13 61 69 54 77 41 13 4 68 37 74 7 6 29 76 55 72 89 4 78 27 29 82 18 83 12 4 32 69 89 85 66 13 92 54 38 5 26 56 17 55 29 4 17 39 29 94 3 67 85 98 21 14", "output": "YES" }, { "input": "100\n89 38 63 73 77 4 99 74 30 5 69 57 97 37 88 71 36 59 19 63 46 20 33 58 61 98 100 31 33 53 99 96 34 17 44 95 54 52 22 77 67 88 20 88 26 43 12 23 96 94 14 7 57 86 56 54 32 8 3 43 97 56 74 22 5 100 12 60 93 12 44 68 31 63 7 71 21 29 19 38 50 47 97 43 50 59 88 40 51 61 20 68 32 66 70 48 19 55 91 53", "output": "NO" }, { "input": "100\n80 100 88 52 25 87 85 8 92 62 35 66 74 39 58 41 55 53 23 73 90 72 36 44 97 67 16 54 3 8 25 34 84 47 77 39 93 19 49 20 29 44 21 48 21 56 82 59 8 31 94 95 84 54 72 20 95 91 85 1 67 19 76 28 31 63 87 98 55 28 16 20 36 91 93 39 94 69 80 97 100 96 68 26 91 45 22 84 20 36 20 92 53 75 58 51 60 26 76 25", "output": "NO" }, { "input": "100\n27 95 57 29 91 85 83 36 72 86 39 5 79 61 78 93 100 97 73 23 82 66 41 92 38 92 100 96 48 56 66 47 5 32 69 13 95 23 46 62 99 83 57 66 98 82 81 57 37 37 81 64 45 76 72 43 99 76 86 22 37 39 93 80 99 36 53 83 3 32 52 9 78 34 47 100 33 72 19 40 29 56 77 32 79 72 15 88 100 98 56 50 22 81 88 92 58 70 21 19", "output": "NO" }, { "input": "100\n35 31 83 11 7 94 57 58 30 26 2 99 33 58 98 6 3 52 13 66 21 53 26 94 100 5 1 3 91 13 97 49 86 25 63 90 88 98 57 57 34 81 32 16 65 94 59 83 44 14 46 18 28 89 75 95 87 57 52 18 46 80 31 43 38 54 69 75 82 9 64 96 75 40 96 52 67 85 86 38 95 55 16 57 17 20 22 7 63 3 12 16 42 87 46 12 51 95 67 80", "output": "NO" }, { "input": "6\n1 4 3 100 100 6", "output": "YES" }, { "input": "6\n6 100 100 3 4 1", "output": "YES" }, { "input": "6\n4 2 3 7 1 1", "output": "YES" }, { "input": "4\n6 1 4 5", "output": "NO" }, { "input": "3\n228 114 114", "output": "YES" }, { "input": "3\n229 232 444", "output": "NO" }, { "input": "3\n322 324 555", "output": "NO" }, { "input": "3\n69 34 5", "output": "NO" }, { "input": "6\n5 4 1 2 2 2", "output": "YES" }, { "input": "3\n545 237 546", "output": "NO" }, { "input": "5\n2 3 1 1 1", "output": "YES" }, { "input": "6\n2 2 10 2 2 2", "output": "YES" }, { "input": "5\n5 4 6 5 6", "output": "NO" }, { "input": "5\n6 1 1 1 1", "output": "NO" }, { "input": "2\n1 3", "output": "NO" }, { "input": "5\n5 2 2 3 4", "output": "YES" }, { "input": "2\n2 2", "output": "YES" }, { "input": "5\n1 2 6 1 2", "output": "YES" }, { "input": "5\n1 1 8 5 1", "output": "YES" }, { "input": "10\n73 67 16 51 56 71 37 49 90 6", "output": "NO" }, { "input": "1\n10", "output": "NO" }, { "input": "1\n1", "output": "NO" }, { "input": "2\n1 1", "output": "YES" }, { "input": "5\n8 2 7 5 4", "output": "YES" }, { "input": "1\n2", "output": "NO" }, { "input": "16\n9 10 2 1 6 7 6 5 8 3 2 10 8 4 9 2", "output": "YES" }, { "input": "4\n8 2 2 4", "output": "YES" }, { "input": "19\n9 9 3 2 4 5 5 7 8 10 8 10 1 2 2 6 5 3 3", "output": "NO" }, { "input": "11\n7 2 1 8 8 2 4 10 8 7 1", "output": "YES" }, { "input": "6\n10 20 30 40 99 1", "output": "YES" }, { "input": "10\n3 7 9 2 10 1 9 6 4 1", "output": "NO" }, { "input": "3\n3 1 2", "output": "YES" }, { "input": "2\n9 3", "output": "NO" }, { "input": "7\n1 2 3 12 1 2 3", "output": "YES" }, { "input": "6\n2 4 4 5 8 5", "output": "YES" }, { "input": "18\n2 10 3 6 6 6 10 8 8 1 10 9 9 3 1 9 7 4", "output": "YES" }, { "input": "20\n9 6 6 10 4 4 8 7 4 10 10 2 10 5 9 5 3 10 1 9", "output": "NO" }, { "input": "12\n3 8 10 2 4 4 6 9 5 10 10 3", "output": "YES" }, { "input": "11\n9 2 7 7 7 3 7 5 4 10 7", "output": "NO" }, { "input": "5\n1 1 4 1 1", "output": "YES" }, { "input": "2\n4 4", "output": "YES" }, { "input": "2\n7 1", "output": "NO" }, { "input": "5\n10 5 6 7 6", "output": "YES" }, { "input": "11\n4 3 10 3 7 8 4 9 2 1 1", "output": "YES" }, { "input": "6\n705032704 1000000000 1000000000 1000000000 1000000000 1000000000", "output": "NO" }, { "input": "8\n1 5 6 8 3 1 7 3", "output": "YES" }, { "input": "20\n8 6 3 6 3 5 10 2 6 1 7 6 9 10 8 3 5 9 3 8", "output": "YES" }, { "input": "11\n2 4 8 3 4 7 9 10 5 3 3", "output": "YES" }, { "input": "7\n6 4 2 24 6 4 2", "output": "YES" }, { "input": "17\n7 1 1 1 8 9 1 10 8 8 7 9 7 9 1 6 5", "output": "NO" }, { "input": "7\n7 10 1 2 6 2 2", "output": "NO" }, { "input": "5\n10 10 40 10 10", "output": "YES" }, { "input": "3\n4 3 13", "output": "NO" }, { "input": "5\n5 2 10 2 1", "output": "YES" }, { "input": "7\n7 4 5 62 20 20 6", "output": "YES" }, { "input": "6\n1 5 2 20 10 2", "output": "YES" }, { "input": "2\n5 6", "output": "NO" }, { "input": "14\n5 2 9 7 5 8 3 2 2 4 9 1 3 10", "output": "YES" }, { "input": "5\n1 2 3 4 2", "output": "YES" }, { "input": "5\n2 2 2 5 5", "output": "NO" }, { "input": "11\n1 1 1 1 1 10 1 1 1 1 1", "output": "YES" }, { "input": "9\n8 4 13 19 11 1 8 2 8", "output": "YES" }, { "input": "6\n14 16 14 14 15 11", "output": "YES" }, { "input": "9\n14 19 1 13 11 3 1 1 7", "output": "YES" }, { "input": "6\n16 13 3 7 4 15", "output": "YES" }, { "input": "4\n11 7 12 14", "output": "NO" }, { "input": "3\n3 2 1", "output": "YES" }, { "input": "5\n2 1 3 6 4", "output": "YES" }, { "input": "5\n3 4 8 11 2", "output": "YES" }, { "input": "5\n1 2 10 3 4", "output": "YES" }, { "input": "6\n8 15 12 14 15 4", "output": "YES" }, { "input": "5\n1 2 4 4 5", "output": "YES" }, { "input": "3\n2 4 2", "output": "YES" }, { "input": "5\n2 3 1 6 4", "output": "YES" }, { "input": "7\n1 2 3 12 3 2 1", "output": "YES" }, { "input": "3\n3 4 13", "output": "NO" }, { "input": "6\n1 1 1 1 1000000000 1000000000", "output": "YES" }, { "input": "6\n19 6 5 13 6 13", "output": "YES" }, { "input": "8\n2 2 2 5 1 2 3 3", "output": "YES" } ]	1,602,128,258	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	12	311	4,710,400	n = int(input()) x = list(map(int, input().split())) def EqualSumPartition(arr): s = sum(arr) if s % 2 != 0: return False else: s = int(s / 2) dp = [[False for i in range(s + 1)] for j in range(len(arr) + 1)] for i in range(len(arr) + 1): for j in range(s + 1): if j == 0: dp[i][j] = True if arr[i - 1] <= j: dp[i][j] = max(arr[i - 1] + dp[i - 1][j - arr[i - 1]], dp[i - 1][j]) else: dp[i][j] = dp[i - 1][j] if s == dp[len(arr)][s]: return True else: return False ans = EqualSumPartition(x) if ans: print('YES') else: print('NO')	Title: Array Division Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya has an array a consisting of positive integer numbers. Vasya wants to divide this array into two non-empty consecutive parts (the prefix and the suffix) so that the sum of all elements in the first part equals to the sum of elements in the second part. It is not always possible, so Vasya will move some element before dividing the array (Vasya will erase some element and insert it into an arbitrary position). Inserting an element in the same position he was erased from is also considered moving. Can Vasya divide the array after choosing the right element to move and its new position? Input Specification: The first line contains single integer n (1<=≤<=n<=≤<=100000) — the size of the array. The second line contains n integers a1,<=a2... an (1<=≤<=ai<=≤<=109) — the elements of the array. Output Specification: Print YES if Vasya can divide the array after moving one element. Otherwise print NO. Demo Input: ['3\n1 3 2\n', '5\n1 2 3 4 5\n', '5\n2 2 3 4 5\n'] Demo Output: ['YES\n', 'NO\n', 'YES\n'] Note: In the first example Vasya can move the second element to the end of the array. In the second example no move can make the division possible. In the third example Vasya can move the fourth element by one position to the left.	```python n = int(input()) x = list(map(int, input().split())) def EqualSumPartition(arr): s = sum(arr) if s % 2 != 0: return False else: s = int(s / 2) dp = [[False for i in range(s + 1)] for j in range(len(arr) + 1)] for i in range(len(arr) + 1): for j in range(s + 1): if j == 0: dp[i][j] = True if arr[i - 1] <= j: dp[i][j] = max(arr[i - 1] + dp[i - 1][j - arr[i - 1]], dp[i - 1][j]) else: dp[i][j] = dp[i - 1][j] if s == dp[len(arr)][s]: return True else: return False ans = EqualSumPartition(x) if ans: print('YES') else: print('NO') ```	0
876	A	Trip For Meal	PROGRAMMING	900	[ "math" ]		null	null	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. For 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). Winnie-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.	First line contains an integer n (1<=≤<=n<=≤<=100) — number of visits. Second line contains an integer a (1<=≤<=a<=≤<=100) — distance between Rabbit's and Owl's houses. Third line contains an integer b (1<=≤<=b<=≤<=100) — distance between Rabbit's and Eeyore's houses. Fourth line contains an integer c (1<=≤<=c<=≤<=100) — distance between Owl's and Eeyore's houses.	Output one number — minimum distance in meters Winnie must go through to have a meal n times.	[ "3\n2\n3\n1\n", "1\n2\n3\n5\n" ]	[ "3\n", "0\n" ]	In the first test case the optimal path for Winnie is the following: first have a meal in Rabbit's house, then in Owl's house, then in Eeyore's house. Thus he will pass the distance 2 + 1 = 3. In the second test case Winnie has a meal in Rabbit's house and that is for him. So he doesn't have to walk anywhere at all.	500	[ { "input": "3\n2\n3\n1", "output": "3" }, { "input": "1\n2\n3\n5", "output": "0" }, { "input": "10\n1\n8\n3", "output": "9" }, { "input": "7\n10\n5\n6", "output": "30" }, { "input": "9\n9\n7\n5", "output": "42" }, { "input": "9\n37\n85\n76", "output": "296" }, { "input": "76\n46\n77\n11", "output": "860" }, { "input": "80\n42\n1\n37", "output": "79" }, { "input": "8\n80\n55\n1", "output": "61" }, { "input": "10\n13\n72\n17", "output": "117" }, { "input": "9\n24\n1\n63", "output": "8" }, { "input": "65\n5\n8\n7", "output": "320" }, { "input": "56\n8\n9\n3", "output": "170" }, { "input": "59\n8\n1\n2", "output": "58" }, { "input": "75\n50\n50\n5", "output": "415" }, { "input": "75\n54\n76\n66", "output": "3996" }, { "input": "73\n71\n69\n66", "output": "4755" }, { "input": "83\n58\n88\n16", "output": "1354" }, { "input": "74\n31\n11\n79", "output": "803" }, { "input": "62\n27\n16\n72", "output": "976" }, { "input": "72\n95\n27\n9", "output": "657" }, { "input": "1\n2\n2\n1", "output": "0" }, { "input": "1\n1\n1\n1", "output": "0" }, { "input": "1\n1\n1\n99", "output": "0" }, { "input": "100\n100\n100\n100", "output": "9900" }, { "input": "2\n1\n1\n3", "output": "1" }, { "input": "1\n3\n2\n1", "output": "0" }, { "input": "1\n5\n6\n1", "output": "0" }, { "input": "1\n2\n6\n1", "output": "0" }, { "input": "1\n30\n20\n1", "output": "0" }, { "input": "1\n15\n13\n11", "output": "0" }, { "input": "1\n100\n50\n1", "output": "0" }, { "input": "1\n2\n3\n1", "output": "0" }, { "input": "5\n5\n5\n5", "output": "20" }, { "input": "1\n100\n50\n5", "output": "0" }, { "input": "1\n5\n7\n3", "output": "0" }, { "input": "1\n3\n4\n2", "output": "0" }, { "input": "3\n3\n3\n3", "output": "6" }, { "input": "1\n99\n98\n1", "output": "0" }, { "input": "5\n3\n3\n1", "output": "6" }, { "input": "2\n1\n1\n1", "output": "1" }, { "input": "2\n1\n7\n8", "output": "1" }, { "input": "2\n2\n2\n1", "output": "2" }, { "input": "2\n2\n3\n1", "output": "2" }, { "input": "1\n5\n6\n2", "output": "0" }, { "input": "100\n1\n1\n100", "output": "99" }, { "input": "2\n3\n2\n1", "output": "2" }, { "input": "1\n99\n98\n97", "output": "0" } ]	1,509,115,019	2,147,483,647	Python 3	OK	TESTS	48	62	0	n = int(input()) a = int(input()) b = int(input()) c = int(input()) n = n - 1 d = 0 if n != 0: minab = min(a, b) m = min(minab, c) if m == a or m == b: d = mn else: d = minab + (n-1)m print(d)	Title: Trip For Meal Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. For 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). Winnie-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 Specification: First line contains an integer n (1<=≤<=n<=≤<=100) — number of visits. Second line contains an integer a (1<=≤<=a<=≤<=100) — distance between Rabbit's and Owl's houses. Third line contains an integer b (1<=≤<=b<=≤<=100) — distance between Rabbit's and Eeyore's houses. Fourth line contains an integer c (1<=≤<=c<=≤<=100) — distance between Owl's and Eeyore's houses. Output Specification: Output one number — minimum distance in meters Winnie must go through to have a meal n times. Demo Input: ['3\n2\n3\n1\n', '1\n2\n3\n5\n'] Demo Output: ['3\n', '0\n'] Note: In the first test case the optimal path for Winnie is the following: first have a meal in Rabbit's house, then in Owl's house, then in Eeyore's house. Thus he will pass the distance 2 + 1 = 3. In the second test case Winnie has a meal in Rabbit's house and that is for him. So he doesn't have to walk anywhere at all.	```python n = int(input()) a = int(input()) b = int(input()) c = int(input()) n = n - 1 d = 0 if n != 0: minab = min(a, b) m = min(minab, c) if m == a or m == b: d = mn else: d = minab + (n-1)m print(d) ```	3
189	A	Cut Ribbon	PROGRAMMING	1,300	[ "brute force", "dp" ]		null	null	Polycarpus has a ribbon, its length is n. He wants to cut the ribbon in a way that fulfils the following two conditions: - After the cutting each ribbon piece should have length a, b or c. - After the cutting the number of ribbon pieces should be maximum. Help Polycarpus and find the number of ribbon pieces after the required cutting.	The first line contains four space-separated integers n, a, b and c (1<=≤<=n,<=a,<=b,<=c<=≤<=4000) — the length of the original ribbon and the acceptable lengths of the ribbon pieces after the cutting, correspondingly. The numbers a, b and c can coincide.	Print a single number — the maximum possible number of ribbon pieces. It is guaranteed that at least one correct ribbon cutting exists.	[ "5 5 3 2\n", "7 5 5 2\n" ]	[ "2\n", "2\n" ]	In the first example Polycarpus can cut the ribbon in such way: the first piece has length 2, the second piece has length 3. In the second example Polycarpus can cut the ribbon in such way: the first piece has length 5, the second piece has length 2.	500	[ { "input": "5 5 3 2", "output": "2" }, { "input": "7 5 5 2", "output": "2" }, { "input": "4 4 4 4", "output": "1" }, { "input": "1 1 1 1", "output": "1" }, { "input": "4000 1 2 3", "output": "4000" }, { "input": "4000 3 4 5", "output": "1333" }, { "input": "10 3 4 5", "output": "3" }, { "input": "100 23 15 50", "output": "2" }, { "input": "3119 3515 1021 7", "output": "11" }, { "input": "918 102 1327 1733", "output": "9" }, { "input": "3164 42 430 1309", "output": "15" }, { "input": "3043 317 1141 2438", "output": "7" }, { "input": "26 1 772 2683", "output": "26" }, { "input": "370 2 1 15", "output": "370" }, { "input": "734 12 6 2", "output": "367" }, { "input": "418 18 14 17", "output": "29" }, { "input": "18 16 28 9", "output": "2" }, { "input": "14 6 2 17", "output": "7" }, { "input": "29 27 18 2", "output": "2" }, { "input": "29 12 7 10", "output": "3" }, { "input": "27 23 4 3", "output": "9" }, { "input": "5 14 5 2", "output": "1" }, { "input": "5 17 26 5", "output": "1" }, { "input": "9 1 10 3", "output": "9" }, { "input": "2 19 15 1", "output": "2" }, { "input": "4 6 4 9", "output": "1" }, { "input": "10 6 2 9", "output": "5" }, { "input": "2 2 9 6", "output": "1" }, { "input": "6 2 4 1", "output": "6" }, { "input": "27 24 5 27", "output": "1" }, { "input": "2683 83 26 2709", "output": "101" }, { "input": "728 412 789 158", "output": "3" }, { "input": "3964 4 2916 176", "output": "991" }, { "input": "3399 2035 2 3334", "output": "683" }, { "input": "3455 244 3301 3", "output": "991" }, { "input": "595 2263 3625 1", "output": "595" }, { "input": "4000 1 1 1", "output": "4000" }, { "input": "3999 2 2 3999", "output": "1" }, { "input": "25 6 8 11", "output": "3" }, { "input": "4000 500 1000 2000", "output": "8" }, { "input": "53 10 11 23", "output": "5" }, { "input": "100 100 1 1", "output": "100" }, { "input": "17 3 4 10", "output": "5" }, { "input": "413 101 102 105", "output": "4" }, { "input": "490 4 49 50", "output": "111" }, { "input": "3999 2 3 3", "output": "1999" }, { "input": "8 3 8 4", "output": "2" }, { "input": "5 1 3 3", "output": "5" }, { "input": "100 3 17 22", "output": "27" }, { "input": "4000 2 3 4", "output": "2000" }, { "input": "4000 3 3 5", "output": "1332" }, { "input": "13 4 6 7", "output": "2" }, { "input": "4000 5 2 2", "output": "2000" }, { "input": "3999 2 2 3", "output": "1999" }, { "input": "4000 33 7 3333", "output": "564" }, { "input": "60 33 20 9", "output": "4" }, { "input": "100 9 11 99", "output": "10" }, { "input": "2009 6 8 9", "output": "334" } ]	1,691,299,216	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	30	0	x=list(map(int,input().split())) n=x[0] x=x[1::] x.sort() f=[0]*(n+1) for i in range(3): for j in range(x[i],n+1): f[j]=max(f[j],f[j-x[i]]+1) print(f[n])	Title: Cut Ribbon Time Limit: None seconds Memory Limit: None megabytes Problem Description: Polycarpus has a ribbon, its length is n. He wants to cut the ribbon in a way that fulfils the following two conditions: - After the cutting each ribbon piece should have length a, b or c. - After the cutting the number of ribbon pieces should be maximum. Help Polycarpus and find the number of ribbon pieces after the required cutting. Input Specification: The first line contains four space-separated integers n, a, b and c (1<=≤<=n,<=a,<=b,<=c<=≤<=4000) — the length of the original ribbon and the acceptable lengths of the ribbon pieces after the cutting, correspondingly. The numbers a, b and c can coincide. Output Specification: Print a single number — the maximum possible number of ribbon pieces. It is guaranteed that at least one correct ribbon cutting exists. Demo Input: ['5 5 3 2\n', '7 5 5 2\n'] Demo Output: ['2\n', '2\n'] Note: In the first example Polycarpus can cut the ribbon in such way: the first piece has length 2, the second piece has length 3. In the second example Polycarpus can cut the ribbon in such way: the first piece has length 5, the second piece has length 2.	```python x=list(map(int,input().split())) n=x[0] x=x[1::] x.sort() f=[0]*(n+1) for i in range(3): for j in range(x[i],n+1): f[j]=max(f[j],f[j-x[i]]+1) print(f[n]) ```	0
41	A	Translation	PROGRAMMING	800	[ "implementation", "strings" ]	A. Translation	2	256	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.	The first line contains word s, the second line contains word t. The words consist of lowercase Latin letters. The input data do not consist unnecessary spaces. The words are not empty and their lengths do not exceed 100 symbols.	If the word t is a word s, written reversely, print YES, otherwise print NO.	[ "code\nedoc\n", "abb\naba\n", "code\ncode\n" ]	[ "YES\n", "NO\n", "NO\n" ]	none	500	[ { "input": "code\nedoc", "output": "YES" }, { "input": "abb\naba", "output": "NO" }, { "input": "code\ncode", "output": "NO" }, { "input": "abacaba\nabacaba", "output": "YES" }, { "input": "q\nq", "output": "YES" }, { "input": "asrgdfngfnmfgnhweratgjkk\nasrgdfngfnmfgnhweratgjkk", "output": "NO" }, { "input": "z\na", "output": "NO" }, { "input": "asd\ndsa", "output": "YES" }, { "input": "abcdef\nfecdba", "output": "NO" }, { "input": "ywjjbirapvskozubvxoemscfwl\ngnduubaogtfaiowjizlvjcu", "output": "NO" }, { "input": "mfrmqxtzvgaeuleubcmcxcfqyruwzenguhgrmkuhdgnhgtgkdszwqyd\nmfxufheiperjnhyczclkmzyhcxntdfskzkzdwzzujdinf", "output": "NO" }, { "input": "bnbnemvybqizywlnghlykniaxxxlkhftppbdeqpesrtgkcpoeqowjwhrylpsziiwcldodcoonpimudvrxejjo\ntiynnekmlalogyvrgptbinkoqdwzuiyjlrldxhzjmmp", "output": "NO" }, { "input": "pwlpubwyhzqvcitemnhvvwkmwcaawjvdiwtoxyhbhbxerlypelevasmelpfqwjk\nstruuzebbcenziscuoecywugxncdwzyfozhljjyizpqcgkyonyetarcpwkqhuugsqjuixsxptmbnlfupdcfigacdhhrzb", "output": "NO" }, { "input": "gdvqjoyxnkypfvdxssgrihnwxkeojmnpdeobpecytkbdwujqfjtxsqspxvxpqioyfagzjxupqqzpgnpnpxcuipweunqch\nkkqkiwwasbhezqcfeceyngcyuogrkhqecwsyerdniqiocjehrpkljiljophqhyaiefjpavoom", "output": "NO" }, { "input": "umeszdawsvgkjhlqwzents\nhxqhdungbylhnikwviuh", "output": "NO" }, { "input": "juotpscvyfmgntshcealgbsrwwksgrwnrrbyaqqsxdlzhkbugdyx\nibqvffmfktyipgiopznsqtrtxiijntdbgyy", "output": "NO" }, { "input": "zbwueheveouatecaglziqmudxemhrsozmaujrwlqmppzoumxhamwugedikvkblvmxwuofmpafdprbcftew\nulczwrqhctbtbxrhhodwbcxwimncnexosksujlisgclllxokrsbnozthajnnlilyffmsyko", "output": "NO" }, { "input": "nkgwuugukzcv\nqktnpxedwxpxkrxdvgmfgoxkdfpbzvwsduyiybynbkouonhvmzakeiruhfmvrktghadbfkmwxduoqv", "output": "NO" }, { "input": "incenvizhqpcenhjhehvjvgbsnfixbatrrjstxjzhlmdmxijztphxbrldlqwdfimweepkggzcxsrwelodpnryntepioqpvk\ndhjbjjftlvnxibkklxquwmzhjfvnmwpapdrslioxisbyhhfymyiaqhlgecpxamqnocizwxniubrmpyubvpenoukhcobkdojlybxd", "output": "NO" }, { "input": "w\nw", "output": "YES" }, { "input": "vz\nzv", "output": "YES" }, { "input": "ry\nyr", "output": "YES" }, { "input": "xou\nuox", "output": "YES" }, { "input": "axg\ngax", "output": "NO" }, { "input": "zdsl\nlsdz", "output": "YES" }, { "input": "kudl\nldku", "output": "NO" }, { "input": "zzlzwnqlcl\nlclqnwzlzz", "output": "YES" }, { "input": "vzzgicnzqooejpjzads\nsdazjpjeooqzncigzzv", "output": "YES" }, { "input": "raqhmvmzuwaykjpyxsykr\nxkysrypjkyawuzmvmhqar", "output": "NO" }, { "input": "ngedczubzdcqbxksnxuavdjaqtmdwncjnoaicvmodcqvhfezew\nwezefhvqcdomvciaonjcnwdmtqajdvauxnskxbqcdzbuzcdegn", "output": "YES" }, { "input": "muooqttvrrljcxbroizkymuidvfmhhsjtumksdkcbwwpfqdyvxtrlymofendqvznzlmim\nmimlznzvqdnefomylrtxvydqfpwwbckdskmutjshhmfvdiumykziorbxcjlrrvttqooum", "output": "YES" }, { "input": "vxpqullmcbegsdskddortcvxyqlbvxmmkhevovnezubvpvnrcajpxraeaxizgaowtfkzywvhnbgzsxbhkaipcmoumtikkiyyaivg\ngviayyikkitmuomcpiakhbxszgbnhvwyzkftwoagzixaearxpjacrnvpvbuzenvovehkmmxvblqyxvctroddksdsgebcmlluqpxv", "output": "YES" }, { "input": "mnhaxtaopjzrkqlbroiyipitndczpunwygstmzevgyjdzyanxkdqnvgkikfabwouwkkbzuiuvgvxgpizsvqsbwepktpdrgdkmfdc\ncdfmkdgrdptkpewbsqvszipgxvgvuiuzbkkwuowbafkikgvnqdkxnayzdjygvezmtsgywnupocdntipiyiorblqkrzjpzatxahnm", "output": "NO" }, { "input": "dgxmzbqofstzcdgthbaewbwocowvhqpinehpjatnnbrijcolvsatbblsrxabzrpszoiecpwhfjmwuhqrapvtcgvikuxtzbftydkw\nwkdytfbztxukivgctvparqhuwmjfhwpceiozsprzbaxrslbbqasvlocjirbnntajphenipthvwocowbweabhtgdcztsfoqbzmxgd", "output": "NO" }, { "input": "gxoixiecetohtgjgbqzvlaobkhstejxdklghowtvwunnnvauriohuspsdmpzckprwajyxldoyckgjivjpmbfqtszmtocovxwgeh\nhegwxvocotmzstqfbmpjvijgkcyodlxyjawrpkczpmdspsuhoiruavnnnuwvtwohglkdxjetshkboalvzqbgjgthoteceixioxg", "output": "YES" }, { "input": "sihxuwvmaambplxvjfoskinghzicyfqebjtkysotattkahssumfcgrkheotdxwjckpvapbkaepqrxseyfrwtyaycmrzsrsngkh\nhkgnsrszrmcyaytwrfyesxrqpeakbpavpkcjwxdtoehkrgcfmusshakttatosyktjbeqfycizhgniksofjvxlpbmaamvwuxhis", "output": "YES" }, { "input": "ycnahksbughnonldzrhkysujmylcgcfuludjvjiahtkyzqvkopzqcnwhltbzfugzojqkjjlggmvnultascmygelkiktmfieok\nkoeifmtkiklegkmcsatlunvmggkjjlqjozgufzbtlhwncqzpokvqzykthaijvjdulufcgclymjusyyhrzdlnonhgubskhancy", "output": "NO" }, { "input": "wbqasaehtkfojruzyhrlgwmtyiovmzyfifslvlemhqheyaelzwnthrenjsbmntwaoryzwfbxmscmypvxlfmzpnkkjlvwvmtz\nztmvwvljkknpzmflxvpymcsmxbfwzyroawtnmbsjnerhtnwzleayehqhmelvlsfifyzmvoiytmwglrhyzurjofktheasaqbw", "output": "YES" }, { "input": "imippqurprbhfugngtgifelytadegwrgaefnfhbjjnmzikvjaccotqzemufqieqldgnbmviisgkynzeldlhqxuqphjfmyij\njiymfjhpquxqhldleznykgsiivmbngdlqeiqfumezqtoccajvkizmnjjbhfnfeagrwgedatylefigtgngufhbrpruqppimi", "output": "YES" }, { "input": "bikydffiuisckpvzqlteqfhegsagimodb\nbdomigasgehfqetlqzvpkcsiuiffdykib", "output": "YES" } ]	1,619,777,832	2,147,483,647	Python 3	OK	TESTS	40	154	0	n=input() m=input() x=m[::-1] if n==x: print("YES") else: print("NO")	Title: Translation Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: 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 Specification: The first line contains word s, the second line contains word t. The words consist of lowercase Latin letters. The input data do not consist unnecessary spaces. The words are not empty and their lengths do not exceed 100 symbols. Output Specification: If the word t is a word s, written reversely, print YES, otherwise print NO. Demo Input: ['code\nedoc\n', 'abb\naba\n', 'code\ncode\n'] Demo Output: ['YES\n', 'NO\n', 'NO\n'] Note: none	```python n=input() m=input() x=m[::-1] if n==x: print("YES") else: print("NO") ```	3.9615
732	A	Buy a Shovel	PROGRAMMING	800	[ "brute force", "constructive algorithms", "implementation", "math" ]		null	null	Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is sold for k burles. Assume that there is an unlimited number of such shovels in the shop. In his pocket Polycarp has an unlimited number of "10-burle coins" and exactly one coin of r burles (1<=≤<=r<=≤<=9). What 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.	The single line of input contains two integers k and r (1<=≤<=k<=≤<=1000, 1<=≤<=r<=≤<=9) — the price of one shovel and the denomination of the coin in Polycarp's pocket that is different from "10-burle coins". Remember that he has an unlimited number of coins in the denomination of 10, that is, Polycarp has enough money to buy any number of shovels.	Print the required minimum number of shovels Polycarp has to buy so that he can pay for them without any change.	[ "117 3\n", "237 7\n", "15 2\n" ]	[ "9\n", "1\n", "2\n" ]	In the first example Polycarp can buy 9 shovels and pay 9·117 = 1053 burles. Indeed, he can pay this sum by using 10-burle coins and one 3-burle coin. He can't buy fewer shovels without any change. In the second example it is enough for Polycarp to buy one shovel. In the third example Polycarp should buy two shovels and pay 2·15 = 30 burles. It is obvious that he can pay this sum without any change.	500	[ { "input": "117 3", "output": "9" }, { "input": "237 7", "output": "1" }, { "input": "15 2", "output": "2" }, { "input": "1 1", "output": "1" }, { "input": "1 9", "output": "9" }, { "input": "1000 3", "output": "1" }, { "input": "1000 1", "output": "1" }, { "input": "1000 9", "output": "1" }, { "input": "1 2", "output": "2" }, { "input": "999 9", "output": "1" }, { "input": "999 8", "output": "2" }, { "input": "105 6", "output": "2" }, { "input": "403 9", "output": "3" }, { "input": "546 4", "output": "4" }, { "input": "228 9", "output": "5" }, { "input": "57 2", "output": "6" }, { "input": "437 9", "output": "7" }, { "input": "997 6", "output": "8" }, { "input": "109 1", "output": "9" }, { "input": "998 9", "output": "5" }, { "input": "4 2", "output": "3" }, { "input": "9 3", "output": "7" }, { "input": "8 2", "output": "4" }, { "input": "1 3", "output": "3" }, { "input": "1 4", "output": "4" }, { "input": "1 5", "output": "5" }, { "input": "1 6", "output": "6" }, { "input": "1 7", "output": "7" }, { "input": "1 8", "output": "8" }, { "input": "100 3", "output": "1" }, { "input": "1000 2", "output": "1" }, { "input": "1000 4", "output": "1" }, { "input": "1000 5", "output": "1" }, { "input": "1000 6", "output": "1" }, { "input": "1000 7", "output": "1" }, { "input": "1000 8", "output": "1" }, { "input": "23 4", "output": "8" }, { "input": "33 1", "output": "7" }, { "input": "33 2", "output": "4" }, { "input": "666 5", "output": "5" }, { "input": "2 3", "output": "5" }, { "input": "5 5", "output": "1" }, { "input": "3 6", "output": "2" }, { "input": "12 4", "output": "2" }, { "input": "15 5", "output": "1" }, { "input": "2 5", "output": "5" }, { "input": "25 5", "output": "1" }, { "input": "2 9", "output": "5" }, { "input": "6 7", "output": "5" }, { "input": "8 9", "output": "5" }, { "input": "2 7", "output": "5" }, { "input": "4 7", "output": "5" }, { "input": "2 1", "output": "5" }, { "input": "261 1", "output": "1" } ]	1,680,424,284	2,147,483,647	Python 3	OK	TESTS	54	46	0	a,c=map(int,input().split()) for i in range(1,11): if (ai)%10==0 or (ai)%10==c: print(i) break	Title: Buy a Shovel Time Limit: None seconds Memory Limit: None megabytes Problem Description: Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is sold for k burles. Assume that there is an unlimited number of such shovels in the shop. In his pocket Polycarp has an unlimited number of "10-burle coins" and exactly one coin of r burles (1<=≤<=r<=≤<=9). What 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 Specification: The single line of input contains two integers k and r (1<=≤<=k<=≤<=1000, 1<=≤<=r<=≤<=9) — the price of one shovel and the denomination of the coin in Polycarp's pocket that is different from "10-burle coins". Remember that he has an unlimited number of coins in the denomination of 10, that is, Polycarp has enough money to buy any number of shovels. Output Specification: Print the required minimum number of shovels Polycarp has to buy so that he can pay for them without any change. Demo Input: ['117 3\n', '237 7\n', '15 2\n'] Demo Output: ['9\n', '1\n', '2\n'] Note: In the first example Polycarp can buy 9 shovels and pay 9·117 = 1053 burles. Indeed, he can pay this sum by using 10-burle coins and one 3-burle coin. He can't buy fewer shovels without any change. In the second example it is enough for Polycarp to buy one shovel. In the third example Polycarp should buy two shovels and pay 2·15 = 30 burles. It is obvious that he can pay this sum without any change.	```python a,c=map(int,input().split()) for i in range(1,11): if (ai)%10==0 or (ai)%10==c: print(i) break ```	3
578	A	A Problem about Polyline	PROGRAMMING	1,700	[ "geometry", "math" ]		null	null	There is a polyline going through points (0,<=0)<=–<=(x,<=x)<=–<=(2x,<=0)<=–<=(3x,<=x)<=–<=(4x,<=0)<=–<=...<=-<=(2kx,<=0)<=–<=(2kx<=+<=x,<=x)<=–<=.... We know that the polyline passes through the point (a,<=b). Find minimum positive value x such that it is true or determine that there is no such x.	Only one line containing two positive integers a and b (1<=≤<=a,<=b<=≤<=109).	Output the only line containing the answer. Your answer will be considered correct if its relative or absolute error doesn't exceed 10<=-<=9. If there is no such x then output <=-<=1 as the answer.	[ "3 1\n", "1 3\n", "4 1\n" ]	[ "1.000000000000\n", "-1\n", "1.250000000000\n" ]	You can see following graphs for sample 1 and sample 3.	250	[ { "input": "3 1", "output": "1.000000000000" }, { "input": "1 3", "output": "-1" }, { "input": "4 1", "output": "1.250000000000" }, { "input": "1000000000 1000000000", "output": "1000000000.000000000000" }, { "input": "1000000000 1", "output": "1.000000001000" }, { "input": "991691248 43166756", "output": "47039000.181818180000" }, { "input": "973970808 679365826", "output": "826668317.000000000000" }, { "input": "404878182 80324806", "output": "80867164.666666672000" }, { "input": "405262931 391908625", "output": "398585778.000000000000" }, { "input": "758323881 37209930", "output": "39776690.549999997000" }, { "input": "405647680 36668977", "output": "36859721.416666664000" }, { "input": "750322953 61458580", "output": "67648461.083333328000" }, { "input": "406032429 31993512", "output": "36502161.750000000000" }, { "input": "1000000000 111111111", "output": "111111111.099999990000" }, { "input": "999999999 111111111", "output": "111111111.000000000000" }, { "input": "999999998 111111111", "output": "138888888.625000000000" }, { "input": "888888888 111111111", "output": "124999999.875000000000" }, { "input": "1 1000000000", "output": "-1" }, { "input": "999899988 13", "output": "13.000000117012" }, { "input": "481485937 21902154", "output": "22881276.863636363000" }, { "input": "836218485 1720897", "output": "1724155.106995884800" }, { "input": "861651807 2239668", "output": "2249717.382812500000" }, { "input": "829050416 2523498", "output": "2535286.323170731800" }, { "input": "1000000000 999999999", "output": "999999999.500000000000" }, { "input": "999999999 1000000000", "output": "-1" }, { "input": "11 5", "output": "8.000000000000" }, { "input": "100000000 1", "output": "1.000000010000" }, { "input": "1488 1", "output": "1.000672043011" }, { "input": "11 3", "output": "3.500000000000" }, { "input": "30 5", "output": "5.833333333333" }, { "input": "5 1", "output": "1.000000000000" } ]	1,623,485,645	2,147,483,647	PyPy 3	RUNTIME_ERROR	TESTS	3	124	2,150,400	a, b = [int(i) for i in input().split()] if a<b: print(-1) else: opt1 = (a-b)//b if opt1&1: opt1 -= 1 opt2 = (a+b)//b if opt2&1: opt2 -= 1 print(min((a-b)/opt1, (a+b)/opt2))	Title: A Problem about Polyline Time Limit: None seconds Memory Limit: None megabytes Problem Description: There is a polyline going through points (0,<=0)<=–<=(x,<=x)<=–<=(2x,<=0)<=–<=(3x,<=x)<=–<=(4x,<=0)<=–<=...<=-<=(2kx,<=0)<=–<=(2kx<=+<=x,<=x)<=–<=.... We know that the polyline passes through the point (a,<=b). Find minimum positive value x such that it is true or determine that there is no such x. Input Specification: Only one line containing two positive integers a and b (1<=≤<=a,<=b<=≤<=109). Output Specification: Output the only line containing the answer. Your answer will be considered correct if its relative or absolute error doesn't exceed 10<=-<=9. If there is no such x then output <=-<=1 as the answer. Demo Input: ['3 1\n', '1 3\n', '4 1\n'] Demo Output: ['1.000000000000\n', '-1\n', '1.250000000000\n'] Note: You can see following graphs for sample 1 and sample 3.	```python a, b = [int(i) for i in input().split()] if a<b: print(-1) else: opt1 = (a-b)//b if opt1&1: opt1 -= 1 opt2 = (a+b)//b if opt2&1: opt2 -= 1 print(min((a-b)/opt1, (a+b)/opt2)) ```	-1
622	A	Infinite Sequence	PROGRAMMING	1,000	[ "implementation", "math" ]		null	null	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). Find the number on the n-th position of the sequence.	The only line contains integer n (1<=≤<=n<=≤<=1014) — the position of the number to find. Note that the given number is too large, so you should use 64-bit integer type to store it. In C++ you can use the long long integer type and in Java you can use long integer type.	Print the element in the n-th position of the sequence (the elements are numerated from one).	[ "3\n", "5\n", "10\n", "55\n", "56\n" ]	[ "2\n", "2\n", "4\n", "10\n", "1\n" ]	none	0	[ { "input": "3", "output": "2" }, { "input": "5", "output": "2" }, { "input": "10", "output": "4" }, { "input": "55", "output": "10" }, { "input": "56", "output": "1" }, { "input": "1000000000000", "output": "88209" }, { "input": "847194127849", "output": "255708" }, { "input": "294719472984", "output": "593358" }, { "input": "999999911791", "output": "1414213" }, { "input": "999999911792", "output": "1" }, { "input": "100000000000000", "output": "1749820" }, { "input": "1", "output": "1" }, { "input": "99993", "output": "312" }, { "input": "99994", "output": "313" }, { "input": "99995", "output": "314" }, { "input": "99990", "output": "309" }, { "input": "2", "output": "1" }, { "input": "99991", "output": "310" }, { "input": "99992", "output": "311" }, { "input": "99996", "output": "315" }, { "input": "99997", "output": "316" }, { "input": "99998", "output": "317" }, { "input": "99999", "output": "318" }, { "input": "1021", "output": "31" }, { "input": "4", "output": "1" }, { "input": "23", "output": "2" }, { "input": "9994", "output": "124" }, { "input": "99939", "output": "258" }, { "input": "99999998250180", "output": "14142135" }, { "input": "6", "output": "3" }, { "input": "8", "output": "2" }, { "input": "35", "output": "7" }, { "input": "100", "output": "9" }, { "input": "10101010", "output": "745" }, { "input": "103", "output": "12" }, { "input": "102", "output": "11" }, { "input": "101", "output": "10" } ]	1,530,524,343	2,147,483,647	Python 3	OK	TESTS	37	124	307,200	n=int(input())-1 root=int((-1+(1+4n2)*0.5)/2) print(n+1-(root(root+1))//2)	Title: Infinite Sequence Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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). Find the number on the n-th position of the sequence. Input Specification: The only line contains integer n (1<=≤<=n<=≤<=1014) — the position of the number to find. Note that the given number is too large, so you should use 64-bit integer type to store it. In C++ you can use the long long integer type and in Java you can use long integer type. Output Specification: Print the element in the n-th position of the sequence (the elements are numerated from one). Demo Input: ['3\n', '5\n', '10\n', '55\n', '56\n'] Demo Output: ['2\n', '2\n', '4\n', '10\n', '1\n'] Note: none	```python n=int(input())-1 root=int((-1+(1+4n2)*0.5)/2) print(n+1-(root(root+1))//2) ```	3
653	A	Bear and Three Balls	PROGRAMMING	900	[ "brute force", "implementation", "sortings" ]		null	null	Limak is a little polar bear. He has n balls, the i-th ball has size ti. Limak 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: - No two friends can get balls of the same size. - No two friends can get balls of sizes that differ by more than 2. For 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). Your task is to check whether Limak can choose three balls that satisfy conditions above.	The first line of the input contains one integer n (3<=≤<=n<=≤<=50) — the number of balls Limak has. The second line contains n integers t1,<=t2,<=...,<=tn (1<=≤<=ti<=≤<=1000) where ti denotes the size of the i-th ball.	Print "YES" (without quotes) if Limak can choose three balls of distinct sizes, such that any two of them differ by no more than 2. Otherwise, print "NO" (without quotes).	[ "4\n18 55 16 17\n", "6\n40 41 43 44 44 44\n", "8\n5 972 3 4 1 4 970 971\n" ]	[ "YES\n", "NO\n", "YES\n" ]	In the first sample, there are 4 balls and Limak is able to choose three of them to satisfy the rules. He must must choose balls with sizes 18, 16 and 17. In the second sample, there is no way to give gifts to three friends without breaking the rules. In the third sample, there is even more than one way to choose balls: 1. Choose balls with sizes 3, 4 and 5. 1. Choose balls with sizes 972, 970, 971.	500	[ { "input": "4\n18 55 16 17", "output": "YES" }, { "input": "6\n40 41 43 44 44 44", "output": "NO" }, { "input": "8\n5 972 3 4 1 4 970 971", "output": "YES" }, { "input": "3\n959 747 656", "output": "NO" }, { "input": "4\n1 2 2 3", "output": "YES" }, { "input": "50\n998 30 384 289 505 340 872 223 663 31 929 625 864 699 735 589 676 399 745 635 963 381 75 97 324 612 597 797 103 382 25 894 219 458 337 572 201 355 294 275 278 311 586 573 965 704 936 237 715 543", "output": "NO" }, { "input": "50\n941 877 987 982 966 979 984 810 811 909 872 980 957 897 845 995 924 905 984 914 824 840 868 910 815 808 872 858 883 952 823 835 860 874 959 972 931 867 866 987 982 837 800 921 887 910 982 980 828 869", "output": "YES" }, { "input": "3\n408 410 409", "output": "YES" }, { "input": "3\n903 902 904", "output": "YES" }, { "input": "3\n399 400 398", "output": "YES" }, { "input": "3\n450 448 449", "output": "YES" }, { "input": "3\n390 389 388", "output": "YES" }, { "input": "3\n438 439 440", "output": "YES" }, { "input": "11\n488 688 490 94 564 615 641 170 489 517 669", "output": "YES" }, { "input": "24\n102 672 983 82 720 501 81 721 982 312 207 897 159 964 611 956 118 984 37 271 596 403 772 954", "output": "YES" }, { "input": "36\n175 551 70 479 875 480 979 32 465 402 640 116 76 687 874 678 359 785 753 401 978 629 162 963 886 641 39 845 132 930 2 372 478 947 407 318", "output": "YES" }, { "input": "6\n10 79 306 334 304 305", "output": "YES" }, { "input": "34\n787 62 26 683 486 364 684 891 846 801 969 837 359 800 836 359 471 637 732 91 841 836 7 799 959 405 416 841 737 803 615 483 323 365", "output": "YES" }, { "input": "30\n860 238 14 543 669 100 428 789 576 484 754 274 849 850 586 377 711 386 510 408 520 693 23 477 266 851 728 711 964 73", "output": "YES" }, { "input": "11\n325 325 324 324 324 325 325 324 324 324 324", "output": "NO" }, { "input": "7\n517 517 518 517 518 518 518", "output": "NO" }, { "input": "20\n710 710 711 711 711 711 710 710 710 710 711 710 710 710 710 710 710 711 711 710", "output": "NO" }, { "input": "48\n29 30 29 29 29 30 29 30 30 30 30 29 30 30 30 29 29 30 30 29 30 29 29 30 29 30 29 30 30 29 30 29 29 30 30 29 29 30 30 29 29 30 30 30 29 29 30 29", "output": "NO" }, { "input": "7\n880 880 514 536 881 881 879", "output": "YES" }, { "input": "15\n377 432 262 376 261 375 377 262 263 263 261 376 262 262 375", "output": "YES" }, { "input": "32\n305 426 404 961 426 425 614 304 404 425 615 403 303 304 615 303 305 405 427 614 403 303 425 615 404 304 427 403 206 616 405 404", "output": "YES" }, { "input": "41\n115 686 988 744 762 519 745 519 518 83 85 115 520 44 687 686 685 596 988 687 989 988 114 745 84 519 519 746 988 84 745 744 115 114 85 115 520 746 745 116 987", "output": "YES" }, { "input": "47\n1 2 483 28 7 109 270 651 464 162 353 521 224 989 721 499 56 69 197 716 313 446 580 645 828 197 100 138 789 499 147 677 384 711 783 937 300 543 540 93 669 604 739 122 632 822 116", "output": "NO" }, { "input": "31\n1 2 1 373 355 692 750 920 578 666 615 232 141 129 663 929 414 704 422 559 568 731 354 811 532 618 39 879 292 602 995", "output": "NO" }, { "input": "50\n5 38 41 4 15 40 27 39 20 3 44 47 30 6 36 29 35 12 19 26 10 2 21 50 11 46 48 49 17 16 33 13 32 28 31 18 23 34 7 14 24 45 9 37 1 8 42 25 43 22", "output": "YES" }, { "input": "50\n967 999 972 990 969 978 963 987 954 955 973 970 959 981 995 983 986 994 979 957 965 982 992 977 953 975 956 961 993 997 998 958 980 962 960 951 996 991 1000 966 971 988 976 968 989 984 974 964 985 952", "output": "YES" }, { "input": "50\n850 536 761 506 842 898 857 723 583 637 536 943 895 929 890 612 832 633 696 731 553 880 710 812 665 877 915 636 711 540 748 600 554 521 813 796 568 513 543 809 798 820 928 504 999 646 907 639 550 911", "output": "NO" }, { "input": "3\n3 1 2", "output": "YES" }, { "input": "3\n500 999 1000", "output": "NO" }, { "input": "10\n101 102 104 105 107 109 110 112 113 115", "output": "NO" }, { "input": "50\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "NO" }, { "input": "50\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000", "output": "NO" }, { "input": "3\n1000 999 998", "output": "YES" }, { "input": "49\n343 322 248 477 53 156 245 493 209 141 370 66 229 184 434 137 276 472 216 456 147 180 140 114 493 323 393 262 380 314 222 124 98 441 129 346 48 401 347 460 122 125 114 106 189 260 374 165 456", "output": "NO" }, { "input": "20\n1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 3 3 3 3 3", "output": "YES" }, { "input": "3\n999 999 1000", "output": "NO" }, { "input": "9\n2 4 5 13 25 100 200 300 400", "output": "NO" }, { "input": "9\n1 1 1 2 2 2 3 3 3", "output": "YES" }, { "input": "3\n1 1 2", "output": "NO" }, { "input": "3\n998 999 1000", "output": "YES" }, { "input": "12\n1 1 1 1 1 1 1 1 1 2 2 4", "output": "NO" }, { "input": "4\n4 3 4 5", "output": "YES" }, { "input": "6\n1 1 1 2 2 2", "output": "NO" }, { "input": "3\n2 3 2", "output": "NO" }, { "input": "5\n10 5 6 3 2", "output": "NO" }, { "input": "3\n1 2 1", "output": "NO" }, { "input": "3\n1 2 3", "output": "YES" }, { "input": "4\n998 999 1000 1000", "output": "YES" }, { "input": "5\n2 3 9 9 4", "output": "YES" }, { "input": "4\n1 2 4 4", "output": "NO" }, { "input": "3\n1 1 1", "output": "NO" }, { "input": "3\n2 2 3", "output": "NO" }, { "input": "7\n1 2 2 2 4 5 6", "output": "YES" }, { "input": "5\n1 3 10 3 10", "output": "NO" }, { "input": "3\n1 2 2", "output": "NO" }, { "input": "4\n1000 1000 999 998", "output": "YES" }, { "input": "3\n5 3 7", "output": "NO" }, { "input": "6\n1 1 2 2 3 3", "output": "YES" }, { "input": "9\n6 6 6 5 5 5 4 4 4", "output": "YES" }, { "input": "7\n5 6 6 6 7 7 7", "output": "YES" }, { "input": "5\n2 3 3 3 4", "output": "YES" }, { "input": "5\n2 1 2 1 3", "output": "YES" }, { "input": "3\n1 2 7", "output": "NO" }, { "input": "3\n1000 1000 1000", "output": "NO" }, { "input": "5\n1 100 2 100 3", "output": "YES" }, { "input": "5\n5 4 6 5 5", "output": "YES" }, { "input": "12\n1 1 1 1 2 2 2 2 3 3 3 3", "output": "YES" }, { "input": "5\n9 9 1 2 3", "output": "YES" }, { "input": "6\n1 2 3 1 2 3", "output": "YES" }, { "input": "7\n1 1 1 1 2 3 3", "output": "YES" }, { "input": "3\n13 13 13", "output": "NO" }, { "input": "3\n42 42 42", "output": "NO" }, { "input": "8\n1 1 1 1 2 2 2 2", "output": "NO" }, { "input": "6\n1 1 1 1 2 3", "output": "YES" }, { "input": "6\n1 1 2 2 6 6", "output": "NO" }, { "input": "6\n1 2 5 5 5 5", "output": "NO" }, { "input": "9\n1 2 3 1 2 3 1 2 3", "output": "YES" }, { "input": "4\n1 2 1 100", "output": "NO" }, { "input": "5\n1 1 2 2 3", "output": "YES" } ]	1,651,322,153	2,147,483,647	Python 3	OK	TESTS	84	46	0	def checkIsValidBall(a, b): if(a == b or a > b + 2 or a < b - 2): return False return True def bearandThreeBalls(): n = int(input()) array = list(map(int, input().split(' '))) array.sort() for i in range(0, n): for j in range(i+1, n): for k in range(j+1, n): if(checkIsValidBall(array[i], array[j]) and checkIsValidBall(array[i], array[k]) and checkIsValidBall(array[j], array[k])): return "YES" return "NO" if __name__ == "__main__": print(bearandThreeBalls())	Title: Bear and Three Balls Time Limit: None seconds Memory Limit: None megabytes Problem Description: Limak is a little polar bear. He has n balls, the i-th ball has size ti. Limak 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: - No two friends can get balls of the same size. - No two friends can get balls of sizes that differ by more than 2. For 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). Your task is to check whether Limak can choose three balls that satisfy conditions above. Input Specification: The first line of the input contains one integer n (3<=≤<=n<=≤<=50) — the number of balls Limak has. The second line contains n integers t1,<=t2,<=...,<=tn (1<=≤<=ti<=≤<=1000) where ti denotes the size of the i-th ball. Output Specification: Print "YES" (without quotes) if Limak can choose three balls of distinct sizes, such that any two of them differ by no more than 2. Otherwise, print "NO" (without quotes). Demo Input: ['4\n18 55 16 17\n', '6\n40 41 43 44 44 44\n', '8\n5 972 3 4 1 4 970 971\n'] Demo Output: ['YES\n', 'NO\n', 'YES\n'] Note: In the first sample, there are 4 balls and Limak is able to choose three of them to satisfy the rules. He must must choose balls with sizes 18, 16 and 17. In the second sample, there is no way to give gifts to three friends without breaking the rules. In the third sample, there is even more than one way to choose balls: 1. Choose balls with sizes 3, 4 and 5. 1. Choose balls with sizes 972, 970, 971.	```python def checkIsValidBall(a, b): if(a == b or a > b + 2 or a < b - 2): return False return True def bearandThreeBalls(): n = int(input()) array = list(map(int, input().split(' '))) array.sort() for i in range(0, n): for j in range(i+1, n): for k in range(j+1, n): if(checkIsValidBall(array[i], array[j]) and checkIsValidBall(array[i], array[k]) and checkIsValidBall(array[j], array[k])): return "YES" return "NO" if __name__ == "__main__": print(bearandThreeBalls()) ```	3
558	A	Lala Land and Apple Trees	PROGRAMMING	1,100	[ "brute force", "implementation", "sortings" ]		null	null	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. Lala Land has exactly n apple trees. Tree number i is located in a position xi and has ai 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. What is the maximum number of apples he can collect?	The first line contains one number n (1<=≤<=n<=≤<=100), the number of apple trees in Lala Land. The following n lines contains two integers each xi, ai (<=-<=105<=≤<=xi<=≤<=105, xi<=≠<=0, 1<=≤<=ai<=≤<=105), representing the position of the i-th tree and number of apples on it. It's guaranteed that there is at most one apple tree at each coordinate. It's guaranteed that no tree grows in point 0.	Output the maximum number of apples Amr can collect.	[ "2\n-1 5\n1 5\n", "3\n-2 2\n1 4\n-1 3\n", "3\n1 9\n3 5\n7 10\n" ]	[ "10", "9", "9" ]	In the first sample test it doesn't matter if Amr chose at first to go left or right. In both cases he'll get all the apples. In the second sample test the optimal solution is to go left to x = - 1, collect apples from there, then the direction will be reversed, Amr has to go to x = 1, collect apples from there, then the direction will be reversed and Amr goes to the final tree x = - 2. In the third sample test the optimal solution is to go right to x = 1, collect apples from there, then the direction will be reversed and Amr will not be able to collect anymore apples because there are no apple trees to his left.	500	[ { "input": "2\n-1 5\n1 5", "output": "10" }, { "input": "3\n-2 2\n1 4\n-1 3", "output": "9" }, { "input": "3\n1 9\n3 5\n7 10", "output": "9" }, { "input": "1\n1 1", "output": "1" }, { "input": "4\n10000 100000\n-1000 100000\n-2 100000\n-1 100000", "output": "300000" }, { "input": "1\n-1 1", "output": "1" }, { "input": "27\n-30721 24576\n-6620 92252\n88986 24715\n-94356 10509\n-6543 29234\n-68554 69530\n39176 96911\n67266 99669\n95905 51002\n-94093 92134\n65382 23947\n-6525 79426\n-448 67531\n-70083 26921\n-86333 50029\n48924 8036\n-27228 5349\n6022 10691\n-13840 56735\n50398 58794\n-63258 45557\n-27792 77057\n98295 1203\n-51294 18757\n35037 61941\n-30112 13076\n82334 20463", "output": "1036452" }, { "input": "18\n-18697 44186\n56333 51938\n-75688 49735\n77762 14039\n-43996 81060\n69700 49107\n74532 45568\n-94476 203\n-92347 90745\n58921 44650\n57563 63561\n44630 8486\n35750 5999\n3249 34202\n75358 68110\n-33245 60458\n-88148 2342\n87856 85532", "output": "632240" }, { "input": "28\n49728 91049\n-42863 4175\n-89214 22191\n77977 16965\n-42960 87627\n-84329 97494\n89270 75906\n-13695 28908\n-72279 13607\n-97327 87062\n-58682 32094\n39108 99936\n29304 93784\n-63886 48237\n-77359 57648\n-87013 79017\n-41086 35033\n-60613 83555\n-48955 56816\n-20568 26802\n52113 25160\n-88885 45294\n22601 42971\n62693 65662\n-15985 5357\n86671 8522\n-59921 11271\n-79304 25044", "output": "891593" }, { "input": "25\n5704 67795\n6766 31836\n-41715 89987\n76854 9848\n11648 90020\n-79763 10107\n96971 92636\n-64205 71937\n87997 38273\n-9782 57187\n22186 6905\n-41130 40258\n-28403 66579\n19578 43375\n35735 52929\n-52417 89388\n-89430 1939\n9401 43491\n-11228 10112\n-86859 16024\n-51486 33467\n-80578 65080\n-52820 98445\n-89165 7657\n-97106 79422", "output": "1109655" }, { "input": "16\n-41732 47681\n44295 28942\n-75194 99827\n69982 18020\n-75378 22026\n80032 22908\n-34879 41113\n36257 48574\n-35882 84333\n29646 71151\n-86214 80886\n72724 39364\n-42529 60880\n29150 29921\n-8471 80781\n79387 70834", "output": "847241" }, { "input": "3\n-94146 4473\n28707 99079\n-4153 8857", "output": "112409" }, { "input": "3\n-3 3\n-2 2\n-1 1", "output": "1" }, { "input": "2\n100000 3\n-100000 9", "output": "12" }, { "input": "2\n-100000 100000\n100000 99999", "output": "199999" } ]	1,436,887,558	958	Python 3	WRONG_ANSWER	PRETESTS	6	46	0	R = lambda: list(map(int, input().split())) n = R()[0] a = [] for i in range(n): a.append(R()) npos = 0 nneg = 0 for i in a: if i[0] > 0: npos+=1 else: nneg +=1 ans = 0 if(npos >= nneg+1): ans = sum(i[1] for i in a[:nneg + nneg + 1]) else: ans = sum(i[1] for i in a[max(0, nneg - 1 - npos):]) print(ans)	Title: Lala Land and Apple Trees Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. Lala Land has exactly n apple trees. Tree number i is located in a position xi and has ai 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. What is the maximum number of apples he can collect? Input Specification: The first line contains one number n (1<=≤<=n<=≤<=100), the number of apple trees in Lala Land. The following n lines contains two integers each xi, ai (<=-<=105<=≤<=xi<=≤<=105, xi<=≠<=0, 1<=≤<=ai<=≤<=105), representing the position of the i-th tree and number of apples on it. It's guaranteed that there is at most one apple tree at each coordinate. It's guaranteed that no tree grows in point 0. Output Specification: Output the maximum number of apples Amr can collect. Demo Input: ['2\n-1 5\n1 5\n', '3\n-2 2\n1 4\n-1 3\n', '3\n1 9\n3 5\n7 10\n'] Demo Output: ['10', '9', '9'] Note: In the first sample test it doesn't matter if Amr chose at first to go left or right. In both cases he'll get all the apples. In the second sample test the optimal solution is to go left to x = - 1, collect apples from there, then the direction will be reversed, Amr has to go to x = 1, collect apples from there, then the direction will be reversed and Amr goes to the final tree x = - 2. In the third sample test the optimal solution is to go right to x = 1, collect apples from there, then the direction will be reversed and Amr will not be able to collect anymore apples because there are no apple trees to his left.	```python R = lambda: list(map(int, input().split())) n = R()[0] a = [] for i in range(n): a.append(R()) npos = 0 nneg = 0 for i in a: if i[0] > 0: npos+=1 else: nneg +=1 ans = 0 if(npos >= nneg+1): ans = sum(i[1] for i in a[:nneg + nneg + 1]) else: ans = sum(i[1] for i in a[max(0, nneg - 1 - npos):]) print(ans) ```	0
358	B	Dima and Text Messages	PROGRAMMING	1,500	[ "brute force", "strings" ]		null	null	Seryozha has a very changeable character. This time he refused to leave the room to Dima and his girlfriend (her hame is Inna, by the way). However, the two lovebirds can always find a way to communicate. Today they are writing text messages to each other. Dima and Inna are using a secret code in their text messages. When Dima wants to send Inna some sentence, he writes out all words, inserting a heart before each word and after the last word. A heart is a sequence of two characters: the "less" characters (<) and the digit three (3). After applying the code, a test message looks like that: <3word1<3word2<3 ... wordn<3. Encoding doesn't end here. Then Dima inserts a random number of small English characters, digits, signs "more" and "less" into any places of the message. Inna knows Dima perfectly well, so she knows what phrase Dima is going to send her beforehand. Inna has just got a text message. Help her find out if Dima encoded the message correctly. In other words, find out if a text message could have been received by encoding in the manner that is described above.	The first line contains integer n (1<=≤<=n<=≤<=105) — the number of words in Dima's message. Next n lines contain non-empty words, one word per line. The words only consist of small English letters. The total length of all words doesn't exceed 105. The last line contains non-empty text message that Inna has got. The number of characters in the text message doesn't exceed 105. A text message can contain only small English letters, digits and signs more and less.	In a single line, print "yes" (without the quotes), if Dima decoded the text message correctly, and "no" (without the quotes) otherwise.	[ "3\ni\nlove\nyou\n<3i<3love<23you<3\n", "7\ni\nam\nnot\nmain\nin\nthe\nfamily\n<3i<>3am<3the<3<main<3in<3the<3><3family<3\n" ]	[ "yes\n", "no\n" ]	Please note that Dima got a good old kick in the pants for the second sample from the statement.	1,000	[ { "input": "3\ni\nlove\nyou\n<3i<3love<23you<3", "output": "yes" }, { "input": "7\ni\nam\nnot\nmain\nin\nthe\nfamily\n<3i<>3am<3the<3<main<3in<3the<3><3family<3", "output": "no" }, { "input": "3\ni\nlove\nyou\n<3i<3lo<3ve<3y<<<<<<<ou3<3", "output": "yes" }, { "input": "4\na\nb\nc\nd\n<3a<3b<3c<3d", "output": "no" }, { "input": "4\na\nb\nc\nd\na<3b<3c<3d<3", "output": "no" }, { "input": "3\ni\nlove\nyou\n<3i<3love<3you<3", "output": "yes" }, { "input": "1\na\na", "output": "no" }, { "input": "1\na\n<3a<3b", "output": "yes" }, { "input": "1\naa\n<3a<3", "output": "no" }, { "input": "3\ni\nlove\nyou\n<3i<3love<23you<3ww", "output": "yes" }, { "input": "3\ni\nlove\nyou\n<3ilove<23you<3", "output": "no" }, { "input": "2\na\ni\n<3ai<3", "output": "no" } ]	1,642,775,906	2,147,483,647	Python 3	OK	TESTS	30	124	1,433,600	import sys import re n = int(sys.stdin.readline()[:-1]) words = "" for i in range(n): words += "<3" + sys.stdin.readline()[:-1] words += "<3" line = sys.stdin.readline()[:-1].lower() s = 0 for i in range(len(line)): if(line[i] == words[s]): s+=1 if(s >= len(words)): break if(s == len(words)): print("yes") else: print("no")	Title: Dima and Text Messages Time Limit: None seconds Memory Limit: None megabytes Problem Description: Seryozha has a very changeable character. This time he refused to leave the room to Dima and his girlfriend (her hame is Inna, by the way). However, the two lovebirds can always find a way to communicate. Today they are writing text messages to each other. Dima and Inna are using a secret code in their text messages. When Dima wants to send Inna some sentence, he writes out all words, inserting a heart before each word and after the last word. A heart is a sequence of two characters: the "less" characters (<) and the digit three (3). After applying the code, a test message looks like that: <3word1<3word2<3 ... wordn<3. Encoding doesn't end here. Then Dima inserts a random number of small English characters, digits, signs "more" and "less" into any places of the message. Inna knows Dima perfectly well, so she knows what phrase Dima is going to send her beforehand. Inna has just got a text message. Help her find out if Dima encoded the message correctly. In other words, find out if a text message could have been received by encoding in the manner that is described above. Input Specification: The first line contains integer n (1<=≤<=n<=≤<=105) — the number of words in Dima's message. Next n lines contain non-empty words, one word per line. The words only consist of small English letters. The total length of all words doesn't exceed 105. The last line contains non-empty text message that Inna has got. The number of characters in the text message doesn't exceed 105. A text message can contain only small English letters, digits and signs more and less. Output Specification: In a single line, print "yes" (without the quotes), if Dima decoded the text message correctly, and "no" (without the quotes) otherwise. Demo Input: ['3\ni\nlove\nyou\n<3i<3love<23you<3\n', '7\ni\nam\nnot\nmain\nin\nthe\nfamily\n<3i<>3am<3the<3<main<3in<3the<3><3family<3\n'] Demo Output: ['yes\n', 'no\n'] Note: Please note that Dima got a good old kick in the pants for the second sample from the statement.	```python import sys import re n = int(sys.stdin.readline()[:-1]) words = "" for i in range(n): words += "<3" + sys.stdin.readline()[:-1] words += "<3" line = sys.stdin.readline()[:-1].lower() s = 0 for i in range(len(line)): if(line[i] == words[s]): s+=1 if(s >= len(words)): break if(s == len(words)): print("yes") else: print("no") ```	3
127	A	Wasted Time	PROGRAMMING	900	[ "geometry" ]		null	null	Mr. Scrooge, a very busy man, decided to count the time he wastes on all sorts of useless stuff to evaluate the lost profit. He has already counted the time he wastes sleeping and eating. And now Mr. Scrooge wants to count the time he has wasted signing papers. Mr. Scrooge's signature can be represented as a polyline A1A2... An. Scrooge signs like that: first it places a pen at the point A1, then draws a segment from point A1 to point A2, then he draws a segment from point A2 to point A3 and so on to point An, where he stops signing and takes the pen off the paper. At that the resulting line can intersect with itself and partially repeat itself but Scrooge pays no attention to it and never changes his signing style. As Scrooge makes the signature, he never takes the pen off the paper and his writing speed is constant — 50 millimeters per second. Scrooge signed exactly k papers throughout his life and all those signatures look the same. Find the total time Scrooge wasted signing the papers.	The first line contains two integers n and k (2<=≤<=n<=≤<=100, 1<=≤<=k<=≤<=1000). Each of the following n lines contains the coordinates of the polyline's endpoints. The i-th one contains coordinates of the point Ai — integers xi and yi, separated by a space. All points Ai are different. The absolute value of all coordinates does not exceed 20. The coordinates are measured in millimeters.	Print one real number — the total time Scrooges wastes on signing the papers in seconds. The absolute or relative error should not exceed 10<=-<=6.	[ "2 1\n0 0\n10 0\n", "5 10\n3 1\n-5 6\n-2 -1\n3 2\n10 0\n", "6 10\n5 0\n4 0\n6 0\n3 0\n7 0\n2 0\n" ]	[ "0.200000000", "6.032163204", "3.000000000" ]	none	500	[ { "input": "2 1\n0 0\n10 0", "output": "0.200000000" }, { "input": "5 10\n3 1\n-5 6\n-2 -1\n3 2\n10 0", "output": "6.032163204" }, { "input": "6 10\n5 0\n4 0\n6 0\n3 0\n7 0\n2 0", "output": "3.000000000" }, { "input": "10 95\n-20 -5\n2 -8\n14 13\n10 3\n17 11\n13 -12\n-6 11\n14 -15\n-13 14\n19 8", "output": "429.309294877" }, { "input": "30 1000\n4 -13\n14 13\n-14 -16\n-9 18\n17 11\n2 -8\n2 15\n8 -1\n-9 13\n8 -12\n-2 20\n11 -12\n19 8\n9 -15\n-20 -5\n-18 20\n-13 14\n-12 -17\n-4 3\n13 -12\n11 -10\n18 7\n-6 11\n10 13\n10 3\n6 -14\n-1 10\n14 -15\n2 11\n-8 10", "output": "13629.282573522" }, { "input": "2 1\n-20 -10\n-10 -6", "output": "0.215406592" }, { "input": "2 13\n13 -10\n-3 -2", "output": "4.651021393" }, { "input": "2 21\n13 8\n14 10", "output": "0.939148551" }, { "input": "2 75\n-3 12\n1 12", "output": "6.000000000" }, { "input": "2 466\n10 16\n-6 -3", "output": "231.503997374" }, { "input": "2 999\n6 16\n-17 -14", "output": "755.286284531" }, { "input": "2 1000\n-17 -14\n-14 -8", "output": "134.164078650" }, { "input": "3 384\n-4 -19\n-17 -2\n3 4", "output": "324.722285390" }, { "input": "5 566\n-11 8\n2 -7\n7 0\n-7 -9\n-7 5", "output": "668.956254495" }, { "input": "7 495\n-10 -13\n-9 -5\n4 9\n8 13\n-4 2\n2 10\n-18 15", "output": "789.212495576" }, { "input": "10 958\n7 13\n20 19\n12 -7\n10 -10\n-13 -15\n-10 -7\n20 -5\n-11 19\n-7 3\n-4 18", "output": "3415.618464093" }, { "input": "13 445\n-15 16\n-8 -14\n8 7\n4 15\n8 -13\n15 -11\n-12 -4\n2 -13\n-5 0\n-20 -14\n-8 -7\n-10 -18\n18 -5", "output": "2113.552527680" }, { "input": "18 388\n11 -8\n13 10\n18 -17\n-15 3\n-13 -15\n20 -7\n1 -10\n-13 -12\n-12 -15\n-17 -8\n1 -2\n3 -20\n-8 -9\n15 -13\n-19 -6\n17 3\n-17 2\n6 6", "output": "2999.497312668" }, { "input": "25 258\n-5 -3\n-18 -14\n12 3\n6 11\n4 2\n-19 -3\n19 -7\n-15 19\n-19 -12\n-11 -10\n-5 17\n10 15\n-4 1\n-3 -20\n6 16\n18 -19\n11 -19\n-17 10\n-17 17\n-2 -17\n-3 -9\n18 13\n14 8\n-2 -5\n-11 4", "output": "2797.756635934" }, { "input": "29 848\n11 -10\n-19 1\n18 18\n19 -19\n0 -5\n16 10\n-20 -14\n7 15\n6 8\n-15 -16\n9 3\n16 -20\n-12 12\n18 -1\n-11 14\n18 10\n11 -20\n-20 -16\n-1 11\n13 10\n-6 13\n-7 -10\n-11 -10\n-10 3\n15 -13\n-4 11\n-13 -11\n-11 -17\n11 -5", "output": "12766.080247922" }, { "input": "36 3\n-11 20\n-11 13\n-17 9\n15 9\n-6 9\n-1 11\n12 -11\n16 -10\n-20 7\n-18 6\n-15 -2\n20 -20\n16 4\n-20 -8\n-12 -15\n-13 -6\n-9 -4\n0 -10\n8 -1\n1 4\n5 8\n8 -15\n16 -12\n19 1\n0 -4\n13 -4\n17 -13\n-7 11\n14 9\n-14 -9\n5 -8\n11 -8\n-17 -5\n1 -3\n-16 -17\n2 -3", "output": "36.467924851" }, { "input": "48 447\n14 9\n9 -17\n-17 11\n-14 14\n19 -8\n-14 -17\n-7 10\n-6 -11\n-9 -19\n19 10\n-4 2\n-5 16\n20 9\n-10 20\n-7 -17\n14 -16\n-2 -10\n-18 -17\n14 12\n-6 -19\n5 -18\n-3 2\n-3 10\n-5 5\n13 -12\n10 -18\n10 -12\n-2 4\n7 -15\n-5 -5\n11 14\n11 10\n-6 -9\n13 -4\n13 9\n6 12\n-13 17\n-9 -12\n14 -19\n10 12\n-15 8\n-1 -11\n19 8\n11 20\n-9 -3\n16 1\n-14 19\n8 -4", "output": "9495.010556306" }, { "input": "50 284\n-17 -13\n7 12\n-13 0\n13 1\n14 6\n14 -9\n-5 -1\n0 -10\n12 -3\n-14 6\n-8 10\n-16 17\n0 -1\n4 -9\n2 6\n1 8\n-8 -14\n3 9\n1 -15\n-4 -19\n-7 -20\n18 10\n3 -11\n10 16\n2 -6\n-9 19\n-3 -1\n20 9\n-12 -5\n-10 -2\n16 -7\n-16 -18\n-2 17\n2 8\n7 -15\n4 1\n6 -17\n19 9\n-10 -20\n5 2\n10 -2\n3 7\n20 0\n8 -14\n-16 -1\n-20 7\n20 -19\n17 18\n-11 -18\n-16 14", "output": "6087.366930474" }, { "input": "57 373\n18 3\n-4 -1\n18 5\n-7 -15\n-6 -10\n-19 1\n20 15\n15 4\n-1 -2\n13 -14\n0 12\n10 3\n-16 -17\n-14 -9\n-11 -10\n17 19\n-2 6\n-12 -15\n10 20\n16 7\n9 -1\n4 13\n8 -2\n-1 -16\n-3 8\n14 11\n-12 3\n-5 -6\n3 4\n5 7\n-9 9\n11 4\n-19 10\n-7 4\n-20 -12\n10 16\n13 11\n13 -11\n7 -1\n17 18\n-19 7\n14 13\n5 -1\n-7 6\n-1 -6\n6 20\n-16 2\n4 17\n16 -11\n-4 -20\n19 -18\n17 16\n-14 -8\n3 2\n-6 -16\n10 -10\n-13 -11", "output": "8929.162822862" }, { "input": "60 662\n15 17\n-2 -19\n-4 -17\n10 0\n15 10\n-8 -14\n14 9\n-15 20\n6 5\n-9 0\n-13 20\n13 -2\n10 9\n7 5\n4 18\n-10 1\n6 -15\n15 -16\n6 13\n4 -6\n2 5\n18 19\n8 3\n-7 14\n-12 -20\n14 19\n-15 0\n-2 -12\n9 18\n14 4\n2 -20\n3 0\n20 9\n-5 11\n-11 1\n2 -19\n-14 -4\n18 6\n16 16\n15 3\n-1 -5\n9 20\n12 -8\n-1 10\n-4 -9\n3 6\n3 -12\n14 -10\n-8 10\n-18 6\n14 -2\n-14 -12\n-10 -7\n10 -6\n14 1\n6 14\n15 19\n4 14\n3 -14\n-9 -13", "output": "16314.207721932" }, { "input": "61 764\n-9 15\n11 -8\n-6 -7\n-13 -19\n16 -16\n-5 -1\n20 -19\n-14 -1\n-11 4\n7 -2\n-3 2\n-14 -17\n15 18\n20 15\n-13 -2\n15 8\n3 13\n19 -10\n2 -6\n15 -3\n-12 11\n4 -16\n-14 20\n0 2\n11 -7\n-6 -11\n16 7\n8 -3\n16 -10\n-3 9\n9 5\n4 -1\n-17 9\n14 -4\n8 6\n-19 12\n10 -17\n-5 7\n7 -3\n5 3\n6 -14\n9 9\n-16 -19\n11 -16\n-17 15\n8 5\n16 -19\n-7 10\n14 -15\n15 19\n-20 -16\n6 -2\n-4 6\n7 -15\n1 -8\n20 -17\n3 7\n10 12\n10 -11\n-19 10\n0 -11", "output": "22153.369189802" } ]	1,546,585,625	2,147,483,647	Python 3	OK	TESTS	42	218	0	from math import hypot n, k = map(int, input().split()) px, py = map(int, input().split()) ln = 0 for i in range(n-1): x, y = map(int, input().split()) ln += hypot(x - px, y - py) px = x py = y print(ln * k / 50)	Title: Wasted Time Time Limit: None seconds Memory Limit: None megabytes Problem Description: Mr. Scrooge, a very busy man, decided to count the time he wastes on all sorts of useless stuff to evaluate the lost profit. He has already counted the time he wastes sleeping and eating. And now Mr. Scrooge wants to count the time he has wasted signing papers. Mr. Scrooge's signature can be represented as a polyline A1A2... An. Scrooge signs like that: first it places a pen at the point A1, then draws a segment from point A1 to point A2, then he draws a segment from point A2 to point A3 and so on to point An, where he stops signing and takes the pen off the paper. At that the resulting line can intersect with itself and partially repeat itself but Scrooge pays no attention to it and never changes his signing style. As Scrooge makes the signature, he never takes the pen off the paper and his writing speed is constant — 50 millimeters per second. Scrooge signed exactly k papers throughout his life and all those signatures look the same. Find the total time Scrooge wasted signing the papers. Input Specification: The first line contains two integers n and k (2<=≤<=n<=≤<=100, 1<=≤<=k<=≤<=1000). Each of the following n lines contains the coordinates of the polyline's endpoints. The i-th one contains coordinates of the point Ai — integers xi and yi, separated by a space. All points Ai are different. The absolute value of all coordinates does not exceed 20. The coordinates are measured in millimeters. Output Specification: Print one real number — the total time Scrooges wastes on signing the papers in seconds. The absolute or relative error should not exceed 10<=-<=6. Demo Input: ['2 1\n0 0\n10 0\n', '5 10\n3 1\n-5 6\n-2 -1\n3 2\n10 0\n', '6 10\n5 0\n4 0\n6 0\n3 0\n7 0\n2 0\n'] Demo Output: ['0.200000000', '6.032163204', '3.000000000'] Note: none	```python from math import hypot n, k = map(int, input().split()) px, py = map(int, input().split()) ln = 0 for i in range(n-1): x, y = map(int, input().split()) ln += hypot(x - px, y - py) px = x py = y print(ln * k / 50) ```	3
281	A	Word Capitalization	PROGRAMMING	800	[ "implementation", "strings" ]		null	null	Capitalization is writing a word with its first letter as a capital letter. Your task is to capitalize the given word. Note, that during capitalization all the letters except the first one remains unchanged.	A single line contains a non-empty word. This word consists of lowercase and uppercase English letters. The length of the word will not exceed 103.	Output the given word after capitalization.	[ "ApPLe\n", "konjac\n" ]	[ "ApPLe\n", "Konjac\n" ]	none	500	[ { "input": "ApPLe", "output": "ApPLe" }, { "input": "konjac", "output": "Konjac" }, { "input": "a", "output": "A" }, { "input": "A", "output": "A" }, { "input": "z", "output": "Z" }, { "input": "ABACABA", "output": "ABACABA" }, { "input": "xYaPxPxHxGePfGtQySlNrLxSjDtNnTaRaEpAhPaQpWnDzMqGgRgEwJxGiBdZnMtHxFbObCaGiCeZkUqIgBhHtNvAqAlHpMnQhNeQbMyZrCdElVwHtKrPpJjIaHuIlYwHaRkAkUpPlOhNlBtXwDsKzPyHrPiUwNlXtTaPuMwTqYtJySgFoXvLiHbQwMjSvXsQfKhVlOxGdQkWjBhEyQvBjPoFkThNeRhTuIzFjInJtEfPjOlOsJpJuLgLzFnZmKvFgFrNsOnVqFcNiMfCqTpKnVyLwNqFiTySpWeTdFnWuTwDkRjVxNyQvTrOoEiExYiFaIrLoFmJfZcDkHuWjYfCeEqCvEsZiWnJaEmFbMjDvYwEeJeGcKbVbChGsIzNlExHzHiTlHcSaKxLuZxX", "output": "XYaPxPxHxGePfGtQySlNrLxSjDtNnTaRaEpAhPaQpWnDzMqGgRgEwJxGiBdZnMtHxFbObCaGiCeZkUqIgBhHtNvAqAlHpMnQhNeQbMyZrCdElVwHtKrPpJjIaHuIlYwHaRkAkUpPlOhNlBtXwDsKzPyHrPiUwNlXtTaPuMwTqYtJySgFoXvLiHbQwMjSvXsQfKhVlOxGdQkWjBhEyQvBjPoFkThNeRhTuIzFjInJtEfPjOlOsJpJuLgLzFnZmKvFgFrNsOnVqFcNiMfCqTpKnVyLwNqFiTySpWeTdFnWuTwDkRjVxNyQvTrOoEiExYiFaIrLoFmJfZcDkHuWjYfCeEqCvEsZiWnJaEmFbMjDvYwEeJeGcKbVbChGsIzNlExHzHiTlHcSaKxLuZxX" }, { "input": "rZhIcQlXpNcPgXrOjTiOlMoTgXgIhCfMwZfWoFzGhEkQlOoMjIuShPlZfWkNnMyQfYdUhVgQuSmYoElEtZpDyHtOxXgCpWbZqSbYnPqBcNqRtPgCnJnAyIvNsAhRbNeVlMwZyRyJnFgIsCnSbOdLvUyIeOzQvRpMoMoHfNhHwKvTcHuYnYySfPmAiNwAiWdZnWlLvGfBbRbRrCrBqIgIdWkWiBsNyYkKdNxZdGaToSsDnXpRaGrKxBpQsCzBdQgZzBkGeHgGxNrIyQlSzWsTmSnZwOcHqQpNcQvJlPvKaPiQaMaYsQjUeCqQdCjPgUbDmWiJmNiXgExLqOcCtSwSePnUxIuZfIfBeWbEiVbXnUsPwWyAiXyRbZgKwOqFfCtQuKxEmVeRlAkOeXkO", "output": "RZhIcQlXpNcPgXrOjTiOlMoTgXgIhCfMwZfWoFzGhEkQlOoMjIuShPlZfWkNnMyQfYdUhVgQuSmYoElEtZpDyHtOxXgCpWbZqSbYnPqBcNqRtPgCnJnAyIvNsAhRbNeVlMwZyRyJnFgIsCnSbOdLvUyIeOzQvRpMoMoHfNhHwKvTcHuYnYySfPmAiNwAiWdZnWlLvGfBbRbRrCrBqIgIdWkWiBsNyYkKdNxZdGaToSsDnXpRaGrKxBpQsCzBdQgZzBkGeHgGxNrIyQlSzWsTmSnZwOcHqQpNcQvJlPvKaPiQaMaYsQjUeCqQdCjPgUbDmWiJmNiXgExLqOcCtSwSePnUxIuZfIfBeWbEiVbXnUsPwWyAiXyRbZgKwOqFfCtQuKxEmVeRlAkOeXkO" }, { "input": "hDgZlUmLhYbLkLcNcKeOwJwTePbOvLaRvNzQbSbLsPeHqLhUqWtUbNdQfQqFfXeJqJwWuOrFnDdZiPxIkDyVmHbHvXfIlFqSgAcSyWbOlSlRuPhWdEpEzEeLnXwCtWuVcHaUeRgCiYsIvOaIgDnFuDbRnMoCmPrZfLeFpSjQaTfHgZwZvAzDuSeNwSoWuJvLqKqAuUxFaCxFfRcEjEsJpOfCtDiVrBqNsNwPuGoRgPzRpLpYnNyQxKaNnDnYiJrCrVcHlOxPiPcDbEgKfLwBjLhKcNeMgJhJmOiJvPfOaPaEuGqWvRbErKrIpDkEoQnKwJnTlStLyNsHyOjZfKoIjXwUvRrWpSyYhRpQdLqGmErAiNcGqAqIrTeTiMuPmCrEkHdBrLyCxPtYpRqD", "output": "HDgZlUmLhYbLkLcNcKeOwJwTePbOvLaRvNzQbSbLsPeHqLhUqWtUbNdQfQqFfXeJqJwWuOrFnDdZiPxIkDyVmHbHvXfIlFqSgAcSyWbOlSlRuPhWdEpEzEeLnXwCtWuVcHaUeRgCiYsIvOaIgDnFuDbRnMoCmPrZfLeFpSjQaTfHgZwZvAzDuSeNwSoWuJvLqKqAuUxFaCxFfRcEjEsJpOfCtDiVrBqNsNwPuGoRgPzRpLpYnNyQxKaNnDnYiJrCrVcHlOxPiPcDbEgKfLwBjLhKcNeMgJhJmOiJvPfOaPaEuGqWvRbErKrIpDkEoQnKwJnTlStLyNsHyOjZfKoIjXwUvRrWpSyYhRpQdLqGmErAiNcGqAqIrTeTiMuPmCrEkHdBrLyCxPtYpRqD" }, { "input": "qUdLgGrJeGmIzIeZrCjUtBpYfRvNdXdRpGsThIsEmJjTiMqEwRxBeBaSxEuWrNvExKePjPnXhPzBpWnHiDhTvZhBuIjDnZpTcEkCvRkAcTmMuXhGgErWgFyGyToOyVwYlCuQpTfJkVdWmFyBqQhJjYtXrBbFdHzDlGsFbHmHbFgXgFhIyDhZyEqEiEwNxSeByBwLiVeSnCxIdHbGjOjJrZeVkOzGeMmQrJkVyGhDtCzOlPeAzGrBlWwEnAdUfVaIjNrRyJjCnHkUvFuKuKeKbLzSbEmUcXtVkZzXzKlOrPgQiDmCcCvIyAdBwOeUuLbRmScNcWxIkOkJuIsBxTrIqXhDzLcYdVtPgZdZfAxTmUtByGiTsJkSySjXdJvEwNmSmNoWsChPdAzJrBoW", "output": "QUdLgGrJeGmIzIeZrCjUtBpYfRvNdXdRpGsThIsEmJjTiMqEwRxBeBaSxEuWrNvExKePjPnXhPzBpWnHiDhTvZhBuIjDnZpTcEkCvRkAcTmMuXhGgErWgFyGyToOyVwYlCuQpTfJkVdWmFyBqQhJjYtXrBbFdHzDlGsFbHmHbFgXgFhIyDhZyEqEiEwNxSeByBwLiVeSnCxIdHbGjOjJrZeVkOzGeMmQrJkVyGhDtCzOlPeAzGrBlWwEnAdUfVaIjNrRyJjCnHkUvFuKuKeKbLzSbEmUcXtVkZzXzKlOrPgQiDmCcCvIyAdBwOeUuLbRmScNcWxIkOkJuIsBxTrIqXhDzLcYdVtPgZdZfAxTmUtByGiTsJkSySjXdJvEwNmSmNoWsChPdAzJrBoW" }, { "input": "kHbApGoBcLmIwUlXkVgUmWzYeLoDbGaOkWbIuXoRwMfKuOoMzAoXrBoTvYxGrMbRjDuRxAbGsTnErIiHnHoLeRnTbFiRfDdOkNlWiAcOsChLdLqFqXlDpDoDtPxXqAmSvYgPvOcCpOlWtOjYwFkGkHuCaHwZcFdOfHjBmIxTeSiHkWjXyFcCtOlSuJsZkDxUgPeZkJwMmNpErUlBcGuMlJwKkWnOzFeFiSiPsEvMmQiCsYeHlLuHoMgBjFoZkXlObDkSoQcVyReTmRsFzRhTuIvCeBqVsQdQyTyZjStGrTyDcEcAgTgMiIcVkLbZbGvWeHtXwEqWkXfTcPyHhHjYwIeVxLyVmHmMkUsGiHmNnQuMsXaFyPpVqNrBhOiWmNkBbQuHvQdOjPjKiZcL", "output": "KHbApGoBcLmIwUlXkVgUmWzYeLoDbGaOkWbIuXoRwMfKuOoMzAoXrBoTvYxGrMbRjDuRxAbGsTnErIiHnHoLeRnTbFiRfDdOkNlWiAcOsChLdLqFqXlDpDoDtPxXqAmSvYgPvOcCpOlWtOjYwFkGkHuCaHwZcFdOfHjBmIxTeSiHkWjXyFcCtOlSuJsZkDxUgPeZkJwMmNpErUlBcGuMlJwKkWnOzFeFiSiPsEvMmQiCsYeHlLuHoMgBjFoZkXlObDkSoQcVyReTmRsFzRhTuIvCeBqVsQdQyTyZjStGrTyDcEcAgTgMiIcVkLbZbGvWeHtXwEqWkXfTcPyHhHjYwIeVxLyVmHmMkUsGiHmNnQuMsXaFyPpVqNrBhOiWmNkBbQuHvQdOjPjKiZcL" }, { "input": "aHmRbLgNuWkLxLnWvUbYwTeZeYiOlLhTuOvKfLnVmCiPcMkSgVrYjZiLuRjCiXhAnVzVcTlVeJdBvPdDfFvHkTuIhCdBjEsXbVmGcLrPfNvRdFsZkSdNpYsJeIhIcNqSoLkOjUlYlDmXsOxPbQtIoUxFjGnRtBhFaJvBeEzHsAtVoQbAfYjJqReBiKeUwRqYrUjPjBoHkOkPzDwEwUgTxQxAvKzUpMhKyOhPmEhYhItQwPeKsKaKlUhGuMcTtSwFtXfJsDsFlTtOjVvVfGtBtFlQyIcBaMsPaJlPqUcUvLmReZiFbXxVtRhTzJkLkAjVqTyVuFeKlTyQgUzMsXjOxQnVfTaWmThEnEoIhZeZdStBkKeLpAhJnFoJvQyGwDiStLjEwGfZwBuWsEfC", "output": "AHmRbLgNuWkLxLnWvUbYwTeZeYiOlLhTuOvKfLnVmCiPcMkSgVrYjZiLuRjCiXhAnVzVcTlVeJdBvPdDfFvHkTuIhCdBjEsXbVmGcLrPfNvRdFsZkSdNpYsJeIhIcNqSoLkOjUlYlDmXsOxPbQtIoUxFjGnRtBhFaJvBeEzHsAtVoQbAfYjJqReBiKeUwRqYrUjPjBoHkOkPzDwEwUgTxQxAvKzUpMhKyOhPmEhYhItQwPeKsKaKlUhGuMcTtSwFtXfJsDsFlTtOjVvVfGtBtFlQyIcBaMsPaJlPqUcUvLmReZiFbXxVtRhTzJkLkAjVqTyVuFeKlTyQgUzMsXjOxQnVfTaWmThEnEoIhZeZdStBkKeLpAhJnFoJvQyGwDiStLjEwGfZwBuWsEfC" }, { "input": "sLlZkDiDmEdNaXuUuJwHqYvRtOdGfTiTpEpAoSqAbJaChOiCvHgSwZwEuPkMmXiLcKdXqSsEyViEbZpZsHeZpTuXoGcRmOiQfBfApPjDqSqElWeSeOhUyWjLyNoRuYeGfGwNqUsQoTyVvWeNgNdZfDxGwGfLsDjIdInSqDlMuNvFaHbScZkTlVwNcJpEjMaPaOtFgJjBjOcLlLmDnQrShIrJhOcUmPnZhTxNeClQsZaEaVaReLyQpLwEqJpUwYhLiRzCzKfOoFeTiXzPiNbOsZaZaLgCiNnMkBcFwGgAwPeNyTxJcCtBgXcToKlWaWcBaIvBpNxPeClQlWeQqRyEtAkJdBtSrFdDvAbUlKyLdCuTtXxFvRcKnYnWzVdYqDeCmOqPxUaFjQdTdCtN", "output": "SLlZkDiDmEdNaXuUuJwHqYvRtOdGfTiTpEpAoSqAbJaChOiCvHgSwZwEuPkMmXiLcKdXqSsEyViEbZpZsHeZpTuXoGcRmOiQfBfApPjDqSqElWeSeOhUyWjLyNoRuYeGfGwNqUsQoTyVvWeNgNdZfDxGwGfLsDjIdInSqDlMuNvFaHbScZkTlVwNcJpEjMaPaOtFgJjBjOcLlLmDnQrShIrJhOcUmPnZhTxNeClQsZaEaVaReLyQpLwEqJpUwYhLiRzCzKfOoFeTiXzPiNbOsZaZaLgCiNnMkBcFwGgAwPeNyTxJcCtBgXcToKlWaWcBaIvBpNxPeClQlWeQqRyEtAkJdBtSrFdDvAbUlKyLdCuTtXxFvRcKnYnWzVdYqDeCmOqPxUaFjQdTdCtN" }, { "input": "iRuStKvVhJdJbQwRoIuLiVdTpKaOqKfYlYwAzIpPtUwUtMeKyCaOlXmVrKwWeImYmVuXdLkRlHwFxKqZbZtTzNgOzDbGqTfZnKmUzAcIjDcEmQgYyFbEfWzRpKvCkDmAqDiIiRcLvMxWaJqCgYqXgIcLdNaZlBnXtJyKaMnEaWfXfXwTbDnAiYnWqKbAtDpYdUbZrCzWgRnHzYxFgCdDbOkAgTqBuLqMeStHcDxGnVhSgMzVeTaZoTfLjMxQfRuPcFqVlRyYdHyOdJsDoCeWrUuJyIiAqHwHyVpEeEoMaJwAoUfPtBeJqGhMaHiBjKwAlXoZpUsDhHgMxBkVbLcEvNtJbGnPsUwAvXrAkTlXwYvEnOpNeWyIkRnEnTrIyAcLkRgMyYcKrGiDaAyE", "output": "IRuStKvVhJdJbQwRoIuLiVdTpKaOqKfYlYwAzIpPtUwUtMeKyCaOlXmVrKwWeImYmVuXdLkRlHwFxKqZbZtTzNgOzDbGqTfZnKmUzAcIjDcEmQgYyFbEfWzRpKvCkDmAqDiIiRcLvMxWaJqCgYqXgIcLdNaZlBnXtJyKaMnEaWfXfXwTbDnAiYnWqKbAtDpYdUbZrCzWgRnHzYxFgCdDbOkAgTqBuLqMeStHcDxGnVhSgMzVeTaZoTfLjMxQfRuPcFqVlRyYdHyOdJsDoCeWrUuJyIiAqHwHyVpEeEoMaJwAoUfPtBeJqGhMaHiBjKwAlXoZpUsDhHgMxBkVbLcEvNtJbGnPsUwAvXrAkTlXwYvEnOpNeWyIkRnEnTrIyAcLkRgMyYcKrGiDaAyE" }, { "input": "cRtJkOxHzUbJcDdHzJtLbVmSoWuHoTkVrPqQaVmXeBrHxJbQfNrQbAaMrEhVdQnPxNyCjErKxPoEdWkVrBbDeNmEgBxYiBtWdAfHiLuSwIxJuHpSkAxPoYdNkGoLySsNhUmGoZhDzAfWhJdPlJzQkZbOnMtTkClIoCqOlIcJcMlGjUyOiEmHdYfIcPtTgQhLlLcPqQjAnQnUzHpCaQsCnYgQsBcJrQwBnWsIwFfSfGuYgTzQmShFpKqEeRlRkVfMuZbUsDoFoPrNuNwTtJqFkRiXxPvKyElDzLoUnIwAaBaOiNxMpEvPzSpGpFhMtGhGdJrFnZmNiMcUfMtBnDuUnXqDcMsNyGoLwLeNnLfRsIwRfBtXkHrFcPsLdXaAoYaDzYnZuQeVcZrElWmP", "output": "CRtJkOxHzUbJcDdHzJtLbVmSoWuHoTkVrPqQaVmXeBrHxJbQfNrQbAaMrEhVdQnPxNyCjErKxPoEdWkVrBbDeNmEgBxYiBtWdAfHiLuSwIxJuHpSkAxPoYdNkGoLySsNhUmGoZhDzAfWhJdPlJzQkZbOnMtTkClIoCqOlIcJcMlGjUyOiEmHdYfIcPtTgQhLlLcPqQjAnQnUzHpCaQsCnYgQsBcJrQwBnWsIwFfSfGuYgTzQmShFpKqEeRlRkVfMuZbUsDoFoPrNuNwTtJqFkRiXxPvKyElDzLoUnIwAaBaOiNxMpEvPzSpGpFhMtGhGdJrFnZmNiMcUfMtBnDuUnXqDcMsNyGoLwLeNnLfRsIwRfBtXkHrFcPsLdXaAoYaDzYnZuQeVcZrElWmP" }, { "input": "wVaCsGxZrBbFnTbKsCoYlAvUkIpBaYpYmJkMlPwCaFvUkDxAiJgIqWsFqZlFvTtAnGzEwXbYiBdFfFxRiDoUkLmRfAwOlKeOlKgXdUnVqLkTuXtNdQpBpXtLvZxWoBeNePyHcWmZyRiUkPlRqYiQdGeXwOhHbCqVjDcEvJmBkRwWnMqPjXpUsIyXqGjHsEsDwZiFpIbTkQaUlUeFxMwJzSaHdHnDhLaLdTuYgFuJsEcMmDvXyPjKsSeBaRwNtPuOuBtNeOhQdVgKzPzOdYtPjPfDzQzHoWcYjFbSvRgGdGsCmGnQsErToBkCwGeQaCbBpYkLhHxTbUvRnJpZtXjKrHdRiUmUbSlJyGaLnWsCrJbBnSjFaZrIzIrThCmGhQcMsTtOxCuUcRaEyPaG", "output": "WVaCsGxZrBbFnTbKsCoYlAvUkIpBaYpYmJkMlPwCaFvUkDxAiJgIqWsFqZlFvTtAnGzEwXbYiBdFfFxRiDoUkLmRfAwOlKeOlKgXdUnVqLkTuXtNdQpBpXtLvZxWoBeNePyHcWmZyRiUkPlRqYiQdGeXwOhHbCqVjDcEvJmBkRwWnMqPjXpUsIyXqGjHsEsDwZiFpIbTkQaUlUeFxMwJzSaHdHnDhLaLdTuYgFuJsEcMmDvXyPjKsSeBaRwNtPuOuBtNeOhQdVgKzPzOdYtPjPfDzQzHoWcYjFbSvRgGdGsCmGnQsErToBkCwGeQaCbBpYkLhHxTbUvRnJpZtXjKrHdRiUmUbSlJyGaLnWsCrJbBnSjFaZrIzIrThCmGhQcMsTtOxCuUcRaEyPaG" }, { "input": "kEiLxLmPjGzNoGkJdBlAfXhThYhMsHmZoZbGyCvNiUoLoZdAxUbGyQiEfXvPzZzJrPbEcMpHsMjIkRrVvDvQtHuKmXvGpQtXbPzJpFjJdUgWcPdFxLjLtXgVpEiFhImHnKkGiWnZbJqRjCyEwHsNbYfYfTyBaEuKlCtWnOqHmIgGrFmQiYrBnLiFcGuZxXlMfEuVoCxPkVrQvZoIpEhKsYtXrPxLcSfQqXsWaDgVlOnAzUvAhOhMrJfGtWcOwQfRjPmGhDyAeXrNqBvEiDfCiIvWxPjTwPlXpVsMjVjUnCkXgBuWnZaDyJpWkCfBrWnHxMhJgItHdRqNrQaEeRjAuUwRkUdRhEeGlSqVqGmOjNcUhFfXjCmWzBrGvIuZpRyWkWiLyUwFpYjNmNfV", "output": "KEiLxLmPjGzNoGkJdBlAfXhThYhMsHmZoZbGyCvNiUoLoZdAxUbGyQiEfXvPzZzJrPbEcMpHsMjIkRrVvDvQtHuKmXvGpQtXbPzJpFjJdUgWcPdFxLjLtXgVpEiFhImHnKkGiWnZbJqRjCyEwHsNbYfYfTyBaEuKlCtWnOqHmIgGrFmQiYrBnLiFcGuZxXlMfEuVoCxPkVrQvZoIpEhKsYtXrPxLcSfQqXsWaDgVlOnAzUvAhOhMrJfGtWcOwQfRjPmGhDyAeXrNqBvEiDfCiIvWxPjTwPlXpVsMjVjUnCkXgBuWnZaDyJpWkCfBrWnHxMhJgItHdRqNrQaEeRjAuUwRkUdRhEeGlSqVqGmOjNcUhFfXjCmWzBrGvIuZpRyWkWiLyUwFpYjNmNfV" }, { "input": "eIhDoLmDeReKqXsHcVgFxUqNfScAiQnFrTlCgSuTtXiYvBxKaPaGvUeYfSgHqEaWcHxKpFaSlCxGqAmNeFcIzFcZsBiVoZhUjXaDaIcKoBzYdIlEnKfScRqSkYpPtVsVhXsBwUsUfAqRoCkBxWbHgDiCkRtPvUwVgDjOzObYwNiQwXlGnAqEkHdSqLgUkOdZiWaHqQnOhUnDhIzCiQtVcJlGoRfLuVlFjWqSuMsLgLwOdZvKtWdRuRqDoBoInKqPbJdXpIqLtFlMlDaWgSiKbFpCxOnQeNeQzXeKsBzIjCyPxCmBnYuHzQoYxZgGzSgGtZiTeQmUeWlNzZeKiJbQmEjIiDhPeSyZlNdHpZnIkPdJzSeJpPiXxToKyBjJfPwNzZpWzIzGySqPxLtI", "output": "EIhDoLmDeReKqXsHcVgFxUqNfScAiQnFrTlCgSuTtXiYvBxKaPaGvUeYfSgHqEaWcHxKpFaSlCxGqAmNeFcIzFcZsBiVoZhUjXaDaIcKoBzYdIlEnKfScRqSkYpPtVsVhXsBwUsUfAqRoCkBxWbHgDiCkRtPvUwVgDjOzObYwNiQwXlGnAqEkHdSqLgUkOdZiWaHqQnOhUnDhIzCiQtVcJlGoRfLuVlFjWqSuMsLgLwOdZvKtWdRuRqDoBoInKqPbJdXpIqLtFlMlDaWgSiKbFpCxOnQeNeQzXeKsBzIjCyPxCmBnYuHzQoYxZgGzSgGtZiTeQmUeWlNzZeKiJbQmEjIiDhPeSyZlNdHpZnIkPdJzSeJpPiXxToKyBjJfPwNzZpWzIzGySqPxLtI" }, { "input": "uOoQzIeTwYeKpJtGoUdNiXbPgEwVsZkAnJcArHxIpEnEhZwQhZvAiOuLeMkVqLeDsAyKeYgFxGmRoLaRsZjAeXgNfYhBkHeDrHdPuTuYhKmDlAvYzYxCdYgYfVaYlGeVqTeSfBxQePbQrKsTaIkGzMjFrQlJuYaMxWpQkLdEcDsIiMnHnDtThRvAcKyGwBsHqKdXpJfIeTeZtYjFbMeUoXoXzGrShTwSwBpQlKeDrZdCjRqNtXoTsIzBkWbMsObTtDvYaPhUeLeHqHeMpZmTaCcIqXzAmGnPfNdDaFhOqWqDrWuFiBpRjZrQmAdViOuMbFfRyXyWfHgRkGpPnDrEqQcEmHcKpEvWlBrOtJbUaXbThJaSxCbVoGvTmHvZrHvXpCvLaYbRiHzYuQyX", "output": "UOoQzIeTwYeKpJtGoUdNiXbPgEwVsZkAnJcArHxIpEnEhZwQhZvAiOuLeMkVqLeDsAyKeYgFxGmRoLaRsZjAeXgNfYhBkHeDrHdPuTuYhKmDlAvYzYxCdYgYfVaYlGeVqTeSfBxQePbQrKsTaIkGzMjFrQlJuYaMxWpQkLdEcDsIiMnHnDtThRvAcKyGwBsHqKdXpJfIeTeZtYjFbMeUoXoXzGrShTwSwBpQlKeDrZdCjRqNtXoTsIzBkWbMsObTtDvYaPhUeLeHqHeMpZmTaCcIqXzAmGnPfNdDaFhOqWqDrWuFiBpRjZrQmAdViOuMbFfRyXyWfHgRkGpPnDrEqQcEmHcKpEvWlBrOtJbUaXbThJaSxCbVoGvTmHvZrHvXpCvLaYbRiHzYuQyX" }, { "input": "lZqBqKeGvNdSeYuWxRiVnFtYbKuJwQtUcKnVtQhAlOeUzMaAuTaEnDdPfDcNyHgEoBmYjZyFePeJrRiKyAzFnBfAuGiUyLrIeLrNhBeBdVcEeKgCcBrQzDsPwGcNnZvTsEaYmFfMeOmMdNuZbUtDoQoNcGwDqEkEjIdQaPwAxJbXeNxOgKgXoEbZiIsVkRrNpNyAkLeHkNfEpLuQvEcMbIoGaDzXbEtNsLgGfOkZaFiUsOvEjVeCaMcZqMzKeAdXxJsVeCrZaFpJtZxInQxFaSmGgSsVyGeLlFgFqTpIbAvPkIfJrVcJeBxSdEvPyVwIjHpYrLrKqLnAmCuGmPoZrSbOtGaLaTmBmSuUyAmAsRiMqOtRjJhPhAfXaJnTpLbFqPmJgFcBxImTqIiJ", "output": "LZqBqKeGvNdSeYuWxRiVnFtYbKuJwQtUcKnVtQhAlOeUzMaAuTaEnDdPfDcNyHgEoBmYjZyFePeJrRiKyAzFnBfAuGiUyLrIeLrNhBeBdVcEeKgCcBrQzDsPwGcNnZvTsEaYmFfMeOmMdNuZbUtDoQoNcGwDqEkEjIdQaPwAxJbXeNxOgKgXoEbZiIsVkRrNpNyAkLeHkNfEpLuQvEcMbIoGaDzXbEtNsLgGfOkZaFiUsOvEjVeCaMcZqMzKeAdXxJsVeCrZaFpJtZxInQxFaSmGgSsVyGeLlFgFqTpIbAvPkIfJrVcJeBxSdEvPyVwIjHpYrLrKqLnAmCuGmPoZrSbOtGaLaTmBmSuUyAmAsRiMqOtRjJhPhAfXaJnTpLbFqPmJgFcBxImTqIiJ" }, { "input": "P", "output": "P" }, { "input": "Xyzzy", "output": "Xyzzy" }, { "input": "Zzz", "output": "Zzz" }, { "input": "Zp", "output": "Zp" } ]	1,696,260,375	2,147,483,647	Python 3	OK	TESTS	25	92	0	words = list(input()) words[0] = words[0].capitalize() for word in words: print(word,end="")	Title: Word Capitalization Time Limit: None seconds Memory Limit: None megabytes Problem Description: Capitalization is writing a word with its first letter as a capital letter. Your task is to capitalize the given word. Note, that during capitalization all the letters except the first one remains unchanged. Input Specification: A single line contains a non-empty word. This word consists of lowercase and uppercase English letters. The length of the word will not exceed 103. Output Specification: Output the given word after capitalization. Demo Input: ['ApPLe\n', 'konjac\n'] Demo Output: ['ApPLe\n', 'Konjac\n'] Note: none	```python words = list(input()) words[0] = words[0].capitalize() for word in words: print(word,end="") ```	3
706	B	Interesting drink	PROGRAMMING	1,100	[ "binary search", "dp", "implementation" ]		null	null	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 xi coins. Vasiliy plans to buy his favorite drink for q consecutive days. He knows, that on the i-th day he will be able to spent mi coins. Now, for each of the days he want to know in how many different shops he can buy a bottle of "Beecola".	The first line of the input contains a single integer n (1<=≤<=n<=≤<=100<=000) — the number of shops in the city that sell Vasiliy's favourite drink. The second line contains n integers xi (1<=≤<=xi<=≤<=100<=000) — prices of the bottles of the drink in the i-th shop. The third line contains a single integer q (1<=≤<=q<=≤<=100<=000) — the number of days Vasiliy plans to buy the drink. Then follow q lines each containing one integer mi (1<=≤<=mi<=≤<=109) — the number of coins Vasiliy can spent on the i-th day.	Print q integers. The i-th of them should be equal to the number of shops where Vasiliy will be able to buy a bottle of the drink on the i-th day.	[ "5\n3 10 8 6 11\n4\n1\n10\n3\n11\n" ]	[ "0\n4\n1\n5\n" ]	On the first day, Vasiliy won't be able to buy a drink in any of the shops. On the second day, Vasiliy can buy a drink in the shops 1, 2, 3 and 4. On the third day, Vasiliy can buy a drink only in the shop number 1. Finally, on the last day Vasiliy can buy a drink in any shop.	1,000	[ { "input": "5\n3 10 8 6 11\n4\n1\n10\n3\n11", "output": "0\n4\n1\n5" }, { "input": "5\n868 987 714 168 123\n10\n424\n192\n795\n873\n117\n914\n735\n158\n631\n471", "output": "2\n2\n3\n4\n0\n4\n3\n1\n2\n2" }, { "input": "3\n435 482 309\n7\n245\n241\n909\n745\n980\n29\n521", "output": "0\n0\n3\n3\n3\n0\n3" }, { "input": "1\n653\n9\n903\n980\n80\n770\n965\n874\n381\n657\n969", "output": "1\n1\n0\n1\n1\n1\n0\n1\n1" }, { "input": "12\n35345 58181 32223 84621 35905 73863 99537 30666 67771 39229 36847 29038\n23\n55052824\n82504840\n35160556\n78141700\n73401989\n86305919\n39430705\n31939373\n23501765\n4406029\n61436920\n14295390\n34275309\n28028753\n85724689\n70158847\n2396455\n66994588\n84024224\n30175981\n65622319\n76517111\n76605341", "output": "12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12" }, { "input": "4\n698 193 1584 76192\n4\n553640\n310518\n274280\n429192", "output": "4\n4\n4\n4" }, { "input": "1\n1\n1\n1000000000", "output": "1" }, { "input": "1\n1\n1\n100005", "output": "1" }, { "input": "3\n1 2 3\n1\n100005", "output": "3" }, { "input": "2\n1 2\n3\n100004\n100005\n100006", "output": "2\n2\n2" }, { "input": "3\n1 1 1\n1\n1", "output": "3" }, { "input": "1\n1\n1\n1", "output": "1" }, { "input": "3\n1 2 3\n1\n100000", "output": "3" }, { "input": "5\n1 1 1 1 10\n2\n1\n10", "output": "4\n5" }, { "input": "5\n3 10 8 6 11\n1\n10000000", "output": "5" } ]	1,699,347,059	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	30	0	n = int(input()) prices = [int(i) for i in input().split()] prices.sort() q = int(input()) for _ in range(q): coins = int(input()) #two-divide search list = prices*1 se = coins index = 0 while True: b = int(len(list) / 2) a = list[b] if se >= a: index += b list = list[b:] else: list = list[0:b] if len(list) == 1: break print(index + 1)	Title: Interesting drink Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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 xi coins. Vasiliy plans to buy his favorite drink for q consecutive days. He knows, that on the i-th day he will be able to spent mi coins. Now, for each of the days he want to know in how many different shops he can buy a bottle of "Beecola". Input Specification: The first line of the input contains a single integer n (1<=≤<=n<=≤<=100<=000) — the number of shops in the city that sell Vasiliy's favourite drink. The second line contains n integers xi (1<=≤<=xi<=≤<=100<=000) — prices of the bottles of the drink in the i-th shop. The third line contains a single integer q (1<=≤<=q<=≤<=100<=000) — the number of days Vasiliy plans to buy the drink. Then follow q lines each containing one integer mi (1<=≤<=mi<=≤<=109) — the number of coins Vasiliy can spent on the i-th day. Output Specification: Print q integers. The i-th of them should be equal to the number of shops where Vasiliy will be able to buy a bottle of the drink on the i-th day. Demo Input: ['5\n3 10 8 6 11\n4\n1\n10\n3\n11\n'] Demo Output: ['0\n4\n1\n5\n'] Note: On the first day, Vasiliy won't be able to buy a drink in any of the shops. On the second day, Vasiliy can buy a drink in the shops 1, 2, 3 and 4. On the third day, Vasiliy can buy a drink only in the shop number 1. Finally, on the last day Vasiliy can buy a drink in any shop.	```python n = int(input()) prices = [int(i) for i in input().split()] prices.sort() q = int(input()) for _ in range(q): coins = int(input()) #two-divide search list = prices*1 se = coins index = 0 while True: b = int(len(list) / 2) a = list[b] if se >= a: index += b list = list[b:] else: list = list[0:b] if len(list) == 1: break print(index + 1) ```	0
600	B	Queries about less or equal elements	PROGRAMMING	1,300	[ "binary search", "data structures", "sortings", "two pointers" ]		null	null	You are given two arrays of integers a and b. For each element of the second array bj you should find the number of elements in array a that are less than or equal to the value bj.	The first line contains two integers n,<=m (1<=≤<=n,<=m<=≤<=2·105) — the sizes of arrays a and b. The second line contains n integers — the elements of array a (<=-<=109<=≤<=ai<=≤<=109). The third line contains m integers — the elements of array b (<=-<=109<=≤<=bj<=≤<=109).	Print m integers, separated by spaces: the j-th of which is equal to the number of such elements in array a that are less than or equal to the value bj.	[ "5 4\n1 3 5 7 9\n6 4 2 8\n", "5 5\n1 2 1 2 5\n3 1 4 1 5\n" ]	[ "3 2 1 4\n", "4 2 4 2 5\n" ]	none	0	[ { "input": "5 4\n1 3 5 7 9\n6 4 2 8", "output": "3 2 1 4" }, { "input": "5 5\n1 2 1 2 5\n3 1 4 1 5", "output": "4 2 4 2 5" }, { "input": "1 1\n-1\n-2", "output": "0" }, { "input": "1 1\n-80890826\n686519510", "output": "1" }, { "input": "11 11\n237468511 -779187544 -174606592 193890085 404563196 -71722998 -617934776 170102710 -442808289 109833389 953091341\n994454001 322957429 216874735 -606986750 -455806318 -663190696 3793295 41395397 -929612742 -787653860 -684738874", "output": "11 9 8 2 2 1 5 5 0 0 1" }, { "input": "20 22\n858276994 -568758442 -918490847 -983345984 -172435358 389604931 200224783 486556113 413281867 -258259500 -627945379 -584563643 444685477 -602481243 -370745158 965672503 630955806 -626138773 -997221880 633102929\n-61330638 -977252080 -212144219 385501731 669589742 954357160 563935906 584468977 -895883477 405774444 853372186 186056475 -964575261 -952431965 632332084 -388829939 -23011650 310957048 -770695392 977376693 321435214 199223897", "output": "11 2 10 12 18 19 16 16 3 13 18 11 2 2 17 8 11 12 3 20 12 11" }, { "input": "5 9\n1 3 5 7 9\n1 2 3 4 5 6 7 8 9", "output": "1 1 2 2 3 3 4 4 5" }, { "input": "22 1\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22\n1", "output": "1" }, { "input": "5 1\n1 3 3 3 5\n3", "output": "4" }, { "input": "4 5\n1 1 1 4\n1 5 5 4 3", "output": "3 4 4 4 3" }, { "input": "5 4\n0 5 5 5 6\n5 1 6 3", "output": "4 1 5 1" }, { "input": "1 3\n0\n-1 0 1", "output": "0 1 1" }, { "input": "96 1\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n1", "output": "96" }, { "input": "7 1\n1 2 3 4 5 6 7\n1", "output": "1" }, { "input": "13 13\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 1000000000 -1000000000 1000000000 -1000000000 1000000000 -1000000000 1000000000 -1000000000\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 1000000000 -1000000000 1000000000 -1000000000 1000000000 -1000000000 1000000000 -1000000000", "output": "7 13 7 13 7 13 7 13 7 13 7 13 7" }, { "input": "9 5\n1 2 3 4 5 6 7 8 9\n1 2 3 4 5", "output": "1 2 3 4 5" }, { "input": "3 8\n1 1 1\n1 1 1 1 1 1 1 1", "output": "3 3 3 3 3 3 3 3" }, { "input": "1 1\n-11111\n-5938", "output": "1" }, { "input": "1 1\n1\n400000009", "output": "1" }, { "input": "1 1\n1\n300000009", "output": "1" }, { "input": "1 1\n1\n200000009", "output": "1" }, { "input": "1 1\n1\n200000003", "output": "1" } ]	1,628,093,777	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	62	6,963,200	a, b=map(int,input(). split()) a=list(map(int, input(). split())) b=list(map(int, input(). split())) for i in range(len(a)): c=0 for j in range(i+1,len(b)): if a[i]<=b[j]: c=c+1 print(c, end=' ')	Title: Queries about less or equal elements Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given two arrays of integers a and b. For each element of the second array bj you should find the number of elements in array a that are less than or equal to the value bj. Input Specification: The first line contains two integers n,<=m (1<=≤<=n,<=m<=≤<=2·105) — the sizes of arrays a and b. The second line contains n integers — the elements of array a (<=-<=109<=≤<=ai<=≤<=109). The third line contains m integers — the elements of array b (<=-<=109<=≤<=bj<=≤<=109). Output Specification: Print m integers, separated by spaces: the j-th of which is equal to the number of such elements in array a that are less than or equal to the value bj. Demo Input: ['5 4\n1 3 5 7 9\n6 4 2 8\n', '5 5\n1 2 1 2 5\n3 1 4 1 5\n'] Demo Output: ['3 2 1 4\n', '4 2 4 2 5\n'] Note: none	```python a, b=map(int,input(). split()) a=list(map(int, input(). split())) b=list(map(int, input(). split())) for i in range(len(a)): c=0 for j in range(i+1,len(b)): if a[i]<=b[j]: c=c+1 print(c, end=' ') ```	0
650	A	Watchmen	PROGRAMMING	1,400	[ "data structures", "geometry", "math" ]		null	null	Watchmen are in a danger and Doctor Manhattan together with his friend Daniel Dreiberg should warn them as soon as possible. There are n watchmen on a plane, the i-th watchman is located at point (xi,<=yi). They need to arrange a plan, but there are some difficulties on their way. As you know, Doctor Manhattan considers the distance between watchmen i and j to be \|xi<=-<=xj\|<=+<=\|yi<=-<=yj\|. Daniel, as an ordinary person, calculates the distance using the formula . The success of the operation relies on the number of pairs (i,<=j) (1<=≤<=i<=<<=j<=≤<=n), such that the distance between watchman i and watchmen j calculated by Doctor Manhattan is equal to the distance between them calculated by Daniel. You were asked to compute the number of such pairs.	The first line of the input contains the single integer n (1<=≤<=n<=≤<=200<=000) — the number of watchmen. Each of the following n lines contains two integers xi and yi (\|xi\|,<=\|yi\|<=≤<=109). Some positions may coincide.	Print the number of pairs of watchmen such that the distance between them calculated by Doctor Manhattan is equal to the distance calculated by Daniel.	[ "3\n1 1\n7 5\n1 5\n", "6\n0 0\n0 1\n0 2\n-1 1\n0 1\n1 1\n" ]	[ "2\n", "11\n" ]	In the first sample, the distance between watchman 1 and watchman 2 is equal to \|1 - 7\| + \|1 - 5\| = 10 for Doctor Manhattan and <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/bcb5b7064b5f02088da0fdcf677e6fda495dd0df.png" style="max-width: 100.0%;max-height: 100.0%;"/> for Daniel. For pairs (1, 1), (1, 5) and (7, 5), (1, 5) Doctor Manhattan and Daniel will calculate the same distances.	500	[ { "input": "3\n1 1\n7 5\n1 5", "output": "2" }, { "input": "6\n0 0\n0 1\n0 2\n-1 1\n0 1\n1 1", "output": "11" }, { "input": "10\n46 -55\n46 45\n46 45\n83 -55\n46 45\n83 -55\n46 45\n83 45\n83 45\n46 -55", "output": "33" }, { "input": "1\n-5 -90", "output": "0" }, { "input": "2\n315 845\n-669 -762", "output": "0" }, { "input": "3\n8911 7861\n-6888 7861\n8911 7861", "output": "3" }, { "input": "2\n-1 1000000000\n0 -1", "output": "0" }, { "input": "2\n1000000000 0\n-7 1", "output": "0" }, { "input": "2\n1 4\n2 1", "output": "0" }, { "input": "2\n1 0\n0 2333333", "output": "0" }, { "input": "2\n2 1\n1 2", "output": "0" }, { "input": "2\n1 1000000000\n2 -1000000000", "output": "0" }, { "input": "2\n0 1000000000\n1 -7", "output": "0" }, { "input": "2\n1 0\n0 19990213", "output": "0" } ]	1,518,215,413	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	9	3,000	20,992,000	def dist_equal(p1,p2): import math x1,y1 = p1 x2, y2 = p2 d1 = abs(x2-x1) + abs(y2-y1) d2 = math.sqrt((x2-x1)2+(y2-y1)2) return d1 == d2 n = int(input()) p = [] for _ in range(n): x, y = [int(x) for x in input().split()] p.append((x,y)) eq = 0 for i in range(n): for j in range(i+1,n): eq += 1 if dist_equal(p[i],p[j]) else 0 print(eq)	Title: Watchmen Time Limit: None seconds Memory Limit: None megabytes Problem Description: Watchmen are in a danger and Doctor Manhattan together with his friend Daniel Dreiberg should warn them as soon as possible. There are n watchmen on a plane, the i-th watchman is located at point (xi,<=yi). They need to arrange a plan, but there are some difficulties on their way. As you know, Doctor Manhattan considers the distance between watchmen i and j to be \|xi<=-<=xj\|<=+<=\|yi<=-<=yj\|. Daniel, as an ordinary person, calculates the distance using the formula . The success of the operation relies on the number of pairs (i,<=j) (1<=≤<=i<=<<=j<=≤<=n), such that the distance between watchman i and watchmen j calculated by Doctor Manhattan is equal to the distance between them calculated by Daniel. You were asked to compute the number of such pairs. Input Specification: The first line of the input contains the single integer n (1<=≤<=n<=≤<=200<=000) — the number of watchmen. Each of the following n lines contains two integers xi and yi (\|xi\|,<=\|yi\|<=≤<=109). Some positions may coincide. Output Specification: Print the number of pairs of watchmen such that the distance between them calculated by Doctor Manhattan is equal to the distance calculated by Daniel. Demo Input: ['3\n1 1\n7 5\n1 5\n', '6\n0 0\n0 1\n0 2\n-1 1\n0 1\n1 1\n'] Demo Output: ['2\n', '11\n'] Note: In the first sample, the distance between watchman 1 and watchman 2 is equal to \|1 - 7\| + \|1 - 5\| = 10 for Doctor Manhattan and <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/bcb5b7064b5f02088da0fdcf677e6fda495dd0df.png" style="max-width: 100.0%;max-height: 100.0%;"/> for Daniel. For pairs (1, 1), (1, 5) and (7, 5), (1, 5) Doctor Manhattan and Daniel will calculate the same distances.	```python def dist_equal(p1,p2): import math x1,y1 = p1 x2, y2 = p2 d1 = abs(x2-x1) + abs(y2-y1) d2 = math.sqrt((x2-x1)2+(y2-y1)2) return d1 == d2 n = int(input()) p = [] for _ in range(n): x, y = [int(x) for x in input().split()] p.append((x,y)) eq = 0 for i in range(n): for j in range(i+1,n): eq += 1 if dist_equal(p[i],p[j]) else 0 print(eq) ```	0
455	A	Boredom	PROGRAMMING	1,500	[ "dp" ]		null	null	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. Given 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 ak) and delete it, at that all elements equal to ak<=+<=1 and ak<=-<=1 also must be deleted from the sequence. That step brings ak points to the player. Alex is a perfectionist, so he decided to get as many points as possible. Help him.	The first line contains integer n (1<=≤<=n<=≤<=105) that shows how many numbers are in Alex's sequence. The second line contains n integers a1, a2, ..., an (1<=≤<=ai<=≤<=105).	Print a single integer — the maximum number of points that Alex can earn.	[ "2\n1 2\n", "3\n1 2 3\n", "9\n1 2 1 3 2 2 2 2 3\n" ]	[ "2\n", "4\n", "10\n" ]	Consider the third test example. At first step we need to choose any element equal to 2. After that step our sequence looks like this [2, 2, 2, 2]. Then we do 4 steps, on each step we choose any element equals to 2. In total we earn 10 points.	500	[ { "input": "2\n1 2", "output": "2" }, { "input": "3\n1 2 3", "output": "4" }, { "input": "9\n1 2 1 3 2 2 2 2 3", "output": "10" }, { "input": "5\n3 3 4 5 4", "output": "11" }, { "input": "5\n5 3 5 3 4", "output": "16" }, { "input": "5\n4 2 3 2 5", "output": "9" }, { "input": "10\n10 5 8 9 5 6 8 7 2 8", "output": "46" }, { "input": "10\n1 1 1 1 1 1 2 3 4 4", "output": "14" }, { "input": "100\n6 6 8 9 7 9 6 9 5 7 7 4 5 3 9 1 10 3 4 5 8 9 6 5 6 4 10 9 1 4 1 7 1 4 9 10 8 2 9 9 10 5 8 9 5 6 8 7 2 8 7 6 2 6 10 8 6 2 5 5 3 2 8 8 5 3 6 2 1 4 7 2 7 3 7 4 10 10 7 5 4 7 5 10 7 1 1 10 7 7 7 2 3 4 2 8 4 7 4 4", "output": "296" }, { "input": "100\n6 1 5 7 10 10 2 7 3 7 2 10 7 6 3 5 5 5 3 7 2 4 2 7 7 4 2 8 2 10 4 7 9 1 1 7 9 7 1 10 10 9 5 6 10 1 7 5 8 1 1 5 3 10 2 4 3 5 2 7 4 9 5 10 1 3 7 6 6 9 3 6 6 10 1 10 6 1 10 3 4 1 7 9 2 7 8 9 3 3 2 4 6 6 1 2 9 4 1 2", "output": "313" }, { "input": "100\n7 6 3 8 8 3 10 5 3 8 6 4 6 9 6 7 3 9 10 7 5 5 9 10 7 2 3 8 9 5 4 7 9 3 6 4 9 10 7 6 8 7 6 6 10 3 7 4 5 7 7 5 1 5 4 8 7 3 3 4 7 8 5 9 2 2 3 1 6 4 6 6 6 1 7 10 7 4 5 3 9 2 4 1 5 10 9 3 9 6 8 5 2 1 10 4 8 5 10 9", "output": "298" }, { "input": "100\n2 10 9 1 2 6 7 2 2 8 9 9 9 5 6 2 5 1 1 10 7 4 5 5 8 1 9 4 10 1 9 3 1 8 4 10 8 8 2 4 6 5 1 4 2 2 1 2 8 5 3 9 4 10 10 7 8 6 1 8 2 6 7 1 6 7 3 10 10 3 7 7 6 9 6 8 8 10 4 6 4 3 3 3 2 3 10 6 8 5 5 10 3 7 3 1 1 1 5 5", "output": "312" }, { "input": "100\n4 9 7 10 4 7 2 6 1 9 1 8 7 5 5 7 6 7 9 8 10 5 3 5 7 10 3 2 1 3 8 9 4 10 4 7 6 4 9 6 7 1 9 4 3 5 8 9 2 7 10 5 7 5 3 8 10 3 8 9 3 4 3 10 6 5 1 8 3 2 5 8 4 7 5 3 3 2 6 9 9 8 2 7 6 3 2 2 8 8 4 5 6 9 2 3 2 2 5 2", "output": "287" }, { "input": "100\n4 8 10 1 8 8 8 1 10 3 1 8 6 8 6 1 10 3 3 3 3 7 2 1 1 6 10 1 7 9 8 10 3 8 6 2 1 6 5 6 10 8 9 7 4 3 10 5 3 9 10 5 10 8 8 5 7 8 9 5 3 9 9 2 7 8 1 10 4 9 2 8 10 10 5 8 5 1 7 3 4 5 2 5 9 3 2 5 6 2 3 10 1 5 9 6 10 4 10 8", "output": "380" }, { "input": "100\n4 8 10 1 8 8 8 1 10 3 1 8 6 8 6 1 10 3 3 3 3 7 2 1 1 6 10 1 7 9 8 10 3 8 6 2 1 6 5 6 10 8 9 7 4 3 10 5 3 9 10 5 10 8 8 5 7 8 9 5 3 9 9 2 7 8 1 10 4 9 2 8 10 10 5 8 5 1 7 3 4 5 2 5 9 3 2 5 6 2 3 10 1 5 9 6 10 4 10 8", "output": "380" }, { "input": "100\n10 5 8 4 4 4 1 4 5 8 3 10 2 4 1 10 8 1 1 6 8 4 2 9 1 3 1 7 7 9 3 5 5 8 6 9 9 4 8 1 3 3 2 6 1 5 4 5 3 5 5 6 7 5 7 9 3 5 4 9 2 6 8 1 1 7 7 3 8 9 8 7 3 2 4 1 6 1 3 9 4 2 2 8 5 10 1 8 8 5 1 5 6 9 4 5 6 5 10 2", "output": "265" }, { "input": "100\n7 5 1 8 5 6 6 2 6 2 7 7 3 6 2 4 4 2 10 2 2 2 10 6 6 1 5 10 9 1 5 9 8 9 4 1 10 5 7 5 7 6 4 8 8 1 7 8 3 8 2 1 8 4 10 3 5 6 6 10 9 6 5 1 10 7 6 9 9 2 10 10 9 1 2 1 7 7 4 10 1 10 5 5 3 8 9 8 1 4 10 2 4 5 4 4 1 6 2 9", "output": "328" }, { "input": "100\n5 6 10 7 1 7 10 1 9 1 5 1 4 1 3 3 7 9 1 6 1 6 5 7 1 6 3 1 3 6 3 8 2 4 1 5 2 10 7 3 10 4 10 1 5 4 2 9 7 9 5 7 10 4 1 4 8 9 3 1 3 7 7 4 3 7 7 10 6 9 5 5 6 5 3 9 8 8 5 5 4 10 9 4 10 4 1 8 3 5 4 10 9 3 10 4 10 7 10 9", "output": "324" }, { "input": "10\n7 4 5 3 9 1 10 3 4 5", "output": "34" }, { "input": "10\n8 9 6 5 6 4 10 9 1 4", "output": "39" }, { "input": "10\n1 7 1 4 9 10 8 2 9 9", "output": "40" }, { "input": "1\n100000", "output": "100000" } ]	1,668,821,070	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	46	0	#如果数列中有重复出现一个数据，比如重复出现3次2，那么如果删2，就可以删3次得到6分 #但是如果删2，那删1和删3得到的分数就没了，这就需要后面动态规划解决 #在最初准备阶段，先用字典得到删去某个数据能得到的分数 def setting0(sequance): # sequance0 =set(sequance) # dic = {0:0} # for each in sequance: # dic[each] = each * sequance.count(each) # return dic dic = dict.fromkeys(sequance, 0) for each in sequance: dic[each] += 1 for each in sequance: dic[each] = each * dic[each] return dic #从这里考虑动态规划解决问题，将整个大问题划分为多个子问题解决。 #假如有序列【1，1，2，2，2，3，5，5】 #对应的字典是{1：2，2：6，3：3，5：10} #因为得到字典的时候已经考虑了删除重复的数值的情况 #我们可以将序列变成集合{1，2，3，5}再分别考虑 #在思考每一个子问题时，只考虑序列到该值的结果 #比如思考第一个子问题，也就是序列到【1，1】的结果 #第二个子问题，就是序列【1，1，2，2，2】的结果 #第三个子问题，即【1，1，2，2，2，3】 #直到最后一个，【1，1，2，2，2，3，5，5】 #将每一个子问题的解放在列表dp中，这个列表dp直接对应集合{1，2，3，5} #在解决每一个子问题的时候分为两种情况 #第一种，以3为例。2在集合中，如果删去2，那么就不用删3了，那么得到的分数和删2相同，是6 #如果删3，那么不用删2，但是需要删去1，得到的分数是解决【1，1】的结果和删3的字典值之和，是5 #两者的最大值即为删去3的结果，也就是6 #第二种，以5为例。4不在集合中，5必须删去，直接将删3的结果加上删5的字典值，就是16 #最终答案为16 def calculating(dp, dic, sequance): for i in range(2, len(dp)): item = sequance[i] need = dp[:i] if sequance[i-1] + 1 == sequance[i]: dp_0 = need[-2] + dic[item] # print(dp_0) dp[i] = max(dp[i-1], dp_0) else: dp[i] = need[-1] + dic[item] return dp n = int(input()) sequance = [int(x) for x in input().split()] dic = setting0(sequance) #因为得到字典的时候已经考虑了删除重复的数值的情况 #我们可以将序列变成集合再分别考虑，而且sorted排序以后会更方便 #前面加了两个0是为了后面不会list out of index sequance = [0] * 2 + sorted(list(set(sequance))) dp = [0] * (len(sequance)) dp = calculating(dp, dic, sequance) print(dp[-1])	Title: Boredom Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. Given 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 ak) and delete it, at that all elements equal to ak<=+<=1 and ak<=-<=1 also must be deleted from the sequence. That step brings ak points to the player. Alex is a perfectionist, so he decided to get as many points as possible. Help him. Input Specification: The first line contains integer n (1<=≤<=n<=≤<=105) that shows how many numbers are in Alex's sequence. The second line contains n integers a1, a2, ..., an (1<=≤<=ai<=≤<=105). Output Specification: Print a single integer — the maximum number of points that Alex can earn. Demo Input: ['2\n1 2\n', '3\n1 2 3\n', '9\n1 2 1 3 2 2 2 2 3\n'] Demo Output: ['2\n', '4\n', '10\n'] Note: Consider the third test example. At first step we need to choose any element equal to 2. After that step our sequence looks like this [2, 2, 2, 2]. Then we do 4 steps, on each step we choose any element equals to 2. In total we earn 10 points.	```python #如果数列中有重复出现一个数据，比如重复出现3次2，那么如果删2，就可以删3次得到6分 #但是如果删2，那删1和删3得到的分数就没了，这就需要后面动态规划解决 #在最初准备阶段，先用字典得到删去某个数据能得到的分数 def setting0(sequance): # sequance0 =set(sequance) # dic = {0:0} # for each in sequance: # dic[each] = each * sequance.count(each) # return dic dic = dict.fromkeys(sequance, 0) for each in sequance: dic[each] += 1 for each in sequance: dic[each] = each * dic[each] return dic #从这里考虑动态规划解决问题，将整个大问题划分为多个子问题解决。 #假如有序列【1，1，2，2，2，3，5，5】 #对应的字典是{1：2，2：6，3：3，5：10} #因为得到字典的时候已经考虑了删除重复的数值的情况 #我们可以将序列变成集合{1，2，3，5}再分别考虑 #在思考每一个子问题时，只考虑序列到该值的结果 #比如思考第一个子问题，也就是序列到【1，1】的结果 #第二个子问题，就是序列【1，1，2，2，2】的结果 #第三个子问题，即【1，1，2，2，2，3】 #直到最后一个，【1，1，2，2，2，3，5，5】 #将每一个子问题的解放在列表dp中，这个列表dp直接对应集合{1，2，3，5} #在解决每一个子问题的时候分为两种情况 #第一种，以3为例。2在集合中，如果删去2，那么就不用删3了，那么得到的分数和删2相同，是6 #如果删3，那么不用删2，但是需要删去1，得到的分数是解决【1，1】的结果和删3的字典值之和，是5 #两者的最大值即为删去3的结果，也就是6 #第二种，以5为例。4不在集合中，5必须删去，直接将删3的结果加上删5的字典值，就是16 #最终答案为16 def calculating(dp, dic, sequance): for i in range(2, len(dp)): item = sequance[i] need = dp[:i] if sequance[i-1] + 1 == sequance[i]: dp_0 = need[-2] + dic[item] # print(dp_0) dp[i] = max(dp[i-1], dp_0) else: dp[i] = need[-1] + dic[item] return dp n = int(input()) sequance = [int(x) for x in input().split()] dic = setting0(sequance) #因为得到字典的时候已经考虑了删除重复的数值的情况 #我们可以将序列变成集合再分别考虑，而且sorted排序以后会更方便 #前面加了两个0是为了后面不会list out of index sequance = [0] * 2 + sorted(list(set(sequance))) dp = [0] * (len(sequance)) dp = calculating(dp, dic, sequance) print(dp[-1]) ```	0
270	A	Fancy Fence	PROGRAMMING	1,100	[ "geometry", "implementation", "math" ]		null	null	Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot. He 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. Will the robot be able to build the fence Emuskald wants? In other words, is there a regular polygon which angles are equal to a?	The first line of input contains an integer t (0<=<<=t<=<<=180) — the number of tests. Each of the following t lines contains a single integer a (0<=<<=a<=<<=180) — the angle the robot can make corners at measured in degrees.	For each test, output on a single line "YES" (without quotes), if the robot can build a fence Emuskald wants, and "NO" (without quotes), if it is impossible.	[ "3\n30\n60\n90\n" ]	[ "NO\nYES\nYES\n" ]	In the first test case, it is impossible to build the fence, since there is no regular polygon with angle <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/df5f4b07dd5316fde165b43657b2696e2919e791.png" style="max-width: 100.0%;max-height: 100.0%;"/>. In the second test case, the fence is a regular triangle, and in the last test case — a square.	500	[ { "input": "3\n30\n60\n90", "output": "NO\nYES\nYES" }, { "input": "6\n1\n2\n3\n170\n179\n25", "output": "NO\nNO\nNO\nYES\nYES\nNO" } ]	1,678,715,388	2,147,483,647	PyPy 3-64	OK	TESTS	3	124	0	t = int(input()) while t: t-=1 a = int(input()) a = 180 - a if 360 % a != 0: print("NO") else: n = 360 // a if ((n - 2) * 180) // n == 180 - a and ((n - 2) * 180) % n == 0: print("YES") else: print("NO")	Title: Fancy Fence Time Limit: None seconds Memory Limit: None megabytes Problem Description: Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot. He 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. Will 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 Specification: The first line of input contains an integer t (0<=<<=t<=<<=180) — the number of tests. Each of the following t lines contains a single integer a (0<=<<=a<=<<=180) — the angle the robot can make corners at measured in degrees. Output Specification: For each test, output on a single line "YES" (without quotes), if the robot can build a fence Emuskald wants, and "NO" (without quotes), if it is impossible. Demo Input: ['3\n30\n60\n90\n'] Demo Output: ['NO\nYES\nYES\n'] Note: In the first test case, it is impossible to build the fence, since there is no regular polygon with angle <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/df5f4b07dd5316fde165b43657b2696e2919e791.png" style="max-width: 100.0%;max-height: 100.0%;"/>. In the second test case, the fence is a regular triangle, and in the last test case — a square.	```python t = int(input()) while t: t-=1 a = int(input()) a = 180 - a if 360 % a != 0: print("NO") else: n = 360 // a if ((n - 2) * 180) // n == 180 - a and ((n - 2) * 180) % n == 0: print("YES") else: print("NO") ```	3
0	none	none	none	0	[ "none" ]		null	null	Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules from the very first game. That means, that if someone loses a game he leaves the tournament immediately. Organizers are still arranging tournament grid (i.e. the order games will happen and who is going to play with whom) but they have already fixed one rule: two players can play against each other only if the number of games one of them has already played differs by no more than one from the number of games the other one has already played. Of course, both players had to win all their games in order to continue participating in the tournament. Tournament hasn't started yet so the audience is a bit bored. Ostap decided to find out what is the maximum number of games the winner of the tournament can take part in (assuming the rule above is used). However, it is unlikely he can deal with this problem without your help.	The only line of the input contains a single integer n (2<=≤<=n<=≤<=1018) — the number of players to participate in the tournament.	Print the maximum number of games in which the winner of the tournament can take part.	[ "2\n", "3\n", "4\n", "10\n" ]	[ "1\n", "2\n", "2\n", "4\n" ]	In all samples we consider that player number 1 is the winner. In the first sample, there would be only one game so the answer is 1. In the second sample, player 1 can consequently beat players 2 and 3. In the third sample, player 1 can't play with each other player as after he plays with players 2 and 3 he can't play against player 4, as he has 0 games played, while player 1 already played 2. Thus, the answer is 2 and to achieve we make pairs (1, 2) and (3, 4) and then clash the winners.	0	[ { "input": "2", "output": "1" }, { "input": "3", "output": "2" }, { "input": "4", "output": "2" }, { "input": "10", "output": "4" }, { "input": "1000", "output": "14" }, { "input": "2500", "output": "15" }, { "input": "690000", "output": "27" }, { "input": "3000000000", "output": "45" }, { "input": "123456789123456789", "output": "81" }, { "input": "5", "output": "3" }, { "input": "143", "output": "9" }, { "input": "144", "output": "10" }, { "input": "145", "output": "10" }, { "input": "232", "output": "10" }, { "input": "233", "output": "11" }, { "input": "234", "output": "11" }, { "input": "679891637638612257", "output": "84" }, { "input": "679891637638612258", "output": "85" }, { "input": "679891637638612259", "output": "85" }, { "input": "1000000000000000000", "output": "85" }, { "input": "10235439547", "output": "47" }, { "input": "1240723548", "output": "43" }, { "input": "92353046212453", "output": "66" }, { "input": "192403205846532", "output": "68" }, { "input": "13925230525389", "output": "62" }, { "input": "12048230592523", "output": "62" }, { "input": "19204385325853", "output": "63" }, { "input": "902353283921", "output": "56" }, { "input": "793056859214355", "output": "70" }, { "input": "982045466234565", "output": "71" }, { "input": "126743950353465", "output": "67" }, { "input": "12405430465", "output": "47" }, { "input": "10238439257768", "output": "61" }, { "input": "1728493055346", "output": "58" }, { "input": "927553829046", "output": "56" }, { "input": "62735129403", "output": "51" }, { "input": "71624823950223", "output": "65" }, { "input": "8902353464851212", "output": "75" }, { "input": "61824012598535", "output": "65" }, { "input": "1294902504603347", "output": "71" }, { "input": "6", "output": "3" }, { "input": "7", "output": "3" }, { "input": "8", "output": "4" }, { "input": "9", "output": "4" }, { "input": "11", "output": "4" }, { "input": "12", "output": "4" }, { "input": "13", "output": "5" }, { "input": "14", "output": "5" }, { "input": "15", "output": "5" }, { "input": "16", "output": "5" }, { "input": "17", "output": "5" }, { "input": "18", "output": "5" }, { "input": "19", "output": "5" }, { "input": "20", "output": "5" }, { "input": "21", "output": "6" }, { "input": "22", "output": "6" }, { "input": "23", "output": "6" }, { "input": "355687428096000", "output": "69" }, { "input": "576460752303423488", "output": "84" }, { "input": "32212254719", "output": "49" }, { "input": "26388279066623", "output": "63" }, { "input": "618473717761", "output": "56" }, { "input": "262406072477", "output": "54" } ]	1,581,135,017	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	4	109	0	n = int(input()) if n == 2: print(1) else: res = 0 while n > 1: n /= 2 res += 1 print(res)	Title: none Time Limit: None seconds Memory Limit: None megabytes Problem Description: Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules from the very first game. That means, that if someone loses a game he leaves the tournament immediately. Organizers are still arranging tournament grid (i.e. the order games will happen and who is going to play with whom) but they have already fixed one rule: two players can play against each other only if the number of games one of them has already played differs by no more than one from the number of games the other one has already played. Of course, both players had to win all their games in order to continue participating in the tournament. Tournament hasn't started yet so the audience is a bit bored. Ostap decided to find out what is the maximum number of games the winner of the tournament can take part in (assuming the rule above is used). However, it is unlikely he can deal with this problem without your help. Input Specification: The only line of the input contains a single integer n (2<=≤<=n<=≤<=1018) — the number of players to participate in the tournament. Output Specification: Print the maximum number of games in which the winner of the tournament can take part. Demo Input: ['2\n', '3\n', '4\n', '10\n'] Demo Output: ['1\n', '2\n', '2\n', '4\n'] Note: In all samples we consider that player number 1 is the winner. In the first sample, there would be only one game so the answer is 1. In the second sample, player 1 can consequently beat players 2 and 3. In the third sample, player 1 can't play with each other player as after he plays with players 2 and 3 he can't play against player 4, as he has 0 games played, while player 1 already played 2. Thus, the answer is 2 and to achieve we make pairs (1, 2) and (3, 4) and then clash the winners.	```python n = int(input()) if n == 2: print(1) else: res = 0 while n > 1: n /= 2 res += 1 print(res) ```	0
139	A	Petr and Book	PROGRAMMING	1,000	[ "implementation" ]		null	null	One Sunday Petr went to a bookshop and bought a new book on sports programming. The book had exactly n pages. Petr decided to start reading it starting from the next day, that is, from Monday. Petr's got a very tight schedule and for each day of the week he knows how many pages he will be able to read on that day. Some days are so busy that Petr will have no time to read whatsoever. However, we know that he will be able to read at least one page a week. Assuming that Petr will not skip days and will read as much as he can every day, determine on which day of the week he will read the last page of the book.	The first input line contains the single integer n (1<=≤<=n<=≤<=1000) — the number of pages in the book. The second line contains seven non-negative space-separated integers that do not exceed 1000 — those integers represent how many pages Petr can read on Monday, Tuesday, Wednesday, Thursday, Friday, Saturday and Sunday correspondingly. It is guaranteed that at least one of those numbers is larger than zero.	Print a single number — the number of the day of the week, when Petr will finish reading the book. The days of the week are numbered starting with one in the natural order: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday.	[ "100\n15 20 20 15 10 30 45\n", "2\n1 0 0 0 0 0 0\n" ]	[ "6\n", "1\n" ]	Note to the first sample: By the end of Monday and therefore, by the beginning of Tuesday Petr has 85 pages left. He has 65 pages left by Wednesday, 45 by Thursday, 30 by Friday, 20 by Saturday and on Saturday Petr finishes reading the book (and he also has time to read 10 pages of something else). Note to the second sample: On Monday of the first week Petr will read the first page. On Monday of the second week Petr will read the second page and will finish reading the book.	500	[ { "input": "100\n15 20 20 15 10 30 45", "output": "6" }, { "input": "2\n1 0 0 0 0 0 0", "output": "1" }, { "input": "100\n100 200 100 200 300 400 500", "output": "1" }, { "input": "3\n1 1 1 1 1 1 1", "output": "3" }, { "input": "1\n1 1 1 1 1 1 1", "output": "1" }, { "input": "20\n5 3 7 2 1 6 4", "output": "6" }, { "input": "10\n5 1 1 1 1 1 5", "output": "6" }, { "input": "50\n10 1 10 1 10 1 10", "output": "1" }, { "input": "77\n11 11 11 11 11 11 10", "output": "1" }, { "input": "1\n1000 1000 1000 1000 1000 1000 1000", "output": "1" }, { "input": "1000\n100 100 100 100 100 100 100", "output": "3" }, { "input": "999\n10 20 10 20 30 20 10", "output": "3" }, { "input": "433\n109 58 77 10 39 125 15", "output": "7" }, { "input": "1\n0 0 0 0 0 0 1", "output": "7" }, { "input": "5\n1 0 1 0 1 0 1", "output": "1" }, { "input": "997\n1 1 0 0 1 0 1", "output": "1" }, { "input": "1000\n1 1 1 1 1 1 1", "output": "6" }, { "input": "1000\n1000 1000 1000 1000 1000 1000 1000", "output": "1" }, { "input": "1000\n1 0 0 0 0 0 0", "output": "1" }, { "input": "1000\n0 0 0 0 0 0 1", "output": "7" }, { "input": "1000\n1 0 0 1 0 0 1", "output": "1" }, { "input": "509\n105 23 98 0 7 0 155", "output": "2" }, { "input": "7\n1 1 1 1 1 1 1", "output": "7" }, { "input": "2\n1 1 0 0 0 0 0", "output": "2" }, { "input": "1\n0 0 0 0 0 1 0", "output": "6" }, { "input": "10\n0 0 0 0 0 0 1", "output": "7" }, { "input": "5\n0 0 0 0 0 6 0", "output": "6" }, { "input": "3\n0 1 0 0 0 0 0", "output": "2" }, { "input": "10\n0 0 0 0 0 0 10", "output": "7" }, { "input": "28\n1 2 3 4 5 6 7", "output": "7" }, { "input": "100\n5 5 5 5 5 5 5", "output": "6" }, { "input": "4\n1 0 0 0 0 0 1", "output": "7" }, { "input": "2\n0 0 0 0 0 0 1", "output": "7" }, { "input": "7\n0 0 0 0 0 0 7", "output": "7" }, { "input": "7\n2 1 1 1 1 1 0", "output": "6" }, { "input": "2\n0 0 1 1 0 0 0", "output": "4" }, { "input": "6\n1 1 1 1 1 1 0", "output": "6" }, { "input": "5\n1 1 1 0 0 1 1", "output": "7" }, { "input": "100\n10 20 30 10 10 10 10", "output": "7" }, { "input": "1\n0 0 0 1 0 0 0", "output": "4" }, { "input": "70\n10 10 10 10 10 10 10", "output": "7" }, { "input": "22\n1 2 3 4 5 6 10", "output": "7" }, { "input": "5\n0 0 0 1 0 0 0", "output": "4" }, { "input": "2\n0 0 0 1 0 0 0", "output": "4" }, { "input": "6\n1 0 0 0 0 0 2", "output": "7" }, { "input": "10\n1 2 2 1 2 1 1", "output": "7" }, { "input": "5\n0 0 0 0 0 0 10", "output": "7" }, { "input": "4\n0 1 1 0 0 0 0", "output": "3" }, { "input": "100\n0 0 0 0 0 1 0", "output": "6" } ]	1,597,427,841	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	12	216	0	pages = int(input()) nums = list(map(int, input().split())) n = len(nums) i = 0 while pages > 0: pages -= nums[i%n] i+=1 print((i)%n)	Title: Petr and Book Time Limit: None seconds Memory Limit: None megabytes Problem Description: One Sunday Petr went to a bookshop and bought a new book on sports programming. The book had exactly n pages. Petr decided to start reading it starting from the next day, that is, from Monday. Petr's got a very tight schedule and for each day of the week he knows how many pages he will be able to read on that day. Some days are so busy that Petr will have no time to read whatsoever. However, we know that he will be able to read at least one page a week. Assuming that Petr will not skip days and will read as much as he can every day, determine on which day of the week he will read the last page of the book. Input Specification: The first input line contains the single integer n (1<=≤<=n<=≤<=1000) — the number of pages in the book. The second line contains seven non-negative space-separated integers that do not exceed 1000 — those integers represent how many pages Petr can read on Monday, Tuesday, Wednesday, Thursday, Friday, Saturday and Sunday correspondingly. It is guaranteed that at least one of those numbers is larger than zero. Output Specification: Print a single number — the number of the day of the week, when Petr will finish reading the book. The days of the week are numbered starting with one in the natural order: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. Demo Input: ['100\n15 20 20 15 10 30 45\n', '2\n1 0 0 0 0 0 0\n'] Demo Output: ['6\n', '1\n'] Note: Note to the first sample: By the end of Monday and therefore, by the beginning of Tuesday Petr has 85 pages left. He has 65 pages left by Wednesday, 45 by Thursday, 30 by Friday, 20 by Saturday and on Saturday Petr finishes reading the book (and he also has time to read 10 pages of something else). Note to the second sample: On Monday of the first week Petr will read the first page. On Monday of the second week Petr will read the second page and will finish reading the book.	```python pages = int(input()) nums = list(map(int, input().split())) n = len(nums) i = 0 while pages > 0: pages -= nums[i%n] i+=1 print((i)%n) ```	0
266	A	Stones on the Table	PROGRAMMING	800	[ "implementation" ]		null	null	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.	The first line contains integer n (1<=≤<=n<=≤<=50) — the number of stones on the table. The next line contains string s, which represents the colors of the stones. We'll consider the stones in the row numbered from 1 to n from left to right. Then the i-th character s equals "R", if the i-th stone is red, "G", if it's green and "B", if it's blue.	Print a single integer — the answer to the problem.	[ "3\nRRG\n", "5\nRRRRR\n", "4\nBRBG\n" ]	[ "1\n", "4\n", "0\n" ]	none	500	[ { "input": "3\nRRG", "output": "1" }, { "input": "5\nRRRRR", "output": "4" }, { "input": "4\nBRBG", "output": "0" }, { "input": "1\nB", "output": "0" }, { "input": "2\nBG", "output": "0" }, { "input": "3\nBGB", "output": "0" }, { "input": "4\nRBBR", "output": "1" }, { "input": "5\nRGGBG", "output": "1" }, { "input": "10\nGGBRBRGGRB", "output": "2" }, { "input": "50\nGRBGGRBRGRBGGBBBBBGGGBBBBRBRGBRRBRGBBBRBBRRGBGGGRB", "output": "18" }, { "input": "15\nBRRBRGGBBRRRRGR", "output": "6" }, { "input": "20\nRRGBBRBRGRGBBGGRGRRR", "output": "6" }, { "input": "25\nBBGBGRBGGBRRBGRRBGGBBRBRB", "output": "6" }, { "input": "30\nGRGGGBGGRGBGGRGRBGBGBRRRRRRGRB", "output": "9" }, { "input": "35\nGBBGBRGBBGGRBBGBRRGGRRRRRRRBRBBRRGB", "output": "14" }, { "input": "40\nGBBRRGBGGGRGGGRRRRBRBGGBBGGGBGBBBBBRGGGG", "output": "20" }, { "input": "45\nGGGBBRBBRRGRBBGGBGRBRGGBRBRGBRRGBGRRBGRGRBRRG", "output": "11" }, { "input": "50\nRBGGBGGRBGRBBBGBBGRBBBGGGRBBBGBBBGRGGBGGBRBGBGRRGG", "output": "17" }, { "input": "50\nGGGBBRGGGGGRRGGRBGGRGBBRBRRBGRGBBBGBRBGRGBBGRGGBRB", "output": "16" }, { "input": "50\nGBGRGRRBRRRRRGGBBGBRRRBBBRBBBRRGRBBRGBRBGGRGRBBGGG", "output": "19" }, { "input": "10\nGRRBRBRBGR", "output": "1" }, { "input": "10\nBRBGBGRRBR", "output": "1" }, { "input": "20\nGBGBGGRRRRGRBBGRGRGR", "output": "5" }, { "input": "20\nRRGGRBBGBBRBGRRBRRBG", "output": "6" }, { "input": "30\nBGBRGBBBGRGBBRGBGRBBBRGGRRGRRB", "output": "8" }, { "input": "30\nBBBBGGBRBGBBGBGBGBGGGRGRRGGBBB", "output": "11" }, { "input": "40\nGBRRGRBGBRRGBRGGGBRGBGBRGBBRRGRGGBBGBGBB", "output": "9" }, { "input": "40\nBRGRGGRGGRBBRRRBRBBGGGRRGBGBBGRBBRGBRRGG", "output": "13" }, { "input": "50\nRBGBGGRRGGRGGBGBGRRBGGBGBRRBBGBBGBBBGBBRBBRBRBRGRG", "output": "13" }, { "input": "50\nRBRRGBGRRRBGRRBGRRGRBBRBBRRBRGGBRBRRBGGRBGGBRBRGRB", "output": "12" }, { "input": "2\nBB", "output": "1" }, { "input": "50\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "output": "49" }, { "input": "50\nRRRRRRRRGRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "output": "47" }, { "input": "50\nRRRRRRRRRRRRGGRRRRRRRRRBRRRRRRRRRRRRRRBBRRRRRRRRRR", "output": "43" } ]	1,698,599,650	2,147,483,647	PyPy 3	COMPILATION_ERROR	TESTS	0	0	0	n = int(input()) for i in range(n ,-1,0) print (i)	Title: Stones on the Table Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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 Specification: The first line contains integer n (1<=≤<=n<=≤<=50) — the number of stones on the table. The next line contains string s, which represents the colors of the stones. We'll consider the stones in the row numbered from 1 to n from left to right. Then the i-th character s equals "R", if the i-th stone is red, "G", if it's green and "B", if it's blue. Output Specification: Print a single integer — the answer to the problem. Demo Input: ['3\nRRG\n', '5\nRRRRR\n', '4\nBRBG\n'] Demo Output: ['1\n', '4\n', '0\n'] Note: none	```python n = int(input()) for i in range(n ,-1,0) print (i) ```	-1
595	A	Vitaly and Night	PROGRAMMING	800	[ "constructive algorithms", "implementation" ]		null	null	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. Vitaly 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. Given 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.	The first line of the input contains two integers n and m (1<=≤<=n,<=m<=≤<=100) — the number of floors in the house and the number of flats on each floor respectively. Next n lines describe the floors from top to bottom and contain 2·m characters each. If the i-th window of the given floor has lights on, then the i-th character of this line is '1', otherwise it is '0'.	Print a single integer — the number of flats that have lights on in at least one window, that is, the flats where, according to Vitaly, people aren't sleeping.	[ "2 2\n0 0 0 1\n1 0 1 1\n", "1 3\n1 1 0 1 0 0\n" ]	[ "3\n", "2\n" ]	In the first test case the house has two floors, two flats on each floor. That is, in total there are 4 flats. The light isn't on only on the second floor in the left flat. That is, in both rooms of the flat the light is off. In the second test case the house has one floor and the first floor has three flats. The light is on in the leftmost flat (in both windows) and in the middle flat (in one window). In the right flat the light is off.	500	[ { "input": "2 2\n0 0 0 1\n1 0 1 1", "output": "3" }, { "input": "1 3\n1 1 0 1 0 0", "output": "2" }, { "input": "3 3\n1 1 1 1 1 1\n1 1 0 1 1 0\n1 0 0 0 1 1", "output": "8" }, { "input": "1 5\n1 0 1 1 1 0 1 1 1 1", "output": "5" }, { "input": "1 100\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "99" }, { "input": "1 100\n0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0", "output": "6" }, { "input": "1 100\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0", "output": "0" }, { "input": "100 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 0\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n0 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 0\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 0\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n0 1\n1 1\n1 1\n1 0\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1", "output": "100" }, { "input": "100 1\n0 0\n0 0\n0 1\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n1 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 1\n0 0\n0 0\n0 0\n1 0\n0 0\n0 0\n0 0\n1 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 1\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 1\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n1 0", "output": "8" }, { "input": "100 1\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0", "output": "0" }, { "input": "1 1\n0 0", "output": "0" }, { "input": "1 1\n0 1", "output": "1" }, { "input": "1 1\n1 0", "output": "1" }, { "input": "1 1\n1 1", "output": "1" } ]	1,469,794,106	2,147,483,647	Python 3	OK	TESTS	36	62	102,400	import sys n, m = map(int, sys.stdin.readline().split()) ans = 0 for i in range(n): windows = list(map(int, sys.stdin.readline().split())) for j in range(m): if windows[2j] == 1 or windows[2j+1]: ans += 1 print(ans)	Title: Vitaly and Night Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. Vitaly 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. Given 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 Specification: The first line of the input contains two integers n and m (1<=≤<=n,<=m<=≤<=100) — the number of floors in the house and the number of flats on each floor respectively. Next n lines describe the floors from top to bottom and contain 2·m characters each. If the i-th window of the given floor has lights on, then the i-th character of this line is '1', otherwise it is '0'. Output Specification: Print a single integer — the number of flats that have lights on in at least one window, that is, the flats where, according to Vitaly, people aren't sleeping. Demo Input: ['2 2\n0 0 0 1\n1 0 1 1\n', '1 3\n1 1 0 1 0 0\n'] Demo Output: ['3\n', '2\n'] Note: In the first test case the house has two floors, two flats on each floor. That is, in total there are 4 flats. The light isn't on only on the second floor in the left flat. That is, in both rooms of the flat the light is off. In the second test case the house has one floor and the first floor has three flats. The light is on in the leftmost flat (in both windows) and in the middle flat (in one window). In the right flat the light is off.	```python import sys n, m = map(int, sys.stdin.readline().split()) ans = 0 for i in range(n): windows = list(map(int, sys.stdin.readline().split())) for j in range(m): if windows[2j] == 1 or windows[2j+1]: ans += 1 print(ans) ```	3
4	C	Registration System	PROGRAMMING	1,300	[ "data structures", "hashing", "implementation" ]	C. Registration system	5	64	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. Each 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 namei does not yet exist in the database.	The first line contains number n (1<=≤<=n<=≤<=105). The following n lines contain the requests to the system. Each request is a non-empty line, and consists of not more than 32 characters, which are all lowercase Latin letters.	Print n lines, which are system responses to the requests: OK in case of successful registration, or a prompt with a new name, if the requested name is already taken.	[ "4\nabacaba\nacaba\nabacaba\nacab\n", "6\nfirst\nfirst\nsecond\nsecond\nthird\nthird\n" ]	[ "OK\nOK\nabacaba1\nOK\n", "OK\nfirst1\nOK\nsecond1\nOK\nthird1\n" ]	none	0	[ { "input": "4\nabacaba\nacaba\nabacaba\nacab", "output": "OK\nOK\nabacaba1\nOK" }, { "input": "6\nfirst\nfirst\nsecond\nsecond\nthird\nthird", "output": "OK\nfirst1\nOK\nsecond1\nOK\nthird1" }, { "input": "1\nn", "output": "OK" }, { "input": "2\nu\nu", "output": "OK\nu1" }, { "input": "3\nb\nb\nb", "output": "OK\nb1\nb2" }, { "input": "2\nc\ncn", "output": "OK\nOK" }, { "input": "3\nvhn\nvhn\nh", "output": "OK\nvhn1\nOK" }, { "input": "4\nd\nhd\nd\nh", "output": "OK\nOK\nd1\nOK" }, { "input": "10\nbhnqaptmp\nbhnqaptmp\nbhnqaptmp\nbhnqaptmp\nbhnqaptmp\nbhnqaptmp\nbhnqaptmp\nbhnqaptmp\nbhnqaptmp\nbhnqaptmp", "output": "OK\nbhnqaptmp1\nbhnqaptmp2\nbhnqaptmp3\nbhnqaptmp4\nbhnqaptmp5\nbhnqaptmp6\nbhnqaptmp7\nbhnqaptmp8\nbhnqaptmp9" }, { "input": "10\nfpqhfouqdldravpjttarh\nfpqhfouqdldravpjttarh\nfpqhfouqdldravpjttarh\nfpqhfouqdldravpjttarh\nfpqhfouqdldravpjttarh\nfpqhfouqdldravpjttarh\njmvlplnrmba\nfpqhfouqdldravpjttarh\njmvlplnrmba\nfpqhfouqdldravpjttarh", "output": "OK\nfpqhfouqdldravpjttarh1\nfpqhfouqdldravpjttarh2\nfpqhfouqdldravpjttarh3\nfpqhfouqdldravpjttarh4\nfpqhfouqdldravpjttarh5\nOK\nfpqhfouqdldravpjttarh6\njmvlplnrmba1\nfpqhfouqdldravpjttarh7" }, { "input": "10\niwexcrupuubwzbooj\niwexcrupuubwzbooj\njzsyjnxttliyfpunxyhsouhunenzxedi\njzsyjnxttliyfpunxyhsouhunenzxedi\njzsyjnxttliyfpunxyhsouhunenzxedi\njzsyjnxttliyfpunxyhsouhunenzxedi\njzsyjnxttliyfpunxyhsouhunenzxedi\niwexcrupuubwzbooj\niwexcrupuubwzbooj\niwexcrupuubwzbooj", "output": "OK\niwexcrupuubwzbooj1\nOK\njzsyjnxttliyfpunxyhsouhunenzxedi1\njzsyjnxttliyfpunxyhsouhunenzxedi2\njzsyjnxttliyfpunxyhsouhunenzxedi3\njzsyjnxttliyfpunxyhsouhunenzxedi4\niwexcrupuubwzbooj2\niwexcrupuubwzbooj3\niwexcrupuubwzbooj4" }, { "input": "10\nzzzzzzzzzzzzzzzzzzzzzzzzzzz\nzzzzzzzzzzzzzzzzzzzzzzzzzzz\nzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz\nzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz\nzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz\nzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz\nzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz\nzzzzzzzzzzzzzzzzzzzzzzzzzzz\nzzzzzzzzzzzzzzzzzzzzzzzzzzz\nzzzzzzzzzzzzzzzzzzzzzzzzzzz", "output": "OK\nzzzzzzzzzzzzzzzzzzzzzzzzzzz1\nOK\nzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz1\nzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz2\nzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz3\nzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz4\nzzzzzzzzzzzzzzzzzzzzzzzzzzz2\nzzzzzzzzzzzzzzzzzzzzzzzzzzz3\nzzzzzzzzzzzzzzzzzzzzzzzzzzz4" }, { "input": "20\nzzzzzzzzz\nzzzzzzzzzzzzz\nz\nzzzzzzzzzzzzz\nzzzzzzzzz\nzzzzzzzzz\nzzzzzzzzzzzzz\nzzzzzzzzzzzzz\nzzzzzzzzzzzzzzzzzzzzzzzz\nzzzzzzzzzzzzz\nzzzzzzzzzzzzz\nzzzzzzzzzzzzzzzzzzzzzzzz\nzzzzzzzzzzzzzzzzzzzzzzzz\nzzzzzzzzzzzzz\nzzzzzzzzzzzzz\nz\nzzzzzzzzz\nzzzzzzzzz\nzzzzzzzzzzzzz\nzzzzzzzzzzzzzzzzzzzzzzzz", "output": "OK\nOK\nOK\nzzzzzzzzzzzzz1\nzzzzzzzzz1\nzzzzzzzzz2\nzzzzzzzzzzzzz2\nzzzzzzzzzzzzz3\nOK\nzzzzzzzzzzzzz4\nzzzzzzzzzzzzz5\nzzzzzzzzzzzzzzzzzzzzzzzz1\nzzzzzzzzzzzzzzzzzzzzzzzz2\nzzzzzzzzzzzzz6\nzzzzzzzzzzzzz7\nz1\nzzzzzzzzz3\nzzzzzzzzz4\nzzzzzzzzzzzzz8\nzzzzzzzzzzzzzzzzzzzzzzzz3" } ]	1,692,978,228	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	0	124	0	n =int(input()) lst = [] for i in range(n): s = input() if s not in lst: lst.append(s) print('OK') else: i = 1 while s in lst: s = s[:-1] s += str(i) i += 1 lst.append(s) print(s)	Title: Registration System Time Limit: 5 seconds Memory Limit: 64 megabytes Problem Description: 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. Each 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 namei does not yet exist in the database. Input Specification: The first line contains number n (1<=≤<=n<=≤<=105). The following n lines contain the requests to the system. Each request is a non-empty line, and consists of not more than 32 characters, which are all lowercase Latin letters. Output Specification: Print n lines, which are system responses to the requests: OK in case of successful registration, or a prompt with a new name, if the requested name is already taken. Demo Input: ['4\nabacaba\nacaba\nabacaba\nacab\n', '6\nfirst\nfirst\nsecond\nsecond\nthird\nthird\n'] Demo Output: ['OK\nOK\nabacaba1\nOK\n', 'OK\nfirst1\nOK\nsecond1\nOK\nthird1\n'] Note: none	```python n =int(input()) lst = [] for i in range(n): s = input() if s not in lst: lst.append(s) print('OK') else: i = 1 while s in lst: s = s[:-1] s += str(i) i += 1 lst.append(s) print(s) ```	0
217	A	Ice Skating	PROGRAMMING	1,200	[ "brute force", "dfs and similar", "dsu", "graphs" ]		null	null	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. We assume that Bajtek can only heap up snow drifts at integer coordinates.	The first line of input contains a single integer n (1<=≤<=n<=≤<=100) — the number of snow drifts. Each of the following n lines contains two integers xi and yi (1<=≤<=xi,<=yi<=≤<=1000) — the coordinates of the i-th snow drift. Note that the north direction coinсides with the direction of Oy axis, so the east direction coinсides with the direction of the Ox axis. All snow drift's locations are distinct.	Output the minimal number of snow drifts that need to be created in order for Bajtek to be able to reach any snow drift from any other one.	[ "2\n2 1\n1 2\n", "2\n2 1\n4 1\n" ]	[ "1\n", "0\n" ]	none	500	[ { "input": "2\n2 1\n1 2", "output": "1" }, { "input": "2\n2 1\n4 1", "output": "0" }, { "input": "24\n171 35\n261 20\n4 206\n501 446\n961 912\n581 748\n946 978\n463 514\n841 889\n341 466\n842 967\n54 102\n235 261\n925 889\n682 672\n623 636\n268 94\n635 710\n474 510\n697 794\n586 663\n182 184\n806 663\n468 459", "output": "21" }, { "input": "17\n660 646\n440 442\n689 618\n441 415\n922 865\n950 972\n312 366\n203 229\n873 860\n219 199\n344 308\n169 176\n961 992\n153 84\n201 230\n987 938\n834 815", "output": "16" }, { "input": "11\n798 845\n722 911\n374 270\n629 537\n748 856\n831 885\n486 641\n751 829\n609 492\n98 27\n654 663", "output": "10" }, { "input": "1\n321 88", "output": "0" }, { "input": "9\n811 859\n656 676\n76 141\n945 951\n497 455\n18 55\n335 294\n267 275\n656 689", "output": "7" }, { "input": "7\n948 946\n130 130\n761 758\n941 938\n971 971\n387 385\n509 510", "output": "6" }, { "input": "6\n535 699\n217 337\n508 780\n180 292\n393 112\n732 888", "output": "5" }, { "input": "14\n25 23\n499 406\n193 266\n823 751\n219 227\n101 138\n978 992\n43 74\n997 932\n237 189\n634 538\n774 740\n842 767\n742 802", "output": "13" }, { "input": "12\n548 506\n151 198\n370 380\n655 694\n654 690\n407 370\n518 497\n819 827\n765 751\n802 771\n741 752\n653 662", "output": "11" }, { "input": "40\n685 711\n433 403\n703 710\n491 485\n616 619\n288 282\n884 871\n367 352\n500 511\n977 982\n51 31\n576 564\n508 519\n755 762\n22 20\n368 353\n232 225\n953 955\n452 436\n311 330\n967 988\n369 364\n791 803\n150 149\n651 661\n118 93\n398 387\n748 766\n852 852\n230 228\n555 545\n515 519\n667 678\n867 862\n134 146\n859 863\n96 99\n486 469\n303 296\n780 786", "output": "38" }, { "input": "3\n175 201\n907 909\n388 360", "output": "2" }, { "input": "7\n312 298\n86 78\n73 97\n619 594\n403 451\n538 528\n71 86", "output": "6" }, { "input": "19\n802 820\n368 248\n758 794\n455 378\n876 888\n771 814\n245 177\n586 555\n844 842\n364 360\n820 856\n731 624\n982 975\n825 856\n122 121\n862 896\n42 4\n792 841\n828 820", "output": "16" }, { "input": "32\n643 877\n842 614\n387 176\n99 338\n894 798\n652 728\n611 648\n622 694\n579 781\n243 46\n322 305\n198 438\n708 579\n246 325\n536 459\n874 593\n120 277\n989 907\n223 110\n35 130\n761 692\n690 661\n518 766\n226 93\n678 597\n725 617\n661 574\n775 496\n56 416\n14 189\n358 359\n898 901", "output": "31" }, { "input": "32\n325 327\n20 22\n72 74\n935 933\n664 663\n726 729\n785 784\n170 171\n315 314\n577 580\n984 987\n313 317\n434 435\n962 961\n55 54\n46 44\n743 742\n434 433\n617 612\n332 332\n883 886\n940 936\n793 792\n645 644\n611 607\n418 418\n465 465\n219 218\n167 164\n56 54\n403 405\n210 210", "output": "29" }, { "input": "32\n652 712\n260 241\n27 154\n188 16\n521 351\n518 356\n452 540\n790 827\n339 396\n336 551\n897 930\n828 627\n27 168\n180 113\n134 67\n794 671\n812 711\n100 241\n686 813\n138 289\n384 506\n884 932\n913 959\n470 508\n730 734\n373 478\n788 862\n392 426\n148 68\n113 49\n713 852\n924 894", "output": "29" }, { "input": "14\n685 808\n542 677\n712 747\n832 852\n187 410\n399 338\n626 556\n530 635\n267 145\n215 209\n559 684\n944 949\n753 596\n601 823", "output": "13" }, { "input": "5\n175 158\n16 2\n397 381\n668 686\n957 945", "output": "4" }, { "input": "5\n312 284\n490 509\n730 747\n504 497\n782 793", "output": "4" }, { "input": "2\n802 903\n476 348", "output": "1" }, { "input": "4\n325 343\n425 442\n785 798\n275 270", "output": "3" }, { "input": "28\n462 483\n411 401\n118 94\n111 127\n5 6\n70 52\n893 910\n73 63\n818 818\n182 201\n642 633\n900 886\n893 886\n684 700\n157 173\n953 953\n671 660\n224 225\n832 801\n152 157\n601 585\n115 101\n739 722\n611 606\n659 642\n461 469\n702 689\n649 653", "output": "25" }, { "input": "36\n952 981\n885 900\n803 790\n107 129\n670 654\n143 132\n66 58\n813 819\n849 837\n165 198\n247 228\n15 39\n619 618\n105 138\n868 855\n965 957\n293 298\n613 599\n227 212\n745 754\n723 704\n877 858\n503 487\n678 697\n592 595\n155 135\n962 982\n93 89\n660 673\n225 212\n967 987\n690 680\n804 813\n489 518\n240 221\n111 124", "output": "34" }, { "input": "30\n89 3\n167 156\n784 849\n943 937\n144 95\n24 159\n80 120\n657 683\n585 596\n43 147\n909 964\n131 84\n345 389\n333 321\n91 126\n274 325\n859 723\n866 922\n622 595\n690 752\n902 944\n127 170\n426 383\n905 925\n172 284\n793 810\n414 510\n890 884\n123 24\n267 255", "output": "29" }, { "input": "5\n664 666\n951 941\n739 742\n844 842\n2 2", "output": "4" }, { "input": "3\n939 867\n411 427\n757 708", "output": "2" }, { "input": "36\n429 424\n885 972\n442 386\n512 511\n751 759\n4 115\n461 497\n496 408\n8 23\n542 562\n296 331\n448 492\n412 395\n109 166\n622 640\n379 355\n251 262\n564 586\n66 115\n275 291\n666 611\n629 534\n510 567\n635 666\n738 803\n420 369\n92 17\n101 144\n141 92\n258 258\n184 235\n492 456\n311 210\n394 357\n531 512\n634 636", "output": "34" }, { "input": "29\n462 519\n871 825\n127 335\n156 93\n576 612\n885 830\n634 779\n340 105\n744 795\n716 474\n93 139\n563 805\n137 276\n177 101\n333 14\n391 437\n873 588\n817 518\n460 597\n572 670\n140 303\n392 441\n273 120\n862 578\n670 639\n410 161\n544 577\n193 116\n252 195", "output": "28" }, { "input": "23\n952 907\n345 356\n812 807\n344 328\n242 268\n254 280\n1000 990\n80 78\n424 396\n595 608\n755 813\n383 380\n55 56\n598 633\n203 211\n508 476\n600 593\n206 192\n855 882\n517 462\n967 994\n642 657\n493 488", "output": "22" }, { "input": "10\n579 816\n806 590\n830 787\n120 278\n677 800\n16 67\n188 251\n559 560\n87 67\n104 235", "output": "8" }, { "input": "23\n420 424\n280 303\n515 511\n956 948\n799 803\n441 455\n362 369\n299 289\n823 813\n982 967\n876 878\n185 157\n529 551\n964 989\n655 656\n1 21\n114 112\n45 56\n935 937\n1000 997\n934 942\n360 366\n648 621", "output": "22" }, { "input": "23\n102 84\n562 608\n200 127\n952 999\n465 496\n322 367\n728 690\n143 147\n855 867\n861 866\n26 59\n300 273\n255 351\n192 246\n70 111\n365 277\n32 104\n298 319\n330 354\n241 141\n56 125\n315 298\n412 461", "output": "22" }, { "input": "7\n429 506\n346 307\n99 171\n853 916\n322 263\n115 157\n906 924", "output": "6" }, { "input": "3\n1 1\n2 1\n2 2", "output": "0" }, { "input": "4\n1 1\n1 2\n2 1\n2 2", "output": "0" }, { "input": "5\n1 1\n1 2\n2 2\n3 1\n3 3", "output": "0" }, { "input": "6\n1 1\n1 2\n2 2\n3 1\n3 2\n3 3", "output": "0" }, { "input": "20\n1 1\n2 2\n3 3\n3 9\n4 4\n5 2\n5 5\n5 7\n5 8\n6 2\n6 6\n6 9\n7 7\n8 8\n9 4\n9 7\n9 9\n10 2\n10 9\n10 10", "output": "1" }, { "input": "21\n1 1\n1 9\n2 1\n2 2\n2 5\n2 6\n2 9\n3 3\n3 8\n4 1\n4 4\n5 5\n5 8\n6 6\n7 7\n8 8\n9 9\n10 4\n10 10\n11 5\n11 11", "output": "1" }, { "input": "22\n1 1\n1 3\n1 4\n1 8\n1 9\n1 11\n2 2\n3 3\n4 4\n4 5\n5 5\n6 6\n6 8\n7 7\n8 3\n8 4\n8 8\n9 9\n10 10\n11 4\n11 9\n11 11", "output": "3" }, { "input": "50\n1 1\n2 2\n2 9\n3 3\n4 4\n4 9\n4 16\n4 24\n5 5\n6 6\n7 7\n8 8\n8 9\n8 20\n9 9\n10 10\n11 11\n12 12\n13 13\n14 7\n14 14\n14 16\n14 25\n15 4\n15 6\n15 15\n15 22\n16 6\n16 16\n17 17\n18 18\n19 6\n19 19\n20 20\n21 21\n22 6\n22 22\n23 23\n24 6\n24 7\n24 8\n24 9\n24 24\n25 1\n25 3\n25 5\n25 7\n25 23\n25 24\n25 25", "output": "7" }, { "input": "55\n1 1\n1 14\n2 2\n2 19\n3 1\n3 3\n3 8\n3 14\n3 23\n4 1\n4 4\n5 5\n5 8\n5 15\n6 2\n6 3\n6 4\n6 6\n7 7\n8 8\n8 21\n9 9\n10 1\n10 10\n11 9\n11 11\n12 12\n13 13\n14 14\n15 15\n15 24\n16 5\n16 16\n17 5\n17 10\n17 17\n17 18\n17 22\n17 27\n18 18\n19 19\n20 20\n21 20\n21 21\n22 22\n23 23\n24 14\n24 24\n25 25\n26 8\n26 11\n26 26\n27 3\n27 27\n28 28", "output": "5" }, { "input": "3\n1 2\n2 1\n2 2", "output": "0" }, { "input": "6\n4 4\n3 4\n5 4\n4 5\n4 3\n3 1", "output": "0" }, { "input": "4\n1 1\n1 2\n2 1\n2 2", "output": "0" }, { "input": "3\n1 1\n2 2\n1 2", "output": "0" }, { "input": "8\n1 3\n1 1\n4 1\n2 2\n2 5\n5 9\n5 1\n5 4", "output": "1" }, { "input": "10\n1 1\n1 2\n1 3\n1 4\n5 5\n6 6\n7 7\n8 8\n9 9\n100 100", "output": "6" }, { "input": "7\n1 1\n2 2\n3 3\n4 4\n1 2\n2 3\n3 4", "output": "0" }, { "input": "6\n1 1\n2 1\n2 2\n2 4\n4 3\n2 3", "output": "0" }, { "input": "4\n3 1\n2 1\n2 2\n1 2", "output": "0" }, { "input": "6\n1 1\n2 2\n2 1\n2 4\n4 3\n2 3", "output": "0" }, { "input": "3\n1 2\n1 3\n1 4", "output": "0" }, { "input": "4\n1 1\n2 2\n1 2\n2 1", "output": "0" }, { "input": "4\n1 3\n2 1\n3 2\n3 1", "output": "1" }, { "input": "7\n1 1\n1 2\n2 2\n3 3\n3 4\n4 4\n1 4", "output": "0" }, { "input": "21\n12 12\n13 12\n12 11\n13 13\n10 10\n11 10\n11 11\n501 500\n501 501\n503 502\n500 500\n503 503\n502 501\n502 502\n700 700\n702 702\n703 702\n701 701\n702 701\n703 703\n701 700", "output": "2" }, { "input": "6\n1 11\n6 8\n11 10\n1 10\n11 11\n6 9", "output": "1" }, { "input": "4\n1 1\n2 2\n3 2\n3 1", "output": "0" }, { "input": "3\n1 2\n3 4\n3 2", "output": "0" }, { "input": "3\n1 1\n1 2\n2 2", "output": "0" }, { "input": "4\n5 5\n5 4\n6 3\n6 4", "output": "0" }, { "input": "3\n1 1\n2 2\n2 1", "output": "0" } ]	1,600,244,674	2,147,483,647	PyPy 3	TIME_LIMIT_EXCEEDED	TESTS	2	2,000	13,516,800	import sys from functools import lru_cache, cmp_to_key from heapq import merge, heapify, heappop, heappush # from math import * from collections import defaultdict as dd, deque, Counter as C from itertools import combinations as comb, permutations as perm from bisect import bisect_left as bl, bisect_right as br, bisect from time import perf_counter from fractions import Fraction import copy import time # import numpy as np starttime = time.time() # import numpy as np mod = int(pow(10, 9) + 7) mod2 = 998244353 def data(): return sys.stdin.readline().strip() def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end) def L(): return list(sp()) def sl(): return list(ssp()) def sp(): return map(int, data().split()) def ssp(): return map(str, data().split()) def l1d(n, val=0): return [val for i in range(n)] def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)] try: # sys.setrecursionlimit(int(pow(10,5))) sys.stdin = open("input.txt", "r") # sys.stdout = open("../output.txt", "w") except: pass MXX=1001 def bfs(i,j): q=[[i,j]] st,end=i,j while(q): i,j=q[0] del(q[0]) for x in range(MXX): if [x,j] in vis: f=vis.index([x,j]) del(vis[f]) q.append([x,j]) A[x][j]=A[st][end] for y in range(MXX): if [i,y] in vis: f=vis.index([i,y]) del(vis[f]) q.append([i,y]) A[i][y]=A[st][end] A=[[0 for i in range(MXX)] for j in range(MXX)] n=L()[0] vis=[] for i in range(1,n+1): x,y=L() A[x][y]=i vis.append([x,y]) cnt=0 for i in range(MXX): for j in range(MXX): if [i,j] in vis: f=vis.index([i,j]) del(vis[f]) bfs(i,j) cnt+=1 print(cnt-1) endtime = time.time() # print(f"Runtime of the program is {endtime - starttime}")	Title: Ice Skating Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. We assume that Bajtek can only heap up snow drifts at integer coordinates. Input Specification: The first line of input contains a single integer n (1<=≤<=n<=≤<=100) — the number of snow drifts. Each of the following n lines contains two integers xi and yi (1<=≤<=xi,<=yi<=≤<=1000) — the coordinates of the i-th snow drift. Note that the north direction coinсides with the direction of Oy axis, so the east direction coinсides with the direction of the Ox axis. All snow drift's locations are distinct. Output Specification: Output the minimal number of snow drifts that need to be created in order for Bajtek to be able to reach any snow drift from any other one. Demo Input: ['2\n2 1\n1 2\n', '2\n2 1\n4 1\n'] Demo Output: ['1\n', '0\n'] Note: none	```python import sys from functools import lru_cache, cmp_to_key from heapq import merge, heapify, heappop, heappush # from math import * from collections import defaultdict as dd, deque, Counter as C from itertools import combinations as comb, permutations as perm from bisect import bisect_left as bl, bisect_right as br, bisect from time import perf_counter from fractions import Fraction import copy import time # import numpy as np starttime = time.time() # import numpy as np mod = int(pow(10, 9) + 7) mod2 = 998244353 def data(): return sys.stdin.readline().strip() def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end) def L(): return list(sp()) def sl(): return list(ssp()) def sp(): return map(int, data().split()) def ssp(): return map(str, data().split()) def l1d(n, val=0): return [val for i in range(n)] def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)] try: # sys.setrecursionlimit(int(pow(10,5))) sys.stdin = open("input.txt", "r") # sys.stdout = open("../output.txt", "w") except: pass MXX=1001 def bfs(i,j): q=[[i,j]] st,end=i,j while(q): i,j=q[0] del(q[0]) for x in range(MXX): if [x,j] in vis: f=vis.index([x,j]) del(vis[f]) q.append([x,j]) A[x][j]=A[st][end] for y in range(MXX): if [i,y] in vis: f=vis.index([i,y]) del(vis[f]) q.append([i,y]) A[i][y]=A[st][end] A=[[0 for i in range(MXX)] for j in range(MXX)] n=L()[0] vis=[] for i in range(1,n+1): x,y=L() A[x][y]=i vis.append([x,y]) cnt=0 for i in range(MXX): for j in range(MXX): if [i,j] in vis: f=vis.index([i,j]) del(vis[f]) bfs(i,j) cnt+=1 print(cnt-1) endtime = time.time() # print(f"Runtime of the program is {endtime - starttime}") ```	0
813	B	The Golden Age	PROGRAMMING	1,800	[ "brute force", "math" ]		null	null	Unlucky year in Berland is such a year that its number n can be represented as n<==<=xa<=+<=yb, where a and b are non-negative integer numbers. For example, if x<==<=2 and y<==<=3 then the years 4 and 17 are unlucky (4<==<=20<=+<=31, 17<==<=23<=+<=32<==<=24<=+<=30) and year 18 isn't unlucky as there is no such representation for it. Such interval of years that there are no unlucky years in it is called The Golden Age. You should write a program which will find maximum length of The Golden Age which starts no earlier than the year l and ends no later than the year r. If all years in the interval [l,<=r] are unlucky then the answer is 0.	The first line contains four integer numbers x, y, l and r (2<=≤<=x,<=y<=≤<=1018, 1<=≤<=l<=≤<=r<=≤<=1018).	Print the maximum length of The Golden Age within the interval [l,<=r]. If all years in the interval [l,<=r] are unlucky then print 0.	[ "2 3 1 10\n", "3 5 10 22\n", "2 3 3 5\n" ]	[ "1\n", "8\n", "0\n" ]	In the first example the unlucky years are 2, 3, 4, 5, 7, 9 and 10. So maximum length of The Golden Age is achived in the intervals [1, 1], [6, 6] and [8, 8]. In the second example the longest Golden Age is the interval [15, 22].	0	[ { "input": "2 3 1 10", "output": "1" }, { "input": "3 5 10 22", "output": "8" }, { "input": "2 3 3 5", "output": "0" }, { "input": "2 2 1 10", "output": "1" }, { "input": "2 2 1 1000000", "output": "213568" }, { "input": "2 2 1 1000000000000000000", "output": "144115188075855871" }, { "input": "2 3 1 1000000", "output": "206415" }, { "input": "2 3 1 1000000000000000000", "output": "261485717957290893" }, { "input": "12345 54321 1 1000000", "output": "933334" }, { "input": "54321 12345 1 1000000000000000000", "output": "976614248345331214" }, { "input": "2 3 100000000 1000000000000", "output": "188286357653" }, { "input": "2 14 732028847861235712 732028847861235712", "output": "0" }, { "input": "14 2 732028847861235713 732028847861235713", "output": "1" }, { "input": "3 2 6 7", "output": "1" }, { "input": "16 5 821690667 821691481", "output": "815" }, { "input": "1000000000000000000 2 1 1000000000000000000", "output": "423539247696576511" }, { "input": "2 1000000000000000000 1000000000000000 1000000000000000000", "output": "423539247696576511" }, { "input": "2 2 1000000000000000000 1000000000000000000", "output": "1" }, { "input": "3 3 1 1", "output": "1" }, { "input": "2 3 626492297402423196 726555387600422608", "output": "100063090197999413" }, { "input": "4 4 1 1", "output": "1" }, { "input": "304279187938024110 126610724244348052 78460471576735729 451077737144268785", "output": "177668463693676057" }, { "input": "510000000000 510000000000 1 1000000000000000000", "output": "999998980000000000" }, { "input": "2 10000000000000000 1 1000000000000000000", "output": "413539247696576512" }, { "input": "84826654960259 220116531311479700 375314289098080160 890689132792406667", "output": "515374843694326508" }, { "input": "1001 9999 1 1000000000000000000", "output": "988998989390034998" }, { "input": "106561009498593483 3066011339919949 752858505287719337 958026822891358781", "output": "205168317603639445" }, { "input": "650233444262690661 556292951587380938 715689923804218376 898772439356652923", "output": "183082515552434548" }, { "input": "4294967297 4294967297 1 1000000000000000000", "output": "999999991410065406" }, { "input": "1000000000000000000 1000000000000000000 1000000000000000000 1000000000000000000", "output": "1" }, { "input": "2 2 1 1", "output": "1" }, { "input": "73429332516742239 589598864615747534 555287238606698050 981268715519611449", "output": "318240518387121676" }, { "input": "282060925969693883 446418005951342865 709861829378794811 826972744183396568", "output": "98493812262359820" }, { "input": "97958277744315833 443452631396066615 33878596673318768 306383421710156519", "output": "208425143965840685" }, { "input": "40975442958818854 7397733549114401 299774870238987084 658001214206968260", "output": "358226343967981177" }, { "input": "699 700 1 1000", "output": "697" }, { "input": "483076744475822225 425097332543006422 404961220953110704 826152774360856248", "output": "343076029885034022" }, { "input": "4294967297 4294967297 1 999999999999999999", "output": "999999991410065405" }, { "input": "702012794 124925148 2623100012 1000000000000000000", "output": "491571744457491660" }, { "input": "433333986179614514 1000000000000000000 433333986179614515 726628630292055493", "output": "293294644112440978" }, { "input": "999999999999999999 364973116927770629 4 4", "output": "1" }, { "input": "4 2 40 812", "output": "191" }, { "input": "2 3 1 1", "output": "1" }, { "input": "1556368728 1110129598 120230736 1258235681", "output": "989898863" }, { "input": "7 9 164249007852879073 459223650245359577", "output": "229336748650748455" }, { "input": "324693328712373699 541961409169732375 513851377473048715 873677521504257312", "output": "324693328712373697" }, { "input": "370083000139673112 230227213530985315 476750241623737312 746365058930029530", "output": "146054845259371103" }, { "input": "4 3 584 899", "output": "146" }, { "input": "4 3 286 581", "output": "161" }, { "input": "304045744870965151 464630021384225732 142628934177558000 844155070300317027", "output": "304045744870965149" }, { "input": "195627622825327857 666148746663834172 1 1000000000000000000", "output": "470521123838506314" }, { "input": "459168731438725410 459955118458373596 410157890472128901 669197645706452507", "output": "209242527248078910" }, { "input": "999999999999999999 999999999999999999 1 1000000000000000000", "output": "999999999999999997" }, { "input": "752299248283963354 680566564599126819 73681814274367577 960486443362068685", "output": "606884750324759243" }, { "input": "20373217421623606 233158243228114207 97091516440255589 395722640217125926", "output": "142191179567388113" }, { "input": "203004070900 20036005000 1 1000000000000000000", "output": "999999776959924100" }, { "input": "565269817339236857 318270460838647700 914534538271870694 956123707310168659", "output": "41589169038297966" }, { "input": "2 5 330 669", "output": "131" }, { "input": "9 9 91 547", "output": "385" }, { "input": "9 4 866389615074294253 992899492208527253", "output": "126509877134233001" }, { "input": "3037000500 3037000500 1 1000000000000000000", "output": "999999993925999000" }, { "input": "4294967297 4294967297 12 1000000000000000000", "output": "999999991410065406" }, { "input": "5 3 78510497842978003 917156799600023483", "output": "238418579101562499" }, { "input": "749206377024033575 287723056504284448 387669391392789697 931234393488075794", "output": "361536985631243879" }, { "input": "999999999999999999 454135 1000000000000000000 1000000000000000000", "output": "0" }, { "input": "759826429841877401 105086867783910112 667080043736858072 797465019478234768", "output": "92746386105019330" }, { "input": "1000000000000000000 1000000000000000000 5 7", "output": "3" }, { "input": "440968000218771383 43378854522801881 169393324037146024 995429539593716237", "output": "511082684852142973" }, { "input": "15049917793417622 113425474361704411 87565655389309185 803955352361026671", "output": "675479960205904638" }, { "input": "4 6 264626841724745187 925995096479842591", "output": "369878143059623936" }, { "input": "4294967297 4294967297 13 1000000000000000000", "output": "999999991410065406" }, { "input": "315729630349763416 22614591055604717 66895291338255006 947444311481017774", "output": "609100090075649641" }, { "input": "3 10 173 739", "output": "386" }, { "input": "161309010783040325 128259041753158864 5843045875031294 854024306926137845", "output": "564456254389938656" }, { "input": "239838434825939759 805278168279318096 202337849919104640 672893754916863788", "output": "433055320090924028" }, { "input": "9 9 435779695685310822 697902619874412541", "output": "262122924189101720" }, { "input": "967302429573451368 723751675006196376 143219686319239751 266477897142546404", "output": "123258210823306654" }, { "input": "10 8 139979660652061677 941135332855173888", "output": "697020144779318016" }, { "input": "4294967297 1000000000000000000 4294967296 17179869184", "output": "12884901886" }, { "input": "100914030314340517 512922595840756536 812829791042966971 966156272123068006", "output": "153326481080101036" }, { "input": "288230376151711744 288230376151711744 1 1000000000000000000", "output": "423539247696576512" }, { "input": "6 9 681 750", "output": "49" }, { "input": "880356874212472951 178538501711453307 162918237570625233 224969951233811739", "output": "46431449522358431" }, { "input": "2 7 405373082004080437 771991379629433514", "output": "153172782079203571" }, { "input": "10 11 10 11", "output": "1" } ]	1,693,124,845	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	12	62	3,072,000	# import sys # input = sys.stdin.readline import math def binExp(base: int, pow: int): if pow == 0: return 1 r = 1 while pow > 1: if pow % 2 == 0: base = base pow //= 2 else: r = base pow -= 1 return base * r def solve(): # n = int(input()) x, y, l, r = list(map(int, input().split(" "))) maxA = math.floor(math.log(r, x)) maxB = math.floor(math.log(r, y)) ar = [] for a in range(0, maxA + 1): for b in range(0, maxB + 1): v1 = binExp(x, a) v2 = binExp(y, b) if v1 + v2 < l or v1 + v2 > r: continue ar.append(v1 + v2) ar = sorted(ar) ar.append(r + 1) gap = 0 prev = l for v in ar: gap = max(gap, v - prev - 1) prev = v print(gap) t = 1 if False: t = int(input()) for _ in range(t): solve()	Title: The Golden Age Time Limit: None seconds Memory Limit: None megabytes Problem Description: Unlucky year in Berland is such a year that its number n can be represented as n<==<=xa<=+<=yb, where a and b are non-negative integer numbers. For example, if x<==<=2 and y<==<=3 then the years 4 and 17 are unlucky (4<==<=20<=+<=31, 17<==<=23<=+<=32<==<=24<=+<=30) and year 18 isn't unlucky as there is no such representation for it. Such interval of years that there are no unlucky years in it is called The Golden Age. You should write a program which will find maximum length of The Golden Age which starts no earlier than the year l and ends no later than the year r. If all years in the interval [l,<=r] are unlucky then the answer is 0. Input Specification: The first line contains four integer numbers x, y, l and r (2<=≤<=x,<=y<=≤<=1018, 1<=≤<=l<=≤<=r<=≤<=1018). Output Specification: Print the maximum length of The Golden Age within the interval [l,<=r]. If all years in the interval [l,<=r] are unlucky then print 0. Demo Input: ['2 3 1 10\n', '3 5 10 22\n', '2 3 3 5\n'] Demo Output: ['1\n', '8\n', '0\n'] Note: In the first example the unlucky years are 2, 3, 4, 5, 7, 9 and 10. So maximum length of The Golden Age is achived in the intervals [1, 1], [6, 6] and [8, 8]. In the second example the longest Golden Age is the interval [15, 22].	```python # import sys # input = sys.stdin.readline import math def binExp(base: int, pow: int): if pow == 0: return 1 r = 1 while pow > 1: if pow % 2 == 0: base = base pow //= 2 else: r = base pow -= 1 return base * r def solve(): # n = int(input()) x, y, l, r = list(map(int, input().split(" "))) maxA = math.floor(math.log(r, x)) maxB = math.floor(math.log(r, y)) ar = [] for a in range(0, maxA + 1): for b in range(0, maxB + 1): v1 = binExp(x, a) v2 = binExp(y, b) if v1 + v2 < l or v1 + v2 > r: continue ar.append(v1 + v2) ar = sorted(ar) ar.append(r + 1) gap = 0 prev = l for v in ar: gap = max(gap, v - prev - 1) prev = v print(gap) t = 1 if False: t = int(input()) for _ in range(t): solve() ```	0
339	A	Helpful Maths	PROGRAMMING	800	[ "greedy", "implementation", "sortings", "strings" ]		null	null	Xenia the beginner mathematician is a third year student at elementary school. She is now learning the addition operation. The 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. You'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.	The first line contains a non-empty string s — the sum Xenia needs to count. String s contains no spaces. It only contains digits and characters "+". Besides, string s is a correct sum of numbers 1, 2 and 3. String s is at most 100 characters long.	Print the new sum that Xenia can count.	[ "3+2+1\n", "1+1+3+1+3\n", "2\n" ]	[ "1+2+3\n", "1+1+1+3+3\n", "2\n" ]	none	500	[ { "input": "3+2+1", "output": "1+2+3" }, { "input": "1+1+3+1+3", "output": "1+1+1+3+3" }, { "input": "2", "output": "2" }, { "input": "2+2+1+1+3", "output": "1+1+2+2+3" }, { "input": "2+1+2+2+2+3+1+3+1+2", "output": "1+1+1+2+2+2+2+2+3+3" }, { "input": "1+2+1+2+2+2+2+1+3+3", "output": "1+1+1+2+2+2+2+2+3+3" }, { "input": "2+3+3+1+2+2+2+1+1+2+1+3+2+2+3+3+2+2+3+3+3+1+1+1+3+3+3+2+1+3+2+3+2+1+1+3+3+3+1+2+2+1+2+2+1+2+1+3+1+1", "output": "1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+3+3+3+3+3+3+3+3+3+3+3+3+3+3+3+3+3" }, { "input": "1", "output": "1" }, { "input": "2+1+2+2+1+3+2+3+1+1+2+1+2+2+3+1+1+3+3+3+2+2+3+2+2+2+1+2+1+2+3+2+2+2+1+3+1+3+3+3+1+2+1+2+2+2+2+3+1+1", "output": "1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+3+3+3+3+3+3+3+3+3+3+3+3+3" }, { "input": "2+2+1+1+1+3+1+1+3+3+2+3+1+3+1+1+3+1+1+2+2+2+2+1+2+1+2+1+1+1+3+1+3+2+3+2+3+3+1+1+1+2+3+2+1+3+1+3+2+2", "output": "1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+3+3+3+3+3+3+3+3+3+3+3+3+3+3" }, { "input": "3+2+3+3+2+2+1+2+1+2+3+1+2+3+2+3+2+1+2+2+1+1+2+2+3+2+1+3+1+1+3+2+2+2+2+3+3+2+2+3+3+1+1+2+3+3+2+3+3+3", "output": "1+1+1+1+1+1+1+1+1+1+1+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+3+3+3+3+3+3+3+3+3+3+3+3+3+3+3+3+3+3" }, { "input": "3", "output": "3" }, { "input": "1+1", "output": "1+1" }, { "input": "1+2", "output": "1+2" }, { "input": "1+3", "output": "1+3" }, { "input": "2+1", "output": "1+2" }, { "input": "2+2", "output": "2+2" }, { "input": "2+3", "output": "2+3" }, { "input": "3+1", "output": "1+3" }, { "input": "3+2", "output": "2+3" }, { "input": "3+3", "output": "3+3" } ]	1,699,115,870	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	2	62	0	word = input() znak = word[1] word = word.replace(znak,'') s=[] for i in range(len(word)): s.append(word[i]) s = sorted(s) print(*s,sep=znak)	Title: Helpful Maths Time Limit: None seconds Memory Limit: None megabytes Problem Description: Xenia the beginner mathematician is a third year student at elementary school. She is now learning the addition operation. The 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. You'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 Specification: The first line contains a non-empty string s — the sum Xenia needs to count. String s contains no spaces. It only contains digits and characters "+". Besides, string s is a correct sum of numbers 1, 2 and 3. String s is at most 100 characters long. Output Specification: Print the new sum that Xenia can count. Demo Input: ['3+2+1\n', '1+1+3+1+3\n', '2\n'] Demo Output: ['1+2+3\n', '1+1+1+3+3\n', '2\n'] Note: none	```python word = input() znak = word[1] word = word.replace(znak,'') s=[] for i in range(len(word)): s.append(word[i]) s = sorted(s) print(*s,sep=znak) ```	-1
37	A	Towers	PROGRAMMING	1,000	[ "sortings" ]	A. Towers	2	256	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. Vasya wants to construct the minimal number of towers from the bars. Help Vasya to use the bars in the best way possible.	The first line contains an integer N (1<=≤<=N<=≤<=1000) — the number of bars at Vasya’s disposal. The second line contains N space-separated integers li — the lengths of the bars. All the lengths are natural numbers not exceeding 1000.	In one line output two numbers — the height of the largest tower and their total number. Remember that Vasya should use all the bars.	[ "3\n1 2 3\n", "4\n6 5 6 7\n" ]	[ "1 3\n", "2 3\n" ]	none	500	[ { "input": "3\n1 2 3", "output": "1 3" }, { "input": "4\n6 5 6 7", "output": "2 3" }, { "input": "4\n3 2 1 1", "output": "2 3" }, { "input": "4\n1 2 3 3", "output": "2 3" }, { "input": "3\n20 22 36", "output": "1 3" }, { "input": "25\n47 30 94 41 45 20 96 51 110 129 24 116 9 47 32 82 105 114 116 75 154 151 70 42 162", "output": "2 23" }, { "input": "45\n802 664 442 318 318 827 417 878 711 291 231 414 807 553 657 392 279 202 386 606 465 655 658 112 887 15 25 502 95 44 679 775 942 609 209 871 31 234 4 231 150 110 22 823 193", "output": "2 43" }, { "input": "63\n93 180 116 7 8 179 268 279 136 94 221 153 264 190 278 19 19 63 153 26 158 225 25 49 89 218 111 149 255 225 197 122 243 80 3 224 107 178 202 17 53 92 69 42 228 24 81 205 95 8 265 82 228 156 127 241 172 159 106 60 67 155 111", "output": "2 57" }, { "input": "83\n246 535 994 33 390 927 321 97 223 922 812 705 79 80 977 457 476 636 511 137 6 360 815 319 717 674 368 551 714 628 278 713 761 553 184 414 623 753 428 214 581 115 439 61 677 216 772 592 187 603 658 310 439 559 870 376 109 321 189 337 277 26 70 734 796 907 979 693 570 227 345 650 737 633 701 914 134 403 972 940 371 6 642", "output": "2 80" }, { "input": "105\n246 57 12 204 165 123 246 68 191 310 3 152 386 333 374 257 158 104 333 50 80 290 8 340 101 76 221 316 388 289 138 359 316 26 93 290 105 178 81 195 41 196 218 180 244 292 187 97 315 323 174 119 248 239 92 312 31 2 101 180 307 170 338 314 163 281 217 31 142 238 280 190 190 156 70 74 329 113 151 8 141 313 366 40 253 116 168 124 135 230 294 266 353 389 371 359 195 200 183 237 93 102 315 118 188", "output": "2 92" }, { "input": "123\n112 277 170 247 252 115 157 293 256 143 196 90 12 164 164 42 8 223 167 109 175 232 239 111 148 51 9 254 93 32 268 162 231 91 47 162 161 191 195 145 247 292 129 199 230 94 144 217 18 205 176 20 143 198 121 243 211 262 230 277 195 255 108 290 220 275 158 2 286 200 60 267 278 207 123 150 123 116 131 13 12 226 33 244 30 275 263 45 158 192 254 149 242 176 62 224 221 288 250 160 155 225 132 143 276 293 218 145 197 175 33 129 79 206 210 192 222 262 190 52 274 243 233", "output": "3 101" }, { "input": "5\n5 5 5 5 5", "output": "5 1" }, { "input": "3\n1000 1000 1000", "output": "3 1" }, { "input": "1\n1000", "output": "1 1" }, { "input": "1\n1", "output": "1 1" }, { "input": "5\n1 1000 1000 1000 1000", "output": "4 2" }, { "input": "5\n1000 1000 1000 8 7", "output": "3 3" } ]	1,585,042,225	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	124	0	t=int(input()) for tedt in range(t): c=[] a=[] arr=list(map(int, input().split())) for i in arr: if i not in a: a.append(i) if arr.count(i)>1: c.append(arr.count(i)) if len(c)>1: print(len(c),len(a)) else: print('1',len(a))	Title: Towers Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: 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. Vasya wants to construct the minimal number of towers from the bars. Help Vasya to use the bars in the best way possible. Input Specification: The first line contains an integer N (1<=≤<=N<=≤<=1000) — the number of bars at Vasya’s disposal. The second line contains N space-separated integers li — the lengths of the bars. All the lengths are natural numbers not exceeding 1000. Output Specification: In one line output two numbers — the height of the largest tower and their total number. Remember that Vasya should use all the bars. Demo Input: ['3\n1 2 3\n', '4\n6 5 6 7\n'] Demo Output: ['1 3\n', '2 3\n'] Note: none	```python t=int(input()) for tedt in range(t): c=[] a=[] arr=list(map(int, input().split())) for i in arr: if i not in a: a.append(i) if arr.count(i)>1: c.append(arr.count(i)) if len(c)>1: print(len(c),len(a)) else: print('1',len(a)) ```	-1
632	C	The Smallest String Concatenation	PROGRAMMING	1,700	[ "sortings", "strings" ]		null	null	You're given a list of n strings a1,<=a2,<=...,<=an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest. Given the list of strings, output the lexicographically smallest concatenation.	The first line contains integer n — the number of strings (1<=≤<=n<=≤<=5·104). Each of the next n lines contains one string ai (1<=≤<=\|ai\|<=≤<=50) consisting of only lowercase English letters. The sum of string lengths will not exceed 5·104.	Print the only string a — the lexicographically smallest string concatenation.	[ "4\nabba\nabacaba\nbcd\ner\n", "5\nx\nxx\nxxa\nxxaa\nxxaaa\n", "3\nc\ncb\ncba\n" ]	[ "abacabaabbabcder\n", "xxaaaxxaaxxaxxx\n", "cbacbc\n" ]	none	0	[ { "input": "4\nabba\nabacaba\nbcd\ner", "output": "abacabaabbabcder" }, { "input": "5\nx\nxx\nxxa\nxxaa\nxxaaa", "output": "xxaaaxxaaxxaxxx" }, { "input": "3\nc\ncb\ncba", "output": "cbacbc" }, { "input": "10\naba\nabaaca\naba\nacaaaabbac\nabaacac\nb\ncabbcccaab\nbaacbb\nbcab\ncc", "output": "abaabaabaacaabaacacacaaaabbacbaacbbbbcabcabbcccaabcc" }, { "input": "13\nclgknjjojyuvdtv\nclgknjjojyuvdtvzxz\nclgknjjojyuvdtvzxzxradqhm\ngvzpnckalbaubfviyhijosiixvxaydxagvymq\nclgknjjojyuvdtvjgcwarwvgilcctdiytmvmvfxxkezymt\nbvwzpuut\nclgknjjojyuvdtvjgcwarwvgilcctdiytmvmvfxxkezymth\nclgknjjojyuvdtvjgcwarwvgilcctdiytmvmvfxxkezymtlkdl\nrbwvaayhhunlvmwexvkmqbquypsnjbdkkeytthekttywypud\nqlvkfkshkxyrfefigtngifxsuhpjgkb\nlhxtkfjrrwcvzuamizotupjqckaq\nenngvhxvpaoiyhctddyscasyqtilvbvgfphayykjeoylcvmjz\nxkazwk", "output": "bvwzpuutclgknjjojyuvdtvclgknjjojyuvdtvjgcwarwvgilcctdiytmvmvfxxkezymtclgknjjojyuvdtvjgcwarwvgilcctdiytmvmvfxxkezymthclgknjjojyuvdtvjgcwarwvgilcctdiytmvmvfxxkezymtlkdlclgknjjojyuvdtvzxzclgknjjojyuvdtvzxzxradqhmenngvhxvpaoiyhctddyscasyqtilvbvgfphayykjeoylcvmjzgvzpnckalbaubfviyhijosiixvxaydxagvymqlhxtkfjrrwcvzuamizotupjqckaqqlvkfkshkxyrfefigtngifxsuhpjgkbrbwvaayhhunlvmwexvkmqbquypsnjbdkkeytthekttywypudxkazwk" } ]	1,684,799,410	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	3	46	0	import sys input = sys.stdin.readline g = [] for i in range(int(input())): s = input()[:-1] n = len(s) g.append((s.ljust(50-n, '~'), n)) g.sort() g = [i[0][:i[1]] for i in g] print(''.join(g))	Title: The Smallest String Concatenation Time Limit: None seconds Memory Limit: None megabytes Problem Description: You're given a list of n strings a1,<=a2,<=...,<=an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest. Given the list of strings, output the lexicographically smallest concatenation. Input Specification: The first line contains integer n — the number of strings (1<=≤<=n<=≤<=5·104). Each of the next n lines contains one string ai (1<=≤<=\|ai\|<=≤<=50) consisting of only lowercase English letters. The sum of string lengths will not exceed 5·104. Output Specification: Print the only string a — the lexicographically smallest string concatenation. Demo Input: ['4\nabba\nabacaba\nbcd\ner\n', '5\nx\nxx\nxxa\nxxaa\nxxaaa\n', '3\nc\ncb\ncba\n'] Demo Output: ['abacabaabbabcder\n', 'xxaaaxxaaxxaxxx\n', 'cbacbc\n'] Note: none	```python import sys input = sys.stdin.readline g = [] for i in range(int(input())): s = input()[:-1] n = len(s) g.append((s.ljust(50-n, '~'), n)) g.sort() g = [i[0][:i[1]] for i in g] print(''.join(g)) ```	0
25	A	IQ test	PROGRAMMING	1,300	[ "brute force" ]	A. IQ test	2	256	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.	The first line contains integer n (3<=≤<=n<=≤<=100) — amount of numbers in the task. The second line contains n space-separated natural numbers, not exceeding 100. It is guaranteed, that exactly one of these numbers differs from the others in evenness.	Output index of number that differs from the others in evenness. Numbers are numbered from 1 in the input order.	[ "5\n2 4 7 8 10\n", "4\n1 2 1 1\n" ]	[ "3\n", "2\n" ]	none	0	[ { "input": "5\n2 4 7 8 10", "output": "3" }, { "input": "4\n1 2 1 1", "output": "2" }, { "input": "3\n1 2 2", "output": "1" }, { "input": "3\n100 99 100", "output": "2" }, { "input": "3\n5 3 2", "output": "3" }, { "input": "4\n43 28 1 91", "output": "2" }, { "input": "4\n75 13 94 77", "output": "3" }, { "input": "4\n97 8 27 3", "output": "2" }, { "input": "10\n95 51 12 91 85 3 1 31 25 7", "output": "3" }, { "input": "20\n88 96 66 51 14 88 2 92 18 72 18 88 20 30 4 82 90 100 24 46", "output": "4" }, { "input": "30\n20 94 56 50 10 98 52 32 14 22 24 60 4 8 98 46 34 68 82 82 98 90 50 20 78 49 52 94 64 36", "output": "26" }, { "input": "50\n79 27 77 57 37 45 27 49 65 33 57 21 71 19 75 85 65 61 23 97 85 9 23 1 9 3 99 77 77 21 79 69 15 37 15 7 93 81 13 89 91 31 45 93 15 97 55 80 85 83", "output": "48" }, { "input": "60\n46 11 73 65 3 69 3 53 43 53 97 47 55 93 31 75 35 3 9 73 23 31 3 81 91 79 61 21 15 11 11 11 81 7 83 75 39 87 83 59 89 55 93 27 49 67 67 29 1 93 11 17 9 19 35 21 63 31 31 25", "output": "1" }, { "input": "70\n28 42 42 92 64 54 22 38 38 78 62 38 4 38 14 66 4 92 66 58 94 26 4 44 41 88 48 82 44 26 74 44 48 4 16 92 34 38 26 64 94 4 30 78 50 54 12 90 8 16 80 98 28 100 74 50 36 42 92 18 76 98 8 22 2 50 58 50 64 46", "output": "25" }, { "input": "100\n43 35 79 53 13 91 91 45 65 83 57 9 42 39 85 45 71 51 61 59 31 13 63 39 25 21 79 39 91 67 21 61 97 75 93 83 29 79 59 97 11 37 63 51 39 55 91 23 21 17 47 23 35 75 49 5 69 99 5 7 41 17 25 89 15 79 21 63 53 81 43 91 59 91 69 99 85 15 91 51 49 37 65 7 89 81 21 93 61 63 97 93 45 17 13 69 57 25 75 73", "output": "13" }, { "input": "100\n50 24 68 60 70 30 52 22 18 74 68 98 20 82 4 46 26 68 100 78 84 58 74 98 38 88 68 86 64 80 82 100 20 22 98 98 52 6 94 10 48 68 2 18 38 22 22 82 44 20 66 72 36 58 64 6 36 60 4 96 76 64 12 90 10 58 64 60 74 28 90 26 24 60 40 58 2 16 76 48 58 36 82 60 24 44 4 78 28 38 8 12 40 16 38 6 66 24 31 76", "output": "99" }, { "input": "100\n47 48 94 48 14 18 94 36 96 22 12 30 94 20 48 98 40 58 2 94 8 36 98 18 98 68 2 60 76 38 18 100 8 72 100 68 2 86 92 72 58 16 48 14 6 58 72 76 6 88 80 66 20 28 74 62 86 68 90 86 2 56 34 38 56 90 4 8 76 44 32 86 12 98 38 34 54 92 70 94 10 24 82 66 90 58 62 2 32 58 100 22 58 72 2 22 68 72 42 14", "output": "1" }, { "input": "99\n38 20 68 60 84 16 28 88 60 48 80 28 4 92 70 60 46 46 20 34 12 100 76 2 40 10 8 86 6 80 50 66 12 34 14 28 26 70 46 64 34 96 10 90 98 96 56 88 50 74 70 94 2 94 24 66 68 46 22 30 6 10 64 32 88 14 98 100 64 58 50 18 50 50 8 38 8 16 54 2 60 54 62 84 92 98 4 72 66 26 14 88 99 16 10 6 88 56 22", "output": "93" }, { "input": "99\n50 83 43 89 53 47 69 1 5 37 63 87 95 15 55 95 75 89 33 53 89 75 93 75 11 85 49 29 11 97 49 67 87 11 25 37 97 73 67 49 87 43 53 97 43 29 53 33 45 91 37 73 39 49 59 5 21 43 87 35 5 63 89 57 63 47 29 99 19 85 13 13 3 13 43 19 5 9 61 51 51 57 15 89 13 97 41 13 99 79 13 27 97 95 73 33 99 27 23", "output": "1" }, { "input": "98\n61 56 44 30 58 14 20 24 88 28 46 56 96 52 58 42 94 50 46 30 46 80 72 88 68 16 6 60 26 90 10 98 76 20 56 40 30 16 96 20 88 32 62 30 74 58 36 76 60 4 24 36 42 54 24 92 28 14 2 74 86 90 14 52 34 82 40 76 8 64 2 56 10 8 78 16 70 86 70 42 70 74 22 18 76 98 88 28 62 70 36 72 20 68 34 48 80 98", "output": "1" }, { "input": "98\n66 26 46 42 78 32 76 42 26 82 8 12 4 10 24 26 64 44 100 46 94 64 30 18 88 28 8 66 30 82 82 28 74 52 62 80 80 60 94 86 64 32 44 88 92 20 12 74 94 28 34 58 4 22 16 10 94 76 82 58 40 66 22 6 30 32 92 54 16 76 74 98 18 48 48 30 92 2 16 42 84 74 30 60 64 52 50 26 16 86 58 96 79 60 20 62 82 94", "output": "93" }, { "input": "95\n9 31 27 93 17 77 75 9 9 53 89 39 51 99 5 1 11 39 27 49 91 17 27 79 81 71 37 75 35 13 93 4 99 55 85 11 23 57 5 43 5 61 15 35 23 91 3 81 99 85 43 37 39 27 5 67 7 33 75 59 13 71 51 27 15 93 51 63 91 53 43 99 25 47 17 71 81 15 53 31 59 83 41 23 73 25 91 91 13 17 25 13 55 57 29", "output": "32" }, { "input": "100\n91 89 81 45 53 1 41 3 77 93 55 97 55 97 87 27 69 95 73 41 93 21 75 35 53 56 5 51 87 59 91 67 33 3 99 45 83 17 97 47 75 97 7 89 17 99 23 23 81 25 55 97 27 35 69 5 77 35 93 19 55 59 37 21 31 37 49 41 91 53 73 69 7 37 37 39 17 71 7 97 55 17 47 23 15 73 31 39 57 37 9 5 61 41 65 57 77 79 35 47", "output": "26" }, { "input": "99\n38 56 58 98 80 54 26 90 14 16 78 92 52 74 40 30 84 14 44 80 16 90 98 68 26 24 78 72 42 16 84 40 14 44 2 52 50 2 12 96 58 66 8 80 44 52 34 34 72 98 74 4 66 74 56 21 8 38 76 40 10 22 48 32 98 34 12 62 80 68 64 82 22 78 58 74 20 22 48 56 12 38 32 72 6 16 74 24 94 84 26 38 18 24 76 78 98 94 72", "output": "56" }, { "input": "100\n44 40 6 40 56 90 98 8 36 64 76 86 98 76 36 92 6 30 98 70 24 98 96 60 24 82 88 68 86 96 34 42 58 10 40 26 56 10 88 58 70 32 24 28 14 82 52 12 62 36 70 60 52 34 74 30 78 76 10 16 42 94 66 90 70 38 52 12 58 22 98 96 14 68 24 70 4 30 84 98 8 50 14 52 66 34 100 10 28 100 56 48 38 12 38 14 91 80 70 86", "output": "97" }, { "input": "100\n96 62 64 20 90 46 56 90 68 36 30 56 70 28 16 64 94 34 6 32 34 50 94 22 90 32 40 2 72 10 88 38 28 92 20 26 56 80 4 100 100 90 16 74 74 84 8 2 30 20 80 32 16 46 92 56 42 12 96 64 64 42 64 58 50 42 74 28 2 4 36 32 70 50 54 92 70 16 45 76 28 16 18 50 48 2 62 94 4 12 52 52 4 100 70 60 82 62 98 42", "output": "79" }, { "input": "99\n14 26 34 68 90 58 50 36 8 16 18 6 2 74 54 20 36 84 32 50 52 2 26 24 3 64 20 10 54 26 66 44 28 72 4 96 78 90 96 86 68 28 94 4 12 46 100 32 22 36 84 32 44 94 76 94 4 52 12 30 74 4 34 64 58 72 44 16 70 56 54 8 14 74 8 6 58 62 98 54 14 40 80 20 36 72 28 98 20 58 40 52 90 64 22 48 54 70 52", "output": "25" }, { "input": "95\n82 86 30 78 6 46 80 66 74 72 16 24 18 52 52 38 60 36 86 26 62 28 22 46 96 26 94 84 20 46 66 88 76 32 12 86 74 18 34 88 4 48 94 6 58 6 100 82 4 24 88 32 54 98 34 48 6 76 42 88 42 28 100 4 22 2 10 66 82 54 98 20 60 66 38 98 32 47 86 58 6 100 12 46 2 42 8 84 78 28 24 70 34 28 86", "output": "78" }, { "input": "90\n40 50 8 42 76 24 58 42 26 68 20 48 54 12 34 84 14 36 32 88 6 50 96 56 20 92 48 16 40 34 96 46 20 84 30 50 20 98 8 44 96 42 8 76 70 38 84 30 40 88 84 72 2 22 52 58 16 62 100 66 80 40 50 32 14 62 88 72 22 99 76 50 84 82 8 82 98 46 26 40 2 98 18 78 30 72 70 18 34 68", "output": "70" }, { "input": "80\n81 43 87 1 55 43 53 61 27 19 43 13 89 9 33 83 75 55 97 71 91 37 95 5 21 69 81 93 95 69 31 83 55 7 97 7 79 57 8 61 27 85 49 1 15 97 63 79 29 73 41 85 5 41 31 93 67 11 63 59 15 99 91 77 43 69 23 23 81 73 19 1 67 51 1 75 99 67 3 81", "output": "39" }, { "input": "98\n13 83 61 27 35 1 85 95 97 73 95 65 73 45 5 43 27 83 91 19 11 3 85 59 9 39 69 23 45 7 51 85 5 71 5 95 1 51 75 3 43 57 3 11 33 71 21 99 47 41 87 39 71 87 31 85 91 49 83 5 49 85 47 91 55 99 33 23 31 23 23 73 29 77 55 31 25 5 81 49 91 15 15 39 87 5 9 40 69 47 29 33 11 21 49 79 51 83", "output": "88" }, { "input": "3\n100 100 1", "output": "3" } ]	1,568,567,960	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	216	0	num = int(input()) x = list(map(int,input().strip().split()))[:num] for i in range(num-1): if x[i] % 2 == 0 and x[i+1] % 2 != 0: print(i+2) break elif x[i] % 2 == 1 and x[i+1] % 2 != 1: print(i+2) break	Title: IQ test Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: 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 Specification: The first line contains integer n (3<=≤<=n<=≤<=100) — amount of numbers in the task. The second line contains n space-separated natural numbers, not exceeding 100. It is guaranteed, that exactly one of these numbers differs from the others in evenness. Output Specification: Output index of number that differs from the others in evenness. Numbers are numbered from 1 in the input order. Demo Input: ['5\n2 4 7 8 10\n', '4\n1 2 1 1\n'] Demo Output: ['3\n', '2\n'] Note: none	```python num = int(input()) x = list(map(int,input().strip().split()))[:num] for i in range(num-1): if x[i] % 2 == 0 and x[i+1] % 2 != 0: print(i+2) break elif x[i] % 2 == 1 and x[i+1] % 2 != 1: print(i+2) break ```	0
0	none	none	none	0	[ "none" ]		null	null	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}$. Find out the non-negative remainder of division of $\sum \limits_{i=0}^{n} s_{i} a^{n - i} b^{i}$ by $10^{9} + 9$. Note that the modulo is unusual!	The first line contains four integers $n, a, b$ and $k$ $(1 \leq n \leq 10^{9}, 1 \leq a, b \leq 10^{9}, 1 \leq k \leq 10^{5})$. The second line contains a sequence of length $k$ consisting of characters '+' and '-'. If the $i$-th character (0-indexed) is '+', then $s_{i} = 1$, otherwise $s_{i} = -1$. Note that only the first $k$ members of the sequence are given, the rest can be obtained using the periodicity property.	Output a single integer — value of given expression modulo $10^{9} + 9$.	[ "2 2 3 3\n+-+\n", "4 1 5 1\n-\n" ]	[ "7\n", "999999228\n" ]	In the first example: $(\sum \limits_{i=0}^{n} s_{i} a^{n - i} b^{i})$ = $2^{2} 3^{0} - 2^{1} 3^{1} + 2^{0} 3^{2}$ = 7 In the second example: $(\sum \limits_{i=0}^{n} s_{i} a^{n - i} b^{i}) = -1^{4} 5^{0} - 1^{3} 5^{1} - 1^{2} 5^{2} - 1^{1} 5^{3} - 1^{0} 5^{4} = -781 \equiv 999999228 \pmod{10^{9} + 9}$.	0	[ { "input": "2 2 3 3\n+-+", "output": "7" }, { "input": "4 1 5 1\n-", "output": "999999228" }, { "input": "1 1 4 2\n-+", "output": "3" }, { "input": "3 1 4 4\n+--+", "output": "45" }, { "input": "5 1 1 6\n++---+", "output": "0" }, { "input": "5 2 2 6\n+--++-", "output": "0" }, { "input": "686653196 115381398 884618610 3\n+-+", "output": "542231211" }, { "input": "608663287 430477711 172252358 8\n-+--+-+-", "output": "594681696" }, { "input": "904132655 827386249 118827660 334\n+++-+++++--+++----+-+-+-+-+--+-+---++--++--++--+-+-+++-+++--+-+-+----+-+-++++-----+--++++------+++-+-+-++-++++++++-+-++-+++--+--++------+--+-+++--++--+---++-++-+-+-++---++-++--+-+-++-+------+-+----+++-+++--+-+-+--+--+--+------+--+---+--+-++--+++---+-+-++--------+-++--++-+-+-+-+-+-+--+-++++-+++--+--++----+--+-++-++--+--+-+-++-+-++++-", "output": "188208979" }, { "input": "234179195 430477711 115381398 12\n++++-+-+-+++", "output": "549793323" }, { "input": "75952547 967294208 907708706 252\n++--++--+++-+-+--++--++++++---+++-++-+-----++++--++-+-++------+-+-+-++-+-+-++++------++---+-++++---+-+-++++--++++++--+-+++-++--+--+---++++---+-+++-+++--+-+--+++++---+--++-++++--++++-+-++-+++-++-----+-+++++----++--+++-+-+++++-+--++-++-+--+-++++--+-+-+-+", "output": "605712499" }, { "input": "74709071 801809249 753674746 18\n++++++-+-+---+-+--", "output": "13414893" }, { "input": "743329 973758 92942 82\n++----+-++++----+--+++---+--++++-+-+---+++++--+--+++++++--++-+++----+--+++++-+--+-", "output": "299311566" }, { "input": "18111 291387 518587 2\n++", "output": "724471355" }, { "input": "996144 218286 837447 1\n-", "output": "549104837" }, { "input": "179358 828426 548710 67\n++++---+--++----+-+-++++----+--+---+------++-+-++++--+----+---+-+--", "output": "759716474" }, { "input": "397521 174985 279760 1\n+", "output": "25679493" }, { "input": "613632 812232 482342 1\n-", "output": "891965141" }, { "input": "936810 183454 647048 1\n+", "output": "523548992" }, { "input": "231531 250371 921383 28\n++-+------+--+--++++--+-+++-", "output": "134450934" }, { "input": "947301 87242 360762 97\n--+++--+++-++--++-++--++--+++---+++--++++--+++++--+-++-++-----+-++-+--++-----+-++-+--++-++-+-----", "output": "405016159" }, { "input": "425583346 814209084 570987274 1\n+", "output": "63271171" }, { "input": "354062556 688076879 786825319 1\n+", "output": "545304776" }, { "input": "206671954 13571766 192250278 1\n+", "output": "717117421" }, { "input": "23047921 621656196 160244047 1\n-", "output": "101533009" }, { "input": "806038018 740585177 987616107 293\n-+++++--++++---++-+--+-+---+-++++--+--+++--++---++++++++--+++++-+-++-+--+----+--+++-+-++-+++-+-+-+----------++-+-+++++++-+-+-+-++---+++-+-+-------+-+-++--++-++-++-++-+---+--++-++--+++--+++-+-+----++--+-+-++-+---+---+-+-+++------+-+++-+---++-+--+++----+++++---++-++--+----+++-+--+++-+------+-++", "output": "441468166" }, { "input": "262060935 184120408 148332034 148\n+--+-------+-+-+--++-+++--++-+-++++++--++-+++-+++--+-------+-+--+++-+-+-+---++-++-+-++---+--+-+-+--+------+++--+--+-+-+---+---+-+-++++---+++--+++---", "output": "700325386" }, { "input": "919350941 654611542 217223605 186\n++-++-+++++-+++--+---+++++++-++-+----+-++--+-++--++--+++-+++---+--+--++-+-+++-+-+++-++---+--+++-+-+++--+-+-------+-++------++---+-+---++-++-++---+-+--+-+--+++++---+--+--++++-++-++--+--++", "output": "116291420" }, { "input": "289455627 906207104 512692624 154\n-------++--+++---++-++------++----------+--+++-+-+++---+---+++--++++++--+-+-+--+---+-+-++-++--+-++--++++---+-+---+-----+--+-+---------+++-++---++-+-+-----", "output": "48198216" }, { "input": "258833760 515657142 791267045 1\n-", "output": "935800888" }, { "input": "691617927 66917103 843055237 8\n--+++---", "output": "147768186" }, { "input": "379582849 362892355 986900829 50\n++-++---+-+++++--++++--+--++--++-----+------++--+-", "output": "927469713" }, { "input": "176799169 363368399 841293419 1\n+", "output": "746494802" }, { "input": "144808247 203038656 166324035 4\n-+-+", "output": "909066471" }, { "input": "477607531 177367565 20080950 2\n++", "output": "928662830" }, { "input": "682074525 289438443 917164266 1\n+", "output": "28048785" }, { "input": "938449224 59852396 219719125 1\n-", "output": "648647459" }, { "input": "395171426 872478622 193568600 147\n+---++---+-+--+++++--+---+-++++-+-++---++++--+--+-+-++-+-++--------++---+++-+---++---+---+-+--+-++++-+++-+-+-++-+--+++-++-+-+-+-++++++-+---+---++--", "output": "460881399" }, { "input": "403493428 317461491 556701240 1\n-", "output": "936516261" }, { "input": "917751169 330191895 532837377 70\n-+-+++++++--++---++-+++++-+++-----+-+++---+--+-+-++-++-+-+-++-++-+----", "output": "908035409" }, { "input": "252089413 552678586 938424519 1\n-", "output": "627032736" }, { "input": "649316142 320010793 200197645 1\n-", "output": "323650777" }, { "input": "116399299 784781190 299072480 5\n++++-", "output": "754650814" } ]	1,524,040,499	5,999	Python 3	TIME_LIMIT_EXCEEDED	TESTS	9	1,000	7,065,600	n, a, b, k = map(int, input().split()) s = input() m = int(1e9 + 9) a_1 = pow(a, m-2, m) x = (a_1 * b) % m xk = pow(x, k, m) C = 0 for i in range(0, k): z = 1 if s[i] == "+" else -1 C = (C + z * pow(x, i, m)) % m D = 0 for i in range(0, (n + 1)//k): D = (D + pow(xk, i, m)) % m ans = pow(a, n, m) * C * D ans %= m print(ans)	Title: none Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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}$. Find out the non-negative remainder of division of $\sum \limits_{i=0}^{n} s_{i} a^{n - i} b^{i}$ by $10^{9} + 9$. Note that the modulo is unusual! Input Specification: The first line contains four integers $n, a, b$ and $k$ $(1 \leq n \leq 10^{9}, 1 \leq a, b \leq 10^{9}, 1 \leq k \leq 10^{5})$. The second line contains a sequence of length $k$ consisting of characters '+' and '-'. If the $i$-th character (0-indexed) is '+', then $s_{i} = 1$, otherwise $s_{i} = -1$. Note that only the first $k$ members of the sequence are given, the rest can be obtained using the periodicity property. Output Specification: Output a single integer — value of given expression modulo $10^{9} + 9$. Demo Input: ['2 2 3 3\n+-+\n', '4 1 5 1\n-\n'] Demo Output: ['7\n', '999999228\n'] Note: In the first example: $(\sum \limits_{i=0}^{n} s_{i} a^{n - i} b^{i})$ = $2^{2} 3^{0} - 2^{1} 3^{1} + 2^{0} 3^{2}$ = 7 In the second example: $(\sum \limits_{i=0}^{n} s_{i} a^{n - i} b^{i}) = -1^{4} 5^{0} - 1^{3} 5^{1} - 1^{2} 5^{2} - 1^{1} 5^{3} - 1^{0} 5^{4} = -781 \equiv 999999228 \pmod{10^{9} + 9}$.	```python n, a, b, k = map(int, input().split()) s = input() m = int(1e9 + 9) a_1 = pow(a, m-2, m) x = (a_1 * b) % m xk = pow(x, k, m) C = 0 for i in range(0, k): z = 1 if s[i] == "+" else -1 C = (C + z * pow(x, i, m)) % m D = 0 for i in range(0, (n + 1)//k): D = (D + pow(xk, i, m)) % m ans = pow(a, n, m) * C * D ans %= m print(ans) ```	0
113	A	Grammar Lessons	PROGRAMMING	1,600	[ "implementation", "strings" ]	A. Grammar Lessons	5	256	Petya got interested in grammar on his third year in school. He invented his own language called Petya's. Petya wanted to create a maximally simple language that would be enough to chat with friends, that's why all the language's grammar can be described with the following set of rules: - There are three parts of speech: the adjective, the noun, the verb. Each word in his language is an adjective, noun or verb. - There are two genders: masculine and feminine. Each word in his language has gender either masculine or feminine. - Masculine adjectives end with -lios, and feminine adjectives end with -liala. - Masculine nouns end with -etr, and feminime nouns end with -etra. - Masculine verbs end with -initis, and feminime verbs end with -inites. - Thus, each word in the Petya's language has one of the six endings, given above. There are no other endings in Petya's language. - It is accepted that the whole word consists of an ending. That is, words "lios", "liala", "etr" and so on belong to the Petya's language. - There aren't any punctuation marks, grammatical tenses, singular/plural forms or other language complications. - A sentence is either exactly one valid language word or exactly one statement. Statement is any sequence of the Petya's language, that satisfy both conditions: - Words in statement follow in the following order (from the left to the right): zero or more adjectives followed by exactly one noun followed by zero or more verbs. - All words in the statement should have the same gender. After Petya's friend Vasya wrote instant messenger (an instant messaging program) that supported the Petya's language, Petya wanted to add spelling and grammar checking to the program. As Vasya was in the country and Petya didn't feel like waiting, he asked you to help him with this problem. Your task is to define by a given sequence of words, whether it is true that the given text represents exactly one sentence in Petya's language.	The first line contains one or more words consisting of lowercase Latin letters. The overall number of characters (including letters and spaces) does not exceed 105. It is guaranteed that any two consecutive words are separated by exactly one space and the input data do not contain any other spaces. It is possible that given words do not belong to the Petya's language.	If some word of the given text does not belong to the Petya's language or if the text contains more that one sentence, print "NO" (without the quotes). Otherwise, print "YES" (without the quotes).	[ "petr\n", "etis atis animatis etis atis amatis\n", "nataliala kataliala vetra feinites\n" ]	[ "YES\n", "NO\n", "YES\n" ]	none	500	[ { "input": "petr", "output": "YES" }, { "input": "etis atis animatis etis atis amatis", "output": "NO" }, { "input": "nataliala kataliala vetra feinites", "output": "YES" }, { "input": "qweasbvflios", "output": "YES" }, { "input": "lios lios petr initis qwe", "output": "NO" }, { "input": "lios initis", "output": "NO" }, { "input": "petr initis lios", "output": "NO" }, { "input": "petra petra petra", "output": "NO" }, { "input": "in", "output": "NO" }, { "input": "liala petra initis", "output": "NO" }, { "input": "liala petra inites", "output": "YES" }, { "input": "liala initis", "output": "NO" }, { "input": "liala petra petr inites", "output": "NO" }, { "input": "liala petr inites", "output": "NO" }, { "input": "llilitos", "output": "NO" }, { "input": "umeszdawsvgkjhlqwzentsphxqhdungbylhnikwviuhccbstghhxlmvcjznnkjqkugsdysjbedwpmsmxmgxlrlxctnebtbwrsvgjktkrosffwymovxvsgfmmqwfflpvbumozikroxrdgwjrnstngstxbiyyuxehrhviteptedlmyetr", "output": "YES" }, { "input": "i i i i i i i i i i i i i i i a a a a a a v v v v v v v v v v v", "output": "NO" }, { "input": "fbvzqonvdlqdanwliolaqfj sbauorbinites xkbfnfinitespjy phbexglblzpobtqpisyijycmtliola aosinites lbpjiwcjoqyuhglthloiniteswb mjtxhoofohzzgefvhsywojcuxtetxmojrlktodhbgyrkeejgjzxkzyvrxwmyaqkeoqnvusnlrsfffrzeoqjdfumolhksqkrtzwhnforgpenziokrxlnhcapbbupctlmuetrani pigxerwetupjbkvlmgnjhdfjliolanz tqhaidxbqmdaeincxjuliola", "output": "NO" }, { "input": "mfrmqetr", "output": "YES" }, { "input": "hnwvfllholxfialiola cknjtxpliola daliola gqfapnhmmworliola qhetra qrisbexsrefcwzoxqwxrevinites wwldqkqhvrgwplqinites nqdpoauitczttxoinites fgbmdfpxkhahkinites", "output": "NO" }, { "input": "kcymcpgqdxkudadewddualeemhixhsdazudnjdmuvxvrlrbrpsdpxpagmrogplltnifrtomdtahxwadguvetxaqkvsvnoyhowirnluhmyewzapirnpfdisvhtbenxmfezahqoflkjrfqjubwdfktnpeirodwubftzlcczzavfiooihzvnqincndisudihvbcaxptrwovekmhiiwsgzgbxydvuldlnktxtltrlajjzietkxbnhetra", "output": "YES" }, { "input": "dosiydnwxemojaavfdvlwsyhzqywqjutovygtlcleklhybczhjqfzxwdmlwqwcqqyfjkzhsizlmdarrfronxqkcknwpkvhdlgatdyjisjoopvngpjggldxjfxaauoxmqirkuphydyweoixftstlozaoywnxgriscudwlokncbmaebpssccmmmfjennyjaryqlzjknnklqketra", "output": "YES" }, { "input": "etretra linites", "output": "YES" }, { "input": "petretra petr", "output": "NO" }, { "input": "lialalios petraveryfunnypetr", "output": "YES" }, { "input": "petropetrapetr petra", "output": "NO" }, { "input": "lios petrnonono", "output": "NO" }, { "input": "lios petr initisandinitisandliala petrainitis", "output": "NO" }, { "input": "petro", "output": "NO" }, { "input": "petr initesinitis", "output": "YES" }, { "input": "lios initis", "output": "NO" }, { "input": "liala initespetra", "output": "YES" }, { "input": "lios petrapetr", "output": "YES" }, { "input": "initis petr", "output": "NO" }, { "input": "lioslialapetrpetrainitisinitesliosliala initesinitislioslialapetrpetrainitisinitetra", "output": "YES" }, { "input": "veryfunnyprefixpetr", "output": "YES" }, { "input": "veryfunnyprefixpetra", "output": "YES" }, { "input": "veryfunnyprefixinitis", "output": "YES" }, { "input": "veryfunnyprefixinites", "output": "YES" }, { "input": "veryfunnyprefixliala", "output": "YES" }, { "input": "veryfunnyprefixlios", "output": "YES" }, { "input": "veryfunnyprefixlialas", "output": "NO" }, { "input": "veryfunnyprefixliala veryfunnyprefixpetretra", "output": "YES" }, { "input": "veryfunnyprefixlios veryfunnyprefixinitisetr", "output": "YES" }, { "input": "veryfunnyprefixlios aabbinitis", "output": "NO" }, { "input": "veryfunnyprefixlios inites", "output": "NO" }, { "input": "lios petr initis", "output": "YES" }, { "input": "liala etra inites", "output": "YES" }, { "input": "lios", "output": "YES" }, { "input": "liala", "output": "YES" }, { "input": "initis", "output": "YES" }, { "input": "inites", "output": "YES" }, { "input": "tes", "output": "NO" }, { "input": "tr", "output": "NO" }, { "input": "a", "output": "NO" }, { "input": "lios lios", "output": "NO" }, { "input": "lios", "output": "YES" }, { "input": "liala", "output": "YES" }, { "input": "petr", "output": "YES" }, { "input": "petra", "output": "YES" }, { "input": "pinitis", "output": "YES" }, { "input": "pinites", "output": "YES" }, { "input": "plios pliala", "output": "NO" }, { "input": "plios petr", "output": "YES" }, { "input": "plios petra", "output": "NO" }, { "input": "plios plios", "output": "NO" }, { "input": "plios initis", "output": "NO" }, { "input": "plios pinites", "output": "NO" }, { "input": "pliala plios", "output": "NO" }, { "input": "pliala ppliala", "output": "NO" }, { "input": "pliala petr", "output": "NO" }, { "input": "pliala petra", "output": "YES" }, { "input": "pliala pinitis", "output": "NO" }, { "input": "pliala pinites", "output": "NO" }, { "input": "petr plios", "output": "NO" }, { "input": "petr pliala", "output": "NO" }, { "input": "petr petr", "output": "NO" }, { "input": "petr petra", "output": "NO" }, { "input": "petr pinitis", "output": "YES" }, { "input": "petr pinites", "output": "NO" }, { "input": "petra lios", "output": "NO" }, { "input": "petra liala", "output": "NO" }, { "input": "petra petr", "output": "NO" }, { "input": "petra petra", "output": "NO" }, { "input": "petra initis", "output": "NO" }, { "input": "petra inites", "output": "YES" }, { "input": "initis lios", "output": "NO" }, { "input": "initis liala", "output": "NO" }, { "input": "initis petr", "output": "NO" }, { "input": "initis petra", "output": "NO" }, { "input": "initis initis", "output": "NO" }, { "input": "initis inites", "output": "NO" }, { "input": "inites lios", "output": "NO" }, { "input": "inites liala", "output": "NO" }, { "input": "inites petr", "output": "NO" }, { "input": "inites petra", "output": "NO" }, { "input": "inites initis", "output": "NO" }, { "input": "inites inites", "output": "NO" }, { "input": "lios lios lios", "output": "NO" }, { "input": "lios lios liala", "output": "NO" }, { "input": "lios lios etr", "output": "YES" }, { "input": "lios lios etra", "output": "NO" }, { "input": "lios lios initis", "output": "NO" }, { "input": "lios lios inites", "output": "NO" }, { "input": "lios liala lios", "output": "NO" }, { "input": "lios liala liala", "output": "NO" }, { "input": "lios liala etr", "output": "NO" }, { "input": "lios liala etra", "output": "NO" }, { "input": "lios liala initis", "output": "NO" }, { "input": "lios liala inites", "output": "NO" }, { "input": "lios etr lios", "output": "NO" }, { "input": "lios etr liala", "output": "NO" }, { "input": "lios etr etr", "output": "NO" }, { "input": "lios etr etra", "output": "NO" }, { "input": "lios etr initis", "output": "YES" }, { "input": "lios etr inites", "output": "NO" }, { "input": "lios etra lios", "output": "NO" }, { "input": "lios etra liala", "output": "NO" }, { "input": "lios etra etr", "output": "NO" }, { "input": "lios etra etra", "output": "NO" }, { "input": "lios etra initis", "output": "NO" }, { "input": "lios etra inites", "output": "NO" }, { "input": "lios initis lios", "output": "NO" }, { "input": "lios initis liala", "output": "NO" }, { "input": "lios initis etr", "output": "NO" }, { "input": "lios initis etra", "output": "NO" }, { "input": "lios initis initis", "output": "NO" }, { "input": "lios initis inites", "output": "NO" }, { "input": "lios inites lios", "output": "NO" }, { "input": "lios inites liala", "output": "NO" }, { "input": "lios inites etr", "output": "NO" }, { "input": "lios inites etra", "output": "NO" }, { "input": "lios inites initis", "output": "NO" }, { "input": "lios inites inites", "output": "NO" }, { "input": "liala lios lios", "output": "NO" }, { "input": "liala lios liala", "output": "NO" }, { "input": "liala lios etr", "output": "NO" }, { "input": "liala lios etra", "output": "NO" }, { "input": "liala lios initis", "output": "NO" }, { "input": "liala lios inites", "output": "NO" }, { "input": "liala liala lios", "output": "NO" }, { "input": "liala liala liala", "output": "NO" }, { "input": "liala liala etr", "output": "NO" }, { "input": "liala liala etra", "output": "YES" }, { "input": "liala liala initis", "output": "NO" }, { "input": "liala liala inites", "output": "NO" }, { "input": "liala etr lios", "output": "NO" }, { "input": "liala etr liala", "output": "NO" }, { "input": "liala etr etr", "output": "NO" }, { "input": "liala etr etra", "output": "NO" }, { "input": "liala etr initis", "output": "NO" }, { "input": "liala etr inites", "output": "NO" }, { "input": "liala etra lios", "output": "NO" }, { "input": "liala etra liala", "output": "NO" }, { "input": "liala etra etr", "output": "NO" }, { "input": "liala etra etra", "output": "NO" }, { "input": "liala etra initis", "output": "NO" }, { "input": "liala etra inites", "output": "YES" }, { "input": "liala initis lios", "output": "NO" }, { "input": "liala initis liala", "output": "NO" }, { "input": "liala initis etr", "output": "NO" }, { "input": "liala initis etra", "output": "NO" }, { "input": "liala initis initis", "output": "NO" }, { "input": "liala initis inites", "output": "NO" }, { "input": "liala inites lios", "output": "NO" }, { "input": "liala inites liala", "output": "NO" }, { "input": "liala inites etr", "output": "NO" }, { "input": "liala inites etra", "output": "NO" }, { "input": "liala inites initis", "output": "NO" }, { "input": "liala inites inites", "output": "NO" }, { "input": "etr lios lios", "output": "NO" }, { "input": "etr lios liala", "output": "NO" }, { "input": "etr lios etr", "output": "NO" }, { "input": "etr lios etra", "output": "NO" }, { "input": "etr lios initis", "output": "NO" }, { "input": "etr lios inites", "output": "NO" }, { "input": "etr liala lios", "output": "NO" }, { "input": "etr liala liala", "output": "NO" }, { "input": "etr liala etr", "output": "NO" }, { "input": "etr liala etra", "output": "NO" }, { "input": "etr liala initis", "output": "NO" }, { "input": "etr liala inites", "output": "NO" }, { "input": "etr etr lios", "output": "NO" }, { "input": "etr etr liala", "output": "NO" }, { "input": "etr etr etr", "output": "NO" }, { "input": "etr etr etra", "output": "NO" }, { "input": "etr etr initis", "output": "NO" }, { "input": "etr etr inites", "output": "NO" }, { "input": "etr etra lios", "output": "NO" }, { "input": "etr etra liala", "output": "NO" }, { "input": "etr etra etr", "output": "NO" }, { "input": "etr etra etra", "output": "NO" }, { "input": "etr etra initis", "output": "NO" }, { "input": "etr etra inites", "output": "NO" }, { "input": "etr initis lios", "output": "NO" }, { "input": "etr initis liala", "output": "NO" }, { "input": "etr initis etr", "output": "NO" }, { "input": "etr initis etra", "output": "NO" }, { "input": "etr initis initis", "output": "YES" }, { "input": "etr initis inites", "output": "NO" }, { "input": "etr inites lios", "output": "NO" }, { "input": "etr inites liala", "output": "NO" }, { "input": "etr inites etr", "output": "NO" }, { "input": "etr inites etra", "output": "NO" }, { "input": "etr inites initis", "output": "NO" }, { "input": "etr inites inites", "output": "NO" }, { "input": "etra lios lios", "output": "NO" }, { "input": "etra lios liala", "output": "NO" }, { "input": "etra lios etr", "output": "NO" }, { "input": "etra lios etra", "output": "NO" }, { "input": "etra lios initis", "output": "NO" }, { "input": "etra lios inites", "output": "NO" }, { "input": "etra liala lios", "output": "NO" }, { "input": "etra liala liala", "output": "NO" }, { "input": "etra liala etr", "output": "NO" }, { "input": "etra liala etra", "output": "NO" }, { "input": "etra liala initis", "output": "NO" }, { "input": "etra liala inites", "output": "NO" }, { "input": "etra etr lios", "output": "NO" }, { "input": "etra etr liala", "output": "NO" }, { "input": "etra etr etr", "output": "NO" }, { "input": "etra etr etra", "output": "NO" }, { "input": "etra etr initis", "output": "NO" }, { "input": "etra etr inites", "output": "NO" }, { "input": "etra etra lios", "output": "NO" }, { "input": "etra etra liala", "output": "NO" }, { "input": "etra etra etr", "output": "NO" }, { "input": "etra etra etra", "output": "NO" }, { "input": "etra etra initis", "output": "NO" }, { "input": "etra etra inites", "output": "NO" }, { "input": "etra initis lios", "output": "NO" }, { "input": "etra initis liala", "output": "NO" }, { "input": "etra initis etr", "output": "NO" }, { "input": "etra initis etra", "output": "NO" }, { "input": "etra initis initis", "output": "NO" }, { "input": "etra initis inites", "output": "NO" }, { "input": "etra inites lios", "output": "NO" }, { "input": "etra inites liala", "output": "NO" }, { "input": "etra inites etr", "output": "NO" }, { "input": "etra inites etra", "output": "NO" }, { "input": "etra inites initis", "output": "NO" }, { "input": "etra inites inites", "output": "YES" }, { "input": "initis lios lios", "output": "NO" }, { "input": "initis lios liala", "output": "NO" }, { "input": "initis lios etr", "output": "NO" }, { "input": "initis lios etra", "output": "NO" }, { "input": "initis lios initis", "output": "NO" }, { "input": "initis lios inites", "output": "NO" }, { "input": "initis liala lios", "output": "NO" }, { "input": "initis liala liala", "output": "NO" }, { "input": "initis liala etr", "output": "NO" }, { "input": "initis liala etra", "output": "NO" }, { "input": "initis liala initis", "output": "NO" }, { "input": "initis liala inites", "output": "NO" }, { "input": "initis etr lios", "output": "NO" }, { "input": "initis etr liala", "output": "NO" }, { "input": "initis etr etr", "output": "NO" }, { "input": "initis etr etra", "output": "NO" }, { "input": "initis etr initis", "output": "NO" }, { "input": "initis etr inites", "output": "NO" }, { "input": "initis etra lios", "output": "NO" }, { "input": "initis etra liala", "output": "NO" }, { "input": "initis etra etr", "output": "NO" }, { "input": "initis etra etra", "output": "NO" }, { "input": "initis etra initis", "output": "NO" }, { "input": "initis etra inites", "output": "NO" }, { "input": "initis initis lios", "output": "NO" }, { "input": "initis initis liala", "output": "NO" }, { "input": "initis initis etr", "output": "NO" }, { "input": "initis initis etra", "output": "NO" }, { "input": "initis initis initis", "output": "NO" }, { "input": "initis initis inites", "output": "NO" }, { "input": "initis inites lios", "output": "NO" }, { "input": "initis inites liala", "output": "NO" }, { "input": "initis inites etr", "output": "NO" }, { "input": "initis inites etra", "output": "NO" }, { "input": "initis inites initis", "output": "NO" }, { "input": "initis inites inites", "output": "NO" }, { "input": "inites lios lios", "output": "NO" }, { "input": "inites lios liala", "output": "NO" }, { "input": "inites lios etr", "output": "NO" }, { "input": "inites lios etra", "output": "NO" }, { "input": "inites lios initis", "output": "NO" }, { "input": "inites lios inites", "output": "NO" }, { "input": "inites liala lios", "output": "NO" }, { "input": "inites liala liala", "output": "NO" }, { "input": "inites liala etr", "output": "NO" }, { "input": "inites liala etra", "output": "NO" }, { "input": "inites liala initis", "output": "NO" }, { "input": "inites liala inites", "output": "NO" }, { "input": "inites etr lios", "output": "NO" }, { "input": "inites etr liala", "output": "NO" }, { "input": "inites etr etr", "output": "NO" }, { "input": "inites etr etra", "output": "NO" }, { "input": "inites etr initis", "output": "NO" }, { "input": "inites etr inites", "output": "NO" }, { "input": "inites etra lios", "output": "NO" }, { "input": "inites etra liala", "output": "NO" }, { "input": "inites etra etr", "output": "NO" }, { "input": "inites etra etra", "output": "NO" }, { "input": "inites etra initis", "output": "NO" }, { "input": "inites etra inites", "output": "NO" }, { "input": "inites initis lios", "output": "NO" }, { "input": "inites initis liala", "output": "NO" }, { "input": "inites initis etr", "output": "NO" }, { "input": "inites initis etra", "output": "NO" }, { "input": "inites initis initis", "output": "NO" }, { "input": "inites initis inites", "output": "NO" }, { "input": "inites inites lios", "output": "NO" }, { "input": "inites inites liala", "output": "NO" }, { "input": "inites inites etr", "output": "NO" }, { "input": "inites inites etra", "output": "NO" }, { "input": "inites inites initis", "output": "NO" }, { "input": "inites inites inites", "output": "NO" } ]	1,474,887,873	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	92	0	s=input() l=len(s) if l==1: if ord(s[0])>=65 and ord(s[0])<=90: print(chr(ord(s[0])-65+97),end='') else: print(chr(ord(s[0])+65-97),end='') else: #print(s[0],end='') cnt=0 for i in range(1,l): if ord(s[i])>=65 and ord(s[i])<=90: cnt+=1 if cnt==l-1: if ord(s[0])>=65 and ord(s[0])<=90: print(chr(ord(s[0])-65+97),end='') else: print(chr(ord(s[0])+65-97),end='') for i in range(1,l): print(s[i].lower(),end='') else: print(s)	Title: Grammar Lessons Time Limit: 5 seconds Memory Limit: 256 megabytes Problem Description: Petya got interested in grammar on his third year in school. He invented his own language called Petya's. Petya wanted to create a maximally simple language that would be enough to chat with friends, that's why all the language's grammar can be described with the following set of rules: - There are three parts of speech: the adjective, the noun, the verb. Each word in his language is an adjective, noun or verb. - There are two genders: masculine and feminine. Each word in his language has gender either masculine or feminine. - Masculine adjectives end with -lios, and feminine adjectives end with -liala. - Masculine nouns end with -etr, and feminime nouns end with -etra. - Masculine verbs end with -initis, and feminime verbs end with -inites. - Thus, each word in the Petya's language has one of the six endings, given above. There are no other endings in Petya's language. - It is accepted that the whole word consists of an ending. That is, words "lios", "liala", "etr" and so on belong to the Petya's language. - There aren't any punctuation marks, grammatical tenses, singular/plural forms or other language complications. - A sentence is either exactly one valid language word or exactly one statement. Statement is any sequence of the Petya's language, that satisfy both conditions: - Words in statement follow in the following order (from the left to the right): zero or more adjectives followed by exactly one noun followed by zero or more verbs. - All words in the statement should have the same gender. After Petya's friend Vasya wrote instant messenger (an instant messaging program) that supported the Petya's language, Petya wanted to add spelling and grammar checking to the program. As Vasya was in the country and Petya didn't feel like waiting, he asked you to help him with this problem. Your task is to define by a given sequence of words, whether it is true that the given text represents exactly one sentence in Petya's language. Input Specification: The first line contains one or more words consisting of lowercase Latin letters. The overall number of characters (including letters and spaces) does not exceed 105. It is guaranteed that any two consecutive words are separated by exactly one space and the input data do not contain any other spaces. It is possible that given words do not belong to the Petya's language. Output Specification: If some word of the given text does not belong to the Petya's language or if the text contains more that one sentence, print "NO" (without the quotes). Otherwise, print "YES" (without the quotes). Demo Input: ['petr\n', 'etis atis animatis etis atis amatis\n', 'nataliala kataliala vetra feinites\n'] Demo Output: ['YES\n', 'NO\n', 'YES\n'] Note: none	```python s=input() l=len(s) if l==1: if ord(s[0])>=65 and ord(s[0])<=90: print(chr(ord(s[0])-65+97),end='') else: print(chr(ord(s[0])+65-97),end='') else: #print(s[0],end='') cnt=0 for i in range(1,l): if ord(s[i])>=65 and ord(s[i])<=90: cnt+=1 if cnt==l-1: if ord(s[0])>=65 and ord(s[0])<=90: print(chr(ord(s[0])-65+97),end='') else: print(chr(ord(s[0])+65-97),end='') for i in range(1,l): print(s[i].lower(),end='') else: print(s) ```	0
538	B	Quasi Binary	PROGRAMMING	1,400	[ "constructive algorithms", "dp", "greedy", "implementation" ]		null	null	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. You are given a positive integer n. Represent it as a sum of minimum number of quasibinary numbers.	The first line contains a single integer n (1<=≤<=n<=≤<=106).	In the first line print a single integer k — the minimum number of numbers in the representation of number n as a sum of quasibinary numbers. In the second line print k numbers — the elements of the sum. All these numbers should be quasibinary according to the definition above, their sum should equal n. Do not have to print the leading zeroes in the numbers. The order of numbers doesn't matter. If there are multiple possible representations, you are allowed to print any of them.	[ "9\n", "32\n" ]	[ "9\n1 1 1 1 1 1 1 1 1 \n", "3\n10 11 11 \n" ]	none	1,000	[ { "input": "9", "output": "9\n1 1 1 1 1 1 1 1 1 " }, { "input": "32", "output": "3\n10 11 11 " }, { "input": "1", "output": "1\n1 " }, { "input": "415", "output": "5\n1 101 101 101 111 " }, { "input": "10011", "output": "1\n10011 " }, { "input": "10201", "output": "2\n100 10101 " }, { "input": "314159", "output": "9\n1 1 1 1 11 1011 101011 101011 111111 " }, { "input": "999999", "output": "9\n111111 111111 111111 111111 111111 111111 111111 111111 111111 " }, { "input": "2", "output": "2\n1 1 " }, { "input": "10", "output": "1\n10 " }, { "input": "21", "output": "2\n10 11 " }, { "input": "98", "output": "9\n10 11 11 11 11 11 11 11 11 " }, { "input": "102030", "output": "3\n10 1010 101010 " }, { "input": "909090", "output": "9\n101010 101010 101010 101010 101010 101010 101010 101010 101010 " }, { "input": "909823", "output": "9\n101000 101100 101100 101100 101100 101100 101101 101111 101111 " }, { "input": "1000000", "output": "1\n1000000 " }, { "input": "111111", "output": "1\n111111 " }, { "input": "123456", "output": "6\n1 11 111 1111 11111 111111 " }, { "input": "987654", "output": "9\n100000 110000 111000 111100 111110 111111 111111 111111 111111 " }, { "input": "908172", "output": "9\n100000 101000 101010 101010 101010 101010 101010 101011 101111 " }, { "input": "8", "output": "8\n1 1 1 1 1 1 1 1 " }, { "input": "100009", "output": "9\n1 1 1 1 1 1 1 1 100001 " }, { "input": "900000", "output": "9\n100000 100000 100000 100000 100000 100000 100000 100000 100000 " }, { "input": "1435", "output": "5\n1 101 111 111 1111 " }, { "input": "1453", "output": "5\n10 110 111 111 1111 " } ]	1,617,938,329	2,147,483,647	Python 3	OK	TESTS	25	77	0	n = input() k = int(max(n)) print(k) for i in range(1, k + 1): print(int(''.join("01"[int(d) - i >= 0] for d in n)), end=' ')	Title: Quasi Binary Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. You are given a positive integer n. Represent it as a sum of minimum number of quasibinary numbers. Input Specification: The first line contains a single integer n (1<=≤<=n<=≤<=106). Output Specification: In the first line print a single integer k — the minimum number of numbers in the representation of number n as a sum of quasibinary numbers. In the second line print k numbers — the elements of the sum. All these numbers should be quasibinary according to the definition above, their sum should equal n. Do not have to print the leading zeroes in the numbers. The order of numbers doesn't matter. If there are multiple possible representations, you are allowed to print any of them. Demo Input: ['9\n', '32\n'] Demo Output: ['9\n1 1 1 1 1 1 1 1 1 \n', '3\n10 11 11 \n'] Note: none	```python n = input() k = int(max(n)) print(k) for i in range(1, k + 1): print(int(''.join("01"[int(d) - i >= 0] for d in n)), end=' ') ```	3
808	B	Average Sleep Time	PROGRAMMING	1,300	[ "data structures", "implementation", "math" ]		null	null	It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days! When Polycarp went to a doctor with his problem, the doctor asked him about his sleeping schedule (more specifically, the average amount of hours of sleep per week). Luckily, Polycarp kept records of sleep times for the last n days. So now he has a sequence a1,<=a2,<=...,<=an, where ai is the sleep time on the i-th day. The number of records is so large that Polycarp is unable to calculate the average value by himself. Thus he is asking you to help him with the calculations. To get the average Polycarp is going to consider k consecutive days as a week. So there will be n<=-<=k<=+<=1 weeks to take into consideration. For example, if k<==<=2, n<==<=3 and a<==<=[3,<=4,<=7], then the result is . You should write a program which will calculate average sleep times of Polycarp over all weeks.	The first line contains two integer numbers n and k (1<=≤<=k<=≤<=n<=≤<=2·105). The second line contains n integer numbers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=105).	Output average sleeping time over all weeks. The answer is considered to be correct if its absolute or relative error does not exceed 10<=-<=6. In particular, it is enough to output real number with at least 6 digits after the decimal point.	[ "3 2\n3 4 7\n", "1 1\n10\n", "8 2\n1 2 4 100000 123 456 789 1\n" ]	[ "9.0000000000\n", "10.0000000000\n", "28964.2857142857\n" ]	In the third example there are n - k + 1 = 7 weeks, so the answer is sums of all weeks divided by 7.	0	[ { "input": "3 2\n3 4 7", "output": "9.0000000000" }, { "input": "1 1\n10", "output": "10.0000000000" }, { "input": "8 2\n1 2 4 100000 123 456 789 1", "output": "28964.2857142857" }, { "input": "1 1\n1", "output": "1.0000000000" }, { "input": "1 1\n100000", "output": "100000.0000000000" }, { "input": "3 1\n1 2 3", "output": "2.0000000000" }, { "input": "10 4\n11 3 5 20 12 7 9 2 2 20", "output": "36.2857142857" }, { "input": "10 5\n15 9 3 2 17 10 9 18 4 19", "output": "50.3333333333" }, { "input": "10 6\n19 3 20 16 14 10 1 13 7 3", "output": "65.8000000000" }, { "input": "10 7\n8 16 2 13 15 9 5 13 9 2", "output": "68.2500000000" }, { "input": "10 4\n127 1459 718 1183 880 1044 1857 1340 725 1496", "output": "4574.4285714286" }, { "input": "10 5\n1384 1129 1780 1960 1567 1928 12 1523 1165 344", "output": "6931.3333333333" } ]	1,509,843,198	2,147,483,647	Python 3	OK	TESTS	29	171	13,004,800	n,k=map(int,input().split()) a=list(map(int,input().split())) start=min(k-1,n-k) count=sum(a[start:n-start])(start+1) for i in range(start): count+=(a[i]+a[~i])(i+1) print(count/(n-k+1))	Title: Average Sleep Time Time Limit: None seconds Memory Limit: None megabytes Problem Description: It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days! When Polycarp went to a doctor with his problem, the doctor asked him about his sleeping schedule (more specifically, the average amount of hours of sleep per week). Luckily, Polycarp kept records of sleep times for the last n days. So now he has a sequence a1,<=a2,<=...,<=an, where ai is the sleep time on the i-th day. The number of records is so large that Polycarp is unable to calculate the average value by himself. Thus he is asking you to help him with the calculations. To get the average Polycarp is going to consider k consecutive days as a week. So there will be n<=-<=k<=+<=1 weeks to take into consideration. For example, if k<==<=2, n<==<=3 and a<==<=[3,<=4,<=7], then the result is . You should write a program which will calculate average sleep times of Polycarp over all weeks. Input Specification: The first line contains two integer numbers n and k (1<=≤<=k<=≤<=n<=≤<=2·105). The second line contains n integer numbers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=105). Output Specification: Output average sleeping time over all weeks. The answer is considered to be correct if its absolute or relative error does not exceed 10<=-<=6. In particular, it is enough to output real number with at least 6 digits after the decimal point. Demo Input: ['3 2\n3 4 7\n', '1 1\n10\n', '8 2\n1 2 4 100000 123 456 789 1\n'] Demo Output: ['9.0000000000\n', '10.0000000000\n', '28964.2857142857\n'] Note: In the third example there are n - k + 1 = 7 weeks, so the answer is sums of all weeks divided by 7.	```python n,k=map(int,input().split()) a=list(map(int,input().split())) start=min(k-1,n-k) count=sum(a[start:n-start])(start+1) for i in range(start): count+=(a[i]+a[~i])(i+1) print(count/(n-k+1)) ```	3
550	A	Two Substrings	PROGRAMMING	1,500	[ "brute force", "dp", "greedy", "implementation", "strings" ]		null	null	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).	The only line of input contains a string s of length between 1 and 105 consisting of uppercase Latin letters.	Print "YES" (without the quotes), if string s contains two non-overlapping substrings "AB" and "BA", and "NO" otherwise.	[ "ABA\n", "BACFAB\n", "AXBYBXA\n" ]	[ "NO\n", "YES\n", "NO\n" ]	In the first sample test, despite the fact that there are substrings "AB" and "BA", their occurrences overlap, so the answer is "NO". In the second sample test there are the following occurrences of the substrings: BACFAB. In the third sample test there is no substring "AB" nor substring "BA".	1,000	[ { "input": "ABA", "output": "NO" }, { "input": "BACFAB", "output": "YES" }, { "input": "AXBYBXA", "output": "NO" }, { "input": "ABABAB", "output": "YES" }, { "input": "BBBBBBBBBB", "output": "NO" }, { "input": "ABBA", "output": "YES" }, { "input": "ABAXXXAB", "output": "YES" }, { "input": "TESTABAXXABTEST", "output": "YES" }, { "input": "A", "output": "NO" }, { "input": "B", "output": "NO" }, { "input": "X", "output": "NO" }, { "input": "BA", "output": "NO" }, { "input": "AB", "output": "NO" }, { "input": "AA", "output": "NO" }, { "input": "BB", "output": "NO" }, { "input": "BAB", "output": "NO" }, { "input": "AAB", "output": "NO" }, { "input": "BAA", "output": "NO" }, { "input": "ABB", "output": "NO" }, { "input": "BBA", "output": "NO" }, { "input": "AAA", "output": "NO" }, { "input": "BBB", "output": "NO" }, { "input": "AXBXBXA", "output": "NO" }, { "input": "SKDSKDJABSDBADKFJDK", "output": "YES" }, { "input": "ABAXXBBXXAA", "output": "NO" }, { "input": "ABAB", "output": "NO" }, { "input": "BABA", "output": "NO" }, { "input": "AAAB", "output": "NO" }, { "input": "AAAA", "output": "NO" }, { "input": "AABA", "output": "NO" }, { "input": "ABAA", "output": "NO" }, { "input": "BAAA", "output": "NO" }, { "input": "AABB", "output": "NO" }, { "input": "BAAB", "output": "YES" }, { "input": "BBAA", "output": "NO" }, { "input": "BBBA", "output": "NO" }, { "input": "BBAB", "output": "NO" }, { "input": "BABB", "output": "NO" }, { "input": "ABBB", "output": "NO" }, { "input": "BBBB", "output": "NO" }, { "input": "BABAB", "output": "YES" }, { "input": "ABABA", "output": "YES" }, { "input": "AAABAAACBBBC", "output": "NO" }, { "input": "AABBBACBBBBBBAACBCCACBBAABBBBBCAACABAACABCACCBCBCCCBCBCABCBBCCBCBBAACBACAABACBBCACCBCCACCABBCBABBAAC", "output": "YES" }, { "input": "CBBABDDBBADAC", "output": "YES" }, { "input": "ABYFAB", "output": "NO" }, { "input": "BABXXAB", "output": "YES" }, { "input": "ABAXAB", "output": "YES" }, { "input": "ABABXAB", "output": "YES" }, { "input": "ABXABXABXABXABXBAXBAXBAXBA", "output": "YES" }, { "input": "QQQQQQQQQABABQQQQQQQQ", "output": "NO" } ]	1,684,672,341	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	1	46	0	s = list(input()) lest = [] print("YES" if "AB" in s or "BA" in s else "NO")	Title: Two Substrings Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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 Specification: The only line of input contains a string s of length between 1 and 105 consisting of uppercase Latin letters. Output Specification: Print "YES" (without the quotes), if string s contains two non-overlapping substrings "AB" and "BA", and "NO" otherwise. Demo Input: ['ABA\n', 'BACFAB\n', 'AXBYBXA\n'] Demo Output: ['NO\n', 'YES\n', 'NO\n'] Note: In the first sample test, despite the fact that there are substrings "AB" and "BA", their occurrences overlap, so the answer is "NO". In the second sample test there are the following occurrences of the substrings: BACFAB. In the third sample test there is no substring "AB" nor substring "BA".	```python s = list(input()) lest = [] print("YES" if "AB" in s or "BA" in s else "NO") ```	0
465	B	Inbox (100500)	PROGRAMMING	1,000	[ "implementation" ]		null	null	Over time, Alexey's mail box got littered with too many letters. Some of them are read, while others are unread. Alexey'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: - 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. The program cannot delete the letters from the list or rearrange them. Alexey 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?	The first line contains a single integer n (1<=≤<=n<=≤<=1000) — the number of letters in the mailbox. The second line contains n space-separated integers (zeros and ones) — the state of the letter list. The i-th number equals either 1, if the i-th number is unread, or 0, if the i-th letter is read.	Print a single number — the minimum number of operations needed to make all the letters read.	[ "5\n0 1 0 1 0\n", "5\n1 1 0 0 1\n", "2\n0 0\n" ]	[ "3\n", "4\n", "0\n" ]	In the first sample Alexey needs three operations to cope with the task: open the second letter, move to the third one, move to the fourth one. In the second sample the action plan: open the first letter, move to the second letter, return to the list, open the fifth letter. In the third sample all letters are already read.	1,000	[ { "input": "5\n0 1 0 1 0", "output": "3" }, { "input": "5\n1 1 0 0 1", "output": "4" }, { "input": "2\n0 0", "output": "0" }, { "input": "9\n1 0 1 0 1 0 1 0 1", "output": "9" }, { "input": "5\n1 1 1 1 1", "output": "5" }, { "input": "14\n0 0 1 1 1 0 1 1 1 0 1 1 1 0", "output": "11" }, { "input": "23\n1 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 0 1 1 1", "output": "23" }, { "input": "27\n0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0", "output": "25" }, { "input": "10\n1 0 0 0 0 1 0 0 0 1", "output": "5" }, { "input": "10\n1 0 0 1 0 0 1 1 0 1", "output": "8" }, { "input": "27\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0", "output": "0" }, { "input": "39\n1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1", "output": "39" }, { "input": "48\n1 0 1 0 1 0 1 0 0 1 0 1 0 0 1 0 1 0 0 1 0 1 0 1 0 0 1 0 1 0 0 1 0 0 1 0 0 1 0 1 0 1 0 0 1 0 0 1", "output": "39" }, { "input": "71\n0 0 0 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0", "output": "59" }, { "input": "99\n1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1", "output": "99" }, { "input": "99\n1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1", "output": "99" }, { "input": "100\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "100" }, { "input": "100\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "99" }, { "input": "193\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0", "output": "1" }, { "input": "213\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0", "output": "5" }, { "input": "2\n1 0", "output": "1" }, { "input": "1\n1", "output": "1" }, { "input": "1\n0", "output": "0" }, { "input": "5\n0 0 0 0 1", "output": "1" }, { "input": "12\n0 1 1 0 1 1 0 1 1 0 0 0", "output": "8" }, { "input": "3\n1 0 0", "output": "1" }, { "input": "5\n0 0 1 0 0", "output": "1" }, { "input": "3\n0 1 0", "output": "1" }, { "input": "6\n1 1 0 0 0 0", "output": "2" }, { "input": "4\n0 1 0 0", "output": "1" }, { "input": "5\n1 1 1 0 0", "output": "3" }, { "input": "4\n1 0 0 0", "output": "1" }, { "input": "6\n1 1 1 1 0 0", "output": "4" } ]	1,517,921,811	2,147,483,647	PyPy 3	OK	TESTS	44	77	19,968,000	n=int(input()) L=list(map(int,input().split(' '))) s=[] for i in range(n): if L[i]==1: s.append(i) if len(s)!=0: count=1 for i in range(len(s)-1): count=count+min(2,s[i+1]-s[i]) print(count) else : print(0)	Title: Inbox (100500) Time Limit: None seconds Memory Limit: None megabytes Problem Description: Over time, Alexey's mail box got littered with too many letters. Some of them are read, while others are unread. Alexey'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: - 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. The program cannot delete the letters from the list or rearrange them. Alexey 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 Specification: The first line contains a single integer n (1<=≤<=n<=≤<=1000) — the number of letters in the mailbox. The second line contains n space-separated integers (zeros and ones) — the state of the letter list. The i-th number equals either 1, if the i-th number is unread, or 0, if the i-th letter is read. Output Specification: Print a single number — the minimum number of operations needed to make all the letters read. Demo Input: ['5\n0 1 0 1 0\n', '5\n1 1 0 0 1\n', '2\n0 0\n'] Demo Output: ['3\n', '4\n', '0\n'] Note: In the first sample Alexey needs three operations to cope with the task: open the second letter, move to the third one, move to the fourth one. In the second sample the action plan: open the first letter, move to the second letter, return to the list, open the fifth letter. In the third sample all letters are already read.	```python n=int(input()) L=list(map(int,input().split(' '))) s=[] for i in range(n): if L[i]==1: s.append(i) if len(s)!=0: count=1 for i in range(len(s)-1): count=count+min(2,s[i+1]-s[i]) print(count) else : print(0) ```	3
332	A	Down the Hatch!	PROGRAMMING	1,300	[ "implementation" ]		null	null	Everybody knows that the Berland citizens are keen on health, especially students. Berland students are so tough that all they drink is orange juice! Yesterday one student, Vasya and his mates made some barbecue and they drank this healthy drink only. After they ran out of the first barrel of juice, they decided to play a simple game. All n people who came to the barbecue sat in a circle (thus each person received a unique index bi from 0 to n<=-<=1). The person number 0 started the game (this time it was Vasya). All turns in the game were numbered by integers starting from 1. If the j-th turn was made by the person with index bi, then this person acted like that: 1. he pointed at the person with index (bi<=+<=1) mod n either with an elbow or with a nod (x mod y is the remainder after dividing x by y); 1. if j<=≥<=4 and the players who had turns number j<=-<=1, j<=-<=2, j<=-<=3, made during their turns the same moves as player bi on the current turn, then he had drunk a glass of juice; 1. the turn went to person number (bi<=+<=1) mod n. The person who was pointed on the last turn did not make any actions. The problem was, Vasya's drunk too much juice and can't remember the goal of the game. However, Vasya's got the recorded sequence of all the participants' actions (including himself). Now Vasya wants to find out the maximum amount of juice he could drink if he played optimally well (the other players' actions do not change). Help him. You can assume that in any scenario, there is enough juice for everybody.	The first line contains a single integer n (4<=≤<=n<=≤<=2000) — the number of participants in the game. The second line describes the actual game: the i-th character of this line equals 'a', if the participant who moved i-th pointed at the next person with his elbow, and 'b', if the participant pointed with a nod. The game continued for at least 1 and at most 2000 turns.	Print a single integer — the number of glasses of juice Vasya could have drunk if he had played optimally well.	[ "4\nabbba\n", "4\nabbab\n" ]	[ "1\n", "0\n" ]	In both samples Vasya has got two turns — 1 and 5. In the first sample, Vasya could have drunk a glass of juice during the fifth turn if he had pointed at the next person with a nod. In this case, the sequence of moves would look like "abbbb". In the second sample Vasya wouldn't drink a single glass of juice as the moves performed during turns 3 and 4 are different.	500	[ { "input": "4\nabbba", "output": "1" }, { "input": "4\nabbab", "output": "0" }, { "input": "4\naaa", "output": "0" }, { "input": "4\naab", "output": "0" }, { "input": "4\naabaabbba", "output": "1" }, { "input": "6\naaaaaaaaaaaaaaaa", "output": "2" }, { "input": "7\nabbbaaabbbaaaab", "output": "2" }, { "input": "9\naaaabaaaaa", "output": "1" }, { "input": "4\na", "output": "0" }, { "input": "4\nb", "output": "0" }, { "input": "4\nab", "output": "0" }, { "input": "4\nbb", "output": "0" }, { "input": "4\naba", "output": "0" }, { "input": "4\nbbb", "output": "0" }, { "input": "4\nabab", "output": "0" }, { "input": "4\nabaa", "output": "0" }, { "input": "4\nabbbaaabba", "output": "1" }, { "input": "4\nababba", "output": "0" }, { "input": "4\naaaaaa", "output": "1" }, { "input": "5\nbbbbaabaaa", "output": "0" }, { "input": "2000\na", "output": "0" }, { "input": "2000\naabaaabaabababbbbbbabbbbb", "output": "0" }, { "input": "4\nabbb", "output": "0" }, { "input": "5\nbbbbb", "output": "0" } ]	1,374,681,048	1,248	Python 3	WRONG_ANSWER	PRETESTS	2	62	0	n = int(input()) s = input() ans = 0 for i in range(len(s)): if i % n == 0: if s[i-1] == s[i-2] == s[i-3]: ans += 1 print(ans)	Title: Down the Hatch! Time Limit: None seconds Memory Limit: None megabytes Problem Description: Everybody knows that the Berland citizens are keen on health, especially students. Berland students are so tough that all they drink is orange juice! Yesterday one student, Vasya and his mates made some barbecue and they drank this healthy drink only. After they ran out of the first barrel of juice, they decided to play a simple game. All n people who came to the barbecue sat in a circle (thus each person received a unique index bi from 0 to n<=-<=1). The person number 0 started the game (this time it was Vasya). All turns in the game were numbered by integers starting from 1. If the j-th turn was made by the person with index bi, then this person acted like that: 1. he pointed at the person with index (bi<=+<=1) mod n either with an elbow or with a nod (x mod y is the remainder after dividing x by y); 1. if j<=≥<=4 and the players who had turns number j<=-<=1, j<=-<=2, j<=-<=3, made during their turns the same moves as player bi on the current turn, then he had drunk a glass of juice; 1. the turn went to person number (bi<=+<=1) mod n. The person who was pointed on the last turn did not make any actions. The problem was, Vasya's drunk too much juice and can't remember the goal of the game. However, Vasya's got the recorded sequence of all the participants' actions (including himself). Now Vasya wants to find out the maximum amount of juice he could drink if he played optimally well (the other players' actions do not change). Help him. You can assume that in any scenario, there is enough juice for everybody. Input Specification: The first line contains a single integer n (4<=≤<=n<=≤<=2000) — the number of participants in the game. The second line describes the actual game: the i-th character of this line equals 'a', if the participant who moved i-th pointed at the next person with his elbow, and 'b', if the participant pointed with a nod. The game continued for at least 1 and at most 2000 turns. Output Specification: Print a single integer — the number of glasses of juice Vasya could have drunk if he had played optimally well. Demo Input: ['4\nabbba\n', '4\nabbab\n'] Demo Output: ['1\n', '0\n'] Note: In both samples Vasya has got two turns — 1 and 5. In the first sample, Vasya could have drunk a glass of juice during the fifth turn if he had pointed at the next person with a nod. In this case, the sequence of moves would look like "abbbb". In the second sample Vasya wouldn't drink a single glass of juice as the moves performed during turns 3 and 4 are different.	```python n = int(input()) s = input() ans = 0 for i in range(len(s)): if i % n == 0: if s[i-1] == s[i-2] == s[i-3]: ans += 1 print(ans) ```	0
136	A	Presents	PROGRAMMING	800	[ "implementation" ]		null	null	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. If 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 pi. He also remembered that each of his friends received exactly one gift. Now Petya wants to know for each friend i the number of a friend who has given him a gift.	The first line contains one integer n (1<=≤<=n<=≤<=100) — the quantity of friends Petya invited to the party. The second line contains n space-separated integers: the i-th number is pi — the number of a friend who gave a gift to friend number i. It is guaranteed that each friend received exactly one gift. It is possible that some friends do not share Petya's ideas of giving gifts to somebody else. Those friends gave the gifts to themselves.	Print n space-separated integers: the i-th number should equal the number of the friend who gave a gift to friend number i.	[ "4\n2 3 4 1\n", "3\n1 3 2\n", "2\n1 2\n" ]	[ "4 1 2 3\n", "1 3 2\n", "1 2\n" ]	none	500	[ { "input": "4\n2 3 4 1", "output": "4 1 2 3" }, { "input": "3\n1 3 2", "output": "1 3 2" }, { "input": "2\n1 2", "output": "1 2" }, { "input": "1\n1", "output": "1" }, { "input": "10\n1 3 2 6 4 5 7 9 8 10", "output": "1 3 2 5 6 4 7 9 8 10" }, { "input": "5\n5 4 3 2 1", "output": "5 4 3 2 1" }, { "input": "20\n2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19", "output": "2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19" }, { "input": "21\n3 2 1 6 5 4 9 8 7 12 11 10 15 14 13 18 17 16 21 20 19", "output": "3 2 1 6 5 4 9 8 7 12 11 10 15 14 13 18 17 16 21 20 19" }, { "input": "10\n3 4 5 6 7 8 9 10 1 2", "output": "9 10 1 2 3 4 5 6 7 8" }, { "input": "8\n1 5 3 7 2 6 4 8", "output": "1 5 3 7 2 6 4 8" }, { "input": "50\n49 22 4 2 20 46 7 32 5 19 48 24 26 15 45 21 44 11 50 43 39 17 31 1 42 34 3 27 36 25 12 30 13 33 28 35 18 6 8 37 38 14 10 9 29 16 40 23 41 47", "output": "24 4 27 3 9 38 7 39 44 43 18 31 33 42 14 46 22 37 10 5 16 2 48 12 30 13 28 35 45 32 23 8 34 26 36 29 40 41 21 47 49 25 20 17 15 6 50 11 1 19" }, { "input": "34\n13 20 33 30 15 11 27 4 8 2 29 25 24 7 3 22 18 10 26 16 5 1 32 9 34 6 12 14 28 19 31 21 23 17", "output": "22 10 15 8 21 26 14 9 24 18 6 27 1 28 5 20 34 17 30 2 32 16 33 13 12 19 7 29 11 4 31 23 3 25" }, { "input": "92\n23 1 6 4 84 54 44 76 63 34 61 20 48 13 28 78 26 46 90 72 24 55 91 89 53 38 82 5 79 92 29 32 15 64 11 88 60 70 7 66 18 59 8 57 19 16 42 21 80 71 62 27 75 86 36 9 83 73 74 50 43 31 56 30 17 33 40 81 49 12 10 41 22 77 25 68 51 2 47 3 58 69 87 67 39 37 35 65 14 45 52 85", "output": "2 78 80 4 28 3 39 43 56 71 35 70 14 89 33 46 65 41 45 12 48 73 1 21 75 17 52 15 31 64 62 32 66 10 87 55 86 26 85 67 72 47 61 7 90 18 79 13 69 60 77 91 25 6 22 63 44 81 42 37 11 51 9 34 88 40 84 76 82 38 50 20 58 59 53 8 74 16 29 49 68 27 57 5 92 54 83 36 24 19 23 30" }, { "input": "49\n30 24 33 48 7 3 17 2 8 35 10 39 23 40 46 32 18 21 26 22 1 16 47 45 41 28 31 6 12 43 27 11 13 37 19 15 44 5 29 42 4 38 20 34 14 9 25 36 49", "output": "21 8 6 41 38 28 5 9 46 11 32 29 33 45 36 22 7 17 35 43 18 20 13 2 47 19 31 26 39 1 27 16 3 44 10 48 34 42 12 14 25 40 30 37 24 15 23 4 49" }, { "input": "12\n3 8 7 4 6 5 2 1 11 9 10 12", "output": "8 7 1 4 6 5 3 2 10 11 9 12" }, { "input": "78\n16 56 36 78 21 14 9 77 26 57 70 61 41 47 18 44 5 31 50 74 65 52 6 39 22 62 67 69 43 7 64 29 24 40 48 51 73 54 72 12 19 34 4 25 55 33 17 35 23 53 10 8 27 32 42 68 20 63 3 2 1 71 58 46 13 30 49 11 37 66 38 60 28 75 15 59 45 76", "output": "61 60 59 43 17 23 30 52 7 51 68 40 65 6 75 1 47 15 41 57 5 25 49 33 44 9 53 73 32 66 18 54 46 42 48 3 69 71 24 34 13 55 29 16 77 64 14 35 67 19 36 22 50 38 45 2 10 63 76 72 12 26 58 31 21 70 27 56 28 11 62 39 37 20 74 78 8 4" }, { "input": "64\n64 57 40 3 15 8 62 18 33 59 51 19 22 13 4 37 47 45 50 35 63 11 58 42 46 21 7 2 41 48 32 23 28 38 17 12 24 27 49 31 60 6 30 25 61 52 26 54 9 14 29 20 44 39 55 10 34 16 5 56 1 36 53 43", "output": "61 28 4 15 59 42 27 6 49 56 22 36 14 50 5 58 35 8 12 52 26 13 32 37 44 47 38 33 51 43 40 31 9 57 20 62 16 34 54 3 29 24 64 53 18 25 17 30 39 19 11 46 63 48 55 60 2 23 10 41 45 7 21 1" }, { "input": "49\n38 20 49 32 14 41 39 45 25 48 40 19 26 43 34 12 10 3 35 42 5 7 46 47 4 2 13 22 16 24 33 15 11 18 29 31 23 9 44 36 6 17 37 1 30 28 8 21 27", "output": "44 26 18 25 21 41 22 47 38 17 33 16 27 5 32 29 42 34 12 2 48 28 37 30 9 13 49 46 35 45 36 4 31 15 19 40 43 1 7 11 6 20 14 39 8 23 24 10 3" }, { "input": "78\n17 50 30 48 33 12 42 4 18 53 76 67 38 3 20 72 51 55 60 63 46 10 57 45 54 32 24 62 8 11 35 44 65 74 58 28 2 6 56 52 39 23 47 49 61 1 66 41 15 77 7 27 78 13 14 34 5 31 37 21 40 16 29 69 59 43 64 36 70 19 25 73 71 75 9 68 26 22", "output": "46 37 14 8 57 38 51 29 75 22 30 6 54 55 49 62 1 9 70 15 60 78 42 27 71 77 52 36 63 3 58 26 5 56 31 68 59 13 41 61 48 7 66 32 24 21 43 4 44 2 17 40 10 25 18 39 23 35 65 19 45 28 20 67 33 47 12 76 64 69 73 16 72 34 74 11 50 53" }, { "input": "29\n14 21 27 1 4 18 10 17 20 23 2 24 7 9 28 22 8 25 12 15 11 6 16 29 3 26 19 5 13", "output": "4 11 25 5 28 22 13 17 14 7 21 19 29 1 20 23 8 6 27 9 2 16 10 12 18 26 3 15 24" }, { "input": "82\n6 1 10 75 28 66 61 81 78 63 17 19 58 34 49 12 67 50 41 44 3 15 59 38 51 72 36 11 46 29 18 64 27 23 13 53 56 68 2 25 47 40 69 54 42 5 60 55 4 16 24 79 57 20 7 73 32 80 76 52 82 37 26 31 65 8 39 62 33 71 30 9 77 43 48 74 70 22 14 45 35 21", "output": "2 39 21 49 46 1 55 66 72 3 28 16 35 79 22 50 11 31 12 54 82 78 34 51 40 63 33 5 30 71 64 57 69 14 81 27 62 24 67 42 19 45 74 20 80 29 41 75 15 18 25 60 36 44 48 37 53 13 23 47 7 68 10 32 65 6 17 38 43 77 70 26 56 76 4 59 73 9 52 58 8 61" }, { "input": "82\n74 18 15 69 71 77 19 26 80 20 66 7 30 82 22 48 21 44 52 65 64 61 35 49 12 8 53 81 54 16 11 9 40 46 13 1 29 58 5 41 55 4 78 60 6 51 56 2 38 36 34 62 63 25 17 67 45 14 32 37 75 79 10 47 27 39 31 68 59 24 50 43 72 70 42 28 76 23 57 3 73 33", "output": "36 48 80 42 39 45 12 26 32 63 31 25 35 58 3 30 55 2 7 10 17 15 78 70 54 8 65 76 37 13 67 59 82 51 23 50 60 49 66 33 40 75 72 18 57 34 64 16 24 71 46 19 27 29 41 47 79 38 69 44 22 52 53 21 20 11 56 68 4 74 5 73 81 1 61 77 6 43 62 9 28 14" }, { "input": "45\n2 32 34 13 3 15 16 33 22 12 31 38 42 14 27 7 36 8 4 19 45 41 5 35 10 11 39 20 29 44 17 9 6 40 37 28 25 21 1 30 24 18 43 26 23", "output": "39 1 5 19 23 33 16 18 32 25 26 10 4 14 6 7 31 42 20 28 38 9 45 41 37 44 15 36 29 40 11 2 8 3 24 17 35 12 27 34 22 13 43 30 21" }, { "input": "45\n4 32 33 39 43 21 22 35 45 7 14 5 16 9 42 31 24 36 17 29 41 25 37 34 27 20 11 44 3 13 19 2 1 10 26 30 38 18 6 8 15 23 40 28 12", "output": "33 32 29 1 12 39 10 40 14 34 27 45 30 11 41 13 19 38 31 26 6 7 42 17 22 35 25 44 20 36 16 2 3 24 8 18 23 37 4 43 21 15 5 28 9" }, { "input": "74\n48 72 40 67 17 4 27 53 11 32 25 9 74 2 41 24 56 22 14 21 33 5 18 55 20 7 29 36 69 13 52 19 38 30 68 59 66 34 63 6 47 45 54 44 62 12 50 71 16 10 8 64 57 73 46 26 49 42 3 23 35 1 61 39 70 60 65 43 15 28 37 51 58 31", "output": "62 14 59 6 22 40 26 51 12 50 9 46 30 19 69 49 5 23 32 25 20 18 60 16 11 56 7 70 27 34 74 10 21 38 61 28 71 33 64 3 15 58 68 44 42 55 41 1 57 47 72 31 8 43 24 17 53 73 36 66 63 45 39 52 67 37 4 35 29 65 48 2 54 13" }, { "input": "47\n9 26 27 10 6 34 28 42 39 22 45 21 11 43 14 47 38 15 40 32 46 1 36 29 17 25 2 23 31 5 24 4 7 8 12 19 16 44 37 20 18 33 30 13 35 41 3", "output": "22 27 47 32 30 5 33 34 1 4 13 35 44 15 18 37 25 41 36 40 12 10 28 31 26 2 3 7 24 43 29 20 42 6 45 23 39 17 9 19 46 8 14 38 11 21 16" }, { "input": "49\n14 38 6 29 9 49 36 43 47 3 44 20 34 15 7 11 1 28 12 40 16 37 31 10 42 41 33 21 18 30 5 27 17 35 25 26 45 19 2 13 23 32 4 22 46 48 24 39 8", "output": "17 39 10 43 31 3 15 49 5 24 16 19 40 1 14 21 33 29 38 12 28 44 41 47 35 36 32 18 4 30 23 42 27 13 34 7 22 2 48 20 26 25 8 11 37 45 9 46 6" }, { "input": "100\n78 56 31 91 90 95 16 65 58 77 37 89 33 61 10 76 62 47 35 67 69 7 63 83 22 25 49 8 12 30 39 44 57 64 48 42 32 11 70 43 55 50 99 24 85 73 45 14 54 21 98 84 74 2 26 18 9 36 80 53 75 46 66 86 59 93 87 68 94 13 72 28 79 88 92 29 52 82 34 97 19 38 1 41 27 4 40 5 96 100 51 6 20 23 81 15 17 3 60 71", "output": "83 54 98 86 88 92 22 28 57 15 38 29 70 48 96 7 97 56 81 93 50 25 94 44 26 55 85 72 76 30 3 37 13 79 19 58 11 82 31 87 84 36 40 32 47 62 18 35 27 42 91 77 60 49 41 2 33 9 65 99 14 17 23 34 8 63 20 68 21 39 100 71 46 53 61 16 10 1 73 59 95 78 24 52 45 64 67 74 12 5 4 75 66 69 6 89 80 51 43 90" }, { "input": "22\n12 8 11 2 16 7 13 6 22 21 20 10 4 14 18 1 5 15 3 19 17 9", "output": "16 4 19 13 17 8 6 2 22 12 3 1 7 14 18 5 21 15 20 11 10 9" }, { "input": "72\n16 11 49 51 3 27 60 55 23 40 66 7 53 70 13 5 15 32 18 72 33 30 8 31 46 12 28 67 25 38 50 22 69 34 71 52 58 39 24 35 42 9 41 26 62 1 63 65 36 64 68 61 37 14 45 47 6 57 54 20 17 2 56 59 29 10 4 48 21 43 19 44", "output": "46 62 5 67 16 57 12 23 42 66 2 26 15 54 17 1 61 19 71 60 69 32 9 39 29 44 6 27 65 22 24 18 21 34 40 49 53 30 38 10 43 41 70 72 55 25 56 68 3 31 4 36 13 59 8 63 58 37 64 7 52 45 47 50 48 11 28 51 33 14 35 20" }, { "input": "63\n21 56 11 10 62 24 20 42 28 52 38 2 37 43 48 22 7 8 40 14 13 46 53 1 23 4 60 63 51 36 25 12 39 32 49 16 58 44 31 61 33 50 55 54 45 6 47 41 9 57 30 29 26 18 19 27 15 34 3 35 59 5 17", "output": "24 12 59 26 62 46 17 18 49 4 3 32 21 20 57 36 63 54 55 7 1 16 25 6 31 53 56 9 52 51 39 34 41 58 60 30 13 11 33 19 48 8 14 38 45 22 47 15 35 42 29 10 23 44 43 2 50 37 61 27 40 5 28" }, { "input": "18\n2 16 8 4 18 12 3 6 5 9 10 15 11 17 14 13 1 7", "output": "17 1 7 4 9 8 18 3 10 11 13 6 16 15 12 2 14 5" }, { "input": "47\n6 9 10 41 25 3 4 37 20 1 36 22 29 27 11 24 43 31 12 17 34 42 38 39 13 2 7 21 18 5 15 35 44 26 33 46 19 40 30 14 28 23 47 32 45 8 16", "output": "10 26 6 7 30 1 27 46 2 3 15 19 25 40 31 47 20 29 37 9 28 12 42 16 5 34 14 41 13 39 18 44 35 21 32 11 8 23 24 38 4 22 17 33 45 36 43" }, { "input": "96\n41 91 48 88 29 57 1 19 44 43 37 5 10 75 25 63 30 78 76 53 8 92 18 70 39 17 49 60 9 16 3 34 86 59 23 79 55 45 72 51 28 33 96 40 26 54 6 32 89 61 85 74 7 82 52 31 64 66 94 95 11 22 2 73 35 13 42 71 14 47 84 69 50 67 58 12 77 46 38 68 15 36 20 93 27 90 83 56 87 4 21 24 81 62 80 65", "output": "7 63 31 90 12 47 53 21 29 13 61 76 66 69 81 30 26 23 8 83 91 62 35 92 15 45 85 41 5 17 56 48 42 32 65 82 11 79 25 44 1 67 10 9 38 78 70 3 27 73 40 55 20 46 37 88 6 75 34 28 50 94 16 57 96 58 74 80 72 24 68 39 64 52 14 19 77 18 36 95 93 54 87 71 51 33 89 4 49 86 2 22 84 59 60 43" }, { "input": "73\n67 24 39 22 23 20 48 34 42 40 19 70 65 69 64 21 53 11 59 15 26 10 30 33 72 29 55 25 56 71 8 9 57 49 41 61 13 12 6 27 66 36 47 50 73 60 2 37 7 4 51 17 1 46 14 62 35 3 45 63 43 58 54 32 31 5 28 44 18 52 68 38 16", "output": "53 47 58 50 66 39 49 31 32 22 18 38 37 55 20 73 52 69 11 6 16 4 5 2 28 21 40 67 26 23 65 64 24 8 57 42 48 72 3 10 35 9 61 68 59 54 43 7 34 44 51 70 17 63 27 29 33 62 19 46 36 56 60 15 13 41 1 71 14 12 30 25 45" }, { "input": "81\n25 2 78 40 12 80 69 13 49 43 17 33 23 54 32 61 77 66 27 71 24 26 42 55 60 9 5 30 7 37 45 63 53 11 38 44 68 34 28 52 67 22 57 46 47 50 8 16 79 62 4 36 20 14 73 64 6 76 35 74 58 10 29 81 59 31 19 1 75 39 70 18 41 21 72 65 3 48 15 56 51", "output": "68 2 77 51 27 57 29 47 26 62 34 5 8 54 79 48 11 72 67 53 74 42 13 21 1 22 19 39 63 28 66 15 12 38 59 52 30 35 70 4 73 23 10 36 31 44 45 78 9 46 81 40 33 14 24 80 43 61 65 25 16 50 32 56 76 18 41 37 7 71 20 75 55 60 69 58 17 3 49 6 64" }, { "input": "12\n12 3 1 5 11 6 7 10 2 8 9 4", "output": "3 9 2 12 4 6 7 10 11 8 5 1" }, { "input": "47\n7 21 41 18 40 31 12 28 24 14 43 23 33 10 19 38 26 8 34 15 29 44 5 13 39 25 3 27 20 42 35 9 2 1 30 46 36 32 4 22 37 45 6 47 11 16 17", "output": "34 33 27 39 23 43 1 18 32 14 45 7 24 10 20 46 47 4 15 29 2 40 12 9 26 17 28 8 21 35 6 38 13 19 31 37 41 16 25 5 3 30 11 22 42 36 44" }, { "input": "8\n1 3 5 2 4 8 6 7", "output": "1 4 2 5 3 7 8 6" }, { "input": "38\n28 8 2 33 20 32 26 29 23 31 15 38 11 37 18 21 22 19 4 34 1 35 16 7 17 6 27 30 36 12 9 24 25 13 5 3 10 14", "output": "21 3 36 19 35 26 24 2 31 37 13 30 34 38 11 23 25 15 18 5 16 17 9 32 33 7 27 1 8 28 10 6 4 20 22 29 14 12" }, { "input": "10\n2 9 4 6 10 1 7 5 3 8", "output": "6 1 9 3 8 4 7 10 2 5" }, { "input": "23\n20 11 15 1 5 12 23 9 2 22 13 19 16 14 7 4 8 21 6 17 18 10 3", "output": "4 9 23 16 5 19 15 17 8 22 2 6 11 14 3 13 20 21 12 1 18 10 7" }, { "input": "10\n2 4 9 3 6 8 10 5 1 7", "output": "9 1 4 2 8 5 10 6 3 7" }, { "input": "55\n9 48 23 49 11 24 4 22 34 32 17 45 39 13 14 21 19 25 2 31 37 7 55 36 20 51 5 12 54 10 35 40 43 1 46 18 53 41 38 26 29 50 3 42 52 27 8 28 47 33 6 16 30 44 15", "output": "34 19 43 7 27 51 22 47 1 30 5 28 14 15 55 52 11 36 17 25 16 8 3 6 18 40 46 48 41 53 20 10 50 9 31 24 21 39 13 32 38 44 33 54 12 35 49 2 4 42 26 45 37 29 23" }, { "input": "58\n49 13 12 54 2 38 56 11 33 25 26 19 28 8 23 41 20 36 46 55 15 35 9 7 32 37 58 6 3 14 47 31 40 30 53 44 4 50 29 34 10 43 39 57 5 22 27 45 51 42 24 16 18 21 52 17 48 1", "output": "58 5 29 37 45 28 24 14 23 41 8 3 2 30 21 52 56 53 12 17 54 46 15 51 10 11 47 13 39 34 32 25 9 40 22 18 26 6 43 33 16 50 42 36 48 19 31 57 1 38 49 55 35 4 20 7 44 27" }, { "input": "34\n20 25 2 3 33 29 1 16 14 7 21 9 32 31 6 26 22 4 27 23 24 10 34 12 19 15 5 18 28 17 13 8 11 30", "output": "7 3 4 18 27 15 10 32 12 22 33 24 31 9 26 8 30 28 25 1 11 17 20 21 2 16 19 29 6 34 14 13 5 23" }, { "input": "53\n47 29 46 25 23 13 7 31 33 4 38 11 35 16 42 14 15 43 34 39 28 18 6 45 30 1 40 20 2 37 5 32 24 12 44 26 27 3 19 51 36 21 22 9 10 50 41 48 49 53 8 17 52", "output": "26 29 38 10 31 23 7 51 44 45 12 34 6 16 17 14 52 22 39 28 42 43 5 33 4 36 37 21 2 25 8 32 9 19 13 41 30 11 20 27 47 15 18 35 24 3 1 48 49 46 40 53 50" }, { "input": "99\n77 87 90 48 53 38 68 6 28 57 35 82 63 71 60 41 3 12 86 65 10 59 22 67 33 74 93 27 24 1 61 43 25 4 51 52 15 88 9 31 30 42 89 49 23 21 29 32 46 73 37 16 5 69 56 26 92 64 20 54 75 14 98 13 94 2 95 7 36 66 58 8 50 78 84 45 11 96 76 62 97 80 40 39 47 85 34 79 83 17 91 72 19 44 70 81 55 99 18", "output": "30 66 17 34 53 8 68 72 39 21 77 18 64 62 37 52 90 99 93 59 46 23 45 29 33 56 28 9 47 41 40 48 25 87 11 69 51 6 84 83 16 42 32 94 76 49 85 4 44 73 35 36 5 60 97 55 10 71 22 15 31 80 13 58 20 70 24 7 54 95 14 92 50 26 61 79 1 74 88 82 96 12 89 75 86 19 2 38 43 3 91 57 27 65 67 78 81 63 98" }, { "input": "32\n17 29 2 6 30 8 26 7 1 27 10 9 13 24 31 21 15 19 22 18 4 11 25 28 32 3 23 12 5 14 20 16", "output": "9 3 26 21 29 4 8 6 12 11 22 28 13 30 17 32 1 20 18 31 16 19 27 14 23 7 10 24 2 5 15 25" }, { "input": "65\n18 40 1 60 17 19 4 6 12 49 28 58 2 25 13 14 64 56 61 34 62 30 59 51 26 8 33 63 36 48 46 7 43 21 31 27 11 44 29 5 32 23 35 9 53 57 52 50 15 38 42 3 54 65 55 41 20 24 22 47 45 10 39 16 37", "output": "3 13 52 7 40 8 32 26 44 62 37 9 15 16 49 64 5 1 6 57 34 59 42 58 14 25 36 11 39 22 35 41 27 20 43 29 65 50 63 2 56 51 33 38 61 31 60 30 10 48 24 47 45 53 55 18 46 12 23 4 19 21 28 17 54" }, { "input": "71\n35 50 55 58 25 32 26 40 63 34 44 53 24 18 37 7 64 27 56 65 1 19 2 43 42 14 57 47 22 13 59 61 39 67 30 45 54 38 33 48 6 5 3 69 36 21 41 4 16 46 20 17 15 12 10 70 68 23 60 31 52 29 66 28 51 49 62 11 8 9 71", "output": "21 23 43 48 42 41 16 69 70 55 68 54 30 26 53 49 52 14 22 51 46 29 58 13 5 7 18 64 62 35 60 6 39 10 1 45 15 38 33 8 47 25 24 11 36 50 28 40 66 2 65 61 12 37 3 19 27 4 31 59 32 67 9 17 20 63 34 57 44 56 71" }, { "input": "74\n33 8 42 63 64 61 31 74 11 50 68 14 36 25 57 30 7 44 21 15 6 9 23 59 46 3 73 16 62 51 40 60 41 54 5 39 35 28 48 4 58 12 66 69 13 26 71 1 24 19 29 52 37 2 20 43 18 72 17 56 34 38 65 67 27 10 47 70 53 32 45 55 49 22", "output": "48 54 26 40 35 21 17 2 22 66 9 42 45 12 20 28 59 57 50 55 19 74 23 49 14 46 65 38 51 16 7 70 1 61 37 13 53 62 36 31 33 3 56 18 71 25 67 39 73 10 30 52 69 34 72 60 15 41 24 32 6 29 4 5 63 43 64 11 44 68 47 58 27 8" }, { "input": "96\n78 10 82 46 38 91 77 69 2 27 58 80 79 44 59 41 6 31 76 11 42 48 51 37 19 87 43 25 52 32 1 39 63 29 21 65 53 74 92 16 15 95 90 83 30 73 71 5 50 17 96 33 86 60 67 64 20 26 61 40 55 88 94 93 9 72 47 57 14 45 22 3 54 68 13 24 4 7 56 81 89 70 49 8 84 28 18 62 35 36 75 23 66 85 34 12", "output": "31 9 72 77 48 17 78 84 65 2 20 96 75 69 41 40 50 87 25 57 35 71 92 76 28 58 10 86 34 45 18 30 52 95 89 90 24 5 32 60 16 21 27 14 70 4 67 22 83 49 23 29 37 73 61 79 68 11 15 54 59 88 33 56 36 93 55 74 8 82 47 66 46 38 91 19 7 1 13 12 80 3 44 85 94 53 26 62 81 43 6 39 64 63 42 51" }, { "input": "7\n2 1 5 7 3 4 6", "output": "2 1 5 6 3 7 4" }, { "input": "51\n8 33 37 2 16 22 24 30 4 9 5 15 27 3 18 39 31 26 10 17 46 41 25 14 6 1 29 48 36 20 51 49 21 43 19 13 38 50 47 34 11 23 28 12 42 7 32 40 44 45 35", "output": "26 4 14 9 11 25 46 1 10 19 41 44 36 24 12 5 20 15 35 30 33 6 42 7 23 18 13 43 27 8 17 47 2 40 51 29 3 37 16 48 22 45 34 49 50 21 39 28 32 38 31" }, { "input": "27\n12 14 7 3 20 21 25 13 22 15 23 4 2 24 10 17 19 8 26 11 27 18 9 5 6 1 16", "output": "26 13 4 12 24 25 3 18 23 15 20 1 8 2 10 27 16 22 17 5 6 9 11 14 7 19 21" }, { "input": "71\n51 13 20 48 54 23 24 64 14 62 71 67 57 53 3 30 55 43 33 25 39 40 66 6 46 18 5 19 61 16 32 68 70 41 60 44 29 49 27 69 50 38 10 17 45 56 9 21 26 63 28 35 7 59 1 65 2 15 8 11 12 34 37 47 58 22 31 4 36 42 52", "output": "55 57 15 68 27 24 53 59 47 43 60 61 2 9 58 30 44 26 28 3 48 66 6 7 20 49 39 51 37 16 67 31 19 62 52 69 63 42 21 22 34 70 18 36 45 25 64 4 38 41 1 71 14 5 17 46 13 65 54 35 29 10 50 8 56 23 12 32 40 33 11" }, { "input": "9\n8 5 2 6 1 9 4 7 3", "output": "5 3 9 7 2 4 8 1 6" }, { "input": "29\n10 24 11 5 26 25 2 9 22 15 8 14 29 21 4 1 23 17 3 12 13 16 18 28 19 20 7 6 27", "output": "16 7 19 15 4 28 27 11 8 1 3 20 21 12 10 22 18 23 25 26 14 9 17 2 6 5 29 24 13" }, { "input": "60\n39 25 42 4 55 60 16 18 47 1 11 40 7 50 19 35 49 54 12 3 30 38 2 58 17 26 45 6 33 43 37 32 52 36 15 23 27 59 24 20 28 14 8 9 13 29 44 46 41 21 5 48 51 22 31 56 57 53 10 34", "output": "10 23 20 4 51 28 13 43 44 59 11 19 45 42 35 7 25 8 15 40 50 54 36 39 2 26 37 41 46 21 55 32 29 60 16 34 31 22 1 12 49 3 30 47 27 48 9 52 17 14 53 33 58 18 5 56 57 24 38 6" }, { "input": "50\n37 45 22 5 12 21 28 24 18 47 20 25 8 50 14 2 34 43 11 16 49 41 48 1 19 31 39 46 32 23 15 42 3 35 38 30 44 26 10 9 40 36 7 17 33 4 27 6 13 29", "output": "24 16 33 46 4 48 43 13 40 39 19 5 49 15 31 20 44 9 25 11 6 3 30 8 12 38 47 7 50 36 26 29 45 17 34 42 1 35 27 41 22 32 18 37 2 28 10 23 21 14" }, { "input": "30\n8 29 28 16 17 25 27 15 21 11 6 20 2 13 1 30 5 4 24 10 14 3 23 18 26 9 12 22 19 7", "output": "15 13 22 18 17 11 30 1 26 20 10 27 14 21 8 4 5 24 29 12 9 28 23 19 6 25 7 3 2 16" }, { "input": "46\n15 2 44 43 38 19 31 42 4 37 29 30 24 45 27 41 8 20 33 7 35 3 18 46 36 26 1 28 21 40 16 22 32 11 14 13 12 9 25 39 10 6 23 17 5 34", "output": "27 2 22 9 45 42 20 17 38 41 34 37 36 35 1 31 44 23 6 18 29 32 43 13 39 26 15 28 11 12 7 33 19 46 21 25 10 5 40 30 16 8 4 3 14 24" }, { "input": "9\n4 8 6 5 3 9 2 7 1", "output": "9 7 5 1 4 3 8 2 6" }, { "input": "46\n31 30 33 23 45 7 36 8 11 3 32 39 41 20 1 28 6 27 18 24 17 5 16 37 26 13 22 14 2 38 15 46 9 4 19 21 12 44 10 35 25 34 42 43 40 29", "output": "15 29 10 34 22 17 6 8 33 39 9 37 26 28 31 23 21 19 35 14 36 27 4 20 41 25 18 16 46 2 1 11 3 42 40 7 24 30 12 45 13 43 44 38 5 32" }, { "input": "66\n27 12 37 48 46 21 34 58 38 28 66 2 64 32 44 31 13 36 40 15 19 11 22 5 30 29 6 7 61 39 20 42 23 54 51 33 50 9 60 8 57 45 49 10 62 41 59 3 55 63 52 24 25 26 43 56 65 4 16 14 1 35 18 17 53 47", "output": "61 12 48 58 24 27 28 40 38 44 22 2 17 60 20 59 64 63 21 31 6 23 33 52 53 54 1 10 26 25 16 14 36 7 62 18 3 9 30 19 46 32 55 15 42 5 66 4 43 37 35 51 65 34 49 56 41 8 47 39 29 45 50 13 57 11" }, { "input": "13\n3 12 9 2 8 5 13 4 11 1 10 7 6", "output": "10 4 1 8 6 13 12 5 3 11 9 2 7" }, { "input": "80\n21 25 56 50 20 61 7 74 51 69 8 2 46 57 45 71 14 52 17 43 9 30 70 78 31 10 38 13 23 15 37 79 6 16 77 73 80 4 49 48 18 28 26 58 33 41 64 22 54 72 59 60 40 63 53 27 1 5 75 67 62 34 19 39 68 65 44 55 3 32 11 42 76 12 35 47 66 36 24 29", "output": "57 12 69 38 58 33 7 11 21 26 71 74 28 17 30 34 19 41 63 5 1 48 29 79 2 43 56 42 80 22 25 70 45 62 75 78 31 27 64 53 46 72 20 67 15 13 76 40 39 4 9 18 55 49 68 3 14 44 51 52 6 61 54 47 66 77 60 65 10 23 16 50 36 8 59 73 35 24 32 37" }, { "input": "63\n9 49 53 25 40 46 43 51 54 22 58 16 23 26 10 47 5 27 2 8 61 59 19 35 63 56 28 20 34 4 62 38 6 55 36 31 57 15 29 33 1 48 50 37 7 30 18 42 32 52 12 41 14 21 45 11 24 17 39 13 44 60 3", "output": "41 19 63 30 17 33 45 20 1 15 56 51 60 53 38 12 58 47 23 28 54 10 13 57 4 14 18 27 39 46 36 49 40 29 24 35 44 32 59 5 52 48 7 61 55 6 16 42 2 43 8 50 3 9 34 26 37 11 22 62 21 31 25" }, { "input": "26\n11 4 19 13 17 9 2 24 6 5 22 23 14 15 3 25 16 8 18 10 21 1 12 26 7 20", "output": "22 7 15 2 10 9 25 18 6 20 1 23 4 13 14 17 5 19 3 26 21 11 12 8 16 24" }, { "input": "69\n40 22 11 66 4 27 31 29 64 53 37 55 51 2 7 36 18 52 6 1 30 21 17 20 14 9 59 62 49 68 3 50 65 57 44 5 67 46 33 13 34 15 24 48 63 58 38 25 41 35 16 54 32 10 60 61 39 12 69 8 23 45 26 47 56 43 28 19 42", "output": "20 14 31 5 36 19 15 60 26 54 3 58 40 25 42 51 23 17 68 24 22 2 61 43 48 63 6 67 8 21 7 53 39 41 50 16 11 47 57 1 49 69 66 35 62 38 64 44 29 32 13 18 10 52 12 65 34 46 27 55 56 28 45 9 33 4 37 30 59" }, { "input": "6\n4 3 6 5 1 2", "output": "5 6 2 1 4 3" }, { "input": "9\n7 8 5 3 1 4 2 9 6", "output": "5 7 4 6 3 9 1 2 8" }, { "input": "41\n27 24 16 30 25 8 32 2 26 20 39 33 41 22 40 14 36 9 28 4 34 11 31 23 19 18 17 35 3 10 6 13 5 15 29 38 7 21 1 12 37", "output": "39 8 29 20 33 31 37 6 18 30 22 40 32 16 34 3 27 26 25 10 38 14 24 2 5 9 1 19 35 4 23 7 12 21 28 17 41 36 11 15 13" }, { "input": "1\n1", "output": "1" }, { "input": "20\n2 6 4 18 7 10 17 13 16 8 14 9 20 5 19 12 1 3 15 11", "output": "17 1 18 3 14 2 5 10 12 6 20 16 8 11 19 9 7 4 15 13" }, { "input": "2\n2 1", "output": "2 1" }, { "input": "60\n2 4 31 51 11 7 34 20 3 14 18 23 48 54 15 36 38 60 49 40 5 33 41 26 55 58 10 8 13 9 27 30 37 1 21 59 44 57 35 19 46 43 42 45 12 22 39 32 24 16 6 56 53 52 25 17 47 29 50 28", "output": "34 1 9 2 21 51 6 28 30 27 5 45 29 10 15 50 56 11 40 8 35 46 12 49 55 24 31 60 58 32 3 48 22 7 39 16 33 17 47 20 23 43 42 37 44 41 57 13 19 59 4 54 53 14 25 52 38 26 36 18" }, { "input": "14\n14 6 3 12 11 2 7 1 10 9 8 5 4 13", "output": "8 6 3 13 12 2 7 11 10 9 5 4 14 1" }, { "input": "81\n13 43 79 8 7 21 73 46 63 4 62 78 56 11 70 68 61 53 60 49 16 27 59 47 69 5 22 44 77 57 52 48 1 9 72 81 28 55 58 33 51 18 31 17 41 20 42 3 32 54 19 2 75 34 64 10 65 50 30 29 67 12 71 66 74 15 26 23 6 38 25 35 37 24 80 76 40 45 39 36 14", "output": "33 52 48 10 26 69 5 4 34 56 14 62 1 81 66 21 44 42 51 46 6 27 68 74 71 67 22 37 60 59 43 49 40 54 72 80 73 70 79 77 45 47 2 28 78 8 24 32 20 58 41 31 18 50 38 13 30 39 23 19 17 11 9 55 57 64 61 16 25 15 63 35 7 65 53 76 29 12 3 75 36" }, { "input": "42\n41 11 10 8 21 37 32 19 31 25 1 15 36 5 6 27 4 3 13 7 16 17 2 23 34 24 38 28 12 20 30 42 18 26 39 35 33 40 9 14 22 29", "output": "11 23 18 17 14 15 20 4 39 3 2 29 19 40 12 21 22 33 8 30 5 41 24 26 10 34 16 28 42 31 9 7 37 25 36 13 6 27 35 38 1 32" }, { "input": "97\n20 6 76 42 4 18 35 59 39 63 27 7 66 47 61 52 15 36 88 93 19 33 10 92 1 34 46 86 78 57 51 94 77 29 26 73 41 2 58 97 43 65 17 74 21 49 25 3 91 82 95 12 96 13 84 90 69 24 72 37 16 55 54 71 64 62 48 89 11 70 80 67 30 40 44 85 53 83 79 9 56 45 75 87 22 14 81 68 8 38 60 50 28 23 31 32 5", "output": "25 38 48 5 97 2 12 89 80 23 69 52 54 86 17 61 43 6 21 1 45 85 94 58 47 35 11 93 34 73 95 96 22 26 7 18 60 90 9 74 37 4 41 75 82 27 14 67 46 92 31 16 77 63 62 81 30 39 8 91 15 66 10 65 42 13 72 88 57 70 64 59 36 44 83 3 33 29 79 71 87 50 78 55 76 28 84 19 68 56 49 24 20 32 51 53 40" }, { "input": "62\n15 27 46 6 8 51 14 56 23 48 42 49 52 22 20 31 29 12 47 3 62 34 37 35 32 57 19 25 5 60 61 38 18 10 11 55 45 53 17 30 9 36 4 50 41 16 44 28 40 59 24 1 13 39 26 7 33 58 2 43 21 54", "output": "52 59 20 43 29 4 56 5 41 34 35 18 53 7 1 46 39 33 27 15 61 14 9 51 28 55 2 48 17 40 16 25 57 22 24 42 23 32 54 49 45 11 60 47 37 3 19 10 12 44 6 13 38 62 36 8 26 58 50 30 31 21" }, { "input": "61\n35 27 4 61 52 32 41 46 14 37 17 54 55 31 11 26 44 49 15 30 9 50 45 39 7 38 53 3 58 40 13 56 18 19 28 6 43 5 21 42 20 34 2 25 36 12 33 57 16 60 1 8 59 10 22 23 24 48 51 47 29", "output": "51 43 28 3 38 36 25 52 21 54 15 46 31 9 19 49 11 33 34 41 39 55 56 57 44 16 2 35 61 20 14 6 47 42 1 45 10 26 24 30 7 40 37 17 23 8 60 58 18 22 59 5 27 12 13 32 48 29 53 50 4" }, { "input": "59\n31 26 36 15 17 19 10 53 11 34 13 46 55 9 44 7 8 37 32 52 47 25 51 22 35 39 41 4 43 24 5 27 20 57 6 38 3 28 21 40 50 18 14 56 33 45 12 2 49 59 54 29 16 48 42 58 1 30 23", "output": "57 48 37 28 31 35 16 17 14 7 9 47 11 43 4 53 5 42 6 33 39 24 59 30 22 2 32 38 52 58 1 19 45 10 25 3 18 36 26 40 27 55 29 15 46 12 21 54 49 41 23 20 8 51 13 44 34 56 50" }, { "input": "10\n2 10 7 4 1 5 8 6 3 9", "output": "5 1 9 4 6 8 3 7 10 2" }, { "input": "14\n14 2 1 8 6 12 11 10 9 7 3 4 5 13", "output": "3 2 11 12 13 5 10 4 9 8 7 6 14 1" }, { "input": "43\n28 38 15 14 31 42 27 30 19 33 43 26 22 29 18 32 3 13 1 8 35 34 4 12 11 17 41 21 5 25 39 37 20 23 7 24 16 10 40 9 6 36 2", "output": "19 43 17 23 29 41 35 20 40 38 25 24 18 4 3 37 26 15 9 33 28 13 34 36 30 12 7 1 14 8 5 16 10 22 21 42 32 2 31 39 27 6 11" }, { "input": "86\n39 11 20 31 28 76 29 64 35 21 41 71 12 82 5 37 80 73 38 26 79 75 23 15 59 45 47 6 3 62 50 49 51 22 2 65 86 60 70 42 74 17 1 30 55 44 8 66 81 27 57 77 43 13 54 32 72 46 48 56 14 34 78 52 36 85 24 19 69 83 25 61 7 4 84 33 63 58 18 40 68 10 67 9 16 53", "output": "43 35 29 74 15 28 73 47 84 82 2 13 54 61 24 85 42 79 68 3 10 34 23 67 71 20 50 5 7 44 4 56 76 62 9 65 16 19 1 80 11 40 53 46 26 58 27 59 32 31 33 64 86 55 45 60 51 78 25 38 72 30 77 8 36 48 83 81 69 39 12 57 18 41 22 6 52 63 21 17 49 14 70 75 66 37" }, { "input": "99\n65 78 56 98 33 24 61 40 29 93 1 64 57 22 25 52 67 95 50 3 31 15 90 68 71 83 38 36 6 46 89 26 4 87 14 88 72 37 23 43 63 12 80 96 5 34 73 86 9 48 92 62 99 10 16 20 66 27 28 2 82 70 30 94 49 8 84 69 18 60 58 59 44 39 21 7 91 76 54 19 75 85 74 47 55 32 97 77 51 13 35 79 45 42 11 41 17 81 53", "output": "11 60 20 33 45 29 76 66 49 54 95 42 90 35 22 55 97 69 80 56 75 14 39 6 15 32 58 59 9 63 21 86 5 46 91 28 38 27 74 8 96 94 40 73 93 30 84 50 65 19 89 16 99 79 85 3 13 71 72 70 7 52 41 12 1 57 17 24 68 62 25 37 47 83 81 78 88 2 92 43 98 61 26 67 82 48 34 36 31 23 77 51 10 64 18 44 87 4 53" }, { "input": "100\n42 23 48 88 36 6 18 70 96 1 34 40 46 22 39 55 85 93 45 67 71 75 59 9 21 3 86 63 65 68 20 38 73 31 84 90 50 51 56 95 72 33 49 19 83 76 54 74 100 30 17 98 15 94 4 97 5 99 81 27 92 32 89 12 13 91 87 29 60 11 52 43 35 58 10 25 16 80 28 2 44 61 8 82 66 69 41 24 57 62 78 37 79 77 53 7 14 47 26 64", "output": "10 80 26 55 57 6 96 83 24 75 70 64 65 97 53 77 51 7 44 31 25 14 2 88 76 99 60 79 68 50 34 62 42 11 73 5 92 32 15 12 87 1 72 81 19 13 98 3 43 37 38 71 95 47 16 39 89 74 23 69 82 90 28 100 29 85 20 30 86 8 21 41 33 48 22 46 94 91 93 78 59 84 45 35 17 27 67 4 63 36 66 61 18 54 40 9 56 52 58 49" }, { "input": "99\n8 68 94 75 71 60 57 58 6 11 5 48 65 41 49 12 46 72 95 59 13 70 74 7 84 62 17 36 55 76 38 79 2 85 23 10 32 99 87 50 83 28 54 91 53 51 1 3 97 81 21 89 93 78 61 26 82 96 4 98 25 40 31 44 24 47 30 52 14 16 39 27 9 29 45 18 67 63 37 43 90 66 19 69 88 22 92 77 34 42 73 80 56 64 20 35 15 33 86", "output": "47 33 48 59 11 9 24 1 73 36 10 16 21 69 97 70 27 76 83 95 51 86 35 65 61 56 72 42 74 67 63 37 98 89 96 28 79 31 71 62 14 90 80 64 75 17 66 12 15 40 46 68 45 43 29 93 7 8 20 6 55 26 78 94 13 82 77 2 84 22 5 18 91 23 4 30 88 54 32 92 50 57 41 25 34 99 39 85 52 81 44 87 53 3 19 58 49 60 38" }, { "input": "99\n12 99 88 13 7 19 74 47 23 90 16 29 26 11 58 60 64 98 37 18 82 67 72 46 51 85 17 92 87 20 77 36 78 71 57 35 80 54 73 15 14 62 97 45 31 79 94 56 76 96 28 63 8 44 38 86 49 2 52 66 61 59 10 43 55 50 22 34 83 53 95 40 81 21 30 42 27 3 5 41 1 70 69 25 93 48 65 6 24 89 91 33 39 68 9 4 32 84 75", "output": "81 58 78 96 79 88 5 53 95 63 14 1 4 41 40 11 27 20 6 30 74 67 9 89 84 13 77 51 12 75 45 97 92 68 36 32 19 55 93 72 80 76 64 54 44 24 8 86 57 66 25 59 70 38 65 48 35 15 62 16 61 42 52 17 87 60 22 94 83 82 34 23 39 7 99 49 31 33 46 37 73 21 69 98 26 56 29 3 90 10 91 28 85 47 71 50 43 18 2" }, { "input": "99\n20 79 26 75 99 69 98 47 93 62 18 42 43 38 90 66 67 8 13 84 76 58 81 60 64 46 56 23 78 17 86 36 19 52 85 39 48 27 96 49 37 95 5 31 10 24 12 1 80 35 92 33 16 68 57 54 32 29 45 88 72 77 4 87 97 89 59 3 21 22 61 94 83 15 44 34 70 91 55 9 51 50 73 11 14 6 40 7 63 25 2 82 41 65 28 74 71 30 53", "output": "48 91 68 63 43 86 88 18 80 45 84 47 19 85 74 53 30 11 33 1 69 70 28 46 90 3 38 95 58 98 44 57 52 76 50 32 41 14 36 87 93 12 13 75 59 26 8 37 40 82 81 34 99 56 79 27 55 22 67 24 71 10 89 25 94 16 17 54 6 77 97 61 83 96 4 21 62 29 2 49 23 92 73 20 35 31 64 60 66 15 78 51 9 72 42 39 65 7 5" }, { "input": "99\n74 20 9 1 60 85 65 13 4 25 40 99 5 53 64 3 36 31 73 44 55 50 45 63 98 51 68 6 47 37 71 82 88 34 84 18 19 12 93 58 86 7 11 46 90 17 33 27 81 69 42 59 56 32 95 52 76 61 96 62 78 43 66 21 49 97 75 14 41 72 89 16 30 79 22 23 15 83 91 38 48 2 87 26 28 80 94 70 54 92 57 10 8 35 67 77 29 24 39", "output": "4 82 16 9 13 28 42 93 3 92 43 38 8 68 77 72 46 36 37 2 64 75 76 98 10 84 48 85 97 73 18 54 47 34 94 17 30 80 99 11 69 51 62 20 23 44 29 81 65 22 26 56 14 89 21 53 91 40 52 5 58 60 24 15 7 63 95 27 50 88 31 70 19 1 67 57 96 61 74 86 49 32 78 35 6 41 83 33 71 45 79 90 39 87 55 59 66 25 12" }, { "input": "99\n50 94 2 18 69 90 59 83 75 68 77 97 39 78 25 7 16 9 49 4 42 89 44 48 17 96 61 70 3 10 5 81 56 57 88 6 98 1 46 67 92 37 11 30 85 41 8 36 51 29 20 71 19 79 74 93 43 34 55 40 38 21 64 63 32 24 72 14 12 86 82 15 65 23 66 22 28 53 13 26 95 99 91 52 76 27 60 45 47 33 73 84 31 35 54 80 58 62 87", "output": "38 3 29 20 31 36 16 47 18 30 43 69 79 68 72 17 25 4 53 51 62 76 74 66 15 80 86 77 50 44 93 65 90 58 94 48 42 61 13 60 46 21 57 23 88 39 89 24 19 1 49 84 78 95 59 33 34 97 7 87 27 98 64 63 73 75 40 10 5 28 52 67 91 55 9 85 11 14 54 96 32 71 8 92 45 70 99 35 22 6 83 41 56 2 81 26 12 37 82" }, { "input": "99\n19 93 14 34 39 37 33 15 52 88 7 43 69 27 9 77 94 31 48 22 63 70 79 17 50 6 81 8 76 58 23 74 86 11 57 62 41 87 75 51 12 18 68 56 95 3 80 83 84 29 24 61 71 78 59 96 20 85 90 28 45 36 38 97 1 49 40 98 44 67 13 73 72 91 47 10 30 54 35 42 4 2 92 26 64 60 53 21 5 82 46 32 55 66 16 89 99 65 25", "output": "65 82 46 81 89 26 11 28 15 76 34 41 71 3 8 95 24 42 1 57 88 20 31 51 99 84 14 60 50 77 18 92 7 4 79 62 6 63 5 67 37 80 12 69 61 91 75 19 66 25 40 9 87 78 93 44 35 30 55 86 52 36 21 85 98 94 70 43 13 22 53 73 72 32 39 29 16 54 23 47 27 90 48 49 58 33 38 10 96 59 74 83 2 17 45 56 64 68 97" }, { "input": "99\n86 25 50 51 62 39 41 67 44 20 45 14 80 88 66 7 36 59 13 84 78 58 96 75 2 43 48 47 69 12 19 98 22 38 28 55 11 76 68 46 53 70 85 34 16 33 91 30 8 40 74 60 94 82 87 32 37 4 5 10 89 73 90 29 35 26 23 57 27 65 24 3 9 83 77 72 6 31 15 92 93 79 64 18 63 42 56 1 52 97 17 81 71 21 49 99 54 95 61", "output": "88 25 72 58 59 77 16 49 73 60 37 30 19 12 79 45 91 84 31 10 94 33 67 71 2 66 69 35 64 48 78 56 46 44 65 17 57 34 6 50 7 86 26 9 11 40 28 27 95 3 4 89 41 97 36 87 68 22 18 52 99 5 85 83 70 15 8 39 29 42 93 76 62 51 24 38 75 21 82 13 92 54 74 20 43 1 55 14 61 63 47 80 81 53 98 23 90 32 96" }, { "input": "100\n66 44 99 15 43 79 28 33 88 90 49 68 82 38 9 74 4 58 29 81 31 94 10 42 89 21 63 40 62 61 18 6 84 72 48 25 67 69 71 85 98 34 83 70 65 78 91 77 93 41 23 24 87 11 55 12 59 73 36 97 7 14 26 39 30 27 45 20 50 17 53 2 57 47 95 56 75 19 37 96 16 35 8 3 76 60 13 86 5 32 64 80 46 51 54 100 1 22 52 92", "output": "97 72 84 17 89 32 61 83 15 23 54 56 87 62 4 81 70 31 78 68 26 98 51 52 36 63 66 7 19 65 21 90 8 42 82 59 79 14 64 28 50 24 5 2 67 93 74 35 11 69 94 99 71 95 55 76 73 18 57 86 30 29 27 91 45 1 37 12 38 44 39 34 58 16 77 85 48 46 6 92 20 13 43 33 40 88 53 9 25 10 47 100 49 22 75 80 60 41 3 96" }, { "input": "99\n3 73 32 37 25 15 93 63 85 8 91 78 80 5 39 48 46 7 83 70 23 96 9 29 77 53 30 20 56 50 13 45 21 76 87 99 65 31 16 18 14 72 51 28 43 2 81 34 38 40 66 54 74 26 71 4 61 17 58 24 22 33 49 36 42 11 12 55 60 27 62 90 79 92 94 68 1 52 84 41 86 35 69 75 47 10 64 88 97 98 67 19 89 95 59 82 57 44 6", "output": "77 46 1 56 14 99 18 10 23 86 66 67 31 41 6 39 58 40 92 28 33 61 21 60 5 54 70 44 24 27 38 3 62 48 82 64 4 49 15 50 80 65 45 98 32 17 85 16 63 30 43 78 26 52 68 29 97 59 95 69 57 71 8 87 37 51 91 76 83 20 55 42 2 53 84 34 25 12 73 13 47 96 19 79 9 81 35 88 93 72 11 74 7 75 94 22 89 90 36" }, { "input": "100\n100 99 98 97 96 95 94 93 92 91 90 89 88 87 86 85 84 83 82 81 80 79 78 77 76 75 74 73 72 71 70 69 68 67 66 65 64 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1", "output": "100 99 98 97 96 95 94 93 92 91 90 89 88 87 86 85 84 83 82 81 80 79 78 77 76 75 74 73 72 71 70 69 68 67 66 65 64 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1" } ]	1,694,156,116	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	4	62	0	n=int(input()) x=input().split() l=sorted([i for i in x]) pos=[] for i in l: pos.append(x.index(i)+1) print(*pos)	Title: Presents Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. If 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 pi. He also remembered that each of his friends received exactly one gift. Now Petya wants to know for each friend i the number of a friend who has given him a gift. Input Specification: The first line contains one integer n (1<=≤<=n<=≤<=100) — the quantity of friends Petya invited to the party. The second line contains n space-separated integers: the i-th number is pi — the number of a friend who gave a gift to friend number i. It is guaranteed that each friend received exactly one gift. It is possible that some friends do not share Petya's ideas of giving gifts to somebody else. Those friends gave the gifts to themselves. Output Specification: Print n space-separated integers: the i-th number should equal the number of the friend who gave a gift to friend number i. Demo Input: ['4\n2 3 4 1\n', '3\n1 3 2\n', '2\n1 2\n'] Demo Output: ['4 1 2 3\n', '1 3 2\n', '1 2\n'] Note: none	```python n=int(input()) x=input().split() l=sorted([i for i in x]) pos=[] for i in l: pos.append(x.index(i)+1) print(*pos) ```	0
742	A	Arpa’s hard exam and Mehrdad’s naive cheat	PROGRAMMING	1,000	[ "implementation", "math", "number theory" ]		null	null	There exists an island called Arpa’s land, some beautiful girls live there, as ugly ones do. Mehrdad 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 1378n. Mehrdad has become quite confused and wants you to help him. Please help, although it's a naive cheat.	The single line of input contains one integer n (0<=<=≤<=<=n<=<=≤<=<=109).	Print single integer — the last digit of 1378n.	[ "1\n", "2\n" ]	[ "8", "4" ]	In the first example, last digit of 1378<sup class="upper-index">1</sup> = 1378 is 8. In the second example, last digit of 1378<sup class="upper-index">2</sup> = 1378·1378 = 1898884 is 4.	500	[ { "input": "1", "output": "8" }, { "input": "2", "output": "4" }, { "input": "1000", "output": "6" }, { "input": "3", "output": "2" }, { "input": "4", "output": "6" }, { "input": "1000000000", "output": "6" }, { "input": "5", "output": "8" }, { "input": "6", "output": "4" }, { "input": "999999999", "output": "2" }, { "input": "1378", "output": "4" }, { "input": "13781378", "output": "4" }, { "input": "51202278", "output": "4" }, { "input": "999999998", "output": "4" }, { "input": "999999997", "output": "8" }, { "input": "12193721", "output": "8" }, { "input": "0", "output": "1" }, { "input": "989898989", "output": "8" }, { "input": "7", "output": "2" }, { "input": "8", "output": "6" }, { "input": "9", "output": "8" }, { "input": "10", "output": "4" }, { "input": "11", "output": "2" }, { "input": "12", "output": "6" }, { "input": "13", "output": "8" }, { "input": "14", "output": "4" }, { "input": "15", "output": "2" }, { "input": "16", "output": "6" }, { "input": "999999996", "output": "6" }, { "input": "999999995", "output": "2" }, { "input": "999999994", "output": "4" } ]	1,659,837,006	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	30	0	l = int(input()) if l % 4 == 1: print(8) if l % 4 == 2: print(4) if l % 4 == 3: print(2) else: print(6)	Title: Arpa’s hard exam and Mehrdad’s naive cheat Time Limit: None seconds Memory Limit: None megabytes Problem Description: There exists an island called Arpa’s land, some beautiful girls live there, as ugly ones do. Mehrdad 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 1378n. Mehrdad has become quite confused and wants you to help him. Please help, although it's a naive cheat. Input Specification: The single line of input contains one integer n (0<=<=≤<=<=n<=<=≤<=<=109). Output Specification: Print single integer — the last digit of 1378n. Demo Input: ['1\n', '2\n'] Demo Output: ['8', '4'] Note: In the first example, last digit of 1378<sup class="upper-index">1</sup> = 1378 is 8. In the second example, last digit of 1378<sup class="upper-index">2</sup> = 1378·1378 = 1898884 is 4.	```python l = int(input()) if l % 4 == 1: print(8) if l % 4 == 2: print(4) if l % 4 == 3: print(2) else: print(6) ```	0
690	D2	The Wall (medium)	PROGRAMMING	1,800	[ "combinatorics" ]		null	null	Heidi the Cow is aghast: cracks in the northern Wall? Zombies gathering outside, forming groups, preparing their assault? This must not happen! Quickly, she fetches her HC2 (Handbook of Crazy Constructions) and looks for the right chapter: How to build a wall: 1. Take a set of bricks. 1. Select one of the possible wall designs. Computing the number of possible designs is left as an exercise to the reader. 1. Place bricks on top of each other, according to the chosen design. This seems easy enough. But Heidi is a Coding Cow, not a Constructing Cow. Her mind keeps coming back to point 2b. Despite the imminent danger of a zombie onslaught, she wonders just how many possible walls she could build with up to n bricks. A wall is a set of wall segments as defined in the easy version. How many different walls can be constructed such that the wall consists of at least 1 and at most n bricks? Two walls are different if there exist a column c and a row r such that one wall has a brick in this spot, and the other does not. Along with n, you will be given C, the width of the wall (as defined in the easy version). Return the number of different walls modulo 106<=+<=3.	The first line contains two space-separated integers n and C, 1<=≤<=n<=≤<=500000, 1<=≤<=C<=≤<=200000.	Print the number of different walls that Heidi could build, modulo 106<=+<=3.	[ "5 1\n", "2 2\n", "3 2\n", "11 5\n", "37 63\n" ]	[ "5\n", "5\n", "9\n", "4367\n", "230574\n" ]	The number 10<sup class="upper-index">6</sup> + 3 is prime. In the second sample case, the five walls are: In the third sample case, the nine walls are the five as in the second sample case and in addition the following four:	0	[ { "input": "5 1", "output": "5" }, { "input": "2 2", "output": "5" }, { "input": "3 2", "output": "9" }, { "input": "11 5", "output": "4367" }, { "input": "37 63", "output": "230574" }, { "input": "1 1", "output": "1" }, { "input": "350000 140000", "output": "453366" }, { "input": "350000 160000", "output": "155549" }, { "input": "350000 180000", "output": "708073" }, { "input": "350000 200000", "output": "504934" }, { "input": "400000 140000", "output": "956370" }, { "input": "400000 160000", "output": "480365" }, { "input": "400000 180000", "output": "376155" }, { "input": "400000 200000", "output": "388234" }, { "input": "450000 140000", "output": "175993" }, { "input": "450000 160000", "output": "926957" }, { "input": "450000 180000", "output": "135727" }, { "input": "450000 200000", "output": "997315" }, { "input": "500000 140000", "output": "775486" }, { "input": "500000 160000", "output": "298591" }, { "input": "500000 180000", "output": "901135" }, { "input": "500000 200000", "output": "781209" } ]	1,590,765,021	2,147,483,647	PyPy 3	MEMORY_LIMIT_EXCEEDED	TESTS	6	1,825	268,390,400	import math as ma n,c=list(map(int,input().split())) a=[c] b=2 d=c+1 for i in range(n-1): a.append((a[-1]d)//b) b+=1 d+=1 m=10*6+3 print(sum(a)%m)	Title: The Wall (medium) Time Limit: None seconds Memory Limit: None megabytes Problem Description: Heidi the Cow is aghast: cracks in the northern Wall? Zombies gathering outside, forming groups, preparing their assault? This must not happen! Quickly, she fetches her HC2 (Handbook of Crazy Constructions) and looks for the right chapter: How to build a wall: 1. Take a set of bricks. 1. Select one of the possible wall designs. Computing the number of possible designs is left as an exercise to the reader. 1. Place bricks on top of each other, according to the chosen design. This seems easy enough. But Heidi is a Coding Cow, not a Constructing Cow. Her mind keeps coming back to point 2b. Despite the imminent danger of a zombie onslaught, she wonders just how many possible walls she could build with up to n bricks. A wall is a set of wall segments as defined in the easy version. How many different walls can be constructed such that the wall consists of at least 1 and at most n bricks? Two walls are different if there exist a column c and a row r such that one wall has a brick in this spot, and the other does not. Along with n, you will be given C, the width of the wall (as defined in the easy version). Return the number of different walls modulo 106<=+<=3. Input Specification: The first line contains two space-separated integers n and C, 1<=≤<=n<=≤<=500000, 1<=≤<=C<=≤<=200000. Output Specification: Print the number of different walls that Heidi could build, modulo 106<=+<=3. Demo Input: ['5 1\n', '2 2\n', '3 2\n', '11 5\n', '37 63\n'] Demo Output: ['5\n', '5\n', '9\n', '4367\n', '230574\n'] Note: The number 10<sup class="upper-index">6</sup> + 3 is prime. In the second sample case, the five walls are: In the third sample case, the nine walls are the five as in the second sample case and in addition the following four:	```python import math as ma n,c=list(map(int,input().split())) a=[c] b=2 d=c+1 for i in range(n-1): a.append((a[-1]d)//b) b+=1 d+=1 m=10*6+3 print(sum(a)%m) ```	0
381	A	Sereja and Dima	PROGRAMMING	800	[ "greedy", "implementation", "two pointers" ]		null	null	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. Sereja and Dima are being greedy. Each of them chooses the card with the larger number during his move. Inna 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.	The first line contains integer n (1<=≤<=n<=≤<=1000) — the number of cards on the table. The second line contains space-separated numbers on the cards from left to right. The numbers on the cards are distinct integers from 1 to 1000.	On a single line, print two integers. The first number is the number of Sereja's points at the end of the game, the second number is the number of Dima's points at the end of the game.	[ "4\n4 1 2 10\n", "7\n1 2 3 4 5 6 7\n" ]	[ "12 5\n", "16 12\n" ]	In the first sample Sereja will take cards with numbers 10 and 2, so Sereja's sum is 12. Dima will take cards with numbers 4 and 1, so Dima's sum is 5.	500	[ { "input": "4\n4 1 2 10", "output": "12 5" }, { "input": "7\n1 2 3 4 5 6 7", "output": "16 12" }, { "input": "42\n15 29 37 22 16 5 26 31 6 32 19 3 45 36 33 14 25 20 48 7 42 11 24 28 9 18 8 21 47 17 38 40 44 4 35 1 43 39 41 27 12 13", "output": "613 418" }, { "input": "43\n32 1 15 48 38 26 25 14 20 44 11 30 3 42 49 19 18 46 5 45 10 23 34 9 29 41 2 52 6 17 35 4 50 22 33 51 7 28 47 13 39 37 24", "output": "644 500" }, { "input": "1\n3", "output": "3 0" }, { "input": "45\n553 40 94 225 415 471 126 190 647 394 515 303 189 159 308 6 139 132 326 78 455 75 85 295 135 613 360 614 351 228 578 259 258 591 444 29 33 463 561 174 368 183 140 168 646", "output": "6848 6568" }, { "input": "44\n849 373 112 307 479 608 856 769 526 82 168 143 573 762 115 501 688 36 214 450 396 496 236 309 287 786 397 43 811 141 745 846 350 270 276 677 420 459 403 722 267 54 394 727", "output": "9562 9561" }, { "input": "35\n10 15 18 1 28 16 2 33 6 22 23 4 9 25 35 8 7 26 3 20 30 14 31 19 27 32 11 5 29 24 21 34 13 17 12", "output": "315 315" }, { "input": "17\n580 376 191 496 73 44 520 357 483 149 81 178 514 300 216 598 304", "output": "3238 2222" }, { "input": "30\n334 443 223 424 168 549 189 303 429 559 516 220 459 134 344 346 316 446 209 148 487 526 69 286 102 366 518 280 392 325", "output": "5246 4864" }, { "input": "95\n122 29 188 265 292 287 183 225 222 187 155 256 64 148 173 278 218 136 290 17 31 130 2 87 57 283 255 280 68 166 174 142 102 39 116 206 288 154 26 78 296 172 184 232 77 91 277 8 249 186 94 93 207 251 257 195 101 299 193 124 293 65 58 35 24 302 220 189 252 125 27 284 247 182 141 103 198 97 234 83 281 216 85 180 267 236 109 143 149 239 79 300 191 244 71", "output": "8147 7807" }, { "input": "1\n1", "output": "1 0" } ]	1,690,752,599	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	15	0	c = int(input()) t = input().split() for i in range(c): t[i] = int(t[i]) t.sort() s, d = 0, 0 for i in range(c): if i % 2 == 0: d += t[0] else: s += t[0] t = t[1:] print(str(s) + ' ' + str(d))	Title: Sereja and Dima Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. Sereja and Dima are being greedy. Each of them chooses the card with the larger number during his move. Inna 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 Specification: The first line contains integer n (1<=≤<=n<=≤<=1000) — the number of cards on the table. The second line contains space-separated numbers on the cards from left to right. The numbers on the cards are distinct integers from 1 to 1000. Output Specification: On a single line, print two integers. The first number is the number of Sereja's points at the end of the game, the second number is the number of Dima's points at the end of the game. Demo Input: ['4\n4 1 2 10\n', '7\n1 2 3 4 5 6 7\n'] Demo Output: ['12 5\n', '16 12\n'] Note: In the first sample Sereja will take cards with numbers 10 and 2, so Sereja's sum is 12. Dima will take cards with numbers 4 and 1, so Dima's sum is 5.	```python c = int(input()) t = input().split() for i in range(c): t[i] = int(t[i]) t.sort() s, d = 0, 0 for i in range(c): if i % 2 == 0: d += t[0] else: s += t[0] t = t[1:] print(str(s) + ' ' + str(d)) ```	0
760	A	Petr and a calendar	PROGRAMMING	800	[ "implementation", "math" ]		null	null	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: Petr 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.	The only line contain two integers m and d (1<=≤<=m<=≤<=12, 1<=≤<=d<=≤<=7) — the number of month (January is the first month, December is the twelfth) and the weekday of the first date of this month (1 is Monday, 7 is Sunday).	Print single integer: the number of columns the table should have.	[ "1 7\n", "1 1\n", "11 6\n" ]	[ "6\n", "5\n", "5\n" ]	The first example corresponds to the January 2017 shown on the picture in the statements. In the second example 1-st January is Monday, so the whole month fits into 5 columns. In the third example 1-st November is Saturday and 5 columns is enough.	500	[ { "input": "1 7", "output": "6" }, { "input": "1 1", "output": "5" }, { "input": "11 6", "output": "5" }, { "input": "2 7", "output": "5" }, { "input": "2 1", "output": "4" }, { "input": "8 6", "output": "6" }, { "input": "1 1", "output": "5" }, { "input": "1 2", "output": "5" }, { "input": "1 3", "output": "5" }, { "input": "1 4", "output": "5" }, { "input": "1 5", "output": "5" }, { "input": "1 6", "output": "6" }, { "input": "1 7", "output": "6" }, { "input": "2 1", "output": "4" }, { "input": "2 2", "output": "5" }, { "input": "2 3", "output": "5" }, { "input": "2 4", "output": "5" }, { "input": "2 5", "output": "5" }, { "input": "2 6", "output": "5" }, { "input": "2 7", "output": "5" }, { "input": "3 1", "output": "5" }, { "input": "3 2", "output": "5" }, { "input": "3 3", "output": "5" }, { "input": "3 4", "output": "5" }, { "input": "3 5", "output": "5" }, { "input": "3 6", "output": "6" }, { "input": "3 7", "output": "6" }, { "input": "4 1", "output": "5" }, { "input": "4 2", "output": "5" }, { "input": "4 3", "output": "5" }, { "input": "4 4", "output": "5" }, { "input": "4 5", "output": "5" }, { "input": "4 6", "output": "5" }, { "input": "4 7", "output": "6" }, { "input": "5 1", "output": "5" }, { "input": "5 2", "output": "5" }, { "input": "5 3", "output": "5" }, { "input": "5 4", "output": "5" }, { "input": "5 5", "output": "5" }, { "input": "5 6", "output": "6" }, { "input": "5 7", "output": "6" }, { "input": "6 1", "output": "5" }, { "input": "6 2", "output": "5" }, { "input": "6 3", "output": "5" }, { "input": "6 4", "output": "5" }, { "input": "6 5", "output": "5" }, { "input": "6 6", "output": "5" }, { "input": "6 7", "output": "6" }, { "input": "7 1", "output": "5" }, { "input": "7 2", "output": "5" }, { "input": "7 3", "output": "5" }, { "input": "7 4", "output": "5" }, { "input": "7 5", "output": "5" }, { "input": "7 6", "output": "6" }, { "input": "7 7", "output": "6" }, { "input": "8 1", "output": "5" }, { "input": "8 2", "output": "5" }, { "input": "8 3", "output": "5" }, { "input": "8 4", "output": "5" }, { "input": "8 5", "output": "5" }, { "input": "8 6", "output": "6" }, { "input": "8 7", "output": "6" }, { "input": "9 1", "output": "5" }, { "input": "9 2", "output": "5" }, { "input": "9 3", "output": "5" }, { "input": "9 4", "output": "5" }, { "input": "9 5", "output": "5" }, { "input": "9 6", "output": "5" }, { "input": "9 7", "output": "6" }, { "input": "10 1", "output": "5" }, { "input": "10 2", "output": "5" }, { "input": "10 3", "output": "5" }, { "input": "10 4", "output": "5" }, { "input": "10 5", "output": "5" }, { "input": "10 6", "output": "6" }, { "input": "10 7", "output": "6" }, { "input": "11 1", "output": "5" }, { "input": "11 2", "output": "5" }, { "input": "11 3", "output": "5" }, { "input": "11 4", "output": "5" }, { "input": "11 5", "output": "5" }, { "input": "11 6", "output": "5" }, { "input": "11 7", "output": "6" }, { "input": "12 1", "output": "5" }, { "input": "12 2", "output": "5" }, { "input": "12 3", "output": "5" }, { "input": "12 4", "output": "5" }, { "input": "12 5", "output": "5" }, { "input": "12 6", "output": "6" }, { "input": "12 7", "output": "6" }, { "input": "1 4", "output": "5" }, { "input": "1 5", "output": "5" }, { "input": "9 7", "output": "6" }, { "input": "2 6", "output": "5" }, { "input": "1 6", "output": "6" }, { "input": "2 2", "output": "5" }, { "input": "4 7", "output": "6" }, { "input": "12 6", "output": "6" }, { "input": "12 3", "output": "5" }, { "input": "3 6", "output": "6" }, { "input": "9 6", "output": "5" }, { "input": "7 6", "output": "6" }, { "input": "11 7", "output": "6" }, { "input": "6 6", "output": "5" } ]	1,612,374,350	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	46	0	# A. Petr and a calendar months = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] m, d = map(int, input().split()) m -= 1 columns = 1 months[m] -= 8 - d columns += months[m] // 7 months[m] //= 7 if months[m] > 0: columns += 1 print(columns)	Title: Petr and a calendar Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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: Petr 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 Specification: The only line contain two integers m and d (1<=≤<=m<=≤<=12, 1<=≤<=d<=≤<=7) — the number of month (January is the first month, December is the twelfth) and the weekday of the first date of this month (1 is Monday, 7 is Sunday). Output Specification: Print single integer: the number of columns the table should have. Demo Input: ['1 7\n', '1 1\n', '11 6\n'] Demo Output: ['6\n', '5\n', '5\n'] Note: The first example corresponds to the January 2017 shown on the picture in the statements. In the second example 1-st January is Monday, so the whole month fits into 5 columns. In the third example 1-st November is Saturday and 5 columns is enough.	```python # A. Petr and a calendar months = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] m, d = map(int, input().split()) m -= 1 columns = 1 months[m] -= 8 - d columns += months[m] // 7 months[m] //= 7 if months[m] > 0: columns += 1 print(columns) ```	0
614	A	Link/Cut Tree	PROGRAMMING	1,500	[ "brute force", "implementation" ]		null	null	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. Unfortunately, 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?) Given 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!	The first line of the input contains three space-separated integers l, r and k (1<=≤<=l<=≤<=r<=≤<=1018, 2<=≤<=k<=≤<=109).	Print all powers of number k, that lie within range from l to r in the increasing order. If there are no such numbers, print "-1" (without the quotes).	[ "1 10 2\n", "2 4 5\n" ]	[ "1 2 4 8 ", "-1" ]	Note to the first sample: numbers 2<sup class="upper-index">0</sup> = 1, 2<sup class="upper-index">1</sup> = 2, 2<sup class="upper-index">2</sup> = 4, 2<sup class="upper-index">3</sup> = 8 lie within the specified range. The number 2<sup class="upper-index">4</sup> = 16 is greater then 10, thus it shouldn't be printed.	500	[ { "input": "1 10 2", "output": "1 2 4 8 " }, { "input": "2 4 5", "output": "-1" }, { "input": "18102 43332383920 28554", "output": "28554 815330916 " }, { "input": "19562 31702689720 17701", "output": "313325401 " }, { "input": "11729 55221128400 313", "output": "97969 30664297 9597924961 " }, { "input": "5482 100347128000 342", "output": "116964 40001688 13680577296 " }, { "input": "3680 37745933600 10", "output": "10000 100000 1000000 10000000 100000000 1000000000 10000000000 " }, { "input": "17098 191120104800 43", "output": "79507 3418801 147008443 6321363049 " }, { "input": "10462 418807699200 2", "output": "16384 32768 65536 131072 262144 524288 1048576 2097152 4194304 8388608 16777216 33554432 67108864 134217728 268435456 536870912 1073741824 2147483648 4294967296 8589934592 17179869184 34359738368 68719476736 137438953472 274877906944 " }, { "input": "30061 641846400000 3", "output": "59049 177147 531441 1594323 4782969 14348907 43046721 129140163 387420489 1162261467 3486784401 10460353203 31381059609 94143178827 282429536481 " }, { "input": "1 1000000000000000000 2", "output": "1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 131072 262144 524288 1048576 2097152 4194304 8388608 16777216 33554432 67108864 134217728 268435456 536870912 1073741824 2147483648 4294967296 8589934592 17179869184 34359738368 68719476736 137438953472 274877906944 549755813888 1099511627776 2199023255552 4398046511104 8796093022208 17592186044416 35184372088832 70368744177664 140737488355328 281474976710656 562949953421312 1125899906842624 2251799813685248 4503599627370496 900719925474099..." }, { "input": "32 2498039712000 4", "output": "64 256 1024 4096 16384 65536 262144 1048576 4194304 16777216 67108864 268435456 1073741824 4294967296 17179869184 68719476736 274877906944 1099511627776 " }, { "input": "1 2576683920000 2", "output": "1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 131072 262144 524288 1048576 2097152 4194304 8388608 16777216 33554432 67108864 134217728 268435456 536870912 1073741824 2147483648 4294967296 8589934592 17179869184 34359738368 68719476736 137438953472 274877906944 549755813888 1099511627776 2199023255552 " }, { "input": "5 25 5", "output": "5 25 " }, { "input": "1 90 90", "output": "1 90 " }, { "input": "95 2200128528000 68", "output": "4624 314432 21381376 1453933568 98867482624 " }, { "input": "64 426314644000 53", "output": "2809 148877 7890481 418195493 22164361129 " }, { "input": "198765 198765 198765", "output": "198765 " }, { "input": "42 2845016496000 12", "output": "144 1728 20736 248832 2985984 35831808 429981696 5159780352 61917364224 743008370688 " }, { "input": "6 6 3", "output": "-1" }, { "input": "1 10 11", "output": "1 " }, { "input": "2 10 11", "output": "-1" }, { "input": "87 160 41", "output": "-1" }, { "input": "237171123124584251 923523399718980912 7150", "output": "-1" }, { "input": "101021572000739548 453766043506276015 8898", "output": "-1" }, { "input": "366070689449360724 928290634811046396 8230", "output": "-1" }, { "input": "438133886369772308 942612870269666780 7193", "output": "-1" }, { "input": "10 10 10", "output": "10 " }, { "input": "16 16 256", "output": "-1" }, { "input": "1 1000000000000000000 1000000000", "output": "1 1000000000 1000000000000000000 " }, { "input": "1000000000000000000 1000000000000000000 1000000000", "output": "1000000000000000000 " }, { "input": "1000000000 1000000000000000000 1000000000", "output": "1000000000 1000000000000000000 " }, { "input": "1 1 4", "output": "1 " }, { "input": "1 999999999999999999 1000000000", "output": "1 1000000000 " }, { "input": "1 1000000000000000000 999999990", "output": "1 999999990 999999980000000100 " }, { "input": "1 1000000000000000000 999999984", "output": "1 999999984 999999968000000256 " }, { "input": "1 1000000000000000000 324325", "output": "1 324325 105186705625 34114678301828125 " }, { "input": "1 1000000000000000000 999999523", "output": "1 999999523 999999046000227529 " }, { "input": "1 243 3", "output": "1 3 9 27 81 243 " }, { "input": "62769392426654367 567152589733560993 688813", "output": "326816522793383797 " }, { "input": "1 1000000000000000000 690852001", "output": "1 690852001 477276487285704001 " }, { "input": "1 1000000000000000000 918745157", "output": "1 918745157 844092663510954649 " }, { "input": "1 1000000000000000000 131299843", "output": "1 131299843 17239648771824649 " }, { "input": "2861381721051425 2861381721051425 1234", "output": "-1" } ]	1,578,533,535	135	Python 3	WRONG_ANSWER	TESTS	1	108	0	from sys import stdin,stdout n,m,k=map(int,stdin.readline().strip().split()) ans=[] for i in range(100): x=k*i if x<n: continue if x>m: break ans.append(x) print(ans)	Title: Link/Cut Tree Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. Unfortunately, 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?) Given 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 Specification: The first line of the input contains three space-separated integers l, r and k (1<=≤<=l<=≤<=r<=≤<=1018, 2<=≤<=k<=≤<=109). Output Specification: Print all powers of number k, that lie within range from l to r in the increasing order. If there are no such numbers, print "-1" (without the quotes). Demo Input: ['1 10 2\n', '2 4 5\n'] Demo Output: ['1 2 4 8 ', '-1'] Note: Note to the first sample: numbers 2<sup class="upper-index">0</sup> = 1, 2<sup class="upper-index">1</sup> = 2, 2<sup class="upper-index">2</sup> = 4, 2<sup class="upper-index">3</sup> = 8 lie within the specified range. The number 2<sup class="upper-index">4</sup> = 16 is greater then 10, thus it shouldn't be printed.	```python from sys import stdin,stdout n,m,k=map(int,stdin.readline().strip().split()) ans=[] for i in range(100): x=k*i if x<n: continue if x>m: break ans.append(x) print(ans) ```	0
186	A	Comparing Strings	PROGRAMMING	1,100	[ "implementation", "strings" ]		null	null	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. Dwarf 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.	The first line contains the first dwarf's genome: a non-empty string, consisting of lowercase Latin letters. The second line contains the second dwarf's genome: a non-empty string, consisting of lowercase Latin letters. The number of letters in each genome doesn't exceed 105. It is guaranteed that the strings that correspond to the genomes are different. The given genomes may have different length.	Print "YES", if the dwarves belong to the same race. Otherwise, print "NO".	[ "ab\nba\n", "aa\nab\n" ]	[ "YES\n", "NO\n" ]	- First example: you can simply swap two letters in string "ab". So we get "ba". - Second example: we can't change string "aa" into string "ab", because "aa" does not contain letter "b".	500	[ { "input": "ab\nba", "output": "YES" }, { "input": "aa\nab", "output": "NO" }, { "input": "a\nza", "output": "NO" }, { "input": "vvea\nvvae", "output": "YES" }, { "input": "rtfabanpc\natfabrnpc", "output": "YES" }, { "input": "mt\ntm", "output": "YES" }, { "input": "qxolmbkkt\naovlajmlf", "output": "NO" }, { "input": "b\ng", "output": "NO" }, { "input": "ab\naba", "output": "NO" }, { "input": "ba\na", "output": "NO" }, { "input": "a\nab", "output": "NO" }, { "input": "a\naa", "output": "NO" }, { "input": "a\nz", "output": "NO" }, { "input": "aabb\nbbaa", "output": "NO" }, { "input": "ab\nbd", "output": "NO" }, { "input": "bac\ndae", "output": "NO" }, { "input": "abc\nakl", "output": "NO" }, { "input": "cb\naa", "output": "NO" }, { "input": "abaab\naabba", "output": "NO" }, { "input": "aab\naaa", "output": "NO" }, { "input": "abcde\nedcba", "output": "NO" }, { "input": "abab\nbaba", "output": "NO" }, { "input": "ab\nbac", "output": "NO" }, { "input": "abcd\naqcb", "output": "NO" }, { "input": "abc\nbad", "output": "NO" }, { "input": "ab\nca", "output": "NO" }, { "input": "abc\nab", "output": "NO" }, { "input": "ab\nbae", "output": "NO" }, { "input": "aaaabcccca\naaaadccccb", "output": "NO" }, { "input": "acaa\nabca", "output": "NO" }, { "input": "aba\naab", "output": "YES" }, { "input": "ah\nla", "output": "NO" }, { "input": "aab\naa", "output": "NO" }, { "input": "abab\nabcd", "output": "NO" }, { "input": "ed\nab", "output": "NO" } ]	1,623,735,298	2,147,483,647	PyPy 3	RUNTIME_ERROR	TESTS	24	248	3,379,200	s1 = input() s2 = input() count = 0 for i in range(len(s1)): if s1[i] != s2[i]: count += 1 if count == 2: print("YES") else: print("NO")	Title: Comparing Strings Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. Dwarf 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 Specification: The first line contains the first dwarf's genome: a non-empty string, consisting of lowercase Latin letters. The second line contains the second dwarf's genome: a non-empty string, consisting of lowercase Latin letters. The number of letters in each genome doesn't exceed 105. It is guaranteed that the strings that correspond to the genomes are different. The given genomes may have different length. Output Specification: Print "YES", if the dwarves belong to the same race. Otherwise, print "NO". Demo Input: ['ab\nba\n', 'aa\nab\n'] Demo Output: ['YES\n', 'NO\n'] Note: - First example: you can simply swap two letters in string "ab". So we get "ba". - Second example: we can't change string "aa" into string "ab", because "aa" does not contain letter "b".	```python s1 = input() s2 = input() count = 0 for i in range(len(s1)): if s1[i] != s2[i]: count += 1 if count == 2: print("YES") else: print("NO") ```	-1
841	A	Generous Kefa	PROGRAMMING	900	[ "brute force", "implementation" ]		null	null	One day Kefa found n baloons. For convenience, we denote color of i-th baloon as si — 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.	The first line contains two integers n and k (1<=≤<=n,<=k<=≤<=100) — the number of baloons and friends. Next line contains string s — colors of baloons.	Answer to the task — «YES» or «NO» in a single line. You can choose the case (lower or upper) for each letter arbitrary.	[ "4 2\naabb\n", "6 3\naacaab\n" ]	[ "YES\n", "NO\n" ]	In the first sample Kefa can give 1-st and 3-rd baloon to the first friend, and 2-nd and 4-th to the second. In the second sample Kefa needs to give to all his friends baloons of color a, but one baloon will stay, thats why answer is «NO».	500	[ { "input": "4 2\naabb", "output": "YES" }, { "input": "6 3\naacaab", "output": "NO" }, { "input": "2 2\nlu", "output": "YES" }, { "input": "5 3\novvoo", "output": "YES" }, { "input": "36 13\nbzbzcffczzcbcbzzfzbbfzfzzbfbbcbfccbf", "output": "YES" }, { "input": "81 3\nooycgmvvrophvcvpoupepqllqttwcocuilvyxbyumdmmfapvpnxhjhxfuagpnntonibicaqjvwfhwxhbv", "output": "NO" }, { "input": "100 100\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx", "output": "YES" }, { "input": "100 1\nnubcvvjvbjgnjsdkajimdcxvewbcytvfkihunycdrlconddlwgzjasjlsrttlrzsumzpyumpveglfqzmaofbshbojmwuwoxxvrod", "output": "NO" }, { "input": "100 13\nvyldolgryldqrvoldvzvrdrgorlorszddtgqvrlisxxrxdxlqtvtgsrqlzixoyrozxzogqxlsgzdddzqrgitxxritoolzolgrtvl", "output": "YES" }, { "input": "18 6\njzwtnkvmscqhmdlsxy", "output": "YES" }, { "input": "21 2\nfscegcqgzesefghhwcexs", "output": "NO" }, { "input": "32 22\ncduamsptaklqtxlyoutlzepxgyfkvngc", "output": "YES" }, { "input": "49 27\noxyorfnkzwsfllnyvdhdanppuzrnbxehugvmlkgeymqjlmfxd", "output": "YES" }, { "input": "50 24\nxxutzjwbggcwvxztttkmzovtmuwttzcbwoztttohzzxghuuthv", "output": "YES" }, { "input": "57 35\nglxshztrqqfyxthqamagvtmrdparhelnzrqvcwqxjytkbuitovkdxueul", "output": "YES" }, { "input": "75 23\nittttiiuitutuiiuuututiuttiuiuutuuuiuiuuuuttuuttuutuiiuiuiiuiitttuututuiuuii", "output": "NO" }, { "input": "81 66\nfeqevfqfebhvubhuuvfuqheuqhbeeuebehuvhffvbqvqvfbqqvvhevqffbqqhvvqhfeehuhqeqhueuqqq", "output": "YES" }, { "input": "93 42\npqeiafraiavfcteumflpcbpozcomlvpovlzdbldvoopnhdoeqaopzthiuzbzmeieiatthdeqovaqfipqlddllmfcrrnhb", "output": "YES" }, { "input": "100 53\nizszyqyndzwzyzgsdagdwdazadiawizinagqqgczaqqnawgijziziawzszdjdcqjdjqiwgadydcnqisaayjiqqsscwwzjzaycwwc", "output": "YES" }, { "input": "100 14\nvkrdcqbvkwuckpmnbydmczdxoagdsgtqxvhaxntdcxhjcrjyvukhugoglbmyoaqexgtcfdgemmizoniwtmisqqwcwfusmygollab", "output": "YES" }, { "input": "100 42\naaaaaiiiiaiiiaaiaiiaaiiiiiaaaaaiaiiiaiiiiaiiiaaaaaiiiaaaiiaaiiiaiiiaiaaaiaiiiiaaiiiaiiaiaiiaiiiaaaia", "output": "NO" }, { "input": "100 89\ntjbkmydejporbqhcbztkcumxjjgsrvxpuulbhzeeckkbchpbxwhedrlhjsabcexcohgdzouvsgphjdthpuqrlkgzxvqbuhqxdsmf", "output": "YES" }, { "input": "100 100\njhpyiuuzizhubhhpxbbhpyxzhbpjphzppuhiahihiappbhuypyauhizpbibzixjbzxzpbphuiaypyujappuxiyuyaajaxjupbahb", "output": "YES" }, { "input": "100 3\nsszoovvzysavsvzsozzvoozvysozsaszayaszasaysszzzysosyayyvzozovavzoyavsooaoyvoozvvozsaosvayyovazzszzssa", "output": "NO" }, { "input": "100 44\ndluthkxwnorabqsukgnxnvhmsmzilyulpursnxkdsavgemiuizbyzebhyjejgqrvuckhaqtuvdmpziesmpmewpvozdanjyvwcdgo", "output": "YES" }, { "input": "100 90\ntljonbnwnqounictqqctgonktiqoqlocgoblngijqokuquoolciqwnctgoggcbojtwjlculoikbggquqncittwnjbkgkgubnioib", "output": "YES" }, { "input": "100 79\nykxptzgvbqxlregvkvucewtydvnhqhuggdsyqlvcfiuaiddnrrnstityyehiamrggftsqyduwxpuldztyzgmfkehprrneyvtknmf", "output": "YES" }, { "input": "100 79\naagwekyovbviiqeuakbqbqifwavkfkutoriovgfmittulhwojaptacekdirgqoovlleeoqkkdukpadygfwavppohgdrmymmulgci", "output": "YES" }, { "input": "100 93\nearrehrehenaddhdnrdddhdahnadndheeennrearrhraharddreaeraddhehhhrdnredanndneheddrraaneerreedhnadnerhdn", "output": "YES" }, { "input": "100 48\nbmmaebaebmmmbbmxvmammbvvebvaemvbbaxvbvmaxvvmveaxmbbxaaemxmxvxxxvxbmmxaaaevvaxmvamvvmaxaxavexbmmbmmev", "output": "YES" }, { "input": "100 55\nhsavbkehaaesffaeeffakhkhfehbbvbeasahbbbvkesbfvkefeesesevbsvfkbffakvshsbkahfkfakebsvafkbvsskfhfvaasss", "output": "YES" }, { "input": "100 2\ncscffcffsccffsfsfffccssfsscfsfsssffcffsscfccssfffcfscfsscsccccfsssffffcfcfsfffcsfsccffscffcfccccfffs", "output": "NO" }, { "input": "100 3\nzrgznxgdpgfoiifrrrsjfuhvtqxjlgochhyemismjnanfvvpzzvsgajcbsulxyeoepjfwvhkqogiiwqxjkrpsyaqdlwffoockxnc", "output": "NO" }, { "input": "100 5\njbltyyfjakrjeodqepxpkjideulofbhqzxjwlarufwzwsoxhaexpydpqjvhybmvjvntuvhvflokhshpicbnfgsqsmrkrfzcrswwi", "output": "NO" }, { "input": "100 1\nfnslnqktlbmxqpvcvnemxcutebdwepoxikifkzaaixzzydffpdxodmsxjribmxuqhueifdlwzytxkklwhljswqvlejedyrgguvah", "output": "NO" }, { "input": "100 21\nddjenetwgwmdtjbpzssyoqrtirvoygkjlqhhdcjgeurqpunxpupwaepcqkbjjfhnvgpyqnozhhrmhfwararmlcvpgtnopvjqsrka", "output": "YES" }, { "input": "100 100\nnjrhiauqlgkkpkuvciwzivjbbplipvhslqgdkfnmqrxuxnycmpheenmnrglotzuyxycosfediqcuadklsnzjqzfxnbjwvfljnlvq", "output": "YES" }, { "input": "100 100\nbbbbbbbtbbttbtbbbttbttbtbbttttbbbtbttbbbtbttbtbbttttbbbbbtbbttbtbbtbttbbbtbtbtbtbtbtbbbttbbtbtbtbbtb", "output": "YES" }, { "input": "14 5\nfssmmsfffmfmmm", "output": "NO" }, { "input": "2 1\nff", "output": "NO" }, { "input": "2 1\nhw", "output": "YES" }, { "input": "2 2\nss", "output": "YES" }, { "input": "1 1\nl", "output": "YES" }, { "input": "100 50\nfffffttttttjjjuuuvvvvvdddxxxxwwwwgggbsssncccczzyyyyyhhhhhkrreeeeeeaaaaaiiillllllllooooqqqqqqmmpppppp", "output": "YES" }, { "input": "100 50\nbbbbbbbbgggggggggggaaaaaaaahhhhhhhhhhpppppppppsssssssrrrrrrrrllzzzzzzzeeeeeeekkkkkkkwwwwwwwwjjjjjjjj", "output": "YES" }, { "input": "100 50\nwwwwwwwwwwwwwwxxxxxxxxxxxxxxxxxxxxxxxxzzzzzzzzzzzzzzzzzzbbbbbbbbbbbbbbbbbbbbjjjjjjjjjjjjjjjjjjjjjjjj", "output": "YES" }, { "input": "100 80\nbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm", "output": "YES" }, { "input": "100 10\nbbttthhhhiiiiiiijjjjjvvvvpppssssseeeeeeewwwwgggkkkkkkkkmmmddddduuuzzzzllllnnnnnxxyyyffffccraaaaooooq", "output": "YES" }, { "input": "100 20\nssssssssssbbbbbbbhhhhhhhyyyyyyyzzzzzzzzzzzzcccccxxxxxxxxxxddddmmmmmmmeeeeeeejjjjjjjjjwwwwwwwtttttttt", "output": "YES" }, { "input": "1 2\na", "output": "YES" }, { "input": "3 1\nabb", "output": "NO" }, { "input": "2 1\naa", "output": "NO" }, { "input": "2 1\nab", "output": "YES" }, { "input": "6 2\naaaaaa", "output": "NO" }, { "input": "8 4\naaaaaaaa", "output": "NO" }, { "input": "4 2\naaaa", "output": "NO" }, { "input": "4 3\naaaa", "output": "NO" }, { "input": "1 3\na", "output": "YES" }, { "input": "4 3\nzzzz", "output": "NO" }, { "input": "4 1\naaaa", "output": "NO" }, { "input": "3 4\nabc", "output": "YES" }, { "input": "2 5\nab", "output": "YES" }, { "input": "2 4\nab", "output": "YES" }, { "input": "1 10\na", "output": "YES" }, { "input": "5 2\nzzzzz", "output": "NO" }, { "input": "53 26\naaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbb", "output": "NO" }, { "input": "4 1\nabab", "output": "NO" }, { "input": "4 1\nabcb", "output": "NO" }, { "input": "4 2\nabbb", "output": "NO" }, { "input": "5 2\nabccc", "output": "NO" }, { "input": "2 3\nab", "output": "YES" }, { "input": "4 3\nbbbs", "output": "YES" }, { "input": "10 2\nazzzzzzzzz", "output": "NO" }, { "input": "1 2\nb", "output": "YES" }, { "input": "1 3\nb", "output": "YES" }, { "input": "4 5\nabcd", "output": "YES" }, { "input": "4 6\naabb", "output": "YES" }, { "input": "5 2\naaaab", "output": "NO" }, { "input": "3 5\naaa", "output": "YES" }, { "input": "5 3\nazzzz", "output": "NO" }, { "input": "4 100\naabb", "output": "YES" }, { "input": "3 10\naaa", "output": "YES" }, { "input": "3 4\naaa", "output": "YES" }, { "input": "12 5\naaaaabbbbbbb", "output": "NO" }, { "input": "5 2\naabbb", "output": "NO" }, { "input": "10 5\nzzzzzzzzzz", "output": "NO" }, { "input": "2 4\naa", "output": "YES" }, { "input": "1 5\na", "output": "YES" }, { "input": "10 5\naaaaaaaaaa", "output": "NO" }, { "input": "6 3\naaaaaa", "output": "NO" }, { "input": "7 1\nabcdeee", "output": "NO" }, { "input": "18 3\naaaaaabbbbbbcccccc", "output": "NO" }, { "input": "8 2\naabbccdd", "output": "YES" }, { "input": "4 2\nzzzz", "output": "NO" }, { "input": "4 2\nabaa", "output": "NO" }, { "input": "3 2\naaa", "output": "NO" }, { "input": "3 1\nzzz", "output": "NO" }, { "input": "5 4\nzzzzz", "output": "NO" }, { "input": "6 2\naabbbc", "output": "NO" }, { "input": "3 6\naaa", "output": "YES" }, { "input": "2 1\nzz", "output": "NO" }, { "input": "10 3\naaaeeeeeee", "output": "NO" }, { "input": "4 5\naabb", "output": "YES" }, { "input": "3 1\naaa", "output": "NO" }, { "input": "5 2\naazzz", "output": "NO" }, { "input": "6 2\nabbbbc", "output": "NO" }, { "input": "4 2\nxxxx", "output": "NO" }, { "input": "6 3\nzzzzzz", "output": "NO" }, { "input": "3 2\nabb", "output": "YES" }, { "input": "3 2\nzzz", "output": "NO" }, { "input": "6 5\nzzzzzz", "output": "NO" }, { "input": "6 3\nbcaaaa", "output": "NO" }, { "input": "100 100\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "output": "YES" }, { "input": "3 6\nabc", "output": "YES" } ]	1,512,041,065	2,147,483,647	Python 3	OK	TESTS	114	77	5,632,000	n, k = [int(_) for _ in input().split()] s = input() count = [s.count(x) for x in 'qwertyuiopasdfghjklzxcvbnm'] if max(count) > k: print('NO') else: print('YES')	Title: Generous Kefa Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day Kefa found n baloons. For convenience, we denote color of i-th baloon as si — 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 Specification: The first line contains two integers n and k (1<=≤<=n,<=k<=≤<=100) — the number of baloons and friends. Next line contains string s — colors of baloons. Output Specification: Answer to the task — «YES» or «NO» in a single line. You can choose the case (lower or upper) for each letter arbitrary. Demo Input: ['4 2\naabb\n', '6 3\naacaab\n'] Demo Output: ['YES\n', 'NO\n'] Note: In the first sample Kefa can give 1-st and 3-rd baloon to the first friend, and 2-nd and 4-th to the second. In the second sample Kefa needs to give to all his friends baloons of color a, but one baloon will stay, thats why answer is «NO».	```python n, k = [int(_) for _ in input().split()] s = input() count = [s.count(x) for x in 'qwertyuiopasdfghjklzxcvbnm'] if max(count) > k: print('NO') else: print('YES') ```	3
979	B	Treasure Hunt	PROGRAMMING	1,800	[ "greedy" ]		null	null	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. The 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. A 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. The 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. Could you find out who is going to be the winner if they all play optimally?	The first line contains an integer $n$ ($0 \leq n \leq 10^{9}$) — the number of turns. Next 3 lines contain 3 ribbons of Kuro, Shiro and Katie one per line, respectively. Each ribbon is a string which contains no more than $10^{5}$ uppercase and lowercase Latin letters and is not empty. It is guaranteed that the length of all ribbons are equal for the purpose of fairness. Note that uppercase and lowercase letters are considered different colors.	Print the name of the winner ("Kuro", "Shiro" or "Katie"). If there are at least two cats that share the maximum beauty, print "Draw".	[ "3\nKuroo\nShiro\nKatie\n", "7\ntreasurehunt\nthreefriends\nhiCodeforces\n", "1\nabcabc\ncbabac\nababca\n", "15\nfoPaErcvJ\nmZaxowpbt\nmkuOlaHRE\n" ]	[ "Kuro\n", "Shiro\n", "Katie\n", "Draw\n" ]	In the first example, after $3$ turns, Kuro can change his ribbon into ooooo, which has the beauty of $5$, while reaching such beauty for Shiro and Katie is impossible (both Shiro and Katie can reach the beauty of at most $4$, for example by changing Shiro's ribbon into SSiSS and changing Katie's ribbon into Kaaaa). Therefore, the winner is Kuro. In the fourth example, since the length of each of the string is $9$ and the number of turn is $15$, everyone can change their ribbons in some way to reach the maximal beauty of $9$ by changing their strings into zzzzzzzzz after 9 turns, and repeatedly change their strings into azzzzzzzz and then into zzzzzzzzz thrice. Therefore, the game ends in a draw.	1,000	[ { "input": "3\nKuroo\nShiro\nKatie", "output": "Kuro" }, { "input": "7\ntreasurehunt\nthreefriends\nhiCodeforces", "output": "Shiro" }, { "input": "1\nabcabc\ncbabac\nababca", "output": "Katie" }, { "input": "15\nfoPaErcvJ\nmZaxowpbt\nmkuOlaHRE", "output": "Draw" }, { "input": "1\naaaaaaaaaa\nAAAAAAcAAA\nbbbbbbzzbb", "output": "Shiro" }, { "input": "60\nddcZYXYbZbcXYcZdYbddaddYaZYZdaZdZZdXaaYdaZZZaXZXXaaZbb\ndcdXcYbcaXYaXYcacYabYcbZYdacaYbYdXaccYXZZZdYbbYdcZZZbY\nXaZXbbdcXaadcYdYYcbZdcaXaYZabbXZZYbYbcXbaXabcXbXadbZYZ", "output": "Draw" }, { "input": "9174\nbzbbbzzzbbzzccczzccczzbzbzcbzbbzccbzcccbccczzbbcbbzbzzzcbczbzbzzbbbczbbcbzzzbcbzczbcczb\ndbzzzccdcdczzzzzcdczbbzcdzbcdbzzdczbzddcddbdbzzzczcczzbdcbbzccbzzzdzbzddcbzbdzdcczccbdb\nzdczddzcdddddczdczdczdcdzczddzczdzddczdcdcdzczczzdzccdccczczdzczczdzcdddzddzccddcczczzd", "output": "Draw" }, { "input": "727\nbaabbabbbababbbbaaaabaabbaabababaaababaaababbbbababbbbbbbbbbaaabaabbbbbbbbaaaabaabbaaabaabbabaa\nddcdcccccccdccdcdccdddcddcddcddddcdddcdcdccddcdddddccddcccdcdddcdcccdccccccdcdcdccccccdccccccdc\nfffeefeffeefeeeeffefffeeefffeefffefeefefeeeffefefefefefefffffffeeeeeffffeefeeeeffffeeeeeefeffef", "output": "Draw" }, { "input": "61\nbzqiqprzfwddqwctcrhnkqcsnbmcmfmrgaljwieajfouvuiunmfbrehxchupmsdpwilwu\njyxxujvxkwilikqeegzxlyiugflxqqbwbujzedqnlzucdnuipacatdhcozuvgktwvirhs\ntqiahohijwfcetyyjlkfhfvkhdgllxmhyyhhtlhltcdspusyhwpwqzyagtsbaswaobwub", "output": "Katie" }, { "input": "30\njAjcdwkvcTYSYBBLniJIIIiubKWnqeDtUiaXSIPfhDTOrCWBQetm\nPQPOTgqfBWzQvPNeEaUaPQGdUgldmOZsBtsIqZGGyXozntMpOsyY\nNPfvGxMqIULNWOmUrHJfsqORUHkzKQfecXsTzgFCmUtFmIBudCJr", "output": "Draw" }, { "input": "3\nabcabcabcabcdddabc\nzxytzytxxtytxyzxyt\nfgffghfghffgghghhh", "output": "Katie" }, { "input": "3\naaaaa\naaaaa\naaaab", "output": "Draw" }, { "input": "3\naaaaaaa\naaaabcd\nabcdefg", "output": "Draw" }, { "input": "3\naaaaaaa\naaabcde\nabcdefg", "output": "Kuro" }, { "input": "3\naaaaaaa\naaaabbb\nabcdefg", "output": "Draw" }, { "input": "3\naaa\nbbb\nabc", "output": "Draw" }, { "input": "3\naaaaa\nabcde\nabcde", "output": "Kuro" }, { "input": "3\naaaaa\nqwert\nlkjhg", "output": "Kuro" }, { "input": "3\naaaaa\nbbbbb\naabcd", "output": "Draw" }, { "input": "3\nabcde\nfghij\nkkkkk", "output": "Katie" }, { "input": "4\naaaabcd\naaaabcd\naaaaaaa", "output": "Draw" }, { "input": "3\naaaabb\naabcde\nabcdef", "output": "Kuro" }, { "input": "2\naaab\nabcd\naaaa", "output": "Draw" }, { "input": "3\naaaaaa\naaaaaa\nabcdef", "output": "Draw" }, { "input": "1\nAAAAA\nBBBBB\nABCDE", "output": "Draw" }, { "input": "1\nabcde\naaaaa\naaaaa", "output": "Draw" }, { "input": "4\naaabbb\nabfcde\nabfcde", "output": "Kuro" }, { "input": "0\naaa\naab\nccd", "output": "Kuro" }, { "input": "3\naaaaa\naaaaa\naabbb", "output": "Draw" }, { "input": "3\nxxxxxx\nxxxooo\nabcdef", "output": "Draw" }, { "input": "2\noooo\naaac\nabcd", "output": "Draw" }, { "input": "1\naaaaaaa\naaabcde\nabcdefg", "output": "Kuro" }, { "input": "3\nooooo\naaabb\nabcde", "output": "Draw" }, { "input": "3\naaaaa\nqwert\nqwery", "output": "Kuro" }, { "input": "2\naaaaaa\nbbbbbb\naaaaab", "output": "Draw" }, { "input": "3\naabb\naabb\naabc", "output": "Draw" }, { "input": "2\naaa\naab\naab", "output": "Draw" }, { "input": "3\nbbbbcc\nbbbbbb\nsadfgh", "output": "Draw" }, { "input": "3\naaaaaacc\nxxxxkkkk\nxxxxkkkk", "output": "Kuro" }, { "input": "2\naaaac\nbbbbc\nccccc", "output": "Draw" }, { "input": "3\naaaaaaaaa\naaabbbbbb\nabcdewert", "output": "Draw" }, { "input": "3\naaabc\naaaab\nabcde", "output": "Draw" }, { "input": "3\naaaaaaaa\naaaaaaab\naaaabbbb", "output": "Draw" }, { "input": "2\nabcdefg\nabccccc\nacccccc", "output": "Draw" }, { "input": "3\naaaaa\naabcd\nabcde", "output": "Draw" }, { "input": "4\naaabbb\nabcdef\nabcdef", "output": "Kuro" }, { "input": "4\naaabbb\naabdef\nabcdef", "output": "Draw" }, { "input": "3\nabba\nbbbb\naaaa", "output": "Draw" }, { "input": "3\naaaaa\nbbaaa\nabcde", "output": "Draw" }, { "input": "2\naaa\naaa\nabc", "output": "Draw" }, { "input": "3\naaaaa\nabcda\nabcde", "output": "Draw" }, { "input": "3\naaaaa\nabcde\nbcdef", "output": "Kuro" }, { "input": "3\naaabb\naabbc\nqwert", "output": "Draw" }, { "input": "3\naaaaaa\naabbcc\naabbcc", "output": "Kuro" }, { "input": "3\nAAAAAA\nAAAAAB\nABCDEF", "output": "Draw" }, { "input": "3\nabc\naac\nbbb", "output": "Draw" }, { "input": "2\naaaab\naabbc\naabbc", "output": "Kuro" }, { "input": "2\naaaaaab\naaaaabb\nabcdefg", "output": "Draw" }, { "input": "3\naaaaaaaaaaa\nbbbbbbbbaaa\nqwertyuiasd", "output": "Draw" }, { "input": "3\naaaa\nbbbb\naabb", "output": "Draw" }, { "input": "3\naaaabb\naaabcd\nabcdef", "output": "Draw" }, { "input": "3\naaa\nabc\nbbb", "output": "Draw" }, { "input": "1\naa\nab\nbb", "output": "Shiro" }, { "input": "1\naacb\nabcd\naaaa", "output": "Draw" }, { "input": "3\naaaabb\naaabbb\nabcdef", "output": "Draw" }, { "input": "3\naaaa\naaaa\nabcd", "output": "Draw" }, { "input": "2\nabcd\nabcd\naaad", "output": "Katie" }, { "input": "3\naaa\nbbb\naab", "output": "Draw" }, { "input": "3\naaaaaa\naaaaab\naaaaaa", "output": "Draw" }, { "input": "2\naaab\nabcd\nabcd", "output": "Kuro" }, { "input": "3\nooooo\nShiro\nKatie", "output": "Kuro" }, { "input": "3\naaabb\naabcd\nabcde", "output": "Draw" }, { "input": "4\nabcd\nabcd\naaaa", "output": "Draw" }, { "input": "4\naaa\nbbb\naab", "output": "Draw" }, { "input": "2\nxxxx\nyyyx\nabcd", "output": "Draw" }, { "input": "3\nAAAAA\nAAAAB\nABCDE", "output": "Draw" }, { "input": "3\naaaacdc\naaaaabc\naaaaabc", "output": "Draw" }, { "input": "3\naaaaaa\naabcde\naabcde", "output": "Kuro" }, { "input": "3\naaabb\naaabb\naaaaa", "output": "Draw" }, { "input": "5\nabbbbb\ncbbbbb\nabcdef", "output": "Draw" }, { "input": "3\naaaaaaaaa\naaaaabbbb\naaaaabbbb", "output": "Kuro" }, { "input": "4\naaaaaab\naaabbbb\naaabbbb", "output": "Draw" }, { "input": "3\naaaabb\naaaabb\naaabbb", "output": "Draw" }, { "input": "2\naaaabb\naaaaab\nabcdef", "output": "Draw" }, { "input": "2\naaaaa\naaaae\nabcde", "output": "Draw" }, { "input": "3\naaaaaa\nbbbcde\nabcdef", "output": "Draw" }, { "input": "4\naaaabbb\naabcdef\naabcdef", "output": "Kuro" }, { "input": "2\naaaaa\naaaab\nabcde", "output": "Draw" }, { "input": "3\naabbbbb\naaabbbb\nabcdefg", "output": "Draw" }, { "input": "3\nabcde\naabcd\naaaaa", "output": "Draw" }, { "input": "5\naaabbcc\nabcdefg\nabcdefg", "output": "Kuro" }, { "input": "3\naabbb\nabcde\nabcde", "output": "Kuro" }, { "input": "0\nbbb\nabb\nqer", "output": "Kuro" }, { "input": "5\naabbbbb\naaaaaaa\nabcdefg", "output": "Draw" }, { "input": "2\naaaab\naaaab\naaabb", "output": "Draw" }, { "input": "2\naaaaaab\naaaabbb\naaaaccc", "output": "Kuro" }, { "input": "3\naaaaaaaaaaaa\naaaaaaaaaaab\naaaaaabbbbbb", "output": "Draw" }, { "input": "3\naaabb\nabcde\naaaaa", "output": "Draw" }, { "input": "3\naaaaaac\naaaaebc\naaaaaac", "output": "Draw" }, { "input": "3\naaaaaa\naaabbb\nqwerty", "output": "Draw" }, { "input": "3\ncccca\nabcde\nabcde", "output": "Kuro" }, { "input": "100005\nAA\nBC\nCC", "output": "Draw" }, { "input": "3\naaaa\nbbbb\nccca", "output": "Draw" }, { "input": "3\naaaaa\nbcdef\nbcdef", "output": "Kuro" }, { "input": "2\naaab\naabb\nqwer", "output": "Draw" }, { "input": "3\nabcddd\nabcdef\nbbaaaa", "output": "Draw" }, { "input": "2\naaaa\naaaa\naabc", "output": "Draw" }, { "input": "3\naaaa\naaaa\naaab", "output": "Draw" }, { "input": "3\nabcddd\nabcdef\naaaaaa", "output": "Draw" }, { "input": "1\naaaa\nabcd\naaab", "output": "Katie" } ]	1,562,158,435	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	4	124	0	n=int(input()) l=[] for i in range(3) : l.append(input()) d=[dict() for i in range(3)] mas=[0 for i in range(3)] for i in range(3) : for x in l[i] : d[i][x]=d[i].get(x,0)+1 mas[i]=max(mas[i],d[i][x]) ma=max(mas) indx=0 for i in range(3) : if ma==mas[i] : indx=i break mas=sorted(mas) if mas[1]+n>=len(l[0]) or mas[1]==mas[2] : print("Draw") exit() if indx==0 : print("Kuro") if indx==1 : print("Shiro") if indx==2 : print("Katie")	Title: Treasure Hunt Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. The 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. A 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. The 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. Could you find out who is going to be the winner if they all play optimally? Input Specification: The first line contains an integer $n$ ($0 \leq n \leq 10^{9}$) — the number of turns. Next 3 lines contain 3 ribbons of Kuro, Shiro and Katie one per line, respectively. Each ribbon is a string which contains no more than $10^{5}$ uppercase and lowercase Latin letters and is not empty. It is guaranteed that the length of all ribbons are equal for the purpose of fairness. Note that uppercase and lowercase letters are considered different colors. Output Specification: Print the name of the winner ("Kuro", "Shiro" or "Katie"). If there are at least two cats that share the maximum beauty, print "Draw". Demo Input: ['3\nKuroo\nShiro\nKatie\n', '7\ntreasurehunt\nthreefriends\nhiCodeforces\n', '1\nabcabc\ncbabac\nababca\n', '15\nfoPaErcvJ\nmZaxowpbt\nmkuOlaHRE\n'] Demo Output: ['Kuro\n', 'Shiro\n', 'Katie\n', 'Draw\n'] Note: In the first example, after $3$ turns, Kuro can change his ribbon into ooooo, which has the beauty of $5$, while reaching such beauty for Shiro and Katie is impossible (both Shiro and Katie can reach the beauty of at most $4$, for example by changing Shiro's ribbon into SSiSS and changing Katie's ribbon into Kaaaa). Therefore, the winner is Kuro. In the fourth example, since the length of each of the string is $9$ and the number of turn is $15$, everyone can change their ribbons in some way to reach the maximal beauty of $9$ by changing their strings into zzzzzzzzz after 9 turns, and repeatedly change their strings into azzzzzzzz and then into zzzzzzzzz thrice. Therefore, the game ends in a draw.	```python n=int(input()) l=[] for i in range(3) : l.append(input()) d=[dict() for i in range(3)] mas=[0 for i in range(3)] for i in range(3) : for x in l[i] : d[i][x]=d[i].get(x,0)+1 mas[i]=max(mas[i],d[i][x]) ma=max(mas) indx=0 for i in range(3) : if ma==mas[i] : indx=i break mas=sorted(mas) if mas[1]+n>=len(l[0]) or mas[1]==mas[2] : print("Draw") exit() if indx==0 : print("Kuro") if indx==1 : print("Shiro") if indx==2 : print("Katie") ```	0
391	A	Genetic Engineering	PROGRAMMING	0	[ "implementation", "two pointers" ]		null	null	You will receive 3 points for solving this problem. Manao 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'. Manao 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. Manao 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.	The input consists of a single line, containing a string s of length n (1<=≤<=n<=≤<=100). Each character of s will be from the set {'A', 'T', 'G', 'C'}. This problem doesn't have subproblems. You will get 3 points for the correct submission.	The program should print on one line a single integer representing the minimum number of 'A', 'T', 'G', 'C' characters that are required to be inserted into the input string in order to make all runs of identical characters have odd length.	[ "GTTAAAG\n", "AACCAACCAAAAC\n" ]	[ "1\n", "5\n" ]	In the first example, it is sufficient to insert a single nucleotide of any type between the two 'T's in the sequence to restore the functionality of the protein.	3	[ { "input": "GTTAAAG", "output": "1" }, { "input": "AACCAACCAAAAC", "output": "5" }, { "input": "GTGAATTTCC", "output": "2" }, { "input": "CAGGGGGCCGCCCATGAAAAAAACCCGGCCCCTTGGGAAAACTTGGGTTA", "output": "7" }, { "input": "CCCTTCACCCGGATCCAAATCCCTTAGAAATAATCCCCGACGGCGTTGTATCACCTCTGCACTTGTTAGTAAGGTCAGGCGTCCATTACGGAAGAACGTA", "output": "19" }, { "input": "GCATTACATGGGGGGGTCCTACGAGCCCGGCATCCCGGAAACTAGCCGGTTAATTTGGTTTAAACCCTCCCACCCCGGATTGTAACCCCCCTCATTGGTT", "output": "17" }, { "input": "TTCCCAGAGAAAAAAAGGGGCCCAAATGCCCTAAAAACCCCCTTTGCCCCCCAACCCCTTTTTAAAATAAAAAGGGGCCCATTCCCTTAAAAATTTTTTG", "output": "10" }, { "input": "AGCCGCCCCCCCAAAAAAGGGGGAAAAAAAAAAAAAAAAAAAAACTTTTGGAAACCCCCCCCTTTTTTTTTTTTTTTTTTTTTTTTTGGGGAAGGGGGGG", "output": "7" }, { "input": "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA", "output": "1" }, { "input": "AAAAAAAAAAAAAAAAAATTTTTTTTTTTTTTTTGGGGGGGGGGGGGGGGGGGGGGGTTTTTTTTTTTTTTGGGGGGGGGGGGGGGGGGGGAAAAATTTT", "output": "5" }, { "input": "AACCGGTTAACCGGTTAACCGGTTAACCGGTTAACCGGTTAACCGGTTAACCGGTTAACCGGTTAACCGGTTAACCGGTTAACCGGTTAACCGGTTCCGG", "output": "50" }, { "input": "A", "output": "0" }, { "input": "TTT", "output": "0" }, { "input": "GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG", "output": "0" }, { "input": "G", "output": "0" }, { "input": "T", "output": "0" }, { "input": "C", "output": "0" }, { "input": "AA", "output": "1" }, { "input": "GGG", "output": "0" }, { "input": "AAG", "output": "1" } ]	1,564,454,902	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	108	0	tot=1 ans=0 a=str(input()) for i in range(1,len(a)): if a[i]==a[i-1]: tot+=1 else: if tot%2==0: ans+=1 tot=1 print(ans)	Title: Genetic Engineering Time Limit: None seconds Memory Limit: None megabytes Problem Description: You will receive 3 points for solving this problem. Manao 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'. Manao 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. Manao 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 Specification: The input consists of a single line, containing a string s of length n (1<=≤<=n<=≤<=100). Each character of s will be from the set {'A', 'T', 'G', 'C'}. This problem doesn't have subproblems. You will get 3 points for the correct submission. Output Specification: The program should print on one line a single integer representing the minimum number of 'A', 'T', 'G', 'C' characters that are required to be inserted into the input string in order to make all runs of identical characters have odd length. Demo Input: ['GTTAAAG\n', 'AACCAACCAAAAC\n'] Demo Output: ['1\n', '5\n'] Note: In the first example, it is sufficient to insert a single nucleotide of any type between the two 'T's in the sequence to restore the functionality of the protein.	```python tot=1 ans=0 a=str(input()) for i in range(1,len(a)): if a[i]==a[i-1]: tot+=1 else: if tot%2==0: ans+=1 tot=1 print(ans) ```	0
686	A	Free Ice Cream	PROGRAMMING	800	[ "constructive algorithms", "implementation" ]		null	null	After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer. At 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). If 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. Kay 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.	The first line contains two space-separated integers n and x (1<=≤<=n<=≤<=1000, 0<=≤<=x<=≤<=109). Each of the next n lines contains a character '+' or '-', and an integer di, separated by a space (1<=≤<=di<=≤<=109). Record "+ di" in i-th line means that a carrier with di ice cream packs occupies i-th place from the start of the queue, and record "- di" means that a child who wants to take di packs stands in i-th place.	Print two space-separated integers — number of ice cream packs left after all operations, and number of kids that left the house in distress.	[ "5 7\n+ 5\n- 10\n- 20\n+ 40\n- 20\n", "5 17\n- 16\n- 2\n- 98\n+ 100\n- 98\n" ]	[ "22 1\n", "3 2\n" ]	Consider the first sample. 1. Initially Kay and Gerda have 7 packs of ice cream. 1. Carrier brings 5 more, so now they have 12 packs. 1. A kid asks for 10 packs and receives them. There are only 2 packs remaining. 1. Another kid asks for 20 packs. Kay and Gerda do not have them, so the kid goes away distressed. 1. Carrier bring 40 packs, now Kay and Gerda have 42 packs. 1. Kid asks for 20 packs and receives them. There are 22 packs remaining.	500	[ { "input": "5 7\n+ 5\n- 10\n- 20\n+ 40\n- 20", "output": "22 1" }, { "input": "5 17\n- 16\n- 2\n- 98\n+ 100\n- 98", "output": "3 2" }, { "input": "6 1000000000\n+ 1000000000\n+ 1000000000\n+ 1000000000\n+ 1000000000\n+ 1000000000\n+ 1000000000", "output": "7000000000 0" }, { "input": "5 12\n- 12\n+ 7\n- 6\n- 1\n+ 46", "output": "46 0" }, { "input": "11 1000\n- 100\n+ 100\n+ 100\n+ 100\n+ 100\n- 100\n- 100\n- 100\n- 100\n- 100\n- 100", "output": "700 0" }, { "input": "1 0\n- 526403222", "output": "0 1" }, { "input": "1 897986543\n- 371188251", "output": "526798292 0" }, { "input": "1 0\n+ 1", "output": "1 0" }, { "input": "1 0\n- 1", "output": "0 1" }, { "input": "1 10\n+ 10", "output": "20 0" }, { "input": "1 3\n- 5", "output": "3 1" }, { "input": "1 0\n- 5", "output": "0 1" }, { "input": "1 0\n+ 5", "output": "5 0" } ]	1,650,518,631	2,147,483,647	Python 3	OK	TESTS	34	46	0	n, x = map(int, input().split()) distress = 0 for i in range(n) : a, b = input().split() if a == "+" : x += int(b) else : if int(b) > x : distress += 1 else : x -= int(b) print(x, distress)	Title: Free Ice Cream Time Limit: None seconds Memory Limit: None megabytes Problem Description: After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer. At 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). If 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. Kay 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 Specification: The first line contains two space-separated integers n and x (1<=≤<=n<=≤<=1000, 0<=≤<=x<=≤<=109). Each of the next n lines contains a character '+' or '-', and an integer di, separated by a space (1<=≤<=di<=≤<=109). Record "+ di" in i-th line means that a carrier with di ice cream packs occupies i-th place from the start of the queue, and record "- di" means that a child who wants to take di packs stands in i-th place. Output Specification: Print two space-separated integers — number of ice cream packs left after all operations, and number of kids that left the house in distress. Demo Input: ['5 7\n+ 5\n- 10\n- 20\n+ 40\n- 20\n', '5 17\n- 16\n- 2\n- 98\n+ 100\n- 98\n'] Demo Output: ['22 1\n', '3 2\n'] Note: Consider the first sample. 1. Initially Kay and Gerda have 7 packs of ice cream. 1. Carrier brings 5 more, so now they have 12 packs. 1. A kid asks for 10 packs and receives them. There are only 2 packs remaining. 1. Another kid asks for 20 packs. Kay and Gerda do not have them, so the kid goes away distressed. 1. Carrier bring 40 packs, now Kay and Gerda have 42 packs. 1. Kid asks for 20 packs and receives them. There are 22 packs remaining.	```python n, x = map(int, input().split()) distress = 0 for i in range(n) : a, b = input().split() if a == "+" : x += int(b) else : if int(b) > x : distress += 1 else : x -= int(b) print(x, distress) ```	3
242	E	XOR on Segment	PROGRAMMING	2,000	[ "bitmasks", "data structures" ]		null	null	You've got an array a, consisting of n integers a1,<=a2,<=...,<=an. You are allowed to perform two operations on this array: 1. Calculate the sum of current array elements on the segment [l,<=r], that is, count value al<=+<=al<=+<=1<=+<=...<=+<=ar. 1. Apply the xor operation with a given number x to each array element on the segment [l,<=r], that is, execute . This operation changes exactly r<=-<=l<=+<=1 array elements. Expression means applying bitwise xor operation to numbers x and y. The given operation exists in all modern programming languages, for example in language C++ and Java it is marked as "^", in Pascal — as "xor". You've got a list of m operations of the indicated type. Your task is to perform all given operations, for each sum query you should print the result you get.	The first line contains integer n (1<=≤<=n<=≤<=105) — the size of the array. The second line contains space-separated integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=106) — the original array. The third line contains integer m (1<=≤<=m<=≤<=5·104) — the number of operations with the array. The i-th of the following m lines first contains an integer ti (1<=≤<=ti<=≤<=2) — the type of the i-th query. If ti<==<=1, then this is the query of the sum, if ti<==<=2, then this is the query to change array elements. If the i-th operation is of type 1, then next follow two integers li,<=ri (1<=≤<=li<=≤<=ri<=≤<=n). If the i-th operation is of type 2, then next follow three integers li,<=ri,<=xi (1<=≤<=li<=≤<=ri<=≤<=n,<=1<=≤<=xi<=≤<=106). The numbers on the lines are separated by single spaces.	For each query of type 1 print in a single line the sum of numbers on the given segment. Print the answers to the queries in the order in which the queries go in the input. Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams, or the %I64d specifier.	[ "5\n4 10 3 13 7\n8\n1 2 4\n2 1 3 3\n1 2 4\n1 3 3\n2 2 5 5\n1 1 5\n2 1 2 10\n1 2 3\n", "6\n4 7 4 0 7 3\n5\n2 2 3 8\n1 1 5\n2 3 5 1\n2 4 5 6\n1 2 3\n" ]	[ "26\n22\n0\n34\n11\n", "38\n28\n" ]	none	2,500	[]	1,616,539,144	2,147,483,647	PyPy 3	TIME_LIMIT_EXCEEDED	TESTS	13	4,000	11,776,000	class LazySegmentTree: def __init__(self, n): self.base = 1 while self.base < n: self.base = 2 self.tree = [0] (self.base * 2) self.lazy = [0] * (self.base * 2) def _flush(self, pos, l, r): if self.lazy[pos] != 0: assert self.lazy[pos] == 1 self.tree[pos] = r - l + 1 - self.tree[pos] if pos < self.base: self.lazy[2 * pos] ^= self.lazy[pos] self.lazy[2 * pos + 1] ^= self.lazy[pos] self.lazy[pos] = 0 def _get_sum(self, l, r, nl, nr, pos): self._flush(pos, nl, nr) if max(l, nl) > min(r, nr): return 0 if l <= nl and nr <= r: return self.tree[pos] mid = (nl + nr) // 2 return self._get_sum(l, r, nl, mid, 2 * pos) + self._get_sum(l, r, mid + 1, nr, 2 * pos + 1) def get_sum(self, l, r): return self._get_sum(l, r, 0, self.base - 1, 1) def _flip(self, l, r, nl, nr, pos): self._flush(pos, nl, nr) if max(l, nl) > min(r, nr): return if l <= nl and nr <= r: self.lazy[pos] = 1 self._flush(pos, nl, nr) return mid = (nl + nr) // 2 self._flip(l, r, nl, mid, 2 * pos) self._flip(l, r, mid + 1, nr, 2 * pos + 1) self.tree[pos] = self.tree[2 * pos] + self.tree[2 * pos + 1] def flip(self, l, r): self._flip(l, r, 0, self.base - 1, 1) K = 20 n = int(input()) arrays = [LazySegmentTree(n) for _ in range(K)] for i, x in enumerate(map(int, input().split())): for j in range(K): if x & (1 << j): arrays[j].flip(i, i) m = int(input()) for _ in range(m): t = tuple(map(int, input().split())) l, r = t[1] - 1, t[2] - 1 if t[0] == 1: res = 0 for i in range(K): res += arrays[i].get_sum(l, r) << i print(res) else: assert t[0] == 2 x = t[3] for i in range(K): if x & (1 << i): arrays[i].flip(l, r)	Title: XOR on Segment Time Limit: None seconds Memory Limit: None megabytes Problem Description: You've got an array a, consisting of n integers a1,<=a2,<=...,<=an. You are allowed to perform two operations on this array: 1. Calculate the sum of current array elements on the segment [l,<=r], that is, count value al<=+<=al<=+<=1<=+<=...<=+<=ar. 1. Apply the xor operation with a given number x to each array element on the segment [l,<=r], that is, execute . This operation changes exactly r<=-<=l<=+<=1 array elements. Expression means applying bitwise xor operation to numbers x and y. The given operation exists in all modern programming languages, for example in language C++ and Java it is marked as "^", in Pascal — as "xor". You've got a list of m operations of the indicated type. Your task is to perform all given operations, for each sum query you should print the result you get. Input Specification: The first line contains integer n (1<=≤<=n<=≤<=105) — the size of the array. The second line contains space-separated integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=106) — the original array. The third line contains integer m (1<=≤<=m<=≤<=5·104) — the number of operations with the array. The i-th of the following m lines first contains an integer ti (1<=≤<=ti<=≤<=2) — the type of the i-th query. If ti<==<=1, then this is the query of the sum, if ti<==<=2, then this is the query to change array elements. If the i-th operation is of type 1, then next follow two integers li,<=ri (1<=≤<=li<=≤<=ri<=≤<=n). If the i-th operation is of type 2, then next follow three integers li,<=ri,<=xi (1<=≤<=li<=≤<=ri<=≤<=n,<=1<=≤<=xi<=≤<=106). The numbers on the lines are separated by single spaces. Output Specification: For each query of type 1 print in a single line the sum of numbers on the given segment. Print the answers to the queries in the order in which the queries go in the input. Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams, or the %I64d specifier. Demo Input: ['5\n4 10 3 13 7\n8\n1 2 4\n2 1 3 3\n1 2 4\n1 3 3\n2 2 5 5\n1 1 5\n2 1 2 10\n1 2 3\n', '6\n4 7 4 0 7 3\n5\n2 2 3 8\n1 1 5\n2 3 5 1\n2 4 5 6\n1 2 3\n'] Demo Output: ['26\n22\n0\n34\n11\n', '38\n28\n'] Note: none	```python class LazySegmentTree: def __init__(self, n): self.base = 1 while self.base < n: self.base = 2 self.tree = [0] (self.base * 2) self.lazy = [0] * (self.base * 2) def _flush(self, pos, l, r): if self.lazy[pos] != 0: assert self.lazy[pos] == 1 self.tree[pos] = r - l + 1 - self.tree[pos] if pos < self.base: self.lazy[2 * pos] ^= self.lazy[pos] self.lazy[2 * pos + 1] ^= self.lazy[pos] self.lazy[pos] = 0 def _get_sum(self, l, r, nl, nr, pos): self._flush(pos, nl, nr) if max(l, nl) > min(r, nr): return 0 if l <= nl and nr <= r: return self.tree[pos] mid = (nl + nr) // 2 return self._get_sum(l, r, nl, mid, 2 * pos) + self._get_sum(l, r, mid + 1, nr, 2 * pos + 1) def get_sum(self, l, r): return self._get_sum(l, r, 0, self.base - 1, 1) def _flip(self, l, r, nl, nr, pos): self._flush(pos, nl, nr) if max(l, nl) > min(r, nr): return if l <= nl and nr <= r: self.lazy[pos] = 1 self._flush(pos, nl, nr) return mid = (nl + nr) // 2 self._flip(l, r, nl, mid, 2 * pos) self._flip(l, r, mid + 1, nr, 2 * pos + 1) self.tree[pos] = self.tree[2 * pos] + self.tree[2 * pos + 1] def flip(self, l, r): self._flip(l, r, 0, self.base - 1, 1) K = 20 n = int(input()) arrays = [LazySegmentTree(n) for _ in range(K)] for i, x in enumerate(map(int, input().split())): for j in range(K): if x & (1 << j): arrays[j].flip(i, i) m = int(input()) for _ in range(m): t = tuple(map(int, input().split())) l, r = t[1] - 1, t[2] - 1 if t[0] == 1: res = 0 for i in range(K): res += arrays[i].get_sum(l, r) << i print(res) else: assert t[0] == 2 x = t[3] for i in range(K): if x & (1 << i): arrays[i].flip(l, r) ```	0
230	A	Dragons	PROGRAMMING	1,000	[ "greedy", "sortings" ]		null	null	Kirito is stuck on a level of the MMORPG he is playing now. To move on in the game, he's got to defeat all n dragons that live on this level. Kirito and the dragons have strength, which is represented by an integer. In the duel between two opponents the duel's outcome is determined by their strength. Initially, Kirito's strength equals s. If Kirito starts duelling with the i-th (1<=≤<=i<=≤<=n) dragon and Kirito's strength is not greater than the dragon's strength xi, then Kirito loses the duel and dies. But if Kirito's strength is greater than the dragon's strength, then he defeats the dragon and gets a bonus strength increase by yi. Kirito can fight the dragons in any order. Determine whether he can move on to the next level of the game, that is, defeat all dragons without a single loss.	The first line contains two space-separated integers s and n (1<=≤<=s<=≤<=104, 1<=≤<=n<=≤<=103). Then n lines follow: the i-th line contains space-separated integers xi and yi (1<=≤<=xi<=≤<=104, 0<=≤<=yi<=≤<=104) — the i-th dragon's strength and the bonus for defeating it.	On a single line print "YES" (without the quotes), if Kirito can move on to the next level and print "NO" (without the quotes), if he can't.	[ "2 2\n1 99\n100 0\n", "10 1\n100 100\n" ]	[ "YES\n", "NO\n" ]	In the first sample Kirito's strength initially equals 2. As the first dragon's strength is less than 2, Kirito can fight it and defeat it. After that he gets the bonus and his strength increases to 2 + 99 = 101. Now he can defeat the second dragon and move on to the next level. In the second sample Kirito's strength is too small to defeat the only dragon and win.	500	[ { "input": "2 2\n1 99\n100 0", "output": "YES" }, { "input": "10 1\n100 100", "output": "NO" }, { "input": "123 2\n78 10\n130 0", "output": "YES" }, { "input": "999 2\n1010 10\n67 89", "output": "YES" }, { "input": "2 5\n5 1\n2 1\n3 1\n1 1\n4 1", "output": "YES" }, { "input": "2 2\n3 5\n1 2", "output": "YES" }, { "input": "1 2\n1 0\n1 0", "output": "NO" }, { "input": "5 10\n20 1\n4 3\n5 1\n100 1\n4 2\n101 1\n10 0\n10 2\n17 3\n12 84", "output": "YES" }, { "input": "2 2\n1 98\n100 0", "output": "NO" }, { "input": "2 2\n1 2\n3 5", "output": "YES" }, { "input": "5 3\n13 20\n3 10\n15 5", "output": "YES" }, { "input": "2 5\n1 1\n2 1\n3 1\n4 1\n5 1", "output": "YES" }, { "input": "3 3\n1 1\n1 2\n4 0", "output": "YES" }, { "input": "10 4\n20 1\n3 5\n2 4\n1 3", "output": "YES" }, { "input": "10 1\n1 1", "output": "YES" }, { "input": "4 1\n100 1000", "output": "NO" }, { "input": "5 1\n6 7", "output": "NO" }, { "input": "10 1\n10 10", "output": "NO" }, { "input": "6 2\n496 0\n28 8128", "output": "NO" }, { "input": "4 2\n2 1\n10 3", "output": "NO" }, { "input": "11 2\n22 0\n33 0", "output": "NO" }, { "input": "1 2\n100 1\n100 1", "output": "NO" }, { "input": "10 3\n12 0\n13 0\n14 0", "output": "NO" }, { "input": "50 3\n39 0\n38 0\n37 0", "output": "YES" }, { "input": "14 3\n1 5\n1 6\n1 7", "output": "YES" }, { "input": "1 3\n1 10\n1 11\n1 9", "output": "NO" }, { "input": "10 10\n2 10\n3 10\n4 10\n2 20\n3 20\n3 20\n100 50\n100 30\n150 30\n200 10", "output": "NO" }, { "input": "9983 34\n6626 5976\n4448 3568\n2794 2309\n3741 8806\n4754 129\n2780 9275\n5785 9243\n3915 6159\n2609 4331\n238 6756\n6987 3887\n3384 5711\n4349 5563\n1135 4483\n9151 1584\n1500 766\n1608 4440\n7768 5005\n7205 2360\n9088 2933\n3923 7814\n7538 9372\n7504 165\n5277 1636\n2061 4384\n7668 1422\n9582 2121\n5483 7967\n487 2944\n7432 5794\n8208 8970\n5747 3800\n4322 3920\n8261 9319", "output": "YES" }, { "input": "1 10\n8 8\n54 3\n1 8\n26 3\n16 1\n29 9\n38 10\n57 8\n48 6\n17 9", "output": "NO" }, { "input": "5 10\n7 0\n7 0\n10 0\n10 0\n7 2\n4 2\n9 0\n6 1\n7 0\n7 0", "output": "NO" }, { "input": "2 3\n1 1\n1 10\n17 2", "output": "NO" }, { "input": "100 5\n99 100\n199 1\n199 1\n199 1\n202 1", "output": "YES" }, { "input": "1 1\n10000 1", "output": "NO" } ]	1,698,289,769	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	3	92	0	s, n = list(map(int, input().split(" "))) si = s for i in range(n): xi, yi = list(map(int, input().split(" "))) if si < xi: print("NO") break if i == n-1: print("YES") break si += yi	Title: Dragons Time Limit: None seconds Memory Limit: None megabytes Problem Description: Kirito is stuck on a level of the MMORPG he is playing now. To move on in the game, he's got to defeat all n dragons that live on this level. Kirito and the dragons have strength, which is represented by an integer. In the duel between two opponents the duel's outcome is determined by their strength. Initially, Kirito's strength equals s. If Kirito starts duelling with the i-th (1<=≤<=i<=≤<=n) dragon and Kirito's strength is not greater than the dragon's strength xi, then Kirito loses the duel and dies. But if Kirito's strength is greater than the dragon's strength, then he defeats the dragon and gets a bonus strength increase by yi. Kirito can fight the dragons in any order. Determine whether he can move on to the next level of the game, that is, defeat all dragons without a single loss. Input Specification: The first line contains two space-separated integers s and n (1<=≤<=s<=≤<=104, 1<=≤<=n<=≤<=103). Then n lines follow: the i-th line contains space-separated integers xi and yi (1<=≤<=xi<=≤<=104, 0<=≤<=yi<=≤<=104) — the i-th dragon's strength and the bonus for defeating it. Output Specification: On a single line print "YES" (without the quotes), if Kirito can move on to the next level and print "NO" (without the quotes), if he can't. Demo Input: ['2 2\n1 99\n100 0\n', '10 1\n100 100\n'] Demo Output: ['YES\n', 'NO\n'] Note: In the first sample Kirito's strength initially equals 2. As the first dragon's strength is less than 2, Kirito can fight it and defeat it. After that he gets the bonus and his strength increases to 2 + 99 = 101. Now he can defeat the second dragon and move on to the next level. In the second sample Kirito's strength is too small to defeat the only dragon and win.	```python s, n = list(map(int, input().split(" "))) si = s for i in range(n): xi, yi = list(map(int, input().split(" "))) if si < xi: print("NO") break if i == n-1: print("YES") break si += yi ```	0
53	A	Autocomplete	PROGRAMMING	1,100	[ "implementation" ]	A. Autocomplete	2	256	Autocomplete is a program function that enables inputting the text (in editors, command line shells, browsers etc.) completing the text by its inputted part. Vasya is busy working on a new browser called 'BERowser'. He happens to be working on the autocomplete function in the address line at this very moment. A list consisting of n last visited by the user pages and the inputted part s are known. Your task is to complete s to make it an address of one of the pages from the list. You have to find the lexicographically smallest address having a prefix s.	The first line contains the s line which is the inputted part. The second line contains an integer n (1<=≤<=n<=≤<=100) which is the number of visited pages. Then follow n lines which are the visited pages, one on each line. All the lines have lengths of from 1 to 100 symbols inclusively and consist of lowercase Latin letters only.	If s is not the beginning of any of n addresses of the visited pages, print s. Otherwise, print the lexicographically minimal address of one of the visited pages starting from s. The lexicographical order is the order of words in a dictionary. The lexicographical comparison of lines is realized by the '<' operator in the modern programming languages.	[ "next\n2\nnextpermutation\nnextelement\n", "find\n4\nfind\nfindfirstof\nfindit\nfand\n", "find\n4\nfondfind\nfondfirstof\nfondit\nfand\n" ]	[ "nextelement\n", "find\n", "find\n" ]	none	500	[ { "input": "next\n2\nnextpermutation\nnextelement", "output": "nextelement" }, { "input": "find\n4\nfind\nfindfirstof\nfindit\nfand", "output": "find" }, { "input": "find\n4\nfondfind\nfondfirstof\nfondit\nfand", "output": "find" }, { "input": "kudljmxcse\n4\nkudljmxcse\nszjebdoad\nchz\na", "output": "kudljmxcse" }, { "input": "ntqwpa\n5\nvvepyowvn\nntqwpakay\nhh\nygiafasda\nntqwpadm", "output": "ntqwpadm" }, { "input": "aflb\n6\nsaej\nujxsiijg\npp\nhgoprw\ncp\nnt", "output": "aflb" }, { "input": "dzwzyj\n7\nwvixktp\ndzwzyjuhn\ndzwzyjqrbd\ndzwzyji\ndzwzyjyfys\ndzwzyjrcb\nxptb", "output": "dzwzyji" }, { "input": "wmblbphwdjjskzmlsyiznluiudelhlvcpyrooajvbwudnnstdhesauyxjugdwhrrwg\n1\nwjhsbxrrhadgtnybsugdtprncwerwezxuaxnqfpnosbispmnymnaqssdkjeynrnn", "output": "wmblbphwdjjskzmlsyiznluiudelhlvcpyrooajvbwudnnstdhesauyxjugdwhrrwg" }, { "input": "hzkqvwliymwjbejfpnydrbwskhyrtrlsdinfrgwmnbdpwytcnjeoowxrfgfuaffzayjylvzu\n1\nhzkqvwliymwjbejfpnydrbwskhyrtrlsdinfrgwmnbdpwytcnjeoowxrfgfuaffzayjylvzubwjlvhhsfurqb", "output": "hzkqvwliymwjbejfpnydrbwskhyrtrlsdinfrgwmnbdpwytcnjeoowxrfgfuaffzayjylvzubwjlvhhsfurqb" }, { "input": "msjnqudojxtzvpc\n2\nvlxclsvqbucmbrkwwtoxek\nmsjnqudojxtzvpcldwjyystsxrtexfhllzhnkidmhmyxpld", "output": "msjnqudojxtzvpcldwjyystsxrtexfhllzhnkidmhmyxpld" } ]	1,585,676,156	2,147,483,647	Python 3	OK	TESTS	25	218	0	s = input() n = int(input()) result = "z"103 for i in range(n): str = input() if str.startswith(s) : if str < result: result = str min_lenght = len(str) if result == "z"103: print(s) else: print(result)	Title: Autocomplete Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Autocomplete is a program function that enables inputting the text (in editors, command line shells, browsers etc.) completing the text by its inputted part. Vasya is busy working on a new browser called 'BERowser'. He happens to be working on the autocomplete function in the address line at this very moment. A list consisting of n last visited by the user pages and the inputted part s are known. Your task is to complete s to make it an address of one of the pages from the list. You have to find the lexicographically smallest address having a prefix s. Input Specification: The first line contains the s line which is the inputted part. The second line contains an integer n (1<=≤<=n<=≤<=100) which is the number of visited pages. Then follow n lines which are the visited pages, one on each line. All the lines have lengths of from 1 to 100 symbols inclusively and consist of lowercase Latin letters only. Output Specification: If s is not the beginning of any of n addresses of the visited pages, print s. Otherwise, print the lexicographically minimal address of one of the visited pages starting from s. The lexicographical order is the order of words in a dictionary. The lexicographical comparison of lines is realized by the '<' operator in the modern programming languages. Demo Input: ['next\n2\nnextpermutation\nnextelement\n', 'find\n4\nfind\nfindfirstof\nfindit\nfand\n', 'find\n4\nfondfind\nfondfirstof\nfondit\nfand\n'] Demo Output: ['nextelement\n', 'find\n', 'find\n'] Note: none	```python s = input() n = int(input()) result = "z"103 for i in range(n): str = input() if str.startswith(s) : if str < result: result = str min_lenght = len(str) if result == "z"103: print(s) else: print(result) ```	3.9455
71	A	Way Too Long Words	PROGRAMMING	800	[ "strings" ]	A. Way Too Long Words	1	256	Sometimes some words like "localization" or "internationalization" are so long that writing them many times in one text is quite tiresome. Let'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. This 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. Thus, "localization" will be spelt as "l10n", and "internationalization» will be spelt as "i18n". You 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.	The first line contains an integer n (1<=≤<=n<=≤<=100). Each of the following n lines contains one word. All the words consist of lowercase Latin letters and possess the lengths of from 1 to 100 characters.	Print n lines. The i-th line should contain the result of replacing of the i-th word from the input data.	[ "4\nword\nlocalization\ninternationalization\npneumonoultramicroscopicsilicovolcanoconiosis\n" ]	[ "word\nl10n\ni18n\np43s\n" ]	none	500	[ { "input": "4\nword\nlocalization\ninternationalization\npneumonoultramicroscopicsilicovolcanoconiosis", "output": "word\nl10n\ni18n\np43s" }, { "input": "5\nabcdefgh\nabcdefghi\nabcdefghij\nabcdefghijk\nabcdefghijklm", "output": "abcdefgh\nabcdefghi\nabcdefghij\na9k\na11m" }, { "input": "3\nnjfngnrurunrgunrunvurn\njfvnjfdnvjdbfvsbdubruvbubvkdb\nksdnvidnviudbvibd", "output": "n20n\nj27b\nk15d" }, { "input": "1\ntcyctkktcctrcyvbyiuhihhhgyvyvyvyvjvytchjckt", "output": "t41t" }, { "input": "24\nyou\nare\nregistered\nfor\npractice\nyou\ncan\nsolve\nproblems\nunofficially\nresults\ncan\nbe\nfound\nin\nthe\ncontest\nstatus\nand\nin\nthe\nbottom\nof\nstandings", "output": "you\nare\nregistered\nfor\npractice\nyou\ncan\nsolve\nproblems\nu10y\nresults\ncan\nbe\nfound\nin\nthe\ncontest\nstatus\nand\nin\nthe\nbottom\nof\nstandings" }, { "input": "1\na", "output": "a" }, { "input": "26\na\nb\nc\nd\ne\nf\ng\nh\ni\nj\nk\nl\nm\nn\no\np\nq\nr\ns\nt\nu\nv\nw\nx\ny\nz", "output": "a\nb\nc\nd\ne\nf\ng\nh\ni\nj\nk\nl\nm\nn\no\np\nq\nr\ns\nt\nu\nv\nw\nx\ny\nz" }, { "input": "1\nabcdefghijabcdefghijabcdefghijabcdefghijabcdefghijabcdefghijabcdefghijabcdefghijabcdefghijabcdefghij", "output": "a98j" }, { "input": "10\ngyartjdxxlcl\nfzsck\nuidwu\nxbymclornemdmtj\nilppyoapitawgje\ncibzc\ndrgbeu\nhezplmsdekhhbo\nfeuzlrimbqbytdu\nkgdco", "output": "g10l\nfzsck\nuidwu\nx13j\ni13e\ncibzc\ndrgbeu\nh12o\nf13u\nkgdco" }, { "input": "20\nlkpmx\nkovxmxorlgwaomlswjxlpnbvltfv\nhykasjxqyjrmybejnmeumzha\ntuevlumpqbbhbww\nqgqsphvrmupxxc\ntrissbaf\nqfgrlinkzvzqdryckaizutd\nzzqtoaxkvwoscyx\noswytrlnhpjvvnwookx\nlpuzqgec\ngyzqfwxggtvpjhzmzmdw\nrlxjgmvdftvrmvbdwudra\nvsntnjpepnvdaxiporggmglhagv\nxlvcqkqgcrbgtgglj\nlyxwxbiszyhlsrgzeedzprbmcpduvq\nyrmqqvrkqskqukzqrwukpsifgtdc\nxpuohcsjhhuhvr\nvvlfrlxpvqejngwrbfbpmqeirxlw\nsvmasocxdvadmaxtrpakysmeaympy\nyuflqboqfdt", "output": "lkpmx\nk26v\nh22a\nt13w\nq12c\ntrissbaf\nq21d\nz13x\no17x\nlpuzqgec\ng18w\nr19a\nv25v\nx15j\nl28q\ny26c\nx12r\nv26w\ns27y\ny9t" }, { "input": "100\nm\nz\ns\nv\nd\nr\nv\ny\ny\ne\np\nt\nc\na\nn\nm\np\ng\ni\nj\nc\na\nb\nq\ne\nn\nv\no\nk\nx\nf\ni\nl\na\nq\nr\nu\nb\ns\nl\nc\nl\ne\nv\nj\nm\nx\nb\na\nq\nb\na\nf\nj\nv\nm\nq\nc\nt\nt\nn\nx\no\ny\nr\nu\nh\nm\nj\np\nj\nq\nz\ns\nj\no\ng\nc\nm\nn\no\nm\nr\no\ns\nt\nh\nr\np\nk\nb\nz\ng\no\nc\nc\nz\nz\ng\nr", "output": "m\nz\ns\nv\nd\nr\nv\ny\ny\ne\np\nt\nc\na\nn\nm\np\ng\ni\nj\nc\na\nb\nq\ne\nn\nv\no\nk\nx\nf\ni\nl\na\nq\nr\nu\nb\ns\nl\nc\nl\ne\nv\nj\nm\nx\nb\na\nq\nb\na\nf\nj\nv\nm\nq\nc\nt\nt\nn\nx\no\ny\nr\nu\nh\nm\nj\np\nj\nq\nz\ns\nj\no\ng\nc\nm\nn\no\nm\nr\no\ns\nt\nh\nr\np\nk\nb\nz\ng\no\nc\nc\nz\nz\ng\nr" } ]	1,680,124,551	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	30	0	for i in [0]*int(input):a=input(); l = len(a); print([a, a[0]+str(l-2)+a[l-1]][l<10])	Title: Way Too Long Words Time Limit: 1 seconds Memory Limit: 256 megabytes Problem Description: Sometimes some words like "localization" or "internationalization" are so long that writing them many times in one text is quite tiresome. Let'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. This 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. Thus, "localization" will be spelt as "l10n", and "internationalization» will be spelt as "i18n". You 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 Specification: The first line contains an integer n (1<=≤<=n<=≤<=100). Each of the following n lines contains one word. All the words consist of lowercase Latin letters and possess the lengths of from 1 to 100 characters. Output Specification: Print n lines. The i-th line should contain the result of replacing of the i-th word from the input data. Demo Input: ['4\nword\nlocalization\ninternationalization\npneumonoultramicroscopicsilicovolcanoconiosis\n'] Demo Output: ['word\nl10n\ni18n\np43s\n'] Note: none	```python for i in [0]*int(input):a=input(); l = len(a); print([a, a[0]+str(l-2)+a[l-1]][l<10]) ```	-1
34	B	Sale	PROGRAMMING	900	[ "greedy", "sortings" ]	B. Sale	2	256	Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai 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.	The first line contains two space-separated integers n and m (1<=≤<=m<=≤<=n<=≤<=100) — amount of TV sets at the sale, and amount of TV sets that Bob can carry. The following line contains n space-separated integers ai (<=-<=1000<=≤<=ai<=≤<=1000) — prices of the TV sets.	Output the only number — the maximum sum of money that Bob can earn, given that he can carry at most m TV sets.	[ "5 3\n-6 0 35 -2 4\n", "4 2\n7 0 0 -7\n" ]	[ "8\n", "7\n" ]	none	1,000	[ { "input": "5 3\n-6 0 35 -2 4", "output": "8" }, { "input": "4 2\n7 0 0 -7", "output": "7" }, { "input": "6 6\n756 -611 251 -66 572 -818", "output": "1495" }, { "input": "5 5\n976 437 937 788 518", "output": "0" }, { "input": "5 3\n-2 -2 -2 -2 -2", "output": "6" }, { "input": "5 1\n998 997 985 937 998", "output": "0" }, { "input": "2 2\n-742 -187", "output": "929" }, { "input": "3 3\n522 597 384", "output": "0" }, { "input": "4 2\n-215 -620 192 647", "output": "835" }, { "input": "10 6\n557 605 685 231 910 633 130 838 -564 -85", "output": "649" }, { "input": "20 14\n932 442 960 943 624 624 955 998 631 910 850 517 715 123 1000 155 -10 961 966 59", "output": "10" }, { "input": "30 5\n991 997 996 967 977 999 991 986 1000 965 984 997 998 1000 958 983 974 1000 991 999 1000 978 961 992 990 998 998 978 998 1000", "output": "0" }, { "input": "50 20\n-815 -947 -946 -993 -992 -846 -884 -954 -963 -733 -940 -746 -766 -930 -821 -937 -937 -999 -914 -938 -936 -975 -939 -981 -977 -952 -925 -901 -952 -978 -994 -957 -946 -896 -905 -836 -994 -951 -887 -939 -859 -953 -985 -988 -946 -829 -956 -842 -799 -886", "output": "19441" }, { "input": "88 64\n999 999 1000 1000 999 996 995 1000 1000 999 1000 997 998 1000 999 1000 997 1000 993 998 994 999 998 996 1000 997 1000 1000 1000 997 1000 998 997 1000 1000 998 1000 998 999 1000 996 999 999 999 996 995 999 1000 998 999 1000 999 999 1000 1000 1000 996 1000 1000 1000 997 1000 1000 997 999 1000 1000 1000 1000 1000 999 999 1000 1000 996 999 1000 1000 995 999 1000 996 1000 998 999 999 1000 999", "output": "0" }, { "input": "99 17\n-993 -994 -959 -989 -991 -995 -976 -997 -990 -1000 -996 -994 -999 -995 -1000 -983 -979 -1000 -989 -968 -994 -992 -962 -993 -999 -983 -991 -979 -995 -993 -973 -999 -995 -995 -999 -993 -995 -992 -947 -1000 -999 -998 -982 -988 -979 -993 -963 -988 -980 -990 -979 -976 -995 -999 -981 -988 -998 -999 -970 -1000 -983 -994 -943 -975 -998 -977 -973 -997 -959 -999 -983 -985 -950 -977 -977 -991 -998 -973 -987 -985 -985 -986 -984 -994 -978 -998 -989 -989 -988 -970 -985 -974 -997 -981 -962 -972 -995 -988 -993", "output": "16984" }, { "input": "100 37\n205 19 -501 404 912 -435 -322 -469 -655 880 -804 -470 793 312 -108 586 -642 -928 906 605 -353 -800 745 -440 -207 752 -50 -28 498 -800 -62 -195 602 -833 489 352 536 404 -775 23 145 -512 524 759 651 -461 -427 -557 684 -366 62 592 -563 -811 64 418 -881 -308 591 -318 -145 -261 -321 -216 -18 595 -202 960 -4 219 226 -238 -882 -963 425 970 -434 -160 243 -672 -4 873 8 -633 904 -298 -151 -377 -61 -72 -677 -66 197 -716 3 -870 -30 152 -469 981", "output": "21743" }, { "input": "100 99\n-931 -806 -830 -828 -916 -962 -660 -867 -952 -966 -820 -906 -724 -982 -680 -717 -488 -741 -897 -613 -986 -797 -964 -939 -808 -932 -810 -860 -641 -916 -858 -628 -821 -929 -917 -976 -664 -985 -778 -665 -624 -928 -940 -958 -884 -757 -878 -896 -634 -526 -514 -873 -990 -919 -988 -878 -650 -973 -774 -783 -733 -648 -756 -895 -833 -974 -832 -725 -841 -748 -806 -613 -924 -867 -881 -943 -864 -991 -809 -926 -777 -817 -998 -682 -910 -996 -241 -722 -964 -904 -821 -920 -835 -699 -805 -632 -779 -317 -915 -654", "output": "81283" }, { "input": "100 14\n995 994 745 684 510 737 984 690 979 977 542 933 871 603 758 653 962 997 747 974 773 766 975 770 527 960 841 989 963 865 974 967 950 984 757 685 986 809 982 959 931 880 978 867 805 562 970 900 834 782 616 885 910 608 974 918 576 700 871 980 656 941 978 759 767 840 573 859 841 928 693 853 716 927 976 851 962 962 627 797 707 873 869 988 993 533 665 887 962 880 929 980 877 887 572 790 721 883 848 782", "output": "0" }, { "input": "100 84\n768 946 998 752 931 912 826 1000 991 910 875 962 901 952 958 733 959 908 872 840 923 826 952 980 974 980 947 955 959 822 997 963 966 933 829 923 971 999 926 932 865 984 974 858 994 855 949 941 992 861 951 949 991 711 763 728 935 485 716 907 869 952 960 859 909 963 978 942 968 933 923 909 997 962 687 764 924 774 875 1000 961 951 987 974 848 921 966 859 995 997 974 931 886 941 974 986 906 978 998 823", "output": "0" }, { "input": "100 80\n-795 -994 -833 -930 -974 -980 -950 -940 -788 -927 -583 -956 -945 -949 -809 -974 -957 -736 -967 -908 -975 -961 -986 -983 -963 -771 -952 -847 -751 -741 -982 -959 -925 -931 -839 -937 -880 -914 -858 -998 -812 -911 -862 -965 -943 -984 -738 -920 -950 -998 -909 -998 -781 -901 -677 -940 -985 -951 -675 -952 -967 -949 -882 -641 -969 -937 -975 -993 -913 -941 -807 -851 -832 -960 -939 -943 -895 -929 -528 -880 -823 -930 -888 -862 -948 -966 -962 -857 -799 -969 -833 -998 -952 -878 -946 -971 -976 -974 -723 -992", "output": "75068" }, { "input": "1 1\n0", "output": "0" }, { "input": "1 1\n1", "output": "0" }, { "input": "1 1\n555", "output": "0" }, { "input": "1 1\n-1", "output": "1" }, { "input": "1 1\n-24", "output": "24" } ]	1,556,268,757	2,147,483,647	Python 3	OK	TESTS	25	218	0	n, m = map(int, input().split()) lst = list(map(int, input().split())) result = [] count = 0 for i in range(m): x = min(lst) if x <= 0: lst.remove(x) result.append(x) else: break for i in result: count -= i print(count)	Title: Sale Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai 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 Specification: The first line contains two space-separated integers n and m (1<=≤<=m<=≤<=n<=≤<=100) — amount of TV sets at the sale, and amount of TV sets that Bob can carry. The following line contains n space-separated integers ai (<=-<=1000<=≤<=ai<=≤<=1000) — prices of the TV sets. Output Specification: Output the only number — the maximum sum of money that Bob can earn, given that he can carry at most m TV sets. Demo Input: ['5 3\n-6 0 35 -2 4\n', '4 2\n7 0 0 -7\n'] Demo Output: ['8\n', '7\n'] Note: none	```python n, m = map(int, input().split()) lst = list(map(int, input().split())) result = [] count = 0 for i in range(m): x = min(lst) if x <= 0: lst.remove(x) result.append(x) else: break for i in result: count -= i print(count) ```	3.9455
371	B	Fox Dividing Cheese	PROGRAMMING	1,300	[ "math", "number theory" ]		null	null	Two little greedy bears have found two pieces of cheese in the forest of weight a and b grams, correspondingly. The bears are so greedy that they are ready to fight for the larger piece. That's where the fox comes in and starts the dialog: "Little bears, wait a little, I want to make your pieces equal" "Come off it fox, how are you going to do that?", the curious bears asked. "It's easy", said the fox. "If the mass of a certain piece is divisible by two, then I can eat exactly a half of the piece. If the mass of a certain piece is divisible by three, then I can eat exactly two-thirds, and if the mass is divisible by five, then I can eat four-fifths. I'll eat a little here and there and make the pieces equal". The little bears realize that the fox's proposal contains a catch. But at the same time they realize that they can not make the two pieces equal themselves. So they agreed to her proposal, but on one condition: the fox should make the pieces equal as quickly as possible. Find the minimum number of operations the fox needs to make pieces equal.	The first line contains two space-separated integers a and b (1<=≤<=a,<=b<=≤<=109).	If the fox is lying to the little bears and it is impossible to make the pieces equal, print -1. Otherwise, print the required minimum number of operations. If the pieces of the cheese are initially equal, the required number is 0.	[ "15 20\n", "14 8\n", "6 6\n" ]	[ "3\n", "-1\n", "0\n" ]	none	1,000	[ { "input": "15 20", "output": "3" }, { "input": "14 8", "output": "-1" }, { "input": "6 6", "output": "0" }, { "input": "1 1", "output": "0" }, { "input": "1 1024", "output": "10" }, { "input": "1024 729", "output": "16" }, { "input": "1024 1048576", "output": "10" }, { "input": "36 30", "output": "3" }, { "input": "100 10", "output": "2" }, { "input": "21 35", "output": "2" }, { "input": "9900 7128", "output": "5" }, { "input": "7920 9900", "output": "3" }, { "input": "576000 972000", "output": "7" }, { "input": "691200 583200", "output": "8" }, { "input": "607500 506250", "output": "3" }, { "input": "881280 765000", "output": "9" }, { "input": "800000 729000", "output": "13" }, { "input": "792000 792000", "output": "0" }, { "input": "513600 513600", "output": "0" }, { "input": "847500 610200", "output": "5" }, { "input": "522784320 784176480", "output": "2" }, { "input": "689147136 861433920", "output": "3" }, { "input": "720212000 864254400", "output": "3" }, { "input": "673067520 807681024", "output": "3" }, { "input": "919536000 993098880", "output": "5" }, { "input": "648293430 540244525", "output": "3" }, { "input": "537814642 537814642", "output": "0" }, { "input": "100000007 800000011", "output": "-1" }, { "input": "900000011 800000011", "output": "-1" }, { "input": "900000011 999900017", "output": "-1" }, { "input": "536870912 387420489", "output": "47" }, { "input": "820125000 874800000", "output": "6" }, { "input": "864000000 607500000", "output": "9" }, { "input": "609120000 913680000", "output": "2" }, { "input": "509607936 306110016", "output": "24" }, { "input": "445906944 528482304", "output": "8" }, { "input": "119144448 423624704", "output": "7" }, { "input": "1 1000000000", "output": "18" }, { "input": "1000000000 1", "output": "18" }, { "input": "1000000000 2", "output": "17" }, { "input": "2 1000000000", "output": "17" }, { "input": "5 1000000000", "output": "17" }, { "input": "1000000000 5", "output": "17" }, { "input": "3 1000000000", "output": "19" }, { "input": "1000000000 3", "output": "19" }, { "input": "1000000000 7", "output": "-1" }, { "input": "2208870 122715", "output": "3" }, { "input": "4812500 7577955", "output": "16" }, { "input": "3303936 3097440", "output": "6" }, { "input": "55404 147744", "output": "4" }, { "input": "10332160 476643528", "output": "19" }, { "input": "21751200 43502400", "output": "1" }, { "input": "19500000 140400000", "output": "5" }, { "input": "1 22", "output": "-1" } ]	1,607,338,027	2,147,483,647	Python 3	OK	TESTS	54	155	409,600	from collections import Counter def solve(n): t = [] while n % 2 == 0 : t.append(2) n//= 2 i = 3 while i * i <= n : while n % i == 0 : t.append(i) n//= i i += 1 if n > 2 : t.append(n) return t a , b = map(int,input().split()) if a == b :print(0);exit() #print(solve(a)) #print(solve(b)) r1 = Counter(solve(a)) r2 = Counter(solve(b)) #print(r1) #print(r2) cnt1 , cnt2 = 0 , 0 flag = True for i in r1.keys() : if i in r2.keys() and r1[i] != r2[i]: if (i % 2 == 0 or i % 3 == 0 or i % 5 == 0 ): cnt1 += abs(r1[i] - r2[i]) else: flag = False break elif i not in r2.keys(): if (i % 2 == 0 or i % 3 == 0 or i % 5 == 0 ): cnt1+= r1[i] else: flag = False break if flag == False: print('-1') exit(0) for i in r2.keys() : if i not in r1.keys() : if (i % 2 == 0 or i % 3 == 0 or i % 5 == 0 ): cnt2 += r2[i] else: flag = False break if flag == False: print(-1) exit(0) print(cnt1 + cnt2)	Title: Fox Dividing Cheese Time Limit: None seconds Memory Limit: None megabytes Problem Description: Two little greedy bears have found two pieces of cheese in the forest of weight a and b grams, correspondingly. The bears are so greedy that they are ready to fight for the larger piece. That's where the fox comes in and starts the dialog: "Little bears, wait a little, I want to make your pieces equal" "Come off it fox, how are you going to do that?", the curious bears asked. "It's easy", said the fox. "If the mass of a certain piece is divisible by two, then I can eat exactly a half of the piece. If the mass of a certain piece is divisible by three, then I can eat exactly two-thirds, and if the mass is divisible by five, then I can eat four-fifths. I'll eat a little here and there and make the pieces equal". The little bears realize that the fox's proposal contains a catch. But at the same time they realize that they can not make the two pieces equal themselves. So they agreed to her proposal, but on one condition: the fox should make the pieces equal as quickly as possible. Find the minimum number of operations the fox needs to make pieces equal. Input Specification: The first line contains two space-separated integers a and b (1<=≤<=a,<=b<=≤<=109). Output Specification: If the fox is lying to the little bears and it is impossible to make the pieces equal, print -1. Otherwise, print the required minimum number of operations. If the pieces of the cheese are initially equal, the required number is 0. Demo Input: ['15 20\n', '14 8\n', '6 6\n'] Demo Output: ['3\n', '-1\n', '0\n'] Note: none	```python from collections import Counter def solve(n): t = [] while n % 2 == 0 : t.append(2) n//= 2 i = 3 while i * i <= n : while n % i == 0 : t.append(i) n//= i i += 1 if n > 2 : t.append(n) return t a , b = map(int,input().split()) if a == b :print(0);exit() #print(solve(a)) #print(solve(b)) r1 = Counter(solve(a)) r2 = Counter(solve(b)) #print(r1) #print(r2) cnt1 , cnt2 = 0 , 0 flag = True for i in r1.keys() : if i in r2.keys() and r1[i] != r2[i]: if (i % 2 == 0 or i % 3 == 0 or i % 5 == 0 ): cnt1 += abs(r1[i] - r2[i]) else: flag = False break elif i not in r2.keys(): if (i % 2 == 0 or i % 3 == 0 or i % 5 == 0 ): cnt1+= r1[i] else: flag = False break if flag == False: print('-1') exit(0) for i in r2.keys() : if i not in r1.keys() : if (i % 2 == 0 or i % 3 == 0 or i % 5 == 0 ): cnt2 += r2[i] else: flag = False break if flag == False: print(-1) exit(0) print(cnt1 + cnt2) ```	3
844	A	Diversity	PROGRAMMING	1,000	[ "greedy", "implementation", "strings" ]		null	null	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. String s consists only of lowercase Latin letters, and it is allowed to change characters only to lowercase Latin letters too.	First line of input contains string s, consisting only of lowercase Latin letters (1<=≤<=\|s\|<=≤<=1000, \|s\| denotes the length of s). Second line of input contains integer k (1<=≤<=k<=≤<=26).	Print single line with a minimum number of necessary changes, or the word «impossible» (without quotes) if it is impossible.	[ "yandex\n6\n", "yahoo\n5\n", "google\n7\n" ]	[ "0\n", "1\n", "impossible\n" ]	In the first test case string contains 6 different letters, so we don't need to change anything. In the second test case string contains 4 different letters: {'a', 'h', 'o', 'y'}. To get 5 different letters it is necessary to change one occurrence of 'o' to some letter, which doesn't occur in the string, for example, {'b'}. In the third test case, it is impossible to make 7 different letters because the length of the string is 6.	500	[ { "input": "yandex\n6", "output": "0" }, { "input": "yahoo\n5", "output": "1" }, { "input": "google\n7", "output": "impossible" }, { "input": "a\n1", "output": "0" }, { "input": "z\n2", "output": "impossible" }, { "input": "fwgfrwgkuwghfiruhewgirueguhergiqrbvgrgf\n26", "output": "14" }, { "input": "nfevghreuoghrueighoqghbnebvnejbvnbgneluqe\n26", "output": "12" }, { "input": "a\n3", "output": "impossible" }, { "input": "smaxpqplaqqbxuqxalqmbmmgubbpspxhawbxsuqhhegpmmpebqmqpbbeplwaepxmsahuepuhuhwxeqmmlgqubuaxehwuwasgxpqmugbmuawuhwqlswllssueglbxepbmwgs\n1", "output": "0" }, { "input": "cuguccgcugcugucgggggcgcgucgucugcuuuccccuugccg\n4", "output": "1" }, { "input": "fcfccfcfccfcfcffcffffffcfccfccfcffccccfcffffccfccfcffcfcccccffcfffcccffcfccfffffcccfccffffffccfccccf\n20", "output": "18" }, { "input": "swmkwaruyv\n5", "output": "0" }, { "input": "tnbqpsuhkczmejirvyfdolxwga\n22", "output": "0" }, { "input": "abcde\n3", "output": "0" }, { "input": "abb\n1", "output": "0" }, { "input": "aaaa\n1", "output": "0" }, { "input": "abcde\n2", "output": "0" }, { "input": "yandex\n4", "output": "0" }, { "input": "aaabbbccc\n1", "output": "0" }, { "input": "abcd\n2", "output": "0" }, { "input": "asdfgh\n2", "output": "0" }, { "input": "aab\n1", "output": "0" }, { "input": "mynameissako\n5", "output": "0" }, { "input": "abcde\n1", "output": "0" }, { "input": "abcd\n3", "output": "0" }, { "input": "abcdef\n2", "output": "0" }, { "input": "abcdefg\n4", "output": "0" }, { "input": "abc\n1", "output": "0" }, { "input": "asdafjsgljdllgjdgkl\n5", "output": "0" }, { "input": "yaay\n3", "output": "1" }, { "input": "yaay\n4", "output": "2" }, { "input": "zzzzzz\n2", "output": "1" } ]	1,535,572,712	2,147,483,647	Python 3	OK	TESTS	41	109	0	n=input() k=int(input()) li=[] for i in range(len(n)): li+=[n[i]] li=set(li) if len(n)<k: print("impossible") else: if k-len(li)>0: print(k-len(li)) else: print("0")	Title: Diversity Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. String s consists only of lowercase Latin letters, and it is allowed to change characters only to lowercase Latin letters too. Input Specification: First line of input contains string s, consisting only of lowercase Latin letters (1<=≤<=\|s\|<=≤<=1000, \|s\| denotes the length of s). Second line of input contains integer k (1<=≤<=k<=≤<=26). Output Specification: Print single line with a minimum number of necessary changes, or the word «impossible» (without quotes) if it is impossible. Demo Input: ['yandex\n6\n', 'yahoo\n5\n', 'google\n7\n'] Demo Output: ['0\n', '1\n', 'impossible\n'] Note: In the first test case string contains 6 different letters, so we don't need to change anything. In the second test case string contains 4 different letters: {'a', 'h', 'o', 'y'}. To get 5 different letters it is necessary to change one occurrence of 'o' to some letter, which doesn't occur in the string, for example, {'b'}. In the third test case, it is impossible to make 7 different letters because the length of the string is 6.	```python n=input() k=int(input()) li=[] for i in range(len(n)): li+=[n[i]] li=set(li) if len(n)<k: print("impossible") else: if k-len(li)>0: print(k-len(li)) else: print("0") ```	3
58	A	Chat room	PROGRAMMING	1,000	[ "greedy", "strings" ]	A. Chat room	1	256	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.	The first and only line contains the word s, which Vasya typed. This word consisits of small Latin letters, its length is no less that 1 and no more than 100 letters.	If Vasya managed to say hello, print "YES", otherwise print "NO".	[ "ahhellllloou\n", "hlelo\n" ]	[ "YES\n", "NO\n" ]	none	500	[ { "input": "ahhellllloou", "output": "YES" }, { "input": "hlelo", "output": "NO" }, { "input": "helhcludoo", "output": "YES" }, { "input": "hehwelloho", "output": "YES" }, { "input": "pnnepelqomhhheollvlo", "output": "YES" }, { "input": "tymbzjyqhymedasloqbq", "output": "NO" }, { "input": "yehluhlkwo", "output": "NO" }, { "input": "hatlevhhalrohairnolsvocafgueelrqmlqlleello", "output": "YES" }, { "input": "hhhtehdbllnhwmbyhvelqqyoulretpbfokflhlhreeflxeftelziclrwllrpflflbdtotvlqgoaoqldlroovbfsq", "output": "YES" }, { "input": "rzlvihhghnelqtwlexmvdjjrliqllolhyewgozkuovaiezgcilelqapuoeglnwmnlftxxiigzczlouooi", "output": "YES" }, { "input": "pfhhwctyqdlkrwhebfqfelhyebwllhemtrmeblgrynmvyhioesqklclocxmlffuormljszllpoo", "output": "YES" }, { "input": "lqllcolohwflhfhlnaow", "output": "NO" }, { "input": "heheeellollvoo", "output": "YES" }, { "input": "hellooo", "output": "YES" }, { "input": "o", "output": "NO" }, { "input": "hhqhzeclohlehljlhtesllylrolmomvuhcxsobtsckogdv", "output": "YES" }, { "input": "yoegfuzhqsihygnhpnukluutocvvwuldiighpogsifealtgkfzqbwtmgghmythcxflebrkctlldlkzlagovwlstsghbouk", "output": "YES" }, { "input": "uatqtgbvrnywfacwursctpagasnhydvmlinrcnqrry", "output": "NO" }, { "input": "tndtbldbllnrwmbyhvqaqqyoudrstpbfokfoclnraefuxtftmgzicorwisrpfnfpbdtatvwqgyalqtdtrjqvbfsq", "output": "NO" }, { "input": "rzlvirhgemelnzdawzpaoqtxmqucnahvqnwldklrmjiiyageraijfivigvozgwngiulttxxgzczptusoi", "output": "YES" }, { "input": "kgyelmchocojsnaqdsyeqgnllytbqietpdlgknwwumqkxrexgdcnwoldicwzwofpmuesjuxzrasscvyuqwspm", "output": "YES" }, { "input": "pnyvrcotjvgynbeldnxieghfltmexttuxzyac", "output": "NO" }, { "input": "dtwhbqoumejligbenxvzhjlhosqojetcqsynlzyhfaevbdpekgbtjrbhlltbceobcok", "output": "YES" }, { "input": "crrfpfftjwhhikwzeedrlwzblckkteseofjuxjrktcjfsylmlsvogvrcxbxtffujqshslemnixoeezivksouefeqlhhokwbqjz", "output": "YES" }, { "input": "jhfbndhyzdvhbvhmhmefqllujdflwdpjbehedlsqfdsqlyelwjtyloxwsvasrbqosblzbowlqjmyeilcvotdlaouxhdpoeloaovb", "output": "YES" }, { "input": "hwlghueoemiqtjhhpashjsouyegdlvoyzeunlroypoprnhlyiwiuxrghekaylndhrhllllwhbebezoglydcvykllotrlaqtvmlla", "output": "YES" }, { "input": "wshiaunnqnqxodholbipwhhjmyeblhgpeleblklpzwhdunmpqkbuzloetmwwxmeltkrcomulxauzlwmlklldjodozxryghsnwgcz", "output": "YES" }, { "input": "shvksednttggehroewuiptvvxtrzgidravtnjwuqrlnnkxbplctzkckinpkgjopjfoxdbojtcvsuvablcbkrzajrlhgobkcxeqti", "output": "YES" }, { "input": "hyyhddqhxhekehkwfhlnlsihzefwchzerevcjtokefplholrbvxlltdlafjxrfhleglrvlolojoqaolagtbeyogxlbgfolllslli", "output": "YES" }, { "input": "iaagrdhhelxpdegueiulflquvlzidoprzkehthkldaytrjwhyhprwjxlltinxvuilxohqgjqcvkkdcuoliekcnlilwgqlnlzouoo", "output": "YES" }, { "input": "wfluaeseldgxyvxpwuhkptdmlflnlhktwxiabsvkolsquymrmhzczzoybvlilhmvsuunggvgxzgyyffk", "output": "NO" }, { "input": "loee", "output": "NO" }, { "input": "izdipwylefqmjbuoznfglgcfvedeouflkeehxbasaqmiooppfsqlhprospqgxvzrcpwlfdddngoqvpwvggsnvvxhmjoslwjudjlo", "output": "NO" }, { "input": "pplynflbjlseflaegzqpdxswgunhnlglqhycrbcwdfhclmcrwekkzsoosmfblljeenwfjyifcvxihhhbyhmhlkvtskeglaovjnsi", "output": "YES" }, { "input": "xqjqmenkodmlhzyzmmvofdngktygbbxbzpluzcohohmalkoeuwfikblltaaigv", "output": "NO" }, { "input": "hello", "output": "YES" }, { "input": "oohell", "output": "NO" }, { "input": "hell", "output": "NO" }, { "input": "eloellohoelo", "output": "NO" }, { "input": "helllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllo", "output": "YES" } ]	1,679,119,888	2,147,483,647	Python 3	OK	TESTS	40	46	0	s=input() s1="hello" j=0 p=0 for i in range(len(s)): if s[i]==s1[j]: j+=1 p+=1 if j==5: break if p==5: print('YES') else: print('NO')	Title: Chat room Time Limit: 1 seconds Memory Limit: 256 megabytes Problem Description: 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 Specification: The first and only line contains the word s, which Vasya typed. This word consisits of small Latin letters, its length is no less that 1 and no more than 100 letters. Output Specification: If Vasya managed to say hello, print "YES", otherwise print "NO". Demo Input: ['ahhellllloou\n', 'hlelo\n'] Demo Output: ['YES\n', 'NO\n'] Note: none	```python s=input() s1="hello" j=0 p=0 for i in range(len(s)): if s[i]==s1[j]: j+=1 p+=1 if j==5: break if p==5: print('YES') else: print('NO') ```	3.977
2	A	Winner	PROGRAMMING	1,500	[ "hashing", "implementation" ]	A. Winner	1	64	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.	The first line contains an integer number n (1<=<=≤<=<=n<=<=≤<=<=1000), n is the number of rounds played. Then follow n lines, containing the information about the rounds in "name score" format in chronological order, where name is a string of lower-case Latin letters with the length from 1 to 32, and score is an integer number between -1000 and 1000, inclusive.	Print the name of the winner.	[ "3\nmike 3\nandrew 5\nmike 2\n", "3\nandrew 3\nandrew 2\nmike 5\n" ]	[ "andrew\n", "andrew\n" ]	none	0	[ { "input": "3\nmike 3\nandrew 5\nmike 2", "output": "andrew" }, { "input": "3\nandrew 3\nandrew 2\nmike 5", "output": "andrew" }, { "input": "5\nkaxqybeultn -352\nmgochgrmeyieyskhuourfg -910\nkaxqybeultn 691\nmgochgrmeyieyskhuourfg -76\nkaxqybeultn -303", "output": "kaxqybeultn" }, { "input": "7\nksjuuerbnlklcfdjeyq 312\ndthjlkrvvbyahttifpdewvyslsh -983\nksjuuerbnlklcfdjeyq 268\ndthjlkrvvbyahttifpdewvyslsh 788\nksjuuerbnlklcfdjeyq -79\nksjuuerbnlklcfdjeyq -593\nksjuuerbnlklcfdjeyq 734", "output": "ksjuuerbnlklcfdjeyq" }, { "input": "12\natrtthfpcvishmqbakprquvnejr 185\natrtthfpcvishmqbakprquvnejr -699\natrtthfpcvishmqbakprquvnejr -911\natrtthfpcvishmqbakprquvnejr -220\nfcgslzkicjrpbqaifgweyzreajjfdo 132\nfcgslzkicjrpbqaifgweyzreajjfdo -242\nm 177\nm -549\natrtthfpcvishmqbakprquvnejr -242\nm 38\natrtthfpcvishmqbakprquvnejr -761\nfcgslzkicjrpbqaifgweyzreajjfdo 879", "output": "fcgslzkicjrpbqaifgweyzreajjfdo" }, { "input": "15\naawtvezfntstrcpgbzjbf 681\nzhahpvqiptvksnbjkdvmknb -74\naawtvezfntstrcpgbzjbf 661\njpdwmyke 474\naawtvezfntstrcpgbzjbf -547\naawtvezfntstrcpgbzjbf 600\nzhahpvqiptvksnbjkdvmknb -11\njpdwmyke 711\nbjmj 652\naawtvezfntstrcpgbzjbf -1000\naawtvezfntstrcpgbzjbf -171\nbjmj -302\naawtvezfntstrcpgbzjbf 961\nzhahpvqiptvksnbjkdvmknb 848\nbjmj -735", "output": "aawtvezfntstrcpgbzjbf" }, { "input": "17\nqdplghhx -649\nivhgbxiv 424\nivhgbxiv -72\nivhgbxiv 479\nugowfouebkelargxylsxn 83\nugowfouebkelargxylsxn -840\nivhgbxiv 382\nqdplghhx -904\nivhgbxiv -710\nugowfouebkelargxylsxn -838\nqdplghhx -974\nqdplghhx 571\nivhgbxiv -145\nugowfouebkelargxylsxn -788\nivhgbxiv 209\nivhgbxiv 420\nqdplghhx -158", "output": "ivhgbxiv" } ]	1,686,883,169	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	3	92	0	def berland_logging(rounds): players = {} max_points = 0 winner = None for round in rounds: name, score = round.split() score = int(score) if name in players: players[name] += score else: players[name] = score if players[name] > max_points: max_points = players[name] winner = name if len(set(players.values())) > 1: if max(players.values()) == max_points: winner = "Tie" return winner n = int(input()) rounds = [input() for _ in range(n)] winner = berland_logging(rounds) print(winner)	Title: Winner Time Limit: 1 seconds Memory Limit: 64 megabytes Problem Description: 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 Specification: The first line contains an integer number n (1<=<=≤<=<=n<=<=≤<=<=1000), n is the number of rounds played. Then follow n lines, containing the information about the rounds in "name score" format in chronological order, where name is a string of lower-case Latin letters with the length from 1 to 32, and score is an integer number between -1000 and 1000, inclusive. Output Specification: Print the name of the winner. Demo Input: ['3\nmike 3\nandrew 5\nmike 2\n', '3\nandrew 3\nandrew 2\nmike 5\n'] Demo Output: ['andrew\n', 'andrew\n'] Note: none	```python def berland_logging(rounds): players = {} max_points = 0 winner = None for round in rounds: name, score = round.split() score = int(score) if name in players: players[name] += score else: players[name] = score if players[name] > max_points: max_points = players[name] winner = name if len(set(players.values())) > 1: if max(players.values()) == max_points: winner = "Tie" return winner n = int(input()) rounds = [input() for _ in range(n)] winner = berland_logging(rounds) print(winner) ```	0
929	B	Места в самолёте	PROGRAMMING	1,300	[ "*special", "implementation" ]		null	null	В самолёте есть n рядов мест. Если смотреть на ряды сверху, то в каждом ряду есть 3 места слева, затем проход между рядами, затем 4 центральных места, затем ещё один проход между рядами, а затем ещё 3 места справа. Известно, что некоторые места уже заняты пассажирами. Всего есть два вида пассажиров — статусные (те, которые часто летают) и обычные. Перед вами стоит задача рассадить ещё k обычных пассажиров так, чтобы суммарное число соседей у статусных пассажиров было минимально возможным. Два пассажира считаются соседями, если они сидят в одном ряду и между ними нет других мест и прохода между рядами. Если пассажир является соседним пассажиром для двух статусных пассажиров, то его следует учитывать в сумме соседей дважды.	В первой строке следуют два целых числа n и k (1<=≤<=n<=≤<=100, 1<=≤<=k<=≤<=10·n) — количество рядов мест в самолёте и количество пассажиров, которых нужно рассадить. Далее следует описание рядов мест самолёта по одному ряду в строке. Если очередной символ равен '-', то это проход между рядами. Если очередной символ равен '.', то это свободное место. Если очередной символ равен 'S', то на текущем месте будет сидеть статусный пассажир. Если очередной символ равен 'P', то на текущем месте будет сидеть обычный пассажир. Гарантируется, что количество свободных мест не меньше k. Гарантируется, что все ряды удовлетворяют описанному в условии формату.	В первую строку выведите минимальное суммарное число соседей у статусных пассажиров. Далее выведите план рассадки пассажиров, который минимизирует суммарное количество соседей у статусных пассажиров, в том же формате, что и во входных данных. Если в свободное место нужно посадить одного из k пассажиров, выведите строчную букву 'x' вместо символа '.'.	[ "1 2\nSP.-SS.S-S.S\n", "4 9\nPP.-PPPS-S.S\nPSP-PPSP-.S.\n.S.-S..P-SS.\nP.S-P.PP-PSP\n" ]	[ "5\nSPx-SSxS-S.S\n", "15\nPPx-PPPS-S.S\nPSP-PPSP-xSx\nxSx-SxxP-SSx\nP.S-PxPP-PSP\n" ]	В первом примере нужно посадить ещё двух обычных пассажиров. Для минимизации соседей у статусных пассажиров, нужно посадить первого из них на третье слева место, а второго на любое из оставшихся двух мест, так как независимо от выбора места он станет соседом двух статусных пассажиров. Изначально, у статусного пассажира, который сидит на самом левом месте уже есть сосед. Также на четвёртом и пятом местах слева сидят статусные пассажиры, являющиеся соседями друг для друга (что добавляет к сумме 2). Таким образом, после посадки ещё двух обычных пассажиров, итоговое суммарное количество соседей у статусных пассажиров станет равно пяти.	1,000	[ { "input": "1 2\nSP.-SS.S-S.S", "output": "5\nSPx-SSxS-S.S" }, { "input": "4 9\nPP.-PPPS-S.S\nPSP-PPSP-.S.\n.S.-S..P-SS.\nP.S-P.PP-PSP", "output": "15\nPPx-PPPS-S.S\nPSP-PPSP-xSx\nxSx-SxxP-SSx\nP.S-PxPP-PSP" }, { "input": "3 7\n.S.-SSSP-..S\nS..-.SPP-S.P\n.S.-PPPP-PSP", "output": "13\nxSx-SSSP-xxS\nSxx-xSPP-S.P\n.S.-PPPP-PSP" }, { "input": "5 6\nPP.-PS.P-P..\nPPS-SP..-P.P\nP.P-....-S..\nSPP-.P.S-.S.\nSP.-S.PS-PPP", "output": "6\nPPx-PS.P-Pxx\nPPS-SPxx-PxP\nP.P-....-S..\nSPP-.P.S-.S.\nSP.-S.PS-PPP" }, { "input": "1 1\n..S-PS..-.PP", "output": "1\nx.S-PS..-.PP" }, { "input": "2 2\nPP.-S.SS-.S.\nSSP-SSSS-S.S", "output": "12\nPPx-S.SS-xS.\nSSP-SSSS-S.S" }, { "input": "30 1\nPPP-PPP.-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP", "output": "0\nPPP-PPPx-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP" }, { "input": "1 1\nSPS-....-P.P", "output": "2\nSPS-x...-P.P" }, { "input": "2 1\nSSS-S.S.-SSS\nSSP-.PP.-S.S", "output": "11\nSSS-S.S.-SSS\nSSP-xPP.-S.S" }, { "input": "30 1\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPP.-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP", "output": "0\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPx-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP\nPPP-PPPP-PPP" } ]	1,520,010,424	5,524	Python 3	OK	TESTS	47	77	5,836,800	n, k = map(int, input().split()) lines = [[ch for ch in input()]+['\n'] for i in range(n)] queue = [[], [], []] count = 0 for i in range(n): for seat in range(12): if lines[i][seat]=='.': queue[(lines[i][seat-1]=='S')+(lines[i][seat+1]=='S')].append([i, seat]) elif lines[i][seat]=='S': count+=(lines[i][seat-1]>'A')+(lines[i][seat+1]>'A') while k: if queue[0]: seat = queue[0].pop() elif queue[1]: seat = queue[1].pop() count+=1 else: seat = queue[2].pop() count+=2 lines[seat[0]][seat[1]] = 'x' k-=1 print(count) print(''.join([''.join(line) for line in lines]))	Title: Места в самолёте Time Limit: None seconds Memory Limit: None megabytes Problem Description: В самолёте есть n рядов мест. Если смотреть на ряды сверху, то в каждом ряду есть 3 места слева, затем проход между рядами, затем 4 центральных места, затем ещё один проход между рядами, а затем ещё 3 места справа. Известно, что некоторые места уже заняты пассажирами. Всего есть два вида пассажиров — статусные (те, которые часто летают) и обычные. Перед вами стоит задача рассадить ещё k обычных пассажиров так, чтобы суммарное число соседей у статусных пассажиров было минимально возможным. Два пассажира считаются соседями, если они сидят в одном ряду и между ними нет других мест и прохода между рядами. Если пассажир является соседним пассажиром для двух статусных пассажиров, то его следует учитывать в сумме соседей дважды. Input Specification: В первой строке следуют два целых числа n и k (1<=≤<=n<=≤<=100, 1<=≤<=k<=≤<=10·n) — количество рядов мест в самолёте и количество пассажиров, которых нужно рассадить. Далее следует описание рядов мест самолёта по одному ряду в строке. Если очередной символ равен '-', то это проход между рядами. Если очередной символ равен '.', то это свободное место. Если очередной символ равен 'S', то на текущем месте будет сидеть статусный пассажир. Если очередной символ равен 'P', то на текущем месте будет сидеть обычный пассажир. Гарантируется, что количество свободных мест не меньше k. Гарантируется, что все ряды удовлетворяют описанному в условии формату. Output Specification: В первую строку выведите минимальное суммарное число соседей у статусных пассажиров. Далее выведите план рассадки пассажиров, который минимизирует суммарное количество соседей у статусных пассажиров, в том же формате, что и во входных данных. Если в свободное место нужно посадить одного из k пассажиров, выведите строчную букву 'x' вместо символа '.'. Demo Input: ['1 2\nSP.-SS.S-S.S\n', '4 9\nPP.-PPPS-S.S\nPSP-PPSP-.S.\n.S.-S..P-SS.\nP.S-P.PP-PSP\n'] Demo Output: ['5\nSPx-SSxS-S.S\n', '15\nPPx-PPPS-S.S\nPSP-PPSP-xSx\nxSx-SxxP-SSx\nP.S-PxPP-PSP\n'] Note: В первом примере нужно посадить ещё двух обычных пассажиров. Для минимизации соседей у статусных пассажиров, нужно посадить первого из них на третье слева место, а второго на любое из оставшихся двух мест, так как независимо от выбора места он станет соседом двух статусных пассажиров. Изначально, у статусного пассажира, который сидит на самом левом месте уже есть сосед. Также на четвёртом и пятом местах слева сидят статусные пассажиры, являющиеся соседями друг для друга (что добавляет к сумме 2). Таким образом, после посадки ещё двух обычных пассажиров, итоговое суммарное количество соседей у статусных пассажиров станет равно пяти.	```python n, k = map(int, input().split()) lines = [[ch for ch in input()]+['\n'] for i in range(n)] queue = [[], [], []] count = 0 for i in range(n): for seat in range(12): if lines[i][seat]=='.': queue[(lines[i][seat-1]=='S')+(lines[i][seat+1]=='S')].append([i, seat]) elif lines[i][seat]=='S': count+=(lines[i][seat-1]>'A')+(lines[i][seat+1]>'A') while k: if queue[0]: seat = queue[0].pop() elif queue[1]: seat = queue[1].pop() count+=1 else: seat = queue[2].pop() count+=2 lines[seat[0]][seat[1]] = 'x' k-=1 print(count) print(''.join([''.join(line) for line in lines])) ```	3
746	B	Decoding	PROGRAMMING	900	[ "implementation", "strings" ]		null	null	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. Polycarp 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. You are given an encoding s of some word, your task is to decode it.	The first line contains a positive integer n (1<=≤<=n<=≤<=2000) — the length of the encoded word. The second line contains the string s of length n consisting of lowercase English letters — the encoding.	Print the word that Polycarp encoded.	[ "5\nlogva\n", "2\nno\n", "4\nabba\n" ]	[ "volga\n", "no\n", "baba\n" ]	In the first example Polycarp encoded the word volga. At first, he wrote down the letter l from the position 3, after that his word looked like voga. After that Polycarp wrote down the letter o from the position 2, his word became vga. Then Polycarp wrote down the letter g which was at the second position, the word became va. Then he wrote down the letter v, then the letter a. Thus, the encoding looked like logva. In the second example Polycarp encoded the word no. He wrote down the letter n, the word became o, and he wrote down the letter o. Thus, in this example, the word and its encoding are the same. In the third example Polycarp encoded the word baba. At first, he wrote down the letter a, which was at the position 2, after that the word looked like bba. Then he wrote down the letter b, which was at the position 2, his word looked like ba. After that he wrote down the letter b, which was at the position 1, the word looked like a, and he wrote down that letter a. Thus, the encoding is abba.	1,000	[ { "input": "5\nlogva", "output": "volga" }, { "input": "2\nno", "output": "no" }, { "input": "4\nabba", "output": "baba" }, { "input": "51\nkfsmpaeviowvkdbuhdagquxxqniselafnfbrgbhmsugcbbnlrvv", "output": "vlbcumbrfflsnxugdudvovamfkspeiwkbhaqxqieanbghsgbnrv" }, { "input": "1\nw", "output": "w" }, { "input": "2\ncb", "output": "cb" }, { "input": "3\nqok", "output": "oqk" }, { "input": "4\naegi", "output": "gaei" }, { "input": "5\noqquy", "output": "uqoqy" }, { "input": "6\nulhpnm", "output": "nhulpm" }, { "input": "7\nijvxljt", "output": "jxjivlt" }, { "input": "8\nwwmiwkeo", "output": "ewmwwiko" }, { "input": "9\ngmwqmpfow", "output": "opqmgwmfw" }, { "input": "10\nhncmexsslh", "output": "lsechnmxsh" }, { "input": "20\nrtcjbjlbtjfmvzdqutuw", "output": "uudvftlbcrtjjbjmzqtw" }, { "input": "21\ngjyiqoebcnpsdegxnsauh", "output": "usxesnboijgyqecpdgnah" }, { "input": "30\nudotcwvcwxajkadxqvxvwgmwmnqrby", "output": "bqmmwxqdkawvcoudtwcxjaxvvgwnry" }, { "input": "31\nipgfrxxcgckksfgexlicjvtnhvrfbmb", "output": "mfvnvclefkccxfpigrxgksgxijthrbb" }, { "input": "50\nwobervhvvkihcuyjtmqhaaigvahheoqleromusrartldojsjvy", "output": "vsolrruoeqehviaqtycivhrbwoevvkhujmhagaholrmsatdjjy" }, { "input": "200\nhvayscqiwpcfykibwyudkzuzdkgqqvbnrfeupjefevlvojngmlcjwzijrkzbsaovabkvvwmjgoonyhuiphwmqdoiuueuyqtychbsklflnvghipdgaxhuhiiqlqocpvhldgvnsrtcwxpidrjffwvwcirluyyxzxrglheczeuouklzkvnyubsvgvmdbrylimztotdbmjph", "output": "pmdoziybmgsunkluuzelrzyurcvfjdpwtsvdhpolihhadignfkbctyeuoqwpuyogmvkaoszriwcmnoleeperbqgdukuwiycwqsahvycipfkbydzzkqvnfujfvvjgljzjkbavbvwjonhihmdiuuqyhsllvhpgxuiqqcvlgnrcxirfwwilyxxghceokzvybvvdrlmttbjh" }, { "input": "201\nrpkghhfibtmlkpdiklegblbuyshfirheatjkfoqkfayfbxeeqijwqdwkkrkbdxlhzkhyiifemsghwovorlqedngldskfbhmwrnzmtjuckxoqdszmsdnbuqnlqzswdfhagasmfswanifrjjcuwdsplytvmnfarchgqteedgfpumkssindxndliozojzlpznwedodzwrrus", "output": "urzoenpzoolndismpgetgcanvypdujriasmaafwzlqbdmsqxcjmnwhfslneloohseiykhxbrkdwiexfakokterfsulglipltihgprkhfbmkdkebbyhihajfqfybeqjqwkkdlzhifmgwvrqdgdkbmrztukodzsnunqsdhgsfwnfjcwsltmfrhqedfuksnxdizjlzwddwrs" }, { "input": "500\naopxumqciwxewxvlxzebsztskjvjzwyewjztqrsuvamtvklhqrbodtncqdchjrlpywvmtgnkkwtvpggktewdgvnhydkexwoxkgltaesrtifbwpciqsvrgjtqrdnyqkgqwrryacluaqmgdwxinqieiblolyekcbzahlhxdwqcgieyfgmicvgbbitbzhejkshjunzjteyyfngigjwyqqndtjrdykzrnrpinkwtrlchhxvycrhstpecadszilicrqdeyyidohqvzfnsqfyuemigacysxvtrgxyjcvejkjstsnatfqlkeytxgsksgpcooypsmqgcluzwofaupegxppbupvtumjerohdteuenwcmqaoazohkilgpkjavcrjcslhzkyjcgfzxxzjfufichxcodcawonkxhbqgfimmlycswdzwbnmjwhbwihfoftpcqplncavmbxuwnsabiyvpcrhfgtqyaguoaigknushbqjwqmmyvsxwabrub", "output": "ubwsymwqhukiogytfrpybswxmanpctohwhjnwdsymigbxnwcoxcffzxfcyzlcrvjplkoaamweedoemtpbpgpaozlgmpocgkgtelfasskecygtxyaieyqnzqoiydriisaethcvhcrwnpnzyrtnqwggfytzuhkeztbgcmfegqdhhzcelliinxdmalarwgqnrtgvqcwftsalkoxkyngwtgptkntvyljcqndbqlvmvsqzwyzvktsexvwxiqupaoxmcwexlzbzsjjwejtruatkhrotcdhrpwmgkwvgkedvhdewxgteribpisrjqdykqrycuqgwiqeboykbalxwciygivbibhjsjnjeynijyqdjdkrriktlhxyrspcdzlcqeydhvfsfumgcsvrxjvjjtntqkyxsspoysqcuwfuexpuvujrhtuncqozhigkacjshkjgzxjuihcdaokhqfmlcwzbmwbiffpqlcvbunaivchgqauagnsbjqmvxarb" }, { "input": "501\noilesjbgowlnayckhpoaitijewsyhgavnthycaecwnvzpxgjqfjyxnjcjknvvsmjbjwtcoyfbegmnnheeamvtfjkigqoanhvgdfrjchdqgowrstlmrjmcsuuwvvoeucfyhnxivosrxblfoqwikfxjnnyejdiihpenfcahtjwcnzwvxxseicvdfgqhtvefswznuyohmmljlnxubhevywpmnitnkhecsgccpstxkmdzabsnwxkokdfsogzbpnfvgudvqlstxojzfzugxbfrozveaiofrzksegdelxsdhcjlqwqlgjcqiujptoenxozhkqhcpkarretqzfkwuvbmfdcdoqliyzmlfrfhzrnkbhofuctkpeacqejwvdrlyvepudrlzncbhwrgmxrczphsoymvtuzqjscvbtqpymogupgzctepccravjcrfsadueyraqvwasravkubebojqspdntewnjohvccamvoxdauyakvehjhabpdyzyme", "output": "mzdbhhvaudomcvonenpqoeuvravayuafcvrcecguoyqbcjztmohzrmrhczrueyrvjqaptuobnzffmylocfbukztraphkzxetjicgqqjhsldekroavofxufjxsqdgfpzofkkwsadktpcsektnpyebxllmouzsetqfvisxwnwtafehijynxkwolxsvxhfuovusmrlswgdcrdvnogkfvaenmefotjjsvkcnyfjxzncaytvgywjtapkynwgjeiolsbolachoiieshanhcewvpgqjxjjnvmbwcybgnhemtjiqahgfjhqortmjcuwvecyniorbfqifjnedipnchjczvxecdghvfwnyhmjnuhvwminhcgcsxmzbnxodsgbnvuvltozzgbrzeifzsgexdclwljquponohqckreqfwvmddqizlrhrkhfckecewdlvpdlnbwgxcpsyvuqsvtpmgpztpcajrsderqwsakbbjsdtwjhcavxaykejapyye" } ]	1,691,506,675	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	4	46	0	m=int(input()) c=input() x=[] for i in c: x.append(i) n=x[0] f=[] b=[] x.pop(0) if len(x)%2==0: for i in range(0,m-1,2): f.append(x[i]) for i in range(1,m-1,2): b.append(x[i]) f.reverse() for i in f: print(i,end="") print(n,end="") for i in b: print(i,end="") print() else: for i in range(1,m-1,2): f.append(x[i]) for i in range(0,m-1,2): b.append(x[i]) for i in f: print(i,end="") print(n,end="") for i in b: print(i,end="")	Title: Decoding Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. Polycarp 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. You are given an encoding s of some word, your task is to decode it. Input Specification: The first line contains a positive integer n (1<=≤<=n<=≤<=2000) — the length of the encoded word. The second line contains the string s of length n consisting of lowercase English letters — the encoding. Output Specification: Print the word that Polycarp encoded. Demo Input: ['5\nlogva\n', '2\nno\n', '4\nabba\n'] Demo Output: ['volga\n', 'no\n', 'baba\n'] Note: In the first example Polycarp encoded the word volga. At first, he wrote down the letter l from the position 3, after that his word looked like voga. After that Polycarp wrote down the letter o from the position 2, his word became vga. Then Polycarp wrote down the letter g which was at the second position, the word became va. Then he wrote down the letter v, then the letter a. Thus, the encoding looked like logva. In the second example Polycarp encoded the word no. He wrote down the letter n, the word became o, and he wrote down the letter o. Thus, in this example, the word and its encoding are the same. In the third example Polycarp encoded the word baba. At first, he wrote down the letter a, which was at the position 2, after that the word looked like bba. Then he wrote down the letter b, which was at the position 2, his word looked like ba. After that he wrote down the letter b, which was at the position 1, the word looked like a, and he wrote down that letter a. Thus, the encoding is abba.	```python m=int(input()) c=input() x=[] for i in c: x.append(i) n=x[0] f=[] b=[] x.pop(0) if len(x)%2==0: for i in range(0,m-1,2): f.append(x[i]) for i in range(1,m-1,2): b.append(x[i]) f.reverse() for i in f: print(i,end="") print(n,end="") for i in b: print(i,end="") print() else: for i in range(1,m-1,2): f.append(x[i]) for i in range(0,m-1,2): b.append(x[i]) for i in f: print(i,end="") print(n,end="") for i in b: print(i,end="") ```	0
59	A	Word	PROGRAMMING	800	[ "implementation", "strings" ]	A. Word	2	256	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.	The first line contains a word s — it consists of uppercase and lowercase Latin letters and possesses the length from 1 to 100.	Print the corrected word s. If the given word s has strictly more uppercase letters, make the word written in the uppercase register, otherwise - in the lowercase one.	[ "HoUse\n", "ViP\n", "maTRIx\n" ]	[ "house\n", "VIP\n", "matrix\n" ]	none	500	[ { "input": "HoUse", "output": "house" }, { "input": "ViP", "output": "VIP" }, { "input": "maTRIx", "output": "matrix" }, { "input": "BNHWpnpawg", "output": "bnhwpnpawg" }, { "input": "VTYGP", "output": "VTYGP" }, { "input": "CHNenu", "output": "chnenu" }, { "input": "ERPZGrodyu", "output": "erpzgrodyu" }, { "input": "KSXBXWpebh", "output": "KSXBXWPEBH" }, { "input": "qvxpqullmcbegsdskddortcvxyqlbvxmmkhevovnezubvpvnrcajpxraeaxizgaowtfkzywvhnbgzsxbhkaipcmoumtikkiyyaiv", "output": "qvxpqullmcbegsdskddortcvxyqlbvxmmkhevovnezubvpvnrcajpxraeaxizgaowtfkzywvhnbgzsxbhkaipcmoumtikkiyyaiv" }, { "input": "Amnhaxtaopjzrkqlbroiyipitndczpunwygstmzevgyjdzyanxkdqnvgkikfabwouwkkbzuiuvgvxgpizsvqsbwepktpdrgdkmfd", "output": "amnhaxtaopjzrkqlbroiyipitndczpunwygstmzevgyjdzyanxkdqnvgkikfabwouwkkbzuiuvgvxgpizsvqsbwepktpdrgdkmfd" }, { "input": "ISAGFJFARYFBLOPQDSHWGMCNKMFTLVFUGNJEWGWNBLXUIATXEkqiettmmjgydwcpafqrppdsrrrtguinqbgmzzfqwonkpgpcwenv", "output": "isagfjfaryfblopqdshwgmcnkmftlvfugnjewgwnblxuiatxekqiettmmjgydwcpafqrppdsrrrtguinqbgmzzfqwonkpgpcwenv" }, { "input": "XHRPXZEGHSOCJPICUIXSKFUZUPYTSGJSDIYBCMNMNBPNDBXLXBzhbfnqvwcffvrdhtickyqhupmcehlsyvncqmfhautvxudqdhgg", "output": "xhrpxzeghsocjpicuixskfuzupytsgjsdiybcmnmnbpndbxlxbzhbfnqvwcffvrdhtickyqhupmcehlsyvncqmfhautvxudqdhgg" }, { "input": "RJIQZMJCIMSNDBOHBRAWIENODSALETAKGKPYUFGVEFGCBRENZGAdkcetqjljtmttlonpekcovdzebzdkzggwfsxhapmjkdbuceak", "output": "RJIQZMJCIMSNDBOHBRAWIENODSALETAKGKPYUFGVEFGCBRENZGADKCETQJLJTMTTLONPEKCOVDZEBZDKZGGWFSXHAPMJKDBUCEAK" }, { "input": "DWLWOBHNMMGTFOLFAECKBRNNGLYLYDXTGTVRLMEESZOIUATZZZXUFUZDLSJXMEVRTESSFBWLNZZCLCQWEVNNUCXYVHNGNXHCBDFw", "output": "DWLWOBHNMMGTFOLFAECKBRNNGLYLYDXTGTVRLMEESZOIUATZZZXUFUZDLSJXMEVRTESSFBWLNZZCLCQWEVNNUCXYVHNGNXHCBDFW" }, { "input": "NYCNHJWGBOCOTSPETKKHVWFGAQYNHOVJWJHCIEFOUQZXOYUIEQDZALFKTEHTVDBVJMEUBJUBCMNVPWGDPNCHQHZJRCHYRFPVIGUB", "output": "NYCNHJWGBOCOTSPETKKHVWFGAQYNHOVJWJHCIEFOUQZXOYUIEQDZALFKTEHTVDBVJMEUBJUBCMNVPWGDPNCHQHZJRCHYRFPVIGUB" }, { "input": "igxoixiecetohtgjgbqzvlaobkhstejxdklghowtvwunnnvauriohuspsdmpzckprwajyxldoyckgjivjpmbfqtszmtocovxwge", "output": "igxoixiecetohtgjgbqzvlaobkhstejxdklghowtvwunnnvauriohuspsdmpzckprwajyxldoyckgjivjpmbfqtszmtocovxwge" }, { "input": "Ykkekrsqolzryiwsmdlnbmfautxxxauoojrddvwklgnlyrfcvhorrzbmtcrvpaypqhcffdqhwziipyyskcmztjprjqvmzzqhqnw", "output": "ykkekrsqolzryiwsmdlnbmfautxxxauoojrddvwklgnlyrfcvhorrzbmtcrvpaypqhcffdqhwziipyyskcmztjprjqvmzzqhqnw" }, { "input": "YQOMLKYAORUQQUCQZCDYMIVDHGWZFFRMUVTAWCHERFPMNRYRIkgqrciokgajamehmcxgerpudvsqyonjonsxgbnefftzmygncks", "output": "yqomlkyaoruqqucqzcdymivdhgwzffrmuvtawcherfpmnryrikgqrciokgajamehmcxgerpudvsqyonjonsxgbnefftzmygncks" }, { "input": "CDOZDPBVVVHNBJVBYHEOXWFLJKRWJCAJMIFCOZWWYFKVWOGTVJcuusigdqfkumewjtdyitveeiaybwrhomrwmpdipjwiuxfnwuz", "output": "CDOZDPBVVVHNBJVBYHEOXWFLJKRWJCAJMIFCOZWWYFKVWOGTVJCUUSIGDQFKUMEWJTDYITVEEIAYBWRHOMRWMPDIPJWIUXFNWUZ" }, { "input": "WHIUVEXHVOOIJIDVJVPQUBJMEVPMPDKQWJKFBZSGSKUXMIPPMJWuckzcpxosodcjaaakvlxpbiigsiauviilylnnqlyucziihqg", "output": "WHIUVEXHVOOIJIDVJVPQUBJMEVPMPDKQWJKFBZSGSKUXMIPPMJWUCKZCPXOSODCJAAAKVLXPBIIGSIAUVIILYLNNQLYUCZIIHQG" }, { "input": "VGHUNFOXKETUYMZDJNGTAOIOANYXSGYNFOGOFFLDAWEUKYFOZXCJTCAFXZYLQZERYZLRSQXYQGAPCSUDPMEYTNCTTTMFAGVDWBO", "output": "VGHUNFOXKETUYMZDJNGTAOIOANYXSGYNFOGOFFLDAWEUKYFOZXCJTCAFXZYLQZERYZLRSQXYQGAPCSUDPMEYTNCTTTMFAGVDWBO" }, { "input": "EDUANHCQDOCJHFONTTSWBUJSTTIXBIXMAIUFSGFLXWAYIURTVAVZPYQDLAWIGCLMPHXCEFCJPFAAHXVNGQUFNHADAIUAZIDMHDd", "output": "EDUANHCQDOCJHFONTTSWBUJSTTIXBIXMAIUFSGFLXWAYIURTVAVZPYQDLAWIGCLMPHXCEFCJPFAAHXVNGQUFNHADAIUAZIDMHDD" }, { "input": "EBWOVSNLYTWWXrnovgugogtjahnmatomubebyxakas", "output": "ebwovsnlytwwxrnovgugogtjahnmatomubebyxakas" }, { "input": "AORNNDKTRLRVGDPXJKXFTPFpopuzrlqumrxssskvbm", "output": "AORNNDKTRLRVGDPXJKXFTPFPOPUZRLQUMRXSSSKVBM" }, { "input": "DBBZJCWQEVGYHEEUHJAWRHBDPsnplijbwtdibqrrheebfxqcvn", "output": "dbbzjcwqevgyheeuhjawrhbdpsnplijbwtdibqrrheebfxqcvn" }, { "input": "t", "output": "t" }, { "input": "N", "output": "N" }, { "input": "kv", "output": "kv" }, { "input": "Ur", "output": "ur" }, { "input": "CN", "output": "CN" } ]	1,689,700,114	2,147,483,647	Python 3	OK	TESTS	30	92	0	def word(word): upper=0 lower=0 for char in word: if char.isupper(): upper+=1 else: lower+=1 if lower>= upper: print(word.lower()) else: print(word.upper()) word1=input("") word(word1)	Title: Word Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: 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 Specification: The first line contains a word s — it consists of uppercase and lowercase Latin letters and possesses the length from 1 to 100. Output Specification: Print the corrected word s. If the given word s has strictly more uppercase letters, make the word written in the uppercase register, otherwise - in the lowercase one. Demo Input: ['HoUse\n', 'ViP\n', 'maTRIx\n'] Demo Output: ['house\n', 'VIP\n', 'matrix\n'] Note: none	```python def word(word): upper=0 lower=0 for char in word: if char.isupper(): upper+=1 else: lower+=1 if lower>= upper: print(word.lower()) else: print(word.upper()) word1=input("") word(word1) ```	3.977
793	A	Oleg and shares	PROGRAMMING	900	[ "implementation", "math" ]		null	null	Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that each second exactly one price changes, but at different seconds different prices can change). Prices can become negative. Oleg found this process interesting, and he asked Igor the financial analyst, what is the minimum time needed for all n prices to become equal, or it is impossible at all? Igor is busy right now, so he asked you to help Oleg. Can you answer this question?	The first line contains two integers n and k (1<=≤<=n<=≤<=105,<=1<=≤<=k<=≤<=109) — the number of share prices, and the amount of rubles some price decreases each second. The second line contains n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=109) — the initial prices.	Print the only line containing the minimum number of seconds needed for prices to become equal, of «-1» if it is impossible.	[ "3 3\n12 9 15\n", "2 2\n10 9\n", "4 1\n1 1000000000 1000000000 1000000000\n" ]	[ "3", "-1", "2999999997" ]	Consider the first example. Suppose the third price decreases in the first second and become equal 12 rubles, then the first price decreases and becomes equal 9 rubles, and in the third second the third price decreases again and becomes equal 9 rubles. In this case all prices become equal 9 rubles in 3 seconds. There could be other possibilities, but this minimizes the time needed for all prices to become equal. Thus the answer is 3. In the second example we can notice that parity of first and second price is different and never changes within described process. Thus prices never can become equal. In the third example following scenario can take place: firstly, the second price drops, then the third price, and then fourth price. It happens 999999999 times, and, since in one second only one price can drop, the whole process takes 999999999 * 3 = 2999999997 seconds. We can note that this is the minimum possible time.	500	[ { "input": "3 3\n12 9 15", "output": "3" }, { "input": "2 2\n10 9", "output": "-1" }, { "input": "4 1\n1 1000000000 1000000000 1000000000", "output": "2999999997" }, { "input": "1 11\n123", "output": "0" }, { "input": "20 6\n38 86 86 50 98 62 32 2 14 62 98 50 2 50 32 38 62 62 8 14", "output": "151" }, { "input": "20 5\n59 54 19 88 55 100 54 3 6 13 99 38 36 71 59 6 64 85 45 54", "output": "-1" }, { "input": "100 10\n340 70 440 330 130 120 340 210 440 110 410 120 180 40 50 230 70 110 310 360 480 70 230 120 230 310 470 60 210 60 210 480 290 250 450 440 150 40 500 230 280 250 30 50 310 50 230 360 420 260 330 80 50 160 70 470 140 180 380 190 250 30 220 410 80 310 280 50 20 430 440 180 310 190 190 330 90 190 320 390 170 460 230 30 80 500 470 370 80 500 400 120 220 150 70 120 70 320 260 260", "output": "2157" }, { "input": "100 18\n489 42 300 366 473 105 220 448 70 488 201 396 168 281 67 235 324 291 313 387 407 223 39 144 224 233 72 318 229 377 62 171 448 119 354 282 147 447 260 384 172 199 67 326 311 431 337 142 281 202 404 468 38 120 90 437 33 420 249 372 367 253 255 411 309 333 103 176 162 120 203 41 352 478 216 498 224 31 261 493 277 99 375 370 394 229 71 488 246 194 233 13 66 111 366 456 277 360 116 354", "output": "-1" }, { "input": "4 2\n1 2 3 4", "output": "-1" }, { "input": "3 4\n3 5 5", "output": "-1" }, { "input": "3 2\n88888884 88888886 88888888", "output": "3" }, { "input": "2 1\n1000000000 1000000000", "output": "0" }, { "input": "4 2\n1000000000 100000000 100000000 100000000", "output": "450000000" }, { "input": "2 2\n1000000000 1000000000", "output": "0" }, { "input": "3 3\n3 2 1", "output": "-1" }, { "input": "3 4\n3 5 3", "output": "-1" }, { "input": "3 2\n1 2 2", "output": "-1" }, { "input": "4 2\n2 3 3 2", "output": "-1" }, { "input": "3 2\n1 2 4", "output": "-1" }, { "input": "3 2\n3 4 4", "output": "-1" }, { "input": "3 3\n4 7 10", "output": "3" }, { "input": "4 3\n2 2 5 1", "output": "-1" }, { "input": "3 3\n1 3 5", "output": "-1" }, { "input": "2 5\n5 9", "output": "-1" }, { "input": "2 3\n5 7", "output": "-1" }, { "input": "3 137\n1000000000 1000000000 1000000000", "output": "0" }, { "input": "5 1000000000\n1000000000 1000000000 1000000000 1000000000 1000000000", "output": "0" }, { "input": "3 5\n1 2 5", "output": "-1" }, { "input": "3 3\n1000000000 1000000000 999999997", "output": "2" }, { "input": "2 4\n5 6", "output": "-1" }, { "input": "4 1\n1000000000 1000000000 1000000000 1000000000", "output": "0" }, { "input": "2 3\n5 8", "output": "1" }, { "input": "2 6\n8 16", "output": "-1" }, { "input": "5 3\n15 14 9 12 18", "output": "-1" }, { "input": "3 3\n1 2 3", "output": "-1" }, { "input": "3 3\n3 4 5", "output": "-1" }, { "input": "2 5\n8 17", "output": "-1" }, { "input": "2 1\n1 2", "output": "1" }, { "input": "1 1\n1000000000", "output": "0" }, { "input": "3 3\n5 3 4", "output": "-1" }, { "input": "3 6\n10 14 12", "output": "-1" }, { "input": "2 2\n3 5", "output": "1" }, { "input": "3 5\n1 3 4", "output": "-1" }, { "input": "4 3\n1 6 6 6", "output": "-1" }, { "input": "2 3\n1 8", "output": "-1" }, { "input": "3 5\n6 11 17", "output": "-1" }, { "input": "2 2\n1 4", "output": "-1" }, { "input": "2 4\n6 8", "output": "-1" }, { "input": "2 1\n2 3", "output": "1" }, { "input": "4 4\n1 5 8 14", "output": "-1" }, { "input": "3 3\n1 5 3", "output": "-1" }, { "input": "4 3\n1 2 2 5", "output": "-1" }, { "input": "3 2\n1 4 6", "output": "-1" }, { "input": "2 3\n6 9", "output": "1" }, { "input": "3 3\n2 3 4", "output": "-1" }, { "input": "3 2\n9 10 10", "output": "-1" }, { "input": "2 2\n9 12", "output": "-1" }, { "input": "2 2\n100000003 100000005", "output": "1" }, { "input": "2 3\n2 4", "output": "-1" }, { "input": "3 2\n2 3 5", "output": "-1" }, { "input": "3 3\n1 3 4", "output": "-1" }, { "input": "10 2\n2 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000", "output": "4499999991" }, { "input": "3 5\n2 4 5", "output": "-1" }, { "input": "2 3\n7 10", "output": "1" }, { "input": "3 10\n10 13 17", "output": "-1" }, { "input": "2 3\n1 6", "output": "-1" }, { "input": "1 7\n1000000000", "output": "0" }, { "input": "2 4\n3 7", "output": "1" }, { "input": "2 3\n2 5", "output": "1" }, { "input": "20 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000", "output": "0" }, { "input": "3 3\n7 8 8", "output": "-1" }, { "input": "4 10\n1 11 100 11", "output": "-1" } ]	1,492,967,136	1,236	Python 3	RUNTIME_ERROR	PRETESTS	0	62	5,427,200	n, k = map(int, input().split()) a = list(map(int, input().split())) from random import randint mn = min(a) cnt = 0 from random import randint for i in a: cnt += (i - mn) if randint() % 2: cnt += randint() % 3 else: print(-1 if cnt % k else cnt // k)	Title: Oleg and shares Time Limit: None seconds Memory Limit: None megabytes Problem Description: Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that each second exactly one price changes, but at different seconds different prices can change). Prices can become negative. Oleg found this process interesting, and he asked Igor the financial analyst, what is the minimum time needed for all n prices to become equal, or it is impossible at all? Igor is busy right now, so he asked you to help Oleg. Can you answer this question? Input Specification: The first line contains two integers n and k (1<=≤<=n<=≤<=105,<=1<=≤<=k<=≤<=109) — the number of share prices, and the amount of rubles some price decreases each second. The second line contains n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=109) — the initial prices. Output Specification: Print the only line containing the minimum number of seconds needed for prices to become equal, of «-1» if it is impossible. Demo Input: ['3 3\n12 9 15\n', '2 2\n10 9\n', '4 1\n1 1000000000 1000000000 1000000000\n'] Demo Output: ['3', '-1', '2999999997'] Note: Consider the first example. Suppose the third price decreases in the first second and become equal 12 rubles, then the first price decreases and becomes equal 9 rubles, and in the third second the third price decreases again and becomes equal 9 rubles. In this case all prices become equal 9 rubles in 3 seconds. There could be other possibilities, but this minimizes the time needed for all prices to become equal. Thus the answer is 3. In the second example we can notice that parity of first and second price is different and never changes within described process. Thus prices never can become equal. In the third example following scenario can take place: firstly, the second price drops, then the third price, and then fourth price. It happens 999999999 times, and, since in one second only one price can drop, the whole process takes 999999999 * 3 = 2999999997 seconds. We can note that this is the minimum possible time.	```python n, k = map(int, input().split()) a = list(map(int, input().split())) from random import randint mn = min(a) cnt = 0 from random import randint for i in a: cnt += (i - mn) if randint() % 2: cnt += randint() % 3 else: print(-1 if cnt % k else cnt // k) ```	-1
165	A	Supercentral Point	PROGRAMMING	1,000	[ "implementation" ]		null	null	One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1,<=y1),<=(x2,<=y2),<=...,<=(xn,<=yn). Let's define neighbors for some fixed point from the given set (x,<=y): - 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 We'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. Vasya 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.	The first input line contains the only integer n (1<=≤<=n<=≤<=200) — the number of points in the given set. Next n lines contain the coordinates of the points written as "x y" (without the quotes) (\|x\|,<=\|y\|<=≤<=1000), all coordinates are integers. The numbers in the line are separated by exactly one space. It is guaranteed that all points are different.	Print the only number — the number of supercentral points of the given set.	[ "8\n1 1\n4 2\n3 1\n1 2\n0 2\n0 1\n1 0\n1 3\n", "5\n0 0\n0 1\n1 0\n0 -1\n-1 0\n" ]	[ "2\n", "1\n" ]	In the first sample the supercentral points are only points (1, 1) and (1, 2). In the second sample there is one supercental point — point (0, 0).	500	[ { "input": "8\n1 1\n4 2\n3 1\n1 2\n0 2\n0 1\n1 0\n1 3", "output": "2" }, { "input": "5\n0 0\n0 1\n1 0\n0 -1\n-1 0", "output": "1" }, { "input": "9\n-565 -752\n-184 723\n-184 -752\n-184 1\n950 723\n-565 723\n950 -752\n950 1\n-565 1", "output": "1" }, { "input": "25\n-651 897\n916 897\n-651 -808\n-748 301\n-734 414\n-651 -973\n-734 897\n916 -550\n-758 414\n916 180\n-758 -808\n-758 -973\n125 -550\n125 -973\n125 301\n916 414\n-748 -808\n-651 301\n-734 301\n-307 897\n-651 -550\n-651 414\n125 -808\n-748 -550\n916 -808", "output": "7" }, { "input": "1\n487 550", "output": "0" }, { "input": "10\n990 -396\n990 736\n990 646\n990 -102\n990 -570\n990 155\n990 528\n990 489\n990 268\n990 676", "output": "0" }, { "input": "30\n507 836\n525 836\n-779 196\n507 -814\n525 -814\n525 42\n525 196\n525 -136\n-779 311\n507 -360\n525 300\n507 578\n507 311\n-779 836\n507 300\n525 -360\n525 311\n-779 -360\n-779 578\n-779 300\n507 42\n525 578\n-779 379\n507 196\n525 379\n507 379\n-779 -814\n-779 42\n-779 -136\n507 -136", "output": "8" }, { "input": "25\n890 -756\n890 -188\n-37 -756\n-37 853\n523 998\n-261 853\n-351 853\n-351 -188\n523 -756\n-261 -188\n-37 998\n523 -212\n-351 998\n-37 -188\n-351 -756\n-37 -212\n890 998\n890 -212\n523 853\n-351 -212\n-261 -212\n-261 998\n-261 -756\n890 853\n523 -188", "output": "9" }, { "input": "21\n-813 -11\n486 254\n685 254\n-708 254\n-55 -11\n-671 -191\n486 -11\n-671 -11\n685 -11\n685 -191\n486 -191\n-55 254\n-708 -11\n-813 254\n-708 -191\n41 -11\n-671 254\n-813 -191\n41 254\n-55 -191\n41 -191", "output": "5" }, { "input": "4\n1 0\n2 0\n1 1\n1 -1", "output": "0" } ]	1,673,366,141	2,147,483,647	Python 3	OK	TESTS	26	154	0	n = int(input()) points = [] count = 0 for inpt in range(n): points.append(input().split()) for i in range(n): has_left = False has_right = False has_upper = False has_lower = False for j in range(n): if i == j : continue elif points[i][1] == points[j][1] and int(points[j][0]) > int(points[i][0]): has_right = True elif points[i][1] == points[j][1] and int(points[j][0]) < int(points[i][0]): has_left = True elif points[i][0] == points[j][0] and int(points[j][1]) > int(points[i][1]): has_upper = True elif points[i][0] == points[j][0] and int(points[j][1]) < int(points[i][1]): has_lower = True else: continue if has_right and has_left: if has_upper and has_lower: count +=1 print(count)	Title: Supercentral Point Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1,<=y1),<=(x2,<=y2),<=...,<=(xn,<=yn). Let's define neighbors for some fixed point from the given set (x,<=y): - 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 We'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. Vasya 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 Specification: The first input line contains the only integer n (1<=≤<=n<=≤<=200) — the number of points in the given set. Next n lines contain the coordinates of the points written as "x y" (without the quotes) (\|x\|,<=\|y\|<=≤<=1000), all coordinates are integers. The numbers in the line are separated by exactly one space. It is guaranteed that all points are different. Output Specification: Print the only number — the number of supercentral points of the given set. Demo Input: ['8\n1 1\n4 2\n3 1\n1 2\n0 2\n0 1\n1 0\n1 3\n', '5\n0 0\n0 1\n1 0\n0 -1\n-1 0\n'] Demo Output: ['2\n', '1\n'] Note: In the first sample the supercentral points are only points (1, 1) and (1, 2). In the second sample there is one supercental point — point (0, 0).	```python n = int(input()) points = [] count = 0 for inpt in range(n): points.append(input().split()) for i in range(n): has_left = False has_right = False has_upper = False has_lower = False for j in range(n): if i == j : continue elif points[i][1] == points[j][1] and int(points[j][0]) > int(points[i][0]): has_right = True elif points[i][1] == points[j][1] and int(points[j][0]) < int(points[i][0]): has_left = True elif points[i][0] == points[j][0] and int(points[j][1]) > int(points[i][1]): has_upper = True elif points[i][0] == points[j][0] and int(points[j][1]) < int(points[i][1]): has_lower = True else: continue if has_right and has_left: if has_upper and has_lower: count +=1 print(count) ```	3
625	A	Guest From the Past	PROGRAMMING	1,700	[ "implementation", "math" ]		null	null	Kolya Gerasimov loves kefir very much. He lives in year 1984 and knows all the details of buying this delicious drink. One day, as you probably know, he found himself in year 2084, and buying kefir there is much more complicated. Kolya is hungry, so he went to the nearest milk shop. In 2084 you may buy kefir in a plastic liter bottle, that costs a rubles, or in glass liter bottle, that costs b rubles. Also, you may return empty glass bottle and get c (c<=<<=b) rubles back, but you cannot return plastic bottles. Kolya has n rubles and he is really hungry, so he wants to drink as much kefir as possible. There were no plastic bottles in his 1984, so Kolya doesn't know how to act optimally and asks for your help.	First line of the input contains a single integer n (1<=≤<=n<=≤<=1018) — the number of rubles Kolya has at the beginning. Then follow three lines containing integers a, b and c (1<=≤<=a<=≤<=1018, 1<=≤<=c<=<<=b<=≤<=1018) — the cost of one plastic liter bottle, the cost of one glass liter bottle and the money one can get back by returning an empty glass bottle, respectively.	Print the only integer — maximum number of liters of kefir, that Kolya can drink.	[ "10\n11\n9\n8\n", "10\n5\n6\n1\n" ]	[ "2\n", "2\n" ]	In the first sample, Kolya can buy one glass bottle, then return it and buy one more glass bottle. Thus he will drink 2 liters of kefir. In the second sample, Kolya can buy two plastic bottle and get two liters of kefir, or he can buy one liter glass bottle, then return it and buy one plastic bottle. In both cases he will drink two liters of kefir.	750	[ { "input": "10\n11\n9\n8", "output": "2" }, { "input": "10\n5\n6\n1", "output": "2" }, { "input": "2\n2\n2\n1", "output": "1" }, { "input": "10\n3\n3\n1", "output": "4" }, { "input": "10\n1\n2\n1", "output": "10" }, { "input": "10\n2\n3\n1", "output": "5" }, { "input": "9\n2\n4\n1", "output": "4" }, { "input": "9\n2\n2\n1", "output": "8" }, { "input": "9\n10\n10\n1", "output": "0" }, { "input": "10\n2\n2\n1", "output": "9" }, { "input": "1000000000000000000\n2\n10\n9", "output": "999999999999999995" }, { "input": "501000000000000000\n300000000000000000\n301000000000000000\n100000000000000000", "output": "2" }, { "input": "10\n1\n9\n8", "output": "10" }, { "input": "10\n8\n8\n7", "output": "3" }, { "input": "10\n5\n5\n1", "output": "2" }, { "input": "29\n3\n3\n1", "output": "14" }, { "input": "45\n9\n9\n8", "output": "37" }, { "input": "45\n9\n9\n1", "output": "5" }, { "input": "100\n10\n10\n9", "output": "91" }, { "input": "179\n10\n9\n1", "output": "22" }, { "input": "179\n2\n2\n1", "output": "178" }, { "input": "179\n179\n179\n1", "output": "1" }, { "input": "179\n59\n59\n58", "output": "121" }, { "input": "500\n250\n250\n1", "output": "2" }, { "input": "500\n1\n250\n1", "output": "500" }, { "input": "501\n500\n500\n499", "output": "2" }, { "input": "501\n450\n52\n1", "output": "9" }, { "input": "501\n300\n301\n100", "output": "2" }, { "input": "500\n179\n10\n1", "output": "55" }, { "input": "1000\n500\n10\n9", "output": "991" }, { "input": "1000\n2\n10\n9", "output": "995" }, { "input": "1001\n1000\n1000\n999", "output": "2" }, { "input": "10000\n10000\n10000\n1", "output": "1" }, { "input": "10000\n10\n5000\n4999", "output": "5500" }, { "input": "1000000000\n999999998\n999999999\n999999998", "output": "3" }, { "input": "1000000000\n50\n50\n49", "output": "999999951" }, { "input": "1000000000\n500\n5000\n4999", "output": "999995010" }, { "input": "1000000000\n51\n100\n98", "output": "499999952" }, { "input": "1000000000\n100\n51\n50", "output": "999999950" }, { "input": "1000000000\n2\n5\n4", "output": "999999998" }, { "input": "1000000000000000000\n999999998000000000\n999999999000000000\n999999998000000000", "output": "3" }, { "input": "1000000000\n2\n2\n1", "output": "999999999" }, { "input": "999999999\n2\n999999998\n1", "output": "499999999" }, { "input": "999999999999999999\n2\n2\n1", "output": "999999999999999998" }, { "input": "999999999999999999\n10\n10\n9", "output": "999999999999999990" }, { "input": "999999999999999999\n999999999999999998\n999999999999999998\n999999999999999997", "output": "2" }, { "input": "999999999999999999\n501\n501\n1", "output": "1999999999999999" }, { "input": "999999999999999999\n2\n50000000000000000\n49999999999999999", "output": "974999999999999999" }, { "input": "999999999999999999\n180\n180\n1", "output": "5586592178770949" }, { "input": "1000000000000000000\n42\n41\n1", "output": "24999999999999999" }, { "input": "1000000000000000000\n41\n40\n1", "output": "25641025641025641" }, { "input": "100000000000000000\n79\n100\n25", "output": "1333333333333333" }, { "input": "1\n100\n5\n4", "output": "0" }, { "input": "1000000000000000000\n1000000000000000000\n10000000\n9999999", "output": "999999999990000001" }, { "input": "999999999999999999\n999999999000000000\n900000000000000000\n899999999999999999", "output": "100000000000000000" }, { "input": "13\n10\n15\n11", "output": "1" }, { "input": "1\n1000\n5\n4", "output": "0" }, { "input": "10\n100\n10\n1", "output": "1" }, { "input": "3\n2\n100000\n99999", "output": "1" }, { "input": "4\n2\n4\n2", "output": "2" }, { "input": "5\n3\n6\n4", "output": "1" }, { "input": "1\n7\n65\n49", "output": "0" }, { "input": "10\n20\n100\n99", "output": "0" }, { "input": "10000000000\n10000000000\n9000000000\n8999999999", "output": "1000000001" }, { "input": "90\n30\n101\n100", "output": "3" }, { "input": "999999999999999\n5\n500000000000000\n499999999999999", "output": "599999999999999" }, { "input": "1000000000000000000\n1000000000000000000\n1000000000\n999999999", "output": "999999999000000001" }, { "input": "1\n1000000000000000000\n1000000000\n999999999", "output": "0" }, { "input": "100000000000000000\n100000000000000000\n1000000000\n999999999", "output": "99999999000000001" }, { "input": "100000000000000009\n100\n1000000000000000\n999999999999999", "output": "99010000000000009" }, { "input": "10\n20\n10\n9", "output": "1" }, { "input": "10\n4\n14\n13", "output": "2" }, { "input": "11\n3\n9\n7", "output": "4" }, { "input": "1000000000\n5\n7\n4", "output": "333333332" }, { "input": "12155\n1943\n28717\n24074", "output": "6" }, { "input": "1000000000000000000\n10\n20\n5", "output": "100000000000000000" }, { "input": "98\n33\n440\n314", "output": "2" }, { "input": "1070252292\n57449678\n237309920\n221182550", "output": "56" }, { "input": "100\n3\n102\n101", "output": "33" }, { "input": "100000000000000000\n100000000000000001\n1000000000000000\n999999999999999", "output": "99000000000000001" }, { "input": "66249876257975628\n302307316\n406102416\n182373516", "output": "296116756" }, { "input": "10\n5\n10\n1", "output": "2" }, { "input": "1000000000000000000\n10\n1000000000\n999999998", "output": "499999999600000000" } ]	1,454,957,969	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	6	46	0	n = int(input()) a = int(input()) b = int(input()) c = int(input()) jam = 0 while(b <= n): n -= b jam += 1 n += c if(a <= n): n -= a jam += 1 print(jam)	Title: Guest From the Past Time Limit: None seconds Memory Limit: None megabytes Problem Description: Kolya Gerasimov loves kefir very much. He lives in year 1984 and knows all the details of buying this delicious drink. One day, as you probably know, he found himself in year 2084, and buying kefir there is much more complicated. Kolya is hungry, so he went to the nearest milk shop. In 2084 you may buy kefir in a plastic liter bottle, that costs a rubles, or in glass liter bottle, that costs b rubles. Also, you may return empty glass bottle and get c (c<=<<=b) rubles back, but you cannot return plastic bottles. Kolya has n rubles and he is really hungry, so he wants to drink as much kefir as possible. There were no plastic bottles in his 1984, so Kolya doesn't know how to act optimally and asks for your help. Input Specification: First line of the input contains a single integer n (1<=≤<=n<=≤<=1018) — the number of rubles Kolya has at the beginning. Then follow three lines containing integers a, b and c (1<=≤<=a<=≤<=1018, 1<=≤<=c<=<<=b<=≤<=1018) — the cost of one plastic liter bottle, the cost of one glass liter bottle and the money one can get back by returning an empty glass bottle, respectively. Output Specification: Print the only integer — maximum number of liters of kefir, that Kolya can drink. Demo Input: ['10\n11\n9\n8\n', '10\n5\n6\n1\n'] Demo Output: ['2\n', '2\n'] Note: In the first sample, Kolya can buy one glass bottle, then return it and buy one more glass bottle. Thus he will drink 2 liters of kefir. In the second sample, Kolya can buy two plastic bottle and get two liters of kefir, or he can buy one liter glass bottle, then return it and buy one plastic bottle. In both cases he will drink two liters of kefir.	```python n = int(input()) a = int(input()) b = int(input()) c = int(input()) jam = 0 while(b <= n): n -= b jam += 1 n += c if(a <= n): n -= a jam += 1 print(jam) ```	0
981	A	Antipalindrome	PROGRAMMING	900	[ "brute force", "implementation", "strings" ]		null	null	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. A 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}$. Anna 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. Some time ago Ann read the word $s$. What is the word she changed it into?	The first line contains a non-empty string $s$ with length at most $50$ characters, containing lowercase English letters only.	If there is such a substring in $s$ that is not a palindrome, print the maximum length of such a substring. Otherwise print $0$. Note that there can be multiple longest substrings that are not palindromes, but their length is unique.	[ "mew\n", "wuffuw\n", "qqqqqqqq\n" ]	[ "3\n", "5\n", "0\n" ]	"mew" is not a palindrome, so the longest substring of it that is not a palindrome, is the string "mew" itself. Thus, the answer for the first example is $3$. The string "uffuw" is one of the longest non-palindrome substrings (of length $5$) of the string "wuffuw", so the answer for the second example is $5$. All substrings of the string "qqqqqqqq" consist of equal characters so they are palindromes. This way, there are no non-palindrome substrings. Thus, the answer for the third example is $0$.	500	[ { "input": "mew", "output": "3" }, { "input": "wuffuw", "output": "5" }, { "input": "qqqqqqqq", "output": "0" }, { "input": "ijvji", "output": "4" }, { "input": "iiiiiii", "output": "0" }, { "input": "wobervhvvkihcuyjtmqhaaigvvgiaahqmtjyuchikvvhvrebow", "output": "49" }, { "input": "wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww", "output": "0" }, { "input": "wobervhvvkihcuyjtmqhaaigvahheoqleromusrartldojsjvy", "output": "50" }, { "input": "ijvxljt", "output": "7" }, { "input": "fyhcncnchyf", "output": "10" }, { "input": "ffffffffffff", "output": "0" }, { "input": "fyhcncfsepqj", "output": "12" }, { "input": "ybejrrlbcinttnicblrrjeby", "output": "23" }, { "input": "yyyyyyyyyyyyyyyyyyyyyyyyy", "output": "0" }, { "input": "ybejrrlbcintahovgjddrqatv", "output": "25" }, { "input": "oftmhcmclgyqaojljoaqyglcmchmtfo", "output": "30" }, { "input": "oooooooooooooooooooooooooooooooo", "output": "0" }, { "input": "oftmhcmclgyqaojllbotztajglsmcilv", "output": "32" }, { "input": "gxandbtgpbknxvnkjaajknvxnkbpgtbdnaxg", "output": "35" }, { "input": "gggggggggggggggggggggggggggggggggggg", "output": "0" }, { "input": "gxandbtgpbknxvnkjaygommzqitqzjfalfkk", "output": "36" }, { "input": "fcliblymyqckxvieotjooojtoeivxkcqymylbilcf", "output": "40" }, { "input": "fffffffffffffffffffffffffffffffffffffffffff", "output": "0" }, { "input": "fcliblymyqckxvieotjootiqwtyznhhvuhbaixwqnsy", "output": "43" }, { "input": "rrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrr", "output": "0" }, { "input": "rajccqwqnqmshmerpvjyfepxwpxyldzpzhctqjnstxyfmlhiy", "output": "49" }, { "input": "a", "output": "0" }, { "input": "abca", "output": "4" }, { "input": "aaaaabaaaaa", "output": "10" }, { "input": "aba", "output": "2" }, { "input": "asaa", "output": "4" }, { "input": "aabaa", "output": "4" }, { "input": "aabbaa", "output": "5" }, { "input": "abcdaaa", "output": "7" }, { "input": "aaholaa", "output": "7" }, { "input": "abcdefghijka", "output": "12" }, { "input": "aaadcba", "output": "7" }, { "input": "aaaabaaaa", "output": "8" }, { "input": "abaa", "output": "4" }, { "input": "abcbaa", "output": "6" }, { "input": "ab", "output": "2" }, { "input": "l", "output": "0" }, { "input": "aaaabcaaaa", "output": "10" }, { "input": "abbaaaaaabba", "output": "11" }, { "input": "abaaa", "output": "5" }, { "input": "baa", "output": "3" }, { "input": "aaaaaaabbba", "output": "11" }, { "input": "ccbcc", "output": "4" }, { "input": "bbbaaab", "output": "7" }, { "input": "abaaaaaaaa", "output": "10" }, { "input": "abaaba", "output": "5" }, { "input": "aabsdfaaaa", "output": "10" }, { "input": "aaaba", "output": "5" }, { "input": "aaabaaa", "output": "6" }, { "input": "baaabbb", "output": "7" }, { "input": "ccbbabbcc", "output": "8" }, { "input": "cabc", "output": "4" }, { "input": "aabcd", "output": "5" }, { "input": "abcdea", "output": "6" }, { "input": "bbabb", "output": "4" }, { "input": "aaaaabababaaaaa", "output": "14" }, { "input": "bbabbb", "output": "6" }, { "input": "aababd", "output": "6" }, { "input": "abaaaa", "output": "6" }, { "input": "aaaaaaaabbba", "output": "12" }, { "input": "aabca", "output": "5" }, { "input": "aaabccbaaa", "output": "9" }, { "input": "aaaaaaaaaaaaaaaaaaaab", "output": "21" }, { "input": "babb", "output": "4" }, { "input": "abcaa", "output": "5" }, { "input": "qwqq", "output": "4" }, { "input": "aaaaaaaaaaabbbbbbbbbbbbbbbaaaaaaaaaaaaaaaaaaaaaa", "output": "48" }, { "input": "aaab", "output": "4" }, { "input": "aaaaaabaaaaa", "output": "12" }, { "input": "wwuww", "output": "4" }, { "input": "aaaaabcbaaaaa", "output": "12" }, { "input": "aaabbbaaa", "output": "8" }, { "input": "aabcbaa", "output": "6" }, { "input": "abccdefccba", "output": "11" }, { "input": "aabbcbbaa", "output": "8" }, { "input": "aaaabbaaaa", "output": "9" }, { "input": "aabcda", "output": "6" }, { "input": "abbca", "output": "5" }, { "input": "aaaaaabbaaa", "output": "11" }, { "input": "sssssspssssss", "output": "12" }, { "input": "sdnmsdcs", "output": "8" }, { "input": "aaabbbccbbbaaa", "output": "13" }, { "input": "cbdbdc", "output": "6" }, { "input": "abb", "output": "3" }, { "input": "abcdefaaaa", "output": "10" }, { "input": "abbbaaa", "output": "7" }, { "input": "v", "output": "0" }, { "input": "abccbba", "output": "7" }, { "input": "axyza", "output": "5" }, { "input": "abcdefgaaaa", "output": "11" }, { "input": "aaabcdaaa", "output": "9" }, { "input": "aaaacaaaa", "output": "8" }, { "input": "aaaaaaaaaaaaaaaaaaaabaaaaaaaaaaaaaaaaaaaaa", "output": "42" }, { "input": "abbbaa", "output": "6" }, { "input": "abcdee", "output": "6" }, { "input": "oom", "output": "3" }, { "input": "aabcaa", "output": "6" }, { "input": "abba", "output": "3" }, { "input": "aaca", "output": "4" }, { "input": "aacbca", "output": "6" }, { "input": "ababa", "output": "4" }, { "input": "abcda", "output": "5" }, { "input": "cccaaccc", "output": "7" }, { "input": "aaabcda", "output": "7" }, { "input": "aa", "output": "0" }, { "input": "aabaaaa", "output": "7" }, { "input": "abbaaaa", "output": "7" }, { "input": "aaabcbaaa", "output": "8" }, { "input": "aabba", "output": "5" }, { "input": "xyxx", "output": "4" }, { "input": "aaaaaaaaaaaabc", "output": "14" }, { "input": "bbaaaabb", "output": "7" }, { "input": "aaabaa", "output": "6" }, { "input": "sssssabsssss", "output": "12" }, { "input": "bbbaaaabbb", "output": "9" }, { "input": "abbbbaaaa", "output": "9" }, { "input": "wwufuww", "output": "6" }, { "input": "oowoo", "output": "4" }, { "input": "cccaccc", "output": "6" }, { "input": "aaa", "output": "0" }, { "input": "bbbcc", "output": "5" }, { "input": "abcdef", "output": "6" }, { "input": "abbba", "output": "4" }, { "input": "aab", "output": "3" }, { "input": "aaba", "output": "4" }, { "input": "azbyaaa", "output": "7" }, { "input": "oooooiooooo", "output": "10" }, { "input": "aabbbbbaaaaaa", "output": "13" } ]	1,695,280,233	2,147,483,647	Python 3	OK	TESTS	133	46	0	def isPalindrome(word): return word == word[::-1] def isEqualChars(word): c = word[len(word)-1] for i in range(len(word)-1): if word[i] != c: return False return True def findLongestAntiPalindrome(word, substrings): longest = 0 for i in range(len(substrings)): if len(substrings[i]) > longest and not isPalindrome(substrings[i]): longest = len(substrings[i]) return longest def findAllSubstrings(s): substrings = [] for i in range(len(s)): substr = "" for j in range(i, len(s)): substr += s[j] substrings.append(substr + "") return substrings s = input() if not isPalindrome(s): print(len(s)) elif isEqualChars(s): print(0) else: substrings = findAllSubstrings(s) print(findLongestAntiPalindrome(s, substrings))	Title: Antipalindrome Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. A 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}$. Anna 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. Some time ago Ann read the word $s$. What is the word she changed it into? Input Specification: The first line contains a non-empty string $s$ with length at most $50$ characters, containing lowercase English letters only. Output Specification: If there is such a substring in $s$ that is not a palindrome, print the maximum length of such a substring. Otherwise print $0$. Note that there can be multiple longest substrings that are not palindromes, but their length is unique. Demo Input: ['mew\n', 'wuffuw\n', 'qqqqqqqq\n'] Demo Output: ['3\n', '5\n', '0\n'] Note: "mew" is not a palindrome, so the longest substring of it that is not a palindrome, is the string "mew" itself. Thus, the answer for the first example is $3$. The string "uffuw" is one of the longest non-palindrome substrings (of length $5$) of the string "wuffuw", so the answer for the second example is $5$. All substrings of the string "qqqqqqqq" consist of equal characters so they are palindromes. This way, there are no non-palindrome substrings. Thus, the answer for the third example is $0$.	```python def isPalindrome(word): return word == word[::-1] def isEqualChars(word): c = word[len(word)-1] for i in range(len(word)-1): if word[i] != c: return False return True def findLongestAntiPalindrome(word, substrings): longest = 0 for i in range(len(substrings)): if len(substrings[i]) > longest and not isPalindrome(substrings[i]): longest = len(substrings[i]) return longest def findAllSubstrings(s): substrings = [] for i in range(len(s)): substr = "" for j in range(i, len(s)): substr += s[j] substrings.append(substr + "") return substrings s = input() if not isPalindrome(s): print(len(s)) elif isEqualChars(s): print(0) else: substrings = findAllSubstrings(s) print(findLongestAntiPalindrome(s, substrings)) ```	3
765	G	Math, math everywhere	PROGRAMMING	3,200	[ "brute force", "dp", "math", "meet-in-the-middle", "number theory" ]		null	null	If you have gone that far, you'll probably skip unnecessary legends anyway... You are given a binary string and an integer . Find the number of integers k, 0<=≤<=k<=<<=N, such that for all i<==<=0, 1, ..., m<=-<=1	In the first line of input there is a string s consisting of 0's and 1's (1<=≤<=\|s\|<=≤<=40). In the next line of input there is an integer n (1<=≤<=n<=≤<=5·105). Each of the next n lines contains two space-separated integers pi, αi (1<=≤<=pi,<=αi<=≤<=109, pi is prime). All pi are distinct.	A single integer — the answer to the problem.	[ "1\n2\n2 1\n3 1\n", "01\n2\n3 2\n5 1\n", "1011\n1\n3 1000000000\n" ]	[ "2\n", "15\n", "411979884\n" ]	none	3,500	[]	1,568,151,941	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	1	124	0	def gcd(x, y): if y == 0: return x else: return gcd(y, x%y) s = input() n = int(input()) N = 1 for i in range(n): l = input().split(" ") N = int(l[0])*int(l[1]) k = [] for char in range(len(s)): if s[char] == '1': k.append(char) count = 0 for j in range(N): for i in range(len(k)): if gcd(k[i] + j, N) == 1: count += 1 print(count)	Title: Math, math everywhere Time Limit: None seconds Memory Limit: None megabytes Problem Description: If you have gone that far, you'll probably skip unnecessary legends anyway... You are given a binary string and an integer . Find the number of integers k, 0<=≤<=k<=<<=N, such that for all i<==<=0, 1, ..., m<=-<=1 Input Specification: In the first line of input there is a string s consisting of 0's and 1's (1<=≤<=\|s\|<=≤<=40). In the next line of input there is an integer n (1<=≤<=n<=≤<=5·105). Each of the next n lines contains two space-separated integers pi, αi (1<=≤<=pi,<=αi<=≤<=109, pi is prime). All pi are distinct. Output Specification: A single integer — the answer to the problem. Demo Input: ['1\n2\n2 1\n3 1\n', '01\n2\n3 2\n5 1\n', '1011\n1\n3 1000000000\n'] Demo Output: ['2\n', '15\n', '411979884\n'] Note: none	```python def gcd(x, y): if y == 0: return x else: return gcd(y, x%y) s = input() n = int(input()) N = 1 for i in range(n): l = input().split(" ") N = int(l[0])*int(l[1]) k = [] for char in range(len(s)): if s[char] == '1': k.append(char) count = 0 for j in range(N): for i in range(len(k)): if gcd(k[i] + j, N) == 1: count += 1 print(count) ```	0
69	A	Young Physicist	PROGRAMMING	1,000	[ "implementation", "math" ]	A. Young Physicist	2	256	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.	The first line contains a positive integer n (1<=≤<=n<=≤<=100), then follow n lines containing three integers each: the xi coordinate, the yi coordinate and the zi coordinate of the force vector, applied to the body (<=-<=100<=≤<=xi,<=yi,<=zi<=≤<=100).	Print the word "YES" if the body is in equilibrium, or the word "NO" if it is not.	[ "3\n4 1 7\n-2 4 -1\n1 -5 -3\n", "3\n3 -1 7\n-5 2 -4\n2 -1 -3\n" ]	[ "NO", "YES" ]	none	500	[ { "input": "3\n4 1 7\n-2 4 -1\n1 -5 -3", "output": "NO" }, { "input": "3\n3 -1 7\n-5 2 -4\n2 -1 -3", "output": "YES" }, { "input": "10\n21 32 -46\n43 -35 21\n42 2 -50\n22 40 20\n-27 -9 38\n-4 1 1\n-40 6 -31\n-13 -2 34\n-21 34 -12\n-32 -29 41", "output": "NO" }, { "input": "10\n25 -33 43\n-27 -42 28\n-35 -20 19\n41 -42 -1\n49 -39 -4\n-49 -22 7\n-19 29 41\n8 -27 -43\n8 34 9\n-11 -3 33", "output": "NO" }, { "input": "10\n-6 21 18\n20 -11 -8\n37 -11 41\n-5 8 33\n29 23 32\n30 -33 -11\n39 -49 -36\n28 34 -49\n22 29 -34\n-18 -6 7", "output": "NO" }, { "input": "10\n47 -2 -27\n0 26 -14\n5 -12 33\n2 18 3\n45 -30 -49\n4 -18 8\n-46 -44 -41\n-22 -10 -40\n-35 -21 26\n33 20 38", "output": "NO" }, { "input": "13\n-3 -36 -46\n-11 -50 37\n42 -11 -15\n9 42 44\n-29 -12 24\n3 9 -40\n-35 13 50\n14 43 18\n-13 8 24\n-48 -15 10\n50 9 -50\n21 0 -50\n0 0 -6", "output": "YES" }, { "input": "14\n43 23 17\n4 17 44\n5 -5 -16\n-43 -7 -6\n47 -48 12\n50 47 -45\n2 14 43\n37 -30 15\n4 -17 -11\n17 9 -45\n-50 -3 -8\n-50 0 0\n-50 0 0\n-16 0 0", "output": "YES" }, { "input": "13\n29 49 -11\n38 -11 -20\n25 1 -40\n-11 28 11\n23 -19 1\n45 -41 -17\n-3 0 -19\n-13 -33 49\n-30 0 28\n34 17 45\n-50 9 -27\n-50 0 0\n-37 0 0", "output": "YES" }, { "input": "12\n3 28 -35\n-32 -44 -17\n9 -25 -6\n-42 -22 20\n-19 15 38\n-21 38 48\n-1 -37 -28\n-10 -13 -50\n-5 21 29\n34 28 50\n50 11 -49\n34 0 0", "output": "YES" }, { "input": "37\n-64 -79 26\n-22 59 93\n-5 39 -12\n77 -9 76\n55 -86 57\n83 100 -97\n-70 94 84\n-14 46 -94\n26 72 35\n14 78 -62\n17 82 92\n-57 11 91\n23 15 92\n-80 -1 1\n12 39 18\n-23 -99 -75\n-34 50 19\n-39 84 -7\n45 -30 -39\n-60 49 37\n45 -16 -72\n33 -51 -56\n-48 28 5\n97 91 88\n45 -82 -11\n-21 -15 -90\n-53 73 -26\n-74 85 -90\n-40 23 38\n100 -13 49\n32 -100 -100\n0 -100 -70\n0 -100 0\n0 -100 0\n0 -100 0\n0 -100 0\n0 -37 0", "output": "YES" }, { "input": "4\n68 3 100\n68 21 -100\n-100 -24 0\n-36 0 0", "output": "YES" }, { "input": "33\n-1 -46 -12\n45 -16 -21\n-11 45 -21\n-60 -42 -93\n-22 -45 93\n37 96 85\n-76 26 83\n-4 9 55\n7 -52 -9\n66 8 -85\n-100 -54 11\n-29 59 74\n-24 12 2\n-56 81 85\n-92 69 -52\n-26 -97 91\n54 59 -51\n58 21 -57\n7 68 56\n-47 -20 -51\n-59 77 -13\n-85 27 91\n79 60 -56\n66 -80 5\n21 -99 42\n-31 -29 98\n66 93 76\n-49 45 61\n100 -100 -100\n100 -100 -100\n66 -75 -100\n0 0 -100\n0 0 -87", "output": "YES" }, { "input": "3\n1 2 3\n3 2 1\n0 0 0", "output": "NO" }, { "input": "2\n5 -23 12\n0 0 0", "output": "NO" }, { "input": "1\n0 0 0", "output": "YES" }, { "input": "1\n1 -2 0", "output": "NO" }, { "input": "2\n-23 77 -86\n23 -77 86", "output": "YES" }, { "input": "26\n86 7 20\n-57 -64 39\n-45 6 -93\n-44 -21 100\n-11 -49 21\n73 -71 -80\n-2 -89 56\n-65 -2 7\n5 14 84\n57 41 13\n-12 69 54\n40 -25 27\n-17 -59 0\n64 -91 -30\n-53 9 42\n-54 -8 14\n-35 82 27\n-48 -59 -80\n88 70 79\n94 57 97\n44 63 25\n84 -90 -40\n-100 100 -100\n-92 100 -100\n0 10 -100\n0 0 -82", "output": "YES" }, { "input": "42\n11 27 92\n-18 -56 -57\n1 71 81\n33 -92 30\n82 83 49\n-87 -61 -1\n-49 45 49\n73 26 15\n-22 22 -77\n29 -93 87\n-68 44 -90\n-4 -84 20\n85 67 -6\n-39 26 77\n-28 -64 20\n65 -97 24\n-72 -39 51\n35 -75 -91\n39 -44 -8\n-25 -27 -57\n91 8 -46\n-98 -94 56\n94 -60 59\n-9 -95 18\n-53 -37 98\n-8 -94 -84\n-52 55 60\n15 -14 37\n65 -43 -25\n94 12 66\n-8 -19 -83\n29 81 -78\n-58 57 33\n24 86 -84\n-53 32 -88\n-14 7 3\n89 97 -53\n-5 -28 -91\n-100 100 -6\n-84 100 0\n0 100 0\n0 70 0", "output": "YES" }, { "input": "3\n96 49 -12\n2 -66 28\n-98 17 -16", "output": "YES" }, { "input": "5\n70 -46 86\n-100 94 24\n-27 63 -63\n57 -100 -47\n0 -11 0", "output": "YES" }, { "input": "18\n-86 -28 70\n-31 -89 42\n31 -48 -55\n95 -17 -43\n24 -95 -85\n-21 -14 31\n68 -18 81\n13 31 60\n-15 28 99\n-42 15 9\n28 -61 -62\n-16 71 29\n-28 75 -48\n-77 -67 36\n-100 83 89\n100 100 -100\n57 34 -100\n0 0 -53", "output": "YES" }, { "input": "44\n52 -54 -29\n-82 -5 -94\n-54 43 43\n91 16 71\n7 80 -91\n3 15 29\n-99 -6 -77\n-3 -77 -64\n73 67 34\n25 -10 -18\n-29 91 63\n-72 86 -16\n-68 85 -81\n-3 36 44\n-74 -14 -80\n34 -96 -97\n-76 -78 -33\n-24 44 -58\n98 12 77\n95 -63 -6\n-51 3 -90\n-92 -10 72\n7 3 -68\n57 -53 71\n29 57 -48\n35 -60 10\n79 -70 -61\n-20 77 55\n-86 -15 -35\n84 -88 -18\n100 -42 77\n-20 46 8\n-41 -43 -65\n38 -98 -23\n-100 65 45\n-7 -91 -63\n46 88 -85\n48 59 100\n0 0 100\n0 0 100\n0 0 100\n0 0 100\n0 0 100\n0 0 1", "output": "YES" }, { "input": "18\n-14 -64 -91\n-8 -66 -86\n-23 92 -40\n6 -3 -53\n57 41 78\n-79 42 -22\n-88 -17 45\n4 -45 44\n83 -18 -25\n34 86 -92\n75 -30 12\n44 99 11\n-67 -13 72\n22 83 -56\n-37 71 72\n-9 -100 100\n0 -100 31\n0 -58 0", "output": "YES" }, { "input": "23\n-70 37 78\n42 84 6\n28 -94 -24\n-49 76 95\n-67 18 84\n-53 78 -5\n65 -63 -64\n-66 -64 -69\n81 -93 95\n10 52 -79\n-89 -61 -64\n-64 -47 43\n-81 -35 55\n80 82 73\n-60 -81 -18\n49 -10 -19\n-58 70 12\n-24 -15 -93\n98 -93 -54\n-28 -75 11\n100 100 -63\n100 100 0\n56 34 0", "output": "YES" }, { "input": "3\n0 2 -2\n1 -1 3\n-3 0 0", "output": "NO" } ]	1,696,516,624	2,147,483,647	PyPy 3-64	OK	TESTS	81	154	0	n = int(input()) a=[0,0,0] for i in range(n): c = [int(x) for x in input().split()] for i in range(3): a[i]+=c[i] print("YES" if (a[0]==0 and a[1]==0 and a[2]==0) else "NO")	Title: Young Physicist Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: 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 Specification: The first line contains a positive integer n (1<=≤<=n<=≤<=100), then follow n lines containing three integers each: the xi coordinate, the yi coordinate and the zi coordinate of the force vector, applied to the body (<=-<=100<=≤<=xi,<=yi,<=zi<=≤<=100). Output Specification: Print the word "YES" if the body is in equilibrium, or the word "NO" if it is not. Demo Input: ['3\n4 1 7\n-2 4 -1\n1 -5 -3\n', '3\n3 -1 7\n-5 2 -4\n2 -1 -3\n'] Demo Output: ['NO', 'YES'] Note: none	```python n = int(input()) a=[0,0,0] for i in range(n): c = [int(x) for x in input().split()] for i in range(3): a[i]+=c[i] print("YES" if (a[0]==0 and a[1]==0 and a[2]==0) else "NO") ```	3.9615
257	B	Playing Cubes	PROGRAMMING	1,300	[ "games", "greedy", "implementation" ]		null	null	Petya and Vasya decided to play a little. They found n red cubes and m blue cubes. The game goes like that: the players take turns to choose a cube of some color (red or blue) and put it in a line from left to right (overall the line will have n<=+<=m cubes). Petya moves first. Petya's task is to get as many pairs of neighbouring cubes of the same color as possible. Vasya's task is to get as many pairs of neighbouring cubes of different colors as possible. The number of Petya's points in the game is the number of pairs of neighboring cubes of the same color in the line, the number of Vasya's points in the game is the number of neighbouring cubes of the different color in the line. Your task is to calculate the score at the end of the game (Petya's and Vasya's points, correspondingly), if both boys are playing optimally well. To "play optimally well" first of all means to maximize the number of one's points, and second — to minimize the number of the opponent's points.	The only line contains two space-separated integers n and m (1<=≤<=n,<=m<=≤<=105) — the number of red and blue cubes, correspondingly.	On a single line print two space-separated integers — the number of Petya's and Vasya's points correspondingly provided that both players play optimally well.	[ "3 1\n", "2 4\n" ]	[ "2 1\n", "3 2\n" ]	In the first test sample the optimal strategy for Petya is to put the blue cube in the line. After that there will be only red cubes left, so by the end of the game the line of cubes from left to right will look as [blue, red, red, red]. So, Petya gets 2 points and Vasya gets 1 point. If Petya would choose the red cube during his first move, then, provided that both boys play optimally well, Petya would get 1 point and Vasya would get 2 points.	500	[ { "input": "3 1", "output": "2 1" }, { "input": "2 4", "output": "3 2" }, { "input": "1 1", "output": "0 1" }, { "input": "2 1", "output": "1 1" }, { "input": "4 4", "output": "3 4" }, { "input": "10 7", "output": "9 7" }, { "input": "5 13", "output": "12 5" }, { "input": "7 11", "output": "10 7" }, { "input": "1 2", "output": "1 1" }, { "input": "10 10", "output": "9 10" }, { "input": "50 30", "output": "49 30" }, { "input": "80 120", "output": "119 80" }, { "input": "304 122", "output": "303 122" }, { "input": "500 800", "output": "799 500" }, { "input": "900 1000", "output": "999 900" }, { "input": "1 1000", "output": "999 1" }, { "input": "997 9", "output": "996 9" }, { "input": "341 678", "output": "677 341" }, { "input": "784 913", "output": "912 784" }, { "input": "57 888", "output": "887 57" }, { "input": "100000 100000", "output": "99999 100000" }, { "input": "10000 100000", "output": "99999 10000" }, { "input": "9999 99999", "output": "99998 9999" }, { "input": "12 100000", "output": "99999 12" }, { "input": "9999 31411", "output": "31410 9999" }, { "input": "12930 98391", "output": "98390 12930" }, { "input": "98813 893", "output": "98812 893" }, { "input": "99801 38179", "output": "99800 38179" }, { "input": "831 69318", "output": "69317 831" }, { "input": "99999 99997", "output": "99998 99997" }, { "input": "74 99", "output": "98 74" }, { "input": "159 259", "output": "258 159" }, { "input": "245 317", "output": "316 245" }, { "input": "947 883", "output": "946 883" }, { "input": "7131 3165", "output": "7130 3165" }, { "input": "11536 12192", "output": "12191 11536" }, { "input": "25938 40897", "output": "40896 25938" }, { "input": "81314 31958", "output": "81313 31958" }, { "input": "294 83621", "output": "83620 294" }, { "input": "64896 18105", "output": "64895 18105" } ]	1,600,451,097	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	5	248	0	n,m=map(int,input().split()) if min(n,m)==1: print (n+m-2,1) else: x=min(n,m) a=x//2+x//2-1 b=2(x//2) x=x%2 y=max(n,m)-(2(x//2)) a=a+1 y=y-1 if x==1: b=b+min(2,x+y) a=a+(n+m-1-a-b) print (a,b)	Title: Playing Cubes Time Limit: None seconds Memory Limit: None megabytes Problem Description: Petya and Vasya decided to play a little. They found n red cubes and m blue cubes. The game goes like that: the players take turns to choose a cube of some color (red or blue) and put it in a line from left to right (overall the line will have n<=+<=m cubes). Petya moves first. Petya's task is to get as many pairs of neighbouring cubes of the same color as possible. Vasya's task is to get as many pairs of neighbouring cubes of different colors as possible. The number of Petya's points in the game is the number of pairs of neighboring cubes of the same color in the line, the number of Vasya's points in the game is the number of neighbouring cubes of the different color in the line. Your task is to calculate the score at the end of the game (Petya's and Vasya's points, correspondingly), if both boys are playing optimally well. To "play optimally well" first of all means to maximize the number of one's points, and second — to minimize the number of the opponent's points. Input Specification: The only line contains two space-separated integers n and m (1<=≤<=n,<=m<=≤<=105) — the number of red and blue cubes, correspondingly. Output Specification: On a single line print two space-separated integers — the number of Petya's and Vasya's points correspondingly provided that both players play optimally well. Demo Input: ['3 1\n', '2 4\n'] Demo Output: ['2 1\n', '3 2\n'] Note: In the first test sample the optimal strategy for Petya is to put the blue cube in the line. After that there will be only red cubes left, so by the end of the game the line of cubes from left to right will look as [blue, red, red, red]. So, Petya gets 2 points and Vasya gets 1 point. If Petya would choose the red cube during his first move, then, provided that both boys play optimally well, Petya would get 1 point and Vasya would get 2 points.	```python n,m=map(int,input().split()) if min(n,m)==1: print (n+m-2,1) else: x=min(n,m) a=x//2+x//2-1 b=2(x//2) x=x%2 y=max(n,m)-(2(x//2)) a=a+1 y=y-1 if x==1: b=b+min(2,x+y) a=a+(n+m-1-a-b) print (a,b) ```	0
633	B	A Trivial Problem	PROGRAMMING	1,300	[ "brute force", "constructive algorithms", "math", "number theory" ]		null	null	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?	The only line of input contains an integer m (1<=≤<=m<=≤<=100<=000) — the required number of trailing zeroes in factorial.	First print k — the number of values of n such that the factorial of n ends with m zeroes. Then print these k integers in increasing order.	[ "1\n", "5\n" ]	[ "5\n5 6 7 8 9 ", "0" ]	The factorial of n is equal to the product of all integers from 1 to n inclusive, that is n! = 1·2·3·...·n. In the first sample, 5! = 120, 6! = 720, 7! = 5040, 8! = 40320 and 9! = 362880.	500	[ { "input": "1", "output": "5\n5 6 7 8 9 " }, { "input": "5", "output": "0" }, { "input": "2", "output": "5\n10 11 12 13 14 " }, { "input": "3", "output": "5\n15 16 17 18 19 " }, { "input": "7", "output": "5\n30 31 32 33 34 " }, { "input": "12", "output": "5\n50 51 52 53 54 " }, { "input": "15", "output": "5\n65 66 67 68 69 " }, { "input": "18", "output": "5\n75 76 77 78 79 " }, { "input": "38", "output": "5\n155 156 157 158 159 " }, { "input": "47", "output": "5\n195 196 197 198 199 " }, { "input": "58", "output": "5\n240 241 242 243 244 " }, { "input": "66", "output": "5\n270 271 272 273 274 " }, { "input": "70", "output": "5\n285 286 287 288 289 " }, { "input": "89", "output": "5\n365 366 367 368 369 " }, { "input": "417", "output": "5\n1675 1676 1677 1678 1679 " }, { "input": "815", "output": "5\n3265 3266 3267 3268 3269 " }, { "input": "394", "output": "5\n1585 1586 1587 1588 1589 " }, { "input": "798", "output": "0" }, { "input": "507", "output": "5\n2035 2036 2037 2038 2039 " }, { "input": "406", "output": "5\n1630 1631 1632 1633 1634 " }, { "input": "570", "output": "5\n2290 2291 2292 2293 2294 " }, { "input": "185", "output": "0" }, { "input": "765", "output": "0" }, { "input": "967", "output": "0" }, { "input": "112", "output": "5\n455 456 457 458 459 " }, { "input": "729", "output": "5\n2925 2926 2927 2928 2929 " }, { "input": "4604", "output": "5\n18425 18426 18427 18428 18429 " }, { "input": "8783", "output": "5\n35140 35141 35142 35143 35144 " }, { "input": "1059", "output": "0" }, { "input": "6641", "output": "5\n26575 26576 26577 26578 26579 " }, { "input": "9353", "output": "5\n37425 37426 37427 37428 37429 " }, { "input": "1811", "output": "5\n7250 7251 7252 7253 7254 " }, { "input": "2528", "output": "0" }, { "input": "8158", "output": "5\n32640 32641 32642 32643 32644 " }, { "input": "3014", "output": "5\n12070 12071 12072 12073 12074 " }, { "input": "7657", "output": "5\n30640 30641 30642 30643 30644 " }, { "input": "4934", "output": "0" }, { "input": "9282", "output": "5\n37140 37141 37142 37143 37144 " }, { "input": "2610", "output": "5\n10450 10451 10452 10453 10454 " }, { "input": "2083", "output": "5\n8345 8346 8347 8348 8349 " }, { "input": "26151", "output": "5\n104620 104621 104622 104623 104624 " }, { "input": "64656", "output": "5\n258640 258641 258642 258643 258644 " }, { "input": "46668", "output": "5\n186690 186691 186692 186693 186694 " }, { "input": "95554", "output": "5\n382235 382236 382237 382238 382239 " }, { "input": "37320", "output": "0" }, { "input": "52032", "output": "5\n208140 208141 208142 208143 208144 " }, { "input": "11024", "output": "5\n44110 44111 44112 44113 44114 " }, { "input": "63218", "output": "5\n252885 252886 252887 252888 252889 " }, { "input": "40095", "output": "5\n160390 160391 160392 160393 160394 " }, { "input": "42724", "output": "5\n170910 170911 170912 170913 170914 " }, { "input": "24381", "output": "5\n97530 97531 97532 97533 97534 " }, { "input": "73138", "output": "5\n292570 292571 292572 292573 292574 " }, { "input": "93346", "output": "5\n373400 373401 373402 373403 373404 " }, { "input": "18338", "output": "5\n73370 73371 73372 73373 73374 " }, { "input": "42662", "output": "5\n170660 170661 170662 170663 170664 " }, { "input": "81221", "output": "5\n324900 324901 324902 324903 324904 " }, { "input": "100000", "output": "5\n400005 400006 400007 400008 400009 " }, { "input": "100000", "output": "5\n400005 400006 400007 400008 400009 " }, { "input": "99998", "output": "0" }, { "input": "30", "output": "0" }, { "input": "11", "output": "0" }, { "input": "780", "output": "0" }, { "input": "97656", "output": "5\n390625 390626 390627 390628 390629 " }, { "input": "12499", "output": "5\n50000 50001 50002 50003 50004 " }, { "input": "65", "output": "5\n265 266 267 268 269 " }, { "input": "41", "output": "5\n170 171 172 173 174 " }, { "input": "31", "output": "5\n125 126 127 128 129 " }, { "input": "86577", "output": "0" } ]	1,457,962,546	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	4	61	0	from math import factorial, pow m=int(input()) i,a=0,0; l=[]; b=True; while (b==True and i<21): j=factorial(i); if(j>=pow(10,m)): if(j%pow(10,m)==0): if(j%pow(10,m+1)!=0): a=a+1; l=l+[i]; i=i+1; b=True; else: b=False; else: i=i+1; b=True; else: i=i+1; b=True; if(a==0): print(a); else: print(a); for k in l: print(k,end=" ");	Title: A Trivial Problem Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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 Specification: The only line of input contains an integer m (1<=≤<=m<=≤<=100<=000) — the required number of trailing zeroes in factorial. Output Specification: First print k — the number of values of n such that the factorial of n ends with m zeroes. Then print these k integers in increasing order. Demo Input: ['1\n', '5\n'] Demo Output: ['5\n5 6 7 8 9 ', '0'] Note: The factorial of n is equal to the product of all integers from 1 to n inclusive, that is n! = 1·2·3·...·n. In the first sample, 5! = 120, 6! = 720, 7! = 5040, 8! = 40320 and 9! = 362880.	```python from math import factorial, pow m=int(input()) i,a=0,0; l=[]; b=True; while (b==True and i<21): j=factorial(i); if(j>=pow(10,m)): if(j%pow(10,m)==0): if(j%pow(10,m+1)!=0): a=a+1; l=l+[i]; i=i+1; b=True; else: b=False; else: i=i+1; b=True; else: i=i+1; b=True; if(a==0): print(a); else: print(a); for k in l: print(k,end=" "); ```	0
343	B	Alternating Current	PROGRAMMING	1,600	[ "data structures", "greedy", "implementation" ]		null	null	Mad scientist Mike has just finished constructing a new device to search for extraterrestrial intelligence! He was in such a hurry to launch it for the first time that he plugged in the power wires without giving it a proper glance and started experimenting right away. After a while Mike observed that the wires ended up entangled and now have to be untangled again. The device is powered by two wires "plus" and "minus". The wires run along the floor from the wall (on the left) to the device (on the right). Both the wall and the device have two contacts in them on the same level, into which the wires are plugged in some order. The wires are considered entangled if there are one or more places where one wire runs above the other one. For example, the picture below has four such places (top view): Mike knows the sequence in which the wires run above each other. Mike also noticed that on the left side, the "plus" wire is always plugged into the top contact (as seen on the picture). He would like to untangle the wires without unplugging them and without moving the device. Determine if it is possible to do that. A wire can be freely moved and stretched on the floor, but cannot be cut. To understand the problem better please read the notes to the test samples.	The single line of the input contains a sequence of characters "+" and "-" of length n (1<=≤<=n<=≤<=100000). The i-th (1<=≤<=i<=≤<=n) position of the sequence contains the character "+", if on the i-th step from the wall the "plus" wire runs above the "minus" wire, and the character "-" otherwise.	Print either "Yes" (without the quotes) if the wires can be untangled or "No" (without the quotes) if the wires cannot be untangled.	[ "-++-\n", "+-\n", "++\n", "-\n" ]	[ "Yes\n", "No\n", "Yes\n", "No\n" ]	The first testcase corresponds to the picture in the statement. To untangle the wires, one can first move the "plus" wire lower, thus eliminating the two crosses in the middle, and then draw it under the "minus" wire, eliminating also the remaining two crosses. In the second testcase the "plus" wire makes one full revolution around the "minus" wire. Thus the wires cannot be untangled: In the third testcase the "plus" wire simply runs above the "minus" wire twice in sequence. The wires can be untangled by lifting "plus" and moving it higher: In the fourth testcase the "minus" wire runs above the "plus" wire once. The wires cannot be untangled without moving the device itself:	1,000	[ { "input": "-++-", "output": "Yes" }, { "input": "+-", "output": "No" }, { "input": "++", "output": "Yes" }, { "input": "-", "output": "No" }, { "input": "+-+-", "output": "No" }, { "input": "-+-", "output": "No" }, { "input": "-++-+--+", "output": "Yes" }, { "input": "+", "output": "No" }, { "input": "-+", "output": "No" }, { "input": "--", "output": "Yes" }, { "input": "+++", "output": "No" }, { "input": "--+", "output": "No" }, { "input": "++--++", "output": "Yes" }, { "input": "+-++-+", "output": "Yes" }, { "input": "+-+--+", "output": "No" }, { "input": "--++-+", "output": "No" }, { "input": "-+-+--", "output": "No" }, { "input": "+-+++-", "output": "No" }, { "input": "-+-+-+", "output": "No" }, { "input": "-++-+--++--+-++-", "output": "Yes" }, { "input": "+-----+-++---+------+++-++++", "output": "No" }, { "input": "-+-++--+++-++++---+--+----+--+-+-+++-+++-+---++-++++-+--+--+--+-+-++-+-+-++++++---++--+++++-+--++--+-+--++-----+--+-++---+++---++----+++-++++--++-++-", "output": "No" }, { "input": "-+-----++++--++-+-++", "output": "Yes" }, { "input": "+--+--+------+++++++-+-+++--++---+--+-+---+--+++-+++-------+++++-+-++++--+-+-+++++++----+----+++----+-+++-+++-----+++-+-++-+-+++++-+--++----+--+-++-----+-+-++++---+++---+-+-+-++++--+--+++---+++++-+---+-----+++-++--+++---++-++-+-+++-+-+-+---+++--+--++++-+-+--++-------+--+---++-----+++--+-+++--++-+-+++-++--+++-++++++++++-++-++++++-+++--+--++-+++--+++-++++----+++---+-+----++++-+-+", "output": "Yes" }, { "input": "-+-+-++-+-+-", "output": "Yes" }, { "input": "-+-++-+-", "output": "Yes" }, { "input": "-+-++-+-+-", "output": "No" }, { "input": "++-+-+-+-+--+", "output": "No" }, { "input": "+++---", "output": "No" }, { "input": "+-+-+-+-+--+-+-+-+-++--++--+", "output": "Yes" }, { "input": "+-+-++", "output": "No" }, { "input": "-++--+--+++-+-+-+-+-", "output": "No" }, { "input": "+---+-+-", "output": "No" }, { "input": "+-+--+-+", "output": "Yes" }, { "input": "+++---+++---", "output": "No" }, { "input": "-+++++", "output": "No" }, { "input": "-+-+-+-+-+-+-++-+-+-+-+-+-+-", "output": "Yes" }, { "input": "-+++--", "output": "No" }, { "input": "+---+", "output": "No" }, { "input": "-++", "output": "No" }, { "input": "-+--+-", "output": "Yes" }, { "input": "+---++--++", "output": "No" }, { "input": "+++-", "output": "No" }, { "input": "--+++", "output": "No" }, { "input": "++-+", "output": "No" } ]	1,385,008,999	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	24	1,000	716,800	#!/usr/bin/env python # -- coding: utf-8 -- import re data = input() prev = None while True: data = re.sub(r'--\|\+\+', '', data) if prev == data: break prev = data if data == '': print('Yes') else: print('No')	Title: Alternating Current Time Limit: None seconds Memory Limit: None megabytes Problem Description: Mad scientist Mike has just finished constructing a new device to search for extraterrestrial intelligence! He was in such a hurry to launch it for the first time that he plugged in the power wires without giving it a proper glance and started experimenting right away. After a while Mike observed that the wires ended up entangled and now have to be untangled again. The device is powered by two wires "plus" and "minus". The wires run along the floor from the wall (on the left) to the device (on the right). Both the wall and the device have two contacts in them on the same level, into which the wires are plugged in some order. The wires are considered entangled if there are one or more places where one wire runs above the other one. For example, the picture below has four such places (top view): Mike knows the sequence in which the wires run above each other. Mike also noticed that on the left side, the "plus" wire is always plugged into the top contact (as seen on the picture). He would like to untangle the wires without unplugging them and without moving the device. Determine if it is possible to do that. A wire can be freely moved and stretched on the floor, but cannot be cut. To understand the problem better please read the notes to the test samples. Input Specification: The single line of the input contains a sequence of characters "+" and "-" of length n (1<=≤<=n<=≤<=100000). The i-th (1<=≤<=i<=≤<=n) position of the sequence contains the character "+", if on the i-th step from the wall the "plus" wire runs above the "minus" wire, and the character "-" otherwise. Output Specification: Print either "Yes" (without the quotes) if the wires can be untangled or "No" (without the quotes) if the wires cannot be untangled. Demo Input: ['-++-\n', '+-\n', '++\n', '-\n'] Demo Output: ['Yes\n', 'No\n', 'Yes\n', 'No\n'] Note: The first testcase corresponds to the picture in the statement. To untangle the wires, one can first move the "plus" wire lower, thus eliminating the two crosses in the middle, and then draw it under the "minus" wire, eliminating also the remaining two crosses. In the second testcase the "plus" wire makes one full revolution around the "minus" wire. Thus the wires cannot be untangled: In the third testcase the "plus" wire simply runs above the "minus" wire twice in sequence. The wires can be untangled by lifting "plus" and moving it higher: In the fourth testcase the "minus" wire runs above the "plus" wire once. The wires cannot be untangled without moving the device itself:	```python #!/usr/bin/env python # -- coding: utf-8 -- import re data = input() prev = None while True: data = re.sub(r'--\|\+\+', '', data) if prev == data: break prev = data if data == '': print('Yes') else: print('No') ```	0
448	A	Rewards	PROGRAMMING	800	[ "implementation" ]		null	null	Bizon the Champion is called the Champion for a reason. Bizon the Champion has recently got a present — a new glass cupboard with n shelves and he decided to put all his presents there. All the presents can be divided into two types: medals and cups. Bizon the Champion has a1 first prize cups, a2 second prize cups and a3 third prize cups. Besides, he has b1 first prize medals, b2 second prize medals and b3 third prize medals. Naturally, the rewards in the cupboard must look good, that's why Bizon the Champion decided to follow the rules: - any shelf cannot contain both cups and medals at the same time; - no shelf can contain more than five cups; - no shelf can have more than ten medals. Help Bizon the Champion find out if we can put all the rewards so that all the conditions are fulfilled.	The first line contains integers a1, a2 and a3 (0<=≤<=a1,<=a2,<=a3<=≤<=100). The second line contains integers b1, b2 and b3 (0<=≤<=b1,<=b2,<=b3<=≤<=100). The third line contains integer n (1<=≤<=n<=≤<=100). The numbers in the lines are separated by single spaces.	Print "YES" (without the quotes) if all the rewards can be put on the shelves in the described manner. Otherwise, print "NO" (without the quotes).	[ "1 1 1\n1 1 1\n4\n", "1 1 3\n2 3 4\n2\n", "1 0 0\n1 0 0\n1\n" ]	[ "YES\n", "YES\n", "NO\n" ]	none	500	[ { "input": "1 1 1\n1 1 1\n4", "output": "YES" }, { "input": "1 1 3\n2 3 4\n2", "output": "YES" }, { "input": "1 0 0\n1 0 0\n1", "output": "NO" }, { "input": "0 0 0\n0 0 0\n1", "output": "YES" }, { "input": "100 100 100\n100 100 100\n100", "output": "YES" }, { "input": "100 100 100\n100 100 100\n1", "output": "NO" }, { "input": "1 10 100\n100 10 1\n20", "output": "NO" }, { "input": "1 1 1\n0 0 0\n1", "output": "YES" }, { "input": "0 0 0\n1 1 1\n1", "output": "YES" }, { "input": "5 5 5\n0 0 0\n2", "output": "NO" }, { "input": "0 0 0\n10 10 10\n2", "output": "NO" }, { "input": "21 61 39\n63 58 69\n44", "output": "YES" }, { "input": "18 95 4\n7 1 75\n46", "output": "YES" }, { "input": "64 27 81\n72 35 23\n48", "output": "YES" }, { "input": "6 6 6\n11 11 11\n7", "output": "NO" }, { "input": "1 2 3\n2 4 6\n3", "output": "NO" }, { "input": "1 2 3\n2 4 6\n4", "output": "YES" }, { "input": "99 99 99\n99 99 99\n89", "output": "NO" }, { "input": "5 0 0\n15 0 0\n2", "output": "NO" }, { "input": "10 10 10\n0 0 0\n1", "output": "NO" }, { "input": "1 1 1\n1 1 1\n15", "output": "YES" }, { "input": "2 3 5\n2 3 5\n2", "output": "NO" }, { "input": "2 2 2\n3 3 5\n3", "output": "NO" }, { "input": "1 2 2\n2 4 4\n1", "output": "NO" }, { "input": "1 2 3\n1 5 5\n2", "output": "NO" } ]	1,667,389,131	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	30	0	arr1 = [int(_) for _ in input().split()] arr2 = [int(_) for _ in input().split()] n = int(input()) s1 = sum(arr1) s2 = sum(arr2) if s1 % 2 == 0: v1 = s1 // 5 else: v1 = s1 // 5 + 1 if s2 % 2 == 0: v2 = s1 // 10 else: v2 = s1 // 10 + 1 if v1+v2 <= n: print('YES') else: print('NO')	Title: Rewards Time Limit: None seconds Memory Limit: None megabytes Problem Description: Bizon the Champion is called the Champion for a reason. Bizon the Champion has recently got a present — a new glass cupboard with n shelves and he decided to put all his presents there. All the presents can be divided into two types: medals and cups. Bizon the Champion has a1 first prize cups, a2 second prize cups and a3 third prize cups. Besides, he has b1 first prize medals, b2 second prize medals and b3 third prize medals. Naturally, the rewards in the cupboard must look good, that's why Bizon the Champion decided to follow the rules: - any shelf cannot contain both cups and medals at the same time; - no shelf can contain more than five cups; - no shelf can have more than ten medals. Help Bizon the Champion find out if we can put all the rewards so that all the conditions are fulfilled. Input Specification: The first line contains integers a1, a2 and a3 (0<=≤<=a1,<=a2,<=a3<=≤<=100). The second line contains integers b1, b2 and b3 (0<=≤<=b1,<=b2,<=b3<=≤<=100). The third line contains integer n (1<=≤<=n<=≤<=100). The numbers in the lines are separated by single spaces. Output Specification: Print "YES" (without the quotes) if all the rewards can be put on the shelves in the described manner. Otherwise, print "NO" (without the quotes). Demo Input: ['1 1 1\n1 1 1\n4\n', '1 1 3\n2 3 4\n2\n', '1 0 0\n1 0 0\n1\n'] Demo Output: ['YES\n', 'YES\n', 'NO\n'] Note: none	```python arr1 = [int(_) for _ in input().split()] arr2 = [int(_) for _ in input().split()] n = int(input()) s1 = sum(arr1) s2 = sum(arr2) if s1 % 2 == 0: v1 = s1 // 5 else: v1 = s1 // 5 + 1 if s2 % 2 == 0: v2 = s1 // 10 else: v2 = s1 // 10 + 1 if v1+v2 <= n: print('YES') else: print('NO') ```	0
441	C	Valera and Tubes	PROGRAMMING	1,500	[ "constructive algorithms", "dfs and similar", "implementation" ]		null	null	Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right. We will represent cell that is on the intersection of row x and column y by a pair of integers (x,<=y). Valera wants to place exactly k tubes on his rectangle table. A tube is such sequence of table cells (x1,<=y1), (x2,<=y2), ..., (xr,<=yr), that: - r<=≥<=2; - for any integer i (1<=≤<=i<=≤<=r<=-<=1) the following equation \|xi<=-<=xi<=+<=1\|<=+<=\|yi<=-<=yi<=+<=1\|<==<=1 holds; - each table cell, which belongs to the tube, must occur exactly once in the sequence. Valera thinks that the tubes are arranged in a fancy manner if the following conditions are fulfilled: - no pair of tubes has common cells; - each cell of the table belongs to some tube. Help Valera to arrange k tubes on his rectangle table in a fancy manner.	The first line contains three space-separated integers n,<=m,<=k (2<=≤<=n,<=m<=≤<=300; 2<=≤<=2k<=≤<=n·m) — the number of rows, the number of columns and the number of tubes, correspondingly.	Print k lines. In the i-th line print the description of the i-th tube: first print integer ri (the number of tube cells), then print 2ri integers xi1,<=yi1,<=xi2,<=yi2,<=...,<=xiri,<=yiri (the sequence of table cells). If there are multiple solutions, you can print any of them. It is guaranteed that at least one solution exists.	[ "3 3 3\n", "2 3 1\n" ]	[ "3 1 1 1 2 1 3\n3 2 1 2 2 2 3\n3 3 1 3 2 3 3\n", "6 1 1 1 2 1 3 2 3 2 2 2 1\n" ]	Picture for the first sample: Picture for the second sample:	1,500	[ { "input": "3 3 3", "output": "3 1 1 1 2 1 3\n3 2 1 2 2 2 3\n3 3 1 3 2 3 3" }, { "input": "2 3 1", "output": "6 1 1 1 2 1 3 2 3 2 2 2 1" }, { "input": "2 3 1", "output": "6 1 1 1 2 1 3 2 3 2 2 2 1" }, { "input": "300 300 2", "output": "2 1 1 1 2\n89998 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61 1 62 1 63 1 64 1 65 1 66 1 67 1 68 1 69 1 70 1 71 1 72 1 73 1 74 1 75 1 76 1 77 1 78 1 79 1 80 1 81 1 82 1 83 1 84 1 85 1 86 1 87 1 88 1 89 1 90 1 91 1 92 1 93 1 94 1 95 1 96 1 97 1 98 1 99 1 100 1 101 1 10..." }, { "input": "300 300 150", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "300 299 299", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "300 300 45000", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "300 299 44850", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "2 2 2", "output": "2 1 1 1 2\n2 2 2 2 1" }, { "input": "2 3 3", "output": "2 1 1 1 2\n2 1 3 2 3\n2 2 2 2 1" }, { "input": "3 3 4", "output": "2 1 1 1 2\n2 1 3 2 3\n2 2 2 2 1\n3 3 1 3 2 3 3" }, { "input": "5 5 12", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 2 5\n2 2 4 2 3\n2 2 2 2 1\n2 3 1 3 2\n2 3 3 3 4\n2 3 5 4 5\n2 4 4 4 3\n2 4 2 4 1\n2 5 1 5 2\n3 5 3 5 4 5 5" }, { "input": "7 5 17", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 2 5\n2 2 4 2 3\n2 2 2 2 1\n2 3 1 3 2\n2 3 3 3 4\n2 3 5 4 5\n2 4 4 4 3\n2 4 2 4 1\n2 5 1 5 2\n2 5 3 5 4\n2 5 5 6 5\n2 6 4 6 3\n2 6 2 6 1\n2 7 1 7 2\n3 7 3 7 4 7 5" }, { "input": "135 91 4352", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "32 27 153", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 2 27\n2 2 26 2 25\n2 2 24 2 23\n2 2 22 2 21\n2 2 20 2 19\n2 2 18 2 17\n2 2 16 2 15\n2 2 14 2 13\n2 2 12 2 11\n2 2 10 2 9\n2 2 8 2 7\n2 2 6 2 5\n2 2 4 2 3\n2 2 2 2 1\n2 3 1 3 2\n2 3 3 3 4\n2 3 5 3 6\n2 3 7 3 8\n2 3 9 3 10\n2 3 11 3 12\n2 3 13 3 14\n2 3 15 3 16\n2 3 17 3 18\n2 3 19 3 20\n2 3 21 3 22\n2 3 23 3 24\n2 3 25 3 26\n2 3 27 4 27\n2 4 2..." }, { "input": "74 83 2667", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "296 218 5275", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "89 82 2330", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "15 68 212", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 2 68 2 67\n2 2 66 2 65\n2 2 64 2 63\n2 2 62 2 61\n2 2 60 2 59\n2 2 58 2 57\n..." }, { "input": "95 4 177", "output": "2 1 1 1 2\n2 1 3 1 4\n2 2 4 2 3\n2 2 2 2 1\n2 3 1 3 2\n2 3 3 3 4\n2 4 4 4 3\n2 4 2 4 1\n2 5 1 5 2\n2 5 3 5 4\n2 6 4 6 3\n2 6 2 6 1\n2 7 1 7 2\n2 7 3 7 4\n2 8 4 8 3\n2 8 2 8 1\n2 9 1 9 2\n2 9 3 9 4\n2 10 4 10 3\n2 10 2 10 1\n2 11 1 11 2\n2 11 3 11 4\n2 12 4 12 3\n2 12 2 12 1\n2 13 1 13 2\n2 13 3 13 4\n2 14 4 14 3\n2 14 2 14 1\n2 15 1 15 2\n2 15 3 15 4\n2 16 4 16 3\n2 16 2 16 1\n2 17 1 17 2\n2 17 3 17 4\n2 18 4 18 3\n2 18 2 18 1\n2 19 1 19 2\n2 19 3 19 4\n2 20 4 20 3\n2 20 2 20 1\n2 21 1 21 2\n2 21 3 21 4\n2..." }, { "input": "60 136 8", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n8146 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61 1 62 1 63 1 64 1 65 1 66 1 67 1 68 1 69 1 70 1 71 1 72 1 73 1 74 1 75 1 76 1 77 1 78 1 79 1 80 1 81 1 82 1 83 1 84 1 85 1 86 1 87 1 88 1 89 1 90 1 91 1 92 1 93 1 94 1 95 1 96 1 97 1 98 1 99..." }, { "input": "91 183 7827", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "2 15 3", "output": "2 1 1 1 2\n2 1 3 1 4\n26 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 2 15 2 14 2 13 2 12 2 11 2 10 2 9 2 8 2 7 2 6 2 5 2 4 2 3 2 2 2 1" }, { "input": "139 275 10770", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "114 298 7143", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "260 182 9496", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "42 297 3703", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "236 156 9535", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "201 226 1495", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "299 299 100", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "299 298 100", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "298 299 100", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "299 299 2", "output": "2 1 1 1 2\n89399 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61 1 62 1 63 1 64 1 65 1 66 1 67 1 68 1 69 1 70 1 71 1 72 1 73 1 74 1 75 1 76 1 77 1 78 1 79 1 80 1 81 1 82 1 83 1 84 1 85 1 86 1 87 1 88 1 89 1 90 1 91 1 92 1 93 1 94 1 95 1 96 1 97 1 98 1 99 1 100 1 101 1 10..." }, { "input": "299 299 1", "output": "89401 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61 1 62 1 63 1 64 1 65 1 66 1 67 1 68 1 69 1 70 1 71 1 72 1 73 1 74 1 75 1 76 1 77 1 78 1 79 1 80 1 81 1 82 1 83 1 84 1 85 1 86 1 87 1 88 1 89 1 90 1 91 1 92 1 93 1 94 1 95 1 96 1 97 1 98 1 99 1 100 1 101 1 102 1..." }, { "input": "298 299 1", "output": "89102 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61 1 62 1 63 1 64 1 65 1 66 1 67 1 68 1 69 1 70 1 71 1 72 1 73 1 74 1 75 1 76 1 77 1 78 1 79 1 80 1 81 1 82 1 83 1 84 1 85 1 86 1 87 1 88 1 89 1 90 1 91 1 92 1 93 1 94 1 95 1 96 1 97 1 98 1 99 1 100 1 101 1 102 1..." }, { "input": "299 298 11", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n89082 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61 1 62 1 63 1 64 1 65 1 66 1 67 1 68 1 69 1 70 1 71 1 72 1 73 1 74 1 75 1 76 1 77 1 78 1 79 1 80 1 81 1 82 1 83 1 84 1 85 1 86 1 87 1 88 1 89 1 90 1 91 1 92 1 93 1 94 1 95 1 96 1 97..." }, { "input": "298 300 12", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n89378 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61 1 62 1 63 1 64 1 65 1 66 1 67 1 68 1 69 1 70 1 71 1 72 1 73 1 74 1 75 1 76 1 77 1 78 1 79 1 80 1 81 1 82 1 83 1 84 1 85 1 86 1 87 1 88 1 89 1 90 1 91 1 92 1 93 1 94 1 95 1 96 1..." }, { "input": "298 2 1", "output": "596 1 1 1 2 2 2 2 1 3 1 3 2 4 2 4 1 5 1 5 2 6 2 6 1 7 1 7 2 8 2 8 1 9 1 9 2 10 2 10 1 11 1 11 2 12 2 12 1 13 1 13 2 14 2 14 1 15 1 15 2 16 2 16 1 17 1 17 2 18 2 18 1 19 1 19 2 20 2 20 1 21 1 21 2 22 2 22 1 23 1 23 2 24 2 24 1 25 1 25 2 26 2 26 1 27 1 27 2 28 2 28 1 29 1 29 2 30 2 30 1 31 1 31 2 32 2 32 1 33 1 33 2 34 2 34 1 35 1 35 2 36 2 36 1 37 1 37 2 38 2 38 1 39 1 39 2 40 2 40 1 41 1 41 2 42 2 42 1 43 1 43 2 44 2 44 1 45 1 45 2 46 2 46 1 47 1 47 2 48 2 48 1 49 1 49 2 50 2 50 1 51 1 51 2 52 2 52 1 53 1 ..." }, { "input": "2 298 1", "output": "596 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61 1 62 1 63 1 64 1 65 1 66 1 67 1 68 1 69 1 70 1 71 1 72 1 73 1 74 1 75 1 76 1 77 1 78 1 79 1 80 1 81 1 82 1 83 1 84 1 85 1 86 1 87 1 88 1 89 1 90 1 91 1 92 1 93 1 94 1 95 1 96 1 97 1 98 1 99 1 100 1 101 1 102 1 1..." }, { "input": "300 300 500", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "300 300 501", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "300 300 44999", "output": "2 1 1 1 2\n2 1 3 1 4\n2 1 5 1 6\n2 1 7 1 8\n2 1 9 1 10\n2 1 11 1 12\n2 1 13 1 14\n2 1 15 1 16\n2 1 17 1 18\n2 1 19 1 20\n2 1 21 1 22\n2 1 23 1 24\n2 1 25 1 26\n2 1 27 1 28\n2 1 29 1 30\n2 1 31 1 32\n2 1 33 1 34\n2 1 35 1 36\n2 1 37 1 38\n2 1 39 1 40\n2 1 41 1 42\n2 1 43 1 44\n2 1 45 1 46\n2 1 47 1 48\n2 1 49 1 50\n2 1 51 1 52\n2 1 53 1 54\n2 1 55 1 56\n2 1 57 1 58\n2 1 59 1 60\n2 1 61 1 62\n2 1 63 1 64\n2 1 65 1 66\n2 1 67 1 68\n2 1 69 1 70\n2 1 71 1 72\n2 1 73 1 74\n2 1 75 1 76\n2 1 77 1 78\n2 1 79 1 80\n..." }, { "input": "5 5 3", "output": "2 1 1 1 2\n2 1 3 1 4\n21 1 5 2 5 2 4 2 3 2 2 2 1 3 1 3 2 3 3 3 4 3 5 4 5 4 4 4 3 4 2 4 1 5 1 5 2 5 3 5 4 5 5" }, { "input": "2 4 3", "output": "2 1 1 1 2\n2 1 3 1 4\n4 2 4 2 3 2 2 2 1" } ]	1,571,144,134	2,147,483,647	PyPy 3	OK	TESTS	44	296	13,414,400	n,m,k=map(int,input().split()) ans=[] curr=1 #fwd now=[1,1] tr=[] tr.append(now) z=nm while z : z-=1 x=now[0] y=now[1] if curr==1: if y+1>m: #y-=1 x+=1 curr=-1 else: x+=0 y+=1 #curr=-1 now=[x,y] else: if y==1: # y-=1 x+=1 curr=1 else: x+=0 y-=1 now=[x,y] tr.append(now) le=nm j=0 ans=tr[:] sm=0 while k>1: print(2,ans[j][0],ans[j][1],ans[j+1][0],ans[j+1][1]) k-=1 j+=2 sm+=2 rem=nm-sm print(rem,end=' ') for k in range(j,nm): print(ans[k][0],ans[k][1],end=' ')	Title: Valera and Tubes Time Limit: None seconds Memory Limit: None megabytes Problem Description: Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right. We will represent cell that is on the intersection of row x and column y by a pair of integers (x,<=y). Valera wants to place exactly k tubes on his rectangle table. A tube is such sequence of table cells (x1,<=y1), (x2,<=y2), ..., (xr,<=yr), that: - r<=≥<=2; - for any integer i (1<=≤<=i<=≤<=r<=-<=1) the following equation \|xi<=-<=xi<=+<=1\|<=+<=\|yi<=-<=yi<=+<=1\|<==<=1 holds; - each table cell, which belongs to the tube, must occur exactly once in the sequence. Valera thinks that the tubes are arranged in a fancy manner if the following conditions are fulfilled: - no pair of tubes has common cells; - each cell of the table belongs to some tube. Help Valera to arrange k tubes on his rectangle table in a fancy manner. Input Specification: The first line contains three space-separated integers n,<=m,<=k (2<=≤<=n,<=m<=≤<=300; 2<=≤<=2k<=≤<=n·m) — the number of rows, the number of columns and the number of tubes, correspondingly. Output Specification: Print k lines. In the i-th line print the description of the i-th tube: first print integer ri (the number of tube cells), then print 2ri integers xi1,<=yi1,<=xi2,<=yi2,<=...,<=xiri,<=yiri (the sequence of table cells). If there are multiple solutions, you can print any of them. It is guaranteed that at least one solution exists. Demo Input: ['3 3 3\n', '2 3 1\n'] Demo Output: ['3 1 1 1 2 1 3\n3 2 1 2 2 2 3\n3 3 1 3 2 3 3\n', '6 1 1 1 2 1 3 2 3 2 2 2 1\n'] Note: Picture for the first sample: Picture for the second sample:	```python n,m,k=map(int,input().split()) ans=[] curr=1 #fwd now=[1,1] tr=[] tr.append(now) z=nm while z : z-=1 x=now[0] y=now[1] if curr==1: if y+1>m: #y-=1 x+=1 curr=-1 else: x+=0 y+=1 #curr=-1 now=[x,y] else: if y==1: # y-=1 x+=1 curr=1 else: x+=0 y-=1 now=[x,y] tr.append(now) le=nm j=0 ans=tr[:] sm=0 while k>1: print(2,ans[j][0],ans[j][1],ans[j+1][0],ans[j+1][1]) k-=1 j+=2 sm+=2 rem=nm-sm print(rem,end=' ') for k in range(j,nm): print(ans[k][0],ans[k][1],end=' ') ```	3
576	A	Vasya and Petya's Game	PROGRAMMING	1,500	[ "math", "number theory" ]		null	null	Vasya and Petya are playing a simple game. Vasya thought of number x between 1 and n, and Petya tries to guess the number. Petya can ask questions like: "Is the unknown number divisible by number y?". The game is played by the following rules: first Petya asks all the questions that interest him (also, he can ask no questions), and then Vasya responds to each question with a 'yes' or a 'no'. After receiving all the answers Petya should determine the number that Vasya thought of. Unfortunately, Petya is not familiar with the number theory. Help him find the minimum number of questions he should ask to make a guaranteed guess of Vasya's number, and the numbers yi, he should ask the questions about.	A single line contains number n (1<=≤<=n<=≤<=103).	Print the length of the sequence of questions k (0<=≤<=k<=≤<=n), followed by k numbers — the questions yi (1<=≤<=yi<=≤<=n). If there are several correct sequences of questions of the minimum length, you are allowed to print any of them.	[ "4\n", "6\n" ]	[ "3\n2 4 3 \n", "4\n2 4 3 5 \n" ]	The sequence from the answer to the first sample test is actually correct. If the unknown number is not divisible by one of the sequence numbers, it is equal to 1. If the unknown number is divisible by 4, it is 4. If the unknown number is divisible by 3, then the unknown number is 3. Otherwise, it is equal to 2. Therefore, the sequence of questions allows you to guess the unknown number. It can be shown that there is no correct sequence of questions of length 2 or shorter.	500	[ { "input": "4", "output": "3\n2 4 3 " }, { "input": "6", "output": "4\n2 4 3 5 " }, { "input": "1", "output": "0" }, { "input": "15", "output": "9\n2 4 8 3 9 5 7 11 13 " }, { "input": "19", "output": "12\n2 4 8 16 3 9 5 7 11 13 17 19 " }, { "input": "20", "output": "12\n2 4 8 16 3 9 5 7 11 13 17 19 " }, { "input": "37", "output": "19\n2 4 8 16 32 3 9 27 5 25 7 11 13 17 19 23 29 31 37 " }, { "input": "211", "output": "61\n2 4 8 16 32 64 128 3 9 27 81 5 25 125 7 49 11 121 13 169 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 " }, { "input": "557", "output": "123\n2 4 8 16 32 64 128 256 512 3 9 27 81 243 5 25 125 7 49 343 11 121 13 169 17 289 19 361 23 529 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 " }, { "input": "907", "output": "179\n2 4 8 16 32 64 128 256 512 3 9 27 81 243 729 5 25 125 625 7 49 343 11 121 13 169 17 289 19 361 23 529 29 841 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 ..." }, { "input": "953", "output": "186\n2 4 8 16 32 64 128 256 512 3 9 27 81 243 729 5 25 125 625 7 49 343 11 121 13 169 17 289 19 361 23 529 29 841 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 ..." }, { "input": "289", "output": "78\n2 4 8 16 32 64 128 256 3 9 27 81 243 5 25 125 7 49 11 121 13 169 17 289 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 " }, { "input": "400", "output": "97\n2 4 8 16 32 64 128 256 3 9 27 81 243 5 25 125 7 49 343 11 121 13 169 17 289 19 361 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 " }, { "input": "900", "output": "178\n2 4 8 16 32 64 128 256 512 3 9 27 81 243 729 5 25 125 625 7 49 343 11 121 13 169 17 289 19 361 23 529 29 841 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 ..." }, { "input": "625", "output": "136\n2 4 8 16 32 64 128 256 512 3 9 27 81 243 5 25 125 625 7 49 343 11 121 13 169 17 289 19 361 23 529 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 619 " }, { "input": "729", "output": "152\n2 4 8 16 32 64 128 256 512 3 9 27 81 243 729 5 25 125 625 7 49 343 11 121 13 169 17 289 19 361 23 529 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 619 ..." }, { "input": "784", "output": "160\n2 4 8 16 32 64 128 256 512 3 9 27 81 243 729 5 25 125 625 7 49 343 11 121 13 169 17 289 19 361 23 529 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 619 ..." }, { "input": "31", "output": "17\n2 4 8 16 3 9 27 5 25 7 11 13 17 19 23 29 31 " }, { "input": "44", "output": "21\n2 4 8 16 32 3 9 27 5 25 7 11 13 17 19 23 29 31 37 41 43 " }, { "input": "160", "output": "50\n2 4 8 16 32 64 128 3 9 27 81 5 25 125 7 49 11 121 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 " }, { "input": "322", "output": "83\n2 4 8 16 32 64 128 256 3 9 27 81 243 5 25 125 7 49 11 121 13 169 17 289 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 " }, { "input": "894", "output": "178\n2 4 8 16 32 64 128 256 512 3 9 27 81 243 729 5 25 125 625 7 49 343 11 121 13 169 17 289 19 361 23 529 29 841 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 ..." }, { "input": "998", "output": "193\n2 4 8 16 32 64 128 256 512 3 9 27 81 243 729 5 25 125 625 7 49 343 11 121 13 169 17 289 19 361 23 529 29 841 31 961 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 ..." }, { "input": "1000", "output": "193\n2 4 8 16 32 64 128 256 512 3 9 27 81 243 729 5 25 125 625 7 49 343 11 121 13 169 17 289 19 361 23 529 29 841 31 961 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 ..." }, { "input": "1000", "output": "193\n2 4 8 16 32 64 128 256 512 3 9 27 81 243 729 5 25 125 625 7 49 343 11 121 13 169 17 289 19 361 23 529 29 841 31 961 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 ..." }, { "input": "30", "output": "16\n2 4 8 16 3 9 27 5 25 7 11 13 17 19 23 29 " } ]	1,665,182,412	2,147,483,647	PyPy 3-64	OK	TESTS	26	62	1,638,400	import math n = int(input()) l = [] for i in range(2, n+1): ok = 1 for j in l: if(i%j == 0): ok = 0 break if(ok == 1): l.append(i) final = [] contador = 0 for i in l: v = i final.append(v) contador += 1 while v * i <= n: v = i final.append(v) contador += 1 print(contador) print(final)	Title: Vasya and Petya's Game Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya and Petya are playing a simple game. Vasya thought of number x between 1 and n, and Petya tries to guess the number. Petya can ask questions like: "Is the unknown number divisible by number y?". The game is played by the following rules: first Petya asks all the questions that interest him (also, he can ask no questions), and then Vasya responds to each question with a 'yes' or a 'no'. After receiving all the answers Petya should determine the number that Vasya thought of. Unfortunately, Petya is not familiar with the number theory. Help him find the minimum number of questions he should ask to make a guaranteed guess of Vasya's number, and the numbers yi, he should ask the questions about. Input Specification: A single line contains number n (1<=≤<=n<=≤<=103). Output Specification: Print the length of the sequence of questions k (0<=≤<=k<=≤<=n), followed by k numbers — the questions yi (1<=≤<=yi<=≤<=n). If there are several correct sequences of questions of the minimum length, you are allowed to print any of them. Demo Input: ['4\n', '6\n'] Demo Output: ['3\n2 4 3 \n', '4\n2 4 3 5 \n'] Note: The sequence from the answer to the first sample test is actually correct. If the unknown number is not divisible by one of the sequence numbers, it is equal to 1. If the unknown number is divisible by 4, it is 4. If the unknown number is divisible by 3, then the unknown number is 3. Otherwise, it is equal to 2. Therefore, the sequence of questions allows you to guess the unknown number. It can be shown that there is no correct sequence of questions of length 2 or shorter.	```python import math n = int(input()) l = [] for i in range(2, n+1): ok = 1 for j in l: if(i%j == 0): ok = 0 break if(ok == 1): l.append(i) final = [] contador = 0 for i in l: v = i final.append(v) contador += 1 while v * i <= n: v = i final.append(v) contador += 1 print(contador) print(final) ```	3
116	A	Tram	PROGRAMMING	800	[ "implementation" ]		null	null	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 ai passengers exit the tram, while bi 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. Your 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.	The first line contains a single number n (2<=≤<=n<=≤<=1000) — the number of the tram's stops. Then n lines follow, each contains two integers ai and bi (0<=≤<=ai,<=bi<=≤<=1000) — the number of passengers that exits the tram at the i-th stop, and the number of passengers that enter the tram at the i-th stop. The stops are given from the first to the last stop in the order of tram's movement. - The number of people who exit at a given stop does not exceed the total number of people in the tram immediately before it arrives at the stop. More formally, . This particularly means that a1<==<=0. - At the last stop, all the passengers exit the tram and it becomes empty. More formally, . - No passenger will enter the train at the last stop. That is, bn<==<=0.	Print a single integer denoting the minimum possible capacity of the tram (0 is allowed).	[ "4\n0 3\n2 5\n4 2\n4 0\n" ]	[ "6\n" ]	For the first example, a capacity of 6 is sufficient: - At the first stop, the number of passengers inside the tram before arriving is 0. Then, 3 passengers enter the tram, and the number of passengers inside the tram becomes 3. - At the second stop, 2 passengers exit the tram (1 passenger remains inside). Then, 5 passengers enter the tram. There are 6 passengers inside the tram now. - At the third stop, 4 passengers exit the tram (2 passengers remain inside). Then, 2 passengers enter the tram. There are 4 passengers inside the tram now. - Finally, all the remaining passengers inside the tram exit the tram at the last stop. There are no passenger inside the tram now, which is in line with the constraints. Since the number of passengers inside the tram never exceeds 6, a capacity of 6 is sufficient. Furthermore it is not possible for the tram to have a capacity less than 6. Hence, 6 is the correct answer.	500	[ { "input": "4\n0 3\n2 5\n4 2\n4 0", "output": "6" }, { "input": "5\n0 4\n4 6\n6 5\n5 4\n4 0", "output": "6" }, { "input": "10\n0 5\n1 7\n10 8\n5 3\n0 5\n3 3\n8 8\n0 6\n10 1\n9 0", "output": "18" }, { "input": "3\n0 1\n1 1\n1 0", "output": "1" }, { "input": "4\n0 1\n0 1\n1 0\n1 0", "output": "2" }, { "input": "3\n0 0\n0 0\n0 0", "output": "0" }, { "input": "3\n0 1000\n1000 1000\n1000 0", "output": "1000" }, { "input": "5\n0 73\n73 189\n189 766\n766 0\n0 0", "output": "766" }, { "input": "5\n0 0\n0 0\n0 0\n0 1\n1 0", "output": "1" }, { "input": "5\n0 917\n917 923\n904 992\n1000 0\n11 0", "output": "1011" }, { "input": "5\n0 1\n1 2\n2 1\n1 2\n2 0", "output": "2" }, { "input": "5\n0 0\n0 0\n0 0\n0 0\n0 0", "output": "0" }, { "input": "20\n0 7\n2 1\n2 2\n5 7\n2 6\n6 10\n2 4\n0 4\n7 4\n8 0\n10 6\n2 1\n6 1\n1 7\n0 3\n8 7\n6 3\n6 3\n1 1\n3 0", "output": "22" }, { "input": "5\n0 1000\n1000 1000\n1000 1000\n1000 1000\n1000 0", "output": "1000" }, { "input": "10\n0 592\n258 598\n389 203\n249 836\n196 635\n478 482\n994 987\n1000 0\n769 0\n0 0", "output": "1776" }, { "input": "10\n0 1\n1 0\n0 0\n0 0\n0 0\n0 1\n1 1\n0 1\n1 0\n1 0", "output": "2" }, { "input": "10\n0 926\n926 938\n938 931\n931 964\n937 989\n983 936\n908 949\n997 932\n945 988\n988 0", "output": "1016" }, { "input": "10\n0 1\n1 2\n1 2\n2 2\n2 2\n2 2\n1 1\n1 1\n2 1\n2 0", "output": "3" }, { "input": "10\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0", "output": "0" }, { "input": "10\n0 1000\n1000 1000\n1000 1000\n1000 1000\n1000 1000\n1000 1000\n1000 1000\n1000 1000\n1000 1000\n1000 0", "output": "1000" }, { "input": "50\n0 332\n332 268\n268 56\n56 711\n420 180\n160 834\n149 341\n373 777\n763 93\n994 407\n86 803\n700 132\n471 608\n429 467\n75 5\n638 305\n405 853\n316 478\n643 163\n18 131\n648 241\n241 766\n316 847\n640 380\n923 759\n789 41\n125 421\n421 9\n9 388\n388 829\n408 108\n462 856\n816 411\n518 688\n290 7\n405 912\n397 772\n396 652\n394 146\n27 648\n462 617\n514 433\n780 35\n710 705\n460 390\n194 508\n643 56\n172 469\n1000 0\n194 0", "output": "2071" }, { "input": "50\n0 0\n0 1\n1 1\n0 1\n0 0\n1 0\n0 0\n1 0\n0 0\n0 0\n0 0\n0 0\n0 1\n0 0\n0 0\n0 1\n1 0\n0 1\n0 0\n1 1\n1 0\n0 1\n0 0\n1 1\n0 1\n1 0\n1 1\n1 0\n0 0\n1 1\n1 0\n0 1\n0 0\n0 1\n1 1\n1 1\n1 1\n1 0\n1 1\n1 0\n0 1\n1 0\n0 0\n0 1\n1 1\n1 1\n0 1\n0 0\n1 0\n1 0", "output": "3" }, { "input": "50\n0 926\n926 971\n915 980\n920 965\n954 944\n928 952\n955 980\n916 980\n906 935\n944 913\n905 923\n912 922\n965 934\n912 900\n946 930\n931 983\n979 905\n925 969\n924 926\n910 914\n921 977\n934 979\n962 986\n942 909\n976 903\n982 982\n991 941\n954 929\n902 980\n947 983\n919 924\n917 943\n916 905\n907 913\n964 977\n984 904\n905 999\n950 970\n986 906\n993 970\n960 994\n963 983\n918 986\n980 900\n931 986\n993 997\n941 909\n907 909\n1000 0\n278 0", "output": "1329" }, { "input": "2\n0 863\n863 0", "output": "863" }, { "input": "50\n0 1\n1 2\n2 2\n1 1\n1 1\n1 2\n1 2\n1 1\n1 2\n1 1\n1 1\n1 2\n1 2\n1 1\n2 1\n2 2\n1 2\n2 2\n1 2\n2 1\n2 1\n2 2\n2 1\n1 2\n1 2\n2 1\n1 1\n2 2\n1 1\n2 1\n2 2\n2 1\n1 2\n2 2\n1 2\n1 1\n1 1\n2 1\n2 1\n2 2\n2 1\n2 1\n1 2\n1 2\n1 2\n1 2\n2 0\n2 0\n2 0\n0 0", "output": "8" }, { "input": "50\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0", "output": "0" }, { "input": "100\n0 1\n0 0\n0 0\n1 0\n0 0\n0 1\n0 1\n1 1\n0 0\n0 0\n1 1\n0 0\n1 1\n0 1\n1 1\n0 1\n1 1\n1 0\n1 0\n0 0\n1 0\n0 1\n1 0\n0 0\n0 0\n1 1\n1 1\n0 1\n0 0\n1 0\n1 1\n0 1\n1 0\n1 1\n0 1\n1 1\n1 0\n0 0\n0 0\n0 1\n0 0\n0 1\n1 1\n0 0\n1 1\n1 1\n0 0\n0 1\n1 0\n0 1\n0 0\n0 1\n0 1\n1 1\n1 1\n1 1\n0 0\n0 0\n1 1\n0 1\n0 1\n1 0\n0 0\n0 0\n1 1\n0 1\n0 1\n1 1\n1 1\n0 1\n1 1\n1 1\n0 0\n1 0\n0 1\n0 0\n0 0\n1 1\n1 1\n1 1\n1 1\n0 1\n1 0\n1 0\n1 0\n1 0\n1 0\n0 0\n1 0\n1 0\n0 0\n1 0\n0 0\n0 1\n1 0\n0 1\n1 0\n1 0\n1 0\n1 0", "output": "11" }, { "input": "100\n0 2\n1 2\n2 1\n1 2\n1 2\n2 1\n2 2\n1 1\n1 1\n2 1\n1 2\n2 1\n1 2\n2 2\n2 2\n2 2\n1 2\n2 2\n2 1\n1 1\n1 1\n1 1\n2 2\n1 2\n2 2\n1 1\n1 1\n1 1\n1 1\n2 2\n1 2\n2 1\n1 1\n2 2\n1 1\n2 1\n1 1\n2 2\n2 1\n1 2\n1 1\n1 2\n2 1\n2 2\n1 1\n2 1\n1 1\n2 1\n1 1\n1 2\n2 2\n2 2\n1 1\n2 2\n1 2\n2 1\n2 1\n1 1\n1 1\n1 2\n1 2\n1 1\n1 1\n2 1\n1 2\n1 2\n2 1\n2 2\n2 2\n2 2\n2 1\n2 2\n1 1\n1 2\n1 2\n1 1\n2 2\n2 2\n1 1\n2 1\n1 1\n1 2\n1 2\n1 2\n1 1\n1 1\n2 2\n1 2\n2 1\n2 1\n2 1\n1 2\n1 2\n1 1\n2 2\n1 2\n2 0\n2 0\n2 0\n1 0", "output": "7" }, { "input": "100\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0", "output": "0" }, { "input": "2\n0 1\n1 0", "output": "1" }, { "input": "2\n0 900\n900 0", "output": "900" }, { "input": "2\n0 1\n1 0", "output": "1" }, { "input": "2\n0 0\n0 0", "output": "0" }, { "input": "2\n0 1000\n1000 0", "output": "1000" }, { "input": "3\n0 802\n175 188\n815 0", "output": "815" }, { "input": "3\n0 910\n910 976\n976 0", "output": "976" }, { "input": "3\n0 2\n2 1\n1 0", "output": "2" } ]	1,687,611,368	2,147,483,647	Python 3	OK	TESTS	71	92	0	n=int(input()) total=0 maxi=0 for i in range(n): a,b=[int(i) for i in input().split()] total-=a total+=b if maxi<=total: maxi=total print(maxi)	Title: Tram Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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 ai passengers exit the tram, while bi 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. Your 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 Specification: The first line contains a single number n (2<=≤<=n<=≤<=1000) — the number of the tram's stops. Then n lines follow, each contains two integers ai and bi (0<=≤<=ai,<=bi<=≤<=1000) — the number of passengers that exits the tram at the i-th stop, and the number of passengers that enter the tram at the i-th stop. The stops are given from the first to the last stop in the order of tram's movement. - The number of people who exit at a given stop does not exceed the total number of people in the tram immediately before it arrives at the stop. More formally, . This particularly means that a1<==<=0. - At the last stop, all the passengers exit the tram and it becomes empty. More formally, . - No passenger will enter the train at the last stop. That is, bn<==<=0. Output Specification: Print a single integer denoting the minimum possible capacity of the tram (0 is allowed). Demo Input: ['4\n0 3\n2 5\n4 2\n4 0\n'] Demo Output: ['6\n'] Note: For the first example, a capacity of 6 is sufficient: - At the first stop, the number of passengers inside the tram before arriving is 0. Then, 3 passengers enter the tram, and the number of passengers inside the tram becomes 3. - At the second stop, 2 passengers exit the tram (1 passenger remains inside). Then, 5 passengers enter the tram. There are 6 passengers inside the tram now. - At the third stop, 4 passengers exit the tram (2 passengers remain inside). Then, 2 passengers enter the tram. There are 4 passengers inside the tram now. - Finally, all the remaining passengers inside the tram exit the tram at the last stop. There are no passenger inside the tram now, which is in line with the constraints. Since the number of passengers inside the tram never exceeds 6, a capacity of 6 is sufficient. Furthermore it is not possible for the tram to have a capacity less than 6. Hence, 6 is the correct answer.	```python n=int(input()) total=0 maxi=0 for i in range(n): a,b=[int(i) for i in input().split()] total-=a total+=b if maxi<=total: maxi=total print(maxi) ```	3
443	A	Anton and Letters	PROGRAMMING	800	[ "constructive algorithms", "implementation" ]		null	null	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. Unfortunately, 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.	The first and the single line contains the set of letters. The length of the line doesn't exceed 1000. It is guaranteed that the line starts from an opening curved bracket and ends with a closing curved bracket. Between them, small English letters are listed, separated by a comma. Each comma is followed by a space.	Print a single number — the number of distinct letters in Anton's set.	[ "{a, b, c}\n", "{b, a, b, a}\n", "{}\n" ]	[ "3\n", "2\n", "0\n" ]	none	500	[ { "input": "{a, b, c}", "output": "3" }, { "input": "{b, a, b, a}", "output": "2" }, { "input": "{}", "output": "0" }, { "input": "{a, a, c, b, b, b, c, c, c, c}", "output": "3" }, { "input": "{a, c, b, b}", "output": "3" }, { "input": "{a, b}", "output": "2" }, { "input": "{a}", "output": "1" }, { "input": "{b, a, b, a, b, c, c, b, c, b}", "output": "3" }, { "input": "{e, g, c, e}", "output": "3" }, { "input": "{a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a, a}", "output": "1" }, { "input": "{a, a, b}", "output": "2" }, { "input": "{a, b, b, b, a, b, a, a, a, a, a, a, b, a, b, a, a, a, a, a, b, a, b, a}", "output": "2" }, { "input": "{j, u, a, c, f, w, e, w, x, t, h, p, v, n, i, l, x, n, i, b, u, c, a, a}", "output": "16" }, { "input": "{x, i, w, c, p, e, h, z, k, i}", "output": "9" }, { "input": "{t, k, o, x, r, d, q, j, k, e, z, w, y, r, z, s, s, e, s, b, k, i}", "output": "15" }, { "input": "{y}", "output": "1" }, { "input": "{x}", "output": "1" }, { "input": "{b, z, a, z}", "output": "3" }, { "input": "{z}", "output": "1" }, { "input": "{a, z}", "output": "2" }, { "input": "{a, b, z}", "output": "3" }, { "input": "{s, q, z, r, t, a, b, h, j, i, o, z, r, q}", "output": "11" } ]	1,692,350,917	2,147,483,647	PyPy 3	OK	TESTS	27	93	0	x=input() C=len(set(x)) if C==2: print(0) elif C==3: print(1) else:print(C-4)	Title: Anton and Letters Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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. Unfortunately, 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 Specification: The first and the single line contains the set of letters. The length of the line doesn't exceed 1000. It is guaranteed that the line starts from an opening curved bracket and ends with a closing curved bracket. Between them, small English letters are listed, separated by a comma. Each comma is followed by a space. Output Specification: Print a single number — the number of distinct letters in Anton's set. Demo Input: ['{a, b, c}\n', '{b, a, b, a}\n', '{}\n'] Demo Output: ['3\n', '2\n', '0\n'] Note: none	```python x=input() C=len(set(x)) if C==2: print(0) elif C==3: print(1) else:print(C-4) ```	3
58	A	Chat room	PROGRAMMING	1,000	[ "greedy", "strings" ]	A. Chat room	1	256	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.	The first and only line contains the word s, which Vasya typed. This word consisits of small Latin letters, its length is no less that 1 and no more than 100 letters.	If Vasya managed to say hello, print "YES", otherwise print "NO".	[ "ahhellllloou\n", "hlelo\n" ]	[ "YES\n", "NO\n" ]	none	500	[ { "input": "ahhellllloou", "output": "YES" }, { "input": "hlelo", "output": "NO" }, { "input": "helhcludoo", "output": "YES" }, { "input": "hehwelloho", "output": "YES" }, { "input": "pnnepelqomhhheollvlo", "output": "YES" }, { "input": "tymbzjyqhymedasloqbq", "output": "NO" }, { "input": "yehluhlkwo", "output": "NO" }, { "input": "hatlevhhalrohairnolsvocafgueelrqmlqlleello", "output": "YES" }, { "input": "hhhtehdbllnhwmbyhvelqqyoulretpbfokflhlhreeflxeftelziclrwllrpflflbdtotvlqgoaoqldlroovbfsq", "output": "YES" }, { "input": "rzlvihhghnelqtwlexmvdjjrliqllolhyewgozkuovaiezgcilelqapuoeglnwmnlftxxiigzczlouooi", "output": "YES" }, { "input": "pfhhwctyqdlkrwhebfqfelhyebwllhemtrmeblgrynmvyhioesqklclocxmlffuormljszllpoo", "output": "YES" }, { "input": "lqllcolohwflhfhlnaow", "output": "NO" }, { "input": "heheeellollvoo", "output": "YES" }, { "input": "hellooo", "output": "YES" }, { "input": "o", "output": "NO" }, { "input": "hhqhzeclohlehljlhtesllylrolmomvuhcxsobtsckogdv", "output": "YES" }, { "input": "yoegfuzhqsihygnhpnukluutocvvwuldiighpogsifealtgkfzqbwtmgghmythcxflebrkctlldlkzlagovwlstsghbouk", "output": "YES" }, { "input": "uatqtgbvrnywfacwursctpagasnhydvmlinrcnqrry", "output": "NO" }, { "input": "tndtbldbllnrwmbyhvqaqqyoudrstpbfokfoclnraefuxtftmgzicorwisrpfnfpbdtatvwqgyalqtdtrjqvbfsq", "output": "NO" }, { "input": "rzlvirhgemelnzdawzpaoqtxmqucnahvqnwldklrmjiiyageraijfivigvozgwngiulttxxgzczptusoi", "output": "YES" }, { "input": "kgyelmchocojsnaqdsyeqgnllytbqietpdlgknwwumqkxrexgdcnwoldicwzwofpmuesjuxzrasscvyuqwspm", "output": "YES" }, { "input": "pnyvrcotjvgynbeldnxieghfltmexttuxzyac", "output": "NO" }, { "input": "dtwhbqoumejligbenxvzhjlhosqojetcqsynlzyhfaevbdpekgbtjrbhlltbceobcok", "output": "YES" }, { "input": "crrfpfftjwhhikwzeedrlwzblckkteseofjuxjrktcjfsylmlsvogvrcxbxtffujqshslemnixoeezivksouefeqlhhokwbqjz", "output": "YES" }, { "input": "jhfbndhyzdvhbvhmhmefqllujdflwdpjbehedlsqfdsqlyelwjtyloxwsvasrbqosblzbowlqjmyeilcvotdlaouxhdpoeloaovb", "output": "YES" }, { "input": "hwlghueoemiqtjhhpashjsouyegdlvoyzeunlroypoprnhlyiwiuxrghekaylndhrhllllwhbebezoglydcvykllotrlaqtvmlla", "output": "YES" }, { "input": "wshiaunnqnqxodholbipwhhjmyeblhgpeleblklpzwhdunmpqkbuzloetmwwxmeltkrcomulxauzlwmlklldjodozxryghsnwgcz", "output": "YES" }, { "input": "shvksednttggehroewuiptvvxtrzgidravtnjwuqrlnnkxbplctzkckinpkgjopjfoxdbojtcvsuvablcbkrzajrlhgobkcxeqti", "output": "YES" }, { "input": "hyyhddqhxhekehkwfhlnlsihzefwchzerevcjtokefplholrbvxlltdlafjxrfhleglrvlolojoqaolagtbeyogxlbgfolllslli", "output": "YES" }, { "input": "iaagrdhhelxpdegueiulflquvlzidoprzkehthkldaytrjwhyhprwjxlltinxvuilxohqgjqcvkkdcuoliekcnlilwgqlnlzouoo", "output": "YES" }, { "input": "wfluaeseldgxyvxpwuhkptdmlflnlhktwxiabsvkolsquymrmhzczzoybvlilhmvsuunggvgxzgyyffk", "output": "NO" }, { "input": "loee", "output": "NO" }, { "input": "izdipwylefqmjbuoznfglgcfvedeouflkeehxbasaqmiooppfsqlhprospqgxvzrcpwlfdddngoqvpwvggsnvvxhmjoslwjudjlo", "output": "NO" }, { "input": "pplynflbjlseflaegzqpdxswgunhnlglqhycrbcwdfhclmcrwekkzsoosmfblljeenwfjyifcvxihhhbyhmhlkvtskeglaovjnsi", "output": "YES" }, { "input": "xqjqmenkodmlhzyzmmvofdngktygbbxbzpluzcohohmalkoeuwfikblltaaigv", "output": "NO" }, { "input": "hello", "output": "YES" }, { "input": "oohell", "output": "NO" }, { "input": "hell", "output": "NO" }, { "input": "eloellohoelo", "output": "NO" }, { "input": "helllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllo", "output": "YES" } ]	1,594,835,451	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	6	124	20,172,800	s = input() s1 = 'hello' count = 0 for i in s: if i in s1: count += 1 if count > 5: print("YES") else: print("NO")	Title: Chat room Time Limit: 1 seconds Memory Limit: 256 megabytes Problem Description: 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 Specification: The first and only line contains the word s, which Vasya typed. This word consisits of small Latin letters, its length is no less that 1 and no more than 100 letters. Output Specification: If Vasya managed to say hello, print "YES", otherwise print "NO". Demo Input: ['ahhellllloou\n', 'hlelo\n'] Demo Output: ['YES\n', 'NO\n'] Note: none	```python s = input() s1 = 'hello' count = 0 for i in s: if i in s1: count += 1 if count > 5: print("YES") else: print("NO") ```	0
278	A	Circle Line	PROGRAMMING	800	[ "implementation" ]		null	null	The circle line of the Berland subway has n stations. We know the distances between all pairs of neighboring stations: - d1 is the distance between the 1-st and the 2-nd station;- d2 is the distance between the 2-nd and the 3-rd station;...- dn<=-<=1 is the distance between the n<=-<=1-th and the n-th station;- dn is the distance between the n-th and the 1-st station. The trains go along the circle line in both directions. Find the shortest distance between stations with numbers s and t.	The first line contains integer n (3<=≤<=n<=≤<=100) — the number of stations on the circle line. The second line contains n integers d1,<=d2,<=...,<=dn (1<=≤<=di<=≤<=100) — the distances between pairs of neighboring stations. The third line contains two integers s and t (1<=≤<=s,<=t<=≤<=n) — the numbers of stations, between which you need to find the shortest distance. These numbers can be the same. The numbers in the lines are separated by single spaces.	Print a single number — the length of the shortest path between stations number s and t.	[ "4\n2 3 4 9\n1 3\n", "4\n5 8 2 100\n4 1\n", "3\n1 1 1\n3 1\n", "3\n31 41 59\n1 1\n" ]	[ "5\n", "15\n", "1\n", "0\n" ]	In the first sample the length of path 1 → 2 → 3 equals 5, the length of path 1 → 4 → 3 equals 13. In the second sample the length of path 4 → 1 is 100, the length of path 4 → 3 → 2 → 1 is 15. In the third sample the length of path 3 → 1 is 1, the length of path 3 → 2 → 1 is 2. In the fourth sample the numbers of stations are the same, so the shortest distance equals 0.	500	[ { "input": "4\n2 3 4 9\n1 3", "output": "5" }, { "input": "4\n5 8 2 100\n4 1", "output": "15" }, { "input": "3\n1 1 1\n3 1", "output": "1" }, { "input": "3\n31 41 59\n1 1", "output": "0" }, { "input": "5\n16 13 10 30 15\n4 2", "output": "23" }, { "input": "6\n89 82 87 32 67 33\n4 4", "output": "0" }, { "input": "7\n2 3 17 10 2 2 2\n4 2", "output": "18" }, { "input": "3\n4 37 33\n3 3", "output": "0" }, { "input": "8\n87 40 96 7 86 86 72 97\n6 8", "output": "158" }, { "input": "10\n91 94 75 99 100 91 79 86 79 92\n2 8", "output": "348" }, { "input": "19\n1 1 1 1 2 1 1 1 1 1 2 1 3 2 2 1 1 1 2\n7 7", "output": "0" }, { "input": "34\n96 65 24 99 74 76 97 93 99 69 94 82 92 91 98 83 95 97 96 81 90 95 86 87 43 78 88 86 82 62 76 99 83 96\n21 16", "output": "452" }, { "input": "50\n75 98 65 75 99 89 84 65 9 53 62 61 61 53 80 7 6 47 86 1 89 27 67 1 31 39 53 92 19 20 76 41 60 15 29 94 76 82 87 89 93 38 42 6 87 36 100 97 93 71\n2 6", "output": "337" }, { "input": "99\n1 15 72 78 23 22 26 98 7 2 75 58 100 98 45 79 92 69 79 72 33 88 62 9 15 87 17 73 68 54 34 89 51 91 28 44 20 11 74 7 85 61 30 46 95 72 36 18 48 22 42 46 29 46 86 53 96 55 98 34 60 37 75 54 1 81 20 68 84 19 18 18 75 84 86 57 73 34 23 43 81 87 47 96 57 41 69 1 52 44 54 7 85 35 5 1 19 26 7\n4 64", "output": "1740" }, { "input": "100\n33 63 21 27 49 82 86 93 43 55 4 72 89 85 5 34 80 7 23 13 21 49 22 73 89 65 81 25 6 92 82 66 58 88 48 96 1 1 16 48 67 96 84 63 87 76 20 100 36 4 31 41 35 62 55 76 74 70 68 41 4 16 39 81 2 41 34 73 66 57 41 89 78 93 68 96 87 47 92 60 40 58 81 12 19 74 56 83 56 61 83 97 26 92 62 52 39 57 89 95\n71 5", "output": "2127" }, { "input": "100\n95 98 99 81 98 96 100 92 96 90 99 91 98 98 91 78 97 100 96 98 87 93 96 99 91 92 96 92 90 97 85 83 99 95 66 91 87 89 100 95 100 88 99 84 96 79 99 100 94 100 99 99 92 89 99 91 100 94 98 97 91 92 90 87 84 99 97 98 93 100 90 85 75 95 86 71 98 93 91 87 92 95 98 94 95 94 100 98 96 100 97 96 95 95 86 86 94 97 98 96\n67 57", "output": "932" }, { "input": "100\n100 100 100 100 100 100 100 100 100 100 97 100 100 100 100 100 99 100 100 99 99 100 99 100 100 100 100 100 100 100 100 100 97 99 98 98 100 98 98 100 99 100 100 100 100 99 100 98 100 99 98 99 98 98 100 100 100 100 100 100 100 100 100 100 99 100 100 100 100 100 98 100 99 99 100 96 100 96 100 99 100 100 99 100 99 100 100 100 99 100 100 100 100 98 98 97 100 100 99 98\n16 6", "output": "997" }, { "input": "100\n3 6 23 4 23 1 2 14 2 3 3 9 17 8 10 5 1 14 8 5 7 4 13 8 5 6 24 3 12 3 4 9 2 8 2 1 2 1 3 2 1 6 14 23 8 6 3 5 7 8 18 9 2 5 22 6 13 16 2 4 31 20 4 3 3 6 6 1 1 18 5 11 1 14 4 16 6 37 11 1 8 3 7 11 21 14 3 3 12 2 5 1 9 16 3 1 3 4 4 2\n98 24", "output": "195" }, { "input": "100\n1 1 3 1 1 2 1 2 1 1 2 2 2 1 1 1 1 1 1 3 1 1 1 3 1 3 3 1 1 2 1 1 1 1 1 2 1 1 1 4 1 1 3 3 2 1 1 1 1 1 2 2 1 3 1 1 1 2 4 1 1 2 5 2 1 1 2 1 1 1 2 3 1 1 1 1 2 1 1 1 1 2 1 1 1 1 1 2 2 3 1 7 3 1 3 1 2 1 2 1\n49 10", "output": "60" }, { "input": "100\n75 62 31 96 62 76 93 96 72 67 88 35 67 34 60 56 95 86 82 48 64 61 74 100 56 98 76 98 78 55 53 10 12 78 58 45 86 90 93 77 69 73 88 66 92 88 33 50 95 69 89 12 93 57 93 89 59 53 71 86 15 13 61 93 24 100 58 76 46 95 76 82 50 20 79 38 5 72 99 81 55 90 90 65 85 44 63 39 6 34 98 72 88 30 59 73 84 61 25 67\n86 25", "output": "2523" }, { "input": "100\n100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100\n1 51", "output": "5000" }, { "input": "4\n1 1 1 1\n2 4", "output": "2" }, { "input": "4\n1 1 2 1\n2 4", "output": "2" } ]	1,667,981,403	2,147,483,647	Python 3	OK	TESTS	23	92	0	def minDistances(n, distances, nOfSs: list): result1 = 0 result2 = 0 nOfSs.sort() pos_1 = nOfSs[0] - 1 pos_2 = nOfSs[1] - 1 if pos_1 == pos_2: print(0) else: for i in range(0, n): if i >= pos_1 and i < pos_2: result1 += distances[i] else: result2 += distances[i] result = result1 if result1 < result2 else result2 print(result) if __name__ == '__main__': n = int(input()) distances = [int(i) for i in input().split()] nOfSs = [int(i) for i in input().split()] minDistances(n=n, distances=distances, nOfSs=nOfSs)	Title: Circle Line Time Limit: None seconds Memory Limit: None megabytes Problem Description: The circle line of the Berland subway has n stations. We know the distances between all pairs of neighboring stations: - d1 is the distance between the 1-st and the 2-nd station;- d2 is the distance between the 2-nd and the 3-rd station;...- dn<=-<=1 is the distance between the n<=-<=1-th and the n-th station;- dn is the distance between the n-th and the 1-st station. The trains go along the circle line in both directions. Find the shortest distance between stations with numbers s and t. Input Specification: The first line contains integer n (3<=≤<=n<=≤<=100) — the number of stations on the circle line. The second line contains n integers d1,<=d2,<=...,<=dn (1<=≤<=di<=≤<=100) — the distances between pairs of neighboring stations. The third line contains two integers s and t (1<=≤<=s,<=t<=≤<=n) — the numbers of stations, between which you need to find the shortest distance. These numbers can be the same. The numbers in the lines are separated by single spaces. Output Specification: Print a single number — the length of the shortest path between stations number s and t. Demo Input: ['4\n2 3 4 9\n1 3\n', '4\n5 8 2 100\n4 1\n', '3\n1 1 1\n3 1\n', '3\n31 41 59\n1 1\n'] Demo Output: ['5\n', '15\n', '1\n', '0\n'] Note: In the first sample the length of path 1 → 2 → 3 equals 5, the length of path 1 → 4 → 3 equals 13. In the second sample the length of path 4 → 1 is 100, the length of path 4 → 3 → 2 → 1 is 15. In the third sample the length of path 3 → 1 is 1, the length of path 3 → 2 → 1 is 2. In the fourth sample the numbers of stations are the same, so the shortest distance equals 0.	```python def minDistances(n, distances, nOfSs: list): result1 = 0 result2 = 0 nOfSs.sort() pos_1 = nOfSs[0] - 1 pos_2 = nOfSs[1] - 1 if pos_1 == pos_2: print(0) else: for i in range(0, n): if i >= pos_1 and i < pos_2: result1 += distances[i] else: result2 += distances[i] result = result1 if result1 < result2 else result2 print(result) if __name__ == '__main__': n = int(input()) distances = [int(i) for i in input().split()] nOfSs = [int(i) for i in input().split()] minDistances(n=n, distances=distances, nOfSs=nOfSs) ```	3
461	A	Appleman and Toastman	PROGRAMMING	1,200	[ "greedy", "sortings" ]		null	null	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: - 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. After guys complete all the tasks they look at the score value. What is the maximum possible value of score they can get?	The first line contains a single integer n (1<=≤<=n<=≤<=3·105). The second line contains n integers a1, a2, ..., an (1<=≤<=ai<=≤<=106) — the initial group that is given to Toastman.	Print a single integer — the largest possible score.	[ "3\n3 1 5\n", "1\n10\n" ]	[ "26\n", "10\n" ]	Consider the following situation in the first example. Initially Toastman gets group [3, 1, 5] and adds 9 to the score, then he give the group to Appleman. Appleman splits group [3, 1, 5] into two groups: [3, 5] and [1]. Both of them should be given to Toastman. When Toastman receives group [1], he adds 1 to score and gives the group to Appleman (he will throw it out). When Toastman receives group [3, 5], he adds 8 to the score and gives the group to Appleman. Appleman splits [3, 5] in the only possible way: [5] and [3]. Then he gives both groups to Toastman. When Toastman receives [5], he adds 5 to the score and gives the group to Appleman (he will throws it out). When Toastman receives [3], he adds 3 to the score and gives the group to Appleman (he will throws it out). Finally Toastman have added 9 + 1 + 8 + 5 + 3 = 26 to the score. This is the optimal sequence of actions.	500	[ { "input": "3\n3 1 5", "output": "26" }, { "input": "1\n10", "output": "10" }, { "input": "10\n8 10 2 5 6 2 4 7 2 1", "output": "376" }, { "input": "10\n171308 397870 724672 431255 228496 892002 542924 718337 888642 161821", "output": "40204082" }, { "input": "10\n1 2 2 2 4 5 6 7 8 10", "output": "376" }, { "input": "10\n161821 171308 228496 397870 431255 542924 718337 724672 888642 892002", "output": "40204082" }, { "input": "1\n397870", "output": "397870" }, { "input": "1\n1000000", "output": "1000000" }, { "input": "10\n10 8 7 6 5 4 2 2 2 1", "output": "376" }, { "input": "10\n892002 888642 724672 718337 542924 431255 397870 228496 171308 161821", "output": "40204082" }, { "input": "10\n5 2 6 10 10 10 10 2 2 5", "output": "485" }, { "input": "10\n431255 724672 228496 397870 397870 397870 397870 724672 888642 431255", "output": "36742665" }, { "input": "10\n2 2 2 5 5 6 10 10 10 10", "output": "485" }, { "input": "10\n228496 397870 397870 397870 397870 431255 431255 724672 724672 888642", "output": "36742665" }, { "input": "10\n10 10 10 10 6 5 5 2 2 2", "output": "485" }, { "input": "10\n888642 724672 724672 431255 431255 397870 397870 397870 397870 228496", "output": "36742665" }, { "input": "10\n10 10 10 10 10 10 10 10 10 10", "output": "640" }, { "input": "10\n1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000", "output": "64000000" }, { "input": "1\n397870", "output": "397870" }, { "input": "2\n1 2", "output": "6" }, { "input": "2\n2 3", "output": "10" }, { "input": "2\n1 1", "output": "4" } ]	1,480,494,516	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	31	0	n=int(input()) a=[int(i) for i in input().split()] a.sort() n_score=0 n_score=sum(a) for i in range(0,n-1): n_score+= a[i](i+1) n_score+=a[n-1](n-1) print(n_scpre)	Title: Appleman and Toastman Time Limit: None seconds Memory Limit: None megabytes Problem Description: 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: - 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. After guys complete all the tasks they look at the score value. What is the maximum possible value of score they can get? Input Specification: The first line contains a single integer n (1<=≤<=n<=≤<=3·105). The second line contains n integers a1, a2, ..., an (1<=≤<=ai<=≤<=106) — the initial group that is given to Toastman. Output Specification: Print a single integer — the largest possible score. Demo Input: ['3\n3 1 5\n', '1\n10\n'] Demo Output: ['26\n', '10\n'] Note: Consider the following situation in the first example. Initially Toastman gets group [3, 1, 5] and adds 9 to the score, then he give the group to Appleman. Appleman splits group [3, 1, 5] into two groups: [3, 5] and [1]. Both of them should be given to Toastman. When Toastman receives group [1], he adds 1 to score and gives the group to Appleman (he will throw it out). When Toastman receives group [3, 5], he adds 8 to the score and gives the group to Appleman. Appleman splits [3, 5] in the only possible way: [5] and [3]. Then he gives both groups to Toastman. When Toastman receives [5], he adds 5 to the score and gives the group to Appleman (he will throws it out). When Toastman receives [3], he adds 3 to the score and gives the group to Appleman (he will throws it out). Finally Toastman have added 9 + 1 + 8 + 5 + 3 = 26 to the score. This is the optimal sequence of actions.	```python n=int(input()) a=[int(i) for i in input().split()] a.sort() n_score=0 n_score=sum(a) for i in range(0,n-1): n_score+= a[i](i+1) n_score+=a[n-1](n-1) print(n_scpre) ```	-1
780	C	Andryusha and Colored Balloons	PROGRAMMING	1,600	[ "dfs and similar", "graphs", "greedy", "trees" ]		null	null	Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them. The park consists of n squares connected with (n<=-<=1) bidirectional paths in such a way that any square is reachable from any other using these paths. Andryusha decided to hang a colored balloon at each of the squares. The baloons' colors are described by positive integers, starting from 1. In order to make the park varicolored, Andryusha wants to choose the colors in a special way. More precisely, he wants to use such colors that if a, b and c are distinct squares that a and b have a direct path between them, and b and c have a direct path between them, then balloon colors on these three squares are distinct. Andryusha wants to use as little different colors as possible. Help him to choose the colors!	The first line contains single integer n (3<=≤<=n<=≤<=2·105) — the number of squares in the park. Each of the next (n<=-<=1) lines contains two integers x and y (1<=≤<=x,<=y<=≤<=n) — the indices of two squares directly connected by a path. It is guaranteed that any square is reachable from any other using the paths.	In the first line print single integer k — the minimum number of colors Andryusha has to use. In the second line print n integers, the i-th of them should be equal to the balloon color on the i-th square. Each of these numbers should be within range from 1 to k.	[ "3\n2 3\n1 3\n", "5\n2 3\n5 3\n4 3\n1 3\n", "5\n2 1\n3 2\n4 3\n5 4\n" ]	[ "3\n1 3 2 ", "5\n1 3 2 5 4 ", "3\n1 2 3 1 2 " ]	In the first sample the park consists of three squares: 1 → 3 → 2. Thus, the balloon colors have to be distinct. In the second example there are following triples of consequently connected squares: - 1 → 3 → 2 - 1 → 3 → 4 - 1 → 3 → 5 - 2 → 3 → 4 - 2 → 3 → 5 - 4 → 3 → 5 In the third example there are following triples: - 1 → 2 → 3 - 2 → 3 → 4 - 3 → 4 → 5	1,250	[ { "input": "3\n2 3\n1 3", "output": "3\n1 3 2 " }, { "input": "5\n2 3\n5 3\n4 3\n1 3", "output": "5\n1 3 2 5 4 " }, { "input": "5\n2 1\n3 2\n4 3\n5 4", "output": "3\n1 2 3 1 2 " }, { "input": "10\n5 3\n9 2\n7 1\n3 8\n4 1\n1 9\n10 1\n8 9\n6 2", "output": "5\n1 2 1 3 2 1 2 3 4 5 " }, { "input": "3\n2 1\n3 2", "output": "3\n1 2 3 " }, { "input": "10\n2 7\n8 2\n9 8\n1 9\n4 1\n3 4\n6 3\n10 6\n5 10", "output": "3\n1 1 2 3 2 1 2 3 2 3 " }, { "input": "5\n4 2\n3 1\n3 4\n3 5", "output": "4\n1 1 2 3 4 " }, { "input": "7\n3 6\n3 1\n3 2\n3 5\n3 4\n3 7", "output": "7\n1 4 2 6 5 3 7 " }, { "input": "10\n8 6\n10 5\n8 4\n2 7\n3 8\n10 3\n3 9\n2 1\n3 2", "output": "5\n1 2 4 3 1 2 3 1 5 3 " }, { "input": "50\n45 2\n4 48\n16 4\n17 29\n29 33\n31 2\n47 41\n41 33\n22 6\n44 40\n32 24\n12 40\n28 16\n18 30\n20 41\n25 45\n35 29\n10 32\n1 48\n15 50\n6 9\n43 2\n33 2\n38 33\n8 2\n36 7\n26 48\n50 8\n34 31\n48 33\n13 45\n37 33\n7 6\n40 32\n3 6\n30 49\n49 33\n11 40\n19 40\n24 2\n14 50\n5 50\n42 16\n23 2\n9 45\n39 6\n46 48\n27 13\n21 2", "output": "9\n1 4 4 3 4 2 3 6 5 2 5 4 3 3 2 1 2 2 6 2 9 1 8 7 2 4 2 2 1 1 2 1 5 1 3 1 7 6 6 3 3 4 3 2 1 6 1 2 8 1 " }, { "input": "50\n8 37\n40 8\n38 40\n10 38\n29 10\n33 29\n17 33\n25 17\n19 25\n3 19\n13 3\n24 13\n12 24\n5 12\n41 5\n11 41\n27 11\n45 27\n6 45\n35 6\n9 35\n50 9\n32 50\n21 32\n22 21\n1 22\n31 1\n28 31\n4 28\n30 4\n7 30\n48 7\n46 48\n16 46\n49 16\n39 49\n18 39\n14 18\n34 14\n23 34\n20 23\n15 20\n44 15\n42 44\n2 42\n36 2\n43 36\n26 43\n47 26", "output": "3\n1 3 2 1 1 2 2 2 3 2 2 2 1 1 3 2 2 2 3 1 3 2 2 3 1 3 1 2 1 3 3 1 3 3 1 2 3 3 3 1 3 1 1 2 3 3 2 1 1 2 " }, { "input": "50\n7 5\n6 40\n49 43\n48 2\n44 11\n10 3\n46 49\n22 18\n17 33\n4 29\n48 4\n47 41\n24 19\n48 8\n1 21\n2 17\n17 34\n16 10\n17 20\n1 22\n44 32\n6 28\n7 1\n47 26\n28 44\n23 50\n21 15\n1 30\n7 27\n28 25\n17 23\n14 42\n6 46\n5 24\n44 9\n25 39\n46 47\n21 35\n7 16\n34 12\n45 14\n35 36\n28 13\n6 48\n46 37\n39 45\n40 7\n2 31\n30 38", "output": "6\n1 2 2 3 2 1 4 5 5 1 1 2 5 3 3 5 1 2 3 5 2 3 6 1 4 2 3 2 1 5 3 4 3 4 4 1 5 2 1 6 1 1 1 3 2 3 4 4 2 2 " } ]	1,582,866,950	2,147,483,647	PyPy 3	RUNTIME_ERROR	TESTS	23	1,965	100,761,600	import sys sys.setrecursionlimit(100000) UNDEF = 0 n = int(input()) g = [[] for _ in range(n + 1)] for _ in range(n - 1): u, v = map(int, input().split()) g[u].append(v) g[v].append(u) c = [UNDEF] * (n + 1) c[1] = 1 def dfs(par, v): cur = 1 for to in g[v]: if c[to] != UNDEF: continue while cur in (c[par], c[v]): cur += 1 c[to] = cur cur += 1 dfs(v, to) dfs(0, 1) print('%d\n%s' % (max(c), ' '.join(map(str, c[1:]))))	Title: Andryusha and Colored Balloons Time Limit: None seconds Memory Limit: None megabytes Problem Description: Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them. The park consists of n squares connected with (n<=-<=1) bidirectional paths in such a way that any square is reachable from any other using these paths. Andryusha decided to hang a colored balloon at each of the squares. The baloons' colors are described by positive integers, starting from 1. In order to make the park varicolored, Andryusha wants to choose the colors in a special way. More precisely, he wants to use such colors that if a, b and c are distinct squares that a and b have a direct path between them, and b and c have a direct path between them, then balloon colors on these three squares are distinct. Andryusha wants to use as little different colors as possible. Help him to choose the colors! Input Specification: The first line contains single integer n (3<=≤<=n<=≤<=2·105) — the number of squares in the park. Each of the next (n<=-<=1) lines contains two integers x and y (1<=≤<=x,<=y<=≤<=n) — the indices of two squares directly connected by a path. It is guaranteed that any square is reachable from any other using the paths. Output Specification: In the first line print single integer k — the minimum number of colors Andryusha has to use. In the second line print n integers, the i-th of them should be equal to the balloon color on the i-th square. Each of these numbers should be within range from 1 to k. Demo Input: ['3\n2 3\n1 3\n', '5\n2 3\n5 3\n4 3\n1 3\n', '5\n2 1\n3 2\n4 3\n5 4\n'] Demo Output: ['3\n1 3 2 ', '5\n1 3 2 5 4 ', '3\n1 2 3 1 2 '] Note: In the first sample the park consists of three squares: 1 → 3 → 2. Thus, the balloon colors have to be distinct. In the second example there are following triples of consequently connected squares: - 1 → 3 → 2 - 1 → 3 → 4 - 1 → 3 → 5 - 2 → 3 → 4 - 2 → 3 → 5 - 4 → 3 → 5 In the third example there are following triples: - 1 → 2 → 3 - 2 → 3 → 4 - 3 → 4 → 5	```python import sys sys.setrecursionlimit(100000) UNDEF = 0 n = int(input()) g = [[] for _ in range(n + 1)] for _ in range(n - 1): u, v = map(int, input().split()) g[u].append(v) g[v].append(u) c = [UNDEF] * (n + 1) c[1] = 1 def dfs(par, v): cur = 1 for to in g[v]: if c[to] != UNDEF: continue while cur in (c[par], c[v]): cur += 1 c[to] = cur cur += 1 dfs(v, to) dfs(0, 1) print('%d\n%s' % (max(c), ' '.join(map(str, c[1:])))) ```	-1
672	A	Summer Camp	PROGRAMMING	800	[ "implementation" ]		null	null	Every year, hundreds of people come to summer camps, they learn new algorithms and solve hard problems. This 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.	The only line of the input contains a single integer n (1<=≤<=n<=≤<=1000) — the position of the digit you need to print.	Print the n-th digit of the line.	[ "3\n", "11\n" ]	[ "3\n", "0\n" ]	In the first sample the digit at position 3 is '3', as both integers 1 and 2 consist on one digit. In the second sample, the digit at position 11 is '0', it belongs to the integer 10.	500	[ { "input": "3", "output": "3" }, { "input": "11", "output": "0" }, { "input": "12", "output": "1" }, { "input": "13", "output": "1" }, { "input": "29", "output": "9" }, { "input": "30", "output": "2" }, { "input": "1000", "output": "3" }, { "input": "999", "output": "9" }, { "input": "100", "output": "5" }, { "input": "123", "output": "6" }, { "input": "8", "output": "8" }, { "input": "157", "output": "3" }, { "input": "289", "output": "1" }, { "input": "179", "output": "4" }, { "input": "942", "output": "0" }, { "input": "879", "output": "9" }, { "input": "394", "output": "1" }, { "input": "423", "output": "7" }, { "input": "952", "output": "3" }, { "input": "121", "output": "5" }, { "input": "613", "output": "2" }, { "input": "945", "output": "1" }, { "input": "270", "output": "6" }, { "input": "781", "output": "2" }, { "input": "453", "output": "7" }, { "input": "171", "output": "0" }, { "input": "643", "output": "2" }, { "input": "570", "output": "6" }, { "input": "750", "output": "6" }, { "input": "500", "output": "0" }, { "input": "2", "output": "2" }, { "input": "1", "output": "1" }, { "input": "108", "output": "5" }, { "input": "500", "output": "0" }, { "input": "189", "output": "9" }, { "input": "491", "output": "0" }, { "input": "191", "output": "0" } ]	1,580,280,499	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	4	140	0	t=int(input()) chk="123456789101112131415" if t<=21: print(chk[t-1]) else: print(chk[(t//2)-1])	Title: Summer Camp Time Limit: None seconds Memory Limit: None megabytes Problem Description: Every year, hundreds of people come to summer camps, they learn new algorithms and solve hard problems. This 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 Specification: The only line of the input contains a single integer n (1<=≤<=n<=≤<=1000) — the position of the digit you need to print. Output Specification: Print the n-th digit of the line. Demo Input: ['3\n', '11\n'] Demo Output: ['3\n', '0\n'] Note: In the first sample the digit at position 3 is '3', as both integers 1 and 2 consist on one digit. In the second sample, the digit at position 11 is '0', it belongs to the integer 10.	```python t=int(input()) chk="123456789101112131415" if t<=21: print(chk[t-1]) else: print(chk[(t//2)-1]) ```	0
571	E	Geometric Progressions	PROGRAMMING	3,200	[ "math" ]		null	null	Geometric progression with the first element a and common ratio b is a sequence of numbers a,<=ab,<=ab2,<=ab3,<=.... You are given n integer geometric progressions. Your task is to find the smallest integer x, that is the element of all the given progressions, or else state that such integer does not exist.	The first line contains integer (1<=≤<=n<=≤<=100) — the number of geometric progressions. Next n lines contain pairs of integers a,<=b (1<=≤<=a,<=b<=≤<=109), that are the first element and the common ratio of the corresponding geometric progression.	If the intersection of all progressions is empty, then print <=-<=1, otherwise print the remainder of the minimal positive integer number belonging to all progressions modulo 1000000007 (109<=+<=7).	[ "2\n2 2\n4 1\n", "2\n2 2\n3 3\n" ]	[ "4\n", "-1\n" ]	In the second sample test one of the progressions contains only powers of two, the other one contains only powers of three.	2,750	[ { "input": "2\n2 2\n4 1", "output": "4" }, { "input": "2\n2 2\n3 3", "output": "-1" }, { "input": "3\n1 4\n2 5\n4 2", "output": "-1" }, { "input": "2\n1 4\n2 6", "output": "-1" }, { "input": "2\n1 6\n2 6", "output": "-1" }, { "input": "2\n1 6\n1 12", "output": "1" }, { "input": "3\n1 2\n2 2\n1 2", "output": "2" }, { "input": "2\n1 6\n3 12", "output": "36" }, { "input": "2\n1 6\n9 12", "output": "1296" }, { "input": "2\n3 12\n16 6", "output": "746496" }, { "input": "2\n4 1\n2 4", "output": "-1" }, { "input": "2\n2 24\n27 48", "output": "659879000" }, { "input": "1\n1 1", "output": "1" }, { "input": "1\n1 3148137", "output": "1" }, { "input": "1\n312441 1", "output": "312441" }, { "input": "1\n1214431 9043141", "output": "1214431" }, { "input": "3\n579 4123\n579 4123\n579 4123", "output": "579" }, { "input": "3\n579 4123\n579 43543\n579 2138494", "output": "579" }, { "input": "3\n21 42\n3 7\n7 3", "output": "21" }, { "input": "14\n1 2\n2 4\n8 16\n128 256\n32768 65536\n4 8\n256 512\n16 32\n64 128\n1024 2048\n4096 8192\n65536 131072\n262144 524288\n4194304 8388608", "output": "846526526" }, { "input": "10\n1 3\n3 9\n27 81\n2187 6561\n9 27\n6561 19683\n81 243\n729 2187\n59049 177147\n531441 1594323", "output": "798227420" }, { "input": "9\n1 4\n4 16\n64 256\n16384 65536\n16 64\n65536 262144\n256 1024\n4096 16384\n1048576 4194304", "output": "688327409" }, { "input": "8\n1 5\n5 25\n125 625\n78125 390625\n25 125\n390625 1953125\n625 3125\n15625 78125", "output": "606616797" }, { "input": "7\n1 6\n6 36\n216 1296\n279936 1679616\n36 216\n1296 7776\n46656 279936", "output": "719781883" }, { "input": "7\n1 7\n7 49\n343 2401\n823543 5764801\n49 343\n2401 16807\n117649 823543", "output": "279800917" }, { "input": "6\n1 8\n8 64\n512 4096\n64 512\n4096 32768\n262144 2097152", "output": "464664614" }, { "input": "6\n1 9\n9 81\n729 6561\n81 729\n6561 59049\n531441 4782969", "output": "776679181" }, { "input": "6\n1 10\n10 100\n1000 10000\n100 1000\n10000 100000\n1000000 10000000", "output": "342341157" }, { "input": "39\n1 4\n4 4\n16 4\n64 4\n256 4\n1024 4\n4096 4\n16384 4\n65536 4\n262144 4\n1048576 4\n4194304 4\n16777216 4\n67108864 4\n268435456 4\n4 16\n64 16\n1024 16\n16384 16\n262144 16\n4194304 16\n67108864 16\n64 256\n16384 256\n4194304 256\n16384 65536\n16 64\n1024 64\n65536 64\n4194304 64\n268435456 64\n65536 262144\n256 1024\n262144 1024\n268435456 1024\n4096 16384\n67108864 16384\n1048576 4194304\n16777216 67108864", "output": "483961502" }, { "input": "32\n1 5\n5 5\n25 5\n125 5\n625 5\n3125 5\n15625 5\n78125 5\n390625 5\n1953125 5\n9765625 5\n48828125 5\n244140625 5\n5 25\n125 25\n3125 25\n78125 25\n1953125 25\n48828125 25\n125 625\n78125 625\n48828125 625\n78125 390625\n25 125\n3125 125\n390625 125\n48828125 125\n390625 1953125\n625 3125\n1953125 3125\n15625 78125\n9765625 48828125", "output": "422925678" }, { "input": "31\n1 6\n6 6\n36 6\n216 6\n1296 6\n7776 6\n46656 6\n279936 6\n1679616 6\n10077696 6\n60466176 6\n362797056 6\n6 36\n216 36\n7776 36\n279936 36\n10077696 36\n362797056 36\n216 1296\n279936 1296\n362797056 1296\n279936 1679616\n36 216\n7776 216\n1679616 216\n362797056 216\n1679616 10077696\n1296 7776\n10077696 7776\n46656 279936\n60466176 362797056", "output": "984905470" }, { "input": "26\n1 7\n7 7\n49 7\n343 7\n2401 7\n16807 7\n117649 7\n823543 7\n5764801 7\n40353607 7\n282475249 7\n7 49\n343 49\n16807 49\n823543 49\n40353607 49\n343 2401\n823543 2401\n823543 5764801\n49 343\n16807 343\n5764801 343\n5764801 40353607\n2401 16807\n40353607 16807\n117649 823543", "output": "136839922" }, { "input": "25\n1 8\n8 8\n64 8\n512 8\n4096 8\n32768 8\n262144 8\n2097152 8\n16777216 8\n134217728 8\n8 64\n512 64\n32768 64\n2097152 64\n134217728 64\n512 4096\n2097152 4096\n2097152 16777216\n64 512\n32768 512\n16777216 512\n16777216 134217728\n4096 32768\n134217728 32768\n262144 2097152", "output": "877081770" }, { "input": "25\n1 9\n9 9\n81 9\n729 9\n6561 9\n59049 9\n531441 9\n4782969 9\n43046721 9\n387420489 9\n9 81\n729 81\n59049 81\n4782969 81\n387420489 81\n729 6561\n4782969 6561\n4782969 43046721\n81 729\n59049 729\n43046721 729\n43046721 387420489\n6561 59049\n387420489 59049\n531441 4782969", "output": "931384348" }, { "input": "25\n1 10\n10 10\n100 10\n1000 10\n10000 10\n100000 10\n1000000 10\n10000000 10\n100000000 10\n1000000000 10\n10 100\n1000 100\n100000 100\n10000000 100\n1000000000 100\n1000 10000\n10000000 10000\n10000000 100000000\n100 1000\n100000 1000\n100000000 1000\n100000000 1000000000\n10000 100000\n1000000000 100000\n1000000 10000000", "output": "936617851" }, { "input": "17\n1 2\n1 4\n4 16\n64 256\n16384 65536\n1 8\n64 512\n16777216 134217728\n16 32\n16777216 33554432\n16 128\n2048 2048\n8192 8192\n4096 131072\n8192 524288\n256 8388608\n2097152 536870912", "output": "659662497" }, { "input": "17\n1 2\n2 4\n8 16\n128 256\n32768 65536\n4 8\n256 512\n67108864 134217728\n4 32\n4194304 33554432\n2 128\n8 2048\n2 8192\n2048 131072\n32 524288\n8192 8388608\n67108864 536870912", "output": "929168961" }, { "input": "17\n1 2\n2 4\n8 16\n128 256\n32768 65536\n2 8\n128 512\n33554432 134217728\n2 32\n2097152 33554432\n128 128\n1024 2048\n1024 8192\n2 131072\n16384 524288\n524288 8388608\n8 536870912", "output": "839825639" }, { "input": "17\n1 2\n2 4\n8 16\n128 256\n32768 65536\n2 8\n128 512\n33554432 134217728\n16 32\n16777216 33554432\n8 128\n128 2048\n512 8192\n256 131072\n64 524288\n1048576 8388608\n512 536870912", "output": "452786803" }, { "input": "17\n1 2\n1 4\n4 16\n64 256\n16384 65536\n2 8\n128 512\n33554432 134217728\n4 32\n4194304 33554432\n16 128\n1024 2048\n2048 8192\n8 131072\n16384 524288\n2097152 8388608\n1 536870912", "output": "25658080" }, { "input": "2\n387420489 774840978\n26244 3", "output": "73787378" }, { "input": "2\n387420489 774840978\n8748 3", "output": "73787378" }, { "input": "2\n387420489 774840978\n2125764 3", "output": "73787378" }, { "input": "2\n387420489 774840978\n26244 3", "output": "73787378" }, { "input": "2\n387420489 774840978\n972 3", "output": "73787378" } ]	1,611,224,358	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	6	62	307,200	""" https://codeforces.com/problemset/problem/571/E """ def gp(a,b): l=[] for i in range(5): t=apow(b,i) l.append(t) return l n=int(input()) s=[] for i in range(n): a,b=map(int,input().split()) s.append(gp(a,b)) first=s[0] second=s[1] p=[value for value in first if value in second] if(len(p)>0): for a in p: print(a%(10*9+7)) else: print(-1)	Title: Geometric Progressions Time Limit: None seconds Memory Limit: None megabytes Problem Description: Geometric progression with the first element a and common ratio b is a sequence of numbers a,<=ab,<=ab2,<=ab3,<=.... You are given n integer geometric progressions. Your task is to find the smallest integer x, that is the element of all the given progressions, or else state that such integer does not exist. Input Specification: The first line contains integer (1<=≤<=n<=≤<=100) — the number of geometric progressions. Next n lines contain pairs of integers a,<=b (1<=≤<=a,<=b<=≤<=109), that are the first element and the common ratio of the corresponding geometric progression. Output Specification: If the intersection of all progressions is empty, then print <=-<=1, otherwise print the remainder of the minimal positive integer number belonging to all progressions modulo 1000000007 (109<=+<=7). Demo Input: ['2\n2 2\n4 1\n', '2\n2 2\n3 3\n'] Demo Output: ['4\n', '-1\n'] Note: In the second sample test one of the progressions contains only powers of two, the other one contains only powers of three.	```python """ https://codeforces.com/problemset/problem/571/E """ def gp(a,b): l=[] for i in range(5): t=apow(b,i) l.append(t) return l n=int(input()) s=[] for i in range(n): a,b=map(int,input().split()) s.append(gp(a,b)) first=s[0] second=s[1] p=[value for value in first if value in second] if(len(p)>0): for a in p: print(a%(10*9+7)) else: print(-1) ```	0

Subsets and Splits

Successful Python Submissions

Retrieves all records from the train dataset where the verdict is 'OK', providing basic filtering but limited analytical value.

SQL Console for MatrixStudio/Codeforces-Python-Submissions

Retrieves records of users with a rating of 1600 or higher and a verdict of 'OK', providing basic filtering but limited analytical value.

SQL Console for MatrixStudio/Codeforces-Python-Submissions

Counts the number of entries with a rating above 2000 and a verdict of 'OK', providing basic filtering but limited analytical value.

SQL Console for MatrixStudio/Codeforces-Python-Submissions

Counts the number of entries with a 'OK' verdict, providing a basic overview of a specific category within the dataset.