Split (2)

train · 621k rows

contestId int64 0 1.01k	index stringclasses 57 values	name stringlengths 2 58	type stringclasses 2 values	rating int64 0 3.5k	tags listlengths 0 11	title stringclasses 522 values	time-limit stringclasses 8 values	memory-limit stringclasses 8 values	problem-description stringlengths 0 7.15k	input-specification stringlengths 0 2.05k	output-specification stringlengths 0 1.5k	demo-input listlengths 0 7	demo-output listlengths 0 7	note stringlengths 0 5.24k	points float64 0 425k	test_cases listlengths 0 402	creationTimeSeconds int64 1.37B 1.7B	relativeTimeSeconds int64 8 2.15B	programmingLanguage stringclasses 3 values	verdict stringclasses 14 values	testset stringclasses 12 values	passedTestCount int64 0 1k	timeConsumedMillis int64 0 15k	memoryConsumedBytes int64 0 805M	code stringlengths 3 65.5k	prompt stringlengths 262 8.2k	response stringlengths 17 65.5k	score float64 -1 3.99
197	A	Plate Game	PROGRAMMING	1,600	[ "constructive algorithms", "games", "math" ]		null	null	You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so that the plates don't lie on each other (but they can touch each other), and so that any point on any plate is located with...	A single line contains three space-separated integers a, b, r (1<=≤<=a,<=b,<=r<=≤<=100) — the table sides and the plates' radius, correspondingly.	If wins the player who moves first, print "First" (without the quotes). Otherwise print "Second" (without the quotes).	[ "5 5 2\n", "6 7 4\n" ]	[ "First\n", "Second\n" ]	In the first sample the table has place for only one plate. The first player puts a plate on the table, the second player can't do that and loses. In the second sample the table is so small that it doesn't have enough place even for one plate. So the first player loses without making a single move.	1,000	[ { "input": "5 5 2", "output": "First" }, { "input": "6 7 4", "output": "Second" }, { "input": "100 100 1", "output": "First" }, { "input": "1 1 100", "output": "Second" }, { "input": "13 7 3", "output": "First" }, { "input": "23 7 3", "output": "Fi...	1,498,820,408	308	Python 3	OK	TESTS	95	124	5,529,600	from sys import stdin, stdout a, b, r = map(int, stdin.readline().split()) if r * 2 <= a and r * 2 <= b: stdout.write('First') else: stdout.write('Second')	Title: Plate Game Time Limit: None seconds Memory Limit: None megabytes Problem Description: You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so that the plates don't lie o...	```python from sys import stdin, stdout a, b, r = map(int, stdin.readline().split()) if r * 2 <= a and r * 2 <= b: stdout.write('First') else: stdout.write('Second') ```	3
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,628,126	2,147,483,647	Python 3	OK	TESTS	45	61	0	# -- coding: utf-8 -- """ Created on Tue Oct 19 13:47:19 2021 @author: 86188 """ n,m=map(int,input().split()) lis = [] for i in range(m): lis.append(0) for i in range(n): a = [int(x) for x in input().split()] for j in range(1,len(a)): lis[a[j]-1] = 1 if (0 in lis): print('NO')...	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 # -- coding: utf-8 -- """ Created on Tue Oct 19 13:47:19 2021 @author: 86188 """ n,m=map(int,input().split()) lis = [] for i in range(m): lis.append(0) for i in range(n): a = [int(x) for x in input().split()] for j in range(1,len(a)): lis[a[j]-1] = 1 if (0 in lis): p...	3
902	A	Visiting a Friend	PROGRAMMING	1,100	[ "greedy", "implementation" ]		null	null	Pig is visiting a friend. Pig's house is located at point 0, and his friend's house is located at point m on an axis. Pig can use teleports to move along the axis. To use a teleport, Pig should come to a certain point (where the teleport is located) and choose where to move: for each teleport there is the rightmos...	The first line contains two integers n and m (1<=≤<=n<=≤<=100,<=1<=≤<=m<=≤<=100) — the number of teleports and the location of the friend's house. The next n lines contain information about teleports. The i-th of these lines contains two integers ai and bi (0<=≤<=ai<=≤<=bi<=≤<=m), where ...	Print "YES" if there is a path from Pig's house to his friend's house that uses only teleports, and "NO" otherwise. You can print each letter in arbitrary case (upper or lower).	[ "3 5\n0 2\n2 4\n3 5\n", "3 7\n0 4\n2 5\n6 7\n" ]	[ "YES\n", "NO\n" ]	The first example is shown on the picture below: Pig can use the first teleport from his house (point 0) to reach point 2, then using the second teleport go from point 2 to point 3, then using the third teleport go from point 3 to point 5, where his friend lives. The second example is shown on the picture below: You...	500	[ { "input": "3 5\n0 2\n2 4\n3 5", "output": "YES" }, { "input": "3 7\n0 4\n2 5\n6 7", "output": "NO" }, { "input": "1 1\n0 0", "output": "NO" }, { "input": "30 10\n0 7\n1 2\n1 2\n1 4\n1 4\n1 3\n2 2\n2 4\n2 6\n2 9\n2 2\n3 5\n3 8\n4 8\n4 5\n4 6\n5 6\n5 7\n6 6\n6 9\n6 7\n6 9\n7 7...	1,520,228,494	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	46	5,632,000	n, m = list(map(int, input().split())) a=[] b=[] for i in range(n): j, k = list(map(int, input().split())) a += [j] b += [k] line = [0] * (2 * m) for k in range(n): for p in range(a[k] - b[k], a[k] + b[k]): line[p] += 1 if 0 in line[:m+1]: print('NO') else: print('YES...	Title: Visiting a Friend Time Limit: None seconds Memory Limit: None megabytes Problem Description: Pig is visiting a friend. Pig's house is located at point 0, and his friend's house is located at point m on an axis. Pig can use teleports to move along the axis. To use a teleport, Pig should come to a certain ...	```python n, m = list(map(int, input().split())) a=[] b=[] for i in range(n): j, k = list(map(int, input().split())) a += [j] b += [k] line = [0] * (2 * m) for k in range(n): for p in range(a[k] - b[k], a[k] + b[k]): line[p] += 1 if 0 in line[:m+1]: print('NO') else: ...	0
822	A	I'm bored with life	PROGRAMMING	800	[ "implementation", "math", "number theory" ]		null	null	Holidays have finished. Thanks to the help of the hacker Leha, Noora managed to enter the university of her dreams which is located in a town Pavlopolis. It's well known that universities provide students with dormitory for the period of university studies. Consequently Noora had to leave Vičkopolis and move to Pavlopo...	The first and single line contains two integers A and B (1<=≤<=A,<=B<=≤<=109,<=min(A,<=B)<=≤<=12).	Print a single integer denoting the greatest common divisor of integers A! and B!.	[ "4 3\n" ]	[ "6\n" ]	Consider the sample. 4! = 1·2·3·4 = 24. 3! = 1·2·3 = 6. The greatest common divisor of integers 24 and 6 is exactly 6.	500	[ { "input": "4 3", "output": "6" }, { "input": "10 399603090", "output": "3628800" }, { "input": "6 973151934", "output": "720" }, { "input": "2 841668075", "output": "2" }, { "input": "7 415216919", "output": "5040" }, { "input": "3 283733059", "ou...	1,638,648,157	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	15	0	import math a=int(input()) b=int(input()) product1=1 product2=1 for i in range(2,a+1): product1=i ans1=product1 for i in range(2,b+1): product2=i ans2=product2 print(math.gcd(ans1,ans2))	Title: I'm bored with life Time Limit: None seconds Memory Limit: None megabytes Problem Description: Holidays have finished. Thanks to the help of the hacker Leha, Noora managed to enter the university of her dreams which is located in a town Pavlopolis. It's well known that universities provide students with dormi...	```python import math a=int(input()) b=int(input()) product1=1 product2=1 for i in range(2,a+1): product1=i ans1=product1 for i in range(2,b+1): product2=i ans2=product2 print(math.gcd(ans1,ans2)) ```	-1
208	A	Dubstep	PROGRAMMING	900	[ "strings" ]		null	null	Vasya works as a DJ in the best Berland nightclub, and he often uses dubstep music in his performance. Recently, he has decided to take a couple of old songs and make dubstep remixes from them. Let's assume that a song consists of some number of words. To make the dubstep remix of this song, Vasya inserts a certain nu...	The input consists of a single non-empty string, consisting only of uppercase English letters, the string's length doesn't exceed 200 characters. It is guaranteed that before Vasya remixed the song, no word contained substring "WUB" in it; Vasya didn't change the word order. It is also guaranteed that initially the son...	Print the words of the initial song that Vasya used to make a dubsteb remix. Separate the words with a space.	[ "WUBWUBABCWUB\n", "WUBWEWUBAREWUBWUBTHEWUBCHAMPIONSWUBMYWUBFRIENDWUB\n" ]	[ "ABC ", "WE ARE THE CHAMPIONS MY FRIEND " ]	In the first sample: "WUBWUBABCWUB" = "WUB" + "WUB" + "ABC" + "WUB". That means that the song originally consisted of a single word "ABC", and all words "WUB" were added by Vasya. In the second sample Vasya added a single word "WUB" between all neighbouring words, in the beginning and in the end, except for words "ARE...	500	[ { "input": "WUBWUBABCWUB", "output": "ABC " }, { "input": "WUBWEWUBAREWUBWUBTHEWUBCHAMPIONSWUBMYWUBFRIENDWUB", "output": "WE ARE THE CHAMPIONS MY FRIEND " }, { "input": "WUBWUBWUBSR", "output": "SR " }, { "input": "RWUBWUBWUBLWUB", "output": "R L " }, { "input": "...	1,677,958,944	2,147,483,647	PyPy 3	OK	TESTS	71	186	0	def rt(a): b=a.replace('WUB', " ") return b a=input() print(rt(a))	Title: Dubstep Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya works as a DJ in the best Berland nightclub, and he often uses dubstep music in his performance. Recently, he has decided to take a couple of old songs and make dubstep remixes from them. Let's assume that a song consist...	```python def rt(a): b=a.replace('WUB', " ") return b a=input() print(rt(a)) ```	3
431	C	k-Tree	PROGRAMMING	1,600	[ "dp", "implementation", "trees" ]		null	null	Quite recently a creative student Lesha had a lecture on trees. After the lecture Lesha was inspired and came up with the tree of his own which he called a k-tree. A k-tree is an infinite rooted tree where: - each vertex has exactly k children; - each edge has some weight; - if we look at the edges that goes...	A single line contains three space-separated integers: n, k and d (1<=≤<=n,<=k<=≤<=100; 1<=≤<=d<=≤<=k).	Print a single integer — the answer to the problem modulo 1000000007 (109<=+<=7).	[ "3 3 2\n", "3 3 3\n", "4 3 2\n", "4 5 2\n" ]	[ "3\n", "1\n", "6\n", "7\n" ]	none	1,500	[ { "input": "3 3 2", "output": "3" }, { "input": "3 3 3", "output": "1" }, { "input": "4 3 2", "output": "6" }, { "input": "4 5 2", "output": "7" }, { "input": "28 6 3", "output": "110682188" }, { "input": "5 100 1", "output": "16" }, { "inp...	1,660,918,558	2,147,483,647	PyPy 3	OK	TESTS	54	233	6,348,800	m,n,k = map(int , input().split()) count = 0 cache = {} def backtrack(node=0 , weight=0 , flag=0): if (node , weight , flag) in cache: return cache[(node , weight, flag)] if weight > m : return 0 if weight == m and flag: return 1 res = 0 for i in ra...	Title: k-Tree Time Limit: None seconds Memory Limit: None megabytes Problem Description: Quite recently a creative student Lesha had a lecture on trees. After the lecture Lesha was inspired and came up with the tree of his own which he called a k-tree. A k-tree is an infinite rooted tree where: - each vertex ...	```python m,n,k = map(int , input().split()) count = 0 cache = {} def backtrack(node=0 , weight=0 , flag=0): if (node , weight , flag) in cache: return cache[(node , weight, flag)] if weight > m : return 0 if weight == m and flag: return 1 res = 0 f...	3
41	A	Translation	PROGRAMMING	800	[ "implementation", "strings" ]	A. Translation	2	256	The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) reversely. For example, a Berlandish word code corresponds to a Birlandish word edoc....	The first line contains word s, the second line contains word t. The words consist of lowercase Latin letters. The input data do not consist unnecessary spaces. The words are not empty and their lengths do not exceed 100 symbols.	If the word t is a word s, written reversely, print YES, otherwise print NO.	[ "code\nedoc\n", "abb\naba\n", "code\ncode\n" ]	[ "YES\n", "NO\n", "NO\n" ]	none	500	[ { "input": "code\nedoc", "output": "YES" }, { "input": "abb\naba", "output": "NO" }, { "input": "code\ncode", "output": "NO" }, { "input": "abacaba\nabacaba", "output": "YES" }, { "input": "q\nq", "output": "YES" }, { "input": "asrgdfngfnmfgnhweratgjkk...	1,669,992,262	2,147,483,647	PyPy 3	RUNTIME_ERROR	TESTS	0	154	2,150,400	import os s=input() t=input() x=s.reverse() if t==x: print("YES") else: print("NO")	Title: Translation Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pron...	```python import os s=input() t=input() x=s.reverse() if t==x: print("YES") else: print("NO") ```	-1
364	A	Matrix	PROGRAMMING	1,600	[ "combinatorics", "data structures", "implementation" ]		null	null	You have a string of decimal digits s. Let's define bij<==<=si·sj. Find in matrix b the number of such rectangles that the sum bij for all cells (i,<=j) that are the elements of the rectangle equals a in each rectangle. A rectangle in a matrix is a group of four integers (x,<=y,<=z,<=*t...	The first line contains integer a (0<=≤<=a<=≤<=109), the second line contains a string of decimal integers s (1<=≤<=\|s\|<=≤<=4000).	Print a single integer — the answer to a problem. Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.	[ "10\n12345\n", "16\n439873893693495623498263984765\n" ]	[ "6\n", "40\n" ]	none	500	[ { "input": "10\n12345", "output": "6" }, { "input": "16\n439873893693495623498263984765", "output": "40" }, { "input": "0\n1230", "output": "19" }, { "input": "8398\n67950927224842887617892831243606761170908507858527", "output": "0" }, { "input": "2\n11", "out...	1,514,028,998	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	2	1,000	6,348,800	#!/usr/bin/env python3 # -- coding: utf-8 -- a=int(input()) M=a*(1/2) arr=[0](a+1) s=input() l=len(s) n=[int(c) for c in s] for i in range(l): for j in range(i,l): ts=sum(n[i:j+1]) if 0<ts<=a: arr[ts]+=1 ans=0 for x in range(1,a+1): if x>M:break if a%x==0: ...	Title: Matrix Time Limit: None seconds Memory Limit: None megabytes Problem Description: You have a string of decimal digits s. Let's define bij<==<=si·sj. Find in matrix b the number of such rectangles that the sum bij for all cells (i,<=j) that are the elements of the rectangle equals a i...	```python #!/usr/bin/env python3 # -- coding: utf-8 -- a=int(input()) M=a*(1/2) arr=[0](a+1) s=input() l=len(s) n=[int(c) for c in s] for i in range(l): for j in range(i,l): ts=sum(n[i:j+1]) if 0<ts<=a: arr[ts]+=1 ans=0 for x in range(1,a+1): if x>M:break if a...	0
574	B	Bear and Three Musketeers	PROGRAMMING	1,500	[ "brute force", "dfs and similar", "graphs", "hashing" ]		null	null	Do you know a story about the three musketeers? Anyway, you will learn about its origins now. Richelimakieu is a cardinal in the city of Bearis. He is tired of dealing with crime by himself. He needs three brave warriors to help him to fight against bad guys. There are n warriors. Richelimakieu wants to choose thre...	The first line contains two space-separated integers, n and m (3<=≤<=n<=≤<=4000, 0<=≤<=m<=≤<=4000) — respectively number of warriors and number of pairs of warriors knowing each other. i-th of the following m lines contains two space-separated integers ai and bi (1<=≤<=ai,<=bi<=≤<=n, a*...	If Richelimakieu can choose three musketeers, print the minimum possible sum of their recognitions. Otherwise, print "-1" (without the quotes).	[ "5 6\n1 2\n1 3\n2 3\n2 4\n3 4\n4 5\n", "7 4\n2 1\n3 6\n5 1\n1 7\n" ]	[ "2\n", "-1\n" ]	In the first sample Richelimakieu should choose a triple 1, 2, 3. The first musketeer doesn't know anyone except other two musketeers so his recognition is 0. The second musketeer has recognition 1 because he knows warrior number 4. The third musketeer also has recognition 1 because he knows warrior 4. Sum of recogniti...	1,000	[ { "input": "5 6\n1 2\n1 3\n2 3\n2 4\n3 4\n4 5", "output": "2" }, { "input": "7 4\n2 1\n3 6\n5 1\n1 7", "output": "-1" }, { "input": "5 0", "output": "-1" }, { "input": "7 14\n3 6\n2 3\n5 2\n5 6\n7 5\n7 4\n6 2\n3 5\n7 1\n4 1\n6 1\n7 6\n6 4\n5 4", "output": "5" }, { ...	1,647,914,871	2,147,483,647	Python 3	OK	TESTS	40	1,247	204,800	# # https://codeforces.com/blog/entry/20040 # import sys # N, M = 4000 + 10, 4000 + 10 # n, m = map(int, input().split()) # g = [[0] * N for _ in range(N)] # deg = [0] * N # for _ in range(m): # u, v = map(int, input().split()) # g[u][v] = 1 # g[v][u] = 1 # deg[u] += 1 # deg[v] += 1 # ans = sys.max...	Title: Bear and Three Musketeers Time Limit: None seconds Memory Limit: None megabytes Problem Description: Do you know a story about the three musketeers? Anyway, you will learn about its origins now. Richelimakieu is a cardinal in the city of Bearis. He is tired of dealing with crime by himself. He needs three br...	```python # # https://codeforces.com/blog/entry/20040 # import sys # N, M = 4000 + 10, 4000 + 10 # n, m = map(int, input().split()) # g = [[0] * N for _ in range(N)] # deg = [0] * N # for _ in range(m): # u, v = map(int, input().split()) # g[u][v] = 1 # g[v][u] = 1 # deg[u] += 1 # deg[v] += 1 # ans...	3
621	A	Wet Shark and Odd and Even	PROGRAMMING	900	[ "implementation" ]		null	null	Today, Wet Shark is given n integers. Using any of these integers no more than once, Wet Shark wants to get maximum possible even (divisible by 2) sum. Please, calculate this value for Wet Shark. Note, that if Wet Shark uses no integers from the n integers, the sum is an even integer 0.	The first line of the input contains one integer, n (1<=≤<=n<=≤<=100<=000). The next line contains n space separated integers given to Wet Shark. Each of these integers is in range from 1 to 109, inclusive.	Print the maximum possible even sum that can be obtained if we use some of the given integers.	[ "3\n1 2 3\n", "5\n999999999 999999999 999999999 999999999 999999999\n" ]	[ "6", "3999999996" ]	In the first sample, we can simply take all three integers for a total sum of 6. In the second sample Wet Shark should take any four out of five integers 999 999 999.	500	[ { "input": "3\n1 2 3", "output": "6" }, { "input": "5\n999999999 999999999 999999999 999999999 999999999", "output": "3999999996" }, { "input": "1\n1", "output": "0" }, { "input": "15\n39 52 88 78 46 95 84 98 55 3 68 42 6 18 98", "output": "870" }, { "input": "15\...	1,620,353,175	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	46	6,963,200	l = sorted(map(int, input().split())) s = 0 f = False def num_odd(l): u = 0 for i in l: if i % 2 != 0: u += 1 return u while len(l) > 0: i = l.pop() if i % 2 == 0: s += i elif f: s += i f = False elif (num_odd(l) + 1) % 2 == 0: s += i f = True print(s)	Title: Wet Shark and Odd and Even Time Limit: None seconds Memory Limit: None megabytes Problem Description: Today, Wet Shark is given n integers. Using any of these integers no more than once, Wet Shark wants to get maximum possible even (divisible by 2) sum. Please, calculate this value for Wet Shark. Note, th...	```python l = sorted(map(int, input().split())) s = 0 f = False def num_odd(l): u = 0 for i in l: if i % 2 != 0: u += 1 return u while len(l) > 0: i = l.pop() if i % 2 == 0: s += i elif f: s += i f = False elif (num_odd(l) + 1) % 2 == 0: s += i f = True print(s) ``...	0
962	B	Students in Railway Carriage	PROGRAMMING	1,300	[ "constructive algorithms", "greedy", "implementation" ]		null	null	There are $n$ consecutive seat places in a railway carriage. Each place is either empty or occupied by a passenger. The university team for the Olympiad consists of $a$ student-programmers and $b$ student-athletes. Determine the largest number of students from all $a+b$ students, which you can put in the railway carri...	The first line contain three integers $n$, $a$ and $b$ ($1 \le n \le 2\cdot10^{5}$, $0 \le a, b \le 2\cdot10^{5}$, $a + b > 0$) — total number of seat places in the railway carriage, the number of student-programmers and the number of student-athletes. The second line contains a string with length $n$, consisting o...	Print the largest number of students, which you can put in the railway carriage so that no student-programmer is sitting next to a student-programmer and no student-athlete is sitting next to a student-athlete.	[ "5 1 1\n...\n", "6 2 3\n....\n", "11 3 10\n.......\n", "3 2 3\n***\n" ]	[ "2\n", "4\n", "7\n", "0\n" ]	In the first example you can put all student, for example, in the following way: .AB In the second example you can put four students, for example, in the following way: BABB In the third example you can put seven students, for example, in the following way: BABABAB The letter A means a student-programmer, an...	0	[ { "input": "5 1 1\n...", "output": "2" }, { "input": "6 2 3\n....", "output": "4" }, { "input": "11 3 10\n.......", "output": "7" }, { "input": "3 2 3\n**", "output": "0" }, { "input": "9 5 3\n......", "output": "6" }, { "input": "9 2 4\n*....	1,596,118,444	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	59	2,000	7,987,200	n,a,b=list(map(int,input().split())) z=input().split('*') for i in range(z.count('')): z.remove('') #a 1 #b 2 s=0 for i in range(len(z)): if (a>0 or b>0) and len(z[i])%2==0: for j in range(len(z[i])//2): if a>0: s+=1 a-=1 if b>0: ...	Title: Students in Railway Carriage Time Limit: None seconds Memory Limit: None megabytes Problem Description: There are $n$ consecutive seat places in a railway carriage. Each place is either empty or occupied by a passenger. The university team for the Olympiad consists of $a$ student-programmers and $b$ student-...	```python n,a,b=list(map(int,input().split())) z=input().split('*') for i in range(z.count('')): z.remove('') #a 1 #b 2 s=0 for i in range(len(z)): if (a>0 or b>0) and len(z[i])%2==0: for j in range(len(z[i])//2): if a>0: s+=1 a-=1 ...	0
755	C	PolandBall and Forest	PROGRAMMING	1,300	[ "dfs and similar", "dsu", "graphs", "interactive", "trees" ]		null	null	PolandBall lives in a forest with his family. There are some trees in the forest. Trees are undirected acyclic graphs with k vertices and k<=-<=1 edges, where k is some integer. Note that one vertex is a valid tree. There is exactly one relative living in each vertex of each tree, they have unique ids from 1 to ...	The first line contains single integer n (1<=≤<=n<=≤<=104) — the number of Balls living in the forest. The second line contains a sequence p1,<=p2,<=...,<=pn of length n, where (1<=≤<=pi<=≤<=n) holds and pi denotes the most distant from Ball i relative living on the same tree. If there are se...	You should output the number of trees in the forest where PolandBall lives.	[ "5\n2 1 5 3 3", "1\n1\n" ]	[ "2", "1" ]	In the first sample testcase, possible forest is: 1-2 3-4-5. There are 2 trees overall. In the second sample testcase, the only possible graph is one vertex and no edges. Therefore, there is only one tree.	1,500	[ { "input": "5 3\n1 2\n3 4\n4 5", "output": "2" }, { "input": "1 0", "output": "1" }, { "input": "5 1\n4 5", "output": "4" }, { "input": "10 3\n2 8\n5 9\n6 10", "output": "7" }, { "input": "18 2\n9 17\n1 18", "output": "16" }, { "input": "1 0", "out...	1,615,527,809	2,147,483,647	PyPy 3	TIME_LIMIT_EXCEEDED	TESTS	5	1,000	3,788,800	n=int(input()) p=list(map(int,input().split())) l=[] flag=0 for i in range(n): flag=0 for j in range(len(l)): if p[i] in l[j] or i+1 in l[j]: l[j].add(p[i]) l[j].add(i+1) flag=1 if flag==0: l.append({p[i], i+1}) print(len(l))	Title: PolandBall and Forest Time Limit: None seconds Memory Limit: None megabytes Problem Description: PolandBall lives in a forest with his family. There are some trees in the forest. Trees are undirected acyclic graphs with k vertices and k<=-<=1 edges, where k is some integer. Note that one vertex is a val...	```python n=int(input()) p=list(map(int,input().split())) l=[] flag=0 for i in range(n): flag=0 for j in range(len(l)): if p[i] in l[j] or i+1 in l[j]: l[j].add(p[i]) l[j].add(i+1) flag=1 if flag==0: l.append({p[i], i+1}) print(len(l)) ```	0
71	A	Way Too Long Words	PROGRAMMING	800	[ "strings" ]	A. Way Too Long Words	1	256	Sometimes some words like "localization" or "internationalization" are so long that writing them many times in one text is quite tiresome. Let's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation. This abbreviation is made lik...	The first line contains an integer n (1<=≤<=n<=≤<=100). Each of the following n lines contains one word. All the words consist of lowercase Latin letters and possess the lengths of from 1 to 100 characters.	Print n lines. The i-th line should contain the result of replacing of the i-th word from the input data.	[ "4\nword\nlocalization\ninternationalization\npneumonoultramicroscopicsilicovolcanoconiosis\n" ]	[ "word\nl10n\ni18n\np43s\n" ]	none	500	[ { "input": "4\nword\nlocalization\ninternationalization\npneumonoultramicroscopicsilicovolcanoconiosis", "output": "word\nl10n\ni18n\np43s" }, { "input": "5\nabcdefgh\nabcdefghi\nabcdefghij\nabcdefghijk\nabcdefghijklm", "output": "abcdefgh\nabcdefghi\nabcdefghij\na9k\na11m" }, { "input":...	1,677,581,550	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	31	0	# -- coding: utf-8 -- """Untitled0.ipynb Automatically generated by Colaboratory. Original file is located at https://colab.research.google.com/drive/1Waz_FxYDlUD0mib3FFOT9XKkEDEaQL32 """ #toolong x=int(input()) for i in range(x): p=input() r=str(len(p)-2) q=p[0]+r+p[-1] print(q)	Title: Way Too Long Words Time Limit: 1 seconds Memory Limit: 256 megabytes Problem Description: Sometimes some words like "localization" or "internationalization" are so long that writing them many times in one text is quite tiresome. Let's consider a word too long, if its length is strictly more than 10 character...	```python # -- coding: utf-8 -- """Untitled0.ipynb Automatically generated by Colaboratory. Original file is located at https://colab.research.google.com/drive/1Waz_FxYDlUD0mib3FFOT9XKkEDEaQL32 """ #toolong x=int(input()) for i in range(x): p=input() r=str(len(p)-2) q=p[0]+r+p[-1] print(q) ...	0
136	A	Presents	PROGRAMMING	800	[ "implementation" ]		null	null	Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he organized a New Year party at his place and invited n his friends there. If...	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,687,845,884	2,147,483,647	PyPy 3-64	OK	TESTS	101	124	0	def main(): n = int(input()) friends = list(map(int, input().split(" "))) gifts = [0] * (n + 1) for i in range(1, n + 1): p = friends[i - 1] gifts[p] = i ans = str(gifts[1]) for i in range(2, n + 1): ans += " " + str(gifts[i]) print(ans) if __name...	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 def main(): n = int(input()) friends = list(map(int, input().split(" "))) gifts = [0] * (n + 1) for i in range(1, n + 1): p = friends[i - 1] gifts[p] = i ans = str(gifts[1]) for i in range(2, n + 1): ans += " " + str(gifts[i]) print(ans) ...	3
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,688,153,840	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	60	0	# Read input n = int(input()) heights = list(map(int, input().split())) # Count the number of soldiers whose heights are not in the correct order out_of_order = 0 for i in range(1, n): if heights[i] < heights[i-1]: out_of_order += 1 # Print the result print(out_of_order)	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 # Read input n = int(input()) heights = list(map(int, input().split())) # Count the number of soldiers whose heights are not in the correct order out_of_order = 0 for i in range(1, n): if heights[i] < heights[i-1]: out_of_order += 1 # Print the result print(out_of_order) ```	0
260	B	Ancient Prophesy	PROGRAMMING	1,600	[ "brute force", "implementation", "strings" ]		null	null	A recently found Ancient Prophesy is believed to contain the exact Apocalypse date. The prophesy is a string that only consists of digits and characters "-". We'll say that some date is mentioned in the Prophesy if there is a substring in the Prophesy that is the date's record in the format "dd-mm-yyyy". We'll say tha...	The first line contains the Prophesy: a non-empty string that only consists of digits and characters "-". The length of the Prophesy doesn't exceed 105 characters.	In a single line print the date of the Apocalypse. It is guaranteed that such date exists and is unique.	[ "777-444---21-12-2013-12-2013-12-2013---444-777\n" ]	[ "13-12-2013" ]	none	1,000	[ { "input": "777-444---21-12-2013-12-2013-12-2013---444-777", "output": "13-12-2013" }, { "input": "30-12-201429-15-208830-12-2014", "output": "30-12-2014" }, { "input": "14-08-201314-08-201314-08-201381-16-20172406414-08-201314-08-201314-08-20134237014-08-201314-08-2013", "output": "...	1,611,554,250	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	46	409,600	import datetime def isInteger(k): try: n = int(k[5:10]) return True except ValueError: return False str = input() k = "" arr = [] str+="-" for i in str: if i != "-": k += i else: if k != "": arr.append(k) k= "" str_arr ="" for i...	Title: Ancient Prophesy Time Limit: None seconds Memory Limit: None megabytes Problem Description: A recently found Ancient Prophesy is believed to contain the exact Apocalypse date. The prophesy is a string that only consists of digits and characters "-". We'll say that some date is mentioned in the Prophesy if th...	```python import datetime def isInteger(k): try: n = int(k[5:10]) return True except ValueError: return False str = input() k = "" arr = [] str+="-" for i in str: if i != "-": k += i else: if k != "": arr.append(k) k= "" str_arr ...	0
198	B	Jumping on Walls	PROGRAMMING	1,400	[ "shortest paths" ]		null	null	Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon. The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine that we split these walls into 1 meter-long areas and number them with positive integers from 1 to n from bottom to top. ...	The first line contains two integers n and k (1<=≤<=n,<=k<=≤<=105) — the height of the canyon and the height of ninja's jump, correspondingly. The second line contains the description of the left wall — a string with the length of n characters. The i-th character represents the state of the i-th wall are...	Print "YES" (without the quotes) if the ninja can get out from the canyon, otherwise, print "NO" (without the quotes).	[ "7 3\n---X--X\n-X--XX-\n", "6 2\n--X-X-\nX--XX-\n" ]	[ "YES\n", "NO\n" ]	In the first sample the ninja should first jump to the right wall, then go one meter down along the right wall, then jump to the left wall. The next jump can get the ninja from the canyon. In the second sample there's no way the ninja can get out of the canyon.	1,000	[ { "input": "7 3\n---X--X\n-X--XX-", "output": "YES" }, { "input": "6 2\n--X-X-\nX--XX-", "output": "NO" }, { "input": "10 1\n-X-X-X-X-X\nX-X-X-X-X-", "output": "YES" }, { "input": "5 4\n-X---\n----X", "output": "NO" }, { "input": "6 2\n--X--X\nXX-X-X", "output...	1,642,581,466	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	32	342	10,547,200	from collections import deque import sys n,k=map(int,input().split()) s1=input() s2=input() que=deque() ans='NO' que.append([0,1,0]) burn=[[0,0,0] for i in range(n)] while que: cord,st,turn=que.popleft() if st==1: cur=s1 pr=s2 else: cur=s2 pr=s1 ...	Title: Jumping on Walls Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon. The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine that we split these w...	```python from collections import deque import sys n,k=map(int,input().split()) s1=input() s2=input() que=deque() ans='NO' que.append([0,1,0]) burn=[[0,0,0] for i in range(n)] while que: cord,st,turn=que.popleft() if st==1: cur=s1 pr=s2 else: cur=s2 pr=s1 ...	0
596	A	Wilbur and Swimming Pool	PROGRAMMING	1,100	[ "geometry", "implementation" ]		null	null	After making bad dives into swimming pools, Wilbur wants to build a swimming pool in the shape of a rectangle in his backyard. He has set up coordinate axes, and he wants the sides of the rectangle to be parallel to them. Of course, the area of the rectangle must be positive. Wilbur had all four vertices of the planned...	The first line of the input contains a single integer n (1<=≤<=n<=≤<=4) — the number of vertices that were not erased by Wilbur's friend. Each of the following n lines contains two integers xi and yi (<=-<=1000<=≤<=xi,<=yi<=≤<=1000) —the coordinates of the i-th vertex that remains. Vertices are...	Print the area of the initial rectangle if it could be uniquely determined by the points remaining. Otherwise, print <=-<=1.	[ "2\n0 0\n1 1\n", "1\n1 1\n" ]	[ "1\n", "-1\n" ]	In the first sample, two opposite corners of the initial rectangle are given, and that gives enough information to say that the rectangle is actually a unit square. In the second sample there is only one vertex left and this is definitely not enough to uniquely define the area.	500	[ { "input": "2\n0 0\n1 1", "output": "1" }, { "input": "1\n1 1", "output": "-1" }, { "input": "1\n-188 17", "output": "-1" }, { "input": "1\n71 -740", "output": "-1" }, { "input": "4\n-56 -858\n-56 -174\n778 -858\n778 -174", "output": "570456" }, { "inp...	1,561,623,871	2,147,483,647	PyPy 3	OK	TESTS	121	234	2,457,600	import math as mt import sys,string,bisect input=sys.stdin.readline from collections import deque,defaultdict L=lambda : list(map(int,input().split())) Ls=lambda : list(input().split()) M=lambda : map(int,input().split()) I=lambda :int(input()) def dist(x,y,c,d): return mt.sqrt((x-c)2+(y-d)2) def circle(x1, y1...	Title: Wilbur and Swimming Pool Time Limit: None seconds Memory Limit: None megabytes Problem Description: After making bad dives into swimming pools, Wilbur wants to build a swimming pool in the shape of a rectangle in his backyard. He has set up coordinate axes, and he wants the sides of the rectangle to be parall...	```python import math as mt import sys,string,bisect input=sys.stdin.readline from collections import deque,defaultdict L=lambda : list(map(int,input().split())) Ls=lambda : list(input().split()) M=lambda : map(int,input().split()) I=lambda :int(input()) def dist(x,y,c,d): return mt.sqrt((x-c)2+(y-d)2) def cir...	3
745	A	Hongcow Learns the Cyclic Shift	PROGRAMMING	900	[ "implementation", "strings" ]		null	null	Hongcow is learning to spell! One day, his teacher gives him a word that he needs to learn to spell. Being a dutiful student, he immediately learns how to spell the word. Hongcow has decided to try to make new words from this one. He starts by taking the word he just learned how to spell, and moves the last character ...	The first line of input will be a single string s (1<=≤<=\|s\|<=≤<=50), the word Hongcow initially learns how to spell. The string s consists only of lowercase English letters ('a'–'z').	Output a single integer equal to the number of distinct strings that Hongcow can obtain by applying the cyclic shift arbitrarily many times to the given string.	[ "abcd\n", "bbb\n", "yzyz\n" ]	[ "4\n", "1\n", "2\n" ]	For the first sample, the strings Hongcow can generate are "abcd", "dabc", "cdab", and "bcda". For the second sample, no matter how many times Hongcow does the cyclic shift, Hongcow can only generate "bbb". For the third sample, the two strings Hongcow can generate are "yzyz" and "zyzy".	500	[ { "input": "abcd", "output": "4" }, { "input": "bbb", "output": "1" }, { "input": "yzyz", "output": "2" }, { "input": "abcdefghijklmnopqrstuvwxyabcdefghijklmnopqrstuvwxy", "output": "25" }, { "input": "zclkjadoprqronzclkjadoprqronzclkjadoprqron", "output": "14...	1,598,672,914	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	4	109	0	word = input() a = set(word) print(len(a))	Title: Hongcow Learns the Cyclic Shift Time Limit: None seconds Memory Limit: None megabytes Problem Description: Hongcow is learning to spell! One day, his teacher gives him a word that he needs to learn to spell. Being a dutiful student, he immediately learns how to spell the word. Hongcow has decided to try to m...	```python word = input() a = set(word) print(len(a)) ```	0
263	A	Beautiful Matrix	PROGRAMMING	800	[ "implementation" ]		null	null	You've got a 5<=×<=5 matrix, consisting of 24 zeroes and a single number one. Let's index the matrix rows by numbers from 1 to 5 from top to bottom, let's index the matrix columns by numbers from 1 to 5 from left to right. In one move, you are allowed to apply one of the two following transformations to the matrix: 1....	The input consists of five lines, each line contains five integers: the j-th integer in the i-th line of the input represents the element of the matrix that is located on the intersection of the i-th row and the j-th column. It is guaranteed that the matrix consists of 24 zeroes and a single number one.	Print a single integer — the minimum number of moves needed to make the matrix beautiful.	[ "0 0 0 0 0\n0 0 0 0 1\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n", "0 0 0 0 0\n0 0 0 0 0\n0 1 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n" ]	[ "3\n", "1\n" ]	none	500	[ { "input": "0 0 0 0 0\n0 0 0 0 1\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0", "output": "3" }, { "input": "0 0 0 0 0\n0 0 0 0 0\n0 1 0 0 0\n0 0 0 0 0\n0 0 0 0 0", "output": "1" }, { "input": "0 0 0 0 0\n0 0 0 0 0\n0 0 1 0 0\n0 0 0 0 0\n0 0 0 0 0", "output": "0" }, { "input": "0 0 0 0 0...	1,694,431,495	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	60	0	l=[] for i in range(5): t=list(map(int,input().split())) l.append(t) x=0 y=0 for i in range(5): for j in range(5): if l[i][j]==1: x=i y=j print(abs(3-x)+abs(3-y))	Title: Beautiful Matrix Time Limit: None seconds Memory Limit: None megabytes Problem Description: You've got a 5<=×<=5 matrix, consisting of 24 zeroes and a single number one. Let's index the matrix rows by numbers from 1 to 5 from top to bottom, let's index the matrix columns by numbers from 1 to 5 from left to ri...	```python l=[] for i in range(5): t=list(map(int,input().split())) l.append(t) x=0 y=0 for i in range(5): for j in range(5): if l[i][j]==1: x=i y=j print(abs(3-x)+abs(3-y)) ```	0
1,011	A	Stages	PROGRAMMING	900	[ "greedy", "implementation", "sortings" ]		null	null	Natasha is going to fly to Mars. She needs to build a rocket, which consists of several stages in some order. Each of the stages is defined by a lowercase Latin letter. This way, the rocket can be described by the string — concatenation of letters, which correspond to the stages. There are $n$ stages available. The ro...	The first line of input contains two integers — $n$ and $k$ ($1 \le k \le n \le 50$) – the number of available stages and the number of stages to use in the rocket. The second line contains string $s$, which consists of exactly $n$ lowercase Latin letters. Each letter defines a new stage, which can be used to build th...	Print a single integer — the minimal total weight of the rocket or -1, if it is impossible to build the rocket at all.	[ "5 3\nxyabd\n", "7 4\nproblem\n", "2 2\nab\n", "12 1\nabaabbaaabbb\n" ]	[ "29", "34", "-1", "1" ]	In the first example, the following rockets satisfy the condition: - "adx" (weight is $1+4+24=29$);- "ady" (weight is $1+4+25=30$);- "bdx" (weight is $2+4+24=30$);- "bdy" (weight is $2+4+25=31$). Rocket "adx" has the minimal weight, so the answer is $29$. In the second example, target rocket is "belo". Its weight ...	500	[ { "input": "5 3\nxyabd", "output": "29" }, { "input": "7 4\nproblem", "output": "34" }, { "input": "2 2\nab", "output": "-1" }, { "input": "12 1\nabaabbaaabbb", "output": "1" }, { "input": "50 13\nqwertyuiopasdfghjklzxcvbnmaaaaaaaaaaaaaaaaaaaaaaaa", "output": ...	1,588,313,522	1,022	PyPy 3	OK	TESTS	29	155	0	mod=10**9+7 import math for _ in range(1): n,m=map(int,input().split()) s=input() arr=[0 for i in range(26)] for i in s: arr[ord(i)-97]=1 i=0 ans=0 while(i<26 and m>0): if(arr[i]==1): ans+=(i+1) i+=1 m-=1 i+=1 ...	Title: Stages Time Limit: None seconds Memory Limit: None megabytes Problem Description: Natasha is going to fly to Mars. She needs to build a rocket, which consists of several stages in some order. Each of the stages is defined by a lowercase Latin letter. This way, the rocket can be described by the string — conca...	```python mod=10**9+7 import math for _ in range(1): n,m=map(int,input().split()) s=input() arr=[0 for i in range(26)] for i in s: arr[ord(i)-97]=1 i=0 ans=0 while(i<26 and m>0): if(arr[i]==1): ans+=(i+1) i+=1 m-=1 ...	3
4	A	Watermelon	PROGRAMMING	800	[ "brute force", "math" ]	A. Watermelon	1	64	One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed w kilos. They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem. Pete and ...	The first (and the only) input line contains integer number w (1<=≤<=w<=≤<=100) — the weight of the watermelon bought by the boys.	Print YES, if the boys can divide the watermelon into two parts, each of them weighing even number of kilos; and NO in the opposite case.	[ "8\n" ]	[ "YES\n" ]	For example, the boys can divide the watermelon into two parts of 2 and 6 kilos respectively (another variant — two parts of 4 and 4 kilos).	0	[ { "input": "8", "output": "YES" }, { "input": "5", "output": "NO" }, { "input": "4", "output": "YES" }, { "input": "3", "output": "NO" }, { "input": "2", "output": "NO" }, { "input": "1", "output": "NO" }, { "input": "7", "output": "NO"...	1,696,790,779	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	4	92	0	n = input('') if (int(n)/2) % 2 == 0 or int(n) % 2 == 0: print('YES') else: print('NO')	Title: Watermelon Time Limit: 1 seconds Memory Limit: 64 megabytes Problem Description: One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed w kilos. They rushed home, dyin...	```python n = input('') if (int(n)/2) % 2 == 0 or int(n) % 2 == 0: print('YES') else: print('NO') ```	0
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,674,044	644	Python 3	WRONG_ANSWER	PRETESTS	6	77	0	n,x=map(int,input().split()) a=[[],[]] for i in range(n): t,h,m = map(int,input().split()) a[t].append((h,m)) a[0].sort() a[1].sort() def gao(o): i,j,s=0,0,0 u=x while True: if o==0: if i >= len(a[0]) or a[0][i][0]>u: return s u+=a[0][i][1] s+=1 i+=1 else: if j >= len(a[1]) or a[1][j][0]>u: ...	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 n,x=map(int,input().split()) a=[[],[]] for i in range(n): t,h,m = map(int,input().split()) a[t].append((h,m)) a[0].sort() a[1].sort() def gao(o): i,j,s=0,0,0 u=x while True: if o==0: if i >= len(a[0]) or a[0][i][0]>u: return s u+=a[0][i][1] s+=1 i+=1 else: if j >= len(a[1]) or a[1]...	0
131	A	cAPS lOCK	PROGRAMMING	1,000	[ "implementation", "strings" ]		null	null	wHAT DO WE NEED cAPS LOCK FOR? Caps lock is a computer keyboard key. Pressing it sets an input mode in which typed letters are capital by default. If it is pressed by accident, it leads to accidents like the one we had in the first passage. Let's consider that a word has been typed with the Caps lock key accidentall...	The first line of the input data contains a word consisting of uppercase and lowercase Latin letters. The word's length is from 1 to 100 characters, inclusive.	Print the result of the given word's processing.	[ "cAPS\n", "Lock\n" ]	[ "Caps", "Lock\n" ]	none	500	[ { "input": "cAPS", "output": "Caps" }, { "input": "Lock", "output": "Lock" }, { "input": "cAPSlOCK", "output": "cAPSlOCK" }, { "input": "CAPs", "output": "CAPs" }, { "input": "LoCK", "output": "LoCK" }, { "input": "OOPS", "output": "oops" }, { ...	1,695,483,190	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	15	0	s = input() for i in range(len(s)): if i != 0 and s[i].islower(): print(s) exit() print(s.lower())	Title: cAPS lOCK Time Limit: None seconds Memory Limit: None megabytes Problem Description: wHAT DO WE NEED cAPS LOCK FOR? Caps lock is a computer keyboard key. Pressing it sets an input mode in which typed letters are capital by default. If it is pressed by accident, it leads to accidents like the one we had in th...	```python s = input() for i in range(len(s)): if i != 0 and s[i].islower(): print(s) exit() print(s.lower()) ```	0
26	A	Almost Prime	PROGRAMMING	900	[ "number theory" ]	A. Almost Prime	2	256	A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers which are between 1 and n, inclusive.	Input contains one integer number n (1<=≤<=n<=≤<=3000).	Output the amount of almost prime numbers between 1 and n, inclusive.	[ "10\n", "21\n" ]	[ "2\n", "8\n" ]	none	500	[ { "input": "10", "output": "2" }, { "input": "21", "output": "8" }, { "input": "1", "output": "0" }, { "input": "2", "output": "0" }, { "input": "4", "output": "0" }, { "input": "3", "output": "0" }, { "input": "8", "output": "1" }, ...	1,680,276,825	2,147,483,647	PyPy 3-64	OK	TESTS	23	154	2,662,400	from itertools import accumulate from collections import defaultdict def I(): return int(input()) def ST(): return input() def IL(): return list(map(int, input().split())) def ILS(): return sorted(map(int, input().split())) n = I() count = 0 for num in range(6,n+1): d = 2 seen = set() while d...	Title: Almost Prime Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers which are between 1 and n, in...	```python from itertools import accumulate from collections import defaultdict def I(): return int(input()) def ST(): return input() def IL(): return list(map(int, input().split())) def ILS(): return sorted(map(int, input().split())) n = I() count = 0 for num in range(6,n+1): d = 2 seen = set() ...	3.956541
41	A	Translation	PROGRAMMING	800	[ "implementation", "strings" ]	A. Translation	2	256	The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) reversely. For example, a Berlandish word code corresponds to a Birlandish word edoc....	The first line contains word s, the second line contains word t. The words consist of lowercase Latin letters. The input data do not consist unnecessary spaces. The words are not empty and their lengths do not exceed 100 symbols.	If the word t is a word s, written reversely, print YES, otherwise print NO.	[ "code\nedoc\n", "abb\naba\n", "code\ncode\n" ]	[ "YES\n", "NO\n", "NO\n" ]	none	500	[ { "input": "code\nedoc", "output": "YES" }, { "input": "abb\naba", "output": "NO" }, { "input": "code\ncode", "output": "NO" }, { "input": "abacaba\nabacaba", "output": "YES" }, { "input": "q\nq", "output": "YES" }, { "input": "asrgdfngfnmfgnhweratgjkk...	1,549,419,211	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	154	0	s1 = input() s2 = input() if(s2== reversed(s1)): print("YES") else: print("NO")	Title: Translation Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pron...	```python s1 = input() s2 = input() if(s2== reversed(s1)): print("YES") else: print("NO") ```	0
1,005	C	Summarize to the Power of Two	PROGRAMMING	1,300	[ "brute force", "greedy", "implementation" ]		null	null	A sequence $a_1, a_2, \dots, a_n$ is called good if, for each element $a_i$, there exists an element $a_j$ ($i \ne j$) such that $a_i+a_j$ is a power of two (that is, $2^d$ for some non-negative integer $d$). For example, the following sequences are good: - $[5, 3, 11]$ (for example, for $a_1=5$ we can choose $a_2=3...	The first line contains the integer $n$ ($1 \le n \le 120000$) — the length of the given sequence. The second line contains the sequence of integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^9$).	Print the minimum number of elements needed to be removed from the given sequence in order to make it good. It is possible that you need to delete all $n$ elements, make it empty, and thus get a good sequence.	[ "6\n4 7 1 5 4 9\n", "5\n1 2 3 4 5\n", "1\n16\n", "4\n1 1 1 1023\n" ]	[ "1\n", "2\n", "1\n", "0\n" ]	In the first example, it is enough to delete one element $a_4=5$. The remaining elements form the sequence $[4, 7, 1, 4, 9]$, which is good.	0	[ { "input": "6\n4 7 1 5 4 9", "output": "1" }, { "input": "5\n1 2 3 4 5", "output": "2" }, { "input": "1\n16", "output": "1" }, { "input": "4\n1 1 1 1023", "output": "0" }, { "input": "10\n2 10 9 1 10 4 7 8 5 4", "output": "5" }, { "input": "2\n1 1", ...	1,693,929,510	2,147,483,647	Python 3	COMPILATION_ERROR	TESTS	0	0	0	from math import log quantity = int(input()) subsequence = list(map(int, input().split())) def isPowerOfTwo(x): log_x = log(x, 2) if (log_x == int(log_x)): return True return False def main(): match quantity: case 0: return 0 case 1: r...	Title: Summarize to the Power of Two Time Limit: None seconds Memory Limit: None megabytes Problem Description: A sequence $a_1, a_2, \dots, a_n$ is called good if, for each element $a_i$, there exists an element $a_j$ ($i \ne j$) such that $a_i+a_j$ is a power of two (that is, $2^d$ for some non-negative integer $d...	```python from math import log quantity = int(input()) subsequence = list(map(int, input().split())) def isPowerOfTwo(x): log_x = log(x, 2) if (log_x == int(log_x)): return True return False def main(): match quantity: case 0: return 0 case 1: ...	-1
903	A	Hungry Student Problem	PROGRAMMING	900	[ "greedy", "implementation" ]		null	null	Ivan's classes at the university have just finished, and now he wants to go to the local CFK cafe and eat some fried chicken. CFK sells chicken chunks in small and large portions. A small portion contains 3 chunks; a large one — 7 chunks. Ivan wants to eat exactly x chunks. Now he wonders whether he can buy exactly ...	The first line contains one integer n (1<=≤<=n<=≤<=100) — the number of testcases. The i-th of the following n lines contains one integer xi (1<=≤<=xi<=≤<=100) — the number of chicken chunks Ivan wants to eat.	Print n lines, in i-th line output YES if Ivan can buy exactly xi chunks. Otherwise, print NO.	[ "2\n6\n5\n" ]	[ "YES\nNO\n" ]	In the first example Ivan can buy two small portions. In the second example Ivan cannot buy exactly 5 chunks, since one small portion is not enough, but two small portions or one large is too much.	0	[ { "input": "2\n6\n5", "output": "YES\nNO" }, { "input": "100\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n18\n19\n20\n21\n22\n23\n24\n25\n26\n27\n28\n29\n30\n31\n32\n33\n34\n35\n36\n37\n38\n39\n40\n41\n42\n43\n44\n45\n46\n47\n48\n49\n50\n51\n52\n53\n54\n55\n56\n57\n58\n59\n60\n61\n62\...	1,601,368,388	2,147,483,647	PyPy 3	OK	TESTS	8	155	0	n = int(input()) for case in range(n): x = int(input()) if x in [1, 2, 4, 5, 8, 11]: ans = 'NO' else: ans = 'YES' print(ans)	Title: Hungry Student Problem Time Limit: None seconds Memory Limit: None megabytes Problem Description: Ivan's classes at the university have just finished, and now he wants to go to the local CFK cafe and eat some fried chicken. CFK sells chicken chunks in small and large portions. A small portion contains 3 chun...	```python n = int(input()) for case in range(n): x = int(input()) if x in [1, 2, 4, 5, 8, 11]: ans = 'NO' else: ans = 'YES' print(ans) ```	3
472	A	Design Tutorial: Learn from Math	PROGRAMMING	800	[ "math", "number theory" ]		null	null	One way to create a task is to learn from math. You can generate some random math statement or modify some theorems to get something new and build a new task from that. For example, there is a statement called the "Goldbach's conjecture". It says: "each even number no less than four can be expressed as the sum of two ...	The only line contains an integer n (12<=≤<=n<=≤<=106).	Output two composite integers x and y (1<=<<=x,<=y<=<<=n) such that x<=+<=y<==<=n. If there are multiple solutions, you can output any of them.	[ "12\n", "15\n", "23\n", "1000000\n" ]	[ "4 8\n", "6 9\n", "8 15\n", "500000 500000\n" ]	In the first example, 12 = 4 + 8 and both 4, 8 are composite numbers. You can output "6 6" or "8 4" as well. In the second example, 15 = 6 + 9. Note that you can't output "1 14" because 1 is not a composite number.	500	[ { "input": "12", "output": "4 8" }, { "input": "15", "output": "6 9" }, { "input": "23", "output": "8 15" }, { "input": "1000000", "output": "500000 500000" }, { "input": "63874", "output": "4 63870" }, { "input": "14568", "output": "4 14564" }, ...	1,693,557,648	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	1	46	0	def isComposite(n): if (n <= 1): return False for i in range(2, n+1): if n % i == 0: return True return False n = int(input()) for i in range(4, n - 3): if (isComposite(i) and isComposite(n - i)): print(i, n - i) break	Title: Design Tutorial: Learn from Math Time Limit: None seconds Memory Limit: None megabytes Problem Description: One way to create a task is to learn from math. You can generate some random math statement or modify some theorems to get something new and build a new task from that. For example, there is a statemen...	```python def isComposite(n): if (n <= 1): return False for i in range(2, n+1): if n % i == 0: return True return False n = int(input()) for i in range(4, n - 3): if (isComposite(i) and isComposite(n - i)): print(i, n - i) break ```	0
44	E	Anfisa the Monkey	PROGRAMMING	1,400	[ "dp" ]	E. Anfisa the Monkey	2	256	Anfisa the monkey learns to type. She is yet unfamiliar with the "space" key and can only type in lower-case Latin letters. Having typed for a fairly long line, Anfisa understood that it would be great to divide what she has written into k lines not shorter than a and not longer than b, for the text to resemble h...	The first line contains three integers k, a and b (1<=≤<=k<=≤<=200, 1<=≤<=a<=≤<=b<=≤<=200). The second line contains a sequence of lowercase Latin letters — the text typed by Anfisa. It is guaranteed that the given line is not empty and its length does not exceed 200 symbols.	Print k lines, each of which contains no less than a and no more than b symbols — Anfisa's text divided into lines. It is not allowed to perform any changes in the text, such as: deleting or adding symbols, changing their order, etc. If the solution is not unique, print any of them. If there is no solution, print...	[ "3 2 5\nabrakadabra\n", "4 1 2\nabrakadabra\n" ]	[ "ab\nrakad\nabra\n", "No solution\n" ]	none	0	[ { "input": "3 2 5\nabrakadabra", "output": "abra\nkada\nbra" }, { "input": "4 1 2\nabrakadabra", "output": "No solution" }, { "input": "3 1 2\nvgnfpo", "output": "vg\nnf\npo" }, { "input": "5 3 4\nvrrdnhazvexzjfv", "output": "vrr\ndnh\nazv\nexz\njfv" }, { "input":...	1,653,076,638	2,147,483,647	Python 3	OK	TESTS	32	92	0	k, a, b = map(int, input().split()) s = input() s_len = len(s) size = s_len // k rest = s_len % k if size < a or size > b or (size == b and rest > 0) or rest > b: print("No solution") else: index = 0 while index < s_len: if rest == 0: print(s[index: index + size]) index = i...	Title: Anfisa the Monkey Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Anfisa the monkey learns to type. She is yet unfamiliar with the "space" key and can only type in lower-case Latin letters. Having typed for a fairly long line, Anfisa understood that it would be great to divide what she ...	```python k, a, b = map(int, input().split()) s = input() s_len = len(s) size = s_len // k rest = s_len % k if size < a or size > b or (size == b and rest > 0) or rest > b: print("No solution") else: index = 0 while index < s_len: if rest == 0: print(s[index: index + size]) ...	3.977
0	none	none	none	0	[ "none" ]		null	null	A family consisting of father bear, mother bear and son bear owns three cars. Father bear can climb into the largest car and he likes it. Also, mother bear can climb into the middle car and she likes it. Moreover, son bear can climb into the smallest car and he likes it. It's known that the largest car is strictly larg...	You are given four integers V1, V2, V3, Vm(1<=≤<=Vi<=≤<=100) — sizes of father bear, mother bear, son bear and Masha, respectively. It's guaranteed that V1<=><=V2<=><=V3.	Output three integers — sizes of father bear's car, mother bear's car and son bear's car, respectively. If there are multiple possible solutions, print any. If there is no solution, print "-1" (without quotes).	[ "50 30 10 10\n", "100 50 10 21\n" ]	[ "50\n30\n10\n", "-1\n" ]	In first test case all conditions for cars' sizes are satisfied. In second test case there is no answer, because Masha should be able to climb into smallest car (so size of smallest car in not less than 21), but son bear should like it, so maximum possible size of it is 20.	0	[ { "input": "50 30 10 10", "output": "50\n30\n10" }, { "input": "100 50 10 21", "output": "-1" }, { "input": "100 50 19 10", "output": "100\n50\n19" }, { "input": "99 50 25 49", "output": "100\n99\n49" }, { "input": "3 2 1 1", "output": "4\n3\n1" }, { "...	1,514,039,507	1,607	PyPy 3	WRONG_ANSWER	PRETESTS	3	93	23,040,000	A = list(map(int, input().split())) B = [] for i in range(4): B.append(A[i]) A.sort() T = False if A[0] * 2 >= A[1]: if A[2] > A[1]: print(A[3]) print(A[2]) print(A[1]) else: A[2] = A[1] + 1 if B[2] * 2 >= A[2]: if A[3] > A[2]: ...	Title: none Time Limit: None seconds Memory Limit: None megabytes Problem Description: A family consisting of father bear, mother bear and son bear owns three cars. Father bear can climb into the largest car and he likes it. Also, mother bear can climb into the middle car and she likes it. Moreover, son bear can cli...	```python A = list(map(int, input().split())) B = [] for i in range(4): B.append(A[i]) A.sort() T = False if A[0] * 2 >= A[1]: if A[2] > A[1]: print(A[3]) print(A[2]) print(A[1]) else: A[2] = A[1] + 1 if B[2] * 2 >= A[2]: if A[3] > A[2]: ...	0
50	A	Domino piling	PROGRAMMING	800	[ "greedy", "math" ]	A. Domino piling	2	256	You are given a rectangular board of M<=×<=N squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions: 1. Each domino completely covers ...	In a single line you are given two integers M and N — board sizes in squares (1<=≤<=M<=≤<=N<=≤<=16).	Output one number — the maximal number of dominoes, which can be placed.	[ "2 4\n", "3 3\n" ]	[ "4\n", "4\n" ]	none	500	[ { "input": "2 4", "output": "4" }, { "input": "3 3", "output": "4" }, { "input": "1 5", "output": "2" }, { "input": "1 6", "output": "3" }, { "input": "1 15", "output": "7" }, { "input": "1 16", "output": "8" }, { "input": "2 5", "outpu...	1,650,099,446	2,147,483,647	Python 3	OK	TESTS	35	62	0	o, k = map(int, input().split()) total = int(o*k / 2) print(total)	Title: Domino piling Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: You are given a rectangular board of M<=×<=N squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as p...	```python o, k = map(int, input().split()) total = int(o*k / 2) print(total) ```	3.9845
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,646,242,134	2,147,483,647	PyPy 3	RUNTIME_ERROR	TESTS	10	186	9,420,800	l1=[] for i in range(10): l1.append(str(i)) s=input() n=int(input()) for i in range(n): x=input() x1=x.index('-') d,t=int(x[:x1]),x[x1+2:] #l1[d]=t for j in range(10): if True: s1='' for k in l1[j]: if k!=str(d): ...	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 l1=[] for i in range(10): l1.append(str(i)) s=input() n=int(input()) for i in range(n): x=input() x1=x.index('-') d,t=int(x[:x1]),x[x1+2:] #l1[d]=t for j in range(10): if True: s1='' for k in l1[j]: if k!=str(d): ...	-1
110	A	Nearly Lucky Number	PROGRAMMING	800	[ "implementation" ]	A. Nearly Lucky Number	2	256	Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not. Unfortunately, not all numbers are lucky. Petya calls a number nearly lucky if the number of lucky d...	The only line contains an integer n (1<=≤<=n<=≤<=1018). Please do not use the %lld specificator to read or write 64-bit numbers in С++. It is preferred to use the cin, cout streams or the %I64d specificator.	Print on the single line "YES" if n is a nearly lucky number. Otherwise, print "NO" (without the quotes).	[ "40047\n", "7747774\n", "1000000000000000000\n" ]	[ "NO\n", "YES\n", "NO\n" ]	In the first sample there are 3 lucky digits (first one and last two), so the answer is "NO". In the second sample there are 7 lucky digits, 7 is lucky number, so the answer is "YES". In the third sample there are no lucky digits, so the answer is "NO".	500	[ { "input": "40047", "output": "NO" }, { "input": "7747774", "output": "YES" }, { "input": "1000000000000000000", "output": "NO" }, { "input": "7", "output": "NO" }, { "input": "4", "output": "NO" }, { "input": "474404774", "output": "NO" }, { ...	1,696,244,822	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	3	92	0	x = input() for char in x: if char not in ('4', '7'): print("NO") break else: print("YES")	Title: Nearly Lucky Number Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not. ...	```python x = input() for char in x: if char not in ('4', '7'): print("NO") break else: print("YES") ```	0
873	B	Balanced Substring	PROGRAMMING	1,500	[ "dp", "implementation" ]		null	null	You are given a string s consisting only of characters 0 and 1. A substring [l,<=r] of s is a string slsl<=+<=1sl<=+<=2... sr, and its length equals to r<=-<=l<=+<=1. A substring is called balanced if the number of zeroes (0) equals to the number of ones in this substring. You have to deter...	The first line contains n (1<=≤<=n<=≤<=100000) — the number of characters in s. The second line contains a string s consisting of exactly n characters. Only characters 0 and 1 can appear in s.	If there is no non-empty balanced substring in s, print 0. Otherwise, print the length of the longest balanced substring.	[ "8\n11010111\n", "3\n111\n" ]	[ "4\n", "0\n" ]	In the first example you can choose the substring [3, 6]. It is balanced, and its length is 4. Choosing the substring [2, 5] is also possible. In the second example it's impossible to find a non-empty balanced substring.	0	[ { "input": "8\n11010111", "output": "4" }, { "input": "3\n111", "output": "0" }, { "input": "11\n00001000100", "output": "2" }, { "input": "10\n0100000000", "output": "2" }, { "input": "13\n0001000011010", "output": "6" }, { "input": "14\n0000010010101...	1,627,144,334	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	11	108	20,172,800	def f(a): a=list(a) for i in range(len(a)): if a[i]=="0": a[i]=-1 else: a[i]=1 dc={} pref=0 ans=0 for i in range(len(a)): pref+=a[i] # print(dc, pref) if dc.get(pref,None)!=None: # print(i-dc.get(pref),i,dc.get(pref)) ans=max(i-dc.get(pref),ans) dc[pref]=min(dc.get(pref,f...	Title: Balanced Substring Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given a string s consisting only of characters 0 and 1. A substring [l,<=r] of s is a string slsl<=+<=1sl<=+<=2... sr, and its length equals to r<=-<=l<=+<=1. A substring is called...	```python def f(a): a=list(a) for i in range(len(a)): if a[i]=="0": a[i]=-1 else: a[i]=1 dc={} pref=0 ans=0 for i in range(len(a)): pref+=a[i] # print(dc, pref) if dc.get(pref,None)!=None: # print(i-dc.get(pref),i,dc.get(pref)) ans=max(i-dc.get(pref),ans) dc[pref]=min(dc....	0
330	B	Road Construction	PROGRAMMING	1,300	[ "constructive algorithms", "graphs" ]		null	null	A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants those roads to be constructed in such a way that it is possible to go from each city to any other city by traversing at most two...	The first line consists of two integers n and m . Then m lines follow, each consisting of two integers ai and bi (1<=≤<=ai,<=bi<=≤<=n, ai<=≠<=bi), which means that it is not possible to construct a road connecting cities ai and bi. Consider the cities are numbered from 1 to n....	You should print an integer s: the minimum number of roads that should be constructed, in the first line. Then s lines should follow, each consisting of two integers ai and bi (1<=≤<=ai,<=bi<=≤<=n,<=ai<=≠<=bi), which means that a road should be constructed between cities ai and bi....	[ "4 1\n1 3\n" ]	[ "3\n1 2\n4 2\n2 3\n" ]	This is one possible solution of the example: These are examples of wrong solutions:	1,000	[ { "input": "4 1\n1 3", "output": "3\n1 2\n4 2\n2 3" }, { "input": "1000 0", "output": "999\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 ...	1,595,805,734	2,147,483,647	PyPy 3	RUNTIME_ERROR	TESTS	37	372	23,040,000	n,m = map(int,input().split()) arr = [0] * 1005 for i in range(m): a,b = map(int,input().split()) arr[a] = 1 arr[b] = 1 for i in range(1,n): if arr[i] == 0: break print(n-1) for j in range(1,n+1): if i != j: print(i,j)	Title: Road Construction Time Limit: None seconds Memory Limit: None megabytes Problem Description: A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants those roads to be constru...	```python n,m = map(int,input().split()) arr = [0] * 1005 for i in range(m): a,b = map(int,input().split()) arr[a] = 1 arr[b] = 1 for i in range(1,n): if arr[i] == 0: break print(n-1) for j in range(1,n+1): if i != j: print(i,j) ```	-1
220	A	Little Elephant and Problem	PROGRAMMING	1,300	[ "implementation", "sortings" ]		null	null	The Little Elephant has got a problem — somebody has been touching his sorted by non-decreasing array a of length n and possibly swapped some elements of the array. The Little Elephant doesn't want to call the police until he understands if he could have accidentally changed the array himself. He thinks that he co...	The first line contains a single integer n (2<=≤<=n<=≤<=105) — the size of array a. The next line contains n positive integers, separated by single spaces and not exceeding 109, — array a. Note that the elements of the array are not necessarily distinct numbers.	In a single line print "YES" (without the quotes) if the Little Elephant could have accidentally changed the array himself, and "NO" (without the quotes) otherwise.	[ "2\n1 2\n", "3\n3 2 1\n", "4\n4 3 2 1\n" ]	[ "YES\n", "YES\n", "NO\n" ]	In the first sample the array has already been sorted, so to sort it, we need 0 swap operations, that is not more than 1. Thus, the answer is "YES". In the second sample we can sort the array if we swap elements 1 and 3, so we need 1 swap operation to sort the array. Thus, the answer is "YES". In the third sample we ...	500	[ { "input": "2\n1 2", "output": "YES" }, { "input": "3\n3 2 1", "output": "YES" }, { "input": "4\n4 3 2 1", "output": "NO" }, { "input": "3\n1 3 2", "output": "YES" }, { "input": "2\n2 1", "output": "YES" }, { "input": "9\n7 7 8 8 10 10 10 10 1000000000...	1,466,523,264	2,147,483,647	Python 3	OK	TESTS	96	155	8,396,800	from collections import defaultdict, deque, Counter, OrderedDict def main(): n = int(input()) l = [int(i) for i in input().split()] ls = sorted(l[:]) c = 0 for i in range(n): if l[i] != ls[i]: c += 1 if c == 2 or c == 0: print("yes") else: pr...	Title: Little Elephant and Problem Time Limit: None seconds Memory Limit: None megabytes Problem Description: The Little Elephant has got a problem — somebody has been touching his sorted by non-decreasing array a of length n and possibly swapped some elements of the array. The Little Elephant doesn't want to c...	```python from collections import defaultdict, deque, Counter, OrderedDict def main(): n = int(input()) l = [int(i) for i in input().split()] ls = sorted(l[:]) c = 0 for i in range(n): if l[i] != ls[i]: c += 1 if c == 2 or c == 0: print("yes") else: ...	3
676	C	Vasya and String	PROGRAMMING	1,500	[ "binary search", "dp", "strings", "two pointers" ]		null	null	High school student Vasya got a string of length n as a birthday present. This string consists of letters 'a' and 'b' only. Vasya denotes beauty of the string as the maximum length of a substring (consecutive subsequence) consisting of equal letters. Vasya can change no more than k characters of the original strin...	The first line of the input contains two integers n and k (1<=≤<=n<=≤<=100<=000,<=0<=≤<=k<=≤<=n) — the length of the string and the maximum number of characters to change. The second line contains the string, consisting of letters 'a' and 'b' only.	Print the only integer — the maximum beauty of the string Vasya can achieve by changing no more than k characters.	[ "4 2\nabba\n", "8 1\naabaabaa\n" ]	[ "4\n", "5\n" ]	In the first sample, Vasya can obtain both strings "aaaa" and "bbbb". In the second sample, the optimal answer is obtained with the string "aaaaabaa" or with the string "aabaaaaa".	1,500	[ { "input": "4 2\nabba", "output": "4" }, { "input": "8 1\naabaabaa", "output": "5" }, { "input": "1 0\na", "output": "1" }, { "input": "1 1\nb", "output": "1" }, { "input": "1 0\nb", "output": "1" }, { "input": "1 1\na", "output": "1" }, { ...	1,691,814,353	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	31	0	def max_beauty(n, k, s): max_length = 0 count = [0, 0] left = 0 for right in range(n): count[ord(s[right]) - ord('a')] += 1 # Update count current_window_size = right - left + 1 num_changes = current_window_size - max(count) if num_changes > k: count[o...	Title: Vasya and String Time Limit: None seconds Memory Limit: None megabytes Problem Description: High school student Vasya got a string of length n as a birthday present. This string consists of letters 'a' and 'b' only. Vasya denotes beauty of the string as the maximum length of a substring (consecutive subsequ...	```python def max_beauty(n, k, s): max_length = 0 count = [0, 0] left = 0 for right in range(n): count[ord(s[right]) - ord('a')] += 1 # Update count current_window_size = right - left + 1 num_changes = current_window_size - max(count) if num_changes > k: ...	0
851	A	Arpa and a research in Mexican wave	PROGRAMMING	800	[ "implementation", "math" ]		null	null	Arpa is researching the Mexican wave. There are n spectators in the stadium, labeled from 1 to n. They start the Mexican wave at time 0. - At time 1, the first spectator stands. - At time 2, the second spectator stands. - ... - At time k, the k-th spectator stands. - At time k<=+<=1, the (k<=+<=1)-t...	The first line contains three integers n, k, t (1<=≤<=n<=≤<=109, 1<=≤<=k<=≤<=n, 1<=≤<=t<=<<=n<=+<=k).	Print single integer: how many spectators are standing at time t.	[ "10 5 3\n", "10 5 7\n", "10 5 12\n" ]	[ "3\n", "5\n", "3\n" ]	In the following a sitting spectator is represented as -, a standing spectator is represented as ^. - At t = 0 ---------- <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/4d97e684117250a9afe9be022ab8a63653dd15aa.png" style="max-width: 100.0%;max-height: 100.0%;"/> number of standing spe...	500	[ { "input": "10 5 3", "output": "3" }, { "input": "10 5 7", "output": "5" }, { "input": "10 5 12", "output": "3" }, { "input": "840585600 770678331 788528791", "output": "770678331" }, { "input": "25462281 23343504 8024619", "output": "8024619" }, { "in...	1,602,740,090	2,147,483,647	PyPy 3	OK	TESTS	166	140	0	import sys input = sys.stdin.readline n,k,t = map(int,input().split()) if k<=t<=n: print(k) else: print(min(t,abs(n+k-t)))	Title: Arpa and a research in Mexican wave Time Limit: None seconds Memory Limit: None megabytes Problem Description: Arpa is researching the Mexican wave. There are n spectators in the stadium, labeled from 1 to n. They start the Mexican wave at time 0. - At time 1, the first spectator stands. - At time 2,...	```python import sys input = sys.stdin.readline n,k,t = map(int,input().split()) if k<=t<=n: print(k) else: print(min(t,abs(n+k-t))) ```	3
208	A	Dubstep	PROGRAMMING	900	[ "strings" ]		null	null	Vasya works as a DJ in the best Berland nightclub, and he often uses dubstep music in his performance. Recently, he has decided to take a couple of old songs and make dubstep remixes from them. Let's assume that a song consists of some number of words. To make the dubstep remix of this song, Vasya inserts a certain nu...	The input consists of a single non-empty string, consisting only of uppercase English letters, the string's length doesn't exceed 200 characters. It is guaranteed that before Vasya remixed the song, no word contained substring "WUB" in it; Vasya didn't change the word order. It is also guaranteed that initially the son...	Print the words of the initial song that Vasya used to make a dubsteb remix. Separate the words with a space.	[ "WUBWUBABCWUB\n", "WUBWEWUBAREWUBWUBTHEWUBCHAMPIONSWUBMYWUBFRIENDWUB\n" ]	[ "ABC ", "WE ARE THE CHAMPIONS MY FRIEND " ]	In the first sample: "WUBWUBABCWUB" = "WUB" + "WUB" + "ABC" + "WUB". That means that the song originally consisted of a single word "ABC", and all words "WUB" were added by Vasya. In the second sample Vasya added a single word "WUB" between all neighbouring words, in the beginning and in the end, except for words "ARE...	500	[ { "input": "WUBWUBABCWUB", "output": "ABC " }, { "input": "WUBWEWUBAREWUBWUBTHEWUBCHAMPIONSWUBMYWUBFRIENDWUB", "output": "WE ARE THE CHAMPIONS MY FRIEND " }, { "input": "WUBWUBWUBSR", "output": "SR " }, { "input": "RWUBWUBWUBLWUB", "output": "R L " }, { "input": "...	1,692,374,158	2,147,483,647	Python 3	OK	TESTS	71	122	0	def restore_original_song(remix): parts = remix.split("WUB") original_song = [part for part in parts if part] return " ".join(original_song) remix = input() original_song = restore_original_song(remix) print(original_song)	Title: Dubstep Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya works as a DJ in the best Berland nightclub, and he often uses dubstep music in his performance. Recently, he has decided to take a couple of old songs and make dubstep remixes from them. Let's assume that a song consist...	```python def restore_original_song(remix): parts = remix.split("WUB") original_song = [part for part in parts if part] return " ".join(original_song) remix = input() original_song = restore_original_song(remix) print(original_song) ```	3
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,378,969	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	62	0	n = int(input()) vanya = [] petya = [] tonya = [] for i in range(n): row = input().split() print(row) vanya.append(row[0]) petya.append(row[1]) tonya.append(row[2]) solv_tasks = 0 for i in range(n): tasks = int(vanya[i]) + int(petya[i]) + int(tonya[i]) if tasks >= 2: so...	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 n = int(input()) vanya = [] petya = [] tonya = [] for i in range(n): row = input().split() print(row) vanya.append(row[0]) petya.append(row[1]) tonya.append(row[2]) solv_tasks = 0 for i in range(n): tasks = int(vanya[i]) + int(petya[i]) + int(tonya[i]) if tasks >= 2: ...	0
431	A	Black Square	PROGRAMMING	800	[ "implementation" ]		null	null	Quite recently, a very smart student named Jury decided that lectures are boring, so he downloaded a game called "Black Square" on his super cool touchscreen phone. In this game, the phone's screen is divided into four vertical strips. Each second, a black square appears on some of the strips. According to the rules o...	The first line contains four space-separated integers a1, a2, a3, a4 (0<=≤<=a1,<=a2,<=a3,<=a4<=≤<=104). The second line contains string s (1<=≤<=\|s\|<=≤<=105), where the і-th character of the string equals "1", if on the i-th second of the game the square appears on the first strip, "2", if it a...	Print a single integer — the total number of calories that Jury wastes.	[ "1 2 3 4\n123214\n", "1 5 3 2\n11221\n" ]	[ "13\n", "13\n" ]	none	500	[ { "input": "1 2 3 4\n123214", "output": "13" }, { "input": "1 5 3 2\n11221", "output": "13" }, { "input": "5 5 5 1\n3422", "output": "16" }, { "input": "4 3 2 1\n2", "output": "3" }, { "input": "5651 6882 6954 4733\n2442313421", "output": "60055" }, { ...	1,679,413,479	2,147,483,647	PyPy 3-64	OK	TESTS	49	62	0	a = list(map(int, input().split())) b = input() s = sum(a[i]*b.count(str(i+1)) for i in range(4)) print(s)	Title: Black Square Time Limit: None seconds Memory Limit: None megabytes Problem Description: Quite recently, a very smart student named Jury decided that lectures are boring, so he downloaded a game called "Black Square" on his super cool touchscreen phone. In this game, the phone's screen is divided into four ve...	```python a = list(map(int, input().split())) b = input() s = sum(a[i]*b.count(str(i+1)) for i in range(4)) print(s) ```	3
43	A	Football	PROGRAMMING	1,000	[ "strings" ]	A. Football	2	256	One day Vasya decided to have a look at the results of Berland 1910 Football Championship’s finals. Unfortunately he didn't find the overall score of the match; however, he got hold of a profound description of the match's process. On the whole there are n lines in that description each of which described one goal. E...	The first line contains an integer n (1<=≤<=n<=≤<=100) — the number of lines in the description. Then follow n lines — for each goal the names of the teams that scored it. The names are non-empty lines consisting of uppercase Latin letters whose lengths do not exceed 10 symbols. It is guaranteed that the match di...	Print the name of the winning team. We remind you that in football the team that scores more goals is considered the winner.	[ "1\nABC\n", "5\nA\nABA\nABA\nA\nA\n" ]	[ "ABC\n", "A\n" ]	none	500	[ { "input": "1\nABC", "output": "ABC" }, { "input": "5\nA\nABA\nABA\nA\nA", "output": "A" }, { "input": "2\nXTSJEP\nXTSJEP", "output": "XTSJEP" }, { "input": "3\nXZYDJAEDZ\nXZYDJAEDZ\nXZYDJAEDZ", "output": "XZYDJAEDZ" }, { "input": "3\nQCCYXL\nQCCYXL\nAXGLFQDD", ...	1,649,865,527	2,147,483,647	PyPy 3	OK	TESTS	34	186	0	n=int(input()) d=dict() a=list() for i in range(n): a.append(input()) s=set(a) for items in s: d[items]=0 for i in range(n): d[a[i]]+=1 m=0 k="" for key,value in d.items(): if value>m: m=value k=key print(k)	Title: Football Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: One day Vasya decided to have a look at the results of Berland 1910 Football Championship’s finals. Unfortunately he didn't find the overall score of the match; however, he got hold of a profound description of the match's process...	```python n=int(input()) d=dict() a=list() for i in range(n): a.append(input()) s=set(a) for items in s: d[items]=0 for i in range(n): d[a[i]]+=1 m=0 k="" for key,value in d.items(): if value>m: m=value k=key print(k) ```	3.9535
330	A	Cakeminator	PROGRAMMING	800	[ "brute force", "implementation" ]		null	null	You are given a rectangular cake, represented as an r<=×<=c grid. Each cell either has an evil strawberry, or is empty. For example, a 3<=×<=4 cake may look as follows: The cakeminator is going to eat the cake! Each time he eats, he chooses a row or a column that does not contain any evil strawberries and contains...	The first line contains two integers r and c (2<=≤<=r,<=c<=≤<=10), denoting the number of rows and the number of columns of the cake. The next r lines each contains c characters — the j-th character of the i-th line denotes the content of the cell at row i and column j, and is either one of these: ...	Output the maximum number of cake cells that the cakeminator can eat.	[ "3 4\nS...\n....\n..S.\n" ]	[ "8\n" ]	For the first example, one possible way to eat the maximum number of cake cells is as follows (perform 3 eats).	500	[ { "input": "3 4\nS...\n....\n..S.", "output": "8" }, { "input": "2 2\n..\n..", "output": "4" }, { "input": "2 2\nSS\nSS", "output": "0" }, { "input": "7 3\nS..\nS..\nS..\nS..\nS..\nS..\nS..", "output": "14" }, { "input": "3 5\n..S..\nSSSSS\n..S..", "output": "...	1,668,887,819	2,147,483,647	Python 3	COMPILATION_ERROR	TESTS	0	0	0	r,c = map(int,input().split()) cake = [] for i in range(r): cake.append([input()]) count = 0 for i in range(r): if "s" in cake [i] or "." not in cake[i]: continue count +=cake[i].count(".") cake[i]= ["E"]c for j in range(c): col= [cake[x][j]for x in range...	Title: Cakeminator Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given a rectangular cake, represented as an r<=×<=c grid. Each cell either has an evil strawberry, or is empty. For example, a 3<=×<=4 cake may look as follows: The cakeminator is going to eat the cake! Each ti...	```python r,c = map(int,input().split()) cake = [] for i in range(r): cake.append([input()]) count = 0 for i in range(r): if "s" in cake [i] or "." not in cake[i]: continue count +=cake[i].count(".") cake[i]= ["E"]c for j in range(c): col= [cake[x][j]for ...	-1
620	B	Grandfather Dovlet’s calculator	PROGRAMMING	1,000	[ "implementation" ]		null	null	Once Max found an electronic calculator from his grandfather Dovlet's chest. He noticed that the numbers were written with seven-segment indicators ([https://en.wikipedia.org/wiki/Seven-segment_display](https://en.wikipedia.org/wiki/Seven-segment_display)). Max starts to type all the values from a to b. After typi...	The only line contains two integers a,<=b (1<=≤<=a<=≤<=b<=≤<=106) — the first and the last number typed by Max.	Print the only integer a — the total number of printed segments.	[ "1 3\n", "10 15\n" ]	[ "12\n", "39\n" ]	none	0	[ { "input": "1 3", "output": "12" }, { "input": "10 15", "output": "39" }, { "input": "1 100", "output": "928" }, { "input": "100 10000", "output": "188446" }, { "input": "213 221442", "output": "5645356" }, { "input": "1 1000000", "output": "287333...	1,651,743,230	2,147,483,647	PyPy 3	OK	TESTS	11	623	75,264,000	import sys input = sys.stdin.readline from collections import Counter l = [6,2,5,5,4,5,6,3,7,6] a, b = map(int, input().split()) s = Counter(''.join(map(str, list(range(a,b+1))))) c = 0 for i in s: c += s[i]*l[int(i)] print(c)	Title: Grandfather Dovlet’s calculator Time Limit: None seconds Memory Limit: None megabytes Problem Description: Once Max found an electronic calculator from his grandfather Dovlet's chest. He noticed that the numbers were written with seven-segment indicators ([https://en.wikipedia.org/wiki/Seven-segment_display](...	```python import sys input = sys.stdin.readline from collections import Counter l = [6,2,5,5,4,5,6,3,7,6] a, b = map(int, input().split()) s = Counter(''.join(map(str, list(range(a,b+1))))) c = 0 for i in s: c += s[i]*l[int(i)] print(c) ```	3
131	A	cAPS lOCK	PROGRAMMING	1,000	[ "implementation", "strings" ]		null	null	wHAT DO WE NEED cAPS LOCK FOR? Caps lock is a computer keyboard key. Pressing it sets an input mode in which typed letters are capital by default. If it is pressed by accident, it leads to accidents like the one we had in the first passage. Let's consider that a word has been typed with the Caps lock key accidentall...	The first line of the input data contains a word consisting of uppercase and lowercase Latin letters. The word's length is from 1 to 100 characters, inclusive.	Print the result of the given word's processing.	[ "cAPS\n", "Lock\n" ]	[ "Caps", "Lock\n" ]	none	500	[ { "input": "cAPS", "output": "Caps" }, { "input": "Lock", "output": "Lock" }, { "input": "cAPSlOCK", "output": "cAPSlOCK" }, { "input": "CAPs", "output": "CAPs" }, { "input": "LoCK", "output": "LoCK" }, { "input": "OOPS", "output": "oops" }, { ...	1,691,059,799	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	2	46	0	n=input() if n=="cAPSLOCK": print(n) else: print(n.title())	Title: cAPS lOCK Time Limit: None seconds Memory Limit: None megabytes Problem Description: wHAT DO WE NEED cAPS LOCK FOR? Caps lock is a computer keyboard key. Pressing it sets an input mode in which typed letters are capital by default. If it is pressed by accident, it leads to accidents like the one we had in th...	```python n=input() if n=="cAPSLOCK": print(n) else: print(n.title()) ```	0
835	A	Key races	PROGRAMMING	800	[ "math" ]		null	null	Two boys decided to compete in text typing on the site "Key races". During the competition, they have to type a text consisting of s characters. The first participant types one character in v1 milliseconds and has ping t1 milliseconds. The second participant types one character in v2 milliseconds and has ping *...	The first line contains five integers s, v1, v2, t1, t2 (1<=≤<=s,<=v1,<=v2,<=t1,<=t2<=≤<=1000) — the number of characters in the text, the time of typing one character for the first participant, the time of typing one character for the the second participant, the ping of the first participant and th...	If the first participant wins, print "First". If the second participant wins, print "Second". In case of a draw print "Friendship".	[ "5 1 2 1 2\n", "3 3 1 1 1\n", "4 5 3 1 5\n" ]	[ "First\n", "Second\n", "Friendship\n" ]	In the first example, information on the success of the first participant comes in 7 milliseconds, of the second participant — in 14 milliseconds. So, the first wins. In the second example, information on the success of the first participant comes in 11 milliseconds, of the second participant — in 5 milliseconds. So, ...	500	[ { "input": "5 1 2 1 2", "output": "First" }, { "input": "3 3 1 1 1", "output": "Second" }, { "input": "4 5 3 1 5", "output": "Friendship" }, { "input": "1000 1000 1000 1000 1000", "output": "Friendship" }, { "input": "1 1 1 1 1", "output": "Friendship" }, ...	1,589,970,561	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	0	109	0	a,b,c,d,e=map(int,input().split()) if ab+2d>ac+2e: print("First") elif ab+2d<ac+2e: print("Second") else: print("Friendship")	Title: Key races Time Limit: None seconds Memory Limit: None megabytes Problem Description: Two boys decided to compete in text typing on the site "Key races". During the competition, they have to type a text consisting of s characters. The first participant types one character in v1 milliseconds and has ping *t...	```python a,b,c,d,e=map(int,input().split()) if ab+2d>ac+2e: print("First") elif ab+2d<ac+2e: print("Second") else: print("Friendship") ```	0
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,581,873,440	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	0	218	0	n = int(input()) days = [int(n) for n in input().split()] chest = 0 biceps = 0 back = 0 for i in range(n): if i%3 == 0: chest += 1 elif i%3 == 1: biceps += 1 else: back += 1 if chest > biceps and chest > back: print("chest") elif biceps > chest and biceps > back: print("biceps") el...	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()) days = [int(n) for n in input().split()] chest = 0 biceps = 0 back = 0 for i in range(n): if i%3 == 0: chest += 1 elif i%3 == 1: biceps += 1 else: back += 1 if chest > biceps and chest > back: print("chest") elif biceps > chest and biceps > back: print("bi...	0
749	A	Bachgold Problem	PROGRAMMING	800	[ "greedy", "implementation", "math", "number theory" ]		null	null	Bachgold problem is very easy to formulate. Given a positive integer n represent it as a sum of maximum possible number of prime numbers. One can prove that such representation exists for any integer greater than 1. Recall that integer k is called prime if it is greater than 1 and has exactly two positive integer ...	The only line of the input contains a single integer n (2<=≤<=n<=≤<=100<=000).	The first line of the output contains a single integer k — maximum possible number of primes in representation. The second line should contain k primes with their sum equal to n. You can print them in any order. If there are several optimal solution, print any of them.	[ "5\n", "6\n" ]	[ "2\n2 3\n", "3\n2 2 2\n" ]	none	500	[ { "input": "5", "output": "2\n2 3" }, { "input": "6", "output": "3\n2 2 2" }, { "input": "2", "output": "1\n2" }, { "input": "3", "output": "1\n3" }, { "input": "99999", "output": "49999\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...	1,623,646,874	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	1	61	0	n = int(input()) if n%2 == 0: print(n//2) a = [2]n//2 print(a) else: print((n//2)) a = [2](n//2 - 1) a.append(3) print(a)	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(n//2) a = [2]n//2 print(a) else: print((n//2)) a = [2](n//2 - 1) a.append(3) print(a) ```	-1
404	C	Restore Graph	PROGRAMMING	1,800	[ "dfs and similar", "graphs", "sortings" ]		null	null	Valera had an undirected connected graph without self-loops and multiple edges consisting of n vertices. The graph had an interesting property: there were at most k edges adjacent to each of its vertices. For convenience, we will assume that the graph vertices were indexed by integers from 1 to n. One day Valera...	The first line contains two space-separated integers n and k (1<=≤<=k<=<<=n<=≤<=105). Number n shows the number of vertices in the original graph. Number k shows that at most k edges were adjacent to each vertex in the original graph. The second line contains space-separated integers d[1],<=d[2],<...	If Valera made a mistake in his notes and the required graph doesn't exist, print in the first line number -1. Otherwise, in the first line print integer m (0<=≤<=m<=≤<=106) — the number of edges in the found graph. In each of the next m lines print two space-separated integers ai and bi (1<=≤<=ai,<=...	[ "3 2\n0 1 1\n", "4 2\n2 0 1 3\n", "3 1\n0 0 0\n" ]	[ "3\n1 2\n1 3\n3 2\n", "3\n1 3\n1 4\n2 3\n", "-1\n" ]	none	1,500	[ { "input": "3 2\n0 1 1", "output": "2\n1 2\n1 3" }, { "input": "4 2\n2 0 1 3", "output": "3\n1 3\n1 4\n2 3" }, { "input": "3 1\n0 0 0", "output": "-1" }, { "input": "5 3\n0 2 1 2 1", "output": "4\n1 3\n1 5\n2 5\n4 5" }, { "input": "7 3\n2 2 0 1 3 2 1", "output...	1,639,241,808	2,147,483,647	Python 3	OK	TESTS	43	685	18,124,800	n,k=map(int,input().split()) arr=list(map(int,input().split())) nodes=[[] for i in range(n)] for i in range(n): nodes[arr[i]].append([i+1,0]) edges=[] y=1 mx=0 for i in range(1,max(arr)+1): if(len(nodes[i-1])==0 or len(nodes[i])==0): y=0 break else: nd=nodes[i-1] ...	Title: Restore Graph Time Limit: None seconds Memory Limit: None megabytes Problem Description: Valera had an undirected connected graph without self-loops and multiple edges consisting of n vertices. The graph had an interesting property: there were at most k edges adjacent to each of its vertices. For convenie...	```python n,k=map(int,input().split()) arr=list(map(int,input().split())) nodes=[[] for i in range(n)] for i in range(n): nodes[arr[i]].append([i+1,0]) edges=[] y=1 mx=0 for i in range(1,max(arr)+1): if(len(nodes[i-1])==0 or len(nodes[i])==0): y=0 break else: nd=nodes[i-...	3
11	A	Increasing Sequence	PROGRAMMING	900	[ "constructive algorithms", "implementation", "math" ]	A. Increasing Sequence	1	64	A sequence a0,<=a1,<=...,<=at<=-<=1 is called increasing if ai<=-<=1<=<<=ai for each i:<=0<=<<=i<=<<=t. You are given a sequence b0,<=b1,<=...,<=bn<=-<=1 and a positive integer d. In each move you may choose one element of the given sequence and add d to it. What is the least...	The first line of the input contains two integer numbers n and d (2<=≤<=n<=≤<=2000,<=1<=≤<=d<=≤<=106). The second line contains space separated sequence b0,<=b1,<=...,<=bn<=-<=1 (1<=≤<=bi<=≤<=106).	Output the minimal number of moves needed to make the sequence increasing.	[ "4 2\n1 3 3 2\n" ]	[ "3\n" ]	none	0	[ { "input": "4 2\n1 3 3 2", "output": "3" }, { "input": "2 1\n1 1", "output": "1" }, { "input": "2 1\n2 5", "output": "0" }, { "input": "2 1\n1 2", "output": "0" }, { "input": "2 1\n1 1", "output": "1" }, { "input": "2 7\n10 20", "output": "0" }, ...	1,616,665,347	2,147,483,647	Python 3	OK	TESTS	25	154	307,200	n,k=input().split() n=int(n) k=int(k) li=[] p=input().split() for i in p: li.append(int(i)) cnt=0 for i in range(1,n): if li[i]<=li[i-1]: p = (li[i-1]-li[i])//k p=p+1 cnt=cnt+p li[i]=li[i]+(k*p) print(cnt)	Title: Increasing Sequence Time Limit: 1 seconds Memory Limit: 64 megabytes Problem Description: A sequence a0,<=a1,<=...,<=at<=-<=1 is called increasing if ai<=-<=1<=<<=ai for each i:<=0<=<<=i<=<<=t. You are given a sequence b0,<=b1,<=...,<=bn<=-<=1 and a positive integer d...	```python n,k=input().split() n=int(n) k=int(k) li=[] p=input().split() for i in p: li.append(int(i)) cnt=0 for i in range(1,n): if li[i]<=li[i-1]: p = (li[i-1]-li[i])//k p=p+1 cnt=cnt+p li[i]=li[i]+(k*p) print(cnt) ```	3.920711
0	none	none	none	0	[ "none" ]		null	null	Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases: 1. They are equal. 1. If we split string a into two halves of the same size a1 and a2, and string b into two halves of the same size ...	The first two lines of the input contain two strings given by the teacher. Each of them has the length from 1 to 200<=000 and consists of lowercase English letters. The strings have the same length.	Print "YES" (without the quotes), if these two strings are equivalent, and "NO" (without the quotes) otherwise.	[ "aaba\nabaa\n", "aabb\nabab\n" ]	[ "YES\n", "NO\n" ]	In the first sample you should split the first string into strings "aa" and "ba", the second one — into strings "ab" and "aa". "aa" is equivalent to "aa"; "ab" is equivalent to "ba" as "ab" = "a" + "b", "ba" = "b" + "a". In the second sample the first string can be splitted into strings "aa" and "bb", that are equival...	0	[ { "input": "aaba\nabaa", "output": "YES" }, { "input": "aabb\nabab", "output": "NO" }, { "input": "a\na", "output": "YES" }, { "input": "a\nb", "output": "NO" }, { "input": "ab\nab", "output": "YES" }, { "input": "ab\nba", "output": "YES" }, { ...	1,473,697,325	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	88	2,000	1,126,400	import time def equiv(a, b, e): #a, b lists of strings, len(a) = len(b) = 2 e if e == 0: return a[0] == b[0] else: temp1 = equiv(a[0:2 (e - 1)], b[0:2 (e - 1)], e - 1) if temp1: temp4 = equiv(a[2 (e - 1):2 e], b[2 (e - 1):2 ** e], e - 1) ...	Title: none Time Limit: None seconds Memory Limit: None megabytes Problem Description: Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases: 1. They are equal. 1. If we split string a into t...	```python import time def equiv(a, b, e): #a, b lists of strings, len(a) = len(b) = 2 e if e == 0: return a[0] == b[0] else: temp1 = equiv(a[0:2 (e - 1)], b[0:2 (e - 1)], e - 1) if temp1: temp4 = equiv(a[2 (e - 1):2 e], b[2 (e - 1):2 ** e], e - 1) ...	0
236	A	Boy or Girl	PROGRAMMING	800	[ "brute force", "implementation", "strings" ]		null	null	Those days, many boys use beautiful girls' photos as avatars in forums. So it is pretty hard to tell the gender of a user at the first glance. Last year, our hero went to a forum and had a nice chat with a beauty (he thought so). After that they talked very often and eventually they became a couple in the network. Bu...	The first line contains a non-empty string, that contains only lowercase English letters — the user name. This string contains at most 100 letters.	If it is a female by our hero's method, print "CHAT WITH HER!" (without the quotes), otherwise, print "IGNORE HIM!" (without the quotes).	[ "wjmzbmr\n", "xiaodao\n", "sevenkplus\n" ]	[ "CHAT WITH HER!\n", "IGNORE HIM!\n", "CHAT WITH HER!\n" ]	For the first example. There are 6 distinct characters in "wjmzbmr". These characters are: "w", "j", "m", "z", "b", "r". So wjmzbmr is a female and you should print "CHAT WITH HER!".	500	[ { "input": "wjmzbmr", "output": "CHAT WITH HER!" }, { "input": "xiaodao", "output": "IGNORE HIM!" }, { "input": "sevenkplus", "output": "CHAT WITH HER!" }, { "input": "pezu", "output": "CHAT WITH HER!" }, { "input": "wnemlgppy", "output": "CHAT WITH HER!" },...	1,695,019,564	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	0	124	0	username = input() if(len(username) % 2 == 1): print("IGNORE HIM!") elif (len(username) % 2 == 0): print("CHAT WITH HER!")	Title: Boy or Girl Time Limit: None seconds Memory Limit: None megabytes Problem Description: Those days, many boys use beautiful girls' photos as avatars in forums. So it is pretty hard to tell the gender of a user at the first glance. Last year, our hero went to a forum and had a nice chat with a beauty (he though...	```python username = input() if(len(username) % 2 == 1): print("IGNORE HIM!") elif (len(username) % 2 == 0): print("CHAT WITH HER!") ```	0
38	C	Blinds	PROGRAMMING	1,400	[ "brute force" ]	C. Blinds	2	256	The blinds are known to consist of opaque horizontal stripes that can be rotated thus regulating the amount of light flowing in the room. There are n blind stripes with the width of 1 in the factory warehouse for blind production. The problem is that all of them are spare details from different orders, that is, they ...	The first output line contains two space-separated integers n and l (1<=≤<=n,<=l<=≤<=100). They are the number of stripes in the warehouse and the minimal acceptable length of a blind stripe in bourlemeters. The second line contains space-separated n integers ai. They are the lengths of initial stripes in...	Print the single number — the maximal area of the window in square bourlemeters that can be completely covered. If no window with a positive area that can be covered completely without breaking any of the given rules exist, then print the single number 0.	[ "4 2\n1 2 3 4\n", "5 3\n5 5 7 3 1\n", "2 3\n1 2\n" ]	[ "8\n", "15\n", "0\n" ]	In the first sample test the required window is 2 × 4 in size and the blinds for it consist of 4 parts, each 2 bourlemeters long. One of the parts is the initial stripe with the length of 2, the other one is a part of a cut stripe with the length of 3 and the two remaining stripes are parts of a stripe with the length ...	0	[ { "input": "4 2\n1 2 3 4", "output": "8" }, { "input": "5 3\n5 5 7 3 1", "output": "15" }, { "input": "2 3\n1 2", "output": "0" }, { "input": "2 2\n3 3", "output": "6" }, { "input": "5 2\n2 4 1 1 3", "output": "8" }, { "input": "7 4\n3 2 1 1 1 3 2", ...	1,657,013,330	2,147,483,647	PyPy 3-64	OK	TESTS	36	216	1,536,000	n,l = map(int, input().split()) a = [int(i) for i in input().split()] a.sort() cur = 0 count = 0 ans = 0 for x in range(l,101): count = 0 for j in range(n): count += a[j] // x if count * x > ans: ans = count * x print(ans)	Title: Blinds Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: The blinds are known to consist of opaque horizontal stripes that can be rotated thus regulating the amount of light flowing in the room. There are n blind stripes with the width of 1 in the factory warehouse for blind production....	```python n,l = map(int, input().split()) a = [int(i) for i in input().split()] a.sort() cur = 0 count = 0 ans = 0 for x in range(l,101): count = 0 for j in range(n): count += a[j] // x if count * x > ans: ans = count * x print(ans) ```	3.943139
887	A	Div. 64	PROGRAMMING	1,000	[ "implementation" ]		null	null	Top-model Izabella participates in the competition. She wants to impress judges and show her mathematical skills. Her problem is following: for given string, consisting of only 0 and 1, tell if it's possible to remove some digits in such a way, that remaining number is a representation of some positive integer, divisi...	In the only line given a non-empty binary string s with length up to 100.	Print «yes» (without quotes) if it's possible to remove digits required way and «no» otherwise.	[ "100010001\n", "100\n" ]	[ "yes", "no" ]	In the first test case, you can get string 1 000 000 after removing two ones which is a representation of number 64 in the binary numerical system. You can read more about binary numeral system representation here: [https://en.wikipedia.org/wiki/Binary_system](https://en.wikipedia.org/wiki/Binary_system)	500	[ { "input": "100010001", "output": "yes" }, { "input": "100", "output": "no" }, { "input": "0000001000000", "output": "yes" }, { "input": "1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111", "output": "no" }, { "in...	1,604,475,533	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	11	93	0	x = input() c = x.count('0') c_i = x.count('1') if c>=6 and c_i>=1: print('yes') else: print('no')	Title: Div. 64 Time Limit: None seconds Memory Limit: None megabytes Problem Description: Top-model Izabella participates in the competition. She wants to impress judges and show her mathematical skills. Her problem is following: for given string, consisting of only 0 and 1, tell if it's possible to remove some dig...	```python x = input() c = x.count('0') c_i = x.count('1') if c>=6 and c_i>=1: print('yes') else: print('no') ```	0
448	D	Multiplication Table	PROGRAMMING	1,800	[ "binary search", "brute force" ]		null	null	Bizon the Champion isn't just charming, he also is very smart. While some of us were learning the multiplication table, Bizon the Champion had fun in his own manner. Bizon the Champion painted an n<=×<=m multiplication table, where the element on the intersection of the i-th row and j-th column equals i·j ...	The single line contains integers n, m and k (1<=≤<=n,<=m<=≤<=5·105; 1<=≤<=k<=≤<=n·m).	Print the k-th largest number in a n<=×<=m multiplication table.	[ "2 2 2\n", "2 3 4\n", "1 10 5\n" ]	[ "2\n", "3\n", "5\n" ]	A 2 × 3 multiplication table looks like this:	2,000	[ { "input": "2 2 2", "output": "2" }, { "input": "2 3 4", "output": "3" }, { "input": "1 10 5", "output": "5" }, { "input": "1 1 1", "output": "1" }, { "input": "10 1 7", "output": "7" }, { "input": "10 10 33", "output": "14" }, { "input": "...	1,688,456,164	2,147,483,647	PyPy 3-64	OK	TESTS	127	296	2,150,400	def countNumbers(x, n, m): count = 0 for i in range(1, n+1): count += min(x // i, m) return count n, m, k = map(int, input().split()) low, high = 1, n * m while low < high: mid = (low + high) // 2 count = countNumbers(mid, n, m) if count < k: low = mid + 1 e...	Title: Multiplication Table Time Limit: None seconds Memory Limit: None megabytes Problem Description: Bizon the Champion isn't just charming, he also is very smart. While some of us were learning the multiplication table, Bizon the Champion had fun in his own manner. Bizon the Champion painted an n<=×<=m multi...	```python def countNumbers(x, n, m): count = 0 for i in range(1, n+1): count += min(x // i, m) return count n, m, k = map(int, input().split()) low, high = 1, n * m while low < high: mid = (low + high) // 2 count = countNumbers(mid, n, m) if count < k: low = mid ...	3
573	A	Bear and Poker	PROGRAMMING	1,300	[ "implementation", "math", "number theory" ]		null	null	Limak is an old brown bear. He often plays poker with his friends. Today they went to a casino. There are n players (including Limak himself) and right now all of them have bids on the table. i-th of them has bid with size ai dollars. Each player can double his bid any number of times and triple his bid any nu...	First line of input contains an integer n (2<=≤<=n<=≤<=105), the number of players. The second line contains n integer numbers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=109) — the bids of players.	Print "Yes" (without the quotes) if players can make their bids become equal, or "No" otherwise.	[ "4\n75 150 75 50\n", "3\n100 150 250\n" ]	[ "Yes\n", "No\n" ]	In the first sample test first and third players should double their bids twice, second player should double his bid once and fourth player should both double and triple his bid. It can be shown that in the second sample test there is no way to make all bids equal.	500	[ { "input": "4\n75 150 75 50", "output": "Yes" }, { "input": "3\n100 150 250", "output": "No" }, { "input": "7\n34 34 68 34 34 68 34", "output": "Yes" }, { "input": "10\n72 96 12 18 81 20 6 2 54 1", "output": "No" }, { "input": "20\n958692492 954966768 77387000 724...	1,640,625,836	2,147,483,647	PyPy 3-64	RUNTIME_ERROR	TESTS	15	295	12,902,400	def gcd(a, b): if b == 0: return a else: return gcd(b, a%b) def check(n): while n%2 == 0: n = n/2 while n%3 == 0: n = n/3 return bool(n == 1) n = int(input()) a = list(map(int,input().split())) lcm = 0 for i in range(0, n): if i == 0: lcm = a[i] else: lcm = (l...	Title: Bear and Poker Time Limit: None seconds Memory Limit: None megabytes Problem Description: Limak is an old brown bear. He often plays poker with his friends. Today they went to a casino. There are n players (including Limak himself) and right now all of them have bids on the table. i-th of them has bid wit...	```python def gcd(a, b): if b == 0: return a else: return gcd(b, a%b) def check(n): while n%2 == 0: n = n/2 while n%3 == 0: n = n/3 return bool(n == 1) n = int(input()) a = list(map(int,input().split())) lcm = 0 for i in range(0, n): if i == 0: lcm = a[i] else: ...	-1
876	A	Trip For Meal	PROGRAMMING	900	[ "math" ]		null	null	Winnie-the-Pooh likes honey very much! That is why he decided to visit his friends. Winnie has got three best friends: Rabbit, Owl and Eeyore, each of them lives in his own house. There are winding paths between each pair of houses. The length of a path between Rabbit's and Owl's houses is a meters, between Rabbit's ...	First line contains an integer n (1<=≤<=n<=≤<=100) — number of visits. Second line contains an integer a (1<=≤<=a<=≤<=100) — distance between Rabbit's and Owl's houses. Third line contains an integer b (1<=≤<=b<=≤<=100) — distance between Rabbit's and Eeyore's houses. Fourth line contains an integer c ...	Output one number — minimum distance in meters Winnie must go through to have a meal n times.	[ "3\n2\n3\n1\n", "1\n2\n3\n5\n" ]	[ "3\n", "0\n" ]	In the first test case the optimal path for Winnie is the following: first have a meal in Rabbit's house, then in Owl's house, then in Eeyore's house. Thus he will pass the distance 2 + 1 = 3. In the second test case Winnie has a meal in Rabbit's house and that is for him. So he doesn't have to walk anywhere at all.	500	[ { "input": "3\n2\n3\n1", "output": "3" }, { "input": "1\n2\n3\n5", "output": "0" }, { "input": "10\n1\n8\n3", "output": "9" }, { "input": "7\n10\n5\n6", "output": "30" }, { "input": "9\n9\n7\n5", "output": "42" }, { "input": "9\n37\n85\n76", "outpu...	1,508,163,947	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	46	4,608,000	n = int(input()) a = int(input()) b = int(input()) c = int(input()) score = 0 r = True o = False e = False for i in range(n - 1): if r is True: if a > b: score += b o = True r = False else: score += a e = True ...	Title: Trip For Meal Time Limit: None seconds Memory Limit: None megabytes Problem Description: Winnie-the-Pooh likes honey very much! That is why he decided to visit his friends. Winnie has got three best friends: Rabbit, Owl and Eeyore, each of them lives in his own house. There are winding paths between each pair...	```python n = int(input()) a = int(input()) b = int(input()) c = int(input()) score = 0 r = True o = False e = False for i in range(n - 1): if r is True: if a > b: score += b o = True r = False else: score += a e = Tru...	0
569	B	Inventory	PROGRAMMING	1,200	[ "greedy", "math" ]		null	null	Companies always have a lot of equipment, furniture and other things. All of them should be tracked. To do this, there is an inventory number assigned with each item. It is much easier to create a database by using those numbers and keep the track of everything. During an audit, you were surprised to find out that the...	The first line contains a single integer n — the number of items (1<=≤<=n<=≤<=105). The second line contains n numbers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=105) — the initial inventory numbers of the items.	Print n numbers — the final inventory numbers of the items in the order they occur in the input. If there are multiple possible answers, you may print any of them.	[ "3\n1 3 2\n", "4\n2 2 3 3\n", "1\n2\n" ]	[ "1 3 2 \n", "2 1 3 4 \n", "1 \n" ]	In the first test the numeration is already a permutation, so there is no need to change anything. In the second test there are two pairs of equal numbers, in each pair you need to replace one number. In the third test you need to replace 2 by 1, as the numbering should start from one.	1,000	[ { "input": "3\n1 3 2", "output": "1 3 2 " }, { "input": "4\n2 2 3 3", "output": "2 1 3 4 " }, { "input": "1\n2", "output": "1 " }, { "input": "3\n3 3 1", "output": "3 2 1 " }, { "input": "5\n1 1 1 1 1", "output": "1 2 3 4 5 " }, { "input": "5\n5 3 4 4 ...	1,559,478,958	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	8	109	102,400	n = int(input()) a = list(map(int, input().split())) used = [] all = set(range(1, n+1)) output = '' ins = [] for i in range(n): if a[i] not in used: used.append(a[i]) else: a[i] = 0 ins.append(i) unused = all - set(used) unused = list(unused) for i in range(n): if a[...	Title: Inventory Time Limit: None seconds Memory Limit: None megabytes Problem Description: Companies always have a lot of equipment, furniture and other things. All of them should be tracked. To do this, there is an inventory number assigned with each item. It is much easier to create a database by using those numb...	```python n = int(input()) a = list(map(int, input().split())) used = [] all = set(range(1, n+1)) output = '' ins = [] for i in range(n): if a[i] not in used: used.append(a[i]) else: a[i] = 0 ins.append(i) unused = all - set(used) unused = list(unused) for i in range(n): ...	-1
5	A	Chat Servers Outgoing Traffic	PROGRAMMING	1,000	[ "implementation" ]	A. Chat Server's Outgoing Traffic	1	64	Polycarp is working on a new project called "Polychat". Following modern tendencies in IT, he decided, that this project should contain chat as well. To achieve this goal, Polycarp has spent several hours in front of his laptop and implemented a chat server that can process three types of commands: - Include a person...	Input file will contain not more than 100 commands, each in its own line. No line will exceed 100 characters. Formats of the commands will be the following: - +<name> for 'Add' command. - -<name> for 'Remove' command. - <sender_name>:<message_text> for 'Send' command. <name> and <s...	Print a single number — answer to the problem.	[ "+Mike\nMike:hello\n+Kate\n+Dmitry\n-Dmitry\nKate:hi\n-Kate\n", "+Mike\n-Mike\n+Mike\nMike:Hi I am here\n-Mike\n+Kate\n-Kate\n" ]	[ "9\n", "14\n" ]	none	0	[ { "input": "+Mike\nMike:hello\n+Kate\n+Dmitry\n-Dmitry\nKate:hi\n-Kate", "output": "9" }, { "input": "+Mike\n-Mike\n+Mike\nMike:Hi I am here\n-Mike\n+Kate\n-Kate", "output": "14" }, { "input": "+Dmitry\n+Mike\nDmitry:All letters will be used\nDmitry:qwertyuiopasdfghjklzxcvbnm QWERTYUIO...	1,642,509,288	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	62	0	peoNum = 0 ret = 0 for _ in range(100): s = input() if not s: break if s[0] == '+': peoNum += 1 elif s[0] == '-': peoNum -= 1 else: temp = s.split(':') ret += (len(temp[1]) * peoNum) print(ret)	Title: Chat Servers Outgoing Traffic Time Limit: 1 seconds Memory Limit: 64 megabytes Problem Description: Polycarp is working on a new project called "Polychat". Following modern tendencies in IT, he decided, that this project should contain chat as well. To achieve this goal, Polycarp has spent several hours in fr...	```python peoNum = 0 ret = 0 for _ in range(100): s = input() if not s: break if s[0] == '+': peoNum += 1 elif s[0] == '-': peoNum -= 1 else: temp = s.split(':') ret += (len(temp[1]) * peoNum) print(ret) ```	-1
0	none	none	none	0	[ "none" ]		null	null	Appleman and Toastman play a game. Initially Appleman gives one group of n numbers to the Toastman, then they start to complete the following tasks: - Each time Toastman gets a group of numbers, he sums up all the numbers and adds this sum to the score. Then he gives the group to the Appleman. - Each time Appleman...	The first line contains a single integer n (1<=≤<=n<=≤<=3·105). The second line contains n integers a1, a2, ..., an (1<=≤<=ai<=≤<=106) — the initial group that is given to Toastman.	Print a single integer — the largest possible score.	[ "3\n3 1 5\n", "1\n10\n" ]	[ "26\n", "10\n" ]	Consider the following situation in the first example. Initially Toastman gets group [3, 1, 5] and adds 9 to the score, then he give the group to Appleman. Appleman splits group [3, 1, 5] into two groups: [3, 5] and [1]. Both of them should be given to Toastman. When Toastman receives group [1], he adds 1 to score and ...	0	[ { "input": "3\n3 1 5", "output": "26" }, { "input": "1\n10", "output": "10" }, { "input": "10\n8 10 2 5 6 2 4 7 2 1", "output": "376" }, { "input": "10\n171308 397870 724672 431255 228496 892002 542924 718337 888642 161821", "output": "40204082" }, { "input": "10\...	1,677,592,183	2,147,483,647	PyPy 3-64	OK	TESTS	36	186	39,116,800	n = int(input()) print(sum([min((i + 2), n) * x for i, x in enumerate(sorted(list(map(int, input().split()))))]))	Title: none Time Limit: None seconds Memory Limit: None megabytes Problem Description: Appleman and Toastman play a game. Initially Appleman gives one group of n numbers to the Toastman, then they start to complete the following tasks: - Each time Toastman gets a group of numbers, he sums up all the numbers and ...	```python n = int(input()) print(sum([min((i + 2), n) * x for i, x in enumerate(sorted(list(map(int, input().split()))))])) ```	3
1	A	Theatre Square	PROGRAMMING	1,000	[ "math" ]	A. Theatre Square	1	256	Theatre Square in the capital city of Berland has a rectangular shape with the size n<=×<=m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size a<=×<=a. What is the least number of flagstones needed to pave the...	The input contains three positive integer numbers in the first line: n,<=<=m and a (1<=≤<=<=n,<=m,<=a<=≤<=109).	Write the needed number of flagstones.	[ "6 6 4\n" ]	[ "4\n" ]	none	0	[ { "input": "6 6 4", "output": "4" }, { "input": "1 1 1", "output": "1" }, { "input": "2 1 1", "output": "2" }, { "input": "1 2 1", "output": "2" }, { "input": "2 2 1", "output": "4" }, { "input": "2 1 2", "output": "1" }, { "input": "1 1 3"...	1,665,287,410	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	46	0	# Theatre Square n, m, a = input().split() n1 = int(n) m1 = int(m) a1 = int(a) i=1 b = a1a1 while n1m1 > b: b = a1a1i i = i+1 print(i)	Title: Theatre Square Time Limit: 1 seconds Memory Limit: 256 megabytes Problem Description: Theatre Square in the capital city of Berland has a rectangular shape with the size n<=×<=m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each ...	```python # Theatre Square n, m, a = input().split() n1 = int(n) m1 = int(m) a1 = int(a) i=1 b = a1a1 while n1m1 > b: b = a1a1i i = i+1 print(i) ```	0
115	A	Party	PROGRAMMING	900	[ "dfs and similar", "graphs", "trees" ]		null	null	A company has n employees numbered from 1 to n. Each employee either has no immediate manager or exactly one immediate manager, who is another employee with a different number. An employee A is said to be the superior of another employee B if at least one of the following is true: - Employee A is the immedi...	The first line contains integer n (1<=≤<=n<=≤<=2000) — the number of employees. The next n lines contain the integers pi (1<=≤<=pi<=≤<=n or pi<==<=-1). Every pi denotes the immediate manager for the i-th employee. If pi is -1, that means that the i-th employee does not have an immediate...	Print a single integer denoting the minimum number of groups that will be formed in the party.	[ "5\n-1\n1\n2\n1\n-1\n" ]	[ "3\n" ]	For the first example, three groups are sufficient, for example: - Employee 1 - Employees 2 and 4 - Employees 3 and 5	500	[ { "input": "5\n-1\n1\n2\n1\n-1", "output": "3" }, { "input": "4\n-1\n1\n2\n3", "output": "4" }, { "input": "12\n-1\n1\n2\n3\n-1\n5\n6\n7\n-1\n9\n10\n11", "output": "4" }, { "input": "6\n-1\n-1\n2\n3\n1\n1", "output": "3" }, { "input": "3\n-1\n1\n1", "output": ...	1,688,982,002	2,147,483,647	PyPy 3-64	RUNTIME_ERROR	TESTS	0	124	3,481,600	dddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd3343453465654654cdcdcdcdscdsddf	Title: Party Time Limit: None seconds Memory Limit: None megabytes Problem Description: A company has n employees numbered from 1 to n. Each employee either has no immediate manager or exactly one immediate manager, who is another employee with a different number. An employee A is said to be the superior of an...	```python dddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd3343453465654654cdcdcdcdscdsddf ```	-1
828	B	Black Square	PROGRAMMING	1,300	[ "implementation" ]		null	null	Polycarp has a checkered sheet of paper of size n<=×<=m. Polycarp painted some of cells with black, the others remained white. Inspired by Malevich's "Black Square", Polycarp wants to paint minimum possible number of white cells with black so that all black cells form a square. You are to determine the minimum pos...	The first line contains two integers n and m (1<=≤<=n,<=m<=≤<=100) — the sizes of the sheet. The next n lines contain m letters 'B' or 'W' each — the description of initial cells' colors. If a letter is 'B', then the corresponding cell is painted black, otherwise it is painted white.	Print the minimum number of cells needed to be painted black so that the black cells form a black square with sides parallel to the painting's sides. All the cells that do not belong to the square should be white. If it is impossible, print -1.	[ "5 4\nWWWW\nWWWB\nWWWB\nWWBB\nWWWW\n", "1 2\nBB\n", "3 3\nWWW\nWWW\nWWW\n" ]	[ "5\n", "-1\n", "1\n" ]	In the first example it is needed to paint 5 cells — (2, 2), (2, 3), (3, 2), (3, 3) and (4, 2). Then there will be a square with side equal to three, and the upper left corner in (2, 2). In the second example all the cells are painted black and form a rectangle, so it's impossible to get a square. In the third exampl...	750	[ { "input": "5 4\nWWWW\nWWWB\nWWWB\nWWBB\nWWWW", "output": "5" }, { "input": "1 2\nBB", "output": "-1" }, { "input": "3 3\nWWW\nWWW\nWWW", "output": "1" }, { "input": "100 1\nW\nW\nW\nW\nW\nW\nW\nW\nW\nW\nW\nW\nW\nW\nW\nW\nW\nB\nW\nW\nW\nW\nW\nW\nW\nW\nW\nW\nW\nW\nW\nW\nW\nW\n...	1,678,887,072	2,147,483,647	PyPy 3	OK	TESTS	128	93	1,638,400	n, m = map(int, input().split()) nn0 = n nn1 = -1 mm0 = m mm1 = -1 cnt = 0 for i in range(n): s = input().strip() if "B" in s: nn0 = min(i, nn0) nn1 = max(i, nn1) mm0 = min(s.index("B"), mm0) mm1 = max(s.rindex("B"), mm1) cnt += sum(map(lambda z: z == "B", s)) if nn1 < 0: prin...	Title: Black Square Time Limit: None seconds Memory Limit: None megabytes Problem Description: Polycarp has a checkered sheet of paper of size n<=×<=m. Polycarp painted some of cells with black, the others remained white. Inspired by Malevich's "Black Square", Polycarp wants to paint minimum possible number of w...	```python n, m = map(int, input().split()) nn0 = n nn1 = -1 mm0 = m mm1 = -1 cnt = 0 for i in range(n): s = input().strip() if "B" in s: nn0 = min(i, nn0) nn1 = max(i, nn1) mm0 = min(s.index("B"), mm0) mm1 = max(s.rindex("B"), mm1) cnt += sum(map(lambda z: z == "B", s)) if nn1 < ...	3
0	none	none	none	0	[ "none" ]		null	null	Vasya the programmer lives in the middle of the Programming subway branch. He has two girlfriends: Dasha and Masha, who live at the different ends of the branch, each one is unaware of the other one's existence. When Vasya has some free time, he goes to one of his girlfriends. He descends into the subway at some time,...	The first line contains two integers a and b (a<=≠<=b,<=1<=≤<=a,<=b<=≤<=106).	Print "Dasha" if Vasya will go to Dasha more frequently, "Masha" if he will go to Masha more frequently, or "Equal" if he will go to both girlfriends with the same frequency.	[ "3 7\n", "5 3\n", "2 3\n" ]	[ "Dasha\n", "Masha\n", "Equal\n" ]	Let's take a look at the third sample. Let the trains start to go at the zero moment of time. It is clear that the moments of the trains' arrival will be periodic with period 6. That's why it is enough to show that if Vasya descends to the subway at a moment of time inside the interval (0, 6], he will go to both girls ...	0	[ { "input": "3 7", "output": "Dasha" }, { "input": "5 3", "output": "Masha" }, { "input": "2 3", "output": "Equal" }, { "input": "31 88", "output": "Dasha" }, { "input": "8 75", "output": "Dasha" }, { "input": "32 99", "output": "Dasha" }, { ...	1,536,070,237	2,147,483,647	Python 3	OK	TESTS	57	248	0	from math import gcd a,b = map(int,input().split(' ')) gcd = gcd(a,b) a,b = a/gcd, b/gcd if abs(a-b) <= 1: print('Equal') elif a < b: print('Dasha') else: print('Masha')	Title: none Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya the programmer lives in the middle of the Programming subway branch. He has two girlfriends: Dasha and Masha, who live at the different ends of the branch, each one is unaware of the other one's existence. When Vasya has so...	```python from math import gcd a,b = map(int,input().split(' ')) gcd = gcd(a,b) a,b = a/gcd, b/gcd if abs(a-b) <= 1: print('Equal') elif a < b: print('Dasha') else: print('Masha') ```	3
378	A	Playing with Dice	PROGRAMMING	800	[ "brute force" ]		null	null	Two players are playing a game. First each of them writes an integer from 1 to 6, and then a dice is thrown. The player whose written number got closer to the number on the dice wins. If both payers have the same difference, it's a draw. The first player wrote number a, the second player wrote number b. How many w...	The single line contains two integers a and b (1<=≤<=a,<=b<=≤<=6) — the numbers written on the paper by the first and second player, correspondingly.	Print three integers: the number of ways to throw the dice at which the first player wins, the game ends with a draw or the second player wins, correspondingly.	[ "2 5\n", "2 4\n" ]	[ "3 0 3\n", "2 1 3\n" ]	The dice is a standard cube-shaped six-sided object with each side containing a number from 1 to 6, and where all numbers on all sides are distinct. You can assume that number a is closer to number x than number b, if \|a - x\| < \|b - x\|.	500	[ { "input": "2 5", "output": "3 0 3" }, { "input": "2 4", "output": "2 1 3" }, { "input": "5 3", "output": "2 1 3" }, { "input": "1 6", "output": "3 0 3" }, { "input": "5 1", "output": "3 1 2" }, { "input": "6 3", "output": "2 0 4" }, { "inp...	1,608,990,516	2,147,483,647	PyPy 3	COMPILATION_ERROR	TESTS	0	0	0	#include<bits/stdc++.h> using namespace std; int main() { int a,b,i,x,wf=0,wl=0,dr=0; cin>>a>>b; for(i=1;i<=6;i++){ if(abs(i-a)<abs(i-b)) wf++; else if(abs(i-a)>abs(i-b)) wl++; else dr++; } cout<<wf<<" "<<dr<<" "<<wl<<endl...	Title: Playing with Dice Time Limit: None seconds Memory Limit: None megabytes Problem Description: Two players are playing a game. First each of them writes an integer from 1 to 6, and then a dice is thrown. The player whose written number got closer to the number on the dice wins. If both payers have the same diff...	```python #include<bits/stdc++.h> using namespace std; int main() { int a,b,i,x,wf=0,wl=0,dr=0; cin>>a>>b; for(i=1;i<=6;i++){ if(abs(i-a)<abs(i-b)) wf++; else if(abs(i-a)>abs(i-b)) wl++; else dr++; } cout<<wf<<" "<<dr<<" "...	-1
300	A	Array	PROGRAMMING	1,100	[ "brute force", "constructive algorithms", "implementation" ]		null	null	Vitaly has an array of n distinct integers. Vitaly wants to divide this array into three non-empty sets so as the following conditions hold: 1. The product of all numbers in the first set is less than zero (<=<<=0). 1. The product of all numbers in the second set is greater than zero (<=><=0). 1. The produ...	The first line of the input contains integer n (3<=≤<=n<=≤<=100). The second line contains n space-separated distinct integers a1,<=a2,<=...,<=an (\|ai\|<=≤<=103) — the array elements.	In the first line print integer n1 (n1<=><=0) — the number of elements in the first set. Then print n1 numbers — the elements that got to the first set. In the next line print integer n2 (n2<=><=0) — the number of elements in the second set. Then print n2 numbers — the elements that got to the second...	[ "3\n-1 2 0\n", "4\n-1 -2 -3 0\n" ]	[ "1 -1\n1 2\n1 0\n", "1 -1\n2 -3 -2\n1 0\n" ]	none	500	[ { "input": "3\n-1 2 0", "output": "1 -1\n1 2\n1 0" }, { "input": "4\n-1 -2 -3 0", "output": "1 -1\n2 -3 -2\n1 0" }, { "input": "5\n-1 -2 1 2 0", "output": "1 -1\n2 1 2\n2 0 -2" }, { "input": "100\n-64 -51 -75 -98 74 -26 -1 -8 -99 -76 -53 -80 -43 -22 -100 -62 -34 -5 -65 -81 -1...	1,688,912,749	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	60	0	n = int(input()) a= list(map(int, input().split())) list1 =[] list2 =[] list3 = [] count_neg_l1 = 0 count_neg_l2 = 0 for i in range(0, len(a)): if a[i] < 0: if count_neg_l1 < 1: list1.append(a[i]) count_neg_l1 = count_neg_l1 + 1 else: if count_n...	Title: Array Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vitaly has an array of n distinct integers. Vitaly wants to divide this array into three non-empty sets so as the following conditions hold: 1. The product of all numbers in the first set is less than zero (<=<<=0). 1. T...	```python n = int(input()) a= list(map(int, input().split())) list1 =[] list2 =[] list3 = [] count_neg_l1 = 0 count_neg_l2 = 0 for i in range(0, len(a)): if a[i] < 0: if count_neg_l1 < 1: list1.append(a[i]) count_neg_l1 = count_neg_l1 + 1 else: ...	0
448	A	Rewards	PROGRAMMING	800	[ "implementation" ]		null	null	Bizon the Champion is called the Champion for a reason. Bizon the Champion has recently got a present — a new glass cupboard with n shelves and he decided to put all his presents there. All the presents can be divided into two types: medals and cups. Bizon the Champion has a1 first prize cups, a2 second prize c...	The first line contains integers a1, a2 and a3 (0<=≤<=a1,<=a2,<=a3<=≤<=100). The second line contains integers b1, b2 and b3 (0<=≤<=b1,<=b2,<=b3<=≤<=100). The third line contains integer n (1<=≤<=n<=≤<=100). The numbers in the lines are separated by single spaces.	Print "YES" (without the quotes) if all the rewards can be put on the shelves in the described manner. Otherwise, print "NO" (without the quotes).	[ "1 1 1\n1 1 1\n4\n", "1 1 3\n2 3 4\n2\n", "1 0 0\n1 0 0\n1\n" ]	[ "YES\n", "YES\n", "NO\n" ]	none	500	[ { "input": "1 1 1\n1 1 1\n4", "output": "YES" }, { "input": "1 1 3\n2 3 4\n2", "output": "YES" }, { "input": "1 0 0\n1 0 0\n1", "output": "NO" }, { "input": "0 0 0\n0 0 0\n1", "output": "YES" }, { "input": "100 100 100\n100 100 100\n100", "output": "YES" }, ...	1,641,667,440	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	3	30	0	import math cups = input("").split(" ") medals = input("").split(" ") shelves = int(input("")) medals = list(map(int, medals)) cups = list(map(int, cups)) if True:#medals[0] and medals[1] and medals[2] and cups[0] and cups[1] and cups[2] >= 0 and medals[0] and medals[1] and medals[2] and cups[0] and cups[1] a...	Title: Rewards Time Limit: None seconds Memory Limit: None megabytes Problem Description: Bizon the Champion is called the Champion for a reason. Bizon the Champion has recently got a present — a new glass cupboard with n shelves and he decided to put all his presents there. All the presents can be divided into ...	```python import math cups = input("").split(" ") medals = input("").split(" ") shelves = int(input("")) medals = list(map(int, medals)) cups = list(map(int, cups)) if True:#medals[0] and medals[1] and medals[2] and cups[0] and cups[1] and cups[2] >= 0 and medals[0] and medals[1] and medals[2] and cups[0] and...	0
53	C	Little Frog	PROGRAMMING	1,200	[ "constructive algorithms" ]	C. Little Frog	2	256	Once upon a time a little frog whose name was Vasya decided to travel around his home swamp. Overall there are n mounds on the swamp, located on one line. The distance between the neighboring mounds is one meter. Vasya wants to visit all the mounds in one day; besides, he wants to visit each one exactly once. For tha...	The single line contains a number n (1<=≤<=n<=≤<=104) which is the number of mounds.	Print n integers pi (1<=≤<=pi<=≤<=n) which are the frog's route plan. - All the pi's should be mutually different. - All the \|pi–pi<=+<=1\|'s should be mutually different (1<=≤<=i<=≤<=n<=-<=1). If there are several solutions, output any.	[ "2\n", "3\n" ]	[ "1 2 ", "1 3 2 " ]	none	1,500	[ { "input": "2", "output": "1 2 " }, { "input": "3", "output": "1 3 2 " }, { "input": "4", "output": "1 4 2 3 " }, { "input": "5", "output": "1 5 2 4 3 " }, { "input": "6", "output": "1 6 2 5 3 4 " }, { "input": "1", "output": "1 " }, { "inp...	1,676,741,825	2,147,483,647	Python 3	OK	TESTS	22	124	0	''' 2 1 2 ==== 3 diff = 2 1 1 1 + 2 3 1 + 2 - 1 2 ========= 4 diff = 3 1 1 + 3 = 4 4 - 2 = 2 2 + 1 = 3 1 4 2 3 ======== 5 diff = 4 1 1 + 4 = 5 5 - 3 = 2 2 + 2 = 4 4 - 1 = 3 1 5 2 4 3 ========= ''' n = int(input()) routes = [] routes.append...	Title: Little Frog Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Once upon a time a little frog whose name was Vasya decided to travel around his home swamp. Overall there are n mounds on the swamp, located on one line. The distance between the neighboring mounds is one meter. Vasya wants ...	```python ''' 2 1 2 ==== 3 diff = 2 1 1 1 + 2 3 1 + 2 - 1 2 ========= 4 diff = 3 1 1 + 3 = 4 4 - 2 = 2 2 + 1 = 3 1 4 2 3 ======== 5 diff = 4 1 1 + 4 = 5 5 - 3 = 2 2 + 2 = 4 4 - 1 = 3 1 5 2 4 3 ========= ''' n = int(input()) routes = [] rou...	3.969
124	A	The number of positions	PROGRAMMING	1,000	[ "math" ]		null	null	Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standing behind him. Find the number of different positions Petr can occupy.	The only line contains three integers n, a and b (0<=≤<=a,<=b<=<<=n<=≤<=100).	Print the single number — the number of the sought positions.	[ "3 1 1\n", "5 2 3\n" ]	[ "2\n", "3\n" ]	The possible positions in the first sample are: 2 and 3 (if we number the positions starting with 1). In the second sample they are 3, 4 and 5.	500	[ { "input": "3 1 1", "output": "2" }, { "input": "5 2 3", "output": "3" }, { "input": "5 4 0", "output": "1" }, { "input": "6 5 5", "output": "1" }, { "input": "9 4 3", "output": "4" }, { "input": "11 4 6", "output": "7" }, { "input": "13 8 ...	1,685,648,765	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	62	0	print(322) print(511) print(0/100)	Title: The number of positions Time Limit: None seconds Memory Limit: None megabytes Problem Description: Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standing behind h...	```python print(322) print(511) print(0/100) ```	0
909	A	Generate Login	PROGRAMMING	1,000	[ "brute force", "greedy", "sortings" ]		null	null	The preferred way to generate user login in Polygon is to concatenate a prefix of the user's first name and a prefix of their last name, in that order. Each prefix must be non-empty, and any of the prefixes can be the full name. Typically there are multiple possible logins for each person. You are given the first and ...	The input consists of a single line containing two space-separated strings: the first and the last names. Each character of each string is a lowercase English letter. The length of each string is between 1 and 10, inclusive.	Output a single string — alphabetically earliest possible login formed from these names. The output should be given in lowercase as well.	[ "harry potter\n", "tom riddle\n" ]	[ "hap\n", "tomr\n" ]	none	500	[ { "input": "harry potter", "output": "hap" }, { "input": "tom riddle", "output": "tomr" }, { "input": "a qdpinbmcrf", "output": "aq" }, { "input": "wixjzniiub ssdfodfgap", "output": "wis" }, { "input": "z z", "output": "zz" }, { "input": "ertuyivhfg v"...	1,590,412,216	2,147,483,647	PyPy 3	OK	TESTS	64	171	0	s,r=input().split() n,m=len(s),len(r) l=s[0] for i in range(1,n): if(s[i]<r[0]): l=l+s[i] else: break l=l+r[0] print(l)	Title: Generate Login Time Limit: None seconds Memory Limit: None megabytes Problem Description: The preferred way to generate user login in Polygon is to concatenate a prefix of the user's first name and a prefix of their last name, in that order. Each prefix must be non-empty, and any of the prefixes can be the fu...	```python s,r=input().split() n,m=len(s),len(r) l=s[0] for i in range(1,n): if(s[i]<r[0]): l=l+s[i] else: break l=l+r[0] print(l) ```	3
897	A	Scarborough Fair	PROGRAMMING	800	[ "implementation" ]		null	null	Parsley, sage, rosemary and thyme. Remember me to one who lives there. He once was the true love of mine. Willem is taking the girl to the highest building in island No.28, however, neither of them knows how to get there. Willem asks his friend, Grick for directions, Grick helped them, and gave them a task. Althou...	The first line contains two integers n and m (1<=≤<=n,<=m<=≤<=100). The second line contains a string s of length n, consisting of lowercase English letters. Each of the next m lines contains four parameters l,<=r,<=c1,<=c2 (1<=≤<=l<=≤<=r<=≤<=n, c1,<=c2 are lowercase English letters), ...	Output string s after performing m operations described above.	[ "3 1\nioi\n1 1 i n\n", "5 3\nwxhak\n3 3 h x\n1 5 x a\n1 3 w g\n" ]	[ "noi", "gaaak" ]	For the second example: After the first operation, the string is wxxak. After the second operation, the string is waaak. After the third operation, the string is gaaak.	500	[ { "input": "3 1\nioi\n1 1 i n", "output": "noi" }, { "input": "5 3\nwxhak\n3 3 h x\n1 5 x a\n1 3 w g", "output": "gaaak" }, { "input": "9 51\nbhfbdcgff\n2 3 b b\n2 8 e f\n3 8 g f\n5 7 d a\n1 5 e b\n3 4 g b\n6 7 c d\n3 6 e g\n3 6 e h\n5 6 a e\n7 9 a c\n4 9 a h\n3 7 c b\n6 9 b g\n1 7 h b\n...	1,618,652,346	2,147,483,647	PyPy 3	OK	TESTS	47	108	2,662,400	def main(): n, m=tuple(map(int,input().split())) s=list(input()) for _ in range(m): l, r, c1, c2=tuple(input().split()) l=int(l) r=int(r) l-=1 r-=1 if l==r: if s[l]==c1: s[l]=c2 else: for i in range(l, r+1): if s[i]==c1: s[i]=c2 print(''.join(map(str,s))) if __name_...	Title: Scarborough Fair Time Limit: None seconds Memory Limit: None megabytes Problem Description: Parsley, sage, rosemary and thyme. Remember me to one who lives there. He once was the true love of mine. Willem is taking the girl to the highest building in island No.28, however, neither of them knows how to get ...	```python def main(): n, m=tuple(map(int,input().split())) s=list(input()) for _ in range(m): l, r, c1, c2=tuple(input().split()) l=int(l) r=int(r) l-=1 r-=1 if l==r: if s[l]==c1: s[l]=c2 else: for i in range(l, r+1): if s[i]==c1: s[i]=c2 print(''.join(map(str,s))) ...	3
152	A	Marks	PROGRAMMING	900	[ "implementation" ]		null	null	Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook. Overall the group has n students. They received marks for m subjects. Each student got a mark from 1 to 9 (inclusive) for each subject. Let's consider a student the best at ...	The first input line contains two integers n and m (1<=≤<=n,<=m<=≤<=100) — the number of students and the number of subjects, correspondingly. Next n lines each containing m characters describe the gradebook. Each character in the gradebook is a number from 1 to 9. Note that the marks in a rows are not sepa...	Print the single number — the number of successful students in the given group.	[ "3 3\n223\n232\n112\n", "3 5\n91728\n11828\n11111\n" ]	[ "2\n", "3\n" ]	In the first sample test the student number 1 is the best at subjects 1 and 3, student 2 is the best at subjects 1 and 2, but student 3 isn't the best at any subject. In the second sample test each student is the best at at least one subject.	500	[ { "input": "3 3\n223\n232\n112", "output": "2" }, { "input": "3 5\n91728\n11828\n11111", "output": "3" }, { "input": "2 2\n48\n27", "output": "1" }, { "input": "2 1\n4\n6", "output": "1" }, { "input": "1 2\n57", "output": "1" }, { "input": "1 1\n5", ...	1,697,109,789	2,147,483,647	Python 3	OK	TESTS	44	46	0	num_students, num_subjects = map(int, input().split()) student_marks = [input() for _ in range(num_students)] is_successful = [False] * num_students for subject in range(num_subjects): best_mark = '0' for student in range(num_students): if student_marks[student][subject] > best_mark: ...	Title: Marks Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook. Overall the group has n students. They received marks for m subjects. Each student ...	```python num_students, num_subjects = map(int, input().split()) student_marks = [input() for _ in range(num_students)] is_successful = [False] * num_students for subject in range(num_subjects): best_mark = '0' for student in range(num_students): if student_marks[student][subject] > best_mark: ...	3
315	A	Sereja and Bottles	PROGRAMMING	1,400	[ "brute force" ]		null	null	Sereja and his friends went to a picnic. The guys had n soda bottles just for it. Sereja forgot the bottle opener as usual, so the guys had to come up with another way to open bottles. Sereja knows that the i-th bottle is from brand ai, besides, you can use it to open other bottles of brand bi. You can use...	The first line contains integer n (1<=≤<=n<=≤<=100) — the number of bottles. The next n lines contain the bottles' description. The i-th line contains two integers ai,<=bi (1<=≤<=ai,<=bi<=≤<=1000) — the description of the i-th bottle.	In a single line print a single integer — the answer to the problem.	[ "4\n1 1\n2 2\n3 3\n4 4\n", "4\n1 2\n2 3\n3 4\n4 1\n" ]	[ "4\n", "0\n" ]	none	500	[ { "input": "4\n1 1\n2 2\n3 3\n4 4", "output": "4" }, { "input": "4\n1 2\n2 3\n3 4\n4 1", "output": "0" }, { "input": "3\n2 828\n4 392\n4 903", "output": "3" }, { "input": "4\n2 3\n1 772\n3 870\n3 668", "output": "2" }, { "input": "5\n1 4\n6 6\n4 3\n3 4\n4 758", ...	1,586,591,376	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	216	0	ans=0 for i in range(int(input())): x,y=map(int,input().split()) if x==y: ans+=1 print(ans)	Title: Sereja and Bottles Time Limit: None seconds Memory Limit: None megabytes Problem Description: Sereja and his friends went to a picnic. The guys had n soda bottles just for it. Sereja forgot the bottle opener as usual, so the guys had to come up with another way to open bottles. Sereja knows that the i-th...	```python ans=0 for i in range(int(input())): x,y=map(int,input().split()) if x==y: ans+=1 print(ans) ```	0
268	B	Buttons	PROGRAMMING	1,000	[ "implementation", "math" ]		null	null	Manao is trying to open a rather challenging lock. The lock has n buttons on it and to open it, you should press the buttons in a certain order to open the lock. When you push some button, it either stays pressed into the lock (that means that you've guessed correctly and pushed the button that goes next in the seque...	A single line contains integer n (1<=≤<=n<=≤<=2000) — the number of buttons the lock has.	In a single line print the number of times Manao has to push a button in the worst-case scenario.	[ "2\n", "3\n" ]	[ "3\n", "7\n" ]	Consider the first test sample. Manao can fail his first push and push the wrong button. In this case he will already be able to guess the right one with his second push. And his third push will push the second right button. Thus, in the worst-case scenario he will only need 3 pushes.	1,000	[ { "input": "2", "output": "3" }, { "input": "3", "output": "7" }, { "input": "4", "output": "14" }, { "input": "1", "output": "1" }, { "input": "10", "output": "175" }, { "input": "2000", "output": "1333335000" }, { "input": "1747", "ou...	1,677,933,915	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	60	0	n = int(input()) if 1 < n <= 2000: a=n*n-n//2 print(a) elif n==1: print(n) else: print('Не верное значеие')	Title: Buttons Time Limit: None seconds Memory Limit: None megabytes Problem Description: Manao is trying to open a rather challenging lock. The lock has n buttons on it and to open it, you should press the buttons in a certain order to open the lock. When you push some button, it either stays pressed into the loc...	```python n = int(input()) if 1 < n <= 2000: a=n*n-n//2 print(a) elif n==1: print(n) else: print('Не верное значеие') ```	0
879	A	Borya's Diagnosis	PROGRAMMING	900	[ "implementation" ]		null	null	It seems that Borya is seriously sick. He is going visit n doctors to find out the exact diagnosis. Each of the doctors needs the information about all previous visits, so Borya has to visit them in the prescribed order (i.e. Borya should first visit doctor 1, then doctor 2, then doctor 3 and so on). Borya will get t...	First line contains an integer n — number of doctors (1<=≤<=n<=≤<=1000). Next n lines contain two numbers si and di (1<=≤<=si,<=di<=≤<=1000).	Output a single integer — the minimum day at which Borya can visit the last doctor.	[ "3\n2 2\n1 2\n2 2\n", "2\n10 1\n6 5\n" ]	[ "4\n", "11\n" ]	In the first sample case, Borya can visit all doctors on days 2, 3 and 4. In the second sample case, Borya can visit all doctors on days 10 and 11.	500	[ { "input": "3\n2 2\n1 2\n2 2", "output": "4" }, { "input": "2\n10 1\n6 5", "output": "11" }, { "input": "3\n6 10\n3 3\n8 2", "output": "10" }, { "input": "4\n4 8\n10 10\n4 2\n8 2", "output": "14" }, { "input": "5\n7 1\n5 1\n6 1\n1 6\n6 8", "output": "14" }, ...	1,572,450,767	2,147,483,647	Python 3	OK	TESTS	51	405	204,800	a = 0 for i in range(int(input())): s, d = list(map(int, input().split())) a += 1 while a < s or (a - s) % d != 0: a += 1 print(a)	Title: Borya's Diagnosis Time Limit: None seconds Memory Limit: None megabytes Problem Description: It seems that Borya is seriously sick. He is going visit n doctors to find out the exact diagnosis. Each of the doctors needs the information about all previous visits, so Borya has to visit them in the prescribed o...	```python a = 0 for i in range(int(input())): s, d = list(map(int, input().split())) a += 1 while a < s or (a - s) % d != 0: a += 1 print(a) ```	3
151	A	Soft Drinking	PROGRAMMING	800	[ "implementation", "math" ]		null	null	This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bought c limes and cut each of them into d slices. After that they found p grams of salt. To make a toast, each frie...	The first and only line contains positive integers n, k, l, c, d, p, nl, np, not exceeding 1000 and no less than 1. The numbers are separated by exactly one space.	Print a single integer — the number of toasts each friend can make.	[ "3 4 5 10 8 100 3 1\n", "5 100 10 1 19 90 4 3\n", "10 1000 1000 25 23 1 50 1\n" ]	[ "2\n", "3\n", "0\n" ]	A comment to the first sample: Overall the friends have 4 * 5 = 20 milliliters of the drink, it is enough to make 20 / 3 = 6 toasts. The limes are enough for 10 * 8 = 80 toasts and the salt is enough for 100 / 1 = 100 toasts. However, there are 3 friends in the group, so the answer is min(6, 80, 100) / 3 = 2.	500	[ { "input": "3 4 5 10 8 100 3 1", "output": "2" }, { "input": "5 100 10 1 19 90 4 3", "output": "3" }, { "input": "10 1000 1000 25 23 1 50 1", "output": "0" }, { "input": "1 7 4 5 5 8 3 2", "output": "4" }, { "input": "2 3 3 5 5 10 1 3", "output": "1" }, { ...	1,691,566,192	2,147,483,647	Python 3	OK	TESTS	27	92	0	n,k,l,c,d,p,nl,np=map(int,input().split()) ll=[((kl/nl)//1),cd,(p/np)//1] print(int(min(ll)/n))	Title: Soft Drinking Time Limit: None seconds Memory Limit: None megabytes Problem Description: This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bought c limes and cut...	```python n,k,l,c,d,p,nl,np=map(int,input().split()) ll=[((kl/nl)//1),cd,(p/np)//1] print(int(min(ll)/n)) ```	3
220	A	Little Elephant and Problem	PROGRAMMING	1,300	[ "implementation", "sortings" ]		null	null	The Little Elephant has got a problem — somebody has been touching his sorted by non-decreasing array a of length n and possibly swapped some elements of the array. The Little Elephant doesn't want to call the police until he understands if he could have accidentally changed the array himself. He thinks that he co...	The first line contains a single integer n (2<=≤<=n<=≤<=105) — the size of array a. The next line contains n positive integers, separated by single spaces and not exceeding 109, — array a. Note that the elements of the array are not necessarily distinct numbers.	In a single line print "YES" (without the quotes) if the Little Elephant could have accidentally changed the array himself, and "NO" (without the quotes) otherwise.	[ "2\n1 2\n", "3\n3 2 1\n", "4\n4 3 2 1\n" ]	[ "YES\n", "YES\n", "NO\n" ]	In the first sample the array has already been sorted, so to sort it, we need 0 swap operations, that is not more than 1. Thus, the answer is "YES". In the second sample we can sort the array if we swap elements 1 and 3, so we need 1 swap operation to sort the array. Thus, the answer is "YES". In the third sample we ...	500	[ { "input": "2\n1 2", "output": "YES" }, { "input": "3\n3 2 1", "output": "YES" }, { "input": "4\n4 3 2 1", "output": "NO" }, { "input": "3\n1 3 2", "output": "YES" }, { "input": "2\n2 1", "output": "YES" }, { "input": "9\n7 7 8 8 10 10 10 10 1000000000...	1,696,302,428	2,147,483,647	PyPy 3-64	OK	TESTS	96	77	14,131,200	n = int(input()) a = list(map(int, input().split())) b = a[:] a.sort() cnt = 0 for i in range(n): if a[i] != b[i]: cnt += 1 if cnt <= 2: print("YES") else: print("NO")	Title: Little Elephant and Problem Time Limit: None seconds Memory Limit: None megabytes Problem Description: The Little Elephant has got a problem — somebody has been touching his sorted by non-decreasing array a of length n and possibly swapped some elements of the array. The Little Elephant doesn't want to c...	```python n = int(input()) a = list(map(int, input().split())) b = a[:] a.sort() cnt = 0 for i in range(n): if a[i] != b[i]: cnt += 1 if cnt <= 2: print("YES") else: print("NO") ```	3
10	D	LCIS	PROGRAMMING	2,800	[ "dp" ]	D. LCIS	1	256	This problem differs from one which was on the online contest. The sequence a1,<=a2,<=...,<=an is called increasing, if ai<=<<=ai<=+<=1 for i<=<<=n. The sequence s1,<=s2,<=...,<=sk is called the subsequence of the sequence a1,<=a2,<=...,<=an, if there exist such a set of inde...	The first line contains an integer n (1<=≤<=n<=≤<=500) — the length of the first sequence. The second line contains n space-separated integers from the range [0,<=109] — elements of the first sequence. The third line contains an integer m (1<=≤<=m<=≤<=500) — the length of the second sequence. The fourth line ...	In the first line output k — the length of the longest common increasing subsequence. In the second line output the subsequence itself. Separate the elements with a space. If there are several solutions, output any.	[ "7\n2 3 1 6 5 4 6\n4\n1 3 5 6\n", "5\n1 2 0 2 1\n3\n1 0 1\n" ]	[ "3\n3 5 6 \n", "2\n0 1 \n" ]	none	0	[ { "input": "7\n2 3 1 6 5 4 6\n4\n1 3 5 6", "output": "3\n3 5 6 " }, { "input": "5\n1 2 0 2 1\n3\n1 0 1", "output": "2\n0 1 " }, { "input": "2\n6 10\n3\n6 3 3", "output": "1\n6 " }, { "input": "1\n7\n2\n7 9", "output": "1\n7 " }, { "input": "3\n37 49 24\n3\n33 5 70...	1,586,452,950	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	2	1,000	35,635,200	n = int(input()) a = list(map(int, input().split())) m = int(input()) b = list(map(int, input().split())) dp = [[0]m for i in range(n)] p = [-1] m for j in range(m): j1=0 best=0 if a[0] == b[j]: dp[0][j]=best+1 p[0]=j1 if a[0]>b[j] : best=0 j1=j for i in...	Title: LCIS Time Limit: 1 seconds Memory Limit: 256 megabytes Problem Description: This problem differs from one which was on the online contest. The sequence a1,<=a2,<=...,<=an is called increasing, if ai<=<<=ai<=+<=1 for i<=<<=n. The sequence s1,<=s2,<=...,<=sk is called the sub...	```python n = int(input()) a = list(map(int, input().split())) m = int(input()) b = list(map(int, input().split())) dp = [[0]m for i in range(n)] p = [-1] m for j in range(m): j1=0 best=0 if a[0] == b[j]: dp[0][j]=best+1 p[0]=j1 if a[0]>b[j] : best=0 j1=j...	0
157	A	Game Outcome	PROGRAMMING	800	[ "brute force" ]		null	null	Sherlock Holmes and Dr. Watson played some game on a checkered board n<=×<=n in size. During the game they put numbers on the board's squares by some tricky rules we don't know. However, the game is now over and each square of the board contains exactly one number. To understand who has won, they need to count the ...	The first line contains an integer n (1<=≤<=n<=≤<=30). Each of the following n lines contain n space-separated integers. The j-th number on the i-th line represents the number on the square that belongs to the j-th column and the i-th row on the board. All number on the board are integers from 1 to 100.	Print the single number — the number of the winning squares.	[ "1\n1\n", "2\n1 2\n3 4\n", "4\n5 7 8 4\n9 5 3 2\n1 6 6 4\n9 5 7 3\n" ]	[ "0\n", "2\n", "6\n" ]	In the first example two upper squares are winning. In the third example three left squares in the both middle rows are winning:	500	[ { "input": "1\n1", "output": "0" }, { "input": "2\n1 2\n3 4", "output": "2" }, { "input": "4\n5 7 8 4\n9 5 3 2\n1 6 6 4\n9 5 7 3", "output": "6" }, { "input": "2\n1 1\n1 1", "output": "0" }, { "input": "3\n1 2 3\n4 5 6\n7 8 9", "output": "4" }, { "inpu...	1,667,928,981	2,147,483,647	PyPy 3-64	OK	TESTS	49	124	0	n=int(input()) set=[] hor=[] for i in range(n): a=[int(i) for i in input().split()] set.append(a) hor.append(sum(a)) ver=[] for z in range(n): s1=0 for y in range(n): s=set[y] s1+=s[z] ver.append(s1) cnt=0 for p in range(n): p1=hor[p] for q in range(n): ...	Title: Game Outcome Time Limit: None seconds Memory Limit: None megabytes Problem Description: Sherlock Holmes and Dr. Watson played some game on a checkered board n<=×<=n in size. During the game they put numbers on the board's squares by some tricky rules we don't know. However, the game is now over and each s...	```python n=int(input()) set=[] hor=[] for i in range(n): a=[int(i) for i in input().split()] set.append(a) hor.append(sum(a)) ver=[] for z in range(n): s1=0 for y in range(n): s=set[y] s1+=s[z] ver.append(s1) cnt=0 for p in range(n): p1=hor[p] for q in r...	3
116	A	Tram	PROGRAMMING	800	[ "implementation" ]		null	null	Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tram is empty before it arrives at the first stop. Also, when the tram arrives at the last stop, all passengers ex...	The first line contains a single number n (2<=≤<=n<=≤<=1000) — the number of the tram's stops. Then n lines follow, each contains two integers ai and bi (0<=≤<=ai,<=bi<=≤<=1000) — the number of passengers that exits the tram at the i-th stop, and the number of passengers that enter the tram at...	Print a single integer denoting the minimum possible capacity of the tram (0 is allowed).	[ "4\n0 3\n2 5\n4 2\n4 0\n" ]	[ "6\n" ]	For the first example, a capacity of 6 is sufficient: - At the first stop, the number of passengers inside the tram before arriving is 0. Then, 3 passengers enter the tram, and the number of passengers inside the tram becomes 3. - At the second stop, 2 passengers exit the tram (1 passenger remains inside). Then, 5 ...	500	[ { "input": "4\n0 3\n2 5\n4 2\n4 0", "output": "6" }, { "input": "5\n0 4\n4 6\n6 5\n5 4\n4 0", "output": "6" }, { "input": "10\n0 5\n1 7\n10 8\n5 3\n0 5\n3 3\n8 8\n0 6\n10 1\n9 0", "output": "18" }, { "input": "3\n0 1\n1 1\n1 0", "output": "1" }, { "input": "4\n0 1...	1,687,781,084	2,147,483,647	Python 3	OK	TESTS	71	92	0	n = int(input()) c = 0 current_passengers = 0 for _ in range(n): ai, bi = map(int, input().split()) current_passengers -= ai current_passengers += bi c= max(c, current_passengers) print(c)	Title: Tram Time Limit: None seconds Memory Limit: None megabytes Problem Description: Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tram is empty before it ...	```python n = int(input()) c = 0 current_passengers = 0 for _ in range(n): ai, bi = map(int, input().split()) current_passengers -= ai current_passengers += bi c= max(c, current_passengers) print(c) ```	3
810	B	Summer sell-off	PROGRAMMING	1,300	[ "greedy", "sortings" ]		null	null	Summer holidays! Someone is going on trips, someone is visiting grandparents, but someone is trying to get a part-time job. This summer Noora decided that she wants to earn some money, and took a job in a shop as an assistant. Shop, where Noora is working, has a plan on the following n days. For each day sales manag...	The first line contains two integers n and f (1<=≤<=n<=≤<=105,<=0<=≤<=f<=≤<=n) denoting the number of days in shop's plan and the number of days that Noora has to choose for sell-out. Each line of the following n subsequent lines contains two integers ki,<=li (0<=≤<=ki,<=li<=≤<=109) denotin...	Print a single integer denoting the maximal number of products that shop can sell.	[ "4 2\n2 1\n3 5\n2 3\n1 5\n", "4 1\n0 2\n0 3\n3 5\n0 6\n" ]	[ "10", "5" ]	In the first example we can choose days with numbers 2 and 4 for sell-out. In this case new numbers of products for sale would be equal to [2, 6, 2, 2] respectively. So on the first day shop will sell 1 product, on the second — 5, on the third — 2, on the fourth — 2. In total 1 + 5 + 2 + 2 = 10 product units. In the s...	1,000	[ { "input": "4 2\n2 1\n3 5\n2 3\n1 5", "output": "10" }, { "input": "4 1\n0 2\n0 3\n3 5\n0 6", "output": "5" }, { "input": "1 1\n5 8", "output": "8" }, { "input": "2 1\n8 12\n6 11", "output": "19" }, { "input": "2 1\n6 7\n5 7", "output": "13" }, { "inpu...	1,680,963,691	2,147,483,647	PyPy 3-64	RUNTIME_ERROR	TESTS	0	77	2,867,200	n = int(input()) k = [0] * n l = [0] * n # read input for i in range(n): k[i], l[i] = map(int, input().split()) # initialize maximum number of sold products max_sold = 0 # iterate over all possible sets of f days for mask in range(1, 1 << n): # count the number of sell-out days f = bin(mask...	Title: Summer sell-off Time Limit: None seconds Memory Limit: None megabytes Problem Description: Summer holidays! Someone is going on trips, someone is visiting grandparents, but someone is trying to get a part-time job. This summer Noora decided that she wants to earn some money, and took a job in a shop as an ass...	```python n = int(input()) k = [0] * n l = [0] * n # read input for i in range(n): k[i], l[i] = map(int, input().split()) # initialize maximum number of sold products max_sold = 0 # iterate over all possible sets of f days for mask in range(1, 1 << n): # count the number of sell-out days f ...	-1
56	A	Bar	PROGRAMMING	1,000	[ "implementation" ]	A. Bar	2	256	According to Berland laws it is only allowed to sell alcohol to people not younger than 18 years. Vasya's job is to monitor the law's enforcement. Tonight he entered a bar and saw n people sitting there. For every one of them Vasya happened to determine either the age or the drink the person is having. Vasya can chec...	The first line contains an integer n (1<=≤<=n<=≤<=100) which is the number of the bar's clients. Then follow n lines, each describing one visitor. A line either contains his age (an integer from 0 to 1000) or his drink (a string of capital Latin letters from 1 to 100 in length). It is guaranteed that the input da...	Print a single number which is the number of people Vasya should check to guarantee the law enforcement.	[ "5\n18\nVODKA\nCOKE\n19\n17\n" ]	[ "2\n" ]	In the sample test the second and fifth clients should be checked.	500	[ { "input": "5\n18\nVODKA\nCOKE\n19\n17", "output": "2" }, { "input": "2\n2\nGIN", "output": "2" }, { "input": "3\nWHISKEY\n3\nGIN", "output": "3" }, { "input": "4\n813\nIORBQITQXMPTFAEMEQDQIKFGKGOTNKTOSZCBRPXJLUKVLVHJYNRUJXK\nRUM\nRHVRWGODYWWTYZFLFYKCVUFFRTQDINKNWPKFHZBFWBHWI...	1,592,633,169	2,147,483,647	PyPy 3	OK	TESTS	28	310	0	n = int(input()) alc = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE'] cnt = 0 for i in range(n) : s = input() if ord(s[0])>=65 and ord(s[0])<=90 : if s in alc : cnt = cnt + 1 ...	Title: Bar Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: According to Berland laws it is only allowed to sell alcohol to people not younger than 18 years. Vasya's job is to monitor the law's enforcement. Tonight he entered a bar and saw n people sitting there. For every one of them Vasya h...	```python n = int(input()) alc = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE'] cnt = 0 for i in range(n) : s = input() if ord(s[0])>=65 and ord(s[0])<=90 : if s in alc : cnt = cnt ...	3.9225
14	C	Four Segments	PROGRAMMING	1,700	[ "brute force", "constructive algorithms", "geometry", "implementation", "math" ]	C. Four Segments	2	64	Several months later Alex finally got his brother Bob's creation by post. And now, in his turn, Alex wants to boast about something to his brother. He thought for a while, and came to the conclusion that he has no ready creations, and decided to write a program for rectangles detection. According to his plan, the progr...	The input data contain four lines. Each of these lines contains four integers x1, y1, x2, y2 (<=-<=109<=≤<=x1,<=y1,<=x2,<=y2<=≤<=109) — coordinates of segment's beginning and end positions. The given segments can degenerate into points.	Output the word «YES», if the given four segments form the required rectangle, otherwise output «NO».	[ "1 1 6 1\n1 0 6 0\n6 0 6 1\n1 1 1 0\n", "0 0 0 3\n2 0 0 0\n2 2 2 0\n0 2 2 2\n" ]	[ "YES\n", "NO\n" ]	none	0	[ { "input": "1 1 6 1\n1 0 6 0\n6 0 6 1\n1 1 1 0", "output": "YES" }, { "input": "0 0 0 3\n2 0 0 0\n2 2 2 0\n0 2 2 2", "output": "NO" }, { "input": "0 0 0 2\n2 0 0 0\n2 2 2 0\n0 2 2 2", "output": "YES" }, { "input": "0 0 10 0\n0 0 10 0\n0 0 0 5\n0 0 0 -5", "output": "NO" ...	1,646,245,704	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	10	122	512,000	f = True arr = [] for i in range(4): x1,y1,x2,y2 = map(int,input().split()) if f: a = [[x1,y1],[x2,y2]] a.sort() arr.append(a) if x1!=x2 and y1!=y2: f = False if not f: print("NO") else: arr.sort() # print(arr) x1,y1= arr[0][0] x2,y2 = arr[0][1] ...	Title: Four Segments Time Limit: 2 seconds Memory Limit: 64 megabytes Problem Description: Several months later Alex finally got his brother Bob's creation by post. And now, in his turn, Alex wants to boast about something to his brother. He thought for a while, and came to the conclusion that he has no ready creati...	```python f = True arr = [] for i in range(4): x1,y1,x2,y2 = map(int,input().split()) if f: a = [[x1,y1],[x2,y2]] a.sort() arr.append(a) if x1!=x2 and y1!=y2: f = False if not f: print("NO") else: arr.sort() # print(arr) x1,y1= arr[0][0] x2,y2 = ar...	0
75	A	Life Without Zeros	PROGRAMMING	1,000	[ "implementation" ]	A. Life Without Zeros	2	256	Can you imagine our life if we removed all zeros from it? For sure we will have many problems. In this problem we will have a simple example if we removed all zeros from our life, it's the addition operation. Let's assume you are given this equation a<=+<=b<==<=c, where a and b are positive integers, and c...	The input will consist of two lines, the first line will contain the integer a, and the second line will contain the integer b which are in the equation as described above (1<=≤<=a,<=b<=≤<=109). There won't be any leading zeros in both. The value of c should be calculated as c<==<=a<=+<=b.	The output will be just one line, you should print "YES" if the equation will remain correct after removing all zeros, and print "NO" otherwise.	[ "101\n102\n", "105\n106\n" ]	[ "YES\n", "NO\n" ]	none	500	[ { "input": "101\n102", "output": "YES" }, { "input": "105\n106", "output": "NO" }, { "input": "544\n397", "output": "YES" }, { "input": "822\n280", "output": "NO" }, { "input": "101\n413", "output": "NO" }, { "input": "309\n139", "output": "NO" }...	1,653,202,313	2,147,483,647	Python 3	OK	TESTS	43	92	0	def prime(x): y="" for i in x: if i!="0": y+=i return y a=input() b=input() c=str(int(a)+int(b)) ap=prime(a) bp=prime(b) cp=prime(c) if int(ap)+int(bp)==int(cp): print("YES") else: print("NO")	Title: Life Without Zeros Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Can you imagine our life if we removed all zeros from it? For sure we will have many problems. In this problem we will have a simple example if we removed all zeros from our life, it's the addition operation. Let's assu...	```python def prime(x): y="" for i in x: if i!="0": y+=i return y a=input() b=input() c=str(int(a)+int(b)) ap=prime(a) bp=prime(b) cp=prime(c) if int(ap)+int(bp)==int(cp): print("YES") else: print("NO") ```	3.977
892	A	Greed	PROGRAMMING	900	[ "greedy", "implementation" ]		null	null	Jafar has n cans of cola. Each can is described by two integers: remaining volume of cola ai and can's capacity bi (ai <=≤<= bi). Jafar has decided to pour all remaining cola into just 2 cans, determine if he can do this or not!	The first line of the input contains one integer n (2<=≤<=n<=≤<=100<=000) — number of cola cans. The second line contains n space-separated integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=109) — volume of remaining cola in cans. The third line contains n space-separated integers that b1,<=b2,<=...,<...	Print "YES" (without quotes) if it is possible to pour all remaining cola in 2 cans. Otherwise print "NO" (without quotes). You can print each letter in any case (upper or lower).	[ "2\n3 5\n3 6\n", "3\n6 8 9\n6 10 12\n", "5\n0 0 5 0 0\n1 1 8 10 5\n", "4\n4 1 0 3\n5 2 2 3\n" ]	[ "YES\n", "NO\n", "YES\n", "YES\n" ]	In the first sample, there are already 2 cans, so the answer is "YES".	500	[ { "input": "2\n3 5\n3 6", "output": "YES" }, { "input": "3\n6 8 9\n6 10 12", "output": "NO" }, { "input": "5\n0 0 5 0 0\n1 1 8 10 5", "output": "YES" }, { "input": "4\n4 1 0 3\n5 2 2 3", "output": "YES" }, { "input": "10\n9 10 24 11 1 7 8 3 28 14\n86 20 34 11 22 9...	1,532,700,935	2,147,483,647	PyPy 3	OK	TESTS	39	311	14,950,400	R = lambda: list(map(int, input().split(' '))) input() a = R() b = R() b.sort() print(["NO", "YES"][int(sum(a) <= sum(b[-2:]))])	Title: Greed Time Limit: None seconds Memory Limit: None megabytes Problem Description: Jafar has n cans of cola. Each can is described by two integers: remaining volume of cola ai and can's capacity bi (ai <=≤<= bi). Jafar has decided to pour all remaining cola into just 2 cans, determine if he c...	```python R = lambda: list(map(int, input().split(' '))) input() a = R() b = R() b.sort() print(["NO", "YES"][int(sum(a) <= sum(b[-2:]))]) ```	3
141	A	Amusing Joke	PROGRAMMING	800	[ "implementation", "sortings", "strings" ]		null	null	So, the New Year holidays are over. Santa Claus and his colleagues can take a rest and have guests at last. When two "New Year and Christmas Men" meet, thear assistants cut out of cardboard the letters from the guest's name and the host's name in honor of this event. Then the hung the letters above the main entrance. O...	The input file consists of three lines: the first line contains the guest's name, the second line contains the name of the residence host and the third line contains letters in a pile that were found at the door in the morning. All lines are not empty and contain only uppercase Latin letters. The length of each line do...	Print "YES" without the quotes, if the letters in the pile could be permuted to make the names of the "New Year and Christmas Men". Otherwise, print "NO" without the quotes.	[ "SANTACLAUS\nDEDMOROZ\nSANTAMOROZDEDCLAUS\n", "PAPAINOEL\nJOULUPUKKI\nJOULNAPAOILELUPUKKI\n", "BABBONATALE\nFATHERCHRISTMAS\nBABCHRISTMASBONATALLEFATHER\n" ]	[ "YES\n", "NO\n", "NO\n" ]	In the first sample the letters written in the last line can be used to write the names and there won't be any extra letters left. In the second sample letter "P" is missing from the pile and there's an extra letter "L". In the third sample there's an extra letter "L".	500	[ { "input": "SANTACLAUS\nDEDMOROZ\nSANTAMOROZDEDCLAUS", "output": "YES" }, { "input": "PAPAINOEL\nJOULUPUKKI\nJOULNAPAOILELUPUKKI", "output": "NO" }, { "input": "BABBONATALE\nFATHERCHRISTMAS\nBABCHRISTMASBONATALLEFATHER", "output": "NO" }, { "input": "B\nA\nAB", "output": ...	1,686,685,816	2,147,483,647	Python 3	OK	TESTS	54	92	0	a = input() b = input() c = input() a += b c = sorted(c) a = sorted(a) if a == c: print("YES") else: print("NO")	Title: Amusing Joke Time Limit: None seconds Memory Limit: None megabytes Problem Description: So, the New Year holidays are over. Santa Claus and his colleagues can take a rest and have guests at last. When two "New Year and Christmas Men" meet, thear assistants cut out of cardboard the letters from the guest's nam...	```python a = input() b = input() c = input() a += b c = sorted(c) a = sorted(a) if a == c: print("YES") else: print("NO") ```	3
200	B	Drinks	PROGRAMMING	800	[ "implementation", "math" ]		null	null	Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are n drinks in his fridge, the volume fraction of orange juice in the i-th drink equals pi percent. One day Vasya decided to make himself an orange cocktail. He took equal proportio...	The first input line contains a single integer n (1<=≤<=n<=≤<=100) — the number of orange-containing drinks in Vasya's fridge. The second line contains n integers pi (0<=≤<=pi<=≤<=100) — the volume fraction of orange juice in the i-th drink, in percent. The numbers are separated by a space.	Print the volume fraction in percent of orange juice in Vasya's cocktail. The answer will be considered correct if the absolute or relative error does not exceed 10<=<=-<=4.	[ "3\n50 50 100\n", "4\n0 25 50 75\n" ]	[ "66.666666666667\n", "37.500000000000\n" ]	Note to the first sample: let's assume that Vasya takes x milliliters of each drink from the fridge. Then the volume of pure juice in the cocktail will equal <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/c1fac6e64d3a8ee6a5ac138cbe51e60039b22473.png" style="max-width: 100.0%;max-height: ...	500	[ { "input": "3\n50 50 100", "output": "66.666666666667" }, { "input": "4\n0 25 50 75", "output": "37.500000000000" }, { "input": "3\n0 1 8", "output": "3.000000000000" }, { "input": "5\n96 89 93 95 70", "output": "88.600000000000" }, { "input": "7\n62 41 78 4 38 39...	1,682,268,842	2,147,483,647	PyPy 3-64	OK	TESTS	31	156	0	n=int(input()) l=list(map(int,input().split())) print(round((sum(l)/n),12))	Title: Drinks Time Limit: None seconds Memory Limit: None megabytes Problem Description: Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are n drinks in his fridge, the volume fraction of orange juice in the i-th drink equals pi...	```python n=int(input()) l=list(map(int,input().split())) print(round((sum(l)/n),12)) ```	3
194	A	Exams	PROGRAMMING	900	[ "implementation", "math" ]		null	null	One day the Codeforces round author sat exams. He had n exams and he needed to get an integer from 2 to 5 for each exam. He will have to re-sit each failed exam, i.e. the exam that gets mark 2. The author would need to spend too much time and effort to make the sum of his marks strictly more than k. That could ha...	The single input line contains space-separated integers n and k (1<=≤<=n<=≤<=50, 1<=≤<=k<=≤<=250) — the number of exams and the required sum of marks. It is guaranteed that there exists a way to pass n exams in the way that makes the sum of marks equal exactly k.	Print the single number — the minimum number of exams that the author will get a 2 for, considering that the sum of marks for all exams must equal k.	[ "4 8\n", "4 10\n", "1 3\n" ]	[ "4\n", "2\n", "0\n" ]	In the first sample the author has to get a 2 for all his exams. In the second sample he should get a 3 for two exams and a 2 for two more. In the third sample he should get a 3 for one exam.	500	[ { "input": "4 8", "output": "4" }, { "input": "4 10", "output": "2" }, { "input": "1 3", "output": "0" }, { "input": "1 2", "output": "1" }, { "input": "4 9", "output": "3" }, { "input": "50 234", "output": "0" }, { "input": "50 100", "...	1,593,021,795	2,147,483,647	PyPy 3	OK	TESTS	38	310	20,172,800	def solve(n , k): x = k - 2 *n return max(n - x , 0) n , k = map(int , input().split()) print(solve(n , k))	Title: Exams Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day the Codeforces round author sat exams. He had n exams and he needed to get an integer from 2 to 5 for each exam. He will have to re-sit each failed exam, i.e. the exam that gets mark 2. The author would need to spend ...	```python def solve(n , k): x = k - 2 *n return max(n - x , 0) n , k = map(int , input().split()) print(solve(n , k)) ```	3
265	B	Roadside Trees (Simplified Edition)	PROGRAMMING	1,000	[ "greedy", "implementation" ]		null	null	Squirrel Liss loves nuts. There are n trees (numbered 1 to n from west to east) along a street and there is a delicious nut on the top of each tree. The height of the tree i is hi. Liss wants to eat all nuts. Now Liss is on the root of the tree with the number 1. In one second Liss can perform one of the fol...	The first line contains an integer n (1<=<=≤<=<=n<=≤<=105) — the number of trees. Next n lines contains the height of trees: i-th line contains an integer hi (1<=≤<=hi<=≤<=104) — the height of the tree with the number i.	Print a single integer — the minimal time required to eat all nuts in seconds.	[ "2\n1\n2\n", "5\n2\n1\n2\n1\n1\n" ]	[ "5\n", "14\n" ]	none	1,000	[ { "input": "2\n1\n2", "output": "5" }, { "input": "5\n2\n1\n2\n1\n1", "output": "14" }, { "input": "1\n1", "output": "2" } ]	1,639,595,310	2,147,483,647	Python 3	OK	TESTS	15	404	2,662,400	n= int(input()) trees=[] for x in range(n): trees.append(int(input())) time=trees[0]+1 for x in range(n-1): if(trees[x]>=trees[x+1]): time=time+(trees[x]-trees[x+1])+1+1 elif(trees[x]<=trees[x+1]): time=time+1+(trees[x+1]-trees[x])+1 print(time)	Title: Roadside Trees (Simplified Edition) Time Limit: None seconds Memory Limit: None megabytes Problem Description: Squirrel Liss loves nuts. There are n trees (numbered 1 to n from west to east) along a street and there is a delicious nut on the top of each tree. The height of the tree i is hi. Liss wan...	```python n= int(input()) trees=[] for x in range(n): trees.append(int(input())) time=trees[0]+1 for x in range(n-1): if(trees[x]>=trees[x+1]): time=time+(trees[x]-trees[x+1])+1+1 elif(trees[x]<=trees[x+1]): time=time+1+(trees[x+1]-trees[x])+1 print(time) ```	3
186	A	Comparing Strings	PROGRAMMING	1,100	[ "implementation", "strings" ]		null	null	Some dwarves that are finishing the StUDY (State University for Dwarven Youngsters) Bachelor courses, have been told "no genome, no degree". That means that all dwarves should write a thesis on genome. Dwarven genome is far from simple. It is represented by a string that consists of lowercase Latin letters. Dwarf Mish...	The first line contains the first dwarf's genome: a non-empty string, consisting of lowercase Latin letters. The second line contains the second dwarf's genome: a non-empty string, consisting of lowercase Latin letters. The number of letters in each genome doesn't exceed 105. It is guaranteed that the strings that co...	Print "YES", if the dwarves belong to the same race. Otherwise, print "NO".	[ "ab\nba\n", "aa\nab\n" ]	[ "YES\n", "NO\n" ]	- First example: you can simply swap two letters in string "ab". So we get "ba". - Second example: we can't change string "aa" into string "ab", because "aa" does not contain letter "b".	500	[ { "input": "ab\nba", "output": "YES" }, { "input": "aa\nab", "output": "NO" }, { "input": "a\nza", "output": "NO" }, { "input": "vvea\nvvae", "output": "YES" }, { "input": "rtfabanpc\natfabrnpc", "output": "YES" }, { "input": "mt\ntm", "output": "Y...	1,693,806,783	2,147,483,647	Python 3	OK	TESTS	53	156	5,120,000	first=input() sec=input() if len(first)!=len(sec): print('NO') else: char1=[] char2=[] i=0 while(i<len(first)): if first[i]!=sec[i]: char1.append(first[i]) char2.append(sec[i]) i+=1 if len(char1)!=2 or set(char1)!=set(char2): print('N...	Title: Comparing Strings Time Limit: None seconds Memory Limit: None megabytes Problem Description: Some dwarves that are finishing the StUDY (State University for Dwarven Youngsters) Bachelor courses, have been told "no genome, no degree". That means that all dwarves should write a thesis on genome. Dwarven genome ...	```python first=input() sec=input() if len(first)!=len(sec): print('NO') else: char1=[] char2=[] i=0 while(i<len(first)): if first[i]!=sec[i]: char1.append(first[i]) char2.append(sec[i]) i+=1 if len(char1)!=2 or set(char1)!=set(char2): ...	3
525	C	Ilya and Sticks	PROGRAMMING	1,600	[ "greedy", "math", "sortings" ]		null	null	In the evening, after the contest Ilya was bored, and he really felt like maximizing. He remembered that he had a set of n sticks and an instrument. Each stick is characterized by its length li. Ilya decided to make a rectangle from the sticks. And due to his whim, he decided to make rectangles in such a way tha...	The first line of the input contains a positive integer n (1<=≤<=n<=≤<=105) — the number of the available sticks. The second line of the input contains n positive integers li (2<=≤<=li<=≤<=106) — the lengths of the sticks.	The first line of the output must contain a single non-negative integer — the maximum total area of the rectangles that Ilya can make from the available sticks.	[ "4\n2 4 4 2\n", "4\n2 2 3 5\n", "4\n100003 100004 100005 100006\n" ]	[ "8\n", "0\n", "10000800015\n" ]	none	1,000	[ { "input": "4\n2 4 4 2", "output": "8" }, { "input": "4\n2 2 3 5", "output": "0" }, { "input": "4\n100003 100004 100005 100006", "output": "10000800015" }, { "input": "8\n5 3 3 3 3 4 4 4", "output": "25" }, { "input": "10\n123 124 123 124 2 2 2 2 9 9", "output...	1,603,284,277	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	25	405	14,745,600	from collections import Counter import string import math import sys from fractions import Fraction def array_int(): return [int(i) for i in sys.stdin.readline().split()] def vary(arrber_of_variables): if arrber_of_variables==1: return int(sys.stdin.readline()) if arrber_of_variables>=2: ...	Title: Ilya and Sticks Time Limit: None seconds Memory Limit: None megabytes Problem Description: In the evening, after the contest Ilya was bored, and he really felt like maximizing. He remembered that he had a set of n sticks and an instrument. Each stick is characterized by its length li. Ilya decided to m...	```python from collections import Counter import string import math import sys from fractions import Fraction def array_int(): return [int(i) for i in sys.stdin.readline().split()] def vary(arrber_of_variables): if arrber_of_variables==1: return int(sys.stdin.readline()) if arrber_of_varia...	0
978	G	Petya's Exams	PROGRAMMING	1,700	[ "greedy", "implementation", "sortings" ]		null	null	Petya studies at university. The current academic year finishes with $n$ special days. Petya needs to pass $m$ exams in those special days. The special days in this problem are numbered from $1$ to $n$. There are three values about each exam: - $s_i$ — the day, when questions for the $i$-th exam will be published, -...	The first line contains two integers $n$ and $m$ $(2 \le n \le 100, 1 \le m \le n)$ — the number of days and the number of exams. Each of the following $m$ lines contains three integers $s_i$, $d_i$, $c_i$ $(1 \le s_i < d_i \le n, 1 \le c_i \le n)$ — the day, when questions for the $i$-th exam will be given, the da...	If Petya can not prepare and pass all the exams, print -1. In case of positive answer, print $n$ integers, where the $j$-th number is: - $(m + 1)$, if the $j$-th day is a day of some exam (recall that in each day no more than one exam is conducted), - zero, if in the $j$-th day Petya will have a rest, - $i$ ($1 \le...	[ "5 2\n1 3 1\n1 5 1\n", "3 2\n1 3 1\n1 2 1\n", "10 3\n4 7 2\n1 10 3\n8 9 1\n" ]	[ "1 2 3 0 3 \n", "-1\n", "2 2 2 1 1 0 4 3 4 4 \n" ]	In the first example Petya can, for example, prepare for exam $1$ in the first day, prepare for exam $2$ in the second day, pass exam $1$ in the third day, relax in the fourth day, and pass exam $2$ in the fifth day. So, he can prepare and pass all exams. In the second example, there are three days and two exams. So, ...	0	[ { "input": "5 2\n1 3 1\n1 5 1", "output": "1 2 3 0 3 " }, { "input": "3 2\n1 3 1\n1 2 1", "output": "-1" }, { "input": "10 3\n4 7 2\n1 10 3\n8 9 1", "output": "2 2 2 1 1 0 4 3 4 4 " }, { "input": "2 1\n1 2 1", "output": "1 2 " }, { "input": "3 1\n1 2 2", "outp...	1,698,772,009	2,147,483,647	Python 3	OK	TESTS	77	46	0	rd=lambda:map(int,input().split()) n,m=rd() a=sorted(([rd()]+[i+1] for i in range(m)),key=lambda x:x[1]) r=[0]n for x in a: r[x[1]-1]=m+1 for i in range(x[0]-1,x[1]-1): if not r[i]: r[i]=x[3] x[2]-=1 if not x[2]: break if x[2]: print(-1) exit() print(*r)	Title: Petya's Exams Time Limit: None seconds Memory Limit: None megabytes Problem Description: Petya studies at university. The current academic year finishes with $n$ special days. Petya needs to pass $m$ exams in those special days. The special days in this problem are numbered from $1$ to $n$. There are three v...	```python rd=lambda:map(int,input().split()) n,m=rd() a=sorted(([rd()]+[i+1] for i in range(m)),key=lambda x:x[1]) r=[0]n for x in a: r[x[1]-1]=m+1 for i in range(x[0]-1,x[1]-1): if not r[i]: r[i]=x[3] x[2]-=1 if not x[2]: break if x[2]: print(-1) exit() print(*r) ```	3
275	A	Lights Out	PROGRAMMING	900	[ "implementation" ]		null	null	Lenny is playing a game on a 3<=×<=3 grid of lights. In the beginning of the game all lights are switched on. Pressing any of the lights will toggle it and all side-adjacent lights. The goal of the game is to switch all the lights off. We consider the toggling as follows: if the light was switched on then it will be sw...	The input consists of three rows. Each row contains three integers each between 0 to 100 inclusive. The j-th number in the i-th row is the number of times the j-th light of the i-th row of the grid is pressed.	Print three lines, each containing three characters. The j-th character of the i-th line is "1" if and only if the corresponding light is switched on, otherwise it's "0".	[ "1 0 0\n0 0 0\n0 0 1\n", "1 0 1\n8 8 8\n2 0 3\n" ]	[ "001\n010\n100\n", "010\n011\n100\n" ]	none	500	[ { "input": "1 0 0\n0 0 0\n0 0 1", "output": "001\n010\n100" }, { "input": "1 0 1\n8 8 8\n2 0 3", "output": "010\n011\n100" }, { "input": "13 85 77\n25 50 45\n65 79 9", "output": "000\n010\n000" }, { "input": "96 95 5\n8 84 74\n67 31 61", "output": "011\n011\n101" }, {...	1,659,454,223	2,147,483,647	Python 3	OK	TESTS	33	62	0	from copy import deepcopy lst = [list(map(int, input().split())) for _ in range(3)] lst2 = deepcopy(lst) for y in range(3): for x in range(3): if y != 2: lst2[y][x] += lst[y+1][x] if x != 2: lst2[y][x] += lst[y][x+1] if y != 0: lst2[y][x] += lst[y-1][x] if x != 0: lst2[y][x] ...	Title: Lights Out Time Limit: None seconds Memory Limit: None megabytes Problem Description: Lenny is playing a game on a 3<=×<=3 grid of lights. In the beginning of the game all lights are switched on. Pressing any of the lights will toggle it and all side-adjacent lights. The goal of the game is to switch all the ...	```python from copy import deepcopy lst = [list(map(int, input().split())) for _ in range(3)] lst2 = deepcopy(lst) for y in range(3): for x in range(3): if y != 2: lst2[y][x] += lst[y+1][x] if x != 2: lst2[y][x] += lst[y][x+1] if y != 0: lst2[y][x] += lst[y-1][x] if x != 0: l...	3
599	A	Patrick and Shopping	PROGRAMMING	800	[ "implementation" ]		null	null	Today Patrick waits for a visit from his friend Spongebob. To prepare for the visit, Patrick needs to buy some goodies in two stores located near his house. There is a d1 meter long road between his house and the first shop and a d2 meter long road between his house and the second shop. Also, there is a road of len...	The first line of the input contains three integers d1, d2, d3 (1<=≤<=d1,<=d2,<=d3<=≤<=108) — the lengths of the paths. - d1 is the length of the path connecting Patrick's house and the first shop; - d2 is the length of the path connecting Patrick's house and the second shop; - d3 is the length o...	Print the minimum distance that Patrick will have to walk in order to visit both shops and return to his house.	[ "10 20 30\n", "1 1 5\n" ]	[ "60\n", "4\n" ]	The first sample is shown on the picture in the problem statement. One of the optimal routes is: house <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/70a0795f45d32287dba0eb83fc4a3f470c6e5537.png" style="max-width: 100.0%;max-height: 100.0%;"/> first shop <img align="middle" class="tex-form...	500	[ { "input": "10 20 30", "output": "60" }, { "input": "1 1 5", "output": "4" }, { "input": "100 33 34", "output": "134" }, { "input": "777 777 777", "output": "2331" }, { "input": "2 2 8", "output": "8" }, { "input": "12 34 56", "output": "92" }, ...	1,664,309,288	2,147,483,647	Python 3	OK	TESTS	21	31	0	d = list(map(int, input().split())) if d[0] > d[1]: d[0], d[1] = d[1], d[0] dist = d[0] + min(d[0] + d[1], d[2]) + min(d[0] + d[2], d[1]) print(dist)	Title: Patrick and Shopping Time Limit: None seconds Memory Limit: None megabytes Problem Description: Today Patrick waits for a visit from his friend Spongebob. To prepare for the visit, Patrick needs to buy some goodies in two stores located near his house. There is a d1 meter long road between his house and the...	```python d = list(map(int, input().split())) if d[0] > d[1]: d[0], d[1] = d[1], d[0] dist = d[0] + min(d[0] + d[1], d[2]) + min(d[0] + d[2], d[1]) print(dist) ```	3
71	A	Way Too Long Words	PROGRAMMING	800	[ "strings" ]	A. Way Too Long Words	1	256	Sometimes some words like "localization" or "internationalization" are so long that writing them many times in one text is quite tiresome. Let's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation. This abbreviation is made lik...	The first line contains an integer n (1<=≤<=n<=≤<=100). Each of the following n lines contains one word. All the words consist of lowercase Latin letters and possess the lengths of from 1 to 100 characters.	Print n lines. The i-th line should contain the result of replacing of the i-th word from the input data.	[ "4\nword\nlocalization\ninternationalization\npneumonoultramicroscopicsilicovolcanoconiosis\n" ]	[ "word\nl10n\ni18n\np43s\n" ]	none	500	[ { "input": "4\nword\nlocalization\ninternationalization\npneumonoultramicroscopicsilicovolcanoconiosis", "output": "word\nl10n\ni18n\np43s" }, { "input": "5\nabcdefgh\nabcdefghi\nabcdefghij\nabcdefghijk\nabcdefghijklm", "output": "abcdefgh\nabcdefghi\nabcdefghij\na9k\na11m" }, { "input":...	1,690,616,196	2,147,483,647	Python 3	OK	TESTS	20	46	0	n=int(input()) for i in range (0,n): x=str(input()) l=len(x) if l >10: print(x[0] + str(l-2) + x[-1]) else: print(x)	Title: Way Too Long Words Time Limit: 1 seconds Memory Limit: 256 megabytes Problem Description: Sometimes some words like "localization" or "internationalization" are so long that writing them many times in one text is quite tiresome. Let's consider a word too long, if its length is strictly more than 10 character...	```python n=int(input()) for i in range (0,n): x=str(input()) l=len(x) if l >10: print(x[0] + str(l-2) + x[-1]) else: print(x) ```	3.977
96	A	Football	PROGRAMMING	900	[ "implementation", "strings" ]	A. Football	2	256	Petya loves football very much. One day, as he was watching a football match, he was writing the players' current positions on a piece of paper. To simplify the situation he depicted it as a string consisting of zeroes and ones. A zero corresponds to players of one team; a one corresponds to players of another team. If...	The first input line contains a non-empty string consisting of characters "0" and "1", which represents players. The length of the string does not exceed 100 characters. There's at least one player from each team present on the field.	Print "YES" if the situation is dangerous. Otherwise, print "NO".	[ "001001\n", "1000000001\n" ]	[ "NO\n", "YES\n" ]	none	500	[ { "input": "001001", "output": "NO" }, { "input": "1000000001", "output": "YES" }, { "input": "00100110111111101", "output": "YES" }, { "input": "11110111111111111", "output": "YES" }, { "input": "01", "output": "NO" }, { "input": "10100101", "outp...	1,686,731,213	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	60	0	#숫자 1또는 0이 연속하여 7개 이상 나오는 경우에는 YES 아니면 NO x=input() cnt=0 for i in range(len(x)-1): if x[i]==x[i+1]: #앞뒤글자가 같으면 cnt+1 cnt=cnt+1 if cnt>=7: #연속하여 7글자 넘어가면 yes 그리고 no안나오게 하기위해 break 필수 print('YES') break else: cnt=0 else: print('NO') ...	Title: Football Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Petya loves football very much. One day, as he was watching a football match, he was writing the players' current positions on a piece of paper. To simplify the situation he depicted it as a string consisting of zeroes and ones. A...	```python #숫자 1또는 0이 연속하여 7개 이상 나오는 경우에는 YES 아니면 NO x=input() cnt=0 for i in range(len(x)-1): if x[i]==x[i+1]: #앞뒤글자가 같으면 cnt+1 cnt=cnt+1 if cnt>=7: #연속하여 7글자 넘어가면 yes 그리고 no안나오게 하기위해 break 필수 print('YES') break else: cnt=0 else: pri...	0
208	A	Dubstep	PROGRAMMING	900	[ "strings" ]		null	null	Vasya works as a DJ in the best Berland nightclub, and he often uses dubstep music in his performance. Recently, he has decided to take a couple of old songs and make dubstep remixes from them. Let's assume that a song consists of some number of words. To make the dubstep remix of this song, Vasya inserts a certain nu...	The input consists of a single non-empty string, consisting only of uppercase English letters, the string's length doesn't exceed 200 characters. It is guaranteed that before Vasya remixed the song, no word contained substring "WUB" in it; Vasya didn't change the word order. It is also guaranteed that initially the son...	Print the words of the initial song that Vasya used to make a dubsteb remix. Separate the words with a space.	[ "WUBWUBABCWUB\n", "WUBWEWUBAREWUBWUBTHEWUBCHAMPIONSWUBMYWUBFRIENDWUB\n" ]	[ "ABC ", "WE ARE THE CHAMPIONS MY FRIEND " ]	In the first sample: "WUBWUBABCWUB" = "WUB" + "WUB" + "ABC" + "WUB". That means that the song originally consisted of a single word "ABC", and all words "WUB" were added by Vasya. In the second sample Vasya added a single word "WUB" between all neighbouring words, in the beginning and in the end, except for words "ARE...	500	[ { "input": "WUBWUBABCWUB", "output": "ABC " }, { "input": "WUBWEWUBAREWUBWUBTHEWUBCHAMPIONSWUBMYWUBFRIENDWUB", "output": "WE ARE THE CHAMPIONS MY FRIEND " }, { "input": "WUBWUBWUBSR", "output": "SR " }, { "input": "RWUBWUBWUBLWUB", "output": "R L " }, { "input": "...	1,693,050,629	2,147,483,647	Python 3	OK	TESTS	71	92	0	s = input().split("WUB");print(" ".join(s).strip())	Title: Dubstep Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya works as a DJ in the best Berland nightclub, and he often uses dubstep music in his performance. Recently, he has decided to take a couple of old songs and make dubstep remixes from them. Let's assume that a song consist...	```python s = input().split("WUB");print(" ".join(s).strip()) ```	3
118	A	String Task	PROGRAMMING	1,000	[ "implementation", "strings" ]		null	null	Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it: - deletes all the vowels, - inserts a character "." before each consonant, - replaces ...	The first line represents input string of Petya's program. This string only consists of uppercase and lowercase Latin letters and its length is from 1 to 100, inclusive.	Print the resulting string. It is guaranteed that this string is not empty.	[ "tour\n", "Codeforces\n", "aBAcAba\n" ]	[ ".t.r\n", ".c.d.f.r.c.s\n", ".b.c.b\n" ]	none	500	[ { "input": "tour", "output": ".t.r" }, { "input": "Codeforces", "output": ".c.d.f.r.c.s" }, { "input": "aBAcAba", "output": ".b.c.b" }, { "input": "obn", "output": ".b.n" }, { "input": "wpwl", "output": ".w.p.w.l" }, { "input": "ggdvq", "output": "...	1,693,221,608	2,147,483,647	PyPy 3-64	OK	TESTS	42	124	1,228,800	s = input().lower() a = "" for i in s: if i in ["a", "e", "i", "o", "u", "y"]: continue a += "." + i print(a)	Title: String Task Time Limit: None seconds Memory Limit: None megabytes Problem Description: Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters...	```python s = input().lower() a = "" for i in s: if i in ["a", "e", "i", "o", "u", "y"]: continue a += "." + i print(a) ```	3
447	B	DZY Loves Strings	PROGRAMMING	1,000	[ "greedy", "implementation" ]		null	null	DZY loves collecting special strings which only contain lowercase letters. For each lowercase letter c DZY knows its value wc. For each special string s<==<=s1s2... s\|s\| (\|s\| is the length of the string) he represents its value with a function f(s), where Now DZY has a string s. He wants to in...	The first line contains a single string s (1<=≤<=\|s\|<=≤<=103). The second line contains a single integer k (0<=≤<=k<=≤<=103). The third line contains twenty-six integers from wa to wz. Each such number is non-negative and doesn't exceed 1000.	Print a single integer — the largest possible value of the resulting string DZY could get.	[ "abc\n3\n1 2 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n" ]	[ "41\n" ]	In the test sample DZY can obtain "abcbbc", value = 1·1 + 2·2 + 3·2 + 4·2 + 5·2 + 6·2 = 41.	1,000	[ { "input": "abc\n3\n1 2 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "output": "41" }, { "input": "mmzhr\n3\n443 497 867 471 195 670 453 413 579 466 553 881 847 642 269 996 666 702 487 209 257 741 974 133 519 453", "output": "29978" }, { "input": "ajeeseerqnpaujubmajpibxrccazaawetyw...	1,688,381,291	2,147,483,647	PyPy 3-64	OK	TESTS	24	46	1,536,000	a = 97 st = input() n = int(input()) arr = list(map(int, input().split())) mx = max(arr) ans = 0 for i in range(len(st) + n): if (i < len(st)): ans = ans + arr[ord(st[i]) - a] * (i + 1) else: ans = ans + mx * (i + 1) print(ans)	Title: DZY Loves Strings Time Limit: None seconds Memory Limit: None megabytes Problem Description: DZY loves collecting special strings which only contain lowercase letters. For each lowercase letter c DZY knows its value wc. For each special string s<==<=s1s2... s\|s\| (\|s\| is the length of the str...	```python a = 97 st = input() n = int(input()) arr = list(map(int, input().split())) mx = max(arr) ans = 0 for i in range(len(st) + n): if (i < len(st)): ans = ans + arr[ord(st[i]) - a] * (i + 1) else: ans = ans + mx * (i + 1) print(ans) ```	3

Subsets and Splits

Successful Python Submissions

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

SQL Console for MatrixStudio/Codeforces-Python-Submissions

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

SQL Console for MatrixStudio/Codeforces-Python-Submissions

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

SQL Console for MatrixStudio/Codeforces-Python-Submissions

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