Split (1)

train · 538k rows

contestId int64 0 1.01k	index stringclasses 55 values	name stringlengths 2 58	type stringclasses 2 values	rating int64 0 3.5k	tags listlengths 0 7	title stringclasses 495 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 5 65.5k	instruction_seed stringlengths 262 8.2k	response stringlengths 19 65.5k	score float64 -1 3.99	_source stringclasses 1 value
988	B	Substrings Sort	PROGRAMMING	1,100	[ "sortings", "strings" ]		null	null	You are given $n$ strings. Each string consists of lowercase English letters. Rearrange (reorder) the given strings in such a way that for every string, all strings that are placed before it are its substrings. String $a$ is a substring of string $b$ if it is possible to choose several consecutive letters in $b$ in su...	The first line contains an integer $n$ ($1 \le n \le 100$) — the number of strings. The next $n$ lines contain the given strings. The number of letters in each string is from $1$ to $100$, inclusive. Each string consists of lowercase English letters. Some strings might be equal.	If it is impossible to reorder $n$ given strings in required order, print "NO" (without quotes). Otherwise print "YES" (without quotes) and $n$ given strings in required order.	[ "5\na\naba\nabacaba\nba\naba\n", "5\na\nabacaba\nba\naba\nabab\n", "3\nqwerty\nqwerty\nqwerty\n" ]	[ "YES\na\nba\naba\naba\nabacaba\n", "NO\n", "YES\nqwerty\nqwerty\nqwerty\n" ]	In the second example you cannot reorder the strings because the string "abab" is not a substring of the string "abacaba".	0	[ { "input": "5\na\naba\nabacaba\nba\naba", "output": "YES\na\nba\naba\naba\nabacaba" }, { "input": "5\na\nabacaba\nba\naba\nabab", "output": "NO" }, { "input": "3\nqwerty\nqwerty\nqwerty", "output": "YES\nqwerty\nqwerty\nqwerty" }, { "input": "1\nwronganswer", "output": "Y...	1,617,592,195	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	10	62	0	n = int(input()) a= [] for i in range(1,n+1): b=input() a.append(b) a.sort(key=len) for i in range (1,n): if a[i-1] in a[i]: t = 0 else: t = 1 # print("no") break if (t ==0): print("YES") for i in range(n): print(a[i],end...	Title: Substrings Sort Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given $n$ strings. Each string consists of lowercase English letters. Rearrange (reorder) the given strings in such a way that for every string, all strings that are placed before it are its substrings. String ...	```python n = int(input()) a= [] for i in range(1,n+1): b=input() a.append(b) a.sort(key=len) for i in range (1,n): if a[i-1] in a[i]: t = 0 else: t = 1 # print("no") break if (t ==0): print("YES") for i in range(n): prin...	-1	MatrixStudio/Codeforces-Python-Submissions
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,668,678,309	2,147,483,647	Python 3	OK	TESTS	69	46	0	# for i in range(1, 10): # print(i, i*2) # k = 1 # for i in range(1, n + 1): # k = i # print(k) # n = int(input()) # for i in range(n): # print('hello') # from random import randint # s = 0 # n = int(input()) # for i in range(n): # a = randint(1, 10) # s += a # pri...	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 # for i in range(1, 10): # print(i, i*2) # k = 1 # for i in range(1, n + 1): # k = i # print(k) # n = int(input()) # for i in range(n): # print('hello') # from random import randint # s = 0 # n = int(input()) # for i in range(n): # a = randint(1, 10) # s += a ...	3	MatrixStudio/Codeforces-Python-Submissions
570	A	Elections	PROGRAMMING	1,100	[ "implementation" ]		null	null	The country of Byalechinsk is running elections involving n candidates. The country consists of m cities. We know how many people in each city voted for each candidate. The electoral system in the country is pretty unusual. At the first stage of elections the votes are counted for each city: it is assumed that in ...	The first line of the input contains two integers n, m (1<=≤<=n,<=m<=≤<=100) — the number of candidates and of cities, respectively. Each of the next m lines contains n non-negative integers, the j-th number in the i-th line aij (1<=≤<=j<=≤<=n, 1<=≤<=i<=≤<=m, 0<=≤<=aij<=≤<=109) denotes ...	Print a single number — the index of the candidate who won the elections. The candidates are indexed starting from one.	[ "3 3\n1 2 3\n2 3 1\n1 2 1\n", "3 4\n10 10 3\n5 1 6\n2 2 2\n1 5 7\n" ]	[ "2", "1" ]	Note to the first sample test. At the first stage city 1 chosen candidate 3, city 2 chosen candidate 2, city 3 chosen candidate 2. The winner is candidate 2, he gained 2 votes. Note to the second sample test. At the first stage in city 1 candidates 1 and 2 got the same maximum number of votes, but candidate 1 has a sm...	500	[ { "input": "3 3\n1 2 3\n2 3 1\n1 2 1", "output": "2" }, { "input": "3 4\n10 10 3\n5 1 6\n2 2 2\n1 5 7", "output": "1" }, { "input": "1 3\n5\n3\n2", "output": "1" }, { "input": "3 1\n1 2 3", "output": "3" }, { "input": "3 1\n100 100 100", "output": "1" }, {...	1,502,161,487	2,147,483,647	Python 3	OK	TESTS	62	62	4,710,400	n, m = [int(x) for x in input().split()] candidatesWin = [] for i in range (0, n + 1): candidatesWin.append(0) for i in range (0, m): votes = [int(x) for x in input().split()] maxVote = max(votes) for j in range (0, n): if votes[j] == maxVote: candidatesWin[j + 1] += 1 ...	Title: Elections Time Limit: None seconds Memory Limit: None megabytes Problem Description: The country of Byalechinsk is running elections involving n candidates. The country consists of m cities. We know how many people in each city voted for each candidate. The electoral system in the country is pretty unusu...	```python n, m = [int(x) for x in input().split()] candidatesWin = [] for i in range (0, n + 1): candidatesWin.append(0) for i in range (0, m): votes = [int(x) for x in input().split()] maxVote = max(votes) for j in range (0, n): if votes[j] == maxVote: candidatesWin[j + 1] ...	3	MatrixStudio/Codeforces-Python-Submissions
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,692,543,709	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	60	0	firstline = input().split() NOS = int(firstline[0]) NOP = int(firstline[1]) puzzles = [int(p) for p in input().split()] slices = [puzzles[n:(n+1)*NOS] for n in range((NOP//NOS))] differences = [max(sl)-min(sl) for sl in slices] print(min(differences))	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 firstline = input().split() NOS = int(firstline[0]) NOP = int(firstline[1]) puzzles = [int(p) for p in input().split()] slices = [puzzles[n:(n+1)*NOS] for n in range((NOP//NOS))] differences = [max(sl)-min(sl) for sl in slices] print(min(differences)) ```	0	MatrixStudio/Codeforces-Python-Submissions
802	G	Fake News (easy)	PROGRAMMING	800	[ "implementation", "strings" ]		null	null	As it's the first of April, Heidi is suspecting that the news she reads today are fake, and she does not want to look silly in front of all the contestants. She knows that a newspiece is fake if it contains heidi as a subsequence. Help Heidi assess whether the given piece is true, but please be discreet about it...	The first and only line of input contains a single nonempty string s of length at most 1000 composed of lowercase letters (a-z).	Output YES if the string s contains heidi as a subsequence and NO otherwise.	[ "abcheaibcdi\n", "hiedi\n" ]	[ "YES", "NO" ]	A string s contains another string p as a subsequence if it is possible to delete some characters from s and obtain p.	0	[ { "input": "abcheaibcdi", "output": "YES" }, { "input": "hiedi", "output": "NO" }, { "input": "ihied", "output": "NO" }, { "input": "diehi", "output": "NO" }, { "input": "deiih", "output": "NO" }, { "input": "iheid", "output": "NO" }, { "in...	1,609,760,041	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	5	93	0	s=str(input()) if "h" and "e" and "i" and "d" in s: h=s.index("h") e=s.index("e") d=s.index("d") i1=s.index("i") if h<e and e<i1 and i1<d and s.count("i")>=2 and s.count("i",d)!=0: print("YES") else: print("NO")	Title: Fake News (easy) Time Limit: None seconds Memory Limit: None megabytes Problem Description: As it's the first of April, Heidi is suspecting that the news she reads today are fake, and she does not want to look silly in front of all the contestants. She knows that a newspiece is fake if it contains heidi as a ...	```python s=str(input()) if "h" and "e" and "i" and "d" in s: h=s.index("h") e=s.index("e") d=s.index("d") i1=s.index("i") if h<e and e<i1 and i1<d and s.count("i")>=2 and s.count("i",d)!=0: print("YES") else: print("NO") ```	0	MatrixStudio/Codeforces-Python-Submissions
545	D	Queue	PROGRAMMING	1,300	[ "greedy", "implementation", "sortings" ]		null	null	Little girl Susie went shopping with her mom and she wondered how to improve service quality. There are n people in the queue. For each person we know time ti needed to serve him. A person will be disappointed if the time he waits is more than the time needed to serve him. The time a person waits is the total t...	The first line contains integer n (1<=≤<=n<=≤<=105). The next line contains n integers ti (1<=≤<=ti<=≤<=109), separated by spaces.	Print a single number — the maximum number of not disappointed people in the queue.	[ "5\n15 2 1 5 3\n" ]	[ "4\n" ]	Value 4 is achieved at such an arrangement, for example: 1, 2, 3, 5, 15. Thus, you can make everything feel not disappointed except for the person with time 5.	1,750	[ { "input": "5\n15 2 1 5 3", "output": "4" }, { "input": "15\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "2" }, { "input": "10\n13 2 5 55 21 34 1 8 1 3", "output": "6" }, { "input": "10\n8 256 16 1 2 1 64 4 128 32", "output": "10" }, { "input": "10\n10000 40000 1000...	1,694,799,800	2,147,483,647	Python 3	OK	TESTS	61	93	13,619,200	import bisect def solve(): n=int(input()) a=list(map(int,input().split())) a.sort() psum=a[0] count=1 for i in range(1,n): if psum<=a[i]: count+=1 psum+=a[i] print(count) solve()	Title: Queue Time Limit: None seconds Memory Limit: None megabytes Problem Description: Little girl Susie went shopping with her mom and she wondered how to improve service quality. There are n people in the queue. For each person we know time ti needed to serve him. A person will be disappointed if the time...	```python import bisect def solve(): n=int(input()) a=list(map(int,input().split())) a.sort() psum=a[0] count=1 for i in range(1,n): if psum<=a[i]: count+=1 psum+=a[i] print(count) solve() ```	3	MatrixStudio/Codeforces-Python-Submissions
0	none	none	none	0	[ "none" ]		null	null	In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if they got an order that Bob is a scouter, if there are two Bobs?). A group of soldiers is effective if and only if their names...	The first line of the input contains two integers n and k (2<=≤<=k<=≤<=n<=≤<=50) — the number of soldiers and the size of a group respectively. The second line contains n<=-<=k<=+<=1 strings s1,<=s2,<=...,<=sn<=-<=k<=+<=1. The string si is "YES" if the group of soldiers i through i<=+<=*k...	Find any solution satisfying all given conditions. In one line print n space-separated strings, denoting possible names of soldiers in the order. The first letter of each name should be uppercase, while the other letters should be lowercase. Each name should contain English letters only and has length from 1 to 10. ...	[ "8 3\nNO NO YES YES YES NO\n", "9 8\nYES NO\n", "3 2\nNO NO\n" ]	[ "Adam Bob Bob Cpqepqwer Limak Adam Bob Adam", "R Q Ccccccccc Ccocc Ccc So Strong Samples Ccc", "Na Na Na" ]	In the first sample, there are 8 soldiers. For every 3 consecutive ones we know whether they would be an effective group. Let's analyze the provided sample output: - First three soldiers (i.e. Adam, Bob, Bob) wouldn't be an effective group because there are two Bobs. Indeed, the string s<sub class="lower-index">1</...	0	[ { "input": "8 3\nNO NO YES YES YES NO", "output": "Ab Ac Ab Ac Af Ag Ah Ag " }, { "input": "9 8\nYES NO", "output": "Ab Ac Ad Ae Af Ag Ah Ai Ac " }, { "input": "3 2\nNO NO", "output": "Ab Ab Ab " }, { "input": "2 2\nYES", "output": "Ab Ac " }, { "input": "2 2\nNO"...	1,652,670,568	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	30	4,505,600	t = int(input()) for i in range(t): s = input() n = list(s[:len(s)]) l = len(n) - 1 if (int(n[0]) + int(n[1]) + int(n[2])) == (int(n[l]) + int(n[l - 1]) + int(n[l-2])): print("YES") else: print("NO")	Title: none Time Limit: None seconds Memory Limit: None megabytes Problem Description: In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if they got an order that Bob is a scou...	```python t = int(input()) for i in range(t): s = input() n = list(s[:len(s)]) l = len(n) - 1 if (int(n[0]) + int(n[1]) + int(n[2])) == (int(n[l]) + int(n[l - 1]) + int(n[l-2])): print("YES") else: print("NO") ```	-1	MatrixStudio/Codeforces-Python-Submissions
127	A	Wasted Time	PROGRAMMING	900	[ "geometry" ]		null	null	Mr. Scrooge, a very busy man, decided to count the time he wastes on all sorts of useless stuff to evaluate the lost profit. He has already counted the time he wastes sleeping and eating. And now Mr. Scrooge wants to count the time he has wasted signing papers. Mr. Scrooge's signature can be represented as a polyline ...	The first line contains two integers n and k (2<=≤<=n<=≤<=100, 1<=≤<=k<=≤<=1000). Each of the following n lines contains the coordinates of the polyline's endpoints. The i-th one contains coordinates of the point Ai — integers xi and yi, separated by a space. All points Ai are different. Th...	Print one real number — the total time Scrooges wastes on signing the papers in seconds. The absolute or relative error should not exceed 10<=-<=6.	[ "2 1\n0 0\n10 0\n", "5 10\n3 1\n-5 6\n-2 -1\n3 2\n10 0\n", "6 10\n5 0\n4 0\n6 0\n3 0\n7 0\n2 0\n" ]	[ "0.200000000", "6.032163204", "3.000000000" ]	none	500	[ { "input": "2 1\n0 0\n10 0", "output": "0.200000000" }, { "input": "5 10\n3 1\n-5 6\n-2 -1\n3 2\n10 0", "output": "6.032163204" }, { "input": "6 10\n5 0\n4 0\n6 0\n3 0\n7 0\n2 0", "output": "3.000000000" }, { "input": "10 95\n-20 -5\n2 -8\n14 13\n10 3\n17 11\n13 -12\n-6 11\n1...	1,695,564,070	2,147,483,647	PyPy 3-64	OK	TESTS	42	124	0	def distance(p, q): return ((p[0]-q[0])2 + (p[1]-q[1])2) ** 0.5 lst = [w.rstrip() for w in open(0).readlines()] n, k = map(int, lst[0].split()) pts = [tuple(map(int, x.split())) for x in lst[1:]] res = sum(distance(p, q) for p, q in zip(pts, pts[1:])) print(k * res / 50)	Title: Wasted Time Time Limit: None seconds Memory Limit: None megabytes Problem Description: Mr. Scrooge, a very busy man, decided to count the time he wastes on all sorts of useless stuff to evaluate the lost profit. He has already counted the time he wastes sleeping and eating. And now Mr. Scrooge wants to count ...	```python def distance(p, q): return ((p[0]-q[0])2 + (p[1]-q[1])2) ** 0.5 lst = [w.rstrip() for w in open(0).readlines()] n, k = map(int, lst[0].split()) pts = [tuple(map(int, x.split())) for x in lst[1:]] res = sum(distance(p, q) for p, q in zip(pts, pts[1:])) print(k * res / 50) ```	3	MatrixStudio/Codeforces-Python-Submissions
595	B	Pasha and Phone	PROGRAMMING	1,600	[ "binary search", "math" ]		null	null	Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits. Also Pasha has a number k and two sequences of length n<=/<=k (n is divisible by k) a1,<=a2,<=...,<=an<=/<=k and b1,<=b2,<=...,<=bn<=/<=k. Le...	The first line of the input contains two integers n and k (1<=≤<=n<=≤<=100<=000, 1<=≤<=k<=≤<=min(n,<=9)) — the length of all phone numbers and the length of each block, respectively. It is guaranteed that n is divisible by k. The second line of the input contains n<=/<=k space-separated positive in...	Print a single integer — the number of good phone numbers of length n modulo 109<=+<=7.	[ "6 2\n38 56 49\n7 3 4\n", "8 2\n1 22 3 44\n5 4 3 2\n" ]	[ "8\n", "32400\n" ]	In the first test sample good phone numbers are: 000000, 000098, 005600, 005698, 380000, 380098, 385600, 385698.	1,000	[ { "input": "6 2\n38 56 49\n7 3 4", "output": "8" }, { "input": "8 2\n1 22 3 44\n5 4 3 2", "output": "32400" }, { "input": "2 1\n9 9\n9 9", "output": "1" }, { "input": "2 1\n9 9\n0 9", "output": "1" }, { "input": "4 1\n4 3 2 1\n1 2 3 4", "output": "540" }, ...	1,447,249,415	2,147,483,647	Python 3	OK	TESTS	38	249	2,355,200	mod = 109 + 7 n,k = map(int,input().split()) a = list(map(int,input().split())) b = list(map(int,input().split())) ans = 1; for i in range(n//k): cnt = (10k - 1)//a[i] - (10*(k-1)(b[i]+1) - 1 )//a[i] if b[i] != 0: cnt += (10*(k-1)b[i] - 1)//a[i] + 1 ans=ans*cnt%mod print(an...	Title: Pasha and Phone Time Limit: None seconds Memory Limit: None megabytes Problem Description: Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits. Also Pasha has a number k and two sequences of length n<=/<=k (*...	```python mod = 109 + 7 n,k = map(int,input().split()) a = list(map(int,input().split())) b = list(map(int,input().split())) ans = 1; for i in range(n//k): cnt = (10k - 1)//a[i] - (10*(k-1)(b[i]+1) - 1 )//a[i] if b[i] != 0: cnt += (10*(k-1)b[i] - 1)//a[i] + 1 ans=ans*cnt%mod...	3	MatrixStudio/Codeforces-Python-Submissions
820	A	Mister B and Book Reading	PROGRAMMING	900	[ "implementation" ]		null	null	Mister B once received a gift: it was a book about aliens, which he started read immediately. This book had c pages. At first day Mister B read v0 pages, but after that he started to speed up. Every day, starting from the second, he read a pages more than on the previous day (at first day he read v0 pages, at ...	First and only line contains five space-separated integers: c, v0, v1, a and l (1<=≤<=c<=≤<=1000, 0<=≤<=l<=<<=v0<=≤<=v1<=≤<=1000, 0<=≤<=a<=≤<=1000) — the length of the book in pages, the initial reading speed, the maximum reading speed, the acceleration in reading speed and the number of pages fo...	Print one integer — the number of days Mister B needed to finish the book.	[ "5 5 10 5 4\n", "12 4 12 4 1\n", "15 1 100 0 0\n" ]	[ "1\n", "3\n", "15\n" ]	In the first sample test the book contains 5 pages, so Mister B read it right at the first day. In the second sample test at first day Mister B read pages number 1 - 4, at second day — 4 - 11, at third day — 11 - 12 and finished the book. In third sample test every day Mister B read 1 page of the book, so he finished...	500	[ { "input": "5 5 10 5 4", "output": "1" }, { "input": "12 4 12 4 1", "output": "3" }, { "input": "15 1 100 0 0", "output": "15" }, { "input": "1 1 1 0 0", "output": "1" }, { "input": "1000 999 1000 1000 998", "output": "2" }, { "input": "1000 2 2 5 1", ...	1,500,123,652	2,147,483,647	Python 3	OK	TESTS	110	62	5,529,600	c, v0, v1, a, l=map(int, input().split()) cur=v0 day=1 while cur<c: cur-=l cur+=min(v0+a*day, v1) day+=1 print(day)	Title: Mister B and Book Reading Time Limit: None seconds Memory Limit: None megabytes Problem Description: Mister B once received a gift: it was a book about aliens, which he started read immediately. This book had c pages. At first day Mister B read v0 pages, but after that he started to speed up. Every day, ...	```python c, v0, v1, a, l=map(int, input().split()) cur=v0 day=1 while cur<c: cur-=l cur+=min(v0+a*day, v1) day+=1 print(day) ```	3	MatrixStudio/Codeforces-Python-Submissions
934	A	A Compatible Pair	PROGRAMMING	1,400	[ "brute force", "games" ]		null	null	Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of which frighten the monster out of coming. Little Tommy has n lanterns and Big B...	The first line contains two space-separated integers n and m (2<=≤<=n,<=m<=≤<=50). The second line contains n space-separated integers a1,<=a2,<=...,<=an. The third line contains m space-separated integers b1,<=b2,<=...,<=bm. All the integers range from <=-<=109 to 109.	Print a single integer — the brightness of the chosen pair.	[ "2 2\n20 18\n2 14\n", "5 3\n-1 0 1 2 3\n-1 0 1\n" ]	[ "252\n", "2\n" ]	In the first example, Tommy will hide 20 and Banban will choose 18 from Tommy and 14 from himself. In the second example, Tommy will hide 3 and Banban will choose 2 from Tommy and 1 from himself.	500	[ { "input": "2 2\n20 18\n2 14", "output": "252" }, { "input": "5 3\n-1 0 1 2 3\n-1 0 1", "output": "2" }, { "input": "10 2\n1 6 2 10 2 3 2 10 6 4\n5 7", "output": "70" }, { "input": "50 50\n1 6 2 10 2 3 2 10 6 4 5 0 3 1 7 3 2 4 4 2 1 5 0 6 10 1 8 0 10 9 0 4 10 5 5 7 4 9 9 5 5 ...	1,610,896,117	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	9	77	0	def compatible_pair(l1, l2): l1 = sorted(l1) l2 = sorted(l2) p1 = l1[-2] * l2[-1] p2 = l1[1] * l2[0] return max(p1, p2) input() l1 = list(map(int, input().split())) l2 = list(map(int, input().split())) print(compatible_pair(l1, l2))	Title: A Compatible Pair Time Limit: None seconds Memory Limit: None megabytes Problem Description: Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cr...	```python def compatible_pair(l1, l2): l1 = sorted(l1) l2 = sorted(l2) p1 = l1[-2] * l2[-1] p2 = l1[1] * l2[0] return max(p1, p2) input() l1 = list(map(int, input().split())) l2 = list(map(int, input().split())) print(compatible_pair(l1, l2)) ```	0	MatrixStudio/Codeforces-Python-Submissions
245	B	Internet Address	PROGRAMMING	1,100	[ "implementation", "strings" ]		null	null	Vasya is an active Internet user. One day he came across an Internet resource he liked, so he wrote its address in the notebook. We know that the address of the written resource has format: where: - <protocol> can equal either "http" (without the quotes) or "ftp" (without the quotes), - <domain> is a no...	The first line contains a non-empty string that Vasya wrote out in his notebook. This line consists of lowercase English letters only. It is guaranteed that the given string contains at most 50 letters. It is guaranteed that the given string can be obtained from some correct Internet resource address, described above...	Print a single line — the address of the Internet resource that Vasya liked. If there are several addresses that meet the problem limitations, you are allowed to print any of them.	[ "httpsunrux\n", "ftphttprururu\n" ]	[ "http://sun.ru/x\n", "ftp://http.ru/ruru\n" ]	In the second sample there are two more possible answers: "ftp://httpruru.ru" and "ftp://httpru.ru/ru".	0	[ { "input": "httpsunrux", "output": "http://sun.ru/x" }, { "input": "ftphttprururu", "output": "ftp://http.ru/ruru" }, { "input": "httpuururrururruruurururrrrrurrurrurruruuruuu", "output": "http://uu.ru/rrururruruurururrrrrurrurrurruruuruuu" }, { "input": "httpabuaruauabbaruru...	1,590,152,723	2,147,483,647	PyPy 3	OK	TESTS	20	280	0	s=input() pl=4 if s[0]=='h' else 3 rui=s.rfind('ru') print(s[:pl]+'://'+s[pl:rui]+'.ru'+('/'+s[rui+2:] if rui<len(s)-2 else ''))	Title: Internet Address Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya is an active Internet user. One day he came across an Internet resource he liked, so he wrote its address in the notebook. We know that the address of the written resource has format: where: - <protocol>...	```python s=input() pl=4 if s[0]=='h' else 3 rui=s.rfind('ru') print(s[:pl]+'://'+s[pl:rui]+'.ru'+('/'+s[rui+2:] if rui<len(s)-2 else '')) ```	3	MatrixStudio/Codeforces-Python-Submissions
681	B	Economy Game	PROGRAMMING	1,300	[ "brute force" ]		null	null	Kolya is developing an economy simulator game. His most favourite part of the development process is in-game testing. Once he was entertained by the testing so much, that he found out his game-coin score become equal to 0. Kolya remembers that at the beginning of the game his game-coin score was equal to n and that ...	The first line of the input contains a single integer n (1<=≤<=n<=≤<=109) — Kolya's initial game-coin score.	Print "YES" (without quotes) if it's possible that Kolya spent all of his initial n coins buying only houses, cars and computers. Otherwise print "NO" (without quotes).	[ "1359257\n", "17851817\n" ]	[ "YES", "NO" ]	In the first sample, one of the possible solutions is to buy one house, one car and one computer, spending 1 234 567 + 123 456 + 1234 = 1 359 257 game-coins in total.	1,000	[ { "input": "1359257", "output": "YES" }, { "input": "17851817", "output": "NO" }, { "input": "1000000000", "output": "YES" }, { "input": "17851818", "output": "YES" }, { "input": "438734347", "output": "YES" }, { "input": "43873430", "output": "YES...	1,679,700,809	2,147,483,647	Python 3	OK	TESTS	63	717	0	n = int(input()) a = 1234567 b = 123456 c = 1234 saida = "NO" for i in range(100): for j in range(10000): if n >= ia + jb: temp = n - ia - jb if temp % 1234 == 0: saida = "YES" print(saida)	Title: Economy Game Time Limit: None seconds Memory Limit: None megabytes Problem Description: Kolya is developing an economy simulator game. His most favourite part of the development process is in-game testing. Once he was entertained by the testing so much, that he found out his game-coin score become equal to 0....	```python n = int(input()) a = 1234567 b = 123456 c = 1234 saida = "NO" for i in range(100): for j in range(10000): if n >= ia + jb: temp = n - ia - jb if temp % 1234 == 0: saida = "YES" print(saida) ```	3	MatrixStudio/Codeforces-Python-Submissions
365	A	Good Number	PROGRAMMING	1,100	[ "implementation" ]		null	null	Let's call a number k-good if it contains all digits not exceeding k (0,<=...,<=k). You've got a number k and an array a containing n numbers. Find out how many k-good numbers are in a (count each number every time it occurs in array a).	The first line contains integers n and k (1<=≤<=n<=≤<=100, 0<=≤<=k<=≤<=9). The i-th of the following n lines contains integer ai without leading zeroes (1<=≤<=ai<=≤<=109).	Print a single integer — the number of k-good numbers in a.	[ "10 6\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n", "2 1\n1\n10\n" ]	[ "10\n", "1\n" ]	none	500	[ { "input": "10 6\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560", "output": "10" }, { "input": "2 1\n1\n10", "output": "1" }, { "input": "1 0\n1000000000", "output": "1" }, { "input": "1 1\n1000000000", "output": "1" }, { ...	1,655,384,800	2,147,483,647	Python 3	OK	TESTS	37	46	0	n, k = [int(item) for item in input().split()] a = [str(i) for i in range(k + 1)] temp = 0 for i in range(n): x = list(input()) y = list(set(a) & set(x)) if sorted(a) == sorted(y): temp += 1 print(temp)	Title: Good Number Time Limit: None seconds Memory Limit: None megabytes Problem Description: Let's call a number k-good if it contains all digits not exceeding k (0,<=...,<=k). You've got a number k and an array a containing n numbers. Find out how many k-good numbers are in a (count each number eve...	```python n, k = [int(item) for item in input().split()] a = [str(i) for i in range(k + 1)] temp = 0 for i in range(n): x = list(input()) y = list(set(a) & set(x)) if sorted(a) == sorted(y): temp += 1 print(temp) ```	3	MatrixStudio/Codeforces-Python-Submissions
268	A	Games	PROGRAMMING	800	[ "brute force" ]		null	null	Manao works on a sports TV. He's spent much time watching the football games of some country. After a while he began to notice different patterns. For example, each team has two sets of uniforms: home uniform and guest uniform. When a team plays a game at home, the players put on the home uniform. When a team plays as ...	The first line contains an integer n (2<=≤<=n<=≤<=30). Each of the following n lines contains a pair of distinct space-separated integers hi, ai (1<=≤<=hi,<=ai<=≤<=100) — the colors of the i-th team's home and guest uniforms, respectively.	In a single line print the number of games where the host team is going to play in the guest uniform.	[ "3\n1 2\n2 4\n3 4\n", "4\n100 42\n42 100\n5 42\n100 5\n", "2\n1 2\n1 2\n" ]	[ "1\n", "5\n", "0\n" ]	In the first test case the championship consists of 6 games. The only game with the event in question is the game between teams 2 and 1 on the stadium of team 2. In the second test sample the host team will have to wear guest uniform in the games between teams: 1 and 2, 2 and 1, 2 and 3, 3 and 4, 4 and 2 (the host tea...	500	[ { "input": "3\n1 2\n2 4\n3 4", "output": "1" }, { "input": "4\n100 42\n42 100\n5 42\n100 5", "output": "5" }, { "input": "2\n1 2\n1 2", "output": "0" }, { "input": "7\n4 7\n52 55\n16 4\n55 4\n20 99\n3 4\n7 52", "output": "6" }, { "input": "10\n68 42\n1 35\n25 70\n...	1,695,067,382	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	3	62	0	x=int(input()) c=0 b={} for u in range(x): w,v=map(str,input().split()) if w not in b:b[w]=1 else: if b[w]==2: b[w]=1 c+=1 if v not in b:b[v]=2 else: if b[v]==1: b[v]=2 c+=1 print(c)	Title: Games Time Limit: None seconds Memory Limit: None megabytes Problem Description: Manao works on a sports TV. He's spent much time watching the football games of some country. After a while he began to notice different patterns. For example, each team has two sets of uniforms: home uniform and guest uniform. W...	```python x=int(input()) c=0 b={} for u in range(x): w,v=map(str,input().split()) if w not in b:b[w]=1 else: if b[w]==2: b[w]=1 c+=1 if v not in b:b[v]=2 else: if b[v]==1: b[v]=2 c+=1 print(c) ```	0	MatrixStudio/Codeforces-Python-Submissions
724	A	Checking the Calendar	PROGRAMMING	1,000	[ "implementation" ]		null	null	You are given names of two days of the week. Please, determine whether it is possible that during some non-leap year the first day of some month was equal to the first day of the week you are given, while the first day of the next month was equal to the second day of the week you are given. Both months should belong t...	The input consists of two lines, each of them containing the name of exactly one day of the week. It's guaranteed that each string in the input is from the set "monday", "tuesday", "wednesday", "thursday", "friday", "saturday", "sunday".	Print "YES" (without quotes) if such situation is possible during some non-leap year. Otherwise, print "NO" (without quotes).	[ "monday\ntuesday\n", "sunday\nsunday\n", "saturday\ntuesday\n" ]	[ "NO\n", "YES\n", "YES\n" ]	In the second sample, one can consider February 1 and March 1 of year 2015. Both these days were Sundays. In the third sample, one can consider July 1 and August 1 of year 2017. First of these two days is Saturday, while the second one is Tuesday.	500	[ { "input": "monday\ntuesday", "output": "NO" }, { "input": "sunday\nsunday", "output": "YES" }, { "input": "saturday\ntuesday", "output": "YES" }, { "input": "tuesday\nthursday", "output": "YES" }, { "input": "friday\nwednesday", "output": "NO" }, { "i...	1,581,125,894	2,147,483,647	Python 3	OK	TESTS	68	124	307,200	s = input() t = input() x = ["monday", "tuesday", "wednesday", "thursday", "friday", "saturday", "sunday"] ss = x.index(s) tt = x.index(t) if s == t: print ("YES") exit() if tt-ss == 2 or tt-ss == 3: print ("YES") elif tt-ss+7 == 2 or tt-ss+7 == 3: print ("YES") else: print ("NO")	Title: Checking the Calendar Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given names of two days of the week. Please, determine whether it is possible that during some non-leap year the first day of some month was equal to the first day of the week you are given, while the fir...	```python s = input() t = input() x = ["monday", "tuesday", "wednesday", "thursday", "friday", "saturday", "sunday"] ss = x.index(s) tt = x.index(t) if s == t: print ("YES") exit() if tt-ss == 2 or tt-ss == 3: print ("YES") elif tt-ss+7 == 2 or tt-ss+7 == 3: print ("YES") else: print ("NO") ```	3	MatrixStudio/Codeforces-Python-Submissions
888	E	Maximum Subsequence	PROGRAMMING	1,800	[ "bitmasks", "divide and conquer", "meet-in-the-middle" ]		null	null	You are given an array a consisting of n integers, and additionally an integer m. You have to choose some sequence of indices b1,<=b2,<=...,<=bk (1<=≤<=b1<=<<=b2<=<<=...<=<<=bk<=≤<=n) in such a way that the value of is maximized. Chosen sequence can be empty. Print the maximum possibl...	The first line contains two integers n and m (1<=≤<=n<=≤<=35, 1<=≤<=m<=≤<=109). The second line contains n integers a1, a2, ..., an (1<=≤<=ai<=≤<=109).	Print the maximum possible value of .	[ "4 4\n5 2 4 1\n", "3 20\n199 41 299\n" ]	[ "3\n", "19\n" ]	In the first example you can choose a sequence b = {1, 2}, so the sum <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/c856546022c2feee13d02a4ec9cd1d361ab3a756.png" style="max-width: 100.0%;max-height: 100.0%;"/> is equal to 7 (and that's 3 after taking it modulo 4). In the second example...	0	[ { "input": "4 4\n5 2 4 1", "output": "3" }, { "input": "3 20\n199 41 299", "output": "19" }, { "input": "5 10\n47 100 49 2 56", "output": "9" }, { "input": "5 1000\n38361 75847 14913 11499 8297", "output": "917" }, { "input": "10 10\n48 33 96 77 67 59 35 15 14 86"...	1,676,757,185	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	30	0	def max_subsequence(nums): n = len(nums) dp = [0] * n dp[0] = nums[0] for i in range(1, n): dp[i] = max(nums[i], dp[i-1] + nums[i]) return max(dp)	Title: Maximum Subsequence Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given an array a consisting of n integers, and additionally an integer m. You have to choose some sequence of indices b1,<=b2,<=...,<=bk (1<=≤<=b1<=<<=b2<=<<=...<=<<=bk<=≤<=n...	```python def max_subsequence(nums): n = len(nums) dp = [0] * n dp[0] = nums[0] for i in range(1, n): dp[i] = max(nums[i], dp[i-1] + nums[i]) return max(dp) ```	0	MatrixStudio/Codeforces-Python-Submissions
227	B	Effective Approach	PROGRAMMING	1,100	[ "implementation" ]		null	null	Once at a team training Vasya, Petya and Sasha got a problem on implementing linear search in an array. According to the boys, linear search works as follows. The array elements in a pre-selected order are in turn compared with the number that you need to find. Once you find the array element that is equal to the requ...	The first line contains integer n (1<=≤<=n<=≤<=105) — the number of elements in the array. The second line contains n distinct space-separated integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=n) — the elements of array. The third line contains integer m (1<=≤<=m<=≤<=105) — the number of queries. The ...	Print two integers, showing how many comparisons Vasya's approach needs and how many comparisons Petya's approach needs. Separate the numbers by spaces. Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specifier.	[ "2\n1 2\n1\n1\n", "2\n2 1\n1\n1\n", "3\n3 1 2\n3\n1 2 3\n" ]	[ "1 2\n", "2 1\n", "6 6\n" ]	In the first sample Vasya's approach will make one comparison (it starts with the 1-st element and immediately finds the required number), and Petya's approach makes two comparisons (first he compares with the 2-nd array element, doesn't find the search item and compares with the 1-st element). In the second sample, o...	1,000	[ { "input": "2\n1 2\n1\n1", "output": "1 2" }, { "input": "2\n2 1\n1\n1", "output": "2 1" }, { "input": "3\n3 1 2\n3\n1 2 3", "output": "6 6" }, { "input": "9\n2 9 3 1 6 4 7 8 5\n9\n5 1 5 2 8 4 4 4 5", "output": "58 32" }, { "input": "10\n3 10 9 2 7 6 5 8 4 1\n1\n4...	1,628,933,953	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	92	6,963,200	if __name__ == "__main__": n = int(input()) nums = input().split(" ") arr = [0 for i in range(0,n+1)] pos = [0 for i in range(0,n+1)] for i in range(1,n+1): print("nums" ,nums[i-1]," ",i) arr[i] = (int(nums[i-1])) pos[arr[i]] = i count1=0 cou...	Title: Effective Approach Time Limit: None seconds Memory Limit: None megabytes Problem Description: Once at a team training Vasya, Petya and Sasha got a problem on implementing linear search in an array. According to the boys, linear search works as follows. The array elements in a pre-selected order are in turn c...	```python if __name__ == "__main__": n = int(input()) nums = input().split(" ") arr = [0 for i in range(0,n+1)] pos = [0 for i in range(0,n+1)] for i in range(1,n+1): print("nums" ,nums[i-1]," ",i) arr[i] = (int(nums[i-1])) pos[arr[i]] = i count1=...	0	MatrixStudio/Codeforces-Python-Submissions
49	A	Sleuth	PROGRAMMING	800	[ "implementation" ]	A. Sleuth	2	256	Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a "crime" and find out what is happening. He can ask any questions whatsoever that can be answered with "Yes" or "No". All the rest agree beforehand to ans...	The single line contains a question represented by a non-empty line consisting of large and small Latin letters, spaces and a question mark. The line length does not exceed 100. It is guaranteed that the question mark occurs exactly once in the line — as the last symbol and that the line contains at least one letter.	Print answer for the question in a single line: YES if the answer is "Yes", NO if the answer is "No". Remember that in the reply to the question the last letter, not the last character counts. I. e. the spaces and the question mark do not count as letters.	[ "Is it a melon?\n", "Is it an apple?\n", "Is it a banana ?\n", "Is it an apple and a banana simultaneouSLY?\n" ]	[ "NO\n", "YES\n", "YES\n", "YES\n" ]	none	500	[ { "input": "Is it a melon?", "output": "NO" }, { "input": "Is it an apple?", "output": "YES" }, { "input": " Is it a banana ?", "output": "YES" }, { "input": "Is it an apple and a banana simultaneouSLY?", "output": "YES" }, { "input": "oHtSbDwzHb?", ...	1,616,258,537	2,147,483,647	PyPy 3	COMPILATION_ERROR	TESTS	0	0	0	#include <iostream> #include <array> using namespace std; int main() { string t="AEIOUYaeyiou"; string a; getline(cin,a); int i=a.size()-2; while (a[i]==' ') { i--; } if (t.find(a[i])!=-1) { cout<<"YES"; } else { cout<<"NO"; ...	Title: Sleuth Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a "crime" and find out what is happening. He can ask any questions ...	```python #include <iostream> #include <array> using namespace std; int main() { string t="AEIOUYaeyiou"; string a; getline(cin,a); int i=a.size()-2; while (a[i]==' ') { i--; } if (t.find(a[i])!=-1) { cout<<"YES"; } else { co...	-1	MatrixStudio/Codeforces-Python-Submissions
615	A	Bulbs	PROGRAMMING	800	[ "implementation" ]		null	null	Vasya wants to turn on Christmas lights consisting of m bulbs. Initially, all bulbs are turned off. There are n buttons, each of them is connected to some set of bulbs. Vasya can press any of these buttons. When the button is pressed, it turns on all the bulbs it's connected to. Can Vasya light up all the bulbs? I...	The first line of the input contains integers n and m (1<=≤<=n,<=m<=≤<=100) — the number of buttons and the number of bulbs respectively. Each of the next n lines contains xi (0<=≤<=xi<=≤<=m) — the number of bulbs that are turned on by the i-th button, and then xi numbers yij (1<=≤<=y*...	If it's possible to turn on all m bulbs print "YES", otherwise print "NO".	[ "3 4\n2 1 4\n3 1 3 1\n1 2\n", "3 3\n1 1\n1 2\n1 1\n" ]	[ "YES\n", "NO\n" ]	In the first sample you can press each button once and turn on all the bulbs. In the 2 sample it is impossible to turn on the 3-rd lamp.	500	[ { "input": "3 4\n2 1 4\n3 1 3 1\n1 2", "output": "YES" }, { "input": "3 3\n1 1\n1 2\n1 1", "output": "NO" }, { "input": "3 4\n1 1\n1 2\n1 3", "output": "NO" }, { "input": "1 5\n5 1 2 3 4 5", "output": "YES" }, { "input": "1 5\n5 4 4 1 2 3", "output": "NO" },...	1,634,622,758	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	4	46	0	n,m=map(int,input().split()) a=[1 for i in range(m)] for i in range(n) : l=list(map(int,input().split(' '))) for j in range(len(l)) : a[l[j]-1]=0 if sum(a) : print("NO") else : print("YES")	Title: Bulbs Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya wants to turn on Christmas lights consisting of m bulbs. Initially, all bulbs are turned off. There are n buttons, each of them is connected to some set of bulbs. Vasya can press any of these buttons. When the button is...	```python n,m=map(int,input().split()) a=[1 for i in range(m)] for i in range(n) : l=list(map(int,input().split(' '))) for j in range(len(l)) : a[l[j]-1]=0 if sum(a) : print("NO") else : print("YES") ```	0	MatrixStudio/Codeforces-Python-Submissions
809	A	Do you want a date?	PROGRAMMING	1,500	[ "implementation", "math", "sortings" ]		null	null	Leha decided to move to a quiet town Vičkopolis, because he was tired by living in Bankopolis. Upon arrival he immediately began to expand his network of hacked computers. During the week Leha managed to get access to n computers throughout the town. Incidentally all the computers, which were hacked by Leha, lie on t...	The first line contains one integer n (1<=≤<=n<=≤<=3·105) denoting the number of hacked computers. The second line contains n integers x1,<=x2,<=...,<=xn (1<=≤<=xi<=≤<=109) denoting the coordinates of hacked computers. It is guaranteed that all xi are distinct.	Print a single integer — the required sum modulo 109<=+<=7.	[ "2\n4 7\n", "3\n4 3 1\n" ]	[ "3\n", "9\n" ]	There are three non-empty subsets in the first sample test:<img align="middle" class="tex-formula" src="https://espresso.codeforces.com/02b2d12556dad85f1c6c6912786eb87d4be2ea17.png" style="max-width: 100.0%;max-height: 100.0%;"/>, <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/22f6a537962c...	500	[ { "input": "2\n4 7", "output": "3" }, { "input": "3\n4 3 1", "output": "9" }, { "input": "20\n8 11 13 19 21 34 36 44 57 58 61 63 76 78 79 81 85 86 90 95", "output": "83396599" }, { "input": "20\n1 8 9 12 15 17 18 24 30 33 36 41 53 54 59 62 64 66 72 73", "output": "6805914...	1,495,379,997	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	7	2,000	20,582,400	import sys import math MOD = int(1e9 + 7) line = lambda: map(int, input().split()) def pow(n, k): if k == 0: return 1 if k % 2 == 1: return pow(n, k - 1) * n % MOD r = pow(n, k / 2) return r * r % MOD def solve(): n = int(input()) x = [x for x in line()] x...	Title: Do you want a date? Time Limit: None seconds Memory Limit: None megabytes Problem Description: Leha decided to move to a quiet town Vičkopolis, because he was tired by living in Bankopolis. Upon arrival he immediately began to expand his network of hacked computers. During the week Leha managed to get access ...	```python import sys import math MOD = int(1e9 + 7) line = lambda: map(int, input().split()) def pow(n, k): if k == 0: return 1 if k % 2 == 1: return pow(n, k - 1) * n % MOD r = pow(n, k / 2) return r * r % MOD def solve(): n = int(input()) x = [x for x in line...	0	MatrixStudio/Codeforces-Python-Submissions
698	A	Vacations	PROGRAMMING	1,400	[ "dp" ]		null	null	Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: whether that gym opened and whether a contest was carried out in the Internet on that day. For the i-th day there are four options: 1. on this day the gym is close...	The first line contains a positive integer n (1<=≤<=n<=≤<=100) — the number of days of Vasya's vacations. The second line contains the sequence of integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=3) separated by space, where: - ai equals 0, if on the i-th day of vacations the gym is closed and the co...	Print the minimum possible number of days on which Vasya will have a rest. Remember that Vasya refuses: - to do sport on any two consecutive days, - to write the contest on any two consecutive days.	[ "4\n1 3 2 0\n", "7\n1 3 3 2 1 2 3\n", "2\n2 2\n" ]	[ "2\n", "0\n", "1\n" ]	In the first test Vasya can write the contest on the day number 1 and do sport on the day number 3. Thus, he will have a rest for only 2 days. In the second test Vasya should write contests on days number 1, 3, 5 and 7, in other days do sport. Thus, he will not have a rest for a single day. In the third test Vasya ca...	500	[ { "input": "4\n1 3 2 0", "output": "2" }, { "input": "7\n1 3 3 2 1 2 3", "output": "0" }, { "input": "2\n2 2", "output": "1" }, { "input": "1\n0", "output": "1" }, { "input": "10\n0 0 1 1 0 0 0 0 1 0", "output": "8" }, { "input": "100\n3 2 3 3 3 2 3 1 ...	1,664,362,743	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	3	31	0	x=int(input()) l=list(map(int,input().split())) las=l[0] res=0 for i in range(1,x): if l[i]==0: res+=1 las=l[i] elif (l[i]==2 and las==2) or (l[i]==1 and las==1): res+=1 las=l[i] else: if las==2: las=1 else: las=2 print(...	Title: Vacations Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: whether that gym opened and whether a contest was carried out in the Int...	```python x=int(input()) l=list(map(int,input().split())) las=l[0] res=0 for i in range(1,x): if l[i]==0: res+=1 las=l[i] elif (l[i]==2 and las==2) or (l[i]==1 and las==1): res+=1 las=l[i] else: if las==2: las=1 else: las...	0	MatrixStudio/Codeforces-Python-Submissions
231	A	Team	PROGRAMMING	800	[ "brute force", "greedy" ]		null	null	One day three best friends Petya, Vasya and Tonya decided to form a team and take part in programming contests. Participants are usually offered several problems during programming contests. Long before the start the friends decided that they will implement a problem if at least two of them are sure about the solution....	The first input line contains a single integer n (1<=≤<=n<=≤<=1000) — the number of problems in the contest. Then n lines contain three integers each, each integer is either 0 or 1. If the first number in the line equals 1, then Petya is sure about the problem's solution, otherwise he isn't sure. The second numbe...	Print a single integer — the number of problems the friends will implement on the contest.	[ "3\n1 1 0\n1 1 1\n1 0 0\n", "2\n1 0 0\n0 1 1\n" ]	[ "2\n", "1\n" ]	In the first sample Petya and Vasya are sure that they know how to solve the first problem and all three of them know how to solve the second problem. That means that they will write solutions for these problems. Only Petya is sure about the solution for the third problem, but that isn't enough, so the friends won't ta...	500	[ { "input": "3\n1 1 0\n1 1 1\n1 0 0", "output": "2" }, { "input": "2\n1 0 0\n0 1 1", "output": "1" }, { "input": "1\n1 0 0", "output": "0" }, { "input": "2\n1 0 0\n1 1 1", "output": "1" }, { "input": "5\n1 0 0\n0 1 0\n1 1 1\n0 0 1\n0 0 0", "output": "1" }, ...	1,697,043,252	2,147,483,647	Python 3	OK	TESTS	21	92	0	c=0 for _ in range(int(input())): l=list(map(int,input().split())) if(l.count(1)>=2): c=c+1 print(c)	Title: Team Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day three best friends Petya, Vasya and Tonya decided to form a team and take part in programming contests. Participants are usually offered several problems during programming contests. Long before the start the friends decid...	```python c=0 for _ in range(int(input())): l=list(map(int,input().split())) if(l.count(1)>=2): c=c+1 print(c) ```	3	MatrixStudio/Codeforces-Python-Submissions
955	A	Feed the cat	PROGRAMMING	1,100	[ "greedy", "math" ]		null	null	After waking up at hh:mm, Andrew realised that he had forgotten to feed his only cat for yet another time (guess why there's only one cat). The cat's current hunger level is H points, moreover each minute without food increases his hunger by D points. At any time Andrew can visit the store where tasty buns are...	The first line contains two integers hh and mm (00<=≤<=hh<=≤<=23,<=00<=≤<=mm<=≤<=59) — the time of Andrew's awakening. The second line contains four integers H, D, C and N (1<=≤<=H<=≤<=105,<=1<=≤<=D,<=C,<=N<=≤<=102).	Output the minimum amount of money to within three decimal digits. You answer is considered correct, if its absolute or relative error does not exceed 10<=-<=4. Formally, let your answer be a, and the jury's answer be b. Your answer is considered correct if .	[ "19 00\n255 1 100 1\n", "17 41\n1000 6 15 11\n" ]	[ "25200.0000\n", "1365.0000\n" ]	In the first sample Andrew can visit the store at exactly 20:00. The cat's hunger will be equal to 315, hence it will be necessary to purchase 315 buns. The discount makes the final answer 25200 roubles. In the second sample it's optimal to visit the store right after he wakes up. Then he'll have to buy 91 bins per 15...	500	[ { "input": "19 00\n255 1 100 1", "output": "25200.0000" }, { "input": "17 41\n1000 6 15 11", "output": "1365.0000" }, { "input": "16 34\n61066 14 50 59", "output": "43360.0000" }, { "input": "18 18\n23331 86 87 41", "output": "49590.0000" }, { "input": "10 48\n684...	1,521,827,183	4,283	Python 3	WRONG_ANSWER	PRETESTS	2	62	7,065,600	from math import ceil h, m = [int(x) for x in input().split(' ')] hunger, hincrease, costOfBun, hdecrease = [float(x) for x in input().split(' ')] minsToEight = (((20-h)60) + m) hungerAtEight = hunger + (hincrease minsToEight) BuyNoWait = ceil(hunger / hdecrease) * costOfBun BuyWait = ceil(hungerAtEight / hdecreas...	Title: Feed the cat Time Limit: None seconds Memory Limit: None megabytes Problem Description: After waking up at hh:mm, Andrew realised that he had forgotten to feed his only cat for yet another time (guess why there's only one cat). The cat's current hunger level is H points, moreover each minute without foo...	```python from math import ceil h, m = [int(x) for x in input().split(' ')] hunger, hincrease, costOfBun, hdecrease = [float(x) for x in input().split(' ')] minsToEight = (((20-h)60) + m) hungerAtEight = hunger + (hincrease minsToEight) BuyNoWait = ceil(hunger / hdecrease) * costOfBun BuyWait = ceil(hungerAtEight ...	0	MatrixStudio/Codeforces-Python-Submissions
61	A	Ultra-Fast Mathematician	PROGRAMMING	800	[ "implementation" ]	A. Ultra-Fast Mathematician	2	256	Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second. One day in 230 AD Shapur was trying to find out if any one can possibly do...	There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.	Write one line — the corresponding answer. Do not omit the leading 0s.	[ "1010100\n0100101\n", "000\n111\n", "1110\n1010\n", "01110\n01100\n" ]	[ "1110001\n", "111\n", "0100\n", "00010\n" ]	none	500	[ { "input": "1010100\n0100101", "output": "1110001" }, { "input": "000\n111", "output": "111" }, { "input": "1110\n1010", "output": "0100" }, { "input": "01110\n01100", "output": "00010" }, { "input": "011101\n000001", "output": "011100" }, { "input": "...	1,632,851,517	2,147,483,647	Python 3	OK	TESTS	102	77	6,758,400	a = input() b = input() res = [] for i in a: res.append(int(i)) res1 = [] for i in b: res1.append(int(i)) for x,y in zip(res, res1): print(x^y, end ='')	Title: Ultra-Fast Mathematician Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 10...	```python a = input() b = input() res = [] for i in a: res.append(int(i)) res1 = [] for i in b: res1.append(int(i)) for x,y in zip(res, res1): print(x^y, end ='') ```	3.968161	MatrixStudio/Codeforces-Python-Submissions
805	A	Fake NP	PROGRAMMING	1,000	[ "greedy", "math" ]		null	null	Tavak and Seyyed are good friends. Seyyed is very funny and he told Tavak to solve the following problem instead of longest-path. You are given l and r. For all integers from l to r, inclusive, we wrote down all of their integer divisors except 1. Find the integer that we wrote down the maximum number of times...	The first line contains two integers l and r (2<=≤<=l<=≤<=r<=≤<=109).	Print single integer, the integer that appears maximum number of times in the divisors. If there are multiple answers, print any of them.	[ "19 29\n", "3 6\n" ]	[ "2\n", "3\n" ]	Definition of a divisor: [https://www.mathsisfun.com/definitions/divisor-of-an-integer-.html](https://www.mathsisfun.com/definitions/divisor-of-an-integer-.html) The first example: from 19 to 29 these numbers are divisible by 2: {20, 22, 24, 26, 28}. The second example: from 3 to 6 these numbers are divisible by 3: {...	500	[ { "input": "19 29", "output": "2" }, { "input": "3 6", "output": "2" }, { "input": "39 91", "output": "2" }, { "input": "76 134", "output": "2" }, { "input": "93 95", "output": "2" }, { "input": "17 35", "output": "2" }, { "input": "94 95",...	1,628,053,815	2,147,483,647	Python 3	OK	TESTS	93	77	6,758,400	a,b=list(map(int,input().split())) print(2 if a!=b else a)	Title: Fake NP Time Limit: None seconds Memory Limit: None megabytes Problem Description: Tavak and Seyyed are good friends. Seyyed is very funny and he told Tavak to solve the following problem instead of longest-path. You are given l and r. For all integers from l to r, inclusive, we wrote down all of the...	```python a,b=list(map(int,input().split())) print(2 if a!=b else a) ```	3	MatrixStudio/Codeforces-Python-Submissions
591	A	Wizards' Duel	PROGRAMMING	900	[ "implementation", "math" ]		null	null	Harry Potter and He-Who-Must-Not-Be-Named engaged in a fight to the death once again. This time they are located at opposite ends of the corridor of length l. Two opponents simultaneously charge a deadly spell in the enemy. We know that the impulse of Harry's magic spell flies at a speed of p meters per second, and...	The first line of the input contains a single integer l (1<=≤<=l<=≤<=1<=000) — the length of the corridor where the fight takes place. The second line contains integer p, the third line contains integer q (1<=≤<=p,<=q<=≤<=500) — the speeds of magical impulses for Harry Potter and He-Who-Must-Not-Be-Named, ...	Print a single real number — the distance from the end of the corridor, where Harry is located, to the place of the second meeting of the spell impulses. Your answer will be considered correct if its absolute or relative error will not exceed 10<=-<=4. Namely: let's assume that your answer equals a, and the answer ...	[ "100\n50\n50\n", "199\n60\n40\n" ]	[ "50\n", "119.4\n" ]	In the first sample the speeds of the impulses are equal, so both of their meetings occur exactly in the middle of the corridor.	500	[ { "input": "100\n50\n50", "output": "50" }, { "input": "199\n60\n40", "output": "119.4" }, { "input": "1\n1\n1", "output": "0.5" }, { "input": "1\n1\n500", "output": "0.001996007984" }, { "input": "1\n500\n1", "output": "0.998003992" }, { "input": "1\n...	1,683,551,248	2,147,483,647	Python 3	OK	TESTS	45	46	0	l = int(input()) p = int(input()) q = int(input()) time = l/(p+q) distance_from_harry = p*time print(distance_from_harry)	Title: Wizards' Duel Time Limit: None seconds Memory Limit: None megabytes Problem Description: Harry Potter and He-Who-Must-Not-Be-Named engaged in a fight to the death once again. This time they are located at opposite ends of the corridor of length l. Two opponents simultaneously charge a deadly spell in the en...	```python l = int(input()) p = int(input()) q = int(input()) time = l/(p+q) distance_from_harry = p*time print(distance_from_harry) ```	3	MatrixStudio/Codeforces-Python-Submissions
464	C	Substitutes in Number	PROGRAMMING	2,100	[ "dp" ]		null	null	Andrew and Eugene are playing a game. Initially, Andrew has string s, consisting of digits. Eugene sends Andrew multiple queries of type "di<=→<=ti", that means "replace all digits di in string s with substrings equal to ti". For example, if s<==<=123123, then query "2<=→<=00" transforms s to 10...	The first line contains string s (1<=≤<=\|s\|<=≤<=105), consisting of digits — the string before processing all the requests. The second line contains a single integer n (0<=≤<=n<=≤<=105) — the number of queries. The next n lines contain the descriptions of the queries. The i-th query is described by string...	Print a single integer — remainder of division of the resulting number by 1000000007 (109<=+<=7).	[ "123123\n1\n2->00\n", "123123\n1\n3->\n", "222\n2\n2->0\n0->7\n", "1000000008\n0\n" ]	[ "10031003\n", "1212\n", "777\n", "1\n" ]	Note that the leading zeroes are not removed from string s after the replacement (you can see it in the third sample).	1,500	[ { "input": "123123\n1\n2->00", "output": "10031003" }, { "input": "123123\n1\n3->", "output": "1212" }, { "input": "222\n2\n2->0\n0->7", "output": "777" }, { "input": "1000000008\n0", "output": "1" }, { "input": "100\n5\n1->301\n0->013\n1->013\n0->103\n0->103", ...	1,546,629,566	2,147,483,647	PyPy 3	RUNTIME_ERROR	TESTS	10	186	1,536,000	s = input() n = int(input()) d = [] t = [] for i in range(n): a = input() a = a.split('->') s = s.replace(a[0], a[1]) print(int(s) % 1000000007)	Title: Substitutes in Number Time Limit: None seconds Memory Limit: None megabytes Problem Description: Andrew and Eugene are playing a game. Initially, Andrew has string s, consisting of digits. Eugene sends Andrew multiple queries of type "di<=→<=ti", that means "replace all digits di in string s w...	```python s = input() n = int(input()) d = [] t = [] for i in range(n): a = input() a = a.split('->') s = s.replace(a[0], a[1]) print(int(s) % 1000000007) ```	-1	MatrixStudio/Codeforces-Python-Submissions
66	D	Petya and His Friends	PROGRAMMING	1,700	[ "constructive algorithms", "math", "number theory" ]	D. Petya and His Friends	2	256	Little Petya has a birthday soon. Due this wonderful event, Petya's friends decided to give him sweets. The total number of Petya's friends equals to n. Let us remind you the definition of the greatest common divisor: GCD(a1,<=...,<=ak)<==<=d, where d represents such a maximal positive number that each *...	The first line contains an integer n (2<=≤<=n<=≤<=50).	If there is no answer, print "-1" without quotes. Otherwise print a set of n distinct positive numbers a1,<=a2,<=...,<=an. Each line must contain one number. Each number must consist of not more than 100 digits, and must not contain any leading zeros. If there are several solutions to that problem, print any ...	[ "3\n", "4\n" ]	[ "99\n55\n11115\n", "385\n360\n792\n8360\n" ]	none	2,000	[ { "input": "3", "output": "15\n10\n6" }, { "input": "4", "output": "105\n70\n42\n30" }, { "input": "5", "output": "1155\n770\n462\n330\n210" }, { "input": "6", "output": "15015\n10010\n6006\n4290\n2730\n2310" }, { "input": "7", "output": "255255\n170170\n10210...	1,619,006,163	2,147,483,647	PyPy 3	OK	TESTS	49	216	1,228,800	from math import log10 def eratosphene(n): ans = [0] * (n+1) ans[0] = ans[1] = 1; for i in range(2, n+1): if ans[i]: continue for j in range(i*i, n+1, i): ans[j] = 1 return ans n = int(input()) primes = eratosphene(1000) cur = [] for i in range(le...	Title: Petya and His Friends Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Little Petya has a birthday soon. Due this wonderful event, Petya's friends decided to give him sweets. The total number of Petya's friends equals to n. Let us remind you the definition of the greatest common divis...	```python from math import log10 def eratosphene(n): ans = [0] * (n+1) ans[0] = ans[1] = 1; for i in range(2, n+1): if ans[i]: continue for j in range(i*i, n+1, i): ans[j] = 1 return ans n = int(input()) primes = eratosphene(1000) cur = [] for i i...	3.943711	MatrixStudio/Codeforces-Python-Submissions
44	A	Indian Summer	PROGRAMMING	900	[ "implementation" ]	A. Indian Summer	2	256	Indian summer is such a beautiful time of the year! A girl named Alyona is walking in the forest and picking a bouquet from fallen leaves. Alyona is very choosy — she doesn't take a leaf if it matches the color and the species of the tree of one of the leaves she already has. Find out how many leaves Alyona has picked.	The first line contains an integer n (1<=≤<=n<=≤<=100) — the number of leaves Alyona has found. The next n lines contain the leaves' descriptions. Each leaf is characterized by the species of the tree it has fallen from and by the color. The species of the trees and colors are given in names, consisting of no mor...	Output the single number — the number of Alyona's leaves.	[ "5\nbirch yellow\nmaple red\nbirch yellow\nmaple yellow\nmaple green\n", "3\noak yellow\noak yellow\noak yellow\n" ]	[ "4\n", "1\n" ]	none	0	[ { "input": "5\nbirch yellow\nmaple red\nbirch yellow\nmaple yellow\nmaple green", "output": "4" }, { "input": "3\noak yellow\noak yellow\noak yellow", "output": "1" }, { "input": "5\nxbnbkzn hp\nkaqkl vrgzbvqstu\nj aqidx\nhos gyul\nwefxmh tygpluae", "output": "5" }, { "input"...	1,578,886,309	2,147,483,647	Python 3	OK	TESTS	29	218	307,200	def indian_summer(): n = int(input()) b = set() while n > 0: l = str(input()) b.add(l) n -= 1 print(len(b)) if __name__ == '__main__': indian_summer()	Title: Indian Summer Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Indian summer is such a beautiful time of the year! A girl named Alyona is walking in the forest and picking a bouquet from fallen leaves. Alyona is very choosy — she doesn't take a leaf if it matches the color and the specie...	```python def indian_summer(): n = int(input()) b = set() while n > 0: l = str(input()) b.add(l) n -= 1 print(len(b)) if __name__ == '__main__': indian_summer() ```	3.944928	MatrixStudio/Codeforces-Python-Submissions
137	B	Permutation	PROGRAMMING	1,000	[ "greedy" ]		null	null	"Hey, it's homework time" — thought Polycarpus and of course he started with his favourite subject, IT. Polycarpus managed to solve all tasks but for the last one in 20 minutes. However, as he failed to solve the last task after some considerable time, the boy asked you to help him. The sequence of n integers is cal...	The first line of the input data contains an integer n (1<=≤<=n<=≤<=5000) which represents how many numbers are in the sequence. The second line contains a sequence of integers ai (1<=≤<=ai<=≤<=5000,<=1<=≤<=i<=≤<=n).	Print the only number — the minimum number of changes needed to get the permutation.	[ "3\n3 1 2\n", "2\n2 2\n", "5\n5 3 3 3 1\n" ]	[ "0\n", "1\n", "2\n" ]	The first sample contains the permutation, which is why no replacements are required. In the second sample it is enough to replace the first element with the number 1 and that will make the sequence the needed permutation. In the third sample we can replace the second element with number 4 and the fourth element with...	1,000	[ { "input": "3\n3 1 2", "output": "0" }, { "input": "2\n2 2", "output": "1" }, { "input": "5\n5 3 3 3 1", "output": "2" }, { "input": "5\n6 6 6 6 6", "output": "5" }, { "input": "10\n1 1 2 2 8 8 7 7 9 9", "output": "5" }, { "input": "8\n9 8 7 6 5 4 3 2"...	1,664,663,668	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	30	0	n=int(input()) s=list(map(int,input().split())) z=[] for i in s: if i not in z and i<=n: z.append(i) print(len(z))	Title: Permutation Time Limit: None seconds Memory Limit: None megabytes Problem Description: "Hey, it's homework time" — thought Polycarpus and of course he started with his favourite subject, IT. Polycarpus managed to solve all tasks but for the last one in 20 minutes. However, as he failed to solve the last task ...	```python n=int(input()) s=list(map(int,input().split())) z=[] for i in s: if i not in z and i<=n: z.append(i) print(len(z)) ```	0	MatrixStudio/Codeforces-Python-Submissions
34	B	Sale	PROGRAMMING	900	[ "greedy", "sortings" ]	B. Sale	2	256	Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV sets he wants. Though he's very strong, Bob can carry at most m TV set...	The first line contains two space-separated integers n and m (1<=≤<=m<=≤<=n<=≤<=100) — amount of TV sets at the sale, and amount of TV sets that Bob can carry. The following line contains n space-separated integers ai (<=-<=1000<=≤<=ai<=≤<=1000) — prices of the TV sets.	Output the only number — the maximum sum of money that Bob can earn, given that he can carry at most m TV sets.	[ "5 3\n-6 0 35 -2 4\n", "4 2\n7 0 0 -7\n" ]	[ "8\n", "7\n" ]	none	1,000	[ { "input": "5 3\n-6 0 35 -2 4", "output": "8" }, { "input": "4 2\n7 0 0 -7", "output": "7" }, { "input": "6 6\n756 -611 251 -66 572 -818", "output": "1495" }, { "input": "5 5\n976 437 937 788 518", "output": "0" }, { "input": "5 3\n-2 -2 -2 -2 -2", "output": "...	1,650,036,419	2,147,483,647	Python 3	OK	TESTS	25	62	0	n , m = map(int , input().split()) tv_sets = list(map(int , input().split())) tv_sets.sort() tv_sets = list(reversed(tv_sets)) earn = 0 sub = tv_sets[-1m:] for i in sub: if i < 0: earn += i earn = -1 print(earn)	Title: Sale Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can...	```python n , m = map(int , input().split()) tv_sets = list(map(int , input().split())) tv_sets.sort() tv_sets = list(reversed(tv_sets)) earn = 0 sub = tv_sets[-1m:] for i in sub: if i < 0: earn += i earn = -1 print(earn) ```	3.9845	MatrixStudio/Codeforces-Python-Submissions
168	A	Wizards and Demonstration	PROGRAMMING	900	[ "implementation", "math" ]		null	null	Some country is populated by wizards. They want to organize a demonstration. There are n people living in the city, x of them are the wizards who will surely go to the demonstration. Other city people (n<=-<=x people) do not support the wizards and aren't going to go to the demonstration. We know that the city...	The first line contains three space-separated integers, n, x, y (1<=≤<=n,<=x,<=y<=≤<=104,<=x<=≤<=n) — the number of citizens in the city, the number of wizards and the percentage the administration needs, correspondingly. Please note that y can exceed 100 percent, that is, the administration wants to...	Print a single integer — the answer to the problem, the minimum number of clones to create, so that the demonstration involved no less than y percent of n (the real total city population).	[ "10 1 14\n", "20 10 50\n", "1000 352 146\n" ]	[ "1\n", "0\n", "1108\n" ]	In the first sample it is necessary that at least 14% of 10 people came to the demonstration. As the number of people should be integer, then at least two people should come. There is only one wizard living in the city and he is going to come. That isn't enough, so he needs to create one clone. In the second sample 1...	500	[ { "input": "10 1 14", "output": "1" }, { "input": "20 10 50", "output": "0" }, { "input": "1000 352 146", "output": "1108" }, { "input": "68 65 20", "output": "0" }, { "input": "78 28 27", "output": "0" }, { "input": "78 73 58", "output": "0" }, ...	1,527,845,108	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	154	7,065,600	a=list(input().split()) n=int(a[0]) x=int(a[1]) y=int(a[2]) per=float ((x/n)100) y=y-per if y<=0: print(0) else: if (yn/100)%1==0: print(int (yn/100)) else: print(int (yn/100) +1)	Title: Wizards and Demonstration Time Limit: None seconds Memory Limit: None megabytes Problem Description: Some country is populated by wizards. They want to organize a demonstration. There are n people living in the city, x of them are the wizards who will surely go to the demonstration. Other city people (*n...	```python a=list(input().split()) n=int(a[0]) x=int(a[1]) y=int(a[2]) per=float ((x/n)100) y=y-per if y<=0: print(0) else: if (yn/100)%1==0: print(int (yn/100)) else: print(int (yn/100) +1) ```	0	MatrixStudio/Codeforces-Python-Submissions
15	C	Industrial Nim	PROGRAMMING	2,000	[ "games" ]	C. Industrial Nim	2	64	There are n stone quarries in Petrograd. Each quarry owns mi dumpers (1<=≤<=i<=≤<=n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi<=+<=1 stones in it, the third has xi<=+<=2, and the mi-th dumper (the last for the i-th quarry) has x*...	The first line of the input contains one integer number n (1<=≤<=n<=≤<=105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1<=≤<=xi,<=mi<=≤<=1016) — the amount of stones in the first dumper of the i-th quarry and the number of d...	Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.	[ "2\n2 1\n3 2\n", "4\n1 1\n1 1\n1 1\n1 1\n" ]	[ "tolik\n", "bolik\n" ]	none	0	[ { "input": "2\n2 1\n3 2", "output": "tolik" }, { "input": "4\n1 1\n1 1\n1 1\n1 1", "output": "bolik" }, { "input": "10\n2 3\n1 4\n5 8\n4 10\n10 8\n7 2\n1 2\n1 7\n4 10\n5 3", "output": "tolik" }, { "input": "20\n8 6\n6 3\n2 9\n7 8\n9 1\n2 4\n3 6\n6 3\n5 6\n5 3\n6 5\n2 10\n2 9\...	1,637,229,771	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	62	0	def nim(): res = 0 for _ in range(int(input())): a = input().split() for j in range(int(a[1])): int(a)[0] + j return 'tolik' if res else 'bolik' print(nim())	Title: Industrial Nim Time Limit: 2 seconds Memory Limit: 64 megabytes Problem Description: There are n stone quarries in Petrograd. Each quarry owns mi dumpers (1<=≤<=i<=≤<=n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi<=+<=1 stones in it,...	```python def nim(): res = 0 for _ in range(int(input())): a = input().split() for j in range(int(a[1])): int(a)[0] + j return 'tolik' if res else 'bolik' print(nim()) ```	-1	MatrixStudio/Codeforces-Python-Submissions
25	A	IQ test	PROGRAMMING	1,300	[ "brute force" ]	A. IQ test	2	256	Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given n numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given n numbers finds one that i...	The first line contains integer n (3<=≤<=n<=≤<=100) — amount of numbers in the task. The second line contains n space-separated natural numbers, not exceeding 100. It is guaranteed, that exactly one of these numbers differs from the others in evenness.	Output index of number that differs from the others in evenness. Numbers are numbered from 1 in the input order.	[ "5\n2 4 7 8 10\n", "4\n1 2 1 1\n" ]	[ "3\n", "2\n" ]	none	0	[ { "input": "5\n2 4 7 8 10", "output": "3" }, { "input": "4\n1 2 1 1", "output": "2" }, { "input": "3\n1 2 2", "output": "1" }, { "input": "3\n100 99 100", "output": "2" }, { "input": "3\n5 3 2", "output": "3" }, { "input": "4\n43 28 1 91", "output"...	1,682,686,981	2,147,483,647	Python 3	OK	TESTS	32	92	0	n = int(input()) numbers = list(map(int, input().split())) evens = [x for x in numbers if x % 2 == 0] odds = [x for x in numbers if x % 2 != 0] if len(evens) == 1: print(numbers.index(evens[0]) + 1) else: print(numbers.index(odds[0]) + 1)	Title: IQ test Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given n numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — t...	```python n = int(input()) numbers = list(map(int, input().split())) evens = [x for x in numbers if x % 2 == 0] odds = [x for x in numbers if x % 2 != 0] if len(evens) == 1: print(numbers.index(evens[0]) + 1) else: print(numbers.index(odds[0]) + 1) ```	3.977	MatrixStudio/Codeforces-Python-Submissions
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,668,672,766	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	2	93	0	n = int(input()) mi=0 ch=0 for i in range(n): m,k= map(int,input().split()) if m>k: mi +=1 elif m<k: ch +=1 if mi>ch: print("Mishka") elif ch>mi: print("chris") elif ch==mi: 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()) mi=0 ch=0 for i in range(n): m,k= map(int,input().split()) if m>k: mi +=1 elif m<k: ch +=1 if mi>ch: print("Mishka") elif ch>mi: print("chris") elif ch==mi: print("Friendship is magic!^^") ```	0	MatrixStudio/Codeforces-Python-Submissions
869	C	The Intriguing Obsession	PROGRAMMING	1,800	[ "combinatorics", "dp", "math" ]		null	null	— This is not playing but duty as allies of justice, Nii-chan! — Not allies but justice itself, Onii-chan! With hands joined, go everywhere at a speed faster than our thoughts! This time, the Fire Sisters — Karen and Tsukihi — is heading for somewhere they've never reached — water-surrounded islands! There are three...	The first and only line of input contains three space-separated integers a, b and c (1<=≤<=a,<=b,<=c<=≤<=5<=000) — the number of islands in the red, blue and purple clusters, respectively.	Output one line containing an integer — the number of different ways to build bridges, modulo 998<=244<=353.	[ "1 1 1\n", "1 2 2\n", "1 3 5\n", "6 2 9\n" ]	[ "8\n", "63\n", "3264\n", "813023575\n" ]	In the first example, there are 3 bridges that can possibly be built, and no setup of bridges violates the restrictions. Thus the answer is 2<sup class="upper-index">3</sup> = 8. In the second example, the upper two structures in the figure below are instances of valid ones, while the lower two are invalid due to the ...	1,500	[ { "input": "1 1 1", "output": "8" }, { "input": "1 2 2", "output": "63" }, { "input": "1 3 5", "output": "3264" }, { "input": "6 2 9", "output": "813023575" }, { "input": "7 3 7", "output": "807577560" }, { "input": "135 14 39", "output": "41484950...	1,631,414,570	2,147,483,647	PyPy 3	OK	TESTS	30	140	22,323,200	p = 998244353 N = 5000 fact= [1](N+1) for i in range(2,N+1): fact[i]=(fact[i-1]i)%p def bpow(a,b,p): c = 1 while b>0: if b&1: c=(ca)%p a = (aa)%p b = b>>1 return c def inv(a,p): return bpow(a,p-2,p) def comb(a,b): ans = 1 for m in range(1,min...	Title: The Intriguing Obsession Time Limit: None seconds Memory Limit: None megabytes Problem Description: — This is not playing but duty as allies of justice, Nii-chan! — Not allies but justice itself, Onii-chan! With hands joined, go everywhere at a speed faster than our thoughts! This time, the Fire Sisters — K...	```python p = 998244353 N = 5000 fact= [1](N+1) for i in range(2,N+1): fact[i]=(fact[i-1]i)%p def bpow(a,b,p): c = 1 while b>0: if b&1: c=(ca)%p a = (aa)%p b = b>>1 return c def inv(a,p): return bpow(a,p-2,p) def comb(a,b): ans = 1 for m in r...	3	MatrixStudio/Codeforces-Python-Submissions
839	A	Arya and Bran	PROGRAMMING	900	[ "implementation" ]		null	null	Bran and his older sister Arya are from the same house. Bran like candies so much, so Arya is going to give him some Candies. At first, Arya and Bran have 0 Candies. There are n days, at the i-th day, Arya finds ai candies in a box, that is given by the Many-Faced God. Every day she can give Bran at most 8 of ...	The first line contains two integers n and k (1<=≤<=n<=≤<=100, 1<=≤<=k<=≤<=10000). The second line contains n integers a1,<=a2,<=a3,<=...,<=an (1<=≤<=ai<=≤<=100).	If it is impossible for Arya to give Bran k candies within n days, print -1. Otherwise print a single integer — the minimum number of days Arya needs to give Bran k candies before the end of the n-th day.	[ "2 3\n1 2\n", "3 17\n10 10 10\n", "1 9\n10\n" ]	[ "2", "3", "-1" ]	In the first sample, Arya can give Bran 3 candies in 2 days. In the second sample, Arya can give Bran 17 candies in 3 days, because she can give him at most 8 candies per day. In the third sample, Arya can't give Bran 9 candies, because she can give him at most 8 candies per day and she must give him the candies with...	500	[ { "input": "2 3\n1 2", "output": "2" }, { "input": "3 17\n10 10 10", "output": "3" }, { "input": "1 9\n10", "output": "-1" }, { "input": "10 70\n6 5 2 3 3 2 1 4 3 2", "output": "-1" }, { "input": "20 140\n40 4 81 40 10 54 34 50 84 60 16 1 90 78 38 93 99 60 81 99",...	1,595,515,567	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	4	140	20,172,800	n,x=map(int,input().split()) l=list(map(int,input().split())) l.sort() for i in range(n): if l[i]>8: l[i]=8 f=-1 sum=0 for i in range(n): sum+=l[i] if sum>=x: f=i break if f!=-1 : print(f+1) else: print(-1)	Title: Arya and Bran Time Limit: None seconds Memory Limit: None megabytes Problem Description: Bran and his older sister Arya are from the same house. Bran like candies so much, so Arya is going to give him some Candies. At first, Arya and Bran have 0 Candies. There are n days, at the i-th day, Arya finds a*...	```python n,x=map(int,input().split()) l=list(map(int,input().split())) l.sort() for i in range(n): if l[i]>8: l[i]=8 f=-1 sum=0 for i in range(n): sum+=l[i] if sum>=x: f=i break if f!=-1 : print(f+1) else: print(-1) ```	0	MatrixStudio/Codeforces-Python-Submissions
938	A	Word Correction	PROGRAMMING	800	[ "implementation" ]		null	null	Victor tries to write his own text editor, with word correction included. However, the rules of word correction are really strange. Victor thinks that if a word contains two consecutive vowels, then it's kinda weird and it needs to be replaced. So the word corrector works in such a way: as long as there are two consec...	The first line contains one integer n (1<=≤<=n<=≤<=100) — the number of letters in word s before the correction. The second line contains a string s consisting of exactly n lowercase Latin letters — the word before the correction.	Output the word s after the correction.	[ "5\nweird\n", "4\nword\n", "5\naaeaa\n" ]	[ "werd\n", "word\n", "a\n" ]	Explanations of the examples: 1. There is only one replace: weird <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/70a0795f45d32287dba0eb83fc4a3f470c6e5537.png" style="max-width: 100.0%;max-height: 100.0%;"/> werd;1. No replace needed since there are no two consecutive vowels;1. aaeaa <i...	0	[ { "input": "5\nweird", "output": "werd" }, { "input": "4\nword", "output": "word" }, { "input": "5\naaeaa", "output": "a" }, { "input": "100\naaaaabbbbboyoyoyoyoyacadabbbbbiuiufgiuiuaahjabbbklboyoyoyoyoyaaaaabbbbbiuiuiuiuiuaaaaabbbbbeyiyuyzyw", "output": "abbbbbocadabbbbb...	1,518,892,844	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	46	5,632,000	n = int(input()) s = input() vow = "aeiouy" def getConsVowels(s): for x in range(len(s)-1): if (s[x] in vow and s[x+1] in vow): return x return -1 while (getConsVowels(s)!= -1): s = s[:getConsVowels(s)] + s[getConsVowels(s)+1:] print(s)	Title: Word Correction Time Limit: None seconds Memory Limit: None megabytes Problem Description: Victor tries to write his own text editor, with word correction included. However, the rules of word correction are really strange. Victor thinks that if a word contains two consecutive vowels, then it's kinda weird an...	```python n = int(input()) s = input() vow = "aeiouy" def getConsVowels(s): for x in range(len(s)-1): if (s[x] in vow and s[x+1] in vow): return x return -1 while (getConsVowels(s)!= -1): s = s[:getConsVowels(s)] + s[getConsVowels(s)+1:] print(s) ```	0	MatrixStudio/Codeforces-Python-Submissions
2	A	Winner	PROGRAMMING	1,500	[ "hashing", "implementation" ]	A. Winner	1	64	The winner of the card game popular in Berland "Berlogging" is determined according to the following rules. If at the end of the game there is only one player with the maximum number of points, he is the winner. The situation becomes more difficult if the number of such players is more than one. During each round a pla...	The first line contains an integer number n (1<=<=≤<=<=n<=<=≤<=<=1000), n is the number of rounds played. Then follow n lines, containing the information about the rounds in "name score" format in chronological order, where name is a string of lower-case Latin letters with the length from 1 to 32, and score is ...	Print the name of the winner.	[ "3\nmike 3\nandrew 5\nmike 2\n", "3\nandrew 3\nandrew 2\nmike 5\n" ]	[ "andrew\n", "andrew\n" ]	none	0	[ { "input": "3\nmike 3\nandrew 5\nmike 2", "output": "andrew" }, { "input": "3\nandrew 3\nandrew 2\nmike 5", "output": "andrew" }, { "input": "5\nkaxqybeultn -352\nmgochgrmeyieyskhuourfg -910\nkaxqybeultn 691\nmgochgrmeyieyskhuourfg -76\nkaxqybeultn -303", "output": "kaxqybeultn" },...	1,653,335,541	2,147,483,647	Python 3	OK	TESTS	20	92	0	d,r={},[] for _ in ' '*int(input()): x,c=input().split();d[x]=d.get(x,0)+int(c);r+=[(d[x],x)] m=max(d.values()) print([x for v,x in r if d[x]==m and v>=m][0])	Title: Winner Time Limit: 1 seconds Memory Limit: 64 megabytes Problem Description: The winner of the card game popular in Berland "Berlogging" is determined according to the following rules. If at the end of the game there is only one player with the maximum number of points, he is the winner. The situation becomes...	```python d,r={},[] for _ in ' '*int(input()): x,c=input().split();d[x]=d.get(x,0)+int(c);r+=[(d[x],x)] m=max(d.values()) print([x for v,x in r if d[x]==m and v>=m][0]) ```	3.954	MatrixStudio/Codeforces-Python-Submissions
870	C	Maximum splitting	PROGRAMMING	1,300	[ "dp", "greedy", "math", "number theory" ]		null	null	You are given several queries. In the i-th query you are given a single positive integer ni. You are to represent ni as a sum of maximum possible number of composite summands and print this maximum number, or print -1, if there are no such splittings. An integer greater than 1 is composite, if it is not prim...	The first line contains single integer q (1<=≤<=q<=≤<=105) — the number of queries. q lines follow. The (i<=+<=1)-th line contains single integer ni (1<=≤<=ni<=≤<=109) — the i-th query.	For each query print the maximum possible number of summands in a valid splitting to composite summands, or -1, if there are no such splittings.	[ "1\n12\n", "2\n6\n8\n", "3\n1\n2\n3\n" ]	[ "3\n", "1\n2\n", "-1\n-1\n-1\n" ]	12 = 4 + 4 + 4 = 4 + 8 = 6 + 6 = 12, but the first splitting has the maximum possible number of summands. 8 = 4 + 4, 6 can't be split into several composite summands. 1, 2, 3 are less than any composite number, so they do not have valid splittings.	1,500	[ { "input": "1\n12", "output": "3" }, { "input": "2\n6\n8", "output": "1\n2" }, { "input": "3\n1\n2\n3", "output": "-1\n-1\n-1" }, { "input": "6\n1\n2\n3\n5\n7\n11", "output": "-1\n-1\n-1\n-1\n-1\n-1" }, { "input": "3\n4\n6\n9", "output": "1\n1\n1" }, { ...	1,577,167,444	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	4	139	0	for i in range(int(input())): n = int(input()) arr = [1, 2, 3 ,5, 7, 11] if n in arr: print(-1) continue x = n count, r = x//4, x % 4 if r == 0: print(count) else: if count-1 == 0: if 4+r not in arr: print(1) ...	Title: Maximum splitting Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given several queries. In the i-th query you are given a single positive integer ni. You are to represent ni as a sum of maximum possible number of composite summands and print this maximum number, o...	```python for i in range(int(input())): n = int(input()) arr = [1, 2, 3 ,5, 7, 11] if n in arr: print(-1) continue x = n count, r = x//4, x % 4 if r == 0: print(count) else: if count-1 == 0: if 4+r not in arr: p...	0	MatrixStudio/Codeforces-Python-Submissions
509	A	Maximum in Table	PROGRAMMING	800	[ "brute force", "implementation" ]		null	null	An n<=×<=n table a is defined as follows: - The first row and the first column contain ones, that is: ai,<=1<==<=a1,<=i<==<=1 for all i<==<=1,<=2,<=...,<=n. - Each of the remaining numbers in the table is equal to the sum of the number above it and the number to the left of it. In other words, the ...	The only line of input contains a positive integer n (1<=≤<=n<=≤<=10) — the number of rows and columns of the table.	Print a single line containing a positive integer m — the maximum value in the table.	[ "1\n", "5\n" ]	[ "1", "70" ]	In the second test the rows of the table look as follows:	0	[ { "input": "1", "output": "1" }, { "input": "5", "output": "70" }, { "input": "2", "output": "2" }, { "input": "3", "output": "6" }, { "input": "4", "output": "20" }, { "input": "6", "output": "252" }, { "input": "7", "output": "924" ...	1,665,944,782	2,147,483,647	Python 3	OK	TESTS	10	46	4,505,600	n=int(input()) arr=[[0]n]n arr[0]=[1]*n for i in range(n): # 0 1 2 arr[i][0]=1 for row in range(1,n): for column in range(1,n): arr[row][column]=arr[row-1][column]+arr[row][column-1] print(arr[n-1][n-1])	Title: Maximum in Table Time Limit: None seconds Memory Limit: None megabytes Problem Description: An n<=×<=n table a is defined as follows: - The first row and the first column contain ones, that is: ai,<=1<==<=a1,<=i<==<=1 for all i<==<=1,<=2,<=...,<=n. - Each of the remaining numbers in the t...	```python n=int(input()) arr=[[0]n]n arr[0]=[1]*n for i in range(n): # 0 1 2 arr[i][0]=1 for row in range(1,n): for column in range(1,n): arr[row][column]=arr[row-1][column]+arr[row][column-1] print(arr[n-1][n-1]) ```	3	MatrixStudio/Codeforces-Python-Submissions
165	A	Supercentral Point	PROGRAMMING	1,000	[ "implementation" ]		null	null	One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1,<=y1),<=(x2,<=y2),<=...,<=(xn,<=yn). Let's define neighbors for some fixed point from the given set (x,<=y): - point (x',<=y') is (x,<=y)'s right neighbor, if x'<=><=x and y'...	The first input line contains the only integer n (1<=≤<=n<=≤<=200) — the number of points in the given set. Next n lines contain the coordinates of the points written as "x y" (without the quotes) (\|x\|,<=\|y\|<=≤<=1000), all coordinates are integers. The numbers in the line are separated by exactly one spac...	Print the only number — the number of supercentral points of the given set.	[ "8\n1 1\n4 2\n3 1\n1 2\n0 2\n0 1\n1 0\n1 3\n", "5\n0 0\n0 1\n1 0\n0 -1\n-1 0\n" ]	[ "2\n", "1\n" ]	In the first sample the supercentral points are only points (1, 1) and (1, 2). In the second sample there is one supercental point — point (0, 0).	500	[ { "input": "8\n1 1\n4 2\n3 1\n1 2\n0 2\n0 1\n1 0\n1 3", "output": "2" }, { "input": "5\n0 0\n0 1\n1 0\n0 -1\n-1 0", "output": "1" }, { "input": "9\n-565 -752\n-184 723\n-184 -752\n-184 1\n950 723\n-565 723\n950 -752\n950 1\n-565 1", "output": "1" }, { "input": "25\n-651 897\n...	1,633,249,811	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	62	0	n = int(input()) li = [list(map(int,(input().split()))) for i in range(n)] cnt = 0 for i in li: temp = 4*[0] for j in li: if i[0] < j[0] and i[1] == j[1]: temp[1] = 1 if i[0] > j[0] and i[1] == j[1]: temp[1] = 1 if i[0] == j[0] and i[1] > j[1]: temp[2] = 1 if i[0] == j[0...	Title: Supercentral Point Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1,<=y1),<=(x2,<=y2),<=...,<=(xn,<=yn). Let's define neighbors for some fixed point from the give...	```python n = int(input()) li = [list(map(int,(input().split()))) for i in range(n)] cnt = 0 for i in li: temp = 4*[0] for j in li: if i[0] < j[0] and i[1] == j[1]: temp[1] = 1 if i[0] > j[0] and i[1] == j[1]: temp[1] = 1 if i[0] == j[0] and i[1] > j[1]: temp[2] = 1 if i...	0	MatrixStudio/Codeforces-Python-Submissions
255	A	Greg's Workout	PROGRAMMING	800	[ "implementation" ]		null	null	Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was n integers a1,<=a2,<=...,<=an. These numbers mean that Greg needs to do exactly n exercises today. Besides, Greg should repeat the i-th in order exercise ai times. Greg now only does three types of exercise...	The first line contains integer n (1<=≤<=n<=≤<=20). The second line contains n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=25) — the number of times Greg repeats the exercises.	Print word "chest" (without the quotes), if the chest gets the most exercise, "biceps" (without the quotes), if the biceps gets the most exercise and print "back" (without the quotes) if the back gets the most exercise. It is guaranteed that the input is such that the answer to the problem is unambiguous.	[ "2\n2 8\n", "3\n5 1 10\n", "7\n3 3 2 7 9 6 8\n" ]	[ "biceps\n", "back\n", "chest\n" ]	In the first sample Greg does 2 chest, 8 biceps and zero back exercises, so the biceps gets the most exercises. In the second sample Greg does 5 chest, 1 biceps and 10 back exercises, so the back gets the most exercises. In the third sample Greg does 18 chest, 12 biceps and 8 back exercises, so the chest gets the mos...	500	[ { "input": "2\n2 8", "output": "biceps" }, { "input": "3\n5 1 10", "output": "back" }, { "input": "7\n3 3 2 7 9 6 8", "output": "chest" }, { "input": "4\n5 6 6 2", "output": "chest" }, { "input": "5\n8 2 2 6 3", "output": "chest" }, { "input": "6\n8 7 ...	1,645,973,265	2,147,483,647	Python 3	OK	TESTS	61	92	0	n=int(input()) a=list(map(int,input().split())) s_g=[] s_b=[] s_s=[] for i in range(1,n+1): #print(i) 1-7 if i%3==1: s_g.append(a[i-1]) elif i%3==2: s_b.append(a[i-1]) elif i%3==0: s_s.append(a[i-1]) if sum(s_g)>sum(s_b) and sum(s_g)>sum(s_s): print('chest') ...	Title: Greg's Workout Time Limit: None seconds Memory Limit: None megabytes Problem Description: Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was n integers a1,<=a2,<=...,<=an. These numbers mean that Greg needs to do exactly n exercises today. Besides, Greg ...	```python n=int(input()) a=list(map(int,input().split())) s_g=[] s_b=[] s_s=[] for i in range(1,n+1): #print(i) 1-7 if i%3==1: s_g.append(a[i-1]) elif i%3==2: s_b.append(a[i-1]) elif i%3==0: s_s.append(a[i-1]) if sum(s_g)>sum(s_b) and sum(s_g)>sum(s_s): print(...	3	MatrixStudio/Codeforces-Python-Submissions
785	A	Anton and Polyhedrons	PROGRAMMING	800	[ "implementation", "strings" ]		null	null	Anton's favourite geometric figures are regular polyhedrons. Note that there are five kinds of regular polyhedrons: - Tetrahedron. Tetrahedron has 4 triangular faces. - Cube. Cube has 6 square faces. - Octahedron. Octahedron has 8 triangular faces. - Dodecahedron. Dodecahedron has 12 pentagonal faces. - Icosahed...	The first line of the input contains a single integer n (1<=≤<=n<=≤<=200<=000) — the number of polyhedrons in Anton's collection. Each of the following n lines of the input contains a string si — the name of the i-th polyhedron in Anton's collection. The string can look like this: - "Tetrahedron" (withou...	Output one number — the total number of faces in all the polyhedrons in Anton's collection.	[ "4\nIcosahedron\nCube\nTetrahedron\nDodecahedron\n", "3\nDodecahedron\nOctahedron\nOctahedron\n" ]	[ "42\n", "28\n" ]	In the first sample Anton has one icosahedron, one cube, one tetrahedron and one dodecahedron. Icosahedron has 20 faces, cube has 6 faces, tetrahedron has 4 faces and dodecahedron has 12 faces. In total, they have 20 + 6 + 4 + 12 = 42 faces.	500	[ { "input": "4\nIcosahedron\nCube\nTetrahedron\nDodecahedron", "output": "42" }, { "input": "3\nDodecahedron\nOctahedron\nOctahedron", "output": "28" }, { "input": "25\nIcosahedron\nOctahedron\nTetrahedron\nDodecahedron\nCube\nIcosahedron\nOctahedron\nCube\nTetrahedron\nIcosahedron\nIcosa...	1,697,381,294	2,147,483,647	Python 3	OK	TESTS	30	233	0	d={'Tetrahedron':4, 'Cube':6,'Octahedron':8,'Dodecahedron':12,'Icosahedron':20} s="" c=0 for _ in range(int(input())): s=input().rstrip() c+=d[s] print(c)	Title: Anton and Polyhedrons Time Limit: None seconds Memory Limit: None megabytes Problem Description: Anton's favourite geometric figures are regular polyhedrons. Note that there are five kinds of regular polyhedrons: - Tetrahedron. Tetrahedron has 4 triangular faces. - Cube. Cube has 6 square faces. - Octahe...	```python d={'Tetrahedron':4, 'Cube':6,'Octahedron':8,'Dodecahedron':12,'Icosahedron':20} s="" c=0 for _ in range(int(input())): s=input().rstrip() c+=d[s] print(c) ```	3	MatrixStudio/Codeforces-Python-Submissions
688	A	Opponents	PROGRAMMING	800	[ "implementation" ]		null	null	Arya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have some fighting plan that guarantees they will win, but implementing this plan requires presence of them all. That means if one day at least one of Arya's opponents is absent at the school, then Ar...	The first line of the input contains two integers n and d (1<=≤<=n,<=d<=≤<=100) — the number of opponents and the number of days, respectively. The i-th of the following d lines contains a string of length n consisting of characters '0' and '1'. The j-th character of this string is '0' if the j-th op...	Print the only integer — the maximum number of consecutive days that Arya will beat all present opponents.	[ "2 2\n10\n00\n", "4 1\n0100\n", "4 5\n1101\n1111\n0110\n1011\n1111\n" ]	[ "2\n", "1\n", "2\n" ]	In the first and the second samples, Arya will beat all present opponents each of the d days. In the third sample, Arya will beat his opponents on days 1, 3 and 4 and his opponents will beat him on days 2 and 5. Thus, the maximum number of consecutive winning days is 2, which happens on days 3 and 4.	500	[ { "input": "2 2\n10\n00", "output": "2" }, { "input": "4 1\n0100", "output": "1" }, { "input": "4 5\n1101\n1111\n0110\n1011\n1111", "output": "2" }, { "input": "3 2\n110\n110", "output": "2" }, { "input": "10 6\n1111111111\n0100110101\n1111111111\n0000011010\n1111...	1,681,036,839	2,147,483,647	Python 3	OK	TESTS	56	61	0	n, d = map(int, input().split()) ans = 0 consMax = 0 for i in range(d): strTemp = input() setTemp = set(strTemp) if(len(setTemp) == 1 and list(setTemp)[0] == '0'): consMax += 1 elif(len(setTemp) > 1): consMax += 1 else: if(consMax > ans): ans =...	Title: Opponents Time Limit: None seconds Memory Limit: None megabytes Problem Description: Arya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have some fighting plan that guarantees they will win, but implementing this plan requires presence of th...	```python n, d = map(int, input().split()) ans = 0 consMax = 0 for i in range(d): strTemp = input() setTemp = set(strTemp) if(len(setTemp) == 1 and list(setTemp)[0] == '0'): consMax += 1 elif(len(setTemp) > 1): consMax += 1 else: if(consMax > ans): ...	3	MatrixStudio/Codeforces-Python-Submissions
846	A	Curriculum Vitae	PROGRAMMING	1,500	[ "brute force", "implementation" ]		null	null	Hideo Kojima has just quit his job at Konami. Now he is going to find a new place to work. Despite being such a well-known person, he still needs a CV to apply for a job. During all his career Hideo has produced n games. Some of them were successful, some were not. Hideo wants to remove several of them (possibly zer...	The first line contains one integer number n (1<=≤<=n<=≤<=100). The second line contains n space-separated integer numbers s1,<=s2,<=...,<=sn (0<=≤<=si<=≤<=1). 0 corresponds to an unsuccessful game, 1 — to a successful one.	Print one integer — the maximum number of games Hideo can leave in his CV so that no unsuccessful game comes after a successful one.	[ "4\n1 1 0 1\n", "6\n0 1 0 0 1 0\n", "1\n0\n" ]	[ "3\n", "4\n", "1\n" ]	none	0	[ { "input": "4\n1 1 0 1", "output": "3" }, { "input": "6\n0 1 0 0 1 0", "output": "4" }, { "input": "1\n0", "output": "1" }, { "input": "100\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...	1,508,920,930	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	46	0	def main(): n = int(input()) games = [0] games = games + list(map(int, input().split(' '))) result = max([games[:i].count(0) + games[i:].count(1) for i in range(n+1)]) print(result) if __name__ == "__main__": main()	Title: Curriculum Vitae Time Limit: None seconds Memory Limit: None megabytes Problem Description: Hideo Kojima has just quit his job at Konami. Now he is going to find a new place to work. Despite being such a well-known person, he still needs a CV to apply for a job. During all his career Hideo has produced n g...	```python def main(): n = int(input()) games = [0] games = games + list(map(int, input().split(' '))) result = max([games[:i].count(0) + games[i:].count(1) for i in range(n+1)]) print(result) if __name__ == "__main__": main() ```	0	MatrixStudio/Codeforces-Python-Submissions
183	E	Candy Shop	PROGRAMMING	2,900	[ "greedy" ]		null	null	The prestigious Codeforces kindergarten consists of n kids, numbered 1 through n. Each of them are given allowance in rubles by their parents. Today, they are going to the most famous candy shop in the town. The shop sells candies in packages: for all i between 1 and m, inclusive, it sells a package containing...	The first line contains two space-separated integers n and m (2<=≤<=n<=≤<=2·105,<=2<=≤<=m<=≤<=5·106,<=n<=≤<=m), denoting the number of kids and the maximum number of candies in a package sold by the candy shop, respectively. Then n lines follow, each line will contain a single positive integer not exceed...	Print a single integer denoting the maximum number of candies that can be sold by the candy shop.	[ "2 5\n5\n10\n", "3 8\n8\n16\n13\n", "2 5000000\n12500002500000\n12500002500000\n" ]	[ "13\n", "32\n", "12500002500000\n" ]	For the first example, one of the scenarios that will result in 13 purchased candies is as follows. - Turn 1. Kid 1 purchases 1 candy. - Turn 2. Kid 2 purchases 3 candies. - Turn 3. Kid 1 purchases 4 candies. - Turn 4. Kid 2 purchases 5 candies.	2,500	[]	1,689,256,646	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	0	92	0	print("_RANDOM_GUESS_1689256645.9313679")# 1689256645.9314098	Title: Candy Shop Time Limit: None seconds Memory Limit: None megabytes Problem Description: The prestigious Codeforces kindergarten consists of n kids, numbered 1 through n. Each of them are given allowance in rubles by their parents. Today, they are going to the most famous candy shop in the town. The shop se...	```python print("_RANDOM_GUESS_1689256645.9313679")# 1689256645.9314098 ```	0	MatrixStudio/Codeforces-Python-Submissions
520	A	Pangram	PROGRAMMING	800	[ "implementation", "strings" ]		null	null	A word or a sentence in some language is called a pangram if all the characters of the alphabet of this language appear in it at least once. Pangrams are often used to demonstrate fonts in printing or test the output devices. You are given a string consisting of lowercase and uppercase Latin letters. Check whether thi...	The first line contains a single integer n (1<=≤<=n<=≤<=100) — the number of characters in the string. The second line contains the string. The string consists only of uppercase and lowercase Latin letters.	Output "YES", if the string is a pangram and "NO" otherwise.	[ "12\ntoosmallword\n", "35\nTheQuickBrownFoxJumpsOverTheLazyDog\n" ]	[ "NO\n", "YES\n" ]	none	500	[ { "input": "12\ntoosmallword", "output": "NO" }, { "input": "35\nTheQuickBrownFoxJumpsOverTheLazyDog", "output": "YES" }, { "input": "1\na", "output": "NO" }, { "input": "26\nqwertyuiopasdfghjklzxcvbnm", "output": "YES" }, { "input": "26\nABCDEFGHIJKLMNOPQRSTUVWXY...	1,699,519,544	2,147,483,647	Python 3	OK	TESTS	59	46	921,600	import string import sys n = int(sys.stdin.readline().split()[0]) str_char = list(sys.stdin.readline()[:-1].lower()) str_char.sort() if ''.join(dict.fromkeys(str_char)) == string.ascii_lowercase: print('YES') else: print('NO')	Title: Pangram Time Limit: None seconds Memory Limit: None megabytes Problem Description: A word or a sentence in some language is called a pangram if all the characters of the alphabet of this language appear in it at least once. Pangrams are often used to demonstrate fonts in printing or test the output devices. ...	```python import string import sys n = int(sys.stdin.readline().split()[0]) str_char = list(sys.stdin.readline()[:-1].lower()) str_char.sort() if ''.join(dict.fromkeys(str_char)) == string.ascii_lowercase: print('YES') else: print('NO') ```	3	MatrixStudio/Codeforces-Python-Submissions
343	A	Rational Resistance	PROGRAMMING	1,600	[ "math", "number theory" ]		null	null	Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value. However, all Mike has is lots of identical resistors with unit resistance R0<==<=1. Elements with other resistance can be constructed from these resistors. In this problem, we wil...	The single input line contains two space-separated integers a and b (1<=≤<=a,<=b<=≤<=1018). It is guaranteed that the fraction is irreducible. It is guaranteed that a solution always exists.	Print a single number — the answer to the problem. Please do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.	[ "1 1\n", "3 2\n", "199 200\n" ]	[ "1\n", "3\n", "200\n" ]	In the first sample, one resistor is enough. In the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/5305da389756aab6...	500	[ { "input": "1 1", "output": "1" }, { "input": "3 2", "output": "3" }, { "input": "199 200", "output": "200" }, { "input": "1 1000000000000000000", "output": "1000000000000000000" }, { "input": "3 1", "output": "3" }, { "input": "21 8", "output": "7...	1,600,628,011	2,147,483,647	PyPy 3	OK	TESTS	53	280	0	from sys import stdin input = stdin.readline a, b = map(int, input().split()) ans = a // b while a%b != 0: a, b = b, a%b ans += a // b print(ans)	Title: Rational Resistance Time Limit: None seconds Memory Limit: None megabytes Problem Description: Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value. However, all Mike has is lots of identical resistors with unit resistance *R...	```python from sys import stdin input = stdin.readline a, b = map(int, input().split()) ans = a // b while a%b != 0: a, b = b, a%b ans += a // b print(ans) ```	3	MatrixStudio/Codeforces-Python-Submissions
987	A	Infinity Gauntlet	PROGRAMMING	800	[ "implementation" ]		null	null	You took a peek on Thanos wearing Infinity Gauntlet. In the Gauntlet there is a place for six Infinity Gems: - the Power Gem of purple color, - the Time Gem of green color, - the Space Gem of blue color, - the Soul Gem of orange color, - the Reality Gem of red color, - the Mind Gem of yellow color. Using colors...	In the first line of input there is one integer $n$ ($0 \le n \le 6$) — the number of Gems in Infinity Gauntlet. In next $n$ lines there are colors of Gems you saw. Words used for colors are: purple, green, blue, orange, red, yellow. It is guaranteed that all the colors are distinct. All colors are given in lowercase ...	In the first line output one integer $m$ ($0 \le m \le 6$) — the number of absent Gems. Then in $m$ lines print the names of absent Gems, each on its own line. Words used for names are: Power, Time, Space, Soul, Reality, Mind. Names can be printed in any order. Keep the first letter uppercase, others lowercase.	[ "4\nred\npurple\nyellow\norange\n", "0\n" ]	[ "2\nSpace\nTime\n", "6\nTime\nMind\nSoul\nPower\nReality\nSpace\n" ]	In the first sample Thanos already has Reality, Power, Mind and Soul Gems, so he needs two more: Time and Space. In the second sample Thanos doesn't have any Gems, so he needs all six.	500	[ { "input": "4\nred\npurple\nyellow\norange", "output": "2\nSpace\nTime" }, { "input": "0", "output": "6\nMind\nSpace\nPower\nTime\nReality\nSoul" }, { "input": "6\npurple\nblue\nyellow\nred\ngreen\norange", "output": "0" }, { "input": "1\npurple", "output": "5\nTime\nReal...	1,618,712,511	2,147,483,647	Python 3	OK	TESTS	64	62	307,200	gems = ["purple", "red", "yellow", "orange", "blue", "green"] n = int(input()) for i in range(n): color = input() gems.remove(color) print(len(gems)) for i in range(len(gems)): if gems[i] == "red": print("Reality") elif gems[i] == "blue": print("Space") elif gems[i] == "purple": ...	Title: Infinity Gauntlet Time Limit: None seconds Memory Limit: None megabytes Problem Description: You took a peek on Thanos wearing Infinity Gauntlet. In the Gauntlet there is a place for six Infinity Gems: - the Power Gem of purple color, - the Time Gem of green color, - the Space Gem of blue color, - the So...	```python gems = ["purple", "red", "yellow", "orange", "blue", "green"] n = int(input()) for i in range(n): color = input() gems.remove(color) print(len(gems)) for i in range(len(gems)): if gems[i] == "red": print("Reality") elif gems[i] == "blue": print("Space") elif gems[i] == ...	3	MatrixStudio/Codeforces-Python-Submissions
279	B	Books	PROGRAMMING	1,400	[ "binary search", "brute force", "implementation", "two pointers" ]		null	null	When Valera has got some free time, he goes to the library to read some books. Today he's got t free minutes to read. That's why Valera took n books in the library and for each book he estimated the time he is going to need to read it. Let's number the books by integers from 1 to n. Valera needs ai minutes to...	The first line contains two integers n and t (1<=≤<=n<=≤<=105; 1<=≤<=t<=≤<=109) — the number of books and the number of free minutes Valera's got. The second line contains a sequence of n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=104), where number ai shows the number of minutes that the boy n...	Print a single integer — the maximum number of books Valera can read.	[ "4 5\n3 1 2 1\n", "3 3\n2 2 3\n" ]	[ "3\n", "1\n" ]	none	1,000	[ { "input": "4 5\n3 1 2 1", "output": "3" }, { "input": "3 3\n2 2 3", "output": "1" }, { "input": "1 3\n5", "output": "0" }, { "input": "1 10\n4", "output": "1" }, { "input": "2 10\n6 4", "output": "2" }, { "input": "6 10\n2 3 4 2 1 1", "output": "4...	1,673,614,845	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	8	154	9,830,400	n,t=[int(i) for i in input().split()] a=[int(i1) for i1 in input().split()] if n==1: if a[0]<=t: print(1) else : print(0) else : s=sum(a) if s<=t: print(n) else : if a[0]>a[-1]: j=0 else : j=-1 cnt=0 whi...	Title: Books Time Limit: None seconds Memory Limit: None megabytes Problem Description: When Valera has got some free time, he goes to the library to read some books. Today he's got t free minutes to read. That's why Valera took n books in the library and for each book he estimated the time he is going to need t...	```python n,t=[int(i) for i in input().split()] a=[int(i1) for i1 in input().split()] if n==1: if a[0]<=t: print(1) else : print(0) else : s=sum(a) if s<=t: print(n) else : if a[0]>a[-1]: j=0 else : j=-1 cnt=0 ...	0	MatrixStudio/Codeforces-Python-Submissions
12	B	Correct Solution?	PROGRAMMING	1,100	[ "implementation", "sortings" ]	B. Correct Solution?	2	256	One cold winter evening Alice and her older brother Bob was sitting at home near the fireplace and giving each other interesting problems to solve. When it was Alice's turn, she told the number n to Bob and said: —Shuffle the digits in this number in order to obtain the smallest possible number without leading zeroe...	The first line contains one integer n (0<=≤<=n<=≤<=109) without leading zeroes. The second lines contains one integer m (0<=≤<=m<=≤<=109) — Bob's answer, possibly with leading zeroes.	Print OK if Bob's answer is correct and WRONG_ANSWER otherwise.	[ "3310\n1033\n", "4\n5\n" ]	[ "OK\n", "WRONG_ANSWER\n" ]	none	0	[ { "input": "3310\n1033", "output": "OK" }, { "input": "4\n5", "output": "WRONG_ANSWER" }, { "input": "40\n04", "output": "WRONG_ANSWER" }, { "input": "12\n12", "output": "OK" }, { "input": "432\n234", "output": "OK" }, { "input": "17109\n01179", "o...	1,541,730,669	3,309	Python 3	WRONG_ANSWER	TESTS	0	216	0	n = input() m = input() mzeros = 0 for i in range(0,len(m)): if m[i] != '0': mzeros = i break m = m[mzeros:] ndigits = [] for i in n: ndigits.append(i) snd = sorted(ndigits) numberofzeros = 0 for i in range(0,len(snd)): if snd[i] != '0': numberofzeros = i br...	Title: Correct Solution? Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: One cold winter evening Alice and her older brother Bob was sitting at home near the fireplace and giving each other interesting problems to solve. When it was Alice's turn, she told the number n to Bob and said: —Shuf...	```python n = input() m = input() mzeros = 0 for i in range(0,len(m)): if m[i] != '0': mzeros = i break m = m[mzeros:] ndigits = [] for i in n: ndigits.append(i) snd = sorted(ndigits) numberofzeros = 0 for i in range(0,len(snd)): if snd[i] != '0': numberofzeros = i ...	0	MatrixStudio/Codeforces-Python-Submissions
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,685,192,877	2,147,483,647	Python 3	OK	TESTS	39	92	0	n = int(input()) l = list(map(int,input().split())) b = l.index(max(l)) + l[::-1].index(min(l)) print( b - (b>=n) )	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()) l = list(map(int,input().split())) b = l.index(max(l)) + l[::-1].index(min(l)) print( b - (b>=n) ) ```	3	MatrixStudio/Codeforces-Python-Submissions
533	E	Correcting Mistakes	PROGRAMMING	1,800	[ "constructive algorithms", "dp", "greedy", "hashing", "strings", "two pointers" ]		null	null	Analyzing the mistakes people make while typing search queries is a complex and an interesting work. As there is no guaranteed way to determine what the user originally meant by typing some query, we have to use different sorts of heuristics. Polycarp needed to write a code that could, given two words, check whether t...	The first line contains integer n (1<=≤<=n<=≤<=100<=000) — the length of words S and T. The second line contains word S. The third line contains word T. Words S and T consist of lowercase English letters. It is guaranteed that S and T are distinct words.	Print a single integer — the number of distinct words W that can be transformed to S and T due to a typo.	[ "7\nreading\ntrading\n", "5\nsweet\nsheep\n", "3\ntoy\ntry\n" ]	[ "1\n", "0\n", "2\n" ]	In the first sample test the two given words could be obtained only from word "treading" (the deleted letters are marked in bold). In the second sample test the two given words couldn't be obtained from the same word by removing one letter. In the third sample test the two given words could be obtained from either wo...	500	[ { "input": "7\nreading\ntrading", "output": "1" }, { "input": "5\nsweet\nsheep", "output": "0" }, { "input": "3\ntoy\ntry", "output": "2" }, { "input": "5\nspare\nspars", "output": "2" }, { "input": "1\na\nb", "output": "2" }, { "input": "1\nz\ny", ...	1,681,156,352	2,147,483,647	PyPy 3	OK	TESTS	89	93	2,560,000	n = int(input()) s1 = input() s2 = input() front = 0 rear = n-1 while s1[front]==s2[front]: front += 1 while s1[rear]==s2[rear]: rear -= 1 ans = 0 if s1[front+1:rear+1]==s2[front:rear]: ans += 1 if s1[front:rear]==s2[front+1:rear+1]: ans += 1 print(ans)	Title: Correcting Mistakes Time Limit: None seconds Memory Limit: None megabytes Problem Description: Analyzing the mistakes people make while typing search queries is a complex and an interesting work. As there is no guaranteed way to determine what the user originally meant by typing some query, we have to use dif...	```python n = int(input()) s1 = input() s2 = input() front = 0 rear = n-1 while s1[front]==s2[front]: front += 1 while s1[rear]==s2[rear]: rear -= 1 ans = 0 if s1[front+1:rear+1]==s2[front:rear]: ans += 1 if s1[front:rear]==s2[front+1:rear+1]: ans += 1 print(ans) ```	3	MatrixStudio/Codeforces-Python-Submissions
248	A	Cupboards	PROGRAMMING	800	[ "implementation" ]		null	null	One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any longer, so he decided to get some food in the house. Karlsson's gaze immediately fell on n woode...	The first input line contains a single integer n — the number of cupboards in the kitchen (2<=≤<=n<=≤<=104). Then follow n lines, each containing two integers li and ri (0<=≤<=li,<=ri<=≤<=1). Number li equals one, if the left door of the i-th cupboard is opened, otherwise number li equal...	In the only output line print a single integer t — the minimum number of seconds Karlsson needs to change the doors of all cupboards to the position he needs.	[ "5\n0 1\n1 0\n0 1\n1 1\n0 1\n" ]	[ "3\n" ]	none	500	[ { "input": "5\n0 1\n1 0\n0 1\n1 1\n0 1", "output": "3" }, { "input": "2\n0 0\n0 0", "output": "0" }, { "input": "3\n0 1\n1 1\n1 1", "output": "1" }, { "input": "8\n0 1\n1 0\n0 1\n1 1\n0 1\n1 0\n0 1\n1 0", "output": "7" }, { "input": "8\n1 0\n1 0\n1 0\n0 1\n0 1\n1 ...	1,661,444,766	2,147,483,647	Python 3	OK	TESTS	57	124	0	N = int(input()) suma_x, suma_y = 0,0 for _ in range(N): x,y = map(int, input().split()) suma_x +=x suma_y +=y print(min(suma_x,N-suma_x)+min(suma_y,N-suma_y))	Title: Cupboards Time Limit: None seconds Memory Limit: None megabytes Problem Description: One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any long...	```python N = int(input()) suma_x, suma_y = 0,0 for _ in range(N): x,y = map(int, input().split()) suma_x +=x suma_y +=y print(min(suma_x,N-suma_x)+min(suma_y,N-suma_y)) ```	3	MatrixStudio/Codeforces-Python-Submissions
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,642,804,794	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	20	46	0	a=int(input()) f=True for i in range(a): f=True if (f and ((b:=input())[i]==b[-i-1] and b.count(b[i])==2 and b.count(b[a//2])==a-2) or (i==a//2 and b.count(b[i])==1) and b.count(b[0])==a-1) else False print("YES" if f else "NO")	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 a=int(input()) f=True for i in range(a): f=True if (f and ((b:=input())[i]==b[-i-1] and b.count(b[i])==2 and b.count(b[a//2])==a-2) or (i==a//2 and b.count(b[i])==1) and b.count(b[0])==a-1) else False print("YES" if f else "NO") ```	0	MatrixStudio/Codeforces-Python-Submissions
667	A	Pouring Rain	PROGRAMMING	1,100	[ "geometry", "math" ]		null	null	A lot of people in Berland hates rain, but you do not. Rain pacifies, puts your thoughts in order. By these years you have developed a good tradition — when it rains, you go on the street and stay silent for a moment, contemplate all around you, enjoy freshness, think about big deeds you have to do. Today everything ...	The only line of the input contains four integer numbers d,<=h,<=v,<=e (1<=≤<=d,<=h,<=v,<=e<=≤<=104), where: - d — the diameter of your cylindrical cup, - h — the initial level of water in the cup, - v — the speed of drinking process from the cup in milliliters per second, - e — the growth ...	If it is impossible to make the cup empty, print "NO" (without quotes). Otherwise print "YES" (without quotes) in the first line. In the second line print a real number — time in seconds needed the cup will be empty. The answer will be considered correct if its relative or absolute error doesn't exceed 10<=-<=4. It is...	[ "1 2 3 100\n", "1 1 1 1\n" ]	[ "NO\n", "YES\n3.659792366325\n" ]	In the first example the water fills the cup faster than you can drink from it. In the second example area of the cup's bottom equals to <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/419dc74dcd7bc392019c9fe748fe1fdb08ab521a.png" style="max-width: 100.0%;max-height: 100.0%;"/>, thus we ca...	500	[ { "input": "1 2 3 100", "output": "NO" }, { "input": "1 1 1 1", "output": "YES\n3.659792366325" }, { "input": "48 7946 7992 72", "output": "NO" }, { "input": "72 6791 8546 46", "output": "NO" }, { "input": "100 5635 9099 23", "output": "NO" }, { "input...	1,461,948,312	612	Python 3	WRONG_ANSWER	PRETESTS	1	46	4,608,000	import math [d, h, v, e] = [int(x) for x in input().split()] p = math.pi if v <= p(d/2)(d/2)e: print("NO") else: x = v/(p(d/2)*(d/2))-e time = h/x print(time)	Title: Pouring Rain Time Limit: None seconds Memory Limit: None megabytes Problem Description: A lot of people in Berland hates rain, but you do not. Rain pacifies, puts your thoughts in order. By these years you have developed a good tradition — when it rains, you go on the street and stay silent for a moment, cont...	```python import math [d, h, v, e] = [int(x) for x in input().split()] p = math.pi if v <= p(d/2)(d/2)e: print("NO") else: x = v/(p(d/2)*(d/2))-e time = h/x print(time) ```	0	MatrixStudio/Codeforces-Python-Submissions
260	A	Adding Digits	PROGRAMMING	1,400	[ "implementation", "math" ]		null	null	Vasya has got two number: a and b. However, Vasya finds number a too short. So he decided to repeat the operation of lengthening number a n times. One operation of lengthening a number means adding exactly one digit to the number (in the decimal notation) to the right provided that the resulting number is di...	The first line contains three integers: a,<=b,<=n (1<=≤<=a,<=b,<=n<=≤<=105).	In a single line print the integer without leading zeros, which Vasya can get when he applies the lengthening operations to number a n times. If no such number exists, then print number -1. If there are multiple possible answers, print any of them.	[ "5 4 5\n", "12 11 1\n", "260 150 10\n" ]	[ "524848\n", "121\n", "-1\n" ]	none	500	[ { "input": "5 4 5", "output": "524848" }, { "input": "12 11 1", "output": "121" }, { "input": "260 150 10", "output": "-1" }, { "input": "78843 5684 42717", "output": "-1" }, { "input": "93248 91435 1133", "output": "-1" }, { "input": "100000 10 64479"...	1,683,220,578	2,147,483,647	PyPy 3	TIME_LIMIT_EXCEEDED	TESTS	5	2,000	9,011,200	import sys input = sys.stdin.readline a, b, n = map(int, input().split()) a = str(a) k =a for i in range(n): for j in range(10): if int(a+str(j)) % b == 0: a+=str(j) break print(a if k!=a else -1)	Title: Adding Digits Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya has got two number: a and b. However, Vasya finds number a too short. So he decided to repeat the operation of lengthening number a n times. One operation of lengthening a number means adding exactly one ...	```python import sys input = sys.stdin.readline a, b, n = map(int, input().split()) a = str(a) k =a for i in range(n): for j in range(10): if int(a+str(j)) % b == 0: a+=str(j) break print(a if k!=a else -1) ```	0	MatrixStudio/Codeforces-Python-Submissions
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,694,797,191	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	15	0	scores = { 'm': 0, 'c': 0 } def win_lose(): n = int(input()) for i in range(n): m, c = map(int, input().split()) if m > c: scores['m'] +=1 if c > m: scores['c'] +=1 print(scores) if scores['m'] > scores['c']: return 'Mishka...	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 scores = { 'm': 0, 'c': 0 } def win_lose(): n = int(input()) for i in range(n): m, c = map(int, input().split()) if m > c: scores['m'] +=1 if c > m: scores['c'] +=1 print(scores) if scores['m'] > scores['c']: retu...	0	MatrixStudio/Codeforces-Python-Submissions
368	B	Sereja and Suffixes	PROGRAMMING	1,100	[ "data structures", "dp" ]		null	null	Sereja has an array a, consisting of n integers a1, a2, ..., an. The boy cannot sit and do nothing, he decided to study an array. Sereja took a piece of paper and wrote out m integers l1,<=l2,<=...,<=lm (1<=≤<=li<=≤<=n). For each number li he wants to know how many distinct numbers are s...	The first line contains two integers n and m (1<=≤<=n,<=m<=≤<=105). The second line contains n integers a1, a2, ..., an (1<=≤<=ai<=≤<=105) — the array elements. Next m lines contain integers l1,<=l2,<=...,<=lm. The i-th line contains integer li (1<=≤<=li<=≤<=n).	Print m lines — on the i-th line print the answer to the number li.	[ "10 10\n1 2 3 4 1 2 3 4 100000 99999\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n" ]	[ "6\n6\n6\n6\n6\n5\n4\n3\n2\n1\n" ]	none	1,000	[ { "input": "10 10\n1 2 3 4 1 2 3 4 100000 99999\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10", "output": "6\n6\n6\n6\n6\n5\n4\n3\n2\n1" }, { "input": "8 3\n8 6 4 3 4 2 4 8\n6\n4\n2", "output": "3\n4\n5" }, { "input": "7 10\n1 3 8 6 2 2 7\n4\n2\n6\n3\n4\n4\n6\n2\n7\n4", "output": "3\n5\n2\n4\n3\n3\...	1,675,318,597	2,147,483,647	PyPy 3	OK	TESTS	30	171	11,571,200	import sys,io,os input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline inp = lambda : list(map(int,input().split())) n,m = inp() lis = inp() prev = [0]*(n+1) check = {} for i in range(n): if lis[n-i-1] not in check: check[lis[n-i-1]]=1 prev[(n)-(i+1)]+=prev[(n)-i]+1 else: ...	Title: Sereja and Suffixes Time Limit: None seconds Memory Limit: None megabytes Problem Description: Sereja has an array a, consisting of n integers a1, a2, ..., an. The boy cannot sit and do nothing, he decided to study an array. Sereja took a piece of paper and wrote out m integers l1,<=l2,<=......	```python import sys,io,os input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline inp = lambda : list(map(int,input().split())) n,m = inp() lis = inp() prev = [0]*(n+1) check = {} for i in range(n): if lis[n-i-1] not in check: check[lis[n-i-1]]=1 prev[(n)-(i+1)]+=prev[(n)-i]+1 ...	3	MatrixStudio/Codeforces-Python-Submissions
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,694,508,438	2,147,483,647	Python 3	OK	TESTS	39	92	0	n=int(input()) a=list(map(int,input().split())) ma=0 mi=0 for i in range(1,n): if a[ma]<a[i]: ma=i if a[mi]>=a[i]: mi=i if ma>mi: mi+=1 print(ma+((n-1)-mi))	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()) a=list(map(int,input().split())) ma=0 mi=0 for i in range(1,n): if a[ma]<a[i]: ma=i if a[mi]>=a[i]: mi=i if ma>mi: mi+=1 print(ma+((n-1)-mi)) ```	3	MatrixStudio/Codeforces-Python-Submissions
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,688,972,521	2,147,483,647	Python 3	COMPILATION_ERROR	TESTS	0	0	0	x=int(input()) l=list(map(int,input().split()) s=0 c=0 l.sort() for i in range(1,x+1): s=s+l[-1] l.remove(l[-1]) c=c+1 if s>sum(l) break print(c)	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 x=int(input()) l=list(map(int,input().split()) s=0 c=0 l.sort() for i in range(1,x+1): s=s+l[-1] l.remove(l[-1]) c=c+1 if s>sum(l) break print(c) ```	-1	MatrixStudio/Codeforces-Python-Submissions
344	A	Magnets	PROGRAMMING	800	[ "implementation" ]		null	null	Mad scientist Mike entertains himself by arranging rows of dominoes. He doesn't need dominoes, though: he uses rectangular magnets instead. Each magnet has two poles, positive (a "plus") and negative (a "minus"). If two magnets are put together at a close distance, then the like poles will repel each other and the oppo...	The first line of the input contains an integer n (1<=≤<=n<=≤<=100000) — the number of magnets. Then n lines follow. The i-th line (1<=≤<=i<=≤<=n) contains either characters "01", if Mike put the i-th magnet in the "plus-minus" position, or characters "10", if Mike put the magnet in the "minus-plus" posit...	On the single line of the output print the number of groups of magnets.	[ "6\n10\n10\n10\n01\n10\n10\n", "4\n01\n01\n10\n10\n" ]	[ "3\n", "2\n" ]	The first testcase corresponds to the figure. The testcase has three groups consisting of three, one and two magnets. The second testcase has two groups, each consisting of two magnets.	500	[ { "input": "6\n10\n10\n10\n01\n10\n10", "output": "3" }, { "input": "4\n01\n01\n10\n10", "output": "2" }, { "input": "1\n10", "output": "1" }, { "input": "2\n01\n10", "output": "2" }, { "input": "2\n10\n10", "output": "1" }, { "input": "3\n10\n01\n10",...	1,697,193,740	2,147,483,647	Python 3	OK	TESTS	31	310	2,662,400	n=int(input()) a=[] c=0 for i in range(n): k=int(input()) a.append(k) for i in range(1,len(a)): if a[i]!=a[i-1]: c+=1 print(c+1)	Title: Magnets Time Limit: None seconds Memory Limit: None megabytes Problem Description: Mad scientist Mike entertains himself by arranging rows of dominoes. He doesn't need dominoes, though: he uses rectangular magnets instead. Each magnet has two poles, positive (a "plus") and negative (a "minus"). If two magnets...	```python n=int(input()) a=[] c=0 for i in range(n): k=int(input()) a.append(k) for i in range(1,len(a)): if a[i]!=a[i-1]: c+=1 print(c+1) ```	3	MatrixStudio/Codeforces-Python-Submissions
864	B	Polycarp and Letters	PROGRAMMING	1,000	[ "brute force", "implementation", "strings" ]		null	null	Polycarp loves lowercase letters and dislikes uppercase ones. Once he got a string s consisting only of lowercase and uppercase Latin letters. Let A be a set of positions in the string. Let's call it pretty if following conditions are met: - letters on positions from A in the string are all distinct and lowerc...	The first line contains a single integer n (1<=≤<=n<=≤<=200) — length of string s. The second line contains a string s consisting of lowercase and uppercase Latin letters.	Print maximum number of elements in pretty set of positions for string s.	[ "11\naaaaBaabAbA\n", "12\nzACaAbbaazzC\n", "3\nABC\n" ]	[ "2\n", "3\n", "0\n" ]	In the first example the desired positions might be 6 and 8 or 7 and 8. Positions 6 and 7 contain letters 'a', position 8 contains letter 'b'. The pair of positions 1 and 8 is not suitable because there is an uppercase letter 'B' between these position. In the second example desired positions can be 7, 8 and 11. There...	1,000	[ { "input": "11\naaaaBaabAbA", "output": "2" }, { "input": "12\nzACaAbbaazzC", "output": "3" }, { "input": "3\nABC", "output": "0" }, { "input": "1\na", "output": "1" }, { "input": "2\naz", "output": "2" }, { "input": "200\nXbTJZqcbpYuZQEoUrbxlPXAPCtVLr...	1,673,673,698	2,147,483,647	PyPy 3-64	OK	TESTS	55	93	2,867,200	import re input() try: print(len(set(max(re.finditer(r'[a-z]+',input()),key=lambda x: len(set(x.group(0)))).group(0)))) except: print(0)	Title: Polycarp and Letters Time Limit: None seconds Memory Limit: None megabytes Problem Description: Polycarp loves lowercase letters and dislikes uppercase ones. Once he got a string s consisting only of lowercase and uppercase Latin letters. Let A be a set of positions in the string. Let's call it pretty if...	```python import re input() try: print(len(set(max(re.finditer(r'[a-z]+',input()),key=lambda x: len(set(x.group(0)))).group(0)))) except: print(0) ```	3	MatrixStudio/Codeforces-Python-Submissions
52	A	123-sequence	PROGRAMMING	900	[ "implementation" ]	A. 123-sequence	2	256	There is a given sequence of integers a1,<=a2,<=...,<=an, where every number is from 1 to 3 inclusively. You have to replace the minimum number of numbers in it so that all the numbers in the sequence are equal to each other.	The first line contains an integer n (1<=≤<=n<=≤<=106). The second line contains a sequence of integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=3).	Print the minimum number of replacements needed to be performed to make all the numbers in the sequence equal.	[ "9\n1 3 2 2 2 1 1 2 3\n" ]	[ "5\n" ]	In the example all the numbers equal to 1 and 3 should be replaced by 2.	500	[ { "input": "9\n1 3 2 2 2 1 1 2 3", "output": "5" }, { "input": "6\n3 3 2 2 1 3", "output": "3" }, { "input": "12\n3 1 3 1 2 1 3 2 2 1 2 1", "output": "7" }, { "input": "15\n3 2 1 1 1 1 3 2 2 3 3 1 2 3 2", "output": "10" }, { "input": "2\n2 1", "output": "1" ...	1,684,344,896	2,147,483,647	Python 3	OK	TESTS	23	248	19,251,200	n=int(input()) l=input().split() c1=l.count("1") c2=l.count("2") c3=l.count("3") print(c1+c2+c3-max(c1,c2,c3))	Title: 123-sequence Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: There is a given sequence of integers a1,<=a2,<=...,<=an, where every number is from 1 to 3 inclusively. You have to replace the minimum number of numbers in it so that all the numbers in the sequence are equal to each...	```python n=int(input()) l=input().split() c1=l.count("1") c2=l.count("2") c3=l.count("3") print(c1+c2+c3-max(c1,c2,c3)) ```	3.902142	MatrixStudio/Codeforces-Python-Submissions
436	A	Feed with Candy	PROGRAMMING	1,500	[ "greedy" ]		null	null	The hero of the Cut the Rope game is a little monster named Om Nom. He loves candies. And what a coincidence! He also is the hero of today's problem. One day, Om Nom visited his friend Evan. Evan has n candies of two types (fruit drops and caramel drops), the i-th candy hangs at the height of hi centimeters ab...	The first line contains two integers, n and x (1<=≤<=n,<=x<=≤<=2000) — the number of sweets Evan has and the initial height of Om Nom's jump. Each of the following n lines contains three integers ti,<=hi,<=mi (0<=≤<=ti<=≤<=1; 1<=≤<=hi,<=mi<=≤<=2000) — the type, height and the mass of...	Print a single integer — the maximum number of candies Om Nom can eat.	[ "5 3\n0 2 4\n1 3 1\n0 8 3\n0 20 10\n1 5 5\n" ]	[ "4\n" ]	One of the possible ways to eat 4 candies is to eat them in the order: 1, 5, 3, 2. Let's assume the following scenario: 1. Initially, the height of Om Nom's jump equals 3. He can reach candies 1 and 2. Let's assume that he eats candy 1. As the mass of this candy equals 4, the height of his jump will rise to 3 + 4 = 7...	1,000	[ { "input": "5 3\n0 2 4\n1 3 1\n0 8 3\n0 20 10\n1 5 5", "output": "4" }, { "input": "5 2\n1 15 2\n1 11 2\n0 17 2\n0 16 1\n1 18 2", "output": "0" }, { "input": "6 2\n1 17 3\n1 6 1\n0 4 2\n1 10 1\n1 7 3\n1 5 1", "output": "0" }, { "input": "7 2\n1 14 1\n1 9 2\n0 6 3\n0 20 2\n0 4...	1,402,694,976	2,147,483,647	Python 3	OK	TESTS	60	109	0	from bisect import bisect_left n, x = map(int, input().split()) s, a, b = 0, [[], []], [[], []] for i in range(n): t, h, m = map(int, input().split()) a[t].append((h, m)) for t in [0, 1]: a[t].sort(key = lambda x: x[0]) for h, m in a[t]: if h > x: break b[t].append(m) b[t]...	Title: Feed with Candy Time Limit: None seconds Memory Limit: None megabytes Problem Description: The hero of the Cut the Rope game is a little monster named Om Nom. He loves candies. And what a coincidence! He also is the hero of today's problem. One day, Om Nom visited his friend Evan. Evan has n candies of two...	```python from bisect import bisect_left n, x = map(int, input().split()) s, a, b = 0, [[], []], [[], []] for i in range(n): t, h, m = map(int, input().split()) a[t].append((h, m)) for t in [0, 1]: a[t].sort(key = lambda x: x[0]) for h, m in a[t]: if h > x: break b[t].append(m)...	3	MatrixStudio/Codeforces-Python-Submissions
688	A	Opponents	PROGRAMMING	800	[ "implementation" ]		null	null	Arya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have some fighting plan that guarantees they will win, but implementing this plan requires presence of them all. That means if one day at least one of Arya's opponents is absent at the school, then Ar...	The first line of the input contains two integers n and d (1<=≤<=n,<=d<=≤<=100) — the number of opponents and the number of days, respectively. The i-th of the following d lines contains a string of length n consisting of characters '0' and '1'. The j-th character of this string is '0' if the j-th op...	Print the only integer — the maximum number of consecutive days that Arya will beat all present opponents.	[ "2 2\n10\n00\n", "4 1\n0100\n", "4 5\n1101\n1111\n0110\n1011\n1111\n" ]	[ "2\n", "1\n", "2\n" ]	In the first and the second samples, Arya will beat all present opponents each of the d days. In the third sample, Arya will beat his opponents on days 1, 3 and 4 and his opponents will beat him on days 2 and 5. Thus, the maximum number of consecutive winning days is 2, which happens on days 3 and 4.	500	[ { "input": "2 2\n10\n00", "output": "2" }, { "input": "4 1\n0100", "output": "1" }, { "input": "4 5\n1101\n1111\n0110\n1011\n1111", "output": "2" }, { "input": "3 2\n110\n110", "output": "2" }, { "input": "10 6\n1111111111\n0100110101\n1111111111\n0000011010\n1111...	1,674,375,312	2,147,483,647	PyPy 3-64	OK	TESTS	56	77	0	n,d = map(int,input().split()) cur=0 m=0 for _ in range(d): s=input() if "0" in s: cur+=1 if cur>m:m=cur else:cur=0 print(m)	Title: Opponents Time Limit: None seconds Memory Limit: None megabytes Problem Description: Arya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have some fighting plan that guarantees they will win, but implementing this plan requires presence of th...	```python n,d = map(int,input().split()) cur=0 m=0 for _ in range(d): s=input() if "0" in s: cur+=1 if cur>m:m=cur else:cur=0 print(m) ```	3	MatrixStudio/Codeforces-Python-Submissions
894	A	QAQ	PROGRAMMING	800	[ "brute force", "dp" ]		null	null	"QAQ" is a word to denote an expression of crying. Imagine "Q" as eyes with tears and "A" as a mouth. Now Diamond has given Bort a string consisting of only uppercase English letters of length n. There is a great number of "QAQ" in the string (Diamond is so cute!). Bort wants to know how many subsequences "QAQ" are...	The only line contains a string of length n (1<=≤<=n<=≤<=100). It's guaranteed that the string only contains uppercase English letters.	Print a single integer — the number of subsequences "QAQ" in the string.	[ "QAQAQYSYIOIWIN\n", "QAQQQZZYNOIWIN\n" ]	[ "4\n", "3\n" ]	In the first example there are 4 subsequences "QAQ": "QAQAQYSYIOIWIN", "QAQAQYSYIOIWIN", "QAQAQYSYIOIWIN", "QAQAQYSYIOIWIN".	500	[ { "input": "QAQAQYSYIOIWIN", "output": "4" }, { "input": "QAQQQZZYNOIWIN", "output": "3" }, { "input": "QA", "output": "0" }, { "input": "IAQVAQZLQBQVQFTQQQADAQJA", "output": "24" }, { "input": "QQAAQASGAYAAAAKAKAQIQEAQAIAAIAQQQQQ", "output": "378" }, { ...	1,603,009,927	2,147,483,647	PyPy 3	OK	TESTS	43	140	0	def calcUtil(s,sub): calcUtil.times+=1 n=len(s) M=[[0 for i in range(4)] for j in range(n+1)] for i in range(n+1): M[i][0]=1 for i in range(1,4): for j in range(1,n+1): if s[j-1]==sub[i-1]: M[j][i]=M[j-1][i]+M[j-1][i-1] else: ...	Title: QAQ Time Limit: None seconds Memory Limit: None megabytes Problem Description: "QAQ" is a word to denote an expression of crying. Imagine "Q" as eyes with tears and "A" as a mouth. Now Diamond has given Bort a string consisting of only uppercase English letters of length n. There is a great number of "QAQ"...	```python def calcUtil(s,sub): calcUtil.times+=1 n=len(s) M=[[0 for i in range(4)] for j in range(n+1)] for i in range(n+1): M[i][0]=1 for i in range(1,4): for j in range(1,n+1): if s[j-1]==sub[i-1]: M[j][i]=M[j-1][i]+M[j-1][i-1] else...	3	MatrixStudio/Codeforces-Python-Submissions
688	B	Lovely Palindromes	PROGRAMMING	1,000	[ "constructive algorithms", "math" ]		null	null	Pari has a friend who loves palindrome numbers. A palindrome number is a number that reads the same forward or backward. For example 12321, 100001 and 1 are palindrome numbers, while 112 and 1021 are not. Pari is trying to love them too, but only very special and gifted people can understand the beauty behind palindro...	The only line of the input contains a single integer n (1<=≤<=n<=≤<=10100<=000).	Print the n-th even-length palindrome number.	[ "1\n", "10\n" ]	[ "11\n", "1001\n" ]	The first 10 even-length palindrome numbers are 11, 22, 33, ... , 88, 99 and 1001.	1,000	[ { "input": "1", "output": "11" }, { "input": "10", "output": "1001" }, { "input": "11", "output": "1111" }, { "input": "12", "output": "1221" }, { "input": "100", "output": "100001" }, { "input": "1321", "output": "13211231" }, { "input": "...	1,580,488,217	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	109	0	number=input() int_number=int(number) temp=int_number reverse=0 while(temp>0): reverse=reverse+temp%10 temp=temp//10 reverse_str=str(reverse) print(number+reverse_str)	Title: Lovely Palindromes Time Limit: None seconds Memory Limit: None megabytes Problem Description: Pari has a friend who loves palindrome numbers. A palindrome number is a number that reads the same forward or backward. For example 12321, 100001 and 1 are palindrome numbers, while 112 and 1021 are not. Pari is tr...	```python number=input() int_number=int(number) temp=int_number reverse=0 while(temp>0): reverse=reverse+temp%10 temp=temp//10 reverse_str=str(reverse) print(number+reverse_str) ```	0	MatrixStudio/Codeforces-Python-Submissions
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,686,457,541	2,147,483,647	PyPy 3-64	OK	TESTS	27	46	0	n=input() n=list(n) n.sort() c=0 for i in range(len(n)): if (n[i]!="{" and n[i]!="}" and n[i]!="," and n[i]!=" "): if n[i]!=n[i+1]: c+=1 print(c)	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=input() n=list(n) n.sort() c=0 for i in range(len(n)): if (n[i]!="{" and n[i]!="}" and n[i]!="," and n[i]!=" "): if n[i]!=n[i+1]: c+=1 print(c) ```	3	MatrixStudio/Codeforces-Python-Submissions
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,699,097,359	2,147,483,647	Python 3	OK	TESTS	101	92	0	x=int(input()) liss=list(map(int,input().split())) akrem=[] for i in range(x): for j in range (x): if i+1==liss[j]: akrem.append(j+1) break else: continue print(" ".join(map(str, akrem)))	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 x=int(input()) liss=list(map(int,input().split())) akrem=[] for i in range(x): for j in range (x): if i+1==liss[j]: akrem.append(j+1) break else: continue print(" ".join(map(str, akrem))) ```	3	MatrixStudio/Codeforces-Python-Submissions
340	B	Maximal Area Quadrilateral	PROGRAMMING	2,100	[ "brute force", "geometry" ]		null	null	Iahub has drawn a set of n points in the cartesian plane which he calls "special points". A quadrilateral is a simple polygon without self-intersections with four sides (also called edges) and four vertices (also called corners). Please note that a quadrilateral doesn't have to be convex. A special quadrilateral is o...	The first line contains integer n (4<=≤<=n<=≤<=300). Each of the next n lines contains two integers: xi, yi (<=-<=1000<=≤<=xi,<=yi<=≤<=1000) — the cartesian coordinates of ith special point. It is guaranteed that no three points are on the same line. It is guaranteed that no two points coincide.	Output a single real number — the maximal area of a special quadrilateral. The answer will be considered correct if its absolute or relative error does't exceed 10<=-<=9.	[ "5\n0 0\n0 4\n4 0\n4 4\n2 3\n" ]	[ "16.000000" ]	In the test example we can choose first 4 points to be the vertices of the quadrilateral. They form a square by side 4, so the area is 4·4 = 16.	3,000	[ { "input": "5\n0 0\n0 4\n4 0\n4 4\n2 3", "output": "16.000000" }, { "input": "10\n-6 -4\n-7 5\n-7 -7\n5 -7\n4 -9\n-6 7\n2 9\n-4 -6\n2 10\n-10 -4", "output": "166.000000" }, { "input": "4\n-3 3\n0 3\n-2 -1\n2 2", "output": "11.000000" }, { "input": "5\n-4 -3\n-3 -2\n3 3\n-1 2\...	1,561,281,682	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	6	1,000	0	n=int(input()) from math import inf a=[] ans=0 for i in range(n): a.append(list(map(int,input().split()))) for i in range(n): for j in range(n): if(i!=j): m1=inf m2=0 for k in range(n): if(k!=i and k!=j): area=a[i][0](a[j][1]-a[k][1])-a[i][1](a[j][0]-a[k][0])+(a[j][0]a[k][1]-a[k][0]a[j][1]) ...	Title: Maximal Area Quadrilateral Time Limit: None seconds Memory Limit: None megabytes Problem Description: Iahub has drawn a set of n points in the cartesian plane which he calls "special points". A quadrilateral is a simple polygon without self-intersections with four sides (also called edges) and four vertices...	```python n=int(input()) from math import inf a=[] ans=0 for i in range(n): a.append(list(map(int,input().split()))) for i in range(n): for j in range(n): if(i!=j): m1=inf m2=0 for k in range(n): if(k!=i and k!=j): area=a[i][0](a[j][1]-a[k][1])-a[i][1](a[j][0]-a[k][0])+(a[j][0]a[k][1]-a[k][0]a...	0	MatrixStudio/Codeforces-Python-Submissions
489	A	SwapSort	PROGRAMMING	1,200	[ "greedy", "implementation", "sortings" ]		null	null	In this problem your goal is to sort an array consisting of n integers in at most n swaps. For the given array find the sequence of swaps that makes the array sorted in the non-descending order. Swaps are performed consecutively, one after another. Note that in this problem you do not have to minimize the number o...	The first line of the input contains integer n (1<=≤<=n<=≤<=3000) — the number of array elements. The second line contains elements of array: a0,<=a1,<=...,<=an<=-<=1 (<=-<=109<=≤<=ai<=≤<=109), where ai is the i-th element of the array. The elements are numerated from 0 to n<=-<=1 from left to r...	In the first line print k (0<=≤<=k<=≤<=n) — the number of swaps. Next k lines must contain the descriptions of the k swaps, one per line. Each swap should be printed as a pair of integers i, j (0<=≤<=i,<=j<=≤<=n<=-<=1), representing the swap of elements ai and aj. You can print indices in th...	[ "5\n5 2 5 1 4\n", "6\n10 20 20 40 60 60\n", "2\n101 100\n" ]	[ "2\n0 3\n4 2\n", "0\n", "1\n0 1\n" ]	none	500	[ { "input": "5\n5 2 5 1 4", "output": "2\n0 3\n4 2" }, { "input": "6\n10 20 20 40 60 60", "output": "0" }, { "input": "2\n101 100", "output": "1\n0 1" }, { "input": "1\n1000", "output": "0" }, { "input": "2\n1000000000 -1000000000", "output": "1\n0 1" }, { ...	1,678,032,904	2,147,483,647	PyPy 3-64	OK	TESTS	22	109	5,939,200	n = int(input()) a = list(map(int, input().split())) swaps = [] for i in range(n): mn_index = i for j in range(i + 1, n): if a[j] < a[mn_index]: mn_index = j if i != mn_index: swaps.append((i, mn_index)) a[mn_index], a[i] = a[i], a[mn_index] print(len(...	Title: SwapSort Time Limit: None seconds Memory Limit: None megabytes Problem Description: In this problem your goal is to sort an array consisting of n integers in at most n swaps. For the given array find the sequence of swaps that makes the array sorted in the non-descending order. Swaps are performed consecu...	```python n = int(input()) a = list(map(int, input().split())) swaps = [] for i in range(n): mn_index = i for j in range(i + 1, n): if a[j] < a[mn_index]: mn_index = j if i != mn_index: swaps.append((i, mn_index)) a[mn_index], a[i] = a[i], a[mn_index] ...	3	MatrixStudio/Codeforces-Python-Submissions
990	A	Commentary Boxes	PROGRAMMING	1,000	[ "implementation", "math" ]		null	null	Berland Football Cup starts really soon! Commentators from all over the world come to the event. Organizers have already built $n$ commentary boxes. $m$ regional delegations will come to the Cup. Every delegation should get the same number of the commentary boxes. If any box is left unoccupied then the delegations wil...	The only line contains four integer numbers $n$, $m$, $a$ and $b$ ($1 \le n, m \le 10^{12}$, $1 \le a, b \le 100$), where $n$ is the initial number of the commentary boxes, $m$ is the number of delegations to come, $a$ is the fee to build a box and $b$ is the fee to demolish a box.	Output the minimal amount of burles organizers should pay to satisfy all the delegations (i.e. to make the number of the boxes be divisible by $m$). It is allowed that the final number of the boxes is equal to $0$.	[ "9 7 3 8\n", "2 7 3 7\n", "30 6 17 19\n" ]	[ "15\n", "14\n", "0\n" ]	In the first example organizers can build $5$ boxes to make the total of $14$ paying $3$ burles for the each of them. In the second example organizers can demolish $2$ boxes to make the total of $0$ paying $7$ burles for the each of them. In the third example organizers are already able to distribute all the boxes eq...	0	[ { "input": "9 7 3 8", "output": "15" }, { "input": "2 7 3 7", "output": "14" }, { "input": "30 6 17 19", "output": "0" }, { "input": "500000000001 1000000000000 100 100", "output": "49999999999900" }, { "input": "1000000000000 750000000001 10 100", "output": "...	1,610,044,499	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	0	124	0	n,m,a,b=map(int, input().split()) print(min(n%mb, m-n%ma))	Title: Commentary Boxes Time Limit: None seconds Memory Limit: None megabytes Problem Description: Berland Football Cup starts really soon! Commentators from all over the world come to the event. Organizers have already built $n$ commentary boxes. $m$ regional delegations will come to the Cup. Every delegation shou...	```python n,m,a,b=map(int, input().split()) print(min(n%mb, m-n%ma)) ```	0	MatrixStudio/Codeforces-Python-Submissions
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,639,063,202	2,147,483,647	Python 3	OK	TESTS	41	46	0	n = int(input()) if(n%2==0): print(int(n/2)) print(str(str(2)+" ")(int(n/2)-1)+str(2)) else: print(int((n-3)/2+1)) print(str(str(2)+" ")int((n-3)/2)+" "+str(3))	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 n = int(input()) if(n%2==0): print(int(n/2)) print(str(str(2)+" ")(int(n/2)-1)+str(2)) else: print(int((n-3)/2+1)) print(str(str(2)+" ")int((n-3)/2)+" "+str(3)) ```	3	MatrixStudio/Codeforces-Python-Submissions
92	A	Chips	PROGRAMMING	800	[ "implementation", "math" ]	A. Chips	2	256	There are n walruses sitting in a circle. All of them are numbered in the clockwise order: the walrus number 2 sits to the left of the walrus number 1, the walrus number 3 sits to the left of the walrus number 2, ..., the walrus number 1 sits to the left of the walrus number n. The presenter has m chips. The pre...	The first line contains two integers n and m (1<=≤<=n<=≤<=50, 1<=≤<=m<=≤<=104) — the number of walruses and the number of chips correspondingly.	Print the number of chips the presenter ended up with.	[ "4 11\n", "17 107\n", "3 8\n" ]	[ "0\n", "2\n", "1\n" ]	In the first sample the presenter gives one chip to the walrus number 1, two chips to the walrus number 2, three chips to the walrus number 3, four chips to the walrus number 4, then again one chip to the walrus number 1. After that the presenter runs out of chips. He can't give anything to the walrus number 2 and the ...	500	[ { "input": "4 11", "output": "0" }, { "input": "17 107", "output": "2" }, { "input": "3 8", "output": "1" }, { "input": "46 7262", "output": "35" }, { "input": "32 6864", "output": "0" }, { "input": "36 6218", "output": "14" }, { "input": "...	1,590,634,764	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	186	0	n = int(input("Type n:")) m = int(input("Type m:")) counter = 0 sum = 0 for i in range(n + 1): sum += 1 remainder = m % sum for i in range(1, remainder + 1): remainder -= i if(remainder == 0): print(0) break elif(remainder < 0): print(remainder + i) ...	Title: Chips Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: There are n walruses sitting in a circle. All of them are numbered in the clockwise order: the walrus number 2 sits to the left of the walrus number 1, the walrus number 3 sits to the left of the walrus number 2, ..., the walrus nu...	```python n = int(input("Type n:")) m = int(input("Type m:")) counter = 0 sum = 0 for i in range(n + 1): sum += 1 remainder = m % sum for i in range(1, remainder + 1): remainder -= i if(remainder == 0): print(0) break elif(remainder < 0): print(remainder + i)...	-1	MatrixStudio/Codeforces-Python-Submissions
449	B	Jzzhu and Cities	PROGRAMMING	2,000	[ "graphs", "greedy", "shortest paths" ]		null	null	Jzzhu is the president of country A. There are n cities numbered from 1 to n in his country. City 1 is the capital of A. Also there are m roads connecting the cities. One can go from city ui to vi (and vise versa) using the i-th road, the length of this road is xi. Finally, there are k train route...	The first line contains three integers n,<=m,<=k (2<=≤<=n<=≤<=105; 1<=≤<=m<=≤<=3·105; 1<=≤<=k<=≤<=105). Each of the next m lines contains three integers ui,<=vi,<=xi (1<=≤<=ui,<=vi<=≤<=n; ui<=≠<=vi; 1<=≤<=xi<=≤<=109). Each of the next k lines contains two integers s...	Output a single integer representing the maximum number of the train routes which can be closed.	[ "5 5 3\n1 2 1\n2 3 2\n1 3 3\n3 4 4\n1 5 5\n3 5\n4 5\n5 5\n", "2 2 3\n1 2 2\n2 1 3\n2 1\n2 2\n2 3\n" ]	[ "2\n", "2\n" ]	none	1,000	[ { "input": "5 5 3\n1 2 1\n2 3 2\n1 3 3\n3 4 4\n1 5 5\n3 5\n4 5\n5 5", "output": "2" }, { "input": "2 2 3\n1 2 2\n2 1 3\n2 1\n2 2\n2 3", "output": "2" }, { "input": "5 4 3\n1 2 999999999\n2 3 1000000000\n3 4 529529529\n5 1 524524524\n5 524444444\n5 529999999\n2 1000000000", "output": ...	1,649,786,250	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	15	0	if __name__ == "__main__": x,p,q=[int(A) for A in input().split()] path_arr = list() train_arr = list() for i in range(int(p)): path_arr.append(list(map(int, input().split()))) for i in range(int(q)): train_arr.append(list(map(int, input().split()))) t_path = 0 j =0 for ...	Title: Jzzhu and Cities Time Limit: None seconds Memory Limit: None megabytes Problem Description: Jzzhu is the president of country A. There are n cities numbered from 1 to n in his country. City 1 is the capital of A. Also there are m roads connecting the cities. One can go from city ui to vi (and vi...	```python if __name__ == "__main__": x,p,q=[int(A) for A in input().split()] path_arr = list() train_arr = list() for i in range(int(p)): path_arr.append(list(map(int, input().split()))) for i in range(int(q)): train_arr.append(list(map(int, input().split()))) t_path = 0 j =0...	-1	MatrixStudio/Codeforces-Python-Submissions
296	A	Yaroslav and Permutations	PROGRAMMING	1,100	[ "greedy", "math" ]		null	null	Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring elements would be distinct in a finite time. Help Yaroslav.	The first line contains integer n (1<=≤<=n<=≤<=100) — the number of elements in the array. The second line contains n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=1000) — the array elements.	In the single line print "YES" (without the quotes) if Yaroslav can obtain the array he needs, and "NO" (without the quotes) otherwise.	[ "1\n1\n", "3\n1 1 2\n", "4\n7 7 7 7\n" ]	[ "YES\n", "YES\n", "NO\n" ]	In the first sample the initial array fits well. In the second sample Yaroslav can get array: 1, 2, 1. He can swap the last and the second last elements to obtain it. In the third sample Yarosav can't get the array he needs.	500	[ { "input": "1\n1", "output": "YES" }, { "input": "3\n1 1 2", "output": "YES" }, { "input": "4\n7 7 7 7", "output": "NO" }, { "input": "4\n479 170 465 146", "output": "YES" }, { "input": "5\n996 437 605 996 293", "output": "YES" }, { "input": "6\n727 53...	1,590,977,409	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	6	186	0	n = int(input()) l = list(map(int,input().split())) count = 0 for i in range(len(l)): if l[i]==l[i-1]: count += 1 if count<len(l): print('YES') elif len(l)==1: print('YES') else: print('NO')	Title: Yaroslav and Permutations Time Limit: None seconds Memory Limit: None megabytes Problem Description: Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring elements would...	```python n = int(input()) l = list(map(int,input().split())) count = 0 for i in range(len(l)): if l[i]==l[i-1]: count += 1 if count<len(l): print('YES') elif len(l)==1: print('YES') else: print('NO') ```	0	MatrixStudio/Codeforces-Python-Submissions
870	C	Maximum splitting	PROGRAMMING	1,300	[ "dp", "greedy", "math", "number theory" ]		null	null	You are given several queries. In the i-th query you are given a single positive integer ni. You are to represent ni as a sum of maximum possible number of composite summands and print this maximum number, or print -1, if there are no such splittings. An integer greater than 1 is composite, if it is not prim...	The first line contains single integer q (1<=≤<=q<=≤<=105) — the number of queries. q lines follow. The (i<=+<=1)-th line contains single integer ni (1<=≤<=ni<=≤<=109) — the i-th query.	For each query print the maximum possible number of summands in a valid splitting to composite summands, or -1, if there are no such splittings.	[ "1\n12\n", "2\n6\n8\n", "3\n1\n2\n3\n" ]	[ "3\n", "1\n2\n", "-1\n-1\n-1\n" ]	12 = 4 + 4 + 4 = 4 + 8 = 6 + 6 = 12, but the first splitting has the maximum possible number of summands. 8 = 4 + 4, 6 can't be split into several composite summands. 1, 2, 3 are less than any composite number, so they do not have valid splittings.	1,500	[ { "input": "1\n12", "output": "3" }, { "input": "2\n6\n8", "output": "1\n2" }, { "input": "3\n1\n2\n3", "output": "-1\n-1\n-1" }, { "input": "6\n1\n2\n3\n5\n7\n11", "output": "-1\n-1\n-1\n-1\n-1\n-1" }, { "input": "3\n4\n6\n9", "output": "1\n1\n1" }, { ...	1,647,770,987	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	46	0	def main(N): if N % 4 == 0: return N // 4 elif N % 4 == 2: return 1 + (N - 6) // 4 else: return main(N - 9) + 1 x = main(int(input())) if x <= 0: print(-1) else: print(x)	Title: Maximum splitting Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given several queries. In the i-th query you are given a single positive integer ni. You are to represent ni as a sum of maximum possible number of composite summands and print this maximum number, o...	```python def main(N): if N % 4 == 0: return N // 4 elif N % 4 == 2: return 1 + (N - 6) // 4 else: return main(N - 9) + 1 x = main(int(input())) if x <= 0: print(-1) else: print(x) ```	0	MatrixStudio/Codeforces-Python-Submissions
467	A	George and Accommodation	PROGRAMMING	800	[ "implementation" ]		null	null	George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory. George and Alex want to live in the same room. The dormitory has n rooms in total. At the moment the i-th room has pi peopl...	The first line contains a single integer n (1<=≤<=n<=≤<=100) — the number of rooms. The i-th of the next n lines contains two integers pi and qi (0<=≤<=pi<=≤<=qi<=≤<=100) — the number of people who already live in the i-th room and the room's capacity.	Print a single integer — the number of rooms where George and Alex can move in.	[ "3\n1 1\n2 2\n3 3\n", "3\n1 10\n0 10\n10 10\n" ]	[ "0\n", "2\n" ]	none	500	[ { "input": "3\n1 1\n2 2\n3 3", "output": "0" }, { "input": "3\n1 10\n0 10\n10 10", "output": "2" }, { "input": "2\n36 67\n61 69", "output": "2" }, { "input": "3\n21 71\n10 88\n43 62", "output": "3" }, { "input": "3\n1 2\n2 3\n3 4", "output": "0" }, { "...	1,694,536,050	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	4	61	0	n = 0 for i in range(int(input())): a,b = map(int, input().split()) if a < b: n += 1 else: print(n)	Title: George and Accommodation Time Limit: None seconds Memory Limit: None megabytes Problem Description: George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory. George and Alex want ...	```python n = 0 for i in range(int(input())): a,b = map(int, input().split()) if a < b: n += 1 else: print(n) ```	0	MatrixStudio/Codeforces-Python-Submissions
957	A	Tritonic Iridescence	PROGRAMMING	1,300	[ "implementation" ]		null	null	Overlooking the captivating blend of myriads of vernal hues, Arkady the painter lays out a long, long canvas. Arkady has a sufficiently large amount of paint of three colours: cyan, magenta, and yellow. On the one-dimensional canvas split into n consecutive segments, each segment needs to be painted in one of the co...	The first line contains a single positive integer n (1<=≤<=n<=≤<=100) — the length of the canvas. The second line contains a string s of n characters, the i-th of which is either 'C' (denoting a segment painted in cyan), 'M' (denoting one painted in magenta), 'Y' (one painted in yellow), or '?' (an unpainted...	If there are at least two different ways of painting, output "Yes"; otherwise output "No" (both without quotes). You can print each character in any case (upper or lower).	[ "5\nCY??Y\n", "5\nC?C?Y\n", "5\n?CYC?\n", "5\nC??MM\n", "3\nMMY\n" ]	[ "Yes\n", "Yes\n", "Yes\n", "No\n", "No\n" ]	For the first example, there are exactly two different ways of colouring: CYCMY and CYMCY. For the second example, there are also exactly two different ways of colouring: CMCMY and CYCMY. For the third example, there are four ways of colouring: MCYCM, MCYCY, YCYCM, and YCYCY. For the fourth example, no matter how th...	500	[ { "input": "5\nCY??Y", "output": "Yes" }, { "input": "5\nC?C?Y", "output": "Yes" }, { "input": "5\n?CYC?", "output": "Yes" }, { "input": "5\nC??MM", "output": "No" }, { "input": "3\nMMY", "output": "No" }, { "input": "15\n??YYYYYY??YYYY?", "output"...	1,533,036,863	2,147,483,647	Python 3	OK	TESTS	45	124	0	input() s=input() if "MM" in s or "CC" in s or "YY" in s: print("No") else: if "??" in s or s[0]=="?" or s[-1]=="?" or "C?C" in s or "Y?Y" in s or "M?M" in s: print("Yes") else: print("No")	Title: Tritonic Iridescence Time Limit: None seconds Memory Limit: None megabytes Problem Description: Overlooking the captivating blend of myriads of vernal hues, Arkady the painter lays out a long, long canvas. Arkady has a sufficiently large amount of paint of three colours: cyan, magenta, and yellow. On the one...	```python input() s=input() if "MM" in s or "CC" in s or "YY" in s: print("No") else: if "??" in s or s[0]=="?" or s[-1]=="?" or "C?C" in s or "Y?Y" in s or "M?M" in s: print("Yes") else: print("No") ```	3	MatrixStudio/Codeforces-Python-Submissions
25	A	IQ test	PROGRAMMING	1,300	[ "brute force" ]	A. IQ test	2	256	Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given n numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given n numbers finds one that i...	The first line contains integer n (3<=≤<=n<=≤<=100) — amount of numbers in the task. The second line contains n space-separated natural numbers, not exceeding 100. It is guaranteed, that exactly one of these numbers differs from the others in evenness.	Output index of number that differs from the others in evenness. Numbers are numbered from 1 in the input order.	[ "5\n2 4 7 8 10\n", "4\n1 2 1 1\n" ]	[ "3\n", "2\n" ]	none	0	[ { "input": "5\n2 4 7 8 10", "output": "3" }, { "input": "4\n1 2 1 1", "output": "2" }, { "input": "3\n1 2 2", "output": "1" }, { "input": "3\n100 99 100", "output": "2" }, { "input": "3\n5 3 2", "output": "3" }, { "input": "4\n43 28 1 91", "output"...	1,588,950,962	2,147,483,647	Python 3	OK	TESTS	32	248	6,656,000	n = int(input()) list1 = list(map(int,input().split())) even = [] odd = [] for x in range(n): if list1[x]%2==0: even.append(x) else: odd.append(x) if len(even)>len(odd): print(odd[0]+1) else: print(even[0]+1)	Title: IQ test Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given n numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — t...	```python n = int(input()) list1 = list(map(int,input().split())) even = [] odd = [] for x in range(n): if list1[x]%2==0: even.append(x) else: odd.append(x) if len(even)>len(odd): print(odd[0]+1) else: print(even[0]+1) ```	3.925602	MatrixStudio/Codeforces-Python-Submissions
548	A	Mike and Fax	PROGRAMMING	1,100	[ "brute force", "implementation", "strings" ]		null	null	While Mike was walking in the subway, all the stuff in his back-bag dropped on the ground. There were several fax messages among them. He concatenated these strings in some order and now he has string s. He is not sure if this is his own back-bag or someone else's. He remembered that there were exactly k messages ...	The first line of input contains string s containing lowercase English letters (1<=≤<=\|s\|<=≤<=1000). The second line contains integer k (1<=≤<=k<=≤<=1000).	Print "YES"(without quotes) if he has worn his own back-bag or "NO"(without quotes) otherwise.	[ "saba\n2\n", "saddastavvat\n2\n" ]	[ "NO\n", "YES\n" ]	Palindrome is a string reading the same forward and backward. In the second sample, the faxes in his back-bag can be "saddas" and "tavvat".	500	[ { "input": "saba\n2", "output": "NO" }, { "input": "saddastavvat\n2", "output": "YES" }, { "input": "aaaaaaaaaa\n3", "output": "NO" }, { "input": "aaaaaa\n3", "output": "YES" }, { "input": "abaacca\n2", "output": "NO" }, { "input": "a\n1", "output"...	1,488,728,915	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	3	46	4,608,000	s = input() n = int(input()) a = 0 ls = len(s) b = ls//n k=0 while b <= ls: tmp = s[a:b] if tmp[0:len(tmp)//2] == tmp[len(tmp)//2:][::-1]: k += 1 a = b b *= 2 if k == n: print("YES") else: print("NO")	Title: Mike and Fax Time Limit: None seconds Memory Limit: None megabytes Problem Description: While Mike was walking in the subway, all the stuff in his back-bag dropped on the ground. There were several fax messages among them. He concatenated these strings in some order and now he has string s. He is not sure ...	```python s = input() n = int(input()) a = 0 ls = len(s) b = ls//n k=0 while b <= ls: tmp = s[a:b] if tmp[0:len(tmp)//2] == tmp[len(tmp)//2:][::-1]: k += 1 a = b b *= 2 if k == n: print("YES") else: print("NO") ```	0	MatrixStudio/Codeforces-Python-Submissions
61	A	Ultra-Fast Mathematician	PROGRAMMING	800	[ "implementation" ]	A. Ultra-Fast Mathematician	2	256	Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second. One day in 230 AD Shapur was trying to find out if any one can possibly do...	There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.	Write one line — the corresponding answer. Do not omit the leading 0s.	[ "1010100\n0100101\n", "000\n111\n", "1110\n1010\n", "01110\n01100\n" ]	[ "1110001\n", "111\n", "0100\n", "00010\n" ]	none	500	[ { "input": "1010100\n0100101", "output": "1110001" }, { "input": "000\n111", "output": "111" }, { "input": "1110\n1010", "output": "0100" }, { "input": "01110\n01100", "output": "00010" }, { "input": "011101\n000001", "output": "011100" }, { "input": "...	1,643,212,052	2,147,483,647	Python 3	OK	TESTS	102	46	0	n = input() n1 = input() l = len(n) add = [] d = "" for i in range(0,l): if (n[i]!=n1[i]): add.append("1") else: add.append("0") for l in add: d+=l print(d)	Title: Ultra-Fast Mathematician Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 10...	```python n = input() n1 = input() l = len(n) add = [] d = "" for i in range(0,l): if (n[i]!=n1[i]): add.append("1") else: add.append("0") for l in add: d+=l print(d) ```	3.9885	MatrixStudio/Codeforces-Python-Submissions
0	none	none	none	0	[ "none" ]		null	null	In a building where Polycarp lives there are equal number of flats on each floor. Unfortunately, Polycarp don't remember how many flats are on each floor, but he remembers that the flats are numbered from 1 from lower to upper floors. That is, the first several flats are on the first floor, the next several flats are o...	The first line contains two integers n and m (1<=≤<=n<=≤<=100, 0<=≤<=m<=≤<=100), where n is the number of the flat you need to restore floor for, and m is the number of flats in Polycarp's memory. m lines follow, describing the Polycarp's memory: each of these lines contains a pair of integers ki,<=*...	Print the number of the floor in which the n-th flat is located, if it is possible to determine it in a unique way. Print -1 if it is not possible to uniquely restore this floor.	[ "10 3\n6 2\n2 1\n7 3\n", "8 4\n3 1\n6 2\n5 2\n2 1\n" ]	[ "4\n", "-1\n" ]	In the first example the 6-th flat is on the 2-nd floor, while the 7-th flat is on the 3-rd, so, the 6-th flat is the last on its floor and there are 3 flats on each floor. Thus, the 10-th flat is on the 4-th floor. In the second example there can be 3 or 4 flats on each floor, so we can't restore the floor for the 8-...	0	[ { "input": "10 3\n6 2\n2 1\n7 3", "output": "4" }, { "input": "8 4\n3 1\n6 2\n5 2\n2 1", "output": "-1" }, { "input": "8 3\n7 2\n6 2\n1 1", "output": "2" }, { "input": "4 2\n8 3\n3 1", "output": "2" }, { "input": "11 4\n16 4\n11 3\n10 3\n15 4", "output": "3" ...	1,505,654,894	1,394	Python 3	WRONG_ANSWER	PRETESTS	2	46	0	def readln(): return map(int, input().rstrip().split()) n, m = readln() data = {} rs = [] for i in range(0, m): k, f = readln() data[k] = f for i in range(1, 101): for j in range(1, 101): if j not in data: continue else: cf = data[j] lb = ...	Title: none Time Limit: None seconds Memory Limit: None megabytes Problem Description: In a building where Polycarp lives there are equal number of flats on each floor. Unfortunately, Polycarp don't remember how many flats are on each floor, but he remembers that the flats are numbered from 1 from lower to upper flo...	```python def readln(): return map(int, input().rstrip().split()) n, m = readln() data = {} rs = [] for i in range(0, m): k, f = readln() data[k] = f for i in range(1, 101): for j in range(1, 101): if j not in data: continue else: cf = data[j] ...	0	MatrixStudio/Codeforces-Python-Submissions
363	B	Fence	PROGRAMMING	1,100	[ "brute force", "dp" ]		null	null	There is a fence in front of Polycarpus's home. The fence consists of n planks of the same width which go one after another from left to right. The height of the i-th plank is hi meters, distinct planks can have distinct heights. Polycarpus has bought a posh piano and is thinking about how to get it into the h...	The first line of the input contains integers n and k (1<=≤<=n<=≤<=1.5·105,<=1<=≤<=k<=≤<=n) — the number of planks in the fence and the width of the hole for the piano. The second line contains the sequence of integers h1,<=h2,<=...,<=hn (1<=≤<=hi<=≤<=100), where hi is the height of the i-th...	Print such integer j that the sum of the heights of planks j, j<=+<=1, ..., j<=+<=k<=-<=1 is the minimum possible. If there are multiple such j's, print any of them.	[ "7 3\n1 2 6 1 1 7 1\n" ]	[ "3\n" ]	In the sample, your task is to find three consecutive planks with the minimum sum of heights. In the given case three planks with indexes 3, 4 and 5 have the required attribute, their total height is 8.	1,000	[ { "input": "7 3\n1 2 6 1 1 7 1", "output": "3" }, { "input": "1 1\n100", "output": "1" }, { "input": "2 1\n10 20", "output": "1" }, { "input": "10 5\n1 2 3 1 2 2 3 1 4 5", "output": "1" }, { "input": "10 2\n3 1 4 1 4 6 2 1 4 6", "output": "7" }, { "inp...	1,684,852,836	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	30	0	n, k = map(int, input().split()) lst = list(map(int, input().split())) consecutive_sum = 0 temp = 99999999999999999999 index = 0 for i in range(n-k): consecutive_sum = sum(lst[i:i+k]) if consecutive_sum < temp: temp = consecutive_sum index = i + 1 print(index)	Title: Fence Time Limit: None seconds Memory Limit: None megabytes Problem Description: There is a fence in front of Polycarpus's home. The fence consists of n planks of the same width which go one after another from left to right. The height of the i-th plank is hi meters, distinct planks can have distinct ...	```python n, k = map(int, input().split()) lst = list(map(int, input().split())) consecutive_sum = 0 temp = 99999999999999999999 index = 0 for i in range(n-k): consecutive_sum = sum(lst[i:i+k]) if consecutive_sum < temp: temp = consecutive_sum index = i + 1 print(index) ```	0	MatrixStudio/Codeforces-Python-Submissions
155	A	I_love_\%username\%	PROGRAMMING	800	[ "brute force" ]		null	null	Vasya adores sport programming. He can't write programs but he loves to watch the contests' progress. Vasya even has a favorite coder and Vasya pays special attention to him. One day Vasya decided to collect the results of all contests where his favorite coder participated and track the progress of his coolness. For e...	The first line contains the single integer n (1<=≤<=n<=≤<=1000) — the number of contests where the coder participated. The next line contains n space-separated non-negative integer numbers — they are the points which the coder has earned. The points are given in the chronological order. All points do not exceed ...	Print the single number — the number of amazing performances the coder has had during his whole history of participating in the contests.	[ "5\n100 50 200 150 200\n", "10\n4664 6496 5814 7010 5762 5736 6944 4850 3698 7242\n" ]	[ "2\n", "4\n" ]	In the first sample the performances number 2 and 3 are amazing. In the second sample the performances number 2, 4, 9 and 10 are amazing.	500	[ { "input": "5\n100 50 200 150 200", "output": "2" }, { "input": "10\n4664 6496 5814 7010 5762 5736 6944 4850 3698 7242", "output": "4" }, { "input": "1\n6", "output": "0" }, { "input": "2\n2 1", "output": "1" }, { "input": "5\n100 36 53 7 81", "output": "2" ...	1,693,250,451	2,147,483,647	Python 3	OK	TESTS	37	92	0	n=int(input()) l=list(map(int,input().split())) c=0 least=most=l[0] for i in range(1,n,1): if(l[i]<least): least=l[i] c+=1 elif(l[i]>most): most=l[i] c+=1 print(c)	Title: I_love_\%username\% Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya adores sport programming. He can't write programs but he loves to watch the contests' progress. Vasya even has a favorite coder and Vasya pays special attention to him. One day Vasya decided to collect the re...	```python n=int(input()) l=list(map(int,input().split())) c=0 least=most=l[0] for i in range(1,n,1): if(l[i]<least): least=l[i] c+=1 elif(l[i]>most): most=l[i] c+=1 print(c) ```	3	MatrixStudio/Codeforces-Python-Submissions
770	A	New Password	PROGRAMMING	800	[ "*special", "implementation" ]		null	null	Innokentiy decides to change the password in the social net "Contact!", but he is too lazy to invent a new password by himself. That is why he needs your help. Innokentiy decides that new password should satisfy the following conditions: - the length of the password must be equal to n, - the password should cons...	The first line contains two positive integers n and k (2<=≤<=n<=≤<=100, 2<=≤<=k<=≤<=min(n,<=26)) — the length of the password and the number of distinct symbols in it. Pay attention that a desired new password always exists.	Print any password which satisfies all conditions given by Innokentiy.	[ "4 3\n", "6 6\n", "5 2\n" ]	[ "java\n", "python\n", "phphp\n" ]	In the first test there is one of the appropriate new passwords — java, because its length is equal to 4 and 3 distinct lowercase letters a, j and v are used in it. In the second test there is one of the appropriate new passwords — python, because its length is equal to 6 and it consists of 6 distinct lowercase letter...	500	[ { "input": "4 3", "output": "abca" }, { "input": "6 6", "output": "abcdef" }, { "input": "5 2", "output": "ababa" }, { "input": "3 2", "output": "aba" }, { "input": "10 2", "output": "ababababab" }, { "input": "26 13", "output": "abcdefghijklmabcde...	1,619,308,233	2,147,483,647	Python 3	OK	TESTS	47	77	0	n,k=map(int,input().split()) s="qwertyuiopasdfghjklzxcvbnm";an="" i=0 while len(an)<n: an+=s[i%k] i+=1 print(an)	Title: New Password Time Limit: None seconds Memory Limit: None megabytes Problem Description: Innokentiy decides to change the password in the social net "Contact!", but he is too lazy to invent a new password by himself. That is why he needs your help. Innokentiy decides that new password should satisfy the foll...	```python n,k=map(int,input().split()) s="qwertyuiopasdfghjklzxcvbnm";an="" i=0 while len(an)<n: an+=s[i%k] i+=1 print(an) ```	3	MatrixStudio/Codeforces-Python-Submissions
622	A	Infinite Sequence	PROGRAMMING	1,000	[ "implementation", "math" ]		null	null	Consider the infinite sequence of integers: 1,<=1,<=2,<=1,<=2,<=3,<=1,<=2,<=3,<=4,<=1,<=2,<=3,<=4,<=5.... The sequence is built in the following way: at first the number 1 is written out, then the numbers from 1 to 2, then the numbers from 1 to 3, then the numbers from 1 to 4 and so on. Note that the sequence contains ...	The only line contains integer n (1<=≤<=n<=≤<=1014) — the position of the number to find. Note that the given number is too large, so you should use 64-bit integer type to store it. In C++ you can use the long long integer type and in Java you can use long integer type.	Print the element in the n-th position of the sequence (the elements are numerated from one).	[ "3\n", "5\n", "10\n", "55\n", "56\n" ]	[ "2\n", "2\n", "4\n", "10\n", "1\n" ]	none	0	[ { "input": "3", "output": "2" }, { "input": "5", "output": "2" }, { "input": "10", "output": "4" }, { "input": "55", "output": "10" }, { "input": "56", "output": "1" }, { "input": "1000000000000", "output": "88209" }, { "input": "8471941278...	1,540,806,545	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	10	1,000	0	n=int(input()) i=1 while (i<n) : n=n-i i=i+1 print (n)	Title: Infinite Sequence Time Limit: None seconds Memory Limit: None megabytes Problem Description: Consider the infinite sequence of integers: 1,<=1,<=2,<=1,<=2,<=3,<=1,<=2,<=3,<=4,<=1,<=2,<=3,<=4,<=5.... The sequence is built in the following way: at first the number 1 is written out, then the numbers from 1 to 2,...	```python n=int(input()) i=1 while (i<n) : n=n-i i=i+1 print (n) ```	0	MatrixStudio/Codeforces-Python-Submissions
706	B	Interesting drink	PROGRAMMING	1,100	[ "binary search", "dp", "implementation" ]		null	null	Vasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink "Beecola", which can be bought in n different shops in the city. It's known that the price of one bottle in the shop i is equal to xi coins. Vasiliy plans to buy his favorite ...	The first line of the input contains a single integer n (1<=≤<=n<=≤<=100<=000) — the number of shops in the city that sell Vasiliy's favourite drink. The second line contains n integers xi (1<=≤<=xi<=≤<=100<=000) — prices of the bottles of the drink in the i-th shop. The third line contains a single i...	Print q integers. The i-th of them should be equal to the number of shops where Vasiliy will be able to buy a bottle of the drink on the i-th day.	[ "5\n3 10 8 6 11\n4\n1\n10\n3\n11\n" ]	[ "0\n4\n1\n5\n" ]	On the first day, Vasiliy won't be able to buy a drink in any of the shops. On the second day, Vasiliy can buy a drink in the shops 1, 2, 3 and 4. On the third day, Vasiliy can buy a drink only in the shop number 1. Finally, on the last day Vasiliy can buy a drink in any shop.	1,000	[ { "input": "5\n3 10 8 6 11\n4\n1\n10\n3\n11", "output": "0\n4\n1\n5" }, { "input": "5\n868 987 714 168 123\n10\n424\n192\n795\n873\n117\n914\n735\n158\n631\n471", "output": "2\n2\n3\n4\n0\n4\n3\n1\n2\n2" }, { "input": "3\n435 482 309\n7\n245\n241\n909\n745\n980\n29\n521", "output": "...	1,699,693,977	2,147,483,647	Python 3	OK	TESTS	103	764	13,414,400	import bisect n=int(input()) xi=[i for i in map(int,input().split())] xi.sort() q=int(input()) for _ in range(q): m=int(input()) print(bisect.bisect_right(xi,m))	Title: Interesting drink Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink "Beecola", which can be bought in n different shops in the city. It's known tha...	```python import bisect n=int(input()) xi=[i for i in map(int,input().split())] xi.sort() q=int(input()) for _ in range(q): m=int(input()) print(bisect.bisect_right(xi,m)) ```	3	MatrixStudio/Codeforces-Python-Submissions
6	E	Exposition	PROGRAMMING	1,900	[ "binary search", "data structures", "dsu", "trees", "two pointers" ]	E. Exposition	1	64	There are several days left before the fiftieth birthday of a famous Berland's writer Berlbury. In this connection the local library decided to make an exposition of the works of this famous science-fiction writer. It was decided as well that it is necessary to include into the exposition only those books that were pub...	The first line of the input data contains two integer numbers separated by a space n (1<=≤<=n<=≤<=105) and k (0<=≤<=k<=≤<=106) — the amount of books by Berlbury in the library, and the maximum allowed height difference between the lowest and the highest books. The second line contains n integer numbers separa...	In the first line of the output data print two numbers a and b (separate them by a space), where a is the maximum amount of books the organizers can include into the exposition, and b — the amount of the time periods, during which Berlbury published a books, and the height difference between the lowest and th...	[ "3 3\n14 12 10\n", "2 0\n10 10\n", "4 5\n8 19 10 13\n" ]	[ "2 2\n1 2\n2 3\n", "2 1\n1 2\n", "2 1\n3 4\n" ]	none	0	[ { "input": "3 3\n14 12 10", "output": "2 2\n1 2\n2 3" }, { "input": "2 0\n10 10", "output": "2 1\n1 2" }, { "input": "4 5\n8 19 10 13", "output": "2 1\n3 4" }, { "input": "1 1\n1", "output": "1 1\n1 1" }, { "input": "2 10\n35 45", "output": "2 1\n1 2" }, {...	1,585,142,237	2,147,483,647	PyPy 3	TIME_LIMIT_EXCEEDED	TESTS	35	1,500	11,776,000	from bisect import * import sys [n, k] = [int(i) for i in input().split()]; h = [int(i) for i in input().split()]; l = []; q = []; aa = -1 j = 0; if (h[0] == 7018): print(100000, 1); print(1, 100000); sys.exit(); for i in range(n): l.insert(bisect(l, h[i]), h[i]); while (l[-1] - l[...	Title: Exposition Time Limit: 1 seconds Memory Limit: 64 megabytes Problem Description: There are several days left before the fiftieth birthday of a famous Berland's writer Berlbury. In this connection the local library decided to make an exposition of the works of this famous science-fiction writer. It was decided...	```python from bisect import * import sys [n, k] = [int(i) for i in input().split()]; h = [int(i) for i in input().split()]; l = []; q = []; aa = -1 j = 0; if (h[0] == 7018): print(100000, 1); print(1, 100000); sys.exit(); for i in range(n): l.insert(bisect(l, h[i]), h[i]); while (...	0	MatrixStudio/Codeforces-Python-Submissions
405	A	Gravity Flip	PROGRAMMING	900	[ "greedy", "implementation", "sortings" ]		null	null	Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity. There are n columns of toy cubes in the box arranged in a line. The i-th column contains ai cubes. At first, the gravity in the box is...	The first line of input contains an integer n (1<=≤<=n<=≤<=100), the number of the columns in the box. The next line contains n space-separated integer numbers. The i-th number ai (1<=≤<=ai<=≤<=100) denotes the number of cubes in the i-th column.	Output n integer numbers separated by spaces, where the i-th number is the amount of cubes in the i-th column after the gravity switch.	[ "4\n3 2 1 2\n", "3\n2 3 8\n" ]	[ "1 2 2 3 \n", "2 3 8 \n" ]	The first example case is shown on the figure. The top cube of the first column falls to the top of the last column; the top cube of the second column falls to the top of the third column; the middle cube of the first column falls to the top of the second column. In the second example case the gravity switch does not ...	500	[ { "input": "4\n3 2 1 2", "output": "1 2 2 3 " }, { "input": "3\n2 3 8", "output": "2 3 8 " }, { "input": "5\n2 1 2 1 2", "output": "1 1 2 2 2 " }, { "input": "1\n1", "output": "1 " }, { "input": "2\n4 3", "output": "3 4 " }, { "input": "6\n100 40 60 20...	1,686,721,769	2,147,483,647	Python 3	OK	TESTS	32	46	0	n = int(input()) cubes_list = list(map(int, input().split())) cubes_list.sort() for cube in cubes_list: print(cube, end=' ')	Title: Gravity Flip Time Limit: None seconds Memory Limit: None megabytes Problem Description: Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity. There are n columns of toy cubes in the bo...	```python n = int(input()) cubes_list = list(map(int, input().split())) cubes_list.sort() for cube in cubes_list: print(cube, end=' ') ```	3	MatrixStudio/Codeforces-Python-Submissions
600	B	Queries about less or equal elements	PROGRAMMING	1,300	[ "binary search", "data structures", "sortings", "two pointers" ]		null	null	You are given two arrays of integers a and b. For each element of the second array bj you should find the number of elements in array a that are less than or equal to the value bj.	The first line contains two integers n,<=m (1<=≤<=n,<=m<=≤<=2·105) — the sizes of arrays a and b. The second line contains n integers — the elements of array a (<=-<=109<=≤<=ai<=≤<=109). The third line contains m integers — the elements of array b (<=-<=109<=≤<=bj<=≤<=109).	Print m integers, separated by spaces: the j-th of which is equal to the number of such elements in array a that are less than or equal to the value bj.	[ "5 4\n1 3 5 7 9\n6 4 2 8\n", "5 5\n1 2 1 2 5\n3 1 4 1 5\n" ]	[ "3 2 1 4\n", "4 2 4 2 5\n" ]	none	0	[ { "input": "5 4\n1 3 5 7 9\n6 4 2 8", "output": "3 2 1 4" }, { "input": "5 5\n1 2 1 2 5\n3 1 4 1 5", "output": "4 2 4 2 5" }, { "input": "1 1\n-1\n-2", "output": "0" }, { "input": "1 1\n-80890826\n686519510", "output": "1" }, { "input": "11 11\n237468511 -77918754...	1,639,599,596	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	8	2,000	1,024,000	n, m = map(int, input().split()) arrA = list(map(int, input().split())) arrB = list(map(int, input().split())) arrA.sort() resp = [] for c in range(len(arrB)): aux = arrB[c] pointer1 = (len(arrA) - 1)//2 pointer2 = len(arrA) - 1 if(arrA[pointer1] <= aux): while(pointer1 <= pointer2): if(arrA[poin...	Title: Queries about less or equal elements Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given two arrays of integers a and b. For each element of the second array bj you should find the number of elements in array a that are less than or equal to the value bj. In...	```python n, m = map(int, input().split()) arrA = list(map(int, input().split())) arrB = list(map(int, input().split())) arrA.sort() resp = [] for c in range(len(arrB)): aux = arrB[c] pointer1 = (len(arrA) - 1)//2 pointer2 = len(arrA) - 1 if(arrA[pointer1] <= aux): while(pointer1 <= pointer2): if...	0	MatrixStudio/Codeforces-Python-Submissions
869	B	The Eternal Immortality	PROGRAMMING	1,100	[ "math" ]		null	null	Even if the world is full of counterfeits, I still regard it as wonderful. Pile up herbs and incense, and arise again from the flames and ashes of its predecessor — as is known to many, the phoenix does it like this. The phoenix has a rather long lifespan, and reincarnates itself once every a! years. Here a! deno...	The first and only line of input contains two space-separated integers a and b (0<=≤<=a<=≤<=b<=≤<=1018).	Output one line containing a single decimal digit — the last digit of the value that interests Koyomi.	[ "2 4\n", "0 10\n", "107 109\n" ]	[ "2\n", "0\n", "2\n" ]	In the first example, the last digit of <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/99c47ca8b182f097e38094d12f0c06ce0b081b76.png" style="max-width: 100.0%;max-height: 100.0%;"/> is 2; In the second example, the last digit of <img align="middle" class="tex-formula" src="https://espresso...	1,000	[ { "input": "2 4", "output": "2" }, { "input": "0 10", "output": "0" }, { "input": "107 109", "output": "2" }, { "input": "10 13", "output": "6" }, { "input": "998244355 998244359", "output": "4" }, { "input": "999999999000000000 1000000000000000000", ...	1,512,707,439	2,147,483,647	Python 3	OK	TESTS	63	62	5,529,600	a, b = map(int, input().split()) x = 1 for i in range(a+1, b + 1): x *= i x = x % 10 if x == 0: break print(x)	Title: The Eternal Immortality Time Limit: None seconds Memory Limit: None megabytes Problem Description: Even if the world is full of counterfeits, I still regard it as wonderful. Pile up herbs and incense, and arise again from the flames and ashes of its predecessor — as is known to many, the phoenix does it like...	```python a, b = map(int, input().split()) x = 1 for i in range(a+1, b + 1): x *= i x = x % 10 if x == 0: break print(x) ```	3	MatrixStudio/Codeforces-Python-Submissions
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,639,142,616	2,147,483,647	Python 3	OK	TESTS	26	62	0	n, m = map(int, input().split()) days = 0 step = 0 while n != 0: step += 1 if step == m: n += 1 step = 0 n -= 1 days += 1 print(days)	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()) days = 0 step = 0 while n != 0: step += 1 if step == m: n += 1 step = 0 n -= 1 days += 1 print(days) ```	3	MatrixStudio/Codeforces-Python-Submissions
412	B	Network Configuration	PROGRAMMING	900	[ "greedy", "sortings" ]		null	null	The R1 company wants to hold a web search championship. There were n computers given for the competition, each of them is connected to the Internet. The organizers believe that the data transfer speed directly affects the result. The higher the speed of the Internet is, the faster the participant will find the necess...	The first line contains two space-separated integers n and k (1<=≤<=k<=≤<=n<=≤<=100) — the number of computers and the number of participants, respectively. In the second line you have a space-separated sequence consisting of n integers: a1,<=a2,<=...,<=an (16<=≤<=ai<=≤<=32768); number ai deno...	Print a single integer — the maximum Internet speed value. It is guaranteed that the answer to the problem is always an integer.	[ "3 2\n40 20 30\n", "6 4\n100 20 40 20 50 50\n" ]	[ "30\n", "40\n" ]	In the first test case the organizers can cut the first computer's speed to 30 kilobits. Then two computers (the first and the third one) will have the same speed of 30 kilobits. They should be used as the participants' computers. This answer is optimal.	1,000	[ { "input": "3 2\n40 20 30", "output": "30" }, { "input": "6 4\n100 20 40 20 50 50", "output": "40" }, { "input": "1 1\n16", "output": "16" }, { "input": "2 1\n10000 17", "output": "10000" }, { "input": "2 2\n200 300", "output": "200" }, { "input": "3 1...	1,398,849,367	1,867	Python 3	OK	TESTS	34	62	0	n, k = map(int, input().split()) S = sorted(list(map(int, input().split()))) maxim = S[-1 * k] print(maxim)	Title: Network Configuration Time Limit: None seconds Memory Limit: None megabytes Problem Description: The R1 company wants to hold a web search championship. There were n computers given for the competition, each of them is connected to the Internet. The organizers believe that the data transfer speed directly a...	```python n, k = map(int, input().split()) S = sorted(list(map(int, input().split()))) maxim = S[-1 * k] print(maxim) ```	3	MatrixStudio/Codeforces-Python-Submissions
205	A	Little Elephant and Rozdil	PROGRAMMING	900	[ "brute force", "implementation" ]		null	null	The Little Elephant loves Ukraine very much. Most of all he loves town Rozdol (ukr. "Rozdil"). However, Rozdil is dangerous to settle, so the Little Elephant wants to go to some other town. The Little Elephant doesn't like to spend much time on travelling, so for his journey he will choose a town that needs minimum ti...	The first line contains a single integer n (1<=≤<=n<=≤<=105) — the number of cities. The next line contains n integers, separated by single spaces: the i-th integer represents the time needed to go from town Rozdil to the i-th town. The time values are positive integers, not exceeding 109. You can consider t...	Print the answer on a single line — the number of the town the Little Elephant will go to. If there are multiple cities with minimum travel time, print "Still Rozdil" (without the quotes).	[ "2\n7 4\n", "7\n7 4 47 100 4 9 12\n" ]	[ "2\n", "Still Rozdil\n" ]	In the first sample there are only two cities where the Little Elephant can go. The travel time for the first town equals 7, to the second one — 4. The town which is closest to Rodzil (the only one) is the second one, so the answer is 2. In the second sample the closest cities are cities two and five, the travelling t...	500	[ { "input": "2\n7 4", "output": "2" }, { "input": "7\n7 4 47 100 4 9 12", "output": "Still Rozdil" }, { "input": "1\n47", "output": "1" }, { "input": "2\n1000000000 1000000000", "output": "Still Rozdil" }, { "input": "7\n7 6 5 4 3 2 1", "output": "7" }, { ...	1,626,253,546	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	124	6,963,200	n = int(input()) s = list(map(int, input().split())) m = s[0] c = 1 ind = 0 for i in range(1, n): if s[i]==m : c += 1 elif s[i]<m: m = s[i] c = 1 ind = i if c>1: print("Still Rozdill") else : print(ind+1)	Title: Little Elephant and Rozdil Time Limit: None seconds Memory Limit: None megabytes Problem Description: The Little Elephant loves Ukraine very much. Most of all he loves town Rozdol (ukr. "Rozdil"). However, Rozdil is dangerous to settle, so the Little Elephant wants to go to some other town. The Little Elepha...	```python n = int(input()) s = list(map(int, input().split())) m = s[0] c = 1 ind = 0 for i in range(1, n): if s[i]==m : c += 1 elif s[i]<m: m = s[i] c = 1 ind = i if c>1: print("Still Rozdill") else : print(ind+1) ```	0	MatrixStudio/Codeforces-Python-Submissions
841	A	Generous Kefa	PROGRAMMING	900	[ "brute force", "implementation" ]		null	null	One day Kefa found n baloons. For convenience, we denote color of i-th baloon as si — lowercase letter of the Latin alphabet. Also Kefa has k friends. Friend will be upset, If he get two baloons of the same color. Kefa want to give out all baloons to his friends. Help Kefa to find out, can he give out all his...	The first line contains two integers n and k (1<=≤<=n,<=k<=≤<=100) — the number of baloons and friends. Next line contains string s — colors of baloons.	Answer to the task — «YES» or «NO» in a single line. You can choose the case (lower or upper) for each letter arbitrary.	[ "4 2\naabb\n", "6 3\naacaab\n" ]	[ "YES\n", "NO\n" ]	In the first sample Kefa can give 1-st and 3-rd baloon to the first friend, and 2-nd and 4-th to the second. In the second sample Kefa needs to give to all his friends baloons of color a, but one baloon will stay, thats why answer is «NO».	500	[ { "input": "4 2\naabb", "output": "YES" }, { "input": "6 3\naacaab", "output": "NO" }, { "input": "2 2\nlu", "output": "YES" }, { "input": "5 3\novvoo", "output": "YES" }, { "input": "36 13\nbzbzcffczzcbcbzzfzbbfzfzzbfbbcbfccbf", "output": "YES" }, { "...	1,650,860,988	2,147,483,647	Python 3	OK	TESTS	114	78	4,505,600	from collections import deque from collections import OrderedDict import queue import heapq import math from re import I import sys sys.setrecursionlimit(10**6) def sf(): return [int(x) for x in input().split(" ")] def sfi(): return int(input()) def sfs(): return input() def printf(x): print(x) ...	Title: Generous Kefa Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day Kefa found n baloons. For convenience, we denote color of i-th baloon as si — lowercase letter of the Latin alphabet. Also Kefa has k friends. Friend will be upset, If he get two baloons of the same colo...	```python from collections import deque from collections import OrderedDict import queue import heapq import math from re import I import sys sys.setrecursionlimit(10**6) def sf(): return [int(x) for x in input().split(" ")] def sfi(): return int(input()) def sfs(): return input() def printf(x): prin...	3	MatrixStudio/Codeforces-Python-Submissions
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,379,284	2,147,483,647	Python 3	OK	TESTS	29	92	0	n=int(input()) lst=list(map(int,input().split())) lst.sort(reverse=True) sum1=sum(lst) sum2=0 count=0 for i in lst: sum2+=i sum1-=i if sum2<=sum1: count+=1 else: break print(count+1)	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()) lst=list(map(int,input().split())) lst.sort(reverse=True) sum1=sum(lst) sum2=0 count=0 for i in lst: sum2+=i sum1-=i if sum2<=sum1: count+=1 else: break print(count+1) ```	3	MatrixStudio/Codeforces-Python-Submissions

Subsets and Splits

No community queries yet

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