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
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...	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" ...	1,575,008,954	2,147,483,647	PyPy 3	OK	TESTS	37	155	0	s = ''.join([str(x) for x in range(1000)]) print(s[int(input())])	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...	```python s = ''.join([str(x) for x in range(1000)]) print(s[int(input())]) ```	3
631	C	Report	PROGRAMMING	1,700	[ "data structures", "sortings" ]		null	null	Each month Blake gets the report containing main economic indicators of the company "Blake Technologies". There are n commodities produced by the company. For each of them there is exactly one integer in the final report, that denotes corresponding revenue. Before the report gets to Blake, it passes through the hands...	The first line of the input contains two integers n and m (1<=≤<=n,<=m<=≤<=200<=000) — the number of commodities in the report and the number of managers, respectively. The second line contains n integers ai (\|ai\|<=≤<=109) — the initial report before it gets to the first manager. Then follow m lin...	Print n integers — the final report, which will be passed to Blake by manager number m.	[ "3 1\n1 2 3\n2 2\n", "4 2\n1 2 4 3\n2 3\n1 2\n" ]	[ "2 1 3 ", "2 4 1 3 " ]	In the first sample, the initial report looked like: 1 2 3. After the first manager the first two numbers were transposed: 2 1 3. The report got to Blake in this form. In the second sample the original report was like this: 1 2 4 3. After the first manager the report changed to: 4 2 1 3. After the second manager the r...	1,500	[ { "input": "3 1\n1 2 3\n2 2", "output": "2 1 3 " }, { "input": "4 2\n1 2 4 3\n2 3\n1 2", "output": "2 4 1 3 " }, { "input": "4 1\n4 3 2 1\n1 4", "output": "1 2 3 4 " }, { "input": "5 1\n1 2 3 4 5\n2 5", "output": "5 4 3 2 1 " }, { "input": "6 2\n3 1 2 6 4 5\n1 6\n...	1,459,327,623	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	7	2,000	10,035,200	class data(): def __init__(self,data): self.data=data def getData(self): a=map(str,self.data) return ' '.join(a) def sort(self,r,t): temp=self.data[:r] temp.sort(reverse=t-1) self.data=temp+self.data[r:] n,m=[int(i) for i in input().spl...	Title: Report Time Limit: None seconds Memory Limit: None megabytes Problem Description: Each month Blake gets the report containing main economic indicators of the company "Blake Technologies". There are n commodities produced by the company. For each of them there is exactly one integer in the final report, that...	```python class data(): def __init__(self,data): self.data=data def getData(self): a=map(str,self.data) return ' '.join(a) def sort(self,r,t): temp=self.data[:r] temp.sort(reverse=t-1) self.data=temp+self.data[r:] n,m=[int(i) for i in i...	0
749	A	Bachgold Problem	PROGRAMMING	800	[ "greedy", "implementation", "math", "number theory" ]		null	null	Bachgold problem is very easy to formulate. Given a positive integer n represent it as a sum of maximum possible number of prime numbers. One can prove that such representation exists for any integer greater than 1. Recall that integer k is called prime if it is greater than 1 and has exactly two positive integer ...	The only line of the input contains a single integer n (2<=≤<=n<=≤<=100<=000).	The first line of the output contains a single integer k — maximum possible number of primes in representation. The second line should contain k primes with their sum equal to n. You can print them in any order. If there are several optimal solution, print any of them.	[ "5\n", "6\n" ]	[ "2\n2 3\n", "3\n2 2 2\n" ]	none	500	[ { "input": "5", "output": "2\n2 3" }, { "input": "6", "output": "3\n2 2 2" }, { "input": "2", "output": "1\n2" }, { "input": "3", "output": "1\n3" }, { "input": "99999", "output": "49999\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,683,785,827	2,147,483,647	PyPy 3-64	OK	TESTS	41	77	2,457,600	from sys import stdin def get_input(): return int(input()) def get_primes(n): if n % 2 == 0: return [2] * (n // 2) return [2] * ((n - 3) // 2) + [3] primes = get_primes(get_input()) print(f'{len(primes)}\n{" ".join(map(str, primes))}')	Title: Bachgold Problem Time Limit: None seconds Memory Limit: None megabytes Problem Description: Bachgold problem is very easy to formulate. Given a positive integer n represent it as a sum of maximum possible number of prime numbers. One can prove that such representation exists for any integer greater than 1. ...	```python from sys import stdin def get_input(): return int(input()) def get_primes(n): if n % 2 == 0: return [2] * (n // 2) return [2] * ((n - 3) // 2) + [3] primes = get_primes(get_input()) print(f'{len(primes)}\n{" ".join(map(str, primes))}') ```	3
160	A	Twins	PROGRAMMING	900	[ "greedy", "sortings" ]		null	null	Imagine that you have a twin brother or sister. Having another person that looks exactly like you seems very unusual. It's hard to say if having something of an alter ego is good or bad. And if you do have a twin, then you very well know what it's like. Now let's imagine a typical morning in your family. You haven't w...	The first line contains integer n (1<=≤<=n<=≤<=100) — the number of coins. The second line contains a sequence of n integers a1, a2, ..., an (1<=≤<=ai<=≤<=100) — the coins' values. All numbers are separated with spaces.	In the single line print the single number — the minimum needed number of coins.	[ "2\n3 3\n", "3\n2 1 2\n" ]	[ "2\n", "2\n" ]	In the first sample you will have to take 2 coins (you and your twin have sums equal to 6, 0 correspondingly). If you take 1 coin, you get sums 3, 3. If you take 0 coins, you get sums 0, 6. Those variants do not satisfy you as your sum should be strictly more that your twins' sum. In the second sample one coin isn't e...	500	[ { "input": "2\n3 3", "output": "2" }, { "input": "3\n2 1 2", "output": "2" }, { "input": "1\n5", "output": "1" }, { "input": "5\n4 2 2 2 2", "output": "3" }, { "input": "7\n1 10 1 2 1 1 1", "output": "1" }, { "input": "5\n3 2 3 3 1", "output": "3" ...	1,690,965,803	2,147,483,647	Python 3	OK	TESTS	29	62	0	n=int(input()) a=map(int,input().split()) a=list(a) a.sort(reverse=True) for i in range(len(a)): if sum(a[:i+1]) >sum(a[i+1:]): print(len(a[:i+1])) break	Title: Twins Time Limit: None seconds Memory Limit: None megabytes Problem Description: Imagine that you have a twin brother or sister. Having another person that looks exactly like you seems very unusual. It's hard to say if having something of an alter ego is good or bad. And if you do have a twin, then you very w...	```python n=int(input()) a=map(int,input().split()) a=list(a) a.sort(reverse=True) for i in range(len(a)): if sum(a[:i+1]) >sum(a[i+1:]): print(len(a[:i+1])) break ```	3
637	B	Chat Order	PROGRAMMING	1,200	[ "*special", "binary search", "constructive algorithms", "data structures", "sortings" ]		null	null	Polycarp is a big lover of killing time in social networks. A page with a chatlist in his favourite network is made so that when a message is sent to some friend, his friend's chat rises to the very top of the page. The relative order of the other chats doesn't change. If there was no chat with this friend before, then...	The first line contains integer n (1<=≤<=n<=≤<=200<=000) — the number of Polycarpus' messages. Next n lines enlist the message recipients in the order in which the messages were sent. The name of each participant is a non-empty sequence of lowercase English letters of length at most 10.	Print all the recipients to who Polycarp talked to in the order of chats with them, from top to bottom.	[ "4\nalex\nivan\nroman\nivan\n", "8\nalina\nmaria\nekaterina\ndarya\ndarya\nekaterina\nmaria\nalina\n" ]	[ "ivan\nroman\nalex\n", "alina\nmaria\nekaterina\ndarya\n" ]	In the first test case Polycarpus first writes to friend by name "alex", and the list looks as follows: 1. alex Then Polycarpus writes to friend by name "ivan" and the list looks as follows: 1. ivan 1. alex Polycarpus writes the third message to friend by name "roman" and the list looks as follows: 1. roman 1...	1,000	[ { "input": "4\nalex\nivan\nroman\nivan", "output": "ivan\nroman\nalex" }, { "input": "8\nalina\nmaria\nekaterina\ndarya\ndarya\nekaterina\nmaria\nalina", "output": "alina\nmaria\nekaterina\ndarya" }, { "input": "1\nwdi", "output": "wdi" }, { "input": "2\nypg\nypg", "outpu...	1,522,820,375	2,147,483,647	Python 3	OK	TESTS	95	1,106	35,430,400	n = int(input()) d = dict() for i in range(n): name = input() d[name] = i a = [(name, d[name]) for name in d] a = sorted(a, key=lambda x:x[1], reverse=True) for p in a: print(p[0])	Title: Chat Order Time Limit: None seconds Memory Limit: None megabytes Problem Description: Polycarp is a big lover of killing time in social networks. A page with a chatlist in his favourite network is made so that when a message is sent to some friend, his friend's chat rises to the very top of the page. The rela...	```python n = int(input()) d = dict() for i in range(n): name = input() d[name] = i a = [(name, d[name]) for name in d] a = sorted(a, key=lambda x:x[1], reverse=True) for p in a: print(p[0]) ```	3
460	A	Vasya and Socks	PROGRAMMING	900	[ "brute force", "implementation", "math" ]		null	null	Vasya has n pairs of socks. In the morning of each day Vasya has to put on a pair of socks before he goes to school. When he comes home in the evening, Vasya takes off the used socks and throws them away. Every m-th day (at days with numbers m,<=2m,<=3m,<=...) mom buys a pair of socks to Vasya. She does it la...	The single line contains two integers n and m (1<=≤<=n<=≤<=100; 2<=≤<=m<=≤<=100), separated by a space.	Print a single integer — the answer to the problem.	[ "2 2\n", "9 3\n" ]	[ "3\n", "13\n" ]	In the first sample Vasya spends the first two days wearing the socks that he had initially. Then on day three he puts on the socks that were bought on day two. In the second sample Vasya spends the first nine days wearing the socks that he had initially. Then he spends three days wearing the socks that were bought on...	500	[ { "input": "2 2", "output": "3" }, { "input": "9 3", "output": "13" }, { "input": "1 2", "output": "1" }, { "input": "2 3", "output": "2" }, { "input": "1 99", "output": "1" }, { "input": "4 4", "output": "5" }, { "input": "10 2", "outp...	1,677,581,034	2,147,483,647	Python 3	OK	TESTS	26	46	0	n, m = map ( int, input ( ).split () ) c = 0 while n >= m : n = n - m + 1 c = c + m print ( n + c )	Title: Vasya and Socks Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya has n pairs of socks. In the morning of each day Vasya has to put on a pair of socks before he goes to school. When he comes home in the evening, Vasya takes off the used socks and throws them away. Every m-th...	```python n, m = map ( int, input ( ).split () ) c = 0 while n >= m : n = n - m + 1 c = c + m print ( n + c ) ```	3
703	A	Mishka and Game	PROGRAMMING	800	[ "implementation" ]		null	null	Mishka is a little polar bear. As known, little bears loves spending their free time playing dice for chocolates. Once in a wonderful sunny morning, walking around blocks of ice, Mishka met her friend Chris, and they started playing the game. Rules of the game are very simple: at first number of rounds n is defined....	The first line of the input contains single integer n n (1<=≤<=n<=≤<=100) — the number of game rounds. The next n lines contains rounds description. i-th of them contains pair of integers mi and ci (1<=≤<=mi,<=<=ci<=≤<=6) — values on dice upper face after Mishka's and Chris' throws in i-th ...	If Mishka is the winner of the game, print "Mishka" (without quotes) in the only line. If Chris is the winner of the game, print "Chris" (without quotes) in the only line. If the result of the game is draw, print "Friendship is magic!^^" (without quotes) in the only line.	[ "3\n3 5\n2 1\n4 2\n", "2\n6 1\n1 6\n", "3\n1 5\n3 3\n2 2\n" ]	[ "Mishka", "Friendship is magic!^^", "Chris" ]	In the first sample case Mishka loses the first round, but wins second and third rounds and thus she is the winner of the game. In the second sample case Mishka wins the first round, Chris wins the second round, and the game ends with draw with score 1:1. In the third sample case Chris wins the first round, but there...	500	[ { "input": "3\n3 5\n2 1\n4 2", "output": "Mishka" }, { "input": "2\n6 1\n1 6", "output": "Friendship is magic!^^" }, { "input": "3\n1 5\n3 3\n2 2", "output": "Chris" }, { "input": "6\n4 1\n4 2\n5 3\n5 1\n5 3\n4 1", "output": "Mishka" }, { "input": "8\n2 4\n1 4\n1 ...	1,685,614,548	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	15	31	0	n = int(input()) m = 0 c = 0 for i in range(n): s = input().split(' ') if int(s[0]) > int(s[1]): m+=1 else: c+=1 if m>c: print('Mishka') elif m<c: print('Chris') else: print('Friendship is magic!^^')	Title: Mishka and Game Time Limit: None seconds Memory Limit: None megabytes Problem Description: Mishka is a little polar bear. As known, little bears loves spending their free time playing dice for chocolates. Once in a wonderful sunny morning, walking around blocks of ice, Mishka met her friend Chris, and they st...	```python n = int(input()) m = 0 c = 0 for i in range(n): s = input().split(' ') if int(s[0]) > int(s[1]): m+=1 else: c+=1 if m>c: print('Mishka') elif m<c: print('Chris') else: print('Friendship is magic!^^') ```	0
361	A	Levko and Table	PROGRAMMING	800	[ "constructive algorithms", "implementation" ]		null	null	Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautiful to Levko if the sum of elements in each row and column of the table equals k. Unfortunately, he doesn't know any such table. Your task is to help him to find at least one of them.	The single line contains two integers, n and k (1<=≤<=n<=≤<=100, 1<=≤<=k<=≤<=1000).	Print any beautiful table. Levko doesn't like too big numbers, so all elements of the table mustn't exceed 1000 in their absolute value. If there are multiple suitable tables, you are allowed to print any of them.	[ "2 4\n", "4 7\n" ]	[ "1 3\n3 1\n", "2 1 0 4\n4 0 2 1\n1 3 3 0\n0 3 2 2\n" ]	In the first sample the sum in the first row is 1 + 3 = 4, in the second row — 3 + 1 = 4, in the first column — 1 + 3 = 4 and in the second column — 3 + 1 = 4. There are other beautiful tables for this sample. In the second sample the sum of elements in each row and each column equals 7. Besides, there are other table...	500	[ { "input": "2 4", "output": "4 0 \n0 4 " }, { "input": "4 7", "output": "7 0 0 0 \n0 7 0 0 \n0 0 7 0 \n0 0 0 7 " }, { "input": "1 8", "output": "8 " }, { "input": "9 3", "output": "3 0 0 0 0 0 0 0 0 \n0 3 0 0 0 0 0 0 0 \n0 0 3 0 0 0 0 0 0 \n0 0 0 3 0 0 0 0 0 \n0 0 0 0 3 0...	1,655,823,603	2,147,483,647	PyPy 3-64	OK	TESTS	22	62	0	n ,m = map(int ,input() .split()) for i in range(n): if i == 0: print(m ,(n - i - 1) * '0 ' ,sep = ' ') else: print(i * '0 ' ,m ,(n - i - 1) * '0 ' ,sep = ' ')	Title: Levko and Table Time Limit: None seconds Memory Limit: None megabytes Problem Description: Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautiful to Levko if the sum of elements in each row and column of the table equals k. Unfortun...	```python n ,m = map(int ,input() .split()) for i in range(n): if i == 0: print(m ,(n - i - 1) * '0 ' ,sep = ' ') else: print(i * '0 ' ,m ,(n - i - 1) * '0 ' ,sep = ' ') ```	3
1	A	Theatre Square	PROGRAMMING	1,000	[ "math" ]	A. Theatre Square	1	256	Theatre Square in the capital city of Berland has a rectangular shape with the size n<=×<=m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size a<=×<=a. What is the least number of flagstones needed to pave the...	The input contains three positive integer numbers in the first line: n,<=<=m and a (1<=≤<=<=n,<=m,<=a<=≤<=109).	Write the needed number of flagstones.	[ "6 6 4\n" ]	[ "4\n" ]	none	0	[ { "input": "6 6 4", "output": "4" }, { "input": "1 1 1", "output": "1" }, { "input": "2 1 1", "output": "2" }, { "input": "1 2 1", "output": "2" }, { "input": "2 2 1", "output": "4" }, { "input": "2 1 2", "output": "1" }, { "input": "1 1 3"...	1,685,108,725	2,147,483,647	Python 3	OK	TESTS	20	31	0	from math import ceil m, n, a = tuple(map(int, input().split())) result = ceil(m / a) * ceil(n / a) print(result)	Title: Theatre Square Time Limit: 1 seconds Memory Limit: 256 megabytes Problem Description: Theatre Square in the capital city of Berland has a rectangular shape with the size n<=×<=m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each ...	```python from math import ceil m, n, a = tuple(map(int, input().split())) result = ceil(m / a) * ceil(n / a) print(result) ```	3.9845
750	A	New Year and Hurry	PROGRAMMING	800	[ "binary search", "brute force", "implementation", "math" ]		null	null	Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve th...	The only line of the input contains two integers n and k (1<=≤<=n<=≤<=10, 1<=≤<=k<=≤<=240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.	Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.	[ "3 222\n", "4 190\n", "7 1\n" ]	[ "2\n", "4\n", "7\n" ]	In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenar...	500	[ { "input": "3 222", "output": "2" }, { "input": "4 190", "output": "4" }, { "input": "7 1", "output": "7" }, { "input": "10 135", "output": "6" }, { "input": "10 136", "output": "5" }, { "input": "1 1", "output": "1" }, { "input": "1 240", ...	1,685,521,875	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	30	0	# 2 inputs n problems, k minutes # output number of completed problems to then make the party before midnight (within 4 hours total) def solved_problems(n, k): solved = 0 time_to_solve = 240 - k for i in range(1, n + 1): # range 2nd parameter is not included so n+1 is required to get a list of nu...	Title: New Year and Hurry Time Limit: None seconds Memory Limit: None megabytes Problem Description: Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem...	```python # 2 inputs n problems, k minutes # output number of completed problems to then make the party before midnight (within 4 hours total) def solved_problems(n, k): solved = 0 time_to_solve = 240 - k for i in range(1, n + 1): # range 2nd parameter is not included so n+1 is required to get a ...	0
404	A	Valera and X	PROGRAMMING	1,000	[ "implementation" ]		null	null	Valera is a little boy. Yesterday he got a huge Math hometask at school, so Valera didn't have enough time to properly learn the English alphabet for his English lesson. Unfortunately, the English teacher decided to have a test on alphabet today. At the test Valera got a square piece of squared paper. The length of the...	The first line contains integer n (3<=≤<=n<=<<=300; n is odd). Each of the next n lines contains n small English letters — the description of Valera's paper.	Print string "YES", if the letters on the paper form letter "X". Otherwise, print string "NO". Print the strings without quotes.	[ "5\nxooox\noxoxo\nsoxoo\noxoxo\nxooox\n", "3\nwsw\nsws\nwsw\n", "3\nxpx\npxp\nxpe\n" ]	[ "NO\n", "YES\n", "NO\n" ]	none	500	[ { "input": "5\nxooox\noxoxo\nsoxoo\noxoxo\nxooox", "output": "NO" }, { "input": "3\nwsw\nsws\nwsw", "output": "YES" }, { "input": "3\nxpx\npxp\nxpe", "output": "NO" }, { "input": "5\nliiil\nilili\niilii\nilili\nliiil", "output": "YES" }, { "input": "7\nbwccccb\nck...	1,593,494,350	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	19	109	6,963,200	n = int(input()) l = [] mid =int(( n - 1 ) / 2) status_2 = 0 status_1 = 0 diag = 0 ls = [] res = 0 for i in range(n): l.append(input()) d = l[mid][mid] ''' Checks for diagonals''' for i in range(n): if l[i][i] == d: status_1 = 1 ls.append(l[i][i]) else: status_1 = 0 break for i ...	Title: Valera and X Time Limit: None seconds Memory Limit: None megabytes Problem Description: Valera is a little boy. Yesterday he got a huge Math hometask at school, so Valera didn't have enough time to properly learn the English alphabet for his English lesson. Unfortunately, the English teacher decided to have a...	```python n = int(input()) l = [] mid =int(( n - 1 ) / 2) status_2 = 0 status_1 = 0 diag = 0 ls = [] res = 0 for i in range(n): l.append(input()) d = l[mid][mid] ''' Checks for diagonals''' for i in range(n): if l[i][i] == d: status_1 = 1 ls.append(l[i][i]) else: status_1 = 0 bre...	0
379	A	New Year Candles	PROGRAMMING	1,000	[ "implementation" ]		null	null	Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles. Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make b went out candles into a new candle. As a result, this new candle can be used ...	The single line contains two integers, a and b (1<=≤<=a<=≤<=1000; 2<=≤<=b<=≤<=1000).	Print a single integer — the number of hours Vasily can light up the room for.	[ "4 2\n", "6 3\n" ]	[ "7\n", "8\n" ]	Consider the first sample. For the first four hours Vasily lights up new candles, then he uses four burned out candles to make two new ones and lights them up. When these candles go out (stop burning), Vasily can make another candle. Overall, Vasily can light up the room for 7 hours.	500	[ { "input": "4 2", "output": "7" }, { "input": "6 3", "output": "8" }, { "input": "1000 1000", "output": "1001" }, { "input": "123 5", "output": "153" }, { "input": "1000 2", "output": "1999" }, { "input": "1 2", "output": "1" }, { "input": ...	1,656,567,817	2,147,483,647	PyPy 3-64	OK	TESTS	32	108	512,000	n, m = map(int, input().split()) ans = n while n // m > 0: ans += n // m n = n // m + n % m print(ans)	Title: New Year Candles Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles. Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is s...	```python n, m = map(int, input().split()) ans = n while n // m > 0: ans += n // m n = n // m + n % m print(ans) ```	3
108	A	Palindromic Times	PROGRAMMING	1,000	[ "implementation", "strings" ]	A. Palindromic Times	2	256	Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues. On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on th...	The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.	Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.	[ "12:21\n", "23:59\n" ]	[ "13:31\n", "00:00\n" ]	none	500	[ { "input": "12:21", "output": "13:31" }, { "input": "23:59", "output": "00:00" }, { "input": "15:51", "output": "20:02" }, { "input": "10:44", "output": "11:11" }, { "input": "04:02", "output": "04:40" }, { "input": "02:11", "output": "02:20" }, ...	1,621,410,367	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	4	154	0	a,b=input().split(":") a=int(a) b=int(b) l1=['00','01','02','03','04','05','06','10','11','12','13','14','15','20','21','22','23'] l2=['00','10','20','30','40','50','60','01','11','21','31','41','51','02','12','23','32'] for i in range(len(l1)): if(i<len(l1)-1 and int(l1[i])==a and int(l2[i])==b): pr...	Title: Palindromic Times Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues. On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling...	```python a,b=input().split(":") a=int(a) b=int(b) l1=['00','01','02','03','04','05','06','10','11','12','13','14','15','20','21','22','23'] l2=['00','10','20','30','40','50','60','01','11','21','31','41','51','02','12','23','32'] for i in range(len(l1)): if(i<len(l1)-1 and int(l1[i])==a and int(l2[i])==b): ...	0
490	A	Team Olympiad	PROGRAMMING	800	[ "greedy", "implementation", "sortings" ]		null	null	The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each child we know value ti: - ti<==<=1, if the i-th child is good at prog...	The first line contains integer n (1<=≤<=n<=≤<=5000) — the number of children in the school. The second line contains n integers t1,<=t2,<=...,<=tn (1<=≤<=ti<=≤<=3), where ti describes the skill of the i-th child.	In the first line output integer w — the largest possible number of teams. Then print w lines, containing three numbers in each line. Each triple represents the indexes of the children forming the team. You can print both the teams, and the numbers in the triplets in any order. The children are numbered from 1 to...	[ "7\n1 3 1 3 2 1 2\n", "4\n2 1 1 2\n" ]	[ "2\n3 5 2\n6 7 4\n", "0\n" ]	none	500	[ { "input": "7\n1 3 1 3 2 1 2", "output": "2\n3 5 2\n6 7 4" }, { "input": "4\n2 1 1 2", "output": "0" }, { "input": "1\n2", "output": "0" }, { "input": "2\n3 1", "output": "0" }, { "input": "3\n2 1 2", "output": "0" }, { "input": "3\n1 2 3", "output...	1,680,964,797	2,147,483,647	Python 3	OK	TESTS	41	202	0	w=int(input()) lst = list(map(int,input().split())) one =lst.count(1) two =lst.count(2) three =lst.count(3) teams=min(one,two,three) print(teams) for r in range(teams): idx1=lst.index(1) idx2 = lst.index(2) idx3 = lst.index(3) print(idx1+1 , idx2+1, idx3+1) lst[idx1]=-1 lst[idx2]=-1 lst[idx3...	Title: Team Olympiad Time Limit: None seconds Memory Limit: None megabytes Problem Description: The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education)...	```python w=int(input()) lst = list(map(int,input().split())) one =lst.count(1) two =lst.count(2) three =lst.count(3) teams=min(one,two,three) print(teams) for r in range(teams): idx1=lst.index(1) idx2 = lst.index(2) idx3 = lst.index(3) print(idx1+1 , idx2+1, idx3+1) lst[idx1]=-1 lst[idx2]=-1 ...	3
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...	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....	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"...	1,693,647,896	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	62	0	n = int(input()) arr = list(map(int, input().split())) min_val = arr[0] max_val = arr[0] min_idx = 0 max_idx = 0 for i in range(1, n): a = arr[i] if a > max_val: max_val = a max_idx = i if a <= min_val: min_val = a min_idx = i if min_idx < max_idx: mo...	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 t...	```python n = int(input()) arr = list(map(int, input().split())) min_val = arr[0] max_val = arr[0] min_idx = 0 max_idx = 0 for i in range(1, n): a = arr[i] if a > max_val: max_val = a max_idx = i if a <= min_val: min_val = a min_idx = i if min_idx < max_id...	0
898	A	Rounding	PROGRAMMING	800	[ "implementation", "math" ]		null	null	Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded. For example, if n<==<=4722 answer is 4720. If n<==<=5 Vasya can round it to 0 or to 10. Both ways are correct. For given n find out to which int...	The first line contains single integer n (0<=≤<=n<=≤<=109) — number that Vasya has.	Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.	[ "5\n", "113\n", "1000000000\n", "5432359\n" ]	[ "0\n", "110\n", "1000000000\n", "5432360\n" ]	In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10.	500	[ { "input": "5", "output": "0" }, { "input": "113", "output": "110" }, { "input": "1000000000", "output": "1000000000" }, { "input": "5432359", "output": "5432360" }, { "input": "999999994", "output": "999999990" }, { "input": "10", "output": "10" ...	1,573,496,294	2,147,483,647	Python 3	OK	TESTS	64	124	0	a = int(input()) mod = a%10 if mod<5: print(a-mod) else: print(a+(10-mod))	Title: Rounding Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded. For example, if n<==<=4722 answer is 4720. If n<==<=5...	```python a = int(input()) mod = a%10 if mod<5: print(a-mod) else: print(a+(10-mod)) ```	3
722	C	Destroying Array	PROGRAMMING	1,600	[ "data structures", "dsu" ]		null	null	You are given an array consisting of n non-negative integers a1,<=a2,<=...,<=an. You are going to destroy integers in the array one by one. Thus, you are given the permutation of integers from 1 to n defining the order elements of the array are destroyed. After each element is destroyed you have to find o...	The first line of the input contains a single integer n (1<=≤<=n<=≤<=100<=000) — the length of the array. The second line contains n integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=109). The third line contains a permutation of integers from 1 to n — the order used to destroy elements.	Print n lines. The i-th line should contain a single integer — the maximum possible sum of elements on the segment containing no destroyed elements, after first i operations are performed.	[ "4\n1 3 2 5\n3 4 1 2\n", "5\n1 2 3 4 5\n4 2 3 5 1\n", "8\n5 5 4 4 6 6 5 5\n5 2 8 7 1 3 4 6\n" ]	[ "5\n4\n3\n0\n", "6\n5\n5\n1\n0\n", "18\n16\n11\n8\n8\n6\n6\n0\n" ]	Consider the first sample: 1. Third element is destroyed. Array is now 1 3 * 5. Segment with maximum sum 5 consists of one integer 5. 1. Fourth element is destroyed. Array is now 1 3 * * . Segment with maximum sum 4 consists of two integers 1 3. 1. First element is destroyed. Array is now * 3 * * . Segme...	1,000	[ { "input": "4\n1 3 2 5\n3 4 1 2", "output": "5\n4\n3\n0" }, { "input": "5\n1 2 3 4 5\n4 2 3 5 1", "output": "6\n5\n5\n1\n0" }, { "input": "8\n5 5 4 4 6 6 5 5\n5 2 8 7 1 3 4 6", "output": "18\n16\n11\n8\n8\n6\n6\n0" }, { "input": "10\n3 3 3 5 6 9 3 1 7 3\n3 4 6 7 5 1 10 9 2 8"...	1,475,335,881	5,181	Python 3	TIME_LIMIT_EXCEEDED	PRETESTS	12	1,000	1,843,200	#!/usr/bin/env python3 def sumaxima(ints): maximo=0 suma=0 for i in ints: if ( i==-1): if (suma>maximo): maximo=suma suma=0 else: suma+=i if (suma>maximo): maximo=suma return maximo n = int(input()) vectur =[int(i) for i in...	Title: Destroying Array Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given an array consisting of n non-negative integers a1,<=a2,<=...,<=an. You are going to destroy integers in the array one by one. Thus, you are given the permutation of integers from 1 to n defin...	```python #!/usr/bin/env python3 def sumaxima(ints): maximo=0 suma=0 for i in ints: if ( i==-1): if (suma>maximo): maximo=suma suma=0 else: suma+=i if (suma>maximo): maximo=suma return maximo n = int(input()) vectur =[int(i...	0
749	A	Bachgold Problem	PROGRAMMING	800	[ "greedy", "implementation", "math", "number theory" ]		null	null	Bachgold problem is very easy to formulate. Given a positive integer n represent it as a sum of maximum possible number of prime numbers. One can prove that such representation exists for any integer greater than 1. Recall that integer k is called prime if it is greater than 1 and has exactly two positive integer ...	The only line of the input contains a single integer n (2<=≤<=n<=≤<=100<=000).	The first line of the output contains a single integer k — maximum possible number of primes in representation. The second line should contain k primes with their sum equal to n. You can print them in any order. If there are several optimal solution, print any of them.	[ "5\n", "6\n" ]	[ "2\n2 3\n", "3\n2 2 2\n" ]	none	500	[ { "input": "5", "output": "2\n2 3" }, { "input": "6", "output": "3\n2 2 2" }, { "input": "2", "output": "1\n2" }, { "input": "3", "output": "1\n3" }, { "input": "99999", "output": "49999\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,660,278,105	2,147,483,647	Python 3	OK	TESTS	41	77	204,800	import math num = int(input()) arr = "" lenz = 0 if num % 2 == 0: lenz = int(num/2) for i in range(lenz): if i != lenz - 1: arr += "2 " else: arr += "2" else: lenz = math.floor(num/2) lenz2 = math.floor(num/2) - 1 while lenz2 > 0: ar...	Title: Bachgold Problem Time Limit: None seconds Memory Limit: None megabytes Problem Description: Bachgold problem is very easy to formulate. Given a positive integer n represent it as a sum of maximum possible number of prime numbers. One can prove that such representation exists for any integer greater than 1. ...	```python import math num = int(input()) arr = "" lenz = 0 if num % 2 == 0: lenz = int(num/2) for i in range(lenz): if i != lenz - 1: arr += "2 " else: arr += "2" else: lenz = math.floor(num/2) lenz2 = math.floor(num/2) - 1 while lenz2 > 0: ...	3
937	A	Olympiad	PROGRAMMING	800	[ "implementation", "sortings" ]		null	null	The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points. As the head of the programming committee, you are to determine the set of participants to be awarded with diplomas with respect to the following criteria: - At least one participant should get a di...	The first line contains a single integer n (1<=≤<=n<=≤<=100) — the number of participants. The next line contains a sequence of n integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=600) — participants' scores. It's guaranteed that at least one participant has non-zero score.	Print a single integer — the desired number of ways.	[ "4\n1 3 3 2\n", "3\n1 1 1\n", "4\n42 0 0 42\n" ]	[ "3\n", "1\n", "1\n" ]	There are three ways to choose a subset in sample case one. 1. Only participants with 3 points will get diplomas. 1. Participants with 2 or 3 points will get diplomas. 1. Everyone will get a diploma! The only option in sample case two is to award everyone. Note that in sample case three participants with zero sco...	500	[ { "input": "4\n1 3 3 2", "output": "3" }, { "input": "3\n1 1 1", "output": "1" }, { "input": "4\n42 0 0 42", "output": "1" }, { "input": "10\n1 0 1 0 1 0 0 0 0 1", "output": "1" }, { "input": "10\n572 471 540 163 50 30 561 510 43 200", "output": "10" }, { ...	1,637,846,115	2,147,483,647	Python 3	OK	TESTS	21	46	0	n=int(input()) a = list(input().split()) for i in range(len(a)): a[i] = int(a[i]) s = [] for i in a: if i not in s: s.append(i) if 0 in s: s.remove(0) print(len(s))	Title: Olympiad Time Limit: None seconds Memory Limit: None megabytes Problem Description: The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points. As the head of the programming committee, you are to determine the set of participants to be awarded with ...	```python n=int(input()) a = list(input().split()) for i in range(len(a)): a[i] = int(a[i]) s = [] for i in a: if i not in s: s.append(i) if 0 in s: s.remove(0) print(len(s)) ```	3
637	B	Chat Order	PROGRAMMING	1,200	[ "*special", "binary search", "constructive algorithms", "data structures", "sortings" ]		null	null	Polycarp is a big lover of killing time in social networks. A page with a chatlist in his favourite network is made so that when a message is sent to some friend, his friend's chat rises to the very top of the page. The relative order of the other chats doesn't change. If there was no chat with this friend before, then...	The first line contains integer n (1<=≤<=n<=≤<=200<=000) — the number of Polycarpus' messages. Next n lines enlist the message recipients in the order in which the messages were sent. The name of each participant is a non-empty sequence of lowercase English letters of length at most 10.	Print all the recipients to who Polycarp talked to in the order of chats with them, from top to bottom.	[ "4\nalex\nivan\nroman\nivan\n", "8\nalina\nmaria\nekaterina\ndarya\ndarya\nekaterina\nmaria\nalina\n" ]	[ "ivan\nroman\nalex\n", "alina\nmaria\nekaterina\ndarya\n" ]	In the first test case Polycarpus first writes to friend by name "alex", and the list looks as follows: 1. alex Then Polycarpus writes to friend by name "ivan" and the list looks as follows: 1. ivan 1. alex Polycarpus writes the third message to friend by name "roman" and the list looks as follows: 1. roman 1...	1,000	[ { "input": "4\nalex\nivan\nroman\nivan", "output": "ivan\nroman\nalex" }, { "input": "8\nalina\nmaria\nekaterina\ndarya\ndarya\nekaterina\nmaria\nalina", "output": "alina\nmaria\nekaterina\ndarya" }, { "input": "1\nwdi", "output": "wdi" }, { "input": "2\nypg\nypg", "outpu...	1,666,875,955	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	12	3,000	716,800	n=int(input()) namch = [] for i in range(n): ch = input() if ch not in namch: namch.append(ch) else: namch.remove(ch) namch.append(ch) for i in range(len(namch)-1, -1, -1): print(namch[i])	Title: Chat Order Time Limit: None seconds Memory Limit: None megabytes Problem Description: Polycarp is a big lover of killing time in social networks. A page with a chatlist in his favourite network is made so that when a message is sent to some friend, his friend's chat rises to the very top of the page. The rela...	```python n=int(input()) namch = [] for i in range(n): ch = input() if ch not in namch: namch.append(ch) else: namch.remove(ch) namch.append(ch) for i in range(len(namch)-1, -1, -1): print(namch[i]) ```	0
996	A	Hit the Lottery	PROGRAMMING	800	[ "dp", "greedy" ]		null	null	Allen has a LOT of money. He has $n$ dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are $1$, $5$, $10$, $20$, $100$. What is the minimum number of bills Allen could receive after withdrawing his entire balance?	The first and only line of input contains a single integer $n$ ($1 \le n \le 10^9$).	Output the minimum number of bills that Allen could receive.	[ "125\n", "43\n", "1000000000\n" ]	[ "3\n", "5\n", "10000000\n" ]	In the first sample case, Allen can withdraw this with a $100$ dollar bill, a $20$ dollar bill, and a $5$ dollar bill. There is no way for Allen to receive $125$ dollars in one or two bills. In the second sample case, Allen can withdraw two $20$ dollar bills and three $1$ dollar bills. In the third sample case, Allen...	500	[ { "input": "125", "output": "3" }, { "input": "43", "output": "5" }, { "input": "1000000000", "output": "10000000" }, { "input": "4", "output": "4" }, { "input": "5", "output": "1" }, { "input": "1", "output": "1" }, { "input": "74", "o...	1,688,115,592	2,147,483,647	Python 3	OK	TESTS	49	46	0	n=int(input()) l=[1,5,10,20,100] c=0 while(n>0): if(max(l)<=n): c=c+(n//max(l)) n=n%(max(l)) else: l.remove(max(l)) print(c)	Title: Hit the Lottery Time Limit: None seconds Memory Limit: None megabytes Problem Description: Allen has a LOT of money. He has $n$ dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are $1$, $5$, $10$, $20$, $100$...	```python n=int(input()) l=[1,5,10,20,100] c=0 while(n>0): if(max(l)<=n): c=c+(n//max(l)) n=n%(max(l)) else: l.remove(max(l)) print(c) ```	3
658	A	Bear and Reverse Radewoosh	PROGRAMMING	800	[ "implementation" ]		null	null	Limak and Radewoosh are going to compete against each other in the upcoming algorithmic contest. They are equally skilled but they won't solve problems in the same order. There will be n problems. The i-th problem has initial score pi and it takes exactly ti minutes to solve it. Problems are sorted by diff...	The first line contains two integers n and c (1<=≤<=n<=≤<=50,<=1<=≤<=c<=≤<=1000) — the number of problems and the constant representing the speed of loosing points. The second line contains n integers p1,<=p2,<=...,<=pn (1<=≤<=pi<=≤<=1000,<=pi<=<<=pi<=+<=1) — initial scores. The third...	Print "Limak" (without quotes) if Limak will get more points in total. Print "Radewoosh" (without quotes) if Radewoosh will get more points in total. Print "Tie" (without quotes) if Limak and Radewoosh will get the same total number of points.	[ "3 2\n50 85 250\n10 15 25\n", "3 6\n50 85 250\n10 15 25\n", "8 1\n10 20 30 40 50 60 70 80\n8 10 58 63 71 72 75 76\n" ]	[ "Limak\n", "Radewoosh\n", "Tie\n" ]	In the first sample, there are 3 problems. Limak solves them as follows: 1. Limak spends 10 minutes on the 1-st problem and he gets 50 - c·10 = 50 - 2·10 = 30 points. 1. Limak spends 15 minutes on the 2-nd problem so he submits it 10 + 15 = 25 minutes after the start of the contest. For the 2-nd problem he gets 85...	500	[ { "input": "3 2\n50 85 250\n10 15 25", "output": "Limak" }, { "input": "3 6\n50 85 250\n10 15 25", "output": "Radewoosh" }, { "input": "8 1\n10 20 30 40 50 60 70 80\n8 10 58 63 71 72 75 76", "output": "Tie" }, { "input": "4 1\n3 5 6 9\n1 2 4 8", "output": "Limak" }, {...	1,552,818,355	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	19	108	0	# import sys # sys.stdin=open("test11.in","r") # sys.stdout=open("test11.out","w") n,c=map(int,input().split()) p=list(map(int,input().split())) t=list(map(int,input().split())) l=0 r=0 e=0 y=0 for i in range(n): e+=t[i] if((p[i]-ce)>0): l+=(p[i]-ce) else: l+=0 for i in range(n-1,0,-1):...	Title: Bear and Reverse Radewoosh Time Limit: None seconds Memory Limit: None megabytes Problem Description: Limak and Radewoosh are going to compete against each other in the upcoming algorithmic contest. They are equally skilled but they won't solve problems in the same order. There will be n problems. The i-...	```python # import sys # sys.stdin=open("test11.in","r") # sys.stdout=open("test11.out","w") n,c=map(int,input().split()) p=list(map(int,input().split())) t=list(map(int,input().split())) l=0 r=0 e=0 y=0 for i in range(n): e+=t[i] if((p[i]-ce)>0): l+=(p[i]-ce) else: l+=0 for i in range(...	0
107	B	Basketball Team	PROGRAMMING	1,600	[ "combinatorics", "dp", "math", "probabilities" ]	B. Basketball Team	1	256	As a German University in Cairo (GUC) student and a basketball player, Herr Wafa was delighted once he heard the news. GUC is finally participating in the Annual Basketball Competition (ABC). A team is to be formed of n players, all of which are GUC students. However, the team might have players belonging to differ...	The first line contains three integers n, m and h (1<=≤<=n<=≤<=100,<=1<=≤<=m<=≤<=1000,<=1<=≤<=h<=≤<=m) — the number of players on the team, the number of departments in GUC and Herr Wafa's department, correspondingly. The second line contains a single-space-separated list of m integers si (1<=≤<=*...	Print the probability that Herr Wafa will have at least one teammate from his department. If there is not enough basketball players in GUC to participate in ABC, print -1. The answer will be accepted if it has absolute or relative error not exceeding 10<=-<=6.	[ "3 2 1\n2 1\n", "3 2 1\n1 1\n", "3 2 1\n2 2\n" ]	[ "1\n", "-1\n", "0.666667\n" ]	In the first example all 3 players (2 from department 1 and 1 from department 2) must be chosen for the team. Both players from Wafa's departments will be chosen, so he's guaranteed to have a teammate from his department. In the second example, there are not enough players. In the third example, there are three possi...	1,000	[ { "input": "3 2 1\n2 1", "output": "1" }, { "input": "3 2 1\n1 1", "output": "-1" }, { "input": "3 2 1\n2 2", "output": "0.666667" }, { "input": "3 2 1\n1 2", "output": "0.000000" }, { "input": "6 5 3\n5 2 3 10 5", "output": "0.380435" }, { "input": "7...	1,627,297,119	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	20	1,000	6,963,200	import math def get(x, y): if (x < y): return 0 a, b, c = [i for i in range(1, x + 1)], [i for i in range(1, y + 1)], [i for i in range(1, x - y + 1)] for i in range(len(a)): for j in range(len(b)): g = math.gcd(a[i], b[j]) a[i] //= g b[j] //= g for...	Title: Basketball Team Time Limit: 1 seconds Memory Limit: 256 megabytes Problem Description: As a German University in Cairo (GUC) student and a basketball player, Herr Wafa was delighted once he heard the news. GUC is finally participating in the Annual Basketball Competition (ABC). A team is to be formed of n...	```python import math def get(x, y): if (x < y): return 0 a, b, c = [i for i in range(1, x + 1)], [i for i in range(1, y + 1)], [i for i in range(1, x - y + 1)] for i in range(len(a)): for j in range(len(b)): g = math.gcd(a[i], b[j]) a[i] //= g b[j] //= ...	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....	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...	1,598,349,979	2,147,483,647	PyPy 3	OK	TESTS	40	312	0	# -- coding: utf-8 -- """ Created on Tue Aug 25 13:12:49 2020 @author: Yogesh Panjwani """ s=input() t=input() s=s[::-1] if s==t: 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 pron...	```python # -- coding: utf-8 -- """ Created on Tue Aug 25 13:12:49 2020 @author: Yogesh Panjwani """ s=input() t=input() s=s[::-1] if s==t: print("YES") else: print("NO") ```	3.922
144	A	Arrival of the General	PROGRAMMING	800	[ "implementation" ]		null	null	A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers to line up on the parade ground. By the military charter the soldiers should stand in the order of non-increasing of their...	The first input line contains the only integer n (2<=≤<=n<=≤<=100) which represents the number of soldiers in the line. The second line contains integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=100) the values of the soldiers' heights in the order of soldiers' heights' increasing in the order from the beginnin...	Print the only integer — the minimum number of seconds the colonel will need to form a line-up the general will like.	[ "4\n33 44 11 22\n", "7\n10 10 58 31 63 40 76\n" ]	[ "2\n", "10\n" ]	In the first sample the colonel will need to swap the first and second soldier and then the third and fourth soldier. That will take 2 seconds. The resulting position of the soldiers is (44, 33, 22, 11). In the second sample the colonel may swap the soldiers in the following sequence: 1. (10, 10, 58, 31, 63, 40, 76)...	500	[ { "input": "4\n33 44 11 22", "output": "2" }, { "input": "7\n10 10 58 31 63 40 76", "output": "10" }, { "input": "2\n88 89", "output": "1" }, { "input": "5\n100 95 100 100 88", "output": "0" }, { "input": "7\n48 48 48 48 45 45 45", "output": "0" }, { "...	1,699,087,770	2,147,483,647	Python 3	COMPILATION_ERROR	TESTS	0	0	0	n = int(input()) nums = list(map(int,input().split(' '))) mini=min(nums) maxi=max(nums) a=0 b=0 for i in range len(nums): if nums[i]==maxi: a=i break for i in range (len(nums)-1,0,-1): if nums[i]==mini: b=len(nums)-i-2 break print(a+b)	Title: Arrival of the General Time Limit: None seconds Memory Limit: None megabytes Problem Description: A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers to line up on t...	```python n = int(input()) nums = list(map(int,input().split(' '))) mini=min(nums) maxi=max(nums) a=0 b=0 for i in range len(nums): if nums[i]==maxi: a=i break for i in range (len(nums)-1,0,-1): if nums[i]==mini: b=len(nums)-i-2 break print(a+b) ```	-1
928	A	Login Verification	PROGRAMMING	1,200	[ "*special", "strings" ]		null	null	When registering in a social network, users are allowed to create their own convenient login to make it easier to share contacts, print it on business cards, etc. Login is an arbitrary sequence of lower and uppercase latin letters, digits and underline symbols («_»). However, in order to decrease the number of frauds ...	The first line contains a non-empty string s consisting of lower and uppercase latin letters, digits and underline symbols («_») with length not exceeding 50 — the login itself. The second line contains a single integer n (1<=≤<=n<=≤<=1<=000) — the number of existing logins. The next n lines describe the exi...	Print «Yes» (without quotes), if user can register via this login, i.e. none of the existing logins is similar with it. Otherwise print «No» (without quotes).	[ "1_wat\n2\n2_wat\nwat_1\n", "000\n3\n00\nooA\noOo\n", "_i_\n3\n__i_\n_1_\nI\n", "La0\n3\n2a0\nLa1\n1a0\n", "abc\n1\naBc\n", "0Lil\n2\nLIL0\n0Ril\n" ]	[ "Yes\n", "No\n", "No\n", "No\n", "No\n", "Yes\n" ]	In the second sample case the user wants to create a login consisting of three zeros. It's impossible due to collision with the third among the existing. In the third sample case the new login is similar with the second one.	500	[ { "input": "1_wat\n2\n2_wat\nwat_1", "output": "Yes" }, { "input": "000\n3\n00\nooA\noOo", "output": "No" }, { "input": "_i_\n3\n__i_\n_1_\nI", "output": "No" }, { "input": "La0\n3\n2a0\nLa1\n1a0", "output": "No" }, { "input": "abc\n1\naBc", "output": "No" }...	1,519,494,354	7,854	Python 3	OK	TESTS	73	77	5,632,000	need = input() n = int(input()) lst = [] for i in range(n): lst.append(input()) need = need.lower() need = need.replace('o', '0') need = need.replace('l', '1') need = need.replace('i', '1') for i in range(n): lst[i] = lst[i].lower() lst[i] = lst[i].replace('o', '0') lst[i] = lst[i].re...	Title: Login Verification Time Limit: None seconds Memory Limit: None megabytes Problem Description: When registering in a social network, users are allowed to create their own convenient login to make it easier to share contacts, print it on business cards, etc. Login is an arbitrary sequence of lower and uppercas...	```python need = input() n = int(input()) lst = [] for i in range(n): lst.append(input()) need = need.lower() need = need.replace('o', '0') need = need.replace('l', '1') need = need.replace('i', '1') for i in range(n): lst[i] = lst[i].lower() lst[i] = lst[i].replace('o', '0') lst[i] =...	3
108	A	Palindromic Times	PROGRAMMING	1,000	[ "implementation", "strings" ]	A. Palindromic Times	2	256	Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues. On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on th...	The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.	Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.	[ "12:21\n", "23:59\n" ]	[ "13:31\n", "00:00\n" ]	none	500	[ { "input": "12:21", "output": "13:31" }, { "input": "23:59", "output": "00:00" }, { "input": "15:51", "output": "20:02" }, { "input": "10:44", "output": "11:11" }, { "input": "04:02", "output": "04:40" }, { "input": "02:11", "output": "02:20" }, ...	1,578,050,567	2,147,483,647	PyPy 3	OK	TESTS	36	278	0	hh, mm = map(int, input().split(":")) for i in range(hh, 24): for j in range(0 + [0, mm][hh==i], 60): if i != hh or mm != j: if i < 10: hh_ans = "0"+str(i) else: hh_ans = str(i) if j < 10: mm_ans = "0"+str(j) ...	Title: Palindromic Times Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues. On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling...	```python hh, mm = map(int, input().split(":")) for i in range(hh, 24): for j in range(0 + [0, mm][hh==i], 60): if i != hh or mm != j: if i < 10: hh_ans = "0"+str(i) else: hh_ans = str(i) if j < 10: mm_ans = "0"+s...	3.9305
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 ...	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...	1,599,321,170	2,147,483,647	Python 3	OK	TESTS	61	248	307,200	n=int(input()) a=list(map(int,input().split())) b=[] for i in a: b.append(a.count(i)) print(max(b), len(set(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...	```python n=int(input()) a=list(map(int,input().split())) b=[] for i in a: b.append(a.count(i)) print(max(b), len(set(a))) ```	3.937428
327	A	Flipping Game	PROGRAMMING	1,200	[ "brute force", "dp", "implementation" ]		null	null	Iahub got bored, so he invented a game to be played on paper. He writes n integers a1,<=a2,<=...,<=an. Each of those integers can be either 0 or 1. He's allowed to do exactly one move: he chooses two indices i and j (1<=≤<=i<=≤<=j<=≤<=n) and flips all values ak for which their positions are in...	The first line of the input contains an integer n (1<=≤<=n<=≤<=100). In the second line of the input there are n integers: a1,<=a2,<=...,<=an. It is guaranteed that each of those n values is either 0 or 1.	Print an integer — the maximal number of 1s that can be obtained after exactly one move.	[ "5\n1 0 0 1 0\n", "4\n1 0 0 1\n" ]	[ "4\n", "4\n" ]	In the first case, flip the segment from 2 to 5 (i = 2, j = 5). That flip changes the sequence, it becomes: [1 1 1 0 1]. So, it contains four ones. There is no way to make the whole sequence equal to [1 1 1 1 1]. In the second case, flipping only the second and the third element (i = 2, j = 3) will turn all nu...	500	[ { "input": "5\n1 0 0 1 0", "output": "4" }, { "input": "4\n1 0 0 1", "output": "4" }, { "input": "1\n1", "output": "0" }, { "input": "1\n0", "output": "1" }, { "input": "8\n1 0 0 0 1 0 0 0", "output": "7" }, { "input": "18\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...	1,676,747,656	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	2	154	0	from itertools import accumulate n = int(input()) A = list(map(int,input().strip().split())) dp = list(accumulate(A)) s = m = dp[-1] for l in range(n): for r in range(l,n): m = max(m,s + r-l+1- 2*(dp[r] - (dp[l-1] if l!=0 else 0))) print(m)	Title: Flipping Game Time Limit: None seconds Memory Limit: None megabytes Problem Description: Iahub got bored, so he invented a game to be played on paper. He writes n integers a1,<=a2,<=...,<=an. Each of those integers can be either 0 or 1. He's allowed to do exactly one move: he chooses two indices *...	```python from itertools import accumulate n = int(input()) A = list(map(int,input().strip().split())) dp = list(accumulate(A)) s = m = dp[-1] for l in range(n): for r in range(l,n): m = max(m,s + r-l+1- 2*(dp[r] - (dp[l-1] if l!=0 else 0))) print(m) ```	0
1	A	Theatre Square	PROGRAMMING	1,000	[ "math" ]	A. Theatre Square	1	256	Theatre Square in the capital city of Berland has a rectangular shape with the size n<=×<=m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size a<=×<=a. What is the least number of flagstones needed to pave the...	The input contains three positive integer numbers in the first line: n,<=<=m and a (1<=≤<=<=n,<=m,<=a<=≤<=109).	Write the needed number of flagstones.	[ "6 6 4\n" ]	[ "4\n" ]	none	0	[ { "input": "6 6 4", "output": "4" }, { "input": "1 1 1", "output": "1" }, { "input": "2 1 1", "output": "2" }, { "input": "1 2 1", "output": "2" }, { "input": "2 2 1", "output": "4" }, { "input": "2 1 2", "output": "1" }, { "input": "1 1 3"...	1,662,806,021	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	46	0	# -- coding: utf-8 -- """ Created on Sat Sep 10 18:26:57 2022 @author: lenovo """ m,n,a=input().split() i=int(m)//int(a)+1 j=int(n)//int(a)+1 print(i*j)	Title: Theatre Square Time Limit: 1 seconds Memory Limit: 256 megabytes Problem Description: Theatre Square in the capital city of Berland has a rectangular shape with the size n<=×<=m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each ...	```python # -- coding: utf-8 -- """ Created on Sat Sep 10 18:26:57 2022 @author: lenovo """ m,n,a=input().split() i=int(m)//int(a)+1 j=int(n)//int(a)+1 print(i*j) ```	0
709	A	Juicer	PROGRAMMING	900	[ "implementation" ]		null	null	Kolya is going to make fresh orange juice. He has n oranges of sizes a1,<=a2,<=...,<=an. Kolya will put them in the juicer in the fixed order, starting with orange of size a1, then orange of size a2 and so on. To be put in the juicer the orange must have size not exceeding b, so if Kolya sees an orange ...	The first line of the input contains three integers n, b and d (1<=≤<=n<=≤<=100<=000, 1<=≤<=b<=≤<=d<=≤<=1<=000<=000) — the number of oranges, the maximum size of the orange that fits in the juicer and the value d, which determines the condition when the waste section should be emptied. The second line co...	Print one integer — the number of times Kolya will have to empty the waste section.	[ "2 7 10\n5 6\n", "1 5 10\n7\n", "3 10 10\n5 7 7\n", "1 1 1\n1\n" ]	[ "1\n", "0\n", "1\n", "0\n" ]	In the first sample, Kolya will squeeze the juice from two oranges and empty the waste section afterwards. In the second sample, the orange won't fit in the juicer so Kolya will have no juice at all.	500	[ { "input": "2 7 10\n5 6", "output": "1" }, { "input": "1 5 10\n7", "output": "0" }, { "input": "3 10 10\n5 7 7", "output": "1" }, { "input": "1 1 1\n1", "output": "0" }, { "input": "2 951637 951638\n44069 951637", "output": "1" }, { "input": "50 100 12...	1,642,547,400	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	4	93	7,372,800	import math def no_of_waste_operations(parameters,orange_sizes): orange_used=[] index=0 summation=0 for i in range(parameters[0]): if(orange_sizes[i]<=parameters[1]): orange_used.insert(index,orange_sizes[i]) index+=1 summation=sum(orange_used) pre_res...	Title: Juicer Time Limit: None seconds Memory Limit: None megabytes Problem Description: Kolya is going to make fresh orange juice. He has n oranges of sizes a1,<=a2,<=...,<=an. Kolya will put them in the juicer in the fixed order, starting with orange of size a1, then orange of size a2 and so on. To b...	```python import math def no_of_waste_operations(parameters,orange_sizes): orange_used=[] index=0 summation=0 for i in range(parameters[0]): if(orange_sizes[i]<=parameters[1]): orange_used.insert(index,orange_sizes[i]) index+=1 summation=sum(orange_used) ...	0
1	A	Theatre Square	PROGRAMMING	1,000	[ "math" ]	A. Theatre Square	1	256	Theatre Square in the capital city of Berland has a rectangular shape with the size n<=×<=m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size a<=×<=a. What is the least number of flagstones needed to pave the...	The input contains three positive integer numbers in the first line: n,<=<=m and a (1<=≤<=<=n,<=m,<=a<=≤<=109).	Write the needed number of flagstones.	[ "6 6 4\n" ]	[ "4\n" ]	none	0	[ { "input": "6 6 4", "output": "4" }, { "input": "1 1 1", "output": "1" }, { "input": "2 1 1", "output": "2" }, { "input": "1 2 1", "output": "2" }, { "input": "2 2 1", "output": "4" }, { "input": "2 1 2", "output": "1" }, { "input": "1 1 3"...	1,671,423,885	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	30	0	valores=input() valores=valores.split(' ') valores=[int(x) for x in valores] imcomplet_anchor=valores[0]%valores[2] imcomplet_large=valores[1]%valores[2] area=(valores[0]+imcomplet_anchor)(valores[1]+imcomplet_large) flagstone=valores[2]*2 print(area,flagstone) print(area//flagstone)	Title: Theatre Square Time Limit: 1 seconds Memory Limit: 256 megabytes Problem Description: Theatre Square in the capital city of Berland has a rectangular shape with the size n<=×<=m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each ...	```python valores=input() valores=valores.split(' ') valores=[int(x) for x in valores] imcomplet_anchor=valores[0]%valores[2] imcomplet_large=valores[1]%valores[2] area=(valores[0]+imcomplet_anchor)(valores[1]+imcomplet_large) flagstone=valores[2]*2 print(area,flagstone) print(area//flagstone) ```	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....	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...	1,672,833,151	2,147,483,647	Python 3	OK	TESTS	40	92	0	s = input() t = input() trans = '' for i in range(len(s)): trans= trans+s[len(s)-1-i:len(s)-i] if t == trans: 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 pron...	```python s = input() t = input() trans = '' for i in range(len(s)): trans= trans+s[len(s)-1-i:len(s)-i] if t == trans: print('YES') else: print('NO') ```	3.977
989	B	A Tide of Riverscape	PROGRAMMING	1,200	[ "constructive algorithms", "strings" ]		null	null	"Time," Mino thinks aloud. "What?" "Time and tide wait for no man," explains Mino. "My name, taken from the river, always reminds me of this." "And what are you recording?" "You see it, tide. Everything has its own period, and I think I've figured out this one," says Mino with confidence. Doubtfully, Kanno peeks a...	The first line contains two space-separated integers $n$ and $p$ ($1 \leq p \leq n \leq 2000$) — the length of the given string and the supposed period, respectively. The second line contains a string $s$ of $n$ characters — Mino's records. $s$ only contains characters '0', '1' and '.', and contains at least one '.' c...	Output one line — if it's possible that $p$ is not a period of the resulting string, output any one of such strings; otherwise output "No" (without quotes, you can print letters in any case (upper or lower)).	[ "10 7\n1.0.1.0.1.\n", "10 6\n1.0.1.1000\n", "10 9\n1........1\n" ]	[ "1000100010\n", "1001101000\n", "No\n" ]	In the first example, $7$ is not a period of the resulting string because the $1$-st and $8$-th characters of it are different. In the second example, $6$ is not a period of the resulting string because the $4$-th and $10$-th characters of it are different. In the third example, $9$ is always a period because the onl...	1,000	[ { "input": "10 7\n1.0.1.0.1.", "output": "1000100010" }, { "input": "10 6\n1.0.1.1000", "output": "1001101000" }, { "input": "10 9\n1........1", "output": "No" }, { "input": "1 1\n.", "output": "No" }, { "input": "5 1\n0...1", "output": "00001" }, { "i...	1,528,728,513	4,413	Python 3	WRONG_ANSWER	PRETESTS	1	62	0	n, p = list(map(int, input().split())) ss1 = input() ss = [x for x in ss1] import sys for i in range(len(ss)): for j in range(i, len(ss), p): if i == j: continue if ss[i] != ss[j]: print(''.join(ss).replace('.', '0')) sys.exit() if ss[i] == ss[j] and ss[i...	Title: A Tide of Riverscape Time Limit: None seconds Memory Limit: None megabytes Problem Description: "Time," Mino thinks aloud. "What?" "Time and tide wait for no man," explains Mino. "My name, taken from the river, always reminds me of this." "And what are you recording?" "You see it, tide. Everything has its...	```python n, p = list(map(int, input().split())) ss1 = input() ss = [x for x in ss1] import sys for i in range(len(ss)): for j in range(i, len(ss), p): if i == j: continue if ss[i] != ss[j]: print(''.join(ss).replace('.', '0')) sys.exit() if ss[i] == ss[j...	0
23	B	Party	PROGRAMMING	1,600	[ "constructive algorithms", "graphs", "math" ]	B. Party	2	256	n people came to a party. Then those, who had no friends among people at the party, left. Then those, who had exactly 1 friend among those who stayed, left as well. Then those, who had exactly 2,<=3,<=...,<=n<=-<=1 friends among those who stayed by the moment of their leaving, did the same. What is the maximum amo...	The first input line contains one number t — amount of tests (1<=≤<=t<=≤<=105). Each of the following t lines contains one integer number n (1<=≤<=n<=≤<=105).	For each test output in a separate line one number — the maximum amount of people that could stay in the end.	[ "1\n3\n" ]	[ "1\n" ]	none	0	[ { "input": "1\n3", "output": "1" } ]	1,644,650,514	2,147,483,647	PyPy 3	TIME_LIMIT_EXCEEDED	TESTS	1	2,000	6,348,800	n=int(input()) for i in range(n): a=int(input()) if a<2: print(0) if a>=2: print(a-2)	Title: Party Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: n people came to a party. Then those, who had no friends among people at the party, left. Then those, who had exactly 1 friend among those who stayed, left as well. Then those, who had exactly 2,<=3,<=...,<=n<=-<=1 friends among ...	```python n=int(input()) for i in range(n): a=int(input()) if a<2: print(0) if a>=2: print(a-2) ```	0
946	D	Timetable	PROGRAMMING	1,800	[ "dp" ]		null	null	Ivan is a student at Berland State University (BSU). There are n days in Berland week, and each of these days Ivan might have some classes at the university. There are m working hours during each Berland day, and each lesson at the university lasts exactly one hour. If at some day Ivan's first lesson is during i...	The first line contains three integers n, m and k (1<=≤<=n,<=m<=≤<=500, 0<=≤<=k<=≤<=500) — the number of days in the Berland week, the number of working hours during each day, and the number of lessons Ivan can skip, respectively. Then n lines follow, i-th line containing a binary string of m charact...	Print the minimum number of hours Ivan has to spend in the university during the week if he skips not more than k lessons.	[ "2 5 1\n01001\n10110\n", "2 5 0\n01001\n10110\n" ]	[ "5\n", "8\n" ]	In the first example Ivan can skip any of two lessons during the first day, so he spends 1 hour during the first day and 4 hours during the second day. In the second example Ivan can't skip any lessons, so he spends 4 hours every day.	0	[ { "input": "2 5 1\n01001\n10110", "output": "5" }, { "input": "2 5 0\n01001\n10110", "output": "8" }, { "input": "3 4 0\n0000\n0000\n0000", "output": "0" }, { "input": "3 4 12\n1111\n1111\n1111", "output": "0" }, { "input": "3 4 6\n1111\n1111\n1111", "output":...	1,553,966,657	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	10	108	307,200	inp = input() n,m,k = [int(x) for x in inp.split(' ')] schedule = [] for i in range(n): schedule.append(input()) all_differences = [0 for i in range(k)] max_cost = 0 best_cost = 0 diff = 0 min_diff = -99999 def get_day_plans(day_schedule: str): answer = [0 for j in range(m+1)] wait = [0 for j in range...	Title: Timetable Time Limit: None seconds Memory Limit: None megabytes Problem Description: Ivan is a student at Berland State University (BSU). There are n days in Berland week, and each of these days Ivan might have some classes at the university. There are m working hours during each Berland day, and each le...	```python inp = input() n,m,k = [int(x) for x in inp.split(' ')] schedule = [] for i in range(n): schedule.append(input()) all_differences = [0 for i in range(k)] max_cost = 0 best_cost = 0 diff = 0 min_diff = -99999 def get_day_plans(day_schedule: str): answer = [0 for j in range(m+1)] wait = [0 for ...	0
454	B	Little Pony and Sort by Shift	PROGRAMMING	1,200	[ "implementation" ]		null	null	One day, Twilight Sparkle is interested in how to sort a sequence of integers a1,<=a2,<=...,<=an in non-decreasing order. Being a young unicorn, the only operation she can perform is a unit shift. That is, she can move the last element of the sequence to its beginning: Help Twilight Sparkle to calculate: what ...	The first line contains an integer n (2<=≤<=n<=≤<=105). The second line contains n integer numbers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=105).	If it's impossible to sort the sequence output -1. Otherwise output the minimum number of operations Twilight Sparkle needs to sort it.	[ "2\n2 1\n", "3\n1 3 2\n", "2\n1 2\n" ]	[ "1\n", "-1\n", "0\n" ]	none	1,000	[ { "input": "2\n2 1", "output": "1" }, { "input": "3\n1 3 2", "output": "-1" }, { "input": "2\n1 2", "output": "0" }, { "input": "6\n3 4 5 6 3 2", "output": "-1" }, { "input": "3\n1 2 1", "output": "1" }, { "input": "5\n1 1 2 1 1", "output": "2" }...	1,606,379,339	2,147,483,647	PyPy 3	OK	TESTS	56	202	10,444,800	#t=int(input()) '''for _ in range(t): n=int(input()) l=list(map(int ,input().split())) d=defaultdict(int) d[l[0]]+=1 for i in range(1,n): if l[i]==l[i-1]: continue d[l[i]]+=1 d[l[0]]-=1 d[l[n-1]]-=1 x=min(d.values()) if x<0: print(0) else: print(x+1)''' n=int(input()) l=list(map(int, input()....	Title: Little Pony and Sort by Shift Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day, Twilight Sparkle is interested in how to sort a sequence of integers a1,<=a2,<=...,<=an in non-decreasing order. Being a young unicorn, the only operation she can perform is a unit shift. ...	```python #t=int(input()) '''for _ in range(t): n=int(input()) l=list(map(int ,input().split())) d=defaultdict(int) d[l[0]]+=1 for i in range(1,n): if l[i]==l[i-1]: continue d[l[i]]+=1 d[l[0]]-=1 d[l[n-1]]-=1 x=min(d.values()) if x<0: print(0) else: print(x+1)''' n=int(input()) l=list(map(int...	3
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...	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...	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 ...	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": "...	1,639,154,596	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	60	0	n = int(input()) list_ = [] for i in range(n): m = input() list_.append(m) max1 = 1 max2 = 1 for i in range(n): if i < range(n): if list_[i] == list_[i+1]: max2 += 1 if max2 > max1: max1 = max2 else: max2 = 1 print(max2)	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 l...	```python n = int(input()) list_ = [] for i in range(n): m = input() list_.append(m) max1 = 1 max2 = 1 for i in range(n): if i < range(n): if list_[i] == list_[i+1]: max2 += 1 if max2 > max1: max1 = max2 else: max2 = 1 print(...	-1
384	A	Coder	PROGRAMMING	800	[ "implementation" ]		null	null	Iahub likes chess very much. He even invented a new chess piece named Coder. A Coder can move (and attack) one square horizontally or vertically. More precisely, if the Coder is located at position (x,<=y), he can move to (or attack) positions (x<=+<=1,<=y), (x–1,<=y), (x,<=y<=+<=1) and (x,<=y–1). ...	The first line contains an integer n (1<=≤<=n<=≤<=1000).	On the first line print an integer, the maximum number of Coders that can be placed on the chessboard. On each of the next n lines print n characters, describing the configuration of the Coders. For an empty cell print an '.', and for a Coder print a 'C'. If there are multiple correct answers, you can print any.	[ "2\n" ]	[ "2\nC.\n.C\n" ]	none	500	[ { "input": "2", "output": "2\nC.\n.C" }, { "input": "3", "output": "5\nC.C\n.C.\nC.C" }, { "input": "4", "output": "8\nC.C.\n.C.C\nC.C.\n.C.C" }, { "input": "10", "output": "50\nC.C.C.C.C.\n.C.C.C.C.C\nC.C.C.C.C.\n.C.C.C.C.C\nC.C.C.C.C.\n.C.C.C.C.C\nC.C.C.C.C.\n.C.C.C.C.C...	1,429,301,340	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	46	0	n = int(input()) m = [['C' if j % 2 != 0 else '.' for j in range(0, n)] if i % 2 != 0 else ['.' if j % 2 != 0 else 'C' for j in range(0, n)] for i in range(0, n)] for i in range(0, n): for j in range(0, n): print(m[i][j], sep=' ', end='') print()	Title: Coder Time Limit: None seconds Memory Limit: None megabytes Problem Description: Iahub likes chess very much. He even invented a new chess piece named Coder. A Coder can move (and attack) one square horizontally or vertically. More precisely, if the Coder is located at position (x,<=y), he can move to (or...	```python n = int(input()) m = [['C' if j % 2 != 0 else '.' for j in range(0, n)] if i % 2 != 0 else ['.' if j % 2 != 0 else 'C' for j in range(0, n)] for i in range(0, n)] for i in range(0, n): for j in range(0, n): print(m[i][j], sep=' ', end='') print() ```	0
845	B	Luba And The Ticket	PROGRAMMING	1,600	[ "brute force", "greedy", "implementation" ]		null	null	Luba has a ticket consisting of 6 digits. In one move she can choose digit in any position and replace it with arbitrary digit. She wants to know the minimum number of digits she needs to replace in order to make the ticket lucky. The ticket is considered lucky if the sum of first three digits equals to the sum of las...	You are given a string consisting of 6 characters (all characters are digits from 0 to 9) — this string denotes Luba's ticket. The ticket can start with the digit 0.	Print one number — the minimum possible number of digits Luba needs to replace to make the ticket lucky.	[ "000000\n", "123456\n", "111000\n" ]	[ "0\n", "2\n", "1\n" ]	In the first example the ticket is already lucky, so the answer is 0. In the second example Luba can replace 4 and 5 with zeroes, and the ticket will become lucky. It's easy to see that at least two replacements are required. In the third example Luba can replace any zero with 3. It's easy to see that at least one re...	0	[ { "input": "000000", "output": "0" }, { "input": "123456", "output": "2" }, { "input": "111000", "output": "1" }, { "input": "120111", "output": "0" }, { "input": "999999", "output": "0" }, { "input": "199880", "output": "1" }, { "input": "...	1,503,746,723	2,147,483,647	Python 3	OK	TESTS	145	62	0	#!/usr/bin/env python3 # -- coding: utf-8 -- a = input() ls = int(a[0]) + int(a[1]) + int(a[2]) rs = int(a[3]) + int(a[4]) + int(a[5]) dif = ls - rs if dif == 0: print(0) quit() p = [0] * 6 for i in range(6): if (i < 3) ^ (dif > 0): p[i] = 9 - int(a[i]) else: p[i] = int(a[i]) p.sort(reverse=True) ps = 0...	Title: Luba And The Ticket Time Limit: None seconds Memory Limit: None megabytes Problem Description: Luba has a ticket consisting of 6 digits. In one move she can choose digit in any position and replace it with arbitrary digit. She wants to know the minimum number of digits she needs to replace in order to make th...	```python #!/usr/bin/env python3 # -- coding: utf-8 -- a = input() ls = int(a[0]) + int(a[1]) + int(a[2]) rs = int(a[3]) + int(a[4]) + int(a[5]) dif = ls - rs if dif == 0: print(0) quit() p = [0] * 6 for i in range(6): if (i < 3) ^ (dif > 0): p[i] = 9 - int(a[i]) else: p[i] = int(a[i]) p.sort(reverse=Tru...	3
4	A	Watermelon	PROGRAMMING	800	[ "brute force", "math" ]	A. Watermelon	1	64	One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed w kilos. They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem. Pete and ...	The first (and the only) input line contains integer number w (1<=≤<=w<=≤<=100) — the weight of the watermelon bought by the boys.	Print YES, if the boys can divide the watermelon into two parts, each of them weighing even number of kilos; and NO in the opposite case.	[ "8\n" ]	[ "YES\n" ]	For example, the boys can divide the watermelon into two parts of 2 and 6 kilos respectively (another variant — two parts of 4 and 4 kilos).	0	[ { "input": "8", "output": "YES" }, { "input": "5", "output": "NO" }, { "input": "4", "output": "YES" }, { "input": "3", "output": "NO" }, { "input": "2", "output": "NO" }, { "input": "1", "output": "NO" }, { "input": "7", "output": "NO"...	1,692,447,032	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	4	92	0	n=int(input()) print("YES" if not n%2 else "NO")	Title: Watermelon Time Limit: 1 seconds Memory Limit: 64 megabytes Problem Description: One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed w kilos. They rushed home, dyin...	```python n=int(input()) print("YES" if not n%2 else "NO") ```	0
922	A	Cloning Toys	PROGRAMMING	1,300	[ "implementation" ]		null	null	Imp likes his plush toy a lot. Recently, he found a machine that can clone plush toys. Imp knows that if he applies the machine to an original toy, he additionally gets one more original toy and one copy, and if he applies the machine to a copied toy, he gets two additional copies. Initially, Imp has only one origina...	The only line contains two integers x and y (0<=≤<=x,<=y<=≤<=109) — the number of copies and the number of original toys Imp wants to get (including the initial one).	Print "Yes", if the desired configuration is possible, and "No" otherwise. You can print each letter in arbitrary case (upper or lower).	[ "6 3\n", "4 2\n", "1000 1001\n" ]	[ "Yes\n", "No\n", "Yes\n" ]	In the first example, Imp has to apply the machine twice to original toys and then twice to copies.	500	[ { "input": "6 3", "output": "Yes" }, { "input": "4 2", "output": "No" }, { "input": "1000 1001", "output": "Yes" }, { "input": "1000000000 999999999", "output": "Yes" }, { "input": "81452244 81452247", "output": "No" }, { "input": "188032448 86524683",...	1,569,838,240	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	4	109	0	x,y=[int(i)for i in input().split()] while x<0 or x>109 or y<0 or y>109: x,y=[int(i)for i in input().split()] o=y-1 d=(x-o) if d%2==0: print("Yes") else: print("No")	Title: Cloning Toys Time Limit: None seconds Memory Limit: None megabytes Problem Description: Imp likes his plush toy a lot. Recently, he found a machine that can clone plush toys. Imp knows that if he applies the machine to an original toy, he additionally gets one more original toy and one copy, and if he applie...	```python x,y=[int(i)for i in input().split()] while x<0 or x>109 or y<0 or y>109: x,y=[int(i)for i in input().split()] o=y-1 d=(x-o) if d%2==0: print("Yes") else: print("No") ```	0
452	A	Eevee	PROGRAMMING	1,000	[ "brute force", "implementation", "strings" ]		null	null	You are solving the crossword problem K from IPSC 2014. You solved all the clues except for one: who does Eevee evolve into? You are not very into pokemons, but quick googling helped you find out, that Eevee can evolve into eight different pokemons: Vaporeon, Jolteon, Flareon, Espeon, Umbreon, Leafeon, Glaceon, and Syl...	First line contains an integer n (6<=≤<=n<=≤<=8) – the length of the string. Next line contains a string consisting of n characters, each of which is either a lower case english letter (indicating a known letter) or a dot character (indicating an empty cell in the crossword).	Print a name of the pokemon that Eevee can evolve into that matches the pattern in the input. Use lower case letters only to print the name (in particular, do not capitalize the first letter).	[ "7\nj......\n", "7\n...feon\n", "7\n.l.r.o.\n" ]	[ "jolteon\n", "leafeon\n", "flareon\n" ]	Here's a set of names in a form you can paste into your solution: ["vaporeon", "jolteon", "flareon", "espeon", "umbreon", "leafeon", "glaceon", "sylveon"] {"vaporeon", "jolteon", "flareon", "espeon", "umbreon", "leafeon", "glaceon", "sylveon"}	500	[ { "input": "7\n...feon", "output": "leafeon" }, { "input": "7\n.l.r.o.", "output": "flareon" }, { "input": "6\n.s..o.", "output": "espeon" }, { "input": "7\nglaceon", "output": "glaceon" }, { "input": "8\n.a.o.e.n", "output": "vaporeon" }, { "input": "...	1,457,094,239	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	8	77	512,000	import re strLen = input() name = input() names = ["vaporeon", "jolteon", "flareon", "espeon", "umbreon", "leafeon", "glaceon", "sylveon"] for n in names: if re.search(name, n): print(n)	Title: Eevee Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are solving the crossword problem K from IPSC 2014. You solved all the clues except for one: who does Eevee evolve into? You are not very into pokemons, but quick googling helped you find out, that Eevee can evolve into eight...	```python import re strLen = input() name = input() names = ["vaporeon", "jolteon", "flareon", "espeon", "umbreon", "leafeon", "glaceon", "sylveon"] for n in names: if re.search(name, n): print(n) ```	0
757	B	Bash's Big Day	PROGRAMMING	1,400	[ "greedy", "math", "number theory" ]		null	null	Bash has set out on a journey to become the greatest Pokemon master. To get his first Pokemon, he went to Professor Zulu's Lab. Since Bash is Professor Zulu's favourite student, Zulu allows him to take as many Pokemon from his lab as he pleases. But Zulu warns him that a group of k<=><=1 Pokemon with strengths {*...	The input consists of two lines. The first line contains an integer n (1<=≤<=n<=≤<=105), the number of Pokemon in the lab. The next line contains n space separated integers, where the i-th of them denotes si (1<=≤<=si<=≤<=105), the strength of the i-th Pokemon.	Print single integer — the maximum number of Pokemons Bash can take.	[ "3\n2 3 4\n", "5\n2 3 4 6 7\n" ]	[ "2\n", "3\n" ]	gcd (greatest common divisor) of positive integers set {a<sub class="lower-index">1</sub>, a<sub class="lower-index">2</sub>, ..., a<sub class="lower-index">n</sub>} is the maximum positive integer that divides all the integers {a<sub class="lower-index">1</sub>, a<sub class="lower-index">2</sub>, ..., *a...	1,000	[ { "input": "3\n2 3 4", "output": "2" }, { "input": "5\n2 3 4 6 7", "output": "3" }, { "input": "3\n5 6 4", "output": "2" }, { "input": "8\n41 74 4 27 85 39 100 36", "output": "4" }, { "input": "6\n89 20 86 81 62 23", "output": "3" }, { "input": "71\n23...	1,489,468,833	2,147,483,647	Python 3	OK	TESTS	134	451	12,185,600	a=int(input()) ara=list(map(int,input().split())) list=[0]*100001 count=1 for i in ara: list[i]+=1 for i in range(2,100001): po=0 for j in range(0,100001,i): if not list[j]==0: po+=list[j] count=max(count,po) print(count)	Title: Bash's Big Day Time Limit: None seconds Memory Limit: None megabytes Problem Description: Bash has set out on a journey to become the greatest Pokemon master. To get his first Pokemon, he went to Professor Zulu's Lab. Since Bash is Professor Zulu's favourite student, Zulu allows him to take as many Pokemon fr...	```python a=int(input()) ara=list(map(int,input().split())) list=[0]*100001 count=1 for i in ara: list[i]+=1 for i in range(2,100001): po=0 for j in range(0,100001,i): if not list[j]==0: po+=list[j] count=max(count,po) print(count) ```	3
854	A	Fraction	PROGRAMMING	800	[ "brute force", "constructive algorithms", "math" ]		null	null	Petya is a big fan of mathematics, especially its part related to fractions. Recently he learned that a fraction is called proper iff its numerator is smaller than its denominator (a<=<<=b) and that the fraction is called irreducible if its numerator and its denominator are coprime (they do not have positive co...	In the only line of input there is an integer n (3<=≤<=n<=≤<=1000), the sum of numerator and denominator of the fraction.	Output two space-separated positive integers a and b, numerator and denominator of the maximum possible proper irreducible fraction satisfying the given sum.	[ "3\n", "4\n", "12\n" ]	[ "1 2\n", "1 3\n", "5 7\n" ]	none	500	[ { "input": "3", "output": "1 2" }, { "input": "4", "output": "1 3" }, { "input": "12", "output": "5 7" }, { "input": "34", "output": "15 19" }, { "input": "13", "output": "6 7" }, { "input": "11", "output": "5 6" }, { "input": "24", "ou...	1,659,393,310	2,147,483,647	PyPy 3-64	OK	TESTS	26	62	0	import sys,math n=int(sys.stdin.readline()) if n%2==0: f=n//2 a=f-1 b=f+1 while True: if math.gcd(a,b)==1: print(a,b) break else: a-=1 b+=1 else: f=n//2 a=f b=f+1 while True: if math.gcd(a,b)==1: ...	Title: Fraction Time Limit: None seconds Memory Limit: None megabytes Problem Description: Petya is a big fan of mathematics, especially its part related to fractions. Recently he learned that a fraction is called proper iff its numerator is smaller than its denominator (a<=<<=b) and that the fraction is cal...	```python import sys,math n=int(sys.stdin.readline()) if n%2==0: f=n//2 a=f-1 b=f+1 while True: if math.gcd(a,b)==1: print(a,b) break else: a-=1 b+=1 else: f=n//2 a=f b=f+1 while True: if math.gcd(a...	3
628	E	Zbazi in Zeydabad	PROGRAMMING	2,300	[ "data structures", "implementation" ]		null	null	A tourist wants to visit country Zeydabad for Zbazi (a local game in Zeydabad). The country Zeydabad is a rectangular table consisting of n rows and m columns. Each cell on the country is either 'z' or '.'. The tourist knows this country is named Zeydabad because there are lots of ''Z-pattern"s in the country. A ...	The first line contains two integers n,<=m (1<=≤<=n,<=m<=≤<=3000) — the number of rows and columns respectively. Each of the next n lines contains m characters 'z' or '.' — the description of Zeydabad.	Print the only integer a — the number of ''Z-pattern"s in Zeydabad.	[ "4 4\nzzzz\nzzz.\n.z..\nzzzz\n", "1 4\nz.z.\n", "2 2\nzz\nzz\n" ]	[ "16\n", "2\n", "5\n" ]	none	0	[ { "input": "4 4\nzzzz\nzzz.\n.z..\nzzzz", "output": "16" }, { "input": "1 4\nz.z.", "output": "2" }, { "input": "2 2\nzz\nzz", "output": "5" } ]	1,689,637,759	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	0	46	0	print("_RANDOM_GUESS_1689637759.4739082")# 1689637759.4739275	Title: Zbazi in Zeydabad Time Limit: None seconds Memory Limit: None megabytes Problem Description: A tourist wants to visit country Zeydabad for Zbazi (a local game in Zeydabad). The country Zeydabad is a rectangular table consisting of n rows and m columns. Each cell on the country is either 'z' or '.'. The ...	```python print("_RANDOM_GUESS_1689637759.4739082")# 1689637759.4739275 ```	0
337	A	Puzzles	PROGRAMMING	900	[ "greedy" ]		null	null	The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of them a jigsaw puzzle (which, as wikipedia states, is a tiling puzzle that requires the assembly of numerous small, often od...	The first line contains space-separated integers n and m (2<=≤<=n<=≤<=m<=≤<=50). The second line contains m space-separated integers f1,<=f2,<=...,<=fm (4<=≤<=fi<=≤<=1000) — the quantities of pieces in the puzzles sold in the shop.	Print a single integer — the least possible difference the teacher can obtain.	[ "4 6\n10 12 10 7 5 22\n" ]	[ "5\n" ]	Sample 1. The class has 4 students. The shop sells 6 puzzles. If Ms. Manana buys the first four puzzles consisting of 10, 12, 10 and 7 pieces correspondingly, then the difference between the sizes of the largest and the smallest puzzle will be equal to 5. It is impossible to obtain a smaller difference. Note that the t...	500	[ { "input": "4 6\n10 12 10 7 5 22", "output": "5" }, { "input": "2 2\n4 4", "output": "0" }, { "input": "2 10\n4 5 6 7 8 9 10 11 12 12", "output": "0" }, { "input": "4 5\n818 136 713 59 946", "output": "759" }, { "input": "3 20\n446 852 783 313 549 965 40 88 86 617...	1,699,626,875	2,147,483,647	PyPy 3-64	OK	TESTS	18	122	0	n, m = map(int, input().split()) f = list(map(int, input().split())) f.sort() min_diff = f[n-1] - f[0] for i in range(1, m-n+1): diff = f[i+n-1] - f[i] if diff < min_diff: min_diff = diff print(min_diff)	Title: Puzzles Time Limit: None seconds Memory Limit: None megabytes Problem Description: The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of them a jigsaw puzzle (which, a...	```python n, m = map(int, input().split()) f = list(map(int, input().split())) f.sort() min_diff = f[n-1] - f[0] for i in range(1, m-n+1): diff = f[i+n-1] - f[i] if diff < min_diff: min_diff = diff print(min_diff) ```	3
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 ...	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...	1,593,322,089	2,147,483,647	Python 3	OK	TESTS	104	109	6,656,000	import math days=[0,31,28,31,30,31,30,31,31,30,31,30,31] m,d=map(int,input().split()) ans=math.ceil((days[m]-8+ d)/7)+1 print(ans)	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...	```python import math days=[0,31,28,31,30,31,30,31,31,30,31,30,31] m,d=map(int,input().split()) ans=math.ceil((days[m]-8+ d)/7)+1 print(ans) ```	3
839	C	Journey	PROGRAMMING	1,500	[ "dfs and similar", "dp", "graphs", "probabilities", "trees" ]		null	null	There are n cities and n<=-<=1 roads in the Seven Kingdoms, each road connects two cities and we can reach any city from any other by the roads. Theon and Yara Greyjoy are on a horse in the first city, they are starting traveling through the roads. But the weather is foggy, so they can’t see where the horse brings...	The first line contains a single integer n (1<=≤<=n<=≤<=100000) — number of cities. Then n<=-<=1 lines follow. The i-th line of these lines contains two integers ui and vi (1<=≤<=ui,<=vi<=≤<=n, ui<=≠<=vi) — the cities connected by the i-th road. It is guaranteed that one can reach ...	Print a number — the expected length of their journey. The journey starts in the city 1. Your answer will be considered correct if its absolute or relative error does not exceed 10<=-<=6. Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer cor...	[ "4\n1 2\n1 3\n2 4\n", "5\n1 2\n1 3\n3 4\n2 5\n" ]	[ "1.500000000000000\n", "2.000000000000000\n" ]	In the first sample, their journey may end in cities 3 or 4 with equal probability. The distance to city 3 is 1 and to city 4 is 2, so the expected length is 1.5. In the second sample, their journey may end in city 4 or 5. The distance to the both cities is 2, so the expected length is 2.	1,500	[ { "input": "4\n1 2\n1 3\n2 4", "output": "1.500000000000000" }, { "input": "5\n1 2\n1 3\n3 4\n2 5", "output": "2.000000000000000" }, { "input": "70\n1 25\n57 1\n18 1\n65 1\n38 1\n1 41\n1 5\n1 69\n1 3\n31 1\n1 8\n1 9\n53 1\n70 1\n45 1\n1 24\n1 42\n1 30\n1 12\n1 37\n64 1\n1 28\n1 58\n1 22\...	1,589,915,076	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	4	140	1,126,400	# Template 1.0 import sys, re, math from collections import deque, defaultdict, Counter, OrderedDict from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians from heapq import heappush, heappop, heapify, nlargest, nsmallest def STR(): return list(input()) def INT(): return int(input()) def MAP(): ret...	Title: Journey Time Limit: None seconds Memory Limit: None megabytes Problem Description: There are n cities and n<=-<=1 roads in the Seven Kingdoms, each road connects two cities and we can reach any city from any other by the roads. Theon and Yara Greyjoy are on a horse in the first city, they are starting tr...	```python # Template 1.0 import sys, re, math from collections import deque, defaultdict, Counter, OrderedDict from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians from heapq import heappush, heappop, heapify, nlargest, nsmallest def STR(): return list(input()) def INT(): return int(input()) def ...	0
513	A	Game	PROGRAMMING	800	[ "constructive algorithms", "math" ]		null	null	Two players play a simple game. Each player is provided with a box with balls. First player's box contains exactly n1 balls and second player's box contains exactly n2 balls. In one move first player can take from 1 to k1 balls from his box and throw them away. Similarly, the second player can take from 1 to k2...	The first line contains four integers n1,<=n2,<=k1,<=k2. All numbers in the input are from 1 to 50. This problem doesn't have subproblems. You will get 3 points for the correct submission.	Output "First" if the first player wins and "Second" otherwise.	[ "2 2 1 2\n", "2 1 1 1\n" ]	[ "Second\n", "First\n" ]	Consider the first sample test. Each player has a box with 2 balls. The first player draws a single ball from his box in one move and the second player can either take 1 or 2 balls from his box in one move. No matter how the first player acts, the second player can always win if he plays wisely.	3	[ { "input": "2 2 1 2", "output": "Second" }, { "input": "2 1 1 1", "output": "First" }, { "input": "5 7 4 1", "output": "Second" }, { "input": "5 7 1 4", "output": "Second" }, { "input": "5 7 10 10", "output": "Second" }, { "input": "5 7 1 10", "out...	1,620,995,121	2,147,483,647	PyPy 3	OK	TESTS	20	109	20,172,800	a,b,c,d=list(map(int ,input().split())) if(a==b): print("Second") else: if(max(a,b)==a): print("First") else: print("Second")	Title: Game Time Limit: None seconds Memory Limit: None megabytes Problem Description: Two players play a simple game. Each player is provided with a box with balls. First player's box contains exactly n1 balls and second player's box contains exactly n2 balls. In one move first player can take from 1 to k1 ba...	```python a,b,c,d=list(map(int ,input().split())) if(a==b): print("Second") else: if(max(a,b)==a): print("First") else: print("Second") ```	3
801	B	Valued Keys	PROGRAMMING	900	[ "constructive algorithms", "greedy", "strings" ]		null	null	You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length. The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th cha...	The first line of input contains the string x. The second line of input contains the string y. Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.	If there is no string z such that f(x,<=z)<==<=y, print -1. Otherwise, print a string z such that f(x,<=z)<==<=y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.	[ "ab\naa\n", "nzwzl\nniwel\n", "ab\nba\n" ]	[ "ba\n", "xiyez\n", "-1\n" ]	The first case is from the statement. Another solution for the second case is "zizez" There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".	1,000	[ { "input": "ab\naa", "output": "ba" }, { "input": "nzwzl\nniwel", "output": "xiyez" }, { "input": "ab\nba", "output": "-1" }, { "input": "r\nl", "output": "l" }, { "input": "d\ny", "output": "-1" }, { "input": "yvowz\ncajav", "output": "cajav" },...	1,647,184,786	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	6	30	0	a = list(str(input())) b = list(str(input())) c = [] for i in range(len(a)): if a[i] == b[i]: c.append('z') else: if b[i] > a[i]: print("-1") break else: c.append(b[i]) for i in c: print(i, end='')	Title: Valued Keys Time Limit: None seconds Memory Limit: None megabytes Problem Description: You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length. The output of the function f is another string...	```python a = list(str(input())) b = list(str(input())) c = [] for i in range(len(a)): if a[i] == b[i]: c.append('z') else: if b[i] > a[i]: print("-1") break else: c.append(b[i]) for i in c: print(i, end='') ```	0
748	A	Santa Claus and a Place in a Class	PROGRAMMING	800	[ "implementation", "math" ]		null	null	Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two working places at each of the desks. The lanes are numbered from 1 to n from the left to the right, the desks in a lane ar...	The only line contains three integers n, m and k (1<=≤<=n,<=m<=≤<=10<=000, 1<=≤<=k<=≤<=2nm) — the number of lanes, the number of desks in each lane and the number of Santa Claus' place.	Print two integers: the number of lane r, the number of desk d, and a character s, which stands for the side of the desk Santa Claus. The character s should be "L", if Santa Clause should sit on the left, and "R" if his place is on the right.	[ "4 3 9\n", "4 3 24\n", "2 4 4\n" ]	[ "2 2 L\n", "4 3 R\n", "1 2 R\n" ]	The first and the second samples are shown on the picture. The green place corresponds to Santa Claus' place in the first example, the blue place corresponds to Santa Claus' place in the second example. In the third sample there are two lanes with four desks in each, and Santa Claus has the fourth place. Thus, his pla...	500	[ { "input": "4 3 9", "output": "2 2 L" }, { "input": "4 3 24", "output": "4 3 R" }, { "input": "2 4 4", "output": "1 2 R" }, { "input": "3 10 24", "output": "2 2 R" }, { "input": "10 3 59", "output": "10 3 L" }, { "input": "10000 10000 160845880", "...	1,650,032,894	2,147,483,647	Python 3	OK	TESTS	46	46	0	n, m, k = map(int, input().split()) x = k%(m2) a = k//(m2) + (x>0) b = (x+1)//2 print(a, (x+1)//2 if x!= 0 else m, 'L' if x%2 == 1 else 'R')	Title: Santa Claus and a Place in a Class Time Limit: None seconds Memory Limit: None megabytes Problem Description: Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two work...	```python n, m, k = map(int, input().split()) x = k%(m2) a = k//(m2) + (x>0) b = (x+1)//2 print(a, (x+1)//2 if x!= 0 else m, 'L' if x%2 == 1 else 'R') ```	3
489	B	BerSU Ball	PROGRAMMING	1,200	[ "dfs and similar", "dp", "graph matchings", "greedy", "sortings", "two pointers" ]		null	null	The Berland State University is hosting a ballroom dance in celebration of its 100500-th anniversary! n boys and m girls are already busy rehearsing waltz, minuet, polonaise and quadrille moves. We know that several boy&girl pairs are going to be invited to the ball. However, the partners' dancing skill in eac...	The first line contains an integer n (1<=≤<=n<=≤<=100) — the number of boys. The second line contains sequence a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=100), where ai is the i-th boy's dancing skill. Similarly, the third line contains an integer m (1<=≤<=m<=≤<=100) — the number of girls. The fourth l...	Print a single number — the required maximum possible number of pairs.	[ "4\n1 4 6 2\n5\n5 1 5 7 9\n", "4\n1 2 3 4\n4\n10 11 12 13\n", "5\n1 1 1 1 1\n3\n1 2 3\n" ]	[ "3\n", "0\n", "2\n" ]	none	1,000	[ { "input": "4\n1 4 6 2\n5\n5 1 5 7 9", "output": "3" }, { "input": "4\n1 2 3 4\n4\n10 11 12 13", "output": "0" }, { "input": "5\n1 1 1 1 1\n3\n1 2 3", "output": "2" }, { "input": "1\n1\n1\n1", "output": "1" }, { "input": "2\n1 10\n1\n9", "output": "1" }, {...	1,695,034,885	2,147,483,647	PyPy 3-64	RUNTIME_ERROR	TESTS	36	77	2,867,200	from sys import stdin input = stdin.readline n = int(input()) b = list(map(int,input().split())) g = [0 for i in range(101)] m = int(input()) for i in list(map(int,input().split())): g[i] += 1 b.sort() ans = 0 for i in b: if i>1 and g[i-1]: ans += 1 g[i-1] -= 1 elif g[i]:...	Title: BerSU Ball Time Limit: None seconds Memory Limit: None megabytes Problem Description: The Berland State University is hosting a ballroom dance in celebration of its 100500-th anniversary! n boys and m girls are already busy rehearsing waltz, minuet, polonaise and quadrille moves. We know that several boy...	```python from sys import stdin input = stdin.readline n = int(input()) b = list(map(int,input().split())) g = [0 for i in range(101)] m = int(input()) for i in list(map(int,input().split())): g[i] += 1 b.sort() ans = 0 for i in b: if i>1 and g[i-1]: ans += 1 g[i-1] -= 1 ...	-1
711	B	Chris and Magic Square	PROGRAMMING	1,400	[ "constructive algorithms", "implementation" ]		null	null	ZS the Coder and Chris the Baboon arrived at the entrance of Udayland. There is a n<=×<=n magic grid on the entrance which is filled with integers. Chris noticed that exactly one of the cells in the grid is empty, and to enter Udayland, they need to fill a positive integer into the empty cell. Chris tried filling ...	The first line of the input contains a single integer n (1<=≤<=n<=≤<=500) — the number of rows and columns of the magic grid. n lines follow, each of them contains n integers. The j-th number in the i-th of them denotes ai,<=j (1<=≤<=ai,<=j<=≤<=109 or ai,<=j<==<=0), the number in the i-...	Output a single integer, the positive integer x (1<=≤<=x<=≤<=1018) that should be filled in the empty cell so that the whole grid becomes a magic square. If such positive integer x does not exist, output <=-<=1 instead. If there are multiple solutions, you may print any of them.	[ "3\n4 0 2\n3 5 7\n8 1 6\n", "4\n1 1 1 1\n1 1 0 1\n1 1 1 1\n1 1 1 1\n", "4\n1 1 1 1\n1 1 0 1\n1 1 2 1\n1 1 1 1\n" ]	[ "9\n", "1\n", "-1\n" ]	In the first sample case, we can fill in 9 into the empty cell to make the resulting grid a magic square. Indeed, The sum of numbers in each row is: 4 + 9 + 2 = 3 + 5 + 7 = 8 + 1 + 6 = 15. The sum of numbers in each column is: 4 + 3 + 8 = 9 + 5 + 1 = 2 + 7 + 6 = 15. The sum of numbers in the two diagonals is: 4 ...	1,000	[ { "input": "3\n4 0 2\n3 5 7\n8 1 6", "output": "9" }, { "input": "4\n1 1 1 1\n1 1 0 1\n1 1 1 1\n1 1 1 1", "output": "1" }, { "input": "4\n1 1 1 1\n1 1 0 1\n1 1 2 1\n1 1 1 1", "output": "-1" }, { "input": "1\n0", "output": "1" }, { "input": "10\n92 67 99 74 1 51 8 ...	1,677,946,055	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	3	31	0	a = int(input()) list = [] sum1,sum2,sum3 = 0,0,0 for i in range(a): a1 = str(input()).split() if '0' in a1: number1 = i list.append(a1) number2 = list[number1].index('0') for i in range(a): sum1 += int(list[number1][i]) for i in range(a): sum2 += int(list[i][number2]) if sum1 !...	Title: Chris and Magic Square Time Limit: None seconds Memory Limit: None megabytes Problem Description: ZS the Coder and Chris the Baboon arrived at the entrance of Udayland. There is a n<=×<=n magic grid on the entrance which is filled with integers. Chris noticed that exactly one of the cells in the grid is e...	```python a = int(input()) list = [] sum1,sum2,sum3 = 0,0,0 for i in range(a): a1 = str(input()).split() if '0' in a1: number1 = i list.append(a1) number2 = list[number1].index('0') for i in range(a): sum1 += int(list[number1][i]) for i in range(a): sum2 += int(list[i][number2]) ...	0
437	C	The Child and Toy	PROGRAMMING	1,400	[ "graphs", "greedy", "sortings" ]		null	null	On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy. The toy consists of n parts and m ropes. Each rope links two parts, but every pair of parts is linked by at most one rope. To split the toy, the child must remove all its parts....	The first line contains two integers n and m (1<=≤<=n<=≤<=1000; 0<=≤<=m<=≤<=2000). The second line contains n integers: v1,<=v2,<=...,<=vn (0<=≤<=vi<=≤<=105). Then followed m lines, each line contains two integers xi and yi, representing a rope from part xi to part yi (1<=≤<=x*...	Output the minimum total energy the child should spend to remove all n parts of the toy.	[ "4 3\n10 20 30 40\n1 4\n1 2\n2 3\n", "4 4\n100 100 100 100\n1 2\n2 3\n2 4\n3 4\n", "7 10\n40 10 20 10 20 80 40\n1 5\n4 7\n4 5\n5 2\n5 7\n6 4\n1 6\n1 3\n4 3\n1 4\n" ]	[ "40\n", "400\n", "160\n" ]	One of the optimal sequence of actions in the first sample is: - First, remove part 3, cost of the action is 20. - Then, remove part 2, cost of the action is 10. - Next, remove part 4, cost of the action is 10. - At last, remove part 1, cost of the action is 0. So the total energy the child paid is 20 + 10 + 10 +...	1,500	[ { "input": "4 3\n10 20 30 40\n1 4\n1 2\n2 3", "output": "40" }, { "input": "4 4\n100 100 100 100\n1 2\n2 3\n2 4\n3 4", "output": "400" }, { "input": "7 10\n40 10 20 10 20 80 40\n1 5\n4 7\n4 5\n5 2\n5 7\n6 4\n1 6\n1 3\n4 3\n1 4", "output": "160" }, { "input": "1 0\n23333", ...	1,504,456,125	2,147,483,647	Python 3	OK	TESTS	29	62	0	nm = list(map(int, input().split(" "))) w = list(map(int, input().split(" "))) ans = 0 for x in range(nm[1]): d = list(map(int, input().split(" "))) ans += min(w[d[0]-1], w[d[1]-1]) print(ans)	Title: The Child and Toy Time Limit: None seconds Memory Limit: None megabytes Problem Description: On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy. The toy consists of n parts and m ropes. Each rope links two parts, but ev...	```python nm = list(map(int, input().split(" "))) w = list(map(int, input().split(" "))) ans = 0 for x in range(nm[1]): d = list(map(int, input().split(" "))) ans += min(w[d[0]-1], w[d[1]-1]) print(ans) ```	3
950	A	Left-handers, Right-handers and Ambidexters	PROGRAMMING	800	[ "implementation", "math" ]		null	null	You are at a water bowling training. There are l people who play with their left hand, r people, who play with their right hand, and a ambidexters, who can play with left or right hand. The coach decided to form a team of even number of players, exactly half of the players should play with their right hand, and ...	The only line contains three integers l, r and a (0<=≤<=l,<=r,<=a<=≤<=100) — the number of left-handers, the number of right-handers and the number of ambidexters at the training.	Print a single even integer — the maximum number of players in the team. It is possible that the team can only have zero number of players.	[ "1 4 2\n", "5 5 5\n", "0 2 0\n" ]	[ "6\n", "14\n", "0\n" ]	In the first example you can form a team of 6 players. You should take the only left-hander and two ambidexters to play with left hand, and three right-handers to play with right hand. The only person left can't be taken into the team. In the second example you can form a team of 14 people. You have to take all five l...	500	[ { "input": "1 4 2", "output": "6" }, { "input": "5 5 5", "output": "14" }, { "input": "0 2 0", "output": "0" }, { "input": "30 70 34", "output": "128" }, { "input": "89 32 24", "output": "112" }, { "input": "89 44 77", "output": "210" }, { ...	1,665,345,246	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	0	31	0	x=input() k=[int(i) for i in x.split()] if (k[0]==0 & k[2]==0) \| (k[1]==0 & k[2]==0): print(0) else: print((k[0]+k[1])+(k[2]-k[2]%2))	Title: Left-handers, Right-handers and Ambidexters Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are at a water bowling training. There are l people who play with their left hand, r people, who play with their right hand, and a ambidexters, who can play with left or right hand....	```python x=input() k=[int(i) for i in x.split()] if (k[0]==0 & k[2]==0) \| (k[1]==0 & k[2]==0): print(0) else: print((k[0]+k[1])+(k[2]-k[2]%2)) ```	0
980	B	Marlin	PROGRAMMING	1,600	[ "constructive algorithms" ]		null	null	The city of Fishtopia can be imagined as a grid of $4$ rows and an odd number of columns. It has two main villages; the first is located at the top-left cell $(1,1)$, people who stay there love fishing at the Tuna pond at the bottom-right cell $(4, n)$. The second village is located at $(4, 1)$ and its people love the ...	The first line of input contain two integers, $n$ and $k$ ($3 \leq n \leq 99$, $0 \leq k \leq 2\times(n-2)$), $n$ is odd, the width of the city, and the number of hotels to be placed, respectively.	Print "YES", if it is possible to place all the hotels in a way that satisfies the problem statement, otherwise print "NO". If it is possible, print an extra $4$ lines that describe the city, each line should have $n$ characters, each of which is "#" if that cell has a hotel on it, or "." if not.	[ "7 2\n", "5 3\n" ]	[ "YES\n.......\n.#.....\n.#.....\n.......\n", "YES\n.....\n.###.\n.....\n.....\n" ]	none	1,000	[ { "input": "7 2", "output": "YES\n.......\n.#.....\n.#.....\n......." }, { "input": "5 3", "output": "YES\n.....\n.###.\n.....\n....." }, { "input": "3 2", "output": "YES\n...\n.#.\n.#.\n..." }, { "input": "3 0", "output": "YES\n...\n...\n...\n..." }, { "input": "...	1,600,499,747	2,147	PyPy 3	OK	TESTS	88	155	0	n,k= map(int,input().split()) s= '.'n m=(k+1)//2 a='.' + '#'m + '.'(n-m-1) if k%2 == 0: b=a elif k<n: t= (n- k)//2'.' a,b = t+'#'*k +t , s else: b = a[:2]+ '.' + a[3:] print('YES',s,a,b,s,sep='\n')	Title: Marlin Time Limit: None seconds Memory Limit: None megabytes Problem Description: The city of Fishtopia can be imagined as a grid of $4$ rows and an odd number of columns. It has two main villages; the first is located at the top-left cell $(1,1)$, people who stay there love fishing at the Tuna pond at the bo...	```python n,k= map(int,input().split()) s= '.'n m=(k+1)//2 a='.' + '#'m + '.'(n-m-1) if k%2 == 0: b=a elif k<n: t= (n- k)//2'.' a,b = t+'#'*k +t , s else: b = a[:2]+ '.' + a[3:] print('YES',s,a,b,s,sep='\n') ```	3
96	A	Football	PROGRAMMING	900	[ "implementation", "strings" ]	A. Football	2	256	Petya loves football very much. One day, as he was watching a football match, he was writing the players' current positions on a piece of paper. To simplify the situation he depicted it as a string consisting of zeroes and ones. A zero corresponds to players of one team; a one corresponds to players of another team. If...	The first input line contains a non-empty string consisting of characters "0" and "1", which represents players. The length of the string does not exceed 100 characters. There's at least one player from each team present on the field.	Print "YES" if the situation is dangerous. Otherwise, print "NO".	[ "001001\n", "1000000001\n" ]	[ "NO\n", "YES\n" ]	none	500	[ { "input": "001001", "output": "NO" }, { "input": "1000000001", "output": "YES" }, { "input": "00100110111111101", "output": "YES" }, { "input": "11110111111111111", "output": "YES" }, { "input": "01", "output": "NO" }, { "input": "10100101", "outp...	1,671,019,190	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	9	92	0	position_taker = input("") if(position_taker.count("0") >= 7 or position_taker.count("1") >= 7 ): print("YES") else: print("NO")	Title: Football Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Petya loves football very much. One day, as he was watching a football match, he was writing the players' current positions on a piece of paper. To simplify the situation he depicted it as a string consisting of zeroes and ones. A...	```python position_taker = input("") if(position_taker.count("0") >= 7 or position_taker.count("1") >= 7 ): print("YES") else: print("NO") ```	0
379	A	New Year Candles	PROGRAMMING	1,000	[ "implementation" ]		null	null	Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles. Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make b went out candles into a new candle. As a result, this new candle can be used ...	The single line contains two integers, a and b (1<=≤<=a<=≤<=1000; 2<=≤<=b<=≤<=1000).	Print a single integer — the number of hours Vasily can light up the room for.	[ "4 2\n", "6 3\n" ]	[ "7\n", "8\n" ]	Consider the first sample. For the first four hours Vasily lights up new candles, then he uses four burned out candles to make two new ones and lights them up. When these candles go out (stop burning), Vasily can make another candle. Overall, Vasily can light up the room for 7 hours.	500	[ { "input": "4 2", "output": "7" }, { "input": "6 3", "output": "8" }, { "input": "1000 1000", "output": "1001" }, { "input": "123 5", "output": "153" }, { "input": "1000 2", "output": "1999" }, { "input": "1 2", "output": "1" }, { "input": ...	1,653,705,334	2,147,483,647	Python 3	OK	TESTS	32	61	102,400	from collections import defaultdict, deque import sys input = lambda : sys.stdin.readline().strip() # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # import math as m a,b = map(int,input().split()) print(a+(m.floor((a-1)/(b-1))))	Title: New Year Candles Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles. Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is s...	```python from collections import defaultdict, deque import sys input = lambda : sys.stdin.readline().strip() # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # import math as m a,b = map(int,input().split()) print(a+(m.floor((a-1)/(b-1)))) ```	3
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 u...	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 rev...	1,000	[ { "input": "-++-", "output": "Yes" }, { "input": "+-", "output": "No" }, { "input": "++", "output": "Yes" }, { "input": "-", "output": "No" }, { "input": "+-+-", "output": "No" }, { "input": "-+-", "output": "No" }, { "input": "-++-+--+", ...	1,635,359,078	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	11	92	4,710,400	sequence = input() j = len(sequence) flag = 0 for i in range(j-1): if sequence[i] == sequence[i+1]: flag = 1 break else: continue if flag: print('Yes', end='') else: print('No', end='')	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...	```python sequence = input() j = len(sequence) flag = 0 for i in range(j-1): if sequence[i] == sequence[i+1]: flag = 1 break else: continue if flag: print('Yes', end='') else: print('No', end='') ```	0
551	A	GukiZ and Contest	PROGRAMMING	800	[ "brute force", "implementation", "sortings" ]		null	null	Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest. In total, n students will attend, and before the start, every one of them has some positive integer rating. Students are indexed from 1 to n. Let's denote...	The first line contains integer n (1<=≤<=n<=≤<=2000), number of GukiZ's students. The second line contains n numbers a1,<=a2,<=... an (1<=≤<=ai<=≤<=2000) where ai is the rating of i-th student (1<=≤<=i<=≤<=n).	In a single line, print the position after the end of the contest for each of n students in the same order as they appear in the input.	[ "3\n1 3 3\n", "1\n1\n", "5\n3 5 3 4 5\n" ]	[ "3 1 1\n", "1\n", "4 1 4 3 1\n" ]	In the first sample, students 2 and 3 are positioned first (there is no other student with higher rating), and student 1 is positioned third since there are two students with higher rating. In the second sample, first student is the only one on the contest. In the third sample, students 2 and 5 share the first positi...	500	[ { "input": "3\n1 3 3", "output": "3 1 1" }, { "input": "1\n1", "output": "1" }, { "input": "5\n3 5 3 4 5", "output": "4 1 4 3 1" }, { "input": "7\n1 3 5 4 2 2 1", "output": "6 3 1 2 4 4 6" }, { "input": "11\n5 6 4 2 9 7 6 6 6 6 7", "output": "9 4 10 11 1 2 4 4...	1,640,942,203	2,147,483,647	Python 3	OK	TESTS	36	62	0	# your code goes here # your code goes here sam = int(input()) sameer = [int(x) for x in input().split()] krithi = sorted(sameer, reverse=True) for reddy in sameer: print(krithi.index(reddy)+1,end=" ")	Title: GukiZ and Contest Time Limit: None seconds Memory Limit: None megabytes Problem Description: Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest. In total, n students will attend, and before the star...	```python # your code goes here # your code goes here sam = int(input()) sameer = [int(x) for x in input().split()] krithi = sorted(sameer, reverse=True) for reddy in sameer: print(krithi.index(reddy)+1,end=" ") ```	3
475	A	Bayan Bus	PROGRAMMING	1,100	[ "implementation" ]		null	null	The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 seats in remaining rows. The event coordinator has a list of k participants who should be picked up at the airport. When a...	The only line of input contains integer k, (0<=≤<=k<=≤<=34), denoting the number of participants.	Print the figure of a bus with k passengers as described in sample tests. Character '#' denotes an empty seat, while 'O' denotes a taken seat. 'D' is the bus driver and other characters in the output are for the purpose of beautifying the figure. Strictly follow the sample test cases output format. Print exactly six ...	[ "9\n", "20\n" ]	[ "+------------------------+\n\|O.O.O.#.#.#.#.#.#.#.#.\|D\|)\n\|O.O.O.#.#.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.#.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+\n", "+------------------------+\n\|O.O.O.O.O.O.O.#.#.#.#.\|D\|)\n\|O.O.O.O.O.O.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.#.#.#.#.#.\|.\|...	none	500	[ { "input": "9", "output": "+------------------------+\n\|O.O.O.#.#.#.#.#.#.#.#.\|D\|)\n\|O.O.O.#.#.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.#.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+" }, { "input": "20", "output": "+------------------------+\n\|O.O.O.O.O.O.O.#.#.#.#.\|D\|)\n\|O.O.O.O.O....	1,695,889,057	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	0	46	0	n = int(input()) print('+------------------------+') t =[ list('\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)'), list('\|#.#.#.#.#.#.#.#.#.#.#.\|.\|'), list('\|#.......................\|'), list('\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)')] kol = 0 f = 0 for i in range(347): for j in range(4): if t[j][i] =='#': ...	Title: Bayan Bus Time Limit: None seconds Memory Limit: None megabytes Problem Description: The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 seats in remaining rows. The ...	```python n = int(input()) print('+------------------------+') t =[ list('\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)'), list('\|#.#.#.#.#.#.#.#.#.#.#.\|.\|'), list('\|#.......................\|'), list('\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)')] kol = 0 f = 0 for i in range(347): for j in range(4): if t[j][...	0
137	A	Postcards and photos	PROGRAMMING	900	[ "implementation" ]		null	null	Polycarpus has postcards and photos hung in a row on the wall. He decided to put them away to the closet and hang on the wall a famous painter's picture. Polycarpus does it like that: he goes from the left to the right and removes the objects consecutively. As Polycarpus doesn't want any mix-ups to happen, he will not ...	The only line of the input data contains a non-empty string consisting of letters "С" and "P" whose length does not exceed 100 characters. If the i-th character in the string is the letter "С", that means that the i-th object (the numbering goes from the left to the right) on Polycarpus' wall is a postcard. And if ...	Print the only number — the minimum number of times Polycarpus has to visit the closet.	[ "CPCPCPC\n", "CCCCCCPPPPPP\n", "CCCCCCPPCPPPPPPPPPP\n", "CCCCCCCCCC\n" ]	[ "7\n", "4\n", "6\n", "2\n" ]	In the first sample Polycarpus needs to take one item to the closet 7 times. In the second sample Polycarpus can first take 3 postcards to the closet; then 3 more. He can take the 6 photos that are left in the similar way, going to the closet twice. In the third sample Polycarpus can visit the closet twice, both time...	500	[ { "input": "CPCPCPC", "output": "7" }, { "input": "CCCCCCPPPPPP", "output": "4" }, { "input": "CCCCCCPPCPPPPPPPPPP", "output": "6" }, { "input": "CCCCCCCCCC", "output": "2" }, { "input": "CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC...	1,387,652,354	2,147,483,647	Python 3	OK	TESTS	45	124	102,400	read=input() counter=0 maxI=0 #print( read[i],read[i-1],maxI,i) for i in range(len(read)-1): if maxI==0: counter+=1 if maxI==4 or read[i]!=read[i+1]: maxI=0 else: maxI+=1 i=len(read)-1 if read[i]!=read[i-1]: counter+=1 elif maxI==0: counter+=1...	Title: Postcards and photos Time Limit: None seconds Memory Limit: None megabytes Problem Description: Polycarpus has postcards and photos hung in a row on the wall. He decided to put them away to the closet and hang on the wall a famous painter's picture. Polycarpus does it like that: he goes from the left to the r...	```python read=input() counter=0 maxI=0 #print( read[i],read[i-1],maxI,i) for i in range(len(read)-1): if maxI==0: counter+=1 if maxI==4 or read[i]!=read[i+1]: maxI=0 else: maxI+=1 i=len(read)-1 if read[i]!=read[i-1]: counter+=1 elif maxI==0: ...	3
540	A	Combination Lock	PROGRAMMING	800	[ "implementation" ]		null	null	Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock. The combination lock is represented by n rotating disks with digits from 0 to 9 written on them. Scrooge McDuck has to turn ...	The first line contains a single integer n (1<=≤<=n<=≤<=1000) — the number of disks on the combination lock. The second line contains a string of n digits — the original state of the disks. The third line contains a string of n digits — Scrooge McDuck's combination that opens the lock.	Print a single integer — the minimum number of moves Scrooge McDuck needs to open the lock.	[ "5\n82195\n64723\n" ]	[ "13\n" ]	In the sample he needs 13 moves: - 1 disk: <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/b8967f65a723782358b93eff9ce69f336817cf70.png" style="max-width: 100.0%;max-height: 100.0%;"/> - 2 disk: <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/07fa58573ece0d32...	500	[ { "input": "5\n82195\n64723", "output": "13" }, { "input": "12\n102021090898\n010212908089", "output": "16" }, { "input": "1\n8\n1", "output": "3" }, { "input": "2\n83\n57", "output": "7" }, { "input": "10\n0728592530\n1362615763", "output": "27" }, { ...	1,696,327,053	2,147,483,647	PyPy 3-64	OK	TESTS	43	77	0	n = int(input()) a = input() b = input() cnt = 0 for i in range(n): if abs(int(a[i])-int(b[i]))<=5: cnt += abs(int(a[i])-int(b[i])) else: cnt += 10 - abs(int(a[i])-int(b[i])) print(cnt)	Title: Combination Lock Time Limit: None seconds Memory Limit: None megabytes Problem Description: Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock. The combination lock is ...	```python n = int(input()) a = input() b = input() cnt = 0 for i in range(n): if abs(int(a[i])-int(b[i]))<=5: cnt += abs(int(a[i])-int(b[i])) else: cnt += 10 - abs(int(a[i])-int(b[i])) print(cnt) ```	3
842	B	Gleb And Pizza	PROGRAMMING	1,100	[ "geometry" ]		null	null	Gleb ordered pizza home. When the courier delivered the pizza, he was very upset, because several pieces of sausage lay on the crust, and he does not really like the crust. The pizza is a circle of radius r and center at the origin. Pizza consists of the main part — circle of radius r<=-<=d with center at the or...	First string contains two integer numbers r and d (0<=≤<=d<=<<=r<=≤<=500) — the radius of pizza and the width of crust. Next line contains one integer number n — the number of pieces of sausage (1<=≤<=n<=≤<=105). Each of next n lines contains three integer numbers xi, yi and ri (<=-<=500<...	Output the number of pieces of sausage that lay on the crust.	[ "8 4\n7\n7 8 1\n-7 3 2\n0 2 1\n0 -2 2\n-3 -3 1\n0 6 2\n5 3 1\n", "10 8\n4\n0 0 9\n0 0 10\n1 0 1\n1 0 2\n" ]	[ "2\n", "0\n" ]	Below is a picture explaining the first example. Circles of green color denote pieces of sausage lying on the crust.	1,000	[ { "input": "8 4\n7\n7 8 1\n-7 3 2\n0 2 1\n0 -2 2\n-3 -3 1\n0 6 2\n5 3 1", "output": "2" }, { "input": "10 8\n4\n0 0 9\n0 0 10\n1 0 1\n1 0 2", "output": "0" }, { "input": "1 0\n1\n1 1 0", "output": "0" }, { "input": "3 0\n5\n3 0 0\n0 3 0\n-3 0 0\n0 -3 0\n3 0 1", "output": ...	1,504,024,789	5,689	Python 3	OK	TESTS	34	623	0	def isInter(x1, y1, r1, x2, y2, r2): r = ((x2 - x1) 2 + (y2 - y1) 2) 0.5 if r < r1 + r2 and r > abs(r1 - r2): return True return False def di(x1, y1, x2, y2): return ((x2 - x1) 2 + (y2 - y1) 2) 0.5 r, d = map(int, input().split()) n = int(input()) ans = 0 for ...	Title: Gleb And Pizza Time Limit: None seconds Memory Limit: None megabytes Problem Description: Gleb ordered pizza home. When the courier delivered the pizza, he was very upset, because several pieces of sausage lay on the crust, and he does not really like the crust. The pizza is a circle of radius r and center...	```python def isInter(x1, y1, r1, x2, y2, r2): r = ((x2 - x1) 2 + (y2 - y1) 2) 0.5 if r < r1 + r2 and r > abs(r1 - r2): return True return False def di(x1, y1, x2, y2): return ((x2 - x1) 2 + (y2 - y1) 2) 0.5 r, d = map(int, input().split()) n = int(input()) ans...	3
622	B	The Time	PROGRAMMING	900	[ "implementation" ]		null	null	You are given the current time in 24-hour format hh:mm. Find and print the time after a minutes. Note that you should find only the time after a minutes, see the examples to clarify the problem statement. You can read more about 24-hour format here [https://en.wikipedia.org/wiki/24-hour_clock](https://en.wikipedi...	The first line contains the current time in the format hh:mm (0<=≤<=hh<=<<=24,<=0<=≤<=mm<=<<=60). The hours and the minutes are given with two digits (the hours or the minutes less than 10 are given with the leading zeroes). The second line contains integer a (0<=≤<=a<=≤<=104) — the number of the minutes...	The only line should contain the time after a minutes in the format described in the input. Note that you should print exactly two digits for the hours and the minutes (add leading zeroes to the numbers if needed). See the examples to check the input/output format.	[ "23:59\n10\n", "20:20\n121\n", "10:10\n0\n" ]	[ "00:09\n", "22:21\n", "10:10\n" ]	none	0	[ { "input": "23:59\n10", "output": "00:09" }, { "input": "20:20\n121", "output": "22:21" }, { "input": "10:10\n0", "output": "10:10" }, { "input": "12:34\n10000", "output": "11:14" }, { "input": "00:00\n10000", "output": "22:40" }, { "input": "00:00\n14...	1,482,332,089	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	5	61	4,608,000	st = input().split(':') add = int(input()) for i in range(add): if int(st[1]) + 1 == 60: if (int(st[0]) + 1 == 24): st[0] = "00" st[1] = "00" else: st[0] = int(st[0]) + 1 st[1] = "00" else: st[1] = int(st[1]) + 1 if int(st[1]) /...	Title: The Time Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given the current time in 24-hour format hh:mm. Find and print the time after a minutes. Note that you should find only the time after a minutes, see the examples to clarify the problem statement. You can read mo...	```python st = input().split(':') add = int(input()) for i in range(add): if int(st[1]) + 1 == 60: if (int(st[0]) + 1 == 24): st[0] = "00" st[1] = "00" else: st[0] = int(st[0]) + 1 st[1] = "00" else: st[1] = int(st[1]) + 1 if in...	0
977	C	Less or Equal	PROGRAMMING	1,200	[ "sortings" ]		null	null	You are given a sequence of integers of length $n$ and integer number $k$. You should print any integer number $x$ in the range of $[1; 10^9]$ (i.e. $1 \le x \le 10^9$) such that exactly $k$ elements of given sequence are less than or equal to $x$. Note that the sequence can contain equal elements. If there is no suc...	The first line of the input contains integer numbers $n$ and $k$ ($1 \le n \le 2 \cdot 10^5$, $0 \le k \le n$). The second line of the input contains $n$ integer numbers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^9$) — the sequence itself.	Print any integer number $x$ from range $[1; 10^9]$ such that exactly $k$ elements of given sequence is less or equal to $x$. If there is no such $x$, print "-1" (without quotes).	[ "7 4\n3 7 5 1 10 3 20\n", "7 2\n3 7 5 1 10 3 20\n" ]	[ "6", "-1\n" ]	In the first example $5$ is also a valid answer because the elements with indices $[1, 3, 4, 6]$ is less than or equal to $5$ and obviously less than or equal to $6$. In the second example you cannot choose any number that only $2$ elements of the given sequence will be less than or equal to this number because $3$ el...	0	[ { "input": "7 4\n3 7 5 1 10 3 20", "output": "5" }, { "input": "7 2\n3 7 5 1 10 3 20", "output": "-1" }, { "input": "1 0\n1", "output": "-1" }, { "input": "1 0\n2", "output": "1" }, { "input": "1 1\n1000000000", "output": "1000000000" }, { "input": "3 ...	1,699,991,869	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	30	0	v1, v2 = map(int, input().split()) sequence = list(map(int, input().split())) # Sort the sequence in ascending order sequence.sort() # Initialize the answer to -1 answer = -1 # Perform a binary search to find the number satisfying the condition left, right = 1, 10 ** 9 + 1 # Set the search range while ...	Title: Less or Equal Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given a sequence of integers of length $n$ and integer number $k$. You should print any integer number $x$ in the range of $[1; 10^9]$ (i.e. $1 \le x \le 10^9$) such that exactly $k$ elements of given sequence are...	```python v1, v2 = map(int, input().split()) sequence = list(map(int, input().split())) # Sort the sequence in ascending order sequence.sort() # Initialize the answer to -1 answer = -1 # Perform a binary search to find the number satisfying the condition left, right = 1, 10 ** 9 + 1 # Set the search range...	0
765	C	Table Tennis Game 2	PROGRAMMING	1,200	[ "math" ]		null	null	Misha and Vanya have played several table tennis sets. Each set consists of several serves, each serve is won by one of the players, he receives one point and the loser receives nothing. Once one of the players scores exactly k points, the score is reset and a new set begins. Across all the sets Misha scored a poi...	The first line contains three space-separated integers k, a and b (1<=≤<=k<=≤<=109, 0<=≤<=a,<=b<=≤<=109, a<=+<=b<=><=0).	If the situation is impossible, print a single number -1. Otherwise, print the maximum possible number of sets.	[ "11 11 5\n", "11 2 3\n" ]	[ "1\n", "-1\n" ]	Note that the rules of the game in this problem differ from the real table tennis game, for example, the rule of "balance" (the winning player has to be at least two points ahead to win a set) has no power within the present problem.	1,250	[ { "input": "11 11 5", "output": "1" }, { "input": "11 2 3", "output": "-1" }, { "input": "1 5 9", "output": "14" }, { "input": "2 3 3", "output": "2" }, { "input": "1 1000000000 1000000000", "output": "2000000000" }, { "input": "2 3 5", "output": "...	1,610,412,794	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	3	46	0	a,b,c = map(int,input().split()) if b + c >= a: print((b+c)//a) else: print(-1)	Title: Table Tennis Game 2 Time Limit: None seconds Memory Limit: None megabytes Problem Description: Misha and Vanya have played several table tennis sets. Each set consists of several serves, each serve is won by one of the players, he receives one point and the loser receives nothing. Once one of the players scor...	```python a,b,c = map(int,input().split()) if b + c >= a: print((b+c)//a) else: print(-1) ```	0
239	A	Two Bags of Potatoes	PROGRAMMING	1,200	[ "greedy", "implementation", "math" ]		null	null	Valera had two bags of potatoes, the first of these bags contains x (x<=≥<=1) potatoes, and the second — y (y<=≥<=1) potatoes. Valera — very scattered boy, so the first bag of potatoes (it contains x potatoes) Valera lost. Valera remembers that the total amount of potatoes (x<=+<=y) in the two bags, first...	The first line of input contains three integers y, k, n (1<=≤<=y,<=k,<=n<=≤<=109; <=≤<=105).	Print the list of whitespace-separated integers — all possible values of x in ascending order. You should print each possible value of x exactly once. If there are no such values of x print a single integer -1.	[ "10 1 10\n", "10 6 40\n" ]	[ "-1\n", "2 8 14 20 26 \n" ]	none	500	[ { "input": "10 1 10", "output": "-1" }, { "input": "10 6 40", "output": "2 8 14 20 26 " }, { "input": "10 1 20", "output": "1 2 3 4 5 6 7 8 9 10 " }, { "input": "1 10000 1000000000", "output": "9999 19999 29999 39999 49999 59999 69999 79999 89999 99999 109999 119999 12999...	1,628,321,122	2,147,483,647	Python 3	OK	TESTS	48	404	6,963,200	y,k,n=list(map(int,input().split())) ans="" if n-y<=0: print(-1) else: g=0 for i in range(k-(y%k),n-y+1,k): print(i) g=1 if g==0: print(-1)	Title: Two Bags of Potatoes Time Limit: None seconds Memory Limit: None megabytes Problem Description: Valera had two bags of potatoes, the first of these bags contains x (x<=≥<=1) potatoes, and the second — y (y<=≥<=1) potatoes. Valera — very scattered boy, so the first bag of potatoes (it contains x pota...	```python y,k,n=list(map(int,input().split())) ans="" if n-y<=0: print(-1) else: g=0 for i in range(k-(y%k),n-y+1,k): print(i) g=1 if g==0: print(-1) ```	3
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 lik...	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":...	1,680,036,061	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	30	0	x=input() print(x[0],len (x )-2,x[-1])	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 character...	```python x=input() print(x[0],len (x )-2,x[-1]) ```	0
935	A	Fafa and his Company	PROGRAMMING	800	[ "brute force", "implementation" ]		null	null	Fafa owns a company that works on huge projects. There are n employees in Fafa's company. Whenever the company has a new project to start working on, Fafa has to divide the tasks of this project among all the employees. Fafa finds doing this every time is very tiring for him. So, he decided to choose the best l em...	The input consists of a single line containing a positive integer n (2<=≤<=n<=≤<=105) — the number of employees in Fafa's company.	Print a single integer representing the answer to the problem.	[ "2\n", "10\n" ]	[ "1\n", "3\n" ]	In the second sample Fafa has 3 ways: - choose only 1 employee as a team leader with 9 employees under his responsibility. - choose 2 employees as team leaders with 4 employees under the responsibility of each of them. - choose 5 employees as team leaders with 1 employee under the responsibility of each of them.	500	[ { "input": "2", "output": "1" }, { "input": "10", "output": "3" }, { "input": "3", "output": "1" }, { "input": "4", "output": "2" }, { "input": "6", "output": "3" }, { "input": "13", "output": "1" }, { "input": "100000", "output": "35" ...	1,697,947,046	2,147,483,647	Python 3	OK	TESTS	33	62	11,161,600	a=[2,3,5,7,11,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,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,...	Title: Fafa and his Company Time Limit: None seconds Memory Limit: None megabytes Problem Description: Fafa owns a company that works on huge projects. There are n employees in Fafa's company. Whenever the company has a new project to start working on, Fafa has to divide the tasks of this project among all the emp...	```python a=[2,3,5,7,11,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,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,42...	3
1,003	A	Polycarp's Pockets	PROGRAMMING	800	[ "implementation" ]		null	null	Polycarp has $n$ coins, the value of the $i$-th coin is $a_i$. Polycarp wants to distribute all the coins between his pockets, but he cannot put two coins with the same value into the same pocket. For example, if Polycarp has got six coins represented as an array $a = [1, 2, 4, 3, 3, 2]$, he can distribute the coins i...	The first line of the input contains one integer $n$ ($1 \le n \le 100$) — the number of coins. The second line of the input contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 100$) — values of coins.	Print only one integer — the minimum number of pockets Polycarp needs to distribute all the coins so no two coins with the same value are put into the same pocket.	[ "6\n1 2 4 3 3 2\n", "1\n100\n" ]	[ "2\n", "1\n" ]	none	0	[ { "input": "6\n1 2 4 3 3 2", "output": "2" }, { "input": "1\n100", "output": "1" }, { "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...	1,642,418,120	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	15	0	n=int(input()) a=list() for i in range(n): a.append(int(input())) print(2)	Title: Polycarp's Pockets Time Limit: None seconds Memory Limit: None megabytes Problem Description: Polycarp has $n$ coins, the value of the $i$-th coin is $a_i$. Polycarp wants to distribute all the coins between his pockets, but he cannot put two coins with the same value into the same pocket. For example, if Po...	```python n=int(input()) a=list() for i in range(n): a.append(int(input())) print(2) ```	-1
722	D	Generating Sets	PROGRAMMING	1,900	[ "binary search", "data structures", "dfs and similar", "greedy", "strings", "trees" ]		null	null	You are given a set Y of n distinct positive integers y1,<=y2,<=...,<=yn. Set X of n distinct positive integers x1,<=x2,<=...,<=xn is said to generate set Y if one can transform X to Y by applying some number of the following two operation to integers in X: 1. Take any integer xi ...	The first line of the input contains a single integer n (1<=≤<=n<=≤<=50<=000) — the number of elements in Y. The second line contains n integers y1,<=...,<=yn (1<=≤<=yi<=≤<=109), that are guaranteed to be distinct.	Print n integers — set of distinct integers that generate Y and the maximum element of which is minimum possible. If there are several such sets, print any of them.	[ "5\n1 2 3 4 5\n", "6\n15 14 3 13 1 12\n", "6\n9 7 13 17 5 11\n" ]	[ "4 5 2 3 1 \n", "12 13 14 7 3 1 \n", "4 5 2 6 3 1 \n" ]	none	1,500	[ { "input": "5\n1 2 3 4 5", "output": "4 5 2 3 1 " }, { "input": "6\n15 14 3 13 1 12", "output": "12 13 14 7 3 1 " }, { "input": "6\n9 7 13 17 5 11", "output": "4 5 2 6 3 1 " }, { "input": "10\n18 14 19 17 11 7 20 10 4 12", "output": "8 9 4 10 5 2 6 7 3 1 " }, { "i...	1,660,134,576	2,147,483,647	PyPy 3-64	RUNTIME_ERROR	TESTS	1	77	3,174,400	import heapq import math test=int(input()) arr=[int(x) for x in input().split()] for i in range(len(arr)): arr[i]*=-1 heapq.heapify(arr) visited=set(arr) ans=[] while arr: value=heapq.heappop(arr) temp=value while (math.ceil(value/2) in visited) and math.ceil(value/2)!=0: va...	Title: Generating Sets Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given a set Y of n distinct positive integers y1,<=y2,<=...,<=yn. Set X of n distinct positive integers x1,<=x2,<=...,<=xn is said to generate set Y if one can transform X to Y by ...	```python import heapq import math test=int(input()) arr=[int(x) for x in input().split()] for i in range(len(arr)): arr[i]*=-1 heapq.heapify(arr) visited=set(arr) ans=[] while arr: value=heapq.heappop(arr) temp=value while (math.ceil(value/2) in visited) and math.ceil(value/2)!=0: ...	-1
593	A	2Char	PROGRAMMING	1,200	[ "brute force", "implementation" ]		null	null	Andrew often reads articles in his favorite magazine 2Char. The main feature of these articles is that each of them uses at most two distinct letters. Andrew decided to send an article to the magazine, but as he hasn't written any article, he just decided to take a random one from magazine 26Char. However, before sendi...	The first line of the input contains number n (1<=≤<=n<=≤<=100) — the number of words in the article chosen by Andrew. Following are n lines, each of them contains one word. All the words consist only of small English letters and their total length doesn't exceed 1000. The words are not guaranteed to be distinct,...	Print a single integer — the maximum possible total length of words in Andrew's article.	[ "4\nabb\ncacc\naaa\nbbb\n", "5\na\na\nbcbcb\ncdecdecdecdecdecde\naaaa\n" ]	[ "9", "6" ]	In the first sample the optimal way to choose words is {'abb', 'aaa', 'bbb'}. In the second sample the word 'cdecdecdecdecdecde' consists of three distinct letters, and thus cannot be used in the article. The optimal answer is {'a', 'a', 'aaaa'}.	250	[ { "input": "4\nabb\ncacc\naaa\nbbb", "output": "9" }, { "input": "5\na\na\nbcbcb\ncdecdecdecdecdecde\naaaa", "output": "6" }, { "input": "1\na", "output": "1" }, { "input": "2\nz\nz", "output": "2" }, { "input": "5\nabcde\nfghij\nklmno\npqrst\nuvwxy", "output"...	1,446,658,187	2,687	Python 3	WRONG_ANSWER	PRETESTS	11	61	0	def get_letters(word): letters = set(word) return ''.join(sorted(letters)) def main(): n = int(input()) words = [input() for _ in range(n)] two_letter_maps = {} single_letter_maps = {} for word in words: letters = get_letters(word) if len(letters) == 2: increas...	Title: 2Char Time Limit: None seconds Memory Limit: None megabytes Problem Description: Andrew often reads articles in his favorite magazine 2Char. The main feature of these articles is that each of them uses at most two distinct letters. Andrew decided to send an article to the magazine, but as he hasn't written an...	```python def get_letters(word): letters = set(word) return ''.join(sorted(letters)) def main(): n = int(input()) words = [input() for _ in range(n)] two_letter_maps = {} single_letter_maps = {} for word in words: letters = get_letters(word) if len(letters) == 2: ...	0
825	C	Multi-judge Solving	PROGRAMMING	1,600	[ "greedy", "implementation" ]		null	null	Makes solves problems on Decoforces and lots of other different online judges. Each problem is denoted by its difficulty — a positive integer number. Difficulties are measured the same across all the judges (the problem with difficulty d on Decoforces is as hard as the problem with difficulty d on any other judge)....	The first line contains two integer numbers n, k (1<=≤<=n<=≤<=103, 1<=≤<=k<=≤<=109). The second line contains n space-separated integer numbers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=109).	Print minimum number of problems Makes should solve on other judges in order to solve all chosen problems on Decoforces.	[ "3 3\n2 1 9\n", "4 20\n10 3 6 3\n" ]	[ "1\n", "0\n" ]	In the first example Makes at first solves problems 1 and 2. Then in order to solve the problem with difficulty 9, he should solve problem with difficulty no less than 5. The only available are difficulties 5 and 6 on some other judge. Solving any of these will give Makes opportunity to solve problem 3. In the second ...	0	[ { "input": "3 3\n2 1 9", "output": "1" }, { "input": "4 20\n10 3 6 3", "output": "0" }, { "input": "1 1000000000\n1", "output": "0" }, { "input": "1 1\n3", "output": "1" }, { "input": "50 100\n74 55 33 5 83 24 75 59 30 36 13 4 62 28 96 17 6 35 45 53 33 11 37 93 34...	1,503,906,912	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	5	46	0	n,k = input().split(' ') a = input().split(' ') n = int(n) k = int(k) res = n for i in a: if k*2>=int(i): res-=1 print(res)	Title: Multi-judge Solving Time Limit: None seconds Memory Limit: None megabytes Problem Description: Makes solves problems on Decoforces and lots of other different online judges. Each problem is denoted by its difficulty — a positive integer number. Difficulties are measured the same across all the judges (the pro...	```python n,k = input().split(' ') a = input().split(' ') n = int(n) k = int(k) res = n for i in a: if k*2>=int(i): res-=1 print(res) ```	0
271	A	Beautiful Year	PROGRAMMING	800	[ "brute force" ]		null	null	It seems like the year of 2013 came only yesterday. Do you know a curious fact? The year of 2013 is the first year after the old 1987 with only distinct digits. Now you are suggested to solve the following problem: given a year number, find the minimum year number which is strictly larger than the given one and has on...	The single line contains integer y (1000<=≤<=y<=≤<=9000) — the year number.	Print a single integer — the minimum year number that is strictly larger than y and all it's digits are distinct. It is guaranteed that the answer exists.	[ "1987\n", "2013\n" ]	[ "2013\n", "2014\n" ]	none	500	[ { "input": "1987", "output": "2013" }, { "input": "2013", "output": "2014" }, { "input": "1000", "output": "1023" }, { "input": "1001", "output": "1023" }, { "input": "1234", "output": "1235" }, { "input": "5555", "output": "5601" }, { "inp...	1,699,462,340	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	6	92	0	year = int(input()) year+=1 while year<9001: s=str(year) sDigits='0123456789' for i in sDigits: if s.count(i)>1: year+=1 break else: break print(year)	Title: Beautiful Year Time Limit: None seconds Memory Limit: None megabytes Problem Description: It seems like the year of 2013 came only yesterday. Do you know a curious fact? The year of 2013 is the first year after the old 1987 with only distinct digits. Now you are suggested to solve the following problem: give...	```python year = int(input()) year+=1 while year<9001: s=str(year) sDigits='0123456789' for i in sDigits: if s.count(i)>1: year+=1 break else: break print(year) ```	0
832	A	Sasha and Sticks	PROGRAMMING	800	[ "games", "math" ]		null	null	It's one more school day now. Sasha doesn't like classes and is always bored at them. So, each day he invents some game and plays in it alone or with friends. Today he invented one simple game to play with Lena, with whom he shares a desk. The rules are simple. Sasha draws n sticks in a row. After that the players t...	The first line contains two integers n and k (1<=≤<=n,<=k<=≤<=1018, k<=≤<=n) — the number of sticks drawn by Sasha and the number k — the number of sticks to be crossed out on each turn.	If Sasha wins, print "YES" (without quotes), otherwise print "NO" (without quotes). You can print each letter in arbitrary case (upper of lower).	[ "1 1\n", "10 4\n" ]	[ "YES\n", "NO\n" ]	In the first example Sasha crosses out 1 stick, and then there are no sticks. So Lena can't make a move, and Sasha wins. In the second example Sasha crosses out 4 sticks, then Lena crosses out 4 sticks, and after that there are only 2 sticks left. Sasha can't make a move. The players make equal number of moves, so Sas...	500	[ { "input": "1 1", "output": "YES" }, { "input": "10 4", "output": "NO" }, { "input": "251656215122324104 164397544865601257", "output": "YES" }, { "input": "963577813436662285 206326039287271924", "output": "NO" }, { "input": "1000000000000000000 1", "output":...	1,628,389,585	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	0	62	20,172,800	import math def solve(n, m): dif = n/m if dif % 3 == 0: return 'YES' return 'NO' if __name__ == "__main__": n, m = map(int, input().split()) print(solve(n, m))	Title: Sasha and Sticks Time Limit: None seconds Memory Limit: None megabytes Problem Description: It's one more school day now. Sasha doesn't like classes and is always bored at them. So, each day he invents some game and plays in it alone or with friends. Today he invented one simple game to play with Lena, with ...	```python import math def solve(n, m): dif = n/m if dif % 3 == 0: return 'YES' return 'NO' if __name__ == "__main__": n, m = map(int, input().split()) print(solve(n, m)) ```	0
920	E	Connected Components?	PROGRAMMING	2,100	[ "data structures", "dfs and similar", "dsu", "graphs" ]		null	null	You are given an undirected graph consisting of n vertices and edges. Instead of giving you the edges that exist in the graph, we give you m unordered pairs (x,<=y) such that there is no edge between x and y, and if some pair of vertices is not listed in the input, then there is an edge between these verti...	The first line contains two integers n and m (1<=≤<=n<=≤<=200000, ). Then m lines follow, each containing a pair of integers x and y (1<=≤<=x,<=y<=≤<=n, x<=≠<=y) denoting that there is no edge between x and y. Each pair is listed at most once; (x,<=y) and (y,<=x) are considered the sa...	Firstly print k — the number of connected components in this graph. Then print k integers — the sizes of components. You should output these integers in non-descending order.	[ "5 5\n1 2\n3 4\n3 2\n4 2\n2 5\n" ]	[ "2\n1 4 " ]	none	0	[ { "input": "5 5\n1 2\n3 4\n3 2\n4 2\n2 5", "output": "2\n1 4 " }, { "input": "8 15\n2 1\n4 5\n2 4\n3 4\n2 5\n3 5\n2 6\n3 6\n5 6\n4 6\n2 7\n3 8\n2 8\n3 7\n6 7", "output": "1\n8 " }, { "input": "12 58\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 10\n1 11\n1 12\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n...	1,691,258,653	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	0	31	0	print("_RANDOM_GUESS_1691258651.730968")# 1691258651.7309842	Title: Connected Components? Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given an undirected graph consisting of n vertices and edges. Instead of giving you the edges that exist in the graph, we give you m unordered pairs (x,<=y) such that there is no edge between x ...	```python print("_RANDOM_GUESS_1691258651.730968")# 1691258651.7309842 ```	0
597	A	Divisibility	PROGRAMMING	1,600	[ "math" ]		null	null	Find the number of k-divisible numbers on the segment [a,<=b]. In other words you need to find the number of such integer values x that a<=≤<=x<=≤<=b and x is divisible by k.	The only line contains three space-separated integers k, a and b (1<=≤<=k<=≤<=1018;<=-<=1018<=≤<=a<=≤<=b<=≤<=1018).	Print the required number.	[ "1 1 10\n", "2 -4 4\n" ]	[ "10\n", "5\n" ]	none	500	[ { "input": "1 1 10", "output": "10" }, { "input": "2 -4 4", "output": "5" }, { "input": "1 1 1", "output": "1" }, { "input": "1 0 0", "output": "1" }, { "input": "1 0 1", "output": "2" }, { "input": "1 10181 10182", "output": "2" }, { "inpu...	1,689,105,837	2,147,483,647	PyPy 3-64	OK	TESTS	81	62	0	k,a,b=[int(e) for e in input().split()] a+=k1019 b+=k10**19 print(b//k-(a-1)//k)	Title: Divisibility Time Limit: None seconds Memory Limit: None megabytes Problem Description: Find the number of k-divisible numbers on the segment [a,<=b]. In other words you need to find the number of such integer values x that a<=≤<=x<=≤<=b and x is divisible by k. Input Specification: The onl...	```python k,a,b=[int(e) for e in input().split()] a+=k1019 b+=k10**19 print(b//k-(a-1)//k) ```	3
791	A	Bear and Big Brother	PROGRAMMING	800	[ "implementation" ]		null	null	Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob. Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight. Limak eats a lot and his weight is tripled after every year, while Bob's we...	The only line of the input contains two integers a and b (1<=≤<=a<=≤<=b<=≤<=10) — the weight of Limak and the weight of Bob respectively.	Print one integer, denoting the integer number of years after which Limak will become strictly larger than Bob.	[ "4 7\n", "4 9\n", "1 1\n" ]	[ "2\n", "3\n", "1\n" ]	In the first sample, Limak weighs 4 and Bob weighs 7 initially. After one year their weights are 4·3 = 12 and 7·2 = 14 respectively (one weight is tripled while the other one is doubled). Limak isn't larger than Bob yet. After the second year weights are 36 and 28, so the first weight is greater than the second one. Li...	500	[ { "input": "4 7", "output": "2" }, { "input": "4 9", "output": "3" }, { "input": "1 1", "output": "1" }, { "input": "4 6", "output": "2" }, { "input": "1 10", "output": "6" }, { "input": "1 1", "output": "1" }, { "input": "1 2", "output...	1,695,626,664	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	31	0	a=int(input()) b=int(input()) if (a>10): a=10 if (b>10): b=10 gadi=0 while a<=b: a=a3 b=b2 gadi=gadi+1 print(gadi)	Title: Bear and Big Brother Time Limit: None seconds Memory Limit: None megabytes Problem Description: Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob. Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is smaller than or e...	```python a=int(input()) b=int(input()) if (a>10): a=10 if (b>10): b=10 gadi=0 while a<=b: a=a3 b=b2 gadi=gadi+1 print(gadi) ```	-1
535	A	Tavas and Nafas	PROGRAMMING	1,000	[ "brute force", "implementation" ]		null	null	Today Tavas got his test result as an integer score and he wants to share it with his girlfriend, Nafas. His phone operating system is Tavdroid, and its keyboard doesn't have any digits! He wants to share his score with Nafas via text, so he has no choice but to send this number using words. He ate coffee mix without...	The first and only line of input contains an integer s (0<=≤<=s<=≤<=99), Tavas's score.	In the first and only line of output, print a single string consisting only from English lowercase letters and hyphens ('-'). Do not use spaces.	[ "6\n", "99\n", "20\n" ]	[ "six\n", "ninety-nine\n", "twenty\n" ]	You can find all you need to know about English numerals in [http://en.wikipedia.org/wiki/English_numerals](https://en.wikipedia.org/wiki/English_numerals) .	500	[ { "input": "6", "output": "six" }, { "input": "99", "output": "ninety-nine" }, { "input": "20", "output": "twenty" }, { "input": "10", "output": "ten" }, { "input": "15", "output": "fifteen" }, { "input": "27", "output": "twenty-seven" }, { ...	1,590,007,686	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	8	109	307,200	n = input() un = { 0: '', 1: 'one', 2: 'two', 3: 'three', 4: 'four', 5: 'five', 6: 'six', 7: 'seven', 8: 'eight', 9: 'nine' } de = { 2: 'twenty', 3: 'thirty', 4: 'forty', 5: 'fifty', 6: 'sixty', 7: 'seventy', 8: 'eighty', 9: 'ninety' } es = { 10: 'ten', 11: 'eleven', 12: 'tw...	Title: Tavas and Nafas Time Limit: None seconds Memory Limit: None megabytes Problem Description: Today Tavas got his test result as an integer score and he wants to share it with his girlfriend, Nafas. His phone operating system is Tavdroid, and its keyboard doesn't have any digits! He wants to share his score wit...	```python n = input() un = { 0: '', 1: 'one', 2: 'two', 3: 'three', 4: 'four', 5: 'five', 6: 'six', 7: 'seven', 8: 'eight', 9: 'nine' } de = { 2: 'twenty', 3: 'thirty', 4: 'forty', 5: 'fifty', 6: 'sixty', 7: 'seventy', 8: 'eighty', 9: 'ninety' } es = { 10: 'ten', 11: 'eleven',...	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 th...	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": "chn...	1,672,329,082	2,147,483,647	Python 3	OK	TESTS	30	92	0	word = input() uppercase = 0 lowercase = 0 for i in range(len(word)): if ord(word[i]) >= ord('A') and ord(word[i]) <= ord('Z'): uppercase += 1 if uppercase >= len(word)//2 + 1: uppercase = len(word) break else: lowercase += 1 if uppercase > lowerc...	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 ei...	```python word = input() uppercase = 0 lowercase = 0 for i in range(len(word)): if ord(word[i]) >= ord('A') and ord(word[i]) <= ord('Z'): uppercase += 1 if uppercase >= len(word)//2 + 1: uppercase = len(word) break else: lowercase += 1 if uppercas...	3.977
426	B	Sereja and Mirroring	PROGRAMMING	1,300	[ "implementation" ]		null	null	Let's assume that we are given a matrix b of size x<=×<=y, let's determine the operation of mirroring matrix b. The mirroring of matrix b is a 2x<=×<=y matrix c which has the following properties: - the upper half of matrix c (rows with numbers from 1 to x) exactly matches b; - the lower half o...	The first line contains two integers, n and m (1<=≤<=n,<=m<=≤<=100). Each of the next n lines contains m integers — the elements of matrix a. The i-th line contains integers ai1,<=ai2,<=...,<=aim (0<=≤<=aij<=≤<=1) — the i-th row of the matrix a.	In the single line, print the answer to the problem — the minimum number of rows of matrix b.	[ "4 3\n0 0 1\n1 1 0\n1 1 0\n0 0 1\n", "3 3\n0 0 0\n0 0 0\n0 0 0\n", "8 1\n0\n1\n1\n0\n0\n1\n1\n0\n" ]	[ "2\n", "3\n", "2\n" ]	In the first test sample the answer is a 2 × 3 matrix b: If we perform a mirroring operation with this matrix, we get the matrix a that is given in the input:	1,000	[ { "input": "4 3\n0 0 1\n1 1 0\n1 1 0\n0 0 1", "output": "2" }, { "input": "3 3\n0 0 0\n0 0 0\n0 0 0", "output": "3" }, { "input": "8 1\n0\n1\n1\n0\n0\n1\n1\n0", "output": "2" }, { "input": "10 4\n0 0 1 0\n0 0 1 0\n1 1 0 1\n0 0 1 1\n1 0 1 0\n1 0 1 0\n0 0 1 1\n1 1 0 1\n0 0 1 0\...	1,426,571,496	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	46	0	def check(row): return a[0:row//2] == a[row-1:row//2-1:-1] m,n=R() a = [input() for i in range(m)] row = m while row%2==0 and check(row): row //= 2 print(row)	Title: Sereja and Mirroring Time Limit: None seconds Memory Limit: None megabytes Problem Description: Let's assume that we are given a matrix b of size x<=×<=y, let's determine the operation of mirroring matrix b. The mirroring of matrix b is a 2x<=×<=y matrix c which has the following properties: ...	```python def check(row): return a[0:row//2] == a[row-1:row//2-1:-1] m,n=R() a = [input() for i in range(m)] row = m while row%2==0 and check(row): row //= 2 print(row) ```	-1
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 th...	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 58697...	1,686,824,493	2,147,483,647	Python 3	OK	TESTS	34	92	0	n=list(map(int, input().split())) counter=0 if n[0] == n[1] or n[0] == n[2] or n[0] == n[3]: counter += 1 if n[1] == n[2] or n[1] == n[3]: counter += 1 if n[2] == n[3]: counter += 1 print(counter)	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 ...	```python n=list(map(int, input().split())) counter=0 if n[0] == n[1] or n[0] == n[2] or n[0] == n[3]: counter += 1 if n[1] == n[2] or n[1] == n[3]: counter += 1 if n[2] == n[3]: counter += 1 print(counter) ```	3
152	B	Steps	PROGRAMMING	1,300	[ "binary search", "implementation" ]		null	null	One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play touch and run with himself. You may ask: "How did he do that?" The answer is simple. Vasya noticed that the yard is a rectangu...	The first input line contains two integers n and m (1<=≤<=n,<=m<=≤<=109) — the yard's sizes. The second line contains integers xc and yc — the initial square's coordinates (1<=≤<=xc<=≤<=n,<=1<=≤<=yc<=≤<=m). The third line contains an integer k (1<=≤<=k<=≤<=104) — the number of vectors. ...	Print the single number — the number of steps Vasya had made. Please do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specificator.	[ "4 5\n1 1\n3\n1 1\n1 1\n0 -2\n", "10 10\n1 2\n1\n-1 0\n" ]	[ "4\n", "0\n" ]	In the first sample Vasya is initially positioned at square (1, 1) and makes 3 steps by the first vector (1, 1). So, he consecutively visits the squares (2, 2), (3, 3), (4, 4). Then he makes 0 steps by the second vector (1, 1). He makes 1 more step by the third vector (0, - 2) and he ends up in square (4, 2). Overall,...	1,000	[ { "input": "4 5\n1 1\n3\n1 1\n1 1\n0 -2", "output": "4" }, { "input": "10 10\n1 2\n1\n-1 0", "output": "0" }, { "input": "10 20\n10 3\n10\n-2 -6\n-1 0\n-8 0\n0 5\n-1 3\n16 -16\n-1 9\n0 -18\n9 -1\n-9 5", "output": "13" }, { "input": "20 10\n14 4\n10\n6 0\n-7 -7\n12 -2\n-4 9\n2...	1,662,074,928	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	62	0	n, m = map(int, input().split()) xo, yo = map(int, input().split()) x_range = (xo + 1, xo + n - 1) y_range = (yo + 1, yo + m - 1) steps = 0 for _ in range(int(input())): x_move, y_move = map(int, input().split()) if xo + x_move not in range(x_range[0], x_range[1] + 1) or yo + y_move not in range(y_rang...	Title: Steps Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play touch and run with himself. You may ...	```python n, m = map(int, input().split()) xo, yo = map(int, input().split()) x_range = (xo + 1, xo + n - 1) y_range = (yo + 1, yo + m - 1) steps = 0 for _ in range(int(input())): x_move, y_move = map(int, input().split()) if xo + x_move not in range(x_range[0], x_range[1] + 1) or yo + y_move not in ra...	0
915	C	Permute Digits	PROGRAMMING	1,700	[ "dp", "greedy" ]		null	null	You are given two positive integer numbers a and b. Permute (change order) of the digits of a to construct maximal number not exceeding b. No number in input and/or output can start with the digit 0. It is allowed to leave a as it is.	The first line contains integer a (1<=≤<=a<=≤<=1018). The second line contains integer b (1<=≤<=b<=≤<=1018). Numbers don't have leading zeroes. It is guaranteed that answer exists.	Print the maximum possible number that is a permutation of digits of a and is not greater than b. The answer can't have any leading zeroes. It is guaranteed that the answer exists. The number in the output should have exactly the same length as number a. It should be a permutation of digits of a.	[ "123\n222\n", "3921\n10000\n", "4940\n5000\n" ]	[ "213\n", "9321\n", "4940\n" ]	none	0	[ { "input": "123\n222", "output": "213" }, { "input": "3921\n10000", "output": "9321" }, { "input": "4940\n5000", "output": "4940" }, { "input": "23923472834\n23589234723", "output": "23498743322" }, { "input": "102391019\n491010301", "output": "399211100" },...	1,696,263,747	2,147,483,647	PyPy 3-64	TIME_LIMIT_EXCEEDED	TESTS	5	1,000	10,444,800	a = input() b = input() bucket = [0 for i in range(10)] for el in a: bucket[int(el)] += 1 sorteda = "" for i in range(9, -1, -1): sorteda += str(i) * bucket[i] if int(sorteda) <= int(b): print(sorteda) else: c = [-1 for i in range(len(a))] results = [] def rec(i): global c, b ...	Title: Permute Digits Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given two positive integer numbers a and b. Permute (change order) of the digits of a to construct maximal number not exceeding b. No number in input and/or output can start with the digit 0. It is allow...	```python a = input() b = input() bucket = [0 for i in range(10)] for el in a: bucket[int(el)] += 1 sorteda = "" for i in range(9, -1, -1): sorteda += str(i) * bucket[i] if int(sorteda) <= int(b): print(sorteda) else: c = [-1 for i in range(len(a))] results = [] def rec(i): global ...	0
962	A	Equator	PROGRAMMING	1,300	[ "implementation" ]		null	null	Polycarp has created his own training plan to prepare for the programming contests. He will train for $n$ days, all days are numbered from $1$ to $n$, beginning from the first. On the $i$-th day Polycarp will necessarily solve $a_i$ problems. One evening Polycarp plans to celebrate the equator. He will celebrate it on...	The first line contains a single integer $n$ ($1 \le n \le 200\,000$) — the number of days to prepare for the programming contests. The second line contains a sequence $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10\,000$), where $a_i$ equals to the number of problems, which Polycarp will solve on the $i$-th day.	Print the index of the day when Polycarp will celebrate the equator.	[ "4\n1 3 2 1\n", "6\n2 2 2 2 2 2\n" ]	[ "2\n", "3\n" ]	In the first example Polycarp will celebrate the equator on the evening of the second day, because up to this day (inclusive) he will solve $4$ out of $7$ scheduled problems on four days of the training. In the second example Polycarp will celebrate the equator on the evening of the third day, because up to this day (...	0	[ { "input": "4\n1 3 2 1", "output": "2" }, { "input": "6\n2 2 2 2 2 2", "output": "3" }, { "input": "1\n10000", "output": "1" }, { "input": "3\n2 1 1", "output": "1" }, { "input": "2\n1 3", "output": "2" }, { "input": "4\n2 1 1 3", "output": "3" }...	1,650,198,138	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	30	0	n = int(input()) seq = input().split() a = [] for i in range(n): a.append(int(seq[i])) len_a = len(a) mean_a = round(sum(a) / 2) act = 0 for i in range(len_a): act = sum(a[:i]) if act >= mean_a: print(i) break	Title: Equator Time Limit: None seconds Memory Limit: None megabytes Problem Description: Polycarp has created his own training plan to prepare for the programming contests. He will train for $n$ days, all days are numbered from $1$ to $n$, beginning from the first. On the $i$-th day Polycarp will necessarily solve...	```python n = int(input()) seq = input().split() a = [] for i in range(n): a.append(int(seq[i])) len_a = len(a) mean_a = round(sum(a) / 2) act = 0 for i in range(len_a): act = sum(a[:i]) if act >= mean_a: print(i) break ```	0
20	C	Dijkstra?	PROGRAMMING	1,900	[ "graphs", "shortest paths" ]	C. Dijkstra?	1	64	You are given a weighted undirected graph. The vertices are enumerated from 1 to n. Your task is to find the shortest path between the vertex 1 and the vertex n.	The first line contains two integers n and m (2<=≤<=n<=≤<=105,<=0<=≤<=m<=≤<=105), where n is the number of vertices and m is the number of edges. Following m lines contain one edge each in form ai, bi and wi (1<=≤<=ai,<=bi<=≤<=n,<=1<=≤<=wi<=≤<=106), where ai,<=bi are edge...	Write the only integer -1 in case of no path. Write the shortest path in opposite case. If there are many solutions, print any of them.	[ "5 6\n1 2 2\n2 5 5\n2 3 4\n1 4 1\n4 3 3\n3 5 1\n", "5 6\n1 2 2\n2 5 5\n2 3 4\n1 4 1\n4 3 3\n3 5 1\n" ]	[ "1 4 3 5 ", "1 4 3 5 " ]	none	1,500	[ { "input": "5 6\n1 2 2\n2 5 5\n2 3 4\n1 4 1\n4 3 3\n3 5 1", "output": "1 4 3 5 " }, { "input": "5 6\n1 2 2\n2 5 5\n2 3 4\n1 4 1\n4 3 3\n3 5 1", "output": "1 4 3 5 " }, { "input": "2 1\n1 2 1", "output": "1 2 " }, { "input": "3 1\n1 2 1", "output": "-1" }, { "input...	1,676,473,656	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	2	92	3,584,000	from queue import PriorityQueue inf=int(1e13) a,b=list(map(int,input().split())) l=[[] for c in range(a)] for c in range(b): x,y,p=list(map(int,input().split())) l[x-1].append((p,y-1)) l[y-1].append((p,x-1)) q=PriorityQueue() q.put((0,0)) dist=[inf for c in range(a)] dist[0]=0 while not q.empty():...	Title: Dijkstra? Time Limit: 1 seconds Memory Limit: 64 megabytes Problem Description: You are given a weighted undirected graph. The vertices are enumerated from 1 to n. Your task is to find the shortest path between the vertex 1 and the vertex n. Input Specification: The first line contains two integers n a...	```python from queue import PriorityQueue inf=int(1e13) a,b=list(map(int,input().split())) l=[[] for c in range(a)] for c in range(b): x,y,p=list(map(int,input().split())) l[x-1].append((p,y-1)) l[y-1].append((p,x-1)) q=PriorityQueue() q.put((0,0)) dist=[inf for c in range(a)] dist[0]=0 while not ...	0
507	B	Amr and Pins	PROGRAMMING	1,400	[ "geometry", "math" ]		null	null	Amr loves Geometry. One day he came up with a very interesting problem. Amr has a circle of radius r and center in point (x,<=y). He wants the circle center to be in new position (x',<=y'). In one step Amr can put a pin to the border of the circle in a certain point, then rotate the circle around that pin b...	Input consists of 5 space-separated integers r, x, y, x' y' (1<=≤<=r<=≤<=105, <=-<=105<=≤<=x,<=y,<=x',<=y'<=≤<=105), circle radius, coordinates of original center of the circle and coordinates of destination center of the circle respectively.	Output a single integer — minimum number of steps required to move the center of the circle to the destination point.	[ "2 0 0 0 4\n", "1 1 1 4 4\n", "4 5 6 5 6\n" ]	[ "1\n", "3\n", "0\n" ]	In the first sample test the optimal way is to put a pin at point (0, 2) and rotate the circle by 180 degrees counter-clockwise (or clockwise, no matter). <img class="tex-graphics" src="https://espresso.codeforces.com/4e40fd4cc24a2050a0488aa131e6244369328039.png" style="max-width: 100.0%;max-height: 100.0%;"/>	1,000	[ { "input": "2 0 0 0 4", "output": "1" }, { "input": "1 1 1 4 4", "output": "3" }, { "input": "4 5 6 5 6", "output": "0" }, { "input": "10 20 0 40 0", "output": "1" }, { "input": "9 20 0 40 0", "output": "2" }, { "input": "5 -1 -6 -5 1", "output": "...	1,589,233,528	2,147,483,647	Python 3	OK	TESTS	37	109	0	import math aux = input().split(" ") r = int(aux[0]) x1 = int(aux[1]) y1 = int(aux[2]) x2 = int(aux[3]) y2 = int(aux[4]) dist = math.sqrt(math.pow(y2 - y1, 2) + math.pow(x2 - x1, 2)) ans = math.ceil(dist / r / 2) print(ans)	Title: Amr and Pins Time Limit: None seconds Memory Limit: None megabytes Problem Description: Amr loves Geometry. One day he came up with a very interesting problem. Amr has a circle of radius r and center in point (x,<=y). He wants the circle center to be in new position (x',<=y'). In one step Amr can ...	```python import math aux = input().split(" ") r = int(aux[0]) x1 = int(aux[1]) y1 = int(aux[2]) x2 = int(aux[3]) y2 = int(aux[4]) dist = math.sqrt(math.pow(y2 - y1, 2) + math.pow(x2 - x1, 2)) ans = math.ceil(dist / r / 2) print(ans) ```	3
703	A	Mishka and Game	PROGRAMMING	800	[ "implementation" ]		null	null	Mishka is a little polar bear. As known, little bears loves spending their free time playing dice for chocolates. Once in a wonderful sunny morning, walking around blocks of ice, Mishka met her friend Chris, and they started playing the game. Rules of the game are very simple: at first number of rounds n is defined....	The first line of the input contains single integer n n (1<=≤<=n<=≤<=100) — the number of game rounds. The next n lines contains rounds description. i-th of them contains pair of integers mi and ci (1<=≤<=mi,<=<=ci<=≤<=6) — values on dice upper face after Mishka's and Chris' throws in i-th ...	If Mishka is the winner of the game, print "Mishka" (without quotes) in the only line. If Chris is the winner of the game, print "Chris" (without quotes) in the only line. If the result of the game is draw, print "Friendship is magic!^^" (without quotes) in the only line.	[ "3\n3 5\n2 1\n4 2\n", "2\n6 1\n1 6\n", "3\n1 5\n3 3\n2 2\n" ]	[ "Mishka", "Friendship is magic!^^", "Chris" ]	In the first sample case Mishka loses the first round, but wins second and third rounds and thus she is the winner of the game. In the second sample case Mishka wins the first round, Chris wins the second round, and the game ends with draw with score 1:1. In the third sample case Chris wins the first round, but there...	500	[ { "input": "3\n3 5\n2 1\n4 2", "output": "Mishka" }, { "input": "2\n6 1\n1 6", "output": "Friendship is magic!^^" }, { "input": "3\n1 5\n3 3\n2 2", "output": "Chris" }, { "input": "6\n4 1\n4 2\n5 3\n5 1\n5 3\n4 1", "output": "Mishka" }, { "input": "8\n2 4\n1 4\n1 ...	1,690,918,156	2,147,483,647	PyPy 3-64	OK	TESTS	69	62	0	a = int(input()) mishka_c = 0 chris_c = 0 for i in range(a): b = input() d = b.split(' ') mishka = int(d[0]) chris = int(d[1]) if mishka>chris: mishka_c+=1 elif chris>mishka: chris_c+=1 if mishka_c>chris_c: print('Mishka') elif chris_c>mishka_c: print('Chris') elif mishka_c =...	Title: Mishka and Game Time Limit: None seconds Memory Limit: None megabytes Problem Description: Mishka is a little polar bear. As known, little bears loves spending their free time playing dice for chocolates. Once in a wonderful sunny morning, walking around blocks of ice, Mishka met her friend Chris, and they st...	```python a = int(input()) mishka_c = 0 chris_c = 0 for i in range(a): b = input() d = b.split(' ') mishka = int(d[0]) chris = int(d[1]) if mishka>chris: mishka_c+=1 elif chris>mishka: chris_c+=1 if mishka_c>chris_c: print('Mishka') elif chris_c>mishka_c: print('Chris') elif ...	3
621	B	Wet Shark and Bishops	PROGRAMMING	1,300	[ "combinatorics", "implementation" ]		null	null	Today, Wet Shark is given n bishops on a 1000 by 1000 grid. Both rows and columns of the grid are numbered from 1 to 1000. Rows are numbered from top to bottom, while columns are numbered from left to right. Wet Shark thinks that two bishops attack each other if they share the same diagonal. Note, that this is the o...	The first line of the input contains n (1<=≤<=n<=≤<=200<=000) — the number of bishops. Each of next n lines contains two space separated integers xi and yi (1<=≤<=xi,<=yi<=≤<=1000) — the number of row and the number of column where i-th bishop is positioned. It's guaranteed that no two bishops ...	Output one integer — the number of pairs of bishops which attack each other.	[ "5\n1 1\n1 5\n3 3\n5 1\n5 5\n", "3\n1 1\n2 3\n3 5\n" ]	[ "6\n", "0\n" ]	In the first sample following pairs of bishops attack each other: (1, 3), (1, 5), (2, 3), (2, 4), (3, 4) and (3, 5). Pairs (1, 2), (1, 4), (2, 5) and (4, 5) do not attack each other because they do not share the same diagonal.	1,000	[ { "input": "5\n1 1\n1 5\n3 3\n5 1\n5 5", "output": "6" }, { "input": "3\n1 1\n2 3\n3 5", "output": "0" }, { "input": "3\n859 96\n634 248\n808 72", "output": "0" }, { "input": "3\n987 237\n891 429\n358 145", "output": "0" }, { "input": "3\n411 81\n149 907\n611 114"...	1,622,662,964	2,147,483,647	PyPy 3	OK	TESTS	68	1,591	9,420,800	n=int(input()) res=[0]2000 resT=[0]2000 while n!=0: x,y=[int(p) for p in input().split()] x-=1 y-=1 res[x+y]+=1 resT[x+999-y]+=1 n-=1 s=0 for x in range(2000): if res[x]>1: s+=res[x](res[x]-1)//2 if resT[x]>1: s+=resT[x](resT[x]-1)//2 print(s)	Title: Wet Shark and Bishops Time Limit: None seconds Memory Limit: None megabytes Problem Description: Today, Wet Shark is given n bishops on a 1000 by 1000 grid. Both rows and columns of the grid are numbered from 1 to 1000. Rows are numbered from top to bottom, while columns are numbered from left to right. We...	```python n=int(input()) res=[0]2000 resT=[0]2000 while n!=0: x,y=[int(p) for p in input().split()] x-=1 y-=1 res[x+y]+=1 resT[x+999-y]+=1 n-=1 s=0 for x in range(2000): if res[x]>1: s+=res[x](res[x]-1)//2 if resT[x]>1: s+=resT[x](resT[x]-1)//2 print(s...	3
899	E	Segments Removal	PROGRAMMING	2,000	[ "data structures", "dsu", "flows", "implementation", "two pointers" ]		null	null	Vasya has an array of integers of length n. Vasya performs the following operations on the array: on each step he finds the longest segment of consecutive equal integers (the leftmost, if there are several such segments) and removes it. For example, if Vasya's array is [13,<=13,<=7,<=7,<=7,<=2,<=2,<=2], then after o...	The first line contains a single integer n (1<=≤<=n<=≤<=200<=000) — the length of the array. The second line contains a sequence a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=109) — Vasya's array.	Print the number of operations Vasya should make to remove all elements from the array.	[ "4\n2 5 5 2\n", "5\n6 3 4 1 5\n", "8\n4 4 4 2 2 100 100 100\n", "6\n10 10 50 10 50 50\n" ]	[ "2\n", "5\n", "3\n", "4\n" ]	In the first example, at first Vasya removes two fives at the second and third positions. The array becomes [2, 2]. In the second operation Vasya removes two twos at the first and second positions. After that the array becomes empty. In the second example Vasya has to perform five operations to make the array empty. I...	2,250	[ { "input": "4\n2 5 5 2", "output": "2" }, { "input": "5\n6 3 4 1 5", "output": "5" }, { "input": "8\n4 4 4 2 2 100 100 100", "output": "3" }, { "input": "6\n10 10 50 10 50 50", "output": "4" }, { "input": "1\n1", "output": "1" }, { "input": "100\n45 45...	1,551,782,374	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	3	93	0	m = input() n = list(input().split()) n = list(set(n)) print(len(n))	Title: Segments Removal Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya has an array of integers of length n. Vasya performs the following operations on the array: on each step he finds the longest segment of consecutive equal integers (the leftmost, if there are several such segm...	```python m = input() n = list(input().split()) n = list(set(n)) print(len(n)) ```	0
440	C	One-Based Arithmetic	PROGRAMMING	1,800	[ "brute force", "dfs and similar", "divide and conquer" ]		null	null	Prof. Vasechkin wants to represent positive integer n as a sum of addends, where each addends is an integer number containing only 1s. For example, he can represent 121 as 121=111+11+–1. Help him to find the least number of digits 1 in such sum.	The first line of the input contains integer n (1<=≤<=n<=<<=1015).	Print expected minimal number of digits 1.	[ "121\n" ]	[ "6\n" ]	none	1,500	[ { "input": "121", "output": "6" }, { "input": "10", "output": "3" }, { "input": "72", "output": "15" }, { "input": "1", "output": "1" }, { "input": "2", "output": "2" }, { "input": "3", "output": "3" }, { "input": "4", "output": "4" }...	1,596,295,790	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	2	171	20,684,800	from sys import stdin, stdout import math,sys,heapq from itertools import permutations, combinations from collections import defaultdict,deque,OrderedDict from os import path import bisect as bi def yes():print('YES') def no():print('NO') if (path.exists('input.txt')): #------------------Sublime----------...	Title: One-Based Arithmetic Time Limit: None seconds Memory Limit: None megabytes Problem Description: Prof. Vasechkin wants to represent positive integer n as a sum of addends, where each addends is an integer number containing only 1s. For example, he can represent 121 as 121=111+11+–1. Help him to find the leas...	```python from sys import stdin, stdout import math,sys,heapq from itertools import permutations, combinations from collections import defaultdict,deque,OrderedDict from os import path import bisect as bi def yes():print('YES') def no():print('NO') if (path.exists('input.txt')): #------------------Sublime...	0
432	A	Choosing Teams	PROGRAMMING	800	[ "greedy", "implementation", "sortings" ]		null	null	The Saratov State University Olympiad Programmers Training Center (SSU OPTC) has n students. For each student you know the number of times he/she has participated in the ACM ICPC world programming championship. According to the ACM ICPC rules, each person can participate in the world championship at most 5 times. Th...	The first line contains two integers, n and k (1<=≤<=n<=≤<=2000; 1<=≤<=k<=≤<=5). The next line contains n integers: y1,<=y2,<=...,<=yn (0<=≤<=yi<=≤<=5), where yi shows the number of times the i-th person participated in the ACM ICPC world championship.	Print a single number — the answer to the problem.	[ "5 2\n0 4 5 1 0\n", "6 4\n0 1 2 3 4 5\n", "6 5\n0 0 0 0 0 0\n" ]	[ "1\n", "0\n", "2\n" ]	In the first sample only one team could be made: the first, the fourth and the fifth participants. In the second sample no teams could be created. In the third sample two teams could be created. Any partition into two teams fits.	500	[ { "input": "5 2\n0 4 5 1 0", "output": "1" }, { "input": "6 4\n0 1 2 3 4 5", "output": "0" }, { "input": "6 5\n0 0 0 0 0 0", "output": "2" }, { "input": "3 4\n0 1 0", "output": "1" }, { "input": "3 4\n0 2 0", "output": "0" }, { "input": "6 5\n0 0 0 0 0...	1,648,228,518	2,147,483,647	Python 3	OK	TESTS	35	46	0	n,k = [int(i) for i in input().split()] arr = [int(i) for i in input().split()] arr.sort() i = 0 counter = 0 while i +2 < n and (arr[i+2]+k) <= 5 : i += 3 counter += 1 print(counter)	Title: Choosing Teams Time Limit: None seconds Memory Limit: None megabytes Problem Description: The Saratov State University Olympiad Programmers Training Center (SSU OPTC) has n students. For each student you know the number of times he/she has participated in the ACM ICPC world programming championship. Accordi...	```python n,k = [int(i) for i in input().split()] arr = [int(i) for i in input().split()] arr.sort() i = 0 counter = 0 while i +2 < n and (arr[i+2]+k) <= 5 : i += 3 counter += 1 print(counter) ```	3
719	B	Anatoly and Cockroaches	PROGRAMMING	1,400	[ "greedy" ]		null	null	Anatoly lives in the university dorm as many other students do. As you know, cockroaches are also living there together with students. Cockroaches might be of two colors: black and red. There are n cockroaches living in Anatoly's room. Anatoly just made all his cockroaches to form a single line. As he is a perfectio...	The first line of the input contains a single integer n (1<=≤<=n<=≤<=100<=000) — the number of cockroaches. The second line contains a string of length n, consisting of characters 'b' and 'r' that denote black cockroach and red cockroach respectively.	Print one integer — the minimum number of moves Anatoly has to perform in order to make the colors of cockroaches in the line to alternate.	[ "5\nrbbrr\n", "5\nbbbbb\n", "3\nrbr\n" ]	[ "1\n", "2\n", "0\n" ]	In the first sample, Anatoly has to swap third and fourth cockroaches. He needs 1 turn to do this. In the second sample, the optimum answer is to paint the second and the fourth cockroaches red. This requires 2 turns. In the third sample, the colors of cockroaches in the line are alternating already, thus the answer ...	1,000	[ { "input": "5\nrbbrr", "output": "1" }, { "input": "5\nbbbbb", "output": "2" }, { "input": "3\nrbr", "output": "0" }, { "input": "13\nrbbbrbrrbrrbb", "output": "3" }, { "input": "18\nrrrrrrrrrrrrrrrrrb", "output": "8" }, { "input": "100\nbrbbbrrrbbrbrb...	1,474,639,883	3,983	Python 3	OK	TESTS	46	155	307,200	from sys import stdin, stdout n = int(stdin.readline()) colours = stdin.readline().strip() cntf, cnts = 0, 0 label = colours[0] for i in range(n): if i % 2 and label == colours[i]: cntf += 1 elif not i % 2 and label != colours[i]: cnts += 1 ans = max(cntf, cnts) cntf, cnts = 0, ...	Title: Anatoly and Cockroaches Time Limit: None seconds Memory Limit: None megabytes Problem Description: Anatoly lives in the university dorm as many other students do. As you know, cockroaches are also living there together with students. Cockroaches might be of two colors: black and red. There are n cockroaches...	```python from sys import stdin, stdout n = int(stdin.readline()) colours = stdin.readline().strip() cntf, cnts = 0, 0 label = colours[0] for i in range(n): if i % 2 and label == colours[i]: cntf += 1 elif not i % 2 and label != colours[i]: cnts += 1 ans = max(cntf, cnts) cntf, ...	3
750	A	New Year and Hurry	PROGRAMMING	800	[ "binary search", "brute force", "implementation", "math" ]		null	null	Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve th...	The only line of the input contains two integers n and k (1<=≤<=n<=≤<=10, 1<=≤<=k<=≤<=240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.	Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.	[ "3 222\n", "4 190\n", "7 1\n" ]	[ "2\n", "4\n", "7\n" ]	In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenar...	500	[ { "input": "3 222", "output": "2" }, { "input": "4 190", "output": "4" }, { "input": "7 1", "output": "7" }, { "input": "10 135", "output": "6" }, { "input": "10 136", "output": "5" }, { "input": "1 1", "output": "1" }, { "input": "1 240", ...	1,685,525,161	2,147,483,647	Python 3	COMPILATION_ERROR	TESTS	0	0	0	n,k = map(int,input().split()) while n(n+1)5 n -=1 print(n)	Title: New Year and Hurry Time Limit: None seconds Memory Limit: None megabytes Problem Description: Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem...	```python n,k = map(int,input().split()) while n(n+1)5 n -=1 print(n) ```	-1
454	B	Little Pony and Sort by Shift	PROGRAMMING	1,200	[ "implementation" ]		null	null	One day, Twilight Sparkle is interested in how to sort a sequence of integers a1,<=a2,<=...,<=an in non-decreasing order. Being a young unicorn, the only operation she can perform is a unit shift. That is, she can move the last element of the sequence to its beginning: Help Twilight Sparkle to calculate: what ...	The first line contains an integer n (2<=≤<=n<=≤<=105). The second line contains n integer numbers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=105).	If it's impossible to sort the sequence output -1. Otherwise output the minimum number of operations Twilight Sparkle needs to sort it.	[ "2\n2 1\n", "3\n1 3 2\n", "2\n1 2\n" ]	[ "1\n", "-1\n", "0\n" ]	none	1,000	[ { "input": "2\n2 1", "output": "1" }, { "input": "3\n1 3 2", "output": "-1" }, { "input": "2\n1 2", "output": "0" }, { "input": "6\n3 4 5 6 3 2", "output": "-1" }, { "input": "3\n1 2 1", "output": "1" }, { "input": "5\n1 1 2 1 1", "output": "2" }...	1,675,288,842	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	4	77	11,264,000	n = int(input()) m= input().split() a=[] s=0 l=n-1 c =0 for i in m: a.append(int(i)) for i in range(n-1): if a[i] <= a[i+1]: d=True else: d= False if d == True: print(0) elif d == False: c = a[l] a[l] = a[0] a[0] = c for i in range(n-1): if a[i] <= a[i+1]: s = True elif a[i] > a[i+1]: s= False ...	Title: Little Pony and Sort by Shift Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day, Twilight Sparkle is interested in how to sort a sequence of integers a1,<=a2,<=...,<=an in non-decreasing order. Being a young unicorn, the only operation she can perform is a unit shift. ...	```python n = int(input()) m= input().split() a=[] s=0 l=n-1 c =0 for i in m: a.append(int(i)) for i in range(n-1): if a[i] <= a[i+1]: d=True else: d= False if d == True: print(0) elif d == False: c = a[l] a[l] = a[0] a[0] = c for i in range(n-1): if a[i] <= a[i+1]: s = True elif a[i] > a[i+1]: s=...	0
948	A	Protect Sheep	PROGRAMMING	900	[ "brute force", "dfs and similar", "graphs", "implementation" ]		null	null	Bob is a farmer. He has a large pasture with many sheep. Recently, he has lost some of them due to wolf attacks. He thus decided to place some shepherd dogs in such a way that all his sheep are protected. The pasture is a rectangle consisting of R<=×<=C cells. Each cell is either empty, contains a sheep, a wolf or...	First line contains two integers R (1<=≤<=R<=≤<=500) and C (1<=≤<=C<=≤<=500), denoting the number of rows and the numbers of columns respectively. Each of the following R lines is a string consisting of exactly C characters, representing one row of the pasture. Here, 'S' means a sheep, 'W' a wolf and '.' a...	If it is impossible to protect all sheep, output a single line with the word "No". Otherwise, output a line with the word "Yes". Then print R lines, representing the pasture after placing dogs. Again, 'S' means a sheep, 'W' a wolf, 'D' is a dog and '.' an empty space. You are not allowed to move, remove or add a she...	[ "6 6\n..S...\n..S.W.\n.S....\n..W...\n...W..\n......\n", "1 2\nSW\n", "5 5\n.S...\n...S.\nS....\n...S.\n.S...\n" ]	[ "Yes\n..SD..\n..SDW.\n.SD...\n.DW...\nDD.W..\n......\n", "No\n", "Yes\n.S...\n...S.\nS.D..\n...S.\n.S...\n" ]	In the first example, we can split the pasture into two halves, one containing wolves and one containing sheep. Note that the sheep at (2,1) is safe, as wolves cannot move diagonally. In the second example, there are no empty spots to put dogs that would guard the lone sheep. In the third example, there are no wolves...	500	[ { "input": "1 2\nSW", "output": "No" }, { "input": "10 10\n....W.W.W.\n.........S\n.S.S...S..\nW.......SS\n.W..W.....\n.W...W....\nS..S...S.S\n....W...S.\n..S..S.S.S\nSS.......S", "output": "Yes\nDDDDWDWDWD\nDDDDDDDDDS\nDSDSDDDSDD\nWDDDDDDDSS\nDWDDWDDDDD\nDWDDDWDDDD\nSDDSDDDSDS\nDDDDWDDDSD\nDDSD...	1,533,976,580	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	12	951	2,867,200	R,C=map(int,input().split()) rc=[] for i in range(R): rc.append(list(input())) for j in range(C): if rc[i][j] == '.': rc[i][j]='D' for i in range(R): for j in range(C): if rc[i][j] == 'S': try: if rc[i+1][j]=='W': print(...	Title: Protect Sheep Time Limit: None seconds Memory Limit: None megabytes Problem Description: Bob is a farmer. He has a large pasture with many sheep. Recently, he has lost some of them due to wolf attacks. He thus decided to place some shepherd dogs in such a way that all his sheep are protected. The pasture is ...	```python R,C=map(int,input().split()) rc=[] for i in range(R): rc.append(list(input())) for j in range(C): if rc[i][j] == '.': rc[i][j]='D' for i in range(R): for j in range(C): if rc[i][j] == 'S': try: if rc[i+1][j]=='W': ...	0
557	A	Ilya and Diplomas	PROGRAMMING	1,100	[ "greedy", "implementation", "math" ]		null	null	Soon a school Olympiad in Informatics will be held in Berland, n schoolchildren will participate there. At a meeting of the jury of the Olympiad it was decided that each of the n participants, depending on the results, will get a diploma of the first, second or third degree. Thus, each student will receive exactly...	The first line of the input contains a single integer n (3<=≤<=n<=≤<=3·106) — the number of schoolchildren who will participate in the Olympiad. The next line of the input contains two integers min1 and max1 (1<=≤<=min1<=≤<=max1<=≤<=106) — the minimum and maximum limits on the number of diplomas of the fir...	In the first line of the output print three numbers, showing how many diplomas of the first, second and third degree will be given to students in the optimal variant of distributing diplomas. The optimal variant of distributing diplomas is the one that maximizes the number of students who receive diplomas of the first...	[ "6\n1 5\n2 6\n3 7\n", "10\n1 2\n1 3\n1 5\n", "6\n1 3\n2 2\n2 2\n" ]	[ "1 2 3 \n", "2 3 5 \n", "2 2 2 \n" ]	none	500	[ { "input": "6\n1 5\n2 6\n3 7", "output": "1 2 3 " }, { "input": "10\n1 2\n1 3\n1 5", "output": "2 3 5 " }, { "input": "6\n1 3\n2 2\n2 2", "output": "2 2 2 " }, { "input": "55\n1 1000000\n40 50\n10 200", "output": "5 40 10 " }, { "input": "3\n1 1\n1 1\n1 1", "o...	1,448,270,550	2,147,483,647	Python 3	OK	TESTS	56	77	0	n = int(input()) amin, amax = map(int, input().split()) bmin, bmax = map(int, input().split()) cmin, cmax = map(int, input().split()) temp1 = min(amax, n - bmin - cmin) n -= temp1 temp2 = min(bmax, n - cmin) n -= temp2 temp3 = n print(temp1, temp2, temp3)	Title: Ilya and Diplomas Time Limit: None seconds Memory Limit: None megabytes Problem Description: Soon a school Olympiad in Informatics will be held in Berland, n schoolchildren will participate there. At a meeting of the jury of the Olympiad it was decided that each of the n participants, depending on the re...	```python n = int(input()) amin, amax = map(int, input().split()) bmin, bmax = map(int, input().split()) cmin, cmax = map(int, input().split()) temp1 = min(amax, n - bmin - cmin) n -= temp1 temp2 = min(bmax, n - cmin) n -= temp2 temp3 = n print(temp1, temp2, temp3) ```	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 ti...	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}", "o...	1,683,115,820	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	30	0	n = 1000 # 最大长度 strs = "" # 输入字符串 len = 0 # 字符串长度 # 输入函数 def input_str(): global strs, len print("请输入一行长度在{}以内、仅包括小写字母、‘{’、‘}’ 和空格的字符串：".format(n)) strs = input() # 从标准输入读取一行字符串 len = len(strs) if len > n: print("输入字符串长度超过 {}！".format(n)) for i in range(len): c = strs[i] ...	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 begi...	```python n = 1000 # 最大长度 strs = "" # 输入字符串 len = 0 # 字符串长度 # 输入函数 def input_str(): global strs, len print("请输入一行长度在{}以内、仅包括小写字母、‘{’、‘}’ 和空格的字符串：".format(n)) strs = input() # 从标准输入读取一行字符串 len = len(strs) if len > n: print("输入字符串长度超过 {}！".format(n)) for i in range(len): c = ...	-1

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.