input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
T, A = list(map(int, input().split()))
Hn = list(map(int, input().split()))
An = [T - 0.006*i for i in Hn]
tp = [10000000]*(N+1)
tpa = N
for i in range(N):
tp[i] = abs(A - An[i])
tpa = i if tp[i] < tp[tpa] else tpa
print((tpa+1)) | N = int(eval(input()))
T, A = list(map(int, input().split()))
Hn = list(map(int, input().split()))
An = [abs(A - (T - 0.006*i)) for i in Hn]
print((An.index(min(An))+1)) | p03220 |
# coding: utf-8
pointCount = int(eval(input()))
(t, a) = [int(i) for i in input().rstrip().split(" ")]
point_lit = [int(i) for i in input().rstrip().split(" ")]
min_diff = 100000
ans = 0
for i in range(len(point_lit)):
kion = t - (point_lit[i] * 0.006)
diff = abs(a - kion)
if diff < min_dif... | # coding: utf-8
n = int(eval(input()))
(t, a) = [int(i) for i in input().rstrip().split(" ")]
point_list = [int(i) for i in input().rstrip().split(" ")]
ans = -1
nearest = 100000
for i in range(n):
kion = abs(t - (point_list[i] * 0.006) - a)
if kion < nearest:
ans = i + 1
neare... | p03220 |
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))
Th = [T - h * 0.006 for h in H]
answer = -1
dif = 10 ** 15
for i, t in enumerate(Th, 1):
if abs(A - t) < dif:
answer = i
dif = abs(A - t)
... | import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))
answer = -1
dif = 10 ** 15
for i, h in enumerate(H, 1):
if abs(A - (T - h * 0.006)) < dif:
answer = i
dif = abs(A - (T - h * 0.006))
print(a... | p03220 |
n=int(eval(input()))
t,a=[int(i) for i in input().split()]
h_list=[int(i) for i in input().split()]
a_list=[abs(a-(t-i*0.006)) for i in h_list]
print((a_list.index(min(a_list))+1)) | n=int(eval(input()))
t,a=[int(i) for i in input().split()]
h_list=[int(i) for i in input().split()]
#絶対値のリスト
abs_list=[]
for i in range(n):
abs_list.append(abs(a-(t-h_list[i]*0.006)))
print((abs_list.index(min(abs_list))+1))
| p03220 |
N=int(eval(input()))
T,A=list(map(int,input().split()))
H=list(map(int,input().split()))
P=float("inf")
X=B=0
for i in range(N) :
X=abs(A-(T-H[i]*0.006))
if X<P :
B=i
P=X
print((B+1)) | N=int(eval(input()))
T,A=list(map(int,input().split()))
L=[]
for i in map(int,input().split()) :
B=abs(A-(T-i*0.006))
L.append(B)
print((L.index(min(L))+1))
| p03220 |
N = int(eval(input()))
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))
mn = None
for i, h in enumerate(H):
d = abs(A - (T - h * 0.006))
mn = (i, d) if mn is None or mn[1] > d else mn
print((mn[0] + 1)) | N = int(eval(input()))
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))
mn = None
for i in range(N):
x = abs(A - (T - H[i] * 0.006))
if mn is None or x < mn[1]:
mn = (i, x)
print((mn[0] + 1)) | p03220 |
N = int(eval(input()))
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))
AveT = []
diff = []
for i in range(N):
AveT.append(T - H[i]*0.006)
diff.append(abs(AveT[i] - A))
for i in range(N):
if diff[i] == min(diff):
place = i + 1
print(place) | N = int(eval(input()))
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))
AveT = [T - h*0.006 for h in H]
diff = [abs(Ave_t - A) for Ave_t in AveT]
print((diff.index(min(diff)) + 1)) | p03220 |
#n = 候補の数
n = int(eval(input()))
#t - h[i] * 0.006
#a = 基準温度
t,a = list(map(int,input().split()))
h = list(map(int,input().split()))
#o = 計算結果格納
o = []
for i in range(n):
o.append(t - h[i] * 0.006)
#p = 基準温度に最も近い場所の差
p = abs(a - o[0])
#q = 基準地点の番号
q = 0
for i in range(n)[1:]:
if abs(a - o[i])... | n = int(eval(input()))
t,a = list(map(int,input().split()))
h = list(map(int,input().split()))
p = 10 ** 8
ans = 0
for i in range(n):
x = t - h[i] * 0.006
x = abs(a - x)
if p > x:
p = x
ans = i + 1
print(ans) | p03220 |
N = int(eval(input()))
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))
for i in range(N):
H[i] = abs(T - H[i]*0.006 - A)
print((H.index(min(H))+1)) | N = int(eval(input()))
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))
MIN = 10000
ans = 10000
for i in range(N):
if MIN > abs((T - H[i]*0.006) - A):
MIN = abs((T - H[i]*0.006) - A)
ans = i
print((ans+1)) | p03220 |
import sys
input = sys.stdin.readline
def main():
ans = 0
N = int(eval(input()))
T, A = list(map(int, input().split()))
h = list(map(int, input().split()))
temp = float('inf')
for i in range(N):
d = T - h[i]*0.006
if abs(A - temp) > abs(A - d):
temp = ... | import sys
input = sys.stdin.readline
def main():
l = []
N = int(eval(input()))
T, A = list(map(int, input().split()))
h = list(map(int, input().split()))
for i in range(N):
l.append(abs(A-(T-h[i]*0.006)))
print((l.index(min(l))+1))
if __name__ == '__main__':
main() | p03220 |
n = int(eval(input()))
t, a = list(map(int, input().split()))
listh = list(map(int, input().split()))
temp = 100000
index = 0
for i in range(n):
diff = abs((t - listh[i] * 0.006)-a)
if temp > diff:
temp = diff
index = i+1
print(index)
| n = int(eval(input()))
t, a = list(map(int, input().split()))
listh = list(map(int, input().split()))
diff = [abs((t-x*0.006)-a) for x in listh]
print((diff.index(min(diff))+1))
| p03220 |
N=int(eval(input()))
T,A=list(map(int,input().split()))
H=list(map(int,input().split()))
num=0
for i in range(N):
if i==0:
num=(T-H[0]*0.006)
spot=0
else:
if abs(A-(T-H[i]*0.006))<=abs(A-num):
num=(T-H[i]*0.006)
spot=i
print((spot+1))
| N=int(eval(input()))
T,A=list(map(int,input().split()))
H=list(map(int,input().split()))
ans=[]
for i in H:
ans.append(abs(A-(T-i*0.006)))
print((ans.index(min(ans))+1))
| p03220 |
N=int(eval(input()))
T,A=list(map(int,input().split()))
H=list(map(int,input().split()))
m=100100100100
for i in range(N):
if abs(A-T+H[i]*0.006)<m:
m=abs(A-T+H[i]*0.006)
ans=i
print((ans+1)) | N=int(eval(input()))
T,A=list(map(int,input().split()))
H=list(map(int,input().split()))
z=[abs(A-T+i*0.006) for i in H]
print((z.index(min(z))+1)) | p03220 |
n = int(eval(input()))
t,a = list(map(int,input().split()))
l = []
m = []
ans = []
l = list(map(int,input().split()))
for i in range(n):
m.append(t - (l[i] * 0.006))
for i in range(n):
ans.append(a - m[i])
print((ans.index(min(ans,key=abs))+1)) | n = int(eval(input()))
t,a = list(map(int,input().split()))
ans = []
l = list(map(int,input().split()))
for i in l:
ans.append(abs(a - (t - (i * 0.006))))
print((ans.index(min(ans))+1)) | p03220 |
n = int(eval(input()))
t, a = list(map(int, input().split()))
H = list(map(int, input().split()))
ABS = []
for i in H:
ABS.append(abs((t-i*0.006) - a))
print((ABS.index(min(ABS)) + 1)) | n = int(eval(input()))
t, a = list(map(int, input().split()))
H = list(map(int, input().split()))
mtd = 1000
for i in range(n):
if abs(a - (t - (H[i] * 0.006))) < mtd:
mtd = abs(a - (t - (H[i] * 0.006)))
ans = i + 1
print(ans) | p03220 |
import sys
def solve(N, T, A, ls_H):
dosi = []
titen = []
titen1 = []
ti = 10**5//1
for x in ls_H :
do = T - x * 0.006
dosi.append(do)
#print(dosi)
for y in dosi :
til = A - y
titen.append(til)
#print(titen)
for z in titen ... | import sys
def solve(N, T, A, ls_H):
temperature = []
difference = []
near = []
ti = 10**5//1
for x in ls_H :
air = T - x * 0.006
temperature.append(air)
#print(temperature)
for y in temperature :
til = A - y
difference.append(til)
#p... | p03220 |
N = int(eval(input()))
T,A = list(map(int,input().split()))
now = 10000000
ans = 0
H = list(map(int,input().split()))
for i in range(N):
tmp = T - H[i]*0.006
if abs(A - tmp) < now:
now = abs(A - tmp)
ans = i+1
print(ans) | N = int(eval(input()))
T,A = list(map(int,input().split()))
H = list(map(int,input().split()))
now = 99999
ans = 0
for i in range(N):
tem = T - H[i] * 0.006
if abs(tem - A ) < now:
now = abs(tem - A)
ans = i+1
print(ans) | p03220 |
n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
res = 0
cc = float('inf')
for i in range(n):
d = (1000 * t - 6 * h[i]) - 1000 * a
if d < 0: d = -d
if cc > d:
cc = d
res = i + 1
print(res) | N = int(eval(input()))
T, A = list(map(int, input().split()))
h = list(map(int, input().split()))
d = 10 ** 9
ans = -1
for i in range(N):
t = abs((1000 * T - 6 * h[i]) - 1000 * A)
if t < d:
ans = i + 1
d = t
print(ans)
| p03220 |
n=int(eval(input()))
t,a=list(map(int,input().split()))
hi=[int(_) for _ in input().split()]
z=[abs(a-(t-x*0.006)) for x in hi]
print((z.index(min(z))+1)) | n=int(eval(input()))
t,a=list(map(int,input().split()))
h=list(map(int,input().split()))
z=[abs(t-x*0.006-a) for x in h]
print((z.index(min(z))+1)) | p03220 |
N = int(eval(input()))
T,A = list(map(int,input().split()))
H = list(map(int,input().split()))
x = 100000
ans = 0
for i in range(N):
temp = abs(A -(T - H[i]*0.006))
if abs(A -(T - H[i]*0.006)) < x:
x = abs(A -(T - H[i]*0.006))
ans = i
print((ans+1)) | eval(input())
T,A = list(map(int,input().split()))
a = list(map(int,input().split()))
#最小値
min_val = 100000
min_num=0
for i in range(len(a)):
d = abs(T-0.006*a[i]-A)
if d < min_val:
min_val = d
min_num = i
print((min_num+1)) | p03220 |
import itertools
import math
import fractions
import functools
import copy
n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
minimum = 10**10
index = 0
for i in range(n):
minimum = min(minimum,abs(a-(t-h[i]*0.006)))
if minimum == abs(a-(t-h[i]*0.006))... | def main():
n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
# s = input()
mini = 10**10
ans = 0
for i, x in enumerate(h):
c = t - x * 0.006
if abs(a - c) < mini:
mini = abs(a - c)
ans = i+1... | p03220 |
import sys
n = int(eval(input()))
(t, a) = list(map(int, input().split()))
hs = input().split()
for i in range(len(hs)):
hs[i] = float(hs[i])
ts = []
for h in hs:
ts.append(t - h * 0.006)
min = 0
min_t = sys.maxsize
for i in range(len(hs)):
dt = abs(ts[i] - a)
if dt < min_t:
... | n = int(eval(input()))
(t, a) = list(map(int, input().split()))
h = list(map(int, input().split()))
min_i = 0
min_t = 10 ** 6
for i, h_i in enumerate(h):
diff = abs(t - h_i * 0.006 - a)
if min_t > diff:
min_i = i
min_t = diff
print((min_i + 1)) | p03220 |
n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list([abs(t-a-x*0.006) for x in list(map(int, input().split()))])
print((h.index(min(h))+1)) | eval(input())
t, a = list(map(int, input().split()))
hs = list(map(int, input().split()))
arr = []
for h in hs:
arr.append(abs(t - h * 0.006 - a))
print((arr.index(min(arr))+1)) | p03220 |
n,t,a,*h=list(map(int,open(0).read().split()));d,i=9**9,0
for j,v in enumerate(h):
w=abs(a-t+v*0.006)
if w<d:d=w;i=j
print((i+1)) | eval(input());i=lambda:list(map(int,input().split()));t,a=i();h=[abs(t-0.006*x-a)for x in i()];print((h.index(min(h))+1)) | p03220 |
n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
ma = 10 ** 9
ans = 0
for i in range(n):
if abs(t - h[i] * 0.006 - a) < ma:
ma = abs(t - h[i] * 0.006 - a)
ans = i + 1
print(ans)
| n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
_abs = 10 ** 9
place = 0
for i in range(n):
tem = t - h[i] * 0.006
if _abs > abs(a - tem):
_abs = abs(a - tem)
place = i + 1
print(place)
| p03220 |
n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
ans = 0
l = a + 10000
for i in range(n):
k = abs(t-h[i]*0.006-a)
if l > k:
l = k
ans = i+1
print(ans) | n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
k = []
for i in range(n):
k.append(abs(t-h[i]*0.006-a))
print((k.index(min(k))+1)) | p03220 |
n = int(eval(input()))
t, a = list(map(int, input().split()))
list = [int(i) for i in input().split()]
dif_list = []
answer = 0
for i in range(n):
t_i = t - list[i] * 0.006
t_i_dif = abs(a - t_i)
dif_list.append(t_i_dif)
if min(dif_list) == t_i_dif:
answer = i + 1
print(answer)
| n = int(eval(input()))
t, a = list(map(int, input().split()))
list = [int(i) for i in input().split()]
dif_list = []
for i in range(n):
t_i = t - list[i] * 0.006
t_i_dif = abs(a - t_i)
dif_list.append(t_i_dif)
Min = min(dif_list)
print((dif_list.index(Min) + 1))
| p03220 |
n = int(eval(input()))
avg_temparature, kijun_temparature = list(map(int,input().split()))
list_height = [int(i) for i in input().split()]
result_position = 0
for candidate in range(1,len(list_height)):
a = avg_temparature - (list_height[result_position] * 0.006)
b = avg_temparature - (list_height[candi... | n = int(eval(input()))
t, a = list(map(int,input().split()))
pList = list(map(int,input().split()))
tList = []
for i in range(n):
tList.append(abs(a-(t-pList[i]*0.006)))
result = 0
for i in range(1,n):
if tList[result] > tList[i]:
result = i
print((result+1))
| p03220 |
N = int(eval(input()))
T, A = [int(i) for i in input().split()]
H =[int(i) for i in input().split()]
HH=[abs(A-(T-h*0.006))for h in H]
print((int(HH.index(min(HH))+1))) | N = int(eval(input()))
T, A = list(map(int,input().split()))
H = [int(i) for i in input().split()]
place = [T-i*0.006 for i in H ]
best = [abs(A-place[i]) for i in range(N)]
print((best.index(min(best))+1)) | p03220 |
# -*- coding: utf-8 -*-
N = int(eval(input()))
T, A = list(map(int, input().split()))
Hs = list(map(int, input().split()))
def kion_sa(x):
return abs((T - x * 0.006) - A)
kionsa_list = list()
for i, x in enumerate(Hs):
kionsa_list.append((kion_sa(x), i))
kionsa_list.sort()
print((kionsa_li... | N = int(eval(input()))
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))
deltas = []
for i in range(N):
mean_temp = T - H[i]*0.006
deltas += [abs(mean_temp-A)]
print((deltas.index(min(deltas))+1))
| p03220 |
N = int(eval(input()))
T, A = list(map(int,input().split()))
H = list(map(int,input().split()))
tempra = [abs((T - h * 0.006) - A) for h in H]
print((tempra.index(min(tempra)) + 1)) | N = int(eval(input()))
T, A = list(map(int,input().split()))
H = list(map(int,input().split()))
place_avgtmp = [abs(A - (T - h * 0.006)) for h in H]
print((place_avgtmp.index(min(place_avgtmp)) + 1)) | p03220 |
N = int(eval(input()))
T, A = list(map(int,input().split()))
H = list(map(int,input().split()))
place_avgtmp = [abs(A - (T - h * 0.006)) for h in H]
print((place_avgtmp.index(min(place_avgtmp)) + 1)) | N = int(eval(input()))
T, A = list(map(int,input().split()))
H = list(map(int,input().split()))
tmp = [abs(A - (T - h*0.006)) for h in H]
print((tmp.index(min(tmp))+1)) | p03220 |
N = int(eval(input()))
T, A = list(map(int,input().split()))
H = list(map(int,input().split()))
ans = 1e9
for h in H:
x = abs(T-h*0.006-A)
if(ans > x):
tmp = h
ans = x
print((H.index(tmp)+1)) | N = int(eval(input()))
T, A = list(map(int,input().split()))
H = list(map(int,input().split()))
res = [abs(T-h*0.006-A) for h in H]
print((res.index(min(res))+1)) | p03220 |
n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
dmin = 10**5
ans = 0
for i in range(n):
d = abs(a - (t - h[i] * 0.006))
if d < dmin:
dmin = d
ans = i
print((ans + 1)) | N = int(eval(input()))
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))
HH = [abs(A - (T - x * 0.006)) for x in H]
print((HH.index(min(HH)) + 1)) | p03220 |
N = int(eval(input()))
T, A = list(map(int, input().split()))
highs = list(map(int, input().split()))
temps = []
for i in range(N):
temps.append(abs(A-(T-highs[i]*0.006)))
print((temps.index(min(temps))+1)) | N = int(eval(input()))
T, A = list(map(int, input().split()))
highs = list(map(int, input().split()))
temps = []
for i in highs:
diff = abs(A - (T - i*0.006))
temps.append(diff)
print((temps.index(min(temps))+1)) | p03220 |
n = int(eval(input()))
t, a = list(map(int, input().split()))
H = [int(i) for i in input().split()]
A = []
for i in range(n):
x = abs(t - H[i] * 0.006 - a)
A.append(x)
print((A.index(min(A)) + 1)) | n = int(eval(input()))
t, a = list(map(int, input().split()))
H = [int(i) for i in input().split()]
B = []
for i in range(n):
temp = abs(a - (t - H[i] * 0.006))
B.append(temp)
print((B.index(min(B)) + 1)) | p03220 |
from itertools import accumulate
N, K, *A = list(map(int, open(0).read().split()))
def check(d):
r = sorted([v % d for v in A])
r_inv = [d - v for v in r]
r_cs = [0] + list(accumulate(r))
r_inv_cs = list(accumulate(r_inv[::-1]))[::-1] + [0]
ret = False
for i in range(N + 1):
... | from itertools import accumulate
N, K, *A = list(map(int, open(0).read().split()))
s = sum(A)
divisor = []
for i in range(1, int(s ** 0.5) + 1):
if s % i == 0:
divisor.append(i)
if i != s // i:
divisor.append(s // i)
ans = 0
for d in divisor:
x = sorted(v % d for v i... | p02955 |
from itertools import accumulate
N, K, *A = list(map(int, open(0).read().split()))
s = sum(A)
divisor = []
for i in range(1, int(s ** 0.5) + 1):
if s % i == 0:
divisor.append(i)
if i != s // i:
divisor.append(s // i)
ans = 0
for d in divisor:
x = sorted(v % d for v i... |
"""
https://atcoder.jp/contests/abc136/tasks/abc136_e
"""
N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
def calc_divisor(x):
divisor = []
for i in range(1, int(x ** 0.5) + 1):
if x % i == 0:
divisor.append(i)
if i != x // i:
... | p02955 |
from itertools import accumulate
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A_sum = sum(A)
ans_candidates = []
for n in range(1, int(A_sum ** 0.5) + 1):
if A_sum % n == 0:
ans_candidates.append(n)
ans_candidates.append(A_sum // n)
ans_candidates.sort(reve... | from itertools import accumulate
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
M = sum(A)
ans_candidates = []
for n in range(1, int(M ** 0.5) + 1):
if M % n == 0:
ans_candidates.append(n)
ans_candidates.append(M // n)
ans = 0
for X in ans_candidates:
... | p02955 |
from itertools import accumulate
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
M = sum(A)
ans_candidates = []
for n in range(1, int(M ** 0.5) + 1):
if M % n == 0:
ans_candidates.append(n)
ans_candidates.append(M // n)
ans = 0
for X in ans_candidates:
... | from itertools import accumulate
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
M = sum(A)
# 答えの候補を列挙
ans_candidates = []
for n in range(1, int(M ** 0.5) + 1):
if M % n == 0:
ans_candidates.append(n)
ans_candidates.append(M // n)
ans = 0
for X in ans_cand... | p02955 |
import math
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
tot = sum(A)
cand = helper(tot)
# print("here", cand)
for i in cand:
rems = []
for j in range(N):
r = A[j] % i
if r > 0:
rems.a... | import math
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
tot = sum(A)
cand = helper(tot)
for i in cand:
rems = []
for j in range(N):
r = A[j] % i
if r > 0:
rems.append(r)
rems.sort... | p02955 |
from heapq import heapify, heappush, heappop
def divisor(n):
divisors = []
i = 1
while i * i <= n:
if n % i == 0:
divisors.append(i)
if i != n / i:
divisors.append(n // i)
i += 1
divisors.sort()
return divisors
N, K = list(map... | def divisor(n):
divisors = []
i = 1
while i * i <= n:
if n % i == 0:
divisors.append(i)
if i * i < n:
divisors.append(n // i)
i += 1
divisors.sort()
return divisors
N, K = list(map(int, input().split()))
A = list(map(int, input(... | p02955 |
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,K = list(map(int,input().split()))
A = list(map(int,input().split(... | 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,K = list(map(int,input().split()))
A = list(map(int,input().split(... | p02955 |
N,K=list(map(int,input().split()))
alist=list(map(int,input().split()))
sum_a=sum(alist)
alist.sort()
#print(sum_a,alist)
#M=1の場合にも対応
divisor_set=set()
for i in range(1,int(sum_a**0.5)+1):
if sum_a%i==0:
divisor_set.add(i)
divisor_set.add(sum_a//i)
divisor_list=list(divisor_set)
divisor_list.s... | N,K=list(map(int,input().split()))
alist=list(map(int,input().split()))
sum_a=sum(alist)
alist.sort()
#print(sum_a,alist)
#M=1の場合にも対応
divisor_set=set()
for i in range(1,int(sum_a**0.5)+1):
if sum_a%i==0:
divisor_set.add(i)
divisor_set.add(sum_a//i)
divisor_list=list(divisor_set)
divisor_list.s... | p02955 |
# -*- coding: utf-8 -*-
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 sorted(divisors, reverse=True)
if __name__ == '__main__':
n, k = ... | # -*- coding: utf-8 -*-
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 sorted(divisors, reverse=True)
if __name__ == '__main__':
n, k = ... | p02955 |
import sys
import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
def ok(x):
b = []
for an in a:
b.append(an % x)
b.sort(reverse=True)
print(x, a, b, file=sys.stderr)
t = int(sum(b) / x)
print(t, sum(b[t:]), file=sys.stderr)
if t == 0:
... | import sys
import math
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
def ok(x):
b = [i % x for i in a]
b.sort(reverse=True)
t = int(sum(b) / x)
if t == 0:
return True
return True if sum(b[t:]) <= k else False
s = sum(a)
sqs = int(math.sqrt(s... | p02955 |
# 約数の列挙
#############################################################
def make_divisors(n):
lower_divisors, upper_divisors = [], []
i = 1
while i * i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n // i)
... | import sys
input = sys.stdin.readline
# 約数の列挙
#############################################################
def make_divisors(n):
lower_divisors, upper_divisors = [], []
i = 1
while i * i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
... | p02955 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
sumA = sum(A)
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()
divisors = divisors[::-1]
... | import sys
input = sys.stdin.buffer.readline
def divisors(n) -> list:
res = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n // i)
res = sorted(res)[::-1]
return res
N, K = list(map(int, input().split()))
A = list(map(int,... | p02955 |
import math
import sys
def part_sum(a,A):
N=len(a)
dp=[[0 for i in range(A+1)] for j in range(N+1)]
dp[0][0]=1
for i in range(N):
for j in range(A+1):
if a[i]<=j:
dp[i+1][j]=dp[i][j-a[i]] or dp[i][j]
else:
dp[i+1][j]=dp[i][j]
return dp[N][A]
n,k=list(map(in... | import math
import sys
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
s=sum(a)
s_factors=[]
l=int(math.sqrt(s))
for i in range(1,l+1):
if s%i==0:
s_factors.append(i)
s_factors.append(s//i)
s_factors.sort()
for f in s_factors[::-1]:
b=[a[i]%f for i in... | p02955 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().spli... | p02955 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf = 10**20
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
def distance(x,d):
r = x%d
return(min(r,d-r))
def cost(d,numList):
r = list([x%d for x in ... | import math
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
def cost(d,numList):
r = [x%d for x in numList]
r.sort(reverse=True)
p = sum(r)//d
c = 0
for i in range(p):
c += d - r[i]
return(c)
def divisors(n):
sq = math.ceil(math.sqrt(n))
... | p02955 |
from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
s = sum(a)
cand = [s]
for i in range(2, int(s ** 0.5) + 1):
if s % i == 0:
cand.append(i)
... | from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
s = sum(a)
cand = [s]
for i in range(2, int(s ** 0.5) + 1):
if s % i == 0:
cand.append(i)
... | p02955 |
from heapq import heappush, heappop
N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
x = sum(A)
ls = []
for i in range(1, int(x**0.5)+1):
if x%i==0:
ls += [i]
if i != x//i:
ls += [x//i]
ls.sort(reverse=True)
for i in ls:
B =[]
for j in A:
heappush(B, -1*... | N, K = list(map(int, input().split()))
A = [int(c) for c in input().split()]
S = sum(A)
pls = []
for i in range(1,S):
if i*i>S:
break
if S%i==0:
pls += [i]
pls += [S//i]
pls.sort(reverse=True)
for p in pls:
B = []
for i in range(N):
B += [A[i]%p]
B.sort()
for j in r... | p02955 |
#### import ####
import sys
import math
from collections import defaultdict
#### 設定 ####
sys.setrecursionlimit(10**7)
#### 定数 ####
mod = 10**9 + 7
#### 読み込み ####
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def III(): return list(map(int, input().split()))
def Li... | import sys
def input():
return sys.stdin.readline()[:-1]
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,K = list(map(int, input... | p02955 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# nの約数を求める。計算量O(sqrt(N))
def get_divisors(n):
from math import sqrt, ceil
from collections import deque
divisors = deque([])
for num in range(ceil(sqrt(n)), n+1):
if n % num == 0:
divisors.append(n/... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# nの約数を求める。計算量O(sqrt(N))
def get_divisors(n):
from math import sqrt, ceil
from collections import deque
divisors = deque([])
for num in range(ceil(sqrt(n)), n+1):
if n % num == 0:
divisors.append(n/... | p02955 |
n,k=list(map(int,input().split()))
a=[int(x) for x in input().split()]
s=sum(a)
candidates=set()
for i in range(1,int(s**0.5)+2):
if s%i==0:
candidates.add(i)
candidates.add(s//i)
ans=0
for cdd in candidates:
div_cdd=[0]*n
for i in range(n):
div_cdd[i]=a[i]%cdd
div_cdd=sorted(div_cd... | n,k=list(map(int,input().split()))
a=[int(x) for x in input().split()]
s=sum(a)
candidates=set()
for i in range(1,int(s**0.5)+1):
if s%i==0:
candidates.add(i)
candidates.add(s//i)
ans=0
for cdd in candidates:
div_cdd=[0]*n
for i in range(n):
div_cdd[i]=a[i]%cdd
div_cdd=sorted(div_cd... | p02955 |
n,k=list(map(int,input().split()))
a=[int(x) for x in input().split()]
s=sum(a)
candidates=set()
for i in range(1,int(s**0.5)+1):
if s%i==0:
candidates.add(i)
candidates.add(s//i)
ans=0
for cdd in candidates:
div_cdd=[0]*n
for i in range(n):
div_cdd[i]=a[i]%cdd
div_cdd=sorted(div_cd... | n,k=list(map(int,input().split()))
a=[int(x) for x in input().split()]
s=sum(a)
candidates=set()
for i in range(1,int(s**0.5)+1):
if s%i==0:
candidates.add(i)
candidates.add(s//i)
ans=0
for cdd in candidates:
div_cdd=[0]*n
for i in range(n):
div_cdd[i]=a[i]%cdd
div_cdd=sorted(div_cd... | p02955 |
words = lambda t : list(map(t, input().split()))
n,k = words(int)
xs = words(int)
def divisor (x):
ans = [1]
for i in range(2, x//2+1):
if x % i == 0:
ans.append(i)
ans.append(x)
return list(reversed(ans))
s = sum(xs)
ds = divisor(s)
ans = 1
#print(ds)
for d in ds:
... | words = lambda t : list(map(t, input().split()))
n,k = words(int)
xs = words(int)
def divisor (x):
ans = []
for i in range(1, int(x**0.5)+1):
if x % i == 0:
ans.append(i)
if i != x // i:
ans.append(x//i)
ans.sort()
return list(reversed(ans))
... | p02955 |
# -*- coding: utf-8 -*-
import sys
from math import sqrt
from collections import deque
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y... | # -*- coding: utf-8 -*-
import sys
from math import sqrt
from collections import deque
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y... | p02955 |
def solve():
N,K = list(map(int , input().split()))
A = list(map(int , input().split()))
max_A = max(A)
total = sum(A)
# ave_region = total//N
max_d = 1
for d in A:
if all(a%d==0 for a in A) and d > max_d:
max_d = d
if K >= total:
max_d = total
... | def solve():
N,K = list(map(int , input().split()))
A = list(map(int , input().split()))
max_total = 22361 # sqrt(10**6 * 500)
total = sum(A)
search_space = set([])
max_d = 1
for d in range(1, min(total, max_total) ):
if total % d == 0:
search_space.add(d)
... | p02955 |
def solve():
N,K = list(map(int , input().split()))
A = list(map(int , input().split()))
max_total = 22361 # sqrt(10**6 * 500)
total = sum(A)
search_space = set([])
max_d = 1
for d in range(1, min(total, max_total) ):
if total % d == 0:
search_space.add(d)
... | def get_divisor(num, max_val):
ret = []
num_sq = int(num**0.5)
for k in range(1, num_sq+1):
if num % k == 0:
if k <= max_val: ret.append(k)
if num//k <= max_val: ret.append(num//k)
return ret
# 下からmodが低いのを取ってきてマッチングを取る
def solve():
N,K = list... | p02955 |
import sys, math
from collections import defaultdict
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 1000000007
sys.setrecursionlimit(1000000)
N, K = rl()
A = rl()
s = sum(A)
m = math.ceil(math.sqrt(s))
divs = [... | import sys, math
from collections import defaultdict
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 1000000007
sys.setrecursionlimit(1000000)
N, K = rl()
A = rl()
s = sum(A)
m = math.ceil(math.sqrt(s))
divs = [... | p02955 |
from itertools import accumulate
def divisors(N):
U = int(N ** 0.5) + 1
L = [i for i in range(1, U) if N % i == 0]
return L + [N // i for i in reversed(L) if N != i * i]
N, K, *A = list(map(int, open(0).read().split()))
for d in reversed(divisors(sum(A))):
R = [0] + list(accumulate(sorted(a... | def divisors(N):
U = int(N ** 0.5) + 1
L = [i for i in range(1, U) if N % i == 0]
return L + [N // i for i in reversed(L) if N != i * i]
N, K, *A = list(map(int, open(0).read().split()))
for d in reversed(divisors(sum(A))):
R = sorted(a % d for a in A)
if sum(R[:-sum(R) // d]) <= K:
... | p02955 |
def divisors(N):
U = int(N ** 0.5) + 1
L = [i for i in range(1, U) if N % i == 0]
return L + [N // i for i in reversed(L) if N != i * i]
N, K, *A = list(map(int, open(0).read().split()))
for d in reversed(divisors(sum(A))):
R = sorted(a % d for a in A)
if sum(R[:-sum(R) // d]) <= K:
... | def divisors(N):
U = int(N ** 0.5) + 1
L = [i for i in range(1, U) if N % i == 0]
return L + [N // i for i in reversed(L) if N != i * i]
def main():
N, K, *A = list(map(int, open(0).read().split()))
for d in reversed(divisors(sum(A))):
R = sorted(a % d for a in A)
if sum(... | p02955 |
import sys
import math
MAX_INT = int(10e9)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return eval(input())
def judge(x):
l = []
for i in range(... | import sys
import math
MAX_INT = int(10e9)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return eval(input())
def judge(x):
l = []
for i in range(... | p02955 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | p02955 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
sumA = sum(A)
divisors = []
for i in range(1, sumA + 1):
if i * i > sumA:
break
if sumA % i != 0:
continue
divisors.append(i)
if sumA // i != i:
divisors.append(sumA // i)
divisors.sort(rev... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
sumA = sum(A)
divisors = []
for i in range(1, sumA + 1):
if i * i > sumA:
break
if sumA % i != 0:
continue
divisors.append(i)
if sumA // i != i:
divisors.append(sumA // i)
divisors.sort(rev... | p02955 |
import sys
import copy
input = sys.stdin.readline
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
x=sum(A)
import math
xr=math.ceil(math.sqrt(x))
LIST=[]
for i in range(1,xr+1):
if x%i==0:
LIST.append(i)
LIST.append(x//i)
MIN=0
MAX=sum(A)
ANS=1
A.sort()
... | import sys
input = sys.stdin.readline
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
x=sum(A)
import math
xr=math.ceil(math.sqrt(x))
LIST=[]
for i in range(1,xr+1):
if x%i==0:
LIST.append(i)
LIST.append(x//i)
ANS=1
for l in LIST:
count=0
B=[a%l... | p02955 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
import math
Asum = sum(A)
candidates = []
for i in range(1, int(math.sqrt(Asum)) + 1):
if Asum % i == 0:
candidates.append(i)
candidates.append(Asum // i)
candidates.sort()
# print("#", Asum)
# print("#", can... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
import math
Asum = sum(A)
candidates = []
for i in range(1, int(math.sqrt(Asum)) + 1):
if Asum % i == 0:
candidates.append(i)
candidates.append(Asum // i)
candidates.sort()
# print("#", Asum)
# print("#", can... | p02955 |
n,k,*a=list(map(int,open(0).read().split()))
s,m=sum(a),1
for i in sum([[s//i,i]for i in range(1,int(s**.5)+1)if s%i<1],[]):
p=[0]+sorted(j%i for j in a)
for j in range(n):p[j+1]+=p[j]
f=t=0
for j in range(n):
f|=t==p[~j]<=k
t+=i-p[~j]+p[-j-2]
m=max(m,i*f)
print(m) | n,k,*a=list(map(int,open(0).read().split()))
s=sum(a)
b=[]
for i in range(1,int(s**.5)+1):b+=[s//i,i]*(s%i<1)
m=1
for i in b:c=sorted(j%i for j in a);m=max(m,i*(sum(c[:-sum(c)//i])<=k))
print(m) | p02955 |
# E
import sys
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
s = sum(a)
for p in range(1,s+1) :
if s % p != 0:
continue
b = s // p
r1 = [x % b for x in a]
r1.sort()
s1 = sum(r1)
mn = 1e9
s2 = 0
for i in range(n):
... | # E
import sys
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
s = sum(a)
l = []
def check(b) :
r1 = [x % b for x in a]
r1.sort()
s1 = sum(r1)
mn = 1e9
s2 = 0
for i in range(n):
s2 += r1[i]
mn = min(max(s2, (n-1-i)*b - (s... | p02955 |
N, K = list(map(int, input().split()))
a_list = list(map(int, input().split()))
total_a = sum(a_list)
#約数の列挙
candidates = set()
for i in [a for a in range(1, total_a) if a * a <= total_a]:
if total_a % i == 0:
candidates.add(i)
candidates.add(total_a // i)
ans = 1
for x in candidates:
... | N, K = list(map(int, input().split()))
a_list = list(map(int, input().split()))
total_a = sum(a_list)
#約数の列挙
candidates = set()
for i in range(1, total_a):
if i * i > total_a:
break
if total_a % i == 0:
candidates.add(i)
candidates.add(total_a // i)
ans = 1
for x in candi... | p02955 |
from math import sqrt
from itertools import accumulate
def common_divisors(x):
ret = []
for i in range(1, int(sqrt(x)) + 1):
if x % i == 0:
ret.append(i)
ret.append(x // i)
return ret
n, k = list(map(int, input().split()))
a = list(map(int, input().split()... | from math import sqrt
from itertools import accumulate
def common_divisors(x):
ret = []
for i in range(1, int(sqrt(x)) + 1):
if x % i == 0:
ret.append(i)
ret.append(x // i)
return ret
n, k = list(map(int, input().split()))
a = list(map(int, input().split()... | p02955 |
from math import sqrt
from itertools import accumulate
def common_divisors(x):
ret = []
for i in range(1, int(sqrt(x)) + 1):
if x % i == 0:
ret.append(i)
ret.append(x // i)
return ret
n, k = list(map(int, input().split()))
a = list(map(int, input().split()... | def get_divisors(x):
i = 1
ret = set()
while i * i <= x:
if x % i == 0:
ret.add(i)
ret.add(x // i)
i += 1
return ret
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
sm = sum(a)
divs = get_divisors(sm)
ans = 0
fo... | p02955 |
import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in in... | import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in in... | p02955 |
from collections import deque
def isok(x):
que=deque(sorted(z%x for z in a))
res=0
while que:
l=que[0]
if l==0:
que.popleft()
continue
r=que[-1]
if r==0:
que.pop()
continue
d=min(l,x-r)
que[0]-=d
... | def factor(N):
arr=[]
for i in range(1,int(N**0.5)+1):
if(N%i==0):
arr.append(i)
if(N//i!=i):
arr.append(N//i)
return arr
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
sum_=sum(a)
fac=sorted(factor(sum_),reverse=True)
ans=... | p02955 |
# 割り切る数は、Aの総和の約数である
# 自分自身を除く約数について大きい順にすべて試して、当てはまるものがあれば答え
# 8,20を7の倍数に近づけるとき、
# 8 -> mod 7が1であり、-1か+6で7の倍数になる
# 20 -> mod 7が6であり、-6か+1で7の倍数になる
# -1と+1をペアにすることが出来て、この操作回数1をK = 3から引くと2となり、これが偶数ならOK
import sys
readline = sys.stdin.readline
N,K = list(map(int,readline().split()))
A = list(map(int,readline... | # 割り切る数は、Aの総和の約数である
# 自分自身を除く約数について大きい順にすべて試して、当てはまるものがあれば答え
# 8,20を7の倍数に近づけるとき、
# 8 -> mod 7が1であり、-1か+6で7の倍数になる
# 20 -> mod 7が6であり、-6か+1で7の倍数になる
import sys
readline = sys.stdin.readline
N,K = list(map(int,readline().split()))
A = list(map(int,readline().split()))
all = sum(A)
divisors = []
for i in ... | p02955 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def divisors(n):
lower = []
upper = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
lower.append(i)
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def divisors(n):
lower = []
upper = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
lower.append(i)
... | p02955 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
Asum = sum(A)
div = set()
for i in range(1, int(Asum ** 0.5 + 0.5) + 1):
if Asum % i == 0:
div.add(i)
div.add(Asum//i)
ans = 1
for d in div:
now = 10 ** 18
R = [a % d for a in A]
R.sort()
Rsum... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
Asum = sum(A)
div = set()
for i in range(1, int(Asum ** 0.5 + 0.5) + 1):
if Asum % i == 0:
div.add(i)
div.add(Asum//i)
ans = 1
for d in div:
R = [a % d for a in A]
R.sort()
r = sum(R) // d
l =... | p02955 |
inp = list([int(x) for x in input().split(" ")])
N = inp[0]
M = inp[1]
dp = [-1]*N
g = {}
def path(x):
if dp[x-1]!=-1:
return dp[x-1]
if not x in list(g.keys()):
return 0
else:
ret = 0
for k in g[x]:
if ret<path(k)+1:
ret = path... | import sys
sys.setrecursionlimit(100000000)
inp = list([int(x) for x in input().split(" ")])
N = inp[0]
M = inp[1]
dp = [-1]*N
g = {}
def path(x):
if dp[x-1]!=-1:
return dp[x-1]
if g[x] == []:
return 0
else:
ret = 0
for k in g[x]:
if ret<pat... | p03166 |
import sys
sys.setrecursionlimit(10 ** 5 * 2)
N, M = list(map(int, input().split()))
Ps = [[] for _ in range(N)]
for i in range(M):
x, y = list(map(int, input().split()))
Ps[x - 1].append(y - 1)
mem = [-1] * N
def rec(n):
if mem[n] > -1:
return mem[n]
elif len(Ps[n]) == 0:
... | import sys
sys.setrecursionlimit(10 ** 5 * 2)
input = sys.stdin.readline
N, M = list(map(int, input().split()))
Ps = [[] for _ in range(N)]
for i in range(M):
x, y = list(map(int, input().split()))
Ps[x - 1].append(y - 1)
mem = [-1] * N
def rec(n):
if mem[n] > -1:
return mem[n]
... | p03166 |
from collections import deque
def main():
n, m = list(map(int, input().split()))
tree_to = [[] for _ in range(n)]
tree_from = [[] for _ in range(n)]
for i in range(m):
x, y = list(map(int, input().split()))
tree_to[x-1].append(y-1)
tree_from[y-1].append(x-1)
ans = [0]*n
already =... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(100007)
def main():
n, m = list(map(int, input().split()))
grid = [[] for _ in range(n)]
for _ in range(m):
x, y = list(map(int, input().split()))
grid[x-1].append(y-1)
memo = [-1]*n
def d... | p03166 |
from collections import defaultdict
debug = print
def debug(*va): pass
N, M = map(int, input().split())
dummynode = N
N += 1
nextnodes = [defaultdict(list), defaultdict(list)]
for i in range(M):
x, y = map(int, input().split())
nextnodes[0][x - 1].append(y - 1)
nextnodes[1][y - 1].append(x - 1... | from collections import defaultdict
debug = print
def debug(*va): pass
def longest_by_topological_sort(N, nexts, prevs):
visited = [-1] * N
max_dist = 0
que = list(range(N))
while len(que):
p = que.pop()
if visited[p] == -1:
if all(visited[q] != -1 for q in prevs[... | p03166 |
from operator import itemgetter
# スペース区切りの整数入力
N,M = list(map(int, input().split()))
#指定数分の３つの整数を順番に受けてリストに入力
move = []
for i in range(M):
move.append(list(map(int, input().split())))
move.sort(key=itemgetter(0))
dp = [-1] * (N+1)
def findpath(now_x):
if dp[now_x] > -1:
return dp[now_x]
... | import sys
sys.setrecursionlimit(10**5)
# スペース区切りの整数入力
N,M = list(map(int, input().split()))
#指定数分の３つの整数を順番に受けてリストに入力
move = {}
for i in range(M):
x,y = list(map(int, input().split()))
move.setdefault(x,[]).append(y)
dp = [-1] * (N+10)
def findpath(now_x):
if dp[now_x] > -1:
return... | p03166 |
from collections import defaultdict
n, m = list(map(int, input().split()))
adj = defaultdict(list)
radj = defaultdict(list)
for i in range(m):
s, e = list(map(int, input().split()))
adj[s].append(e)
radj[e].append(s)
mp = [0]*(n+1)
v = [0]*(n+1)
for i in range(1, 1+n):
if ... | import sys
from collections import defaultdict
sys.setrecursionlimit(10**9)
n, m = list(map(int, input().split()))
adj = defaultdict(list)
radj = defaultdict(list)
for i in range(m):
s, e = list(map(int, input().split()))
adj[s].append(e)
dp = [-1]*(n+1)
def dfs(e):
if dp[e]... | p03166 |
import sys
sys.setrecursionlimit(10**7)
N,M=list(map(int,input().split()))
table=[[] for i in range(N)]
Lin=[0]*N
for i in range(M):
w,v=list(map(int,input().split()))
table[w-1].append(v-1)
Lin[v-1]+=1
H=[]
for i in range(N):
if Lin[i]==0:
H.append(i)
dp=[0]*N
def f(x):
if le... | import sys
sys.setrecursionlimit(10**7)
N,M=list(map(int,input().split()))
table=[[] for i in range(N)]
Lin=[0]*N
for i in range(M):
w,v=list(map(int,input().split()))
table[w-1].append(v-1)
Lin[v-1]+=1
H=[]
for i in range(N):
if Lin[i]==0:
H.append(i)
dp=[-1]*N
def f(x):
if d... | p03166 |
import sys
from collections import deque
input = sys.stdin.readline
N,M = list(map(int,input().split()))
edge = [list(map(int,input().split())) for _ in range(M)]
graph = [[] for _ in range(N)]
indegree = [0 for _ in range(N)]
for i in range(M):
graph[edge[i][0]-1].append(edge[i][1]-1)
indegree... | import sys
input = sys.stdin.buffer.readline
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
deg = [0 for _ in range(N)]
dp = [0 for _ in range(N)]
for _ in range(M):
x, y = list(map(int, input().split()))
graph[x - 1].append(y - 1)
deg[y - 1] += 1
stack = []
for i i... | p03166 |
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A = []
for _ in range(M):
a = tuple(map(int, input().split()))
A.append(a)
dp = [-1]*(N+1)
def dfs(n):
global dp
B = list([x for x in A if x[0] == n])
if len(B) == 0:
return 0
ma = 0
fo... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
G[a-1].append(b-1)
dp = [-1]*N
def dfs(n):
global dp
if dp[n] > 0:
return dp[n]
... | p03166 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**5)
N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
G[a-1].append(b-1)
dp = [-1]*N
def dfs(n):
if dp[n] > 0:
return dp[n]
ma = 0
for... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**5)
N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
G[a-1].append(b-1)
dp = [-1]*N
def dfs(n):
global dp
if dp[n] > 0:
return dp[n]
... | p03166 |
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii... | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii... | p03166 |
def main():
import sys
sys.setrecursionlimit(10**7)
import collections
dic=collections.defaultdict(list)
N,M=list(map(int,sys.stdin.readline().split()))
for i in range(M):
x,y=list(map(int,sys.stdin.readline().split()))
dic[x].append(y)
dp=[0]*(N+1)
def df... | def main():
import sys
sys.setrecursionlimit(10**7)
N,M=list(map(int,sys.stdin.readline().split()))
dic=[[] for _ in range(N)]
for i in range(M):
x,y=list(map(int,sys.stdin.readline().split()))
dic[x-1].append(y-1)
dp=[0]*(N)
def dfs(frm):
if dp[frm]:
... | p03166 |
def main():
import sys
sys.setrecursionlimit(10**7)
N,M=list(map(int,sys.stdin.readline().split()))
dic=[[] for _ in range(N)]
for i in range(M):
x,y=list(map(int,sys.stdin.readline().split()))
dic[x-1].append(y-1)
dp=[0]*(N)
def dfs(frm):
if dp[frm]:
... | def main():
import sys
sys.setrecursionlimit(10**7)
N,M=list(map(int,sys.stdin.readline().split()))
dic=[[] for _ in range(N)]
for i in range(M):
x,y=list(map(int,sys.stdin.readline().split()))
dic[x-1].append(y-1)
dp=[0]*(N)
def dfs(frm):
if dp[frm]:
... | p03166 |
from collections import deque
n,m = list(map(int,input().split()))
path = [set() for _ in range(n)]
dp = [0]*n
for _ in range(m):
x,y = list(map(int,input().split()))
path[x-1].add(y-1)
dp[y-1] = -1
que = deque()
for i in range(n):
if dp[i] == 0:
que.append(i)
ans = 0
while que:
... | from collections import deque
n,m = list(map(int,input().split()))
path = [set() for _ in range(n)]
to = [0]*n
dp = [0]*n
for _ in range(m):
x,y = list(map(int,input().split()))
path[x-1].add(y-1)
to[y-1] += 1
que = deque()
for i in range(n):
if to[i] == 0:
que.append(i)
ans = 0
... | p03166 |
import sys
import collections
# input処理を高速化する
input = sys.stdin.readline
def chmax(a, b):
""" 最大値を返す関数 """
if a >= b:
return a
else:
return b
def main():
# 入力
N, M = list(map(int, input().split()))
# 隣接関係は隣接リストで管理する
lst_edge = [[] for _ in range(N)]
... | import sys
import collections
# input処理を高速化する
input = sys.stdin.readline
def chmax(a, b):
""" 最大値を返す関数 """
if a >= b:
return a
return b
def main():
# 入力
N, M = list(map(int, input().split()))
# 隣接関係は隣接リストで管理する
lst_edge = [[] for _ in range(N)]
# 各頂点の入力辺の本数
... | p03166 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
N,M=list(map(int,input().split()))
xy = [list(map(int, input().split())) for _ in range(M)]
to = [[]*(N+1) for _ in range(N+1)]
for i in range(M):
x,y=xy[i]
to[x].append(y)
dp = [0]*(N+1)
def saiki(v):
for u in to[v]:
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
N,M=list(map(int,input().split()))
to = [[]*(N+1) for _ in range(N+1)]
for i in range(M):
x,y=list(map(int,input().split()))
to[x].append(y)
dp = [-1]*(N+1)
def saiki(v):
if dp[v]!=-1: return dp[v]
res = 0
for ... | p03166 |
# DAGの最長経路...トポロジカルソートもどきか？
# 普通にDAGに沿ったdpをすればいいのでは?
# 再帰だと実装楽そうだけどどうしよう
# 問題は終了と最初がわからんこと
# いや最初は全部長さ0をセットすればいいだろ
import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv... | # DAGの最長経路...トポロジカルソートもどきか？
# 普通にDAGに沿ったdpをすればいいのでは?
# 再帰だと実装楽そうだけどどうしよう
# 問題は終了と最初がわからんこと
# いや最初は全部長さ0をセットすればいいだろ
import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv... | p03166 |
#!/usr/bin/env python3
#EDPC G
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Coun... | #!/usr/bin/env python3
#EDPC G
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Coun... | p03166 |
from collections import defaultdict
import sys
sys.setrecursionlimit(10**6)
def solve(N, M, edges):
longest = {}
def get_longest(start):
if start in longest:
return longest[start]
next_edges = edges.get(start)
if not next_edges:
ret = 0
... | #!/usr/bin/env python3
"""
Simple Version
Python TLE https://atcoder.jp/contests/dp/submissions/14906600
PyPy TLE https://atcoder.jp/contests/dp/submissions/14906630
"""
from collections import defaultdict
import sys
sys.setrecursionlimit(10**6)
def solve(N, M, edges):
longest = [-1] * (N + 1)
... | p03166 |
n, m = list(map(int, input().split()))
edges = [[0 for _ in range(n+1)] for _ in range(n+1)]
for _ in range(m):
x, y = list(map(int, input().split()))
edges[x][y] = 1
dp = [-1 for _ in range(n+1)]
def longest_path(u):
if dp[u] != -1:
return dp[u]
d = 0
for i in range(1, n+1):... | import sys
sys.setrecursionlimit(10**5)
n, m = list(map(int, input().split()))
edges = [[] for _ in range(n+1)]
for _ in range(m):
x, y = list(map(int, input().split()))
edges[x].append(y)
dp = [-1 for _ in range(n+1)]
def longest_path(u):
if dp[u] != -1:
return dp[u]
d = 0
... | p03166 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**5+1)
from functools import lru_cache
def main():
N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(M):
x, y = list(map(int, input().split()))
x -= 1
y -= 1
G[x].append(... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**5+1)
from functools import lru_cache
N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(M):
x, y = list(map(int, input().split()))
x -= 1
y -= 1
G[x].append(y)
@lru_cache(maxsize=10**5+1)
def dp... | p03166 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.