input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import itertools as i,collections as c
b=c.Counter(s[0]for s in open(0).readlines()[1:] if s[0]in"MARCH")
print((sum(p*q*r for p,q,r in i.combinations(list(b.values()),3)))) | import itertools as i,collections as c;print((sum(p*q*r for p,q,r in i.combinations(list(c.Counter(s[0]for s in open(0).readlines()[1:] if s[0]in"MARCH").values()),3)))) | p03425 |
n = int(eval(input()))
m = ["M", "A", "R", "C", "H"]
s = {}
for _ in range(n):
s_ = input()[0]
if s_ not in m: continue
else:
if s_ not in list(s.keys()):
s[s_] = 0
s[s_] += 1
if len(list(s.keys())) <= 2:
print((0))
exit()
l = list(s.values())
n = len(l)
a ... | n = int(eval(input()))
m = "MARCH"
l = {}
cnt = 0
for _ in range(n):
init = input()[0]
if init not in m:
continue
if init not in l:
cnt += 1
l[init] = 0
l[init] += 1
if cnt <= 2:
print((0))
exit()
l = list(l.values())
n = len(l)
ans = 0
for i in range(n-... | p03425 |
import itertools
def main():
N = int(input().strip())
S = [input().strip() for _ in range(N)]
MARCH_S = [x[0] for x in S if x[0] in ['M','A','R','C','H']]
if not MARCH_S:
return 0
pat = list(itertools.combinations(MARCH_S, 3));
pat_len = len(pat)
for x in ['M','A','R... | import itertools
def main():
N = int(input().strip())
S = []
for _ in range(N):
in_s = (input().strip())[0]
if in_s in ['M','A','R','C','H']:
S.append(in_s)
if not S:
return 0
pat = itertools.combinations(S, 3);
count = 0
for x in pat... | p03425 |
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)
args = sys.argv
def dump(*objects):
if len(args) == 2 and args[1] == "DEBUG":
print(*objects, file=sys.stderr)
N = int(input())
S =[input() for i in range(N)]
D={... | import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)
args = sys.argv
def dump_impl(*objects):
print(*objects, file=sys.stderr)
def dump_dummy(*objects):
print(*objects, file=sys.stderr)
dump = dump_impl if len(args) ==... | p03425 |
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)
args = sys.argv
def dump_impl(*objects):
print(*objects, file=sys.stderr)
def dump_dummy(*objects):
print(*objects, file=sys.stderr)
dump = dump_impl if len(args) ==... | import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)
args = sys.argv
def dump_impl(*objects):
print(*objects, file=sys.stderr)
def dump_dummy(*objects):
pass
dump = dump_impl if len(args) == 2 and args[1] == "DEBUG" ... | p03425 |
from itertools import combinations
from collections import Counter
n = int(eval(input()))
S = Counter()
for i in range(n):
S[input()[0]] += 1 # Counter == dictionary
print((sum([S[a]*S[b]*S[c] for a, b, c in combinations("MARCH", 3)]))) | from collections import defaultdict
from itertools import combinations
N = int(eval(input()))
S = [input()[0] for _ in range(N)]
dic_S = defaultdict(int)
for s in S:
if s in "MARCH":
dic_S[s] += 1
ans = 0
for a, b, c in combinations(list(dic_S.values()), 3):
ans += a*b*c
print(ans)
| p03425 |
from itertools import combinations
from collections import Counter
N = int(eval(input()))
S = Counter()
for _ in range(N):
S[input()[0]] += 1
print((sum([S[p0]*S[p1]*S[p2] for p0,p1,p2 in combinations('MARCH', 3)])))
quit()
| from itertools import combinations
N = int(eval(input()))
d = [0]*128
for _ in range(N): d[ord(input()[0])] += 1
print((sum([d[ord(p0)]*d[ord(p1)]*d[ord(p2)] for p0,p1,p2 in combinations('MARCH', 3)])))
| p03425 |
N=int(eval(input()))
name=[input()[0] for _ in range(N)]
m,a,r,c,h=name.count("M"),name.count("A"),name.count("R"),name.count("C"),name.count("H")
print((m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h)) | N=int(eval(input()))
n=[input()[0] for _ in range(N)]
m,a,r,c,h=n.count("M"),n.count("A"),n.count("R"),n.count("C"),n.count("H")
print((m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h)) | p03425 |
from itertools import*;d={};g=d.get
for t in open(0).read().split():d[t[0]]=g(t[0],0)+1
print((sum(g(p,0)*g(q,0)*g(r,0)for p,q,r in combinations('MARCH',3)))) | from itertools import*;d=[0]*128
for t in open(0).read().split():d[ord(t[0])]+=1
print((sum(p*q*r for p,q,r in combinations([d[ord(t)]for t in'MARCH'],3)))) | p03425 |
from itertools import*;d=[0]*128
for _ in[0]*int(eval(input())):d[ord(input()[0])]+=1
print((sum(p*q*r for p,q,r in combinations([d[ord(t)]for t in'MARCH'],3)))) | from itertools import*;d=[0]*91
for _ in[0]*int(eval(input())):d[ord(input()[0])]+=1
print((sum(p*q*r for p,q,r in combinations([d[ord(t)]for t in'MARCH'],3)))) | p03425 |
from itertools import*;d={}
for t in open(0).read().split():d[t[0]]=d.get(t[0],0)+1
print((sum(p*q*r for p,q,r in combinations([d.get(t,0)for t in'MARCH'],3)))) | from itertools import*;d={};g=d.get
for t in open(0).read().split():d[t[0]]=g(t[0],0)+1
print((sum(p*q*r for p,q,r in combinations([g(t,0)for t in'MARCH'],3)))) | p03425 |
import sys
from itertools import combinations
from collections import Counter
input = sys.stdin.readline
def log(*args):
print(*args, file=sys.stderr)
def main():
n = int(input().rstrip())
s = [input()[0] for _ in range(n)]
s = [v for v in s if v in 'MARCH']
c = Counter(s)
ans... | import sys
from itertools import combinations
from collections import Counter
input = sys.stdin.readline
def log(*args):
print(*args, file=sys.stderr)
def main():
n = int(input().rstrip())
s = [input()[0] for _ in range(n)]
c = Counter(s)
ans = 0
for x, y, z in combinations('M... | p03425 |
import collections
cc = collections.Counter()
for _ in range(int(input())):
cc[input()[0]] +=1
def dfs(i, total ,cumul, cc, k, s):
if i == len(s) or k == 0:
if k == 0: total[0] += cumul
return
if k:
dfs(i+1, total, cumul * cc[s[i]], cc,k - 1, s)
dfs(i+1, total, cumul, cc, k, s)
total = [0]... | import collections
cc = collections.Counter([input()[0] for _ in range(int(input()))])
def dfs(i, total ,cumul, cc, k, s):
if i == len(s) or k == 0:
if k == 0: total[0] += cumul
return
dfs(i+1, total, cumul * cc[s[i]], cc,k - 1, s)
dfs(i+1, total, cumul, cc, k, s)
total = [0]
dfs(0, total, 1 ,... | p03425 |
n,*s=list(map(str,open(0).read().split()))
a=[0]*5
ans=0
for i in s:
if i[0] in "MARCH":
a["MARCH".index(i[0])]+=1
for i in range(3):
for j in range(i+1,4):
for k in range(j+1,5):
ans+=a[i]*a[j]*a[k]
print(ans) | from itertools import combinations
n,*s=list(map(str,open(0).read().split()))
a=[0]*5
for i in s:
if i[0] in "MARCH":
a["MARCH".index(i[0])]+=1
print((sum([a[x]*a[y]*a[z] for x,y,z in combinations(list(range(5)),3)]))) | p03425 |
#coding=utf-8
from itertools import combinations
from collections import Counter
def solve(n, ss):
filtered_ss = list([x for x in ss if x in "MARCH"])
gc = Counter(filtered_ss)
if len(gc) < 3:
return 0
ans = 0
for permutation in combinations("MARCH", 3):
ans += (gc[pe... | #coding=utf-8
from itertools import combinations
from collections import Counter
def solve(n, gc):
#filtered_ss = list(filter(lambda x: x in "MARCH", ss))
#gc = Counter(filtered_ss)
if len(gc) < 3:
return 0
ans = 0
for permutation in combinations("MARCH", 3):
ans += (... | p03425 |
import sys
from sys import exit
from collections import deque
from bisect import bisect_left, bisect_right, insort_left, insort_right #func(リスト,値)
from heapq import heapify, heappop, heappush
from math import *
sys.setrecursionlimit(10**6)
INF = 10**20
eps = 1.0e-20
MOD = 10**9+7
def lcm(x,y):
return... | import sys
from sys import exit
from collections import deque
from bisect import bisect_left, bisect_right, insort_left, insort_right #func(リスト,値)
from heapq import heapify, heappop, heappush
from itertools import combinations, permutations, product
from math import *
sys.setrecursionlimit(10**6)
INF = 10**20... | p03425 |
import itertools
import collections
def main():
n = int(eval(input()))
S = [input()[0] for _ in range(n)]
array = ['M','A','R','C','H']
S_after = []
for s in S:
if s in array:
S_after.append(s)
if len(S_after) < 3:
print((0))
return
S_afte... | import itertools
import collections
def main():
n = int(eval(input()))
S = [input()[0] for _ in range(n)]
array = ['M','A','R','C','H']
combs = itertools.combinations(array, 3)
coll = collections.Counter(S)
ans = 0
for comb in combs:
ans += coll[comb[0]]*coll[comb[1]]... | p03425 |
n,k = list(map(int, input().split()))
ans = k
for i in range(1, n):
ans *= k-1
print(ans) | n,k = list(map(int, input().split()))
print((k * (k-1) ** (n-1))) | p03963 |
import math
N,K=list(map(int,input().split()))
print((K*((K-1)**(N-1)))) | n,k=list(map(int,input().split()))
print((k*(k-1)**(n-1))) | p03963 |
def main():
n, k = list(map(int, input().split()))
print((k * pow(k - 1, n - 1)))
if __name__ == '__main__':
main()
| def main():
n, k = list(map(int, input().split()))
print((k * (pow(k - 1, n - 1))))
if __name__ == '__main__':
main()
| p03963 |
N, K = list(map(int,input().split()))
pat = K*((K-1)**(N-1))
print(pat) | N, K = list(map(int,input().split()))
print((K*((K-1)**(N-1))))
| p03963 |
import itertools
N,K=[int(i) for i in input().split()]
seq=[i for i in range(K)]
lst=[]
for i in itertools.product(seq, repeat=N):
lst.append(i)
ans=[]
for tup in lst:
f=0
for ind,color in enumerate(tup):
if(ind==len(tup)-1):
break
if(tup[ind+1]==color):
... | import itertools
N,K=[int(i) for i in input().split()]
seq=[i for i in range(K)]
lst=[]
'''for i in itertools.product(seq, repeat=N):
lst.append(i)
ans=[]
for tup in lst:
f=0
for ind,color in enumerate(tup):
if(ind==len(tup)-1):
break
if(tup[ind+1]==color):
... | p03963 |
import itertools
N,K=[int(i) for i in input().split()]
seq=[i for i in range(K)]
lst=[]
'''for i in itertools.product(seq, repeat=N):
lst.append(i)
ans=[]
for tup in lst:
f=0
for ind,color in enumerate(tup):
if(ind==len(tup)-1):
break
if(tup[ind+1]==color):
... | n,k=[int(i) for i in input().split()]
print(((k*1)*((k-1)**(n-1))))
| p03963 |
n, k = list(map(int, input().split()))
ans = k*((k-1)**(n-1))
print(ans)
| n, k = list(map(int, input().split()))
print((k*(k-1)**(n-1)))
| p03963 |
N, K = list(map(int, input().split()))
print((K * (K-1) ** (N-1))) | n, k = list(map(int, input().split()))
print((k * (k-1) ** (n-1))) | p03963 |
N, K = list(map(int, input().split()))
print((K * (K-1) ** (N-1))) | import sys
n, k = list(map(int, sys.stdin.readline().split()))
def main():
ans = k * (k - 1)**(n-1)
return ans
if __name__ == '__main__':
ans = main()
print(ans) | p03963 |
N,K = list(map(int,input().split()))
S = K
while(1):
if N==1:
break
S *= (K-1)
N-=1
print(S) | N,K = list(map(int,input().split()))
ans = 0
for i in range(N):
if i==0:
ans = K
else:
ans *= (K-1)
print(ans) | p03963 |
from itertools import permutations
import sys
sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
de... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in ... | p03963 |
N, K = list(map(int, input().split()))
print((K*((K-1)**(N-1)))) | N, K = list(map(int, input().split()))
print((K*(K-1)**(N-1))) | p03963 |
n,k = list(map(int, input().split()))
print(((k-1)**(n-1)*k)) | s=input().split()
N=int(s[0])
K=int(s[1])
print(((K-1)**(N-1)*K)) | p03963 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,k=list(map(int,input().split()))
print((k*((k-1)**(n-1))))
resolve() | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n, k = list(map(int, input().split()))
print((k * pow(k - 1, n - 1)))
resolve() | p03963 |
N,K = [int(i) for i in input().split()]
ans = K
for _ in range(N-1):
ans *= K - 1
print(ans) | N,K = list(map(int, input().split()))
ans = K
for _ in range(N - 1):
ans *= K - 1
print(ans) | p03963 |
import collections
#文字列を一文字ずつ取得したいとき
def inputStrOnebyOne():
s = list(eval(input()))
return s
#整数を一つずつリストに入れる
def inputOnebyOne_Int():
a = list(int(x) for x in input().split())
return a
def main():
n, k = list(map(int, input().split()))
print((k*(k-1)**(n-1)))
if __name__... | n, k = list(map(int, input().split()))
print((k*(k-1)**(n-1))) | p03963 |
N, K = list(map(int, input().split()))
A = K
if N != 1:
for i in range(N - 1):
A *= (K - 1)
print(A) | N, K = list(map(int, input().split()))
print((K * (K - 1) ** (N - 1))) | p03963 |
n,k=list(map(int,input().split()))
a=1
f=True
for i in range(n):
if f:
a*=k
f=False
else:
a*=k-1
print(a) | # 入力
N,K=list(map(int,input().split()))
# 出力
print((K*pow(K-1,N-1))) | p03963 |
n, k = list(map(int, input().split()))
print((k*((k-1)**(n-1)))) | n, k = list(map(int, input().split()))
print((k*(k-1)**(n-1)))
| p03963 |
# -*- coding: utf-8 -*-
x1,y1,x2,y2 = list(map(int, input().split()))
X = x2 - x1
Y = y2 - y1
if X > 0 and Y > 0:
x3 = x2 - abs(Y)
y3 = y2 + abs(X)
x4 = x3 - abs(X)
y4 = y3 - abs(Y)
elif X > 0 and Y < 0:
x3 = x2 + abs(Y)
y3 = y2 + abs(X)
x4 = x3 - abs(X)
y4 = y3 + ab... | # -*- coding: utf-8 -*-
x1,y1,x2,y2 = list(map(int, input().split()))
X = x2 - x1
Y = y2 - y1
print((str(x2 - Y) + ' ' + str(y2 + X) + ' ' + str(x1 - Y) + ' ' + str(y1 + X))) | p03265 |
A, B, C, D = map(int, input().split())
def solve(A,B,C,D):
dx,dy = C-A,D-B
x,y = C-dy,D+dx
ans = [x,y]
x,y = x-dx,y-dy
ans += [x,y]
return ans
print(*solve(A,B,C,D),sep=' ')
| A, B, C, D = map(int, input().split())
def solve(A,B,C,D):
dx,dy = C-A,D-B
ans = [C-dy,D+dx,A-dy,B+dx]
return ans
print(*solve(A,B,C,D),sep=' ')
| p03265 |
import sys
import bisect
N = int(sys.stdin.readline().rstrip())
S = list(sys.stdin.readline().rstrip())
Q = int(sys.stdin.readline().rstrip())
idx = {chr(ord("a") + i): set() for i in range(26)}
for i, s in enumerate(S):
idx[s].add(i + 1)
for _ in range(Q):
t, i, c = sys.stdin.readline().rstrip... | import sys
import bisect
N = int(sys.stdin.readline().rstrip())
S = list(sys.stdin.readline().rstrip())
Q = int(sys.stdin.readline().rstrip())
idx = {chr(ord("a") + i): [] for i in range(26)}
for i, s in enumerate(S):
idx[s].append(i + 1)
for _ in range(Q):
t, i, c = sys.stdin.readline().rstrip... | p02763 |
#coding:utf-8
import sys,os
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
from collections import Counter, deque
from random import random
class Node:
def __init__(self,value:int=-1):
self... | #coding:utf-8
import sys,os
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
from collections import Counter, deque
from random import random
class Node:
def __init__(self,value:int=-1):
self... | p02763 |
class SegTree():
def segfunc(self, x, y):
return x | y
def __init__(self, ide, n, init_val):
self.ide_ele = ide
self.num = 2**(n-1).bit_length()
self.seg = [self.ide_ele] * 2 * self.num
for i in range(n):
self.seg[i+self.num-1] = init_val[i] ... | from bisect import bisect_left
def main():
n = int(eval(input()))
s = input().rstrip()
q = int(eval(input()))
ans = []
al = [[] for _ in range(26)]
for i in range(n):
al[ord(s[i]) - ord("a")].append(i)
for _ in range(q):
x, y, z = list(map(str, input().rstrip().spli... | p02763 |
from bisect import bisect_left
def main():
n = int(eval(input()))
s = list(input().rstrip())
q = int(eval(input()))
ans = []
al = [[] for _ in range(26)]
for i, c in enumerate(s):
al[ord(c) - ord("a")].append(i)
for _ in range(q):
x, y, z = list(map(str, input().rst... | from bisect import bisect_left, insort
def main():
n = int(eval(input()))
s = list(input().rstrip())
q = int(eval(input()))
ans = []
al = [[] for _ in range(26)]
for i, c in enumerate(s):
al[ord(c) - ord("a")].append(i)
for _ in range(q):
x, y, z = list(map(str, inp... | p02763 |
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
alpha = ['a', 'b', 'c', 'd'... |
# # # # class Segtree # # # #
# 0
# 1 2
# 3 4 5 6
# :
# leaf i - n-1+i
# parent - (i-1)//2
# children - 2*i+1, 2*i+2
class Segtree:
# modify UNIT and oper depending on the reduce operation
UNIT = 0 # sum:0 min:BIG max:-BIG gcd:1 lcm:0 ..
@classmethod
def ope... | p02763 |
f=input
n,s,q=int(f()),list(f()),int(f())
d={chr(97+i):[] for i in range(26)}
for i in range(n):
d[s[i]]+=[i]
from bisect import *
for i in range(q):
a,b,c=input().split()
b=int(b)-1
if a=='1':
d[s[b]].pop(bisect(d[s[b]],b)-1)
s[b]=c
insort(d[c],b)
else:
t=0
for l in list(d.... | f=input
n,l,q=int(f()),list(f()),int(f())
B=[[0]*-~n for i in range(26)]
def S(o,i):
s=0
while i: s+=B[o][i]; i-=i&-i
return s
def A(o,i,x):
while i<=n: B[o][i]+=x; i+=i&-i
for i in range(n): A(ord(l[i])-97,i+1,1)
for i in range(q):
a,b,c=f().split(); b=int(b)
if a>'1': print((sum(1 for o in ran... | p02763 |
f=input
n,l,q=int(f()),list(f()),int(f())
B=[[0]*-~n for i in range(26)]
def S(o,i):
s=0
while i: s+=B[o][i]; i-=i&-i
return s
def A(o,i,x):
while i<=n: B[o][i]+=x; i+=i&-i
for i in range(n): A(ord(l[i])-97,i+1,1)
for i in range(q):
a,b,c=f().split(); b=int(b)
if a>'1': print((sum(1 for o in ran... | f=input
n,s,q=int(f()),list(f()),int(f())
d={chr(97+i):[] for i in range(26)}
for i in range(n):
d[s[i]]+=[i]
from bisect import *
for i in range(q):
a,b,c=f().split()
b=int(b)-1
if a=='1':
if s[b]==c: continue
d[s[b]].pop(bisect(d[s[b]],b)-1)
s[b]=c
insort(d[c],b)
else:
t=0... | p02763 |
f=input; from bisect import bisect_left as g, insort as h
f(); s,i=list(f()),0
from collections import *
d=defaultdict(list)
for c in s: d[c]+=[i]; i+=1
for _ in range(int(f())):
a,b,c=f().split(); b=int(b)-1
if a>'1': print((sum(1 for l in list(d.values()) if g(l,b)<len(l) and l[g(l,b)]<int(c))))
elif s[... | f=input; from bisect import bisect_left as g, insort as h
d={chr(97+i):[] for i in range(26)}
f(); s,i=list(f()),0
for c in s: d[c]+=[i]; i+=1
for _ in range(int(f())):
a,b,c=f().split(); b=int(b)-1
if a>'1': print((sum(1 for l in list(d.values()) if g(l,b)<len(l) and l[g(l,b)]<int(c))))
elif s[b]!=c: l=d[... | p02763 |
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_matrix(H):
'''
H is number of rows
'''
return [list(map(int, read().split())) for _ in range(H)]
def read_map(H):
'''
H i... | # https://atcoder.jp/contests/abc157/tasks/abc157_e
# セグメント木
# 各文字をビットに対応させる(セグ木を26本持っても良い)
import sys
read = sys.stdin.readline
def read_a_int():
return int(read())
class SegmentTree:
def __init__(self, ls: list, segfunc, identity_element):
'''
セグ木 (下書き)
一次元のリストlsを受け取... | p02763 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)
class BinaryIndexedTree(object):
def __init__(self, n):
self.n = n
self.vals = [0] * (n + 1)
def add(self, i, v):
while i <= self.n:
self.vals[i] += v
i += i & -i
def sum(self... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)
class BinaryIndexedTree(object):
def __init__(self, n):
# index is 1-based so vals[0] never be used
self.n = n
self.vals = [0] * (n + 1)
def add(self, i, v):
while i <= self.n:
self.vals... | p02763 |
# AtCoder Beginner Contest 157
# E - Simple String Queries
# https://atcoder.jp/contests/abc157/tasks/abc157_e
from bisect import bisect_left, insort_left
import sys
input = sys.stdin.readline
OFS = ord('a')
_ = eval(input())
S = list(input()[:-1])
D = [[] for _ in [0]*26]
for i, s in enumerate(S):
D[o... | # AtCoder Beginner Contest 157
# E - Simple String Queries
# https://atcoder.jp/contests/abc157/tasks/abc157_e
from bisect import bisect_left, insort_left
import sys
input = sys.stdin.readline
OFS = ord('a')
_ = eval(input())
S = list(input()[:-1])
D = [[] for _ in [0]*26]
for i, s in enumerate(S):
D[o... | p02763 |
N = int(eval(input()))
S = list(input().strip())
Qcnt = int(eval(input()))
cidx = {}
for i in range(ord("a"), ord("z")+1):
cidx[chr(i)] = set([])
import bisect
for idx, s in enumerate(S):
cidx[s].add(idx)
for _ in range(Qcnt):
Q = list(input().strip().split(" "))
if Q[0] == "1":
... | class SegTree:
def __init__(self, N, S):
self.N = 2 ** ((N-1).bit_length())
self.tree = [0 for i in range(self.N * 2 - 1)]
for i in range(len(S)):
self.tree[self.N - 1 + i] = 1 << (ord(S[i]) - ord("a"))
for i in range(self.N - 2, -1, -1):
self.tree[i]... | p02763 |
def solve():
import sys
input = sys.stdin.readline
ordA = ord('a')
N = int(eval(input()))
Ss = input().strip()
nos = [ord(S)-ordA for S in Ss]
Q = int(eval(input()))
idEle = 0
def _binOpe(x, y):
return x | y
def makeSegTree(numEle):
numPow2 = 2 *... | import sys
input = sys.stdin.readline
def solve():
ordA = ord('a')
N = int(eval(input()))
Ss = input().rstrip()
Q = int(eval(input()))
querys = [tuple(input().split()) for _ in range(Q)]
idEle = 0
def _binOpe(x, y):
return x | y
def makeSegTree(numEle):
... | p02763 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p02763 |
#!python3
import sys
from bisect import bisect, insort_left
iim = lambda: map(int, input().rstrip().split())
def resolve():
N = int(input())
S = list(input())
Q = int(input())
c0 = ord('a')
S1 = [[] for i in range(26)]
for i, c1 in enumerate(S):
ci = ord(c1) - c0
... | #!python3
import sys
from bisect import bisect, insort_left
iim = lambda: map(int, input().rstrip().split())
def resolve():
N = int(input())
S = list(input())
Q = int(input())
c0 = ord('a')
S1 = [[] for i in range(26)]
for i, c1 in enumerate(S):
ci = ord(c1) - c0
... | p02763 |
#!python3
import sys
iim = lambda: map(int, input().rstrip().split())
def popcnt2(n):
a = (
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4,
1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5... | #!python3
import sys
iim = lambda: map(int, input().rstrip().split())
def popcnt2(n):
a = (
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4,
1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5... | p02763 |
#!python3
import sys
iim = lambda: map(int, input().rstrip().split())
def popcnt2(n):
a = (
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4,
1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5... | #!python3
import sys
iim = lambda: map(int, input().rstrip().split())
def resolve():
N = int(input())
S = list(input())
Q = int(input())
c0 = ord('a')
smap = [1<<(i-c0) for i in range(c0, ord('z')+1)]
T = [0]*N + [smap[ord(S[i])-c0] for i in range(N)]
for i in range(N-1... | p02763 |
import sys
input = sys.stdin.readline
class Bit:
def __init__(self, n):
self.n = n
self.tree = [0]*(n+1)
self.el = [0]*(n+1)
self.depth = n.bit_length() - 1
def sum(self, i):
""" 区間[0,i) の総和を求める """
s = 0
i -= 1
while i >= 0:
... | # https://atcoder.jp/contests/abc157/tasks/abc157_e
import sys
input = sys.stdin.readline
class SegmentTree:
def __init__(self, n, op, e):
"""
:param n: 要素数
:param op: 二項演算
:param e: 単位減
例) 区間最小値 SegmentTree(n, lambda a, b : a if a < b else b, 10 ** 18)
... | p02763 |
import sys
readline = sys.stdin.buffer.readline
kijun = ord("a")
n = int(readline())
s = readline().rstrip().decode('utf-8')
q = int(readline())
lst1 = [0]*n
def pow(n,p): #繰り返し二乗法(nのp乗)
res = 1
while p > 0:
if p % 2 == 0:
n = n ** 2
p //= 2
else:
... | #ABC157-E Simple String Queries
"""
英小文字26字が含まれるか否かを、2**26のint型で管理するセグ木。
これをbitwise-segment treeと言うらしい。
解法：
葉はその英小文字のbitで管理する。
segfuncにはx|yを登録することで、区間クエリをとった時に
2進数表記で1が出てくる回数が答えになる。
"""
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
#input
n = int(readline())
s = ... | p02763 |
from functools import reduce
import sys
input = sys.stdin.readline
class SegmentTrees:
def __init__(self, target, no_effect):
size = len(target)
length = 1
while length < size:
length *= 2
self.tree_size = length * 2 - 1
self.tree = [no_effect] * sel... | import sys
input = sys.stdin.readline
class SegmentTrees:
def __init__(self, target, no_effect):
target_size = len(target)
leaves_size = 1
while leaves_size < target_size:
leaves_size *= 2
self.tree_size = leaves_size * 2 - 1
self.tree = [no_effect] *... | p02763 |
import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin... | import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys... | p02763 |
from collections import deque
class SegmentTree():
def __init__(self,n,ide_ele,merge_func,init_val):
self.n=n
self.ide_ele=ide_ele
self.merge_func=merge_func
self.val=[0 for i in range(1<<n)]
self.merge=[0 for i in range(1<<n)]
self.parent=[-1 for i in range... | class SegTree:
def __init__(self, init_val, segfunc, ide_ele):
n = len(init_val)
self.segfunc = segfunc
self.ide_ele = ide_ele
self.num = 1 << (n - 1).bit_length()
self.tree = [ide_ele] * 2 * self.num
# 配列の値を葉にセット
for i in range(n):
self.t... | p02763 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from copy import deepcopy
import string
from bisect import bisect_left, bisect_right
from ma... | p02763 |
# coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
class SegmentTree:
# 初期化処理
# f : SegmentTreeにのせるモノイド
# default : fに対する単位元
def __init__(self, size, default=0):
self.size = 2**(size-1).bit_length()... | import sys
from bisect import bisect_left, bisect_right, insort
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
S = list('-' + sr())
d = [[] for _ in range(26)]
for i in range(1, N+1):
s = S[i]
o = ord(s) - ord('a')
insort(d... | p02763 |
# coding: utf-8
import sys
from bisect import bisect_left, bisect_right, insort_left
from collections import defaultdict
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 各アルファベットのindexのリストを作り,bisect_left()
N = ir()
S = list(sr())
dic = defaultdi... | import sys
from bisect import bisect_left, bisect_right, insort
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
S = list('-' + sr())
d = [[] for _ in range(26)]
for i in range(1, N+1):
s = S[i]
o = ord(s) - ord('a')
d[o].app... | p02763 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
S = list(input().rstrip())
ord_a = ord("a")
# N: 処理する区間の長さ
INF = 2**31-1
LV = (N-1).bit_length()
N0 = 2**LV
data = [[0]*(2*N0) for _ in range(26)]
lazy = [[0]*(2*N0) for _ in range(26)]
def gindex(l, r):
L = (l + N0) >> 1; R = (r + N0)... | import sys
input = sys.stdin.readline
N = int(eval(input()))
S = list(input().rstrip())
ord_a = ord("a")
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i ... | p02763 |
# -*- coding: utf-8 -*-
import sys
N=eval(input())
S=["None"]+list(input())
Q=eval(input())
query=[ sys.stdin.readline().split() for _ in range(Q) ]
#BIT
bit=[ [ 0 for _ in range(N+1) ] for _ in range(27) ] #中も外も1-indexed bit[1]:aのbit, bit[2]:bのbit ...
def add(idx,a,w):
while a<=N:
bit[idx]... | # -*- coding: utf-8 -*-
import sys
N=eval(input())
S=["None"]+list(input())
Q=eval(input())
query=[ sys.stdin.readline().split() for _ in range(Q) ]
#BIT
bit=[ [ 0 for _ in range(N+1) ] for _ in range(27) ] #1-indexed bit[1]:aのbit, bit[2]:bのbit ...
def add(idx,a,w):
while a<=N:
bit[idx][a]+... | p02763 |
# AC: 577 msec (Python3)
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def string_to_number(a):
return 1 << (ord(a) - 97)
class SegmentTree:
def __init__(self, A):
self.n = 2**(len(A)-1).bit_length()
self.identity = 0
self... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def string_to_number(a):
return 1 << (ord(a) - 97)
class SegmentTree:
"""
セグ木は 1-indexed
"""
def __init__(self, n, initial=0):
self.offset = 2**(n-1).bit_length()
self.ini... | p02763 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
s = list(str(input().rstrip()))
q = int(eval(input()))
class SSQ:
def __init__(self, n, e):
# 単位元
self.e = e
# num_min:n以上の最小の2のべき乗
self.num_min = 2**(n-1).bit_length()
self.seg_min = [self.e]*2*self.... | n = int(eval(input()))
s = list(str(input().rstrip()))
q = int(eval(input()))
class SSQ:
def __init__(self, n, e):
# 単位元
self.e = e
# num_min:n以上の最小の2のべき乗
self.num_min = 2**(n-1).bit_length()
self.seg_min = [self.e]*2*self.num_min
def update(self, k, x):
... | p02763 |
from collections import Counter
def main():
n = int(input().strip())
s = list(input().strip())
bit = [Counter() for _ in range(n + 1)]
def query(i):
result = Counter()
while i:
result += bit[i]
i -= i & -i
return result
def updat... | def main():
n = int(input().strip())
s = list(input().strip())
bit = [[0] * 26 for _ in range(n + 1)]
def query(i):
result = [0] * 26
while i:
for j, x in enumerate(bit[i]):
result[j] += x
i -= i & -i
return result
... | p02763 |
import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N = NI()
R = 2**(N.bit_length())
st = [0... | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N = NI()
R = 2**(N.bit_length())
st = [0... | p02763 |
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
s = input().rstrip('\n')
l = [c for c in s]
q = int(input().rstrip('\n'))
Q = [input().rstrip('\n').split() for _ in range(q)]
class SegTree():
def __init__(self, n_):
self.n = 1
while self.n < n_:
self.n ... | import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
s = input().rstrip('\n')
q = int(input().rstrip('\n'))
Q = []
for _ in range(q):
Q.append(input().rstrip().split())
class SegTree():
def __init__(self, n_):
self.n = 1
while self.n < n_:
self.n *= 2... | p02763 |
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
s = input().rstrip('\n')
q = int(input().rstrip('\n'))
Q = []
for _ in range(q):
Q.append(input().rstrip().split())
class SegTree():
def __init__(self, n_):
self.n = 1
while self.n < n_:
self.n *= 2... | def main():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
s = input().rstrip('\n')
q = int(input().rstrip('\n'))
Q = []
for _ in range(q):
Q.append(input().rstrip().split())
class SegTree():
def __init__(self, n_):
self.n... | p02763 |
import sys
input=sys.stdin.buffer.readline
n=int(eval(input()))+1
data=[0]*n*2
def update(i,x):
i+=n
data[i]=x
i//=2
while i:
data[i]=data[i*2]|data[i*2+1]
i//=2
def query(l,r):
l+=n
r+=n
s=0
while l<r:
if l&1:
s|=data[l]
l+=1
if r&1:
r-=1
s|=... | def main():
import sys
input=sys.stdin.buffer.readline
n=int(eval(input()))+1
data=[0]*n*2
def update(i,x):
i+=n
data[i]=x
i//=2
while i:
data[i]=data[i*2]|data[i*2+1]
i//=2
def query(l,r):
l+=n
r+=n
s=0
while l<r:
if l&1:
s|=data[l... | p02763 |
n,s,_,*t=open(0).read().split()
n=int(n)
d=[0]*n+[1<<ord(c)-97for c in s]
for i in range(n-1,0,-1):d[i]=d[i+i]|d[i-~i]
for q,a,b in zip(*[iter(t)]*3):
i,s=int(a)+n-1,0
if'2'>q:
d[i]=1<<ord(b)-97
while i>1:
i//=2
d[i]=d[i+i]|d[i-~i]
continue
j=int(b)+n
while i<j:
if i&1:... | def main():
import sys
n,s,_,*t=sys.stdin.buffer.read().split()
n=int(n)
d=[0]*n+[1<<c-97for c in s]
for i in range(n-1,0,-1):d[i]=d[i+i]|d[i-~i]
for q,a,b in zip(*[iter(t)]*3):
i,s=int(a)+n-1,0
if q<b'2':
d[i]=1<<ord(b)-97
while i>1:
i//=2
d[i]=d[i+i]|d[i-~i]... | p02763 |
import sys
input = sys.stdin.readline
N = int(input())
S = input().rstrip()
Q = int(input())
qs = [input().split() for i in range(Q)]
def ctoi(c):
return ord(c) - ord('a')
class BinaryIndexedTree:
def __init__(self,size):
self.N = size
self.bit = [0]*(size+1)
def add(self,x,w... | import sys
input = sys.stdin.readline
N = int(input())
S = input().rstrip()
Q = int(input())
qs = [input().split() for i in range(Q)]
def ctoi(c):
return ord(c) - ord('a')
class BinaryIndexedTree:
def __init__(self,size):
self.N = size
self.bit = [0]*(size+1)
def add(self,x,w... | p02763 |
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return list(map(int,input().split()))
def onem(): #Nとかの取得
return int(eval(input()))
def s(x): ... | import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return list(map(int,input().split()))
def onem(): #Nとかの取得
return int(eval(input()))
def s(x): ... | p02763 |
import sys
# input = sys.stdin.buffer.readline
def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getlist():
return list(map(int, input().split()))
import math
import heapq
import bisect
from collections import defaultdict, Counter, deque
MOD = 10**9 + ... | import sys
from collections import defaultdict, deque, Counter
import math
# import copy
from bisect import bisect_left, bisect_right
# import heapq
# sys.setrecursionlimit(1000000)
# input aliases
input = sys.stdin.readline
getS = lambda: input().strip()
getN = lambda: int(eval(input()))
getList... | p02763 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
S = ['$'] + list(input().rstrip())
c = lambda x: ord(x) - ord('a')
bit = [BinaryIndexedTree(N) for _ in range(26)]
for i, l in enumerate(S):
if i == 0: continue
bit[c(l)].add(i, 1)
Q = int(eval... | class SegmentTree:
def __init__(self, initial_values, f=max, zero=0, converter=lambda x:x):
self.__f, self.__z, self.__c, self.__size = f, zero, converter, len(initial_values)
self.__n = 1 << ((self.__size - 1).bit_length())
self.__dat = [zero] * (2 * self.__n)
zi = self.__get_l... | p02763 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
N,S,Q,*q = read().decode().split()
N = int(N)
S = list(S)
c = lambda x: ord(x) - ord('a')
tree = [SegmentTree(N, lambda x,y:x|y) for _ in range(26)]
for i, ... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
N,S,Q,*q = read().split()
S = S.decode()
tree = SegmentTree(initial_values=S, f=lambda x,y:x|y, converter=lambda c: 1 << (ord(c)-ord('a')))
for t, a, b in zip(*[iter(... | p02763 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
fr... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
fr... | p02763 |
import sys
input = sys.stdin.readline
class SegmentTree:
def __init__(self, N, X):
self.N = N
self.func = lambda x, y: x | y
self.__build(X)
def __build(self, X):
# Initialize all nodes
self.node = [set() for _ in range(2 * self.N)]
# Elementar... | import sys
from operator import or_
input = sys.stdin.readline
class SegmentTree:
def __init__(self, N, X):
self.N = N
self.func = or_
self.__build(X)
def __build(self, X):
# Initialize all nodes
self.node = [set() for _ in range(2 * self.N)]
... | p02763 |
import sys
from operator import or_
input = sys.stdin.readline
class SegmentTree:
def __init__(self, N, X):
self.N = N
self.func = or_
self.__build(X)
def __build(self, X):
# Initialize all nodes
self.node = [set() for _ in range(2 * self.N)]
... | import sys
input = sys.stdin.readline
class SegmentTree:
def __init__(self, N, X):
self.N = N
self.func = lambda x, y: x | y
self.__build(X)
def __build(self, X):
# Initialize all nodes
self.node = [set() for _ in range(2 * self.N)]
# Elementar... | p02763 |
# どの文字を持っているかを二進数で1000101010...と表す
# or で足していく
class SegmentTree:
arr=None
tree=None
n=0
# 結果に影響を与えないdefault value
DEF=0
def __init__(self,arr):
# print("arr",arr)
self.arr=arr
size=len(arr)
# n階層目は2**(n-1)要素
self.n=1
while self.n<size:
self.n*=2
self.tree=... | # どの文字を持っているかを二進数で1000101010...と表す
# or で足していく
class SegmentTree:
arr=None
tree=None
n=0
# 結果に影響を与えないdefault value
DEF=0
def __init__(self,arr):
self.arr=arr
size=len(arr)
# n階層目は2**(n-1)要素
self.n=1
while self.n<size:
self.n*=2
self.tree=[self.DEF]*(2*self.n-1)... | p02763 |
import sys
input = sys.stdin.readline
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
if i == 0:
return 0
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
... | import sys
input = sys.stdin.readline
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
if i == 0:
return 0
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
... | p02763 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
class BIT:
def __init__(self, n):
self.n = n
self.data = [0] * (n + 1)
def add(self, i, x=1):
i += 1
w... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
class BIT:
def __init__(self, n):
self.n = n
self.data = [0] * (n + 1)
def add(self, i, x=1):
i += 1
w... | p02763 |
class BinaryIndexTree: # 1-indexed
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
... | class BinaryIndexTree: # 1-indexed
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
... | p02763 |
import sys
N = int(eval(input()))
scores = [0]*(N*100+1)
scores[0] = 1
for _ in range(N):
a = int(eval(input()))
for i in reversed(list(range(len(scores)))):
if scores[i]>0 and 0<i+a<=N*100:
scores[i+a] += 1
for i in reversed(list(range(len(scores)))):
if scores... | N = int(eval(input()))
a = list(int(eval(input())) for _ in range(N))
a.sort()
ans = sum(a)
if ans%10 > 0:
print(ans)
exit()
for ai in a:
if ai%10 > 0:
print((ans - ai))
break
else:
print((0))
| p03699 |
N = int(eval(input()))
s = []
sum = 0
min_nonten = 999
all_ten = True
for i in range(N):
s.append(int(eval(input())))
sum += s[i]
if(s[i] % 10 != 0):
all_ten = False
if(min_nonten > s[i]):
min_nonten = s[i]
if(sum % 10 != 0):
print(sum)
elif(all_ten):
... | n=int(eval(input()))
s=[]
for i in range(n):
s.append(int(eval(input())))
if(sum(s)%10!=0):
print((sum(s)))
else:
s.sort()
for i in range(n):
if(s[i]%10!=0):
print((sum(s)-s[i]))
break
else:
print((0))
| p03699 |
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
dp = [[] for _ in range(n+1)]
for i in range(n+1):
dp[i] += [-1 for _ in range(10010)]
dp[0][0] = 1
for i in range(n):
for j in range(10010):
if dp[i][j] == 1:
dp[i+1][j] = 1
dp[i+1][j+a[i]] = 1
ans = 0
... | n = int(eval(input()))
ary = [int(eval(input())) for _ in range(n)]
total = sum(ary)
ans = 0
if total % 10 != 0:
print(total)
exit()
for i in ary:
a = total - i
if a % 10 != 0:
ans = max(ans,a)
print(ans) | p03699 |
import itertools as it
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
ans = [0]
for i in range(1,n+1) :
sa = list(it.combinations(s,i))
for j in range(len(sa)) :
if sum(sa[j])%10 != 0 :
ans.append(sum(sa[j]))
print((max(ans))) | n = int(eval(input()))
sum = 0
s = []
for i in range(n) :
x = int(eval(input()))
sum += x
if x%10 != 0 :
s.append(x)
if sum %10 != 0 :
print(sum)
exit()
while len(s)>0 :
m = min(s)
sum -= m
if sum%10 != 0 :
print(sum)
exit()
print((0)) | p03699 |
N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
def sol(i, cur):
if i == -1:
return cur
else:
tmp1 = sol(i-1, cur+a[i])
tmp1 = tmp1 if tmp1 % 10 else 0
tmp2 = sol(i-1, cur)
tmp2 = tmp2 if tmp2 % 10 else 0
return max(tmp1, tmp2)
print(... | N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
ans = sum(a)
if ans % 10 == 0:
if all([i % 10 == 0 for i in a]):
print((0))
else:
ans -= min([i for i in a if i % 10 != 0])
print(ans)
else:
print(ans) | p03699 |
from itertools import chain, combinations
def powerset(iterable):
s = list(iterable)
return chain.from_iterable(combinations(s, r) for r in range(len(s)+1))
N = int(eval(input()))
s = [int(eval(input())) for i in range(N)]
list1 = list([x for x in map(sum,powerset(s)) if x % 10])
list1.append(0)
print... | N = int(eval(input()))
s = [int(eval(input())) for i in range(N)]
sums = sum(s)
others = list([x for x in s if x % 10])
if sums % 10:
print(sums)
elif others != []:
print((sums-min(others)))
else:
print((0)) | p03699 |
def main():
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
s_sum = []
def dfs(i, sum):
if i == n:
s_sum.append(sum)
else:
dfs(i + 1, sum + s[i])
dfs(i + 1, sum)
dfs(0, 0)
s_sum_c = [s for s in s_sum if s % 10 != 0]... | def main():
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
s_sum = sum(s)
s = [i for i in s if i % 10 != 0]
s.sort()
if s_sum % 10 != 0:
print(s_sum)
exit()
for es in s:
if (s_sum - es) % 10 != 0:
print((s_sum - es))
... | p03699 |
n = int(eval(input()))
dat_s = []
for i in range(n):
dat_s.append(int(eval(input())))
total = sum(dat_s)
f = True
if total % 10 != 0:
print(total)
f = False
else:
dat_s.sort()
for i in range(len(dat_s)):
if dat_s[i] % 10 != 0:
print((total - dat_s[i]))
... | n = int(eval(input()))
dat_s = []
for i in range(n):
dat_s.append(int(eval(input())))
# 0個選択したときのスコア(重複は意味がないのでset)
scores = set([0])
# 1～n問まで回す
for i in range(n):
# ここまでで可能性のあるスコアをbufferにいれて
b = set(scores)
while len(b) != 0:
# いまのn問目のスコアをこのスコアに足していく
scores.add(dat_s[i] ... | p03699 |
import itertools
import sys
N=int(eval(input()))
S=[int(eval(input())) for _ in range(N)]
ans=0
if sum(S)%10!=0:
print((sum(S)))
sys.exit()
i=N-1
while True:
if ans!=0 or i==0:
break
for j in itertools.combinations(S,i):
s=sum(j)
if s%10!=0:
ans=max(ans,s)
i-=1
print... | import sys
N=int(eval(input()))
S=[int(eval(input())) for _ in range(N)]
S.sort()
ans=sum(S)
if ans%10!=0:
print(ans)
sys.exit()
else:
for i in range(N):
if S[i]%10!=0:
print((ans-S[i]))
sys.exit()
else:
print((0)) | p03699 |
N=int(eval(input()))
item = [int(eval(input())) for i in range(N)]
ans=0
for i in range(2 ** N):
out = 0
for j in range(N): # このループが一番のポイント
if (i >> j) & 1: # 順に右にシフトさせ最下位bitのチェックを行う
out+=item[j] # フラグが立っていたら 加算する
if str(out)[-1]=='0':
out = 0
ans=max(ans,out)
p... | N=int(eval(input()))
items = [int(eval(input())) for i in range(N)]
tot=sum(items)
ans=0
if tot%10!=0:
ans=tot
else:
items.sort()
for i in range(N):
if items[i]%10!=0:
ans=tot-items[i]
break
print(ans) | p03699 |
_,*l=list(map(int,open(0).read().split()));s=sum(l)
print((0 if all(i%10<1 for i in l) else s-min(i for i in l if i%10)*(s%10<1))) | _,*l=list(map(int,open(0)));s=sum(l)
print((0 if all(i%10<1 for i in l) else s-min(i for i in l if i%10)*(s%10<1))) | p03699 |
n=int(eval(input()))
li=[]
for i in range(n):
li.append(int(eval(input())))
pl=[0]
for i in range(2**n):
point=0
for j in range(n):
if ((i>>j)&1):
point+=li[j]
if point%10!=0:
pl.append(point)
pl.sort(reverse=True)
for i in pl:
if i%10!=0:
print(i)
break
else:
print((... | n=int(eval(input()))
li=[]
for i in range(n):
li.append(int(eval(input())))
out=sum(li)
if out%10!=0:
print(out)
else:
li.sort()
for i in li:
if i%10!=0:
print((out-i))
break
else:
print((0)) | p03699 |
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
sum = [0]
for i in range(n):
temp = []
for x in sum:
temp.append(x)
temp.append(x+s[i])
sum = temp[::]
dp = [i for i in sum if i % 10 != 0]
print((max(dp) if dp != [] else '0')) | n = int(eval(input()))
s = sorted([int(eval(input())) for _ in range(n)])
if sum(s) % 10 != 0:
print((sum(s)))
quit()
else:
for i in s:
if i % 10 != 0:
s.remove(i)
print((sum(s)))
quit()
print('0') | p03699 |
N = int(eval(input()))
s = [int(eval(input())) for _ in range(N)]
ans = 0
for i in range(2**N):
correct = []
su = 0
for j in range(N):
if ((i >> j) & 1):
su += s[j]
if su % 10 == 0:
su = 0
ans = max(ans,su)
print(ans)
| N = int(eval(input()))
s = [int(eval(input())) for _ in range(N)]
s.sort()
ans = sum(s)
if ans % 10 != 0:
print(ans)
else:
for i in range(N):
if s[i] % 10 != 0:
print((ans - s[i]))
exit()
print((0))
| p03699 |
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
# bit全探索
s_max = 0
for bit in range(1<<n):
s_tmp = 0
for i in range(n):
if bit >> i & 1:
s_tmp += s[i]
if s_tmp % 10 == 0:
s_tmp = 0
s_max = max(s_max, s_tmp)
print(s_max) | n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
s.sort()
s_max = sum(s)
if s_max % 10 != 0:
print(s_max)
exit()
else:
for i in s:
if i % 10 != 0:
print((s_max - i))
exit()
print((0)) | p03699 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.