Unnamed: 0 int64 0 999 | name stringlengths 9 60 | description stringlengths 168 5.26k | solution stringlengths 38 20.8k |
|---|---|---|---|
900 | 837_A. Text Volume | You are given a text of single-space separated words, consisting of small and capital Latin letters.
Volume of the word is number of capital letters in the word. Volume of the text is maximum volume of all words in the text.
Calculate the volume of the given text.
Input
The first line contains one integer number n ... | n = int(input())
text = input()
ll = list(text.split())
num = []
for i in range(len(ll)):
num.append(sum(1 for c in ll[i] if c.isupper()))
print(max(num))
|
901 | 906_C. Party | Arseny likes to organize parties and invite people to it. However, not only friends come to his parties, but friends of his friends, friends of friends of his friends and so on. That's why some of Arseny's guests can be unknown to him. He decided to fix this issue using the following procedure.
At each step he selects... | from collections import defaultdict
def count(x):
c=0
while x > 0:
c+=1
x &= (x-1)
return c
n,m=map(int,input().split())
g=defaultdict(list)
for _ in range(m):
u, v = map(int,input().split())
u-=1;v-=1
g[u].append(v)
g[v].append(u)
mask1=0;mask2=0;MAX=(1<<n)-1
a=[0]*(1 << n... |
902 | 926_E. Merge Equal Elements | You are given a sequence of positive integers a1, a2, ..., an.
While possible, you perform the following operation: find a pair of equal consecutive elements. If there are more than one such pair, find the leftmost (with the smallest indices of elements). If the two integers are equal to x, delete both and insert a s... | # https://codeforces.com/problemset/problem/926/E
input()
stack1 = [int(i) for i in input().split()]
stack1.reverse()
stack2 = []
while stack1:
transfer = stack1.pop()
while stack2 and stack2[-1] == transfer:
stack2.pop()
transfer += 1
stack2.append(transfer)
print(len(stack2))
print("... |
903 | 955_C. Sad powers | You're given Q queries of the form (L, R).
For each query you have to find the number of such x that L ≤ x ≤ R and there exist integer numbers a > 0, p > 1 such that x = ap.
Input
The first line contains the number of queries Q (1 ≤ Q ≤ 105).
The next Q lines contains two integers L, R each (1 ≤ L ≤ R ≤ 1018).
Ou... | import math
import bisect
import sys
def flrt(exp,x):
l=max(0,math.floor(x**(1/exp))-3)
r= math.floor(x**(1/exp))+3
while l<r:
mid=(l+r)//2
if mid**exp<=x:
l=mid+1
else:
r=mid
return l-1
def c1(r):
ans=set()
pr = [5,7,11, 13, 17, 19... |
904 | 1038_D. Slime | There are n slimes in a row. Each slime has an integer value (possibly negative or zero) associated with it.
Any slime can eat its adjacent slime (the closest slime to its left or to its right, assuming that this slime exists).
When a slime with a value x eats a slime with a value y, the eaten slime disappears, and ... | import sys
import os
def solve(slimes):
if len(slimes) == 1:
return slimes[0]
havePos = False
haveNeg = False
for s in slimes:
if s > 0:
havePos = True
elif s < 0:
haveNeg = True
if havePos and haveNeg:
return sum(map(abs, slimes))
elif... |
905 | 1102_A. Integer Sequence Dividing | You are given an integer sequence 1, 2, ..., n. You have to divide it into two sets A and B in such a way that each element belongs to exactly one set and |sum(A) - sum(B)| is minimum possible.
The value |x| is the absolute value of x and sum(S) is the sum of elements of the set S.
Input
The first line of the input ... | def check(n):
if (n // 2) % 2 == 1:
return 0
return 1
n = int(input())
if n % 2 == 1:
print(check(n))
else:
print(check(n - 1))
|
906 | 1150_B. Tiling Challenge | One day Alice was cleaning up her basement when she noticed something very curious: an infinite set of wooden pieces! Each piece was made of five square tiles, with four tiles adjacent to the fifth center tile:
<image> By the pieces lay a large square wooden board. The board is divided into n^2 cells arranged into n ... | n = int(input())
A = []
for i in range (n):
s = input()
A.append('#' + s + '#')
A.append('#' * (n + 2))
A.append('#' * (n + 2))
for i in range (n):
for j in range (1, n + 1):
#for k in range (n + 2):
# print(A[k])
#print(i, j)
#print()
#print()
if A[i][j] =... |
907 | 1172_C1. Nauuo and Pictures (easy version) | The only difference between easy and hard versions is constraints.
Nauuo is a girl who loves random picture websites.
One day she made a random picture website by herself which includes n pictures.
When Nauuo visits the website, she sees exactly one picture. The website does not display each picture with equal proba... | P = 998244353
N, M = map(int, input().split())
A = [int(a) for a in input().split()]
B = [int(a) for a in input().split()]
li = sum([A[i]*B[i] for i in range(N)])
di = sum([(A[i]^1)*B[i] for i in range(N)])
X = [[] for _ in range(M+1)]
X[0] = [1]
def calc(L):
su = sum(L)
pl = 0
pd = 0
RE = []
for i... |
908 | 118_D. Caesar's Legions | Gaius Julius Caesar, a famous general, loved to line up his soldiers. Overall the army had n1 footmen and n2 horsemen. Caesar thought that an arrangement is not beautiful if somewhere in the line there are strictly more that k1 footmen standing successively one after another, or there are strictly more than k2 horsemen... | R = lambda: map(int, input().split())
n1, n2, k1, k2 = R()
k1 = min(k1, n1)
k2 = min(k2, n2)
dp = [[[0] * 2 for j in range(n2 + 1)] for i in range(n1 + 1)]
for i in range(k1 + 1):
dp[i][0][0] = 1
for i in range(k2 + 1):
dp[0][i][1] = 1
for i in range(1, n1 + 1):
for j in range(1, n2 + 1):
dp[i][j][0... |
909 | 1209_C. Paint the Digits | You are given a sequence of n digits d_1d_2 ... d_{n}. You need to paint all the digits in two colors so that:
* each digit is painted either in the color 1 or in the color 2;
* if you write in a row from left to right all the digits painted in the color 1, and then after them all the digits painted in the color ... | for _ in range(int(input())):
n = int(input())
d = [*map(int, input())]
s = d[:]
s.sort()
o = []
i = 0
ans = []
for j in range(n):
if d[j] == s[i]:
ans.append('1')
i += 1
else:
ans.append('2')
t = []
for i in range(n):
if ans[i] == '1':
t.append(d[i])
for i in range(n):
if ans[i... |
910 | 1228_B. Filling the Grid | Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i ≤ h). In particular, r_i=0 if the leftmost cell of the i-th row is empty.
* c_{j} is the number of consecutive full cells ... | n, m = map(int, input().split())
row = list(map(int, input().split()))
col = list(map(int, input().split()))
grid = [['?'] * m for _ in range(n)]
for i in range(n):
lng = row[i]
for j in range(lng):
grid[i][j] = 'b'
if lng < m:
grid[i][lng] = 'w'
for i in range(m):
lng = col[i]
for j... |
911 | 1270_B. Interesting Subarray | For an array a of integers let's denote its maximal element as max(a), and minimal as min(a). We will call an array a of k integers interesting if max(a) - min(a) ≥ k. For example, array [1, 3, 4, 3] isn't interesting as max(a) - min(a) = 4 - 1 = 3 < 4 while array [7, 3, 0, 4, 3] is as max(a) - min(a) = 7 - 0 = 7 ≥ 5.
... | def findsubarray(n,ll):
for i in range(0,n-1):
if abs(ll[i]-ll[i+1])>1:
return 1,i+1,i+2
return 0,None,None
tests = int(input())
for i in range(0,tests):
numberlen = int(input())
numbers = input().split()
numberss = list(map(int,numbers))
result, left,right = findsub... |
912 | 1292_F. Nora's Toy Boxes | [SIHanatsuka - EMber](https://soundcloud.com/hanatsuka/sihanatsuka-ember)
[SIHanatsuka - ATONEMENT](https://soundcloud.com/hanatsuka/sihanatsuka-atonement)
Back in time, the seven-year-old Nora used to play lots of games with her creation ROBO_Head-02, both to have fun and enhance his abilities.
One day, Nora's adop... | MOD = 1000000007
def isSubset(a, b):
return (a & b) == a
def isIntersect(a, b):
return (a & b) != 0
# Solve for each weakly connected component (WCC)
def cntOrder(s, t):
p = len(s)
m = len(t)
inMask = [0 for i in range(m)]
for x in range(p):
for i in range(m):
if t[i] % s[x] == 0:
inMask[i] |= 1 ... |
913 | 1312_G. Autocompletion | You are given a set of strings S. Each string consists of lowercase Latin letters.
For each string in this set, you want to calculate the minimum number of seconds required to type this string. To type a string, you have to start with an empty string and transform it into the string you want to type using the followin... | import io
import os
DEBUG = False
def dfs(trie, root, preorder=None, postorder=None):
stack = [root]
seen = set()
while stack:
nodeId = stack.pop()
if nodeId not in seen:
if preorder:
preorder(nodeId)
stack.append(nodeId)
seen.add(nodeId... |
914 | 1375_E. Inversion SwapSort | Madeline has an array a of n integers. A pair (u, v) of integers forms an inversion in a if:
* 1 ≤ u < v ≤ n.
* a_u > a_v.
Madeline recently found a magical paper, which allows her to write two indices u and v and swap the values a_u and a_v. Being bored, she decided to write a list of pairs (u_i, v_i) with t... | n=int(input())
arr=list(map(int,input().split()))
ans=[]
for i in range(n):
for j in range(n-1,i,-1):
if arr[i]>arr[j]:
ans.append((arr[i],i+1,j+1))
ans=sorted(ans,key=lambda x:x[0])
ans=sorted(ans,reverse=True,key=lambda x:x[2])
print(len(ans))
for _,u,v in ans:
print(u,v) |
915 | 1399_A. Remove Smallest | You are given the array a consisting of n positive (greater than zero) integers.
In one move, you can choose two indices i and j (i ≠ j) such that the absolute difference between a_i and a_j is no more than one (|a_i - a_j| ≤ 1) and remove the smallest of these two elements. If two elements are equal, you can remove a... | def t(b):
if b:
print("YES")
return
print("NO")
for _ in range(int(input())):
a = int(input())
l = sorted(list(map(int, input().split())))
for i in range(a - 1):
if l[i + 1] - l[i] >= 2:
t(False)
break
else:
t(True)
|
916 | 1422_D. Returning Home | Yura has been walking for some time already and is planning to return home. He needs to get home as fast as possible. To do this, Yura can use the instant-movement locations around the city.
Let's represent the city as an area of n × n square blocks. Yura needs to move from the block with coordinates (s_x,s_y) to the ... | from bisect import *
from collections import *
from math import *
from heapq import *
from typing import List
from itertools import *
from operator import *
from functools import *
import sys
'''
@lru_cache(None)
def fact(x):
if x<2:
return 1
return fact(x-1)*x
@lru_cache(None)
def per(i,j):
return... |
917 | 1514_D. Cut and Stick | Baby Ehab has a piece of Cut and Stick with an array a of length n written on it. He plans to grab a pair of scissors and do the following to it:
* pick a range (l, r) and cut out every element a_l, a_{l + 1}, ..., a_r in this range;
* stick some of the elements together in the same order they were in the array; ... | from bisect import bisect, bisect_left
from random import random
import io, os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
n, q = map(int, input().split())
a = list(map(int, input().split()))
v = [list() for i in range(n + 1)]
for i in range(n):
v[a[i]].append(i)
for i in range(q):
l, r = map(int, ... |
918 | 1541_D. Tree Array | You are given a tree consisting of n nodes. You generate an array from the tree by marking nodes one by one.
Initially, when no nodes are marked, a node is equiprobably chosen and marked from the entire tree.
After that, until all nodes are marked, a node is equiprobably chosen and marked from the set of unmarked no... | from functools import lru_cache
from collections import deque
M = 10 ** 9 + 7
@lru_cache(None)
def inv(x):
return pow(x, M - 2, M)
@lru_cache(None)
def dp(u, v):
# u before v
if u == 0:
return 0
if v == 0:
return 1
return (dp(u - 1, v) * inv(2) + dp(u, v - 1) * inv(2)) % M
def... |
919 | 18_A. Triangle | At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper he drew three points with integer coordinates, and joined them with segments of straight lines, then he showed the triangle t... | import math
"""
#include <cstdio>
#include <iostream>
#include <algorithm>
bool isRight(int *c){
int sides[3] = {0};
sides[0] = (c[4] - c[2]) * (c[4] - c[2]) + (c[5] - c[3])* (c[5] - c[3]);
sides[1] = (c[4] - c[0]) * (c[4] - c[0]) + (c[5] - c[1])* (c[5] - c[1]);
sides[2] = (c[2] - c[0]) * (c[2] - c[0]... |
920 | 213_A. Game | Furik and Rubik love playing computer games. Furik has recently found a new game that greatly interested Rubik. The game consists of n parts and to complete each part a player may probably need to complete some other ones. We know that the game can be fully completed, that is, its parts do not form cyclic dependencies.... | n = int(input())
c = list(map(int, input().split()))
d = dict()
d[1] = []
d[2] = []
d[3] = []
for i in range(n):
d[c[i]].append(i)
done = set()
mas = []
k = 0
poss = set()
for i in range(n):
l = list(map(int, input().split()))
l = l[1:]
mas.append(l)
if len(l) == 0:
k = c[i]
poss.add... |
921 | 237_A. Free Cash | Valera runs a 24/7 fast food cafe. He magically learned that next day n people will visit his cafe. For each person we know the arrival time: the i-th person comes exactly at hi hours mi minutes. The cafe spends less than a minute to serve each client, but if a client comes in and sees that there is no free cash, than ... | t=int(input())
d={}
while (t>0):
t=t-1
s=input()
if s in d:
d[s]+=1
else:
d[s]=1
print(max(d.values())) |
922 | 285_D. Permutation Sum | Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers, each of them doesn't exceed n. We'll denote the i-th element of permutation p as pi. We'll call number n the size or the length of permutation p1, p2, ..., pn.
Petya decided to introduce the sum operation on the se... | n = int(input())
ans = [1, 3, 5, 7, 9, 11, 13, 15]
dct = \
{
1 : 1,
3 : 18,
5 : 1800,
7 : 670320,
9 : 734832000,
11 : 890786230,
13 : 695720788,
15 : 150347555
}
if n in ans:
print(dct[n])
else:
print(0) |
923 | 333_B. Chips | Gerald plays the following game. He has a checkered field of size n × n cells, where m various cells are banned. Before the game, he has to put a few chips on some border (but not corner) board cells. Then for n - 1 minutes, Gerald every minute moves each chip into an adjacent cell. He moves each chip from its original... | n, m = tuple(map(int, input().split(' ')))
vb = set()
hb = set()
for k in range(m):
i, j = tuple(map(int, input().split(' ')))
hb.add(i-1)
vb.add(j-1)
c = 0
for i in range(1, n//2):
c += 1 if i not in hb else 0
c += 1 if n-i-1 not in hb else 0
c += 1 if i not in vb else 0
c += 1 if n-i-1 not in vb else 0
c += 1 ... |
924 | 37_A. Towers | Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.
Vasya wants to construct the minimal number of towers from the bars. Help Vasya to use the bars in the best way ... | x=int(input())
l=list(map(int,input().split()))
a=list(set(l))
l.sort()
maxx=l.count(0)
for i in range(len(l)):
if(l.count(l[i])>maxx):
maxx=l.count(l[i])
print(maxx,len(a))
|
925 | 3_D. Least Cost Bracket Sequence | This is yet another problem on regular bracket sequences.
A bracket sequence is called regular, if by inserting "+" and "1" into it we get a correct mathematical expression. For example, sequences "(())()", "()" and "(()(()))" are regular, while ")(", "(()" and "(()))(" are not. You have a pattern of a bracket sequenc... | from heapq import heappush, heappop
from sys import stdin, exit
template = list(next(stdin).strip())
n, cost, balance = len(template), 0, 0
min_heap = []
for i in range(n):
if template[i] == '(':
balance += 1
elif template[i] == ')':
balance -= 1
else:
cost_left, cost_right = map(int, next(stdin).split())
... |
926 | 427_A. Police Recruits | The police department of your city has just started its journey. Initially, they don’t have any manpower. So, they started hiring new recruits in groups.
Meanwhile, crimes keeps occurring within the city. One member of the police force can investigate only one crime during his/her lifetime.
If there is no police offi... | n=int(input())
a=list(map(int,input().split()))
oc=0
cc=0
ans=0
for i in a:
if i>0:
oc+=i
elif oc==0:
ans+=1
else:
oc-=1
print(ans) |
927 | 44_I. Toys | Little Masha loves arranging her toys into piles on the floor. And she also hates it when somebody touches her toys. One day Masha arranged all her n toys into several piles and then her elder brother Sasha came and gathered all the piles into one. Having seen it, Masha got very upset and started crying. Sasha still ca... | def combinacoes(x):
# Se for apenas 1 elemento retorna 1 arranjo
if x == 1:
return [[0]]
else:
# Adiciona os elementos a lista auxiliar
aux = combinacoes(x - 1)
pilha = []
par = 0
# Percorre a lista juntando os elementos nas possibilidades possíveis
for element in aux... |
928 | 496_A. Minimum Difficulty | Mike is trying rock climbing but he is awful at it.
There are n holds on the wall, i-th hold is at height ai off the ground. Besides, let the sequence ai increase, that is, ai < ai + 1 for all i from 1 to n - 1; we will call such sequence a track. Mike thinks that the track a1, ..., an has difficulty <image>. In othe... | n=int(input())
lis=list(map(int,input().split()))
dif=abs(lis[1]-lis[0])
pos=[]
for i in range(n-1):
#print(i,end=",")
if(abs(lis[i]-lis[i+1])>dif):
dif=abs(lis[i]-lis[i+1])
for i in range(1,n-1):
t=abs(lis[i-1]-lis[i+1])
if(t>dif):
pos.append(t)
else:
pos.append(dif)
#print(... |
929 | 51_D. Geometrical problem | Polycarp loves geometric progressions — he collects them. However, as such progressions occur very rarely, he also loves the sequences of numbers where it is enough to delete a single element to get a geometric progression.
In this task we shall define geometric progressions as finite sequences of numbers a1, a2, ...,... | def main():
n = int(input())
l = tuple(map(int, input().split()))
if n == 1:
return 0
if n == 2:
if l[0] == 0 and l[1] != 0: return 1
return 0
def div(a, b):
if b == 0: return 0 if a == 0 else "inf"
return a / b
pref, suff = [["init", 1]], [["init", 1]]
... |
930 | 573_B. Bear and Blocks | Limak is a little bear who loves to play. Today he is playing by destroying block towers. He built n towers in a row. The i-th tower is made of hi identical blocks. For clarification see picture for the first sample.
Limak will repeat the following operation till everything is destroyed.
Block is called internal if i... | # Author : nitish420 --------------------------------------------------------------------
import os
import sys
from io import BytesIO, IOBase
def main():
n=int(input())
arr=list(map(int,input().split()))
if n<3:
print(1)
exit()
dp=[0]*(n)
dp[0]=1
dp[-1]=1
# first find min t... |
931 | 616_C. The Labyrinth | You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's call two empty cells adjacent if they share a side.
Let's call a connected component any non-extendible set of cells such that a... | from collections import deque
dirs = [[1, 0], [-1, 0], [0, 1], [0, -1]]
componentsizes = {}
componentid = 0
n, m = map(int, input().split())
field = [list(input()) for _ in range(n)]
def valid(y, x):
return y >= 0 and x >= 0 and y < n and x < m
def component(y, x):
size = 1
q = deque([(y, x)])
fiel... |
932 | 635_D. Factory Repairs | A factory produces thimbles in bulk. Typically, it can produce up to a thimbles a day. However, some of the machinery is defective, so it can currently only produce b thimbles each day. The factory intends to choose a k-day period to do maintenance and construction; it cannot produce any thimbles during this time, but ... | from functools import reduce
class SegmentTree():
def __init__(self, L, function = lambda x,y: x+y, initilizer = None):
self.function = function
self.initilizer = initilizer
N = self.size = len(L)
M = 1 << N.bit_length()
self.margin = 2*M - N
self.L = [None for i in r... |
933 | 664_C. International Olympiad | International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of form IAO'y, where y stands for some number of consequent last digits of the current year. Organizers always pick an abbreviation with non-empty string y that has never been used before. Amo... | from __future__ import print_function
dic = {"9":"1989","0":"1990","1":"1991","2":"1992","3":"1993","4":"1994","5":"1995","6":"1996","7":"1997","8":"1998"}
def get_year(s):
# print("came into get_year")
length=len(s)
if len(s)==1:
return dic[s]
pos=[s]
pre=1
if s[0]=="0" or len(s)<4 or (len(s)==4 and int(s)... |
934 | 689_A. Mike and Cellphone | While swimming at the beach, Mike has accidentally dropped his cellphone into the water. There was no worry as he bought a cheap replacement phone with an old-fashioned keyboard. The keyboard has only ten digital equal-sized keys, located in the following way:
<image>
Together with his old phone, he lost all his cont... | n = int(input())
s = input()
fill = [[False for i in range(3)] for j in range(4)]
for i in s:
if i == "0":
j = 10
else:
j = ord(i)-ord('1') #0, 1, 2, 3... 8
fill[j//3][j%3] = True
#for i in fill:
# print(i)
top = fill[0][0] or fill[0][1] or fill[0][2]
bottom = fill[2][0] or fill[3][1] or ... |
935 | 710_E. Generate a String | zscoder wants to generate an input file for some programming competition problem.
His input is a string consisting of n letters 'a'. He is too lazy to write a generator so he will manually generate the input in a text editor.
Initially, the text editor is empty. It takes him x seconds to insert or delete a letter 'a'... | n, x, y = map(int, input().split(" "))
l = [0.]*(n+1)
for i in range(1,n+1):
l[i] = min(l[i-1]+x, l[(i+1)//2]+y+(x*(i&1)))
print(int(l[n])) |
936 | 731_E. Funny Game | Once upon a time Petya and Gena gathered after another programming competition and decided to play some game. As they consider most modern games to be boring, they always try to invent their own games. They have only stickers and markers, but that won't stop them.
The game they came up with has the following rules. In... | n=int(input())
a=[0]+list(map(int, input().split()))
p=[0]
for i in range(1, n+1):
p+=[ p[-1]+a[i] ]
d=[ p[n] ]*(n+1)
for i in range(n-2, 0, -1):
d[i]=max(d[i+1], p[i+1]-d[i+1])
print(d[1])
|
937 | 777_A. Shell Game | Bomboslav likes to look out of the window in his room and watch lads outside playing famous shell game. The game is played by two persons: operator and player. Operator takes three similar opaque shells and places a ball beneath one of them. Then he shuffles the shells by swapping some pairs and the player has to guess... | def nap(y):
if y==0:
p=[0,1,2]
return p
if y==1:
p=[1,0,2]
return p
if y==2:
p=[1,2,0]
return p
if y==3:
p=[2,1,0]
return p
if y==4:
p=[2,0,1]
return p
if y==5:
p=[0,2,1]
return p
n=int(input())
x=int... |
938 | 822_A. I'm bored with life | Holidays have finished. Thanks to the help of the hacker Leha, Noora managed to enter the university of her dreams which is located in a town Pavlopolis. It's well known that universities provide students with dormitory for the period of university studies. Consequently Noora had to leave Vičkopolis and move to Pavlopo... |
arr1 = input().split()
a = int(arr1[0])
b = int(arr1[1])
c = int(min(a, b))
res = 1
for i in range(2, c+1):
res *= i
print(res) |
939 | 847_F. Berland Elections | The elections to Berland parliament are happening today. Voting is in full swing!
Totally there are n candidates, they are numbered from 1 to n. Based on election results k (1 ≤ k ≤ n) top candidates will take seats in the parliament.
After the end of the voting the number of votes for each candidate is calculated. I... | class State:
__slots__ = ['candidate', 'votes', 'last_vote']
def __init__(self, cand, votes, last):
self.candidate = cand
self.votes = votes
self.last_vote = last
def beats(self, other, extra):
return self.votes + extra > other.votes
def main():
candidates, seats, people, voted = map(int, inp... |
940 | 869_A. The Artful Expedient | Rock... Paper!
After Karen have found the deterministic winning (losing?) strategy for rock-paper-scissors, her brother, Koyomi, comes up with a new game as a substitute. The game works as follows.
A positive integer n is decided first. Both Koyomi and Karen independently choose n distinct positive integers, denoted ... | # Main maut ko takiya, aur kafan ko chaadar banakar audhta hoon!
print("Karen") |
941 | 916_A. Jamie and Alarm Snooze | Jamie loves sleeping. One day, he decides that he needs to wake up at exactly hh: mm. However, he hates waking up, so he wants to make waking up less painful by setting the alarm at a lucky time. He will then press the snooze button every x minutes until hh: mm is reached, and only then he will wake up. He wants to kno... | def lucky(a,b):
return '7' in str(a)+str(b)
x = int(input())
t = 0
h,m = map(int,input().split())
while not lucky(h,m):
t+=1
m -= x
while m<0:
m+=60
h-=1
h%=24
print(t)
|
942 | 939_B. Hamster Farm | Dima has a hamsters farm. Soon N hamsters will grow up on it and Dima will sell them in a city nearby.
Hamsters should be transported in boxes. If some box is not completely full, the hamsters in it are bored, that's why each box should be completely full with hamsters.
Dima can buy boxes at a factory. The factory pr... | # -*- coding: utf-8 -*-
"""
Created on Fri Mar 2 22:09:34 2018
@author: Xiaohua
"""
def Hamster(amounts,boxsize):
a=10000000000000000000
result=[0,0]
for i in range(0,len(boxsize)):
if(amounts[0]%boxsize[i]<a):
a=amounts[0]%boxsize[i]
result[0]=i+1
re... |
943 | 991_E. Bus Number | This night wasn't easy on Vasya. His favorite team lost, and he didn't find himself victorious either — although he played perfectly, his teammates let him down every time. He had to win at least one more time, but the losestreak only grew longer and longer... It's no wonder he didn't get any sleep this night at all.
... | from itertools import chain, combinations
from collections import defaultdict
import math
def powerset(iterable):
xs = iterable
return chain.from_iterable(combinations(xs,n) for n in range(1, len(xs)+1))
def has(s):
h = 1
p = [2,3,5,7,11,13,17,19,23,29]
for i in s:
h *= p[i-1]
return h
h = set()
total ... |
944 | 1000_D. Yet Another Problem On a Subsequence | The sequence of integers a_1, a_2, ..., a_k is called a good array if a_1 = k - 1 and a_1 > 0. For example, the sequences [3, -1, 44, 0], [1, -99] are good arrays, and the sequences [3, 7, 8], [2, 5, 4, 1], [0] — are not.
A sequence of integers is called good if it can be divided into a positive number of good arrays.... | import sys
input=sys.stdin.readline
N=10**4+10
mod=998244353
g1=[1,1]
g2=[1,1]
inv=[0,1]
for i in range(2,N+1):
g1.append((g1[-1]*i)%mod)
inv.append((-inv[mod%i]*(mod//i))%mod)
g2.append((g2[-1]*inv[-1])%mod)
def comb(m,r,mod):
if r<0 or r>m:
return 0
return (g1[m]*g2[r]*g2[m-r])%mod
n=int(i... |
945 | 106_A. Card Game | There is a card game called "Durak", which means "Fool" in Russian. The game is quite popular in the countries that used to form USSR. The problem does not state all the game's rules explicitly — you can find them later yourselves if you want.
To play durak you need a pack of 36 cards. Each card has a suit ("S", "H", ... | a = input()
b,c = input().split()
lst = ["6", "7", "8", "9", "T", "J", "Q", "K" , "A"]
if b[1] ==c[1]:
print('YES' if lst.index(b[0]) > lst.index(c[0]) else 'NO')
elif b[1] == a:
print('YES')
else:
print('NO') |
946 | 1090_M. The Pleasant Walk | There are n houses along the road where Anya lives, each one is painted in one of k possible colors.
Anya likes walking along this road, but she doesn't like when two adjacent houses at the road have the same color. She wants to select a long segment of the road such that no two adjacent houses have the same color.
H... | #
n, k = map(int, input().split())
l = list(map(int, input().split()))
m = []
f = []
s=set(l)
if len(s)== 1:
print("1")
else:
for i in range(len(l) - 1):
if l[i] == l[i + 1]:
f.append(m)
# print(len(f))
# print(m)
m = []
else:
if le... |
947 | 110_C. Lucky Sum of Digits | Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya wonders eagerly what minimum lucky number has the sum of digits equal to n. Help him cope with... | n=int(input())
from collections import Counter
c=Counter([])
c[1]=[-1,2]
c[2]=[-2,4]
c[3]=[-3,6]
c[4]=[0,1]
c[5]=[-1,3]
c[6]=[-2,5]
a=n%7
s=n//7
f=0
if a==0:
print ('7'*s)
else:
s+=c[a][0]
f+=c[a][1]
if s<0:
if n%4==0:
print ('4'*(n//4))
else:
print (-1)
else:... |
948 | 1157_F. Maximum Balanced Circle | There are n people in a row. The height of the i-th person is a_i. You can choose any subset of these people and try to arrange them into a balanced circle.
A balanced circle is such an order of people that the difference between heights of any adjacent people is no more than 1. For example, let heights of chosen peop... | import sys
from collections import namedtuple
from itertools import groupby
input = sys.stdin.readline
def main():
Data = namedtuple('Data', ['arr', 'l', 'r'])
_ = int(input())
a = list(map(int, input().split()))
f = [ [0, 0] for i in range(max(a) + 2) ]
for x in a:
f[x][0] = x
f... |
949 | 1215_C. Swap Letters | Monocarp has got two strings s and t having equal length. Both strings consist of lowercase Latin letters "a" and "b".
Monocarp wants to make these two strings s and t equal to each other. He can do the following operation any number of times: choose an index pos_1 in the string s, choose an index pos_2 in the string... | a=int(input())
s=input()
r=input()
cmap=[]
tmap=[]
for i in range(len(s)):
if(s[i]=='a' and r[i]=='b'):
cmap.append(i)
elif(s[i]=='b' and r[i]=='a'):
tmap.append(i)
r=len(cmap)
t=len(tmap)
if(((r%2==1 and t%2==0) or (r%2==0 and t%2==1))):
print(-1)
else:
total=r//2+t//2
if(r... |
950 | 1280_A. Cut and Paste | We start with a string s consisting only of the digits 1, 2, or 3. The length of s is denoted by |s|. For each i from 1 to |s|, the i-th character of s is denoted by s_i.
There is one cursor. The cursor's location ℓ is denoted by an integer in \{0, …, |s|\}, with the following meaning:
* If ℓ = 0, then the cursor... | for _ in range(int(input())):
x = int(input())
s = input()
l = 0
while(len(s)<x):
s += s[l+1:]*(int(s[l])-1)
l+=1
count=len(s)
for k in range(l,x):
count+=((count-k-1)*(int(s[k])-1))
count%= 1000000007
print(count)
|
951 | 1324_A. Yet Another Tetris Problem | You are given some Tetris field consisting of n columns. The initial height of the i-th column of the field is a_i blocks. On top of these columns you can place only figures of size 2 × 1 (i.e. the height of this figure is 2 blocks and the width of this figure is 1 block). Note that you cannot rotate these figures.
Yo... | # ------------------- fast io --------------------
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode... |
952 | 1406_D. Three Sequences | You are given a sequence of n integers a_1, a_2, …, a_n.
You have to construct two sequences of integers b and c with length n that satisfy:
* for every i (1≤ i≤ n) b_i+c_i=a_i
* b is non-decreasing, which means that for every 1<i≤ n, b_i≥ b_{i-1} must hold
* c is non-increasing, which means that for every 1<... | import sys
import atexit
class Fastio:
def __init__(self):
self.ibuf = bytes()
self.obuf = bytearray()
self.pil = 0
self.pir = 0
def load(self):
self.ibuf = self.ibuf[self.pil:]
self.ibuf += sys.stdin.buffer.read(131072)
self.pil = 0
self.pir = l... |
953 | 1450_E. Capitalism | A society can be represented by a connected, undirected graph of n vertices and m edges. The vertices represent people, and an edge (i,j) represents a friendship between people i and j.
In society, the i-th person has an income a_i. A person i is envious of person j if a_j=a_i+1. That is if person j has exactly 1 more... | n,m = map(int,input().split());edge = [[] for i in range(n)];cost = [[10**18*(i!=j) for j in range(n)] for i in range(n)]
for _ in range(m):u,v,b = map(int,input().split());edge[u-1].append(v-1);edge[v-1].append(u-1);cost[u-1][v-1] = 1;cost[v-1][u-1] = (1 if not b else -1)
used = [False]*n;cond = [0]*n;used[0] = True;s... |
954 | 1523_E. Crypto Lights | <image>
To monitor cryptocurrency exchange rates trader William invented a wonderful device consisting of n lights arranged in a row. The device functions in the following way:
Initially, all lights on William's device are turned off. At the beginning of a new iteration the device randomly, with a uniform distributio... |
def divisors(M):
d=[]
i=1
while M>=i**2:
if M%i==0:
d.append(i)
if i**2!=M:
d.append(M//i)
i=i+1
return d
def popcount(x):
x = x - ((x >> 1) & 0x55555555)
x = (x & 0x33333333) + ((x >> 2) & 0x33333333)
x = (x + (x >> 4)) & 0x0f0f0f0f
... |
955 | 155_D. Colliders | By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activating several colliders simultaneously could cause, so the colliders were deactivated.
In 2312 there was a startling discovery:... | n, m = map(int, input().split())
n += 1
s = [[] for i in range(n)]
for j in range(2, n, 2): s[j] = [2]
for i in range(3, n, 2):
if s[i]: continue
for j in range(i, n, i): s[j].append(i)
p, d, r = {}, set(), [''] * m
for j in range(m):
t = input()
i = int(t[2: ])
if t[0] == '+':
... |
956 | 177_D2. Encrypting Messages | The Smart Beaver from ABBYY invented a new message encryption method and now wants to check its performance. Checking it manually is long and tiresome, so he decided to ask the ABBYY Cup contestants for help.
A message is a sequence of n integers a1, a2, ..., an. Encryption uses a key which is a sequence of m integers... | n, m, c = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
s, k = 0, n - m
for i in range(n):
if i < m: s += b[i]
a[i] = (a[i] + s) % c
if i >= k: s -= b[i - k]
print(' '.join(str(i) for i in a)) |
957 | 222_A. Shooshuns and Sequence | One day shooshuns found a sequence of n integers, written on a blackboard. The shooshuns can perform one operation with it, the operation consists of two steps:
1. Find the number that goes k-th in the current sequence and add the same number to the end of the sequence;
2. Delete the first number of the current s... | n,k=map(int,input().split())
l=list(map(int,input().split()))
f=l[k-1]
if l[k-1:].count(f) == n-k+1:
r = 0
for i in range(k-2,-1,-1):
if l[k-1] != l[i]:
break
r+=1
print(len(l[:k-1-r]))
else:
print(-1)
|
958 | 270_E. Flawed Flow | Emuskald considers himself a master of flow algorithms. Now he has completed his most ingenious program yet — it calculates the maximum flow in an undirected graph. The graph consists of n vertices and m edges. Vertices are numbered from 1 to n. Vertices 1 and n being the source and the sink respectively.
However, his... | import sys
from collections import deque
DST_VERTEX = 0
EDGE_CAP = 1
EDGE_ID = 2
EDGE_DIR = 3
def bfs(flow, graph, n, m):
dirs = [-1 for _ in range(m)]
q = deque()
q.append(0)
q_size = 1
while q_size > 0:
cur_node = q.popleft()
q_size -= 1
for i in range(len(graph[cur_node]... |
959 | 294_B. Shaass and Bookshelf | Shaass has n books. He wants to make a bookshelf for all his books. He wants the bookshelf's dimensions to be as small as possible. The thickness of the i-th book is ti and its pages' width is equal to wi. The thickness of each book is either 1 or 2. All books have the same page heights.
<image>
Shaass puts the books... | n = int(input())
t = []
for i in range(n):
e = list(map(int,input().split()))
t.append(e)
size = 0
size2 = 0
for i in t:
size += i[0]
size2 += i[1]
matrix = [[-1000]*(size+1) for i in range(n)]
for i in range(n):
matrix[i][0] = 0
for i in range(n):
for j in range(1,size+1):
if t[i][0... |
960 | 365_B. The Fibonacci Segment | You have array a1, a2, ..., an. Segment [l, r] (1 ≤ l ≤ r ≤ n) is good if ai = ai - 1 + ai - 2, for all i (l + 2 ≤ i ≤ r).
Let's define len([l, r]) = r - l + 1, len([l, r]) is the length of the segment [l, r]. Segment [l1, r1], is longer than segment [l2, r2], if len([l1, r1]) > len([l2, r2]).
Your task is to find a ... | import sys
n = int(input())
a = list(map(int, input().split()))
if n <= 2:
print(n)
sys.exit()
best = 0
mem = a[:2]
cur = 0
for i in a[2:]:
if mem[0] + mem[1] == i:
cur += 1
else:
if cur > best: best = cur
cur = 0
mem = mem[1:] + [i]
if cur > best: best = cur
print(best+2)
|
961 | 389_A. Fox and Number Game | Fox Ciel is playing a game with numbers now.
Ciel has n positive integers: x1, x2, ..., xn. She can do the following operation as many times as needed: select two different indexes i and j such that xi > xj hold, and then apply assignment xi = xi - xj. The goal is to make the sum of all numbers as small as possible.
... | from sys import stdin, stdout, stderr, setrecursionlimit
setrecursionlimit(100000)
def debug (*e):
if not __debug__:
print(*e, file=stderr)
def dd(*vals):
import inspect, re
frame = inspect.getframeinfo(inspect.stack()[1][0])
vs = re.search("dd\((.+)\)", frame.code_context[0]).group(1).split("... |
962 | 409_D. Big Data | Little Petya wanted to give an April Fools Day present to some scientists. After some hesitation he decided to give them the array that he got as a present in Codeforces Round #153 (Div.2). The scientists rejoiced at the gift and decided to put some important facts to this array. Here are the first few of the facts:
... | x = int(input())
v = [1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0]
print(v[x-1])
|
963 | 45_A. Codecraft III | Today Vasya visited a widely known site and learned that the continuation of his favourite game Codecraft II will appear after exactly k months. He looked at the calendar and learned that at the moment is the month number s. Vasya immediately got interested in what month Codecraft III will appear. Help him understand t... | month = str(input())
k = int(input())
m = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']
j = m.index(month)
while k != 0:
if j == 11:
j = 0
k -= 1
else:
j += 1
k -= 1
print(m[j]) |
964 | 555_A. Case of Matryoshkas | Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls that can be nested one into another. The matryoshka dolls are numbered from 1 to n. A matryoshka with a smaller number can be ... | n,k = map(int,input().split(" "))
i=0
res=k
sh=0
while i<k:
i+=1
mas=list(map(int,input().split(" ")))[1:]
if mas[0]==1:
j=0
while j<(len(mas)-1):
if(mas[j]+1!=mas[j+1]):
break
else:
j+=1
sh+=len(mas)-j-1
res+... |
965 | 625_B. War of the Corporations | A long time ago, in a galaxy far far away two giant IT-corporations Pineapple and Gogol continue their fierce competition. Crucial moment is just around the corner: Gogol is ready to release it's new tablet Lastus 3000.
This new device is equipped with specially designed artificial intelligence (AI). Employees of Pine... | a, b = input(), input()
ans = 0
index = a.find (b, 0)
while index != -1:
ans = ans + 1
index = a.find (b, index + len (b))
print (ans)
|
966 | 71_A. Way Too Long Words | Sometimes some words like "localization" or "internationalization" are so long that writing them many times in one text is quite tiresome.
Let's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.
This abbreviation is made lik... | n = int(input())
if 1 <= n <= 100:
for i in range(n):
word = input()
if len(word) > 10:
numWord = str(len(word[1:-1]))
print(word[0] + numWord + word[-1])
else:
print(word)
|
967 | 740_C. Alyona and mex | Alyona's mother wants to present an array of n non-negative integers to Alyona. The array should be special.
Alyona is a capricious girl so after she gets the array, she inspects m of its subarrays. Subarray is a set of some subsequent elements of the array. The i-th subarray is described with two integers li and ri,... | n,m=map(int,input().split())
min_val=9999999
for _ in range(m):
y,x=map(int,input().split())
if min_val>x-y:
x1=x
y1=y
min_val=x-y
print(min_val+1)
L=[0]*n
tp=0
listNum=[]
for i in range(n):
listNum.append(tp)
tp+=1
if tp>min_val:
tp=0
for i in listNum[:-1]:
print... |
968 | 764_B. Timofey and cubes | Young Timofey has a birthday today! He got kit of n cubes as a birthday present from his parents. Every cube has a number ai, which is written on it. Timofey put all the cubes in a row and went to unpack other presents.
In this time, Timofey's elder brother, Dima reordered the cubes using the following rule. Suppose t... | n=int(input())
a=list(map(int,input().split()))
i=0
temp=0
for i in range(n//2):
if i%2==0:
temp=a[i]
a[i]=a[n-i-1]
a[n-i-1]=temp
for r in a:
print(r,end=' ') |
969 | 809_A. Do you want a date? | Leha decided to move to a quiet town Vičkopolis, because he was tired by living in Bankopolis. Upon arrival he immediately began to expand his network of hacked computers. During the week Leha managed to get access to n computers throughout the town. Incidentally all the computers, which were hacked by Leha, lie on the... | def main():
largemodulus = 1000000007
maxofn = 300001
n = 0
answer = 0
powersoftwo = []
multiplier = 1
for _ in range(maxofn):
powersoftwo.append(multiplier)
if multiplier >= largemodulus:
multiplier = multiplier % largemodulus
multiplier *= 2
n = int(input())
hacked =... |
970 | 854_B. Maxim Buys an Apartment | Maxim wants to buy an apartment in a new house at Line Avenue of Metropolis. The house has n apartments that are numbered from 1 to n and are arranged in a row. Two apartments are adjacent if their indices differ by 1. Some of the apartments can already be inhabited, others are available for sale.
Maxim often visits h... | n,k=map(int,input().split())
mi=1
if k==0:
print(0,0)
exit()
if k==n:
print(0,0)
exit()
if 3*k <=n:
ma=2*k
else:
ma=n-k
print(mi,ma)
|
971 | 902_B. Coloring a Tree | You are given a rooted tree with n vertices. The vertices are numbered from 1 to n, the root is the vertex number 1.
Each vertex has a color, let's denote the color of vertex v by cv. Initially cv = 0.
You have to color the tree into the given colors using the smallest possible number of steps. On each step you can c... | from queue import *
n=int(input())
parent={}
child={}
for i in range(1,n+1):
parent[i]=0
child[i]=[]
l=list(map(int,input().split()))
for i in range(2,n+1):
parent[i]=l[i-2]
child[l[i-2]].append(i)
l=list(map(int,input().split()))
color={}
for i in range(1,n+1):
color[i]=l[i-1]
q=Queue()
q.put... |
972 | 952_F. 2 + 2 != 4 | One very experienced problem writer decided to prepare a problem for April Fools Day contest. The task was very simple - given an arithmetic expression, return the result of evaluating this expression. However, looks like there is a bug in the reference solution...
Input
The only line of input data contains the arith... | import re;s=input();print(eval(s)+eval(re.sub("-|\+|\d",lambda m:"+-035"[2-"+--".count(m[0])::3],s))) |
973 | 99_C. Help Victoria the Wise | Vasilisa the Wise from a far away kingdom got a present from her friend Helga the Wise from a farther away kingdom. The present is a surprise box, yet Vasilisa the Wise doesn't know yet what the surprise actually is because she cannot open the box. She hopes that you can help her in that.
The box's lock is constructed... | from functools import reduce
def factorial(n):
return reduce(lambda x, y: x*y, range(1,n+1))
colors = {
'R' : 0,
'O' : 0,
'Y' : 0,
'G' : 0,
'B' : 0,
'V' : 0
}
for c in list(input()):
colors[c] += 1
amount = list(reversed(sorted([(colors[key], key) for key in colors])))
amount = [x[0... |
974 | 1055_E. Segments on the Line | You are a given a list of integers a_1, a_2, …, a_n and s of its segments [l_j; r_j] (where 1 ≤ l_j ≤ r_j ≤ n).
You need to select exactly m segments in such a way that the k-th order statistic of the multiset of a_i, where i is contained in at least one segment, is the smallest possible. If it's impossible to select ... | n, s, m, k = map(int, input().split())
a = list(map(int, input().split()))
nt = [-1 for i in range(n+1)]
for i in range(s):
l, r = map(int, input().split())
l-=1
for j in range(l, r):
nt[j] = max(nt[j], r)
dp = [[0 for i in range(m+1)] for i in range(n+1)]
sum = [0 for i in range(n+1)]
def solve(mid):
for i in ... |
975 | 1077_F1. Pictures with Kittens (easy version) | The only difference between easy and hard versions is the constraints.
Vova likes pictures with kittens. The news feed in the social network he uses can be represented as an array of n consecutive pictures (with kittens, of course). Vova likes all these pictures, but some are more beautiful than the others: the i-th p... | import sys
S = sys.stdin.read()
S = list(map(lambda x: list(map(int, x)), list(map(lambda x: x.split(), [x for x in S.split('\n') if len(x) > 1]))))
n, k, x, B = S[0][0], S[0][1], S[0][2], S[1]
X = [[-1 for i in range(x+1)] for i in range(n+1)]
X[0][0] = 0
for i in range(1, n+1):
for j in range(1, x+1):
... |
976 | 1167_C. News Distribution | In some social network, there are n users communicating with each other in m groups of friends. Let's analyze the process of distributing some news between users.
Initially, some user x receives the news from some source. Then he or she sends the news to his or her friends (two users are friends if there is at least o... | import sys
n, m = map(int, input().split())
par = [0] * (n + 1)
cnt = [0] * (n + 1)
for i in range(n + 1):
par[i] = i
def find(a):
if par[a] == a:
return a
par[a] = find(par[a])
return par[a]
for i in sys.stdin.readlines():
x = list(map(int, i[:-1].split()))
if x[0]:
ta = find(x[1])
for i i... |
977 | 1185_F. Two Pizzas | A company of n friends wants to order exactly two pizzas. It is known that in total there are 9 pizza ingredients in nature, which are denoted by integers from 1 to 9.
Each of the n friends has one or more favorite ingredients: the i-th of friends has the number of favorite ingredients equal to f_i (1 ≤ f_i ≤ 9) and y... | import sys
import math
input=sys.stdin.readline
#sys.setrecursionlimit(1000000)
I=lambda : list(map(int,input().split()))
ma =int(10000000000000000)
n,m=map(int,input().split())
a=[ma]*(515);a1=[ma]*(515);fr=[0]*(515);pos=[0]*(515)
for i in range(n):
b=I()
x=int(0)
for j in range(1,b[0]+1):
b[j]-=... |
978 | 1204_D1. Kirk and a Binary String (easy version) | The only difference between easy and hard versions is the length of the string. You can hack this problem only if you solve both problems.
Kirk has a binary string s (a string which consists of zeroes and ones) of length n and he is asking you to find a binary string t of the same length which satisfies the following ... | s = str(input().strip())
t = list(s[::-1])
cnt = 0
for i,v in enumerate(t):
if v == '0':
cnt += 1
else:
if cnt:
cnt -= 1
else:
t[i] = '0'
print("".join(t[::-1])) |
979 | 1221_B. Knights | You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess piece that can attack a piece in cell (x_2, y_2) from the cell (x_1, y_1) if one of the following conditions is met:
* |x_... | n = int(input())
i = 0
s = ''.join(['W' if (i + j) % 2 == 0 else 'B' for i in range(n) for j in range(n)])
while(i<n*n):
print(s[i:i+n])
i+=n |
980 | 1307_E. Cow and Treats | After a successful year of milk production, Farmer John is rewarding his cows with their favorite treat: tasty grass!
On the field, there is a row of n units of grass, each with a sweetness s_i. Farmer John has m cows, each with a favorite sweetness f_i and a hunger value h_i. He would like to pick two disjoint subset... | import sys
input = sys.stdin.readline
from itertools import accumulate
mod=10**9+7
n,m=map(int,input().split())
G=list(map(int,input().split()))
CP=[[0]*(n+1) for i in range(n+1)]
for i in range(m):
f,e=map(int,input().split())
CP[f][e]+=1
SUMCP=[]
for i in range(n+1):
SUMCP.append(list(accumulate(C... |
981 | 1330_E. Drazil Likes Heap | Drazil likes heap very much. So he created a problem with heap:
There is a max heap with a height h implemented on the array. The details of this heap are the following:
This heap contains exactly 2^h - 1 distinct positive non-zero integers. All integers are distinct. These numbers are stored in the array a indexed f... | import io
import os
import sys
# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')
fileno = sys.stdin.fileno()
input = io.BytesIO(
os.read(fileno, os.fstat(fileno).st_size)
).readline
T = int(input())
def trim(A, h, g):
N = len(A)
ans = []
initial_root = 0
items_to_leave = pow(2, g) ... |
982 | 1350_E. Orac and Game of Life | Please notice the unusual memory limit of this problem.
Orac likes games. Recently he came up with the new game, "Game of Life".
You should play this game on a black and white grid with n rows and m columns. Each cell is either black or white.
For each iteration of the game (the initial iteration is 0), the color of... | import sys
input = sys.stdin.readline
n, m, t = map(int, input().split())
cell = [list(input().rstrip()) for _ in range(n)]
cnt = [[False] * m for _ in range(n)]
for i in range(n):
for j in range(m):
if i - 1 >= 0 and cell[i - 1][j] == cell[i][j]:
cnt[i][j] = True
if i + 1 < n and cell... |
983 | 1393_D. Rarity and New Dress | Carousel Boutique is busy again! Rarity has decided to visit the pony ball and she surely needs a new dress, because going out in the same dress several times is a sign of bad manners. First of all, she needs a dress pattern, which she is going to cut out from the rectangular piece of the multicolored fabric.
The piec... | r,c=map(int,input().split())
rama=[]
for i in range(r):
rama.append(list((input())))
visit=[[1 for i in range(c)] for j in range(r)]
for i in range(2,r):
for j in range(1,c-1):
if(rama[i][j]==rama[i-1][j-1]==rama[i-1][j+1]==rama[i-2][j]==rama[i-1][j]):
visit[i][j]=min(visit[i-1][j-1],visit[... |
984 | 1486_A. Shifting Stacks | You have n stacks of blocks. The i-th stack contains h_i blocks and it's height is the number of blocks in it. In one move you can take a block from the i-th stack (if there is at least one block) and put it to the i + 1-th stack. Can you make the sequence of heights strictly increasing?
Note that the number of stacks... | # https://codeforces.com/contest/1486/problem/0
import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
# do magic here
t = int(input())
def check(arr):
# print(arr)
for x in range(len(arr)-1):
if arr[x+1] <= arr[x]:
return "NO"
return "YES"
for _ in range(t):
... |
985 | 1536_C. Diluc and Kaeya | The tycoon of a winery empire in Mondstadt, unmatched in every possible way. A thinker in the Knights of Favonius with an exotic appearance.
This time, the brothers are dealing with a strange piece of wood marked with their names. This plank of wood can be represented as a string of n characters. Each character is eit... | from math import *
from collections import Counter,defaultdict,deque
I =lambda:int(input())
M =lambda:map(int,input().split())
LI=lambda:list(map(int,input().split()))
for _ in range(I()):
n=I()
s=input()
dc=0
kc=0
d=defaultdict(int)
for i in s:
dc+=i=="D"
kc+=i=="K"
g=... |
986 | 230_D. Planets | Goa'uld Apophis captured Jack O'Neill's team again! Jack himself was able to escape, but by that time Apophis's ship had already jumped to hyperspace. But Jack knows on what planet will Apophis land. In order to save his friends, Jack must repeatedly go through stargates to get to this planet.
Overall the galaxy has n... | from heapq import *
n, m = map(int, input().split())
l = []
from copy import *
from bisect import *
from math import *
from sys import *
for _ in range(0, n + 2):
l.append([])
for i in range(0, m):
a, b, c = map(int, stdin.readline().split())
l[a].append((c, b))
l[b].append((c, a))
dist = [10000000000... |
987 | 302_B. Eugeny and Play List | Eugeny loves listening to music. He has n songs in his play list. We know that song number i has the duration of ti minutes. Eugeny listens to each song, perhaps more than once. He listens to song number i ci times. Eugeny's play list is organized as follows: first song number 1 plays c1 times, then song number 2 plays... | # Getting input
song = list()
n,m=map(int,input().split())
song.append(0)
for i in range(n):
note, times = map(int,input().split())
total_time = song[i] +note*times
song.append(total_time)
eugeny_moments = list(map(int, input().split()))
# computing resul... |
988 | 350_A. TL | Valera wanted to prepare a Codesecrof round. He's already got one problem and he wants to set a time limit (TL) on it.
Valera has written n correct solutions. For each correct solution, he knows its running time (in seconds). Valera has also wrote m wrong solutions and for each wrong solution he knows its running time... | m, n = map(int, input().split())
a = sorted([int(x) for x in input().split()])
b = sorted([int(x) for x in input().split()])
for i in range(100):
if (i >= a[-1] and i < b[0] and i >= 2 * a[0]):
print(i)
break
else:
print(-1) |
989 | 374_B. Inna and Nine | Inna loves digit 9 very much. That's why she asked Dima to write a small number consisting of nines. But Dima must have misunderstood her and he wrote a very large number a, consisting of digits from 1 to 9.
Inna wants to slightly alter the number Dima wrote so that in the end the number contained as many digits nine ... | s=input()
ans=0
i=1
past=int(s[0])
c=1
ans=1
while(i<len(s)):
if(int(s[i])+past==9):
c+=1
past=int(s[i])
else:
if(c%2==1 and c!=1):
ans*=(c//2+1)
c=1
past=int(s[i])
i+=1
if(c!=1 and c%2==1):
ans*=(c//2+1)
print(ans)
|
990 | 467_D. Fedor and Essay | After you had helped Fedor to find friends in the «Call of Soldiers 3» game, he stopped studying completely. Today, the English teacher told him to prepare an essay. Fedor didn't want to prepare the essay, so he asked Alex for help. Alex came to help and wrote the essay for Fedor. But Fedor didn't like the essay at all... | from sys import stdin
from collections import defaultdict
def main():
stdin.readline()
num = {}
stat = lambda word: (word.count('r'),
len(word), num.setdefault(word, len(num)))
essay = list(map(stat, stdin.readline().lower().split()))
queue = []
for word in essay:
queue.append(word)
n_synonym ... |
991 | 53_E. Dead Ends | Life in Bertown has become hard. The city has too many roads and the government spends too much to maintain them. There are n junctions and m two way roads, at which one can get from each junction to any other one. The mayor wants to close some roads so that the number of roads left totaled to n - 1 roads and it were s... | import sys
from array import array # noqa: F401
def input():
return sys.stdin.buffer.readline().decode('utf-8')
n, m, k = map(int, input().split())
adj = [[] for _ in range(n)]
dp = [[0] * (1 << n) for _ in range(1 << n)]
for u, v in (map(int, input().split()) for _ in range(m)):
u, v = u - 1, v - 1
a... |
992 | 568_A. Primes or Palindromes? | Rikhail Mubinchik believes that the current definition of prime numbers is obsolete as they are too complex and unpredictable. A palindromic number is another matter. It is aesthetically pleasing, and it has a number of remarkable properties. Help Rikhail to convince the scientific community in this!
Let us remind you... | import sys
p,q = map(int,sys.stdin.readline().split())
def prime(n):
#print(int(n**0.5))
for div in range(2,int(n**0.5)+1):
if n%div==0:
return False
return True
def palindrom(n):
n = str(n)
for pos in range((len(n)+1)//2):
if n[pos]!=n[-1-pos]:
return ... |
993 | 611_A. New Year and Days | Today is Wednesday, the third day of the week. What's more interesting is that tomorrow is the last day of the year 2015.
Limak is a little polar bear. He enjoyed this year a lot. Now, he is so eager to the coming year 2016.
Limak wants to prove how responsible a bear he is. He is going to regularly save candies for ... | s=input().split()
l1=[52,52,52,52,53,53,52]
l2=[31,29,31,30,31,30,31,31,30,31,30,31]
count=0
if s[2]=="month":
x=int(s[0])
for i in range(len(l2)):
if x<=l2[i]:
count+=1
print(count)
else:
for i in range(len(l1)):
if int(s[0])==i+1:
print(l1[i])
break
|
994 | 65_A. Harry Potter and Three Spells | A long time ago (probably even in the first book), Nicholas Flamel, a great alchemist and the creator of the Philosopher's Stone, taught Harry Potter three useful spells. The first one allows you to convert a grams of sand into b grams of lead, the second one allows you to convert c grams of lead into d grams of gold a... | from functools import reduce
from operator import mul
c = list(map(int, input().split()))
r, h = reduce(mul, c[1::2], 1), reduce(mul, c[0::2], 1)
rw = r > h or (c[2] == 0 and c[3] != 0) or (c[0] == 0 and c[1] * c[3] != 0)
print("Ron" if rw else "Hermione") |
995 | 729_A. Interview with Oleg | Polycarp has interviewed Oleg and has written the interview down without punctuation marks and spaces to save time. Thus, the interview is now a string s consisting of n lowercase English letters.
There is a filler word ogo in Oleg's speech. All words that can be obtained from ogo by adding go several times to the end... | def compute_prefix_function(p):
"""
Вычисляет префикс функцию паттерна p
:param p: паттерн для kmp
:return: преикс функцию для p
"""
s = [0] * len(p)
border = 0 # текущая граница
for i in range(1, len(p)):
while border > 0 and p[i] != p[border]:
border = s[border - 1... |
996 | 797_A. k-Factorization | Given a positive integer n, find k integers (not necessary distinct) such that all these integers are strictly greater than 1, and their product is equal to n.
Input
The first line contains two integers n and k (2 ≤ n ≤ 100000, 1 ≤ k ≤ 20).
Output
If it's impossible to find the representation of n as a product of k... | #!/usr/bin/env python
from math import sqrt
dic = {}
def kfact(n, k):
if (n, k) in dic:
return dic[(n, k)]
if k == 1:
return [n]
for i in range(2, int(sqrt(n)) + 1):
if n % i == 0:
if kfact(n // i, k - 1):
result = [i] + kfact(n // i, k - 1)
... |
997 | 817_C. Really Big Numbers | Ivan likes to learn different things about numbers, but he is especially interested in really big numbers. Ivan thinks that a positive integer number x is really big if the difference between x and the sum of its digits (in decimal representation) is not less than s. To prove that these numbers may have different speci... | def nine(p) :
s=''
for i in range(p) :
s+='9'
return int(s)
def prosh(p) :
ans=0
for i in range(1,p+1) :
ans+=nine(i)*9
return ans
n,k=map(int,input().split())
l=[0]*29
for i in range(19) :
e=nine(19-i)
l[i]=int(k/e)
k-=l[i]*e
if ... |
998 | 863_C. 1-2-3 | Ilya is working for the company that constructs robots. Ilya writes programs for entertainment robots, and his current project is "Bob", a new-generation game robot. Ilya's boss wants to know his progress so far. Especially he is interested if Bob is better at playing different games than the previous model, "Alice".
... | k, a, b = map(int, input().split())
A = []
for _ in range(3):
temp = [int(x) for x in input().split()]
A.append(temp)
B = []
for _ in range(3):
temp = [int(x) for x in input().split()]
B.append(temp)
flag, ac, bc, cur = 0, 0, 0, 1
m = {}
ans1, ans2 = [0]*1000, [0]*1000
while cur <= k:
if (a, b) in m and flag != 1:... |
999 | 911_E. Stack Sorting | Let's suppose you have an array a, a stack s (initially empty) and an array b (also initially empty).
You may perform the following operations until both a and s are empty:
* Take the first element of a, push it into s and remove it from a (if a is not empty);
* Take the top element from s, append it to the end ... | def divisors(M):
d=[]
i=1
while M>=i**2:
if M%i==0:
d.append(i)
if i**2!=M:
d.append(M//i)
i=i+1
return d
def popcount(x):
x = x - ((x >> 1) & 0x55555555)
x = (x & 0x33333333) + ((x >> 2) & 0x33333333)
x = (x + (x >> 4)) & 0x0f0f0f0f
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.