input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
X, N = list(map(int, input().split(' ')))
if N == 0:
print(X)
else:
ls = list(map(int, input().split(' ')))
diff = -1
for i in range(101, -1, -1):
if i not in ls:
if diff == -1:
diff = abs(i - X)
result = i
else:
... | X, N = list(map(int, input().split(' ')))
if N == 0:
print(X)
else:
ls = list(map(int, input().split(' ')))
diff, rst = -1, 0
for i in range(101, -1, -1):
if i not in ls:
if diff == -1:
diff = abs(X - i)
rst = i
else:
... | p02641 |
import queue
X,N = list(map(int,input().split()))
if N!=0:
p = list(map(int,input().split()))
else:
p=[]
q = queue.Queue()
q.put(X)
while True:
t = q.get()
if t in p:
q.put(t-1)
q.put(t+1)
else:
print(t)
break
| X,N = list(map(int,input().split()))
if N!=0:
p = list(map(int,input().split()))
else:
p=[]
d = {n: 1 for n in p}
a = X
b = X
while True:
if d.get(a) != 1:
print(a)
break
elif d.get(b) != 1:
print(b)
break
else:
a -= 1
b += 1
| p02641 |
import sys
x,n=list(map(int,input().split()))
ans=10000
ansaa=10000
ans1=[]
ans2=[]
ans3=[]
if n>0:
l=list(map(int,input().split()))
else:
print(x)
sys.exit()
for i in range(len(l)):
if abs(ans-l[i])<ans:
ans1.append(l[i])
ans1.append(l[i]-1)
ans1.append(l[i]+1)
... | import sys
x,n=list(map(int,input().split()))
ans=10000
ans1=[]
ans2=[]
if n>0:
l=list(map(int,input().split()))
else:
print(x)
sys.exit()
for i in range(len(l)):
if abs(ans-l[i])<ans:
ans1.append(l[i])
ans1.append(l[i]-1)
ans1.append(l[i]+1)
ans1=sorted(ans1)
for... | p02641 |
x,n = list(map(int,input().split()))
if n == 0:
print(x)
exit()
P = [*list(map(int,input().split()))]
ans = 100000000 # inf
for d in range(100): # [0,100)
now_diff = abs(ans - x)
min_x, max_x = x - d, x + d
if min_x not in P:
if now_diff > abs(min_x - x): ans = x-d
elif max_... | x,n = list(map(int,input().split()))
if n == 0:
print(x)
exit()
P = [*list(map(int,input().split()))]
ans = 100+100 # inf = x + d + 1
for d in range(100): # [0,100)
now_diff = abs(ans - x)
min_x, max_x = x - d, x + d
if min_x not in P:
if now_diff > abs(min_x - x): ans = x-d
e... | p02641 |
x, n = list(map(int, input().split()))
if n == 0: print(x); exit()
P = [*list(map(int, input().split()))]
for d in range(100): # [0,100)
a = x - d
if a not in P: print(a); exit()
a = x + d
if a not in P: print(a); exit()
| x, n = list(map(int, input().split()))
if n == 0: print(x); exit()
C = [0]*(101+1) # candidate:[0,101]
for p in map(int, input().split()):
C[p] = 1
ans = x
d = 1000000000
for c in range(101+1):
if not C[c] and d > abs(x - c):
d = abs(x - c)
ans = c
print(ans)
| p02641 |
x, n = list(map(int, input(). split()))
p = list()
if n > 0:
p = list(map(int, input(). split()))
if x not in p:
print(x)
else:
d = 1
while True:
if x-d not in p:
print((x-d))
break
if x+d not in p:
print((x+d))
break
d += 1 | import sys
x, n = list(map(int, input(). split()))
l = [0]*n
m = [0]*200
ans = 0
p = list()
if n > 0:
p = list(map(int, input(). split()))
else:
print(x)
sys.exit()
for i in range(n):
l[i] = abs(x-p[i])
m[l[i]] += 1
if m[0] == 0:
print(x)
else:
for j in range(1, 200):
if m[j] != 2:
... | p02641 |
import bisect
X, N=list(map(int, input().split()))
if N==0:print(X);exit()
p=sorted(list(map(int, input().split())))
#print(p)
m=min(p)-1
M=max(p)+1
#for i in range(m,M+1):
# p.append(i)
#p=sorted(p)
m=X;i=0
for i in range(m,min(p)-2,-1):
if i not in p:break
M=X;j=0
for j in range(M,max(p)+2):
if j ... | X, N=list(map(int, input().split()))
if N==0:print(X);exit()
p=sorted(list(map(int, input().split())))
m=X;i=0
for i in range(m,min(p)-2,-1):
if i not in p:break
M=X;j=0
for j in range(M,max(p)+2):
if j not in p:break
if abs(i-X)==abs(j-X):print((min(i,j)))
elif abs(i-X)<abs(j-X):
print(i)
else:prin... | p02641 |
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [lis... | x, n = list(map(int, input(). split()))
m = [0]*200
ans = 0
if n > 0:
p = list(map(int, input(). split()))
else:
print(x)
quit()
for i in range(n):
l = abs(x-p[i])
m[l] += 1
if m[0] == 0:
print(x)
else:
for j in range(1, 200):
if m[j] < 2:
a = x-j
A = x+j
if a not i... | p02641 |
import sys
input=sys.stdin.readline
x,n=list(map(int,input().split()))
if n==0:
print(x)
else:
p=list(map(int,input().split()))
a=0
d=0
while a==0:
if x-d in p:
if x+d in p:
d+=1
else:
a=x+d
else:
a... | import sys
input=sys.stdin.readline
x,n=list(map(int,input().split()))
if n==0:
print(x)
else:
p=list(map(int,input().split()))
d=0
while True:
if x-d in p:
if x+d in p:
d+=1
else:
a=x+d
break
else:
... | p02641 |
x, n = list(map(int, input().split()))
if n == 0:
print(x)
else:
p = list(map(int, input().split()))
p.sort()
y = 0
for i in range(n):
if p[i] <= x:
y = i
if i != n-1 and x < p[i+1]:
break
i = 0
while 1 == 1:
if 0 <... | x, n = list(map(int, input().split()))
if n == 0:
print(x)
else:
p = list(map(int, input().split()))
p.sort()
y = 0
for i in range(n):
if p[i] <= x:
y = i
if i != n-1 and x < p[i+1]:
break
i = 0
while 1 == 1:
if y -... | p02641 |
X, N = list(map(int, input().split()))
if N > 0:
P = list(map(int, input().split()))
res = float('Inf')
A = [0]*101
for n in range(N):
A[P[n]-1] += 1
cnt = 1
man = float('Inf')
for a in A:
if a == 0:
total = abs(X - cnt)
if res > total:
... | X, N = list(map(int, input().split()))
if N > 0:
P = list(map(int, input().split()))
A = [0]*102
cnt = 0
res = float('Inf')
for n in range(N):
A[P[n]] += 1
for a in A:
if a == 0:
total = abs(X - cnt)
if res > total:
res = total
... | p02641 |
x,n,*p=list(map(int,open(0).read().split()))
print((min({*list(range(999))}-{*p},key=lambda y:abs(y-x)))) | x,n,*p=list(map(int,open(i:=0).read().split()))
while x in p:x+=(-1)**i*i;i+=1
print(x) | p02641 |
from bisect import bisect_left,bisect
x,N,*p = list(map(int,open(0).read().split()))
dif = 300
near = 300
all_ = set(range(0,102))
for i in p:
d = abs(i - x)
if dif > d:
dif = d
near = i
left = list(all_ - set(p))
dif2 = 300
near = 300
for i in left:
d = abs(x-i)
... | X,N,*p = list(map(int,open(0).read().split()))
dif = 100
ans = -1
for i in range(102):
a = abs(X-i)
if i in p:
continue
if a < dif:
dif = a
ans = i
print(ans) | p02641 |
x, n = list(map(int, input().split()))
if n == 0:
print(x)
exit()
p = list(map(int, input().split()))
for d in range(x + 2):
for s in [-1, 1]:
a = x + s * d
if a not in p:
print(a)
exit() | x, n = list(map(int, input().split()))
if n == 0:
print(x)
exit()
p = list(map(int, input().split()))
for d in range(x + 2):
if x - d not in p:
print((x-d))
exit()
if x + d not in p:
print((x+d))
exit() | p02641 |
def q3():
x, N = [int(i) for i in input().split(" ")]
if N != 0:
P = [int(i) for i in input().split(" ")]
else:
P = []
if x not in P:
print(x)
return
xm = x
xp = x
while True:
xm = xm - 1
if xm not in P:
print(... |
def q3():
x, N = [int(i) for i in input().split(" ")]
if N != 0:
P = set([int(i) for i in input().split(" ")])
else:
P = set()
if x not in P:
print(x)
return
xm = x
xp = x
while True:
xm = xm - 1
if xm not in P:
... | p02641 |
x, n = list(map(int, input().split()))
if n==0:
print(x)
else:
p = list(map(int, input().split()))
p.sort()
i = 0
while i < n and p[i] < x:
i += 1
if p[i] != x:
print(x)
else:
j = 1
up = x+j
down = x-j
while True:
... | x, n = list(map(int, input().split()))
if n==0:
print(x)
else:
p = list(map(int, input().split()))
p.sort()
i = 0
while i < n and p[i] < x:
i += 1
if p[i] != x:
print(x)
else:
j = 1
up = x+j
down = x-j
while True:
... | p02641 |
n,m=list(map(int,input().split()))
N=3*n
d=[[0]*(N+1) for i in range(N+5)]
d[0][0]=1
for i in range(N):
a,b,c,e,*_=d[i:]
for j in range(N):
J=j+1
b[j]=(b[j]+a[j])%m
c[J]=(c[J]+a[j]*(i+1))%m
e[J]=(e[J]+a[j]*(i+1)*(i+2))%m
print((sum(d[N][:n+1])%m))
| n,m=list(map(int,input().split()))
N=3*n
d=[[0]*(N+1) for i in range(N+4)]
d[0][0]=1
for i in range(N):
a,b,c,e=d[i:i+4]
for j in range(N):J=j+1;b[j]=(b[j]+a[j])%m;c[J]=(c[J]+a[j]*(i+1))%m;e[J]=(e[J]+a[j]*(i+1)*(i+2))%m
print((sum(d[N][:n+1])%m))
| p02738 |
N,mod=list(map(int,input().split()))
DP=[[0]*(N+5) for i in range(3*N+5)]
DP[0][0]=1
for i in range(3*N):
for j in range(N+1):
DP[i+1][j]+=DP[i][j]
DP[i+2][j+1]+=((3*N-i)-1)*DP[i][j]
DP[i+3][j+1]+=((3*N-i)-1)*((3*N-i)-2)*DP[i][j]
ANS=0
for i in range(N+1):
ANS+=DP[3*N][i]... | N,mod=list(map(int,input().split()))
DP=[[0]*(N+5) for i in range(3*N+5)]
DP[0][0]=1
for i in range(3*N):
for j in range(N+1):
DP[i][j]%=mod
DP[i+1][j]+=DP[i][j]
DP[i+2][j+1]+=((3*N-i)-1)*DP[i][j]
DP[i+3][j+1]+=((3*N-i)-1)*((3*N-i)-2)*DP[i][j]
ANS=0
for i in range(N+1... | p02738 |
N,mod=list(map(int,input().split()))
DP=[[0]*(N+5) for i in range(3*N+5)]
DP[0][0]=1
for i in range(3*N):
for j in range(N+1):
DP[i][j]%=mod
DP[i+1][j]+=DP[i][j]
DP[i+2][j+1]+=((3*N-i)-1)*DP[i][j]
DP[i+3][j+1]+=((3*N-i)-1)*((3*N-i)-2)*DP[i][j]
ANS=0
for i in range(N+1... | N,m=list(map(int,input().split()))
M=3*N
DP=[[0]*(N+5) for i in range(M+5)]
DP[0][0]=1
for i in range(1,M+1):
for j in range(N+1):
DP[i][j]=(DP[i-1][j]+(M-i+1)*DP[i-2][j-1]+(M-i+1)*(M-i+2)*DP[i-3][j-1])%m
print((sum(DP[3*N][:N+1])%m)) | p02738 |
from functools import lru_cache, reduce
from itertools import accumulate
N, M = list(map(int, input().split()))
@lru_cache(maxsize=None)
def mod_inv(x):
x1, y1, z1 = 1, 0, x
x2, y2, z2 = 0, 1, M
while z1 != 1:
d, m = divmod(z2, z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y1
z1, z2 = ... | from functools import lru_cache
N, M = list(map(int, input().split()))
@lru_cache(maxsize=None)
def mod_inv(x):
x1, y1, z1 = 1, 0, x
x2, y2, z2 = 0, 1, M
while z1 != 1:
d, m = divmod(z2, z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y1
z1, z2 = m, z1
return x1%M
def gen_Y(i):
#... | p02738 |
import sys
sys.setrecursionlimit(1000000)
n = int(eval(input()))
alst = list(map(int, input().split()))
edges = [[] for _ in range(n)]
rev_edges = [[] for _ in range(n)]
for i in range(n):
edges[i].append((i + alst[i]) % n)
rev_edges[(i + alst[i]) % n].append(i)
def dfs(x, ret, edges, visited):
visi... | import sys
sys.setrecursionlimit(1000000)
def dfs(x, order, edges, visited):
visited[x] = True
for e in edges[x]:
if not visited[e]:
dfs(e, order, edges, visited)
order.append(x)
def dfs_rev(x, rev_edges, visited):
visited[x] = True
ret = 0
for e in rev_edges[x]:
if not visited... | p00344 |
def mygets():
return list(map(int, input().strip().split(' ')))
n, x = mygets()
a = mygets()
b1 = a
ans = sum(a)
def f(k, u):
j = k - 1
if j < 0:
j = n - 1
w = b1[j]
if u < w:
return u
return w
for i in range(1, n):
b2 = [f(k, u) for k, u in enumerate... | def mygets():
return [int(v) for v in input().strip().split(' ')]
n, x = mygets()
a = mygets()
b1 = a
ans = sum(a)
for i in range(1, n):
b2 = [u if u < b1[k - 1] else b1[k - 1] for k, u in enumerate(a)]
ans = min(ans, sum(b2) + i * x)
b1 = b2
print(ans) | p04006 |
N, X, *A = list(map(int, open(0).read().split()))
class SegmentTree:
inf = 2 ** 31 - 1
def __init__(self, n):
"""0-indexed."""
x = 1
while x < n:
x *= 2
self.n = x
self.dat = [self.inf] * (2 * x - 1)
def update(self, k, v):
... | N, X, *A = list(map(int, open(0).read().split()))
ans = sum(A)
b = A[:]
for k in range(1, N):
for i in range(N):
b[i] = min(b[i], A[i - k])
ans = min(ans, k * X + sum(b))
print(ans)
| p04006 |
N, x = list(map(int, input().split()))
A = list(map(int, input().split())) * 2
A = A[::-1]
effective_costs = [float('inf')] * N
ans = float('inf')
# 魔法を使う回数
for k in range(N):
cost = 0
for i in range(N):
effective_costs[i] = min(effective_costs[i], A[i+k])
cost += effective_costs[i... | N, x = list(map(int, input().split()))
A = list(map(int, input().split())) * 2
A = A[::-1]
effective_costs = [float('inf')] * N
ans = float('inf')
# 魔法を使う回数
for k in range(N):
effective_costs = [min(effective_costs[i], A[i+k]) for i in range(N)]
ans = min(ans, sum(effective_costs) + k * x)
print(... | p04006 |
import sys
from copy import deepcopy
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline(... | import sys
from copy import deepcopy
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline(... | p04006 |
import sys
from copy import deepcopy
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline(... | import sys
from copy import deepcopy
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N,x = MI()
A = LI()
B = deepcopy(A)
A += A
ans = sum(B)
for k in range(1,N+1): # 魔法を k 回唱える
for i in range(N):
... | p04006 |
n, x = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
ans = 0
b = []
for k in range(n):
if k == 0:
b = a.copy()
else:
for i in range(n):
b[i] = min(a[(i-k)%n],b[i])
cost = k*x+sum(b)
if k == 0:
ans = cost
else:
ans = ... |
def solve(n, x, a):
costs = []
cost_min = 0
for k in range(n):
if k == 0:
costs = a.copy()
else:
for i in range(n):
costs[i] = min(costs[i], a[(i-k)%n])
cost_k = sum(costs) + k*x
if k == 0:
cost_min = cost_k
else:
cost_min = min(cost_min, cost_k)
if cost_min != cost_k:
... | p04006 |
import bisect
import sys
import math
import itertools
sys.setrecursionlimit(10000)
INF = float('inf')
# input macro
def i():
return int(input())
def ii():
return list(map(int,input().split(" ")))
def s():
return input()
def ss():
return input().split(" ")
def slist():
return list... | n,x=list(map(int,input().split(" ")))
a=list(map(int,input().split(" ")))
t=[i for i in a]
s=10**15
for m in range(n):
t=[min(t[j],a[(j-m)%n]) for j in range(n)]
s=min(x*m+sum(t),s)
print(s) | p04006 |
import sys
import heapq
from collections import defaultdict as dd
input = sys.stdin.readline
N, x = list(map(int, input().split()))
a = list(map(int, input().split()))
res = float("inf")
class prim:
def __init__(self, n, e):
self.e = e
self.n = n
def MSTcost(self):
h = []
visited = [0... | import sys
input = sys.stdin.readline
N, x = list(map(int, input().split()))
a = list(map(int, input().split()))
res = float("inf")
t = [float("inf")] * N
for k in range(N + 1):
for i in range(N):
t[(i + k) % N] = min(t[(i + k) % N], a[i])
res = min(res, sum(t) + k * x)
print(res)
| p04006 |
import sys
class segment_():
def __init__(self, init_val, n, segfunc):
self.ide_ele = 10**9+1
# num: n以上の最小の2のべき乗
self.num = 1 << (n - 1).bit_length()
self.seg = [self.ide_ele]*2*self.num
self.segfunc = segfunc
# set_val
for i in range(n):
... | import sys
n, x = list(map(int,sys.stdin.readline().split()))
A = list(map(int,sys.stdin.readline().split()))
ans = 10**18
mins = [a for a in A]
for k in range(n):
for i in range(n):
if k <= i:
mins[i] = min(A[i-k], mins[i])
else:
mins[i] = min(A[n-(k-i)], mins[... | p04006 |
import sys
n, x = list(map(int,sys.stdin.readline().split()))
A = list(map(int,sys.stdin.readline().split()))
ans = 10**18
mins = [a for a in A]
for k in range(n):
for i in range(n):
if k <= i:
mins[i] = min(A[i-k], mins[i])
else:
mins[i] = min(A[n-(k-i)], mins[... | n, x = list(map(int,input().split()))
A = list(map(int,input().split()))
ans = 10**18
mins = [a for a in A]
for k in range(n):
for i in range(n):
if k <= i:
mins[i] = min(A[i-k], mins[i])
else:
mins[i] = min(A[n-(k-i)], mins[i])
ans = min(sum(mins)+k*x, ans)
... | p04006 |
import sys
input = sys.stdin.buffer.readline
# identity element
ide_ele = 10**9+1
def main():
n, x = list(map(int, input().split()))
A = list(map(int, input().split()))
def segfunc(x, y):
if x <= y:
return x
else:
return y
def init(init_val):
... | n, x = list(map(int,input().split()))
A = list(map(int,input().split()))
class SegTree:
def __init__(self, init_val, ide_ele, segfunc):
self.n = len(init_val)
self.num = 2**(self.n-1).bit_length()
self.ide_ele = ide_ele
self.segfunc = segfunc
self.seg = [ide_ele]*2*... | p04006 |
n, x = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
B = A[:]
ans = sum(A)
for i in range(1, n):
for j in range(n):
B[j] = min(B[j], A[j-i])
ans = min(ans, sum(B) + i * x)
print(ans) | n, x = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
B = A[:]
ans = sum(A)
for i in range(1, n):
B = [min(B[j], A[j-i]) for j in range(n)]
ans = min(ans, sum(B) + i * x)
print(ans) | p04006 |
n,x=list(map(int,input().split()))
a=list(map(int,input().split()))
s=[[10**12]*n for _ in range(n)]
for i in range(n):
for j in range(n):
if j==0:s[i][j]=a[i]
else:s[i][j]=min(s[i][j-1],a[(i-j)%n])
ans=10**12
for j in range(n):
tmp=x*j
for i in range(n):
tmp+=s[i][j]
... | n,x=list(map(int,input().split()))
a=list(map(int,input().split()))
s=[[10**12]*n for _ in range(n)]
for i in range(n):
for j in range(n):
if j==0:s[i][j]=a[i]
else:s[i][j]=min(s[i][j-1],a[(i-j)%n])
ans=float("inf")
for j in range(n):
tmp=x*j
for i in range(n):
tmp+=s[i][j... | p04006 |
import copy
n,x = list(map(int,input().split()))
a = list(map(int,input().split()))
l = copy.deepcopy(a)
ans = float("INF")
for i in range(n):
count = x*i
for j in range(n):
l[j] = min(l[j],a[(j-i)%n])
count += l[j]
ans = min(ans,count)
print(ans) | n,x = list(map(int,input().split()))
a = list(map(int,input().split()))
l = [float("INF")]*n
ans = float("INF")
for i in range(n):
count = x*i
for j in range(n):
l[j] = min(l[j],a[(j-i)%n])
count += l[j]
ans = min(ans,count)
print(ans) | p04006 |
from collections import deque
class SlideMin:
"""
スライド最小値\n
各区間[ai, ai+leng]の最小値を取得する：O(n)\n
self.que = [(i1, v1), (i2, v2), ..., (ik, vk)]\n
i1 < ... < ik and v1 < ... < vk
"""
def __init__(self, leng):
self.que = deque([])
self.leng = leng
def top(self):
... | N, X = list(map(int, input().split()))
A = list(map(int, input().split()))
B = A[:]
ans = sum(A)
for x in range(1, N + 1):
for i in range(N)[::-1]:
if B[i] > A[i - x]:
B[i] = A[i - x]
ans = min(ans, sum(B) + x * X)
print(ans)
| p04006 |
N, x = list(map(int, input().split()))
a = list(map(int, input().split()))
B = a[:] # 魔法の回数がk以下のときのスライムjをてに入れる最小の時間（ただし、魔法を唱える時間は最後に
# 加えるのでここでは除いている
ans = 10 ** 13
for i in range(N):
for j in range(N):
if B[j] > a[j - i]:
B[j] = a[j - i]
tmp = sum(B) + i * x
if ans > ... | N, x = list(map(int, input().split()))
a = list(map(int, input().split()))
B = a[:] # 魔法の回数がk以下のときのスライムjをてに入れる最小の時間（ただし、魔法を唱える時間は最後に
# 加えるのでここでは除いている
ans = 10 ** 13
for i in range(N):
B = [a[j - i] if B[j] > a[j - i] else B[j] for j in range(N)]
tmp = sum(B) + i * x
if ans > tmp:
a... | p04006 |
N, x = list(map(int, input().split()))
a_list = list(map(int, input().split()))
ex_list = a_list.copy()
ex_list.extend(a_list)
ans = float("inf")
for i in range(N):
cost = 0
for j in range(N):
cost += min(ex_list[N-i+j:N+1+j])
cost += x * i
ans = min(ans, cost)
print(ans)
| N, x = list(map(int, input().split()))
a_list = list(map(int, input().split()))
ex_list = a_list.copy()
ex_list.extend(a_list)
ans = float("inf")
cost_list = [float("inf") for _ in range(N)]
for i in range(N):
cost = 0
for j in range(N):
if i == 0:
cost += ex_list[N + j]
... | p04006 |
def read():
return [int(i) for i in input().split(" ")]
N, x = read()
A = read()
ans = sum(A)
tempcost = ans
BC = A[:]
for i in range(1, N):
BC = [BC[j - 1] if BC[j - 1] < BC[j] else BC[j] for j in range(N)]
tempcost = x * i + sum(BC)
if(ans > tempcost):
ans = tempcost
else:
break
print(ans)
| def read():
return [int(i) for i in input().split(" ")]
N, x = read()
A = read()
ans = sum(A)
tempcost = ans
BC = A[:]
xt = 0
for i in range(1, N):
xt += x
BC = [BC[j - 1] if BC[j - 1] < BC[j] else BC[j] for j in range(N)]
tempcost = xt + sum(BC)
if(ans > tempcost):
ans = tempcost
else:
break
... | p04006 |
from itertools import accumulate
from functools import reduce
N,x,*A = list(map(int, open(0).read().split()))
dp = [0]*N
for i in range(N):
dp[i] = list(accumulate((A[i-j] for j in range(N)),min))
ans = reduce(min, (i*x+sum(a) for i,a in enumerate(zip(*dp))))
print(ans) | from itertools import accumulate
from functools import reduce
N,x,*A = list(map(int, open(0).read().split()))
dp =[list(accumulate((A[i-j] for j in range(N)),min)) for i in range(N)]
ans = reduce(min, (i*x+sum(a) for i,a in enumerate(zip(*dp))))
print(ans) | p04006 |
import sys
input = sys.stdin.buffer.readline
class segtree:
def __init__(self, n, operator, identity):
"""
n:データ配列のサイズ
operator:演算子(モノイド)。関数オブジェクト 最小=min, 最大=max
identity:演算子に対応する単位元
"""
nb = bin(n)[2:] #２進数に変換して先頭の0bを取り除く
bc = sum([int(digit) fo... | INF = 2**31-1
class segtree():
def __init__(self, N):
self.N0 = 2**(N-1).bit_length()
self.data = [INF]*((2*self.N0)+1)
# a_k の値を x に更新
def update(self, k, x):
k += self.N0-1
self.data[k] = x
while k >= 0:
k = (k - 1) // 2
self.dat... | p04006 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
from queue import deque
n,x = list(map(int, input().split()))
a = list(map(int, input().split()))
def sub(p):
k = p
res = []
q = deque([])
# q: ... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
from queue import deque
n,x = list(map(int, input().split()))
A = list(map(int, input().split()))
def sub(p):
k = p
res = []
q = deque([])
a = A... | p04006 |
from functools import lru_cache
# 入力
N, x = list(map(int, input().split()))
a = list(map(int, input().split()))
# a_i, a_{i + 1}, ..., a_j の最小値
@lru_cache(maxsize=None)
def f(i, j):
return (
a[i] if i == j else
min(f(i, (j - 1) % N), a[j])
)
# 変色回数を0からN-1まで決め打ちして解を求める
ans = min... | # 入力
N, x = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [[0 for _ in range(N)] for i in range(N)]
for i in range(N):
dp[i][i] = a[i]
for k in range(1, N):
j = (i + k) % N
dp[i][j] = min(dp[i][(j - 1) % N], a[j])
# 変色回数を0からN-1まで決め打ちして解を求める
ans = min(
... | p04006 |
N,X = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = float("inf")
for loop in range(0, N+1):
mxcnt = loop
NC=A[:]
for i in range(2*N+1):
if i >=N: i%=N
pcnt=1
pi=(i+1)%N
v=A[i]
while pcnt<=mxcnt:
if v>=NC[pi]: break
NC[pi]=v
p... | N,X = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = float("inf")
bik = A[:]
get_idx_back = lambda idx,b: idx-b if idx>=b else idx+N-b
for loop in range(0, N+1):
if loop == 0:
bik = A[:]
else:
for i in range(N):
bik[i] = min(bik[i], A[ get_idx_back(i... | p04006 |
N, x = list(map(int, input().split()))
a = list(map(int, input().split()))
s_cost = a.copy()
cost = sum(s_cost)
for k in range(1,N):
for i in range(N):
if s_cost[i] > a[(i-k)%N] :
s_cost[i] = a[(i-k)%N]
if cost > k*x + sum(s_cost):
cost = k*x + sum(s_cost)
else:
... |
def solve_():
import itertools
N, x = list(map(int, input().split()))
a = list(map(int, input().split()))
s_cost = a.copy()
cost = sum(s_cost)
for k, i in itertools.product(list(range(1, N)), list(range(N))):
s_cost[i] = a[(i - k) % N] if s_cost[i] > a[(i - k) % N] else s_cost... | p04006 |
N, x, *A = list(map(int, open(0).read().split()))
ans = float("inf")
for i in range(N):
ans = min(ans, sum(A) + x * i)
A = [min(a, b) for a, b in zip(A, [A[-1]] + A[:-1])]
print(ans) | N, x, *A = list(map(int, open(0).read().split()))
ans = float("inf")
for k in range(N):
ans = min(ans, sum(A) + x * k)
A = [min(a, b) for a, b in zip(A, A[-1:] + A[:-1])]
print(ans) | p04006 |
n, x = list(map(int, input().split()))
a = list(map(int, input().split()))
a += a
ans = float("inf")
for i in range(1, n+1):
t = 0
for j in range(n):
t += min(a[j:j + i])
ans = min(ans, t+10*(i-1))
print(ans) | n, x = list(map(int, input().split()))
a = list(map(int, input().split()))
a += a
mah = [10000000000]*n
ans = float("inf")
for i in range(1, n+1):
t = 0
for j in range(n):
if mah[j] > a[j + i]:
mah[j] = a[j+i]
t += mah[j]
ans = min(ans, t+x*(i-1))
print(ans) | p04006 |
N, x = list(map(int,input().split()))
A = list(map(int,input().split()))
ans = sum(A)
A = A+A
for k in range(1,N):
L = [0]*N
for l in range(N):
T = A[N+l-k:N+l+1]
L[l] = min(T)
ans = min(ans,sum(L)+k*x)
print(ans)
| N, x = list(map(int,input().split()))
A = list(map(int,input().split()))
T = [A[k] for k in range(N)]
ans = sum(A)
A = A+A
for k in range(1,N):
for l in range(N):
T[l] = min(T[l],A[N+l-k])
ans = min(ans,sum(T)+k*x)
print(ans)
| p04006 |
N, x, *A = list(map(int, open(0).read().split()))
B = A[:]
ans = sum(A)
for k in range(1, N):
B = [min(v, A[i - k]) for i, v in enumerate(B)]
ans = min(ans, sum(B) + k * x)
print(ans) | N, x = list(map(int, input().split()))
A = list(map(int, input().split()))
B = A[:]
ans = sum(A)
for k in range(1, N):
B = [min(B[i], A[i - k]) for i in range(N)]
ans = min(ans, sum(B) + k * x)
print(ans) | p04006 |
import sys
stdin = sys.stdin
def li(): return [int(x) for x in stdin.readline().split()]
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return [float(x) for x in stdin.readline().split()]
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): re... | import sys
stdin = sys.stdin
def li(): return [int(x) for x in stdin.readline().split()]
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return [float(x) for x in stdin.readline().split()]
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): re... | p04006 |
def main():
N, x = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = float("INF")
b = [float("INF")]*N
for k in range(N):
temp_ans = k*x
for i in range(N):
b[i] = min(b[i],a[i-k])
temp_ans += b[i]
ans = min(ans,temp_an... | def main():
N, x = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = float("INF")
b = [float("INF")]*N
for k in range(N):
temp_ans = k*x
for i in range(N):
t = a[i-k]
if t < b[i]:
b[i] = t
temp_ans... | p04006 |
import sys
input = sys.stdin.buffer.readline
def main():
N,x = list(map(int,input().split()))
count = N
N *= 2
a = list(map(int,input().split()))
ans = sum(a)
a += a
def segfunc(x,y):
return min(x,y)
def init(init_val):
for i in range(N):
... | import sys
input = sys.stdin.buffer.readline
def main():
N,x = list(map(int,input().split()))
a = list(map(int,input().split()))
b = a.copy()
ans = 10**15
for i in range(N):
time = i*x+sum(b)
ans = min(ans,time)
for now in range(N):
b[now] = min... | p04006 |
#b faster
#m_i(k) = min(m_i(k-1), a_(i-k))
n,x = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
m = a[::]
a.extend(a)
min_cost = 10**10
for k in range(n):
cost = x * k
for i in range(n,2*n):
mini = min(m[i-n], a[i-k])
m[i-n] = mini
cost += ... | #b faster
#m_i(k) = min(m_i(k-1), a_(i-k))
# http://agc004.contest.atcoder.jp/data/agc/004/editorial.pdf
n,x = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
m = a[::]
a.extend(a)
min_cost = sum(a)
for k in range(n):
#cost = x * k
for i in range(n,2*n):
m[i... | p04006 |
n,x,*a=list(map(int,open(0).read().split()));i,m=0,1e18;exec('m=min(m,sum(a)+x*i);i+=1;a=[min(t)for t in zip(a,a[-1:]+a)];'*n);print(m) | n,x,*a=list(map(int,open(0).read().split()))
m=1e18
for i in range(n):m=min(m,sum(a)+x*i);a=[min(t)for t in zip(a,a[-1:]+a)]
print(m) | p04006 |
# coding:utf-8
INF = float('inf')
def inpl(): return list(map(int, input().split()))
N, x = inpl()
A = inpl()
min_index = A.index(min(A))
B = A[min_index:] + A[:min_index]
cost = [[INF] * N for i in range(N)]
for i in range(N):
cost[i][0] = B[i]
for i in range(N):
for magic in range(1... | # coding:utf-8
INF = float('inf')
def inpl(): return list(map(int, input().split()))
N, x = inpl()
A = inpl()
min_index = A.index(min(A))
B = A[min_index:] + A[:min_index]
cost = [B[i] for i in range(N)]
ans = INF
for magic in range(N):
for i in range(N):
if i - magic >= 0:
... | p04006 |
N,X = list(map(int,input().split()))
src = list(map(int,input().split()))
dp = src[:]
ans = float('inf')
for n in range(N):
for m in range(N):
if dp[m] > src[m-n]:
dp[m] = src[m-n]
ans = min(ans, sum(dp)+n*X)
print(ans) | N,X = list(map(int,input().split()))
A = list(map(int,input().split()))
ans = sum(A)
costs = A[:]
for i in range(1,N):
cost = i*X
if cost >= ans: break
for j in range(N):
costs[j] = min(costs[j], A[(j-i)%N])
cost += costs[j]
ans = min(ans, cost)
print(ans) | p04006 |
N, x = list(map(int, input().split()))
bs = list(map(int, input().split()))
dp1 = bs[:]
ans = sum(bs)
for k in range(1, 2000):
dp2 = []
for i, b in enumerate(bs):
dp2.append(min(dp1[i-1], b))
ans = min(ans, sum(dp2)+k*x)
dp1 = dp2[:]
print(ans) | N, x = list(map(int, input().split()))
bs = list(map(int, input().split()))
dp = bs[:]
ans = sum(bs)
for k in range(1, N):
dp = [min(dp[i], bs[i-k]) for i in range(N)]
ans = min(ans, sum(dp)+x*k)
print(ans) | p04006 |
n,x = list(map(int,input().split()))
a = list(map(int,input().split()))
#p[i色のスライム][j回まで色を変えられる]=色変えのコストを含まない最小コスト
p = [[0]*n for i in range(n)]
cnt = [[0]*n for i in range(n)]
#print(p)
for i in range(n):
p[i][0]=a[i]
for j in range(1,n):
if i-j>=0:
p[i][j]=min(a[i-j],p[i][j-1])
elif i-j... | n,x = list(map(int,input().split()))
a = list(map(int,input().split()))
#p[i色のスライム][j回まで色を変えられる]=色変えのコストを含まない最小コスト
p = [[0]*n for i in range(n)]
#print(p)
for i in range(n):
p[i][0]=a[i]
for j in range(1,n):
if i-j>=0:
p[i][j]=min(a[i-j],p[i][j-1])
elif i-j == -1:
p[i][j]=min(a[n-... | p04006 |
"""
入れる場所とそこから波及する場所の最大距離が魔法使用回数
魔法使用回数を決め打ちしてdp？
魔法をp回使うとすると、左p箇所のうち最小の場所から入れるのが最適になる
heapを使うか～
2000 * 2000 * log(2000)
間に合うかなぁ～
4*10**7かぁ
"""
import heapq
N,x = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = float("inf")
for p in range(N):
now = x * p
... | """
入れる場所とそこから波及する場所の最大距離が魔法使用回数
魔法使用回数を決め打ちしてdp？
魔法をp回使うとすると、左p箇所のうち最小の場所から入れるのが最適になる
heapを使うか～
2000 * 2000 * log(2000)
間に合うかなぁ～
4*10**7かぁ
各項からn個左を見た時のaの最小値を求めておく!!!
"""
lis = []
N,x = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = [x * i for i in range(N)]
... | p04006 |
from collections import deque
N, x = list(map(int, input().split()))
a = list(map(int, input().split()))
pos = a.index(min(a))
na = [a[pos]] + a[pos+1:] + a[:pos]
ans = sum(a)
for k in range(1, N):
d = deque([], k + 1)
b = []
for i in range(N):
d.append(na[i])
# print(d)
... | N, x = list(map(int, input().split()))
a = list(map(int, input().split()))
pos = a.index(min(a))
na = [a[pos]] + a[pos+1:] + a[:pos]
ans = sum(a)
old_b = na[:]
for k in range(1, N):
b = []
for i in range(N):
if i - k >= 0:
b.append(min(old_b[i], na[i - k]))
else:
... | p04006 |
class Segtree(object):
import math
def __init__(self, init_val, N, func_type):
self.func = self.segfunc_min
self.ide_ele = 10**9 # min
if func_type == 'max':
self.func = self.segfunc_max
self.ide_ele = -10**9 # max
elif func_type == 'gcd':
... | N,x = list(map(int,input().split()))
a = list(map(int,input().split()))
res = 10**18
d = [[0]*N for _ in range(N)]
for i in range(N):
d[i][0] = a[i]
for k in range(1,N):
d[i][k] = min(d[i][k-1], a[i-k])
for k in range(N-1,-1,-1):
tmp = k*x
tmp += sum([d[i][k] for i in range(N)])
... | p04006 |
import sys
rl = sys.stdin.readline
def solve():
class SegmentTree:
def __init__(self, init_value: list, segfunc, ide_ele):
n = len(init_value)
self.N0 = 1 << (n - 1).bit_length()
self.ide_ele = ide_ele
self.data = [ide_ele] * (2 * self.N0)
... | import sys
rl = sys.stdin.readline
class SegmentTree:
def __init__(self, init_value: list, segfunc, ide_ele):
n = len(init_value)
self.N0 = 1 << (n - 1).bit_length()
self.ide_ele = ide_ele
self.data = [ide_ele] * (2 * self.N0)
self.segfunc = segfunc
... | p04006 |
import sys
rl = sys.stdin.readline
class SegmentTree:
def __init__(self, init_value: list, segfunc, ide_ele):
n = len(init_value)
self.N0 = 1 << (n - 1).bit_length()
self.ide_ele = ide_ele
self.data = [ide_ele] * (2 * self.N0)
self.segfunc = segfunc
... | import sys
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
class SegmentTree:
def __init__(self, init_value: list, segfunc, ide_ele):
n = len(init_value)
self.N0 = 1 << (n - 1).bit_length()
self.ide_ele = ide_ele
self.data = [ide_ele] * (2 * self.N0)
sel... | p04006 |
while 1 :
n, m = list(map(int,input().split(" ")))
if (n, m) == (0,0):
break
Lon = [0 for i in range(1000 * n + 1)]
Lat = [0 for i in range(1000 * m + 1)]
Lon_sum = [0]
Lat_sum = [0]
for i in range(0,n):
tmp_Lon_sum = [0]
h = int(input())
for j in Lon_sum:
Lon[j+h] += 1
tmp_Lon_sum.app... | while 1 :
n, m = list(map(int,input().split(" ")))
if (n, m) == (0,0):
break
Lon = [0 for i in range(1000 * n + 1)]
Lat = [0 for i in range(1000 * m + 1)]
Lon_sum = [0]
Lat_sum = [0]
for i in range(0,n):
tmp_Lon_sum = [0]
h = int(input())
for j in Lon_sum:
Lon[j+h] += 1
tmp_Lon_sum += ... | p01140 |
while 1 :
n, m = list(map(int,input().split(" ")))
if (n, m) == (0,0):
break
Lon = [0 for i in range(1000 * n + 1)]
Lat = [0 for i in range(1000 * m + 1)]
Lon_sum = []
Lat_sum = []
for i in range(0,n):
h = eval(input())
Lon_sum = [h + j for j in Lon_sum] + [h]
for j in Lon_sum:
Lon[j] += 1... | while 1 :
n, m = list(map(int,input().split(" ")))
if (n, m) == (0,0):
break
Lon = [0 for _ in range(1000 * n + 1)]
Lat = [0 for _ in range(1000 * m + 1)]
Lon_sum = []
Lat_sum = []
for _ in range(0,n):
h = int(input())
Lon_sum = [h + j for j in Lon_sum] + [h]
for j in Lon_sum:
Lon[j] += 1
... | p01140 |
from collections import defaultdict as ddict
def cal_interval(Num):
interval = ddict(int)
dp = [0 for i in range(Num)]
for i in range(Num):
tmp = int(input())
for j in range(i+1):
dp[j] += tmp
interval[dp[j]] += 1
return interval
while 1:
N, M = list(map(int,input().split(" ")))
if (N, M) ==... | from collections import defaultdict as ddict
def cal_interval(Num):
interval = ddict(int)
dp = [0 for i in range(Num)]
for i in range(Num):
tmp = int(input())
for j in range(i+1):
dp[j] += tmp
interval[dp[j]] += 1
return interval
while 1:
N, M = list(map(int,input().split(" ")))
if (N, M) ==... | p01140 |
import base64
import sys
import subprocess
from pathlib import Path
import os
exe_bin = "f0VMRgIBAQAAAAAAAAAAAAMAPgABAAAAsAkAAAAAAABAAAAAAAAAAKgbAAAAAAAAAAAAAEAAOAAJAEAAHQAcAAYAAAAEAAAAQAAAAAAAAABAAAAAAAAAAEAAAAAAAAAA+AEAAAAAAAD4AQAAAAAAAAgAAAAAAAAAAwAAAAQAAAA4AgAAAAAAADgCAAAAAAAAOAIAAAAAAAAcAAAAAAAAABwAAAAAAAAA... | import base64
import subprocess
exe_bin = "e??420s#R400000000000{}h%0RR91un7PF00000KmY&$00000s2czP0000000000Kma%Z2>?I<9RM5v1^@s61ONa4KmY&$00000KmY&$00000KmY&$00000_yGU_00000_yGU_000002mk;8000000{{R31ONa4I066w00000I066w00000I066w000008~^|S000008~^|S000000RR91000000RR911poj5000000000000000000000000000000xC{UQ00000x... | p02594 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
print(('Yes' if int(sys.stdin.readline().rstrip()) >= 30 else 'No')) | p02594 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
x = int(eval(input()))
if x >= 30:
print('Yes')
else:
print('No') | p02594 |
x = int(eval(input()))
if x >= 30:
print("Yes")
else:
print("No") | x = int(eval(input()))
print(("Yes" if x >= 30 else "No")) | p02594 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
x = int(readline())
if x >= 30:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
| x = int(input())
print("Yes") if x >= 30 else print("No")
| p02594 |
X = int(eval(input()))
if X >= 30:
print('Yes')
else:
print('No')
| import sys
X = int(input())
if X >= 30:
print('Yes')
else:
print('No')
print('Yes\nNo', file=sys.stderr)
| p02594 |
import sys
sys.setrecursionlimit(10**6)
x = int(eval(input()))
#b = list(map(int, input().split()))
#n, m = map(int, input().split())
#s = input()
#s,t = input().split()
#a = [int(input()) for _ in range(n)]
#
#readline = sys.stdin.readline
#n,m = [int(i) for i in readline().split()]
#ab = [[int(i) for i i... | import sys
sys.setrecursionlimit(10**6)
x = int(eval(input()))
if x >= 30:
print('Yes')
else:
print('No') | p02594 |
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
INF = 10**18
if __name__ == "__main__":
x = int(eval(input()))
if x>=30:
print("Yes")
else:
print("No") | x = int(eval(input()))
if x>=30:
print("Yes")
else:
print("No") | p02594 |
# -*- coding: utf-8 -*-
# 標準入力を取得
X = int(eval(input()))
# 求解処理
ans = str()
if X >= 30:
ans = "Yes"
else:
ans = "No"
# 結果出力
print(ans)
| # -*- coding: utf-8 -*-
def get_input() -> int:
"""
標準入力を取得する.
Returns:\n
int: 室温
"""
X = int(eval(input()))
return X
def main(X: int) -> None:
"""
メイン処理.
Args:\n
X (int): 室温（-40 <= X <= 40, 整数）
"""
# 求解処理
ans = str()
if X ... | p02594 |
print("Yes") if int(input()) >= 30 else print("No")
| X=int(eval(input()))
if 30<=X :
print("Yes")
else :
print("No") | p02594 |
x = int(eval(input()))
ans = 'Yes'
if x < 30: ans ='No'
print(ans)
| print(('No' if int(eval(input())) < 30 else 'Yes'))
| p02594 |
print(('Yes' if int(eval(input())) >= 30 else 'No')) | print(('YNeos'[int(eval(input()))<30::2])) | p02594 |
a = int(eval(input()))
if a >= 30:
print('Yes')
else:
print('No')
| x = int(eval(input()))
if x >= 30:
print('Yes')
else:
print('No') | p02594 |
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left, bisect_right #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(... | # import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial # , gcd
from bisect import bisect_left, bisect_right # bisect_left(list, value)
sys.setrecursionlimit(10 ** 7)
enu = enumerate
MOD = 10 ** 9 +... | p02594 |
x = int(eval(input()))
if x >= 30:
print('Yes')
else:
print('No') | x = int(input())
print('Yes') if x >= 30 else print('No')
| p02594 |
X=int(eval(input()))
if X>=30:
print("Yes")
if X<30:
print("No") | #-*- coding: utf-8 -*-
X=int(eval(input()))
if X>=30:
print("Yes")
if X<30:
print("No") | p02594 |
a = int(eval(input()))
if a >= 30 :
print("Yes")
else:print("No") | a = int(eval(input()))
ans = "Yes" if a>= 30 else "No"
print(ans) | p02594 |
a = int(eval(input()))
print(('YNeos'[a<30::2]))
| a = int(eval(input()))
ans = a >= 30 and 'Yes' or 'No'
print(ans) | p02594 |
x=int(eval(input()))
print(("Yes" if x>=30 else "No"))
| print(("Yes" if int(eval(input()))>=30 else "No")) | p02594 |
X = int(input())
print("Yes") if X >= 30 else print("No")
| X = int(eval(input()))
if X >= 30:
print("Yes")
else:
print("No")
| p02594 |
# coding: utf-8
#import numpy as np
import re
import math
from collections import defaultdict,deque,Counter
from fractions import Fraction
import bisect
import itertools
from itertools import accumulate
from copy import deepcopy
import heapq
import random
import time
import os
import sys
from functools i... | x=int(eval(input()))
if x>=30:print("Yes")
else:print("No") | p02594 |
import sys
input = sys.stdin.readline
"""
・とりあえず部分点解法：各クエリに対してO(N)
・いくつかを残していくつかを自由に埋める
・残すもの：被覆区間がoverlapしないように残す
・つまり、区間で覆えている点が処理できて、区間で覆えていない点が他所から持ってこないといけない。
"""
N,M = list(map(int,input().split()))
A = [int(x) for x in input().split()]
XY = [tuple(int(x) for x in input().split()) for _ in range(M)]... | import sys
input = sys.stdin.readline
"""
・とりあえず部分点解法：各クエリに対してO(N)
・いくつかを残していくつかを自由に埋める
・残すもの：被覆区間がoverlapしないように残す
・つまり、区間で覆えている点が処理できて、区間で覆えていない点が他所から持ってこないといけない。
"""
N,M = list(map(int,input().split()))
A = [int(x) for x in input().split()]
XY = [tuple(int(x) for x in input().split()) for _ in range(M)]... | p03667 |
from collections import Counter
n, m = list(map(int, input().split()))
an = list(map(int, input().split()))
ac_ = Counter(an)
ac = {i: ac_[i] if i in ac_ else 0 for i in range(1, n + 1)}
ad = [0] * n
for a, c in list(ac.items()):
for i in range(max(0, a - c), a):
ad[i] += 1
ans = ad.count(0)
f... | from collections import Counter
n, m = list(map(int, input().split()))
an = list(map(int, input().split()))
ac_ = Counter(an)
ac = {i: ac_[i] if i in ac_ else 0 for i in range(1, n + 1)}
ad = [0] * n
for a, c in list(ac.items()):
for i in range(max(0, a - c), a):
ad[i] += 1
ans = ad.count(0)
ans... | p03667 |
import sys
from collections import Counter
# sys.stdin = open('c1.in')
def read_int_list():
return list(map(int, input().split()))
def read_int():
return int(eval(input()))
def read_str_list():
return input().split()
def read_str():
return eval(input())
def vanish(p, det... | import sys
from collections import Counter
# sys.stdin = open('c1.in')
def read_int_list():
return list(map(int, input().split()))
def read_int():
return int(eval(input()))
def read_str_list():
return input().split()
def read_str():
return eval(input())
def vanish(p, det... | p03667 |
x = int(eval(input()))
if x < 1200:
print('ABC')
else:
print('ARC') | x = int(eval(input()))
print(('ABC' if x < 1200 else 'ARC')) | p03813 |
import sys
import math
import random
import threading
import time
from functools import reduce
a = int(eval(input()));
if a < 1200:
print("ABC")
else:
print("ARC"); | x=int(eval(input()))
if (x>=1200):
print('ARC')
else:
print('ABC')
| p03813 |
print(("ABC" if int(eval(input())) < 1200 else "ARC")) | x = int(eval(input()))
print(("ABC" if x < 1200 else "ARC")) | p03813 |
import sys
x = int(sys.stdin.readline().rstrip())
def main():
return 'ABC' if x < 1200 else 'ARC'
if __name__ == '__main__':
ans = main()
print(ans) | import sys
x = int(sys.stdin.readline().rstrip())
def main():
ans = 'ABC' if x < 1200 else 'ARC'
print(ans)
if __name__ == '__main__':
main() | p03813 |
x = int(eval(input()))
if x == 0:
print('ABC')
if x == 1:
print('ABC')
if x == 2:
print('ABC')
if x == 3:
print('ABC')
if x == 4:
print('ABC')
if x == 5:
print('ABC')
if x == 6:
print('ABC')
if x == 7:
print('ABC')
if x == 8:
print('ABC')
if x == 9:
print('ABC')
if x == 10:
print('ABC')... | # print('x = int(input())')
# for i in range(3000+1):
# print('if x == ' + str(i) + ':')
# if i < 1200:
# print(" print('ABC')")
# else:
# print(" print('ARC')")
x = int(eval(input()))
if x == 0:
print('ABC')
if x == 1:
print('ABC')
if x == 2:
print('ABC')
if x == 3:
pri... | p03813 |
X = int(eval(input()))
print(("ABC" if X<1200 else "ARC")) | # python3 (3.4.3)
import sys
input = sys.stdin.readline
# main
X = int(eval(input()))
print(("ABC" if X < 1200 else "ARC")) | p03813 |
x = int (eval(input ()))
if x < 1200:
print ('ABC')
else:
print ('ARC')
| x = int (eval(input ()))
if x>=1200:
print ('ARC')
else:
print ('ABC') | p03813 |
x = int(eval(input()))
print(('ABC' if x < 1200 else 'ARC')) | print(('ABC' if int(eval(input())) < 1200 else 'ARC')) | p03813 |
x = int(eval(input()))
if x <1200:
print('ABC')
else:
print('ARC') | n = int(eval(input()))
if n < 1200:
print('ABC')
else:
print('ARC') | p03813 |
x = int(eval(input()))
if x < 1200:
print("ABC")
else:
print("ARC") | print("ABC") if int(input()) < 1200 else print("ARC")
| p03813 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.