Split (3)

train · 8.14k rows

id stringlengths 14 117	description stringlengths 29 13k	code stringlengths 10 49.8k	test_samples dict	source class label 3 classes	prompt stringlengths 391 104k
p02471 Extended Euclid Algorithm_4232	Extended Euclid Algorithm Given positive integers a and b, find the integer solution (x, y) to ax + by = gcd(a, b), where gcd(a, b) is the greatest common divisor of a and b. Constraints * 1 ≤ a, b ≤ 109 Input a b Two positive integers a and b are given separated by a space in a line. Output Print two inte...	import sys sys.setrecursionlimit(10 ** 7) # 拡張Euclidの互除法 # 拡張ユークリッドの互除法 a, b = map(int, input().split()) def extgcd(a, b): if b == 0: return a, 1, 0 p, q = a // b, a % b d, x, y = extgcd(b, q) x, y = y, x - p * y return d, x, y reverse = False if b > a: a, b = b, a reverse = T...	{ "input": [ "3 8", "4 12", "5 8", "5 15", "5 1", "5 2", "15 2", "55 2", "61 2", "47 2", "11 2", "6 8", "5 4", "2 15", "5 3", "55 3", "71 2", "11 3", "49 2", "93 2", "117 2", "8 3", "41 3", "80 3", "171 2", "230 4"...	6AIZU	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Extended Euclid Algorithm Given positive integers a and b, find the integer solution (x, y) to ax + by = gcd(a, b), where gcd(a, b) is the greatest common divisor of a and b. Con...
1008_A. Romaji_4242	Vitya has just started learning Berlanese language. It is known that Berlanese uses the Latin alphabet. Vowel letters are "a", "o", "u", "i", and "e". Other letters are consonant. In Berlanese, there has to be a vowel after every consonant, but there can be any letter after any vowel. The only exception is a consonant...	s=input() a=['a','e','i','o','u'] c=0 for i in range(len(s)): if(i==len(s)-1): if s[i] in a or s[i]=='n': c+=1 continue elif s[i] in a: c+=1 continue elif(s[i]=='n'): c+=1 continue else: if s[i+1] in a: c+=...	{ "input": [ "codeforces\n", "ninja\n", "sumimasen\n", "s\n", "d\n", "anujemogawautiedoneobninnibonuunaoennnyoorufonxionntinimiboonununnnnnleenqunminzayoutanlalo\n", "uixinnepnlinqaingieianndeakuniooudidonnnqeaituioeneiroionxuowudiooonayenfeonuino\n", "king\n", "z\n", "yy\n", ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Vitya has just started learning Berlanese language. It is known that Berlanese uses the Latin alphabet. Vowel letters are "a", "o", "u", "i", and "e". Other letters are consonant. In...
1075_E. Optimal Polygon Perimeter_4249	You are given n points on the plane. The polygon formed from all the n points is strictly convex, that is, the polygon is convex, and there are no three collinear points (i.e. lying in the same straight line). The points are numbered from 1 to n, in clockwise order. We define the distance between two points p_1 = (x_1...	n = int(input()) north = -100000000 south = 100000000 east = -100000000 west = 100000000 ne = -200000000 nw = -200000000 se = -200000000 sw = -200000000 for i in range(n): x,y = map(int,input().split()) north = max(north,y) east = max(east,x) south = min(south,y) west = min(west,x) ne = max(ne,x...	{ "input": [ "4\n2 4\n4 3\n3 0\n1 3\n", "3\n0 0\n0 2\n2 0\n", "3\n97972354 -510322\n97972814 -510361\n97972410 -510528\n", "12\n-83240790 -33942371\n-83240805 -33942145\n-83240821 -33941752\n-83240424 -33941833\n-83240107 -33942105\n-83239958 -33942314\n-83239777 -33942699\n-83239762 -33942925\n-83239...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You are given n points on the plane. The polygon formed from all the n points is strictly convex, that is, the polygon is convex, and there are no three collinear points (i.e. lying i...
1096_F. Inversion Expectation_4253	A permutation of size n is an array of size n such that each integer from 1 to n occurs exactly once in this array. An inversion in a permutation p is a pair of indices (i, j) such that i > j and a_i < a_j. For example, a permutation [4, 1, 3, 2] contains 4 inversions: (2, 1), (3, 1), (4, 1), (4, 3). You are given a p...	base=998244353; def power(x, y): if(y==0): return 1 t=power(x, y//2) t=(tt)%base if(y%2): t=(tx)%base return t; def inverse(x): return power(x, base-2) ft=[0] for i in range(0, 200000): ft.append(0) def get(i): res=0 while(i<=200000): res+=ft[i] i+=i...	{ "input": [ "2\n1 2\n", "2\n-1 -1\n", "3\n3 -1 -1\n", "1\n1\n", "5\n-1 -1 5 -1 1\n", "69\n-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: A permutation of size n is an array of size n such that each integer from 1 to n occurs exactly once in this array. An inversion in a permutation p is a pair of indices (i, j) such th...
1144_C. Two Shuffled Sequences_4259	Two integer sequences existed initially — one of them was strictly increasing, and the other one — strictly decreasing. Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_k]. And strictly decreasing sequence is a sequence of integers [y_1 > y_2 > ... > y_l]. Note that the empty sequence and th...	n = int(input()) a = [int(s) for s in input().split()] d = dict() for i in a: x = d.get(i,0) if x == 0: d[i] = 1 else: d[i] += 1 up = [] down = [] for i in d.keys(): k = d[i] if k == 1: up.append(i) elif k == 2: up.append(i) down.append(i) else: ...	{ "input": [ "5\n4 3 1 5 3\n", "5\n0 1 2 3 4\n", "7\n7 2 7 3 3 1 4\n", "5\n1 1 2 1 2\n", "12\n12 8 1 3 7 5 9 6 4 10 11 2\n", "6\n5 1 4 2 6 3\n", "8\n0 9 7 5 8 6 9 3\n", "1\n1337\n", "9\n5 1 3 6 8 2 9 0 10\n", "7\n3 2 0 1 0 1 2\n", "1\n0\n", "7\n1 2 3 3 3 3 4\n", "8\...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Two integer sequences existed initially — one of them was strictly increasing, and the other one — strictly decreasing. Strictly increasing sequence is a sequence of integers [x_1 < ...
1165_B. Polycarp Training_4263	Polycarp wants to train before another programming competition. During the first day of his training he should solve exactly 1 problem, during the second day — exactly 2 problems, during the third day — exactly 3 problems, and so on. During the k-th day he should solve k problems. Polycarp has a list of n contests, th...	a = int(input()) b = [int(x) for x in input().split()] b.sort() s = 1 q = 0 for i in b: if i >= s: s += 1 q += 1 print(q)	{ "input": [ "4\n3 1 4 1\n", "5\n1 1 1 2 2\n", "3\n1 1 1\n", "5\n200000 200000 200000 200000 200000\n", "3\n5 6 7\n", "3\n100 100 100\n", "2\n2 3\n", "3\n10 10 10\n", "1\n2\n", "5\n200000 200000 200000 200000 329398\n", "3\n5 6 13\n", "2\n1 3\n", "1\n3\n", "5\n4...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Polycarp wants to train before another programming competition. During the first day of his training he should solve exactly 1 problem, during the second day — exactly 2 problems, dur...
1184_C1. Heidi and the Turing Test (Easy)_4267	The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them is that they both also love taking Turing tests! Heidi designed a series of increasingly difficult tasks for them to spend the...	import bisect import functools import math import sys from collections import defaultdict # input = sys.stdin.readline rt = lambda: map(int, input().split()) ri = lambda: int(input()) rl = lambda: list(map(int, input().split())) def solve(pts): for x1 in range(50): for x2 in range(x1+1, 51): ...	{ "input": [ "2\n0 0\n0 1\n0 2\n0 3\n1 0\n1 2\n2 0\n2 1\n2 2\n", "2\n0 0\n0 1\n0 2\n1 0\n1 1\n1 2\n2 0\n2 1\n2 2\n", "10\n0 17\n0 24\n0 28\n0 30\n0 32\n0 33\n0 36\n0 39\n0 42\n0 43\n4 16\n7 16\n8 43\n9 16\n10 16\n10 43\n12 16\n12 43\n15 43\n16 16\n17 16\n19 43\n21 16\n22 43\n23 16\n23 43\n25 16\n25 43\n26...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact a...
1202_D. Print a 1337-string..._4271	The subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements. You are given an integer n. You have to find a sequence s consisting of digits \{1, 3, 7\} such that it has exactly n subsequences equal to 1337. For example, seque...	import sys t = int(sys.stdin.readline().strip()) for i in range(0, t): n = int(sys.stdin.readline().strip()) c = 4 * 10 ** 2 d = n // (c * (c-1) // 2) b = n % (c * (c-1) // 2) print("133" + "7"b + "3" (c-2) + "7"*d)	{ "input": [ "2\n6\n1\n", "10\n141\n142\n143\n144\n145\n146\n147\n148\n149\n150\n", "10\n121\n122\n123\n124\n125\n126\n127\n128\n129\n130\n", "1\n999972121\n", "10\n271\n272\n273\n274\n275\n276\n277\n278\n279\n280\n", "1\n999962735\n", "10\n281\n282\n283\n284\n285\n286\n287\n288\n289\n290\...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: The subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements. You are given an integer n. ...
1244_D. Paint the Tree_4278	You are given a tree consisting of n vertices. A tree is an undirected connected acyclic graph. <image> Example of a tree. You have to paint each vertex into one of three colors. For each vertex, you know the cost of painting it in every color. You have to paint the vertices so that any path consisting of exactly th...	import sys from collections import defaultdict,deque def getcost(ind,col1,col2,col3,count): #print(ind,'ind',count,'count') if count==1: #print(col1[ind-1],'collooorr') return col1[ind-1] if count==2: #print(col2[ind-1],'colllllooorrr') return col2[ind-1] #print(col3[ind-...	{ "input": [ "5\n3 4 2 1 2\n4 2 1 5 4\n5 3 2 1 1\n1 2\n3 2\n4 3\n5 3\n", "5\n3 4 2 1 2\n4 2 1 5 4\n5 3 2 1 1\n1 2\n3 2\n4 3\n5 4\n", "3\n3 2 3\n4 3 2\n3 1 3\n1 2\n2 3\n", "7\n1 8 3 2 6 3 2\n2 6 6 5 4 1 9\n6 4 7 1 5 5 2\n2 6\n1 6\n6 4\n3 4\n2 5\n7 1\n", "4\n2 3 5 2\n4 5 5 6\n4 2 4 3\n4 3\n1 4\n2 3\...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You are given a tree consisting of n vertices. A tree is an undirected connected acyclic graph. <image> Example of a tree. You have to paint each vertex into one of three colors. Fo...
1264_B. Beautiful Sequence_4282	An integer sequence is called beautiful if the difference between any two consecutive numbers is equal to 1. More formally, a sequence s_1, s_2, …, s_{n} is beautiful if \|s_i - s_{i+1}\| = 1 for all 1 ≤ i ≤ n - 1. Trans has a numbers 0, b numbers 1, c numbers 2 and d numbers 3. He wants to construct a beautiful sequenc...	import sys, math import io, os #data = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline from bisect import bisect_left as bl, bisect_right as br, insort from heapq import heapify, heappush, heappop from collections import defaultdict as dd, deque, Counter # from itertools import permutations,combinations def data():...	{ "input": [ "1 2 3 4\n", "2 2 2 3\n", "2 2 2 1\n", "344 345 155 154\n", "0 0 40000 40001\n", "0 0 40000 40002\n", "0 40000 39999 0\n", "0 20000 40001 20000\n", "3436 3436 46563 46564\n", "139 140 2362 2360\n", "94 95 906 906\n", "1 1 1 1\n", "0 0 2 1\n", "0 1 0...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: An integer sequence is called beautiful if the difference between any two consecutive numbers is equal to 1. More formally, a sequence s_1, s_2, …, s_{n} is beautiful if \|s_i - s_{i+1...
1285_D. Dr. Evil Underscores_4286	Today, as a friendship gift, Bakry gave Badawy n integers a_1, a_2, ..., a_n and challenged him to choose an integer X such that the value \underset{1 ≤ i ≤ n}{max} (a_i ⊕ X) is minimum possible, where ⊕ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR). As always, Badawy is too ...	def solve(nums, bit): if bit < 0: return 0 l = [] r = [] for el in nums: if ((el >> bit) & 1): r.append(el) else: l.append(el) if len(l) == 0: return solve(r, bit - 1) if len(r) == 0: return solve(l, bit - 1) return min(solve(l, bit - 1), solve(r, bit - 1)) + (1 << bit) n = int(input()) nums = map(int, input...	{ "input": [ "2\n1 5\n", "3\n1 2 3\n", "1\n1073741823\n", "2\n0 1073741823\n", "5\n1073741823 1073741823 1073741823 1073741823 1073741823\n", "5\n1073741823 29972487 1073741823 1073741823 1073741823\n", "2\n1 0\n", "3\n1 1 3\n", "5\n219338430 29972487 1073741823 1073741823 70868246...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Today, as a friendship gift, Bakry gave Badawy n integers a_1, a_2, ..., a_n and challenged him to choose an integer X such that the value \underset{1 ≤ i ≤ n}{max} (a_i ⊕ X) is minim...
1329_A. Dreamoon Likes Coloring_4292	Dreamoon likes coloring cells very much. There is a row of n cells. Initially, all cells are empty (don't contain any color). Cells are numbered from 1 to n. You are given an integer m and m integers l_1, l_2, …, l_m (1 ≤ l_i ≤ n) Dreamoon will perform m operations. In i-th operation, Dreamoon will choose a number ...	n,m=map(int,input().split()) b=list(map(int,input().split())) if sum(b)<n:print(-1) else: s=n+1;r=[-1]m;i=0 for j in b[::-1]: s=max(s-j,m-i) if s+j-1>n:print(-1);break r[i]=s;i+=1 else:print(r[::-1])	{ "input": [ "10 1\n1\n", "5 3\n3 2 2\n", "5 3\n3 2 2\n", "100000 10\n31191 100000 99999 99999 99997 100000 99996 99994 99995 99993\n", "99999 30\n31344 14090 93157 5965 57557 41264 93881 58871 57763 46958 96029 37297 75623 12215 38442 86773 66112 7512 31968 28331 90390 79301 56205 704 15486 63054...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Dreamoon likes coloring cells very much. There is a row of n cells. Initially, all cells are empty (don't contain any color). Cells are numbered from 1 to n. You are given an intege...
1349_A. Orac and LCM_4296	For the multiset of positive integers s=\\{s_1,s_2,...,s_k\}, define the Greatest Common Divisor (GCD) and Least Common Multiple (LCM) of s as follow: * \gcd(s) is the maximum positive integer x, such that all integers in s are divisible on x. * lcm(s) is the minimum positive integer x, that divisible on all integ...	from collections import Counter from math import floor, sqrt try: long except NameError: long = int def fac(n): step = lambda x: 1 + (x<<2) - ((x>>1)<<1) maxq = long(floor(sqrt(n))) d = 1 q = 2 if n % 2 == 0 else 3 while q <= maxq and n % q != 0: q = step(d) d += 1 ...	{ "input": [ "2\n1 1\n", "10\n540 648 810 648 720 540 594 864 972 648\n", "4\n10 24 40 80\n", "2\n10007 20014\n", "2\n199999 200000\n", "2\n3 3\n", "2\n198761 199999\n", "3\n166299 110866 86856\n", "10\n972 972 324 972 324 648 1944 243 324 474\n", "2\n256 256\n", "2\n4 6\n"...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: For the multiset of positive integers s=\\{s_1,s_2,...,s_k\}, define the Greatest Common Divisor (GCD) and Least Common Multiple (LCM) of s as follow: * \gcd(s) is the maximum posi...
1369_E. DeadLee_4300	Lee bought some food for dinner time, but Lee's friends eat dinner in a deadly way. Lee is so scared, he doesn't want to die, at least not before seeing Online IOI 2020... There are n different types of food and m Lee's best friends. Lee has w_i plates of the i-th type of food and each friend has two different favorit...	import sys input = sys.stdin.readline def line_input(): return [int(x) for x in input().split()] def main(): n, m = line_input() w = line_input() adj = [[] for _ in range(n)] edges = [] deg = [0] * n for i in range(m): u, v = line_input() u, v = u - 1, v - 1 adj[u]....	{ "input": [ "3 2\n1 1 0\n1 2\n1 3\n", "4 4\n1 2 0 1\n1 3\n1 2\n2 3\n2 4\n", "5 5\n1 1 1 2 1\n3 4\n1 2\n2 3\n4 5\n4 5\n", "4 10\n2 4 1 4\n3 2\n4 2\n4 1\n3 1\n4 1\n1 3\n3 2\n2 1\n3 1\n2 4\n", "3 3\n1 2 1\n1 2\n2 3\n1 3\n", "50 50\n1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Lee bought some food for dinner time, but Lee's friends eat dinner in a deadly way. Lee is so scared, he doesn't want to die, at least not before seeing Online IOI 2020... There are ...
1391_D. 505_4304	A binary matrix is called good if every even length square sub-matrix has an odd number of ones. Given a binary matrix a consisting of n rows and m columns, determine the minimum number of cells you need to change to make it good, or report that there is no way to make it good at all. All the terms above have their...	def f( l, a): i, count = 0,0 for x in l: count += x not in a[i] #print( x, a[i], count ) i = (i+1) %2 return count def g( l, mx ): return min( [ f(l,mx[i]) for i in range(len(mx)) ] ) def two(): l = [ x[0]+x[1] for x in zip(input(),input())] mx = ( [['...	{ "input": [ "3 3\n101\n001\n110\n", "7 15\n000100001010010\n100111010110001\n101101111100100\n010000111111010\n111010010100001\n000011001111101\n111111011010011\n", "2 58\n1100001110010010100001000000000110110001101001100010101110\n1110110010101111001110010001100010001010100011111110110100\n", "4 4\n...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: A binary matrix is called good if every even length square sub-matrix has an odd number of ones. Given a binary matrix a consisting of n rows and m columns, determine the minimum nu...
1416_A. k-Amazing Numbers_4308	You are given an array a consisting of n integers numbered from 1 to n. Let's define the k-amazing number of the array as the minimum number that occurs in all of the subsegments of the array having length k (recall that a subsegment of a of length k is a contiguous part of a containing exactly k elements). If there i...	t = int(input()) ns = [] for i in range(t): n = int(input()) arr = list(map(int, input().split())) nums = set(arr) dct1 = {} dct2 = {num: 0 for num in nums} for idx, el in enumerate(arr): if el in dct1: dct2[el] = max(dct2[el], idx - dct1[el]) else: d...	{ "input": [ "3\n5\n1 2 3 4 5\n5\n4 4 4 4 2\n6\n1 3 1 5 3 1\n", "3\n5\n4 4 4 4 2\n5\n1 2 3 4 5\n6\n1 3 1 5 3 1\n", "3\n5\n1 2 3 4 5\n5\n4 4 4 4 1\n6\n1 3 1 5 3 1\n", "3\n5\n1 2 3 4 2\n5\n4 4 4 4 2\n6\n1 3 1 5 3 1\n", "3\n5\n1 1 3 4 5\n5\n4 4 4 4 2\n6\n1 3 1 5 3 1\n", "3\n5\n1 2 3 4 2\n5\n4 4 4...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You are given an array a consisting of n integers numbered from 1 to n. Let's define the k-amazing number of the array as the minimum number that occurs in all of the subsegments of ...
1480_A. Yet Another String Game_4314	Homer has two friends Alice and Bob. Both of them are string fans. One day, Alice and Bob decide to play a game on a string s = s_1 s_2 ... s_n of length n consisting of lowercase English letters. They move in turns alternatively and Alice makes the first move. In a move, a player must choose an index i (1 ≤ i ≤ n) ...	T = int(input()) for t in range (T): s = input() res = "" for i in range (len(s)): if (i%2 == 0): if (s[i] == 'a'): res += "b" else: res += "a" else: if (s[i] == 'z'): res += "y" else: ...	{ "input": [ "3\na\nbbbb\naz\n", "5\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\nzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz\nazazazazazazazazazazazazazazazazazazazazazazazazaz\nzazazazazazazazazazazazazazazazazazazazazazazazaza\nzzazzazzazzazzazzazzazzazzazzazzazzazzazzazza\n", "1\na\n", ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Homer has two friends Alice and Bob. Both of them are string fans. One day, Alice and Bob decide to play a game on a string s = s_1 s_2 ... s_n of length n consisting of lowercase E...
1506_G. Maximize the Remaining String_4318	You are given a string s, consisting of lowercase Latin letters. While there is at least one character in the string s that is repeated at least twice, you perform the following operation: * you choose the index i (1 ≤ i ≤ \|s\|) such that the character at position i occurs at least two times in the string s, and del...	for _ in range(int(input())): s = input(); stack = []; seen = set(); last_occurrence = {c: i for i, c in enumerate(s)} for i, c in enumerate(s): if c not in seen: while stack and c > stack[-1] and i < last_occurrence[stack[-1]]: seen.discard(stack.pop(...	{ "input": [ "6\ncodeforces\naezakmi\nabacaba\nconvexhull\nswflldjgpaxs\nmyneeocktxpqjpz\n", "1\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You are given a string s, consisting of lowercase Latin letters. While there is at least one character in the string s that is repeated at least twice, you perform the following opera...
1534_A. Colour the Flag_4322	Today we will be playing a red and white colouring game (no, this is not the Russian Civil War; these are just the colours of the Canadian flag). You are given an n × m grid of "R", "W", and "." characters. "R" is red, "W" is white and "." is blank. The neighbours of a cell are those that share an edge with it (those ...	I=input for _ in[0]int(I()): s=set();n,m=map(int,I().split());i=5 for _ in[0]n: i^=5;j=5 for x in I():j^=5;s\|=(s,{ord(x)^i^j})[x>'.'] if len(s)<2: c=s and s.pop()or 82 r=('YES',(''.join(chr(c^((i^j)&1)5)for i in range(m))for j in range(n))) else:r='NO', print(*r)	{ "input": [ "3\n4 6\n.R....\n......\n......\n.W....\n4 4\n.R.W\n....\n....\n....\n5 1\nR\nW\nR\nW\nR\n", "1\n5 5\n.....\n.....\n.....\n.....\n....W\n", "1\n1 1\n.\n", "1\n3 1\n.\nR\n.\n", "1\n1 1\n.\nR\n.\n", "3\n4 6\n.R....\n......\n......\n.W....\n4 4\nR..W\n....\n....\n....\n5 1\nR\nW\nR\n...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Today we will be playing a red and white colouring game (no, this is not the Russian Civil War; these are just the colours of the Canadian flag). You are given an n × m grid of "R", ...
161_C. Abracadabra_4326	Polycarpus analyzes a string called abracadabra. This string is constructed using the following algorithm: * On the first step the string consists of a single character "a". * On the k-th step Polycarpus concatenates two copies of the string obtained on the (k - 1)-th step, while inserting the k-th character of ...	def solve(x,l1,r1,l2,r2): if x==0:return 1 if l1>x: l1-=x+1 r1-=x+1 if l2>x: l2-=x+1 r2-=x+1 ans=max(0,min(r1,r2)-max(l1,l2)+1) if l1<=x and x<=r1 and l2<=x and x<=r2: if l1==0 or r1==x2: ans=max(ans,max(x-l2,r2-x)) elif l2==0 or r2==x2: ans=max(ans,max(x-l1,r1-x)) else: if l1<=x-1 and r2>...	{ "input": [ "3 6 1 4\n", "1 1 4 4\n", "4 7 12 15\n", "1 463129088 536870913 1000000000\n", "1 4 4 7\n", "1 2 3 3\n", "1 1 2 1000000000\n", "8136 12821 10573 15189\n", "169720415 312105195 670978284 671296539\n", "654444727 988815385 77276659 644738371\n", "26733 47464 1913...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Polycarpus analyzes a string called abracadabra. This string is constructed using the following algorithm: * On the first step the string consists of a single character "a". * ...
180_E. Cubes_4330	Let's imagine that you're playing the following simple computer game. The screen displays n lined-up cubes. Each cube is painted one of m colors. You are allowed to delete not more than k cubes (that do not necessarily go one after another). After that, the remaining cubes join together (so that the gaps are closed) an...	# ---------------------------iye ha aam zindegi--------------------------------------------- import math import heapq, bisect import sys from collections import deque, defaultdict from fractions import Fraction mod = 10 ** 9 + 7 mod1 = 998244353 # ------------------------------warmup---------------------------- impor...	{ "input": [ "3 1 2\n1 1 1\n", "10 2 2\n1 2 1 2 1 1 2 1 1 2\n", "10 3 2\n1 2 1 1 3 2 1 1 2 2\n", "30 5 6\n4 2 2 1 3 4 2 3 2 4 3 1 1 4 4 3 5 1 4 5 5 1 2 2 1 2 4 4 1 2\n", "20 6 3\n4 1 2 6 3 3 2 5 2 5 2 1 1 4 1 2 2 1 1 4\n", "100 5 10\n4 4 4 4 4 4 4 4 4 4 4 4 2 4 4 4 4 4 4 4 4 4 2 2 2 3 3 3 3 3 ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Let's imagine that you're playing the following simple computer game. The screen displays n lined-up cubes. Each cube is painted one of m colors. You are allowed to delete not more th...
204_A. Little Elephant and Interval_4334	The Little Elephant very much loves sums on intervals. This time he has a pair of integers l and r (l ≤ r). The Little Elephant has to find the number of such integers x (l ≤ x ≤ r), that the first digit of integer x equals the last one (in decimal notation). For example, such numbers as 101, 477474 or 9 will be inclu...	def F (x) : if (x < 10) : return x rv = 9 tmp = x len = 0 while (tmp > 0) : len += 1 tmp = tmp // 10 d = int (x // pow(10, len-1)) tmp = 1 for i in range(len - 2) : rv += 9 * tmp tmp *= 10 for i in range (1, 10) : if (i < d) : ...	{ "input": [ "47 1024\n", "2 47\n", "645762257531682046 885295120956158518\n", "1 11\n", "47 8545\n", "10001 10000002\n", "1827171 232817181719384635\n", "9999999999999987 99999999999999711\n", "819875140559301752 946247219812473271\n", "2 3\n", "522842183413115088 85362871...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: The Little Elephant very much loves sums on intervals. This time he has a pair of integers l and r (l ≤ r). The Little Elephant has to find the number of such integers x (l ≤ x ≤ r),...
228_E. The Road to Berland is Paved With Good Intentions_4338	Berland has n cities, some of them are connected by bidirectional roads. For each road we know whether it is asphalted or not. The King of Berland Valera II wants to asphalt all roads of Berland, for that he gathered a group of workers. Every day Valera chooses exactly one city and orders the crew to asphalt all roads...	s=list(map(int,input().split())) n=s[0] m=s[1] roads=[] for i in range(0,n+1): roads.append([]) for i in range(0,m): s=list(map(int,input().split())) roads[s[0]].append([s[1],s[2]]) roads[s[1]].append([s[0],s[2]]) col=[-1]*(n+1) ##def dfs(v,c): ## success=True ## col[v]=c ## for e in roads[...	{ "input": [ "3 3\n1 2 0\n2 3 0\n3 1 0\n", "4 4\n1 2 1\n2 4 0\n4 3 1\n3 2 0\n", "100 41\n3 89 1\n31 33 0\n88 83 0\n45 97 0\n32 86 0\n19 12 1\n75 74 0\n74 10 0\n69 73 1\n69 80 0\n97 61 1\n73 68 0\n70 51 1\n56 92 1\n95 42 0\n69 51 1\n2 51 0\n72 38 1\n86 10 1\n35 50 1\n81 58 0\n34 8 0\n93 82 1\n81 84 1\n68 6...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Berland has n cities, some of them are connected by bidirectional roads. For each road we know whether it is asphalted or not. The King of Berland Valera II wants to asphalt all road...
252_C. Points on Line_4342	Little Petya likes points a lot. Recently his mom has presented him n points lying on the line OX. Now Petya is wondering in how many ways he can choose three distinct points so that the distance between the two farthest of them doesn't exceed d. Note that the order of the points inside the group of three chosen point...	n,d=map(int,input().split()) nums=list(map(int,input().split())) count=0 j=0 for i in range(n): while j<n and nums[j]-nums[i]<=d: j+=1 temp_length=(j-i-1) count+=int((temp_length*(temp_length-1))/2) print(count)	{ "input": [ "4 3\n1 2 3 4\n", "4 2\n-3 -2 -1 0\n", "5 19\n1 10 20 30 50\n", "2 1000000000\n-14348867 1760823\n", "10 5\n31 36 43 47 48 50 56 69 71 86\n", "10 90\n24 27 40 41 61 69 73 87 95 97\n", "10 50\n1 4 20 27 65 79 82 83 99 100\n", "3 1000000000\n-5 -1 1\n", "2 1000000000\n-9...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Little Petya likes points a lot. Recently his mom has presented him n points lying on the line OX. Now Petya is wondering in how many ways he can choose three distinct points so that ...
2_A. Winner_4348	The winner of the card game popular in Berland "Berlogging" is determined according to the following rules. If at the end of the game there is only one player with the maximum number of points, he is the winner. The situation becomes more difficult if the number of such players is more than one. During each round a pla...	n = int(input()) d = {} l = [] for _ in range(n): name, score = input().split() score = int(score) l.append((name,score)) d[name] = d.get(name, 0) + score m = max([x for x in d.values()]) ties = [x for x,y in d.items() if y == m] # print(ties) if len(ties) == 1: print(ties[0]) exit() el...	{ "input": [ "3\nandrew 3\nandrew 2\nmike 5\n", "3\nmike 3\nandrew 5\nmike 2\n", "15\naawtvezfntstrcpgbzjbf 681\nzhahpvqiptvksnbjkdvmknb -74\naawtvezfntstrcpgbzjbf 661\njpdwmyke 474\naawtvezfntstrcpgbzjbf -547\naawtvezfntstrcpgbzjbf 600\nzhahpvqiptvksnbjkdvmknb -11\njpdwmyke 711\nbjmj 652\naawtvezfntstrcp...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: The winner of the card game popular in Berland "Berlogging" is determined according to the following rules. If at the end of the game there is only one player with the maximum number ...
325_A. Square and Rectangles_4352	You are given n rectangles. The corners of rectangles have integer coordinates and their edges are parallel to the Ox and Oy axes. The rectangles may touch each other, but they do not overlap (that is, there are no points that belong to the interior of more than one rectangle). Your task is to determine if the rectan...	xmin, ymin, xmax, ymax, a = 31400, 31400, 0, 0, 0 for i in range(int(input())): x1, y1, x2, y2 = map(int, input().split()) xmin = min(xmin, x1) ymin = min(ymin, y1) xmax = max(xmax, x2) ymax = max(ymax, y2) a += (x2 - x1) * (y2 - y1) print('YES' if xmax - xmin == ymax - ymin and a == (xmax - xmi...	{ "input": [ "5\n0 0 2 3\n0 3 3 5\n2 0 5 2\n3 2 5 5\n2 2 3 3\n", "4\n0 0 2 3\n0 3 3 5\n2 0 5 2\n3 2 5 5\n", "3\n25784 0 31400 20408\n0 20408 31400 20582\n15802 0 18106 20408\n", "2\n1 1 5 5\n1 5 5 7\n", "5\n1 1 3 5\n3 3 5 5\n4 1 5 3\n3 1 4 2\n2 5 3 6\n", "5\n0 0 10000 20000\n10000 0 15000 1999...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You are given n rectangles. The corners of rectangles have integer coordinates and their edges are parallel to the Ox and Oy axes. The rectangles may touch each other, but they do not...
371_C. Hamburgers_4359	Polycarpus loves hamburgers very much. He especially adores the hamburgers he makes with his own hands. Polycarpus thinks that there are only three decent ingredients to make hamburgers from: a bread, sausage and cheese. He writes down the recipe of his favorite "Le Hamburger de Polycarpus" as a string of letters 'B' (...	st = input() B = st.count('B') S = st.count('S') C = st.count('C') b,s,c=map(int,input().split()) bp, sp, cp = map(int,input().split()) r=int(input()) lm=0; rm=int(1e15)+1 while rm-lm>1: m=(rm+lm)//2 # print(m) bb=max(mB-b,0) ss=max(mS-s,0) cc=max(mC-c, 0) #print(bpbb+sssp+cccp) if bp*b...	{ "input": [ "BBC\n1 10 1\n1 10 1\n21\n", "BSC\n1 1 1\n1 1 3\n1000000000000\n", "BBBSSC\n6 4 1\n1 2 3\n4\n", "B\n100 100 100\n1 1 1\n1\n", "SBCSSCBBSSBCSSBBBSSBSCBSSSCBBSBBBBCSBCSBSCBSCBSCBSBSSCCCCBSBCCBCBSCCCBSCCBSBBCBSSCCCCSBSBBBSSSBCSCBC\n94 16 85\n14 18 91\n836590091442\n", "BBBBBBBBBBBBBB...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Polycarpus loves hamburgers very much. He especially adores the hamburgers he makes with his own hands. Polycarpus thinks that there are only three decent ingredients to make hamburge...
416_A. Guess a number!_4365	A TV show called "Guess a number!" is gathering popularity. The whole Berland, the old and the young, are watching the show. The rules are simple. The host thinks of an integer y and the participants guess it by asking questions to the host. There are four types of acceptable questions: * Is it true that y is stric...	n = int(input()) questions = [] for _ in range(n): questions.append(input()) lower_bound, upper_bound = None, None for q in questions: bound = int(q.split()[1]) if (q.startswith('>') and q.endswith('Y')) or (q.startswith('<') and q.endswith('N')): if ('Y' in q and '=' not in q) or ('N' in q and '...	{ "input": [ "4\n>= 1 Y\n< 3 N\n<= -3 N\n> 55 N\n", "2\n> 100 Y\n< -100 Y\n", "1\n<= -999999999 Y\n", "1\n< -1000000000 Y\n", "4\n> 5 N\n>= -5 Y\n> -9 Y\n> -9 Y\n", "10\n<= -60 N\n>= -59 Y\n> 22 Y\n> 95 N\n<= 91 Y\n> 77 Y\n>= -59 Y\n> -25 Y\n> -22 Y\n>= 52 Y\n", "1\n<= 15...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: A TV show called "Guess a number!" is gathering popularity. The whole Berland, the old and the young, are watching the show. The rules are simple. The host thinks of an integer y and...
488_D. Strip_4373	Alexandra has a paper strip with n numbers on it. Let's call them ai from left to right. Now Alexandra wants to split it into some pieces (possibly 1). For each piece of strip, it must satisfy: * Each piece should contain at least l numbers. * The difference between the maximal and the minimal number on the piece...	def split(a,n,s,l): pieces = [] i = 1 tmpmin = a[0] tmpmax = a[0] tmppc = [a[0]] while i<n: if abs(a[i]-tmpmin)<=s and abs(a[i]-tmpmax)<=s: tmppc.append(a[i]) if a[i]<tmpmin: tmpmin=a[i] elif a[i]>tmpmax: tmpmax = a[i] else: piece...	{ "input": [ "7 2 2\n1 3 1 2 4 1 2\n", "7 2 2\n1 100 1 100 1 100 1\n", "1 100 2\n42\n", "6 565 2\n31 76 162 -182 -251 214\n", "2 1000000000 1\n-1000000000 1000000000\n", "1 0 1\n0\n", "10 3 3\n1 1 1 1 1 5 6 7 8 9\n", "1 0 1\n-1000000000\n", "10 3 3\n1 1 1 2 2 5 6 7 8 9\n", "2 1...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Alexandra has a paper strip with n numbers on it. Let's call them ai from left to right. Now Alexandra wants to split it into some pieces (possibly 1). For each piece of strip, it mu...
512_C. Fox And Dinner_4376	Fox Ciel is participating in a party in Prime Kingdom. There are n foxes there (include Fox Ciel). The i-th fox is ai years old. They will have dinner around some round tables. You want to distribute foxes such that: 1. Each fox is sitting at some table. 2. Each table has at least 3 foxes sitting around it. 3...	from collections import deque class Dinic(): def __init__(self, listEdge, s, t): self.s = s self.t = t self.graph = {} self.maxCap = 1000000 # dict các node lân cận # e[0]: from, e[1]: to, e[2]: dung luong for e in listEdge: ...	{ "input": [ "5\n2 2 2 2 2\n", "4\n3 4 8 9\n", "12\n2 3 4 5 6 7 8 9 10 11 12 13\n", "24\n2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25\n", "15\n3 3 3 3 3 3 3 4 2 4 2 2 2 4 2\n", "152\n29 23 17 25 13 29 29 29 25 23 25 29 19 25 13 25 13 23 21 27 15 29 29 25 27 17 17 19 25 19 13...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Fox Ciel is participating in a party in Prime Kingdom. There are n foxes there (include Fox Ciel). The i-th fox is ai years old. They will have dinner around some round tables. You w...
560_E. Gerald and Giant Chess_4381	Giant chess is quite common in Geraldion. We will not delve into the rules of the game, we'll just say that the game takes place on an h × w field, and it is painted in two colors, but not like in chess. Almost all cells of the field are white and only some of them are black. Currently Gerald is finishing a game of gia...	#!/usr/bin/env python # 560E_chess.py - Codeforces.com 560E Chess program # # Copyright (C) 2015 Sergey """ Input The first line of the input contains three integers: h,w,n the sides of the board and the number of black cells Next n lines contain the description of black cells. The ith of these lines contains number...	{ "input": [ "100 100 3\n15 16\n16 15\n99 88\n", "3 4 2\n2 2\n2 3\n", "100 10 30\n40 4\n15 3\n75 3\n88 10\n32 1\n16 5\n81 8\n45 2\n72 8\n11 6\n86 4\n50 2\n9 4\n11 1\n20 3\n47 3\n2 4\n68 3\n90 5\n85 2\n88 1\n88 5\n86 3\n70 9\n49 3\n34 4\n5 7\n77 5\n50 1\n87 5\n", "100000 100000 2\n1 2\n2 1\n", "100...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Giant chess is quite common in Geraldion. We will not delve into the rules of the game, we'll just say that the game takes place on an h × w field, and it is painted in two colors, bu...
587_A. Duff and Weight Lifting_4385	Recently, Duff has been practicing weight lifting. As a hard practice, Malek gave her a task. He gave her a sequence of weights. Weight of i-th of them is 2wi pounds. In each step, Duff can lift some of the remaining weights and throw them away. She does this until there's no more weight left. Malek asked her to minimi...	N = int(1e6+100) n = int(input()) arr = list(map(int, input().split())) cnt = [0] * N for i in arr: cnt[i] += 1 res, s = 0, 0 for i in range(N): s += cnt[i] res += s % 2 s //= 2 print(res)	{ "input": [ "5\n1 1 2 3 3\n", "4\n0 1 2 3\n", "2\n95745 95745\n", "100\n196 1681 196 0 61 93 196 196 196 196 196 0 0 96 18 1576 0 93 666463 18 93 1 1278 8939 93 196 196 1278 3 0 67416 869956 10 56489 196 745 39 783 196 8939 196 81 69634 4552 39 3 14 20 25 8 10 4 7302 0 19579 20 1140 15990 7302 0 1957...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Recently, Duff has been practicing weight lifting. As a hard practice, Malek gave her a task. He gave her a sequence of weights. Weight of i-th of them is 2wi pounds. In each step, Du...
609_C. Load Balancing_4389	In the school computer room there are n servers which are responsible for processing several computing tasks. You know the number of scheduled tasks for each server: there are mi tasks assigned to the i-th server. In order to balance the load for each server, you want to reassign some tasks to make the difference betw...	input() servers = [int(x) for x in input().split(" ", )] servers.sort() avg = int(sum(servers) / len(servers)) extra = sum(servers) % len(servers) count = 0 for i in range(len(servers)): count += abs(avg + (i >= (len(servers) - extra)) - servers[i]) / 2 print(int(count))	{ "input": [ "2\n1 6\n", "7\n10 11 10 11 10 11 11\n", "5\n1 2 3 4 5\n", "2\n10 3\n", "5\n2 10 20 30 50\n", "1\n0\n", "10\n19999 19999 20000 20000 19999 20000 20000 20000 19999 19999\n", "1\n20000\n", "5\n6 5 9 7 6\n", "7\n2 2 2 2 2 3 4\n", "10\n0 0 0 0 0 0 0 0 0 0\n", "...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: In the school computer room there are n servers which are responsible for processing several computing tasks. You know the number of scheduled tasks for each server: there are mi task...
630_B. Moore's Law_4393	The city administration of IT City decided to fix up a symbol of scientific and technical progress in the city's main square, namely an indicator board that shows the effect of Moore's law in real time. Moore's law is the observation that the number of transistors in a dense integrated circuit doubles approximately ev...	n,t=map(int,input().split()) print(n((1.000000011)*t))	{ "input": [ "1000 1000000\n", "4907 244618708\n", "4054 287739817\n", "1000 0\n", "1000 1\n", "1000 2\n", "1587 1941728048\n", "9030 982505993\n", "10000 3\n", "10000 2000000000\n", "4907 248948704\n", "4054 255445737\n", "1010 0\n", "1100 2\n", "10001 3\n"...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: The city administration of IT City decided to fix up a symbol of scientific and technical progress in the city's main square, namely an indicator board that shows the effect of Moore'...
656_F. Ace It!_4397	Input The only line of the input is a string of 7 characters. The first character is letter A, followed by 6 digits. The input is guaranteed to be valid (for certain definition of "valid"). Output Output a single integer. Examples Input A221033 Output 21 Input A223635 Output 22 Input A232726 Outpu...	s = input() ans = 1 for i in s[1:]: x = int(i) if x == 0: x = 9 ans += x print(ans)	{ "input": [ "A232726\n", "A223635\n", "A221033\n", "A222222\n", "A101010\n", "A999999\n", "A910224\n", "A232232\n", "A767653\n", "A458922\n", "A764598\n", "A987654\n", "A332567\n", "A638495\n", "A234567\n", "A292992\n", "A102222\n", "A710210\n",...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Input The only line of the input is a string of 7 characters. The first character is letter A, followed by 6 digits. The input is guaranteed to be valid (for certain definition of ...
680_A. Bear and Five Cards_4401	A little bear Limak plays a game. He has five cards. There is one number written on each card. Each number is a positive integer. Limak can discard (throw out) some cards. His goal is to minimize the sum of numbers written on remaining (not discarded) cards. He is allowed to at most once discard two or three cards wi...	l=list(map(int,input().split())) ma=0 for i in l : k=0 for j in l : if i==j : k=k+1 if k>2 : break if k>1 : if ma<ki : ma=ki print(sum(l)-ma)	{ "input": [ "7 9 3 1 8\n", "7 3 7 3 20\n", "10 10 10 10 10\n", "1 2 2 2 2\n", "20 21 22 23 24\n", "8 8 8 2 2\n", "1 90 1 91 1\n", "1 1 1 1 4\n", "1 1 1 1 2\n", "2 2 2 100 100\n", "1 2 3 4 5\n", "98 99 100 99 100\n", "1 1 1 8 1\n", "100 100 100 100 100\n", "...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: A little bear Limak plays a game. He has five cards. There is one number written on each card. Each number is a positive integer. Limak can discard (throw out) some cards. His goal i...
746_G. New Roads_4409	There are n cities in Berland, each of them has a unique id — an integer from 1 to n, the capital is the one with id 1. Now there is a serious problem in Berland with roads — there are no roads. That is why there was a decision to build n - 1 roads so that there will be exactly one simple path between each pair of cit...	if __name__ == '__main__': n, t, k = map(int, input().split()) a = list(map(int, input().split())) b = [0 for _ in range(t)] b[t-1] = a[t-1] maxk = a[t-1] for i in range(t-2, -1, -1): b[i] = b[i+1] if a[i+1] < a[i]: b[i] += a[i] - a[i+1] maxk += a[i]-1 if b[0] > k or maxk < k: print(-1) else: prin...	{ "input": [ "7 3 3\n2 3 1\n", "3 1 1\n2\n", "14 5 6\n4 4 2 2 1\n", "2000 3 1337\n970 632 397\n", "2001 34 1714\n28 91 43 47 52 42 69 95 11 70 59 68 88 92 71 19 7 70 100 66 1 38 36 88 58 52 87 85 40 75 26 42 85 99\n", "2 1 1\n1\n", "17 5 11\n5 3 2 5 1\n", "5 4 4\n1 1 1 1\n", "11 6 ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: There are n cities in Berland, each of them has a unique id — an integer from 1 to n, the capital is the one with id 1. Now there is a serious problem in Berland with roads — there ar...
814_D. An overnight dance in discotheque_4417	The crowdedness of the discotheque would never stop our friends from having fun, but a bit more spaciousness won't hurt, will it? The discotheque can be seen as an infinite xy-plane, in which there are a total of n dancers. Once someone starts moving around, they will move only inside their own movement range, which i...	n = int(input()) d = [1] * n p = [[] for i in range(n)] def f(): x, y, r = map(int, input().split()) return r * r, x, y t = sorted(f() for i in range(n)) for i in range(n): r, x, y = t[i] for j in range(i + 1, n): s, a, b = t[j] if (a - x) 2 + (b - y) 2 < s: p[j].a...	{ "input": [ "5\n2 1 6\n0 4 1\n2 -1 3\n1 -2 1\n4 -1 1\n", "8\n0 0 1\n0 0 2\n0 0 3\n0 0 4\n0 0 5\n0 0 6\n0 0 7\n0 0 8\n", "2\n281573 0 281573\n706546 0 706546\n", "1\n72989 14397 49999\n", "20\n-961747 0 961747\n-957138 0 957138\n-921232 0 921232\n-887450 0 887450\n-859109 0 859109\n-686787 0 68678...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: The crowdedness of the discotheque would never stop our friends from having fun, but a bit more spaciousness won't hurt, will it? The discotheque can be seen as an infinite xy-plane,...
83_D. Numbers_4421	One quite ordinary day Valera went to school (there's nowhere else he should go on a week day). In a maths lesson his favorite teacher Ms. Evans told students about divisors. Despite the fact that Valera loved math, he didn't find this particular topic interesting. Even more, it seemed so boring that he fell asleep in ...	def pr(x): d = 2 while d * d <= x: if x % d == 0: return 0 d += 1 return 1 def cnt(n, k): if not pr(k) or n < k: return 0 n1 = n // k return n1 - sum(cnt(n1, i) for i in range(2, min(k, n1 + 1))) a, b, k = map(int, input().split()) ans = cnt(b, k) - cnt(a - 1, k...	{ "input": [ "12 23 3\n", "1 10 2\n", "6 19 5\n", "1 2000000000 10007\n", "19431 20000000 17\n", "1570000 800000000 30011\n", "1000 2000000000 211\n", "1999999000 2000000000 23\n", "1 2000000000 23\n", "44711 44711 44711\n", "1 2000000000 44711\n", "300303 600000 503\n"...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: One quite ordinary day Valera went to school (there's nowhere else he should go on a week day). In a maths lesson his favorite teacher Ms. Evans told students about divisors. Despite ...
909_E. Coprocessor_4429	You are given a program you want to execute as a set of tasks organized in a dependency graph. The dependency graph is a directed acyclic graph: each task can depend on results of one or several other tasks, and there are no directed circular dependencies between tasks. A task can only be executed if all tasks it depen...	n, m = [int(x) for x in input().split()] tps = {i:int(t) for i, t in enumerate(input().split())} deps = {i:0 for i in range(n)} parents = {i:[] for i in range(n)} leafs = {i for i in range(n)} for i in range(m): x, y = [int(x) for x in input().split()] deps[x] += 1 parents[y].append(x) if x in leafs: ...	{ "input": [ "4 3\n1 1 1 0\n0 1\n0 2\n3 0\n", "4 3\n0 1 0 1\n0 1\n1 2\n2 3\n", "2 1\n0 1\n0 1\n", "10 14\n1 1 0 0 1 0 1 0 1 1\n0 1\n0 2\n0 4\n0 9\n1 3\n2 5\n3 4\n3 6\n3 8\n4 9\n5 6\n6 7\n7 8\n7 9\n", "10 19\n0 0 0 0 0 0 0 0 1 1\n0 1\n0 3\n0 4\n1 2\n1 3\n1 4\n1 5\n1 7\n1 8\n1 9\n2 3\n2 4\n3 4\n3 5\...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You are given a program you want to execute as a set of tasks organized in a dependency graph. The dependency graph is a directed acyclic graph: each task can depend on results of one...
931_B. World Cup_4433	The last stage of Football World Cup is played using the play-off system. There are n teams left in this stage, they are enumerated from 1 to n. Several rounds are held, in each round the remaining teams are sorted in the order of their ids, then the first in this order plays with the second, the third — with the four...	n,a,b=map(int,input().split()) a,b,r=a-1,b-1,0 while a!=b: a//=2 b//=2 r+=1 print(r if 2**r<n else 'Final!')	{ "input": [ "4 1 2\n", "8 7 5\n", "8 2 6\n", "4 1 4\n", "16 2 4\n", "4 1 3\n", "4 3 4\n", "8 8 5\n", "4 4 2\n", "256 178 166\n", "16 4 3\n", "8 8 7\n", "256 255 129\n", "4 2 4\n", "16 3 11\n", "256 2 127\n", "4 4 3\n", "4 2 1\n", "8 2 3\n", ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: The last stage of Football World Cup is played using the play-off system. There are n teams left in this stage, they are enumerated from 1 to n. Several rounds are held, in each roun...
985_B. Switches and Lamps_4438	You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where ai, j = 1 if the i-th switch turns on the j-th lamp and ai, j = 0 if the i-th switch is not connected to the j-th lamp. Initially all m lamps are t...	def main(): n,m=map(int,input().split()) counts=[0]m a=[None]n for i in range(n): line=input() a[i]=line for j in range(m): counts[j]+=1 if line[j]=='1' else 0 if 1 not in counts: print('YES') return checks=[] for i in range(m): if counts[i]==1: checks.append(i) leng=len(checks) for i in r...	{ "input": [ "4 5\n10100\n01000\n00110\n00101\n", "4 5\n10101\n01000\n00111\n10000\n", "3 5\n11100\n00110\n00011\n", "3 4\n1010\n0100\n1101\n", "2 5\n01000\n11111\n", "2 3\n101\n111\n", "2 5\n10000\n11111\n", "4 2\n10\n01\n10\n01\n", "3 3\n010\n101\n000\n", "2 6\n111111\n000000...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where ai, j = 1 i...
p02575 AtCoder Beginner Contest 177 - I hate Shortest Path Problem_4451	There is a grid of squares with H+1 horizontal rows and W vertical columns. You will start at one of the squares in the top row and repeat moving one square right or down. However, for each integer i from 1 through H, you cannot move down from the A_i-th, (A_i + 1)-th, \ldots, B_i-th squares from the left in the i-th ...	''' 自宅用PCでの解答 ''' import math #import numpy as np import itertools import queue import bisect from collections import deque,defaultdict import heapq as hpq from sys import stdin,setrecursionlimit #from scipy.sparse.csgraph import dijkstra #from scipy.sparse import csr_matrix ipt = stdin.readline setrecursionlimit(10**7...	{ "input": [ "4 4\n2 4\n1 1\n2 3\n2 4", "4 7\n2 4\n1 1\n2 3\n2 4", "4 4\n2 4\n1 1\n2 0\n2 4", "4 4\n3 4\n1 1\n2 3\n2 4", "4 4\n2 4\n1 1\n2 0\n3 4", "4 4\n1 4\n1 1\n2 0\n3 4", "4 5\n0 4\n0 1\n4 5\n3 4", "4 7\n2 4\n0 1\n2 3\n5 7", "4 7\n1 3\n0 1\n4 1\n3 7", "4 7\n2 4\n0 1\n2 3\n2...	5ATCODER	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: There is a grid of squares with H+1 horizontal rows and W vertical columns. You will start at one of the squares in the top row and repeat moving one square right or down. However, f...
p02706 AtCoder Beginner Contest 163 - Homework_4455	Takahashi has N days of summer vacation. His teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment. He cannot do multiple assignments on the same day, or hang out on a day he does an assignment. What is the maximum number of days Takahashi can hang out during the vacation if ...	N,X = map(int,input().split()) Y = N - sum(map(int,input().split())) print(("-1",Y)[Y >= 0])	{ "input": [ "10 2\n5 6", "314 15\n9 26 5 35 8 9 79 3 23 8 46 2 6 43 3", "41 2\n5 6", "11 2\n5 6", "10 2\n6 6", "314 15\n9 24 5 35 8 9 79 3 23 8 46 2 6 43 3", "41 2\n9 6", "11 2\n5 2", "20 2\n5 2", "20 2\n7 4", "41 2\n5 12", "41 2\n9 9", "11 2\n5 0", "14 2\n3 6"...	5ATCODER	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Takahashi has N days of summer vacation. His teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment. He cannot do multiple assignments on the...
p02835 AtCoder Beginner Contest 147 - Blackjack_4459	Given are three integers A_1, A_2, and A_3. If A_1+A_2+A_3 is greater than or equal to 22, print `bust`; otherwise, print `win`. Constraints * 1 \leq A_i \leq 13 \ \ (i=1,2,3) * All values in input are integers. Input Input is given from Standard Input in the following format: A_1 A_2 A_3 Output If A_1+A_2+A_...	print('bwuisnt'[sum(map(int,input().split()))<22::2])	{ "input": [ "5 7 9", "13 7 2", "5 7 4", "13 9 2", "5 1 4", "13 9 4", "5 1 0", "0 9 4", "5 1 1", "0 1 4", "6 1 1", "0 2 4", "6 1 2", "0 2 1", "6 2 1", "-1 2 1", "6 0 1", "-1 2 0", "9 0 1", "-1 1 0", "17 0 1", "-1 1 1", "17 0 2...	5ATCODER	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Given are three integers A_1, A_2, and A_3. If A_1+A_2+A_3 is greater than or equal to 22, print `bust`; otherwise, print `win`. Constraints * 1 \leq A_i \leq 13 \ \ (i=1,2,3) * Al...
p02972 AtCoder Beginner Contest 134 - Preparing Boxes_4463	There are N empty boxes arranged in a row from left to right. The integer i is written on the i-th box from the left (1 \leq i \leq N). For each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it. We say a set of choices to put a ball or not in the boxes is good when the following con...	N = int(input()) A = list(map(int, input().split())) B = [0]*(N+1) x = [] for n in range(N): i = N-n BB = B[::i] if (sum(BB))%2 == A[i-1]: B[i] = 0 else: B[i] = 1 x.append(str(i)) print(len(x)) print(' '.join(x))	{ "input": [ "5\n0 0 0 0 0", "3\n1 0 0", "3\n1 0 1", "3\n1 1 0", "3\n0 0 0", "5\n1 0 0 0 0", "5\n1 0 0 0 1", "5\n1 1 0 1 0", "5\n1 0 1 0 0", "5\n1 1 0 0 0", "5\n1 0 0 0 0", "3\n0 0 0", "3\n1 1 0", "5\n1 0 0 0 1", "3\n1 0 1", "5\n1 1 0 0 0", "5\n1 0 1...	5ATCODER	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: There are N empty boxes arranged in a row from left to right. The integer i is written on the i-th box from the left (1 \leq i \leq N). For each of these boxes, Snuke can choose eith...
p03108 AtCoder Beginner Contest 120 - Decayed Bridges_4467	There are N islands and M bridges. The i-th bridge connects the A_i-th and B_i-th islands bidirectionally. Initially, we can travel between any two islands using some of these bridges. However, the results of a survey show that these bridges will all collapse because of aging, in the order from the first bridge to t...	(N,M) = map(int,input().split()) A = [0]M B = [0]M for i in range(M): (A[i], B[i]) = map(int,input().split()) A[i] -= 1 B[i] -= 1 parent = [-1]N depth = [0] N def boss(n): d = 0 while parent[n] >= 0: n = parent[n] d += 1 return n,d P = [1]N S = (N(N-1))//2 ans = [0] * ...	{ "input": [ "6 5\n2 3\n1 2\n5 6\n3 4\n4 5", "4 5\n1 2\n3 4\n1 3\n2 3\n1 4", "2 1\n1 2", "6 5\n3 3\n1 2\n5 6\n3 4\n4 5", "4 5\n1 2\n3 4\n1 3\n3 3\n1 4", "2 1\n2 2", "6 5\n3 3\n1 2\n5 6\n3 4\n2 5", "4 5\n1 2\n3 4\n1 3\n3 3\n1 1", "6 5\n2 3\n1 2\n5 6\n3 4\n4 3", "4 5\n1 0\n3 4\n1...	5ATCODER	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: There are N islands and M bridges. The i-th bridge connects the A_i-th and B_i-th islands bidirectionally. Initially, we can travel between any two islands using some of these bridg...
p03255 AtCoder Grand Contest 027 - Garbage Collector_4471	Snuke has decided to use a robot to clean his room. There are N pieces of trash on a number line. The i-th piece from the left is at position x_i. We would like to put all of them in a trash bin at position 0. For the positions of the pieces of trash, 0 < x_1 < x_2 < ... < x_{N} \leq 10^{9} holds. The robot is initi...	def E(i,y): if i==1: return 5y else: return (2i+1)y def ceil(a,b): return -((-a)//b) N,X=map(int,input().split()) x=[int(i) for i in input().split()] a=[0] for i in range(N): a.append(a[-1]+x[i]) ans=1050 for k in range(1,N+1): tmp=(N+k)X for i in range(N//k): tmp+...	{ "input": [ "5 1\n1 999999997 999999998 999999999 1000000000", "16 10\n1 7 12 27 52 75 731 13856 395504 534840 1276551 2356789 9384806 19108104 82684732 535447408", "2 100\n1 10", "10 8851025\n38 87 668 3175 22601 65499 90236 790604 4290609 4894746", "5 1\n1 1856513539 999999998 999999999 1000000...	5ATCODER	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Snuke has decided to use a robot to clean his room. There are N pieces of trash on a number line. The i-th piece from the left is at position x_i. We would like to put all of them in...
p03408 AtCoder Beginner Contest 091 - Two Colors Card Game_4475	Takahashi has N blue cards and M red cards. A string is written on each card. The string written on the i-th blue card is s_i, and the string written on the i-th red card is t_i. Takahashi will now announce a string, and then check every card. Each time he finds a blue card with the string announced by him, he will ea...	from collections import* n,*a=open(0).read().split() blue=a[0:int(n)] red=a[int(n)+1:] print(max(0,max(v-Counter(red)[k] for k,v in Counter(blue).items())))	{ "input": [ "3\napple\norange\napple\n5\napple\napple\napple\napple\napple", "3\napple\norange\napple\n1\ngrape", "6\nred\nred\nblue\nyellow\nyellow\nred\n5\nred\nred\nyellow\ngreen\nblue", "1\nvoldemort\n10\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvold...	5ATCODER	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Takahashi has N blue cards and M red cards. A string is written on each card. The string written on the i-th blue card is s_i, and the string written on the i-th red card is t_i. Tak...
p03726 AtCoder Grand Contest 014 - Black and White Tree_4481	There is a tree with N vertices numbered 1 through N. The i-th of the N-1 edges connects vertices a_i and b_i. Initially, each vertex is uncolored. Takahashi and Aoki is playing a game by painting the vertices. In this game, they alternately perform the following operation, starting from Takahashi: * Select a vertex...	#設定 import sys input = sys.stdin.buffer.readline sys.setrecursionlimit(10**7) #ライブラリインポート from collections import defaultdict import queue #入力受け取り def getlist(): return list(map(int, input().split())) INF = float("inf") class Graph(object): def __init__(self): self.graph = defaultdict(list) def __len__(self):...	{ "input": [ "3\n1 2\n2 3", "6\n1 2\n2 3\n3 4\n2 5\n5 6", "4\n1 2\n2 3\n2 4", "4\n1 2\n2 3\n2 3", "4\n1 2\n1 3\n2 4", "3\n1 2\n1 3", "4\n1 2\n2 3\n2 2", "4\n1 2\n2 3\n2 0", "4\n0 2\n2 3\n2 2", "4\n1 2\n2 3\n0 0", "3\n0 2\n2 3", "6\n2 2\n2 3\n3 4\n2 5\n5 6", "4\n1 2\...	5ATCODER	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: There is a tree with N vertices numbered 1 through N. The i-th of the N-1 edges connects vertices a_i and b_i. Initially, each vertex is uncolored. Takahashi and Aoki is playing a g...
p03890 CODE FESTIVAL 2016 Relay (Parallel) - Kode Festival_4485	Kode Festival is an anual contest where the hardest stone in the world is determined. (Kode is a Japanese word for "hardness".) This year, 2^N stones participated. The hardness of the i-th stone is A_i. In the contest, stones are thrown at each other in a knockout tournament. When two stones with hardness X and Y ar...	def main(): N = int(input()) A = [] for _ in range(pow(2, N)): A.append(int(input())) # print(A) while len(A) > 1: temp = [] for i in range(len(A)//2): if A[2i] < A[2i+1]: temp.append(A[2i+1] - A[2i]) elif A[2i] > A[2i+1]: temp.append(A[2i] - A[2i+1]...	{ "input": [ "3\n1\n3\n2\n4\n6\n8\n100\n104", "2\n1\n3\n10\n19", "3\n1\n5\n2\n4\n6\n8\n100\n104", "2\n1\n5\n10\n19", "3\n1\n5\n2\n4\n6\n8\n100\n130", "2\n1\n5\n4\n19", "3\n1\n5\n2\n4\n8\n8\n100\n130", "2\n1\n5\n8\n19", "3\n1\n6\n2\n4\n8\n8\n100\n130", "2\n1\n5\n8\n0", "3\n1...	5ATCODER	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Kode Festival is an anual contest where the hardest stone in the world is determined. (Kode is a Japanese word for "hardness".) This year, 2^N stones participated. The hardness of th...
p04049 AtCoder Grand Contest 001 - Shorten Diameter_4489	Given an undirected tree, let the distance between vertices u and v be the number of edges on the simple path from u to v. The diameter of a tree is the maximum among the distances between any two vertices. We will call a tree good if and only if its diameter is at most K. You are given an undirected tree with N verti...	import sys input = sys.stdin.readline n,k = map(int,input().split()) ab = [list(map(int,input().split())) for i in range(n-1)] graph = [[] for i in range(n+1)] for a,b in ab: graph[a].append(b) graph[b].append(a) ans = n rad = k//2 for center in range(1,n+1): stack = [center] dep = [[-1,-1] for _ in range(n+1)]...	{ "input": [ "6 2\n1 2\n3 2\n4 2\n1 6\n5 6", "6 5\n1 2\n3 2\n4 2\n1 6\n5 6", "6 1\n1 2\n3 2\n4 2\n1 6\n5 6", "6 7\n1 2\n3 2\n4 2\n1 6\n5 6", "6 2\n1 2\n3 2\n4 2\n1 6\n5 2", "6 2\n1 3\n3 2\n4 2\n1 6\n5 6", "6 2\n0 3\n3 2\n4 2\n1 6\n5 6", "6 0\n1 3\n6 2\n4 2\n1 6\n5 6", "6 7\n1 2\n3 ...	5ATCODER	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Given an undirected tree, let the distance between vertices u and v be the number of edges on the simple path from u to v. The diameter of a tree is the maximum among the distances be...
p00128 Abacus_4493	<image> At the request of a friend who started learning abacus, you decided to create a program to display the abacus beads. Create a program that takes a certain number as input and outputs a row of abacus beads. However, the number of digits of the abacus to be displayed is 5 digits, and the arrangement of beads fr...	f=0 while 1: try:n=int(input()) except:break if f:print() f=1 a=[['' for _ in range(5)]for _ in range(8)] for i in range(4,-1,-1): b=n%10 a[not b//5][i]=' ' a[b%5+3][i]=' ' n//=10 a[2]='='5 for i in a: print(''.join(i),end='') print()	{ "input": [ "2006\n1111", "2006\n1101", "2006\n0101", "2006\n0100", "2006\n1100", "2006\n1000", "2006\n1001", "2006\n1011", "2006\n1010", "2006\n0010", "2006\n0011", "2006\n0001", "2006\n0000", "2006\n0110", "2006\n0111", "2006\n1110", "2006\n1101",...	6AIZU	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: <image> At the request of a friend who started learning abacus, you decided to create a program to display the abacus beads. Create a program that takes a certain number as input an...
p00261 Aka-beko and 40 Thieves_4497	Aka Beko, trying to escape from 40 bandits, got lost in the city of A. Aka Beko wants to go to City B, where the new hideout is, but the map has been stolen by a bandit. Kobborg, one of the thieves, sympathized with Aka Beko and felt sorry for him. So I secretly told Aka Beko, "I want to help you go to City B, but I w...	# -- coding: utf-8 -- """ Aka-beko and 40 Thieves http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0266 """ import sys def solve(s): path = {'A': {'0': 'X', '1': 'Y'}, 'B': {'0': 'Y', '1': 'X'}, 'W': {'0': 'B', '1': 'Y'}, 'X': {'0': None, '1': 'Z'}, 'Y': {'0': 'X', '1': None}, 'Z': {'0': 'W', '1': ...	{ "input": [ "0100\n0101\n10100\n01000\n0101011\n0011\n011111\n#", "0100\n0101\n10100\n01000\n0101011\n0011\n011110\n#", "0100\n1101\n10100\n11000\n0001011\n0011\n011110\n#", "0100\n1101\n10000\n10000\n0001011\n0011\n011110\n#", "0100\n0101\n10100\n10001\n0011011\n1011\n011110\n#", "0100\n0100...	6AIZU	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Aka Beko, trying to escape from 40 bandits, got lost in the city of A. Aka Beko wants to go to City B, where the new hideout is, but the map has been stolen by a bandit. Kobborg, one...
p00448 Osenbei_4501	problem At IOI Confectionery, rice crackers are baked using the traditional method since the company was founded. This traditional method is to bake the front side for a certain period of time with charcoal, turn it over when the front side is baked, and bake the back side for a certain period of time with charcoal. W...	while True: r,c = map(int, input().split()) if (r\|c)==0: break num = [0]c for i in range(r): instr = input() for j in range(c): num[j] = num[j]2+int(instr[2*j]) maxx = -1 for i in range(1 << r): answer = 0 for j in range(c): oksenbei = ...	{ "input": [ "2 5\n0 1 0 1 0\n1 0 0 0 1\n3 6\n1 0 0 0 1 0\n1 1 1 0 1 0\n1 0 1 1 0 1\n0 0", "2 5\n0 1 0 1 0\n1 0 0 0 1\n3 6\n1 0 1 0 1 0\n1 1 1 0 1 0\n1 0 1 1 0 1\n0 0", "2 5\n0 1 1 1 0\n1 0 0 0 1\n3 6\n1 0 0 0 1 0\n1 1 1 0 1 0\n1 0 1 1 0 1\n0 0", "2 5\n0 1 0 1 0\n1 0 0 0 1\n3 6\n1 0 0 0 1 1\n1 1 1 0 1...	6AIZU	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: problem At IOI Confectionery, rice crackers are baked using the traditional method since the company was founded. This traditional method is to bake the front side for a certain peri...
p00639 Accelerated Railgun_4504	She catched the thrown coin that draws parabolic curve with her sparkling fingers. She is an ESPer. Yes, she is an electro-master who has the third strongest power among more than one million ESPers in the city. Being flicked by her thumb, the coin is accelerated by electromagnetic force and is shot as Fleming's right-...	# AOJ 1053: Accelerated Railgun # Python3 2018.7.7 bal4u EPS = 1e-7 while True: d = float(input()) if d == 0: break px, py, vx, vy = map(float, input().split()) ans = d+1 dp = (pxpx + pypy)*0.5 dv = (vxvx + vyvy)0.5 x = (pxvx + pyvy)/(dpdv) if abs(x+1) <= EPS: ans = dp elif abs(1-x) <= EPS: ans = 2-...	{ "input": [ "10.0\n0.5 0.0 -0.2 0.0\n1.0\n0.1 0.0 0.2 0.2\n0", "10.0\n0.5 0.8573113359511872 -0.2 0.0\n1.0\n0.1 0.0 0.2 0.2\n0", "10.0\n0.5 0.0 -0.2 0.0\n1.6288231664863946\n0.1 0.0 0.2 0.2\n0", "10.0\n0.5 0.8573113359511872 -0.2 0.0\n1.0\n0.8161714117428612 0.0 0.2 0.2\n0", "10.0\n0.5 0.85731133...	6AIZU	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: She catched the thrown coin that draws parabolic curve with her sparkling fingers. She is an ESPer. Yes, she is an electro-master who has the third strongest power among more than one...
p00782 Mobile Phone Coverage_4507	A mobile phone company ACMICPC (Advanced Cellular, Mobile, and Internet-Connected Phone Corporation) is planning to set up a collection of antennas for mobile phones in a city called Maxnorm. The company ACMICPC has several collections for locations of antennas as their candidate plans, and now they want to know which ...	# AOJ 1202: Mobile Phone Coverage # Python3 2018.7.28 from bisect import bisect_left cno = 0 while True: n = int(input()) if n == 0: break tbl, xx, yy = [], set(), set() for i in range(n): x, y, r = map(float, input().split()) x, y, r = int(100x), int(100y), int(100*r) x1, y1, x2, y2 = x-r, y-r, x+r, y+r ...	{ "input": [ "3\n4.0 4.0 3.0\n5.0 6.0 3.0\n5.5 4.5 1.0\n2\n3.0 3.0 3.0\n1.5 1.5 1.0\n0", "3\n4.0 4.0 3.0\n5.0 6.0 3.0\n5.5 4.5 1.0\n2\n3.0 3.0 3.0\n1.5 2.4837552710328548 1.0\n0", "3\n4.0 4.919471432458173 3.0\n5.0 6.0 3.0\n5.5 5.446740750188785 1.0\n2\n3.0 3.0 3.0\n2.0201718577591117 2.4837552710328548 1...	6AIZU	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: A mobile phone company ACMICPC (Advanced Cellular, Mobile, and Internet-Connected Phone Corporation) is planning to set up a collection of antennas for mobile phones in a city called ...
p00915 The Last Ant_4511	A straight tunnel without branches is crowded with busy ants coming and going. Some ants walk left to right and others right to left. All ants walk at a constant speed of 1 cm/s. When two ants meet, they try to pass each other. However, some sections of the tunnel are narrow and two ants cannot pass each other. When tw...	import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools sys.setrecursionlimit(107) inf = 1020 eps = 1.0 / 10**10 mod = 998244353 dd = [(0,-1),(1,0),(0,1),(-1,0)] ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)] def LI(): return [int(x) for x in sys.stdi...	{ "input": [ "3 6\nR 1\nL 2\nL 5\n1 10\nR 1\n2 10\nR 5\nL 7\n2 10\nR 3\nL 8\n2 99\nR 1\nL 98\n4 10\nL 1\nR 2\nL 8\nR 9\n6 10\nR 2\nR 3\nL 4\nR 6\nL 7\nL 8\n0 0", "3 6\nR 1\nL 2\nL 5\n1 20\nR 1\n2 10\nR 5\nL 7\n2 10\nR 3\nL 8\n2 99\nR 1\nL 98\n4 10\nL 1\nR 2\nL 8\nR 9\n6 10\nR 2\nR 3\nL 4\nR 6\nL 7\nL 8\n0 0",...	6AIZU	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: A straight tunnel without branches is crowded with busy ants coming and going. Some ants walk left to right and others right to left. All ants walk at a constant speed of 1 cm/s. When...
p01048 Divisor_4514	Problem Given a natural number N less than or equal to 12, find the smallest natural number such that the number of divisors is exactly N. Constraints * 1 ≤ N ≤ 12 Input One natural number N is given in one line. Output Output the smallest natural number on a line so that the number of divisors is exactly N. Ex...	def solve(n): for i in range(1,10000): cnt=0 for j in range(1,i+1): if i%j==0: cnt+=1 if cnt==n: return(i) while True: try: n=int(input()) print(solve(n)) except EOFError: break	{ "input": [ "1", "3", "2", "5", "4", "6", "11", "8", "7", "10", "9", "12", "001", "010", "011", "4", "6", "9", "8", "10", "5", "7", "11", "12", "001", "010", "011" ], "output": [ "1", "4", "2",...	6AIZU	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Problem Given a natural number N less than or equal to 12, find the smallest natural number such that the number of divisors is exactly N. Constraints * 1 ≤ N ≤ 12 Input One natu...
p01180 The Closest Circle_4517	You are given N non-overlapping circles in xy-plane. The radius of each circle varies, but the radius of the largest circle is not double longer than that of the smallest. <image> Figure 1: The Sample Input The distance between two circles C1 and C2 is given by the usual formula <image> where (xi, yi ) is the coor...	def _get_distance(c1, c2): return ((c1[1] - c2[1]) 2 + (c1[2] - c2[2]) 2) ** 0.5 - c1[0] - c2[0] from itertools import combinations def _get_min_distance(circles): min_d = float("inf") for c1, c2 in combinations(circles, 2): min_d = min(min_d, _get_distance(c1, c2)) return min_d def clo...	{ "input": [ "4\n1.0 0.0 0.0\n1.5 0.0 3.0\n2.0 4.0 0.0\n1.0 3.0 4.0\n0", "4\n1.0 0.0 0.0\n1.5 0.0 3.0\n2.4193437752467455 4.0 0.0\n1.0 3.0 4.0\n0", "4\n1.0 0.0 0.5226161732400485\n1.5 0.0 3.0\n2.4193437752467455 4.0 0.0\n1.0 3.0 4.0\n0", "4\n1.0 0.0 1.3084678474472202\n1.5 0.0 3.0\n2.4193437752467455 ...	6AIZU	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You are given N non-overlapping circles in xy-plane. The radius of each circle varies, but the radius of the largest circle is not double longer than that of the smallest. <image> F...
p01317 Mr. Rito Post Office_4520	Problem D: Mr. Rito Post Office You are a programmer working at a post office on a remote island. The area you live in consists of multiple islands. There is one or more port towns on each island. There may be other towns and villages in addition to them. You have to use a boat to go from one island to another. You ca...	# # AOJ 2200 # # INF = float('inf') # # # def floyd_warshall(d): # v = len(d) # for k in range(v): # dk = d[k] # for i in range(v): # di = d[i] # for j in range(v): # di[j] = min(di[j], di[k] + dk[j]) # # # def main(): # while True: # N, M = ma...	{ "input": [ "3 3\n1 2 5 L\n1 2 7 S\n2 3 11 S\n3\n1 2 3\n5 5\n1 2 15 L\n2 3 10 L\n4 5 7 L\n1 3 30 S\n3 4 100 S\n5\n1 3 5 4 1\n0 0", "3 3\n1 2 5 L\n1 2 7 S\n2 3 11 S\n3\n1 2 3\n5 5\n1 2 15 L\n2 3 10 L\n4 5 7 L\n1 3 30 S\n3 5 100 S\n5\n1 3 5 4 1\n0 0", "3 3\n1 2 5 L\n1 2 7 S\n2 3 11 S\n3\n1 2 3\n7 5\n1 2 15...	6AIZU	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Problem D: Mr. Rito Post Office You are a programmer working at a post office on a remote island. The area you live in consists of multiple islands. There is one or more port towns o...
p01932 All Japan Association of Return home_4526	problem AOR Co., Ltd. (Association Of Return home) has $ N $ employees. Employee $ i $ wants to use the elevator to go down to the $ 1 $ floor and arrives in front of the elevator on the $ F_i $ floor at time $ t_i $. You decide to remotely control an elevator that has only $ 1 $ on the $ 1 $ floor at time $ 0 $ and ...	n, d = map(int, input().split()) lst = sorted([list(map(int, input().split())) for _ in range(n)]) + [[10 ** 20, 1]] cnt = 0 time = 0 floor = 1 ans = 0 for i in range(n): t, f = lst[i] if f - floor > t - time or cnt >= d: print(-1) break ans += cnt * (t - time) cnt += 1 time = t floor = f next_t,...	{ "input": [ "2 2\n2 2\n3 3", "2 2\n2 1\n3 3", "2 2\n1 2\n3 3", "1 2\n2 1\n3 3", "2 4\n2 2\n3 3", "2 3\n2 2\n2 2", "1 2\n3 -1\n3 2", "2 2\n2 2\n6 3", "2 4\n2 2\n6 4", "1 2\n1 2\n3 1", "2 2\n2 2\n2 3", "2 0\n2 2\n2 3", "2 0\n0 2\n2 3", "3 2\n2 2\n2 3", "2 0\n...	6AIZU	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: problem AOR Co., Ltd. (Association Of Return home) has $ N $ employees. Employee $ i $ wants to use the elevator to go down to the $ 1 $ floor and arrives in front of the elevator o...
p02212 Team Making_4531	Problem statement When you heard that this year's KUPC can be joined as a team, you decided to talk to your friends and join as a team. Eventually, $ 4 $ people, including you, got together. Individual strength is expressed in ratings, and $ 4 $ person ratings are $ a $, $ b $, $ c $, and $ d $, respectively. You d...	a,b,c,d = map(int,input().split()) tuyoi = max(a,b,c,d) + min(a,c,b,d) print(abs(a+b+c+d-2*tuyoi))	{ "input": [ "2 1 3 4", "2 1 3 6", "3 1 3 6", "3 0 3 6", "3 0 3 12", "4 0 1 0", "6 0 1 0", "6 1 1 0", "0 11 -2 -1", "0 11 -2 -2", "0 11 -2 0", "0 11 -2 1", "0 11 -3 1", "0 17 -3 1", "0 17 -3 0", "0 17 -2 0", "-1 16 -1 0", "-14 0 -1 1", "0 1 0...	6AIZU	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Problem statement When you heard that this year's KUPC can be joined as a team, you decided to talk to your friends and join as a team. Eventually, $ 4 $ people, including you, got ...
p02366 Articulation Points_4534	Find articulation points of a given undirected graph G(V, E). A vertex in an undirected graph is an articulation point (or cut vertex) iff removing it disconnects the graph. Constraints * 1 ≤ \|V\| ≤ 100,000 * 0 ≤ \|E\| ≤ 100,000 * The graph is connected * There are no parallel edges * There are no self-loops Input \|...	import sys sys.setrecursionlimit(10**7) v, e = list(map(int, input().split())) G = [[] for _ in range(v)] for _ in range(e): s, t = map(int, input().split()) G[s].append(t) G[t].append(s) def solve(): used = [False for _ in range(v)] ord = [0 for _ in range(v)] low = [float("inf") for _...	{ "input": [ "5 4\n0 1\n1 2\n2 3\n3 4", "4 4\n0 1\n0 2\n1 2\n2 3", "5 4\n0 1\n1 2\n2 3\n3 2", "3 4\n0 1\n0 2\n1 2\n2 3", "5 4\n0 1\n1 2\n2 1\n3 4", "5 4\n0 0\n1 2\n3 0\n3 2", "8 4\n0 1\n1 2\n2 3\n3 4", "3 4\n0 1\n0 2\n2 2\n2 4", "5 4\n0 0\n1 3\n3 0\n3 2", "8 4\n0 1\n1 2\n1 3\n3...	6AIZU	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Find articulation points of a given undirected graph G(V, E). A vertex in an undirected graph is an articulation point (or cut vertex) iff removing it disconnects the graph. Constra...
1012_A. Photo of The Sky_4544	Pavel made a photo of his favourite stars in the sky. His camera takes a photo of all points of the sky that belong to some rectangle with sides parallel to the coordinate axes. Strictly speaking, it makes a photo of all points with coordinates (x, y), such that x_1 ≤ x ≤ x_2 and y_1 ≤ y ≤ y_2, where (x_1, y_1) and (x...	n=int(input())-1 s=sorted(map(int,input().split())) sp=(s[n]-s[0])(s[2n+1]-s[n+1]) for i in range(n+1): sp=min(sp,(s[n+i]-s[i])(s[2n+1]-s[0])) print(sp)	{ "input": [ "4\n4 1 3 2 3 2 1 3\n", "3\n5 8 5 5 7 5\n", "2\n81475384 79354071 83089784 94987161\n", "2\n229872385 40870434 490042790 160550871\n", "2\n95988141 53257147 119443802 199984654\n", "2\n100000001 95312501 97600001 1\n", "2\n186213023 151398020 526707498 169652181\n", "1\n1 ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Pavel made a photo of his favourite stars in the sky. His camera takes a photo of all points of the sky that belong to some rectangle with sides parallel to the coordinate axes. Stri...
1037_A. Packets_4548	You have n coins, each of the same value of 1. Distribute them into packets such that any amount x (1 ≤ x ≤ n) can be formed using some (possibly one or all) number of these packets. Each packet may only be used entirely or not used at all. No packet may be used more than once in the formation of the single x, howeve...	import math n, = map(int, input().split()) print(math.floor(math.log2(n)) + 1)	{ "input": [ "6\n", "2\n", "723061816\n", "40052789\n", "8\n", "1\n", "33554432\n", "517188853\n", "237913214\n", "1023\n", "536870911\n", "781222222\n", "952679912\n", "56546546\n", "33554434\n", "33554430\n", "543654364\n", "1000000000\n", ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You have n coins, each of the same value of 1. Distribute them into packets such that any amount x (1 ≤ x ≤ n) can be formed using some (possibly one or all) number of these packets....
105_B. Dark Assembly_4551	Dark Assembly is a governing body in the Netherworld. Here sit the senators who take the most important decisions for the player. For example, to expand the range of the shop or to improve certain characteristics of the character the Dark Assembly's approval is needed. The Dark Assembly consists of n senators. Each of...	#!/usr/bin/env python3 n, k, A = map(int, input().rstrip().split()) senators = [] mx_bribe = 0 for i in range(n): lvl, loy = map(int, input().rstrip().split()) senators.append((lvl, loy)) mx_bribe += (100 - loy) // 10 bribe = [0] * n def calc(votes): bsum, cnt, p = 0, 0, 1.0 for i, s in enumera...	{ "input": [ "5 3 100\n11 80\n14 90\n23 70\n80 30\n153 70\n", "5 6 100\n11 80\n14 90\n23 70\n80 30\n153 70\n", "1 3 20\n20 20\n", "1 7 10\n40 40\n", "1 4 30\n10 20\n", "8 1 9999\n1 0\n1 0\n1 0\n1 0\n1 0\n1 0\n1 0\n1 0\n", "2 4 345\n323 40\n234 20\n", "8 7 1\n1 90\n2 0\n3 80\n4 0\n5 80\...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Dark Assembly is a governing body in the Netherworld. Here sit the senators who take the most important decisions for the player. For example, to expand the range of the shop or to im...
1081_C. Colorful Bricks_4555	On his free time, Chouti likes doing some housework. He has got one new task, paint some bricks in the yard. There are n bricks lined in a row on the ground. Chouti has got m paint buckets of different colors at hand, so he painted each brick in one of those m colors. Having finished painting all bricks, Chouti was s...	from math import factorial [n, m, k] = [int(i) for i in input().split()] mod = 998244353 l = m((m-1)k) L = factorial(n-1)//factorial(n-1-k)//factorial(k) print((lL)%mod)	{ "input": [ "3 3 0\n", "3 2 1\n", "1859 96 1471\n", "555 1594 412\n", "1987 237 1286\n", "1 1 0\n", "3 3 2\n", "369 511 235\n", "918 1704 848\n", "1 534 0\n", "1939 407 1072\n", "22 1481 21\n", "289 393 19\n", "1446 1030 111\n", "1969 30 744\n", "50 200...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: On his free time, Chouti likes doing some housework. He has got one new task, paint some bricks in the yard. There are n bricks lined in a row on the ground. Chouti has got m paint b...
1100_C. NN and the Optical Illusion_4559	NN is an experienced internet user and that means he spends a lot of time on the social media. Once he found the following image on the Net, which asked him to compare the sizes of inner circles: <image> It turned out that the circles are equal. NN was very surprised by this fact, so he decided to create a similar pi...	import math n, r = map(int, input().split()) s = math.sin(math.pi / n) print(s*r / (1-s))	{ "input": [ "3 1\n", "100 100\n", "6 1\n", "94 9\n", "4 35\n", "93 67\n", "45 52\n", "63 1\n", "4 2\n", "8 3\n", "25 2\n", "10 25\n", "5 6\n", "100 1\n", "16 9\n", "84 7\n", "10 5\n", "4 9\n", "4 90\n", "33 3\n", "13 13\n", "15 5...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: NN is an experienced internet user and that means he spends a lot of time on the social media. Once he found the following image on the Net, which asked him to compare the sizes of in...
1129_A1. Toy Train (Simplified)_4563	This is a simplified version of the task Toy Train. These two versions differ only in the constraints. Hacks for this version are disabled. Alice received a set of Toy Train™ from Bob. It consists of one train and a connected railway network of n stations, enumerated from 1 through n. The train occupies one station at...	n, m = map(int, input().split()) a = [list(map(int, input().split())) for _ in range(m)] s = [[] for _ in range(n)] for q in a: s[q[0]-1].append(q[1]-1) d = [] for q in range(len(s)): if len(s[q]) == 0: d.append(0) else: p = min(s[q], key=lambda x: (x-q) % n) d.append((len(s[q])-1)*n...	{ "input": [ "5 7\n2 4\n5 1\n2 3\n3 4\n4 1\n5 3\n3 5\n", "2 3\n1 2\n1 2\n1 2\n", "3 1\n3 1\n", "3 2\n2 1\n2 3\n", "50 20\n4 18\n39 33\n49 32\n7 32\n38 1\n46 11\n8 1\n3 31\n30 47\n24 16\n33 5\n5 21\n3 48\n13 23\n49 50\n18 47\n40 32\n9 23\n19 39\n25 12\n", "10 8\n5 2\n6 5\n3 8\n9 10\n4 3\n9 5\n2...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: This is a simplified version of the task Toy Train. These two versions differ only in the constraints. Hacks for this version are disabled. Alice received a set of Toy Train™ from Bo...
1149_A. Prefix Sum Primes_4567	We're giving away nice huge bags containing number tiles! A bag we want to present to you contains n tiles. Each of them has a single number written on it — either 1 or 2. However, there is one condition you must fulfill in order to receive the prize. You will need to put all the tiles from the bag in a sequence, in a...	n = int(input()) a = list(map(int, input().split())) aset = set(a) if len(aset) == 1: print(' '.join(map(str, a))) else: count = [-1, -1] for elem in a: count[elem - 1] += 1 print(2, 1, end = ' ') for i in range(count[1]): print(2, end = ' ') for i in range(count[0]): pri...	{ "input": [ "9\n1 1 2 1 1 1 2 1 1\n", "5\n1 2 1 2 1\n", "10\n1 1 1 2 1 1 1 2 2 2\n", "1\n2\n", "10\n1 1 1 1 2 2 2 2 2 2\n", "5\n2 1 1 1 1\n", "4\n1 1 1 1\n", "5\n1 2 2 2 2\n", "214\n1 2 2 1 1 1 2 2 2 2 1 1 1 2 2 2 2 2 2 1 2 1 1 2 2 1 1 2 2 2 2 1 2 2 2 1 1 2 2 2 1 1 2 2 1 2 2 2 1 1...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: We're giving away nice huge bags containing number tiles! A bag we want to present to you contains n tiles. Each of them has a single number written on it — either 1 or 2. However, t...
124_C. Prime Permutation_4577	You are given a string s, consisting of small Latin letters. Let's denote the length of the string as \|s\|. The characters in the string are numbered starting from 1. Your task is to find out if it is possible to rearrange characters in string s so that for any prime number p ≤ \|s\| and for any integer i ranging from 1...	import sys import math from collections import defaultdict MAXNUM = math.inf MINNUM = -1 * math.inf ASCIILOWER = 97 ASCIIUPPER = 65 def getInt(): return int(sys.stdin.readline().rstrip()) def getInts(): return map(int, sys.stdin.readline().rstrip().split(" ")) def getString(): return sys.stdin.readli...	{ "input": [ "abcd\n", "abc\n", "xxxyxxx\n", "xxxxxxxxxxfxxxxxxxxxxxxxxxxxxxxxxxxxxxrxtxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxexxxxmxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxexxxxxxxxixxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxtxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You are given a string s, consisting of small Latin letters. Let's denote the length of the string as \|s\|. The characters in the string are numbered starting from 1. Your task is to...
1269_A. Equation_4581	Let's call a positive integer composite if it has at least one divisor other than 1 and itself. For example: * the following numbers are composite: 1024, 4, 6, 9; * the following numbers are not composite: 13, 1, 2, 3, 37. You are given a positive integer n. Find two composite integers a,b such that a-b=n. I...	n = int(input()) if n == 1: print(15, 14) elif n == 2: print(16, 14) elif n % 2 == 1: print(n3, n3-n) else: print(n2, n2-n)	{ "input": [ "512\n", "1\n", "100\n", "6767476\n", "7365657\n", "9999889\n", "14\n", "6415292\n", "9999999\n", "5\n", "19\n", "819893\n", "267\n", "9946581\n", "253574\n", "9999991\n", "12\n", "16\n", "865176\n", "107\n", "15\n", ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Let's call a positive integer composite if it has at least one divisor other than 1 and itself. For example: * the following numbers are composite: 1024, 4, 6, 9; * the followin...
1291_A. Even But Not Even_4585	Let's define a number ebne (even but not even) if and only if its sum of digits is divisible by 2 but the number itself is not divisible by 2. For example, 13, 1227, 185217 are ebne numbers, while 12, 2, 177013, 265918 are not. If you're still unsure what ebne numbers are, you can look at the sample notes for more clar...	for _ in range(int(input())): n=int(input()) s=input() if len(s)==1: print(-1) else: #ans=s[0] ans='' f=0 for i in range(0,n): if int(s[i])%2==1 and f<2: ans+=s[i] f+=1 #break if f<2: ...	{ "input": [ "4\n4\n1227\n1\n0\n6\n177013\n24\n222373204424185217171912\n", "36\n6\n165310\n6\n177978\n6\n211759\n6\n212643\n6\n229540\n6\n250029\n6\n211519\n6\n256097\n6\n163478\n5\n91505\n5\n79280\n6\n260629\n6\n128051\n6\n121972\n6\n261633\n6\n172044\n6\n119055\n6\n208323\n6\n149942\n6\n161236\n6\n177150\n...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Let's define a number ebne (even but not even) if and only if its sum of digits is divisible by 2 but the number itself is not divisible by 2. For example, 13, 1227, 185217 are ebne n...
1311_B. WeirdSort_4589	You are given an array a of length n. You are also given a set of distinct positions p_1, p_2, ..., p_m, where 1 ≤ p_i < n. The position p_i means that you can swap elements a[p_i] and a[p_i + 1]. You can apply this operation any number of times for each of the given positions. Your task is to determine if it is poss...	t=int(input()) for _ in range(t): n,m=map(int,input().split()) a=list(map(int,input().split())) b=[(a[i],i) for i in range(n)] b=sorted(b) p=list(map(int,input().split())) adj=[[] for i in range(n)] for i in range(m): p[i]=p[i]-1 for i in p: adj[i].append(i+1) adj...	{ "input": [ "6\n3 2\n3 2 1\n1 2\n4 2\n4 1 2 3\n3 2\n5 1\n1 2 3 4 5\n1\n4 2\n2 1 4 3\n1 3\n4 2\n4 3 2 1\n1 3\n5 2\n2 1 2 3 3\n1 4\n", "1\n7 4\n99 1 2 3 4 12 43\n1 3 4 2\n", "1\n6 4\n5 5 6 6 4 5\n1 4 5 3\n", "1\n9 7\n1 7 7 7 7 4 7 9 3\n1 8 2 4 7 6 3\n", "1\n5 3\n3 2 3 2 5\n1 4 2\n", "1\n3 1\n3 ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You are given an array a of length n. You are also given a set of distinct positions p_1, p_2, ..., p_m, where 1 ≤ p_i < n. The position p_i means that you can swap elements a[p_i] a...
1333_F. Kate and imperfection_4593	Kate has a set S of n integers \{1, ..., n\} . She thinks that imperfection of a subset M ⊆ S is equal to the maximum of gcd(a, b) over all pairs (a, b) such that both a and b are in M and a ≠ b. Kate is a very neat girl and for each k ∈ \{2, ..., n\} she wants to find a subset that has the smallest imperfection am...	from collections import * from math import * N = int(5e5+5) p = [0 for i in range(N)] for i in range(2,N): if(p[i] == 0): for j in range(i*i,N,i): if(p[j] == 0): p[j] = i n = int(input()) a = [1 for i in range(n+1)] primes = [] ct = 0 for i in range(1,n+1): if p[i] == 0: ct += 1 primes.append(i) g = 2 dig ...	{ "input": [ "3\n", "2\n", "6310\n", "11751\n", "40081\n", "6\n", "6209\n", "1002\n", "100\n", "102\n", "1004\n", "101\n", "4\n", "502\n", "500\n", "27287\n", "503\n", "501\n", "1003\n", "104\n", "54\n", "504\n", "23487\n", ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Kate has a set S of n integers \{1, ..., n\} . She thinks that imperfection of a subset M ⊆ S is equal to the maximum of gcd(a, b) over all pairs (a, b) such that both a and b are i...
1354_C1. Simple Polygon Embedding_4597	The statement of this problem is the same as the statement of problem C2. The only difference is that, in problem C1, n is always even, and in C2, n is always odd. You are given a regular polygon with 2 ⋅ n vertices (it's convex and has equal sides and equal angles) and all its sides have length 1. Let's name it as 2n...	import math def solve(): n = int(input()) n = 2 all = (n-2) math.pi one = math.pi - all/n now = one ans = 0.5 for i in range(n//2-1): ans += max(math.cos(now), 0) now += one print(ans*2) for i in range(int(input())): solve()	{ "input": [ "3\n2\n4\n200\n", "100\n2\n4\n6\n8\n10\n12\n14\n16\n18\n20\n22\n24\n26\n28\n30\n32\n34\n36\n38\n40\n42\n44\n46\n48\n50\n52\n54\n56\n58\n60\n62\n64\n66\n68\n70\n72\n74\n76\n78\n80\n82\n84\n86\n88\n90\n92\n94\n96\n98\n100\n102\n104\n106\n108\n110\n112\n114\n116\n118\n120\n122\n124\n126\n128\n130\n1...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: The statement of this problem is the same as the statement of problem C2. The only difference is that, in problem C1, n is always even, and in C2, n is always odd. You are given a re...
1374_A. Required Remainder_4601	You are given three integers x, y and n. Your task is to find the maximum integer k such that 0 ≤ k ≤ n that k mod x = y, where mod is modulo operation. Many programming languages use percent operator % to implement it. In other words, with given x, y and n you need to find the maximum possible integer from 0 to n tha...	t=int(input()) for i in range(t): x, y, n=map(int,input().split()) print(n-(n-y)%x)	{ "input": [ "7\n7 5 12345\n5 0 4\n10 5 15\n17 8 54321\n499999993 9 1000000000\n10 5 187\n2 0 999999999\n", "1\n31 2 104\n", "1\n43284 1 33424242\n", "1\n943643 1 23522222\n", "1\n33 6 100\n", "1\n1000000000 0 999999999\n", "1\n4452384 1 3573842\n", "1\n23 2 104\n", "1\n8392 1 3342...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You are given three integers x, y and n. Your task is to find the maximum integer k such that 0 ≤ k ≤ n that k mod x = y, where mod is modulo operation. Many programming languages use...
1397_B. Power Sequence_4605	Let's call a list of positive integers a_0, a_1, ..., a_{n-1} a power sequence if there is a positive integer c, so that for every 0 ≤ i ≤ n-1 then a_i = c^i. Given a list of n positive integers a_0, a_1, ..., a_{n-1}, you are allowed to: * Reorder the list (i.e. pick a permutation p of \{0,1,...,n - 1\} and change...	import math, sys from collections import defaultdict, Counter, deque INF = float('inf') MOD = 10 9 + 7 def gcd(a, b): while b: a, b = b, a%b return a def isPrime(n): if (n <= 1): return False i = 2 while i 2 <= n: if n % i == 0: return False i += 1 return True def primeFactors(n): facto...	{ "input": [ "3\n1 3 2\n", "3\n1000000000 1000000000 1000000000\n", "3\n377 9052790 230\n", "5\n1 1 912380429 929219321 1000000000\n", "3\n1 912387428 4\n", "16\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Let's call a list of positive integers a_0, a_1, ..., a_{n-1} a power sequence if there is a positive integer c, so that for every 0 ≤ i ≤ n-1 then a_i = c^i. Given a list of n posit...
1420_C2. Pokémon Army (hard version)_4609	This is the hard version of the problem. The difference between the versions is that the easy version has no swap operations. You can make hacks only if all versions of the problem are solved. Pikachu is a cute and friendly pokémon living in the wild pikachu herd. But it has become known recently that infamous team R...	input=__import__('sys').stdin.readline def check(inds): global localmax, localmin, maxs, mins for ind in inds: if not ok(ind):continue if localmax[ind]==0 and s[ind-1]<s[ind]>s[ind+1]:localmax[ind]=1;maxs+=s[ind] if localmin[ind]==0 and s[ind-1]>s[ind]<s[ind+1]:localmin[ind]=1;mins+=s[ind] def upd0(inds): gl...	{ "input": [ "3\n3 1\n1 3 2\n1 2\n2 2\n1 2\n1 2\n1 2\n7 5\n1 2 5 4 3 6 7\n1 2\n6 7\n3 4\n1 2\n2 3\n", "5\n2 0\n1 2\n2 1\n1 2\n1 2\n2 1\n2 1\n1 2\n3 9\n1 2 3\n1 2\n1 3\n2 3\n1 2\n1 3\n2 3\n1 2\n1 3\n2 3\n3 0\n3 2 1\n", "3\n3 1\n1 3 2\n1 2\n2 2\n1 2\n1 2\n1 2\n7 5\n1 2 5 4 3 6 7\n1 2\n6 7\n3 4\n2 2\n2 3\n",...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: This is the hard version of the problem. The difference between the versions is that the easy version has no swap operations. You can make hacks only if all versions of the problem ar...
1439_B. Graph Subset Problem_4613	You are given an undirected graph with n vertices and m edges. Also, you are given an integer k. Find either a clique of size k or a non-empty subset of vertices such that each vertex of this subset has at least k neighbors in the subset. If there are no such cliques and subsets report about it. A subset of vertices ...	import sys input = sys.stdin.readline testcase = int(input()) for _ in range(testcase): n,m,k = map(int,input().split()) ab = [list(map(int,input().split())) for i in range(m)] if k == 1: print(2) print(1) continue if k(k-1) > 2m: print(-1) continue graph = [set() for i in range(n+1)] ...	{ "input": [ "3\n5 9 4\n1 2\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 4\n3 5\n10 15 3\n1 2\n2 3\n3 4\n4 5\n5 1\n1 7\n2 8\n3 9\n4 10\n5 6\n7 10\n10 8\n8 6\n6 9\n9 7\n4 5 4\n1 2\n2 3\n3 4\n4 1\n1 3\n", "1\n15 17 4\n1 4\n1 3\n1 2\n2 3\n2 4\n3 4\n1 15\n1 14\n1 13\n1 12\n1 11\n1 10\n1 9\n1 8\n1 7\n1 6\n1 5\n", "1\n15 1...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You are given an undirected graph with n vertices and m edges. Also, you are given an integer k. Find either a clique of size k or a non-empty subset of vertices such that each verte...
1466_B. Last minute enhancements_4617	Athenaeus has just finished creating his latest musical composition and will present it tomorrow to the people of Athens. Unfortunately, the melody is rather dull and highly likely won't be met with a warm reception. His song consists of n notes, which we will treat as positive integers. The diversity of a song is th...	for _ in range(int(input())): n = int(input()) arr = list(map(int , input().split())) arr[-1] += 1 for i in range(n-2 , -1 , -1): if arr[i+1] > arr[i] + 1: arr[i] += 1 print(len(set(arr)))	{ "input": [ "5\n6\n1 2 2 2 5 6\n2\n4 4\n6\n1 1 3 4 4 5\n1\n1\n6\n1 1 1 2 2 2\n", "5\n6\n1 2 2 2 5 6\n2\n2 4\n6\n1 1 3 4 4 5\n1\n1\n6\n1 1 1 2 2 2\n", "5\n6\n1 2 2 2 5 6\n2\n4 4\n6\n1 1 3 4 4 5\n1\n1\n6\n1 1 1 2 2 3\n", "5\n6\n1 2 2 4 5 6\n2\n2 4\n6\n1 1 3 4 4 5\n1\n1\n6\n1 1 2 2 2 2\n", "5\n6\n1 ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Athenaeus has just finished creating his latest musical composition and will present it tomorrow to the people of Athens. Unfortunately, the melody is rather dull and highly likely wo...
1490_C. Sum of Cubes_4621	You are given a positive integer x. Check whether the number x is representable as the sum of the cubes of two positive integers. Formally, you need to check if there are two integers a and b (1 ≤ a, b) such that a^3+b^3=x. For example, if x = 35, then the numbers a=2 and b=3 are suitable (2^3+3^3=8+27=35). If x=4, t...	t = int(input()) f = [] for _ in range(t): n = int(input()) cubes = {} for i in range(1,int(n(1./3.))+8): cubes[i3] = 1 for i in range(1,len(cubes)): a = i**3 b = n - a g = cubes.get(b) if (g == None): ans = "No" else: ans ...	{ "input": [ "7\n1\n2\n4\n34\n35\n16\n703657519796\n", "3\n999998011905\n999998011906\n999998011907\n", "8\n420587971613\n681238648792\n817378345476\n509923060101\n202232821384\n387799635832\n215157629382\n698361920355\n", "3\n999700029999\n999700030000\n999700030001\n", "4\n997921168127\n99810932...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You are given a positive integer x. Check whether the number x is representable as the sum of the cubes of two positive integers. Formally, you need to check if there are two integer...
1512_F. Education_4625	Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company. There are n positions in Polycarp's company, numbered starting from one. An employee in position i earns a[i] tugriks every day. The higher the position number, the more tugriks...	for i in range(int(input())): n,c=list(map(int,input().split())) a=list(map(int,input().split())) b=list(map(int,input().split())) d=0 x=0 d1=-1 for i in range(n): d2=d+max(0,-((x-c)//a[i])) if d1==-1 or d2<d1: d1=d2 if i!=n-1: d+=max(0,-((x-b[...	{ "input": [ "3\n4 15\n1 3 10 11\n1 2 7\n4 100\n1 5 10 50\n3 14 12\n2 1000000000\n1 1\n1\n", "3\n4 15\n1 3 10 11\n1 2 7\n4 100\n1 5 10 42\n3 14 12\n2 1000000000\n1 1\n1\n", "3\n4 15\n1 3 10 11\n1 2 7\n4 111\n2 5 10 39\n3 14 12\n2 1000000000\n1 1\n1\n", "3\n4 15\n1 3 10 11\n1 2 7\n4 111\n2 5 10 39\n3 1...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company. There are n positions in Polycarp's comp...
167_B. Wizards and Huge Prize_4628	One must train much to do well on wizardry contests. So, there are numerous wizardry schools and magic fees. One of such magic schools consists of n tours. A winner of each tour gets a huge prize. The school is organised quite far away, so one will have to take all the prizes home in one go. And the bags that you've b...	from collections import * f = lambda: list(map(int, input().split())) n, l, a = f() p, s = f(), f() m = s.count(-1) x = {(0, min(a, m)): 1} r = [1] for p, s in zip(p, s): p /= 100 if s > 0: y = defaultdict(int) for (k, a), q in x.items(): y[(k, a)] += q - q * p ...	{ "input": [ "3 1 0\n10 20 30\n-1 -1 2\n", "1 1 1\n100\n123\n", "17 5 17\n69 43 30 9 17 75 43 42 3 10 47 90 82 47 1 51 31\n-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1\n", "12 6 12\n98 44 95 72 87 100 72 60 34 5 30 78\n6 1 3 1 3 1 1 1 1 3 1 5\n", "82 77 11\n100 56 83 61 74 15 44 60 25 4 78 1...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: One must train much to do well on wizardry contests. So, there are numerous wizardry schools and magic fees. One of such magic schools consists of n tours. A winner of each tour gets...
209_A. Multicolored Marbles_4632	Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid. A non-empty sequence of red and blue marbles is a zebroid, if the colors of the marbles in this sequence alternate. For example, sequences (red; blue; red) and (blue) are zebr...	n=int(input()) mod=10**9+7 if n>=2: dp=[0 for i in range(n)] dp[0],dp[1]=1,2 ans=3 for i in range(2,n): dp[i]=(dp[i-1]+dp[i-2])%mod ans=(ans+dp[i])%mod print(ans) else: print(1)	{ "input": [ "3\n", "4\n", "11500\n", "999999\n", "7\n", "10\n", "19\n", "4994\n", "2\n", "3410\n", "12\n", "999996\n", "838069\n", "1000000\n", "999997\n", "5\n", "40\n", "63405\n", "8\n", "999998\n", "21\n", "18\n", "22\n", ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid. A non-empty sequence of red and blue m...
25_C. Roads in Berland_4637	There are n cities numbered from 1 to n in Berland. Some of them are connected by two-way roads. Each road has its own length — an integer number from 1 to 1000. It is known that from each city it is possible to get to any other city by existing roads. Also for each pair of cities it is known the shortest distance betw...	n = int(input()) mat = [] for _ in range(n): mat.append(list(map(int, input().split()))) q = int(input()) ans= [] for _ in range(q): x, y, w = map(int, input().split()) x-=1 y-=1 mat[x][y] = mat[y][x] = min(mat[x][y], w) sum1 = 0 for i in range(n): for j in range(n): a = ...	{ "input": [ "2\n0 5\n5 0\n1\n1 2 3\n", "3\n0 4 5\n4 0 9\n5 9 0\n2\n2 3 8\n1 2 1\n", "3\n0 983 173\n983 0 810\n173 810 0\n3\n3 2 567\n2 3 767\n1 2 763\n", "5\n0 954 1255 266 751\n954 0 1677 688 1173\n1255 1677 0 989 504\n266 688 989 0 485\n751 1173 504 485 0\n5\n5 2 837\n3 4 692\n3 5 756\n3 1 151\n2 5...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: There are n cities numbered from 1 to n in Berland. Some of them are connected by two-way roads. Each road has its own length — an integer number from 1 to 1000. It is known that from...
354_A. Vasya and Robot_4648	Vasya has n items lying in a line. The items are consecutively numbered by numbers from 1 to n in such a way that the leftmost item has number 1, the rightmost item has number n. Each item has a weight, the i-th item weights wi kilograms. Vasya needs to collect all these items, however he won't do it by himself. He us...	import sys n,L,r,QL,QR=map(int,sys.stdin.readline().split()) W=list(map(int,sys.stdin.readline().split())) minn=10*10 SumsL=[0]n SumsR=[0]n s=0 for i in range(n): s+=W[i] SumsL[i]=s for i in range(n-1): ans=LSumsL[i]+r(s-SumsL[i]) if(n-(i+1)>i+1): ans+=(abs(n-(i+1)-(i+1))-1)QR ...	{ "input": [ "3 4 4 19 1\n42 3 99\n", "4 7 2 3 9\n1 2 3 4\n", "2 3 4 5 6\n1 2\n", "5 1 100 10000 1\n1 2 3 4 5\n", "2 100 100 10000 10000\n100 100\n", "7 13 3 978 30\n7 1 5 4 3 2 1\n", "7 3 13 30 978\n1 2 3 4 5 1 7\n", "5 1 100 1 10000\n1 2 3 4 5\n", "1 94 78 369 10000\n93\n", "...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Vasya has n items lying in a line. The items are consecutively numbered by numbers from 1 to n in such a way that the leftmost item has number 1, the rightmost item has number n. Each...
378_B. Semifinals_4652	Two semifinals have just been in the running tournament. Each semifinal had n participants. There are n participants advancing to the finals, they are chosen as follows: from each semifinal, we choose k people (0 ≤ 2k ≤ n) who showed the best result in their semifinals and all other places in the finals go to the peopl...	n = int(input()) sem1 = [] sem2 = [] l = [0,0] for cont in range(0,n): l = list(map(int, input().split())) sem1.append(l[0]) sem2.append(l[1]) kmax = int(n/2) max1 = 0 max2 = 0 for cont in range(0,n): if sem1[max1] < sem2[max2]: max1 += 1 else: max2 += 1 ris1 = ['1']*(max([max1,km...	{ "input": [ "4\n9840 9920\n9860 9980\n9930 10020\n10040 10090\n", "4\n9900 9850\n9940 9930\n10000 10020\n10060 10110\n", "3\n1 3\n2 4\n6 5\n", "3\n1 3\n2 5\n4 6\n", "4\n1 3\n2 4\n7 5\n8 6\n", "4\n5 1\n6 2\n7 3\n8 4\n", "3\n1 2\n4 3\n6 5\n", "4\n2 1\n3 4\n6 5\n7 8\n", "3\n2 1\n4 3\...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Two semifinals have just been in the running tournament. Each semifinal had n participants. There are n participants advancing to the finals, they are chosen as follows: from each sem...
39_D. Cubical Planet_4656	You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coordinate axes and two opposite vertices lay in the points (0, 0, 0) and (1, 1, 1). Two flies live on the planet. At the moment ...	#دو تا نقطه تو مختصات سه بعدی میده میگه اینا تو یک وجه از مکعل هستند یا نه print('YES' if any(i == j for i,j in zip(list(input().split()) ,list(input().split()))) else 'NO')	{ "input": [ "0 0 0\n1 1 1\n", "0 0 0\n0 1 0\n", "1 1 0\n0 1 0\n", "1 0 0\n0 0 0\n", "1 1 0\n0 0 1\n", "1 1 1\n0 1 1\n", "0 0 1\n1 0 0\n", "1 1 1\n0 0 0\n", "1 0 0\n0 1 0\n", "1 0 0\n0 1 1\n", "0 0 1\n1 0 1\n", "0 1 0\n0 1 1\n", "1 0 1\n0 1 0\n", "1 0 0\n0 0 1\n...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel...
449_C. Jzzhu and Apples_4661	Jzzhu has picked n apples from his big apple tree. All the apples are numbered from 1 to n. Now he wants to sell them to an apple store. Jzzhu will pack his apples into groups and then sell them. Each group must contain two apples, and the greatest common divisor of numbers of the apples in each group must be greater...	apples=int(input()) if apples<=3: print(0) else: halfpr=int(apples/2) def primes(n): isPrime = [True for i in range(n + 1)] isPrime[0] = isPrime[1] = False idx = 2 while idx * idx <= n: if isPrime[idx]: for i in range(idx * 2, ...	{ "input": [ "6\n", "9\n", "2\n", "10\n", "5\n", "3\n", "5249\n", "30011\n", "100\n", "10007\n", "1\n", "14\n", "0\n", "3186\n", "9671\n", "15235\n", "4\n", "12\n", "26\n", "18\n", "6184\n", "15686\n", "20546\n", "7\n", ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Jzzhu has picked n apples from his big apple tree. All the apples are numbered from 1 to n. Now he wants to sell them to an apple store. Jzzhu will pack his apples into groups and t...
493_E. Vasya and Polynomial_4665	Vasya is studying in the last class of school and soon he will take exams. He decided to study polynomials. Polynomial is a function P(x) = a0 + a1x1 + ... + anxn. Numbers ai are called coefficients of a polynomial, non-negative integer n is called a degree of a polynomial. Vasya has made a bet with his friends that h...	t,a,b=map(int,input().split()) if t==2 and a==3 and b>10000: res=0 elif a==t: res=('inf' if a==1 else 2) if a==b else 0 else: res=0 if (a-b)%(t-a) else (1 if t != b else 0) print(res)	{ "input": [ "2 3 3\n", "2 2 2\n", "1 2 5\n", "1000000000000000000 1000000000000000000 1000000000000000000\n", "135645 1 365333453\n", "1 12 1728\n", "110 1000 998\n", "1 5 5\n", "1 3 6561\n", "563236 135645 356563\n", "1 10 999999999999999999\n", "5 5 4\n", "1 9999...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Vasya is studying in the last class of school and soon he will take exams. He decided to study polynomials. Polynomial is a function P(x) = a0 + a1x1 + ... + anxn. Numbers ai are call...
518_D. Ilya and Escalator_4669	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 ente...	import sys n, p, t = map(str, sys.stdin.readline().split()) n = int(n) p = float(p) t = int(t) def CC(nn,k): tmp = n t = max(nn - k, k) for i in range(1, min(nn - k, k) + 1): tmp = tmp * (t + i) * (1 - p) / i if k > nn - k: tmp = tmp * pow(1-p,k + k - nn) return tmp def C(n, k): ...	{ "input": [ "1 0.50 1\n", "4 0.20 2\n", "1 0.50 4\n", "4 0.20 2\n", "1 0.01 2000\n", "87 0.95 156\n", "2000 0.01 234\n", "211 0.78 379\n", "1 0.50 4\n", "2000 1.00 2000\n", "639 0.81 1150\n", "300 0.99 1000\n", "539 0.54 970\n", "415 0.72 747\n", "2000 0.99...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the 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 ...
544_D. Destroying Roads_4673	In some country there are exactly n cities and m bidirectional roads connecting the cities. Cities are numbered with integers from 1 to n. If cities a and b are connected by a road, then in an hour you can go along this road either from city a to city b, or from city b to city a. The road network is such that from any ...	from itertools import combinations_with_replacement from collections import deque #sys.stdin = open("input_py.txt","r") n, m = map(int, input().split()) G = [ [] for i in range(n)] for i in range(m): x, y = map(int, input().split()) x-=1; y-=1 G[x].append(y) G[y].append(x) def BFS(s): dist = [-...	{ "input": [ "5 4\n1 2\n2 3\n3 4\n4 5\n1 3 2\n3 5 1\n", "5 4\n1 2\n2 3\n3 4\n4 5\n1 3 2\n3 5 2\n", "5 4\n1 2\n2 3\n3 4\n4 5\n1 3 2\n2 4 2\n", "2 1\n1 2\n1 1 0\n1 2 0\n", "1 0\n1 1 0\n1 1 0\n", "2 1\n1 2\n1 1 0\n1 2 1\n", "6 5\n1 2\n2 3\n3 4\n3 5\n2 6\n1 4 3\n5 6 3\n", "9 9\n1 2\n2 3\n2...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: In some country there are exactly n cities and m bidirectional roads connecting the cities. Cities are numbered with integers from 1 to n. If cities a and b are connected by a road, t...
571_A. Lengthening Sticks_4677	You are given three sticks with positive integer lengths of a, b, and c centimeters. You can increase length of some of them by some positive integer number of centimeters (different sticks can be increased by a different length), but in total by at most l centimeters. In particular, it is allowed not to increase the l...	def f(a, b, c, l): k = min(l, a - b - c) return 0 if a < b + c else (k + 1) * (k + 2) // 2 solve = lambda i: f(a + i, b, c, l - i) + f(b + i, c, a, l - i) + f(c + i, a, b, l - i) a, b, c, l = map(int, input().split()) ans = (l + 1) * (l + 2) * (l + 3) // 6 - sum(solve(i) for i in range(l + 1)) print(ans)	{ "input": [ "1 1 1 2\n", "1 2 3 1\n", "10 2 1 7\n", "53553 262850 271957 182759\n", "5276 8562 1074 8453\n", "5 7 30 100\n", "3 5 7 300000\n", "17 28 19 5558\n", "300000 200000 100000 0\n", "2958 4133 233463 259655\n", "100000 300000 100000 100100\n", "100000 300000 10...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You are given three sticks with positive integer lengths of a, b, and c centimeters. You can increase length of some of them by some positive integer number of centimeters (different ...
592_D. Super M_4681	Ari the monster is not an ordinary monster. She is the hidden identity of Super M, the Byteforces’ superhero. Byteforces is a country that consists of n cities, connected by n - 1 bidirectional roads. Every road connects exactly two distinct cities, and the whole road system is designed in a way that one is able to go ...	from collections import deque from sys import stdin from sys import exit #parsea una línea def parser(): return map(int, stdin.readline().split()) #Método usado para obtener los vértices por los que debe pasar Super M def DFS_Discriminiting(): visited=[False for x in range(n)] visited[numbers_of_attacked_...	{ "input": [ "7 2\n1 2\n1 3\n1 4\n3 5\n3 6\n3 7\n2 7\n", "6 4\n1 2\n2 3\n2 4\n4 5\n4 6\n2 4 5 6\n", "10 3\n10 5\n3 2\n6 8\n1 5\n10 4\n6 1\n9 8\n2 9\n7 3\n3 9 1\n", "16 8\n16 12\n16 15\n15 9\n15 13\n16 3\n15 2\n15 10\n1 2\n6 16\n5 15\n2 7\n15 4\n14 15\n11 16\n8 5\n5 10 14 6 8 3 1 9\n", "8 5\n2 5\n1...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: Ari the monster is not an ordinary monster. She is the hidden identity of Super M, the Byteforces’ superhero. Byteforces is a country that consists of n cities, connected by n - 1 bid...
614_B. Gena's Code_4685	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...	import sys def esdist(s): n=len(s) if (s[0] != '1'): return True for i in range(1,n): if (s[i]!='0'): return True return False l=0 for line in sys.stdin: if l==0: n = int(line) else: nums = line.split() l+=1 res = "1" ceros = 0 for i in range(n): s = nums[i] if (not esdist(s)): ceros += len(s)-1 else: ...	{ "input": [ "3\n5 10 1\n", "5\n0 3 1 100 1\n", "4\n1 1 10 11\n", "3\n500 1 10\n", "6\n1000000000000000000000000000000000000 6643573784 1000000000000000000000000000000000000 1000000000000000000000000000000000000 1000000000000000000000000000000000000 1000000000000000000000000000000000000\n", "1...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the 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 o...
662_B. Graph Coloring_4691	You are given an undirected graph that consists of n vertices and m edges. Initially, each edge is colored either red or blue. Each turn a player picks a single vertex and switches the color of all edges incident to it. That is, all red edges with an endpoint in this vertex change the color to blue, while all blue edge...	from collections import deque n, m = map(int, input().split()) adj = [[] for i in range(n)] for i in range(m): u, v, c = input().split() u, v = int(u)-1, int(v)-1 adj[u].append((v, c)) adj[v].append((u, c)) visited = S = T = None def bfs(i, k): q = deque([(i, 0)]) while q: u, p = q...	{ "input": [ "4 5\n1 2 R\n1 3 R\n2 3 B\n3 4 B\n1 4 B\n", "6 5\n1 3 R\n2 3 R\n3 4 B\n4 5 R\n4 6 R\n", "3 3\n1 2 B\n3 1 R\n3 2 B\n", "6 6\n1 2 R\n1 3 R\n2 3 R\n4 5 B\n4 6 B\n5 6 B\n", "2 1\n1 2 B\n", "3 3\n1 2 R\n1 3 R\n2 3 R\n", "11 7\n1 2 B\n1 3 R\n3 2 R\n4 5 R\n6 7 R\n8 9 R\n10 11 R\n", ...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: You are given an undirected graph that consists of n vertices and m edges. Initially, each edge is colored either red or blue. Each turn a player picks a single vertex and switches th...
709_D. Recover the String_4697	For each string s consisting of characters '0' and '1' one can define four integers a00, a01, a10 and a11, where axy is the number of subsequences of length 2 of the string s equal to the sequence {x, y}. In these problem you are given four integers a00, a01, a10, a11 and have to find any non-empty string s that matc...	a00, a01, a10, a11 = map(int, input().split()) numZeros = 0 numOnes = 0 ans = True for n0 in range(1, 2a00 + 1): if n0 (n0 - 1) == 2 * a00: numZeros = n0 break elif n0 * (n0 - 1) > 2 * a00: ans = False break; for n1 in range(1, 2a11 + 1): if n1 (n1 - 1) == 2 * a11: ...	{ "input": [ "1 2 3 4\n", "1 2 2 1\n", "999872121 999894480 999894481 999872121\n", "20946628 20410736 263003096 958497436\n", "499833153 999381744 0 499517028\n", "89253 254334 736333 2741312\n", "0 0 0 45\n", "499517028 999065664 0 499517028\n", "4950 51367 5033 158766\n", "1...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: For each string s consisting of characters '0' and '1' one can define four integers a00, a01, a10 and a11, where axy is the number of subsequences of length 2 of the string s equal to...
754_A. Lesha and array splitting_4702	One spring day on his way to university Lesha found an array A. Lesha likes to split arrays into several parts. This time Lesha decided to split the array A into several, possibly one, new arrays so that the sum of elements in each of the new arrays is not zero. One more condition is that if we place the new arrays one...	from sys import stdin n = int(input()) a = [int(x) for x in input().split()] f = False for i in range(len(a)): if a[i] != 0: ln = i f = True break if not f: print('NO') else: print('YES') l = 0 i = ln + 1 ans = [] while i < len(a): if a[i] == 0: ...	{ "input": [ "4\n1 2 3 -5\n", "1\n0\n", "8\n9 -12 3 4 -4 -10 7 3\n", "3\n1 2 -3\n", "8\n9 -12 3 4 -4 -10 7 3\n", "3\n0 0 0\n", "1\n1\n", "7\n0 0 0 0 3 -3 0\n", "4\n0 0 0 1\n", "4\n3 -2 -1 3\n", "5\n-3 2 2 0 -2\n", "3\n0 -1 0\n", "100\n-98 369 544 197 -991 231 399 52...	2CODEFORCES	Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem. ### Description: One spring day on his way to university Lesha found an array A. Lesha likes to split arrays into several parts. This time Lesha decided to split the array A into several, possibly one...

Subsets and Splits

No community queries yet

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