input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import math
import functools
import copy
N=int(eval(input()))
a=list(map(int,input().split()))
b=copy.copy(a)
ans=list()
for i in range(N):
del b[i]
gcd=functools.reduce(math.gcd,b)
ans.append(gcd)
b.insert(i,a[i])
print((max(ans))) | import math
from itertools import accumulate
n = int(eval(input()))
a = list(map(int, input().split()))
fromleft = list(accumulate(a, math.gcd))
fromright = list(accumulate(a[::-1], math.gcd))[::-1]
gcd = []
gcd.append(fromright[1])
for i in range(1, n-1):
gcd.append(math.gcd(fromleft[i-1], fromrig... | p03061 |
from functools import reduce
import copy
def gcd(x, y):
if y == 0:
return x
else:
return gcd(y, x % y) #再帰定義
def gcd_list(numbers):
return reduce(gcd, numbers)
n=int(eval(input()))
a_o=list(map(int,input().split()))
g=[1]*n
for i in range(n):
a=copy.copy(a_o)
a.pop(i)
g[i]=g... | def gcd(x, y):
if y == 0:
return x
else:
return gcd(y, x % y) #再帰定義
n=int(eval(input()))
a=list(map(int,input().split()))
l=[0]*n
r=[0]*n
for i in range(1,n):
if i==1:
l[1]=a[0]
r[-2]=a[-1]
else:
l[i]=gcd(l[i-1],a[i-1])
r[-i-1]=gcd(r[-i],a[-i])
g=[0]*n
for i in range(n):... | p03061 |
def gcd(a,b):
if a % b == 0:
return b
else:
return gcd(b,a%b)
N = int(eval(input()))
A = [i for i in map(int,input().split())]
g = []
for i in range(N):
ans = 0
for j in range(N):
if ans == 0 and i != j:
ans = A[j]
continue
if i != ... | def gcd(a,b):
if b == 0:
return a
if a % b == 0:
return b
else:
return gcd(b,a%b)
N = int(eval(input()))
A = [i for i in map(int,input().split())]
L = [0]
R = [0]
for i in range(N):
L.append(gcd(L[-1],A[i]))
for i in range(N-1,-1,-1):
R.append(gcd(R[-1],A[i]))... | p03061 |
n = int(eval(input()))
a = list(map(int,input().split()))
if n == 2:
print((max(a)))
else:
l = [-1]
r = []
def gcd(x,y):
while y != 0:
x, y = y, x%y
# print(x,y)
return(x)
for i in range(n-1):
m = a[i+1:][0]
if len(a[... | n = int(eval(input()))
a = list(map(int,input().split()))
if n == 2:
print((max(a)))
else:
l = [0 for i in range(n)]
r = [0 for i in range(n)]
def gcd(x,y):
while y != 0:
x, y = y, x%y
# print(x,y)
return(x)
for i in range(1,n):
... | p03061 |
N=int(eval(input()))
LA=list(map(int,input().split()))
ans=[]
def gcd(m,n):
while n:
m,n=n,m%n
return m
from functools import reduce
def multigcd(item):
return reduce(gcd, item)
for n in range(N):
L=LA[:n]+LA[n+1:]
ans.append(multigcd(L))
print((max(ans))) | N=int(eval(input()))
LA=list(map(int,input().split()))
ans=[]
def gcd(m,n):
if m==0 or n==0:
return m+n
while n:
m,n=n,m%n
return m
La=[0]
Lb=[0]
for n in range(N-1):
La.append(gcd(La[n],LA[n]))
Lb.append(gcd(Lb[n],LA[-(n+1)]))
for n in range(N):
ans.append... | p03061 |
#import math
from functools import reduce
def gcd(a,b):
r = 1
while r > 0:
r = a % b
a = b
b = r
return a
n = int(eval(input()))
a = [int(i) for i in input().split()]
L = [0] * n
for i in range(n):
aa = a[:]
aa.pop(i)
L[i] = reduce(gcd, aa)
pri... | def gcd(a,b):
if a == 0:
return b
if b == 0:
return a
r = 1
while r > 0:
r = a % b
a = b
b = r
return a
n = int(eval(input()))
A = [int(i) for i in input().split()]
L = [0] * n
L[0] = 0
L[1] = A[0]
for i in range(2,n):
L[i] = gcd(L[i... | p03061 |
import sys
from collections import deque
def gcd(a, b):
while b:
a, b = b, a % b
return a
input = sys.stdin.readline
n = int(eval(input()))
a_que = deque(list(map(int, input().split())))
ans = 1
for _ in range(n):
out = a_que.popleft()
m = 0
for a in a_que:
m = gcd(... | import sys
def gcd(a, b):
while b:
a, b = b, a % b
return a
input = sys.stdin.readline
n = int(eval(input()))
a_list = list(map(int, input().split()))
l_list = [0]
r_list = [0]
l_gcd, r_gcd = 0, 0
for i in range(n-1):
l_gcd = gcd(l_gcd, a_list[i])
l_list.append(l_gcd)
r_gcd... | p03061 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse=True)
from functools import lru_cache
import sys
if n == 2:
print((max(a)))
sys.exit()
@lru_cache(maxsize=100000)
def gcd(x, y):
while y:
x, y = y, x % y
return x
def gcd_list(li):
if len(... |
n = int(eval(input()))
a = list(map(int, input().split()))
import sys
if n == 2:
print((max(a)))
sys.exit()
def gcd(x, y):
while y:
x, y = y, x % y
return x
g = a[0]
gcd_left = [g]
for i in range(n-1):
g = gcd(g, a[i+1])
gcd_left.append(g)
g = a[n-1]
gcd_r... | p03061 |
import math
N = int(eval(input()))
A = [int(_) for _ in input().split()]
def gcd(x, y):
if x < y:
return gcd(y, x)
elif y == 0:
return x
else:
return gcd(y, x % y)
class SegmentTree():
def m(self, v1, v2): # ***monoid***
return gcd(v1, v2)
def ... | import math
N = int(eval(input()))
A = [int(_) for _ in input().split()]
def gcd(x, y):
if x < y:
return gcd(y, x)
elif y == 0:
return x
else:
return gcd(y, x % y)
class SegmentTree():
def m(self, v1, v2): # ***monoid***
return gcd(v1, v2)
def ... | p03061 |
N = int(eval(input()))
A = [int(_) for _ in input().split()]
class SegmentTree():
def __init__(self, array, m, e, size):
self.m = m # monoid
self.e = e # identity element
self.size = size # limit for array size
self.n = n = len(array) # array size
self.dat = d... | N = int(eval(input()))
A = [int(_) for _ in input().split()]
class SegmentTree():
def __init__(self, array, m, e, size):
"""
Parameters
----------
array : list
to construct segment tree from
m : func
binary operation of the monoid
... | p03061 |
N = int(eval(input()))
A = list(map(int, input().split()))
def gcd(a, b):
while b:
a, b = b, a%b
return a
def gcd_of_arr(arr):
cd = arr[0]
for i in range(1,len(arr)):
if cd==1:
return cd
cd = gcd(arr[i], cd)
return cd
ans = 0
for i in range(N):... | N = int(eval(input()))
A = list(map(int, input().split()))
def gcd(a, b):
while b:
a, b = b, a%b
return a
L, R = [0]*(N+1), [0]*(N+1)
for i in range(1,N+1):
L[i] = gcd(L[i-1], A[i-1])
R[N-i] = gcd(R[N+1-i], A[N-i])
ans = 0
for i in range(N):
ans = max(ans, gcd(L[i], R[i+1])... | p03061 |
#どっちで出すか注意, rstrip注意
#提出前に見返すこと！
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate
#from itertools import product
... | #どっちで出すか注意, rstrip注意
#提出前に見返すこと！
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate
#from itertools import product
... | p03061 |
import math
import itertools
n = int(eval(input()))
a = list(map(int, input().split()))
pf = [0]*(n+1)
pb = [0]*(n+1)
p = a[0]
for i in range(n):
p = math.gcd(p, a[i])
pf[i+1] = p
p = a[-1]
for i in range(-1, -n-1, -1):
p = math.gcd(p, a[i])
pb[i-1] = p
ans = [0]*n
for i in range(n):
ans[i] ... | import math
import itertools
n = int(eval(input()))
a = list(map(int, input().split()))
pf = [0] + list(itertools.accumulate(a, math.gcd))
pb = [0] + list(itertools.accumulate(reversed(a), math.gcd))
pb.reverse()
ans = [0]*n
for i in range(n):
ans[i] = math.gcd(pf[i], pb[i+1])
print((max(ans))) | p03061 |
import collections
from functools import reduce
def gcd(u,v):
if v:
return gcd(v, u % v)
else:
return u
n = int(input())
elems = list(map(int , input().split(' ')))
dpp = [ None ] * len(elems)
dps = [ None ] * len(elems)
for i in range(len(elems)): dpp[i] = reduce(gcd, elems[:i+1])
for i in range(l... | import collections
def gcd(u,v):
if v:
return gcd(v, u % v)
else:
return u
n = int(input())
elems = list(map(int , input().split(' ')))
dpp = [ None ] * len(elems)
dps = [ None ] * len(elems)
dpp[0] = elems[0]
for i in range(1,len(elems)):
dpp[i] = gcd(elems[i], dpp[i-1])
dps[len(elems) -1] = ... | p03061 |
def gcd(m,n):
x=max(m,n)
y=min(m,n)
if x==0:
return 0
while y!=0:
x,y=y,x%y
return x
n = int(eval(input()))
a = list(map(int, input().split()))
b = [0]
for i in range(n):
a[i],a[n-1]=a[n-1],a[i]
temp = a[0]
for j in range(n-1):
temp=gcd(temp,a[j])
if temp == 1:
... | def gcd(m,n):
x=max(m,n)
y=min(m,n)
while y!=0:
x,y=y,x%y
return x
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
l = [0]
r = [0]
for i in range(n):
l.append(gcd(a[i],l[i]))
r.append(gcd(a[n-1-i],r[i]))
for i in range(n):
b.append(gcd(l[i],r[n-1-i]))
print(... | p03061 |
from math import gcd
N, *A = list(map(int, open(0).read().split()))
acc_l = [0] * (N + 1)
acc_r = [0] * (N + 1)
for i in range(1, N + 1):
acc_l[i] = gcd(acc_l[i - 1], A[i - 1])
acc_r[i] = gcd(acc_r[i - 1], A[-i])
ans = 0
for i in range(N + 1):
ans = max(ans, gcd(acc_l[i], acc_r[N - i - 1]))
... | from math import gcd
N, *A = list(map(int, open(0).read().split()))
acc_l = [0]
acc_r = [0]
for i in range(N):
acc_l.append(gcd(acc_l[-1], A[i]))
acc_r.append(gcd(acc_r[-1], A[N - i - 1]))
ans = 0
for i in range(N):
ans = max(ans, gcd(acc_l[i], acc_r[N - i - 1]))
print(ans)
| p03061 |
def gcd(a, b):
while True:
a, b = b, a % b
if b == 0:
break
return a
def compute_gcd(ns):
a = gcd(ns[0], ns[1])
for i in range(2, len(ns)):
a = gcd(a, ns[i])
return a
n = int(eval(input()))
nums = list(map(int, input().split()))
if n == 2:
... | def gcd(a, b):
while True:
a, b = b, a % b
if b == 0:
break
return a
n = int(eval(input()))
nums = list(map(int, input().split()))
if n == 2:
print((max(nums)))
else:
l_gcds = [nums[0]]
r_gcds = [nums[-1]]
for i in range(1, n - 1):
l = gcd(... | p03061 |
N=int(eval(input()))
nums = [int(i) for i in input().split()]
def gcd(x, y):
if x < y:
x = x ^ y
y = x ^ y
x = x ^ y
div = x % y
while div != 0:
x = y
y = div
div = x % y
return y
memo = {}
memo[(0, 1)] = nums[0]
memo[(N-1, N)] = nums[N-... | N=int(eval(input()))
nums = [int(i) for i in input().split()]
def gcd(x, y):
if x < y:
x = x ^ y
y = x ^ y
x = x ^ y
div = x % y
while div != 0:
x = y
y = div
div = x % y
return y
memo = {}
memo[(0, 1)] = nums[0]
memo[(N-1, N)] = nums[N-... | p03061 |
N = int(eval(input()))
A = [int(n) for n in input().split()]
import math, copy
def all_gcd(l):
a = l[0]
for i in range(1,len(l)):
b = l[i]
a = math.gcd(a, b)
return a
max_gcd = 0
for n in A:
copied_A = copy.copy(A)
copied_A.remove(n)
max_gcd = max(max_gcd, all_... | import math
N = int(eval(input()))
A = [int(n) for n in input().split()]
gcd_l = [0]
gcd_r = [0]
for i in range(N):
gcd_l.append(math.gcd(gcd_l[i], A[i]))
gcd_r.append(math.gcd(gcd_r[i], A[-(i+1)]))
gcd_r = gcd_r[::-1]
max_gcd = 0
for i in range(N):
max_gcd = max(max_gcd, math.gcd(gcd... | p03061 |
import math
import copy
def gcd(a,b):
if b==0:return a
return gcd(b,a%b)
N=int(eval(input()))
A=list(map(int,input().split()))
if N==2:
print((max(A)))
exit()
else:
max=0
for i in range(N):
x = copy.deepcopy(A)
del x[i]
element = gcd(x[0], x[1])
... | def gcd(a,b):
if b==0:
return a
return gcd(b,a%b)
N=int(eval(input()))
A=list(map(int,input().split()))
AL=[0]*N
AR=[0]*N
for i in range(N):
if i == 0:
AL[0] = A[0]
AR[0] = A[N-1]
else:
AL[i] = gcd(AL[i-1],A[i])
AR[i] = gcd(AR[i-1],A[N-i-1])
m... | p03061 |
def gcd(a, b):
if b == 0:
return a
elif a == 0:
return b
else:
return gcd(b, a % b)
def solve(n, a):
l, r = [], []
l = [0 for i in range(n + 1)]
r = [0 for i in range(n + 1)]
r[n] = 0
for i in range(0, n):
if i == 0:
l[0] ... | def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def solve(n, a):
l = [0] * n
r = [0] * (n + 1)
for i in range(1, n):
l[i] = gcd(l[i - 1], a[i - 1])
for i in range(n - 1, 0, -1):
r[i] = gcd(r[i + 1], a[i])
m = 0
for i in range(n):
... | p03061 |
import math
from functools import reduce
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 1
for i in range(N):
g = reduce(math.gcd,A[:i]+A[i+1:])
ans = max(ans,g)
print(ans) | import math
from collections import deque
N = int(eval(input()))
A = list(map(int,input().split()))
M = 0
L = deque([0])
R = deque([0])
for i in range(1,N+1):
L.append(math.gcd(L[-1],A[i-1]))
R.appendleft(math.gcd(R[0],A[N-i]))
for j in range(N):
m = math.gcd(L[j],R[j+1])
M = max(M,m)
pri... | p03061 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
def gcd(x, y):
if x < y:
x, y = y, x
if y == 0:
return x
return gcd(x%y, y)
L = [0]
R = [0]
for i in range(N):
L.append(gcd(A[i], L[i]))
R.append(gcd(A[-i-1], R[i]))
R.reverse()
M = []
for i in range(... | N = int(eval(input()))
A = [int(i) for i in input().split()]
def gcd(x, y):
if x < y:
x, y = y, x
while y != 0:
x, y = y, x%y
return x
L = [0]
R = [0]
for i in range(N):
L.append(gcd(A[i], L[i]))
R.append(gcd(A[-i-1], R[i]))
R.reverse()
M = []
for i in range(0,... | p03061 |
"""
最大公約数をもっとも落としている数Xを削る（＝見ないことにする）、という発想に置き換える。
方針１：
Xを特定する。
どうやって特定する？
各Aを素因数分解する。このとき、他の
方針２：
約数をカウントする。すべてのAの約数をカウントして総和する。
このとき、カウントがN個になる約数は初期状態での公約数である。
一方で、カウントがN-1個の約数は、その約数をもたない数が一つだけ存在するということなので、
そのような数Aを削ったときに、公約数になる。
したがって、カウントがN-1個以上の約数のうち最大のものが、数Xを削ったときの最大公約数である。
問題はどうやって約数をカウントするかだ。愚直にやると... | def gcd(a,b):
if a == 0 or b == 0:
return max(a,b)
return a if b==0 else gcd(b,a%b)
N = int(eval(input()))
A = list(map(int,input().split()))
rA = A[::-1]
LEFT = [0]
g = A[0]
for i in range(N):
g = gcd(g,A[i])
LEFT.append(g)
RIGHT = [0]
g = rA[0]
for i in range(N):
g = g... | p03061 |
import math
import copy
import sys
import bisect
input = sys.stdin.readline
def divide(x): #約数配列
div=[1]
check=2
for check in range(1,int(x**0.5)+1):
if(x%check==0):
div.append(check)
div.append(x//check)
return div
def main():
n=int(eval(input()))
... | def gcd(a, b): #最大公約数
if b == 0:
return a
else:
return gcd(b, a%b)
def main():
n=int(eval(input()))
a = list(map(int,input().split()))
L=[a[0] for _ in range(n)]
R=[a[n-1] for _ in range(n)]
for i in range(1,n):
L[i]=gcd(L[i-1],a[i])
for i in... | p03061 |
n = int(input())
a = input().split()
cnt = 0
for i in a:
a[cnt] = int(i)
cnt += 1
chk = {}
chk2 = {}
def make_divisors(k):
divisors = []
for i in range(1, int(k**0.5)+1):
if k % i == 0:
if i in chk:
chk[i] += 1
else:
chk[... | n = int(input())
a = input().split()
cnt = 0
for i in a:
a[cnt] = int(i)
cnt += 1
chk = {}
chk2 = {}
def make_divisors(k):
divisors = []
for i in range(1, int(k**0.5)+1):
if k % i == 0:
if i in chk:
chk[i] += 1
else:
chk[... | p03061 |
memo = {}
def gcd(a, b):
if (a, b) in list(memo.keys()):
return memo[(a, b)]
if b == 0:
return a
g = gcd(b, a % b)
memo[(a, b)] = g
return g
n = eval(input())
a_list = list(map(int, input().split()))
max_g = 0
for exclude in range(n):
g = a_list[0] if exclude > 0... | def gcd(a, b):
if b == 0:
return a
g = gcd(b, a % b)
return g
n = eval(input())
a_list = list(map(int, input().split()))
gs1 = [None] * n
gs1[0] = a_list[0]
for i in range(1, n):
gs1[i] = gcd(gs1[i - 1], a_list[i])
gs2 = [None] * n
gs2[n - 1] = a_list[n - 1]
for i in reversed(... | p03061 |
import functools
# import math
def solve():
N = int(eval(input()))
A = [int(i) for i in input().split()]
# gcd = functools.reduce(math.gcd, A)
max_gcd = 1
for i in range(N):
A_ = A.copy()
A_.remove(A[i])
max_gcd = max(max_gcd, functools.reduce(gcd, A_))
pri... | # 解説を参考に作成
# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
def gcd(a, b):
"""最大公約数"""
a, b = (a, b) if a >= b else (b, a)
if b == 0:
return a
return gcd(b, a % b)
# from decorator import stop_watch
#
#
# @stop_watch
def solve(N... | p03061 |
mod = 10 ** 9 + 7
mod2 = 2**61+1
from collections import deque
import heapq
from bisect import bisect_left, insort_left, bisect_right
def iip(listed=True):
ret = [int(i) for i in input().split()]
if len(ret) == 1 and not listed:
return ret[0]
return ret
def iip_ord():
return [ord(... | mod = 10 ** 9 + 7
mod2 = 2**61+1
from collections import deque
import heapq
from bisect import bisect_left, insort_left, bisect_right
def iip(listed=True):
ret = [int(i) for i in input().split()]
if len(ret) == 1 and not listed:
return ret[0]
return ret
def iip_ord():
return [ord(... | p03061 |
#!/usr/bin/env python3
import sys
import math
from collections import Counter
import collections
INF = float("inf")
def factorial(n):
# 試し割りによる素因数分解
prime_count = collections.Counter()
for i in range(2, int(math.sqrt(n)) + 2):
while n % i == 0:
n /= i
prime_... | #!/usr/bin/env python3
import sys
import math
from collections import Counter
import collections
INF = float("inf")
def factorial(n):
# 試し割りによる素因数分解
prime_count = collections.Counter()
for i in range(2, int(math.sqrt(n)) + 2):
while n % i == 0:
n /= i
prime_... | p03061 |
from functools import reduce
def gcd_base(x, y):
if x >= y:
while y != 0:
x, y = y, x % y
return x
else:
while x != 0:
y, x = x, y % x
return y
def gcd(numbers):
return reduce(gcd_base, numbers)
N = int(eval(input()))
A = list(map(in... | def gcd(x, y):
if x >= y:
while y != 0:
x, y = y, x % y
return x
else:
while x != 0:
y, x = x, y % x
return y
N = int(eval(input()))
A = list(map(int, input().split()))
L = [0, 0]
for ai in A:
L.append(gcd(L[-1], ai))
R = [0, 0]
for... | p03061 |
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
input = sys.stdin.readline
# bisect_left(lists, 3)
# bisect_right(lists, 3)
def main():
N = int(eval(input()))
A = input().split()
A = [int(s) for s in A]
ans = -1
Li... | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
input = sys.stdin.readline
# bisect_left(lists, 3)
# bisect_right(lists, 3)
def main():
N = int(eval(input()))
A = input().split()
A = [int(s) for s in A]
base = -1
... | p03061 |
class SegmentTree:
def __init__(self, seq, func="min"):
if func=="min":
self.f = min
self.e = float('inf')
if func=="max":
self.f = max
self.e = -float('inf')
if func=="gcd":
self.f = gcd
self.e = 0
se... | def gcd(a, b):
if b==0:
return a
while b>0:
a, b = b, a%b
return a
N = int(eval(input()))
A = list(map(int, input().split()))
S_left = [0 for _ in range(N+1)]
S_right = [0 for _ in range(N+1)]
for i in range(N):
S_left[i+1] = gcd(S_left[i], A[i])
S_right[i+1] = gcd(S_righ... | p03061 |
n=int(eval(input()))
l=list(map(int,input().split()))
gcds=[]
def gcd(a,b):
if b==0:
return a
return gcd(b,a%b)
for i in range(len(l)):
omitlist=list(l)
omitlist.pop(i)
n=len(omitlist)
if n==1:
gcds.append(omitlist[0])
else:
element = gcd(omitlist[... | n=int(eval(input()))
left=list(map(int,input().split()))
right=list(left)
right.reverse()
gcds=[]
gcdleft=[]
gcdright=[]
gcdleft.append(left[0])
gcdright.append(right[0])
def gcd(a,b):
if b==0:
return a
return gcd(b,a%b)
if n==2:
gcds.append(gcdleft[0])
gcds.append(gcdright[... | p03061 |
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a%b)
def gcd_arr(arr, N):
if N == 2:
return gcd(arr[0], arr[1])
elif N == 1:
return arr[0]
else:
mid = N // 2
return gcd(gcd_arr(arr[:mid], mid), gcd_arr(arr[mid:], N-mid))
def gcd... | def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a%b)
def solve():
N = int(input())
arr = [int(_) for _ in input().split()]
left = [0] * (N + 1)
right = [0] * (N + 1)
left[0] = 0
right[N] = 0
for i in range(1, N+1):
left[i] = gcd(left[i - ... | p03061 |
import copy
n = int(eval(input()))
l = sorted(list(map(int, input().split())))
b = []
def gcd(a,b):
while b:
a, b = b, a % b
return a
if n == 2:
print((max(l[0],l[1])))
elif n == 3:
print((max(gcd(l[0],l[1]),gcd(l[0],l[2]),gcd(l[2],l[1]))))
else:
for i in range(n):
tmp = copy.copy(l)
tmp.pop... | def gcd(a,b):
while b:a,b=b,a%b
return a
n,a,b=int(eval(input())),list(map(int,input().split())),[]
if n==2:print((max(a[0],a[1])))
elif n==3:print((max(gcd(a[0],a[1]),gcd(a[0],a[2]),gcd(a[1],a[2]))))
else:
no,mi=a[0],a[0]
for i in range(1,n):
s=gcd(no,a[i])
if s!=no:
no=max(s,mi)
... | p03061 |
n=int(eval(input()))
A=list(map(int,input().split()))
divsors=[]
for i in range(n):
for j in range(1,int(A[i]**(1/2)+1)):
if A[i]%j==0:
divsors.append(j)
if j!=A[i]//j:
divsors.append(A[i]//j)
set_divsors=sorted(list(set(divsors)))[::-1]
for i in range(len(set_divsors)):
a=divsors... | n=int(eval(input()))
A=[]*n
A[:]=list(map(int,input().split()))
def gcd(a,b):
while b:
a,b=b,a%b
return a
left=[0]*n
right=[0]*n
for i in range(1,n):
left[i]=gcd(left[i-1],A[i-1])
right[n-1-i]=gcd(right[n-i],A[n-i])
ans=0
for i,j in zip(left,right):
ans=max(ans,gcd(i,j))
... | p03061 |
from functools import reduce
def gcd(a,b):
while b!=0:
a,b=b,a%b
return a
def gcd_list(numbers):
return reduce(gcd, numbers)
N = int(eval(input()))
A = list(map(int, input().split()))
max_ans = 0
for i in range(len(A)):
tmp = A[:i] + A[1+i:]
ans = gcd_list(tmp)
if max_ans < ... | def gcd(a,b):
while b!=0:
a,b=b,a%b
return a
N = int(eval(input()))
A = list(map(int, input().split()))
# 累積最大公約数的な
head = []
tail = []
head.append(A[0])
tail.append(A[-1])
for i, j in zip(A[1:], A[N-2::-1]):
head.append(gcd(head[-1], i))
tail.append(gcd(tail[-1], j))
ans = 0
for i ... | p03061 |
def gcd(a, b):
while b:
a, b = b, a % b
return a
N = int(eval(input()))
A = list(map(int, input().split()))
d = {}
m = []
if len(A) == 2:
print((max(A)))
exit()
for i in range(N):
_A = []
_A.extend(A[0:i])
_A.extend(A[i+1:N])
for j in range(1, len(_A)):
... | def gcd(a, b):
while b:
a, b = b, a % b
return a
N = int(eval(input()))
A = list(map(int, input().split()))
L = [0] * N
R = [0] * N
L[0] = A[0]
R[N-1] = A[-1]
for n in range(1, N):
L[n] = gcd(L[n - 1], A[n])
for n in reversed(list(range(N-1))):
R[n] = gcd(R[n + 1], A[n])
... | p03061 |
from collections import deque
def gcm(a, b):
if a < b:
a = a+b
b=a-b
a = a-b
if b == 0:
return a
else:
r = a%b
return b if r == 0 else gcm(b, r)
N = int(eval(input()))
A = list(map(int, input().split()))
L = deque([0])
for i in range(1, N):
L.append(gcm(L[-1],A[i-1]))
R =... | import sys
sys.setrecursionlimit(10**5)
def GCM(a, b):
if a < b:
a += b
b = a-b
a -= b
if a % b == 0:
return b
else:
return GCM(b, a%b)
N = int(eval(input()))
A = list(map(int, input().split()))
l2r =[]
r2l = []
g = A[0]
for a in A:
g = GCM(g, a)
l2r.append(g)
g = A[-1... | p03061 |
def gcd(x, y):
if y == 0:
return x
return gcd(y, x % y)
class SEGMENT_TREE:
def __init__(self, N):
self.N = N
self.tree = [0] * (2 * N) # 問題により修正
def init(self, arr):
N = self.N
for i in range(N):
self.tree[N + i] = arr[i]
fo... | def gcd(x, y):
if y == 0:
return x
return gcd(y, x % y)
class SEGMENT_TREE:
def __init__(self, N):
self.N = N
self.tree = [0] * (2 * N) # 問題により修正
def init(self, arr):
N = self.N
for i in range(N):
self.tree[N + i] = arr[i]
fo... | p03061 |
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(reverse=True)
return divisors
N = int(eval(input()))
A = sorted([int(x) for x ... | 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)
return divisors
N = int(eval(input()))
A = sorted([int(x) for x in input().split()])
ans = 1
... | p03061 |
# 2019-11-18 00:38:19(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# import re
# import heapq
# import a... | # 2019-11-18 00:38:19(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# import re
# import heapq
# import a... | p02918 |
N,K=list(map(int, input().split()))
S=list(input())
L=[]
now=None
for i,s in enumerate(S):
if i==0:
now=s
cnt=1
elif now==s:
cnt+=1
elif now!=s:
L.append([now,cnt])
cnt=1
now=s
else:
L.append([now,cnt])
l=len(L)
for i in range(1,min(K*2,l),2):
s=L[i][0]
if s=="L": L[i][0]="... | # -*- coding: utf-8 -*-
import sys
N,K=list(map(int, sys.stdin.readline().split()))
S=sys.stdin.readline().strip()
L=[]
cnt=0
for i,x in enumerate(S):
if i==0:
cnt+=1
prev=x
else:
if prev==x: #前の文字と今の文字が同じ
cnt+=1
else: #前の文字と今の文字が異なる
L.... | p02918 |
import sys,math,collections,itertools
input = sys.stdin.readline
N,K=list(map(int,input().split()))
S=input().rstrip()
ori_num=0
turn_num=0
for i in range(N):
if i>0:
if S[i-1] =='L' and S[i] =='L':
ori_num += 1
if S[i-1] != S[i]:
turn_num +=1
if... | import sys,math,collections,itertools
input = sys.stdin.readline
N,K=list(map(int,input().split()))
S=input().rstrip()
ori_num=0
turn_num=0
for i in range(N):
if i>0:
if S[i-1] =='L' and S[i] =='L':
ori_num += 1
if S[i-1] != S[i]:
turn_num +=1
if... | p02918 |
import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n, k = list(map(int, input().rstrip('\n').split()))
s = str(input().rstrip('\n'))
cnt = 0
for i in range(1, n):
if s[i-1] == s[i]:
cnt += 1
print((min(n - 1, cnt + k * 2)))
if __name__... | import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n, k = list(map(int, input().rstrip('\n').split()))
s = str(input().rstrip('\n'))
cnt = 0
for i in range(1, n):
if s[i] == s[i-1]:
cnt += 1
print((min(n - 1, cnt + k * 2)))
if __name__... | p02918 |
# -*- coding: utf-8 -*-
# https://atcoder.jp/contests/abc140/tasks/abc140_d
N, K = list(map(int, input().split()))
S = input().strip()
happiness = 0
for idx in range(1, N):
if S[idx] == S[idx - 1]:
happiness += 1
# 一人しか幸せにできないときがあるか?
#
# あっ...これは不要なのでは...
# 単に後述の幸せの最大値で丸めればよいのでは
# always_t... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
N, K = list(map(int, input().split()))
S = input().strip()
# 初期の幸せ度を調べる
happiness = 0
previous_face = S[0]
for i in range(1, N):
if S[i] == previous_face:
happiness += 1
else:
previous_face = S[i]
# 並べ替え後の幸せ度
happiness = happiness... | p02918 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, k = list(map(int, input().split()))
s = input().rstrip()
def split(s):
new = [s[0]]
for i in range(n-1):
if s[i] != s[i+1]:
new.append(s[i+1])
else:
new[-1] += s[i+1]
return new
def... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, k = list(map(int, input().split()))
s = input().rstrip()
def count(s):
cnt = 0
for i in range(n):
if i+1 < len(s) and s[i] == 'R' and s[i+1] == 'R':
cnt += 1
elif i-1 >= 0 and s[i] == 'L' and s[i-1] == ... | p02918 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
from collections import deque
def getN():
return int(eval(input()))
def getList():
return list(map(int, input().split()))
import math
n, k = getList()
s = input().strip()
s = s
state = "X"
cur_seq = 0
seq_nums = []
n_separ... | import sys
from collections import defaultdict, deque, Counter
import math
# import copy
from bisect import bisect_left, bisect_right
# import heapq
# sys.setrecursionlimit(1000000)
# input aliases
input = sys.stdin.readline
getS = lambda: input().strip()
getN = lambda: int(eval(input()))
getList... | p02918 |
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() for _ in range(n)... | 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() for _ in range(n)... | p02918 |
import sys
from itertools import groupby
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K = list(map(int, readline().split()))
S = readline().strip()
ans = groups = 0
for... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K = list(map(int, readline().split()))
S = readline().strip()
ans = 0
for i in range(N-1):
if S[i] == S[... | p02918 |
import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
d... | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
d... | p03089 |
import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
d... | N = int(input())
B = [int(x) - 1 for x in input().split()]
# print('b', B)
ans = []
while B:
popped = -1
for i in reversed(range(len(B))):
if B[i] == i:
ans.append(i + 1)
popped = B.pop(i)
break
if popped == -1:
print(-1)
quit()
prin... | p03089 |
n=int(eval(input()))
l=list(map(int,input().split()))
ansL=[]
c=0
f=0
for j in range(n):
for i in range(len(l)-1,-1,-1):
if l[i]==i+1:
ansL.append(l.pop(i))
c+=1
break
if c!=n:
print((-1))
else:
for k in range(len(ansL)-1,-1,-1):
print((ansL[k])) | n=int(eval(input()))
l=list(map(int,input().split()))
L=[]
c=0
for j in range(n):
for i in range(len(l)-1,-1,-1):
if l[i]==i+1:
L.insert(0,l.pop(i))
c+=1
break
if c!=n:
print((-1))
else:
for k in range(len(L)):
print((L[k])) | p03089 |
n=int(eval(input()))
a=[]
b=list(map(int,input().split()))
for i in range(n):
for j in range(n-i-1,-1,-1):
if b[j]==j+1:
a.append(b.pop(j))
break
if len(a)<n:
print((-1))
exit()
a.reverse()
for i in a:
print(i) | n=int(eval(input()))
a=[]
b=list(map(int,input().split()))
for i in range(n):
for j in range(n)[n-i-1::-1]:
if b[j]==j+1:
a.append(b.pop(j))
break
if len(a)<n:
print((-1))
exit()
a.reverse()
for i in a:
print(i) | p03089 |
def main():
n = int(eval(input()))
b = list(map(int, input().split()))
f = True
ans = []
while len(b) > 0:
sf = True
for i in reversed(list(range(len(b)))):
if b[i] == i+1:
b.pop(i)
ans.append(i+1)
sf = False
... | def main():
n = int(eval(input()))
b = list(map(int, input().split()))
ans = []
f = True
for i in reversed(list(range(n))):
F = True
for j in reversed(list(range(i+1))):
if b[j] == j+1:
ans.append(b.pop(j))
F = False
... | p03089 |
N = int(eval(input()))
b = list(map(int, input().split()))
a = [1, 2, 3, 4, 5]
def f(a, ans):
if len(a) == 0:
for i in range(len(ans)):
print((ans[len(ans) - i - 1]))
exit()
for i in range(len(a)):
if i + 1 == a[i]:
f(a[0:i] + a[i + 1:len(a)], ans + [i... | N = int(eval(input()))
b = list(map(int, input().split()))
a = [1, 2, 3, 4, 5]
def f(a, ans):
if len(a) == 0:
for i in range(len(ans)):
print((ans[len(ans) - i - 1]))
exit()
for i in range(len(a) - 1, -1, -1):
if i + 1 == a[i]:
f(a[0:i] + a[i + 1:len(a... | p03089 |
def main():
n, *b = list(map(int, open(0).read().split()))
m = []
for k in range(1, n+1):
for i in range(n - k, -1, -1):
if b[i] == i + 1:
b.pop(i)
m.append(i+1)
break
if len(b) > 0:
print((-1))
else:
... | def main():
n, *b = list(map(int, open(0).read().split()))
m = []
for k in range(1, n + 1):
for i in range(n - k, -1, -1):
if b[i] == i + 1:
b.pop(i)
m.append(i + 1)
break
else:
print((-1))
exit(... | p03089 |
def BFS(Bs,del_idx,result):
if Bs==[1]:
return result
if del_idx!=None:
del Bs[del_idx]
for i,b in enumerate(Bs):
if i+1==b:
DBs=Bs.copy()
result.append(i+1)
out=BFS(DBs,i,result)
if out:
return out
... | def BFS(Bs,del_idx,result):
if Bs==[1]:
return result
if del_idx!=None:
del Bs[del_idx]
for i,b in enumerate(Bs):
if b>i+1:
return None
for i,b in enumerate(Bs):
if i+1==b:
DBs=Bs.copy()
result.append(i+1)... | p03089 |
def main():
N = int(eval(input()))
B = list(map(int, input().split()))
Bs = [B]
Rs = [[]]
for i in range(N):
Bs_new = []
Rs_new = []
for b,r in zip(Bs,Rs):
for j in range(N-i):
if (b[j] == j+1):
tmp = list(b)
... | def check(b, n):
if (1 == n):
if (1 == b[0]):
return [1]
else:
return []
else:
for (i,b_) in enumerate(b):
if ((i+1) == b_):
tmp = list(b)
del tmp[i]
res = check(tmp, n-1)
#pri... | p03089 |
n = int(eval(input()))
b = list(map(int, input().split()))
for i in range(n):
if b[i] > i+1:
print((-1))
break
else:
ans = []
while len(b) > 1:
# print(ans,b)
c = len(ans)
f = b[0]
for i in range(1, len(b))[::-1]:
if b[i] == i + 1:
# print("check", b[i:])
... | n = int(eval(input()))
b = list(map(int, input().split()))
for i in range(n):
if b[i] > i+1:
print((-1))
break
else:
ans = []
while len(b) > 0:
f = b[0]
for i in range(len(b))[::-1]:
if b[i] == i + 1:
ans.append(b.pop(i))
break
for i in range(n)[::-1]:
... | p03089 |
N = int(eval(input()))
B = list(map(int, input().split()))
def dfs(stack, B):
if len(B)==1:
if B[0]==1:
stack.append(1)
return stack
else: return None
else:
tmp = []
flag = False
for i, b in enumerate(B):
stack_ = stack + ... | N = int(eval(input()))
B = list(map(int, input().split()))
stack = []
for i in range(N):
tmp = []
flag = True
for j in range(len(B)):
if B[j]==j+1:
tmp.append(j)
if tmp:
tmp.sort(reverse=True)
ans = tmp[0]
B = B[:ans] + B[ans+1:]
stack.a... | p03089 |
import sys
import time
import copy
N = int(eval(input()))
b = [int(b) for b in input().split()]
h = {}
t1 = time.time()
def f(b):
t2 = time.time()
if t2 - t1 > 1.9:
print((-1))
sys.exit()
key = "".join([str(x) for x in b])
if key in h:
return copy.copy(h[key])
if len(b... | import sys
import time
import copy
N = int(eval(input()))
b = [int(b) for b in input().split()]
h = {}
t1 = time.time()
def f(b):
t2 = time.time()
if t2 - t1 > 1.5:
print((-1))
sys.exit()
key = "".join([str(x) for x in b])
if key in h:
return copy.copy(h[key])
if len(b... | p03089 |
LIST=""
LIST=list(LIST)
c=0
def func(S):
global LIST
global c
if(len(S)==0):
c=1
if(c==1):
for i in range(len(LIST)-1,-1,-1):
print((LIST[i]))
exit()
So=S[::]
for i in range(len(S)):
S=So[::]
if(S[i]==(i+1)):
L... | N=int(eval(input()))
S=list(map(int,input().split()))
LIST=list("")
for i in range(N):
if((S[i] - i)>1):
print("-1")
exit()
while(len(S)>0):
c=10**10
for i in range (len(S)):
if(S[i]==i+1):
c=i
if(c==(10**10)):
print("-1")
exit()
... | p03089 |
n = int(eval(input()))
a = list(map(int,input().split()))
def solve(l, ans):
if l == []:
return ans
cnd = []
for i in range(len(l)):
if l[i] == i+1:
cnd.append(i)
if cnd == []:
return 0
for ind in cnd:
ans.append(ind+1)
cond = solve(l[0:ind] + l[(ind+1):(len(l)+1)], ans)
if co... | n = int(eval(input()))
a = list(map(int,input().split()))
def solve(l,ans):
if l == []:
return ans
for i in range(len(l)-1,-1,-1):
if l[i] == i+1:
ans.append(i+1)
return solve(l[:i]+l[i+1:], ans)
return 0
A = solve(a,[])
if A == 0:
print((-1))
else:
for a in A[::-1]:
print(a) | p03089 |
def limited_insertion(N: int, B: list)->list:
# print(N, B)
if N == 1:
return [1] if B[0] == 1 else []
# 後ろからみていって、インデックス(1-indexed)と
# その位置の配列(B)の値が等しい最初のペアを探す。
# なければ失敗
for i in range(N, 0, -1):
if i == B[i-1]:
# 見つけたら、それを除いた配列に関して
# 再帰的に同じことを行... | def limited_insertion(N: int, B: list) -> list:
op = []
for i in range(N-1, -1, -1):
for j in range(i, -1, -1):
b = B[j]
if i+1 < b:
# invalid number
return []
if j+1 == b:
# remove b[j]
B = B[:... | p03089 |
import copy
def dfs(i, operations, rest_bs):
if i == 0 and len(rest_bs) == 0:
return operations
for k, b in enumerate(rest_bs):
j = k + 1
if j <= i and j == b:
copied_operations = copy.deepcopy(operations)
copied_operations.append(j)
res =... | if __name__ == "__main__":
N = int(eval(input()))
bs = list(map(int, input().split()))
operations = []
for i in range(N):
j_remove = -1
for j in range(N-i):
if bs[j] == j+1:
j_remove = j
if j_remove == -1:
print("-1")
... | p03089 |
N = int(eval(input()))
b = list(map(int, input().split()))
def dfs(c):
if len(c) == 0:
return []
for i in range(1, len(c)+1):
if c[i-1] > i:
return False
if c[i-1] == i:
cc = c.copy()
del cc[i-1]
res = dfs(cc)
if res is not False:
res.append(i)
... | N = int(eval(input()))
b = list(map(int, input().split()))
def dfs(c):
if len(c) == 0:
return []
for i in range(len(c), 0, -1):
if c[i-1] > i:
return False
if c[i-1] == i:
cc = c.copy()
del cc[i-1]
res = dfs(cc)
if res is not False:
res.append(i)
... | p03089 |
import sys
from collections import Counter
def input():
return sys.stdin.readline().strip()
# sys.setrecursionlimit(100000)
def helper(cur: list, B, candi, ans, rest):
if rest == 0:
if cur == B:
for i in ans:
print(i)
sys.exit()
else:
... | import sys
def input():
return sys.stdin.readline().strip()
# sys.setrecursionlimit(100000)
def main():
n = int(input().strip())
B = [int(i) for i in input().strip().split()]
ans = []
ptr = len(B)
while ptr > 0:
if B[ptr - 1] == ptr:
ans.append(B.pop(ptr - ... | p03089 |
n=int(eval(input()))
ball = list(map(int,input().split()))
ans = []
count = 0
while len(ball)>0:
count += 1
for i in range(len(ball)-1,-1,-1):
#print(ball,i)
if i+1 ==ball[i]:
move = ball.pop(i)
ans.insert(0,move)
break
if count ==10000... | n = int(eval(input()))
b = list(map(int,input().split()))
Flag = True
memo = []
while Flag:
Flag = False
index = -1
for i, v in enumerate(b):
if i == v-1:
Flag = True
index = i
if index != -1:
m = b.pop(index)
memo.append(m)
if len(b)... | p03089 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import sys
from itertools import chain
from functools import reduce
from collections import OrderedDict, Counter, deque
import operator
def IA(): return [int(x) for x in input().split()]
def IM(N): return [IA() for _ in range(N)]
N = int(input())
B ... | #!/bin/env python3
IS = lambda: int(input())
IA = lambda: [int(x) for x in input().split()]
N = IS()
B = IA()
def f(b, n):
ans = []
while b:
for i in range(len(b), 0, -1):
j = i - 1
if i == b[j]:
ans.append(i)
b = b[:j] + b[j+1:]
... | p03089 |
N=int(eval(input()))
b=list(map(int,input().split()))
tmp=-1
idx=0
count=1
flag=True
ans=[]
while(len(b)):
#print(idx)
if idx<len(b):
if b[idx]==count:
tmp=idx
idx+=1
count+=1
else:
idx+=1
count+=1
if idx>(len(b)-... | N = int(eval(input()))
b = list(map(int,input().split()))
ans = []
for i in range(N):
for j in range(len(b)-1,-1,-1):
if b[j]==(j+1):
ans += [b[j]]
del b[j]
break
if len(b)!=0:
print((-1))
exit()
for i in range(N):
print((ans[N-1-i])) | p03089 |
def main():
if 'get_ipython' not in globals():
# For Subsession
N = int(eval(input()))
# b = list(map(int, input().split()))
b = [int(i) for i in input().split()]
else:
# b = [1,2,1]
# b = [2,2]
b = [1,1,1,2,2,1,2,3,2]
N = len(b)
if check(b,N) != True:
print(... | import sys
def main():
if 'get_ipython' not in globals():
# For Subsession
N = int(eval(input()))
b = [int(i) for i in input().split()]
else:
# b = [1,2,1]
# b = [2,2]
b = [1,1,1,2,2,1,2,3,2]
N = len(b)
ans = []
while True:
for i in range(N-1,-1,-1):
if... | p03089 |
N=int(eval(input()))
B=list(map(int,input().split(' ')))
def dfs(n,B,ans):
if n==0:
return ans[::-1]
else:
for num,i in enumerate(B):
if num+1==i:
res = dfs(n-1,B[:num]+B[num+1:],ans+[i])
if res:
return res
return... | N=int(eval(input()))
B=list(map(int,input().split(' ')))
ans = []
for i in range(N):
for n,j in enumerate(B[::-1]):
if N-i-n==j:
ans.append(B.pop(N-i-n-1))
break
if len(ans)==N:
for i in ans[::-1]:
print(i)
else:
print((-1)) | p03089 |
N = int(eval(input()))
b_list = list(map(int, input().split()))
generate_seq = []
def is_ok(b):
len_b = len(b)
if len_b == 1 and b[0] == 1:
generate_seq.append(1)
return True
processing = []
for idx in range(len_b):
if b[idx] != idx + 1:
processing.... | N = int(eval(input()))
b_list = list(map(int, input().split()))
generate_seq = []
def is_ok(b):
len_b = len(b)
if len_b == 1 and b[0] == 1:
generate_seq.append(1)
return True
for idx, val in enumerate(b):
if idx + 1 < val:
return False
processing ... | p03089 |
import sys
sys.setrecursionlimit(10**6)
n = int(eval(input()))
b = list(map(int , input().split()))
def dfs(s, ans):
#print(s, ans)
if len(s) == 0:
print(('\n'.join(map(str, reversed(ans)))))
exit()
return
for i in range(len(s)):
if s[i] == i+1:
s1... | import sys
sys.setrecursionlimit(10**6)
n = int(eval(input()))
b = list(map(int , input().split()))
def dfs(s, ans):
if len(s) == 0:
print(('\n'.join(map(str, reversed(ans)))))
exit()
return
for i in range(len(s)):
#if s[i] == i+1:
#if s[i] == i+1 and max(s... | p03089 |
import sys
sys.setrecursionlimit(10**6)
n = int(eval(input()))
b = list(map(int , input().split()))
def dfs(s, ans):
if len(s) == 0:
print(('\n'.join(map(str, reversed(ans)))))
exit()
return
for i in range(len(s)):
#if s[i] == i+1:
#if s[i] == i+1 and max(s... | n = int(eval(input()))
b = list(map(int , input().split()))
def f(c):
for i in reversed(list(range(len(c)))):
if c[i] == i+1:
return (c[i], c[:i] + c[i+1:])
return (-1, c)
ans = []
for i in range(n):
(a, b) = f(b)
if a == -1:
print((-1))
exit()
an... | p03089 |
import sys
sys.setrecursionlimit(2147483647)
INF=float('inf')
MOD=10**9+7
input=sys.stdin.readline
n=int(eval(input()))
s=list(map(int,input().split()))
import copy
def DEF(ary,ary2):
#print(ary,ary2)
global n,s
if len(ary2)==n:
#print(ary)
if ary==s:
for item in ... | n=int(eval(input()))
s=list(map(int,input().split()))
result=[]
for i in range(n):
posi=-1
for index,ss in enumerate(s):
if ss==index+1:
posi=index
if posi==-1:
print((-1))
exit()
else:
result.append(s[posi])
s.pop(posi)
for item ... | p03089 |
n=int(eval(input()))
b=list(map(int,input().split()))
a=[0]*(n+1)
a[0]=0
for i in b:a.insert(int(i)-1,i)
if sum(a[:n])==sum(b):
for i in range(n):
print((a[i]))
else:print((-1)) | n=int(eval(input()))
B=list(map(int,input().split()))
a=[0]
for b in B:a.insert(b-1,b)
if sum(a[:n])==sum(B):
for i in range(n):print((a[i]))
else:print((-1)) | p03089 |
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit
import heapq
import itertools
import operator
inf = float('inf')
... | from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit
import heapq
import itertools
import operator
inf = float('inf')
... | p03089 |
N = int(eval(input()))
b = [int(_) for _ in input().split()]
def delitable(numbers):
return [v for i, v in enumerate(numbers) if v == i + 1]
b_searched = set()
b_unsearched = []
b_searched.add(tuple(b))
delit = delitable(b)
if delit == []:
print("-1")
for delit_num in delit:
b_unsea... | N = int(eval(input()))
b = [int(_) for _ in input().split()]
def delitable(numbers):
return [v for i, v in enumerate(numbers) if v == i + 1]
log = []
while b:
delit = delitable(b)
if not delit:
print((-1))
break
del b[delit[-1] - 1]
log.append(delit[-1])
else:
... | p03089 |
def solve(remains, nums):
if (len(remains)) == 0:
[print(num) for num in nums[::-1]]
exit()
n_remains = []
n_nums = []
for i, num in enumerate(remains):
if i + 1 == num:
n_remains.append(remains[:i] + remains[i + 1:])
n_nums.append(nums + [i + 1])... | def solve(remains, nums):
if (len(remains)) == 0:
[print(num) for num in nums[::-1]]
exit()
n_remain = None
n_num = None
for i, num in enumerate(remains):
if i + 1 == num:
n_remain = remains[:i] + remains[i + 1:]
n_num = nums + [i + 1]
if n_r... | p03089 |
import sys
input = sys.stdin.readline
N=int(eval(input()))
B=list(map(int,input().split()))
def dfs(B,LEN,ANS):
#print(B,LEN,ANS)
if LEN==0:
for a in ANS[::-1]:
print(a)
sys.exit()
for i in range(LEN):
if B[i]==i+1:
C=B[:i]+B[i+1:]
... | import sys
input = sys.stdin.readline
N=int(eval(input()))
B=list(map(int,input().split()))
for i in range(N):
if B[i]>i+1:
print((-1))
sys.exit()
def dfs(B,LEN,ANS):
#print(B,LEN,ANS)
if LEN==0:
for a in ANS[::-1]:
print(a)
sys.exit()
for ... | p03089 |
# coding: utf-8
eval(input())
B_ = [int(i) for i in input().split()]
def f (B, ans):
if len(B) == 0:
return ans
for i in range(len(B)):
if B[i] <= len(B) and B[i] == i+1 :
B2 = B[:]
ans2 = ans[:]
ans2.append(B2.pop(B[i]-1))
result = f(B2, ans2)
if result is no... | # coding: utf-8
N = int(eval(input()))
B = [int(i) for i in input().split()]
ans = []
while (len(B) > 0):
for _ in range(len(B)):
for i in list(range(len(B)))[::-1]:
if B[i] == i+1:
ans.append(i+1)
B.pop(i)
break
break
if len(ans) != N:
print((-1))
else:
... | p03089 |
n = int(eval(input()))
bs = list(map(int, input().split()))
ans = []
def check(bs, pre):
tmp = pre[:]
if len(bs) == 0:
ans.append(tmp)
return
cand = []
for i, b in enumerate(bs):
if i + 1 == b:
cand.append(i)
if len(cand) == 0:
return
for i in cand:
check(bs[:... | n = int(eval(input()))
bs = list(map(int, input().split()))
ans = []
def check(bs, pre):
tmp = pre[:]
if len(bs) == 0:
ans.append(tmp)
return
cand = []
for i, b in enumerate(bs):
if i + 1 == b:
cand.append(i)
if len(cand) == 0:
return
i = cand[-1]
check(bs[:i] +... | p03089 |
def check_val(ind):
if ind > len(b): return False
if b[ind-1] == ind:
ans.append(ind)
del b[ind-1]
return True
else:
return False
N,*b = map(int,open(0).read().split())
if b[0] != 1:
print(-1)
exit()
set_b = sorted(set(b),reverse=True)
ans = []
w... | def check_val(ind):
if ind > len(b): return False
if b[ind-1] == ind:
ans.append(ind)
del b[ind-1]
if ind not in b: set_b.remove(ind)
return True
else:
return False
N,*b = map(int,open(0).read().split())
if b[0] != 1:
print(-1)
exit()
set_... | p03089 |
N = int(eval(input()))
list_b = list(map(int, input().split()))
aaa = [[1, 1], [1, 2]]
ans = [[1, 1], [1, 2]]
for i in range(2,N):
j = []
f = []
for d in range(len(aaa)):
s = []
t = []
for k in range(i+1):
a = aaa[d].copy()
b = ans[d].copy()
a.insert(k, k+1)
b.app... | N = int(eval(input()))
list_b = list(map(int, input().split()))
ans = [0 for i in range(N)]
finish = False
for i in range(N-1, -1, -1):
mx = -1
for k in range(i+1):
if list_b[k] == k+1:
mx = max(mx, k+1)
if mx == -1:
finish = True
break
else:
ans[i] = mx
for j in rang... | p03089 |
import collections
N = int(eval(input()))
B = list(map(int, input().split()))
for i, b in enumerate(B, start=1):
if b > i:
print((-1))
exit()
bnn = collections.defaultdict(
lambda: collections.defaultdict(dict)
)
def inv_sousa(B, N, now=tuple()):
if N == 0:
yield now
else:
... | N = int(eval(input()))
B = list(map(int, input().split()))
inv_output = list()
for i in range(N, 0, -1):
for j in range(i, 0, -1):
if B[j - 1] == j:
inv_output.append(B.pop(j - 1))
break
else:
print((-1))
break
else:
for i in inv_output[::-1]:
print(i) | p03089 |
from collections import Counter
import sys
sys.setrecursionlimit(10**7)
n = int(input())
B = list(map(int, input().split()))
c = Counter(B)
A = []
history = []
def dfs(i):
if i == n+1:
if A == B:
print(*history, sep='\n')
exit()
return 0
for j in reverse... | n = int(input())
B = list(map(int, input().split()))
A = []
for b in B:
A.insert(b-1, b)
if all(A[i] <= i+1 for i in range(n)):
C = []
for a in A:
C.insert(a-1, a)
if B == C:
print(*A, sep='\n')
else:
print(-1)
else:
print(-1)
| p03089 |
from collections import deque
def main():
n = int(eval(input()))
b = list(map(int, input().split()))
s = set()
q = deque()
q.append([tuple(b), [0]*n, 0])
ans = None
while q:
now, history, depth = q.popleft()
if now in s:
continue
s.add(now)
... | n = int(eval(input()))
b = list(map(int, input().split()))
def check(b):
for i in range(len(b))[::-1]:
if i+1 == b[i]:
return i
return -1
ans = []
for i in range(n):
ind = check(b)
if ind >= 0:
ans.append(ind+1)
b = b[:ind] + b[ind+1:]
else:
... | p03089 |
import copy
n = int(eval(input()))
goal = list(map(int, input().split(" ")))
output = -1
def searchAns(goal, temp, left, proc):
#print(temp, left, proc)
if len(left) == 0:
if temp == goal:
return proc
else:
return -1
for num in left:
#print(num, temp, left, proc)
i... | import copy
n = int(eval(input()))
goal = list(map(int, input().split(" ")))
output = -1
procReverse = []
temp_goal = copy.copy(goal)
for _ in range(n):
index = list(range(1,len(temp_goal)+1))
for i in range(len(temp_goal)-1, -1, -1):
#print(i, index, temp_goal)
if index[i] == temp_goa... | p03089 |
import sys
sys.setrecursionlimit(20000000)
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int,input().split()))
for i in range(n):
if i+1 < a[i]:
print((-1))
exit()
def dfs(x,ans,so):
if x == n:
if ans == a:
so = so[::-1]... | import sys
sys.setrecursionlimit(20000000)
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int,input().split()))
for i in range(n):
if i+1 < a[i]:
print((-1))
exit()
def dfs(x,ans,so):
if x == n:
if ans == a:
so = so[::-1]... | p03089 |
class Node:
def __init__(self, prev, val, next):
self.prev = prev
self.val = val
self.next = next
NIL = 0
START = -1
END = -2
class List:
def __init__(self, li):
li.append(END)
self.li = [Node(NIL, START, NIL)]
for e in li:
node = ... | def main():
n = int(input())
b = list(map(int, input().split()))
ans = []
while b:
l = len(b)
for i in range(l)[::-1]:
if b[i] == i + 1:
pp = b.pop(i)
ans.append(pp)
break
else:
ans = [-1]
... | p03089 |
import copy
def insertion(n, x):
if not x:
return True
for i in range(n - 1, -1, -1):
y = copy.copy(x)
if y[i] == i + 1:
y.pop(i)
ope.insert(0, i + 1)
if insertion(n - 1, y):
return True
else:
... | import sys
n = int(eval(input()))
b = list(map(int, input().split()))
ope = []
i = n
while i > 0:
flag = 0
j = i
while j > 0:
if b[j - 1] == j:
b.pop(j - 1)
i -= 1
ope.insert(0, j)
flag = 1
break
j -= 1
if fl... | p03089 |
import itertools
n = eval(input())
num_list = [int(i) for i in input().split()]
is_possible = False
for order_list in list(itertools.permutations(num_list)):
output_list = []
if order_list[0] != 1:
continue
for x in order_list:
output_list.insert(x - 1, x)
if output_list == ... | import itertools
n = eval(input())
num_list = [int(i) for i in input().split()]
is_possible = False
permutations = list(set(itertools.permutations(num_list)))
for order_list in permutations:
output_list = []
if order_list[0] != 1:
continue
for x in order_list:
output_list.insert(x... | p03089 |
n = int(eval(input()))
b = list(map(int,input().split()))
ans = []
def solve(b,i):
if i == 0:
return True
for j in range(i-1,-1,-1):
if b[j] == j+1:
p = b[:j] + b[j+1:]
if solve(p,i-1):
ans.append(j+1)
return True
retu... | n = int(eval(input()))
b = list(map(int,input().split()))
ans = []
def solve(b,i):
if i == 0:
return True
for j in range(i-1,-1,-1):
if b[j] > j+1:
return False
if b[j] == j+1:
p = b[:j] + b[j+1:]
if solve(p,i-1):
ans.appe... | p03089 |
def remove(data):
global result
pos = min(len(data), max(data))
for n in range(pos-1, -1, -1):
if data[n] == n + 1:
result.append(n + 1)
if len(data) == 1:
#print('OK')
return True
else:
#print('remove {0} ... | _ = eval(input())
data = list(map(int, input().split()))
result = []
pos = min(len(data), max(data)) - 1
while pos >= 0:
if data[pos] == pos + 1:
x = data.pop(pos)
#print('remove {0} {1}'.format(x, data))
result.append(x)
if len(data) == 0:
break
po... | p03089 |
import sys
input = sys.stdin.readline # NOQA
sys.setrecursionlimit(10 ** 7) # NOQA
def dfs(N, a, i, b, procedure):
if i == 0:
return procedure
for j in range(1, i+1):
if a[j-1] == j:
l = a[:]
del l[j-1]
p = procedure[:]
p.append(... | import sys
input = sys.stdin.readline # NOQA
sys.setrecursionlimit(10 ** 7) # NOQA
def dfs(N, a, i, procedure):
if i == 0:
return procedure
for j in reversed(range(1, i+1)):
if a[j-1] == j:
l = a[:]
del l[j-1]
p = procedure[:]
p.... | p03089 |
n = int(eval(input()))
b = list(map(int, input().split()))
ans = []
def dfs(x):
if x == []:
return True
ret = False
for i, a in enumerate(x):
if i + 1 == a:
ret = dfs(x[:i] + x[i+1:])
if ret:
ans.append(a)
break
return ... | n = int(eval(input()))
b = list(map(int, input().split()))
ans = []
for k in range(n):
for i in reversed(list(range(n - k))):
a = b[i]
if i + 1 == a:
ans.append(b.pop(i))
break
if b != []:
print((-1))
else:
for a in reversed(ans):
print(a) | p03089 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
N = int(readline())
B = list(map(int, readline().split()))
def main():
def dfs(vec):
i = 0
zero_only = True
for j in range(len(vec))... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
N = int(readline())
B = list(map(int, readline().split()))
def main():
ans = []
while B:
found = False
for i in range(len(B), 0, -1):
... | p03089 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.