input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
H = [int(i) for i in input().split()]
length = len(H)
def z_counter(start):
cnt = 0
for i in range(start+1, length):
if H[i] <= H[i-1]:
cnt += 1
else:
break
return cnt
ans = 0
for i in range(1, length):
ans = max(ans, z_counter(i))
print(ans) | N=int(eval(input()))
H=list(map(int,input().split()))
h=[0]*N
count=0
for i in range(1,N):
if H[i-1]>=H[i]:
count+=1
else:
count=0
h[i]=count
print((max(h))) | p02923 |
n = int(eval(input()))
h = list(map(int, input().split()))
max_step = 0
for i in range(n):
current_step = 0
for j in range(i + 1, n):
if h[j - 1] >= h[j]:
current_step += 1
if current_step > max_step:
max_step = current_step
else:
... | n = int(eval(input()))
h = list(map(int, input().split()))
max_step = 0
current_step = 0
for i in range(n - 1):
if h[i] >= h[i + 1]:
current_step += 1
if current_step > max_step:
max_step = current_step
else:
current_step = 0
print(max_step)
| p02923 |
N = int(eval(input()))
H = list(map(int,input().split()))
L = []
M = [0]
t = 0
for i in range(N-1):
if H[i] >= H[i+1]:
L.append(1)
else:
L.append(0)
for i in range(N-1):
if L[i]==1:
t += 1
M.append(t)
else:
t = 0
if not M:
print((0))
else:
... | n=int(eval(input()))
h=list(map(int,input().split()))
from itertools import groupby
t=[]
for i in range(1,n):
if h[i]-h[i-1]<=0:t.append(1)
else:t.append(0)
gr=groupby(t)
ans=0
for k,g in gr:
if k==1:
t=len(list(g))
ans=max(ans,t)
print(ans)
| p02923 |
n = int(eval(input()))
h = list(map(int, input().split()))
ans = [0]*n
for i in range(n):
for j in range(i, n-1):
if h[j] >= h[j+1]:
ans[i] += 1
else:
break
print((max(ans)))
| n = int(eval(input()))
h = list(map(int, input().split()))
cnt = 0
ans = 0
for i in range(n-1):
if h[i] >= h[i+1]:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print((max(ans, cnt)))
| p02923 |
N = int(eval(input()))
H = list(map(int, input().split()))
max = 0
for i in range(N-1):
cnt = 0
now = i
while H[now] >= H[now+1]:
now += 1
cnt += 1
if now >= N-1:
break
if max < cnt:
max = cnt
print(max) | N = int(eval(input()))
H = list(map(int, input().split()))
H.reverse()
max = 0
cnt = 0
for i in range(N-1):
if H[i] <= H[i+1]:
cnt += 1
else:
cnt = 0
if cnt > max:
max = cnt
if cnt > max:
max = cnt
print(max) | p02923 |
# -*- coding: utf-8 -*-
def main():
N = int(eval(input()))
H = list(map(int,input().split()))
cnt = 0
flg = 0
for i in range(N):
if flg!=0:
if i==flg:
flg=0
else:
continue
tmp=0
for j in range(i,N-1):
... | # -*- coding: utf-8 -*-
def main():
N = int(eval(input()))
H = list(map(int,input().split()))
cnt = 0
flg = 0
for i in range(N):
if cnt >= N-i:
print(cnt)
return
if flg!=0:
if i==flg:
flg=0
else:
... | p02923 |
# -*- coding: utf-8 -*-
def main():
N = int(eval(input()))
H = list(map(int,input().split()))
cnt = 0
flg = 0
for i in range(N):
# if cnt >= N-i:
# print(cnt)
# return
if flg!=0:
if i==flg:
flg=0
else:
... | # -*- coding: utf-8 -*-
def main():
N = int(eval(input()))
H = list(map(int,input().split()))
cnt = 0
flg = 0
for i in range(N):
if cnt >= N-i:
print(cnt)
return
if flg!=0:
if i==flg:
flg=0
else:
... | p02923 |
import sys
def input():
return sys.stdin.readline()[:-1]
N = int(eval(input()))
A = list(map(int, input().split()))
B = [0 for i in range(N)]
for i in range(N):
for j in range(i,N-1):
if A[j]>=A[j+1]:
B[i]+=1
else:
break
print((max(B))) | N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
count = 0
for i in range(N-1):
if A[i]>=A[i+1]:
count += 1
else:
ans = max(ans,count)
count = 0
ans = max(ans,count)
print(ans) | p02923 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = [a[i]-a[i+1] for i in range(n-1)]
c = [0]
x = 0
for i in range(n-1):
if b[i] >= 0:
x += 1
c.append(x)
else:
x = 0
print((max(c))) | n = int(eval(input()))
a = list(map(int,input().split()))
c = [0]
x = 0
for i in range(n-1):
if a[i] >= a[i+1]:
x += 1
c.append(x)
else:
x = 0
print((max(c))) | p02923 |
N = int(eval(input()))
H = list(map(int, input().split()))
C = []
H.append(max(H)+1)
for s in range(N):
i = 0
while H[s+i] >= H[s+i+1]:
i += 1
C.append(i)
print((max(C))) | N = int(eval(input()))
H = list(map(int, input().split()))
C = [0]
for i in range(1, len(H)):
if H[i-1] < H[i]:
C.append(i)
C.append(N)
D = [C[j+1] - C[j] - 1 for j in range(len(C)-1)]
print((max(D))) | p02923 |
N = int(eval(input()))
H = list(map(int, input().split()))
ans = 0
for i in range(N-1):
count = 0
for j in range(i, N):
try:
if H[j] < H[j+1]:
break
else:
count += 1
except IndexError:
pass
ans = max(ans, ... | N = int(eval(input()))
H = list(map(int, input().split()))
count = 0
ans = 0
a = 0
for i in H:
a, b = i, a
if a <= b:
count += 1
else:
count = 0
ans = max(ans, count)
print(ans)
| p02923 |
n = int(eval(input()))
h = list(map(int,input().split()))
h.append(10**10)
ans = 0
for i in range(n):
cnt = 0
for j in range(i,n):
if h[j]>=h[j+1]:
cnt +=1
else:
if cnt > ans:
ans = cnt
break
print(ans) | n = int(eval(input()))
h = list(map(int,input().split()))
h = h[::-1]
h.append(10**10)
cnt = 0
L = []
for i in range(n):
L.append(cnt)
if h[i+1]>=h[i]:
cnt +=1
else:
cnt =0
print((max(L))) | p02923 |
n = int(eval(input()))
h = list(map(int,input().split()))
max_ctn = 0
for i in range(n):
tmp_ctn = 0
for j in range(i,len(h)-1):
if h[j] >= h[j+1]:
tmp_ctn += 1
continue
i = j
break
if max_ctn < tmp_ctn:
max_ctn = tmp_ctn
print(max_ctn) | n = int(eval(input()))
h = list(map(int,input().split()))
max_ctn = 0
start = 0
for i in range(0,n):
tmp_ctn = 0
i +=start
for j in range(i,len(h)-1):
if h[j] >= h[j+1]:
tmp_ctn += 1
start +=1
continue
break
if max_ctn < tmp_ctn:
... | p02923 |
N = int(eval(input()))
H = list(map(int, input().split()))
max = 0
for i in range(N-1):
count = 0
for j in range(i, N-1):
if H[j] >= H[j+1]:
count += 1
else:
break
if count > max:
max = count
print(max) | N = int(eval(input()))
H = list(map(int, input().split()))
updown = ['-' if H[i+1] <= H[i] else '+' for i in range(N-1)]
count = 0
max = 0
for i in updown:
if i == '-':
count += 1
else:
if count > max:
max = count
count = 0
if count > max:
max = count
prin... | p02923 |
import collections,sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
N = I()
S = S()
ans = 0
for i in range(N):
set_top = set()
set_bottom = set()
for s in collections.Counter(S[:i]):
set_top.add(s)
for s in collections.Counter(S[i:])... | import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
N = I()
S = S()
ans = 0
for i in range(N):
ans = max(ans,len(set(S[:i])&set(S[i:])))
print(ans)
| p03338 |
N = int(eval(input()))
S = input().strip()
cmax = 0
for i in range(N-1):
S1 = S[:i+1]
S2 = S[i+1:]
hist = {chr(i):0 for i in range(97,123)}
cnt = 0
for j in range(i+1):
a = S1[j]
if hist[a]==1:continue
hist[a] = 1
flag = 0
for k in range(len(S2)):... | N = int(eval(input()))
S = input().strip()
cmax = 0
for n in range(1,N-1):
X = S[:n]
Y = S[n:]
Cx = {}
Cy = {}
for i in range(n):
a = X[i]
if a not in Cx:
Cx[a] = 0
Cx[a] += 1
for i in range(N-n):
a = Y[i]
if a not in Cy:
... | p03338 |
N = int(eval(input()))
S = input().strip()
cmax = 0
for n in range(1,N-1):
X = S[:n]
Y = S[n:]
Cx = {}
Cy = {}
for i in range(n):
a = X[i]
if a not in Cx:
Cx[a] = 0
Cx[a] += 1
for i in range(N-n):
a = Y[i]
if a not in Cy:
... | N = int(eval(input()))
S = input().strip()
cmax = 0
for i in range(1,N-1):
X = set(list(S[:i]))
Y = set(list(S[i:]))
Z = X&Y
cmax = max(cmax,len(Z))
print(cmax) | p03338 |
# code-festival-2016-qualaC - 次のアルファベット / Next Letter
from string import ascii_lowercase as abc
def main():
S = input().rstrip()
K = int(input())
N, MOD = len(S), 26
# dist[c] := distance to "a" through "z"
dist = {c: 26 - i for i, c in enumerate(abc)}
dist["a"] = 0
A = [dist[i]... | # code-festival-2016-qualaC - 次のアルファベット / Next Letter
from string import ascii_lowercase as abc
def main():
S = input().rstrip()
K = int(eval(input()))
# dist[c] := distance to "a" through "z"
dist = {c: 26 - i for i, c in enumerate(abc)}
dist["a"] = 0
A = [dist[i] for i in S]
a... | p03994 |
# code-festival-2016-qualaC - 次のアルファベット / Next Letter
from string import ascii_lowercase as abc
def main():
S = input().rstrip()
K = int(eval(input()))
# dist[c] := distance to "a" through "z"
dist = {c: 26 - i for i, c in enumerate(abc)}
dist["a"] = 0
A = [dist[i] for i in S]
a... | # code-festival-2016-qualaC - 次のアルファベット / Next Letter
def main():
S = input().rstrip()
K = int(eval(input()))
abc = "abcdefghijklmnopqrstuvwxyz"
# dist[c] := distance to "a" through "z"
dist = {c: 26 - i for i, c in enumerate(abc)}
dist["a"] = 0
A = [dist[i] for i in S]
ans = ""... | p03994 |
s, k = input(), int(input())
ans = []
a = ord('z') + 1
for i in s:
if k == 0:
ans.append(ord(i))
elif a - ord(i) <= k and i != 'a':
k -= a - ord(i)
ans.append(ord('a'))
else:
ans.append(ord(i))
ans[-1] += k % 26
if ans[-1] >= a:
ans[-1] -= 26
print(*map(ch... | s, k = input(), int(input())
ans = []
a = ord('z') + 1
for i in s:
if a - ord(i) <= k and i != 'a':
k -= a - ord(i)
ans.append(ord('a'))
else:
ans.append(ord(i))
ans[-1] += k % 26
if ans[-1] >= a:
ans[-1] -= 26
print(*map(chr, ans), sep='')
| p03994 |
s = input()
K = eval(input())
alpha = [chr(i) for i in range(97,97+26)]
for moji in range(len(s)):
if alpha.index(s[moji]) != 0:
if K >= 26-alpha.index(s[moji]):
K = K - (26-alpha.index(s[moji]))
s = s[:moji] + 'a' + s[moji+1:]
if K>0:
last_char = alpha[ alpha.index(s[-1]) + (K % 26) ]
s = s... | s = input()
K = eval(input())
alpha = [chr(i) for i in range(97,97+26)]
i = 0
while K>=26 and i<len(s)-1:
if alpha.index(s[i]) != 0:
K = K - (26 - alpha.index(s[i]))
s = s[:i] + 'a' + s[i+1:]
i=i+1
for moji in range(i, len(s)):
if alpha.index(s[moji]) != 0:
if K >= 26-alpha.index(s[moji]):
... | p03994 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(... | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(... | p03994 |
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30
def main():
s = input().strip()
k = int(input().strip())
ans = ""
for i, c in enumerate(s):
if i == len(s)-1:
ans += chr(ord('a') + (ord(c) + k % 26 - ord('... | import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30
def main():
s = input().strip()
ans = list(s[:])
k = int(input().strip())
for i in range(len(s)):
d = (ord('z') - ord(s[i]) + 1) % 26
if k - d >= 0:
... | p03994 |
# -*- coding: utf-8 -*-
import sys,copy,math,heapq,itertools as it,fractions,re,bisect,collections as coll
alpha = "abcdefghijklmnopqrstuvwxyz"
s = input()
K = int(input())
dic = dict([alpha[i], i] for i in range(len(alpha)))
ans = []
for si in s:
d = 26 - dic[si] if si != "a" else 0
if d <= K:
... | s = list(input())
K = int(input())
for i in range(len(s)):
if s[i] == 'a': continue
d = ord('z') - ord(s[i]) + 1
if K >= d:
s[i] = 'a'
K -= d
K %= 26
s[-1] = chr((ord(s[-1]) - ord('a') + K)%26 + ord('a'))
print("".join(s)) | p03994 |
s = input()
k = eval(input())
def solve(s, k, i):
if i >= len(s):
# print "over"
return s
if i == len(s)-1:
# print "equal"
t = ord(s[i])+k
if t > ord("z"):
# n = (ord("z") - ord("a") + 1)/(t - ord("z"))
# t = t - (ord("z")-ord("a"))*n... | s = input()
k = eval(input())
i = 0
while True:
if i == len(s)-1:
# print "equal"
t = ord(s[i])+k
if t > ord("z"):
t -= ord("a")
t %= (ord("z")-ord("a") + 1)
t += ord("a")
s = s[:i] + chr(t)
print(s)
exit()
# p... | p03994 |
import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
A = []
for _ in range(N):
A.append(int(eval(input())))
### ACL ###
import typing
def _ceil_pow2(n: int) -> int:
x = 0
while (1 << x) < n:
x += 1
return x
def _bsf(n: int) -> int:
x = 0
... | import sys
# from https://github.com/not522/ac-library-python
### ACL ###
import typing
def _ceil_pow2(n: int) -> int:
x = 0
while (1 << x) < n:
x += 1
return x
def _bsf(n: int) -> int:
x = 0
while n % 2 == 0:
x += 1
n //= 2
return x
cla... | p02537 |
class SegmentTree(object):
def __init__(self, init_array, seg_func=min, seg_func_null=10 ** 9 + 7):
self.seg_func = seg_func
self.seg_func_null = seg_func_null
self.n = 1
while self.n < len(init_array):
self.n *= 2
self.dat = [0] * (2 * self.n - 1)
... | class SegmentTree(object):
def __init__(self, init_array, seg_func=min, seg_func_null=10 ** 9 + 7):
self.seg_func = seg_func
self.seg_func_null = seg_func_null
self.n = 1
while self.n < len(init_array):
self.n *= 2
self.dat = [0] * (2 * self.n - 1)
... | p02537 |
import sys
def input(): return sys.stdin.readline().strip()
class SegTree():
"""
0-indexedの配列[a0, a1, a2, ..., a(N-1)]に対して以下のクエリをそれぞれO(logx)で行う：
1. i番目の要素にxを代入
2. 半開区間[i, j)内の最小値を返す
self.id_elemとself.funcを変えることでRmQ以外にも例えばRMQに対応可能。
参考：https://juppy.hatenablog.com/entry/2019/05/0... | import sys
def input(): return sys.stdin.readline().strip()
class SegTree():
"""
0-indexedの配列[a0, a1, a2, ..., a(N-1)]に対して以下のクエリをそれぞれO(logx)で行う：
1. i番目の要素にxを代入
2. 半開区間[i, j)内の最小値を返す
self.id_elemとself.funcを変えることでRmQ以外にも例えばRMQに対応可能。
参考：https://juppy.hatenablog.com/entry/2019/05/0... | p02537 |
class LazySegmentTree:
def __init__(self, data, default=0, func=max):
"""initialize the lazy segment tree with data"""
self._default = default
self._func = func
self._len = len(data)
self._size = _size = 1 << (self._len - 1).bit_length()
self._lazy = [0] * (2... | class SegmentTree:
def __init__(self, data, default=0, func=max):
"""initialize the segment tree with data"""
self._default = default
self._func = func
self._len = len(data)
self._size = _size = 1 << (self._len - 1).bit_length()
self.data = [default] * (2 * _... | p02537 |
import sys
from functools import lru_cache
sys.setrecursionlimit(10 ** 8)
@lru_cache(None)
def dp(i, prev):
if i == N:
return 0
else:
if prev is None or abs(A[i] - prev) <= K:
return max(dp(i + 1, prev), dp(i + 1, A[i]) + 1)
else:
return dp(i + 1,... | from collections import defaultdict
N, K = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(N)]
dp = defaultdict(int)
for a in A:
for prev in list(dp.keys()):
if abs(prev - a) <= K:
dp[a] = max(dp[prev] + 1, dp[a])
dp[a] = max(1, dp[a])
print((max(dp.values... | p02537 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
INF = 10 ** 9 + 1 # sys.maxsize # float("inf")
MOD = 10 ** 9 + 7
def debug(*x):
print(*x, file=sys.stderr)
def solve_0_WA(N, K, AS):
candidates = [[0]]
for i in range(1, N):
A = AS[i]
new_candidates = []
... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
INF = 10 ** 9 + 1 # sys.maxsize # float("inf")
MOD = 10 ** 9 + 7
def debug(*x):
print(*x, file=sys.stderr)
def solve_0_WA(N, K, AS):
candidates = [[0]]
for i in range(1, N):
A = AS[i]
new_candidates = []
... | p02537 |
class Segtree(): # Segtree
ide_ele = 0 # 初期値(単位元)
def segfunc(self, x, y): # 区間にしたい操作
return max(x, y) # ex) max,min,gcd,lcm,sum,product
def __init__(self, n): # LIST: 配列の初期値
self.num = 1 << (n - 1).bit_length()
self.tree = [Segtree.ide_ele] * 2 * self.num
f... | class Segtree():
def __init__(self, n):
self.num = 1 << (n - 1).bit_length()
self.tree = [0] * 2 * self.num
for i in range(self.num - 1, 0, -1):
self.tree[i] = max(self.tree[2 * i], self.tree[2 * i + 1])
def update(self, k, x):
k += self.num
self.t... | p02537 |
class Segtree():
def __init__(self, n):
self.num = 1 << (n - 1).bit_length()
self.tree = [0] * 2 * self.num
for i in range(self.num - 1, 0, -1):
self.tree[i] = max(self.tree[2 * i], self.tree[2 * i + 1])
def update(self, k, x):
k += self.num
self.tre... | class Segtree():
def __init__(self, n):
self.num = 1 << (n - 1).bit_length()
self.tree = [0] * 2 * self.num
for i in range(self.num - 1, 0, -1):
self.tree[i] = max(self.tree[2 * i], self.tree[2 * i + 1])
def update(self, k, x):
k += self.num
self.tre... | p02537 |
class SegmentTree:
def __init__(self, data, default=0, func=max):
self._default = default
self._func = func
self._len = len(data)
self._size = _size = 1 << (self._len - 1).bit_length()
self.data = [default] * (2 * _size)
self.data[_size:_size + self._len] = dat... | import sys
z=sys.stdin.readline
class SegmentTree:
def __init__(self, data, default=0, func=max):
self._default = default
self._func = func
self._len = len(data)
self._size = _size = 1 << (self._len - 1).bit_length()
self.data = [default] * (2 * _size)
self.d... | p02537 |
# セグメントツリー
#############################################################
def segfunc(x, y):
return max(x, y)
ide_ele = 0
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 <... | # セグメントツリー
#############################################################
def segfunc(x, y):
return max(x, y)
ide_ele = 0
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 <... | p02537 |
def segfunc(x, y): return max(x, y)
class SegmentTree:
def __init__(self, arr):
size = len(arr)
n = 2 ** (size - 1).bit_length()
self.n = n
self.node = [0] * (2*n)
for i in range(size):
self.node[i+n-1] = arr[i]
for i in reversed(list(range(n-2)... | def segfunc(x, y): return max(x, y)
def update(i, x):
i += MAX_N-1
node[i] = x
while i:
i = (i-1)//2
node[i] = segfunc(node[i*2+1], node[i*2+2])
def query(l, r):
L = l + MAX_N
R = r + MAX_N
s = INF
while L < R:
if R & 1:
R -= 1
... | p02537 |
n,k=list(map(int,input().split()))
b=[int(eval(input())) for _ in range(n)]
dp=[[0]*(max(b)+1) for _ in range(n+1)]
a=b[0]
dp[1][a]=1
c=max(b)
for i in range(2,n+1):
a=b[i-1]
dp[i][a]=max(dp[i][a],1)
for j in range(max(a-k,0),min(a+k,c+1)):
if dp[i-1][j]!=0:
dp[i][a-(a-j)]=max... | n,k=list(map(int,input().split()))
b=[int(eval(input())) for _ in range(n)]
dp=[0]*(max(b)+1)
c=max(b)
for i in range(n):
dp[b[i]]=max(dp[b[i]],max(dp[max(0,b[i]-k):min(c+1,b[i]+k+1)])+1)
print((max(dp)))
| p02537 |
N, K = list(map(int, input().split()))
l = []
for i in range(N):
l.append(int(eval(input())))
cnts = [0] * 300001
for i in range(N):
tmp = 0
for j in range(max(l[i]-K, 0), min(l[i]+K+1, 300000)):
tmp = max(tmp, cnts[j])
cnts[l[i]] = tmp+1
print((max(cnts)))
| N, K = list(map(int, input().split()))
l = []
for i in range(N):
l.append(int(eval(input())))
cnts = [1] * N
for i in range(N):
for j in range(max(0, i-200), i):
if abs(l[i]-l[j]) <= K:
cnts[i] = max(cnts[i], cnts[j]+1)
print((max(cnts))) | p02537 |
import sys
input = sys.stdin.buffer.readline
INF = 0
class MaxSegTree:
"""
0-indexed
query : [L, R)
"""
def __init__(self, size):
self.size = 1 << (size.bit_length()) # 完全二分木にする
self.data = [-INF] * (2 * self.size - 1)
def build(self, rawData):
self.data[... | import sys
input = sys.stdin.buffer.readline
INF = 0
class MaxSegTree:
"""
0-indexed
query : [L, R)
"""
def __init__(self, size):
self.size = 1 << (size.bit_length()) # 完全二分木にする
self.data = [-INF] * (2 * self.size - 1)
def build(self, rawData):
self.data[... | p02537 |
import sys
# sys.setrecursionlimit(100000)
def input():
return sys.stdin.readline().strip()
def input_int():
return int(eval(input()))
def input_int_list():
return [int(i) for i in input().split()]
class SegTree:
X_unit = 0
X_f = max
def __init__(self, N):
... |
import sys
# sys.setrecursionlimit(100000)
def input():
return sys.stdin.readline().strip()
def input_int():
return int(eval(input()))
def input_int_list():
return [int(i) for i in input().split()]
class SegTree:
X_unit = 0
X_f = max
def __init__(self, N):
... | p02537 |
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline().strip()
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
de... | import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline().strip()
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
de... | p02537 |
import types
_atcoder_code = """
# Python port of AtCoder Library.
__version__ = '0.0.1'
"""
atcoder = types.ModuleType('atcoder')
exec(_atcoder_code, atcoder.__dict__)
_atcoder__bit_code = """
def _ceil_pow2(n: int) -> int:
x = 0
while (1 << x) < n:
x += 1
return x
def _b... | import types
_atcoder_code = """
# Python port of AtCoder Library.
__version__ = '0.0.1'
"""
atcoder = types.ModuleType('atcoder')
exec(_atcoder_code, atcoder.__dict__)
_atcoder__bit_code = """
def _ceil_pow2(n: int) -> int:
x = 0
while (1 << x) < n:
x += 1
return x
def _b... | p02537 |
# 1-index
def segfunc(x, y):
return max(x, y)
ide_ele = 0
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.n... | # 1-index
def segfunc(x, y):
return max(x, y)
ide_ele = 0
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.n... | p02537 |
# coding: utf-8
# Your code here!
N,K = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(N)]
dp = [[0] * N for _ in range(N)]
dp2 = [0] * N
for i in range(N):
for j in range(i,N):
if abs(A[i]-A[j]) <= K:
dp[i][j] = 1
for i in range(N):
tmax = 1
for j in r... | N,K = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(N)]
dp2 = [0] * N
for i in range(N):
tmax = 0
for j in range(i+1):
if abs(A[i]-A[j]) <= K:
tmax = max(tmax,dp2[j]+1)
dp2[i] = tmax
print((max(dp2))) | p02537 |
# 0-indexed
class SegTree:
def __init__(self, vals, seg_f, ide_ele):
n = len(vals)
self.seg_f = seg_f
self.ide_ele = ide_ele
self.leaf_n = 1 << (n-1).bit_length()
self.tree = [ide_ele]*(2*self.leaf_n-1)
for i in range(n): # init leaf
self.tree[i+... | # 0-indexed
class SegTree:
def __init__(self, vals, seg_f, ide_ele):
n = len(vals)
self.seg_f = seg_f
self.ide_ele = ide_ele
self.leaf_n = 1 << (n-1).bit_length()
self.tree = [ide_ele]*(2*self.leaf_n-1)
for i in range(n): # init leaf
self.tree[i+... | p02537 |
from math import ceil, log2
class SegTree:
ide_ele = 0
def __init__(self, init_val):
n = len(init_val)
self.num = 2**ceil(log2(n))
self.seg = [self.ide_ele] * (2 * self.num - 1)
def segfunc(self, x, y):
return max(x, y)
def update(self, k, x):
k += s... | from math import ceil, log2
import sys
z=sys.stdin.readline
class SegTree:
ide_ele = 0
def __init__(self, init_val):
n = len(init_val)
self.num = 2**ceil(log2(n))
self.seg = [self.ide_ele] * (2 * self.num - 1)
def segfunc(self, x, y):
return max(x, y)
def u... | p02537 |
n,k=list(map(int,input().split()))
a=[int(eval(input())) for i in range(n)]
subs=[[] for i in range(n)]
idx=0
for ai in a:
for i in range(idx+1):
if len(subs[i])==0:
subs[i].append(ai)
idx+=1
break
else:
if abs(subs[i][-1]-ai)<=k:
subs[i].append(ai)
ans=0
for ... | n,k=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(n)]
l=[[] for i in range(n)]
l[0].append(a[0])
ans=0
for ai in a[1:]:
for i in reversed(list(range(ans+1))): # if can a_i put backword, add l[i+1]. because of maximum length answer
for li in l[i]:
if -k<=(li-ai)<=k:
... | p02537 |
import sys
input = sys.stdin.readline
n,k = list(map(int, input().split()))
As = [int(eval(input())) for i in range(n)]
# N: 処理する区間の長さ
INF = 0
mx = 300001
LV = (mx-1).bit_length()
N0 = 2**LV
data = [INF]*(2*N0)
lazy = [None]*(2*N0)
# 伝搬対象の区間を求める
def gindex(l, r):
L = (l + N0) >> 1; R = (r + N... | import sys
input = sys.stdin.readline
n,k = list(map(int, input().split()))
As = [int(eval(input())) for i in range(n)]
# N: 処理する区間の長さ
INF = 0
mx = 300001
LV = (mx-1).bit_length()
N0 = 2**LV
data = [INF]*(2*N0)
lazy = [None]*(2*N0)
# 伝搬対象の区間を求める
def gindex(l, r):
L = (l + N0) >> 1; R = (r + N... | p02537 |
import sys
input = sys.stdin.readline
n,k = list(map(int, input().split()))
As = [int(eval(input())) for i in range(n)]
# N: 処理する区間の長さ
INF = 0
mx = 300001
LV = (mx-1).bit_length()
N0 = 2**LV
data = [INF]*(2*N0)
lazy = [None]*(2*N0)
# 伝搬対象の区間を求める
def gindex(l, r):
L = (l + N0) >> 1; R = (r + N... | # セグメント木
# segment tree
import sys
input = sys.stdin.readline
class segmented_tree:
X_unit = 0
X_f = lambda self, a, b: max(a,b)
def __init__(self, N):
self.N = N
self.X = [self.X_unit] * (2*N)
def build(self, seq):
for i, x in enumerate(seq, self.N):
... | p02537 |
from typing import Callable, TypeVar, List
T = TypeVar('T')
class SegTree:
def __init__(self, v: List[T], op: Callable[[T, T], T], e: Callable[[], T]) -> None:
self._n = len(v)
self.log = (self._n - 1).bit_length()
self.size = 1 << self.log
self.d = [e() for _ in range(2... | from typing import Callable, TypeVar, List
T = TypeVar('T')
class SegTree:
def __init__(self, v: List[T], op: Callable[[T, T], T], e: Callable[[], T]) -> None:
self._n = len(v)
self.log = (self._n - 1).bit_length()
self.size = 1 << self.log
self.d = [e for _ in range(2 *... | p02537 |
import math
import sys
import os
sys.setrecursionlimit(10**7)
def _S(): return sys.stdin.readline().rstrip()
def I(): return int(_S())
def LS(): return list(_S().split())
def LI(): return list(map(int,LS()))
if os.getenv("LOCAL"):
inputFile = basename_without_ext = os.path.splitext(os.path.basename(_... | import math
import sys
import os
sys.setrecursionlimit(10**7)
def _S(): return sys.stdin.readline().rstrip()
def I(): return int(_S())
def LS(): return list(_S().split())
def LI(): return list(map(int,LS()))
if os.getenv("LOCAL"):
inputFile = basename_without_ext = os.path.splitext(os.path.basename(_... | p02537 |
n, k = list(map(int, input().split()))
l = []
for i in range(n):
l.append(int(eval(input())))
root = [1]*n
for i in range(n)[-2::-1]:
num = 0
for j in range(i + 1, i + 500):
if j >= n:
break
if abs(l[i] - l[j]) <= k:
num = max(num, root[j])
root[i]... | n, k = list(map(int, input().split()))
l = []
for i in range(n):
l.append(int(eval(input())))
root = [1]*n
for i in range(n)[-2::-1]:
num = 0
for j in range(i + 1, i + 200):
if j >= n:
break
if abs(l[i] - l[j]) <= k:
num = max(num, root[j])
root[i]... | p02537 |
from bisect import bisect_left
N, K = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(N)]
t = [[] for _ in range(N)]
ans = 0
for i in range(N):
for j in range(len(t)-1, -1, -1):
idx = bisect_left(t[j], A[i])
if idx != len(t[j]):
if abs(t[j][idx] - A[... | from bisect import bisect_left
N, K = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(N)]
t = [[] for _ in range(N)]
ans = 0
for i in range(N):
for j in range(ans-1, -1, -1):
idx = bisect_left(t[j], A[i])
if idx != len(t[j]):
if abs(t[j][idx] - A[i])... | p02537 |
class SegTree:
"""
0-indexed
"""
def __init__(self,size,func,init_val,undef):
self.specSize = size
self.datSize = 1
self.compareFunc = func # suppose to min or max
self.INIT_VAL = init_val # 0 etc
self.UNDEFINED_VAL = undef # 1e18 -1e18 etc
# num:size以上の最小の2のべき乗
self.datSize = 2**size.bit_... | class SegTree:
"""
0-indexed
"""
def __init__(self,size,func,init_val,undef):
self.specSize = size
self.datSize = 1
self.compareFunc = func # suppose to min or max
self.INIT_VAL = init_val # 0 etc
self.UNDEFINED_VAL = undef # 1e18 -1e18 etc
# num:size以上の最小の2のべき乗
self.datSize = 2**size.bit_... | p02537 |
class SegTree:
"""
0-indexed
"""
def __init__(self,size,func,init_val,undef):
self.specSize = size
self.datSize = 1
self.compareFunc = func # suppose to min or max
self.INIT_VAL = init_val # 0 etc
self.UNDEFINED_VAL = undef # 1e18 -1e18 etc
# num:size以上の最小の2のべき乗
self.datSize = 2**size.bit_... | class SegTree:
"""
1-indexed
"""
def __init__(self,size,funcComp,funcUpd,init_val,undef):
self.specSize = size
self.datSize = 1
self.compareFunc = funcComp # suppose to min or max
self.updateFunc = funcUpd # suppose to add or update
self.INIT_VAL = init_val # 0 etc
self.UNDEFINED_VAL = undef... | p02537 |
# AOJ DSL_2_A "Range Minimum Query"
# SegmantTreeの実装
import sys
input = sys.stdin.readline
# 初期化最大値
INF = 0
class SegmentTree:
def __init__(self, N):
self.N = 2**(N-1).bit_length()
self.data = [[-INF, -1] for _ in range(2*self.N-1)]
# O(N)で初期化
def compose(self, A):
... | # AOJ DSL_2_A "Range Minimum Query"
# SegmantTreeの実装
import sys
input = sys.stdin.readline
# 初期化最大値
INF = 0
class SegmentTree:
def __init__(self, N):
self.N = 2**(N-1).bit_length()
self.data = [-INF for _ in range(2*self.N-1)]
# O(N)で初期化
def compose(self, A):
fo... | p02537 |
import typing
def _ceil_pow2(n: int) -> int:
x = 0
while (1 << x) < n:
x += 1
return x
class SegTree:
def __init__(self,
op: typing.Callable[[typing.Any, typing.Any], typing.Any],
e: typing.Any,
v: typing.Union[int, typing.List[typin... | import typing
class SegTree:
def _ceil_pow2(self, n: int) -> int:
x = 0
while (1 << x) < n:
x += 1
return x
def __init__(self,
op: typing.Callable[[typing.Any, typing.Any], typing.Any],
e: typing.Any,
v: typin... | p02537 |
class SegmentTree():
"""
update, get を提供するSegmentTree
Attributes
----------
__n : int
葉の数。2 ^ i - 1
__dot :
Segment function
__e: int
単位元
__node: list
Segment Tree
"""
def __init__(self, A, dot, e):
"""
Parameters
... | class SegmentTree():
"""
update, get を提供するSegmentTree
Attributes
----------
__n : int
葉の数。2 ^ i - 1
__dot :
Segment function
__e: int
単位元
__node: list
Segment Tree
"""
def __init__(self, A, dot, e):
"""
Parameters
... | p02537 |
class SegmentTree():
"""
update, get を提供するSegmentTree
Attributes
----------
__n : int
葉の数。2 ^ i - 1
__dot :
Segment function
__e: int
単位元
__node: list
Segment Tree
"""
def __init__(self, A, dot, e):
"""
Parameters
... | class SegmentTree():
"""
update, get を提供するSegmentTree
Attributes
----------
__n : int
葉の数。2 ^ i - 1
__dot :
Segment function
__e: int
単位元
__node: list
Segment Tree
"""
def __init__(self, A, dot, e):
"""
Parameters
... | p02537 |
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
def input():
return sys.stdin.readline()[:-1]
class Seg... | import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
def input():
return sys.stdin.readline()[:-1]
class Seg... | p02537 |
d=[0]*6**8
n,k,*a=list(map(int,open(0).read().split()+d))
for i in range(n):d[i]=max(d[j]for j in range(i-99,i+1)if abs(a[i]-a[j])<=k)+1
print((max(d))) | d=[0]*6**8
n,k,*a=list(map(int,open(0).read().split()))
a=d+a
while n:d[n]=max(d[j]for j in range(n,n+99)if abs(a[-n]-a[-j])<=k)+1;n-=1
print((max(d))) | p02537 |
d=[0]*6**8
n,k,*a=list(map(int,open(0).read().split()+d))
while n:n-=1;d[n]=max(d[j]for j in range(n,n+99)if abs(a[n]-a[j])<=k)+1
print((max(d))) | d=[0]*6**8
n,k,*a=list(map(int,open(0).read().split()+d))
while n:n-=1;d[n]=max(d[j]for j in range(n,n+99)if-k<=a[n]-a[j]<=k)+1
print((max(d))) | p02537 |
d=[0]*6**8
n,k,*a=list(map(int,open(0).read().split()+d))
while n:n-=1;d[n]=max(d[j]for j in range(n,n+99)if-k<=a[n]-a[j]<=k)+1
print((max(d))) | d=[0]*6**8
n,k,*a=list(map(int,open(0).read().split()+d))
while n:n-=1;d[n]=max(d[j]for j in range(n,n+99)if~k<a[n]-a[j]<=k)+1
print((max(d))) | p02537 |
#!/usr/bin/env python3
class SegTree:
def __init__(self, segfunc, e, v, init_val = None):
"""
segfunc: function 区間にしたい操作\n
e: Any 単位元\n
v: int or List 要素数か格納する配列\n
init_val: Any 初期値
"""
self.segfunc = segfunc
self.e = e
self.init_val... | #!/usr/bin/env python3
class SegTree:
def __init__(self, segfunc, e, v, init_val = None):
"""
segfunc: function 区間にしたい操作\n
e: Any 単位元\n
v: int or List 要素数か格納する配列\n
init_val: Any 初期値
"""
self.segfunc = segfunc
self.e = e
self.init_val... | p02537 |
N, K = list(map(int, input().split()))
BL = (300000).bit_length()
WIDTH = pow(2, BL)
BUFSIZE = pow(2, BL+1) - 1
BASE = BUFSIZE - WIDTH
# TODO: default value
buf = [0] * BUFSIZE
def update(i, x):
i += BASE
buf[i] = x
i = (i-1) // 2
while i >= 0:
buf[i] = compare(buf[2*i+1], buf[... | import sys
input = sys.stdin.readline
N, K = list(map(int, input().rstrip().split()))
BL = (300001-1).bit_length()
WIDTH = pow(2, BL)
BUFSIZE = pow(2, BL+1) - 1
BASE = BUFSIZE - WIDTH
DEFAULT = 0
buf = [DEFAULT] * BUFSIZE
def update(i, x):
i += BASE
buf[i] = x
i = (i-1) // 2
while i >... | p02537 |
#####segfunc#####
def segfunc(x, y):
return max(x,y)
#################
#####ide_ele#####
ide_ele = 0
#################
class SegTree:
"""
init(init_val, ide_ele): 配列init_valで初期化 O(N)
update(k, x): k番目の値をxに更新 O(logN)
query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
"""
def __init... | n,k=list(map(int,input().split()))
a=[]
for i in range(n):
a.append(int(eval(input())))
dp=[0]*(300010)
#####segfunc#####
def segfunc(x, y):
return max(x,y)
#################
#####ide_ele#####
ide_ele =0
#################
class SegTree:
"""
init(init_val, ide_ele): 配列init_valで初期化 O(N... | p02537 |
# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, K, A):
tree = SegmentTree(300_300)
for a in A:
p = tree.query(max(0, a - K), min(300_300, a + K + 1))
tree.modify(a, p + 1)
print((tree.query(0, 300_300)))
class SegmentTree:
__slots__ = ('__n', '__d', '__f'... | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, K, A):
tree = SegmentTree(300_300)
for a in A:
p = tree.query(max(0, a - K), min(300_300, a + K + 1))
tree.modify(a, p + 1)
print((tree.query_all()))
class SegmentTree:
__slots__ = ('__n', '__d', '__f', '__e... | p02537 |
# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, K, A):
tree = SegmentTree(300_300)
for a in A:
p = tree.query(max(0, a - K), min(300_300, a + K + 1))
tree.modify(a, p + 1)
print((tree.query_all()))
class SegmentTree:
__slots__ = ('__n', '__d', '__f', '__e... | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, K, A):
tree = SegmentTree(300_300)
for a in A:
p = tree.query(max(0, a - K), min(300_300, a + K + 1))
tree.modify(a, p + 1)
print((tree.query_all()))
class SegmentTree:
__slots__ = ('__n', '__d', '__f', '__e... | p02537 |
n,k = list(map(int,input().split()))
a=[0 for i in range(n)]
for i in range(n):
a[i] = int(eval(input()))
rank=[0 for i in range(n)]
rank[0]=1
for i in range(1,n):
ap = a[i]
r=0
for j in range(i):
if abs(a[j]-ap)<=k:
r=max(r,rank[j])
rank[i]=r+1
print((max(rank... |
n,k = list(map(int,input().split()))
a=[0 for i in range(n)]
for i in range(n):
a[i] = int(eval(input()))
rank=[[] for i in range(n)]
ans = 1
for i in range(n):
for r in range(ans,-1,-1):
frag = 0
for j in rank[r]:
if abs(j-a[i])<=k:
rank[r+1].append(... | p02537 |
import typing
import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
# import numpy as np
# sys.setrecursionlimit(10000001)
INF = 10 ** 16
# M... | import typing
import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
# import numpy as np
# sys.setrecursionlimit(10000001)
INF = 10 ** 16
# M... | p02537 |
class SEGTree:
def __init__(self,n,op,e):
self.Unit=e
self.Op=op
i=1<<(n.bit_length()-1)
if i!=n:
i*=2
self.SEG=[self.Unit]*(2*i-1)
self.d=i
def update(self,i,x):
i+=self.d-1
self.SEG[i]=x
while i>0:
i=(... | import sys
input=sys.stdin.readline
class SEGTree:
def __init__(self,N,op,e):
self.size=2**(N-1).bit_length()
self.e=e
self.op=op
self.SEG=[self.e]*(self.size*2)
def update(self,i,x):
i+=self.size
self.SEG[i]=x
while i>0:
i>... | p02537 |
n, k = list(map(int, input().split()))
a_list = [int(eval(input())) for _ in range(n)]
dp = [1] * n
for i in range(n):
for j in range(max(0, i-n), i):
if abs(a_list[i] - a_list[j]) <= k:
dp[i] = max(dp[i], dp[j] + 1)
ans = max(dp)
print(ans) | n, k = list(map(int, input().split()))
a_list = [int(eval(input())) for _ in range(n)]
dp = [1] * n
for i in range(n):
for j in range(max(0, i - 100), i):
if abs(a_list[i] - a_list[j]) <= k:
dp[i] = max(dp[i], dp[j] + 1)
ans = max(dp)
print(ans) | p02537 |
import sys
input = sys.stdin.buffer.readline
n, k = list(map(int, input().split()))
max_n = 300000
num = 1 << ((max_n - 1).bit_length())
SEG = [0] * (2 * num)
func = max
ele = 0
def update(idx, val):
idx += num
SEG[idx] = val
for i in reversed(list(range(1, num))):
SEG[i] = f... | import sys
input = sys.stdin.buffer.readline
class SegmentTree:
ele = 0
func = max
# SEG木は1-index
# Aに関しては0-index
def __init__(self, n): # Aは0-idx
self.n = n
self.num = 2 ** ((self.n - 1).bit_length())
self.SEG = [self.ele] * (2 * self.num)
def searc... | p02537 |
import sys
input = sys.stdin.buffer.readline
class SegmentTree:
ele = 0
func = max
# SEG木は1-index
# Aに関しては0-index
def __init__(self, n): # Aは0-idx
self.n = n
self.num = 2 ** ((self.n - 1).bit_length())
self.SEG = [self.ele] * (2 * self.num)
def searc... | import sys
input = sys.stdin.buffer.readline
n, k = list(map(int, input().split()))
max_n = 300000
num = 2 ** ((max_n - 1).bit_length())
SEG = [0] * (2 * num)
func = max
ele = 0
def update(idx, val):
idx += num
SEG[idx] = val
while idx > 0:
idx //= 2
SEG[idx] = func(SE... | p02537 |
from collections import Counter
while True:
W, D = list(map(int, input().split()))
if not (W | D):
break
hw = [int(x) for x in input().split()]
hd = [int(x) for x in input().split()]
print((sum(hw) + sum(hd) - sum(k * v for k, v in list((Counter(hw) & Counter(hd)).items())))) | from collections import Counter
import sys
if sys.version[0] == '2':
range, input = xrange, raw_input
while True:
W, D = list(map(int, input().split()))
if not (W | D):
break
hw = [int(x) for x in input().split()]
hd = [int(x) for x in input().split()]
print((sum(hw) + sum(hd) ... | p00874 |
n = int(eval(input()))
a = [0] + list(map(int, input().split()))
b = [0] * (n + 1)
for i in range(n, 0, -1):
for j in range(i, n + 1, i):
b[i] ^= b[j]
b[i] ^= a[i]
print((sum(b)))
for i in range(1, n + 1):
if b[i] == 1:
print(i) | n = int(eval(input()))
a = [0] + list(map(int, input().split()))
for i in range(n, 0, -1):
a[i] = sum(a[i::i]) % 2
print((sum(a)))
for i in range(1, n + 1):
if a[i] == 1:
print(i) | p02972 |
def divisors(n):
ds = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
ds.append(i)
if i != n // i:# and i != 1:
ds.append(n//i)
# divisors.sort()
return ds
n = int(eval(input()))
aa = list(map(int, input().split()))
counts = {}
balls = {}... | n = int(eval(input()))
aa = list(map(int, input().split()))
balls = {}
ai = {}
for i in range(len(aa)):
if aa[i] == 1:
ai[i + 1] = 1
else:
ai[i + 1] = 0
for i in range(n, 0, -1):
parity = 0
k = 1
while k * i <= n:
if k * i in balls:
parity ^= 1
... | p02972 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
b = [0] * n
ans = []
for i in range(n, 0, -1):
multi_list = [j for j in range(1, n + 1, 1) if j % i == 0]
for multi in multi_list:
b[i - 1] = (b[i - 1] + a[multi - 1]) % 2
if b[i - 1] == 1:
ans.append(str(i))
if a == b:
... | n = int(eval(input()))
a = [int(i) for i in input().split()]
b = [0] * n
ans = []
for i in range(n, 0, -1):
temp = sum(b[i - 1:n:i]) % 2
if temp != a[i - 1]:
b[i - 1] = 1
if b[i - 1] == 1:
ans.append(str(i))
print((len(ans)))
if len(ans) > 0:
print((" ".join(ans))) | p02972 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from functools import reduce
from operator import xor
N = int(readline())
A = [0] + list(map(int,read().split()))
B = [0] * (N+1)
for n in range(N,0,-1):
s = reduce(xor,B[n+n::n],0)
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from functools import reduce
from operator import xor
N = int(readline())
A = [0] + list(map(int,read().split()))
for n in range(N//2,0,-1):
A[n] = reduce(xor,A[n::n],0)
I = [i for i... | p02972 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from functools import reduce
from operator import xor
N = int(readline())
A = [0] + list(map(int,read().split()))
for n in range(N//2,0,-1):
A[n] = reduce(xor,A[n::n],0)
I = [i for i... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
A = [0] + list(map(int,read().split()))
for n in range(N//2,0,-1):
A[n] = sum(A[n::n])&1
I = [i for i,x in enumerate(A) if x]
print((len(I)))
if len(I) > 0:
... | p02972 |
N = int(eval(input()))
a = list(map(int, input().split()))
last_ans = 0
for i in range(2 ** N):
hako = [0]*N
for j in range(N): # このループが一番のポイント
if ((i >> j) & 1): # 順に右にシフトさせ最下位bitのチェックを行う
hako[j] = 1
#print(hako)
ans = 0
for kijun in range(1,N+1):
bais... | N = int(eval(input()))
a = list(map(int, input().split()))
hako = [0]*N
last_ans = 1
for i in range(N-1, -1, -1):
#print(i)
check = 0
kijun = i+1
baisuu = 1
total = 0
while kijun*baisuu <= N:
if hako[kijun*baisuu-1] == 1:
total += 1
baisuu += 1
t... | p02972 |
n=int(eval(input()))
li=list(map(int,input().split()))
ans=[]
for i in range(n-1,n//2-1,-1):
if li[i]==1:
ans.append(i+1)
for i in range(n//2,0,-1):
count=0
for j in ans:
if j%i==0:
count+=1
if count%2!=li[i-1]:
ans.append(i)
ans.reverse()
print((len(ans)))
L=[str(a) for a i... | n=int(eval(input()))
li=list(map(int,input().split()))
ans=[]
li2=[0 for _ in range(n)]
for i in range(n,0,-1):
count=0
for j in range(i*2,n+1,i):
if li2[j-1]==1:
count+=1
if count%2!=li[i-1]:
li2[i-1]=1
ans.append(i)
ans.reverse()
print((len(ans)))
L=[str(a) for a in ans]
L="... | p02972 |
import sys
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
n = int(eval(input()))
a = list(map(int, input().spl... | def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
n = int(eval(input()))
a = list(map(int, input().split()))
a.in... | p02972 |
import sys
sys.setrecursionlimit(4100000)
import logging
logging.basicConfig(level=logging.DEBUG)
logger = logging.getLogger(__name__)
def resolve():
N = [int(x) for x in sys.stdin.readline().split()][0]
a_list = [int(x) for x in sys.stdin.readline().split()]
logger.debug('{} {}'.format(... | import sys
sys.setrecursionlimit(4100000)
import logging
logging.basicConfig(level=logging.DEBUG)
logger = logging.getLogger(__name__)
# @profile
def resolve():
N = [int(x) for x in sys.stdin.readline().split()][0]
a_list = [int(x) for x in sys.stdin.readline().split()]
logger.debug('{}... | p02972 |
def main():
n = int(eval(input()))
s = list(map(int,input().split()))
r = []
for i in range(n,0,-1):
c = sum(x % i == 0 for x in r)
c1 = c % 2
if c1 != s[i-1]:
r.append(int(i))
print((len(r)))
if len(r) > 0:
for i in range(len(r)):
... | def main():
n = int(eval(input()))
s = list(map(int,input().split()))
r = [0] * n
for i in range(n,n//2,-1):
if s[i-1] == 1:
r[i-1] = 1
for i in range(n//2,0,-1):
p = n // i
c = 0
for j in range(1,p+1):
if r[(j * i) - 1] == 1:
... | p02972 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = [0 for n in range(N+1)]
x = []
for n in range(N):
i = N-n
# print(i)
BB = B[::i]
if (sum(BB))%2 == A[i-1]:
B[i] = 0
else:
B[i] = 1
# print(B)
if B[i] == 1:
x.append(str(i))
if len(x) == 0:
print((0))
else... | N = int(eval(input()))
A = list(map(int, input().split()))
B = [0]*(N+1)
x = []
for n in range(N):
i = N-n
BB = B[::i]
if (sum(BB))%2 == A[i-1]:
B[i] = 0
else:
B[i] = 1
x.append(str(i))
if len(x) == 0:
print((0))
else:
print((len(x)))
print((' '.join(x))) | p02972 |
N = int(eval(input()))
An = input().split(' ')
ball_list = [0] * N
output_list = []
count = 0
for i in range(N):
sum_amari = sum(ball_list[(N - i -1)::(N - i)])
if sum_amari % 2 != int(An[N - i -1]):
ball_list[N - i -1] = 1
output_list.insert(0,str(N - i))
print((len(output_list)))
... | N = int(eval(input()))
An = input().split(' ')
ball_list = [0] * N
output_list = []
count = 0
for i in range(N):
sum_amari = sum(ball_list[(N - i -1)::(N - i)])
if sum_amari % 2 != int(An[N - i -1]):
ball_list[N - i -1] = 1
output_list.append(str(N - i))
output_list.reverse()
print((... | p02972 |
N = int(eval(input()))
a_list = [int(x) for x in input().split()]
cnt = 0
b_list = []
for i in range(len(a_list), 0, -1):
if ( a_list[i-1] != len(list([b for b in b_list if b%i == 0])) %2):
b_list.append(i)
M = len(b_list)
print(M)
if (M>0):
print((" ".join([str(b) for b in b_list])))
| N = int(eval(input()))
a_list = [int(x) for x in input().split()]
cnt = 0
b_list = set()
for i in range(len(a_list), 0, -1):
tmp = 0
for j in range(i*2, N+1, i):
tmp ^= (j in b_list)
if (tmp != a_list[i-1]):
b_list.add(i)
M = len(b_list)
print(M)
if (M>0):
print((" ".join([s... | p02972 |
n = int(eval(input()))
a = [-1] + list(map(int, input().split()))
b = [0] * (n+1)
for i in reversed(list(range(1, n+1))):
bi = 0
for j in range(2, n//i + 1):
bi += b[i*j]
bi %= 2
if bi != a[i]:
b[i] = 1
else:
b[i] = 0
b_idx = [str(i) for i in range(1, n+1) i... | n = int(eval(input()))
a = list(map(int, input().split()))
b = [0] * (n+1)
for i in reversed(list(range(1, n+1))):
bi = 0
for j in range(2, n//i + 1):
bi += b[i*j]
bi %= 2
if bi != a[i-1]:
b[i] = 1
else:
b[i] = 0
b_idx = [str(i) for i in range(1, n+1) if b[i... | p02972 |
def main():
n = int(eval(input()))
a = list(map(int,input().split()))
ans = [0 for i in range(n+1)]
for i in range(n):
s = 0
k = n-i
for j in range(1,n//k+1):
s += ans[k*j]
if s%2!=a[k-1]:
ans[k] = 1
print((sum(ans)))
if sum(ans... | def main():
n = int(eval(input()))
a = list(map(int,input().split()))
ans = [-1 for i in range(n)]
for i in range(n):
c = n//(n-i)
if c<2:
if a[n-1-i] == 1:
ans[n-1-i] = 1
else:
ans[n-1-i] = 0
else:
s... | p02972 |
n = int(eval(input()))
A = [int(s) for s in input().split()]
cen = n //2
ANS = [0]*(cen)
A_p = A[cen:n]
ANS = ANS + A_p
for i in range(cen):
part_sum = sum(ANS[cen-i-1::cen-i])
dot = part_sum % 2
if dot == A[cen-i-1]:
pass
else:
ANS[cen-i-1] = 1
sum_ans = sum(ANS)
print... | n = int(eval(input()))
A = [int(s) for s in input().split()]
cen = n //2
ANS = [0]*(cen)
A_p = A[cen:n]
ANS = ANS + A_p
for i in range(cen):
part_sum = sum(ANS[cen-i-1::cen-i])
dot = part_sum % 2
if dot == A[cen-i-1]:
pass
else:
ANS[cen-i-1] = 1
sum_ans = sum(ANS)
print... | p02972 |
from functools import lru_cache, reduce
from operator import xor
N = int(eval(input()))
a = list(map(int, input().split()))
# 右の箱から順に詰める
@lru_cache(maxsize=None)
def f(i):
return reduce(
xor,
(f(j) for j in range(2 * i, N + 1, i)),
a[i - 1]
)
b = [i for i in rever... | from functools import reduce
from operator import xor
N = int(eval(input()))
a = list(map(int, input().split()))
# 右の箱から順に詰める
dp = [0 for _ in range(N + 1)]
for i in range(N, 0, -1):
dp[i] = reduce(
xor,
(dp[j] for j in range(2 * i, N + 1, i)),
a[i - 1]
)
b = [i for i... | p02972 |
n = int(eval(input()))
ai = list(map(int, input().split()))
#print(ai)
dai={}
dbi={}
for i in range(1, n+1):
dai.setdefault(i, ai[i-1])
dbi.setdefault(i, 0)
#print(dai)
#print(dbi)
anssum=0
ans=[]
for i in range(1, n+1)[::-1]:
#print(i)
tmp=0
for j in range(2, n+1):
che... | n = int(eval(input()))
ai = list(map(int, input().split()))
#print(ai)
dai={}
dbi={}
for i in range(1, n+1):
dai.setdefault(i, ai[i-1])
dbi.setdefault(i, 0)
#print(dai)
#print(dbi)
anssum=0
ans=[]
for i in range(1, n+1)[::-1]:
#print(i)
tmp=0
for j in range(2, n+1):
che... | p02972 |
N=int(input())
a=list(map(int,input().split()))
b=[0]*N
c=[]
cnt=0
for i in range(1,N+1)[::-1]:
if len([x for x in c if x%i==0])%2 != a[i-1]:
a[i-1]=1
c.append(i)
cnt+=1
print(cnt)
if len(c)>0:
print(*c,sep='\n')
| N=int(input())
a=list(map(int,input().split()))
b=[0]*N
c=[]
cnt=0
for i in range(1,N+1)[::-1]:
if sum(b[i-1::i])%2 != a[i-1]:
b[i-1]=1
c.append(i)
cnt+=1
print(cnt)
if len(c)>0:
print(*c,sep='\n')
| p02972 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = [0 for x in range(N+1)]
for i in range(N,0,-1):
s = 0
for j in range(2*i,N+1,i):
if ans[j] == 1:
s += 1
ans[i] = s & 1 != A[i-1]
ans_m = 0
ans_a = []
for i in range(len(ans)):
if ans[i]:
ans_m +=... | N = int(eval(input()))
A = list(map(int,input().split()))
ans = [0 for x in range(N+1)]
ans_m = 0
ans_a = []
for i in range(N,0,-1):
s = 0
for j in range(2*i,N+1,i):
if ans[j] == 1:
s += 1
if s & 1 != A[i-1]:
ans[i] = 1
ans_m += 1
ans_a.append(i)
... | p02972 |
N = int(eval(input()))
ai = list(map(int, input().split()))
box = [0] * N
v = N // 2 # 後半部の最初のindex
for i in range(v, N):
if ai[i] == 0:
box[i] = 0
else:
box[i] = 1
for i in range(v - 1, -1, -1):
s = [ai[x] == 1 for x in range(i + 1, N) if (x + 1) % (i + 1) == 0]
cnt = ... | N = int(eval(input()))
ai = list(map(int, input().split()))
box = [0] * N
v = N // 2 # 後半部の最初のindex
for i in range(v, N):
if ai[i] == 0:
box[i] = 0
else:
box[i] = 1
for i in range(v - 1, -1, -1):
value = i + 1
sum = 0
for j in range(value * 2 - 1, N, value):
... | p02972 |
import sys
input = sys.stdin.readline
N = int(input())
a = list(map(int,input().split()))
#box = [0]*(N+1)
for i in range(N,0,-1):
k=2
temp=a[i-1]
#print(123,i,ball)
while i*k<=N:
if a[i*k-1]==1:
temp = (temp+1)%2
k+=1
a[i-1] = temp
#print(box)
M=0
... | import sys
input = sys.stdin.readline
N = int(input())
a = list(map(int,input().split()))
a.insert(0,-1)
for i in range(N,0,-1):
k=2
temp=a[i]
while i*k<=N:
if a[i*k]==1:
temp = (temp+1)%2
k+=1
a[i] = temp
M=0
b=[]
for i in range(1,N+1):
if a[i]==1:... | p02972 |
n = int(eval(input()))
a = list(map(int,input().split()))
res = [0 for i in range(n)]
lres = []
for i in range(n,0,-1):
l = []
flag = 0
t = i*2
while t <= n:
flag = flag ^ res[t-1]
t = t+i
if a[i-1] != flag:
res[i-1] = 1
lres.append(str(i))
print((len(... | def main():
n = int(eval(input()))
a = list(map(int,input().split()))
res = [0 for i in range(n)]
lres = []
for i in range(n,0,-1):
l = []
flag = 0
t = i*2
while t <= n:
flag = flag ^ res[t-1]
t = t+i
if a[i-1] != flag:
... | p02972 |
N = int(eval(input()))
A = list(map(int, input().split()))
def returnResMod2(i):
# i+1の倍数の箱のaiの和の剰余を求める
res = sum([ansList[k] for k in range(N) if (k+1) % (i+1) == 0]) % 2
return res
ansList = [0 for i in range(N)]
for i in range(N-1, -1, -1):
tmp = (returnResMod2(i)+A[i]) % 2
ansLi... | N = int(eval(input()))
A = list(map(int, input().split()))
def returnResMod2(i):
# i+1の倍数の箱のaiの和の剰余を求める
res = sum([ansList[(i+1)*(k+1)-1] for k in range(N//(i+1))]) % 2
return res
ansList = [0 for i in range(N)]
for i in range(N-1, -1, -1):
tmp = (returnResMod2(i)+A[i]) % 2
ansList[... | p02972 |
l = []
counter = 0
ans_list = []
n = int(eval(input()))
b_list = [0 for _ in range(n)]
l = list(map(int, input().split()))
for i in range(n,0,-1):
index = n // i
if index == 1: # 倍数がないとき
b_list[i-1] = l[i-1]
else:
sum = 0
for j in range(2, index+1):
sum =... | n = int(eval(input()))
a = list(map(int, input().split()))
ans_list = [0 for _ in range(n)]
for i in range(n-1, -1, -1):
prev = 0
index = i+1
for j in range(2, n+1):
if (index * j)-1 >= n: break
prev += ans_list[(index * j)-1]
if prev % 2 != a[i]:
ans_list[i] = 1
p... | p02972 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.