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
99	B	Help Chef Gerasim	PROGRAMMING	1,300	[ "implementation", "sortings" ]	B. Help Chef Gerasim	0	256	In a far away kingdom young pages help to set the table for the King. As they are terribly mischievous, one needs to keep an eye on the control whether they have set everything correctly. This time the royal chef Gerasim had the impression that the pages have played a prank again: they had poured the juice from one cup...	The first line contains integer n — the number of cups on the royal table (1<=≤<=n<=≤<=1000). Next n lines contain volumes of juice in each cup — non-negative integers, not exceeding 104.	If the pages didn't pour the juice, print "Exemplary pages." (without the quotes). If you can determine the volume of juice poured during exactly one juice pouring, print "v ml. from cup #a to cup #b." (without the quotes), where v represents the volume of poured juice, a represents the number of the cup from...	[ "5\n270\n250\n250\n230\n250\n", "5\n250\n250\n250\n250\n250\n", "5\n270\n250\n249\n230\n250\n" ]	[ "20 ml. from cup #4 to cup #1.\n", "Exemplary pages.\n", "Unrecoverable configuration.\n" ]	none	1,000	[ { "input": "5\n270\n250\n250\n230\n250", "output": "20 ml. from cup #4 to cup #1." }, { "input": "5\n250\n250\n250\n250\n250", "output": "Exemplary pages." }, { "input": "5\n270\n250\n249\n230\n250", "output": "Unrecoverable configuration." }, { "input": "4\n200\n190\n210\n20...	1,683,256,791	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	30	0	n = int(input()) a = list(map(int, input().split())) avg = sum(a) if avg % n != 0: print('Unrecoverable configuration.') else: avg //= n x = [i for i in range(n) if a[i] != avg] if len(x) == 0: print('Exemplary pages.') elif len(x) == 2: d = abs(a[x[0]] - a[x[1]]) //...	Title: Help Chef Gerasim Time Limit: 0 seconds Memory Limit: 256 megabytes Problem Description: In a far away kingdom young pages help to set the table for the King. As they are terribly mischievous, one needs to keep an eye on the control whether they have set everything correctly. This time the royal chef Gerasim ...	```python n = int(input()) a = list(map(int, input().split())) avg = sum(a) if avg % n != 0: print('Unrecoverable configuration.') else: avg //= n x = [i for i in range(n) if a[i] != avg] if len(x) == 0: print('Exemplary pages.') elif len(x) == 2: d = abs(a[x[0]] - a...	-1
118	A	String Task	PROGRAMMING	1,000	[ "implementation", "strings" ]		null	null	Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it: - deletes all the vowels, - inserts a character "." before each consonant, - replaces ...	The first line represents input string of Petya's program. This string only consists of uppercase and lowercase Latin letters and its length is from 1 to 100, inclusive.	Print the resulting string. It is guaranteed that this string is not empty.	[ "tour\n", "Codeforces\n", "aBAcAba\n" ]	[ ".t.r\n", ".c.d.f.r.c.s\n", ".b.c.b\n" ]	none	500	[ { "input": "tour", "output": ".t.r" }, { "input": "Codeforces", "output": ".c.d.f.r.c.s" }, { "input": "aBAcAba", "output": ".b.c.b" }, { "input": "obn", "output": ".b.n" }, { "input": "wpwl", "output": ".w.p.w.l" }, { "input": "ggdvq", "output": "...	1,696,339,575	2,147,483,647	Python 3	OK	TESTS	42	92	0	# -- coding: utf-8 -- """ Created on Tue Oct 3 18:27:19 2023 @author: huozi """ def process_string(s): vowels = "AEIOUYaeiouy" result = "" for c in s: if c not in vowels: result += "." + c.lower() return result s = input() result = process_string(s) print(resul...	Title: String Task Time Limit: None seconds Memory Limit: None megabytes Problem Description: Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters...	```python # -- coding: utf-8 -- """ Created on Tue Oct 3 18:27:19 2023 @author: huozi """ def process_string(s): vowels = "AEIOUYaeiouy" result = "" for c in s: if c not in vowels: result += "." + c.lower() return result s = input() result = process_string(s) p...	3
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,593,077,495	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	3	93	6,656,000	n=int(input(),2) n1=int(input(),2) x=len(bin(n^n1)) while(x<len(bin(n))): print(0,end="") x=x+1 print(bin(n^n1)[2:])	Title: Ultra-Fast Mathematician Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 10...	```python n=int(input(),2) n1=int(input(),2) x=len(bin(n^n1)) while(x<len(bin(n))): print(0,end="") x=x+1 print(bin(n^n1)[2:]) ```	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,631,724,529	2,147,483,647	Python 3	OK	TESTS	30	124	6,758,400	take_inp = str(input()) def check(words): upper_word = 0 lower_word = 0 for word in words: if word.upper() == word: upper_word += 1 else: lower_word += 1 if upper_word > lower_word: final_str = words.upper() return final_str else: ...	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 take_inp = str(input()) def check(words): upper_word = 0 lower_word = 0 for word in words: if word.upper() == word: upper_word += 1 else: lower_word += 1 if upper_word > lower_word: final_str = words.upper() return final_str ...	3.956411
45	I	TCMCF+++	PROGRAMMING	1,400	[ "greedy" ]	I. TCMCF+++	2	256	Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of po...	The first line contains an integer n (1<=≤<=n<=≤<=100) — the number of the suggested problems. The next line contains n space-separated integers ci (<=-<=100<=≤<=ci<=≤<=100) — the cost of the i-th task. The tasks' costs may coinсide.	Print space-separated the costs of the problems that needed to be solved to get the maximal possible number of points. Do not forget, please, that it was necessary to solve at least one problem. If there are several solutions to that problem, print any of them.	[ "5\n1 2 -3 3 3\n", "13\n100 100 100 100 100 100 100 100 100 100 100 100 100\n", "4\n-2 -2 -2 -2\n" ]	[ "3 1 2 3 \n", "100 100 100 100 100 100 100 100 100 100 100 100 100 \n", "-2 -2 -2 -2 \n" ]	none	0	[ { "input": "5\n1 2 -3 3 3", "output": "3 1 2 3 " }, { "input": "13\n100 100 100 100 100 100 100 100 100 100 100 100 100", "output": "100 100 100 100 100 100 100 100 100 100 100 100 100 " }, { "input": "4\n-2 -2 -2 -2", "output": "-2 -2 -2 -2 " }, { "input": "1\n1", "outpu...	1,635,603,358	2,147,483,647	Python 3	OK	TESTS	65	92	4,505,600	n = int(input()) L = [int(l) for l in input().split()] if (n == 1): print(*L) else: L.sort() L.reverse() res = [] for i in L: if i > 0: res.append(i) else: break L.reverse() dp = [] for i in L: if i < 0: dp.appe...	Title: TCMCF+++ Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). Accord...	```python n = int(input()) L = [int(l) for l in input().split()] if (n == 1): print(*L) else: L.sort() L.reverse() res = [] for i in L: if i > 0: res.append(i) else: break L.reverse() dp = [] for i in L: if i < 0: ...	3.968608
237	A	Free Cash	PROGRAMMING	1,000	[ "implementation" ]		null	null	Valera runs a 24/7 fast food cafe. He magically learned that next day n people will visit his cafe. For each person we know the arrival time: the i-th person comes exactly at hi hours mi minutes. The cafe spends less than a minute to serve each client, but if a client comes in and sees that there is no free...	The first line contains a single integer n (1<=≤<=n<=≤<=105), that is the number of cafe visitors. Each of the following n lines has two space-separated integers hi and mi (0<=≤<=hi<=≤<=23; 0<=≤<=mi<=≤<=59), representing the time when the i-th person comes into the cafe. Note that the time is...	Print a single integer — the minimum number of cashes, needed to serve all clients next day.	[ "4\n8 0\n8 10\n8 10\n8 45\n", "3\n0 12\n10 11\n22 22\n" ]	[ "2\n", "1\n" ]	In the first sample it is not enough one cash to serve all clients, because two visitors will come into cafe in 8:10. Therefore, if there will be one cash in cafe, then one customer will be served by it, and another one will not wait and will go away. In the second sample all visitors will come in different times, so ...	500	[ { "input": "4\n8 0\n8 10\n8 10\n8 45", "output": "2" }, { "input": "3\n0 12\n10 11\n22 22", "output": "1" }, { "input": "5\n12 8\n15 27\n15 27\n16 2\n19 52", "output": "2" }, { "input": "7\n5 6\n7 34\n7 34\n7 34\n12 29\n15 19\n20 23", "output": "3" }, { "input": "...	1,606,668,383	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	248	819,200	import math import os import random import re import sys import functools from operator import itemgetter, attrgetter from collections import Counter if __name__ == '__main__': N = lambda: int(input()) n = N() a = list() while n > 0: h, m = P() a.append((h, m)) ...	Title: Free Cash Time Limit: None seconds Memory Limit: None megabytes Problem Description: Valera runs a 24/7 fast food cafe. He magically learned that next day n people will visit his cafe. For each person we know the arrival time: the i-th person comes exactly at hi hours mi minutes. The cafe spends l...	```python import math import os import random import re import sys import functools from operator import itemgetter, attrgetter from collections import Counter if __name__ == '__main__': N = lambda: int(input()) n = N() a = list() while n > 0: h, m = P() a.append((h, ...	-1
0	none	none	none	0	[ "none" ]		null	null	In Absurdistan, there are n towns (numbered 1 through n) and m bidirectional railways. There is also an absurdly simple road network — for each pair of different towns x and y, there is a bidirectional road between towns x and y if and only if there is no railway between them. Travelling to a different to...	The first line of the input contains two integers n and m (2<=≤<=n<=≤<=400, 0<=≤<=m<=≤<=n(n<=-<=1)<=/<=2) — the number of towns and the number of railways respectively. Each of the next m lines contains two integers u and v, denoting a railway between towns u and v (1<=≤<=u,<=v<=≤<=n, u<=...	Output one integer — the smallest possible time of the later vehicle's arrival in town n. If it's impossible for at least one of the vehicles to reach town n, output <=-<=1.	[ "4 2\n1 3\n3 4\n", "4 6\n1 2\n1 3\n1 4\n2 3\n2 4\n3 4\n", "5 5\n4 2\n3 5\n4 5\n5 1\n1 2\n" ]	[ "2\n", "-1\n", "3\n" ]	In the first sample, the train can take the route <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/7c0aa60a06309ef607b7159fd7f3687ea0d943ce.png" style="max-width: 100.0%;max-height: 100.0%;"/> and the bus can take the route <img align="middle" class="tex-formula" src="https://espresso.codefo...	0	[ { "input": "4 2\n1 3\n3 4", "output": "2" }, { "input": "4 6\n1 2\n1 3\n1 4\n2 3\n2 4\n3 4", "output": "-1" }, { "input": "5 5\n4 2\n3 5\n4 5\n5 1\n1 2", "output": "3" }, { "input": "5 4\n1 2\n3 2\n3 4\n5 4", "output": "4" }, { "input": "3 1\n1 2", "output": "...	1,448,387,552	4,652	Python 3	WRONG_ANSWER	PRETESTS	3	62	819,200	""" Codeforces Round 333 (Div. 2) Problem 602 A. @author yamaton @date 2015-11-24 """ import itertools as it import functools import operator import collections import math import sys def succ(i, pairs): for pair in pairs: if i in pair: yield next(k for k in pair if k != i) def solve(pair...	Title: none Time Limit: None seconds Memory Limit: None megabytes Problem Description: In Absurdistan, there are n towns (numbered 1 through n) and m bidirectional railways. There is also an absurdly simple road network — for each pair of different towns x and y, there is a bidirectional road between towns...	```python """ Codeforces Round 333 (Div. 2) Problem 602 A. @author yamaton @date 2015-11-24 """ import itertools as it import functools import operator import collections import math import sys def succ(i, pairs): for pair in pairs: if i in pair: yield next(k for k in pair if k != i) def ...	0
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,683,108,363	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	9	62	11,878,400	n,arr = int(input()),input().split() print(0 if n<=2 else n-2)	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,arr = int(input()),input().split() print(0 if n<=2 else n-2) ```	0
447	A	DZY Loves Hash	PROGRAMMING	800	[ "implementation" ]		null	null	DZY has a hash table with p buckets, numbered from 0 to p<=-<=1. He wants to insert n numbers, in the order they are given, into the hash table. For the i-th number xi, DZY will put it into the bucket numbered h(xi), where h(x) is the hash function. In this problem we will assume, that h(x)<==...	The first line contains two integers, p and n (2<=≤<=p,<=n<=≤<=300). Then n lines follow. The i-th of them contains an integer xi (0<=≤<=xi<=≤<=109).	Output a single integer — the answer to the problem.	[ "10 5\n0\n21\n53\n41\n53\n", "5 5\n0\n1\n2\n3\n4\n" ]	[ "4\n", "-1\n" ]	none	500	[ { "input": "10 5\n0\n21\n53\n41\n53", "output": "4" }, { "input": "5 5\n0\n1\n2\n3\n4", "output": "-1" }, { "input": "10 6\n811966798\n734823552\n790326404\n929189974\n414343256\n560346537", "output": "4" }, { "input": "2 2\n788371161\n801743052", "output": "-1" }, { ...	1,405,256,776	376	Python 3	OK	TESTS	29	62	0	p, n = [int(x) for x in input().split()] l = [int(input()) for i in range(n)] table = [False for i in range(p)] done = False for i in range(n): if table[l[i]%p]: print(i+1) done = True break else: table[l[i]%p] = True if not done: print(-1)	Title: DZY Loves Hash Time Limit: None seconds Memory Limit: None megabytes Problem Description: DZY has a hash table with p buckets, numbered from 0 to p<=-<=1. He wants to insert n numbers, in the order they are given, into the hash table. For the i-th number xi, DZY will put it into the bucket numbere...	```python p, n = [int(x) for x in input().split()] l = [int(input()) for i in range(n)] table = [False for i in range(p)] done = False for i in range(n): if table[l[i]%p]: print(i+1) done = True break else: table[l[i]%p] = True if not done: print(-1) ```	3
218	B	Airport	PROGRAMMING	1,100	[ "implementation" ]		null	null	Lolek and Bolek are about to travel abroad by plane. The local airport has a special "Choose Your Plane" offer. The offer's conditions are as follows: - it is up to a passenger to choose a plane to fly on; - if the chosen plane has x (x<=><=0) empty seats at the given moment, then the ticket for such a plane ...	The first line contains two integers n and m (1<=≤<=n,<=m<=≤<=1000) — the number of passengers in the queue and the number of planes in the airport, correspondingly. The next line contains m integers a1,<=a2,<=...,<=am (1<=≤<=ai<=≤<=1000) — ai stands for the number of empty seats in the i-th...	Print two integers — the maximum and the minimum number of zlotys that the airport administration can earn, correspondingly.	[ "4 3\n2 1 1\n", "4 3\n2 2 2\n" ]	[ "5 5\n", "7 6\n" ]	In the first test sample the number of passengers is equal to the number of empty seats, so regardless of the way the planes are chosen, the administration will earn the same sum. In the second sample the sum is maximized if the 1-st person in the queue buys a ticket to the 1-st plane, the 2-nd person — to the 2-nd pl...	500	[ { "input": "4 3\n2 1 1", "output": "5 5" }, { "input": "4 3\n2 2 2", "output": "7 6" }, { "input": "10 5\n10 3 3 1 2", "output": "58 26" }, { "input": "10 1\n10", "output": "55 55" }, { "input": "10 1\n100", "output": "955 955" }, { "input": "10 2\n4 7...	1,560,481,835	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	6	2,000	307,200	n, m = [int(i) for i in input().split()] a = [int(i) for i in input().split()] a.sort() # print(a) tmpN = n tmpA = a.copy() i = 0 mn = 0 while tmpN > 0: if tmpN >= tmpA[i]: mn += (tmpA[i] * (tmpA[i] + 1)) / 2 tmpN -= tmpA[i] tmpA[i] = 0 i += 1 continue if tmpA[i] >...	Title: Airport Time Limit: None seconds Memory Limit: None megabytes Problem Description: Lolek and Bolek are about to travel abroad by plane. The local airport has a special "Choose Your Plane" offer. The offer's conditions are as follows: - it is up to a passenger to choose a plane to fly on; - if the chosen pl...	```python n, m = [int(i) for i in input().split()] a = [int(i) for i in input().split()] a.sort() # print(a) tmpN = n tmpA = a.copy() i = 0 mn = 0 while tmpN > 0: if tmpN >= tmpA[i]: mn += (tmpA[i] * (tmpA[i] + 1)) / 2 tmpN -= tmpA[i] tmpA[i] = 0 i += 1 continue if...	0
393	A	Nineteen	PROGRAMMING	0	[]		null	null	Alice likes word "nineteen" very much. She has a string s and wants the string to contain as many such words as possible. For that reason she can rearrange the letters of the string. For example, if she has string "xiineteenppnnnewtnee", she can get string "xnineteenppnineteenw", containing (the occurrences marked) ...	The first line contains a non-empty string s, consisting only of lowercase English letters. The length of string s doesn't exceed 100.	Print a single integer — the maximum number of "nineteen"s that she can get in her string.	[ "nniinneetteeeenn\n", "nneteenabcnneteenabcnneteenabcnneteenabcnneteenabcii\n", "nineteenineteen\n" ]	[ "2", "2", "2" ]	none	500	[ { "input": "nniinneetteeeenn", "output": "2" }, { "input": "nneteenabcnneteenabcnneteenabcnneteenabcnneteenabcii", "output": "2" }, { "input": "nineteenineteen", "output": "2" }, { "input": "nssemsnnsitjtihtthij", "output": "0" }, { "input": "eehihnttehtherjsihihn...	1,558,729,294	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	18	109	0	d = {c: 0 for c in 'niet'} for c in input(): if c in d: d[c] += 1 print(min((d['n'] - 1) // 2, d['i'], d['e'] // 3, d['t']))	Title: Nineteen Time Limit: None seconds Memory Limit: None megabytes Problem Description: Alice likes word "nineteen" very much. She has a string s and wants the string to contain as many such words as possible. For that reason she can rearrange the letters of the string. For example, if she has string "xiinetee...	```python d = {c: 0 for c in 'niet'} for c in input(): if c in d: d[c] += 1 print(min((d['n'] - 1) // 2, d['i'], d['e'] // 3, d['t'])) ```	0
805	B	3-palindrome	PROGRAMMING	1,000	[ "constructive algorithms" ]		null	null	In the beginning of the new year Keivan decided to reverse his name. He doesn't like palindromes, so he changed Naviek to Navick. He is too selfish, so for a given n he wants to obtain a string of n characters, each of which is either 'a', 'b' or 'c', with no palindromes of length 3 appearing in the string as a su...	The first line contains single integer n (1<=≤<=n<=≤<=2·105) — the length of the string.	Print the string that satisfies all the constraints. If there are multiple answers, print any of them.	[ "2\n", "3\n" ]	[ "aa\n", "bba\n" ]	A palindrome is a sequence of characters which reads the same backward and forward.	1,000	[ { "input": "2", "output": "aa" }, { "input": "3", "output": "aab" }, { "input": "38", "output": "aabbaabbaabbaabbaabbaabbaabbaabbaabbaa" }, { "input": "47", "output": "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab" }, { "input": "59", "output": "aabbaabbaabb...	1,558,207,567	2,147,483,647	Python 3	OK	TESTS	42	171	512,000	s='' for i in range(int(input())): if i%4<2: s+='a' else: s+='b' print(s)	Title: 3-palindrome Time Limit: None seconds Memory Limit: None megabytes Problem Description: In the beginning of the new year Keivan decided to reverse his name. He doesn't like palindromes, so he changed Naviek to Navick. He is too selfish, so for a given n he wants to obtain a string of n characters, each o...	```python s='' for i in range(int(input())): if i%4<2: s+='a' else: s+='b' print(s) ```	3
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,700,322,287	2,147,483,647	Python 3	OK	TESTS	34	46	0	n, x = map(int, input().split()) grus = 0 kol = x for i in range(n): s, d = map(str, input().split()) if s == "+": kol += int(d) else: if kol >= int(d): kol -= int(d) else: grus += 1 print(kol, grus)	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, x = map(int, input().split()) grus = 0 kol = x for i in range(n): s, d = map(str, input().split()) if s == "+": kol += int(d) else: if kol >= int(d): kol -= int(d) else: grus += 1 print(kol, grus) ```	3
614	B	Gena's Code	PROGRAMMING	1,400	[ "implementation", "math" ]		null	null	It's the year 4527 and the tanks game that we all know and love still exists. There also exists Great Gena's code, written in 2016. The problem this code solves is: given the number of tanks that go into the battle from each country, find their product. If it is turns to be too large, then the servers might have not en...	The first line of the input contains the number of countries n (1<=≤<=n<=≤<=100<=000). The second line contains n non-negative integers ai without leading zeroes — the number of tanks of the i-th country. It is guaranteed that the second line contains at least n<=-<=1 beautiful numbers and the total leng...	Print a single number without leading zeroes — the product of the number of tanks presented by each country.	[ "3\n5 10 1\n", "4\n1 1 10 11\n", "5\n0 3 1 100 1\n" ]	[ "50", "110", "0" ]	In sample 1 numbers 10 and 1 are beautiful, number 5 is not not. In sample 2 number 11 is not beautiful (contains two '1's), all others are beautiful. In sample 3 number 3 is not beautiful, all others are beautiful.	1,000	[ { "input": "3\n5 10 1", "output": "50" }, { "input": "4\n1 1 10 11", "output": "110" }, { "input": "5\n0 3 1 100 1", "output": "0" }, { "input": "40\n10 100 10 1 10 10 100 10 10 100 10 100 100 10 1824868942 100 100 1 10 100 100 10 100 100 10 100 10 1 10 100 100 100 10 1 10 1 ...	1,572,912,427	2,147,483,647	PyPy 3	TIME_LIMIT_EXCEEDED	TESTS	14	500	9,011,200	n = int(input()) a = list(map(int, input().split())) p = 1 if n == 1: print(a[0]) else: for i in a: p *= i print(p)	Title: Gena's Code Time Limit: None seconds Memory Limit: None megabytes Problem Description: It's the year 4527 and the tanks game that we all know and love still exists. There also exists Great Gena's code, written in 2016. The problem this code solves is: given the number of tanks that go into the battle from eac...	```python n = int(input()) a = list(map(int, input().split())) p = 1 if n == 1: print(a[0]) else: for i in a: p *= i print(p) ```	0
453	A	Little Pony and Expected Maximum	PROGRAMMING	1,600	[ "probabilities" ]		null	null	Twilight Sparkle was playing Ludo with her friends Rainbow Dash, Apple Jack and Flutter Shy. But she kept losing. Having returned to the castle, Twilight Sparkle became interested in the dice that were used in the game. The dice has m faces: the first face of the dice contains a dot, the second one contains two dots...	A single line contains two integers m and n (1<=≤<=m,<=n<=≤<=105).	Output a single real number corresponding to the expected maximum. The answer will be considered correct if its relative or absolute error doesn't exceed 10<=<=-<=4.	[ "6 1\n", "6 3\n", "2 2\n" ]	[ "3.500000000000\n", "4.958333333333\n", "1.750000000000\n" ]	Consider the third test example. If you've made two tosses: 1. You can get 1 in the first toss, and 2 in the second. Maximum equals to 2. 1. You can get 1 in the first toss, and 1 in the second. Maximum equals to 1. 1. You can get 2 in the first toss, and 1 in the second. Maximum equals to 2. 1. You can get 2 in t...	500	[ { "input": "6 1", "output": "3.500000000000" }, { "input": "6 3", "output": "4.958333333333" }, { "input": "2 2", "output": "1.750000000000" }, { "input": "5 4", "output": "4.433600000000" }, { "input": "5 8", "output": "4.814773760000" }, { "input": "...	1,406,908,024	1,024	Python 3	OK	TESTS	41	217	0	m,n=map(int,input().split()) P=1 ans=0 while(m>0): p=P(1-(((m-1)/m)n)) ans+=mp m-=1 P-=p print(ans)	Title: Little Pony and Expected Maximum Time Limit: None seconds Memory Limit: None megabytes Problem Description: Twilight Sparkle was playing Ludo with her friends Rainbow Dash, Apple Jack and Flutter Shy. But she kept losing. Having returned to the castle, Twilight Sparkle became interested in the dice that were ...	```python m,n=map(int,input().split()) P=1 ans=0 while(m>0): p=P(1-(((m-1)/m)n)) ans+=mp m-=1 P-=p print(ans) ```	3
482	A	Diverse Permutation	PROGRAMMING	1,200	[ "constructive algorithms", "greedy" ]		null	null	Permutation p is an ordered set of integers p1,<=<=<=p2,<=<=<=...,<=<=<=pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1,<=<=<=p2,<=<=<=...,<=<=<=pn. Your task is to find such permutation p of length n, that the group of number...	The single line of the input contains two space-separated positive integers n, k (1<=≤<=k<=<<=n<=≤<=105).	Print n integers forming the permutation. If there are multiple answers, print any of them.	[ "3 2\n", "3 1\n", "5 2\n" ]	[ "1 3 2\n", "1 2 3\n", "1 3 2 4 5\n" ]	By \|x\| we denote the absolute value of number x.	500	[ { "input": "3 2", "output": "1 3 2" }, { "input": "3 1", "output": "1 2 3" }, { "input": "5 2", "output": "1 3 2 4 5" }, { "input": "5 4", "output": "1 5 2 4 3" }, { "input": "10 4", "output": "1 10 2 9 8 7 6 5 4 3" }, { "input": "10 3", "output": ...	1,647,260,263	2,147,483,647	Python 3	OK	TESTS	37	202	3,276,800	n,k=map(int,input().split()) p=[n] h=1 prev=n while k>0: if h%2!=0: p.append(prev-k) prev=prev-k h+=1 else: p.append(prev+k) prev=prev+k h+=1 k-=1 for i in range(p[1]-1,0,-1): p.append(i) print(*p)	Title: Diverse Permutation Time Limit: None seconds Memory Limit: None megabytes Problem Description: Permutation p is an ordered set of integers p1,<=<=<=p2,<=<=<=...,<=<=<=pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1,<=<=<=p2,<...	```python n,k=map(int,input().split()) p=[n] h=1 prev=n while k>0: if h%2!=0: p.append(prev-k) prev=prev-k h+=1 else: p.append(prev+k) prev=prev+k h+=1 k-=1 for i in range(p[1]-1,0,-1): p.append(i) print(*p) ```	3
711	A	Bus to Udayland	PROGRAMMING	800	[ "brute force", "implementation" ]		null	null	ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats are separated into pairs by a walkway. When ZS and Chris came, some places in the bus was already occupied. ZS and Chris a...	The first line of the input contains a single integer n (1<=≤<=n<=≤<=1000) — the number of rows of seats in the bus. Then, n lines follow. Each line contains exactly 5 characters, the first two of them denote the first pair of seats in the row, the third character denotes the walkway (it always equals '\|') and t...	If it is possible for Chris and ZS to sit at neighbouring empty seats, print "YES" (without quotes) in the first line. In the next n lines print the bus configuration, where the characters in the pair of seats for Chris and ZS is changed with characters '+'. Thus the configuration should differ from the input one by ...	[ "6\nOO\|OX\nXO\|XX\nOX\|OO\nXX\|OX\nOO\|OO\nOO\|XX\n", "4\nXO\|OX\nXO\|XX\nOX\|OX\nXX\|OX\n", "5\nXX\|XX\nXX\|XX\nXO\|OX\nXO\|OO\nOX\|XO\n" ]	[ "YES\n++\|OX\nXO\|XX\nOX\|OO\nXX\|OX\nOO\|OO\nOO\|XX\n", "NO\n", "YES\nXX\|XX\nXX\|XX\nXO\|OX\nXO\|++\nOX\|XO\n" ]	Note that the following is an incorrect configuration for the first sample case because the seats must be in the same pair. O+\|+X XO\|XX OX\|OO XX\|OX OO\|OO OO\|XX	500	[ { "input": "6\nOO\|OX\nXO\|XX\nOX\|OO\nXX\|OX\nOO\|OO\nOO\|XX", "output": "YES\n++\|OX\nXO\|XX\nOX\|OO\nXX\|OX\nOO\|OO\nOO\|XX" }, { "input": "4\nXO\|OX\nXO\|XX\nOX\|OX\nXX\|OX", "output": "NO" }, { "input": "5\nXX\|XX\nXX\|XX\nXO\|OX\nXO\|OO\nOX\|XO", "output": "YES\nXX\|XX\nXX\|XX\nXO\|OX\nXO\|++\nOX\|XO" ...	1,665,271,849	2,147,483,647	Python 3	OK	TESTS	71	62	0	k='' for i in range(int(input())): k+=(input()+'\n') r=k.replace('OO','++',1) print(['YES\n'+r, 'NO'][r is k])	Title: Bus to Udayland Time Limit: None seconds Memory Limit: None megabytes Problem Description: ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats are separated into pai...	```python k='' for i in range(int(input())): k+=(input()+'\n') r=k.replace('OO','++',1) print(['YES\n'+r, 'NO'][r is k]) ```	3
877	A	Alex and broken contest	PROGRAMMING	1,100	[ "implementation", "strings" ]		null	null	One day Alex was creating a contest about his friends, but accidentally deleted it. Fortunately, all the problems were saved, but now he needs to find them among other problems. But there are too many problems, to do it manually. Alex asks you to write a program, which will determine if a problem is from this contest ...	The only line contains string from lowercase and uppercase letters and "_" symbols of length, not more than 100 — the name of the problem.	Print "YES", if problem is from this contest, and "NO" otherwise.	[ "Alex_and_broken_contest\n", "NikitaAndString\n", "Danil_and_Olya\n" ]	[ "NO", "YES", "NO" ]	none	500	[ { "input": "Alex_and_broken_contest", "output": "NO" }, { "input": "NikitaAndString", "output": "YES" }, { "input": "Danil_and_Olya", "output": "NO" }, { "input": "Slava____and_the_game", "output": "YES" }, { "input": "Olya_and_energy_drinks", "output": "YES" ...	1,509,287,485	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	31	0	s = input() import sys names = ["Danil", "Olya", "Slava", "Ann", "Nikita"] for item in names: if(s.count(item) == 1): print("YES") sys.exit(0) print("NO")	Title: Alex and broken contest Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day Alex was creating a contest about his friends, but accidentally deleted it. Fortunately, all the problems were saved, but now he needs to find them among other problems. But there are too many problems,...	```python s = input() import sys names = ["Danil", "Olya", "Slava", "Ann", "Nikita"] for item in names: if(s.count(item) == 1): print("YES") sys.exit(0) print("NO") ```	0
509	A	Maximum in Table	PROGRAMMING	800	[ "brute force", "implementation" ]		null	null	An n<=×<=n table a is defined as follows: - The first row and the first column contain ones, that is: ai,<=1<==<=a1,<=i<==<=1 for all i<==<=1,<=2,<=...,<=n. - Each of the remaining numbers in the table is equal to the sum of the number above it and the number to the left of it. In other words, the ...	The only line of input contains a positive integer n (1<=≤<=n<=≤<=10) — the number of rows and columns of the table.	Print a single line containing a positive integer m — the maximum value in the table.	[ "1\n", "5\n" ]	[ "1", "70" ]	In the second test the rows of the table look as follows:	0	[ { "input": "1", "output": "1" }, { "input": "5", "output": "70" }, { "input": "2", "output": "2" }, { "input": "3", "output": "6" }, { "input": "4", "output": "20" }, { "input": "6", "output": "252" }, { "input": "7", "output": "924" ...	1,658,237,575	2,147,483,647	Python 3	OK	TESTS	10	31	0	n = int(input()) arr = [[1] * n] * n for i in range(1, n): for j in range(1, n): arr[i][j] = arr[i - 1][j] + arr[i][j - 1] print(arr[n - 1][n - 1])	Title: Maximum in Table Time Limit: None seconds Memory Limit: None megabytes Problem Description: An n<=×<=n table a is defined as follows: - The first row and the first column contain ones, that is: ai,<=1<==<=a1,<=i<==<=1 for all i<==<=1,<=2,<=...,<=n. - Each of the remaining numbers in the t...	```python n = int(input()) arr = [[1] * n] * n for i in range(1, n): for j in range(1, n): arr[i][j] = arr[i - 1][j] + arr[i][j - 1] print(arr[n - 1][n - 1]) ```	3
356	A	Knight Tournament	PROGRAMMING	1,500	[ "data structures", "dsu" ]		null	null	Hooray! Berl II, the king of Berland is making a knight tournament. The king has already sent the message to all knights in the kingdom and they in turn agreed to participate in this grand event. As for you, you're just a simple peasant. There's no surprise that you slept in this morning and were late for the tourname...	The first line contains two integers n, m (2<=≤<=n<=≤<=3·105; 1<=≤<=m<=≤<=3·105) — the number of knights and the number of fights. Each of the following m lines contains three integers li,<=ri,<=xi (1<=≤<=li<=<<=ri<=≤<=n; li<=≤<=xi<=≤<=ri) — the description of the i-th f...	Print n integers. If the i-th knight lost, then the i-th number should equal the number of the knight that beat the knight number i. If the i-th knight is the winner, then the i-th number must equal 0.	[ "4 3\n1 2 1\n1 3 3\n1 4 4\n", "8 4\n3 5 4\n3 7 6\n2 8 8\n1 8 1\n" ]	[ "3 1 4 0 ", "0 8 4 6 4 8 6 1 " ]	Consider the first test case. Knights 1 and 2 fought the first fight and knight 1 won. Knights 1 and 3 fought the second fight and knight 3 won. The last fight was between knights 3 and 4, knight 4 won.	500	[ { "input": "4 3\n1 2 1\n1 3 3\n1 4 4", "output": "3 1 4 0 " }, { "input": "8 4\n3 5 4\n3 7 6\n2 8 8\n1 8 1", "output": "0 8 4 6 4 8 6 1 " }, { "input": "2 1\n1 2 1", "output": "0 1 " }, { "input": "2 1\n1 2 2", "output": "2 0 " }, { "input": "3 1\n1 3 1", "out...	1,670,237,186	2,147,483,647	PyPy 3-64	TIME_LIMIT_EXCEEDED	TESTS	60	3,000	24,883,200	n,m = map(int,input().split()) ans = [0 for i in range(n+2)] next = [i+1 for i in range(n+2)] for i in range(m): l,r,x = map(int,input().split()) j = l while j<=r: if ans[j]==0 and j!=x: ans[j] = x j = next[j] next[l] = x next[x] = r+1 if ans[r+1]!=0: next[x] ...	Title: Knight Tournament Time Limit: None seconds Memory Limit: None megabytes Problem Description: Hooray! Berl II, the king of Berland is making a knight tournament. The king has already sent the message to all knights in the kingdom and they in turn agreed to participate in this grand event. As for you, you're j...	```python n,m = map(int,input().split()) ans = [0 for i in range(n+2)] next = [i+1 for i in range(n+2)] for i in range(m): l,r,x = map(int,input().split()) j = l while j<=r: if ans[j]==0 and j!=x: ans[j] = x j = next[j] next[l] = x next[x] = r+1 if ans[r+1]!=0: ...	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,459,295,001	2,147,483,647	Python 3	COMPILATION_ERROR	TESTS	0	0	0	def findLimak(): for i in lst: if(i+1 in lst and i+2 in lst): return "YES" return "NO" n=raw_input() n=int(n) strg=raw_input() inp=list(strg.split()) lst=[] for each in inp: lst.append(int(each)) print findLimak()	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 def findLimak(): for i in lst: if(i+1 in lst and i+2 in lst): return "YES" return "NO" n=raw_input() n=int(n) strg=raw_input() inp=list(strg.split()) lst=[] for each in inp: lst.append(int(each)) print findLimak() ```	-1
224	B	Array	PROGRAMMING	1,500	[ "bitmasks", "implementation", "two pointers" ]		null	null	You've got an array a, consisting of n integers: a1,<=a2,<=...,<=an. Your task is to find a minimal by inclusion segment [l,<=r] (1<=≤<=l<=≤<=r<=≤<=n) such, that among numbers al,<= al<=+<=1,<= ...,<= ar there are exactly k distinct numbers. Segment [l,<=r] (1<=≤<=l<=≤<=r<=≤...	The first line contains two space-separated integers: n and k (1<=≤<=n,<=k<=≤<=105). The second line contains n space-separated integers a1,<=a2,<=...,<=an — elements of the array a (1<=≤<=ai<=≤<=105).	Print a space-separated pair of integers l and r (1<=≤<=l<=≤<=r<=≤<=n) such, that the segment [l,<=r] is the answer to the problem. If the sought segment does not exist, print "-1 -1" without the quotes. If there are multiple correct answers, print any of them.	[ "4 2\n1 2 2 3\n", "8 3\n1 1 2 2 3 3 4 5\n", "7 4\n4 7 7 4 7 4 7\n" ]	[ "1 2\n", "2 5\n", "-1 -1\n" ]	In the first sample among numbers a<sub class="lower-index">1</sub> and a<sub class="lower-index">2</sub> there are exactly two distinct numbers. In the second sample segment [2, 5] is a minimal by inclusion segment with three distinct numbers, but it is not minimal in length among such segments. In the third sam...	1,000	[ { "input": "4 2\n1 2 2 3", "output": "1 2" }, { "input": "8 3\n1 1 2 2 3 3 4 5", "output": "2 5" }, { "input": "7 4\n4 7 7 4 7 4 7", "output": "-1 -1" }, { "input": "5 1\n1 7 2 3 2", "output": "1 1" }, { "input": "1 2\n666", "output": "-1 -1" }, { "inp...	1,557,550,276	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	22	342	10,547,200	n,k = map(int,input().split()) a=list(map(int,input().split())) if(len(set(a))<k): print(-1,-1) else: p = set() s = 0 l = 0 z = 0 for i in range(len(a)-1): if(len(p)==k): break p.add(a[i]) z = i for i in range(len(a)-1): if(a[i]!=a[i...	Title: Array Time Limit: None seconds Memory Limit: None megabytes Problem Description: You've got an array a, consisting of n integers: a1,<=a2,<=...,<=an. Your task is to find a minimal by inclusion segment [l,<=r] (1<=≤<=l<=≤<=r<=≤<=n) such, that among numbers al,<= al<=+<=1,<= ...,<...	```python n,k = map(int,input().split()) a=list(map(int,input().split())) if(len(set(a))<k): print(-1,-1) else: p = set() s = 0 l = 0 z = 0 for i in range(len(a)-1): if(len(p)==k): break p.add(a[i]) z = i for i in range(len(a)-1): if...	0
748	A	Santa Claus and a Place in a Class	PROGRAMMING	800	[ "implementation", "math" ]		null	null	Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two working places at each of the desks. The lanes are numbered from 1 to n from the left to the right, the desks in a lane ar...	The only line contains three integers n, m and k (1<=≤<=n,<=m<=≤<=10<=000, 1<=≤<=k<=≤<=2nm) — the number of lanes, the number of desks in each lane and the number of Santa Claus' place.	Print two integers: the number of lane r, the number of desk d, and a character s, which stands for the side of the desk Santa Claus. The character s should be "L", if Santa Clause should sit on the left, and "R" if his place is on the right.	[ "4 3 9\n", "4 3 24\n", "2 4 4\n" ]	[ "2 2 L\n", "4 3 R\n", "1 2 R\n" ]	The first and the second samples are shown on the picture. The green place corresponds to Santa Claus' place in the first example, the blue place corresponds to Santa Claus' place in the second example. In the third sample there are two lanes with four desks in each, and Santa Claus has the fourth place. Thus, his pla...	500	[ { "input": "4 3 9", "output": "2 2 L" }, { "input": "4 3 24", "output": "4 3 R" }, { "input": "2 4 4", "output": "1 2 R" }, { "input": "3 10 24", "output": "2 2 R" }, { "input": "10 3 59", "output": "10 3 L" }, { "input": "10000 10000 160845880", "...	1,647,163,998	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	30	0	lis1 = list(input()) lis2 = list(input()) op1 = [x for x in lis1 if x not in lis2] op2 = [x for x in lis2 if x not in lis1] rint("".join(op1)) rint("".join(op2))	Title: Santa Claus and a Place in a Class Time Limit: None seconds Memory Limit: None megabytes Problem Description: Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two work...	```python lis1 = list(input()) lis2 = list(input()) op1 = [x for x in lis1 if x not in lis2] op2 = [x for x in lis2 if x not in lis1] rint("".join(op1)) rint("".join(op2)) ```	-1
961	A	Tetris	PROGRAMMING	900	[ "implementation" ]		null	null	You are given a following process. There is a platform with $n$ columns. $1 \times 1$ squares are appearing one after another in some columns on this platform. If there are no squares in the column, a square will occupy the bottom row. Otherwise a square will appear at the top of the highest square of this column. ...	The first line of input contain 2 integer numbers $n$ and $m$ ($1 \le n, m \le 1000$) — the length of the platform and the number of the squares. The next line contain $m$ integer numbers $c_1, c_2, \dots, c_m$ ($1 \le c_i \le n$) — column in which $i$-th square will appear.	Print one integer — the amount of points you will receive.	[ "3 9\n1 1 2 2 2 3 1 2 3\n" ]	[ "2\n" ]	In the sample case the answer will be equal to $2$ because after the appearing of $6$-th square will be removed one row (counts of the squares on the platform will look like $[2~ 3~ 1]$, and after removing one row will be $[1~ 2~ 0]$). After the appearing of $9$-th square counts will be $[2~ 3~ 1]$, and after removing...	0	[ { "input": "3 9\n1 1 2 2 2 3 1 2 3", "output": "2" }, { "input": "1 7\n1 1 1 1 1 1 1", "output": "7" }, { "input": "1 1\n1", "output": "1" }, { "input": "3 5\n1 1 1 2 3", "output": "1" }, { "input": "4 6\n4 4 4 4 4 4", "output": "0" }, { "input": "4 6\...	1,660,995,967	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	30	0	def check_ponto(matriz): for i in range(len(matriz[0])): if (matriz[0][i] <1): return 0 for i in range(len(matriz[0])): matriz[0][i]-=1 return 1 n, m = input().split() lista = input().split() matriz = [[0]*int(n)] pontuacao=0 for i in lista: matriz[0][int(i)-1] +=1 pontuacao += check_ponto(matri...	Title: Tetris Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given a following process. There is a platform with $n$ columns. $1 \times 1$ squares are appearing one after another in some columns on this platform. If there are no squares in the column, a square will occupy the bo...	```python def check_ponto(matriz): for i in range(len(matriz[0])): if (matriz[0][i] <1): return 0 for i in range(len(matriz[0])): matriz[0][i]-=1 return 1 n, m = input().split() lista = input().split() matriz = [[0]*int(n)] pontuacao=0 for i in lista: matriz[0][int(i)-1] +=1 pontuacao += check_p...	0
682	A	Alyona and Numbers	PROGRAMMING	1,100	[ "constructive algorithms", "math", "number theory" ]		null	null	After finishing eating her bun, Alyona came up with two integers n and m. She decided to write down two columns of integers — the first column containing integers from 1 to n and the second containing integers from 1 to m. Now the girl wants to count how many pairs of integers she can choose, one from the first...	The only line of the input contains two integers n and m (1<=≤<=n,<=m<=≤<=1<=000<=000).	Print the only integer — the number of pairs of integers (x,<=y) such that 1<=≤<=x<=≤<=n, 1<=≤<=y<=≤<=m and (x<=+<=y) is divisible by 5.	[ "6 12\n", "11 14\n", "1 5\n", "3 8\n", "5 7\n", "21 21\n" ]	[ "14\n", "31\n", "1\n", "5\n", "7\n", "88\n" ]	Following pairs are suitable in the first sample case: - for x = 1 fits y equal to 4 or 9; - for x = 2 fits y equal to 3 or 8; - for x = 3 fits y equal to 2, 7 or 12; - for x = 4 fits y equal to 1, 6 or 11; - for x = 5 fits y equal to 5 or 10; - for x = 6 fits y equal to 4 or 9. Only th...	500	[ { "input": "6 12", "output": "14" }, { "input": "11 14", "output": "31" }, { "input": "1 5", "output": "1" }, { "input": "3 8", "output": "5" }, { "input": "5 7", "output": "7" }, { "input": "21 21", "output": "88" }, { "input": "10 15", ...	1,626,253,559	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	10	1,000	69,427,200	# After finishing eating her bun, Alyona came up with two integers n and m. She decided to write down two columns of integers — the first column containing integers from 1 to n and the second containing integers from 1 to m. Now the girl wants to count how many pairs of integers she can choose, one from the first colum...	Title: Alyona and Numbers Time Limit: None seconds Memory Limit: None megabytes Problem Description: After finishing eating her bun, Alyona came up with two integers n and m. She decided to write down two columns of integers — the first column containing integers from 1 to n and the second containing integers ...	```python # After finishing eating her bun, Alyona came up with two integers n and m. She decided to write down two columns of integers — the first column containing integers from 1 to n and the second containing integers from 1 to m. Now the girl wants to count how many pairs of integers she can choose, one from the f...	0
389	A	Fox and Number Game	PROGRAMMING	1,000	[ "greedy", "math" ]		null	null	Fox Ciel is playing a game with numbers now. Ciel has n positive integers: x1, x2, ..., xn. She can do the following operation as many times as needed: select two different indexes i and j such that xi > xj hold, and then apply assignment xi = xi - xj. The goal is to make the sum ...	The first line contains an integer n (2<=≤<=n<=≤<=100). Then the second line contains n integers: x1, x2, ..., xn (1<=≤<=xi<=≤<=100).	Output a single integer — the required minimal sum.	[ "2\n1 2\n", "3\n2 4 6\n", "2\n12 18\n", "5\n45 12 27 30 18\n" ]	[ "2\n", "6\n", "12\n", "15\n" ]	In the first example the optimal way is to do the assignment: x<sub class="lower-index">2</sub> = x<sub class="lower-index">2</sub> - x<sub class="lower-index">1</sub>. In the second example the optimal sequence of operations is: x<sub class="lower-index">3</sub> = x<sub class="lower-index">3</sub> - x<sub...	500	[ { "input": "2\n1 2", "output": "2" }, { "input": "3\n2 4 6", "output": "6" }, { "input": "2\n12 18", "output": "12" }, { "input": "5\n45 12 27 30 18", "output": "15" }, { "input": "2\n1 1", "output": "2" }, { "input": "2\n100 100", "output": "200" ...	1,562,072,389	2,147,483,647	PyPy 3	OK	TESTS	34	140	1,433,600	n = int(input()) arr = list(map(int, input().split())) arr = sorted(arr, reverse=True) found = True while found is True: found = False for i in range(n): max_j = None for j in range(n): if i != j \ and arr[i] > arr[j] \ and (ma...	Title: Fox and Number Game Time Limit: None seconds Memory Limit: None megabytes Problem Description: Fox Ciel is playing a game with numbers now. Ciel has n positive integers: x1, x2, ..., xn. She can do the following operation as many times as needed: select two different indexes i and j such that ...	```python n = int(input()) arr = list(map(int, input().split())) arr = sorted(arr, reverse=True) found = True while found is True: found = False for i in range(n): max_j = None for j in range(n): if i != j \ and arr[i] > arr[j] \ ...	3
712	B	Memory and Trident	PROGRAMMING	1,100	[ "implementation", "strings" ]		null	null	Memory is performing a walk on the two-dimensional plane, starting at the origin. He is given a string s with his directions for motion: - An 'L' indicates he should move one unit left. - An 'R' indicates he should move one unit right. - A 'U' indicates he should move one unit up. - A 'D' indicates he should move...	The first and only line contains the string s (1<=≤<=\|s\|<=≤<=100<=000) — the instructions Memory is given.	If there is a string satisfying the conditions, output a single integer — the minimum number of edits required. In case it's not possible to change the sequence in such a way that it will bring Memory to to the origin, output -1.	[ "RRU\n", "UDUR\n", "RUUR\n" ]	[ "-1\n", "1\n", "2\n" ]	In the first sample test, Memory is told to walk right, then right, then up. It is easy to see that it is impossible to edit these instructions to form a valid walk. In the second sample test, Memory is told to walk up, then down, then up, then right. One possible solution is to change s to "LDUR". This string uses ...	1,000	[ { "input": "RRU", "output": "-1" }, { "input": "UDUR", "output": "1" }, { "input": "RUUR", "output": "2" }, { "input": "DDDD", "output": "2" }, { "input": "RRRR", "output": "2" }, { "input": "RRRUUD", "output": "2" }, { "input": "UDURLRDURL...	1,473,528,321	2,421	Python 3	OK	TESTS	75	93	307,200	R, L, U, D = 0, 0, 0, 0 for c in input(): if c == 'R': R += 1 elif c == 'L': L += 1 elif c == 'U': U += 1 elif c == 'D': D += 1 diff_RL = abs(R-L) diff_UD = abs(U-D) if (diff_RL % 2 == 0 and diff_UD % 2 == 0) or (diff_RL % 2 == 1 and diff_UD % 2 == 1): print((diff_...	Title: Memory and Trident Time Limit: None seconds Memory Limit: None megabytes Problem Description: Memory is performing a walk on the two-dimensional plane, starting at the origin. He is given a string s with his directions for motion: - An 'L' indicates he should move one unit left. - An 'R' indicates he shou...	```python R, L, U, D = 0, 0, 0, 0 for c in input(): if c == 'R': R += 1 elif c == 'L': L += 1 elif c == 'U': U += 1 elif c == 'D': D += 1 diff_RL = abs(R-L) diff_UD = abs(U-D) if (diff_RL % 2 == 0 and diff_UD % 2 == 0) or (diff_RL % 2 == 1 and diff_UD % 2 == 1): pr...	3
69	A	Young Physicist	PROGRAMMING	1,000	[ "implementation", "math" ]	A. Young Physicist	2	256	A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasy...	The first line contains a positive integer n (1<=≤<=n<=≤<=100), then follow n lines containing three integers each: the xi coordinate, the yi coordinate and the zi coordinate of the force vector, applied to the body (<=-<=100<=≤<=xi,<=yi,<=zi<=≤<=100).	Print the word "YES" if the body is in equilibrium, or the word "NO" if it is not.	[ "3\n4 1 7\n-2 4 -1\n1 -5 -3\n", "3\n3 -1 7\n-5 2 -4\n2 -1 -3\n" ]	[ "NO", "YES" ]	none	500	[ { "input": "3\n4 1 7\n-2 4 -1\n1 -5 -3", "output": "NO" }, { "input": "3\n3 -1 7\n-5 2 -4\n2 -1 -3", "output": "YES" }, { "input": "10\n21 32 -46\n43 -35 21\n42 2 -50\n22 40 20\n-27 -9 38\n-4 1 1\n-40 6 -31\n-13 -2 34\n-21 34 -12\n-32 -29 41", "output": "NO" }, { "input": "10...	1,624,468,400	2,147,483,647	Python 3	OK	TESTS	81	154	0	n = int(input()) vector = [0, 0, 0] for _ in range(n): dx, dy, dz = input().split() vector[0] += int(dx) vector[1] += int(dy) vector[2] += int(dz) if vector[0] or vector[1] or vector[2]: print("NO") else: print("YES")	Title: Young Physicist Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. S...	```python n = int(input()) vector = [0, 0, 0] for _ in range(n): dx, dy, dz = input().split() vector[0] += int(dx) vector[1] += int(dy) vector[2] += int(dz) if vector[0] or vector[1] or vector[2]: print("NO") else: print("YES") ```	3.9615
765	C	Table Tennis Game 2	PROGRAMMING	1,200	[ "math" ]		null	null	Misha and Vanya have played several table tennis sets. Each set consists of several serves, each serve is won by one of the players, he receives one point and the loser receives nothing. Once one of the players scores exactly k points, the score is reset and a new set begins. Across all the sets Misha scored a poi...	The first line contains three space-separated integers k, a and b (1<=≤<=k<=≤<=109, 0<=≤<=a,<=b<=≤<=109, a<=+<=b<=><=0).	If the situation is impossible, print a single number -1. Otherwise, print the maximum possible number of sets.	[ "11 11 5\n", "11 2 3\n" ]	[ "1\n", "-1\n" ]	Note that the rules of the game in this problem differ from the real table tennis game, for example, the rule of "balance" (the winning player has to be at least two points ahead to win a set) has no power within the present problem.	1,250	[ { "input": "11 11 5", "output": "1" }, { "input": "11 2 3", "output": "-1" }, { "input": "1 5 9", "output": "14" }, { "input": "2 3 3", "output": "2" }, { "input": "1 1000000000 1000000000", "output": "2000000000" }, { "input": "2 3 5", "output": "...	1,589,608,853	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	14	108	6,656,000	"""609C""" # import math def main(): k ,a, b = map(int,input().split()) ans = int(a//k) + int(b//k) if ans<=0: print(-1) else: print(ans) main() # t= int(input()) # while t: # main() # t-=1	Title: Table Tennis Game 2 Time Limit: None seconds Memory Limit: None megabytes Problem Description: Misha and Vanya have played several table tennis sets. Each set consists of several serves, each serve is won by one of the players, he receives one point and the loser receives nothing. Once one of the players scor...	```python """609C""" # import math def main(): k ,a, b = map(int,input().split()) ans = int(a//k) + int(b//k) if ans<=0: print(-1) else: print(ans) main() # t= int(input()) # while t: # main() # t-=1 ```	0
189	A	Cut Ribbon	PROGRAMMING	1,300	[ "brute force", "dp" ]		null	null	Polycarpus has a ribbon, its length is n. He wants to cut the ribbon in a way that fulfils the following two conditions: - After the cutting each ribbon piece should have length a, b or c. - After the cutting the number of ribbon pieces should be maximum. Help Polycarpus and find the number of ribbon piece...	The first line contains four space-separated integers n, a, b and c (1<=≤<=n,<=a,<=b,<=c<=≤<=4000) — the length of the original ribbon and the acceptable lengths of the ribbon pieces after the cutting, correspondingly. The numbers a, b and c can coincide.	Print a single number — the maximum possible number of ribbon pieces. It is guaranteed that at least one correct ribbon cutting exists.	[ "5 5 3 2\n", "7 5 5 2\n" ]	[ "2\n", "2\n" ]	In the first example Polycarpus can cut the ribbon in such way: the first piece has length 2, the second piece has length 3. In the second example Polycarpus can cut the ribbon in such way: the first piece has length 5, the second piece has length 2.	500	[ { "input": "5 5 3 2", "output": "2" }, { "input": "7 5 5 2", "output": "2" }, { "input": "4 4 4 4", "output": "1" }, { "input": "1 1 1 1", "output": "1" }, { "input": "4000 1 2 3", "output": "4000" }, { "input": "4000 3 4 5", "output": "1333" }, ...	1,680,427,416	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	19	62	0	n, a, b, c = map(int, input().split()) counter = 0 rest = 0 def div(N, num): global counter, rest counter = counter + N // num rest = N % num return not(rest) def step(rest, num): global counter counter = counter - 1 rest = rest + num mini = min(a, b, c) maxi = max(a, b, c) mid = a + b + c - mini - maxi if di...	Title: Cut Ribbon Time Limit: None seconds Memory Limit: None megabytes Problem Description: Polycarpus has a ribbon, its length is n. He wants to cut the ribbon in a way that fulfils the following two conditions: - After the cutting each ribbon piece should have length a, b or c. - After the cutting the...	```python n, a, b, c = map(int, input().split()) counter = 0 rest = 0 def div(N, num): global counter, rest counter = counter + N // num rest = N % num return not(rest) def step(rest, num): global counter counter = counter - 1 rest = rest + num mini = min(a, b, c) maxi = max(a, b, c) mid = a + b + c - mini - ...	0
265	A	Colorful Stones (Simplified Edition)	PROGRAMMING	800	[ "implementation" ]		null	null	There is a sequence of colorful stones. The color of each stone is one of red, green, or blue. You are given a string s. The i-th (1-based) character of s represents the color of the i-th stone. If the character is "R", "G", or "B", the color of the corresponding stone is red, green, or blue, respectively. Ini...	The input contains two lines. The first line contains the string s (1<=≤<=\|s\|<=≤<=50). The second line contains the string t (1<=≤<=\|t\|<=≤<=50). The characters of each string will be one of "R", "G", or "B". It is guaranteed that Liss don't move out of the sequence.	Print the final 1-based position of Liss in a single line.	[ "RGB\nRRR\n", "RRRBGBRBBB\nBBBRR\n", "BRRBGBRGRBGRGRRGGBGBGBRGBRGRGGGRBRRRBRBBBGRRRGGBBB\nBBRBGGRGRGBBBRBGRBRBBBBRBRRRBGBBGBBRRBBGGRBRRBRGRB\n" ]	[ "2\n", "3\n", "15\n" ]	none	500	[ { "input": "RGB\nRRR", "output": "2" }, { "input": "RRRBGBRBBB\nBBBRR", "output": "3" }, { "input": "BRRBGBRGRBGRGRRGGBGBGBRGBRGRGGGRBRRRBRBBBGRRRGGBBB\nBBRBGGRGRGBBBRBGRBRBBBBRBRRRBGBBGBBRRBBGGRBRRBRGRB", "output": "15" }, { "input": "G\nRRBBRBRRBR", "output": "1" }, ...	1,615,382,553	2,147,483,647	Python 3	OK	TESTS	19	124	0	s = input() t = input() index = 1 i = 0 for j in range(len(t)): if t[j] == s[i]: # print(t[j], s[j], j) index += 1 i += 1 # print(index) print(index)	Title: Colorful Stones (Simplified Edition) Time Limit: None seconds Memory Limit: None megabytes Problem Description: There is a sequence of colorful stones. The color of each stone is one of red, green, or blue. You are given a string s. The i-th (1-based) character of s represents the color of the i-th st...	```python s = input() t = input() index = 1 i = 0 for j in range(len(t)): if t[j] == s[i]: # print(t[j], s[j], j) index += 1 i += 1 # print(index) print(index) ```	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,597,532,348	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	34	109	307,200	s_i = input() s= s_i.lower() def search(string,letter,start): i = start found = False while i<len(s) and found == False: found = (s[i] == letter) i+=1 return i detected = False h = 'hello' i=0 index = 0 while i < 5 and index < len(s): index = searc...	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_i = input() s= s_i.lower() def search(string,letter,start): i = start found = False while i<len(s) and found == False: found = (s[i] == letter) i+=1 return i detected = False h = 'hello' i=0 index = 0 while i < 5 and index < len(s): ind...	0
499	B	Lecture	PROGRAMMING	1,000	[ "implementation", "strings" ]		null	null	You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes. You know two languages, and the professor is giving the lecture in the first one. The words in both languages consist of lowercase English characters, each language consi...	The first line contains two integers, n and m (1<=≤<=n<=≤<=3000, 1<=≤<=m<=≤<=3000) — the number of words in the professor's lecture and the number of words in each of these languages. The following m lines contain the words. The i-th line contains two strings ai, bi meaning that the word ai bel...	Output exactly n words: how you will record the lecture in your notebook. Output the words of the lecture in the same order as in the input.	[ "4 3\ncodeforces codesecrof\ncontest round\nletter message\ncodeforces contest letter contest\n", "5 3\njoll wuqrd\neuzf un\nhbnyiyc rsoqqveh\nhbnyiyc joll joll euzf joll\n" ]	[ "codeforces round letter round\n", "hbnyiyc joll joll un joll\n" ]	none	500	[ { "input": "4 3\ncodeforces codesecrof\ncontest round\nletter message\ncodeforces contest letter contest", "output": "codeforces round letter round" }, { "input": "5 3\njoll wuqrd\neuzf un\nhbnyiyc rsoqqveh\nhbnyiyc joll joll euzf joll", "output": "hbnyiyc joll joll un joll" }, { "input"...	1,650,035,462	2,147,483,647	Python 3	OK	TESTS	37	529	307,200	n, m = map(int, input().split()) w = [] w1 = [] r = [] k = 0 u = '' ans = [] for i in range(m): c = input().split(' ') w.append(c[0]) w1.append(c[1]) r.append(c[0]) r.append(c[1]) c = input().split(' ') for i in range(len(c)): if c[i] in w: k = w.index(c[i]) if c[i] ...	Title: Lecture Time Limit: None seconds Memory Limit: None megabytes Problem Description: You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes. You know two languages, and the professor is giving the lecture in the first ...	```python n, m = map(int, input().split()) w = [] w1 = [] r = [] k = 0 u = '' ans = [] for i in range(m): c = input().split(' ') w.append(c[0]) w1.append(c[1]) r.append(c[0]) r.append(c[1]) c = input().split(' ') for i in range(len(c)): if c[i] in w: k = w.index(c[i]) ...	3
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,585,646,518	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	2	124	0	# Python program to print all primes smaller than or equal to # n using Sieve of Eratosthenes def SieveOfEratosthenes(n,ls): # Create a boolean array "prime[0..n]" and initialize # all entries it as true. A value in prime[i] will # finally be false if i is Not a prime, else true. prime =...	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 # Python program to print all primes smaller than or equal to # n using Sieve of Eratosthenes def SieveOfEratosthenes(n,ls): # Create a boolean array "prime[0..n]" and initialize # all entries it as true. A value in prime[i] will # finally be false if i is Not a prime, else true. ...	0
99	A	Help Far Away Kingdom	PROGRAMMING	800	[ "strings" ]	A. Help Far Away Kingdom	2	256	In a far away kingdom lived the King, the Prince, the Shoemaker, the Dressmaker and many other citizens. They lived happily until great trouble came into the Kingdom. The ACMers settled there. Most damage those strange creatures inflicted upon the kingdom was that they loved high precision numbers. As a result, the Ki...	The first line contains a single number to round up — the integer part (a non-empty set of decimal digits that do not start with 0 — with the exception of a case when the set consists of a single digit — in this case 0 can go first), then follows character «.» (a dot), and then follows the fractional part (any non-empt...	If the last number of the integer part is not equal to 9, print the rounded-up number without leading zeroes. Otherwise, print the message "GOTO Vasilisa." (without the quotes).	[ "0.0\n", "1.49\n", "1.50\n", "2.71828182845904523536\n", "3.14159265358979323846\n", "12345678901234567890.1\n", "123456789123456789.999\n" ]	[ "0", "1", "2", "3", "3", "12345678901234567890", "GOTO Vasilisa." ]	none	500	[ { "input": "0.0", "output": "0" }, { "input": "1.49", "output": "1" }, { "input": "1.50", "output": "2" }, { "input": "2.71828182845904523536", "output": "3" }, { "input": "3.14159265358979323846", "output": "3" }, { "input": "12345678901234567890.1", ...	1,609,437,327	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	156	0	import sys inp = sys.stdin.readlines() if inp[0] == '9': print('GOTO Vasilisa.') else: if inp[2] < 0.5: number = inp[0] else: number = inp[0] + 1 print(number)	Title: Help Far Away Kingdom Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: In a far away kingdom lived the King, the Prince, the Shoemaker, the Dressmaker and many other citizens. They lived happily until great trouble came into the Kingdom. The ACMers settled there. Most damage those stran...	```python import sys inp = sys.stdin.readlines() if inp[0] == '9': print('GOTO Vasilisa.') else: if inp[2] < 0.5: number = inp[0] else: number = inp[0] + 1 print(number) ```	-1
34	A	Reconnaissance 2	PROGRAMMING	800	[ "implementation" ]	A. Reconnaissance 2	2	256	n soldiers stand in a circle. For each soldier his height ai is known. A reconnaissance unit can be made of such two neighbouring soldiers, whose heights difference is minimal, i.e. \|ai<=-<=aj\| is minimal. So each of them will be less noticeable with the other. Output any pair of soldiers that can form a ...	The first line contains integer n (2<=≤<=n<=≤<=100) — amount of soldiers. Then follow the heights of the soldiers in their order in the circle — n space-separated integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=1000). The soldier heights are given in clockwise or counterclockwise direction.	Output two integers — indexes of neighbouring soldiers, who should form a reconnaissance unit. If there are many optimum solutions, output any of them. Remember, that the soldiers stand in a circle.	[ "5\n10 12 13 15 10\n", "4\n10 20 30 40\n" ]	[ "5 1\n", "1 2\n" ]	none	500	[ { "input": "5\n10 12 13 15 10", "output": "5 1" }, { "input": "4\n10 20 30 40", "output": "1 2" }, { "input": "6\n744 359 230 586 944 442", "output": "2 3" }, { "input": "5\n826 747 849 687 437", "output": "1 2" }, { "input": "5\n999 999 993 969 999", "output"...	1,658,033,497	2,147,483,647	PyPy 3-64	RUNTIME_ERROR	TESTS	0	154	5,734,400	n=int(input()) t=[] for i in range(n): c=int(input()) t.append((c,i+1)) def start(ele): return ele[0] t.sort(key=start) print(t[0][1],t[1][1])	Title: Reconnaissance 2 Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: n soldiers stand in a circle. For each soldier his height ai is known. A reconnaissance unit can be made of such two neighbouring soldiers, whose heights difference is minimal, i.e. \|ai<=-<=aj\| is minimal. So...	```python n=int(input()) t=[] for i in range(n): c=int(input()) t.append((c,i+1)) def start(ele): return ele[0] t.sort(key=start) print(t[0][1],t[1][1]) ```	-1
919	D	Substring	PROGRAMMING	1,700	[ "dfs and similar", "dp", "graphs" ]		null	null	You are given a graph with $n$ nodes and $m$ directed edges. One lowercase letter is assigned to each node. We define a path's value as the number of the most frequently occurring letter. For example, if letters on a path are "abaca", then the value of that path is $3$. Your task is find a path whose value is the large...	The first line contains two positive integers $n, m$ ($1 \leq n, m \leq 300\,000$), denoting that the graph has $n$ nodes and $m$ directed edges. The second line contains a string $s$ with only lowercase English letters. The $i$-th character is the letter assigned to the $i$-th node. Then $m$ lines follow. Each line ...	Output a single line with a single integer denoting the largest value. If the value can be arbitrarily large, output -1 instead.	[ "5 4\nabaca\n1 2\n1 3\n3 4\n4 5\n", "6 6\nxzyabc\n1 2\n3 1\n2 3\n5 4\n4 3\n6 4\n", "10 14\nxzyzyzyzqx\n1 2\n2 4\n3 5\n4 5\n2 6\n6 8\n6 5\n2 10\n3 9\n10 9\n4 6\n1 10\n2 8\n3 7\n" ]	[ "3\n", "-1\n", "4\n" ]	In the first sample, the path with largest value is $1 \to 3 \to 4 \to 5$. The value is $3$ because the letter 'a' appears $3$ times.	1,500	[ { "input": "5 4\nabaca\n1 2\n1 3\n3 4\n4 5", "output": "3" }, { "input": "6 6\nxzyabc\n1 2\n3 1\n2 3\n5 4\n4 3\n6 4", "output": "-1" }, { "input": "10 14\nxzyzyzyzqx\n1 2\n2 4\n3 5\n4 5\n2 6\n6 8\n6 5\n2 10\n3 9\n10 9\n4 6\n1 10\n2 8\n3 7", "output": "4" }, { "input": "1 1\nf...	1,643,793,846	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	5	3,000	123,596,800	from collections import defaultdict as dd, deque n,m=list(map(int,input().split())) s=input() x=[] y=[] for i in range(m): x1,y1=list(map(int,input().split())) x.append(x1) y.append(y1) def beauty(n,m,sp,x,y): # n,m = map(int,input().split()) s = [ord(c)-ord('a') for c in sp] E = dd(...	Title: Substring Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given a graph with $n$ nodes and $m$ directed edges. One lowercase letter is assigned to each node. We define a path's value as the number of the most frequently occurring letter. For example, if letters on a path are...	```python from collections import defaultdict as dd, deque n,m=list(map(int,input().split())) s=input() x=[] y=[] for i in range(m): x1,y1=list(map(int,input().split())) x.append(x1) y.append(y1) def beauty(n,m,sp,x,y): # n,m = map(int,input().split()) s = [ord(c)-ord('a') for c in sp] ...	0
50	A	Domino piling	PROGRAMMING	800	[ "greedy", "math" ]	A. Domino piling	2	256	You are given a rectangular board of M<=×<=N squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions: 1. Each domino completely covers ...	In a single line you are given two integers M and N — board sizes in squares (1<=≤<=M<=≤<=N<=≤<=16).	Output one number — the maximal number of dominoes, which can be placed.	[ "2 4\n", "3 3\n" ]	[ "4\n", "4\n" ]	none	500	[ { "input": "2 4", "output": "4" }, { "input": "3 3", "output": "4" }, { "input": "1 5", "output": "2" }, { "input": "1 6", "output": "3" }, { "input": "1 15", "output": "7" }, { "input": "1 16", "output": "8" }, { "input": "2 5", "outpu...	1,691,467,589	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	92	0	A, B = map(int,input().split()) max_dominos = (M * N) // 2 print(max_dominos)	Title: Domino piling Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: You are given a rectangular board of M<=×<=N squares. Also you are given an unlimited number of standard domino pieces of 2<=×<=1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as p...	```python A, B = map(int,input().split()) max_dominos = (M * N) // 2 print(max_dominos) ```	-1
837	A	Text Volume	PROGRAMMING	800	[ "implementation" ]		null	null	You are given a text of single-space separated words, consisting of small and capital Latin letters. Volume of the word is number of capital letters in the word. Volume of the text is maximum volume of all words in the text. Calculate the volume of the given text.	The first line contains one integer number n (1<=≤<=n<=≤<=200) — length of the text. The second line contains text of single-space separated words s1,<=s2,<=...,<=si, consisting only of small and capital Latin letters.	Print one integer number — volume of text.	[ "7\nNonZERO\n", "24\nthis is zero answer text\n", "24\nHarbour Space University\n" ]	[ "5\n", "0\n", "1\n" ]	In the first example there is only one word, there are 5 capital letters in it. In the second example all of the words contain 0 capital letters.	0	[ { "input": "7\nNonZERO", "output": "5" }, { "input": "24\nthis is zero answer text", "output": "0" }, { "input": "24\nHarbour Space University", "output": "1" }, { "input": "2\nWM", "output": "2" }, { "input": "200\nLBmJKQLCKUgtTxMoDsEerwvLOXsxASSydOqWyULsRcjMYDWd...	1,594,278,452	2,147,483,647	PyPy 3	RUNTIME_ERROR	TESTS	0	202	22,323,200	n=int(input()) for i in range(n): str=input() ans=0 for j in range(n): if(int(str[j])<=92): ans+=1 print(ans)	Title: Text Volume Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given a text of single-space separated words, consisting of small and capital Latin letters. Volume of the word is number of capital letters in the word. Volume of the text is maximum volume of all words in the tex...	```python n=int(input()) for i in range(n): str=input() ans=0 for j in range(n): if(int(str[j])<=92): ans+=1 print(ans) ```	-1
595	B	Pasha and Phone	PROGRAMMING	1,600	[ "binary search", "math" ]		null	null	Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits. Also Pasha has a number k and two sequences of length n<=/<=k (n is divisible by k) a1,<=a2,<=...,<=an<=/<=k and b1,<=b2,<=...,<=bn<=/<=k. Le...	The first line of the input contains two integers n and k (1<=≤<=n<=≤<=100<=000, 1<=≤<=k<=≤<=min(n,<=9)) — the length of all phone numbers and the length of each block, respectively. It is guaranteed that n is divisible by k. The second line of the input contains n<=/<=k space-separated positive in...	Print a single integer — the number of good phone numbers of length n modulo 109<=+<=7.	[ "6 2\n38 56 49\n7 3 4\n", "8 2\n1 22 3 44\n5 4 3 2\n" ]	[ "8\n", "32400\n" ]	In the first test sample good phone numbers are: 000000, 000098, 005600, 005698, 380000, 380098, 385600, 385698.	1,000	[ { "input": "6 2\n38 56 49\n7 3 4", "output": "8" }, { "input": "8 2\n1 22 3 44\n5 4 3 2", "output": "32400" }, { "input": "2 1\n9 9\n9 9", "output": "1" }, { "input": "2 1\n9 9\n0 9", "output": "1" }, { "input": "4 1\n4 3 2 1\n1 2 3 4", "output": "540" }, ...	1,689,497,908	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	2	61	0	def solve(k, a, b): answer = 1 max_block = int('9' * k) for i in range(0, len(a)): if b[i] == 0: answer = ((max_block // a[i]) - (int(str(b[i]) + '9') // a[i]) - (int(str(b[i] - 1) + '9') // a[i])) else: answer = ((max_block // a[i]) - ((int(str(b[i]) + '9') ...	Title: Pasha and Phone Time Limit: None seconds Memory Limit: None megabytes Problem Description: Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits. Also Pasha has a number k and two sequences of length n<=/<=k (*...	```python def solve(k, a, b): answer = 1 max_block = int('9' * k) for i in range(0, len(a)): if b[i] == 0: answer = ((max_block // a[i]) - (int(str(b[i]) + '9') // a[i]) - (int(str(b[i] - 1) + '9') // a[i])) else: answer = ((max_block // a[i]) - ((int(str(b[i...	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,648,719,696	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	1	31	0	from math import pow, floor, log2 t = int(input()) for i in range(t): n = int(input()) ans = int(n(n+1)//2 - 2(pow(2, floor(log2(n))+1)-1)) if (log2(n) == int(log2(n))): print(ans) else: print(ans+2)	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 pow, floor, log2 t = int(input()) for i in range(t): n = int(input()) ans = int(n(n+1)//2 - 2(pow(2, floor(log2(n))+1)-1)) if (log2(n) == int(log2(n))): print(ans) else: print(ans+2) ```	0
50	D	Bombing	PROGRAMMING	2,100	[ "binary search", "dp", "probabilities" ]	D. Bombing	2	256	The commanding officers decided to drop a nuclear bomb on the enemy's forces. You are ordered to determine the power of the warhead that needs to be used. The enemy has N strategically important objects. Their positions are known due to the intelligence service. The aim of the strike is to deactivate at least K im...	The first line contains an integer N which represents the number of the enemy's objects (1<=≤<=N<=≤<=100). The second line contains two integers: K is the required number of deactivated objects, and ε is the maximally permitted probability of not completing the task, given in per mils (1<=≤<=K<=≤<=N, 1<=≤<=ε<...	Print the sought estimated impact radius of the warhead. The absolute or relative measure of the inaccuracy of your answer should not exceed 10<=-<=6.	[ "1\n1 500\n5 5\n1 2\n", "5\n3 100\n0 0\n3 4\n60 70\n100 100\n10 10\n5 12\n" ]	[ "3.84257761518762740\n", "13.45126176453737600\n" ]	none	2,000	[]	1,638,452,224	4,324	PyPy 3-64	RUNTIME_ERROR	TESTS	0	122	3,379,200	#f = open("b.txt") def readints(): return [int(x) for x in input().split(" ")] # return [int(x) for x in f.readline().split(" ")] n = readints()[0] k, epsilon = readints() epsilon = epsilon / 1000.0 x0, y0 = readints() xy = [readints() for _ in range(n)] # f.close() vd2 = [(x - x0)2+(y - y0) 2 for...	Title: Bombing Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: The commanding officers decided to drop a nuclear bomb on the enemy's forces. You are ordered to determine the power of the warhead that needs to be used. The enemy has N strategically important objects. Their positions are know...	```python #f = open("b.txt") def readints(): return [int(x) for x in input().split(" ")] # return [int(x) for x in f.readline().split(" ")] n = readints()[0] k, epsilon = readints() epsilon = epsilon / 1000.0 x0, y0 = readints() xy = [readints() for _ in range(n)] # f.close() vd2 = [(x - x0)**2+(y - y0...	-1
523	B	Mean Requests	PROGRAMMING	1,500	[ "*special", "implementation" ]		null	null	In this problem you will have to deal with a real algorithm that is used in the VK social network. As in any other company that creates high-loaded websites, the VK developers have to deal with request statistics regularly. An important indicator reflecting the load of the site is the mean number of requests for a cer...	The first line contains integer n (1<=≤<=n<=≤<=2·105), integer T (1<=≤<=T<=≤<=n) and real number c (1<=<<=c<=≤<=100) — the time range when the resource should work, the length of the time range during which we need the mean number of requests and the coefficient c of the work of approximate algorithm...	Print m lines. The j-th line must contain three numbers real, approx and error, where: - is the real mean number of queries for the last T seconds; - approx is calculated by the given algorithm and equals mean at the moment of time t<==<=pj (that is, after implementing the pj-th iteration ...	[ "1 1 2.000000\n1\n1\n1\n", "11 4 1.250000\n9 11 7 5 15 6 6 6 6 6 6\n8\n4 5 6 7 8 9 10 11\n", "13 4 1.250000\n3 3 3 3 3 20 3 3 3 3 3 3 3\n10\n4 5 6 7 8 9 10 11 12 13\n" ]	[ "1.000000 0.500000 0.500000\n", "8.000000 4.449600 0.443800\n9.500000 6.559680 0.309507\n8.250000 6.447744 0.218455\n8.000000 6.358195 0.205226\n8.250000 6.286556 0.237993\n6.000000 6.229245 0.038207\n6.000000 6.183396 0.030566\n6.000000 6.146717 0.024453\n", "3.000000 1.771200 0.409600\n3.000000 2.016960 0.327...	none	1,000	[ { "input": "1 1 2.000000\n1\n1\n1", "output": "1.000000 0.500000 0.500000" }, { "input": "11 4 1.250000\n9 11 7 5 15 6 6 6 6 6 6\n8\n4 5 6 7 8 9 10 11", "output": "8.000000 4.449600 0.443800\n9.500000 6.559680 0.309507\n8.250000 6.447744 0.218455\n8.000000 6.358195 0.205226\n8.250000 6.286556 0....	1,426,438,450	2,147,483,647	Python 3	COMPILATION_ERROR	TESTS	0	0	0	var n,t,m,i,pos:integer; c,approx,rl:double; a,p:array[0..200000]of int64; begin a[0]:=0; readln(n,t,c); read(a[1]); for i:=2 to n do begin read(a[i]); inc(a[i],a[i-1]); end; readln(m); for i:=1 to m do read(p[i]); rl:=0; approx:=0; pos:=...	Title: Mean Requests Time Limit: None seconds Memory Limit: None megabytes Problem Description: In this problem you will have to deal with a real algorithm that is used in the VK social network. As in any other company that creates high-loaded websites, the VK developers have to deal with request statistics regular...	```python var n,t,m,i,pos:integer; c,approx,rl:double; a,p:array[0..200000]of int64; begin a[0]:=0; readln(n,t,c); read(a[1]); for i:=2 to n do begin read(a[i]); inc(a[i],a[i-1]); end; readln(m); for i:=1 to m do read(p[i]); rl:=0; approx:=0; ...	-1
379	A	New Year Candles	PROGRAMMING	1,000	[ "implementation" ]		null	null	Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles. Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make b went out candles into a new candle. As a result, this new candle can be used ...	The single line contains two integers, a and b (1<=≤<=a<=≤<=1000; 2<=≤<=b<=≤<=1000).	Print a single integer — the number of hours Vasily can light up the room for.	[ "4 2\n", "6 3\n" ]	[ "7\n", "8\n" ]	Consider the first sample. For the first four hours Vasily lights up new candles, then he uses four burned out candles to make two new ones and lights them up. When these candles go out (stop burning), Vasily can make another candle. Overall, Vasily can light up the room for 7 hours.	500	[ { "input": "4 2", "output": "7" }, { "input": "6 3", "output": "8" }, { "input": "1000 1000", "output": "1001" }, { "input": "123 5", "output": "153" }, { "input": "1000 2", "output": "1999" }, { "input": "1 2", "output": "1" }, { "input": ...	1,658,141,750	2,147,483,647	Python 3	OK	TESTS	32	46	0	a,b=[int(i) for i in input().split()] hours=0 woc=0 while a!=0 or woc>=b: hours+=a woc+=a a=woc//b woc=woc%b print(hours)	Title: New Year Candles Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles. Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is s...	```python a,b=[int(i) for i in input().split()] hours=0 woc=0 while a!=0 or woc>=b: hours+=a woc+=a a=woc//b woc=woc%b print(hours) ```	3
69	A	Young Physicist	PROGRAMMING	1,000	[ "implementation", "math" ]	A. Young Physicist	2	256	A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasy...	The first line contains a positive integer n (1<=≤<=n<=≤<=100), then follow n lines containing three integers each: the xi coordinate, the yi coordinate and the zi coordinate of the force vector, applied to the body (<=-<=100<=≤<=xi,<=yi,<=zi<=≤<=100).	Print the word "YES" if the body is in equilibrium, or the word "NO" if it is not.	[ "3\n4 1 7\n-2 4 -1\n1 -5 -3\n", "3\n3 -1 7\n-5 2 -4\n2 -1 -3\n" ]	[ "NO", "YES" ]	none	500	[ { "input": "3\n4 1 7\n-2 4 -1\n1 -5 -3", "output": "NO" }, { "input": "3\n3 -1 7\n-5 2 -4\n2 -1 -3", "output": "YES" }, { "input": "10\n21 32 -46\n43 -35 21\n42 2 -50\n22 40 20\n-27 -9 38\n-4 1 1\n-40 6 -31\n-13 -2 34\n-21 34 -12\n-32 -29 41", "output": "NO" }, { "input": "10...	1,685,646,910	2,147,483,647	Python 3	OK	TESTS	81	92	0	n=int(input()) result=[] for m in range(n): m=input() n=m.split(" ") result.append(n) bol=True for m in range(3): summ=0 for k in range(len(result)): summ+=int(result[k][m]) if summ!=0: bol=False break if bol==True: print("YES") else: print("NO") ...	Title: Young Physicist Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. S...	```python n=int(input()) result=[] for m in range(n): m=input() n=m.split(" ") result.append(n) bol=True for m in range(3): summ=0 for k in range(len(result)): summ+=int(result[k][m]) if summ!=0: bol=False break if bol==True: print("YES") else: pr...	3.977
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,609,706,287	2,147,483,647	Python 3	OK	TESTS	102	108	0	num1 = input() num2 = input() res = "" for i in range(len(num1)): if (num1[i] == '1' and num2[i] == '0') or (num1[i] == '0' and num2[i] == '1'): res += '1' else: res += '0' print(res)	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 num1 = input() num2 = input() res = "" for i in range(len(num1)): if (num1[i] == '1' and num2[i] == '0') or (num1[i] == '0' and num2[i] == '1'): res += '1' else: res += '0' print(res) ```	3.973
716	B	Complete the Word	PROGRAMMING	1,300	[ "greedy", "two pointers" ]		null	null	ZS the Coder loves to read the dictionary. He thinks that a word is nice if there exists a substring (contiguous segment of letters) of it of length 26 where each letter of English alphabet appears exactly once. In particular, if the string has length strictly less than 26, no such substring exists and thus it is not n...	The first and only line of the input contains a single string s (1<=≤<=\|s\|<=≤<=50<=000), the word that ZS the Coder remembers. Each character of the string is the uppercase letter of English alphabet ('A'-'Z') or is a question mark ('?'), where the question marks denotes the letters that ZS the Coder can't remember...	If there is no way to replace all the question marks with uppercase letters such that the resulting word is nice, then print <=-<=1 in the only line. Otherwise, print a string which denotes a possible nice word that ZS the Coder learned. This string should match the string from the input, except for the question marks...	[ "ABC??FGHIJK???OPQR?TUVWXY?\n", "WELCOMETOCODEFORCESROUNDTHREEHUNDREDANDSEVENTYTWO\n", "??????????????????????????\n", "AABCDEFGHIJKLMNOPQRSTUVW??M\n" ]	[ "ABCDEFGHIJKLMNOPQRZTUVWXYS", "-1", "MNBVCXZLKJHGFDSAQPWOEIRUYT", "-1" ]	In the first sample case, ABCDEFGHIJKLMNOPQRZTUVWXYS is a valid answer beacuse it contains a substring of length 26 (the whole string in this case) which contains all the letters of the English alphabet exactly once. Note that there are many possible solutions, such as ABCDEFGHIJKLMNOPQRSTUVWXYZ or ABCEDFGHIJKLMNOPQRZT...	1,000	[ { "input": "ABC??FGHIJK???OPQR?TUVWXY?", "output": "ABCDEFGHIJKLMNOPQRSTUVWXYZ" }, { "input": "WELCOMETOCODEFORCESROUNDTHREEHUNDREDANDSEVENTYTWO", "output": "-1" }, { "input": "??????????????????????????", "output": "ABCDEFGHIJKLMNOPQRSTUVWXYZ" }, { "input": "AABCDEFGHIJKLMNO...	1,594,839,704	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	5	124	20,172,800	s = input() dis = set() freq = [0]*26 que = 0 n = len(s) if n<26: print(-1) else: for i in s: if i != '?': dis.add(i) freq[ord(i)-65] += 1 else: que += 1 m = len(dis) #print(dis,m,que) if m==26: print(s) elif m+que>=26...	Title: Complete the Word Time Limit: None seconds Memory Limit: None megabytes Problem Description: ZS the Coder loves to read the dictionary. He thinks that a word is nice if there exists a substring (contiguous segment of letters) of it of length 26 where each letter of English alphabet appears exactly once. In pa...	```python s = input() dis = set() freq = [0]*26 que = 0 n = len(s) if n<26: print(-1) else: for i in s: if i != '?': dis.add(i) freq[ord(i)-65] += 1 else: que += 1 m = len(dis) #print(dis,m,que) if m==26: print(s) elif...	0
731	A	Night at the Museum	PROGRAMMING	800	[ "implementation", "strings" ]		null	null	Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition. Embosser is a special devise that allows to "print" the text of a plastic tape. Text is printed sequentially, character by character...	The only line of input contains the name of some exhibit — the non-empty string consisting of no more than 100 characters. It's guaranteed that the string consists of only lowercase English letters.	Print one integer — the minimum number of rotations of the wheel, required to print the name given in the input.	[ "zeus\n", "map\n", "ares\n" ]	[ "18\n", "35\n", "34\n" ]	To print the string from the first sample it would be optimal to perform the following sequence of rotations: 1. from 'a' to 'z' (1 rotation counterclockwise), 1. from 'z' to 'e' (5 clockwise rotations), 1. from 'e' to 'u' (10 rotations counterclockwise), 1. from 'u' to 's' (2 counterclockwise rotations).	500	[ { "input": "zeus", "output": "18" }, { "input": "map", "output": "35" }, { "input": "ares", "output": "34" }, { "input": "l", "output": "11" }, { "input": "abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuv", "...	1,684,761,103	2,147,483,647	PyPy 3-64	OK	TESTS	44	62	0	s=input() x=0 now='a' for i in range(len(s)): if s[i]!=now: if ord(s[i])>ord(now): if abs((ord(s[i])-26)-ord(now))<abs(ord(s[i])-ord(now)): x+=abs(ord(s[i])-26-ord(now)) now=s[i] else : x+=abs(ord(s[i])-ord(now)) ...	Title: Night at the Museum Time Limit: None seconds Memory Limit: None megabytes Problem Description: Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition. Embosser is a special devis...	```python s=input() x=0 now='a' for i in range(len(s)): if s[i]!=now: if ord(s[i])>ord(now): if abs((ord(s[i])-26)-ord(now))<abs(ord(s[i])-ord(now)): x+=abs(ord(s[i])-26-ord(now)) now=s[i] else : x+=abs(ord(s[i])-ord(now)) ...	3
817	C	Really Big Numbers	PROGRAMMING	1,600	[ "binary search", "brute force", "dp", "math" ]		null	null	Ivan likes to learn different things about numbers, but he is especially interested in really big numbers. Ivan thinks that a positive integer number x is really big if the difference between x and the sum of its digits (in decimal representation) is not less than s. To prove that these numbers may have different...	The first (and the only) line contains two integers n and s (1<=≤<=n,<=s<=≤<=1018).	Print one integer — the quantity of really big numbers that are not greater than n.	[ "12 1\n", "25 20\n", "10 9\n" ]	[ "3\n", "0\n", "1\n" ]	In the first example numbers 10, 11 and 12 are really big. In the second example there are no really big numbers that are not greater than 25 (in fact, the first really big number is 30: 30 - 3 ≥ 20). In the third example 10 is the only really big number (10 - 1 ≥ 9).	0	[ { "input": "12 1", "output": "3" }, { "input": "25 20", "output": "0" }, { "input": "10 9", "output": "1" }, { "input": "300 1000", "output": "0" }, { "input": "500 1000", "output": "0" }, { "input": "1000 2000", "output": "0" }, { "input":...	1,497,541,464	2,364	Python 3	OK	TESTS	68	62	0	inp=input().split() n=int(inp[0]) s=int(inp[1]) start=s+1 thresh=s+500 ans=0 if(n>thresh): ans+=n-thresh else: thresh=n val=0 for i in range(start,thresh+1): val=i while(i>0): val-=i%10 i=i//10 if(val>=s): ans+=1 print(ans)	Title: Really Big Numbers Time Limit: None seconds Memory Limit: None megabytes Problem Description: Ivan likes to learn different things about numbers, but he is especially interested in really big numbers. Ivan thinks that a positive integer number x is really big if the difference between x and the sum of its...	```python inp=input().split() n=int(inp[0]) s=int(inp[1]) start=s+1 thresh=s+500 ans=0 if(n>thresh): ans+=n-thresh else: thresh=n val=0 for i in range(start,thresh+1): val=i while(i>0): val-=i%10 i=i//10 if(val>=s): ans+=1 print(ans) ```	3
697	B	Barnicle	PROGRAMMING	1,400	[ "brute force", "implementation", "math", "strings" ]		null	null	Barney is standing in a bar and starring at a pretty girl. He wants to shoot her with his heart arrow but he needs to know the distance between him and the girl to make his shot accurate. Barney asked the bar tender Carl about this distance value, but Carl was so busy talking to the customers so he wrote the distance ...	The first and only line of input contains a single string of form a.deb where a, d and b are integers and e is usual character 'e' (0<=≤<=a<=≤<=9,<=0<=≤<=d<=<<=10100,<=0<=≤<=b<=≤<=100) — the scientific notation of the desired distance value. a and b contain no leading zeros and d contains no...	Print the only real number x (the desired distance value) in the only line in its decimal notation. Thus if x is an integer, print it's integer value without decimal part and decimal point and without leading zeroes. Otherwise print x in a form of p.q such that p is an integer that have no leading zeroe...	[ "8.549e2\n", "8.549e3\n", "0.33e0\n" ]	[ "854.9\n", "8549\n", "0.33\n" ]	none	1,000	[ { "input": "8.549e2", "output": "854.9" }, { "input": "8.549e3", "output": "8549" }, { "input": "0.33e0", "output": "0.33" }, { "input": "1.31e1", "output": "13.1" }, { "input": "1.038e0", "output": "1.038" }, { "input": "8.25983e5", "output": "825...	1,469,722,666	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	28	77	0	line = input().split('e') p = line[0] po = int(line[1]) pos = p.find('.') npos = pos + po + 1 while npos > len(p): p = p + '0' p = p[:pos] + p[pos+1:npos] + '.' + p[npos:] if p[-1] == '.': p = p[:-1] print(p)	Title: Barnicle Time Limit: None seconds Memory Limit: None megabytes Problem Description: Barney is standing in a bar and starring at a pretty girl. He wants to shoot her with his heart arrow but he needs to know the distance between him and the girl to make his shot accurate. Barney asked the bar tender Carl abou...	```python line = input().split('e') p = line[0] po = int(line[1]) pos = p.find('.') npos = pos + po + 1 while npos > len(p): p = p + '0' p = p[:pos] + p[pos+1:npos] + '.' + p[npos:] if p[-1] == '.': p = p[:-1] print(p) ```	0
664	A	Complicated GCD	PROGRAMMING	800	[ "math", "number theory" ]		null	null	Greatest common divisor GCD(a,<=b) of two positive integers a and b is equal to the biggest integer d such that both integers a and b are divisible by d. There are many efficient algorithms to find greatest common divisor GCD(a,<=b), for example, Euclid algorithm. Formally, find the biggest in...	The only line of the input contains two integers a and b (1<=≤<=a<=≤<=b<=≤<=10100).	Output one integer — greatest common divisor of all integers from a to b inclusive.	[ "1 2\n", "61803398874989484820458683436563811772030917980576 61803398874989484820458683436563811772030917980576\n" ]	[ "1\n", "61803398874989484820458683436563811772030917980576\n" ]	none	500	[ { "input": "1 2", "output": "1" }, { "input": "61803398874989484820458683436563811772030917980576 61803398874989484820458683436563811772030917980576", "output": "61803398874989484820458683436563811772030917980576" }, { "input": "1 100", "output": "1" }, { "input": "100 100000...	1,619,706,881	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	30	0	def find_gcd(a,b): while b: a,b =b,a%b return a print(find_gcd(61803398874989484820458683436563811772030917980576, 61803398874989484820458683436563811772030917980576 ))	Title: Complicated GCD Time Limit: None seconds Memory Limit: None megabytes Problem Description: Greatest common divisor GCD(a,<=b) of two positive integers a and b is equal to the biggest integer d such that both integers a and b are divisible by d. There are many efficient algorithms to find gre...	```python def find_gcd(a,b): while b: a,b =b,a%b return a print(find_gcd(61803398874989484820458683436563811772030917980576, 61803398874989484820458683436563811772030917980576 )) ```	0
78	B	Easter Eggs	PROGRAMMING	1,200	[ "constructive algorithms", "implementation" ]	B. Easter Eggs	2	256	The Easter Rabbit laid n eggs in a circle and is about to paint them. Each egg should be painted one color out of 7: red, orange, yellow, green, blue, indigo or violet. Also, the following conditions should be satisfied: - Each of the seven colors should be used to paint at least one egg. - Any four eggs lying s...	The only line contains an integer n — the amount of eggs (7<=≤<=n<=≤<=100).	Print one line consisting of n characters. The i-th character should describe the color of the i-th egg in the order they lie in the circle. The colors should be represented as follows: "R" stands for red, "O" stands for orange, "Y" stands for yellow, "G" stands for green, "B" stands for blue, "I" stands for indi...	[ "8\n", "13\n" ]	[ "ROYGRBIV\n", "ROYGBIVGBIVYG\n" ]	The way the eggs will be painted in the first sample is shown on the picture:	1,000	[ { "input": "8", "output": "ROYGBIVG" }, { "input": "13", "output": "ROYGBIVOYGBIV" }, { "input": "7", "output": "ROYGBIV" }, { "input": "10", "output": "ROYGBIVYGB" }, { "input": "14", "output": "ROYGBIVROYGBIV" }, { "input": "50", "output": "ROYGB...	1,574,169,309	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	154	0	a = int(input()) s = "ROYGBIV" if a > 7: print(a // 7 * s + s[3:] * 2[:a]) else: print(s[:a])	Title: Easter Eggs Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: The Easter Rabbit laid n eggs in a circle and is about to paint them. Each egg should be painted one color out of 7: red, orange, yellow, green, blue, indigo or violet. Also, the following conditions should be satisfied: -...	```python a = int(input()) s = "ROYGBIV" if a > 7: print(a // 7 * s + s[3:] * 2[:a]) else: print(s[:a]) ```	-1
369	E	Valera and Queries	PROGRAMMING	2,200	[ "binary search", "data structures" ]		null	null	Valera loves segments. He has recently come up with one interesting problem. The Ox axis of coordinates has n segments, the i-th segment starts in position li and ends in position ri (we will mark it as [li,<=ri]). Your task is to process m queries, each consists of number cnti and a set of...	The first line contains two integers n, m (1<=≤<=n,<=m<=≤<=3·105) — the number of segments on the axis of coordinates and the number of queries. Next n lines contain the descriptions of the segments. The i-th line contains two positive integers li, ri (1<=≤<=li<=≤<=ri<=≤<=106) — the border...	Print m non-negative integers, where the i-th number is the response to the i-th query.	[ "3 3\n1 3\n4 5\n6 7\n3 1 4 7\n2 4 5\n1 8\n" ]	[ "3\n1\n0\n" ]	none	2,500	[ { "input": "3 3\n1 3\n4 5\n6 7\n3 1 4 7\n2 4 5\n1 8", "output": "3\n1\n0" }, { "input": "1 1\n172921 894619\n1 14141", "output": "0" }, { "input": "3 1\n439010 864662\n377278 743032\n771051 955458\n1 568232", "output": "2" }, { "input": "3 3\n328789 478281\n248154 348247\n820...	1,646,831,763	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	1	2,000	89,088,000	import sys readline=sys.stdin.readline class Dual_Segment_Tree: def __init__(self,N,f_act,e_act,operate,lst): self.N=N self.f_act=f_act self.e_act=e_act self.operate=operate self.lst=[None]*self.N for i,x in enumerate(lst): self.lst[i]=x ...	Title: Valera and Queries Time Limit: None seconds Memory Limit: None megabytes Problem Description: Valera loves segments. He has recently come up with one interesting problem. The Ox axis of coordinates has n segments, the i-th segment starts in position li and ends in position ri (we will mark it a...	```python import sys readline=sys.stdin.readline class Dual_Segment_Tree: def __init__(self,N,f_act,e_act,operate,lst): self.N=N self.f_act=f_act self.e_act=e_act self.operate=operate self.lst=[None]*self.N for i,x in enumerate(lst): self.lst[i...	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,611,145,259	2,147,483,647	Python 3	OK	TESTS	30	124	0	k=input() u=l=0 for a in k: if a.isupper()==True: u+=1 else: l+=1 if u>l: print(k.upper()) else: print(k.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 k=input() u=l=0 for a in k: if a.isupper()==True: u+=1 else: l+=1 if u>l: print(k.upper()) else: print(k.lower()) ```	3.969
735	A	Ostap and Grasshopper	PROGRAMMING	800	[ "implementation", "strings" ]		null	null	On the way to Rio de Janeiro Ostap kills time playing with a grasshopper he took with him in a special box. Ostap builds a line of length n such that some cells of this line are empty and some contain obstacles. Then, he places his grasshopper to one of the empty cells and a small insect in another empty cell. The gr...	The first line of the input contains two integers n and k (2<=≤<=n<=≤<=100, 1<=≤<=k<=≤<=n<=-<=1) — the number of cells in the line and the length of one grasshopper's jump. The second line contains a string of length n consisting of characters '.', '#', 'G' and 'T'. Character '.' means that the correspondi...	If there exists a sequence of jumps (each jump of length k), such that the grasshopper can get from his initial position to the cell with the insect, print "YES" (without quotes) in the only line of the input. Otherwise, print "NO" (without quotes).	[ "5 2\n#G#T#\n", "6 1\nT....G\n", "7 3\nT..#..G\n", "6 2\n..GT..\n" ]	[ "YES\n", "YES\n", "NO\n", "NO\n" ]	In the first sample, the grasshopper can make one jump to the right in order to get from cell 2 to cell 4. In the second sample, the grasshopper is only able to jump to neighboring cells but the way to the insect is free — he can get there by jumping left 5 times. In the third sample, the grasshopper can't make a sin...	500	[ { "input": "5 2\n#G#T#", "output": "YES" }, { "input": "6 1\nT....G", "output": "YES" }, { "input": "7 3\nT..#..G", "output": "NO" }, { "input": "6 2\n..GT..", "output": "NO" }, { "input": "2 1\nGT", "output": "YES" }, { "input": "100 5\nG####.####.###...	1,632,640,475	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	12	61	6,963,200	n, k = map(int, input().split(" ")) s = input() for i in range(0,len(s)): if s[i]=='T': a = i if s[i]=='G': b = i if b<a: s = s else: s = s[::-1] #print(s) for i in range(0,len(s)): if s[i]=='G': loc_G = i #print(loc_G) flag = False li = [] for i in range(...	Title: Ostap and Grasshopper Time Limit: None seconds Memory Limit: None megabytes Problem Description: On the way to Rio de Janeiro Ostap kills time playing with a grasshopper he took with him in a special box. Ostap builds a line of length n such that some cells of this line are empty and some contain obstacles....	```python n, k = map(int, input().split(" ")) s = input() for i in range(0,len(s)): if s[i]=='T': a = i if s[i]=='G': b = i if b<a: s = s else: s = s[::-1] #print(s) for i in range(0,len(s)): if s[i]=='G': loc_G = i #print(loc_G) flag = False li = [] for i...	0
570	E	Pig and Palindromes	PROGRAMMING	2,300	[ "combinatorics", "dp" ]		null	null	Peppa the Pig was walking and walked into the forest. What a strange coincidence! The forest has the shape of a rectangle, consisting of n rows and m columns. We enumerate the rows of the rectangle from top to bottom with numbers from 1 to n, and the columns — from left to right with numbers from 1 to m. Let's ...	The first line contains two integers n,<=m (1<=≤<=n,<=m<=≤<=500) — the height and width of the field. Each of the following n lines contains m lowercase English letters identifying the types of cells of the forest. Identical cells are represented by identical letters, different cells are represented by dif...	Print a single integer — the number of beautiful paths modulo 109<=+<=7.	[ "3 4\naaab\nbaaa\nabba\n" ]	[ "3" ]	Picture illustrating possibilities for the sample test. <img class="tex-graphics" src="https://espresso.codeforces.com/bf73568d1cf80d89f66d4e472a91ae0339af83a2.png" style="max-width: 100.0%;max-height: 100.0%;"/> <img class="tex-graphics" src="https://espresso.codeforces.com/1e870880d976e642be85498efab6bbd10bae8a84...	2,500	[ { "input": "3 4\naaab\nbaaa\nabba", "output": "3" }, { "input": "2 2\nab\naa", "output": "2" }, { "input": "3 5\nqqqrw\nwqqtw\newqqq", "output": "3" }, { "input": "1 5\nabbba", "output": "1" }, { "input": "1 5\nabbbb", "output": "0" }, { "input": "1 4\...	1,690,732,259	2,147,483,647	PyPy 3-64	WRONG_ANSWER	TESTS	0	46	0	print("_RANDOM_GUESS_1690732259.5139399")# 1690732259.5139587	Title: Pig and Palindromes Time Limit: None seconds Memory Limit: None megabytes Problem Description: Peppa the Pig was walking and walked into the forest. What a strange coincidence! The forest has the shape of a rectangle, consisting of n rows and m columns. We enumerate the rows of the rectangle from top to b...	```python print("_RANDOM_GUESS_1690732259.5139399")# 1690732259.5139587 ```	0
699	B	One Bomb	PROGRAMMING	1,400	[ "implementation" ]		null	null	You are given a description of a depot. It is a rectangular checkered field of n<=×<=m size. Each cell in a field can be empty (".") or it can be occupied by a wall (""). You have one bomb. If you lay the bomb at the cell (x,<=y), then after triggering it will wipe out all walls in the row x* and all walls ...	The first line contains two positive integers n and m (1<=≤<=n,<=m<=≤<=1000) — the number of rows and columns in the depot field. The next n lines contain m symbols "." and "" each — the description of the field. j-th symbol in i-th of them stands for cell (i,<=j*). If the symbol is equal to ".", ...	If it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print "NO" in the first line (without quotes). Otherwise print "YES" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple an...	[ "3 4\n...\n....\n...\n", "3 3\n..\n..\n..\n", "6 5\n....\n....\n***\n....\n....\n....\n" ]	[ "YES\n1 2\n", "NO\n", "YES\n3 3\n" ]	none	1,000	[ { "input": "3 4\n...\n....\n...", "output": "YES\n1 2" }, { "input": "3 3\n..\n..\n..", "output": "NO" }, { "input": "6 5\n....\n....\n***\n....\n....\n....", "output": "YES\n3 3" }, { "input": "1 10\n**********", "output": "YES\n1 1" }, { "input": "10...	1,468,941,510	8,010	Python 3	RUNTIME_ERROR	PRETESTS	0	31	0	a = input().split() b = [] c = [] for i in range(int(a[0])): d = input() for j in range(int(a[1])): if d[j]=='*': if (i not in b) and (j not in c): b.append(i) c.append(j) if (i in b) and len(c)!=0 and (j not in c): c.re...	Title: One Bomb Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given a description of a depot. It is a rectangular checkered field of n<=×<=m size. Each cell in a field can be empty (".") or it can be occupied by a wall ("*"). You have one bomb. If you lay the bomb at the ce...	```python a = input().split() b = [] c = [] for i in range(int(a[0])): d = input() for j in range(int(a[1])): if d[j]=='*': if (i not in b) and (j not in c): b.append(i) c.append(j) if (i in b) and len(c)!=0 and (j not in c): ...	-1
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,693,557,955	2,147,483,647	PyPy 3-64	OK	TESTS	3	122	0	from sys import stdin def input(): return stdin.readline()[:-1] s=set() for i in range(175,181): s.add(i) c=3 n=1 cnt=0 while True: ans=(180*(n))/c if ans<=174: if ans==int(ans): s.add(ans) else: break n+=1 c+=1 for i in range(int(input())): q=int(input()) if q in s: print("YES") ...	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 from sys import stdin def input(): return stdin.readline()[:-1] s=set() for i in range(175,181): s.add(i) c=3 n=1 cnt=0 while True: ans=(180*(n))/c if ans<=174: if ans==int(ans): s.add(ans) else: break n+=1 c+=1 for i in range(int(input())): q=int(input()) if q in s: print...	3
573	B	Bear and Blocks	PROGRAMMING	1,600	[ "binary search", "data structures", "dp", "math" ]		null	null	Limak is a little bear who loves to play. Today he is playing by destroying block towers. He built n towers in a row. The i-th tower is made of hi identical blocks. For clarification see picture for the first sample. Limak will repeat the following operation till everything is destroyed. Block is called inter...	The first line contains single integer n (1<=≤<=n<=≤<=105). The second line contains n space-separated integers h1,<=h2,<=...,<=hn (1<=≤<=hi<=≤<=109) — sizes of towers.	Print the number of operations needed to destroy all towers.	[ "6\n2 1 4 6 2 2\n", "7\n3 3 3 1 3 3 3\n" ]	[ "3\n", "2\n" ]	The picture below shows all three operations for the first sample test. Each time boundary blocks are marked with red color.	1,000	[ { "input": "6\n2 1 4 6 2 2", "output": "3" }, { "input": "7\n3 3 3 1 3 3 3", "output": "2" }, { "input": "7\n5128 5672 5805 5452 5882 5567 5032", "output": "4" }, { "input": "10\n1 2 2 3 5 5 5 4 2 1", "output": "5" }, { "input": "14\n20 20 20 20 20 20 3 20 20 20 2...	1,487,579,273	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	0	61	4,608,000	#20170220 B. Bear and Blocks def destroyCounter(_list, counter): tmpList = list() tmpList2 = list() i = 0 tmp = 0 num = len(_list) while i < num: if i != 0 and i != num - 1: tmp = max(_list[i] - _list[i - 1], _list[i] - _list[i + 1]) if tmp <= 0: ...	Title: Bear and Blocks Time Limit: None seconds Memory Limit: None megabytes Problem Description: Limak is a little bear who loves to play. Today he is playing by destroying block towers. He built n towers in a row. The i-th tower is made of hi identical blocks. For clarification see picture for the first sa...	```python #20170220 B. Bear and Blocks def destroyCounter(_list, counter): tmpList = list() tmpList2 = list() i = 0 tmp = 0 num = len(_list) while i < num: if i != 0 and i != num - 1: tmp = max(_list[i] - _list[i - 1], _list[i] - _list[i + 1]) if tmp <...	0
877	E	Danil and a Part-time Job	PROGRAMMING	2,000	[ "bitmasks", "data structures", "trees" ]		null	null	Danil decided to earn some money, so he had found a part-time job. The interview have went well, so now he is a light switcher. Danil works in a rooted tree (undirected connected acyclic graph) with n vertices, vertex 1 is the root of the tree. There is a room in each vertex, light can be switched on or off in each ...	The first line contains a single integer n (1<=≤<=n<=≤<=200<=000) — the number of vertices in the tree. The second line contains n<=-<=1 space-separated integers p2,<=p3,<=...,<=pn (1<=≤<=pi<=<<=i), where pi is the ancestor of vertex i. The third line contains n space-separated integers...	For each task get v print the number of rooms in the subtree of v, in which the light is turned on.	[ "4\n1 1 1\n1 0 0 1\n9\nget 1\nget 2\nget 3\nget 4\npow 1\nget 1\nget 2\nget 3\nget 4\n" ]	[ "2\n0\n0\n1\n2\n1\n1\n0\n" ]	<img class="tex-graphics" src="https://espresso.codeforces.com/839c4a0a06cc547ffb8d937bfe52730b51c842b4.png" style="max-width: 100.0%;max-height: 100.0%;"/> The tree after the task pow 1.	2,250	[ { "input": "4\n1 1 1\n1 0 0 1\n9\nget 1\nget 2\nget 3\nget 4\npow 1\nget 1\nget 2\nget 3\nget 4", "output": "2\n0\n0\n1\n2\n1\n1\n0" }, { "input": "1\n\n1\n4\npow 1\nget 1\npow 1\nget 1", "output": "0\n1" }, { "input": "10\n1 2 3 4 2 4 1 7 8\n1 1 0 1 1 0 0 0 1 1\n10\npow 1\nget 2\npow 2\...	1,556,076,951	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	6	108	307,200	class Node: def __init__(self): self.parent = None self.on = False self.children = [] self.count = -1 def toggle(self): self.on = not self.on count = 0 for child in self.children: child.toggle() count += child.count self.c...	Title: Danil and a Part-time Job Time Limit: None seconds Memory Limit: None megabytes Problem Description: Danil decided to earn some money, so he had found a part-time job. The interview have went well, so now he is a light switcher. Danil works in a rooted tree (undirected connected acyclic graph) with n verti...	```python class Node: def __init__(self): self.parent = None self.on = False self.children = [] self.count = -1 def toggle(self): self.on = not self.on count = 0 for child in self.children: child.toggle() count += child.count ...	0
598	D	Igor In the Museum	PROGRAMMING	1,700	[ "dfs and similar", "graphs", "shortest paths" ]		null	null	Igor is in the museum and he wants to see as many pictures as possible. Museum can be represented as a rectangular field of n<=×<=m cells. Each cell is either empty or impassable. Empty cells are marked with '.', impassable cells are marked with '*'. Every two adjacent cells of different types (one empty and one i...	First line of the input contains three integers n, m and k (3<=≤<=n,<=m<=≤<=1000,<=1<=≤<=k<=≤<=min(n·m,<=100<=000)) — the museum dimensions and the number of starting positions to process. Each of the next n lines contains m symbols '.', '*' — the description of the museum. It is guaranteed that ...	Print k integers — the maximum number of pictures, that Igor can see if he starts in corresponding position.	[ "5 6 3\n*****\n...\n*****\n....\n***\n2 2\n2 5\n4 3\n", "4 4 1\n*\n..\n.\n**\n3 2\n" ]	[ "6\n4\n10\n", "8\n" ]	none	0	[ { "input": "5 6 3\n*****\n...\n*****\n....\n***\n2 2\n2 5\n4 3", "output": "6\n4\n10" }, { "input": "4 4 1\n*\n..\n.\n\n3 2", "output": "8" }, { "input": "3 3 1\n\n.\n\n2 2", "output": "4" }, { "input": "5 5 10\n**\n...\n..*\n.*\n***\...	1,678,099,493	2,147,483,647	PyPy 3	TIME_LIMIT_EXCEEDED	TESTS	10	1,000	10,752,000	# for iiiii in range(int(input())): # n=int(input()) # p=int(input()) # p=list(map(int, p.strip())) # s=(list(map(int,input().split(' ')))) # l=list(input()) m,n,k=(list(map(int,input().split(' ')))) a=[] ma=[] for iiiiiii in range(m): aa=[] s=input() for j in s: if j=='.': ...	Title: Igor In the Museum Time Limit: None seconds Memory Limit: None megabytes Problem Description: Igor is in the museum and he wants to see as many pictures as possible. Museum can be represented as a rectangular field of n<=×<=m cells. Each cell is either empty or impassable. Empty cells are marked with '.'...	```python # for iiiii in range(int(input())): # n=int(input()) # p=int(input()) # p=list(map(int, p.strip())) # s=(list(map(int,input().split(' ')))) # l=list(input()) m,n,k=(list(map(int,input().split(' ')))) a=[] ma=[] for iiiiiii in range(m): aa=[] s=input() for j in s: if ...	0
764	A	Taymyr is calling you	PROGRAMMING	800	[ "brute force", "implementation", "math" ]		null	null	Comrade Dujikov is busy choosing artists for Timofey's birthday and is recieving calls from Taymyr from Ilia-alpinist. Ilia-alpinist calls every n minutes, i.e. in minutes n, 2n, 3n and so on. Artists come to the comrade every m minutes, i.e. in minutes m, 2m, 3m and so on. The day is z minutes long,...	The only string contains three integers — n, m and z (1<=≤<=n,<=m,<=z<=≤<=104).	Print single integer — the minimum number of artists that should be killed so that there are no artists in the room when Ilia calls.	[ "1 1 10\n", "1 2 5\n", "2 3 9\n" ]	[ "10\n", "2\n", "1\n" ]	Taymyr is a place in the north of Russia. In the first test the artists come each minute, as well as the calls, so we need to kill all of them. In the second test we need to kill artists which come on the second and the fourth minutes. In the third test — only the artist which comes on the sixth minute.	500	[ { "input": "1 1 10", "output": "10" }, { "input": "1 2 5", "output": "2" }, { "input": "2 3 9", "output": "1" }, { "input": "4 8 9", "output": "1" }, { "input": "7 9 2", "output": "0" }, { "input": "10000 10000 10000", "output": "1" }, { "i...	1,575,388,805	2,147,483,647	Python 3	OK	TESTS	32	109	0	from math import gcd def solve(n, m, z): lcm = (n * m)//(gcd(n, m)) return z // lcm def main(): n, m, z = list(map(int, input().split())) print(solve(n, m, z)) main()	Title: Taymyr is calling you Time Limit: None seconds Memory Limit: None megabytes Problem Description: Comrade Dujikov is busy choosing artists for Timofey's birthday and is recieving calls from Taymyr from Ilia-alpinist. Ilia-alpinist calls every n minutes, i.e. in minutes n, 2n, 3n and so on. Artists com...	```python from math import gcd def solve(n, m, z): lcm = (n * m)//(gcd(n, m)) return z // lcm def main(): n, m, z = list(map(int, input().split())) print(solve(n, m, z)) main() ```	3
908	A	New Year and Counting Cards	PROGRAMMING	800	[ "brute force", "implementation" ]		null	null	Your friend has n cards. You know that each card has a lowercase English letter on one side and a digit on the other. Currently, your friend has laid out the cards on a table so only one side of each card is visible. You would like to know if the following statement is true for cards that your friend owns: "If a c...	The first and only line of input will contain a string s (1<=≤<=\|s\|<=≤<=50), denoting the sides of the cards that you can see on the table currently. Each character of s is either a lowercase English letter or a digit.	Print a single integer, the minimum number of cards you must turn over to verify your claim.	[ "ee\n", "z\n", "0ay1\n" ]	[ "2\n", "0\n", "2\n" ]	In the first sample, we must turn over both cards. Note that even though both cards have the same letter, they could possibly have different numbers on the other side. In the second sample, we don't need to turn over any cards. The statement is vacuously true, since you know your friend has no cards with a vowel on th...	500	[ { "input": "ee", "output": "2" }, { "input": "z", "output": "0" }, { "input": "0ay1", "output": "2" }, { "input": "0abcdefghijklmnopqrstuvwxyz1234567896", "output": "10" }, { "input": "0a0a9e9e2i2i9o9o6u6u9z9z4x4x9b9b", "output": "18" }, { "input": "01...	1,632,481,338	2,147,483,647	Python 3	OK	TESTS	38	77	6,758,400	a = input() b = "aeiou13579" s = 0 for i in a: if i in b:s+=1 print(s)	Title: New Year and Counting Cards Time Limit: None seconds Memory Limit: None megabytes Problem Description: Your friend has n cards. You know that each card has a lowercase English letter on one side and a digit on the other. Currently, your friend has laid out the cards on a table so only one side of each car...	```python a = input() b = "aeiou13579" s = 0 for i in a: if i in b:s+=1 print(s) ```	3
47	A	Triangular numbers	PROGRAMMING	800	[ "brute force", "math" ]	A. Triangular numbers	2	256	A triangular number is the number of dots in an equilateral triangle uniformly filled with dots. For example, three dots can be arranged in a triangle; thus three is a triangular number. The n-th triangular number is the number of dots in a triangle with n dots on a side. . You can learn more about these numbers fr...	The first line contains the single number n (1<=≤<=n<=≤<=500) — the given integer.	If the given integer is a triangular number output YES, otherwise output NO.	[ "1\n", "2\n", "3\n" ]	[ "YES\n", "NO\n", "YES\n" ]	none	500	[ { "input": "1", "output": "YES" }, { "input": "2", "output": "NO" }, { "input": "3", "output": "YES" }, { "input": "4", "output": "NO" }, { "input": "5", "output": "NO" }, { "input": "6", "output": "YES" }, { "input": "7", "output": "NO...	1,621,969,227	2,147,483,647	PyPy 3	OK	TESTS	71	216	0	n=int(input()) for i in range(1,501): if n==i*(i+1)/2: print("YES") exit() print("NO")	Title: Triangular numbers Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: A triangular number is the number of dots in an equilateral triangle uniformly filled with dots. For example, three dots can be arranged in a triangle; thus three is a triangular number. The n-th triangular number is t...	```python n=int(input()) for i in range(1,501): if n==i*(i+1)/2: print("YES") exit() print("NO") ```	3.946
796	B	Find The Bone	PROGRAMMING	1,300	[ "implementation" ]		null	null	Zane the wizard is going to perform a magic show shuffling the cups. There are n cups, numbered from 1 to n, placed along the x-axis on a table that has m holes on it. More precisely, cup i is on the table at the position x<==<=i. The problematic bone is initially at the position x<==<=1. Zane will co...	The first line contains three integers n, m, and k (2<=≤<=n<=≤<=106, 1<=≤<=m<=≤<=n, 1<=≤<=k<=≤<=3·105) — the number of cups, the number of holes on the table, and the number of swapping operations, respectively. The second line contains m distinct integers h1,<=h2,<=...,<=hm (1<=≤<=hi<=≤<=*...	Print one integer — the final position along the x-axis of the bone.	[ "7 3 4\n3 4 6\n1 2\n2 5\n5 7\n7 1\n", "5 1 2\n2\n1 2\n2 4\n" ]	[ "1", "2" ]	In the first sample, after the operations, the bone becomes at x = 2, x = 5, x = 7, and x = 1, respectively. In the second sample, after the first operation, the bone becomes at x = 2, and falls into the hole onto the ground.	750	[ { "input": "7 3 4\n3 4 6\n1 2\n2 5\n5 7\n7 1", "output": "1" }, { "input": "5 1 2\n2\n1 2\n2 4", "output": "2" }, { "input": "10000 1 9\n55\n44 1\n2929 9292\n9999 9998\n44 55\n49 94\n55 53\n100 199\n55 50\n53 11", "output": "55" }, { "input": "100000 3 7\n2 3 4\n1 5\n5 1\n1 5...	1,530,236,268	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	2	2,000	216,371,200	# -- coding: utf-8 -- """ Created on Fri Jun 29 02:37:47 2018 @author: Arsanuos """ def bfs(graph, start, holes, n, trans): vis = [False] * n vis[start] = True q = list() q.append(start) last = start while len(q) != 0: node = q.pop(0) vis[node] = True if...	Title: Find The Bone Time Limit: None seconds Memory Limit: None megabytes Problem Description: Zane the wizard is going to perform a magic show shuffling the cups. There are n cups, numbered from 1 to n, placed along the x-axis on a table that has m holes on it. More precisely, cup i is on the table at t...	```python # -- coding: utf-8 -- """ Created on Fri Jun 29 02:37:47 2018 @author: Arsanuos """ def bfs(graph, start, holes, n, trans): vis = [False] * n vis[start] = True q = list() q.append(start) last = start while len(q) != 0: node = q.pop(0) vis[node] = True ...	0
442	B	Andrey and Problem	PROGRAMMING	1,800	[ "greedy", "math", "probabilities" ]		null	null	Andrey needs one more problem to conduct a programming contest. He has n friends who are always willing to help. He can ask some of them to come up with a contest problem. Andrey knows one value for each of his fiends — the probability that this friend will come up with a problem if Andrey asks him. Help Andrey choo...	The first line contains a single integer n (1<=≤<=n<=≤<=100) — the number of Andrey's friends. The second line contains n real numbers pi (0.0<=≤<=pi<=≤<=1.0) — the probability that the i-th friend can come up with a problem. The probabilities are given with at most 6 digits after decimal point.	Print a single real number — the probability that Andrey won't get upset at the optimal choice of friends. The answer will be considered valid if it differs from the correct one by at most 10<=-<=9.	[ "4\n0.1 0.2 0.3 0.8\n", "2\n0.1 0.2\n" ]	[ "0.800000000000\n", "0.260000000000\n" ]	In the first sample the best strategy for Andrey is to ask only one of his friends, the most reliable one. In the second sample the best strategy for Andrey is to ask all of his friends to come up with a problem. Then the probability that he will get exactly one problem is 0.1·0.8 + 0.9·0.2 = 0.26.	1,500	[ { "input": "4\n0.1 0.2 0.3 0.8", "output": "0.800000000000" }, { "input": "2\n0.1 0.2", "output": "0.260000000000" }, { "input": "1\n0.217266", "output": "0.217266000000" }, { "input": "2\n0.608183 0.375030", "output": "0.608183000000" }, { "input": "3\n0.388818 0...	1,403,200,227	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	4	77	0	n = int(input()) dp = [0] * n a = list(map(float, input().split())) dp[0] = [a[0], 1 -a[0]] for i in range(1, n): dp[i] = dp[i - 1] if dp[i][0] < dp[i][0] * (1 - a[i]) + dp[i][1] * a[i]: dp[i] = [dp[i][0] * (1 - a[i]) + dp[i][1] * a[i], dp[i][1] * (1 - a[i])] if a[i] > dp[i][0]: dp[...	Title: Andrey and Problem Time Limit: None seconds Memory Limit: None megabytes Problem Description: Andrey needs one more problem to conduct a programming contest. He has n friends who are always willing to help. He can ask some of them to come up with a contest problem. Andrey knows one value for each of his fie...	```python n = int(input()) dp = [0] * n a = list(map(float, input().split())) dp[0] = [a[0], 1 -a[0]] for i in range(1, n): dp[i] = dp[i - 1] if dp[i][0] < dp[i][0] * (1 - a[i]) + dp[i][1] * a[i]: dp[i] = [dp[i][0] * (1 - a[i]) + dp[i][1] * a[i], dp[i][1] * (1 - a[i])] if a[i] > dp[i][0]: ...	0
1	B	Spreadsheet	PROGRAMMING	1,600	[ "implementation", "math" ]	B. Spreadsheets	10	64	In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second — number B, etc. till column 26 that is marked by Z. Then there are two-letter numbers: column 27 has number AA, 28 — AB, column 52 is marked by AZ. After ZZ there follow th...	The first line of the input contains integer number n (1<=≤<=n<=≤<=105), the number of coordinates in the test. Then there follow n lines, each of them contains coordinates. All the coordinates are correct, there are no cells with the column and/or the row numbers larger than 106 .	Write n lines, each line should contain a cell coordinates in the other numeration system.	[ "2\nR23C55\nBC23\n" ]	[ "BC23\nR23C55\n" ]	none	0	[ { "input": "2\nR23C55\nBC23", "output": "BC23\nR23C55" }, { "input": "1\nA1", "output": "R1C1" }, { "input": "5\nR8C3\nD1\nR7C2\nR8C9\nR8C9", "output": "C8\nR1C4\nB7\nI8\nI8" }, { "input": "4\nR4C25\nR90C35\nAP55\nX83", "output": "Y4\nAI90\nR55C42\nR83C24" }, { "i...	1,654,508,533	2,147,483,647	Python 3	OK	TESTS	10	4,086	0	def to_number(s: str) -> int: res = sum(pr[i] for i in range(len(s))) for i, c in enumerate(reversed(s)): res += (ord(c)-ord('A')) * 26**i return res def to_alpha(n: int) -> str: res = '' for i, s in enumerate(pr): if s <= n: n -= s else: ...	Title: Spreadsheet Time Limit: 10 seconds Memory Limit: 64 megabytes Problem Description: In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second — number B, etc. till column 26 that is marked by Z. Then there are two-letter n...	```python def to_number(s: str) -> int: res = sum(pr[i] for i in range(len(s))) for i, c in enumerate(reversed(s)): res += (ord(c)-ord('A')) * 26**i return res def to_alpha(n: int) -> str: res = '' for i, s in enumerate(pr): if s <= n: n -= s else: ...	3.7957
79	B	Colorful Field	PROGRAMMING	1,400	[ "implementation", "sortings" ]	B. Colorful Field	2	256	Fox Ciel saw a large field while she was on a bus. The field was a n<=×<=m rectangle divided into 1<=×<=1 cells. Some cells were wasteland, and other each cell contained crop plants: either carrots or kiwis or grapes. After seeing the field carefully, Ciel found that the crop plants of each cell were planted in f...	In the first line there are four positive integers n,<=m,<=k,<=t (1<=≤<=n<=≤<=4·104,<=1<=≤<=m<=≤<=4·104,<=1<=≤<=k<=≤<=103,<=1<=≤<=t<=≤<=103), each of which represents the height of the field, the width of the field, the number of waste cells and the number of queries that ask the kind of crop plants in ...	For each query, if the cell is waste, print Waste. Otherwise, print the name of crop plants in the cell: either Carrots or Kiwis or Grapes.	[ "4 5 5 6\n4 3\n1 3\n3 3\n2 5\n3 2\n1 3\n1 4\n2 3\n2 4\n1 1\n1 1\n" ]	[ "Waste\nGrapes\nCarrots\nKiwis\nCarrots\nCarrots\n" ]	The sample corresponds to the figure in the statement.	1,000	[ { "input": "4 5 5 6\n4 3\n1 3\n3 3\n2 5\n3 2\n1 3\n1 4\n2 3\n2 4\n1 1\n1 1", "output": "Waste\nGrapes\nCarrots\nKiwis\nCarrots\nCarrots" }, { "input": "2 3 2 2\n1 1\n2 2\n2 1\n2 2", "output": "Grapes\nWaste" }, { "input": "31 31 31 4\n4 9\n16 27\n11 29\n8 28\n11 2\n10 7\n22 6\n1 25\n14 8...	1,622,447,527	2,147,483,647	PyPy 3	RUNTIME_ERROR	TESTS	1	218	2,048,000	''' ''' n,m,k,t = list(map(int, input().split(' '))) arr = [['*' for i in range(m)] for _ in range(n)] waste = set() for _ in range(k): i, j= list(map(int,input().split(' '))) waste.add((i,j)) f = 0 for i in range(n): for j in range(m): if (i,j) not in waste: arr[i][j]=f f = ...	Title: Colorful Field Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Fox Ciel saw a large field while she was on a bus. The field was a n<=×<=m rectangle divided into 1<=×<=1 cells. Some cells were wasteland, and other each cell contained crop plants: either carrots or kiwis or grapes. ...	```python ''' ''' n,m,k,t = list(map(int, input().split(' '))) arr = [['*' for i in range(m)] for _ in range(n)] waste = set() for _ in range(k): i, j= list(map(int,input().split(' '))) waste.add((i,j)) f = 0 for i in range(n): for j in range(m): if (i,j) not in waste: arr[i][j]=f ...	-1
600	B	Queries about less or equal elements	PROGRAMMING	1,300	[ "binary search", "data structures", "sortings", "two pointers" ]		null	null	You are given two arrays of integers a and b. For each element of the second array bj you should find the number of elements in array a that are less than or equal to the value bj.	The first line contains two integers n,<=m (1<=≤<=n,<=m<=≤<=2·105) — the sizes of arrays a and b. The second line contains n integers — the elements of array a (<=-<=109<=≤<=ai<=≤<=109). The third line contains m integers — the elements of array b (<=-<=109<=≤<=bj<=≤<=109).	Print m integers, separated by spaces: the j-th of which is equal to the number of such elements in array a that are less than or equal to the value bj.	[ "5 4\n1 3 5 7 9\n6 4 2 8\n", "5 5\n1 2 1 2 5\n3 1 4 1 5\n" ]	[ "3 2 1 4\n", "4 2 4 2 5\n" ]	none	0	[ { "input": "5 4\n1 3 5 7 9\n6 4 2 8", "output": "3 2 1 4" }, { "input": "5 5\n1 2 1 2 5\n3 1 4 1 5", "output": "4 2 4 2 5" }, { "input": "1 1\n-1\n-2", "output": "0" }, { "input": "1 1\n-80890826\n686519510", "output": "1" }, { "input": "11 11\n237468511 -77918754...	1,673,970,038	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	31	0	len_a, len_b = list(map(int, input().split())) arr = sorted(list(map(int, input().split()))) b = list(map(int, input().split())) d_ = {} def two_y(x): finish = len(arr) start = 0 while start != finish > 1: middle = start + (finish - start)//2 if x >= arr[middle]: start = middle...	Title: Queries about less or equal elements Time Limit: None seconds Memory Limit: None megabytes Problem Description: You are given two arrays of integers a and b. For each element of the second array bj you should find the number of elements in array a that are less than or equal to the value bj. In...	```python len_a, len_b = list(map(int, input().split())) arr = sorted(list(map(int, input().split()))) b = list(map(int, input().split())) d_ = {} def two_y(x): finish = len(arr) start = 0 while start != finish > 1: middle = start + (finish - start)//2 if x >= arr[middle]: star...	0
527	A	Playing with Paper	PROGRAMMING	1,100	[ "implementation", "math" ]		null	null	One day Vasya was sitting on a not so interesting Maths lesson and making an origami from a rectangular a mm <=×<= b mm sheet of paper (a<=><=b). Usually the first step in making an origami is making a square piece of paper from the rectangular sheet by folding the sheet along the bisector of the right angle...	The first line of the input contains two integers a, b (1<=≤<=b<=<<=a<=≤<=1012) — the sizes of the original sheet of paper.	Print a single integer — the number of ships that Vasya will make.	[ "2 1\n", "10 7\n", "1000000000000 1\n" ]	[ "2\n", "6\n", "1000000000000\n" ]	Pictures to the first and second sample test.	500	[ { "input": "2 1", "output": "2" }, { "input": "10 7", "output": "6" }, { "input": "1000000000000 1", "output": "1000000000000" }, { "input": "3 1", "output": "3" }, { "input": "4 1", "output": "4" }, { "input": "3 2", "output": "3" }, { "in...	1,604,092,843	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	21	2,000	0	a,b=map(int,input().split()) count=0 if (a!=1 and b==1) or (a==1 and b!=1): print(a*b) else: while a!=b: if a>b: a=a-b count+=1 if a<b: a,b=b,a if not((a!=1 and b==1) or (a==1 and b!=1)): print(count+1)	Title: Playing with Paper Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day Vasya was sitting on a not so interesting Maths lesson and making an origami from a rectangular a mm <=×<= b mm sheet of paper (a<=><=b). Usually the first step in making an origami is making a squ...	```python a,b=map(int,input().split()) count=0 if (a!=1 and b==1) or (a==1 and b!=1): print(a*b) else: while a!=b: if a>b: a=a-b count+=1 if a<b: a,b=b,a if not((a!=1 and b==1) or (a==1 and b!=1)): print(count+1) ```	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,624,369,372	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	0	1,000	0	from math import log2 t = int(input("")) for i in range(t): n = int(input("")) sum = -1 for i in range(2, n+1): if log2(i)% 1 == 0.0: sum -= i else: sum+=i 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 log2 t = int(input("")) for i in range(t): n = int(input("")) sum = -1 for i in range(2, n+1): if log2(i)% 1 == 0.0: sum -= i else: sum+=i print(sum) ```	0
275	B	Convex Shape	PROGRAMMING	1,700	[ "constructive algorithms", "implementation" ]		null	null	Consider an n<=×<=m grid. Initially all the cells of the grid are colored white. Lenny has painted some of the cells (at least one) black. We call a painted grid convex if one can walk from any black cell to any another black cell using a path of side-adjacent black cells changing his direction at most once during ...	The first line of the input contains two integers n and m (1<=≤<=n,<=m<=≤<=50) — the size of the grid. Each of the next n lines contains m characters "B" or "W". Character "B" denotes a black cell of the grid and "W" denotes a white cell of the grid. It's guaranteed that the grid has at least one black cel...	On the only line of the output print "YES" if the grid is convex, otherwise print "NO". Do not print quotes.	[ "3 4\nWWBW\nBWWW\nWWWB\n", "3 1\nB\nB\nW\n" ]	[ "NO\n", "YES\n" ]	none	1,000	[ { "input": "3 4\nWWBW\nBWWW\nWWWB", "output": "NO" }, { "input": "3 1\nB\nB\nW", "output": "YES" }, { "input": "1 1\nB", "output": "YES" }, { "input": "1 2\nBB", "output": "YES" }, { "input": "2 1\nB\nB", "output": "YES" }, { "input": "1 2\nBW", "o...	1,661,273,520	2,147,483,647	PyPy 3-64	RUNTIME_ERROR	TESTS	1	154	5,836,800	# from usefull_stuff import basic_input # basic_input(""" # 5 5 # WBBBW # WBBBW # WBBWW # WBBBW # WWWWW # """) def solve(): n, m = map(int, input().split()) grid = [list(map(int, input().translate({ord("W"): ord("0"), ord("B"): ord("1")}))) for _ in range(n)] def dfs(y, x): grid[y][...	Title: Convex Shape Time Limit: None seconds Memory Limit: None megabytes Problem Description: Consider an n<=×<=m grid. Initially all the cells of the grid are colored white. Lenny has painted some of the cells (at least one) black. We call a painted grid convex if one can walk from any black cell to any anothe...	```python # from usefull_stuff import basic_input # basic_input(""" # 5 5 # WBBBW # WBBBW # WBBWW # WBBBW # WWWWW # """) def solve(): n, m = map(int, input().split()) grid = [list(map(int, input().translate({ord("W"): ord("0"), ord("B"): ord("1")}))) for _ in range(n)] def dfs(y, x): ...	-1
435	B	Pasha Maximizes	PROGRAMMING	1,400	[ "greedy" ]		null	null	Pasha has a positive integer a without leading zeroes. Today he decided that the number is too small and he should make it larger. Unfortunately, the only operation Pasha can do is to swap two adjacent decimal digits of the integer. Help Pasha count the maximum number he can get if he has the time to make at most *k...	The single line contains two integers a and k (1<=≤<=a<=≤<=1018; 0<=≤<=k<=≤<=100).	Print the maximum number that Pasha can get if he makes at most k swaps.	[ "1990 1\n", "300 0\n", "1034 2\n", "9090000078001234 6\n" ]	[ "9190\n", "300\n", "3104\n", "9907000008001234\n" ]	none	1,000	[ { "input": "1990 1", "output": "9190" }, { "input": "300 0", "output": "300" }, { "input": "1034 2", "output": "3104" }, { "input": "9090000078001234 6", "output": "9907000008001234" }, { "input": "1234 3", "output": "4123" }, { "input": "5 100", "...	1,565,419,925	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	8	139	0	def main(): a, k = input().split() k = int(k) a = list(a) n = len(a) for i in range(n): _max = max((a[j], j) for j in range(i, min(n, i + k + 1))) if _max[0] > a[i]: for j in range(_max[1], i, -1): a[j], a[j - 1] = a[j - 1], a[j] ...	Title: Pasha Maximizes Time Limit: None seconds Memory Limit: None megabytes Problem Description: Pasha has a positive integer a without leading zeroes. Today he decided that the number is too small and he should make it larger. Unfortunately, the only operation Pasha can do is to swap two adjacent decimal digits ...	```python def main(): a, k = input().split() k = int(k) a = list(a) n = len(a) for i in range(n): _max = max((a[j], j) for j in range(i, min(n, i + k + 1))) if _max[0] > a[i]: for j in range(_max[1], i, -1): a[j], a[j - 1] = a[j - 1], a[j] ...	0
41	A	Translation	PROGRAMMING	800	[ "implementation", "strings" ]	A. Translation	2	256	The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) reversely. For example, a Berlandish word code corresponds to a Birlandish word edoc....	The first line contains word s, the second line contains word t. The words consist of lowercase Latin letters. The input data do not consist unnecessary spaces. The words are not empty and their lengths do not exceed 100 symbols.	If the word t is a word s, written reversely, print YES, otherwise print NO.	[ "code\nedoc\n", "abb\naba\n", "code\ncode\n" ]	[ "YES\n", "NO\n", "NO\n" ]	none	500	[ { "input": "code\nedoc", "output": "YES" }, { "input": "abb\naba", "output": "NO" }, { "input": "code\ncode", "output": "NO" }, { "input": "abacaba\nabacaba", "output": "YES" }, { "input": "q\nq", "output": "YES" }, { "input": "asrgdfngfnmfgnhweratgjkk...	1,640,422,618	2,147,483,647	Python 3	OK	TESTS	40	92	0	s = input() t = input() t = t[::-1] if s==t:print("YES") else:print("NO")	Title: Translation Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pron...	```python s = input() t = input() t = t[::-1] if s==t:print("YES") else:print("NO") ```	3.977
682	B	Alyona and Mex	PROGRAMMING	1,200	[ "sortings" ]		null	null	Someone gave Alyona an array containing n positive integers a1,<=a2,<=...,<=an. In one operation, Alyona can choose any element of the array and decrease it, i.e. replace with any positive integer that is smaller than the current one. Alyona can repeat this operation as many times as she wants. In particular,...	The first line of the input contains a single integer n (1<=≤<=n<=≤<=100<=000) — the number of elements in the Alyona's array. The second line of the input contains n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=109) — the elements of the array.	Print one positive integer — the maximum possible value of mex of the array after Alyona applies some (possibly none) operations.	[ "5\n1 3 3 3 6\n", "2\n2 1\n" ]	[ "5\n", "3\n" ]	In the first sample case if one will decrease the second element value to 2 and the fifth element value to 4 then the mex value of resulting array 1 2 3 3 4 will be equal to 5. To reach the answer to the second sample case one must not decrease any of the array elements.	1,000	[ { "input": "5\n1 3 3 3 6", "output": "5" }, { "input": "2\n2 1", "output": "3" }, { "input": "1\n1", "output": "2" }, { "input": "1\n1000000000", "output": "2" }, { "input": "1\n2", "output": "2" }, { "input": "2\n1 1", "output": "2" }, { "...	1,518,102,156	2,147,483,647	Python 3	OK	TESTS	127	171	14,438,400	n=int(input()) a=[int(i) for i in input().split()] a.sort() cur=1 for i in range(n): if a[i]>=cur: cur+=1 print(cur)	Title: Alyona and Mex Time Limit: None seconds Memory Limit: None megabytes Problem Description: Someone gave Alyona an array containing n positive integers a1,<=a2,<=...,<=an. In one operation, Alyona can choose any element of the array and decrease it, i.e. replace with any positive integer that is small...	```python n=int(input()) a=[int(i) for i in input().split()] a.sort() cur=1 for i in range(n): if a[i]>=cur: cur+=1 print(cur) ```	3
143	B	Help Kingdom of Far Far Away 2	PROGRAMMING	1,200	[ "implementation", "strings" ]		null	null	For some time the program of rounding numbers that had been developed by the Codeforces participants during one of the previous rounds, helped the citizens of Far Far Away to convert numbers into a more easily readable format. However, as time went by, the economy of the Far Far Away developed and the scale of operatio...	The input contains a number that needs to be converted into financial format. The number's notation length does not exceed 100 characters, including (possible) signs "-" (minus) and "." (decimal point). The number's notation is correct, that is: - The number's notation only contains characters from the set {"0" – "9...	Print the number given in the input in the financial format by the rules described in the problem statement.	[ "2012\n", "0.000\n", "-0.00987654321\n", "-12345678.9\n" ]	[ "$2,012.00", "$0.00", "($0.00)", "($12,345,678.90)" ]	Pay attention to the second and third sample tests. They show that the sign of a number in the financial format (and consequently, the presence or absence of brackets) is determined solely by the sign of the initial number. It does not depend on the sign of the number you got after translating the number to the financi...	1,000	[ { "input": "2012", "output": "$2,012.00" }, { "input": "0.000", "output": "$0.00" }, { "input": "-0.00987654321", "output": "($0.00)" }, { "input": "-12345678.9", "output": "($12,345,678.90)" }, { "input": "0.99999999999999999999", "output": "$0.99" }, { ...	1,607,423,715	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	3	186	307,200	s = input("") p = s.find('.') flag=0 if(p==(-1)): p=len(s) s=s+'.00' if(len(s[p+1:])>2): s=s[0:p+3] if(len(s[p+1:])==1): print(s+'0') s=s[0:]+'0' if(len(s[p+1:])==0): s=s[:]+'00' if(s[0:1]=='-'): flag=1 s=s[1:] p=p-1 for i in s[p:0:-3]: if(i=='.' or i=='-'): ...	Title: Help Kingdom of Far Far Away 2 Time Limit: None seconds Memory Limit: None megabytes Problem Description: For some time the program of rounding numbers that had been developed by the Codeforces participants during one of the previous rounds, helped the citizens of Far Far Away to convert numbers into a more e...	```python s = input("") p = s.find('.') flag=0 if(p==(-1)): p=len(s) s=s+'.00' if(len(s[p+1:])>2): s=s[0:p+3] if(len(s[p+1:])==1): print(s+'0') s=s[0:]+'0' if(len(s[p+1:])==0): s=s[:]+'00' if(s[0:1]=='-'): flag=1 s=s[1:] p=p-1 for i in s[p:0:-3]: if(i=='.' or i=...	0
441	C	Valera and Tubes	PROGRAMMING	1,500	[ "constructive algorithms", "dfs and similar", "implementation" ]		null	null	Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right. We will represent cell that is on the intersection of row x and column y by a pair of integers (x,<=y). Valera w...	The first line contains three space-separated integers n,<=m,<=k (2<=≤<=n,<=m<=≤<=300; 2<=≤<=2k<=≤<=n·m) — the number of rows, the number of columns and the number of tubes, correspondingly.	Print k lines. In the i-th line print the description of the i-th tube: first print integer ri (the number of tube cells), then print 2ri integers xi1,<=yi1,<=xi2,<=yi2,<=...,<=xiri,<=yiri (the sequence of table cells). If there are multiple solutions, you can print any of the...	[ "3 3 3\n", "2 3 1\n" ]	[ "3 1 1 1 2 1 3\n3 2 1 2 2 2 3\n3 3 1 3 2 3 3\n", "6 1 1 1 2 1 3 2 3 2 2 2 1\n" ]	Picture for the first sample: Picture for the second sample:	1,500	[ { "input": "3 3 3", "output": "3 1 1 1 2 1 3\n3 2 1 2 2 2 3\n3 3 1 3 2 3 3" }, { "input": "2 3 1", "output": "6 1 1 1 2 1 3 2 3 2 2 2 1" }, { "input": "2 3 1", "output": "6 1 1 1 2 1 3 2 3 2 2 2 1" }, { "input": "300 300 2", "output": "2 1 1 1 2\n89998 1 3 1 4 1 5 1 6 1 7...	1,619,852,633	2,147,483,647	PyPy 3	OK	TESTS	44	249	9,625,600	import sys #sys.stdin, sys.stdout = open("input.txt", "r"), open("output.txt", "w") n, m, k = map(int, input().split()) solution = [] for i in range(1, n + 1): r = range(1, m + 1) if i % 2 == 1 else reversed(range(1, m + 1)) for j in r: solution.append((i, j)) i = 0 for __ in range(k - ...	Title: Valera and Tubes Time Limit: None seconds Memory Limit: None megabytes Problem Description: Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right. We will represent ...	```python import sys #sys.stdin, sys.stdout = open("input.txt", "r"), open("output.txt", "w") n, m, k = map(int, input().split()) solution = [] for i in range(1, n + 1): r = range(1, m + 1) if i % 2 == 1 else reversed(range(1, m + 1)) for j in r: solution.append((i, j)) i = 0 for __ in ...	3
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,593,761,294	2,147,483,647	PyPy 3	OK	TESTS	133	156	0	def pal(r): if r == r[::-1]: return True else: return False s = str(input()) if pal(s) == True: if pal(s[0:len(s)-1]) == True: print(0) else: print(len(s)-1) else: print(len(s))	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 def pal(r): if r == r[::-1]: return True else: return False s = str(input()) if pal(s) == True: if pal(s[0:len(s)-1]) == True: print(0) else: print(len(s)-1) else: print(len(s)) ```	3
479	A	Expression	PROGRAMMING	1,000	[ "brute force", "math" ]		null	null	Petya studies in a school and he adores Maths. His class has been studying arithmetic expressions. On the last class the teacher wrote three positive integers a, b, c on the blackboard. The task was to insert signs of operations '+' and '*', and probably brackets between the numbers so that the value of the resul...	The input contains three integers a, b and c, each on a single line (1<=≤<=a,<=b,<=c<=≤<=10).	Print the maximum value of the expression that you can obtain.	[ "1\n2\n3\n", "2\n10\n3\n" ]	[ "9\n", "60\n" ]	none	500	[ { "input": "1\n2\n3", "output": "9" }, { "input": "2\n10\n3", "output": "60" }, { "input": "1\n1\n1", "output": "3" }, { "input": "1\n2\n1", "output": "4" }, { "input": "10\n10\n10", "output": "1000" }, { "input": "5\n1\n3", "output": "20" }, {...	1,694,852,412	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	31	0	a = int(input()) b = int(input()) c = int(input()) d = a + b * c e = a * (b + c) f = a * b * c g = (a + b) * c h = a * b + c print(max(d, e, f, g, h))	Title: Expression Time Limit: None seconds Memory Limit: None megabytes Problem Description: Petya studies in a school and he adores Maths. His class has been studying arithmetic expressions. On the last class the teacher wrote three positive integers a, b, c on the blackboard. The task was to insert signs of ...	```python a = int(input()) b = int(input()) c = int(input()) d = a + b * c e = a * (b + c) f = a * b * c g = (a + b) * c h = a * b + c print(max(d, e, f, g, h)) ```	0
311	A	The Closest Pair	PROGRAMMING	1,300	[ "constructive algorithms", "implementation" ]		null	null	Currently Tiny is learning Computational Geometry. When trying to solve a problem called "The Closest Pair Of Points In The Plane", he found that a code which gave a wrong time complexity got Accepted instead of Time Limit Exceeded. The problem is the follows. Given n points in the plane, find a pair of points betwe...	A single line which contains two space-separated integers n and k (2<=≤<=n<=≤<=2000, 1<=≤<=k<=≤<=109).	If there doesn't exist such a data which let the given code get TLE, print "no solution" (without quotes); else print n lines, and the i-th line contains two integers xi,<=yi (\|xi\|,<=\|yi\|<=≤<=109) representing the coordinates of the i-th point. The conditions below must be held: - All the point...	[ "4 3\n", "2 100\n" ]	[ "0 0\n0 1\n1 0\n1 1\n", "no solution\n" ]	none	500	[ { "input": "4 3", "output": "0 0\n0 1\n1 0\n1 1" }, { "input": "2 100", "output": "no solution" }, { "input": "5 6", "output": "0 0\n0 1\n0 2\n0 3\n0 4" }, { "input": "8 20", "output": "0 0\n0 1\n0 2\n0 3\n0 4\n0 5\n0 6\n0 7" }, { "input": "6 15", "output": "n...	1,630,470,225	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	2	62	6,758,400	n,k=map(int,input().split()) print(["".join(str(i)+" 0\n"for i in range(n)),"no solution"][(n-1)n<=k2])	Title: The Closest Pair Time Limit: None seconds Memory Limit: None megabytes Problem Description: Currently Tiny is learning Computational Geometry. When trying to solve a problem called "The Closest Pair Of Points In The Plane", he found that a code which gave a wrong time complexity got Accepted instead of Time L...	```python n,k=map(int,input().split()) print(["".join(str(i)+" 0\n"for i in range(n)),"no solution"][(n-1)n<=k2]) ```	0
43	A	Football	PROGRAMMING	1,000	[ "strings" ]	A. Football	2	256	One day Vasya decided to have a look at the results of Berland 1910 Football Championship’s finals. Unfortunately he didn't find the overall score of the match; however, he got hold of a profound description of the match's process. On the whole there are n lines in that description each of which described one goal. E...	The first line contains an integer n (1<=≤<=n<=≤<=100) — the number of lines in the description. Then follow n lines — for each goal the names of the teams that scored it. The names are non-empty lines consisting of uppercase Latin letters whose lengths do not exceed 10 symbols. It is guaranteed that the match di...	Print the name of the winning team. We remind you that in football the team that scores more goals is considered the winner.	[ "1\nABC\n", "5\nA\nABA\nABA\nA\nA\n" ]	[ "ABC\n", "A\n" ]	none	500	[ { "input": "1\nABC", "output": "ABC" }, { "input": "5\nA\nABA\nABA\nA\nA", "output": "A" }, { "input": "2\nXTSJEP\nXTSJEP", "output": "XTSJEP" }, { "input": "3\nXZYDJAEDZ\nXZYDJAEDZ\nXZYDJAEDZ", "output": "XZYDJAEDZ" }, { "input": "3\nQCCYXL\nQCCYXL\nAXGLFQDD", ...	1,659,878,678	2,147,483,647	Python 3	OK	TESTS	34	92	0	n = int(input()) d = {} for _ in range(n): s = input() if s not in d: d[s] = 0 d[s] += 1 p = '' mx = 0 for k, v in d.items(): if v > mx: p = k mx = v print(p)	Title: Football Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: One day Vasya decided to have a look at the results of Berland 1910 Football Championship’s finals. Unfortunately he didn't find the overall score of the match; however, he got hold of a profound description of the match's process...	```python n = int(input()) d = {} for _ in range(n): s = input() if s not in d: d[s] = 0 d[s] += 1 p = '' mx = 0 for k, v in d.items(): if v > mx: p = k mx = v print(p) ```	3.977
729	A	Interview with Oleg	PROGRAMMING	900	[ "implementation", "strings" ]		null	null	Polycarp has interviewed Oleg and has written the interview down without punctuation marks and spaces to save time. Thus, the interview is now a string s consisting of n lowercase English letters. There is a filler word ogo in Oleg's speech. All words that can be obtained from ogo by adding go several times to the...	The first line contains a positive integer n (1<=≤<=n<=≤<=100) — the length of the interview. The second line contains the string s of length n, consisting of lowercase English letters.	Print the interview text after the replacement of each of the fillers with "*". It is allowed for the substring "*" to have several consecutive occurences.	[ "7\naogogob\n", "13\nogogmgogogogo\n", "9\nogoogoogo\n" ]	[ "a*b\n", "gmg\n", "*******\n" ]	The first sample contains one filler word ogogo, so the interview for printing is "a*b". The second sample contains two fillers ogo and ogogogo. Thus, the interview is transformed to "gmg**".	500	[ { "input": "7\naogogob", "output": "a*b" }, { "input": "13\nogogmgogogogo", "output": "gmg" }, { "input": "9\nogoogoogo", "output": "*****" }, { "input": "32\nabcdefogoghijklmnogoopqrstuvwxyz", "output": "abcdefghijklmn**opqrstuvwxyz" }, { "input":...	1,632,631,164	2,147,483,647	PyPy 3	OK	TESTS	48	93	20,172,800	n = int(input()) s = input() i, track = 0, [] while i < len(s): e = i + 3 if s[i:e] == 'ogo': base = s[i:e] while s[e:e+2] == 'go': base += s[e:e+2] e += 2 track.append(base) i = e elif s[i:e] != 'ogo': i += 1 for i in range(len(t...	Title: Interview with Oleg Time Limit: None seconds Memory Limit: None megabytes Problem Description: Polycarp has interviewed Oleg and has written the interview down without punctuation marks and spaces to save time. Thus, the interview is now a string s consisting of n lowercase English letters. There is a fi...	```python n = int(input()) s = input() i, track = 0, [] while i < len(s): e = i + 3 if s[i:e] == 'ogo': base = s[i:e] while s[e:e+2] == 'go': base += s[e:e+2] e += 2 track.append(base) i = e elif s[i:e] != 'ogo': i += 1 for i in r...	3
136	A	Presents	PROGRAMMING	800	[ "implementation" ]		null	null	Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he organized a New Year party at his place and invited n his friends there. If...	The first line contains one integer n (1<=≤<=n<=≤<=100) — the quantity of friends Petya invited to the party. The second line contains n space-separated integers: the i-th number is pi — the number of a friend who gave a gift to friend number i. It is guaranteed that each friend received exactly one gift....	Print n space-separated integers: the i-th number should equal the number of the friend who gave a gift to friend number i.	[ "4\n2 3 4 1\n", "3\n1 3 2\n", "2\n1 2\n" ]	[ "4 1 2 3\n", "1 3 2\n", "1 2\n" ]	none	500	[ { "input": "4\n2 3 4 1", "output": "4 1 2 3" }, { "input": "3\n1 3 2", "output": "1 3 2" }, { "input": "2\n1 2", "output": "1 2" }, { "input": "1\n1", "output": "1" }, { "input": "10\n1 3 2 6 4 5 7 9 8 10", "output": "1 3 2 5 6 4 7 9 8 10" }, { "input"...	1,689,648,937	2,147,483,647	Python 3	OK	TESTS	101	92	0	n = int(input()) l = list(map(int,input().split())) for i in range(1,n+1): x = l.index(i) print(x+1,end=" ")	Title: Presents Time Limit: None seconds Memory Limit: None megabytes Problem Description: Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on t...	```python n = int(input()) l = list(map(int,input().split())) for i in range(1,n+1): x = l.index(i) print(x+1,end=" ") ```	3
96	A	Football	PROGRAMMING	900	[ "implementation", "strings" ]	A. Football	2	256	Petya loves football very much. One day, as he was watching a football match, he was writing the players' current positions on a piece of paper. To simplify the situation he depicted it as a string consisting of zeroes and ones. A zero corresponds to players of one team; a one corresponds to players of another team. If...	The first input line contains a non-empty string consisting of characters "0" and "1", which represents players. The length of the string does not exceed 100 characters. There's at least one player from each team present on the field.	Print "YES" if the situation is dangerous. Otherwise, print "NO".	[ "001001\n", "1000000001\n" ]	[ "NO\n", "YES\n" ]	none	500	[ { "input": "001001", "output": "NO" }, { "input": "1000000001", "output": "YES" }, { "input": "00100110111111101", "output": "YES" }, { "input": "11110111111111111", "output": "YES" }, { "input": "01", "output": "NO" }, { "input": "10100101", "outp...	1,696,774,083	2,147,483,647	PyPy 3-64	OK	TESTS	44	124	0	new_str = input() count_zero = 0 count_one = 0 ans = False for i in range(len(new_str)): if new_str[i] == '1': count_one += 1 count_zero = 0 if count_one >= 7: ans = True if new_str[i] == '0': count_zero += 1 count_one = 0 if count_zero >=...	Title: Football Time Limit: 2 seconds Memory Limit: 256 megabytes Problem Description: Petya loves football very much. One day, as he was watching a football match, he was writing the players' current positions on a piece of paper. To simplify the situation he depicted it as a string consisting of zeroes and ones. A...	```python new_str = input() count_zero = 0 count_one = 0 ans = False for i in range(len(new_str)): if new_str[i] == '1': count_one += 1 count_zero = 0 if count_one >= 7: ans = True if new_str[i] == '0': count_zero += 1 count_one = 0 if cou...	3.969
992	A	Nastya and an Array	PROGRAMMING	800	[ "implementation", "sortings" ]		null	null	Nastya owns too many arrays now, so she wants to delete the least important of them. However, she discovered that this array is magic! Nastya now knows that the array has the following properties: - In one second we can add an arbitrary (possibly negative) integer to all elements of the array that are not equal to ze...	The first line contains a single integer n (1<=≤<=n<=≤<=105) — the size of the array. The second line contains n integers a1,<=a2,<=...,<=an (<=-<=105<=≤<=ai<=≤<=105) — the elements of the array.	Print a single integer — the minimum number of seconds needed to make all elements of the array equal to zero.	[ "5\n1 1 1 1 1\n", "3\n2 0 -1\n", "4\n5 -6 -5 1\n" ]	[ "1\n", "2\n", "4\n" ]	In the first example you can add - 1 to all non-zero elements in one second and make them equal to zero. In the second example you can add - 2 on the first second, then the array becomes equal to [0, 0, - 3]. On the second second you can add 3 to the third (the only non-zero) element.	500	[ { "input": "5\n1 1 1 1 1", "output": "1" }, { "input": "3\n2 0 -1", "output": "2" }, { "input": "4\n5 -6 -5 1", "output": "4" }, { "input": "1\n0", "output": "0" }, { "input": "2\n21794 -79194", "output": "2" }, { "input": "3\n-63526 95085 -5239", ...	1,597,545,952	2,147,483,647	Python 3	OK	TESTS	79	248	7,782,400	n=int(input()) a=sorted(list(map(int, input().split()))) count=0;d=None for i in range(n): if d is None: if a[i]!=0: d=a[i]-1 count+=1 else: if a[i]!=0: temp=a[i] a[i]+=d #To increment/decrease with the previous values if a[i]!=0: d=temp(-1) count+=1 print(count)	Title: Nastya and an Array Time Limit: None seconds Memory Limit: None megabytes Problem Description: Nastya owns too many arrays now, so she wants to delete the least important of them. However, she discovered that this array is magic! Nastya now knows that the array has the following properties: - In one second ...	```python n=int(input()) a=sorted(list(map(int, input().split()))) count=0;d=None for i in range(n): if d is None: if a[i]!=0: d=a[i]-1 count+=1 else: if a[i]!=0: temp=a[i] a[i]+=d #To increment/decrease with the previous values if a[i]!=0: d=temp(-1) count+=1 print(count) ...	3
414	B	Mashmokh and ACM	PROGRAMMING	1,400	[ "combinatorics", "dp", "number theory" ]		null	null	Mashmokh's boss, Bimokh, didn't like Mashmokh. So he fired him. Mashmokh decided to go to university and participate in ACM instead of finding a new job. He wants to become a member of Bamokh's team. In order to join he was given some programming tasks and one week to solve them. Mashmokh is not a very experienced prog...	The first line of input contains two space-separated integers n,<=k (1<=≤<=n,<=k<=≤<=2000).	Output a single integer — the number of good sequences of length k modulo 1000000007 (109<=+<=7).	[ "3 2\n", "6 4\n", "2 1\n" ]	[ "5\n", "39\n", "2\n" ]	In the first sample the good sequences are: [1, 1], [2, 2], [3, 3], [1, 2], [1, 3].	1,000	[ { "input": "3 2", "output": "5" }, { "input": "6 4", "output": "39" }, { "input": "2 1", "output": "2" }, { "input": "1478 194", "output": "312087753" }, { "input": "1415 562", "output": "953558593" }, { "input": "1266 844", "output": "735042656" ...	1,617,423,297	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	3	1,000	21,401,600	HashTable={} def knapSack(lastVal,spaceLeft,n,ans): if (lastVal,spaceLeft) in HashTable: return(HashTable[(lastVal,spaceLeft)]) if spaceLeft==0: return(1) temp=0 if not lastVal: for i in range(1,n+1): temp+=knapSack(i,spaceLeft-1,n,ans) else: for i in range(lastVal,n+1,lastVal): temp+=knapSack(i,sp...	Title: Mashmokh and ACM Time Limit: None seconds Memory Limit: None megabytes Problem Description: Mashmokh's boss, Bimokh, didn't like Mashmokh. So he fired him. Mashmokh decided to go to university and participate in ACM instead of finding a new job. He wants to become a member of Bamokh's team. In order to join h...	```python HashTable={} def knapSack(lastVal,spaceLeft,n,ans): if (lastVal,spaceLeft) in HashTable: return(HashTable[(lastVal,spaceLeft)]) if spaceLeft==0: return(1) temp=0 if not lastVal: for i in range(1,n+1): temp+=knapSack(i,spaceLeft-1,n,ans) else: for i in range(lastVal,n+1,lastVal): temp+=kna...	0
671	A	Recycling Bottles	PROGRAMMING	1,800	[ "dp", "geometry", "greedy", "implementation" ]		null	null	It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin. We can think Central Perk as coordinate plane. There are n bottles on the ground, the i-th bottle is located at position (xi,<=yi). Both Adil a...	First line of the input contains six integers ax, ay, bx, by, tx and ty (0<=≤<=ax,<=ay,<=bx,<=by,<=tx,<=ty<=≤<=109) — initial positions of Adil, Bera and recycling bin respectively. The second line contains a single integer n (1<=≤<=n<=≤<=100<=000) — the number of bo...	Print one real number — the minimum possible total distance Adil and Bera need to walk in order to put all bottles into recycling bin. Your answer will be considered correct if its absolute or relative error does not exceed 10<=-<=6. Namely: let's assume that your answer is a, and the answer of the jury is b. The ...	[ "3 1 1 2 0 0\n3\n1 1\n2 1\n2 3\n", "5 0 4 2 2 0\n5\n5 2\n3 0\n5 5\n3 5\n3 3\n" ]	[ "11.084259940083\n", "33.121375178000\n" ]	Consider the first sample. Adil will use the following path: <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/37eea809c04afe04f2670475cc5b21df4a90afd1.png" style="max-width: 100.0%;max-height: 100.0%;"/>. Bera will use the following path: <img align="middle" class="tex-formula" src="https:...	500	[ { "input": "3 1 1 2 0 0\n3\n1 1\n2 1\n2 3", "output": "11.084259940083" }, { "input": "5 0 4 2 2 0\n5\n5 2\n3 0\n5 5\n3 5\n3 3", "output": "33.121375178000" }, { "input": "107 50 116 37 104 118\n12\n16 78\n95 113\n112 84\n5 88\n54 85\n112 80\n19 98\n25 14\n48 76\n95 70\n77 94\n38 32", ...	1,616,597,071	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	46	0	n = input() cnt = 1 while n>5: cnt+=1 n-=5 print (cnt)	Title: Recycling Bottles Time Limit: None seconds Memory Limit: None megabytes Problem Description: It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin. We can think Central Perk as coordinate plane. There...	```python n = input() cnt = 1 while n>5: cnt+=1 n-=5 print (cnt) ```	-1
735	D	Taxes	PROGRAMMING	1,600	[ "math", "number theory" ]		null	null	Mr. Funt now lives in a country with a very specific tax laws. The total income of mr. Funt during this year is equal to n (n<=≥<=2) burles and the amount of tax he has to pay is calculated as the maximum divisor of n (not equal to n, of course). For example, if n<==<=6 then Funt has to pay 3 burles, while fo...	The first line of the input contains a single integer n (2<=≤<=n<=≤<=2·109) — the total year income of mr. Funt.	Print one integer — minimum possible number of burles that mr. Funt has to pay as a tax.	[ "4\n", "27\n" ]	[ "2\n", "3\n" ]	none	1,750	[ { "input": "4", "output": "2" }, { "input": "27", "output": "3" }, { "input": "3", "output": "1" }, { "input": "5", "output": "1" }, { "input": "10", "output": "2" }, { "input": "2000000000", "output": "2" }, { "input": "26", "output": ...	1,613,057,799	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	2	77	0	n = int(input()) def isprime(sn): for c in range(2, int(sn**0.5 + 1)): if sn % c == 0: return False return True def check(st): for c in range(st - (1 - (st & 1)), 1, -1): if isprime(c): return 1 + check(st - c) return 1 print(check(n))	Title: Taxes Time Limit: None seconds Memory Limit: None megabytes Problem Description: Mr. Funt now lives in a country with a very specific tax laws. The total income of mr. Funt during this year is equal to n (n<=≥<=2) burles and the amount of tax he has to pay is calculated as the maximum divisor of n (not ...	```python n = int(input()) def isprime(sn): for c in range(2, int(sn**0.5 + 1)): if sn % c == 0: return False return True def check(st): for c in range(st - (1 - (st & 1)), 1, -1): if isprime(c): return 1 + check(st - c) return 1 print(check...	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,645,701,156	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	0	30	0	from collections import defaultdict alph ="abcdefghijklmnopqrstuvwxyz" mp = defaultdict(lambda:0) N=int(input()) st="" for i in range(N): inp = input().split(" ") st+=inp[0] st+=inp[1] for c in st: mp[c]+=1 for c in alph: print(mp[c])	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 from collections import defaultdict alph ="abcdefghijklmnopqrstuvwxyz" mp = defaultdict(lambda:0) N=int(input()) st="" for i in range(N): inp = input().split(" ") st+=inp[0] st+=inp[1] for c in st: mp[c]+=1 for c in alph: print(mp[c]) ```	-1
796	B	Find The Bone	PROGRAMMING	1,300	[ "implementation" ]		null	null	Zane the wizard is going to perform a magic show shuffling the cups. There are n cups, numbered from 1 to n, placed along the x-axis on a table that has m holes on it. More precisely, cup i is on the table at the position x<==<=i. The problematic bone is initially at the position x<==<=1. Zane will co...	The first line contains three integers n, m, and k (2<=≤<=n<=≤<=106, 1<=≤<=m<=≤<=n, 1<=≤<=k<=≤<=3·105) — the number of cups, the number of holes on the table, and the number of swapping operations, respectively. The second line contains m distinct integers h1,<=h2,<=...,<=hm (1<=≤<=hi<=≤<=*...	Print one integer — the final position along the x-axis of the bone.	[ "7 3 4\n3 4 6\n1 2\n2 5\n5 7\n7 1\n", "5 1 2\n2\n1 2\n2 4\n" ]	[ "1", "2" ]	In the first sample, after the operations, the bone becomes at x = 2, x = 5, x = 7, and x = 1, respectively. In the second sample, after the first operation, the bone becomes at x = 2, and falls into the hole onto the ground.	750	[ { "input": "7 3 4\n3 4 6\n1 2\n2 5\n5 7\n7 1", "output": "1" }, { "input": "5 1 2\n2\n1 2\n2 4", "output": "2" }, { "input": "10000 1 9\n55\n44 1\n2929 9292\n9999 9998\n44 55\n49 94\n55 53\n100 199\n55 50\n53 11", "output": "55" }, { "input": "100000 3 7\n2 3 4\n1 5\n5 1\n1 5...	1,553,282,103	2,147,483,647	Python 3	TIME_LIMIT_EXCEEDED	TESTS	6	2,000	20,889,600	lixo = input().split() buracos = [int(x) for x in input().split()] posicaoOsso = 1 caiu = False for i in range(int(lixo[2])): entrada = input() if caiu == False: entrada = [int(x) for x in entrada.split()] if posicaoOsso == entrada[0] or posicaoOsso == entrada[1]: if entrada[0] in buracos: po...	Title: Find The Bone Time Limit: None seconds Memory Limit: None megabytes Problem Description: Zane the wizard is going to perform a magic show shuffling the cups. There are n cups, numbered from 1 to n, placed along the x-axis on a table that has m holes on it. More precisely, cup i is on the table at t...	```python lixo = input().split() buracos = [int(x) for x in input().split()] posicaoOsso = 1 caiu = False for i in range(int(lixo[2])): entrada = input() if caiu == False: entrada = [int(x) for x in entrada.split()] if posicaoOsso == entrada[0] or posicaoOsso == entrada[1]: if entrada[0] in buracos: ...	0
567	B	Berland National Library	PROGRAMMING	1,300	[ "implementation" ]		null	null	Berland National Library has recently been built in the capital of Berland. In addition, in the library you can take any of the collected works of Berland leaders, the library has a reading room. Today was the pilot launch of an automated reading room visitors' accounting system! The scanner of the system is installed...	The first line contains a positive integer n (1<=≤<=n<=≤<=100) — the number of records in the system log. Next follow n events from the system journal in the order in which the were made. Each event was written on a single line and looks as "+ ri" or "- ri", where ri is an integer from 1 to 106, the r...	Print a single integer — the minimum possible capacity of the reading room.	[ "6\n+ 12001\n- 12001\n- 1\n- 1200\n+ 1\n+ 7\n", "2\n- 1\n- 2\n", "2\n+ 1\n- 1\n" ]	[ "3", "2", "1" ]	In the first sample test, the system log will ensure that at some point in the reading room were visitors with registration numbers 1, 1200 and 12001. More people were not in the room at the same time based on the log. Therefore, the answer to the test is 3.	1,000	[ { "input": "6\n+ 12001\n- 12001\n- 1\n- 1200\n+ 1\n+ 7", "output": "3" }, { "input": "2\n- 1\n- 2", "output": "2" }, { "input": "2\n+ 1\n- 1", "output": "1" }, { "input": "5\n+ 1\n- 1\n+ 2\n+ 3\n- 4", "output": "3" }, { "input": "3\n- 1\n- 2\n- 3", "output": "...	1,600,179,621	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	14	233	5,324,800	a=int(input()) gh=[0](int(1e6)+1) z=[input().split() for _ in " "a] i,k,s=0,0,0#38 while i<a: if z[i][0]=='+': gh[int(z[i][1])]+=1 s=max(s,sum(gh)) i+=1 else: while i<a and z[i][0]=='-': if gh[int(z[i][1])]:gh[int(z[i][1])]-=1 k+=1;i+=1 ...	Title: Berland National Library Time Limit: None seconds Memory Limit: None megabytes Problem Description: Berland National Library has recently been built in the capital of Berland. In addition, in the library you can take any of the collected works of Berland leaders, the library has a reading room. Today was the...	```python a=int(input()) gh=[0](int(1e6)+1) z=[input().split() for _ in " "a] i,k,s=0,0,0#38 while i<a: if z[i][0]=='+': gh[int(z[i][1])]+=1 s=max(s,sum(gh)) i+=1 else: while i<a and z[i][0]=='-': if gh[int(z[i][1])]:gh[int(z[i][1])]-=1 k+=1;...	0
518	D	Ilya and Escalator	PROGRAMMING	1,700	[ "combinatorics", "dp", "math", "probabilities" ]		null	null	Ilya got tired of sports programming, left university and got a job in the subway. He was given the task to determine the escalator load factor. Let's assume that n people stand in the queue for the escalator. At each second one of the two following possibilities takes place: either the first person in the queue en...	The first line of the input contains three numbers n,<=p,<=t (1<=≤<=n,<=t<=≤<=2000, 0<=≤<=p<=≤<=1). Numbers n and t are integers, number p is real, given with exactly two digits after the decimal point.	Print a single real number — the expected number of people who will be standing on the escalator after t seconds. The absolute or relative error mustn't exceed 10<=-<=6.	[ "1 0.50 1\n", "1 0.50 4\n", "4 0.20 2\n" ]	[ "0.5\n", "0.9375\n", "0.4\n" ]	none	2,000	[ { "input": "1 0.50 1", "output": "0.500000000000000" }, { "input": "1 0.50 4", "output": "0.937500000000000" }, { "input": "4 0.20 2", "output": "0.400000000000000" }, { "input": "2000 0.61 2000", "output": "1219.999999999999545" }, { "input": "100 1.00 200", ...	1,607,296,685	2,147,483,647	PyPy 3	WRONG_ANSWER	TESTS	0	124	0	n,p,t = input().split() n = int(n) p = float(p) t = int(t) # dp[n][p][t] dp = [[0 for _ in range(t+1)] for _ in range(n+1)] dp[0][0] = 1 for n_p in range(n+1): for t_p in range(t): dp[n_p][t_p+1] = dp[n_p][t_p](1-p) + dp[n_p][t_p+1] if n_p != n: dp[n_p+1][t_p+1] = dp[n_p][t_p]p + dp[n_...	Title: Ilya and Escalator Time Limit: None seconds Memory Limit: None megabytes Problem Description: Ilya got tired of sports programming, left university and got a job in the subway. He was given the task to determine the escalator load factor. Let's assume that n people stand in the queue for the escalator. At...	```python n,p,t = input().split() n = int(n) p = float(p) t = int(t) # dp[n][p][t] dp = [[0 for _ in range(t+1)] for _ in range(n+1)] dp[0][0] = 1 for n_p in range(n+1): for t_p in range(t): dp[n_p][t_p+1] = dp[n_p][t_p]*(1-p) + dp[n_p][t_p+1] if n_p != n: dp[n_p+1][t_p+1] = dp[n_p][t_p]...	0
128	B	String	PROGRAMMING	2,100	[ "brute force", "constructive algorithms", "hashing", "implementation", "string suffix structures", "strings" ]		null	null	One day in the IT lesson Anna and Maria learned about the lexicographic order. String x is lexicographically less than string y, if either x is a prefix of y (and x<=≠<=y), or there exists such i (1<=≤<=i<=≤<=min(\|x\|,<=\|y\|)), that xi<=<<=yi, and for any j (1<=≤<=j<=<<=i) x*j...	The first line contains a non-empty string that only consists of small Latin letters ("a"-"z"), whose length does not exceed 105. The second line contains the only integer k (1<=≤<=k<=≤<=105).	Print the string Anna and Maria need — the k-th (in the lexicographical order) substring of the given string. If the total number of substrings is less than k, print a string saying "No such line." (without the quotes).	[ "aa\n2\n", "abc\n5\n", "abab\n7\n" ]	[ "a\n", "bc\n", "b\n" ]	In the second sample before string "bc" follow strings "a", "ab", "abc", "b".	1,500	[ { "input": "aa\n2", "output": "a" }, { "input": "abc\n5", "output": "bc" }, { "input": "abab\n7", "output": "b" }, { "input": "codeforces\n1", "output": "c" }, { "input": "cccc\n8", "output": "ccc" }, { "input": "abcdefghijklmnopqrstuvwxyz\n27", "o...	1,462,890,910	2,147,483,647	Python 3	RUNTIME_ERROR	TESTS	6	124	5,120,000	string = input() n = len(string) s = int(input()) l = [] for i in range (0,n): for o in range (i,n): k = string[i:o+1] while len(k)<n: k += "`" kk = "" for p in range(0,n): kk +=str(ord(k[p])-30) l.append(int(kk)) l.sort() out = str(l[s-1...	Title: String Time Limit: None seconds Memory Limit: None megabytes Problem Description: One day in the IT lesson Anna and Maria learned about the lexicographic order. String x is lexicographically less than string y, if either x is a prefix of y (and x<=≠<=y), or there exists such i (1<=≤<=i<=≤<=*m...	```python string = input() n = len(string) s = int(input()) l = [] for i in range (0,n): for o in range (i,n): k = string[i:o+1] while len(k)<n: k += "`" kk = "" for p in range(0,n): kk +=str(ord(k[p])-30) l.append(int(kk)) l.sort() out =...	-1
152	A	Marks	PROGRAMMING	900	[ "implementation" ]		null	null	Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook. Overall the group has n students. They received marks for m subjects. Each student got a mark from 1 to 9 (inclusive) for each subject. Let's consider a student the best at ...	The first input line contains two integers n and m (1<=≤<=n,<=m<=≤<=100) — the number of students and the number of subjects, correspondingly. Next n lines each containing m characters describe the gradebook. Each character in the gradebook is a number from 1 to 9. Note that the marks in a rows are not sepa...	Print the single number — the number of successful students in the given group.	[ "3 3\n223\n232\n112\n", "3 5\n91728\n11828\n11111\n" ]	[ "2\n", "3\n" ]	In the first sample test the student number 1 is the best at subjects 1 and 3, student 2 is the best at subjects 1 and 2, but student 3 isn't the best at any subject. In the second sample test each student is the best at at least one subject.	500	[ { "input": "3 3\n223\n232\n112", "output": "2" }, { "input": "3 5\n91728\n11828\n11111", "output": "3" }, { "input": "2 2\n48\n27", "output": "1" }, { "input": "2 1\n4\n6", "output": "1" }, { "input": "1 2\n57", "output": "1" }, { "input": "1 1\n5", ...	1,552,022,272	2,147,483,647	PyPy 3	OK	TESTS	44	139	204,800	n, m = map(int, input().split()) mat = [input() for _ in range(n)] a = [max([mat[i][j] for i in range(n)]) for j in range(m)] print(sum([sum([x == y for x,y in zip(a,t)]) > 0 for t in mat]))	Title: Marks Time Limit: None seconds Memory Limit: None megabytes Problem Description: Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook. Overall the group has n students. They received marks for m subjects. Each student ...	```python n, m = map(int, input().split()) mat = [input() for _ in range(n)] a = [max([mat[i][j] for i in range(n)]) for j in range(m)] print(sum([sum([x == y for x,y in zip(a,t)]) > 0 for t in mat])) ```	3
433	B	Kuriyama Mirai's Stones	PROGRAMMING	1,200	[ "dp", "implementation", "sortings" ]		null	null	Kuriyama Mirai has killed many monsters and got many (namely n) stones. She numbers the stones from 1 to n. The cost of the i-th stone is vi. Kuriyama Mirai wants to know something about these stones so she will ask you two kinds of questions: 1. She will tell you two numbers, l and r (1<=≤<=l<=≤<=r...	The first line contains an integer n (1<=≤<=n<=≤<=105). The second line contains n integers: v1,<=v2,<=...,<=vn (1<=≤<=vi<=≤<=109) — costs of the stones. The third line contains an integer m (1<=≤<=m<=≤<=105) — the number of Kuriyama Mirai's questions. Then follow m lines, each line contains t...	Print m lines. Each line must contain an integer — the answer to Kuriyama Mirai's question. Print the answers to the questions in the order of input.	[ "6\n6 4 2 7 2 7\n3\n2 3 6\n1 3 4\n1 1 6\n", "4\n5 5 2 3\n10\n1 2 4\n2 1 4\n1 1 1\n2 1 4\n2 1 2\n1 1 1\n1 3 3\n1 1 3\n1 4 4\n1 2 2\n" ]	[ "24\n9\n28\n", "10\n15\n5\n15\n5\n5\n2\n12\n3\n5\n" ]	Please note that the answers to the questions may overflow 32-bit integer type.	1,500	[ { "input": "6\n6 4 2 7 2 7\n3\n2 3 6\n1 3 4\n1 1 6", "output": "24\n9\n28" }, { "input": "4\n5 5 2 3\n10\n1 2 4\n2 1 4\n1 1 1\n2 1 4\n2 1 2\n1 1 1\n1 3 3\n1 1 3\n1 4 4\n1 2 2", "output": "10\n15\n5\n15\n5\n5\n2\n12\n3\n5" }, { "input": "4\n2 2 3 6\n9\n2 2 3\n1 1 3\n2 2 3\n2 2 3\n2 2 2\n1...	1,644,940,023	2,147,483,647	PyPy 3-64	OK	TESTS	46	1,419	18,124,800	n=int(input()) nums=list(map(int,input().split())) nums2=nums.copy() nums2.sort() k=int(input()) ml=[0] ml2=[0] val=0 val2=0 for i in range(n): val+=nums[i] ml.append(val) for j in range(n): val2+=nums2[j] ml2.append(val2) for i in range(k): x,l,r=map(int,input().split()) if x==...	Title: Kuriyama Mirai's Stones Time Limit: None seconds Memory Limit: None megabytes Problem Description: Kuriyama Mirai has killed many monsters and got many (namely n) stones. She numbers the stones from 1 to n. The cost of the i-th stone is vi. Kuriyama Mirai wants to know something about these stones s...	```python n=int(input()) nums=list(map(int,input().split())) nums2=nums.copy() nums2.sort() k=int(input()) ml=[0] ml2=[0] val=0 val2=0 for i in range(n): val+=nums[i] ml.append(val) for j in range(n): val2+=nums2[j] ml2.append(val2) for i in range(k): x,l,r=map(int,input().split()) ...	3
457	A	Golden System	PROGRAMMING	1,700	[ "math", "meet-in-the-middle" ]		null	null	Piegirl got bored with binary, decimal and other integer based counting systems. Recently she discovered some interesting properties about number , in particular that q2<==<=q<=+<=1, and she thinks it would make a good base for her new unique system. She called it "golden system". In golden system the number is a n...	Input consists of two lines — one for each number. Each line contains non-empty string consisting of '0' and '1' characters. The length of each string does not exceed 100000.	Print ">" if the first number is larger, "<" if it is smaller and "=" if they are equal.	[ "1000\n111\n", "00100\n11\n", "110\n101\n" ]	[ "<\n", "=\n", ">\n" ]	In the first example first number equals to <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/9c955eec678d6e7dcdc7c94fb203e922d2ad19ad.png" style="max-width: 100.0%;max-height: 100.0%;"/>, while second number is approximately 1.618033988<sup class="upper-index">2</sup> + 1.618033988 + 1 ≈ 5.2...	1,000	[ { "input": "1000\n111", "output": "<" }, { "input": "00100\n11", "output": "=" }, { "input": "110\n101", "output": ">" }, { "input": "0\n0", "output": "=" }, { "input": "1\n10", "output": "<" }, { "input": "11\n10", "output": ">" }, { "inpu...	1,689,455,557	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	86	202	10,240,000	def normalize_backward(data, n): if n < 3: return i = n - 1 while i >= 0: if data[i] > 0 and data[i - 1] > 0: data[i] -= 1 data[i - 1] -= 1 data[i - 2] += 1 i -= 1 else: break i -= 1 def normalize(da...	Title: Golden System Time Limit: None seconds Memory Limit: None megabytes Problem Description: Piegirl got bored with binary, decimal and other integer based counting systems. Recently she discovered some interesting properties about number , in particular that q2<==<=q<=+<=1, and she thinks it would make a goo...	```python def normalize_backward(data, n): if n < 3: return i = n - 1 while i >= 0: if data[i] > 0 and data[i - 1] > 0: data[i] -= 1 data[i - 1] -= 1 data[i - 2] += 1 i -= 1 else: break i -= 1 def no...	0
667	A	Pouring Rain	PROGRAMMING	1,100	[ "geometry", "math" ]		null	null	A lot of people in Berland hates rain, but you do not. Rain pacifies, puts your thoughts in order. By these years you have developed a good tradition — when it rains, you go on the street and stay silent for a moment, contemplate all around you, enjoy freshness, think about big deeds you have to do. Today everything ...	The only line of the input contains four integer numbers d,<=h,<=v,<=e (1<=≤<=d,<=h,<=v,<=e<=≤<=104), where: - d — the diameter of your cylindrical cup, - h — the initial level of water in the cup, - v — the speed of drinking process from the cup in milliliters per second, - e — the growth ...	If it is impossible to make the cup empty, print "NO" (without quotes). Otherwise print "YES" (without quotes) in the first line. In the second line print a real number — time in seconds needed the cup will be empty. The answer will be considered correct if its relative or absolute error doesn't exceed 10<=-<=4. It is...	[ "1 2 3 100\n", "1 1 1 1\n" ]	[ "NO\n", "YES\n3.659792366325\n" ]	In the first example the water fills the cup faster than you can drink from it. In the second example area of the cup's bottom equals to <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/419dc74dcd7bc392019c9fe748fe1fdb08ab521a.png" style="max-width: 100.0%;max-height: 100.0%;"/>, thus we ca...	500	[ { "input": "1 2 3 100", "output": "NO" }, { "input": "1 1 1 1", "output": "YES\n3.659792366325" }, { "input": "48 7946 7992 72", "output": "NO" }, { "input": "72 6791 8546 46", "output": "NO" }, { "input": "100 5635 9099 23", "output": "NO" }, { "input...	1,467,540,859	2,147,483,647	Python 3	OK	TESTS	23	77	0	d, h, v, e = map(int, input().split()) from math import pi t = (piddh) / (4v-pidd*e) if t < 0: print ('NO') exit() print ('YES') print (round(t, 10))	Title: Pouring Rain Time Limit: None seconds Memory Limit: None megabytes Problem Description: A lot of people in Berland hates rain, but you do not. Rain pacifies, puts your thoughts in order. By these years you have developed a good tradition — when it rains, you go on the street and stay silent for a moment, cont...	```python d, h, v, e = map(int, input().split()) from math import pi t = (piddh) / (4v-pidd*e) if t < 0: print ('NO') exit() print ('YES') print (round(t, 10)) ```	3
632	C	The Smallest String Concatenation	PROGRAMMING	1,700	[ "sortings", "strings" ]		null	null	You're given a list of n strings a1,<=a2,<=...,<=an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest. Given the list of strings, output the lexicographically smallest concatenation.	The first line contains integer n — the number of strings (1<=≤<=n<=≤<=5·104). Each of the next n lines contains one string ai (1<=≤<=\|ai\|<=≤<=50) consisting of only lowercase English letters. The sum of string lengths will not exceed 5·104.	Print the only string a — the lexicographically smallest string concatenation.	[ "4\nabba\nabacaba\nbcd\ner\n", "5\nx\nxx\nxxa\nxxaa\nxxaaa\n", "3\nc\ncb\ncba\n" ]	[ "abacabaabbabcder\n", "xxaaaxxaaxxaxxx\n", "cbacbc\n" ]	none	0	[ { "input": "4\nabba\nabacaba\nbcd\ner", "output": "abacabaabbabcder" }, { "input": "5\nx\nxx\nxxa\nxxaa\nxxaaa", "output": "xxaaaxxaaxxaxxx" }, { "input": "3\nc\ncb\ncba", "output": "cbacbc" }, { "input": "10\naba\nabaaca\naba\nacaaaabbac\nabaacac\nb\ncabbcccaab\nbaacbb\nbcab...	1,457,094,270	2,147,483,647	Python 3	OK	TESTS	16	389	2,355,200	from functools import cmp_to_key def cmp(a,b): x=a+b y=b+a if x<y: return -1 elif x==y: return 0 return 1 n,a = int(input()),[] for i in range(n): a.append(input()) a.sort(key=cmp_to_key(cmp)) for i in a: print(i,end='')	Title: The Smallest String Concatenation Time Limit: None seconds Memory Limit: None megabytes Problem Description: You're given a list of n strings a1,<=a2,<=...,<=an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest. Given the list ...	```python from functools import cmp_to_key def cmp(a,b): x=a+b y=b+a if x<y: return -1 elif x==y: return 0 return 1 n,a = int(input()),[] for i in range(n): a.append(input()) a.sort(key=cmp_to_key(cmp)) for i in a: print(i,end='') ```	3
784	G	BF Calculator	PROGRAMMING	2,000	[ "*special" ]		null	null	In this problem you will write a simple generator of Brainfuck ([https://en.wikipedia.org/wiki/Brainfuck](https://en.wikipedia.org/wiki/Brainfuck)) calculators. You are given an arithmetic expression consisting of integers from 0 to 255 and addition/subtraction signs between them. Output a Brainfuck program which, whe...	The only line of input data contains the arithmetic expression. The expression will contain between 2 and 10 operands, separated with arithmetic signs plus and/or minus. Each operand will be an integer between 0 and 255, inclusive. The calculations result is guaranteed to be an integer between 0 and 255, inclusive (res...	Output a Brainfuck program which, when executed, will print the result of evaluating this expression. The program must be at most 5000000 characters long (including the non-command characters), and its execution must be complete in at most 50000000 steps.	[ "2+3\n", "9-7\n" ]	[ "++>\n+++>\n<[<+>-]<\n++++++++++++++++++++++++++++++++++++++++++++++++.\n", "+++++++++>\n+++++++>\n<[<->-]<\n++++++++++++++++++++++++++++++++++++++++++++++++.\n" ]	You can download the source code of the Brainfuck interpreter by the link [http://assets.codeforces.com/rounds/784/bf.cpp](//assets.codeforces.com/rounds/784/bf.cpp). We use this code to interpret outputs.	0	[ { "input": "2+3", "output": "+++++++++++++++++++++++++++++++++++++++++++++++++++++.>" }, { "input": "9-7", "output": "++++++++++++++++++++++++++++++++++++++++++++++++++.>" }, { "input": "1+1+1", "output": "+++++++++++++++++++++++++++++++++++++++++++++++++++.>" }, { "input": "...	1,492,003,752	2,147,483,647	Python 3	WRONG_ANSWER	TESTS	9	62	4,608,000	s = input() ans = eval(s) lst = list() while ans: lst.append(ans%10) ans //= 10 lst.reverse() idx = 0 for i in lst: num = i+48 while idx < num: print('+', end="") idx+=1 while idx > num: print('-', end="") idx-=1 print('.')	Title: BF Calculator Time Limit: None seconds Memory Limit: None megabytes Problem Description: In this problem you will write a simple generator of Brainfuck ([https://en.wikipedia.org/wiki/Brainfuck](https://en.wikipedia.org/wiki/Brainfuck)) calculators. You are given an arithmetic expression consisting of intege...	```python s = input() ans = eval(s) lst = list() while ans: lst.append(ans%10) ans //= 10 lst.reverse() idx = 0 for i in lst: num = i+48 while idx < num: print('+', end="") idx+=1 while idx > num: print('-', end="") idx-=1 print('.') ```	0
608	B	Hamming Distance Sum	PROGRAMMING	1,500	[ "combinatorics", "strings" ]		null	null	Genos needs your help. He was asked to solve the following programming problem by Saitama: The length of some string s is denoted \|s\|. The Hamming distance between two strings s and t of equal length is defined as , where si is the i-th character of s and ti is the i-th character of t. For exam...	The first line of the input contains binary string a (1<=≤<=\|a\|<=≤<=200<=000). The second line of the input contains binary string b (\|a\|<=≤<=\|b\|<=≤<=200<=000). Both strings are guaranteed to consist of characters '0' and '1' only.	Print a single integer — the sum of Hamming distances between a and all contiguous substrings of b of length \|a\|.	[ "01\n00111\n", "0011\n0110\n" ]	[ "3\n", "2\n" ]	For the first sample case, there are four contiguous substrings of b of length \|a\|: "00", "01", "11", and "11". The distance between "01" and "00" is \|0 - 0\| + \|1 - 0\| = 1. The distance between "01" and "01" is \|0 - 0\| + \|1 - 1\| = 0. The distance between "01" and "11" is \|0 - 1\| + \|1 - 1\| = 1. Last distance counts ...	1,000	[ { "input": "01\n00111", "output": "3" }, { "input": "0011\n0110", "output": "2" }, { "input": "0\n0", "output": "0" }, { "input": "1\n0", "output": "1" }, { "input": "0\n1", "output": "1" }, { "input": "1\n1", "output": "0" }, { "input": "1...	1,569,841,285	2,147,483,647	Python 3	OK	TESTS	30	265	7,270,400	a = input() b = input() cs = [0] for ch in b: cs.append(cs[-1] + (ch == '1')) diff = len(b) - len(a) ans = 0 for idx, ch in enumerate(a): ones = cs[idx+diff +1] - cs[idx-1 +1] zeros = diff+1 - ones if ch == '1': ans += zeros else: ans += ones print(ans)	Title: Hamming Distance Sum Time Limit: None seconds Memory Limit: None megabytes Problem Description: Genos needs your help. He was asked to solve the following programming problem by Saitama: The length of some string s is denoted \|s\|. The Hamming distance between two strings s and t of equal length is de...	```python a = input() b = input() cs = [0] for ch in b: cs.append(cs[-1] + (ch == '1')) diff = len(b) - len(a) ans = 0 for idx, ch in enumerate(a): ones = cs[idx+diff +1] - cs[idx-1 +1] zeros = diff+1 - ones if ch == '1': ans += zeros else: ans += ones print(ans) ```	3

Subsets and Splits

Successful Python Submissions

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

SQL Console for MatrixStudio/Codeforces-Python-Submissions

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

SQL Console for MatrixStudio/Codeforces-Python-Submissions

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

SQL Console for MatrixStudio/Codeforces-Python-Submissions

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