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
522	A	Reposts	PROGRAMMING	1,200	[ "*special", "dfs and similar", "dp", "graphs", "trees" ]		null	null	One day Polycarp published a funny picture in a social network making a poll about the color of his handle. Many of his friends started reposting Polycarp's joke to their news feed. Some of them reposted the reposts and so on. These events are given as a sequence of strings "name1 reposted name2", where name1 is the n...	The first line of the input contains integer n (1<=≤<=n<=≤<=200) — the number of reposts. Next follow the reposts in the order they were made. Each of them is written on a single line and looks as "name1 reposted name2". All the names in the input consist of lowercase or uppercase English letters and/or digits and ...	Print a single integer — the maximum length of a repost chain.	[ "5\ntourist reposted Polycarp\nPetr reposted Tourist\nWJMZBMR reposted Petr\nsdya reposted wjmzbmr\nvepifanov reposted sdya\n", "6\nMike reposted Polycarp\nMax reposted Polycarp\nEveryOne reposted Polycarp\n111 reposted Polycarp\nVkCup reposted Polycarp\nCodeforces reposted Polycarp\n", "1\nSoMeStRaNgEgUe repos...	[ "6\n", "2\n", "2\n" ]	none	500	[ { "input": "5\ntourist reposted Polycarp\nPetr reposted Tourist\nWJMZBMR reposted Petr\nsdya reposted wjmzbmr\nvepifanov reposted sdya", "output": "6" }, { "input": "6\nMike reposted Polycarp\nMax reposted Polycarp\nEveryOne reposted Polycarp\n111 reposted Polycarp\nVkCup reposted Polycarp\nCodeforc...	1,548,777,578	1,178	Python 3	OK	TESTS	36	124	0	n=int(input()) dic={"polycarp":1} for i in range(n): a,b,c=map(str,input().lower().split( )) #print(a,b,c) dic[a]=dic[c]+1 print(max(dic.values()))	Title: Reposts Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day Polycarp published a funny picture in a social network making a poll about the color of his handle. Many of his friends started reposting Polycarp's joke to their news feed. Some of them reposted the reposts and so on. ...	```python n=int(input()) dic={"polycarp":1} for i in range(n): a,b,c=map(str,input().lower().split( )) #print(a,b,c) dic[a]=dic[c]+1 print(max(dic.values())) ```	3
825	A	Binary Protocol	PROGRAMMING	1,100	[ "implementation" ]		null	null	Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm: - Each digit is represented with number of '1' characters equal to the value of that digit (for 0 it is zero ones). - Digits are written one by one in ord...	The first line contains one integer number n (1<=≤<=n<=≤<=89) — length of the string s. The second line contains string s — sequence of '0' and '1' characters, number in its encoded format. It is guaranteed that the number corresponding to the string is positive and doesn't exceed 109. The string always starts...	Print the decoded number.	[ "3\n111\n", "9\n110011101\n" ]	[ "3\n", "2031\n" ]	none	0	[ { "input": "3\n111", "output": "3" }, { "input": "9\n110011101", "output": "2031" }, { "input": "1\n1", "output": "1" }, { "input": "3\n100", "output": "100" }, { "input": "5\n10001", "output": "1001" }, { "input": "14\n11001100011000", "output": "...	1,561,464,993	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	1	124	0	n=int(input()) s=(input()) i=0 while(i<n): c=0 f=0 while(i<n and s[i]!='0' ): f=1 c+=1 i+=1; if(f==0): i+=1; i+=1 print(c,end="")	Title: Binary Protocol Time Limit: None seconds Memory Limit: None megabytes Problem Description: Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm: - Each digit is represented with number of '1' charact...	```python n=int(input()) s=(input()) i=0 while(i<n): c=0 f=0 while(i<n and s[i]!='0' ): f=1 c+=1 i+=1; if(f==0): i+=1; i+=1 print(c,end="") ```	0
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,277	1,377	Python 3	COMPILATION_ERROR	PRETESTS	0	0	0	#include <iostream> #include <vector> #include <algorithm> #include <string> using namespace std; int main(){ int a,b,c,m; cin >> a >> b >> c >> m; for(int i = 0; i < 202; i++){ for(int j = i+1; j < 202; j++){ for(int k = j+1; k < 202; k++){ if(m*2 >= i &...	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 #include <iostream> #include <vector> #include <algorithm> #include <string> using namespace std; int main(){ int a,b,c,m; cin >> a >> b >> c >> m; for(int i = 0; i < 202; i++){ for(int j = i+1; j < 202; j++){ for(int k = j+1; k < 202; k++){ if(...	-1
858	C	Did you mean...	PROGRAMMING	1,500	[ "dp", "greedy", "implementation" ]		null	null	Beroffice text editor has a wide range of features that help working with text. One of the features is an automatic search for typos and suggestions of how to fix them. Beroffice works only with small English letters (i.e. with 26 letters from a to z). Beroffice thinks that a word is typed with a typo if there are thr...	The only line contains a non-empty word consisting of small English letters. The length of the word is between 1 and 3000 letters.	Print the given word without any changes if there are no typos. If there is at least one typo in the word, insert the minimum number of spaces into the word so that each of the resulting words doesn't have any typos. If there are multiple solutions, print any of them.	[ "hellno\n", "abacaba\n", "asdfasdf\n" ]	[ "hell no \n", "abacaba \n", "asd fasd f \n" ]	none	1,500	[ { "input": "hellno", "output": "hell no " }, { "input": "abacaba", "output": "abacaba " }, { "input": "asdfasdf", "output": "asd fasd f " }, { "input": "ooo", "output": "ooo " }, { "input": "moyaoborona", "output": "moyaoborona " }, { "input": "jxegxxx...	1,580,228,865	2,147,483,647	PyPy 3	OK	TESTS	108	171	3,686,400	x=str(input()) n,count,count1,ans=len(x),0,0,[0]*3001 for i in range(n): if x[i] in {"a","e","i","o","u"}: count=0 else: count+=1 if count==3: if x[i]==x[i-1]==x[i-2]: #not sure count=2 else: ans[i-1]=1 c...	Title: Did you mean... Time Limit: None seconds Memory Limit: None megabytes Problem Description: Beroffice text editor has a wide range of features that help working with text. One of the features is an automatic search for typos and suggestions of how to fix them. Beroffice works only with small English letters (...	```python x=str(input()) n,count,count1,ans=len(x),0,0,[0]*3001 for i in range(n): if x[i] in {"a","e","i","o","u"}: count=0 else: count+=1 if count==3: if x[i]==x[i-1]==x[i-2]: #not sure count=2 else: ans[i-1]=1 ...	3
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,230,320	2,147,483,647	Python 3	OK	TESTS	85	92	0	a = input() n=0 b=[] for i in a: if i not in b: b.append(i) for i in b: n+=1 if n%2==0: print("CHAT WITH HER!") else: print("IGNORE HIM!")	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 a = input() n=0 b=[] for i in a: if i not in b: b.append(i) for i in b: n+=1 if n%2==0: print("CHAT WITH HER!") else: print("IGNORE HIM!") ```	3
496	B	Secret Combination	PROGRAMMING	1,500	[ "brute force", "constructive algorithms", "implementation" ]		null	null	You got a box with a combination lock. The lock has a display showing n digits. There are two buttons on the box, each button changes digits on the display. You have quickly discovered that the first button adds 1 to all the digits (all digits 9 become digits 0), and the second button shifts all the digits on the dis...	The first line contains a single integer n (1<=≤<=n<=≤<=1000) — the number of digits on the display. The second line contains n digits — the initial state of the display.	Print a single line containing n digits — the desired state of the display containing the smallest possible number.	[ "3\n579\n", "4\n2014\n" ]	[ "024\n", "0142\n" ]	none	1,000	[ { "input": "3\n579", "output": "024" }, { "input": "4\n2014", "output": "0142" }, { "input": "1\n1", "output": "0" }, { "input": "3\n039", "output": "014" }, { "input": "4\n4444", "output": "0000" }, { "input": "5\n46802", "output": "02468" }, ...	1,442,096,089	2,147,483,647	Python 3	COMPILATION_ERROR	TESTS	0	0	0	n = int(input()) num = int(input()) digits = list(map(int, str(num))) def increment(digits, i): return list(map(lambda n: (n + i) % 10, digits)) def shift(l): return l[1:] + l[:1] rem = 10 - digits[0] digits = shift(increment(digits, rem)) for i in range(1, len(digits) - 1): rem = 10 - digits[i] ot...	Title: Secret Combination Time Limit: None seconds Memory Limit: None megabytes Problem Description: You got a box with a combination lock. The lock has a display showing n digits. There are two buttons on the box, each button changes digits on the display. You have quickly discovered that the first button adds 1 ...	```python n = int(input()) num = int(input()) digits = list(map(int, str(num))) def increment(digits, i): return list(map(lambda n: (n + i) % 10, digits)) def shift(l): return l[1:] + l[:1] rem = 10 - digits[0] digits = shift(increment(digits, rem)) for i in range(1, len(digits) - 1): rem = 10 - digits...	-1
544	A	Set of Strings	PROGRAMMING	1,100	[ "implementation", "strings" ]		null	null	You are given a string q. A sequence of k strings s1,<=s2,<=...,<=sk is called beautiful, if the concatenation of these strings is string q (formally, s1<=+<=s2<=+<=...<=+<=sk<==<=q) and the first characters of these strings are distinct. Find any beautiful sequence of strings or determine that...	The first line contains a positive integer k (1<=≤<=k<=≤<=26) — the number of strings that should be in a beautiful sequence. The second line contains string q, consisting of lowercase Latin letters. The length of the string is within range from 1 to 100, inclusive.	If such sequence doesn't exist, then print in a single line "NO" (without the quotes). Otherwise, print in the first line "YES" (without the quotes) and in the next k lines print the beautiful sequence of strings s1,<=s2,<=...,<=sk. If there are multiple possible answers, print any of them.	[ "1\nabca\n", "2\naaacas\n", "4\nabc\n" ]	[ "YES\nabca\n", "YES\naaa\ncas\n", "NO\n" ]	In the second sample there are two possible answers: {"aaaca", "s"} and {"aaa", "cas"}.	500	[ { "input": "1\nabca", "output": "YES\nabca" }, { "input": "2\naaacas", "output": "YES\naaa\ncas" }, { "input": "4\nabc", "output": "NO" }, { "input": "3\nnddkhkhkdndknndkhrnhddkrdhrnrrnkkdnnndndrdhnknknhnrnnkrrdhrkhkrkhnkhkhhrhdnrndnknrrhdrdrkhdrkkhkrnkk", "output": "YES\...	1,431,017,589	1,389	Python 3	WRONG_ANSWER	TESTS	19	62	0	k = int(input()) string = input() string_len = len(string) words = [] if string_len < k: print("NO") elif k == 1: print("YES") print(string) else: first_char = string[0] last_index = 0 for i in range(1,string_len): if len(words) == k-1: words.append(string[i-1:]) break if string[i] == first_char: c...	Title: Set of Strings Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given a string q. A sequence of k strings s1,<=s2,<=...,<=sk is called beautiful, if the concatenation of these strings is string q (formally, s1<=+<=s2<=+<=...<=+<=sk<==<=q) and the first...	```python k = int(input()) string = input() string_len = len(string) words = [] if string_len < k: print("NO") elif k == 1: print("YES") print(string) else: first_char = string[0] last_index = 0 for i in range(1,string_len): if len(words) == k-1: words.append(string[i-1:]) break if string[i] == first_...	0
500	A	New Year Transportation	PROGRAMMING	1,000	[ "dfs and similar", "graphs", "implementation" ]		null	null	New Year is coming in Line World! In this world, there are n cells numbered by integers from 1 to n, as a 1<=×<=n board. People live in cells. However, it was hard to move between distinct cells, because of the difficulty of escaping the cell. People wanted to meet people who live in other cells. So, user tncks0...	The first line contains two space-separated integers n (3<=≤<=n<=≤<=3<=×<=104) and t (2<=≤<=t<=≤<=n) — the number of cells, and the index of the cell which I want to go to. The second line contains n<=-<=1 space-separated integers a1,<=a2,<=...,<=an<=-<=1 (1<=≤<=ai<=≤<=n<=-<=i). It is guara...	If I can go to cell t using the transportation system, print "YES". Otherwise, print "NO".	[ "8 4\n1 2 1 2 1 2 1\n", "8 5\n1 2 1 2 1 1 1\n" ]	[ "YES\n", "NO\n" ]	In the first sample, the visited cells are: 1, 2, 4; so we can successfully visit the cell 4. In the second sample, the possible cells to visit are: 1, 2, 4, 6, 7, 8; so we can't visit the cell 5, which we want to visit.	500	[ { "input": "8 4\n1 2 1 2 1 2 1", "output": "YES" }, { "input": "8 5\n1 2 1 2 1 1 1", "output": "NO" }, { "input": "20 19\n13 16 7 6 12 1 5 7 8 6 5 7 5 5 3 3 2 2 1", "output": "YES" }, { "input": "50 49\n11 7 1 41 26 36 19 16 38 14 36 35 37 27 20 27 3 6 21 2 27 11 18 17 19 16 ...	1,647,950,265	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	46	1,536,000	a,b=input().split() c=list(map(int,input().split())) d=0 f=0 while d<len(c): d=c[d]+d+1 if d==int(b): f+=1 break if f>0: print("YES") else: print("NO")	Title: New Year Transportation Time Limit: None seconds Memory Limit: None megabytes Problem Description: New Year is coming in Line World! In this world, there are n cells numbered by integers from 1 to n, as a 1<=×<=n board. People live in cells. However, it was hard to move between distinct cells, because o...	```python a,b=input().split() c=list(map(int,input().split())) d=0 f=0 while d<len(c): d=c[d]+d+1 if d==int(b): f+=1 break if f>0: print("YES") else: print("NO") ```	0
757	A	Gotta Catch Em' All!	PROGRAMMING	1,000	[ "implementation" ]		null	null	Bash wants to become a Pokemon master one day. Although he liked a lot of Pokemon, he has always been fascinated by Bulbasaur the most. Soon, things started getting serious and his fascination turned into an obsession. Since he is too young to go out and catch Bulbasaur, he came up with his own way of catching a Bulbas...	Input contains a single line containing a string s (1<=<=≤<=<=\|s\|<=<=≤<=<=105) — the text on the front page of the newspaper without spaces and punctuation marks. \|s\| is the length of the string s. The string s contains lowercase and uppercase English letters, i.e. .	Output a single integer, the answer to the problem.	[ "Bulbbasaur\n", "F\n", "aBddulbasaurrgndgbualdBdsagaurrgndbb\n" ]	[ "1\n", "0\n", "2\n" ]	In the first case, you could pick: Bulbbasaur. In the second case, there is no way to pick even a single Bulbasaur. In the third case, you can rearrange the string to BulbasaurBulbasauraddrgndgddgargndbb to get two words "Bulbasaur".	500	[ { "input": "Bulbbasaur", "output": "1" }, { "input": "F", "output": "0" }, { "input": "aBddulbasaurrgndgbualdBdsagaurrgndbb", "output": "2" }, { "input": "BBBBBBBBBBbbbbbbbbbbuuuuuuuuuullllllllllssssssssssaaaaaaaaaarrrrrrrrrr", "output": "5" }, { "input": "BBBBBBB...	1,484,323,848	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	21	78	4,710,400	R = lambda:list(map(int, input().split(' '))) #r, w = open("input.txt", "r"), open("output.txt", "w") s = input() B = [0 for i in "Bulbasur"] for i in s: if i == 'B': B[1] += 1 if i == 'u': B[2] += 1 if i == 'l': B[3] += 1 if i == 'b': B[4] += 1 if i ==...	Title: Gotta Catch Em' All! Time Limit: None seconds Memory Limit: None megabytes Problem Description: Bash wants to become a Pokemon master one day. Although he liked a lot of Pokemon, he has always been fascinated by Bulbasaur the most. Soon, things started getting serious and his fascination turned into an obsess...	```python R = lambda:list(map(int, input().split(' '))) #r, w = open("input.txt", "r"), open("output.txt", "w") s = input() B = [0 for i in "Bulbasur"] for i in s: if i == 'B': B[1] += 1 if i == 'u': B[2] += 1 if i == 'l': B[3] += 1 if i == 'b': B[4] += 1 ...	0
133	A	HQ9+	PROGRAMMING	900	[ "implementation" ]		null	null	HQ9+ is a joke programming language which has only four one-character instructions: - "H" prints "Hello, World!",- "Q" prints the source code of the program itself,- "9" prints the lyrics of "99 Bottles of Beer" song, - "+" increments the value stored in the internal accumulator. Instructions "H" and "Q" are case-s...	The input will consist of a single line p which will give a program in HQ9+. String p will contain between 1 and 100 characters, inclusive. ASCII-code of each character of p will be between 33 (exclamation mark) and 126 (tilde), inclusive.	Output "YES", if executing the program will produce any output, and "NO" otherwise.	[ "Hi!\n", "Codeforces\n" ]	[ "YES\n", "NO\n" ]	In the first case the program contains only one instruction — "H", which prints "Hello, World!". In the second case none of the program characters are language instructions.	500	[ { "input": "Hi!", "output": "YES" }, { "input": "Codeforces", "output": "NO" }, { "input": "a+b=c", "output": "NO" }, { "input": "hq-lowercase", "output": "NO" }, { "input": "Q", "output": "YES" }, { "input": "9", "output": "YES" }, { "inpu...	1,688,671,477	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	2	122	0	s = input() t = 'HQ9+' for i in range(4): if t[i] in s: print('YES') exit() print('NO')	Title: HQ9+ Time Limit: None seconds Memory Limit: None megabytes Problem Description: HQ9+ is a joke programming language which has only four one-character instructions: - "H" prints "Hello, World!",- "Q" prints the source code of the program itself,- "9" prints the lyrics of "99 Bottles of Beer" song, - "+" in...	```python s = input() t = 'HQ9+' for i in range(4): if t[i] in s: print('YES') exit() print('NO') ```	0
998	B	Cutting	PROGRAMMING	1,200	[ "dp", "greedy", "sortings" ]		null	null	There are a lot of things which could be cut — trees, paper, "the rope". In this problem you are going to cut a sequence of integers. There is a sequence of integers, which contains the equal number of even and odd numbers. Given a limited budget, you need to make maximum possible number of cuts such that each resulti...	First line of the input contains an integer $n$ ($2 \le n \le 100$) and an integer $B$ ($1 \le B \le 100$) — the number of elements in the sequence and the number of bitcoins you have. Second line contains $n$ integers: $a_1$, $a_2$, ..., $a_n$ ($1 \le a_i \le 100$) — elements of the sequence, which contains the equal...	Print the maximum possible number of cuts which can be made while spending no more than $B$ bitcoins.	[ "6 4\n1 2 5 10 15 20\n", "4 10\n1 3 2 4\n", "6 100\n1 2 3 4 5 6\n" ]	[ "1\n", "0\n", "2\n" ]	In the first sample the optimal answer is to split sequence between $2$ and $5$. Price of this cut is equal to $3$ bitcoins. In the second sample it is not possible to make even one cut even with unlimited number of bitcoins. In the third sample the sequence should be cut between $2$ and $3$, and between $4$ and $5$....	1,000	[ { "input": "6 4\n1 2 5 10 15 20", "output": "1" }, { "input": "4 10\n1 3 2 4", "output": "0" }, { "input": "6 100\n1 2 3 4 5 6", "output": "2" }, { "input": "2 100\n13 78", "output": "0" }, { "input": "10 1\n56 56 98 2 11 64 97 41 95 53", "output": "0" }, ...	1,592,749,236	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	5	108	307,200	N,Bitcoin = map(int,input().split()) List = [int(x) for x in input().split()] Even = 0 Odd = 0 for i in List: if(i&1): Odd+=1 else: Even+=1 E = Even O = Odd Index_Cost = [] for i in range(N-1): if(List[i]&1): O+=1 else: E+=1 if(O==E and Odd-O == Even-...	Title: Cutting Time Limit: None seconds Memory Limit: None megabytes Problem Description: There are a lot of things which could be cut — trees, paper, "the rope". In this problem you are going to cut a sequence of integers. There is a sequence of integers, which contains the equal number of even and odd numbers. Gi...	```python N,Bitcoin = map(int,input().split()) List = [int(x) for x in input().split()] Even = 0 Odd = 0 for i in List: if(i&1): Odd+=1 else: Even+=1 E = Even O = Odd Index_Cost = [] for i in range(N-1): if(List[i]&1): O+=1 else: E+=1 if(O==E and Odd-...	0
302	A	Eugeny and Array	PROGRAMMING	800	[ "implementation" ]		null	null	Eugeny has array a<==<=a1,<=a2,<=...,<=an, consisting of n integers. Each integer ai equals to -1, or to 1. Also, he has m queries: - Query number i is given as a pair of integers li, ri (1<=≤<=li<=≤<=ri<=≤<=n). - The response to the query will be integer 1, if the elements of a...	The first line contains integers n and m (1<=≤<=n,<=m<=≤<=2·105). The second line contains n integers a1,<=a2,<=...,<=an (ai<==<=-1,<=1). Next m lines contain Eugene's queries. The i-th line contains integers li,<=ri (1<=≤<=li<=≤<=ri<=≤<=n).	Print m integers — the responses to Eugene's queries in the order they occur in the input.	[ "2 3\n1 -1\n1 1\n1 2\n2 2\n", "5 5\n-1 1 1 1 -1\n1 1\n2 3\n3 5\n2 5\n1 5\n" ]	[ "0\n1\n0\n", "0\n1\n0\n1\n0\n" ]	none	500	[ { "input": "2 3\n1 -1\n1 1\n1 2\n2 2", "output": "0\n1\n0" }, { "input": "5 5\n-1 1 1 1 -1\n1 1\n2 3\n3 5\n2 5\n1 5", "output": "0\n1\n0\n1\n0" }, { "input": "3 3\n1 1 1\n2 2\n1 1\n1 1", "output": "0\n0\n0" }, { "input": "4 4\n-1 -1 -1 -1\n1 3\n1 2\n1 2\n1 1", "output": "...	1,552,465,629	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	3	124	0	n, m = map(int, input().split()) a = list(map(int, input().split())) a1 = a.count(1) a11 = a.count(-1) for i in range(m): l, r = map(int, input().split()) k = l-r+1 if k % 2 == 0 and a1 >= k/2 and a11 >= k/2: print(1) else: print(0)	Title: Eugeny and Array Time Limit: None seconds Memory Limit: None megabytes Problem Description: Eugeny has array a<==<=a1,<=a2,<=...,<=an, consisting of n integers. Each integer ai equals to -1, or to 1. Also, he has m queries: - Query number i is given as a pair of integers li, ri (...	```python n, m = map(int, input().split()) a = list(map(int, input().split())) a1 = a.count(1) a11 = a.count(-1) for i in range(m): l, r = map(int, input().split()) k = l-r+1 if k % 2 == 0 and a1 >= k/2 and a11 >= k/2: print(1) else: print(0) ```	0
149	A	Business trip	PROGRAMMING	900	[ "greedy", "implementation", "sortings" ]		null	null	What joy! Petya's parents went on a business trip for the whole year and the playful kid is left all by himself. Petya got absolutely happy. He jumped on the bed and threw pillows all day long, until... Today Petya opened the cupboard and found a scary note there. His parents had left him with duties: he should water...	The first line contains exactly one integer k (0<=≤<=k<=≤<=100). The next line contains twelve space-separated integers: the i-th (1<=≤<=i<=≤<=12) number in the line represents ai (0<=≤<=ai<=≤<=100).	Print the only integer — the minimum number of months when Petya has to water the flower so that the flower grows no less than by k centimeters. If the flower can't grow by k centimeters in a year, print -1.	[ "5\n1 1 1 1 2 2 3 2 2 1 1 1\n", "0\n0 0 0 0 0 0 0 1 1 2 3 0\n", "11\n1 1 4 1 1 5 1 1 4 1 1 1\n" ]	[ "2\n", "0\n", "3\n" ]	Let's consider the first sample test. There it is enough to water the flower during the seventh and the ninth month. Then the flower grows by exactly five centimeters. In the second sample Petya's parents will believe him even if the flower doesn't grow at all (k = 0). So, it is possible for Petya not to water the f...	500	[ { "input": "5\n1 1 1 1 2 2 3 2 2 1 1 1", "output": "2" }, { "input": "0\n0 0 0 0 0 0 0 1 1 2 3 0", "output": "0" }, { "input": "11\n1 1 4 1 1 5 1 1 4 1 1 1", "output": "3" }, { "input": "15\n20 1 1 1 1 2 2 1 2 2 1 1", "output": "1" }, { "input": "7\n8 9 100 12 14 ...	1,661,521,757	2,147,483,647	PyPy 3-64	OK	TESTS	39	124	0	a=int(input()) b=sorted(list(map(int, input().split()))) try: while a>0: a-=b[-1] b.pop() print(12-len(b)) except: print(-1)	Title: Business trip Time Limit: None seconds Memory Limit: None megabytes Problem Description: What joy! Petya's parents went on a business trip for the whole year and the playful kid is left all by himself. Petya got absolutely happy. He jumped on the bed and threw pillows all day long, until... Today Petya open...	```python a=int(input()) b=sorted(list(map(int, input().split()))) try: while a>0: a-=b[-1] b.pop() print(12-len(b)) except: print(-1) ```	3
626	B	Cards	PROGRAMMING	1,300	[ "constructive algorithms", "dp", "math" ]		null	null	Catherine has a deck of n cards, each of which is either red, green, or blue. As long as there are at least two cards left, she can do one of two actions: - take any two (not necessarily adjacent) cards with different colors and exchange them for a new card of the third color; - take any two (not necessarily adja...	The first line of the input contains a single integer n (1<=≤<=n<=≤<=200) — the total number of cards. The next line contains a string s of length n — the colors of the cards. s contains only the characters 'B', 'G', and 'R', representing blue, green, and red, respectively.	Print a single string of up to three characters — the possible colors of the final card (using the same symbols as the input) in alphabetical order.	[ "2\nRB\n", "3\nGRG\n", "5\nBBBBB\n" ]	[ "G\n", "BR\n", "B\n" ]	In the first sample, Catherine has one red card and one blue card, which she must exchange for a green card. In the second sample, Catherine has two green cards and one red card. She has two options: she can exchange the two green cards for a green card, then exchange the new green card and the red card for a blue car...	750	[ { "input": "2\nRB", "output": "G" }, { "input": "3\nGRG", "output": "BR" }, { "input": "5\nBBBBB", "output": "B" }, { "input": "1\nR", "output": "R" }, { "input": "200\nBBRGRRBBRGGGBGBGBGRRGRGRGRBGRGRRBBGRGBGRRGRRRGGBBRGBGBGBRBBBBBBBGGBRGGRRRGGRGBGBGGBRRRRBRRRBRBB...	1,584,880,338	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	4	2,000	2,662,400	n = int(input()) s1 = input() d = {"R":0,"B":0,"G":0} for i in range(n): d[s1[i]] = d[s1[i]] + 1 # print(d) def recur_s(d): t = "" if d["R"] + d["B"] + d["G"] == 1: if d["R"] == 1: return "R" if d["B"] == 1: return "B" if d["G"] == 1: return "G" if d["R"] >= 2: s = dict(d)...	Title: Cards Time Limit: None seconds Memory Limit: None megabytes Problem Description: Catherine has a deck of n cards, each of which is either red, green, or blue. As long as there are at least two cards left, she can do one of two actions: - take any two (not necessarily adjacent) cards with different colors...	```python n = int(input()) s1 = input() d = {"R":0,"B":0,"G":0} for i in range(n): d[s1[i]] = d[s1[i]] + 1 # print(d) def recur_s(d): t = "" if d["R"] + d["B"] + d["G"] == 1: if d["R"] == 1: return "R" if d["B"] == 1: return "B" if d["G"] == 1: return "G" if d["R"] >= 2: s...	0
225	B	Well-known Numbers	PROGRAMMING	1,600	[ "binary search", "greedy", "number theory" ]		null	null	Numbers k-bonacci (k is integer, k<=><=1) are a generalization of Fibonacci numbers and are determined as follows: - F(k,<=n)<==<=0, for integer n, 1<=≤<=n<=<<=k; - F(k,<=k)<==<=1; - F(k,<=n)<==<=F(k,<=n<=-<=1)<=+<=F(k,<=n<=-<=2)<=+<=...<=+<=F(k,<=n<=-<=k), fo...	The first line contains two integers s and k (1<=≤<=s,<=k<=≤<=109; k<=><=1).	In the first line print an integer m (m<=≥<=2) that shows how many numbers are in the found representation. In the second line print m distinct integers a1,<=a2,<=...,<=am. Each printed integer should be a k-bonacci number. The sum of printed integers must equal s. It is guaranteed that the answer ex...	[ "5 2\n", "21 5\n" ]	[ "3\n0 2 3\n", "3\n4 1 16\n" ]	none	1,000	[ { "input": "5 2", "output": "3\n0 2 3" }, { "input": "21 5", "output": "3\n4 1 16" }, { "input": "1 1000", "output": "2\n1 0 " }, { "input": "1000000000 1000000000", "output": "14\n536870912 268435456 134217728 33554432 16777216 8388608 1048576 524288 131072 32768 16384 2...	1,557,822,701	2,147,483,647	Python 3	OK	TESTS	70	218	0	s, k = map(int, input().split()) freq = [1] while freq[-1] < s: x = 0 for i in range(max(0, len(freq)-k), len(freq)): x += freq[i] freq.append(x) res = [0] idx = len(freq) - 1 while s != 0: while freq[idx] > s: idx -= 1 res.append(freq[idx]) s -= freq[idx] print(len(res)) print(*res)	Title: Well-known Numbers Time Limit: None seconds Memory Limit: None megabytes Problem Description: Numbers k-bonacci (k is integer, k<=><=1) are a generalization of Fibonacci numbers and are determined as follows: - F(k,<=n)<==<=0, for integer n, 1<=≤<=n<=<<=k; - F(k,<=k)<==<=1; - ...	```python s, k = map(int, input().split()) freq = [1] while freq[-1] < s: x = 0 for i in range(max(0, len(freq)-k), len(freq)): x += freq[i] freq.append(x) res = [0] idx = len(freq) - 1 while s != 0: while freq[idx] > s: idx -= 1 res.append(freq[idx]) s -= freq[idx] print(len(res)) print(*res) ...	3
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,038,897	997	Python 3	WRONG_ANSWER	PRETESTS	3	46	5,529,600	k=str(input()).split() v1=int(k[0]) v2=int(k[1]) v3=int(k[2]) vm=int(k[3]) car3min=max(v3,vm) car3max=min(2vm, 2v3) if car3max<car3min: print(-1) else: car3=car3min car2min=max(v2,2vm+1) car2max=v22 if car2max<car2min: print(-1) else: car2=car2min car...	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 k=str(input()).split() v1=int(k[0]) v2=int(k[1]) v3=int(k[2]) vm=int(k[3]) car3min=max(v3,vm) car3max=min(2vm, 2v3) if car3max<car3min: print(-1) else: car3=car3min car2min=max(v2,2vm+1) car2max=v22 if car2max<car2min: print(-1) else: car2=car2min ...	0
488	A	Giga Tower	PROGRAMMING	1,100	[ "brute force" ]		null	null	Giga Tower is the tallest and deepest building in Cyberland. There are 17<=777<=777<=777 floors, numbered from <=-<=8<=888<=888<=888 to 8<=888<=888<=888. In particular, there is floor 0 between floor <=-<=1 and floor 1. Every day, thousands of tourists come to this place to enjoy the wonderful view. In Cyberland, it ...	The only line of input contains an integer a (<=-<=109<=≤<=a<=≤<=109).	Print the minimum b in a line.	[ "179\n", "-1\n", "18\n" ]	[ "1\n", "9\n", "10\n" ]	For the first sample, he has to arrive at the floor numbered 180. For the second sample, he will arrive at 8. Note that b should be positive, so the answer for the third sample is 10, not 0.	500	[ { "input": "179", "output": "1" }, { "input": "-1", "output": "9" }, { "input": "18", "output": "10" }, { "input": "-410058385", "output": "1" }, { "input": "-586825624", "output": "1" }, { "input": "852318890", "output": "1" }, { "input": ...	1,662,001,095	2,147,483,647	Python 3	OK	TESTS	35	46	0	a = int(input()) a += 1 counter = 1 while "8" not in str(a): a += 1 counter += 1 print(counter)	Title: Giga Tower Time Limit: None seconds Memory Limit: None megabytes Problem Description: Giga Tower is the tallest and deepest building in Cyberland. There are 17<=777<=777<=777 floors, numbered from <=-<=8<=888<=888<=888 to 8<=888<=888<=888. In particular, there is floor 0 between floor <=-<=1 and floor 1. Ever...	```python a = int(input()) a += 1 counter = 1 while "8" not in str(a): a += 1 counter += 1 print(counter) ```	3
58	A	Chat room	PROGRAMMING	1,000	[ "greedy", "strings" ]	A. Chat room	1	256	Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word "hello". For example, ...	The first and only line contains the word s, which Vasya typed. This word consisits of small Latin letters, its length is no less that 1 and no more than 100 letters.	If Vasya managed to say hello, print "YES", otherwise print "NO".	[ "ahhellllloou\n", "hlelo\n" ]	[ "YES\n", "NO\n" ]	none	500	[ { "input": "ahhellllloou", "output": "YES" }, { "input": "hlelo", "output": "NO" }, { "input": "helhcludoo", "output": "YES" }, { "input": "hehwelloho", "output": "YES" }, { "input": "pnnepelqomhhheollvlo", "output": "YES" }, { "input": "tymbzjyqhymeda...	1,638,434,728	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	30	0	s = input() x = [] y = [] count = 0 for i in range(len(s)): x.append(s[i]) for i in x: if i == 'h' or i == 'e' or i == 'l' or i == 'o' and i not in y: y.append(i) if y == ['h','e','l','o']: print("NO") if y == []: print("NO")	Title: Chat room Time Limit: 1 seconds Memory Limit: 256 megabytes Problem Description: Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letter...	```python s = input() x = [] y = [] count = 0 for i in range(len(s)): x.append(s[i]) for i in x: if i == 'h' or i == 'e' or i == 'l' or i == 'o' and i not in y: y.append(i) if y == ['h','e','l','o']: print("NO") if y == []: print("NO") ```	0
653	A	Bear and Three Balls	PROGRAMMING	900	[ "brute force", "implementation", "sortings" ]		null	null	Limak is a little polar bear. He has n balls, the i-th ball has size ti. Limak wants to give one ball to each of his three friends. Giving gifts isn't easy — there are two rules Limak must obey to make friends happy: - No two friends can get balls of the same size. - No two friends can get balls of sizes th...	The first line of the input contains one integer n (3<=≤<=n<=≤<=50) — the number of balls Limak has. The second line contains n integers t1,<=t2,<=...,<=tn (1<=≤<=ti<=≤<=1000) where ti denotes the size of the i-th ball.	Print "YES" (without quotes) if Limak can choose three balls of distinct sizes, such that any two of them differ by no more than 2. Otherwise, print "NO" (without quotes).	[ "4\n18 55 16 17\n", "6\n40 41 43 44 44 44\n", "8\n5 972 3 4 1 4 970 971\n" ]	[ "YES\n", "NO\n", "YES\n" ]	In the first sample, there are 4 balls and Limak is able to choose three of them to satisfy the rules. He must must choose balls with sizes 18, 16 and 17. In the second sample, there is no way to give gifts to three friends without breaking the rules. In the third sample, there is even more than one way to choose bal...	500	[ { "input": "4\n18 55 16 17", "output": "YES" }, { "input": "6\n40 41 43 44 44 44", "output": "NO" }, { "input": "8\n5 972 3 4 1 4 970 971", "output": "YES" }, { "input": "3\n959 747 656", "output": "NO" }, { "input": "4\n1 2 2 3", "output": "YES" }, { ...	1,651,330,111	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	31	0	import numpy as np if __name__ == '__main__': n = int(input()) pesos = [int(x) for x in input().split()] # random.seed(8) # numeros = random.getstate() # pesos = random.sample(range(1000), k=50) pesos = np.unique(pesos) pesos.sort() sub_pesos = np.array(pesos[1:]) - np.array(pesos[:len(...	Title: Bear and Three Balls Time Limit: None seconds Memory Limit: None megabytes Problem Description: Limak is a little polar bear. He has n balls, the i-th ball has size ti. Limak wants to give one ball to each of his three friends. Giving gifts isn't easy — there are two rules Limak must obey to make fri...	```python import numpy as np if __name__ == '__main__': n = int(input()) pesos = [int(x) for x in input().split()] # random.seed(8) # numeros = random.getstate() # pesos = random.sample(range(1000), k=50) pesos = np.unique(pesos) pesos.sort() sub_pesos = np.array(pesos[1:]) - np.array(p...	-1
777	B	Game of Credit Cards	PROGRAMMING	1,300	[ "data structures", "dp", "greedy", "sortings" ]		null	null	After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their competitions in peaceful game of Credit Cards. Rules of this game are simple: each player bring his favourite n-digit credit card. Then both players name the digits written on the...	The first line of the input contains a single integer n (1<=≤<=n<=≤<=1000) — the number of digits in the cards Sherlock and Moriarty are going to use. The second line contains n digits — Sherlock's credit card number. The third line contains n digits — Moriarty's credit card number.	First print the minimum possible number of flicks Moriarty will get. Then print the maximum possible number of flicks that Sherlock can get from Moriarty.	[ "3\n123\n321\n", "2\n88\n00\n" ]	[ "0\n2\n", "2\n0\n" ]	First sample is elaborated in the problem statement. In the second sample, there is no way Moriarty can avoid getting two flicks.	1,000	[ { "input": "3\n123\n321", "output": "0\n2" }, { "input": "2\n88\n00", "output": "2\n0" }, { "input": "1\n4\n5", "output": "0\n1" }, { "input": "1\n8\n7", "output": "1\n0" }, { "input": "2\n55\n55", "output": "0\n0" }, { "input": "3\n534\n432", "out...	1,620,818,409	2,147,483,647	Python 3	OK	TESTS	55	62	6,963,200	numDigit = int(input()) digitSher = list(map(int, list(input()))) digitMory = list(map(int, list(input()))) digitSher.sort() digitMory.sort() i,j = numDigit - 1, numDigit - 1 shelban, s = 0, 0 while s != j + 1 and i >= 0: if digitMory[j] < digitSher[i]: s += 1 shelban += 1 else: ...	Title: Game of Credit Cards Time Limit: None seconds Memory Limit: None megabytes Problem Description: After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their competitions in peaceful game of Credit Cards. Rules of this game are simpl...	```python numDigit = int(input()) digitSher = list(map(int, list(input()))) digitMory = list(map(int, list(input()))) digitSher.sort() digitMory.sort() i,j = numDigit - 1, numDigit - 1 shelban, s = 0, 0 while s != j + 1 and i >= 0: if digitMory[j] < digitSher[i]: s += 1 shelban += 1 ...	3
6	B	President's Office	PROGRAMMING	1,100	[ "implementation" ]	B. President's Office	2	64	President of Berland has a very vast office-room, where, apart from him, work his subordinates. Each subordinate, as well as President himself, has his own desk of a unique colour. Each desk is rectangular, and its sides are parallel to the office walls. One day President decided to establish an assembly, of which all ...	The first line contains two separated by a space integer numbers n, m (1<=≤<=n,<=m<=≤<=100) — the length and the width of the office-room, and c character — the President's desk colour. The following n lines contain m characters each — the office-room description. It is guaranteed that the colour of each ...	Print the only number — the amount of President's deputies.	[ "3 4 R\nG.B.\n.RR.\nTTT.\n", "3 3 Z\n...\n.H.\n..Z\n" ]	[ "2\n", "0\n" ]	none	0	[ { "input": "3 4 R\nG.B.\n.RR.\nTTT.", "output": "2" }, { "input": "3 3 Z\n...\n.H.\n..Z", "output": "0" }, { "input": "1 1 C\nC", "output": "0" }, { "input": "2 2 W\nKW\nKW", "output": "1" }, { "input": "1 10 H\n....DDHHHH", "output": "1" }, { "input":...	1,585,014,412	2,147,483,647	Python 3	OK	TESTS	32	124	307,200	n,m,c=input().split();n=int(n);m=int(m) matrix = [[0 for x in range(m)] for y in range(n)] for i in range(n): row = input() for j in range(m): matrix[i][j] = row[j] deputies = list() def isRepeated(x): flag = 0 for z in deputies: if z == x: flag = 1 ...	Title: President's Office Time Limit: 2 seconds Memory Limit: 64 megabytes Problem Description: President of Berland has a very vast office-room, where, apart from him, work his subordinates. Each subordinate, as well as President himself, has his own desk of a unique colour. Each desk is rectangular, and its sides ...	```python n,m,c=input().split();n=int(n);m=int(m) matrix = [[0 for x in range(m)] for y in range(n)] for i in range(n): row = input() for j in range(m): matrix[i][j] = row[j] deputies = list() def isRepeated(x): flag = 0 for z in deputies: if z == x: flag = 1 ...	3.966711
217	A	Ice Skating	PROGRAMMING	1,200	[ "brute force", "dfs and similar", "dsu", "graphs" ]		null	null	Bajtek is learning to skate on ice. He's a beginner, so his only mode of transportation is pushing off from a snow drift to the north, east, south or west and sliding until he lands in another snow drift. He has noticed that in this way it's impossible to get from some snow drifts to some other by any sequence of moves...	The first line of input contains a single integer n (1<=≤<=n<=≤<=100) — the number of snow drifts. Each of the following n lines contains two integers xi and yi (1<=≤<=xi,<=yi<=≤<=1000) — the coordinates of the i-th snow drift. Note that the north direction coinсides with the direction of Oy ...	Output the minimal number of snow drifts that need to be created in order for Bajtek to be able to reach any snow drift from any other one.	[ "2\n2 1\n1 2\n", "2\n2 1\n4 1\n" ]	[ "1\n", "0\n" ]	none	500	[ { "input": "2\n2 1\n1 2", "output": "1" }, { "input": "2\n2 1\n4 1", "output": "0" }, { "input": "24\n171 35\n261 20\n4 206\n501 446\n961 912\n581 748\n946 978\n463 514\n841 889\n341 466\n842 967\n54 102\n235 261\n925 889\n682 672\n623 636\n268 94\n635 710\n474 510\n697 794\n586 663\n182...	1,565,892,914	2,147,483,647	Python 3	OK	TESTS	76	248	204,800	mod = 1000000007 ii = lambda : int(input()) si = lambda : input() dgl = lambda : list(map(int, input())) f = lambda : map(int, input().split()) il = lambda : list(map(int, input().split())) ls = lambda : list(input()) def dfs(sv, l, vis, n): vis[sv] = True for i in range(1, n+1): if not ...	Title: Ice Skating Time Limit: None seconds Memory Limit: None megabytes Problem Description: Bajtek is learning to skate on ice. He's a beginner, so his only mode of transportation is pushing off from a snow drift to the north, east, south or west and sliding until he lands in another snow drift. He has noticed tha...	```python mod = 1000000007 ii = lambda : int(input()) si = lambda : input() dgl = lambda : list(map(int, input())) f = lambda : map(int, input().split()) il = lambda : list(map(int, input().split())) ls = lambda : list(input()) def dfs(sv, l, vis, n): vis[sv] = True for i in range(1, n+1): ...	3
58	A	Chat room	PROGRAMMING	1,000	[ "greedy", "strings" ]	A. Chat room	1	256	Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word "hello". For example, ...	The first and only line contains the word s, which Vasya typed. This word consisits of small Latin letters, its length is no less that 1 and no more than 100 letters.	If Vasya managed to say hello, print "YES", otherwise print "NO".	[ "ahhellllloou\n", "hlelo\n" ]	[ "YES\n", "NO\n" ]	none	500	[ { "input": "ahhellllloou", "output": "YES" }, { "input": "hlelo", "output": "NO" }, { "input": "helhcludoo", "output": "YES" }, { "input": "hehwelloho", "output": "YES" }, { "input": "pnnepelqomhhheollvlo", "output": "YES" }, { "input": "tymbzjyqhymeda...	1,683,334,989	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	30	0	s = input() x = "hello" k = "" c = 0 for i in s: if i == "l": c+=1 if i not in k: if i in x: k += i # for i in k: if k == "helo" and c >= 2 or k == "eloh" or k == "hole" or k == "lhoe": print("YES") else: print("NO") print(k)	Title: Chat room Time Limit: 1 seconds Memory Limit: 256 megabytes Problem Description: Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letter...	```python s = input() x = "hello" k = "" c = 0 for i in s: if i == "l": c+=1 if i not in k: if i in x: k += i # for i in k: if k == "helo" and c >= 2 or k == "eloh" or k == "hole" or k == "lhoe": print("YES") else: print("NO") print(k) ```	0
463	B	Caisa and Pylons	PROGRAMMING	1,100	[ "brute force", "implementation", "math" ]		null	null	Caisa solved the problem with the sugar and now he is on the way back to home. Caisa is playing a mobile game during his path. There are (n<=+<=1) pylons numbered from 0 to n in this game. The pylon with number 0 has zero height, the pylon with number i (i<=><=0) has height hi. The goal of the game is ...	The first line contains integer n (1<=≤<=n<=≤<=105). The next line contains n integers h1, h2,<=..., hn (1<=<=≤<=<=hi<=<=≤<=<=105) representing the heights of the pylons.	Print a single number representing the minimum number of dollars paid by Caisa.	[ "5\n3 4 3 2 4\n", "3\n4 4 4\n" ]	[ "4\n", "4\n" ]	In the first sample he can pay 4 dollars and increase the height of pylon with number 0 by 4 units. Then he can safely pass to the last pylon.	1,000	[ { "input": "5\n3 4 3 2 4", "output": "4" }, { "input": "3\n4 4 4", "output": "4" }, { "input": "99\n1401 2019 1748 3785 3236 3177 3443 3772 2138 1049 353 908 310 2388 1322 88 2160 2783 435 2248 1471 706 2468 2319 3156 3506 2794 1999 1983 2519 2597 3735 537 344 3519 3772 3872 2961 3895 20...	1,666,160,789	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	2	61	0	#nums = list(map(int, input().split())) n = int(input()) nums = list(map(int, input().split())) energy = 0 dollar = 0 current = 0 nums.insert(0,0) for i in range(len(nums)-1): # print(energy,dollar) if nums[i+1] <= nums[i]: energy += nums[i] - nums[i+1] else: x = nums[i+1...	Title: Caisa and Pylons Time Limit: None seconds Memory Limit: None megabytes Problem Description: Caisa solved the problem with the sugar and now he is on the way back to home. Caisa is playing a mobile game during his path. There are (n<=+<=1) pylons numbered from 0 to n in this game. The pylon with number 0...	```python #nums = list(map(int, input().split())) n = int(input()) nums = list(map(int, input().split())) energy = 0 dollar = 0 current = 0 nums.insert(0,0) for i in range(len(nums)-1): # print(energy,dollar) if nums[i+1] <= nums[i]: energy += nums[i] - nums[i+1] else: x ...	0
689	A	Mike and Cellphone	PROGRAMMING	1,400	[ "brute force", "constructive algorithms", "implementation" ]		null	null	While swimming at the beach, Mike has accidentally dropped his cellphone into the water. There was no worry as he bought a cheap replacement phone with an old-fashioned keyboard. The keyboard has only ten digital equal-sized keys, located in the following way: Together with his old phone, he lost all his contacts and ...	The first line of the input contains the only integer n (1<=≤<=n<=≤<=9) — the number of digits in the phone number that Mike put in. The second line contains the string consisting of n digits (characters from '0' to '9') representing the number that Mike put in.	If there is no other phone number with the same finger movements and Mike can be sure he is calling the correct number, print "YES" (without quotes) in the only line. Otherwise print "NO" (without quotes) in the first line.	[ "3\n586\n", "2\n09\n", "9\n123456789\n", "3\n911\n" ]	[ "NO\n", "NO\n", "YES\n", "YES\n" ]	You can find the picture clarifying the first sample case in the statement above.	500	[ { "input": "3\n586", "output": "NO" }, { "input": "2\n09", "output": "NO" }, { "input": "9\n123456789", "output": "YES" }, { "input": "3\n911", "output": "YES" }, { "input": "3\n089", "output": "NO" }, { "input": "3\n159", "output": "YES" }, { ...	1,467,823,363	463	Python 3	OK	TESTS	93	93	0	# A input() l = list(map(int, list(input()))) if (1 in l or 4 in l or 7 in l or 0 in l) and (1 in l or 2 in l or 3 in l) and (3 in l or 6 in l or 9 in l or 0 in l) and (7 in l or 0 in l or 9 in l): print("YES") else: print("NO")	Title: Mike and Cellphone Time Limit: None seconds Memory Limit: None megabytes Problem Description: While swimming at the beach, Mike has accidentally dropped his cellphone into the water. There was no worry as he bought a cheap replacement phone with an old-fashioned keyboard. The keyboard has only ten digital equ...	```python # A input() l = list(map(int, list(input()))) if (1 in l or 4 in l or 7 in l or 0 in l) and (1 in l or 2 in l or 3 in l) and (3 in l or 6 in l or 9 in l or 0 in l) and (7 in l or 0 in l or 9 in l): print("YES") else: print("NO") ```	3
928	C	Dependency management	PROGRAMMING	1,900	[ "*special", "graphs", "implementation" ]		null	null	Polycarp is currently developing a project in Vaja language and using a popular dependency management system called Vamen. From Vamen's point of view both Vaja project and libraries are treated projects for simplicity. A project in Vaja has its own uniqie non-empty name consisting of lowercase latin letters with lengt...	The first line contains an only integer n (1<=≤<=n<=≤<=1<=000) — the number of projects in Vaja. The following lines contain the project descriptions. Each project is described by a line consisting of its name and version separated by space. The next line gives the number of direct dependencies (from 0 to n<=-<=...	Output all Polycarp's project's dependencies in lexicographical order.	[ "4\na 3\n2\nb 1\nc 1\n \nb 2\n0\n \nb 1\n1\nb 2\n \nc 1\n1\nb 2\n", "9\ncodehorses 5\n3\nwebfrmk 6\nmashadb 1\nmashadb 2\n \ncommons 2\n0\n \nmashadb 3\n0\n \nwebfrmk 6\n2\nmashadb 3\ncommons 2\n \nextra 4\n1\nextra 3\n \nextra 3\n0\n \nextra 1\n0\n \nmashadb 1\n1\nextra 3\n \nmashadb 2\n1\nextra 1\n", "3\nabc ...	[ "2\nb 1\nc 1\n", "4\ncommons 2\nextra 1\nmashadb 2\nwebfrmk 6\n", "1\ncba 2\n" ]	The first sample is given in the pic below. Arrow from A to B means that B directly depends on A. Projects that Polycarp's project «a» (version 3) depends on are painted black. The second sample is again given in the pic below. Arrow from A to B means that B directly depends on A. Projects that Polycar...	2,000	[ { "input": "4\na 3\n2\nb 1\nc 1\n\nb 2\n0\n\nb 1\n1\nb 2\n\nc 1\n1\nb 2", "output": "2\nb 1\nc 1" }, { "input": "9\ncodehorses 5\n3\nwebfrmk 6\nmashadb 1\nmashadb 2\n\ncommons 2\n0\n\nmashadb 3\n0\n\nwebfrmk 6\n2\nmashadb 3\ncommons 2\n\nextra 4\n1\nextra 3\n\nextra 3\n0\n\nextra 1\n0\n\nmashadb 1\n...	1,519,553,176	66,676	Python 3	TIME_LIMIT_EXCEEDED	PRETESTS	8	4,000	5,632,000	count = int(input()) graph={} def get_new_elem(): node = input() elem = [input() for i in range(int(input()))] return node, elem main, melem = get_new_elem() graph={} graph[main] = melem for i in range(count-1): input() node, elem = get_new_elem() graph[node]=elem def find_all_pat...	Title: Dependency management Time Limit: None seconds Memory Limit: None megabytes Problem Description: Polycarp is currently developing a project in Vaja language and using a popular dependency management system called Vamen. From Vamen's point of view both Vaja project and libraries are treated projects for simpli...	```python count = int(input()) graph={} def get_new_elem(): node = input() elem = [input() for i in range(int(input()))] return node, elem main, melem = get_new_elem() graph={} graph[main] = melem for i in range(count-1): input() node, elem = get_new_elem() graph[node]=elem def fi...	0
572	A	Arrays	PROGRAMMING	900	[ "sortings" ]		null	null	You are given two arrays A and B consisting of integers, sorted in non-decreasing order. Check whether it is possible to choose k numbers in array A and choose m numbers in array B so that any number chosen in the first array is strictly less than any number chosen in the second array.	The first line contains two integers nA,<=nB (1<=≤<=nA,<=nB<=≤<=105), separated by a space — the sizes of arrays A and B, correspondingly. The second line contains two integers k and m (1<=≤<=k<=≤<=nA,<=1<=≤<=m<=≤<=nB), separated by a space. The third line contains nA numbers *...	Print "YES" (without the quotes), if you can choose k numbers in array A and m numbers in array B so that any number chosen in array A was strictly less than any number chosen in array B. Otherwise, print "NO" (without the quotes).	[ "3 3\n2 1\n1 2 3\n3 4 5\n", "3 3\n3 3\n1 2 3\n3 4 5\n", "5 2\n3 1\n1 1 1 1 1\n2 2\n" ]	[ "YES\n", "NO\n", "YES\n" ]	In the first sample test you can, for example, choose numbers 1 and 2 from array A and number 3 from array B (1 < 3 and 2 < 3). In the second sample test the only way to choose k elements in the first array and m elements in the second one is to choose all numbers in both arrays, but then not all the num...	500	[ { "input": "3 3\n2 1\n1 2 3\n3 4 5", "output": "YES" }, { "input": "3 3\n3 3\n1 2 3\n3 4 5", "output": "NO" }, { "input": "5 2\n3 1\n1 1 1 1 1\n2 2", "output": "YES" }, { "input": "3 5\n1 1\n5 5 5\n5 5 5 5 5", "output": "NO" }, { "input": "1 1\n1 1\n1\n1", "ou...	1,530,773,679	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	5	108	0	na, nb = map(int, input().split()) k, m = map(int, input().split()) a = list(map(int, input().split())) b = list(map(int, input().split())) def merge(L,R,a): i = 0 j = 0 k = 0 while (i < len(L) and j < len(R)): if (L[i] < R[j]): a[k] = L[i] i += 1 el...	Title: Arrays Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given two arrays A and B consisting of integers, sorted in non-decreasing order. Check whether it is possible to choose k numbers in array A and choose m numbers in array B so that any number chosen in the fi...	```python na, nb = map(int, input().split()) k, m = map(int, input().split()) a = list(map(int, input().split())) b = list(map(int, input().split())) def merge(L,R,a): i = 0 j = 0 k = 0 while (i < len(L) and j < len(R)): if (L[i] < R[j]): a[k] = L[i] i += 1 ...	0
776	B	Sherlock and his girlfriend	PROGRAMMING	1,200	[ "constructive algorithms", "number theory" ]		null	null	Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry. He bought n pieces of jewelry. The i-th piece has price equal to i<=+<=1, that is, the prices of the jewelry are 2,<=3,<=4,<=... n<=+<=1. Watson gave Sherlock a challenge to color these jewelry pie...	The only line contains single integer n (1<=≤<=n<=≤<=100000) — the number of jewelry pieces.	The first line of output should contain a single integer k, the minimum number of colors that can be used to color the pieces of jewelry with the given constraints. The next line should consist of n space-separated integers (between 1 and k) that specify the color of each piece in the order of increasing price. ...	[ "3\n", "4\n" ]	[ "2\n1 1 2 ", "2\n2 1 1 2\n" ]	In the first input, the colors for first, second and third pieces of jewelry having respective prices 2, 3 and 4 are 1, 1 and 2 respectively. In this case, as 2 is a prime divisor of 4, colors of jewelry having prices 2 and 4 must be distinct.	1,000	[ { "input": "3", "output": "2\n1 1 2 " }, { "input": "4", "output": "2\n1 1 2 1 " }, { "input": "17", "output": "2\n1 1 2 1 2 1 2 2 2 1 2 1 2 2 2 1 2 " }, { "input": "25", "output": "2\n1 1 2 1 2 1 2 2 2 1 2 1 2 2 2 1 2 1 2 2 2 1 2 2 2 " }, { "input": "85", "ou...	1,632,203,040	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	11	46	6,963,200	def sievePrime(n): prime = [1](n+2) prime[0] = prime[1] = 0 for i in range(n+2): if prime[i] == 1: d = ii while d < n+2: prime[d] = 2 d = d+i for i in range(2,n+2): print(prime[i],end= ' ') n = int(input()) print(2) sievePr...	Title: Sherlock and his girlfriend Time Limit: None seconds Memory Limit: None megabytes Problem Description: Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry. He bought n pieces of jewelry. The i-th piece has price equal to i<=+<=1, that is, the ...	```python def sievePrime(n): prime = [1](n+2) prime[0] = prime[1] = 0 for i in range(n+2): if prime[i] == 1: d = ii while d < n+2: prime[d] = 2 d = d+i for i in range(2,n+2): print(prime[i],end= ' ') n = int(input()) print(...	0
300	C	Beautiful Numbers	PROGRAMMING	1,800	[ "brute force", "combinatorics" ]		null	null	Vitaly is a very weird man. He's got two favorite digits a and b. Vitaly calls a positive integer good, if the decimal representation of this integer only contains digits a and b. Vitaly calls a good number excellent, if the sum of its digits is a good number. For example, let's say that Vitaly's favourite dig...	The first line contains three integers: a, b, n (1<=≤<=a<=<<=b<=≤<=9,<=1<=≤<=n<=≤<=106).	Print a single integer — the answer to the problem modulo 1000000007 (109<=+<=7).	[ "1 3 3\n", "2 3 10\n" ]	[ "1\n", "165\n" ]	none	2,000	[ { "input": "1 3 3", "output": "1" }, { "input": "2 3 10", "output": "165" }, { "input": "6 8 14215", "output": "651581472" }, { "input": "4 9 104671", "output": "329390901" }, { "input": "6 7 78755", "output": "0" }, { "input": "1 8 265", "output":...	1,644,598,209	2,147,483,647	PyPy 3	TIME_LIMIT_EXCEEDED	TESTS	3	2,000	8,908,800	import math a,b,n = list(map(int, input().split())) d = b - a lower = a * n upper = b * n digits = math.floor(math.log(lower,10)) + 1 k = [] def perm(l,digits,s): if digits == 0: x = int(s) if lower <= x <= upper: a = x - lower if a % d == 0: ...	Title: Beautiful Numbers Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vitaly is a very weird man. He's got two favorite digits a and b. Vitaly calls a positive integer good, if the decimal representation of this integer only contains digits a and b. Vitaly calls a good number ex...	```python import math a,b,n = list(map(int, input().split())) d = b - a lower = a * n upper = b * n digits = math.floor(math.log(lower,10)) + 1 k = [] def perm(l,digits,s): if digits == 0: x = int(s) if lower <= x <= upper: a = x - lower if a % d == 0:...	0
769	B	News About Credit	PROGRAMMING	1,200	[ "*special", "greedy", "two pointers" ]		null	null	Polycarp studies at the university in the group which consists of n students (including himself). All they are registrated in the social net "TheContacnt!". Not all students are equally sociable. About each student you know the value ai — the maximum number of messages which the i-th student is agree to send p...	The first line contains the positive integer n (2<=≤<=n<=≤<=100) — the number of students. The second line contains the sequence a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=100), where ai equals to the maximum number of messages which can the i-th student agree to send. Consider that Polycarp always has th...	Print -1 to the first line if it is impossible to inform all students about credit. Otherwise, in the first line print the integer k — the number of messages which will be sent. In each of the next k lines print two distinct integers f and t, meaning that the student number f sent the message with news to t...	[ "4\n1 2 1 0\n", "6\n2 0 1 3 2 0\n", "3\n0 2 2\n" ]	[ "3\n1 2\n2 4\n2 3\n", "6\n1 3\n3 4\n1 2\n4 5\n5 6\n4 6\n", "-1\n" ]	In the first test Polycarp (the student number 1) can send the message to the student number 2, who after that can send the message to students number 3 and 4. Thus, all students knew about the credit.	1,000	[ { "input": "4\n1 2 1 0", "output": "3\n1 2\n2 3\n2 4" }, { "input": "6\n2 0 1 3 2 0", "output": "5\n1 4\n1 5\n4 3\n4 2\n4 6" }, { "input": "3\n0 2 2", "output": "-1" }, { "input": "2\n0 0", "output": "-1" }, { "input": "2\n1 0", "output": "1\n1 2" }, { ...	1,604,489,857	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	0	108	0	from sys import stdin,stdout,maxsize;# mod = int(1e9 + 7);#import re # can use multiple splits tup = lambda: map(int, stdin.readline().split()) I = lambda: int(stdin.readline()) lint = lambda: [int(x) for x in stdin.readline().split()] #S = lambda: stdin.readline().replace('\n', '').strip() #def grid(r, c): retur...	Title: News About Credit Time Limit: None seconds Memory Limit: None megabytes Problem Description: Polycarp studies at the university in the group which consists of n students (including himself). All they are registrated in the social net "TheContacnt!". Not all students are equally sociable. About each student...	```python from sys import stdin,stdout,maxsize;# mod = int(1e9 + 7);#import re # can use multiple splits tup = lambda: map(int, stdin.readline().split()) I = lambda: int(stdin.readline()) lint = lambda: [int(x) for x in stdin.readline().split()] #S = lambda: stdin.readline().replace('\n', '').strip() #def grid(r,...	0
154	B	Colliders	PROGRAMMING	1,600	[ "math", "number theory" ]		null	null	By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activating several colliders simultaneously could cause, so the colliders were deactivated. In 2312 there was a startling discov...	The first line contains two space-separated integers n and m (1<=≤<=n,<=m<=≤<=105) — the number of colliders and the number of requests, correspondingly. Next m lines contain numbers of requests, one per line, in the form of either "+ i" (without the quotes) — activate the i-th collider, or "- i" (without ...	Print m lines — the results of executing requests in the above given format. The requests should be processed in the order, in which they are given in the input. Don't forget that the responses to the requests should be printed without quotes.	[ "10 10\n+ 6\n+ 10\n+ 5\n- 10\n- 5\n- 6\n+ 10\n+ 3\n+ 6\n+ 3\n" ]	[ "Success\nConflict with 6\nSuccess\nAlready off\nSuccess\nSuccess\nSuccess\nSuccess\nConflict with 10\nAlready on\n" ]	Note that in the sample the colliders don't turn on after the second and ninth requests. The ninth request could also receive response "Conflict with 3".	1,000	[ { "input": "10 10\n+ 6\n+ 10\n+ 5\n- 10\n- 5\n- 6\n+ 10\n+ 3\n+ 6\n+ 3", "output": "Success\nConflict with 6\nSuccess\nAlready off\nSuccess\nSuccess\nSuccess\nSuccess\nConflict with 10\nAlready on" }, { "input": "7 5\n+ 7\n+ 6\n+ 4\n+ 3\n- 7", "output": "Success\nSuccess\nConflict with 6\nConfli...	1,634,939,080	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	1,340	8,499,200	class Solution: def PrimeFactors(self,N): SPF = [-1](N+1) i=2 while(ii<=N): if SPF[i]==-1: j=i while(ji<=N): if SPF[ij]==-1: SPF[i*j]=i j+=1 i+=1 re...	Title: Colliders Time Limit: None seconds Memory Limit: None megabytes Problem Description: By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activating several colliders simul...	```python class Solution: def PrimeFactors(self,N): SPF = [-1](N+1) i=2 while(ii<=N): if SPF[i]==-1: j=i while(ji<=N): if SPF[ij]==-1: SPF[i*j]=i j+=1 i+=1 ...	0
572	A	Arrays	PROGRAMMING	900	[ "sortings" ]		null	null	You are given two arrays A and B consisting of integers, sorted in non-decreasing order. Check whether it is possible to choose k numbers in array A and choose m numbers in array B so that any number chosen in the first array is strictly less than any number chosen in the second array.	The first line contains two integers nA,<=nB (1<=≤<=nA,<=nB<=≤<=105), separated by a space — the sizes of arrays A and B, correspondingly. The second line contains two integers k and m (1<=≤<=k<=≤<=nA,<=1<=≤<=m<=≤<=nB), separated by a space. The third line contains nA numbers *...	Print "YES" (without the quotes), if you can choose k numbers in array A and m numbers in array B so that any number chosen in array A was strictly less than any number chosen in array B. Otherwise, print "NO" (without the quotes).	[ "3 3\n2 1\n1 2 3\n3 4 5\n", "3 3\n3 3\n1 2 3\n3 4 5\n", "5 2\n3 1\n1 1 1 1 1\n2 2\n" ]	[ "YES\n", "NO\n", "YES\n" ]	In the first sample test you can, for example, choose numbers 1 and 2 from array A and number 3 from array B (1 < 3 and 2 < 3). In the second sample test the only way to choose k elements in the first array and m elements in the second one is to choose all numbers in both arrays, but then not all the num...	500	[ { "input": "3 3\n2 1\n1 2 3\n3 4 5", "output": "YES" }, { "input": "3 3\n3 3\n1 2 3\n3 4 5", "output": "NO" }, { "input": "5 2\n3 1\n1 1 1 1 1\n2 2", "output": "YES" }, { "input": "3 5\n1 1\n5 5 5\n5 5 5 5 5", "output": "NO" }, { "input": "1 1\n1 1\n1\n1", "ou...	1,495,796,675	2,147,483,647	Python 3	OK	TESTS	52	93	13,312,000	import sys element_of_array = input() k_and_m = input() array1_raw = input() array2_raw = input() k, m = k_and_m.split() k = int(k) - 1 array1 = array1_raw.split() array2 = array2_raw.split() offset = len(array2)-int(m) if int(array1[int(k)]) < int(array2[int(offset)]): print("YES") else: print...	Title: Arrays Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given two arrays A and B consisting of integers, sorted in non-decreasing order. Check whether it is possible to choose k numbers in array A and choose m numbers in array B so that any number chosen in the fi...	```python import sys element_of_array = input() k_and_m = input() array1_raw = input() array2_raw = input() k, m = k_and_m.split() k = int(k) - 1 array1 = array1_raw.split() array2 = array2_raw.split() offset = len(array2)-int(m) if int(array1[int(k)]) < int(array2[int(offset)]): print("YES") else...	3
631	B	Print Check	PROGRAMMING	1,200	[ "constructive algorithms", "implementation" ]		null	null	Kris works in a large company "Blake Technologies". As a best engineer of the company he was assigned a task to develop a printer that will be able to print horizontal and vertical strips. First prototype is already built and Kris wants to tests it. He wants you to implement the program that checks the result of the pr...	The first line of the input contains three integers n, m and k (1<=<=≤<=<=n,<=<=m<=<=≤<=5000, n·m<=≤<=100<=000, 1<=≤<=k<=≤<=100<=000) — the dimensions of the sheet and the number of operations, respectively. Each of the next k lines contains the description of exactly one query: - 1 ri ai ...	Print n lines containing m integers each — the resulting table after all operations are applied.	[ "3 3 3\n1 1 3\n2 2 1\n1 2 2\n", "5 3 5\n1 1 1\n1 3 1\n1 5 1\n2 1 1\n2 3 1\n" ]	[ "3 1 3 \n2 2 2 \n0 1 0 \n", "1 1 1 \n1 0 1 \n1 1 1 \n1 0 1 \n1 1 1 \n" ]	The figure below shows all three operations for the first sample step by step. The cells that were painted on the corresponding step are marked gray.	1,000	[ { "input": "3 3 3\n1 1 3\n2 2 1\n1 2 2", "output": "3 1 3 \n2 2 2 \n0 1 0 " }, { "input": "5 3 5\n1 1 1\n1 3 1\n1 5 1\n2 1 1\n2 3 1", "output": "1 1 1 \n1 0 1 \n1 1 1 \n1 0 1 \n1 1 1 " }, { "input": "5 5 4\n1 2 1\n1 4 1\n2 2 1\n2 4 1", "output": "0 1 0 1 0 \n1 1 1 1 1 \n0 1 0 1 0 \n1...	1,584,865,031	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	10	1,000	614,400	n,m,k=map(int,input().split()) x=[] for j in range(n): x.append([0 for i in range(m)]) for i in range(k): t,r,a=map(int,input().split()) if t==1: for j in range(m): x[r-1][j]=a if t==2: for j in range(n): x[j][r-1]=a for i in range(n): print(*x[...	Title: Print Check Time Limit: None seconds Memory Limit: None megabytes Problem Description: Kris works in a large company "Blake Technologies". As a best engineer of the company he was assigned a task to develop a printer that will be able to print horizontal and vertical strips. First prototype is already built a...	```python n,m,k=map(int,input().split()) x=[] for j in range(n): x.append([0 for i in range(m)]) for i in range(k): t,r,a=map(int,input().split()) if t==1: for j in range(m): x[r-1][j]=a if t==2: for j in range(n): x[j][r-1]=a for i in range(n): ...	0
409	H	A + B Strikes Back	PROGRAMMING	1,500	[ "*special", "brute force", "constructive algorithms", "dsu", "implementation" ]		null	null	A + B is often used as an example of the easiest problem possible to show some contest platform. However, some scientists have observed that sometimes this problem is not so easy to get accepted. Want to try?	The input contains two integers a and b (0<=≤<=a,<=b<=≤<=103), separated by a single space.	Output the sum of the given integers.	[ "5 14\n", "381 492\n" ]	[ "19\n", "873\n" ]	none	0	[ { "input": "5 14", "output": "19" }, { "input": "381 492", "output": "873" }, { "input": "536 298", "output": "834" }, { "input": "143 522", "output": "665" }, { "input": "433 126", "output": "559" }, { "input": "723 350", "output": "1073" }, {...	1,585,749,090	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	0	0	0	a,b =[int(aaa) for aaa in input().split()] s = a+b print(s)	Title: A + B Strikes Back Time Limit: None seconds Memory Limit: None megabytes Problem Description: A + B is often used as an example of the easiest problem possible to show some contest platform. However, some scientists have observed that sometimes this problem is not so easy to get accepted. Want to try? Input ...	```python a,b =[int(aaa) for aaa in input().split()] s = a+b print(s) ```	0
342	E	Xenia and Tree	PROGRAMMING	2,400	[ "data structures", "divide and conquer", "trees" ]		null	null	Xenia the programmer has a tree consisting of n nodes. We will consider the tree nodes indexed from 1 to n. We will also consider the first node to be initially painted red, and the other nodes — to be painted blue. The distance between two tree nodes v and u is the number of edges in the shortest path between...	The first line contains two integers n and m (2<=≤<=n<=≤<=105,<=1<=≤<=m<=≤<=105) — the number of nodes in the tree and the number of queries. Next n<=-<=1 lines contain the tree edges, the i-th line contains a pair of integers ai,<=bi (1<=≤<=ai,<=bi<=≤<=n,<=ai<=≠<=bi) — an edge of ...	For each second type query print the reply in a single line.	[ "5 4\n1 2\n2 3\n2 4\n4 5\n2 1\n2 5\n1 2\n2 5\n" ]	[ "0\n3\n2\n" ]	none	2,500	[ { "input": "5 4\n1 2\n2 3\n2 4\n4 5\n2 1\n2 5\n1 2\n2 5", "output": "0\n3\n2" } ]	1,615,609,145	2,147,483,647	PyPy 3	OK	TESTS	23	997	27,648,000	class CentroidDecomposition(): def __init__(self, g): self.g = g self.n = len(g) self.parent = [-1]self.n self.size = [1]self.n self.cdparent = [-1]self.n self.cddepth = [0]self.n self.cdorder = [-1]self.n self.cdused = [0]self.n ...	Title: Xenia and Tree Time Limit: None seconds Memory Limit: None megabytes Problem Description: Xenia the programmer has a tree consisting of n nodes. We will consider the tree nodes indexed from 1 to n. We will also consider the first node to be initially painted red, and the other nodes — to be painted blue. ...	```python class CentroidDecomposition(): def __init__(self, g): self.g = g self.n = len(g) self.parent = [-1]self.n self.size = [1]self.n self.cdparent = [-1]self.n self.cddepth = [0]self.n self.cdorder = [-1]self.n self.cdused = [0]se...	3
298	A	Snow Footprints	PROGRAMMING	1,300	[ "greedy", "implementation" ]		null	null	There is a straight snowy road, divided into n blocks. The blocks are numbered from 1 to n from left to right. If one moves from the i-th block to the (i<=+<=1)-th block, he will leave a right footprint on the i-th block. Similarly, if one moves from the i-th block to the (i<=-<=1)-th block, he will leave...	The first line of the input contains integer n (3<=≤<=n<=≤<=1000). The second line contains the description of the road — the string that consists of n characters. Each character will be either "." (a block without footprint), or "L" (a block with a left footprint), "R" (a block with a right footprint). It's gu...	Print two space-separated integers — the values of s and t. If there are several possible solutions you can print any of them.	[ "9\n..RRLL...\n", "11\n.RRRLLLLL..\n" ]	[ "3 4\n", "7 5\n" ]	The first test sample is the one in the picture.	500	[ { "input": "11\n.RRRLLLLL..", "output": "7 5" }, { "input": "4\n.RL.", "output": "3 2" }, { "input": "3\n.L.", "output": "2 1" }, { "input": "3\n.R.", "output": "2 3" } ]	1,690,369,287	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	60	0	n = int(input()) foorprint = input() s = 0 e = 0 for i in range(n): s += 1 if(foorprint[i] == "R"): break e = s for i in range(s, n): e += 1 if(foorprint[i] == "L"): e -= 1 break print(s,e)	Title: Snow Footprints Time Limit: None seconds Memory Limit: None megabytes Problem Description: There is a straight snowy road, divided into n blocks. The blocks are numbered from 1 to n from left to right. If one moves from the i-th block to the (i<=+<=1)-th block, he will leave a right footprint on the *...	```python n = int(input()) foorprint = input() s = 0 e = 0 for i in range(n): s += 1 if(foorprint[i] == "R"): break e = s for i in range(s, n): e += 1 if(foorprint[i] == "L"): e -= 1 break print(s,e) ```	0
32	B	Borze	PROGRAMMING	800	[ "expression parsing", "implementation" ]	B. Borze	2	256	Ternary numeric notation is quite popular in Berland. To telegraph the ternary number the Borze alphabet is used. Digit 0 is transmitted as «.», 1 as «-.» and 2 as «--». You are to decode the Borze code, i.e. to find out the ternary number given its representation in Borze alphabet.	The first line contains a number in Borze code. The length of the string is between 1 and 200 characters. It's guaranteed that the given string is a valid Borze code of some ternary number (this number can have leading zeroes).	Output the decoded ternary number. It can have leading zeroes.	[ ".-.--\n", "--.\n", "-..-.--\n" ]	[ "012", "20", "1012" ]	none	1,000	[ { "input": ".-.--", "output": "012" }, { "input": "--.", "output": "20" }, { "input": "-..-.--", "output": "1012" }, { "input": "---..", "output": "210" }, { "input": "..--.---..", "output": "0020210" }, { "input": "-.....----.", "output": "1000022...	1,586,006,762	2,147,483,647	Python 3	OK	TESTS	30	248	307,200	t = "" one = '-.' two = '--' zero = '.' temp = "" exp = input().strip() lenth = len(exp) i = 0 while(i<lenth): temp = "" temp += exp[i] if(temp=="-"): i += 1 temp += exp[i] if(temp==one): t += '1' else: t += '2' else: if(temp==zero): t += '0' i += 1 print(t)	Title: Borze Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Ternary numeric notation is quite popular in Berland. To telegraph the ternary number the Borze alphabet is used. Digit 0 is transmitted as «.», 1 as «-.» and 2 as «--». You are to decode the Borze code, i.e. to find out the ternary ...	```python t = "" one = '-.' two = '--' zero = '.' temp = "" exp = input().strip() lenth = len(exp) i = 0 while(i<lenth): temp = "" temp += exp[i] if(temp=="-"): i += 1 temp += exp[i] if(temp==one): t += '1' else: t += '2' else: if(temp==zero): t += '0' i += 1 print(t) ```	3.937428
591	A	Wizards' Duel	PROGRAMMING	900	[ "implementation", "math" ]		null	null	Harry Potter and He-Who-Must-Not-Be-Named engaged in a fight to the death once again. This time they are located at opposite ends of the corridor of length l. Two opponents simultaneously charge a deadly spell in the enemy. We know that the impulse of Harry's magic spell flies at a speed of p meters per second, and...	The first line of the input contains a single integer l (1<=≤<=l<=≤<=1<=000) — the length of the corridor where the fight takes place. The second line contains integer p, the third line contains integer q (1<=≤<=p,<=q<=≤<=500) — the speeds of magical impulses for Harry Potter and He-Who-Must-Not-Be-Named, ...	Print a single real number — the distance from the end of the corridor, where Harry is located, to the place of the second meeting of the spell impulses. Your answer will be considered correct if its absolute or relative error will not exceed 10<=-<=4. Namely: let's assume that your answer equals a, and the answer ...	[ "100\n50\n50\n", "199\n60\n40\n" ]	[ "50\n", "119.4\n" ]	In the first sample the speeds of the impulses are equal, so both of their meetings occur exactly in the middle of the corridor.	500	[ { "input": "100\n50\n50", "output": "50" }, { "input": "199\n60\n40", "output": "119.4" }, { "input": "1\n1\n1", "output": "0.5" }, { "input": "1\n1\n500", "output": "0.001996007984" }, { "input": "1\n500\n1", "output": "0.998003992" }, { "input": "1\n...	1,594,500,760	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	93	6,656,000	a=int(input()) b=int(input()) c=int(input()) print((b*a)//(b+c))	Title: Wizards' Duel Time Limit: None seconds Memory Limit: None megabytes Problem Description: Harry Potter and He-Who-Must-Not-Be-Named engaged in a fight to the death once again. This time they are located at opposite ends of the corridor of length l. Two opponents simultaneously charge a deadly spell in the en...	```python a=int(input()) b=int(input()) c=int(input()) print((b*a)//(b+c)) ```	0
59	A	Word	PROGRAMMING	800	[ "implementation", "strings" ]	A. Word	2	256	Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At th...	The first line contains a word s — it consists of uppercase and lowercase Latin letters and possesses the length from 1 to 100.	Print the corrected word s. If the given word s has strictly more uppercase letters, make the word written in the uppercase register, otherwise - in the lowercase one.	[ "HoUse\n", "ViP\n", "maTRIx\n" ]	[ "house\n", "VIP\n", "matrix\n" ]	none	500	[ { "input": "HoUse", "output": "house" }, { "input": "ViP", "output": "VIP" }, { "input": "maTRIx", "output": "matrix" }, { "input": "BNHWpnpawg", "output": "bnhwpnpawg" }, { "input": "VTYGP", "output": "VTYGP" }, { "input": "CHNenu", "output": "chn...	1,642,598,901	2,147,483,647	Python 3	COMPILATION_ERROR	TESTS	0	0	0	h=input() u,l=0,0 for i in h: if i.isupper(): u=u+1 else: l=l+1 if u<=l: print(lower(h)) else: print(upper(h)))	Title: Word Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it ei...	```python h=input() u,l=0,0 for i in h: if i.isupper(): u=u+1 else: l=l+1 if u<=l: print(lower(h)) else: print(upper(h))) ```	-1
676	A	Nicholas and Permutation	PROGRAMMING	800	[ "constructive algorithms", "implementation" ]		null	null	Nicholas has an array a that contains n distinct integers from 1 to n. In other words, Nicholas has a permutation of size n. Nicholas want the minimum element (integer 1) and the maximum element (integer n) to be as far as possible from each other. He wants to perform exactly one swap in order to maximize th...	The first line of the input contains a single integer n (2<=≤<=n<=≤<=100) — the size of the permutation. The second line of the input contains n distinct integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=n), where ai is equal to the element at the i-th position.	Print a single integer — the maximum possible distance between the minimum and the maximum elements Nicholas can achieve by performing exactly one swap.	[ "5\n4 5 1 3 2\n", "7\n1 6 5 3 4 7 2\n", "6\n6 5 4 3 2 1\n" ]	[ "3\n", "6\n", "5\n" ]	In the first sample, one may obtain the optimal answer by swapping elements 1 and 2. In the second sample, the minimum and the maximum elements will be located in the opposite ends of the array if we swap 7 and 2. In the third sample, the distance between the minimum and the maximum elements is already maximum possib...	500	[ { "input": "5\n4 5 1 3 2", "output": "3" }, { "input": "7\n1 6 5 3 4 7 2", "output": "6" }, { "input": "6\n6 5 4 3 2 1", "output": "5" }, { "input": "2\n1 2", "output": "1" }, { "input": "2\n2 1", "output": "1" }, { "input": "3\n2 3 1", "output": "...	1,594,972,873	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	5	93	6,656,000	arr_size = int(input()) array = list(map(int, input().split())) min_index = array.index(min(array)) max_index = array.index(max(array)) farest, nearest = max(min_index, max_index), min(min_index, max_index) farest = arr_size - 1 print(farest - nearest) """ max_distance = max(min_to_start, min_to_end, max_to_star...	Title: Nicholas and Permutation Time Limit: None seconds Memory Limit: None megabytes Problem Description: Nicholas has an array a that contains n distinct integers from 1 to n. In other words, Nicholas has a permutation of size n. Nicholas want the minimum element (integer 1) and the maximum element (integ...	```python arr_size = int(input()) array = list(map(int, input().split())) min_index = array.index(min(array)) max_index = array.index(max(array)) farest, nearest = max(min_index, max_index), min(min_index, max_index) farest = arr_size - 1 print(farest - nearest) """ max_distance = max(min_to_start, min_to_end, m...	0
797	A	k-Factorization	PROGRAMMING	1,100	[ "implementation", "math", "number theory" ]		null	null	Given a positive integer n, find k integers (not necessary distinct) such that all these integers are strictly greater than 1, and their product is equal to n.	The first line contains two integers n and k (2<=≤<=n<=≤<=100000, 1<=≤<=k<=≤<=20).	If it's impossible to find the representation of n as a product of k numbers, print -1. Otherwise, print k integers in any order. Their product must be equal to n. If there are multiple answers, print any of them.	[ "100000 2\n", "100000 20\n", "1024 5\n" ]	[ "2 50000 \n", "-1\n", "2 64 2 2 2 \n" ]	none	0	[ { "input": "100000 2", "output": "2 50000 " }, { "input": "100000 20", "output": "-1" }, { "input": "1024 5", "output": "2 64 2 2 2 " }, { "input": "100000 10", "output": "2 2 2 2 2 5 5 5 5 5 " }, { "input": "99999 3", "output": "3 813 41 " }, { "input...	1,657,530,871	2,147,483,647	PyPy 3	OK	TESTS	166	93	1,228,800	n,k = map(int, input().split()) l = [] for i in range(2, n + 1): if n % i == 0: while n % i == 0 and len(l) < (k - 1): n //= i l.append(i) if n > 1: l.append(n) if len(l) == k: print(*l) else: print(-1) # Mon Jul 11 2022 09:14:29 GMT+0000 (Coordinated Universal Time)	Title: k-Factorization Time Limit: None seconds Memory Limit: None megabytes Problem Description: Given a positive integer n, find k integers (not necessary distinct) such that all these integers are strictly greater than 1, and their product is equal to n. Input Specification: The first line contains two int...	```python n,k = map(int, input().split()) l = [] for i in range(2, n + 1): if n % i == 0: while n % i == 0 and len(l) < (k - 1): n //= i l.append(i) if n > 1: l.append(n) if len(l) == k: print(*l) else: print(-1) # Mon Jul 11 2022 09:14:29 GMT+0000 (Coordinated Universal Time) ```	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,585,054,953	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	2	124	0	n,k=map(int,input().split()) s=input() for i in range(k): l,r,x,y=input().split() l=int(l) r=int(r) for i in range(l-1,r): if(s[i]==x): s=s.replace(s[i],y,1) print(s)	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 n,k=map(int,input().split()) s=input() for i in range(k): l,r,x,y=input().split() l=int(l) r=int(r) for i in range(l-1,r): if(s[i]==x): s=s.replace(s[i],y,1) print(s) ```	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,672,840,156	2,147,483,647	PyPy 3-64	MEMORY_LIMIT_EXCEEDED	TESTS	4	1,029	268,390,400	import itertools import math import sys input = sys.stdin.readline n, k = map(int, input().split()) data = sorted(map(lambda x: ord(x) - 96, input().rstrip())) memo = sorted(itertools.combinations(data, k), key=lambda x: sum(x)) ans = math.inf for i in range(len(memo)): tmp = True for j in range...	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 import itertools import math import sys input = sys.stdin.readline n, k = map(int, input().split()) data = sorted(map(lambda x: ord(x) - 96, input().rstrip())) memo = sorted(itertools.combinations(data, k), key=lambda x: sum(x)) ans = math.inf for i in range(len(memo)): tmp = True for ...	0
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,629,900,192	2,147,483,647	Python 3	OK	TESTS	87	139	15,360,000	n = int(input()) a = [int(i) for i in input().split()] nch = [] sum1 = 0 for i in a: if i%2 == 0: sum1 += i else: nch.append(i) if len(nch)%2 == 1: nch.remove(min(nch)) for i in nch: sum1 += i print(sum1)	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 n = int(input()) a = [int(i) for i in input().split()] nch = [] sum1 = 0 for i in a: if i%2 == 0: sum1 += i else: nch.append(i) if len(nch)%2 == 1: nch.remove(min(nch)) for i in nch: sum1 += i print(sum1) ```	3
765	A	Neverending competitions	PROGRAMMING	900	[ "implementation", "math" ]		null	null	There are literally dozens of snooker competitions held each year, and team Jinotega tries to attend them all (for some reason they prefer name "snookah")! When a competition takes place somewhere far from their hometown, Ivan, Artsem and Konstantin take a flight to the contest and back. Jinotega's best friends, team ...	In the first line of input there is a single integer n: the number of Jinotega's flights (1<=≤<=n<=≤<=100). In the second line there is a string of 3 capital Latin letters: the name of Jinotega's home airport. In the next n lines there is flight information, one flight per line, in form "XXX->YYY", where "XXX"...	If Jinotega is now at home, print "home" (without quotes), otherwise print "contest".	[ "4\nSVO\nSVO->CDG\nLHR->SVO\nSVO->LHR\nCDG->SVO\n", "3\nSVO\nSVO->HKT\nHKT->SVO\nSVO->RAP\n" ]	[ "home\n", "contest\n" ]	In the first sample Jinotega might first fly from SVO to CDG and back, and then from SVO to LHR and back, so now they should be at home. In the second sample Jinotega must now be at RAP because a flight from RAP back to SVO is not on the list.	500	[ { "input": "4\nSVO\nSVO->CDG\nLHR->SVO\nSVO->LHR\nCDG->SVO", "output": "home" }, { "input": "3\nSVO\nSVO->HKT\nHKT->SVO\nSVO->RAP", "output": "contest" }, { "input": "1\nESJ\nESJ->TSJ", "output": "contest" }, { "input": "2\nXMR\nFAJ->XMR\nXMR->FAJ", "output": "home" }, ...	1,584,364,992	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	1	140	0	x=int(input()) for i in range(x+1): y=input() print(['home','conrest'][x%2])	Title: Neverending competitions Time Limit: None seconds Memory Limit: None megabytes Problem Description: There are literally dozens of snooker competitions held each year, and team Jinotega tries to attend them all (for some reason they prefer name "snookah")! When a competition takes place somewhere far from thei...	```python x=int(input()) for i in range(x+1): y=input() print(['home','conrest'][x%2]) ```	0
624	B	Making a String	PROGRAMMING	1,100	[ "greedy", "sortings" ]		null	null	You are given an alphabet consisting of n letters, your task is to make a string of the maximum possible length so that the following conditions are satisfied: - the i-th letter occurs in the string no more than ai times; - the number of occurrences of each letter in the string must be distinct for all the ...	The first line of the input contains a single integer n (2<=<=≤<=<=n<=<=≤<=<=26) — the number of letters in the alphabet. The next line contains n integers ai (1<=≤<=ai<=≤<=109) — i-th of these integers gives the limitation on the number of occurrences of the i-th character in the string.	Print a single integer — the maximum length of the string that meets all the requirements.	[ "3\n2 5 5\n", "3\n1 1 2\n" ]	[ "11\n", "3\n" ]	For convenience let's consider an alphabet consisting of three letters: "a", "b", "c". In the first sample, some of the optimal strings are: "cccaabbccbb", "aabcbcbcbcb". In the second sample some of the optimal strings are: "acc", "cbc".	1,000	[ { "input": "3\n2 5 5", "output": "11" }, { "input": "3\n1 1 2", "output": "3" }, { "input": "2\n1 1", "output": "1" }, { "input": "3\n1 1000000000 2", "output": "1000000003" }, { "input": "26\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 10000...	1,521,381,255	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	4	77	7,065,600	n=int(input()) a=sorted(list(map(int,input().split()))) su=a[0];m=a[0] for i in range(1,n): if a[i]==m: if m>0: su+=(m-1);m-=1 else: su+=a[i];m=a[i] print(su)	Title: Making a String Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given an alphabet consisting of n letters, your task is to make a string of the maximum possible length so that the following conditions are satisfied: - the i-th letter occurs in the string no more than ...	```python n=int(input()) a=sorted(list(map(int,input().split()))) su=a[0];m=a[0] for i in range(1,n): if a[i]==m: if m>0: su+=(m-1);m-=1 else: su+=a[i];m=a[i] print(su) ```	0
812	C	Sagheer and Nubian Market	PROGRAMMING	1,500	[ "binary search", "sortings" ]		null	null	On his trip to Luxor and Aswan, Sagheer went to a Nubian market to buy some souvenirs for his friends and relatives. The market has some strange rules. It contains n different items numbered from 1 to n. The i-th item has base cost ai Egyptian pounds. If Sagheer buys k items with indices x1,<=x2,<=...,<...	The first line contains two integers n and S (1<=≤<=n<=≤<=105 and 1<=≤<=S<=≤<=109) — the number of souvenirs in the market and Sagheer's budget. The second line contains n space-separated integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=105) — the base costs of the souvenirs.	On a single line, print two integers k, T — the maximum number of souvenirs Sagheer can buy and the minimum total cost to buy these k souvenirs.	[ "3 11\n2 3 5\n", "4 100\n1 2 5 6\n", "1 7\n7\n" ]	[ "2 11\n", "4 54\n", "0 0\n" ]	In the first example, he cannot take the three items because they will cost him [5, 9, 14] with total cost 28. If he decides to take only two items, then the costs will be [4, 7, 11]. So he can afford the first and second items. In the second example, he can buy all items as they will cost him [5, 10, 17, 22]. In the...	1,500	[ { "input": "3 11\n2 3 5", "output": "2 11" }, { "input": "4 100\n1 2 5 6", "output": "4 54" }, { "input": "1 7\n7", "output": "0 0" }, { "input": "1 7\n5", "output": "1 6" }, { "input": "1 1\n1", "output": "0 0" }, { "input": "4 33\n4 3 2 1", "outp...	1,500,650,880	2,147,483,647	Python 3	OK	TESTS	57	1,075	11,878,400	n, s = map(int, input().split()) A = list(map(int, input().split())) l = 0 r = n+1 while r-l > 1: m = l+(r-l)//2 B = A.copy() for j in range(n): B[j] = A[j]+((j+1)*m) B.sort() if sum(B[:m]) > s: r = m else: l = m B = A.copy() for j in range(n): B[j] = ...	Title: Sagheer and Nubian Market Time Limit: None seconds Memory Limit: None megabytes Problem Description: On his trip to Luxor and Aswan, Sagheer went to a Nubian market to buy some souvenirs for his friends and relatives. The market has some strange rules. It contains n different items numbered from 1 to n. T...	```python n, s = map(int, input().split()) A = list(map(int, input().split())) l = 0 r = n+1 while r-l > 1: m = l+(r-l)//2 B = A.copy() for j in range(n): B[j] = A[j]+((j+1)*m) B.sort() if sum(B[:m]) > s: r = m else: l = m B = A.copy() for j in range(n): ...	3
471	A	MUH and Sticks	PROGRAMMING	1,100	[ "implementation" ]		null	null	Two polar bears Menshykov and Uslada from the St.Petersburg zoo and elephant Horace from the Kiev zoo got six sticks to play with and assess the animals' creativity. Menshykov, Uslada and Horace decided to make either an elephant or a bear from those sticks. They can make an animal from sticks in the following way: -...	The single line contains six space-separated integers li (1<=≤<=li<=≤<=9) — the lengths of the six sticks. It is guaranteed that the input is such that you cannot make both animals from the sticks.	If you can make a bear from the given set, print string "Bear" (without the quotes). If you can make an elephant, print string "Elephant" (wıthout the quotes). If you can make neither a bear nor an elephant, print string "Alien" (without the quotes).	[ "4 2 5 4 4 4\n", "4 4 5 4 4 5\n", "1 2 3 4 5 6\n" ]	[ "Bear", "Elephant", "Alien" ]	If you're out of creative ideas, see instructions below which show how to make a bear and an elephant in the first two samples. The stick of length 2 is in red, the sticks of length 4 are in green, the sticks of length 5 are in blue.	500	[ { "input": "4 2 5 4 4 4", "output": "Bear" }, { "input": "4 4 5 4 4 5", "output": "Elephant" }, { "input": "1 2 3 4 5 6", "output": "Alien" }, { "input": "5 5 5 5 5 5", "output": "Elephant" }, { "input": "1 1 1 2 3 5", "output": "Alien" }, { "input": "...	1,411,745,987	587	Python 3	OK	TESTS	29	62	0	l = list(map(int, input().split())) ok=True for i in range(6): if l.count(l[i])>=4: ok = False f=l[i] if ok: print("Alien") else: for i in range(4): l.pop(l.index(f)) print(["Bear", "Elephant"][l[0]==l[1]])	Title: MUH and Sticks Time Limit: None seconds Memory Limit: None megabytes Problem Description: Two polar bears Menshykov and Uslada from the St.Petersburg zoo and elephant Horace from the Kiev zoo got six sticks to play with and assess the animals' creativity. Menshykov, Uslada and Horace decided to make either an...	```python l = list(map(int, input().split())) ok=True for i in range(6): if l.count(l[i])>=4: ok = False f=l[i] if ok: print("Alien") else: for i in range(4): l.pop(l.index(f)) print(["Bear", "Elephant"][l[0]==l[1]]) ```	3
994	B	Knights of a Polygonal Table	PROGRAMMING	1,400	[ "greedy", "implementation", "sortings" ]		null	null	Unlike Knights of a Round Table, Knights of a Polygonal Table deprived of nobility and happy to kill each other. But each knight has some power and a knight can kill another knight if and only if his power is greater than the power of victim. However, even such a knight will torment his conscience, so he can kill no mo...	The first line contains two integers $n$ and $k$ $(1 \le n \le 10^5, 0 \le k \le \min(n-1,10))$ — the number of knights and the number $k$ from the statement. The second line contains $n$ integers $p_1, p_2 ,\ldots,p_n$ $(1 \le p_i \le 10^9)$ — powers of the knights. All $p_i$ are distinct. The third line contains $n...	Print $n$ integers — the maximum number of coins each knight can have it only he kills other knights.	[ "4 2\n4 5 9 7\n1 2 11 33\n", "5 1\n1 2 3 4 5\n1 2 3 4 5\n", "1 0\n2\n3\n" ]	[ "1 3 46 36 ", "1 3 5 7 9 ", "3 " ]	Consider the first example. - The first knight is the weakest, so he can't kill anyone. That leaves him with the only coin he initially has. - The second knight can kill the first knight and add his coin to his own two. - The third knight is the strongest, but he can't kill more than $k = 2$ other knights. It is o...	1,000	[ { "input": "4 2\n4 5 9 7\n1 2 11 33", "output": "1 3 46 36 " }, { "input": "5 1\n1 2 3 4 5\n1 2 3 4 5", "output": "1 3 5 7 9 " }, { "input": "1 0\n2\n3", "output": "3 " }, { "input": "7 1\n2 3 4 5 7 8 9\n0 3 7 9 5 8 9", "output": "0 3 10 16 14 17 18 " }, { "input"...	1,529,173,486	6,586	Python 3	WRONG_ANSWER	PRETESTS	3	78	0	n, k = map(int,input().split()) answer = [0]*n power = [int(x) for x in input().split()] coins = [int(x) for x in input().split()] # power = [2] # coins = [3] # power = [4, 5, 9, 7] # coins = [1, 2, 11, 33] zipper = list(zip(power,coins)) zipper.sort(key = lambda x: x[0]) sort_power = [x[0] for ...	Title: Knights of a Polygonal Table Time Limit: None seconds Memory Limit: None megabytes Problem Description: Unlike Knights of a Round Table, Knights of a Polygonal Table deprived of nobility and happy to kill each other. But each knight has some power and a knight can kill another knight if and only if his power ...	```python n, k = map(int,input().split()) answer = [0]*n power = [int(x) for x in input().split()] coins = [int(x) for x in input().split()] # power = [2] # coins = [3] # power = [4, 5, 9, 7] # coins = [1, 2, 11, 33] zipper = list(zip(power,coins)) zipper.sort(key = lambda x: x[0]) sort_power = ...	0
199	A	Hexadecimal's theorem	PROGRAMMING	900	[ "brute force", "constructive algorithms", "implementation", "number theory" ]		null	null	Recently, a chaotic virus Hexadecimal advanced a new theorem which will shake the Universe. She thinks that each Fibonacci number can be represented as sum of three not necessary different Fibonacci numbers. Let's remember how Fibonacci numbers can be calculated. F0<==<=0, F1<==<=1, and all the next numbers are *F...	The input contains of a single integer n (0<=≤<=n<=<<=109) — the number that should be represented by the rules described above. It is guaranteed that n is a Fibonacci number.	Output three required numbers: a, b and c. If there is no answer for the test you have to print "I'm too stupid to solve this problem" without the quotes. If there are multiple answers, print any of them.	[ "3\n", "13\n" ]	[ "1 1 1\n", "2 3 8\n" ]	none	500	[ { "input": "3", "output": "1 1 1" }, { "input": "13", "output": "2 3 8" }, { "input": "0", "output": "0 0 0" }, { "input": "1", "output": "1 0 0" }, { "input": "2", "output": "1 1 0" }, { "input": "1597", "output": "233 377 987" }, { "input...	1,686,889,661	2,147,483,647	PyPy 3-64	OK	TESTS	54	124	0	n = input() print("0 0 " + n)	Title: Hexadecimal's theorem Time Limit: None seconds Memory Limit: None megabytes Problem Description: Recently, a chaotic virus Hexadecimal advanced a new theorem which will shake the Universe. She thinks that each Fibonacci number can be represented as sum of three not necessary different Fibonacci numbers. Let'...	```python n = input() print("0 0 " + n) ```	3
740	B	Alyona and flowers	PROGRAMMING	1,200	[ "constructive algorithms" ]		null	null	Little Alyona is celebrating Happy Birthday! Her mother has an array of n flowers. Each flower has some mood, the mood of i-th flower is ai. The mood can be positive, zero or negative. Let's define a subarray as a segment of consecutive flowers. The mother suggested some set of subarrays. Alyona wants to choos...	The first line contains two integers n and m (1<=≤<=n,<=m<=≤<=100) — the number of flowers and the number of subarrays suggested by the mother. The second line contains the flowers moods — n integers a1,<=a2,<=...,<=an (<=-<=100<=≤<=ai<=≤<=100). The next m lines contain the description of the ...	Print single integer — the maximum possible value added to the Alyona's happiness.	[ "5 4\n1 -2 1 3 -4\n1 2\n4 5\n3 4\n1 4\n", "4 3\n1 2 3 4\n1 3\n2 4\n1 1\n", "2 2\n-1 -2\n1 1\n1 2\n" ]	[ "7\n", "16\n", "0\n" ]	The first example is the situation described in the statements. In the second example Alyona should choose all subarrays. The third example has answer 0 because Alyona can choose none of the subarrays.	1,000	[ { "input": "5 4\n1 -2 1 3 -4\n1 2\n4 5\n3 4\n1 4", "output": "7" }, { "input": "4 3\n1 2 3 4\n1 3\n2 4\n1 1", "output": "16" }, { "input": "2 2\n-1 -2\n1 1\n1 2", "output": "0" }, { "input": "5 6\n1 1 1 -1 0\n2 4\n1 3\n4 5\n1 5\n1 4\n4 5", "output": "8" }, { "inpu...	1,617,412,184	2,147,483,647	Python 3	OK	TESTS	53	77	307,200	n,q=map(int,input().split()) a=list(map(int,input().split())) b=[a[0]] for i in range(1,n): b.append(b[i-1]+a[i]) ans=0 for i in range(q): x,y=map(int,input().split()) temp=b[y-1] if x!=1: temp-=b[x-2] ans=max(ans,ans+temp) print(ans)	Title: Alyona and flowers Time Limit: None seconds Memory Limit: None megabytes Problem Description: Little Alyona is celebrating Happy Birthday! Her mother has an array of n flowers. Each flower has some mood, the mood of i-th flower is ai. The mood can be positive, zero or negative. Let's define a subarra...	```python n,q=map(int,input().split()) a=list(map(int,input().split())) b=[a[0]] for i in range(1,n): b.append(b[i-1]+a[i]) ans=0 for i in range(q): x,y=map(int,input().split()) temp=b[y-1] if x!=1: temp-=b[x-2] ans=max(ans,ans+temp) print(ans) ```	3
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,642,650,003	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	1	15	512,000	import math def factorial(n): if n == 1 or n == 0: return 1 else: return n*factorial(n-1) a,b = input().split() a = int(a) b = int(b) x = factorial(a) y = factorial(b) print(math.gcd(x,y))	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 def factorial(n): if n == 1 or n == 0: return 1 else: return n*factorial(n-1) a,b = input().split() a = int(a) b = int(b) x = factorial(a) y = factorial(b) print(math.gcd(x,y)) ```	-1
25	A	IQ test	PROGRAMMING	1,300	[ "brute force" ]	A. IQ test	2	256	Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given n numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given n numbers finds one that i...	The first line contains integer n (3<=≤<=n<=≤<=100) — amount of numbers in the task. The second line contains n space-separated natural numbers, not exceeding 100. It is guaranteed, that exactly one of these numbers differs from the others in evenness.	Output index of number that differs from the others in evenness. Numbers are numbered from 1 in the input order.	[ "5\n2 4 7 8 10\n", "4\n1 2 1 1\n" ]	[ "3\n", "2\n" ]	none	0	[ { "input": "5\n2 4 7 8 10", "output": "3" }, { "input": "4\n1 2 1 1", "output": "2" }, { "input": "3\n1 2 2", "output": "1" }, { "input": "3\n100 99 100", "output": "2" }, { "input": "3\n5 3 2", "output": "3" }, { "input": "4\n43 28 1 91", "output"...	1,634,026,837	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	62	0	n=int(input()) nums=list(map(int,input().split())) a=0 b=0 for i in range(0,3): if nums[i]%2==0: a+=1 else: b+=1 if a>1: for i in range(0,n): if nums[i]%2!=0: print(nums.index(nums[i])-1) elif b>1: for i in range(0,n): if nums[i]%2==0: ...	Title: IQ test Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given n numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — t...	```python n=int(input()) nums=list(map(int,input().split())) a=0 b=0 for i in range(0,3): if nums[i]%2==0: a+=1 else: b+=1 if a>1: for i in range(0,n): if nums[i]%2!=0: print(nums.index(nums[i])-1) elif b>1: for i in range(0,n): if nums[i]%2==0:...	0
598	A	Tricky Sum	PROGRAMMING	900	[ "math" ]		null	null	In this problem you are to calculate the sum of all integers from 1 to n, but you should take all powers of two with minus in the sum. For example, for n<==<=4 the sum is equal to <=-<=1<=-<=2<=+<=3<=-<=4<==<=<=-<=4, because 1, 2 and 4 are 20, 21 and 22 respectively. Calculate the answer for t values of n.	The first line of the input contains a single integer t (1<=≤<=t<=≤<=100) — the number of values of n to be processed. Each of next t lines contains a single integer n (1<=≤<=n<=≤<=109).	Print the requested sum for each of t integers n given in the input.	[ "2\n4\n1000000000\n" ]	[ "-4\n499999998352516354\n" ]	The answer for the first sample is explained in the statement.	0	[ { "input": "2\n4\n1000000000", "output": "-4\n499999998352516354" }, { "input": "10\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10", "output": "-1\n-3\n0\n-4\n1\n7\n14\n6\n15\n25" }, { "input": "10\n10\n9\n47\n33\n99\n83\n62\n1\n100\n53", "output": "25\n15\n1002\n435\n4696\n3232\n1827\n-1\n4796\n130...	1,692,729,522	2,147,483,647	Python 3	OK	TESTS	21	46	0	from math import log for i in range(int(input())): n=int(input()) x=int(log(n,2)) s=(1<<(x+1)) s-=1 s=2 sum=((n(n+1))//2)-s print(sum)	Title: Tricky Sum Time Limit: None seconds Memory Limit: None megabytes Problem Description: In this problem you are to calculate the sum of all integers from 1 to n, but you should take all powers of two with minus in the sum. For example, for n<==<=4 the sum is equal to <=-<=1<=-<=2<=+<=3<=-<=4<==<=<=-<=4, be...	```python from math import log for i in range(int(input())): n=int(input()) x=int(log(n,2)) s=(1<<(x+1)) s-=1 s=2 sum=((n(n+1))//2)-s print(sum) ```	3
348	A	Mafia	PROGRAMMING	1,600	[ "binary search", "math", "sortings" ]		null	null	One day n friends gathered together to play "Mafia". During each round of the game some player must be the supervisor and other n<=-<=1 people take part in the game. For each person we know in how many rounds he wants to be a player, not the supervisor: the i-th person wants to play ai rounds. What is the min...	The first line contains integer n (3<=≤<=n<=≤<=105). The second line contains n space-separated integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=109) — the i-th number in the list is the number of rounds the i-th person wants to play.	In a single line print a single integer — the minimum number of game rounds the friends need to let the i-th person play at least ai rounds. Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.	[ "3\n3 2 2\n", "4\n2 2 2 2\n" ]	[ "4\n", "3\n" ]	You don't need to know the rules of "Mafia" to solve this problem. If you're curious, it's a game Russia got from the Soviet times: http://en.wikipedia.org/wiki/Mafia_(party_game).	500	[ { "input": "3\n3 2 2", "output": "4" }, { "input": "4\n2 2 2 2", "output": "3" }, { "input": "7\n9 7 7 8 8 7 8", "output": "9" }, { "input": "10\n13 12 10 13 13 14 10 10 12 12", "output": "14" }, { "input": "10\n94 96 91 95 99 94 96 92 95 99", "output": "106" ...	1,558,520,597	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	186	0	t=int(input()) k=list(map(int, input().split())) print(max(k)+1)	Title: Mafia Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day n friends gathered together to play "Mafia". During each round of the game some player must be the supervisor and other n<=-<=1 people take part in the game. For each person we know in how many rounds he wants to be a...	```python t=int(input()) k=list(map(int, input().split())) print(max(k)+1) ```	0
108	A	Palindromic Times	PROGRAMMING	1,000	[ "implementation", "strings" ]	A. Palindromic Times	2	256	Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues. On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on th...	The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.	Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.	[ "12:21\n", "23:59\n" ]	[ "13:31\n", "00:00\n" ]	none	500	[ { "input": "12:21", "output": "13:31" }, { "input": "23:59", "output": "00:00" }, { "input": "15:51", "output": "20:02" }, { "input": "10:44", "output": "11:11" }, { "input": "04:02", "output": "04:40" }, { "input": "02:11", "output": "02:20" }, ...	1,506,844,907	2,147,483,647	Python 3	OK	TESTS	36	124	0	def is_palindromic(string): for i in range(0, int(len(string)/2)): if string[i] != string[len(string)-1-i]: return False return True digits = str(input()) hours = int(digits[0:2]) minutes = int(digits[3:]) while True: minutes += 1 if minutes == 60: hours += 1 ...	Title: Palindromic Times Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues. On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling...	```python def is_palindromic(string): for i in range(0, int(len(string)/2)): if string[i] != string[len(string)-1-i]: return False return True digits = str(input()) hours = int(digits[0:2]) minutes = int(digits[3:]) while True: minutes += 1 if minutes == 60: ho...	3.969
705	A	Hulk	PROGRAMMING	800	[ "implementation" ]		null	null	Dr. Bruce Banner hates his enemies (like others don't). As we all know, he can barely talk when he turns into the incredible Hulk. That's why he asked you to help him to express his feelings. Hulk likes the Inception so much, and like that his feelings are complicated. They have n layers. The first layer is hate, se...	The only line of the input contains a single integer n (1<=≤<=n<=≤<=100) — the number of layers of love and hate.	Print Dr.Banner's feeling in one line.	[ "1\n", "2\n", "3\n" ]	[ "I hate it\n", "I hate that I love it\n", "I hate that I love that I hate it\n" ]	none	500	[ { "input": "1", "output": "I hate it" }, { "input": "2", "output": "I hate that I love it" }, { "input": "3", "output": "I hate that I love that I hate it" }, { "input": "4", "output": "I hate that I love that I hate that I love it" }, { "input": "5", "output"...	1,695,283,455	2,147,483,647	Python 3	OK	TESTS	21	46	0	n = int(input()) a = [] for i in range(n): if i % 2 == 0: a.append("I hate") else: a.append("I love") if i < n - 1: a.append("that") a.append("it") final = ' '.join(a) print(final)	Title: Hulk Time Limit: None seconds Memory Limit: None megabytes Problem Description: Dr. Bruce Banner hates his enemies (like others don't). As we all know, he can barely talk when he turns into the incredible Hulk. That's why he asked you to help him to express his feelings. Hulk likes the Inception so much, and...	```python n = int(input()) a = [] for i in range(n): if i % 2 == 0: a.append("I hate") else: a.append("I love") if i < n - 1: a.append("that") a.append("it") final = ' '.join(a) print(final) ```	3
0	none	none	none	0	[ "none" ]		null	null	Today Pari and Arya are playing a game called Remainders. Pari chooses two positive integer x and k, and tells Arya k but not x. Arya have to find the value . There are n ancient numbers c1,<=c2,<=...,<=cn and Pari has to tell Arya if Arya wants. Given k and the ancient values, tell us if Arya has...	The first line of the input contains two integers n and k (1<=≤<=n,<= k<=≤<=1<=000<=000) — the number of ancient integers and value k that is chosen by Pari. The second line contains n integers c1,<=c2,<=...,<=cn (1<=≤<=ci<=≤<=1<=000<=000).	Print "Yes" (without quotes) if Arya has a winning strategy independent of value of x, or "No" (without quotes) otherwise.	[ "4 5\n2 3 5 12\n", "2 7\n2 3\n" ]	[ "Yes\n", "No\n" ]	In the first sample, Arya can understand <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/d170efffcde0907ee6bcf32de21051bce0677a2c.png" style="max-width: 100.0%;max-height: 100.0%;"/> because 5 is one of the ancient numbers. In the second sample, Arya can't be sure what <img align="middle" ...	0	[ { "input": "4 5\n2 3 5 12", "output": "Yes" }, { "input": "2 7\n2 3", "output": "No" }, { "input": "1 6\n8", "output": "No" }, { "input": "2 3\n9 4", "output": "Yes" }, { "input": "4 16\n19 16 13 9", "output": "Yes" }, { "input": "5 10\n5 16 19 9 17", ...	1,621,803,891	2,147,483,647	PyPy 3	TIME_LIMIT_EXCEEDED	TESTS	4	1,000	2,252,800	def lcm(a,b): x1=max(a,b) x2=min(a,b) bol=True while(bol==True): rem=x1%x2 x1=x2 x2=rem if rem==0: bol=False return int((a*b)/x1) def IAmStupid(): hoba=input() balala=input() n=int(hoba.split()[0]) k=int(hob...	Title: none Time Limit: None seconds Memory Limit: None megabytes Problem Description: Today Pari and Arya are playing a game called Remainders. Pari chooses two positive integer x and k, and tells Arya k but not x. Arya have to find the value . There are n ancient numbers c1,<=c2,<=...,<=cn and P...	```python def lcm(a,b): x1=max(a,b) x2=min(a,b) bol=True while(bol==True): rem=x1%x2 x1=x2 x2=rem if rem==0: bol=False return int((a*b)/x1) def IAmStupid(): hoba=input() balala=input() n=int(hoba.split()[0]) ...	0
884	A	Book Reading	PROGRAMMING	800	[ "implementation" ]		null	null	Recently Luba bought a very interesting book. She knows that it will take t seconds to read the book. Luba wants to finish reading as fast as she can. But she has some work to do in each of n next days. The number of seconds that Luba has to spend working during i-th day is ai. If some free time remains, she...	The first line contains two integers n and t (1<=≤<=n<=≤<=100, 1<=≤<=t<=≤<=106) — the number of days and the time required to read the book. The second line contains n integers ai (0<=≤<=ai<=≤<=86400) — the time Luba has to spend on her work during i-th day.	Print the minimum day Luba can finish reading the book. It is guaranteed that answer doesn't exceed n.	[ "2 2\n86400 86398\n", "2 86400\n0 86400\n" ]	[ "2\n", "1\n" ]	none	0	[ { "input": "2 2\n86400 86398", "output": "2" }, { "input": "2 86400\n0 86400", "output": "1" }, { "input": "2 86400\n1 86399", "output": "2" }, { "input": "100 1000000\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...	1,545,641,826	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	4	109	0	n,m=map(int,input().split()) l=list(map(int,input().split())) ans=0 i=0 while m!=0 and i!=n: m=m-abs(l[i]-86400) i+=1 ans+=1 print(ans)	Title: Book Reading Time Limit: None seconds Memory Limit: None megabytes Problem Description: Recently Luba bought a very interesting book. She knows that it will take t seconds to read the book. Luba wants to finish reading as fast as she can. But she has some work to do in each of n next days. The number of ...	```python n,m=map(int,input().split()) l=list(map(int,input().split())) ans=0 i=0 while m!=0 and i!=n: m=m-abs(l[i]-86400) i+=1 ans+=1 print(ans) ```	0
522	A	Reposts	PROGRAMMING	1,200	[ "*special", "dfs and similar", "dp", "graphs", "trees" ]		null	null	One day Polycarp published a funny picture in a social network making a poll about the color of his handle. Many of his friends started reposting Polycarp's joke to their news feed. Some of them reposted the reposts and so on. These events are given as a sequence of strings "name1 reposted name2", where name1 is the n...	The first line of the input contains integer n (1<=≤<=n<=≤<=200) — the number of reposts. Next follow the reposts in the order they were made. Each of them is written on a single line and looks as "name1 reposted name2". All the names in the input consist of lowercase or uppercase English letters and/or digits and ...	Print a single integer — the maximum length of a repost chain.	[ "5\ntourist reposted Polycarp\nPetr reposted Tourist\nWJMZBMR reposted Petr\nsdya reposted wjmzbmr\nvepifanov reposted sdya\n", "6\nMike reposted Polycarp\nMax reposted Polycarp\nEveryOne reposted Polycarp\n111 reposted Polycarp\nVkCup reposted Polycarp\nCodeforces reposted Polycarp\n", "1\nSoMeStRaNgEgUe repos...	[ "6\n", "2\n", "2\n" ]	none	500	[ { "input": "5\ntourist reposted Polycarp\nPetr reposted Tourist\nWJMZBMR reposted Petr\nsdya reposted wjmzbmr\nvepifanov reposted sdya", "output": "6" }, { "input": "6\nMike reposted Polycarp\nMax reposted Polycarp\nEveryOne reposted Polycarp\n111 reposted Polycarp\nVkCup reposted Polycarp\nCodeforc...	1,445,854,979	10,199	Python 3	OK	TESTS	36	62	0	d={} d['polycarp'], h=1, 1 n = int(input()) for i in range(0, n): a,b,c=input().lower().split() d[a]=d[c]+1 print (max(d.values()))	Title: Reposts Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day Polycarp published a funny picture in a social network making a poll about the color of his handle. Many of his friends started reposting Polycarp's joke to their news feed. Some of them reposted the reposts and so on. ...	```python d={} d['polycarp'], h=1, 1 n = int(input()) for i in range(0, n): a,b,c=input().lower().split() d[a]=d[c]+1 print (max(d.values())) ```	3
584	A	Olesya and Rodion	PROGRAMMING	1,000	[ "math" ]		null	null	Olesya loves numbers consisting of n digits, and Rodion only likes numbers that are divisible by t. Find some number that satisfies both of them. Your task is: given the n and t print an integer strictly larger than zero consisting of n digits that is divisible by t. If such number doesn't exist, print <=-...	The single line contains two numbers, n and t (1<=≤<=n<=≤<=100, 2<=≤<=t<=≤<=10) — the length of the number and the number it should be divisible by.	Print one such positive number without leading zeroes, — the answer to the problem, or <=-<=1, if such number doesn't exist. If there are multiple possible answers, you are allowed to print any of them.	[ "3 2\n" ]	[ "712" ]	none	500	[ { "input": "3 2", "output": "222" }, { "input": "2 2", "output": "22" }, { "input": "4 3", "output": "3333" }, { "input": "5 3", "output": "33333" }, { "input": "10 7", "output": "7777777777" }, { "input": "2 9", "output": "99" }, { "input"...	1,670,955,159	2,147,483,647	Python 3	OK	TESTS	65	62	0	a,b = map(int,input().split()) c = (10*a-1)//bb print([-1,c][c>0])	Title: Olesya and Rodion Time Limit: None seconds Memory Limit: None megabytes Problem Description: Olesya loves numbers consisting of n digits, and Rodion only likes numbers that are divisible by t. Find some number that satisfies both of them. Your task is: given the n and t print an integer strictly larg...	```python a,b = map(int,input().split()) c = (10*a-1)//bb print([-1,c][c>0]) ```	3
32	B	Borze	PROGRAMMING	800	[ "expression parsing", "implementation" ]	B. Borze	2	256	Ternary numeric notation is quite popular in Berland. To telegraph the ternary number the Borze alphabet is used. Digit 0 is transmitted as «.», 1 as «-.» and 2 as «--». You are to decode the Borze code, i.e. to find out the ternary number given its representation in Borze alphabet.	The first line contains a number in Borze code. The length of the string is between 1 and 200 characters. It's guaranteed that the given string is a valid Borze code of some ternary number (this number can have leading zeroes).	Output the decoded ternary number. It can have leading zeroes.	[ ".-.--\n", "--.\n", "-..-.--\n" ]	[ "012", "20", "1012" ]	none	1,000	[ { "input": ".-.--", "output": "012" }, { "input": "--.", "output": "20" }, { "input": "-..-.--", "output": "1012" }, { "input": "---..", "output": "210" }, { "input": "..--.---..", "output": "0020210" }, { "input": "-.....----.", "output": "1000022...	1,611,061,075	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	1	62	0	borze=input() index = 0 while index < len(borze): if borze[index] == '.': print(0, end='') index += 1 if borze[index] == '-' and borze[index+1] == '.': print(1, end='') index += 2 if borze[index] == '-' and borze[index+1] == '-': print(2, end='') in...	Title: Borze Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Ternary numeric notation is quite popular in Berland. To telegraph the ternary number the Borze alphabet is used. Digit 0 is transmitted as «.», 1 as «-.» and 2 as «--». You are to decode the Borze code, i.e. to find out the ternary ...	```python borze=input() index = 0 while index < len(borze): if borze[index] == '.': print(0, end='') index += 1 if borze[index] == '-' and borze[index+1] == '.': print(1, end='') index += 2 if borze[index] == '-' and borze[index+1] == '-': print(2, end='') ...	-1
119	A	Epic Game	PROGRAMMING	800	[ "implementation" ]		null	null	Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number a and Antisimon receives number b. They also have a heap of n stones. The players take turns to make a move and Simon starts. During a move a player should take...	The only string contains space-separated integers a, b and n (1<=≤<=a,<=b,<=n<=≤<=100) — the fixed numbers Simon and Antisimon have received correspondingly and the initial number of stones in the pile.	If Simon wins, print "0" (without the quotes), otherwise print "1" (without the quotes).	[ "3 5 9\n", "1 1 100\n" ]	[ "0", "1" ]	The greatest common divisor of two non-negative integers a and b is such maximum positive integer k, that a is divisible by k without remainder and similarly, b is divisible by k without remainder. Let gcd(a, b) represent the operation of calculating the greatest common divisor of numbers a and *b...	500	[ { "input": "3 5 9", "output": "0" }, { "input": "1 1 100", "output": "1" }, { "input": "23 12 16", "output": "1" }, { "input": "95 26 29", "output": "1" }, { "input": "73 32 99", "output": "1" }, { "input": "1 1 1", "output": "0" }, { "inpu...	1,693,924,089	2,147,483,647	Python 3	OK	TESTS	45	92	0	# t=int(input()) # while t>0: # x,k=input().split(' ') # x=int(x) # k=int(k) # if(k==2): # if(x%2==0): # print(2) # print(1,x-1) # else: # if(x>1): # print(3) # print(1,1,x-2) # else: # ...	Title: Epic Game Time Limit: None seconds Memory Limit: None megabytes Problem Description: Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number a and Antisimon receives number b. They also have a heap of n sto...	```python # t=int(input()) # while t>0: # x,k=input().split(' ') # x=int(x) # k=int(k) # if(k==2): # if(x%2==0): # print(2) # print(1,x-1) # else: # if(x>1): # print(3) # print(1,1,x-2) # else: ...	3
770	A	New Password	PROGRAMMING	800	[ "*special", "implementation" ]		null	null	Innokentiy decides to change the password in the social net "Contact!", but he is too lazy to invent a new password by himself. That is why he needs your help. Innokentiy decides that new password should satisfy the following conditions: - the length of the password must be equal to n, - the password should cons...	The first line contains two positive integers n and k (2<=≤<=n<=≤<=100, 2<=≤<=k<=≤<=min(n,<=26)) — the length of the password and the number of distinct symbols in it. Pay attention that a desired new password always exists.	Print any password which satisfies all conditions given by Innokentiy.	[ "4 3\n", "6 6\n", "5 2\n" ]	[ "java\n", "python\n", "phphp\n" ]	In the first test there is one of the appropriate new passwords — java, because its length is equal to 4 and 3 distinct lowercase letters a, j and v are used in it. In the second test there is one of the appropriate new passwords — python, because its length is equal to 6 and it consists of 6 distinct lowercase letter...	500	[ { "input": "4 3", "output": "abca" }, { "input": "6 6", "output": "abcdef" }, { "input": "5 2", "output": "ababa" }, { "input": "3 2", "output": "aba" }, { "input": "10 2", "output": "ababababab" }, { "input": "26 13", "output": "abcdefghijklmabcde...	1,656,421,117	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	0	92	0	n, k = map(int, input().split()) password = '' while n > 0: i =0 for x in range(0,k): password += chr(ord('a')+i) print(password) i+=1 n-=1 if n<=0: break print(password)	Title: New Password Time Limit: None seconds Memory Limit: None megabytes Problem Description: Innokentiy decides to change the password in the social net "Contact!", but he is too lazy to invent a new password by himself. That is why he needs your help. Innokentiy decides that new password should satisfy the foll...	```python n, k = map(int, input().split()) password = '' while n > 0: i =0 for x in range(0,k): password += chr(ord('a')+i) print(password) i+=1 n-=1 if n<=0: break print(password) ```	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,926,706	2,147,483,647	Python 3	OK	TESTS	25	92	0	matx=[] for _ in range(5): a=list(map(int,input().split())) matx.append(a) for i in range(5): if 1 in matx[i]: c=matx[i].index(1)+1 r=i+1 sum1=abs(3-r)+abs(3-c) print(sum1)	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 matx=[] for _ in range(5): a=list(map(int,input().split())) matx.append(a) for i in range(5): if 1 in matx[i]: c=matx[i].index(1)+1 r=i+1 sum1=abs(3-r)+abs(3-c) print(sum1) ```	3
313	B	Ilya and Queries	PROGRAMMING	1,100	[ "dp", "implementation" ]		null	null	Ilya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam. You've got string s<==<=s1s2... sn (n is the length of the string), consisting only of characters "." and "#" and m queries. Each query is described by a pair of integers li,<...	The first line contains string s of length n (2<=≤<=n<=≤<=105). It is guaranteed that the given string only consists of characters "." and "#". The next line contains integer m (1<=≤<=m<=≤<=105) — the number of queries. Each of the next m lines contains the description of the corresponding query. The i-t...	Print m integers — the answers to the queries in the order in which they are given in the input.	[ "......\n4\n3 4\n2 3\n1 6\n2 6\n", "#..###\n5\n1 3\n5 6\n1 5\n3 6\n3 4\n" ]	[ "1\n1\n5\n4\n", "1\n1\n2\n2\n0\n" ]	none	1,000	[ { "input": "......\n4\n3 4\n2 3\n1 6\n2 6", "output": "1\n1\n5\n4" }, { "input": "#..###\n5\n1 3\n5 6\n1 5\n3 6\n3 4", "output": "1\n1\n2\n2\n0" }, { "input": ".#...#..\n6\n1 5\n2 3\n6 7\n2 4\n2 5\n1 3", "output": "2\n0\n0\n1\n2\n0" }, { "input": "#.#.#..\n5\n3 4\n4 5\n5 7\n5...	1,687,581,955	2,147,483,647	PyPy 3-64	TIME_LIMIT_EXCEEDED	TESTS	9	2,000	3,584,000	a = input() for i in range(int(input())): l,r = map(int,input().split()) c = 0 for i in range(l-1,r-1): if a[i] == a[i+1]: c += 1 print(c)	Title: Ilya and Queries Time Limit: None seconds Memory Limit: None megabytes Problem Description: Ilya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam. You've got string s<==<=s1s2... sn (n is the length of the string), consisting ...	```python a = input() for i in range(int(input())): l,r = map(int,input().split()) c = 0 for i in range(l-1,r-1): if a[i] == a[i+1]: c += 1 print(c) ```	0
714	B	Filya and Homework	PROGRAMMING	1,200	[ "implementation", "sortings" ]		null	null	Today, hedgehog Filya went to school for the very first time! Teacher gave him a homework which Filya was unable to complete without your help. Filya is given an array of non-negative integers a1,<=a2,<=...,<=an. First, he pick an integer x and then he adds x to some elements of the array (no more than onc...	The first line of the input contains an integer n (1<=≤<=n<=≤<=100<=000) — the number of integers in the Filya's array. The second line contains n integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=109) — elements of the array.	If it's impossible to make all elements of the array equal using the process given in the problem statement, then print "NO" (without quotes) in the only line of the output. Otherwise print "YES" (without quotes).	[ "5\n1 3 3 2 1\n", "5\n1 2 3 4 5\n" ]	[ "YES\n", "NO\n" ]	In the first sample Filya should select x = 1, then add it to the first and the last elements of the array and subtract from the second and the third elements.	1,000	[ { "input": "5\n1 3 3 2 1", "output": "YES" }, { "input": "5\n1 2 3 4 5", "output": "NO" }, { "input": "2\n1 2", "output": "YES" }, { "input": "3\n1 2 3", "output": "YES" }, { "input": "3\n1 1 1", "output": "YES" }, { "input": "2\n1 1000000000", "ou...	1,608,011,168	2,147,483,647	PyPy 3	COMPILATION_ERROR	TESTS	0	0	0	n=int(input().split()) l=[int(x) for x in input().split()] d={} for x in l:	Title: Filya and Homework Time Limit: None seconds Memory Limit: None megabytes Problem Description: Today, hedgehog Filya went to school for the very first time! Teacher gave him a homework which Filya was unable to complete without your help. Filya is given an array of non-negative integers a1,<=a2,<=...,<=*a...	```python n=int(input().split()) l=[int(x) for x in input().split()] d={} for x in l: ```	-1
960	A	Check the string	PROGRAMMING	1,200	[ "implementation" ]		null	null	A has a string consisting of some number of lowercase English letters 'a'. He gives it to his friend B who appends some number of letters 'b' to the end of this string. Since both A and B like the characters 'a' and 'b', they have made sure that at this point, at least one 'a' and one 'b' exist in the string. B now gi...	The first and only line consists of a string $S$ ($ 1 \le \|S\| \le 5\,000 $). It is guaranteed that the string will only consist of the lowercase English letters 'a', 'b', 'c'.	Print "YES" or "NO", according to the condition.	[ "aaabccc\n", "bbacc\n", "aabc\n" ]	[ "YES\n", "NO\n", "YES\n" ]	Consider first example: the number of 'c' is equal to the number of 'a'. Consider second example: although the number of 'c' is equal to the number of the 'b', the order is not correct. Consider third example: the number of 'c' is equal to the number of 'b'.	500	[ { "input": "aaabccc", "output": "YES" }, { "input": "bbacc", "output": "NO" }, { "input": "aabc", "output": "YES" }, { "input": "aabbcc", "output": "YES" }, { "input": "aaacccbb", "output": "NO" }, { "input": "abc", "output": "YES" }, { "in...	1,523,117,729	629	Python 3	CHALLENGED	CHALLENGES	7	77	7,065,600	s=input() if s.count('a')==s.count('c') or s.count('b')==s.count('c'): if s.index('a')<s.index('b') and s.index('b')<s.index('c'): print('YES') else: print('NO') else: print('NO')	Title: Check the string Time Limit: None seconds Memory Limit: None megabytes Problem Description: A has a string consisting of some number of lowercase English letters 'a'. He gives it to his friend B who appends some number of letters 'b' to the end of this string. Since both A and B like the characters 'a' and 'b...	```python s=input() if s.count('a')==s.count('c') or s.count('b')==s.count('c'): if s.index('a')<s.index('b') and s.index('b')<s.index('c'): print('YES') else: print('NO') else: print('NO') ```	-1
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,610,309,272	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	3	122	307,200	r,c=input().split() r=int(r) c=int(c) l=[] a=0 co=0 for i in range(r): l.append(input()) for i in range(r): s=l[i] if s.count("S")==0: a+=c else: co+=1 x=c-co re=int(a/c) rer=r-re a+=x*rer print(a)	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=input().split() r=int(r) c=int(c) l=[] a=0 co=0 for i in range(r): l.append(input()) for i in range(r): s=l[i] if s.count("S")==0: a+=c else: co+=1 x=c-co re=int(a/c) rer=r-re a+=x*rer print(a) ```	0
548	A	Mike and Fax	PROGRAMMING	1,100	[ "brute force", "implementation", "strings" ]		null	null	While Mike was walking in the subway, all the stuff in his back-bag dropped on the ground. There were several fax messages among them. He concatenated these strings in some order and now he has string s. He is not sure if this is his own back-bag or someone else's. He remembered that there were exactly k messages ...	The first line of input contains string s containing lowercase English letters (1<=≤<=\|s\|<=≤<=1000). The second line contains integer k (1<=≤<=k<=≤<=1000).	Print "YES"(without quotes) if he has worn his own back-bag or "NO"(without quotes) otherwise.	[ "saba\n2\n", "saddastavvat\n2\n" ]	[ "NO\n", "YES\n" ]	Palindrome is a string reading the same forward and backward. In the second sample, the faxes in his back-bag can be "saddas" and "tavvat".	500	[ { "input": "saba\n2", "output": "NO" }, { "input": "saddastavvat\n2", "output": "YES" }, { "input": "aaaaaaaaaa\n3", "output": "NO" }, { "input": "aaaaaa\n3", "output": "YES" }, { "input": "abaacca\n2", "output": "NO" }, { "input": "a\n1", "output"...	1,619,765,446	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	2	77	0	s = str(input()) n = int(input()) l = [] for i in range(0,len(s),(len(s) // n)): t = s[i:len(s) // 2:] for i in range(len(t)): if t[::] != t[::-1]: print("NO") exit() print("YES")	Title: Mike and Fax Time Limit: None seconds Memory Limit: None megabytes Problem Description: While Mike was walking in the subway, all the stuff in his back-bag dropped on the ground. There were several fax messages among them. He concatenated these strings in some order and now he has string s. He is not sure ...	```python s = str(input()) n = int(input()) l = [] for i in range(0,len(s),(len(s) // n)): t = s[i:len(s) // 2:] for i in range(len(t)): if t[::] != t[::-1]: print("NO") exit() print("YES") ```	0
279	B	Books	PROGRAMMING	1,400	[ "binary search", "brute force", "implementation", "two pointers" ]		null	null	When Valera has got some free time, he goes to the library to read some books. Today he's got t free minutes to read. That's why Valera took n books in the library and for each book he estimated the time he is going to need to read it. Let's number the books by integers from 1 to n. Valera needs ai minutes to...	The first line contains two integers n and t (1<=≤<=n<=≤<=105; 1<=≤<=t<=≤<=109) — the number of books and the number of free minutes Valera's got. The second line contains a sequence of n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=104), where number ai shows the number of minutes that the boy n...	Print a single integer — the maximum number of books Valera can read.	[ "4 5\n3 1 2 1\n", "3 3\n2 2 3\n" ]	[ "3\n", "1\n" ]	none	1,000	[ { "input": "4 5\n3 1 2 1", "output": "3" }, { "input": "3 3\n2 2 3", "output": "1" }, { "input": "1 3\n5", "output": "0" }, { "input": "1 10\n4", "output": "1" }, { "input": "2 10\n6 4", "output": "2" }, { "input": "6 10\n2 3 4 2 1 1", "output": "4...	1,697,660,571	2,147,483,647	Python 3	OK	TESTS	38	248	13,824,000	n, t = map(int, input().split()) books = list(map(int, input().split())) left, right = 0, 0 # Initialize two pointers current_time = 0 # Initialize the current time max_books = 0 # Initialize the maximum number of books read while right < n: current_time += books[right] # Add the time to read the ne...	Title: Books Time Limit: None seconds Memory Limit: None megabytes Problem Description: When Valera has got some free time, he goes to the library to read some books. Today he's got t free minutes to read. That's why Valera took n books in the library and for each book he estimated the time he is going to need t...	```python n, t = map(int, input().split()) books = list(map(int, input().split())) left, right = 0, 0 # Initialize two pointers current_time = 0 # Initialize the current time max_books = 0 # Initialize the maximum number of books read while right < n: current_time += books[right] # Add the time to r...	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,666,550,556	2,147,483,647	Python 3	OK	TESTS	20	46	0	n, m, a = map(int, input().split()) print((n // a + (n % a > 0)) * (m // a + (m % a > 0)))	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 n, m, a = map(int, input().split()) print((n // a + (n % a > 0)) * (m // a + (m % a > 0))) ```	3.977
251	A	Points on Line	PROGRAMMING	1,300	[ "binary search", "combinatorics", "two pointers" ]		null	null	Little Petya likes points a lot. Recently his mom has presented him n points lying on the line OX. Now Petya is wondering in how many ways he can choose three distinct points so that the distance between the two farthest of them doesn't exceed d. Note that the order of the points inside the group of three chosen...	The first line contains two integers: n and d (1<=≤<=n<=≤<=105; 1<=≤<=d<=≤<=109). The next line contains n integers x1,<=x2,<=...,<=xn, their absolute value doesn't exceed 109 — the x-coordinates of the points that Petya has got. It is guaranteed that the coordinates of the points in the input stri...	Print a single integer — the number of groups of three points, where the distance between two farthest points doesn't exceed d. Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.	[ "4 3\n1 2 3 4\n", "4 2\n-3 -2 -1 0\n", "5 19\n1 10 20 30 50\n" ]	[ "4\n", "2\n", "1\n" ]	In the first sample any group of three points meets our conditions. In the seconds sample only 2 groups of three points meet our conditions: {-3, -2, -1} and {-2, -1, 0}. In the third sample only one group does: {1, 10, 20}.	500	[ { "input": "4 3\n1 2 3 4", "output": "4" }, { "input": "4 2\n-3 -2 -1 0", "output": "2" }, { "input": "5 19\n1 10 20 30 50", "output": "1" }, { "input": "10 5\n31 36 43 47 48 50 56 69 71 86", "output": "2" }, { "input": "10 50\n1 4 20 27 65 79 82 83 99 100", "...	1,675,833,467	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	60	0	n,d = input().split() list = [int(x) for x in input().split()] numgroups = 0 count = len(list)-2 for n in range(count): if list[n + 2] - list[n] <= int(d): numgroups = numgroups +1 print(numgroups)	Title: Points on Line Time Limit: None seconds Memory Limit: None megabytes Problem Description: Little Petya likes points a lot. Recently his mom has presented him n points lying on the line OX. Now Petya is wondering in how many ways he can choose three distinct points so that the distance between the two fart...	```python n,d = input().split() list = [int(x) for x in input().split()] numgroups = 0 count = len(list)-2 for n in range(count): if list[n + 2] - list[n] <= int(d): numgroups = numgroups +1 print(numgroups) ```	0
686	A	Free Ice Cream	PROGRAMMING	800	[ "constructive algorithms", "implementation" ]		null	null	After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer. At the start of the day they have x ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and Gerda's house even in the night. Each person in the...	The first line contains two space-separated integers n and x (1<=≤<=n<=≤<=1000, 0<=≤<=x<=≤<=109). Each of the next n lines contains a character '+' or '-', and an integer di, separated by a space (1<=≤<=di<=≤<=109). Record "+ di" in i-th line means that a carrier with di ice cream packs occ...	Print two space-separated integers — number of ice cream packs left after all operations, and number of kids that left the house in distress.	[ "5 7\n+ 5\n- 10\n- 20\n+ 40\n- 20\n", "5 17\n- 16\n- 2\n- 98\n+ 100\n- 98\n" ]	[ "22 1\n", "3 2\n" ]	Consider the first sample. 1. Initially Kay and Gerda have 7 packs of ice cream. 1. Carrier brings 5 more, so now they have 12 packs. 1. A kid asks for 10 packs and receives them. There are only 2 packs remaining. 1. Another kid asks for 20 packs. Kay and Gerda do not have them, so the kid goes away distressed. 1....	500	[ { "input": "5 7\n+ 5\n- 10\n- 20\n+ 40\n- 20", "output": "22 1" }, { "input": "5 17\n- 16\n- 2\n- 98\n+ 100\n- 98", "output": "3 2" }, { "input": "6 1000000000\n+ 1000000000\n+ 1000000000\n+ 1000000000\n+ 1000000000\n+ 1000000000\n+ 1000000000", "output": "7000000000 0" }, { ...	1,664,079,560	2,147,483,647	Python 3	OK	TESTS	34	46	0	n, t = map(int, input().split()) x = 0 for i in range(n): a, b = map(str, input().split()) if a == '+': t += int(b) else: if t - int(b) >= 0: t -= int(b) else: x += 1 print(t, x)	Title: Free Ice Cream Time Limit: None seconds Memory Limit: None megabytes Problem Description: After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer. At the start of the day they have x ice cream packs. Since the ice cream is free, p...	```python n, t = map(int, input().split()) x = 0 for i in range(n): a, b = map(str, input().split()) if a == '+': t += int(b) else: if t - int(b) >= 0: t -= int(b) else: x += 1 print(t, x) ```	3
362	B	Petya and Staircases	PROGRAMMING	1,100	[ "implementation", "sortings" ]		null	null	Little boy Petya loves stairs very much. But he is bored from simple going up and down them — he loves jumping over several stairs at a time. As he stands on some stair, he can either jump to the next one or jump over one or two stairs at a time. But some stairs are too dirty and Petya doesn't want to step on them. No...	The first line contains two integers n and m (1<=≤<=n<=≤<=109, 0<=≤<=m<=≤<=3000) — the number of stairs in the staircase and the number of dirty stairs, correspondingly. The second line contains m different space-separated integers d1,<=d2,<=...,<=dm (1<=≤<=di<=≤<=n) — the numbers of the dirty s...	Print "YES" if Petya can reach stair number n, stepping only on the clean stairs. Otherwise print "NO".	[ "10 5\n2 4 8 3 6\n", "10 5\n2 4 5 7 9\n" ]	[ "NO", "YES" ]	none	500	[ { "input": "10 5\n2 4 8 3 6", "output": "NO" }, { "input": "10 5\n2 4 5 7 9", "output": "YES" }, { "input": "10 9\n2 3 4 5 6 7 8 9 10", "output": "NO" }, { "input": "5 2\n4 5", "output": "NO" }, { "input": "123 13\n36 73 111 2 92 5 47 55 48 113 7 78 37", "outp...	1,586,342,525	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	4	1,000	819,200	### B. Petya and Staircases n,m=map(int, input().split()) arr=sorted([int(x) for x in input().split()]) if m>=n or arr[0]==1 or arr[-1]==n: print('NO') else: k=1 new=[] x=max(arr) while x>=0: if k not in arr: new.append(k) k+=1 x-=1 new.appen...	Title: Petya and Staircases Time Limit: None seconds Memory Limit: None megabytes Problem Description: Little boy Petya loves stairs very much. But he is bored from simple going up and down them — he loves jumping over several stairs at a time. As he stands on some stair, he can either jump to the next one or jump o...	```python ### B. Petya and Staircases n,m=map(int, input().split()) arr=sorted([int(x) for x in input().split()]) if m>=n or arr[0]==1 or arr[-1]==n: print('NO') else: k=1 new=[] x=max(arr) while x>=0: if k not in arr: new.append(k) k+=1 x-=1 ...	0
990	A	Commentary Boxes	PROGRAMMING	1,000	[ "implementation", "math" ]		null	null	Berland Football Cup starts really soon! Commentators from all over the world come to the event. Organizers have already built $n$ commentary boxes. $m$ regional delegations will come to the Cup. Every delegation should get the same number of the commentary boxes. If any box is left unoccupied then the delegations wil...	The only line contains four integer numbers $n$, $m$, $a$ and $b$ ($1 \le n, m \le 10^{12}$, $1 \le a, b \le 100$), where $n$ is the initial number of the commentary boxes, $m$ is the number of delegations to come, $a$ is the fee to build a box and $b$ is the fee to demolish a box.	Output the minimal amount of burles organizers should pay to satisfy all the delegations (i.e. to make the number of the boxes be divisible by $m$). It is allowed that the final number of the boxes is equal to $0$.	[ "9 7 3 8\n", "2 7 3 7\n", "30 6 17 19\n" ]	[ "15\n", "14\n", "0\n" ]	In the first example organizers can build $5$ boxes to make the total of $14$ paying $3$ burles for the each of them. In the second example organizers can demolish $2$ boxes to make the total of $0$ paying $7$ burles for the each of them. In the third example organizers are already able to distribute all the boxes eq...	0	[ { "input": "9 7 3 8", "output": "15" }, { "input": "2 7 3 7", "output": "14" }, { "input": "30 6 17 19", "output": "0" }, { "input": "500000000001 1000000000000 100 100", "output": "49999999999900" }, { "input": "1000000000000 750000000001 10 100", "output": "...	1,590,155,394	2,147,483,647	PyPy 3	OK	TESTS	109	155	0	n , m , a , b = map(int, input().split() ) x = (n//m +1)m - n y = n - (n//m)m print( min(xa , yb) )	Title: Commentary Boxes Time Limit: None seconds Memory Limit: None megabytes Problem Description: Berland Football Cup starts really soon! Commentators from all over the world come to the event. Organizers have already built $n$ commentary boxes. $m$ regional delegations will come to the Cup. Every delegation shou...	```python n , m , a , b = map(int, input().split() ) x = (n//m +1)m - n y = n - (n//m)m print( min(xa , yb) ) ```	3
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,694,596,579	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	5	62	0	n=input() s=0 for i in n: if i=='7' or i=='4': s=s+1 else: break if s==4 or s==7: print('YES') else: print('NO')	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 n=input() s=0 for i in n: if i=='7' or i=='4': s=s+1 else: break if s==4 or s==7: print('YES') else: print('NO') ```	0
61	A	Ultra-Fast Mathematician	PROGRAMMING	800	[ "implementation" ]	A. Ultra-Fast Mathematician	2	256	Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second. One day in 230 AD Shapur was trying to find out if any one can possibly do...	There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.	Write one line — the corresponding answer. Do not omit the leading 0s.	[ "1010100\n0100101\n", "000\n111\n", "1110\n1010\n", "01110\n01100\n" ]	[ "1110001\n", "111\n", "0100\n", "00010\n" ]	none	500	[ { "input": "1010100\n0100101", "output": "1110001" }, { "input": "000\n111", "output": "111" }, { "input": "1110\n1010", "output": "0100" }, { "input": "01110\n01100", "output": "00010" }, { "input": "011101\n000001", "output": "011100" }, { "input": "...	1,694,325,493	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	31	0	arr1=list(map(int,input().split())) arr2=list(map(int,input().split())) l=[] for i in arr1: for j in arr2: if i==j: l.append('0') else: l.append('1') print(l)	Title: Ultra-Fast Mathematician Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 10...	```python arr1=list(map(int,input().split())) arr2=list(map(int,input().split())) l=[] for i in arr1: for j in arr2: if i==j: l.append('0') else: l.append('1') print(l) ```	0
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,684,056,011	2,147,483,647	Python 3	OK	TESTS	54	92	0	lst = [] for i in range(3): n = str(input()) lst.append(n) def f(lst): if len(lst[2]) != (len(lst[1]) + len(lst[0])): return "NO" else: l1 = [] l2 = [] a = lst[0] + lst[1] b = lst[2] for i in a: l1.append(i) for j in b...	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 lst = [] for i in range(3): n = str(input()) lst.append(n) def f(lst): if len(lst[2]) != (len(lst[1]) + len(lst[0])): return "NO" else: l1 = [] l2 = [] a = lst[0] + lst[1] b = lst[2] for i in a: l1.append(i) ...	3
58	A	Chat room	PROGRAMMING	1,000	[ "greedy", "strings" ]	A. Chat room	1	256	Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word "hello". For example, ...	The first and only line contains the word s, which Vasya typed. This word consisits of small Latin letters, its length is no less that 1 and no more than 100 letters.	If Vasya managed to say hello, print "YES", otherwise print "NO".	[ "ahhellllloou\n", "hlelo\n" ]	[ "YES\n", "NO\n" ]	none	500	[ { "input": "ahhellllloou", "output": "YES" }, { "input": "hlelo", "output": "NO" }, { "input": "helhcludoo", "output": "YES" }, { "input": "hehwelloho", "output": "YES" }, { "input": "pnnepelqomhhheollvlo", "output": "YES" }, { "input": "tymbzjyqhymeda...	1,683,461,846	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	15	0	s=input() l='hello' t=False for i in l: for j in s: if i==j: s=s[s.index(j):] t=True break else: t=False if t: print("YES") else: print('NO')	Title: Chat room Time Limit: 1 seconds Memory Limit: 256 megabytes Problem Description: Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letter...	```python s=input() l='hello' t=False for i in l: for j in s: if i==j: s=s[s.index(j):] t=True break else: t=False if t: print("YES") else: print('NO') ```	0
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,685,977,161	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	4	62	0	def tram(n): lst = [] maxy = [] cnt = 0 for i in range(n): m=list(map(int,input().split())) lst.append(m) if len(lst)==1 or len(lst)==2: return lst[0][1] for x in range(len(lst)): if not maxy: maxy.append(lst[x][1]-lst[x+1][0]+lst[x+1][1]) ...	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 def tram(n): lst = [] maxy = [] cnt = 0 for i in range(n): m=list(map(int,input().split())) lst.append(m) if len(lst)==1 or len(lst)==2: return lst[0][1] for x in range(len(lst)): if not maxy: maxy.append(lst[x][1]-lst[x+1][0]+lst[...	0
59	A	Word	PROGRAMMING	800	[ "implementation", "strings" ]	A. Word	2	256	Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At th...	The first line contains a word s — it consists of uppercase and lowercase Latin letters and possesses the length from 1 to 100.	Print the corrected word s. If the given word s has strictly more uppercase letters, make the word written in the uppercase register, otherwise - in the lowercase one.	[ "HoUse\n", "ViP\n", "maTRIx\n" ]	[ "house\n", "VIP\n", "matrix\n" ]	none	500	[ { "input": "HoUse", "output": "house" }, { "input": "ViP", "output": "VIP" }, { "input": "maTRIx", "output": "matrix" }, { "input": "BNHWpnpawg", "output": "bnhwpnpawg" }, { "input": "VTYGP", "output": "VTYGP" }, { "input": "CHNenu", "output": "chn...	1,689,814,960	2,147,483,647	PyPy 3-64	OK	TESTS	30	124	0	s = input("") upper = 0 lower = 0 for letter in s: if letter.isupper(): upper+=1 elif letter.islower(): lower+=1 if upper>lower: print(s.upper()) else: print(s.lower())	Title: Word Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it ei...	```python s = input("") upper = 0 lower = 0 for letter in s: if letter.isupper(): upper+=1 elif letter.islower(): lower+=1 if upper>lower: print(s.upper()) else: print(s.lower()) ```	3.969
768	A	Oath of the Night's Watch	PROGRAMMING	900	[ "constructive algorithms", "sortings" ]		null	null	"Night gathers, and now my watch begins. It shall not end until my death. I shall take no wife, hold no lands, father no children. I shall wear no crowns and win no glory. I shall live and die at my post. I am the sword in the darkness. I am the watcher on the walls. I am the shield that guards the realms of men. I ple...	First line consists of a single integer n (1<=≤<=n<=≤<=105) — the number of stewards with Jon Snow. Second line consists of n space separated integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=109) representing the values assigned to the stewards.	Output a single integer representing the number of stewards which Jon will feed.	[ "2\n1 5\n", "3\n1 2 5\n" ]	[ "0", "1" ]	In the first sample, Jon Snow cannot support steward with strength 1 because there is no steward with strength less than 1 and he cannot support steward with strength 5 because there is no steward with strength greater than 5. In the second sample, Jon Snow can support steward with strength 2 because there are steward...	500	[ { "input": "2\n1 5", "output": "0" }, { "input": "3\n1 2 5", "output": "1" }, { "input": "4\n1 2 3 4", "output": "2" }, { "input": "8\n7 8 9 4 5 6 1 2", "output": "6" }, { "input": "1\n1", "output": "0" }, { "input": "1\n100", "output": "0" }, ...	1,658,425,232	2,147,483,647	PyPy 3-64	OK	TESTS	88	93	14,131,200	n = int(input()) a = list(map(int, input().split())) a.sort() i = 0 for k in range(0, n): if a[k] == a[0]: i += 1 else: break j = 0 for k in range(n-1, -1, -1): if a[k] == a[n-1]: j += 1 else: break if i + j < n: print(n-j-i) else: print(...	Title: Oath of the Night's Watch Time Limit: None seconds Memory Limit: None megabytes Problem Description: "Night gathers, and now my watch begins. It shall not end until my death. I shall take no wife, hold no lands, father no children. I shall wear no crowns and win no glory. I shall live and die at my post. I am...	```python n = int(input()) a = list(map(int, input().split())) a.sort() i = 0 for k in range(0, n): if a[k] == a[0]: i += 1 else: break j = 0 for k in range(n-1, -1, -1): if a[k] == a[n-1]: j += 1 else: break if i + j < n: print(n-j-i) else: ...	3
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,640,283,808	2,147,483,647	PyPy 3-64	OK	TESTS	32	109	0	from math import gcd, sqrt def readList(): return [int(i) for i in input().split()] def solve(): s, v1, v2, t1, t2 = readList() a = v1 * s + 2 * t1 b = v2 * s + 2 * t2 if a < b: print('First') elif a > b: print('Second') else: print('Friendship') t ...	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 from math import gcd, sqrt def readList(): return [int(i) for i in input().split()] def solve(): s, v1, v2, t1, t2 = readList() a = v1 * s + 2 * t1 b = v2 * s + 2 * t2 if a < b: print('First') elif a > b: print('Second') else: print('Friendship...	3
81	A	Plug-in	PROGRAMMING	1,400	[ "implementation" ]	A. Plug-in	1	256	Polycarp thinks about the meaning of life very often. He does this constantly, even when typing in the editor. Every time he starts brooding he can no longer fully concentrate and repeatedly presses the keys that need to be pressed only once. For example, instead of the phrase "how are you" he can type "hhoow aaaare yy...	The input data consists of a single line to be processed. The length of the line is from 1 to 2·105 characters inclusive. The string contains only lowercase Latin letters.	Print the given string after it is processed. It is guaranteed that the result will contain at least one character.	[ "hhoowaaaareyyoouu\n", "reallazy\n", "abacabaabacabaa\n" ]	[ "wre", "rezy", "a" ]	none	500	[ { "input": "hhoowaaaareyyoouu", "output": "wre" }, { "input": "reallazy", "output": "rezy" }, { "input": "abacabaabacabaa", "output": "a" }, { "input": "xraccabccbry", "output": "xy" }, { "input": "a", "output": "a" }, { "input": "b", "output": "b"...	1,663,952,491	2,147,483,647	Python 3	OK	TESTS	32	560	3,584,000	s=input() S=[] top=-1 for i in s: if len(S)==0: S.append(i) top+=1 else: if i ==S[top]: S.pop(top) top-=1 else: S.append(i) top+=1 print(*S,sep='')	Title: Plug-in Time Limit: 1 seconds Memory Limit: 256 megabytes Problem Description: Polycarp thinks about the meaning of life very often. He does this constantly, even when typing in the editor. Every time he starts brooding he can no longer fully concentrate and repeatedly presses the keys that need to be pressed...	```python s=input() S=[] top=-1 for i in s: if len(S)==0: S.append(i) top+=1 else: if i ==S[top]: S.pop(top) top-=1 else: S.append(i) top+=1 print(*S,sep='') ```	3.713324
155	A	I_love_\%username\%	PROGRAMMING	800	[ "brute force" ]		null	null	Vasya adores sport programming. He can't write programs but he loves to watch the contests' progress. Vasya even has a favorite coder and Vasya pays special attention to him. One day Vasya decided to collect the results of all contests where his favorite coder participated and track the progress of his coolness. For e...	The first line contains the single integer n (1<=≤<=n<=≤<=1000) — the number of contests where the coder participated. The next line contains n space-separated non-negative integer numbers — they are the points which the coder has earned. The points are given in the chronological order. All points do not exceed ...	Print the single number — the number of amazing performances the coder has had during his whole history of participating in the contests.	[ "5\n100 50 200 150 200\n", "10\n4664 6496 5814 7010 5762 5736 6944 4850 3698 7242\n" ]	[ "2\n", "4\n" ]	In the first sample the performances number 2 and 3 are amazing. In the second sample the performances number 2, 4, 9 and 10 are amazing.	500	[ { "input": "5\n100 50 200 150 200", "output": "2" }, { "input": "10\n4664 6496 5814 7010 5762 5736 6944 4850 3698 7242", "output": "4" }, { "input": "1\n6", "output": "0" }, { "input": "2\n2 1", "output": "1" }, { "input": "5\n100 36 53 7 81", "output": "2" ...	1,678,888,892	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	17	92	0	n=int(input()) sobitiya = list(map(int, input().split())) unic=0 maxim=0 minim=0 unicum=[] for i in range(1,len(sobitiya)): #nomer if sobitiya[i]>sobitiya[i-1]: if maxim != 0: if max(sobitiya[i],sobitiya[i-1])>maxim: maxim=max(sobitiya[i],sobitiya[i-1]) unic+=1 ...	Title: I_love_\%username\% Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya adores sport programming. He can't write programs but he loves to watch the contests' progress. Vasya even has a favorite coder and Vasya pays special attention to him. One day Vasya decided to collect the re...	```python n=int(input()) sobitiya = list(map(int, input().split())) unic=0 maxim=0 minim=0 unicum=[] for i in range(1,len(sobitiya)): #nomer if sobitiya[i]>sobitiya[i-1]: if maxim != 0: if max(sobitiya[i],sobitiya[i-1])>maxim: maxim=max(sobitiya[i],sobitiya[i-1]) ...	0
937	A	Olympiad	PROGRAMMING	800	[ "implementation", "sortings" ]		null	null	The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points. As the head of the programming committee, you are to determine the set of participants to be awarded with diplomas with respect to the following criteria: - At least one participant should get a di...	The first line contains a single integer n (1<=≤<=n<=≤<=100) — the number of participants. The next line contains a sequence of n integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=600) — participants' scores. It's guaranteed that at least one participant has non-zero score.	Print a single integer — the desired number of ways.	[ "4\n1 3 3 2\n", "3\n1 1 1\n", "4\n42 0 0 42\n" ]	[ "3\n", "1\n", "1\n" ]	There are three ways to choose a subset in sample case one. 1. Only participants with 3 points will get diplomas. 1. Participants with 2 or 3 points will get diplomas. 1. Everyone will get a diploma! The only option in sample case two is to award everyone. Note that in sample case three participants with zero sco...	500	[ { "input": "4\n1 3 3 2", "output": "3" }, { "input": "3\n1 1 1", "output": "1" }, { "input": "4\n42 0 0 42", "output": "1" }, { "input": "10\n1 0 1 0 1 0 0 0 0 1", "output": "1" }, { "input": "10\n572 471 540 163 50 30 561 510 43 200", "output": "10" }, { ...	1,658,064,757	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	2	31	0	n = int(input()) a = list(map(int, input().split())) for x in a: if x == 0: a.remove(x) b = list(set(a)) print(len(b))	Title: Olympiad Time Limit: None seconds Memory Limit: None megabytes Problem Description: The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points. As the head of the programming committee, you are to determine the set of participants to be awarded with ...	```python n = int(input()) a = list(map(int, input().split())) for x in a: if x == 0: a.remove(x) b = list(set(a)) print(len(b)) ```	0
443	A	Anton and Letters	PROGRAMMING	800	[ "constructive algorithms", "implementation" ]		null	null	Recently, Anton has found a set. The set consists of small English letters. Anton carefully wrote out all the letters from the set in one line, separated by a comma. He also added an opening curved bracket at the beginning of the line and a closing curved bracket at the end of the line. Unfortunately, from time to ti...	The first and the single line contains the set of letters. The length of the line doesn't exceed 1000. It is guaranteed that the line starts from an opening curved bracket and ends with a closing curved bracket. Between them, small English letters are listed, separated by a comma. Each comma is followed by a space.	Print a single number — the number of distinct letters in Anton's set.	[ "{a, b, c}\n", "{b, a, b, a}\n", "{}\n" ]	[ "3\n", "2\n", "0\n" ]	none	500	[ { "input": "{a, b, c}", "output": "3" }, { "input": "{b, a, b, a}", "output": "2" }, { "input": "{}", "output": "0" }, { "input": "{a, a, c, b, b, b, c, c, c, c}", "output": "3" }, { "input": "{a, c, b, b}", "output": "3" }, { "input": "{a, b}", "o...	1,687,588,119	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	31	0	n = input()[1:-1] n_list = n.split(', ') print(len(n_list))	Title: Anton and Letters Time Limit: None seconds Memory Limit: None megabytes Problem Description: Recently, Anton has found a set. The set consists of small English letters. Anton carefully wrote out all the letters from the set in one line, separated by a comma. He also added an opening curved bracket at the begi...	```python n = input()[1:-1] n_list = n.split(', ') print(len(n_list)) ```	0
117	A	Elevator	PROGRAMMING	1,300	[ "implementation", "math" ]		null	null	And now the numerous qualifying tournaments for one of the most prestigious Russian contests Russian Codec Cup are over. All n participants who have made it to the finals found themselves in a huge m-floored 108-star hotel. Of course the first thought to come in a place like this is "How about checking out the elev...	The first line contains two space-separated integers n and m (1<=≤<=n<=≤<=105,<=2<=≤<=m<=≤<=108). Next n lines contain information about the participants in the form of three space-separated integers si fi ti (1<=≤<=si,<=fi<=≤<=m,<=0<=≤<=ti<=≤<=108), described in the problem statem...	Print n lines each containing one integer — the time of the arrival for each participant to the required floor.	[ "7 4\n2 4 3\n1 2 0\n2 2 0\n1 2 1\n4 3 5\n1 2 2\n4 2 0\n", "5 5\n1 5 4\n1 3 1\n1 3 4\n3 1 5\n4 2 5\n" ]	[ "9\n1\n0\n7\n10\n7\n5\n", "12\n10\n10\n8\n7\n" ]	Let's consider the first sample. The first participant starts at floor s = 2 by the time equal to t = 3. To get to the floor f = 4, he has to wait until the time equals 7, that's the time when the elevator will go upwards for the second time. Then the first participant should get on the elevator and go two floors...	500	[ { "input": "7 4\n2 4 3\n1 2 0\n2 2 0\n1 2 1\n4 3 5\n1 2 2\n4 2 0", "output": "9\n1\n0\n7\n10\n7\n5" }, { "input": "5 5\n1 5 4\n1 3 1\n1 3 4\n3 1 5\n4 2 5", "output": "12\n10\n10\n8\n7" }, { "input": "5 5\n1 3 4\n4 4 2\n3 2 1\n2 4 0\n1 5 3", "output": "10\n2\n7\n3\n12" }, { "i...	1,605,081,834	2,147,483,647	Python 3	OK	TESTS	23	421	8,704,000	n,m=map(int,input().split()) m-=1 a=[] for i in range(n): s,f,t=map(int,input().split()) s-=1 f-=1 if s==f: a.append(t) elif s<f: c=s while c<t: c+=2m a.append(c+f-s) else: c=m2-s while c<t: c+=2*m ...	Title: Elevator Time Limit: None seconds Memory Limit: None megabytes Problem Description: And now the numerous qualifying tournaments for one of the most prestigious Russian contests Russian Codec Cup are over. All n participants who have made it to the finals found themselves in a huge m-floored 108-star hotel...	```python n,m=map(int,input().split()) m-=1 a=[] for i in range(n): s,f,t=map(int,input().split()) s-=1 f-=1 if s==f: a.append(t) elif s<f: c=s while c<t: c+=2m a.append(c+f-s) else: c=m2-s while c<t: c+=2...	3
0	none	none	none	0	[ "none" ]		null	null	You are given several queries. In the i-th query you are given a single positive integer ni. You are to represent ni as a sum of maximum possible number of composite summands and print this maximum number, or print -1, if there are no such splittings. An integer greater than 1 is composite, if it is not prim...	The first line contains single integer q (1<=≤<=q<=≤<=105) — the number of queries. q lines follow. The (i<=+<=1)-th line contains single integer ni (1<=≤<=ni<=≤<=109) — the i-th query.	For each query print the maximum possible number of summands in a valid splitting to composite summands, or -1, if there are no such splittings.	[ "1\n12\n", "2\n6\n8\n", "3\n1\n2\n3\n" ]	[ "3\n", "1\n2\n", "-1\n-1\n-1\n" ]	12 = 4 + 4 + 4 = 4 + 8 = 6 + 6 = 12, but the first splitting has the maximum possible number of summands. 8 = 4 + 4, 6 can't be split into several composite summands. 1, 2, 3 are less than any composite number, so they do not have valid splittings.	0	[ { "input": "1\n12", "output": "3" }, { "input": "2\n6\n8", "output": "1\n2" }, { "input": "3\n1\n2\n3", "output": "-1\n-1\n-1" }, { "input": "6\n1\n2\n3\n5\n7\n11", "output": "-1\n-1\n-1\n-1\n-1\n-1" }, { "input": "3\n4\n6\n9", "output": "1\n1\n1" }, { ...	1,627,595,597	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	2	109	20,172,800	import sys import math input = sys.stdin.readline prime = [1 for i in range(100)] prime[0] = prime[1] = 0 for i in range(2, 100): if prime[i]: for j in range(i + i, 100, i): prime[j] = 0 def val(n): for i in range(2, 100): if prime[i] == 0 and prime[n % i] == 0: k = 1 ...	Title: none Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given several queries. In the i-th query you are given a single positive integer ni. You are to represent ni as a sum of maximum possible number of composite summands and print this maximum number, or print -1, i...	```python import sys import math input = sys.stdin.readline prime = [1 for i in range(100)] prime[0] = prime[1] = 0 for i in range(2, 100): if prime[i]: for j in range(i + i, 100, i): prime[j] = 0 def val(n): for i in range(2, 100): if prime[i] == 0 and prime[n % i] == 0: ...	0
940	B	Our Tanya is Crying Out Loud	PROGRAMMING	1,400	[ "dp", "greedy" ]		null	null	Right now she actually isn't. But she will be, if you don't solve this problem. You are given integers n, k, A and B. There is a number x, which is initially equal to n. You are allowed to perform two types of operations: 1. Subtract 1 from x. This operation costs you A coins. 1. Divide x by k....	The first line contains a single integer n (1<=≤<=n<=≤<=2·109). The second line contains a single integer k (1<=≤<=k<=≤<=2·109). The third line contains a single integer A (1<=≤<=A<=≤<=2·109). The fourth line contains a single integer B (1<=≤<=B<=≤<=2·109).	Output a single integer — the minimum amount of coins you have to pay to make x equal to 1.	[ "9\n2\n3\n1\n", "5\n5\n2\n20\n", "19\n3\n4\n2\n" ]	[ "6\n", "8\n", "12\n" ]	In the first testcase, the optimal strategy is as follows: - Subtract 1 from x (9 → 8) paying 3 coins. - Divide x by 2 (8 → 4) paying 1 coin. - Divide x by 2 (4 → 2) paying 1 coin. - Divide x by 2 (2 → 1) paying 1 coin. The total cost is 6 coins. In the second test case the optimal strategy is to subtra...	1,250	[ { "input": "9\n2\n3\n1", "output": "6" }, { "input": "5\n5\n2\n20", "output": "8" }, { "input": "19\n3\n4\n2", "output": "12" }, { "input": "1845999546\n999435865\n1234234\n2323423", "output": "1044857680578777" }, { "input": "1604353664\n1604353665\n9993432\n1", ...	1,618,064,485	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	5	1,000	512,000	from os import path;import sys,time mod = int(1e9 + 7) from math import ceil, floor,gcd,log,log2 ,factorial,sqrt from collections import defaultdict ,Counter , OrderedDict , deque;from itertools import combinations,permutations from string import ascii_lowercase ,ascii_uppercase from bisect import *;from functools...	Title: Our Tanya is Crying Out Loud Time Limit: None seconds Memory Limit: None megabytes Problem Description: Right now she actually isn't. But she will be, if you don't solve this problem. You are given integers n, k, A and B. There is a number x, which is initially equal to n. You are allowed to perf...	```python from os import path;import sys,time mod = int(1e9 + 7) from math import ceil, floor,gcd,log,log2 ,factorial,sqrt from collections import defaultdict ,Counter , OrderedDict , deque;from itertools import combinations,permutations from string import ascii_lowercase ,ascii_uppercase from bisect import *;from...	0
777	B	Game of Credit Cards	PROGRAMMING	1,300	[ "data structures", "dp", "greedy", "sortings" ]		null	null	After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their competitions in peaceful game of Credit Cards. Rules of this game are simple: each player bring his favourite n-digit credit card. Then both players name the digits written on the...	The first line of the input contains a single integer n (1<=≤<=n<=≤<=1000) — the number of digits in the cards Sherlock and Moriarty are going to use. The second line contains n digits — Sherlock's credit card number. The third line contains n digits — Moriarty's credit card number.	First print the minimum possible number of flicks Moriarty will get. Then print the maximum possible number of flicks that Sherlock can get from Moriarty.	[ "3\n123\n321\n", "2\n88\n00\n" ]	[ "0\n2\n", "2\n0\n" ]	First sample is elaborated in the problem statement. In the second sample, there is no way Moriarty can avoid getting two flicks.	1,000	[ { "input": "3\n123\n321", "output": "0\n2" }, { "input": "2\n88\n00", "output": "2\n0" }, { "input": "1\n4\n5", "output": "0\n1" }, { "input": "1\n8\n7", "output": "1\n0" }, { "input": "2\n55\n55", "output": "0\n0" }, { "input": "3\n534\n432", "out...	1,627,485,976	2,147,483,647	PyPy 3	OK	TESTS	55	124	22,118,400	n=int(input()) sherlock=sorted(input()) moriarty=sorted(input()) mx=0 mn=0 k=n-1 for i in range(n-1,-1,-1): for j in range(k,-1,-1): if moriarty[i]>=sherlock[j]: mn+=1 k=j-1 break k=n-1 for i in range(n-1,-1,-1): for j in range(k,-1,-1): if mori...	Title: Game of Credit Cards Time Limit: None seconds Memory Limit: None megabytes Problem Description: After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their competitions in peaceful game of Credit Cards. Rules of this game are simpl...	```python n=int(input()) sherlock=sorted(input()) moriarty=sorted(input()) mx=0 mn=0 k=n-1 for i in range(n-1,-1,-1): for j in range(k,-1,-1): if moriarty[i]>=sherlock[j]: mn+=1 k=j-1 break k=n-1 for i in range(n-1,-1,-1): for j in range(k,-1,-1): ...	3
864	E	Fire	PROGRAMMING	2,000	[ "dp", "sortings" ]		null	null	Polycarp is in really serious trouble — his house is on fire! It's time to save the most valuable items. Polycarp estimated that it would take ti seconds to save i-th item. In addition, for each item, he estimated the value of di — the moment after which the item i will be completely burned and will no long...	The first line contains a single integer n (1<=≤<=n<=≤<=100) — the number of items in Polycarp's house. Each of the following n lines contains three integers ti,<=di,<=pi (1<=≤<=ti<=≤<=20, 1<=≤<=di<=≤<=2<=000, 1<=≤<=pi<=≤<=20) — the time needed to save the item i, the time after which t...	In the first line print the maximum possible total value of the set of saved items. In the second line print one integer m — the number of items in the desired set. In the third line print m distinct integers — numbers of the saved items in the order Polycarp saves them. Items are 1-indexed in the same order in whi...	[ "3\n3 7 4\n2 6 5\n3 7 6\n", "2\n5 6 1\n3 3 5\n" ]	[ "11\n2\n2 3 \n", "1\n1\n1 \n" ]	In the first example Polycarp will have time to save any two items, but in order to maximize the total value of the saved items, he must save the second and the third item. For example, he can firstly save the third item in 3 seconds, and then save the second item in another 2 seconds. Thus, the total value of the save...	2,500	[ { "input": "3\n3 7 4\n2 6 5\n3 7 6", "output": "11\n2\n2 3 " }, { "input": "2\n5 6 1\n3 3 5", "output": "1\n1\n1 " }, { "input": "9\n13 18 14\n8 59 20\n9 51 2\n18 32 15\n1 70 18\n14 81 14\n10 88 16\n18 52 3\n1 50 6", "output": "106\n8\n1 4 9 8 2 5 6 7 " }, { "input": "5\n12 4...	1,514,401,020	2,147,483,647	Python 3	OK	TESTS	60	124	6,144,000	n = int(input()) a = [] for i in range(n): t,d,p = map(int,input().split()) a.append([t,d,p,i+1]) a.sort(key = lambda x: x[1]) d = {0: [0,[]]} for i in a: e = {} for j in d: if d[j][0] + i[0] < i[1]: if j + i[2] in d: if d[j][0]+i[0] < d[j+i[2]][0]: ...	Title: Fire Time Limit: None seconds Memory Limit: None megabytes Problem Description: Polycarp is in really serious trouble — his house is on fire! It's time to save the most valuable items. Polycarp estimated that it would take ti seconds to save i-th item. In addition, for each item, he estimated the value ...	```python n = int(input()) a = [] for i in range(n): t,d,p = map(int,input().split()) a.append([t,d,p,i+1]) a.sort(key = lambda x: x[1]) d = {0: [0,[]]} for i in a: e = {} for j in d: if d[j][0] + i[0] < i[1]: if j + i[2] in d: if d[j][0]+i[0] < d[j+i[2]][0]: ...	3
244	A	Dividing Orange	PROGRAMMING	900	[ "implementation" ]		null	null	One day Ms Swan bought an orange in a shop. The orange consisted of n·k segments, numbered with integers from 1 to n·k. There were k children waiting for Ms Swan at home. The children have recently learned about the orange and they decided to divide it between them. For that each child took a piece of paper...	The first line contains two integers n, k (1<=≤<=n,<=k<=≤<=30). The second line contains k space-separated integers a1,<=a2,<=...,<=ak (1<=≤<=ai<=≤<=n·k), where ai is the number of the orange segment that the i-th child would like to get. It is guaranteed that all numbers ai are dis...	Print exactly n·k distinct integers. The first n integers represent the indexes of the segments the first child will get, the second n integers represent the indexes of the segments the second child will get, and so on. Separate the printed numbers with whitespaces. You can print a child's segment indexes in a...	[ "2 2\n4 1\n", "3 1\n2\n" ]	[ "2 4 \n1 3 \n", "3 2 1 \n" ]	none	500	[ { "input": "2 2\n4 1", "output": "2 4 \n1 3 " }, { "input": "3 1\n2", "output": "3 2 1 " }, { "input": "5 5\n25 24 23 22 21", "output": "2 3 1 25 4 \n7 6 8 5 24 \n10 12 9 23 11 \n13 15 14 16 22 \n19 21 20 17 18 " }, { "input": "1 30\n8 22 13 25 10 30 12 27 6 4 7 2 20 16 26 14...	1,573,585,058	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	186	0	n,k=map(int,input().split()) a=list(map(int,input().split())) l=[] c=0 r=0 c1=0 for i in range(1,nk+1): if (i not in a): l.append(i) c+=1 if (c>0 and c%(n-1)==0 and c>r): r1=c1(n-1) r2=c print(a[c1],end=' ') print(*l[r1:r2],sep='') r=c ...	Title: Dividing Orange Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day Ms Swan bought an orange in a shop. The orange consisted of n·k segments, numbered with integers from 1 to n·k. There were k children waiting for Ms Swan at home. The children have recently learned a...	```python n,k=map(int,input().split()) a=list(map(int,input().split())) l=[] c=0 r=0 c1=0 for i in range(1,nk+1): if (i not in a): l.append(i) c+=1 if (c>0 and c%(n-1)==0 and c>r): r1=c1(n-1) r2=c print(a[c1],end=' ') print(*l[r1:r2],sep='') ...	0
0	none	none	none	0	[ "none" ]		null	null	Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two working places at each of the desks. The lanes are numbered from 1 to n from the left to the right, the desks in a lane ar...	The only line contains three integers n, m and k (1<=≤<=n,<=m<=≤<=10<=000, 1<=≤<=k<=≤<=2nm) — the number of lanes, the number of desks in each lane and the number of Santa Claus' place.	Print two integers: the number of lane r, the number of desk d, and a character s, which stands for the side of the desk Santa Claus. The character s should be "L", if Santa Clause should sit on the left, and "R" if his place is on the right.	[ "4 3 9\n", "4 3 24\n", "2 4 4\n" ]	[ "2 2 L\n", "4 3 R\n", "1 2 R\n" ]	The first and the second samples are shown on the picture. The green place corresponds to Santa Claus' place in the first example, the blue place corresponds to Santa Claus' place in the second example. In the third sample there are two lanes with four desks in each, and Santa Claus has the fourth place. Thus, his pla...	0	[ { "input": "4 3 9", "output": "2 2 L" }, { "input": "4 3 24", "output": "4 3 R" }, { "input": "2 4 4", "output": "1 2 R" }, { "input": "3 10 24", "output": "2 2 R" }, { "input": "10 3 59", "output": "10 3 L" }, { "input": "10000 10000 160845880", "...	1,675,180,511	311	PyPy 3	OK	TESTS	46	108	0	import sys, os, io input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline n, m, k = map(int, input().split()) r = (k - 1) // (2 * m) + 1 d = ((k - 1) % (2 * m) + 2) // 2 s = "L" if k % 2 else "R" print(r, d, s)	Title: none Time Limit: None seconds Memory Limit: None megabytes Problem Description: Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two working places at each of the desk...	```python import sys, os, io input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline n, m, k = map(int, input().split()) r = (k - 1) // (2 * m) + 1 d = ((k - 1) % (2 * m) + 2) // 2 s = "L" if k % 2 else "R" print(r, d, s) ```	3
847	C	Sum of Nestings	PROGRAMMING	1,800	[ "constructive algorithms" ]		null	null	Recall that the bracket sequence is considered regular if it is possible to insert symbols '+' and '1' into it so that the result is a correct arithmetic expression. For example, a sequence "(()())" is regular, because we can get correct arithmetic expression insering symbols '+' and '1': "((1+1)+(1+1))". Also the foll...	The first line contains two integers n and k (1<=≤<=n<=≤<=3·105, 0<=≤<=k<=≤<=1018) — the number of opening brackets and needed total nesting.	Print the required regular bracket sequence consisting of round brackets. If there is no solution print "Impossible" (without quotes).	[ "3 1\n", "4 6\n", "2 5\n" ]	[ "()(())", "(((())))", "Impossible\n" ]	The first example is examined in the statement. In the second example the answer is "(((())))". The nesting of the first opening bracket is 0, the nesting of the second is 1, the nesting of the third is 2, the nesting of fourth is 3. So the total sum of nestings equals to 0 + 1 + 2 + 3 = 6. In the third it is impossi...	0	[ { "input": "3 1", "output": "()(())" }, { "input": "4 6", "output": "(((())))" }, { "input": "2 5", "output": "Impossible" }, { "input": "1 0", "output": "()" }, { "input": "2 0", "output": "()()" }, { "input": "2 1", "output": "(())" }, { ...	1,514,149,664	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	62	5,529,600	ch=input() l=ch.split(' ') n=int(l[0]) k=int(l[1]) l1=['('] l2=[')'] l3=['()'] s=0 mi=0 ch='' q=1 while k>=(q(q-1))/2: q=q+1 q=q-1 d=int(k-(q(q-1))/2) li1=ql1 mi=q if d!=0: li1.insert(d,l3[0]) mi=q+1 print(q) ch=''.join(li1)+''.join(ql2) if n<mi: print('Impossible') els...	Title: Sum of Nestings Time Limit: None seconds Memory Limit: None megabytes Problem Description: Recall that the bracket sequence is considered regular if it is possible to insert symbols '+' and '1' into it so that the result is a correct arithmetic expression. For example, a sequence "(()())" is regular, because ...	```python ch=input() l=ch.split(' ') n=int(l[0]) k=int(l[1]) l1=['('] l2=[')'] l3=['()'] s=0 mi=0 ch='' q=1 while k>=(q(q-1))/2: q=q+1 q=q-1 d=int(k-(q(q-1))/2) li1=ql1 mi=q if d!=0: li1.insert(d,l3[0]) mi=q+1 print(q) ch=''.join(li1)+''.join(ql2) if n<mi: print('Impossi...	0
344	A	Magnets	PROGRAMMING	800	[ "implementation" ]		null	null	Mad scientist Mike entertains himself by arranging rows of dominoes. He doesn't need dominoes, though: he uses rectangular magnets instead. Each magnet has two poles, positive (a "plus") and negative (a "minus"). If two magnets are put together at a close distance, then the like poles will repel each other and the oppo...	The first line of the input contains an integer n (1<=≤<=n<=≤<=100000) — the number of magnets. Then n lines follow. The i-th line (1<=≤<=i<=≤<=n) contains either characters "01", if Mike put the i-th magnet in the "plus-minus" position, or characters "10", if Mike put the magnet in the "minus-plus" posit...	On the single line of the output print the number of groups of magnets.	[ "6\n10\n10\n10\n01\n10\n10\n", "4\n01\n01\n10\n10\n" ]	[ "3\n", "2\n" ]	The first testcase corresponds to the figure. The testcase has three groups consisting of three, one and two magnets. The second testcase has two groups, each consisting of two magnets.	500	[ { "input": "6\n10\n10\n10\n01\n10\n10", "output": "3" }, { "input": "4\n01\n01\n10\n10", "output": "2" }, { "input": "1\n10", "output": "1" }, { "input": "2\n01\n10", "output": "2" }, { "input": "2\n10\n10", "output": "1" }, { "input": "3\n10\n01\n10",...	1,696,390,198	2,147,483,647	PyPy 3-64	TIME_LIMIT_EXCEEDED	TESTS	6	1,000	5,120,000	c=0 a='01' for i in range(int(input())): n=input() if c==0 and n==a: c+=1 if n!=a: c+=1 a=n print(c)	Title: Magnets Time Limit: None seconds Memory Limit: None megabytes Problem Description: Mad scientist Mike entertains himself by arranging rows of dominoes. He doesn't need dominoes, though: he uses rectangular magnets instead. Each magnet has two poles, positive (a "plus") and negative (a "minus"). If two magnets...	```python c=0 a='01' for i in range(int(input())): n=input() if c==0 and n==a: c+=1 if n!=a: c+=1 a=n print(c) ```	0
981	A	Antipalindrome	PROGRAMMING	900	[ "brute force", "implementation", "strings" ]		null	null	A string is a palindrome if it reads the same from the left to the right and from the right to the left. For example, the strings "kek", "abacaba", "r" and "papicipap" are palindromes, while the strings "abb" and "iq" are not. A substring $s[l \ldots r]$ ($1<=\leq<=l<=\leq<=r<=\leq<=\|s\|$) of a string $s<==<=s_{1}s_{2}...	The first line contains a non-empty string $s$ with length at most $50$ characters, containing lowercase English letters only.	If there is such a substring in $s$ that is not a palindrome, print the maximum length of such a substring. Otherwise print $0$. Note that there can be multiple longest substrings that are not palindromes, but their length is unique.	[ "mew\n", "wuffuw\n", "qqqqqqqq\n" ]	[ "3\n", "5\n", "0\n" ]	"mew" is not a palindrome, so the longest substring of it that is not a palindrome, is the string "mew" itself. Thus, the answer for the first example is $3$. The string "uffuw" is one of the longest non-palindrome substrings (of length $5$) of the string "wuffuw", so the answer for the second example is $5$. All sub...	500	[ { "input": "mew", "output": "3" }, { "input": "wuffuw", "output": "5" }, { "input": "qqqqqqqq", "output": "0" }, { "input": "ijvji", "output": "4" }, { "input": "iiiiiii", "output": "0" }, { "input": "wobervhvvkihcuyjtmqhaaigvvgiaahqmtjyuchikvvhvrebow"...	1,623,029,917	2,147,483,647	Python 3	OK	TESTS	133	140	0	s=input() n=len(s) while(n): if s[:n]==s[:n][::-1]: n-=1 else: break print(n)	Title: Antipalindrome Time Limit: None seconds Memory Limit: None megabytes Problem Description: A string is a palindrome if it reads the same from the left to the right and from the right to the left. For example, the strings "kek", "abacaba", "r" and "papicipap" are palindromes, while the strings "abb" and "iq" ar...	```python s=input() n=len(s) while(n): if s[:n]==s[:n][::-1]: n-=1 else: break print(n) ```	3
270	A	Fancy Fence	PROGRAMMING	1,100	[ "geometry", "implementation", "math" ]		null	null	Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot. He wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence corners at a single angle a. Will the robot be able to build the fence Emuska...	The first line of input contains an integer t (0<=<<=t<=<<=180) — the number of tests. Each of the following t lines contains a single integer a (0<=<<=a<=<<=180) — the angle the robot can make corners at measured in degrees.	For each test, output on a single line "YES" (without quotes), if the robot can build a fence Emuskald wants, and "NO" (without quotes), if it is impossible.	[ "3\n30\n60\n90\n" ]	[ "NO\nYES\nYES\n" ]	In the first test case, it is impossible to build the fence, since there is no regular polygon with angle <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/df5f4b07dd5316fde165b43657b2696e2919e791.png" style="max-width: 100.0%;max-height: 100.0%;"/>. In the second test case, the fence is a r...	500	[ { "input": "3\n30\n60\n90", "output": "NO\nYES\nYES" }, { "input": "6\n1\n2\n3\n170\n179\n25", "output": "NO\nNO\nNO\nYES\nYES\nNO" } ]	1,651,442,354	2,147,483,647	PyPy 3-64	OK	TESTS	3	92	0	for _ in range(int(input())): angle = int(input()) if (-360 / (angle - 180)) > 0 and (-360 / (angle - 180)) % 1 == 0: print('YES') else: print('NO')	Title: Fancy Fence Time Limit: None seconds Memory Limit: None megabytes Problem Description: Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot. He wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can...	```python for _ in range(int(input())): angle = int(input()) if (-360 / (angle - 180)) > 0 and (-360 / (angle - 180)) % 1 == 0: print('YES') else: print('NO') ```	3
25	A	IQ test	PROGRAMMING	1,300	[ "brute force" ]	A. IQ test	2	256	Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given n numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given n numbers finds one that i...	The first line contains integer n (3<=≤<=n<=≤<=100) — amount of numbers in the task. The second line contains n space-separated natural numbers, not exceeding 100. It is guaranteed, that exactly one of these numbers differs from the others in evenness.	Output index of number that differs from the others in evenness. Numbers are numbered from 1 in the input order.	[ "5\n2 4 7 8 10\n", "4\n1 2 1 1\n" ]	[ "3\n", "2\n" ]	none	0	[ { "input": "5\n2 4 7 8 10", "output": "3" }, { "input": "4\n1 2 1 1", "output": "2" }, { "input": "3\n1 2 2", "output": "1" }, { "input": "3\n100 99 100", "output": "2" }, { "input": "3\n5 3 2", "output": "3" }, { "input": "4\n43 28 1 91", "output"...	1,573,407,012	2,147,483,647	Python 3	OK	TESTS	32	218	0	n = int(input()) a = list(map(int, input().split())) cnch = 0 cch = 0 for i in a: if i % 2 == 0: cch += 1 else: cnch += 1 if (cch == 2) or (cnch == 2): break if cch > cnch: a.insert(0, 0) for i in a: if i % 2 != 0: print(a.index(i)) ...	Title: IQ test Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given n numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — t...	```python n = int(input()) a = list(map(int, input().split())) cnch = 0 cch = 0 for i in a: if i % 2 == 0: cch += 1 else: cnch += 1 if (cch == 2) or (cnch == 2): break if cch > cnch: a.insert(0, 0) for i in a: if i % 2 != 0: print(a.index(i)...	3.9455

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.