input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# def to_2(num):
# ret = []
# while (num != 0):
# if num % 2 == 1:
# ret.append(True)
# else:
# ret.append(False)
# num = num // 2
# return np.array(ret)
# def()
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# 全探索... | # https://atcoder.jp/contests/dwacon5th-prelims/tasks/dwacon5th_prelims_b
# 解説見てしまった
# N≤1000の性質をうまく使う必要はない。O(N^2)で全部書き出せばいい。完全に引っ掛け。
# 答えの仮定、bitごとに見る、上位桁からのgreedyらへんがキーワード
from itertools import combinations
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = [sum(A[s:t]) for s, t in... | p03215 |
import itertools
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = [a[0]]
for i in range(n-1):
b.append(b[i]+a[i+1])
c1 = list(itertools.combinations(list(range(n)),2))
s = a
for i in c1:
s.append(b[i[1]]-b[i[0]]+a[i[0]])
c2 = list(itertools.combinations(list(range(len(s))),k... | import itertools
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = [a[0]]
for i in range(n-1):
b.append(b[i]+a[i+1])
c = list(itertools.combinations(list(range(n)),2))
s = a
for i in c:
s.append(b[i[1]]-b[i[0]]+a[i[0]])
s.sort(reverse=True)
l = len(bin(s[0]))-2
d = 1<<l-1
... | p03215 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = [a[0]]
for i in range(n-1):
b.append(b[i]+a[i+1])
s = b
for i in range(n-1):
for j in range(i,n-1):
s.append(b[j+1]-b[i])
s.sort(reverse=True)
l = len(bin(s[0]))-2
d = 1<<l-1
t = 0
while d>0:
s1 = []
if s[... | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = [a[0]]
for i in range(n-1):
b.append(b[i]+a[i+1])
s = b
for i in range(n-1):
for j in range(i,n-1):
s.append(b[j+1]-b[i])
s.sort(reverse=True)
l = len(bin(s[0]))-2
d = 1<<l-1
t = 0
while d>0:
s1 = []
if s[... | p03215 |
N,K=list(map(int,input().split()))
alist=list(map(int,input().split()))
sum_list=[]
for i in range(N):
s=0
for j in range(i,N):
s+=alist[j]
sum_list.append(s)
sum_list.sort(reverse=True)
#print(sum_list)
answer=0
for i in reversed(list(range(41))):
x=2**i
cnt=0
for s in sum_lis... | N,K=list(map(int,input().split()))
alist=list(map(int,input().split()))
sum_list=[]
for i in range(N):
s=0
for j in range(i,N):
s+=alist[j]
sum_list.append(s)
sum_list.sort(reverse=True)
#print(sum_list)
answer=0
for i in reversed(list(range(41))):
x=2**i
cnt=0
for s in sum_lis... | p03215 |
from itertools import accumulate, combinations
n, k = list(map(int, input().split()))
a = [0] + list(accumulate(list(map(int, input().split()))))
btfl =[]
for i in range(0, n):
for j in range(i + 1, n + 1):
btfl.append(a[j] - a[i])
ans = 0
for l in combinations(btfl, k):
cnt = l[0]
f... | from itertools import accumulate
n, k = list(map(int, input().split()))
a = [0] + list(accumulate(list(map(int, input().split()))))
btfl = []
for i in range(0, n):
for j in range(i + 1, n + 1):
btfl.append(a[j] - a[i])
# 解説AC
ans = 0
for i in range(50)[::-1]:
num, cnt = ans + pow(2, i), 0
... | p03215 |
from itertools import accumulate
def main():
n, k = list(map(int, input().split()))
a = [0] + list(accumulate(list(map(int, input().split()))))
btfl = []
for i in range(0, n):
for j in range(i + 1, n + 1):
btfl.append(a[j] - a[i])
# 解説AC
ans = 0
for i in r... | from itertools import accumulate
n, k = list(map(int, input().split()))
a = [0] + list(accumulate(list(map(int, input().split()))))
btfl = []
for i in range(0, n):
for j in range(i + 1, n + 1):
btfl.append(a[j] - a[i])
# 解説AC
ans = 0
for i in range(50)[::-1]:
num, cnt = ans + pow(2, i), 0
... | p03215 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=[]
for i in range(n):
x=0
for j in range(i,n):
x+=a[j]
b.append(x)
ans=0
l=len(b)
for i in range(40,0,-1):
x=0
s=2**i
for j in range(l):
if b[j]&(ans+s)==ans+s:x+=1
if x>=k:ans+=s
print(ans) | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=[]
for i in range(n):
x=0
for j in range(i,n):
x+=a[j]
b.append(x)
ans=0
l=len(b)
for i in range(40,-1,-1):
x=0
s=2**i
for j in range(l):
if b[j]&(ans+s)==ans+s:x+=1
if x>=k:ans+=s
print(ans) | p03215 |
def main():
N, K = list(map(int, input().split()))
A = [0] + list(map(int, input().split()))
for i in range(N):
A[i + 1] += A[i]
B = [A[j] - A[i] for i in range(N) for j in range(i + 1, N + 1)]
ans = 0
t = 40
tmp = pow(2, t)
while t:
count = 0
tmp... | def main():
N, K = list(map(int, input().split()))
A = [0] + list(map(int, input().split()))
for i in range(N):
A[i + 1] += A[i]
B = [A[j] - A[i] for i in range(N) for j in range(i + 1, N + 1)]
ans = 0
tmp = pow(2, 40)
for _ in range(40):
count = 0
tmp... | p03215 |
#横にn個入力
n, k = list(map(int, input().split()))
a = input().split()
a = [int(m) for m in a]
nli = []
b = 0
for i in range(n):
for j in range(i, n):
b += a[j]
nli.append(b)
b = 0
nli.sort(reverse=True)
m = 40
x = 0
cnt = 0
candili = []
for i in range(m - 1, 0, -1):
if x == 0... | #横にn個入力
n, k = list(map(int, input().split()))
a = input().split()
a = [int(m) for m in a]
nli = []
b = 0
for i in range(n):
for j in range(i, n):
b += a[j]
nli.append(b)
b = 0
nli.sort(reverse=True)
m = 41
x = 0
cnt = 0
candili = []
for i in range(m - 1, -1, -1):
if x == ... | p03215 |
import itertools as tool
N, K = list(map(int, input().split()))
a = [int(x) for x in input().split()]
beautifuls = []
for i in range(0, len(a)):
for j in range(i+1, len(a)+1):
beautiful = sum(a[i:j])
beautifuls.append(beautiful)
beau_K = list(tool.combinations(beautifuls, K))
ands = [... |
N, K = list(map(int, input().split()))
a = [int(x) for x in input().split()]
beautifuls = []
for i in range(0, len(a)):
for j in range(i+1, len(a)+1):
beautiful = sum(a[i:j])
beautifuls.append(beautiful)
x_ = 0
t = 1
count = 0
while 1:
for i in range(len(beautifuls)):
i... | p03215 |
from itertools import accumulate
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
accAs = [0] + list(accumulate(As))
Bs = []
for L in range(N):
for R in range(L, N):
Bs.append(accAs[R + 1] - accAs[L])
ans = 0
for d in reversed(list(range(50))):
num = sum([(B ... | from itertools import accumulate
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
accAs = [0] + list(accumulate(As))
Bs = []
for L in range(N):
for R in range(L, N):
Bs.append(accAs[R + 1] - accAs[L])
ans = 0
for d in reversed(list(range(40))):
num = sum([(B ... | p03215 |
ma = lambda :map(int,input().split())
lma = lambda :list(map(int,input().split()))
tma = lambda :tuple(map(int,input().split()))
ni = lambda:int(input())
yn = lambda fl:print("Yes") if fl else print("No")
import collections
import math
import itertools
import heapq as hq
n,k = ma()
A = lma()
bu = []
for i... | ma = lambda :list(map(int,input().split()))
lma = lambda :list(map(int,input().split()))
n,k = ma()
A = lma()
bu = []
for i in range(n):
tmp=0
for j in range(i,n):
tmp+=A[j]
bu.append(tmp)
mb = bin(max(bu))
ans = 0
for i in range(len(mb)-3,-1,-1):
tmp=[]
for b in bu:
... | p03215 |
def cumsum(l):
c = [0] * len(l)
for i in range(len(l)):
c[i] = c[i-1] + l[i]
return c
N, K = list(map(int, input().split()))
a = [int(i) for i in input().split()]
c = [0] + cumsum(a)
s = [bin(c[j+i] - c[j]).replace('0b','').zfill(40) for i in range(1, N+1) for j in range(N-i+1)]
ans =... | def cumsum(l):
c = [0] * len(l)
for i in range(len(l)):
c[i] = c[i-1] + l[i]
return c
N, K = list(map(int, input().split()))
a = [int(i) for i in input().split()]
c = [0] + cumsum(a)
s = [bin(c[j+i] - c[j]).replace('0b','').zfill(40) for i in range(1, N+1) for j in range(N-i+1)]
ans =... | p03215 |
import sys
from itertools import accumulate
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
R = [0] + list(accumulate(A))
subs = []
for left i... | import sys
from itertools import accumulate
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
R = [0] + list(accumulate(A))
subs = []
for left i... | p03215 |
# -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
###... | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
###... | p03215 |
n, k = list(map(int, input().split()))
As = list(map(int, input().split()))
from itertools import accumulate
acc = [0]+list(accumulate(As))
dp = [0] * 50
mx = 0
sums = []
for i in range(n+1):
for j in range(i+1,n+1):
s = acc[j]-acc[i]
sums.append(s)
# 最大の桁数
for d in range(50):
i... | n, k = list(map(int, input().split()))
As = list(map(int, input().split()))
from itertools import accumulate
acc = [0]+list(accumulate(As))
dp = [0] * 50
mx = 0
sums = []
for i in range(n+1):
for j in range(i+1,n+1):
s = acc[j]-acc[i]
sums.append(s)
# 最大の桁数
for d in range(50):
i... | p03215 |
def b_len(v):
return len(bin(v)[2:])
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
cs = [0]
for aa in a:
cs.append(cs[-1] + aa)
ps = []
for i in range(1, n + 1):
for j in range(i):
ps.append(cs[i] - cs[j])
ps = sorted(ps, reverse=True)
pw = b_len(... | from math import log, ceil
n, k = list(map(int, input().split()))
a = tuple(map(int, input().split()))
A_MAX = 10 ** 9
MAX_BIT_LENGTH = ceil(log(A_MAX * n, 2))
cs = [0]
t = 0
for aa in a:
t += aa
cs.append(t)
ps = []
for r in range(1, n + 1):
for l in range(r):
ps.append(cs[r] -... | p03215 |
import sys
import collections
import itertools
import math
import re
from collections import Counter
from collections import deque
from collections import defaultdict
MOD = 10 ** 9 + 7
N,K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
C = []
s = 0
ma = 0
for i in range(... | import sys
N,K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
C = []
for i in range(0,N-1):
for j in range(i, N):
if j==i:
C.append(A[i])
else:
C.append(C[-1] + A[j])
D = C
ans = 0
for i in range(40,-1,-1):
yes = []
no ... | p03215 |
import sys
import collections
from collections import Counter
# from collections import deque
# from collections import defaultdict
import itertools
# from itertools import accumulate
# from itertools import permutations
# from itertools import combinations
# from itertools import takewhile
from itertools imp... | import sys
import collections
from collections import Counter
# from collections import deque
# from collections import defaultdict
import itertools
# from itertools import accumulate
# from itertools import permutations
# from itertools import combinations
# from itertools import takewhile
from itertools imp... | p03215 |
from copy import deepcopy
from collections import deque
N, K = list(map(int, input().split()))
A = [int(a) for a in input().split()]
Sum = deque([0])
for i in range(N):
Sum.append(Sum[-1] + A[i])
Asum = deque([])
for i in range(N):
for j in range(i+1, N+1):
Asum.append(Sum[j] - Sum[i])
Sear... | import sys
sys.setrecursionlimit(1000000)
def search(i, L, Lnum, K):
if i > 40: return 0
add = pow(2, 40 - i)
nextK = []
count = 0
for l in L:
if l & add == add:
nextK.append(l)
count += 1
#print(i, L)
if count >= K: return add + search(i+1, next... | p03215 |
import copy
N, K = list(map(int,input().split()))
a = list(map(int,input().split()))
S = [0]*N
S[0] = a[0]
for k in range(1,N):
S[k] = S[k-1] + a[k]
S = [0] + S
T = []
for k in range(N):
for l in range(k+1,N+1):
T.append(S[l]-S[k])
ans = 0
for d in range(41,-1,-1):
c = 0
for e in ... | N, K = list(map(int,input().split()))
a = list(map(int,input().split()))
S = [0]*N
S[0] = a[0]
for k in range(1,N):
S[k] = S[k-1] + a[k]
S = [0] + S
T = []
for k in range(N):
for l in range(k+1,N+1):
T.append(S[l]-S[k])
ans = 0
for d in range(41,-1,-1):
c = 0
for e in T:
i... | p03215 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.r... | p03215 |
import sys
from collections import *
import heapq
import math
# from math import gcd
import bisect
import copy
from itertools import permutations,accumulate,combinations,product
# def input():
# return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
mod=pow(10,9)+7
al=[... | import sys
from collections import *
import heapq
import math
# from math import gcd
import bisect
import copy
from itertools import permutations,accumulate,combinations,product
def input():
return sys.stdin.readline()
def ruiseki(lst):
return [0]+list(accumulate(lst))
mod=pow(10,9)+7
al=[chr(ord('... | p03215 |
from itertools import accumulate as ac
from functools import reduce
n,k=list(map(int,input().split()))
*ac,=ac([0]+list(map(int,input().split())))
l=[ac[j]-ac[i] for i in range(n+1) for j in range(i+1,n+1)]
count_bits=lambda n:sum([x&n==n for x in l])
ans=0
for i in range(41)[::-1]:
if count_bits(ans|... | from itertools import accumulate as ac
n,k=list(map(int,input().split()))
*a,=ac([0]+list(map(int,input().split())))
l=[a[j]-a[i] for i in range(n+1) for j in range(i+1,n+1)]
f=lambda n:sum([x&n==n for x in l])
ans=0
for i in range(41)[::-1]:
if f(ans|1<<i)>=k:
ans|=1<<i
print(ans) | p03215 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
stand_bit = [set() for i in range(64)]
acc = [0 for i in range(n+1)]
acc[0] = 0
for i in range(1, n+1):
acc[i] += a[i-1] + acc[i-1]
set_ans = set()
for i in range(n):
for j in range(i, n):
set_ans.add(acc[j+1] - acc[i])... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
stand_bit = [set() for i in range(64)]
acc = [0 for i in range(n+1)]
acc[0] = 0
for i in range(1, n+1):
acc[i] += a[i-1] + acc[i-1]
set_ans = set()
for i in range(n):
for j in range(i, n):
set_ans.add(acc[j+1] - acc[i])... | p03215 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
stand_bit = [set() for i in range(64)]
acc = [0 for i in range(n+1)]
acc[0] = 0
for i in range(1, n+1):
acc[i] += a[i-1] + acc[i-1]
set_ans = set()
for i in range(n):
for j in range(i, n):
set_ans.add(acc[j+1] - acc[i])... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
stand_bit = [set() for i in range(42)]
acc = [0 for i in range(n+1)]
acc[0] = 0
for i in range(1, n+1):
acc[i] += a[i-1] + acc[i-1]
set_ans = set()
for i in range(n):
for j in range(i, n):
set_ans.add(acc[j+1] - acc[i])... | p03215 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
stand_bit = [set() for i in range(42)]
acc = [0 for i in range(n+1)]
acc[0] = 0
for i in range(1, n+1):
acc[i] += a[i-1] + acc[i-1]
set_ans = set()
for i in range(n):
for j in range(i, n):
set_ans.add(acc[j+1] - acc[i])... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
stand_bit = [set() for i in range(42)]
acc = [0 for i in range(n+1)]
for i in range(1, n+1):
acc[i] += a[i-1] + acc[i-1]
set_ans = set()
for i in range(n):
for j in range(i, n):
tmp = acc[j+1] - acc[i]
set_ans.a... | p03215 |
import sys,queue,math,copy,itertools,bisect,collections,heapq
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N,K = LI()
A = LI()
sa... | import sys,queue,math,copy,itertools,bisect,collections,heapq
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
N,K = LI()
A = LI()
sa = list(itertools.accumulate([0]+A))
b = []
for i in range(N):
for j in range(i+1,N+1):
b.append(sa[j]-sa[i])
#b.sort(reverse=True)
max_b = max(b).bi... | p03215 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
cums = [0]
for a in A:
cums.append(cums[-1] + a)
vs = []
for l in range(N):
for r in range(l+1,N+1):
vs.append(cums[r] - cums[l])
vs.sort(reverse=True)
for i in range(100,-1,-1):
tmps = []
for v in vs:
... | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = []
for i,a in enumerate(A):
k = 0
for c in A[i:]:
k += c
B.append(k)
ans = 0
for i in range(40,-1,-1):
C = []
for b in B:
if b&(1<<i):
C.append(b)
if len(C) >= K:
... | p03215 |
from itertools import accumulate, combinations
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
sum_A = sum(A)
B = [0] + list(accumulate(A))
cand = []
for i in range(N+1):
for j in range(i+1,N+1):
cand.append(B[j] - B[i])
... | from itertools import accumulate
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
sum_A = sum(A)
B = [0] + list(accumulate(A))
cand = []
for i in range(N+1):
for j in range(i+1,N+1):
cand.append(B[j] - B[i])
ans = 0
f... | p03215 |
import itertools
nk = input().split()
seisuuretu = input().split()
for i in range(len(seisuuretu)):
seisuuretu[i] = int(seisuuretu[i])
all_seisuuretu = []
for start in range(len(seisuuretu) + 1):
for end in range(len(seisuuretu) + 1):
if start < end:
all_seisuuretu.append(se... | nk = input().split()
seisuuretu = input().split()
for i in range(len(seisuuretu)):
seisuuretu[i] = int(seisuuretu[i])
all_seisuuretu = []
for start in range(len(seisuuretu) + 1):
for end in range(len(seisuuretu) + 1):
if start < end:
all_seisuuretu.append(seisuuretu[start:end])... | p03215 |
# -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
N, K = inpl()
A = inpl()
tmp = 0
S = [0]*N
Q = []
for i in range(N):
tmp += A[i]
S[i] = tmp
Q.append(tmp)
tmp = 0
for i in range(1, N):
tmp = S[i-1]
for j in range(i, N):
#print(i, j)
v = S... | # -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
N, K = inpl()
A = inpl()
tmp = 0
S = [0]*N
Q = []
for i in range(N):
tmp += A[i]
S[i] = tmp
Q.append(tmp)
tmp = 0
for i in range(1, N):
tmp = S[i-1]
for j in range(i, N):
#print(i, j)
v = S... | p03215 |
from collections import defaultdict
from itertools import accumulate
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
Acum = [0]
Acum.extend(accumulate(A))
cnt = defaultdict(int)
for i in range(n):
for j in range(i+1, n+1):
beauty = Acum[j]-Acum[i]
cnt[beauty] += ... | from collections import defaultdict
from itertools import accumulate
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
Acum = [0]
Acum.extend(accumulate(A))
cnt = defaultdict(int)
for i in range(n):
for j in range(i+1, n+1):
beauty = Acum[j]-Acum[i]
cnt[beauty] +... | p03215 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ruiseki = [0] * (n + 1)
for i in range(n):
ruiseki[i+1] = ruiseki[i] + a[i]
li = []
for i in range(n):
for j in range(i, n):
tmp = format(ruiseki[j + 1] - ruiseki[i], '040b')
li.append(tmp)
for i in range(... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
li = []
for i in range(n):
num = 0
for j in range(i, n):
num += a[j]
li.append(num)
ans = 0
for i in range(40)[::-1]:
bit = 2 ** i
new_li = [num for num in li if num&bit != 0]
if len(new_li) ... | p03215 |
from itertools import accumulate
from itertools import combinations
N, K = [int(x) for x in input().strip().split(" ")]
As = [0] + [int(x) for x in input().strip().split(" ")]
aAs = list(accumulate(As))
keta = 41
d = [set() for _ in range(41)]
for i, j in combinations(list(range(N)), 2):
rr = aAs[j ... | N, K = list(map(int, input().split()))
from itertools import accumulate
As = [0] + list(map(int, input().split()))
As = list(accumulate(As))
L = len(bin(As[-1]))-2
xs = []
for i in range(N+1):
for j in range(i+1, N+1):
xs.append(As[j] - As[i])
xs.sort()
ts = set(range(N*(N+1)//2))
for j in range(... | p03215 |
p = int(eval(input()))
def div(a, b):
n = len(a)
m = len(b)
res = [0] * (n - m + 1)
tmp = pow(b[-1], p - 2, p)
for i in range(n - m, -1, -1):
t = a[i + m - 1] * tmp % p
res[i] = t
for j in range(m):
a[i + j] = (a[i + j] - t * b[j]) % p
return re... | p = int(eval(input()))
def div(a, b):
n = len(a)
m = len(b)
res = [0] * (n - m + 1)
tmp = pow(b[-1], p - 2, p)
for i in range(n - m, -1, -1):
t = a[i + m - 1] * tmp % p
res[i] = t
for j in range(m):
a[i + j] = (a[i + j] - t * b[j]) % p
return re... | p02950 |
p = eval(input())
a = list(map(int, input().strip().split()))
b = [0] * p
p2 = p * p
s = []
for i in range(p):
if a[i]: s.append(i)
ncr = [[0 for i in range(p)] for j in range(p)]
for i in range(p):
ncr[i][0] = ncr[i][i] = 1
ncr[i][1] = i
for n in range(2, p):
for r in range(2, n):... | p = eval(input())
a = list(map(int, input().strip().split()))
b = [0] * p
p2 = p * p
s = []
for i in range(p):
if a[i]: s.append(i)
ncr = [[0 for i in range(p)] for j in range(p)]
for i in range(p):
ncr[i][0] = ncr[i][i] = 1
ncr[i][1] = i
for n in range(2, p):
for r in range(2, n):... | p02950 |
#import sys
#input = sys.stdin.readline
def getInv(N,Q):
inv = [0] * (N + 1)
inv[1] = 1
for i in range(2, N + 1):
inv[i] = (-(Q // i) * inv[Q % i]) % Q
return inv
def getCmb(N,Q):
inv = getInv(N,Q)
nCr = [1] * (N + 1)
for i in range(1, N + 1):
nCr[i] = (nCr[i - ... | #import sys
#input = sys.stdin.readline
def getInv(N,Q):
inv = [0] * (N + 1)
inv[1] = 1
for i in range(2, N + 1):
inv[i] = (-(Q // i) * inv[Q % i]) % Q
return inv
def getCmb(N,Q):
inv = getInv(N,Q)
nCr = [1] * (N + 1)
for i in range(1, N + 1):
nCr[i] = (nCr[i - ... | p02950 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
p = int(eval(input()))
a = [int(i) for i in input().split()]
ret = [0] * p
fac = [1]
inv = [1]
power = [0] * p
for i in range(1, p) :
fac.append(fac[-1] * i % p)
inv.append(pow(fac[-1], p - 2, p))
for i in range(p) :
if ... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
p = int(eval(input()))
a = [int(i) for i in input().split()]
ret = [0] * p
fac = [1]
inv = [1]
for i in range(1, p) :
fac.append(fac[-1] * i % p)
inv.append(pow(fac[-1], p - 2, p))
for i in range(p) :
if a[i] == 0 :
... | p02950 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
p = int(eval(input()))
a = list(map(int, input().split()))
### 素数の逆元とCombination
M = p
N = 10**4 # 必要なテーブルサイズ
g1 = [None] * (N+1) # 元テーブル
g2 = [None] * (N+1) #... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
p = int(eval(input()))
a = list(map(int, input().split()))
### 素数の逆元とCombination
M = p
N = 10**4 # 必要なテーブルサイズ
g1 = [None] * (N+1) # 元テーブル
g2 = [None] * (N+1) #... | p02950 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
p = int(eval(input()))
a = list(map(int, input().split()))
### 素数の逆元とCombination
M = p
N = 10**4 # 必要なテーブルサイズ
g1 = [None] * (N+1) # 元テーブル
g2 = [None] * (N+1) #... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
p = int(eval(input()))
a = list(map(int, input().split()))
### 素数の逆元とCombination
M = p
N = 10**4 # 必要なテーブルサイズ
g1 = [None] * (N+1) # 元テーブル
g2 = [None] * (N+1) #... | p02950 |
p = int(eval(input()))
a = list(map(int,input().split()))
lis = [0] * (p+1)
for i in range(p):
if i == 0:
lis[1] = 1
lis[0] = 0
else:
nlis = [0] * (p+1)
for j in range(p+1):
nlis[j] += lis[j] * (-1 * i)
if j != 0:
... |
p = int(eval(input()))
a = list(map(int,input().split()))
lis = [0] * (p+1)
for i in range(p):
if i == 0:
lis[1] = 1
lis[0] = 0
else:
nlis = [0] * (p+1)
for j in range(p+1):
nlis[j] += lis[j] * (-1 * i)
if j != 0:
... | p02950 |
#!/usr/bin/env python3
import sys
import functools
INF = float("inf")
def solve(p: int, a: "List[int]"):
N = p
MOD = p
fac = [0]*N
finv = [0]*N
inv = [0]*N
def cmb_init():
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
... | #!/usr/bin/env python3
import sys
import functools
INF = float("inf")
def solve(p: int, a: "List[int]"):
N = p+1
MOD = p
inv = [0]*N
inv[1] = 1
for i in range(2, N):
inv[i] = -inv[MOD % i]*(MOD//i) % MOD
b = [0]*p
for ai, av in enumerate(a):
if av == 0:
... | p02950 |
def f_polynomal_construction(P, A):
class Combination(object):
"""参考: https://harigami.net/contents?id=5f169f85-5707-4137-87a5-f0068749d9bb"""
__slots__ = ["mod", "factorial", "inverse"]
def __init__(self, max_n: int = 10**6, mod: int = 10**9 + 7):
fac, inv = [1], []
... | def f_polynomal_construction(P, A):
class Combination(object):
"""参考: https://harigami.net/contents?id=5f169f85-5707-4137-87a5-f0068749d9bb"""
__slots__ = ["mod", "factorial", "inverse"]
def __init__(self, max_n: int = 10**6, mod: int = 10**9 + 7):
fac, inv = [1], []
... | p02950 |
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return list(map(int,input().split()))
def lmp(): return list(map(int,inp... | a,b,c=list(map(int,input().split()))
print((b//c-(a-1)//c)) | p02606 |
l, r, d = list(map(int, input().split()))
print((r // d - -(-l // d) + 1))
|
L, R, d = list(map(int, input().split()))
print((R // d - (L - 1) // d))
| p02606 |
import sys
read = sys.stdin.read
from itertools import accumulate
def main():
l, r, d = list(map(int, input().split()))
res = 0
for i1 in range(l, r + 1):
res += i1 % d == 0
print(res)
if __name__ == '__main__':
main() | def main():
l, r, d = list(map(int, input().split()))
res = r // d - (l-1) // d
print(res)
if __name__ == '__main__':
main()
| p02606 |
from math import gcd
from math import factorial as f
from math import ceil, floor, sqrt
import math
import bisect
import re
import heapq
from copy import deepcopy
import itertools
from itertools import permutations
from sys import exit
ii = lambda: int(eval(input()))
mi = lambda: list(map(int, i... | l, r, d = list(map(int, input().split()))
cnt = 0
tmp = d
while tmp <= r:
if tmp <= r and tmp >= l:
cnt += 1
tmp += d
print(cnt) | p02606 |
l, r, d = list(map(int, input().split()))
cnt = 0
for i in range(l, r+1):
# print(i)
if i % d == 0:
cnt += 1
print(cnt)
| l, r, d = list(map(int, input().split()))
cnt = 0
for i in range(l, r+1):
if i % d == 0:
cnt += 1
print(cnt) | p02606 |
#!/usr/bin/env python3
l, r, d = list(map(int, input().split()))
print((r//d - (l-1)//d))
| #!/usr/bin/env pypy
l, r, d = list(map(int, input().split()))
print((r//d - (l-1)//d))
| p02606 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
l, r, d = list(map(int, input().split()))
n = (l-1) // d + 1
m = r // d
print((m-n+1)) | p02606 |
L,R,d = list(map(int,input().split()))
print((len([i for i in range(L,R+1) if i % d == 0]))) | L,R,d=list(map(int,input().split()));print((R//d-(L-1)//d)) | p02606 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
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, product, permutati... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
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, product, permutati... | p02606 |
L, R, d = list(map(int, input().split()))
result = 0
for i in range(L, R + 1):
if i % d == 0:
result += 1
print(result)
| L, R, d = list(map(int, input().split()))
print((R // d - (L - 1) // d))
| p02606 |
import sys
input = sys.stdin.readline
def main():
ans = 0
l,r,d = list(map(int, input().split()))
ans = (r//d) - (l//d)
if l%d == 0:
ans += 1
print(ans)
if __name__ == '__main__':
main() | l, r, d = list(map(int, input().split()))
print((r//d-(l-1)//d)) | p02606 |
# -*- coding: utf-8 -*-
# 標準入力を取得
L, R, d = list(map(int, input().split()))
# 求解処理
ans = R // d - (L - 1) // d
# 結果出力
print(ans)
| # -*- coding: utf-8 -*-
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力
"""
L, R, d = list(map(int, input().split()))
return L, R, d
def main(L: int, R: int, d: int) -> None:
"""
メイン処理.
Args:\n
L (int): 整数（1 <= L <= R <= 100）
... | p02606 |
l,r,d=list(map(int,input().split()))
cnt=0
for i in range(l,r+1):
for j in range(1,101):
if d*j==i:
cnt+=1
break
print(cnt)
| l, r, d = list(map(int, input().split()))
ans = r // d - (l - 1) // d
print(ans)
| p02606 |
l,r,d = list(map(int, input().split()))
ans = 0
while l <= r:
if l%d == 0:
ans += 1
l += 1
print(ans) | l,r,d = list(map(int, input().split()))
ans = r//d - (l-1)//d
print(ans) | p02606 |
import sys
input = sys.stdin.readline
l,r,d=list(map(int,input().split()))
ans = 0
for i in range(l,r+1):
if i%d==0:
ans+=1
print(ans)
| import sys
input = sys.stdin.readline
l,r,d=list(map(int,input().split()))
v1 = l//d
if l%d==0:
v1-=1
v2 = r//d
print((v2-v1))
| p02606 |
def main():
left, right, div = [int(x) for x in input().split()]
ans = sum(x % div == 0 for x in range(left, right + 1))
print(ans)
if __name__ == '__main__':
main()
| def main():
left, right, div = [int(x) for x in input().split()]
ans = right // div - (left - 1) // div
print(ans)
if __name__ == '__main__':
main()
| p02606 |
l, r, d = list(map(int, input().split()))
print((r//d - l//d + (l%d==0)))
| l, r, d = list(map(int, input().split()))
print((r//d - (l-1)//d))
| p02606 |
L,R,d=list(map(int, input().split()))
cnt=0
for i in range(L, R+1):
if i%d == 0: cnt+=1
print(cnt) | L,R,d=list(map(int, input().split()))
print((R//d-(L-1)//d)) | p02606 |
L, R, d = list(map(int, input().split()))
count = 0
for i in range(101):
if d * i >= L and d * i <= R:
count += 1
if d * i > R:
break
print(count) | l, r, d = list(map(int, input().split()))
print((r//d - (l-1)//d)) | p02606 |
L,R,d = list(map(int,input().split()))
k = L//d
n = R//d
if L%d==0:
print((n-k+1))
else:
print((n-k)) | L,R,d = list(map(int,input().split()))
print((R//d-(L-1)//d)) | p02606 |
L,R,d=list(map(int,input().split()))
ans=0
for i in range(L,R+1):
if i%d==0:
ans+=1
print(ans) | L,R,d=list(map(int,input().split()))
ans=0
for i in range(R-L+1):
if (L+i)%d==0:
ans+=1
print(ans) | p02606 |
l, r, d = list(map(int, input().split()))
print((r//d - (l-1)//d)) | L, R, d = list(map(int, input().split()))
diff = R - L + 1
ans = 0
l = [None for _ in range(diff)]
for i in range(diff):
l[i] = L + i
if l[i] % d == 0:
ans += 1
print(ans) | p02606 |
l, r, d = list(map(int, input().split()))
print((r//d - (l-1)//d)) | #!/usr/bin/env python3
l, r, d = list(map(int, input().split()))
print((r//d - (l-1)//d))
| p02606 |
l,r,d = list(map(int,input().split()))
print(( r//d -(l-1)//d )) | A = list(map(int, input().split()))
C = 0
for i in range(A[0], A[1]+1):
if i % A[2] == 0:
C += 1
print(C) | p02606 |
def main():
L, R, d = list(map(int, input().split(' ')))
total = 0
for i in range(L, R + 1):
if i % d == 0:
total += 1
print(total)
main() | def main():
L, R, d = list(map(int, input().split(' ')))
X = 0
if L % d == 0:
X = int(L / d) - 1
else:
X = int(L / d)
print((int(R / d) - X))
main() | p02606 |
L,R,d=list(map(int,input().split()))
ans=0
for i in range(L,R+1):
if i%d==0:
ans+=1
print(ans)
| L,R,d=list(map(int,input().split()))
ans=R//d-(L-1)//d
print(ans) | p02606 |
import sys
s = [x for x in sys.stdin.readline().rstrip()]
black = float("inf")
ans = 0
for i in range(len(s)):
if s[i] == "B" and black > i:
black = i
elif s[i] == "W" and black != float("inf"):
ans += i - black
black += 1
print(ans) | import sys
def main():
s = sys.stdin.readline().rstrip()
black = 0
ans = 0
for i in s:
if i == "B":
black = black + 1
else:
ans = ans + black
print(ans)
return
if __name__ == "__main__":
main() | p03200 |
#AGC029-A Irreversible operation
"""
問題：
一直線上にオセロがある
一回の操作で[黒白]を裏返す時[白黒]、最大何回の操作が行えるか
解法：
まずいちばん最初のBが出てくるところまでは無視できる
そこから、Bの数*Wの数が答え
"""
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
s = readline().rstrip().decode('utf-8')
flag = 0
black = 0
white = 0
ans = 0
fo... | #AGC029-A Irreversible operation
"""
問題：
一直線上にオセロがある
一回の操作で[黒白]を裏返す時[白黒]、最大何回の操作が行えるか
解法：
まずいちばん最初のBが出てくるところまでは無視できる
そこから、Wが出てくる度にそこまでに出現したBの数を足した合計が答え
"""
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
s = readline().rstrip().decode('utf-8')
flag = 0
black = 0
whi... | p03200 |
from sys import stdin
N=(stdin.readline().rstrip())
def str_del(str,index):
str = str[:index]+str[index+1:]
return str
ans=0
for i in range(100000000000):
index=N.find("W")
if index==-1:
break
ans=ans+index
N=str_del(N,index)
print(ans) | from sys import stdin
N=(stdin.readline().rstrip())
N=list(N)
cnt=0
ans=0
for i in N:
if i=="B":
cnt+=1
else:
ans+=cnt
print(ans) | p03200 |
S = input().strip()
Sb = [c == "B" for c in S]
def reverse(Sb,i):
_list = Sb.copy()
_list[i] = not _list[i]
return _list
def operate_onestep(Sb):
_list = Sb.copy()
cnt = 0
flg = True
while flg:
flg = False
for i in range(len(_list)-1):
if _list[i]... | S = input().strip()
w_total = 0
num_op = 0
for i,c in enumerate(S):
if c == "W":
w_total += 1
num_op += i + 1 - w_total
print(num_op) | p03200 |
S = list(input().rstrip())
count = 0
flag = True
while flag:
for i in range(len(S)-1):
if S[i] == 'B' and S[i+1] == 'W':
S[i], S[i+1] = S[i+1], S[i]
count += 1
break
if i == len(S)-2:
flag = False
print(count) | S = list(input().rstrip())
ans = 0
countw = 0
for i, c in enumerate(S):
if c == 'W':
ans += i - countw
countw += 1
print(ans) | p03200 |
import sys
def bubble_sort(arr):
counter = 0
change = True
for i in range(len(arr)):
for j in range(len(arr) - 1, i, -1):
if arr[j] < arr[j - 1]:
arr[j], arr[j - 1] = arr[j - 1], arr[j]
counter += 1
if change == 0: break
return arr,... | import sys
def solve():
input = sys.stdin.readline
S = list(input().replace("B", "2").replace("W", "1"))[:-1]
N = len(S)
ans = N * (N - 1) // 2
data = [0] * (N + 1)
def add(k, v):
while k <= N:
data[k] += v
k += k & -k
def get(k):
s... | p03200 |
import sys
def S(): return sys.stdin.readline().rstrip()
if __name__=='__main__':
sl = list(S())
flag = True
c = 0
while flag:
flag = False
for i in range(0,len(sl)-1):
if sl[i]=='B' and sl[i+1]=='W':
sl[i],sl[i+1] = 'W','B'
c += 1... | import sys
def S(): return sys.stdin.readline().rstrip()
if __name__=='__main__':
sl = list(S())
ans = 0
c = 0
for i,item in enumerate(sl):
if item=='W':
ans += c
else:
c += 1
print(ans)
exit() | p03200 |
import collections
import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril... | import collections
import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril... | p03200 |
from sys import stdin
def main():
A=stdin.readline().replace('B', '0').replace('W', '1')
#A=list(map(int,bw))
#A = list(map(int,stdin.readline().replace('B', '0').replace('W', '1')))
wc = A.count('1')
indices = [i for i, x in enumerate(A) if x == '1']
if wc > 0:
print((sum(indi... | from sys import stdin
def main():
A=stdin.readline()
#A = list(map(int,stdin.readline().replace('B', '0').replace('W', '1')))
wc = A.count('W')
indices = [i for i, x in enumerate(A) if x == 'W']
if wc > 0:
print((sum(indices) - 1*wc*(wc-1) //2 ))
else:
print((sum(indices... | p03200 |
#!/usr/bin/env python3
"""
https://atcoder.jp/contests/agc029/tasks/agc029_a
"""
import sys
import re
s = sys.stdin.readline().rstrip()
s2 = ''
cnt = 0
while True:
s = re.sub('^W+','',s)
s = re.sub('B+$','',s)
s2 = s.replace('BW', 'WB', 1)
if s2 == s:
break
cnt += 1
... | #!/usr/bin/env python3
"""
https://atcoder.jp/contests/agc029/tasks/agc029_a
"""
import sys
import re
s = sys.stdin.readline().rstrip()
e = 0
n = 0
for chr in s:
if chr == 'W':
e += n
if chr == 'B':
n += 1
print(e)
| p03200 |
from sys import stdin
s = stdin.readline().rstrip()
li = []
for i in range(len(s)):
if s[i] == "B":
li.append(0)
else:
li.append(1)
count = 0
while True:
flag = 0
for i in range(len(li)-1):
if li[i] == 0 and li[i+1] == 1:
li[i],li[i+1] = 1,0
... | from sys import stdin
s = stdin.readline().rstrip()
now = 0
count = 0
for i in range(len(s)):
if s[i] == "W":
count += (i-now)
now += 1
print(count) | p03200 |
import heapq
class MinCostFlow:
class Edge:
def __init__(self, to, cap, rev, cost):
self.to, self.cap, self.rev, self.cost = to, cap, rev, cost
def __init__(self, V):
self.V = V
self.E = [[] for _ in range(V)]
def add_edge(self, fr, to, cap, cost):
... | import heapq
import sys
if sys.version[0] == '2':
range, input = xrange, raw_input
class MinCostFlow:
class Edge:
def __init__(self, to, cap, rev, cost):
self.to, self.cap, self.rev, self.cost = to, cap, rev, cost
def __init__(self, V):
self.V = V
self.E =... | p00825 |
# -*- 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... | p03765 |
# https://atcoder.jp/contests/arc071/submissions/6325840
from itertools import accumulate
S = tuple(map(lambda x: 1 if x == 'A' else 2, input()))
T = tuple(map(lambda x: 1 if x == 'A' else 2, input()))
# A=1,B=2
acc_s = (0,) + tuple(accumulate(S))
acc_t = (0,) + tuple(accumulate(T))
ans = []
Q = int(i... | # https://atcoder.jp/contests/arc071/submissions/6325840
from itertools import accumulate
convert = {'A': 1, 'B': 2}
S = tuple(convert[x] for x in input())
T = tuple(convert[x] for x in input())
# maspyさんのやり方
acc_s = (0,) + tuple(accumulate(S))
acc_t = (0,) + tuple(accumulate(T))
ans = []
Q = int(input... | p03765 |
S = input()
T = input()
Q = int(input())
qs = [tuple(map(lambda x:int(x)-1,input().split())) for i in range(Q)]
smem = [0]
for c in S:
if c == 'A':
smem.append(smem[-1] + 1)
else:
smem.append(smem[-1] - 1)
tmem = [0]
for c in T:
if c == 'A':
tmem.append(tmem[-1] + 1)... | S = input()
T = input()
Q = int(input())
qs = [tuple(map(int,input().split())) for i in range(Q)]
sas = [0]
sbs = [0]
for c in S:
a = int(c=='A')
sas.append(sas[-1] + a)
sbs.append(sbs[-1] + (a^1))
tas = [0]
tbs = [0]
for c in T:
a = int(c=='A')
tas.append(tas[-1] + a)
tbs.app... | p03765 |
import sys
def input():
return sys.stdin.readline().strip()
def restore(s):
while len(s) > 1:
s = s.replace("AA", "B")
s = s.replace("BB", "A")
s = s.replace("AB", "")
s = s.replace("BA", "")
return s
S = input()
T = input()
q = int(input())
for _ in ... | import sys
from itertools import accumulate
def input():
return sys.stdin.readline().strip()
def acc(li, n):
res = [0] * (n + 1)
for i in range(n):
if li[i] == "A":
res[i + 1] = 1
elif li[i] == "B":
res[i + 1] = 2
return list(accumulate(res))
... | p03765 |
s = input()
t = input()
n = int(input())
q = []
for i in range(n):
abcd = list(map(int, input().split()))
q.append(abcd)
def shorten(s):
if s[0] != s[1]:
return s[2:]
elif s[1] != s[2]:
return s[0] + s[3:]
return s[3:]
def check(s):
sc = [s]
while len(s) >=... | S = input()
T = input()
n = int(input())
q = []
for i in range(n):
abcd = list(map(int, input().split()))
q.append(abcd)
toi = lambda c: 1 if c == 'A' else 2
s = [0] * (len(S)+1)
for i in range(len(S)):
s[i+1] = s[i] + toi(S[i])
t = [0] * (len(T)+1)
for i in range(len(T)):
t[i+1] = t[i]... | p03765 |
import collections
class MyList(list):
def __init__(self, x=[]):
list.__init__(self, x)
def __iadd__(self, A):
ret = MyList()
for a, b in zip(self, A):
ret.append(a + b)
return ret
def __isub__(self, A):
ret = MyList()
for a, b i... | import collections
class MyList(list):
def __init__(self, x=[]):
list.__init__(self, x)
def __iadd__(self, A):
return MyList([a + b for a, b in zip(self, A)])
def __isub__(self, A):
return MyList([a - b for a, b in zip(self, A)])
def __gt__(self, A):
fo... | p01445 |
x = eval(input())
w = [int(i) for i in input().split()]
d = 0
for i in range(len(w) -2 ):
if (w[i] > w[i+1] > w[i+2]) or (w[i] < w[i+1] < w[i+2]):
d += 1
print(d)
| n=int(eval(input()))
v=[int(i) for i in input().split()]
ans=0
for i in range(1, len(v)-1):
if (v[i]>v[i-1] and v[i]<v[i+1]) or (v[i]<v[i-1] and v[i]>v[i+1]):
ans+=1
print(ans) | p02988 |
n = int(eval(input()))
p = list(map(int, input().split()))
a = 0
for i in range(1, n-1):
if (p[i-1] < p[i] < p[i+1]) or (p[i+1] < p[i] < p[i-1]):
a += 1
print(a)
| # 少しひっかけ問題っぽいです。
n = int(eval(input()))
p = list(map(int, input().split()))
a = 0
# 配列の最初と最後は除外する。
for i in range(1, n-1):
# 配列の２番目なので、２通りを判定する。
if (p[i-1] < p[i] < p[i+1]) or (p[i+1] < p[i] < p[i-1]):
a += 1
print(a)
| p02988 |
N=int(eval(input()))
temp=input().split()
p=[int(temp[i]) for i in range(N)]
counter=0
for i in range(1, N-1):
if (p[i]-p[i-1])*(p[i]-p[i+1])<0:
counter+=1
print(counter) | n=int(eval(input()))
p=list(map(int, input().split()))
counter=0
for i in range(1, n-1):
if (p[i]-p[i-1])*(p[i]-p[i+1])<0:
counter+=1
print((int(counter))) | p02988 |
n = int(eval(input()))
l = list(map(int, input().split()))
print((sum(l[i]<l[i+1]<l[i+2] or l[i]>l[i+1]>l[i+2] for i in range(n-2)))) | n=int(eval(input()))
l=list(map(int,input().split()))
a=0
for i in range(n-2):
p,q,r=l[i:i+3]
if p<q<r or r<q<p: a+=1
print(a) | p02988 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(1, n - 1):
if a[i - 1] < a[i] < a[i + 1] or a[i - 1] > a[i] > a[i + 1]:
ans += 1
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(n - 2):
if a[i] < a[i + 1] < a[i + 2]:
ans += 1
if a[i] > a[i + 1] > a[i + 2]:
ans += 1
print(ans) | p02988 |
n=int(eval(input()))
p=list(map(int,input().split()))
ans=0
for i in range(1,n-1):
if sorted([p[i-1],p[i],p[i+1]])[1]==p[i]:ans+=1
print(ans) | n=int(eval(input()))
p=list(map(int,input().split()))
ans=0
for i in range(1,n-1):
if p[i-1]<p[i]<p[i+1] or p[i-1]>p[i]>p[i+1]:ans+=1
print(ans) | p02988 |
N = int(eval(input()))
ps = list(map(int, input().split()))
ans = 0
for i in range(1, N-1):
if ps[i-1] < ps[i] < ps[i+1] or ps[i-1] > ps[i] > ps[i+1]:
ans += 1
print(ans)
| N = int(eval(input()))
Ps = list(map(int, input().split()))
ans = 0
for i in range(1, N-1):
if Ps[i-1]<Ps[i]<Ps[i+1] or Ps[i-1]>Ps[i]>Ps[i+1]:
ans += 1
print(ans)
| p02988 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(1, n-1):
if p[i] != max(p[i-1], p[i], p[i+1]) and p[i] != min(p[i-1], p[i], p[i+1]):
ans += 1
print(ans)
| n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(1, n-1):
if p[i-1] < p[i] < p[i+1] or p[i+1] < p[i] < p[i-1]:
ans += 1
print(ans)
| p02988 |
n = int(eval(input()))
l = list(map(int, input().split()))
cnt = 0
for i in range(n-2):
if max(l[i], l[i+1], l[i+2]) != l[i+1] and min(l[i], l[i+1], l[i+2]) != l[i+1]:
cnt += 1
print(cnt) | n = int(eval(input()))
l = list(map(int, input().split()))
cnt = 0
for i in range(n-2):
if l[i]<l[i+1]<l[i+2] or l[i]>l[i+1]>l[i+2]:
cnt += 1
print(cnt) | p02988 |
#B
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(1, n-1):
if p[i-1] < p[i] and p[i] < p[i+1]:
ans += 1
if p[i-1] > p[i] and p[i] > p[i+1]:
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
for i in range(1, n-1):
if p[i-1] < p[i] and p[i] < p[i+1]:
count += 1
elif p[i-1] > p[i] and p[i] > p[i+1]:
count += 1
else:
pass
print(count) | p02988 |
n = int(eval(input()))
p = [int(x) for x in input().split()]
cnt = 0
for i in range(1,n-1):
if p[i-1]<p[i] and p[i]<p[i+1]:
cnt +=1
elif p[i-1]>p[i] and p[i]>p[i+1]:
cnt +=1
print(cnt) | n = int(eval(input()))
p = [int(_) for _ in input().split()]
cnt =0
for i in range(2,n):
if p[i-2] < p[i-1] < p[i] or p[i]<p[i-1]<p[i-2]:
cnt +=1
print(cnt) | p02988 |
n = int(eval(input()))
ps = list(map(int, input().split()))
count = 0
for i in range(1, n-2+1):
if ps[i-1] < ps[i] < ps[i+1]:
count += 1
elif ps[i-1] > ps[i] > ps[i+1]:
count += 1
print(count) |
n = int(eval(input()))
ps = list(map(int, input().split()))
count = 0
for i in range(n-2):
a = [ps[i], ps[i+1], ps[i+2]]
b = ps[i+1]
a.sort()
if a[1] == b:
count += 1
print(count) | p02988 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.