problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03076 | s734156899 | Accepted | # -*- coding: utf-8 -*-
import math
t=[int(input()) for _ in range(5)]
r=[(i-1)%10+1 for i in t]
c=r.index(min(r))
ans=0
for i in range(5):
if i==c:
ans+=t[i]
else:
ans+=math.ceil(t[i]/10)*10
print(ans)
|
p03131 | s444023511 | Accepted | k, a, b = map(int, input().split())
if a+2>=b:
print(k+1)
exit()
k -= a+1
ans = b
ans += (b-a)*(k//2) + k%2
print(ans) |
p03475 | s349004598 | Accepted | n=int(input());l=[0]*n
for i in range(1,n):
c,s,f=map(int,input().split())
for j in range(i):l[j]=max(-l[j]//f*-f,s)+c
print(*l,sep='\n') |
p02775 | s216393862 | Accepted | n = list(map(int,input()))[::-1]
n.append(0)
for i in range(len(n)):
if n[i] >= 6 or (n[i] == 5 and n[i+1] >= 5):
n[i] = 10 - n[i]
n[i+1] += 1
print(sum(n))
|
p02959 | s879930928 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
Ans = 0
next_A = A[0]
for i in range(N):
Ans += min(next_A+A[i+1], B[i])
next_A = max(0, A[i+1] + min(A[i]-B[i], 0))
print(Ans)
|
p02657 | s811239210 | Accepted | a,b = map(int,input().split())
print(a*b) |
p02623 | s227694669 | Accepted | N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0]*(N+1), [0]*(M+1)
for i in range(N):
a[i+1] = a[i] + A[i]
for i in range(M):
b[i+1] = b[i] + B[i]
ans, j = 0, M
for i in range(N + 1):
if a[i] > K:
break
while b[j] > K - a[i]:
j -= 1
ans = max(ans, i + j)
print(ans) |
p02796 | s396571248 | Wrong Answer | n = int(input())
XL = []
for i in range(n):
x, l = map(int, input().split())
XL.append([x, l])
XL.sort(key=lambda x: x[0]-x[1])
seen = 0
ans = 0
for i in range(n):
rob = XL[i]
if i==0:
seen = rob[0]+rob[1]
else:
if seen > rob[0]-rob[1]:
ans +=1
else:
seen = rob[0]+rob[1]
print(n-ans) |
p02784 | s395395765 | Accepted | h, n = map(int,input().split())
a = list(map(int,input().split()))
atack = sum(a)
can = h <= atack
print("Yes" if can else "No") |
p03695 | s053880113 | Wrong Answer | n, *A = map(int, open(0).read().split())
B = [0] * 9
for a in A:
if a < 3200:
B[a // 400] = 1
else:
B[8] += 1
print(max(sum(B[:8]), B[8]), min(8, sum(B))) |
p03695 | s518649549 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
color = [0]*8
free_color = 0
for a in A:
if a < 400:
color[0] = 1
elif a < 800:
color[1] = 1
elif a < 1200:
color[2] = 1
elif a < 1600:
color[3] = 1
elif a < 2000:
color[4] = 1
elif a < 2400:
color[5] = 1
elif a < 2800:
color[6] = 1
elif a < 3200:
color[7] = 1
else:
free_color += 1
print(sum(color),sum(color)+free_color) |
p03210 | s164115613 | Accepted | if int(input()) in [3,5,7]:print('YES')
else:print('NO') |
p04033 | s615489038 | Accepted | a, b = map(int, input().split())
if a > 0: print('Positive')
elif a == 0 or (a < 0 and b >= 0): print('Zero')
else: print('Positive') if (b - a) % 2 else print('Negative') |
p02695 | s988544209 | Accepted | import itertools
n,m,q = map(int,input().split())
ch = list(itertools.combinations_with_replacement(range(1,m+1),n))
lch = len(ch)
rel = [0]*lch
l = [list(map(int,input().split())) for _ in range(q)]
for k in range(lch):
for i in range(q):
if ch[k][l[i][1]-1]-ch[k][l[i][0]-1]==l[i][2]:
rel[k]+=l[i][3]
print(max(rel)) |
p02759 | s059820041 | Accepted | def main():
N = int(input())
print(-(-N // 2))
return
main()
|
p02691 | s737671591 | Accepted | import sys
input = sys.stdin.readline
def main():
n = int(input())
a_list = list(map(int, input().split()))
c = [0] * n
s = 0
for i, a in enumerate(a_list):
if i+a < n:
c[i+a] += 1
if i-a >= 0:
s += c[i-a]
print(s)
if __name__ == '__main__':
main() |
p02994 | s828581144 | Accepted | def main():
N, L = map(int, input().split())
P = 0
for i in range(1, N+1):
P += L + i - 1
ans = float("inf")
for i in range(1, N+1):
tmp = L + i - 1
x = P - tmp
if abs(P - x) < abs(P - ans):
ans = x
print(ans)
if __name__ == "__main__":
main() |
p03380 | s094240964 | Wrong Answer | n = int(input())
a = sorted(list(map(int, input().split())))
x = a[-1]
y = max(a)//2
a = a[:-1]
while y < x:
y += 1
if y in a: break
if x-y in a:
y = x-y
break
print(x,y) |
p02833 | s544556101 | Accepted | n = int(input())
if n % 2 == 1:
print(0)
else:
n //= 2
ans = 0
while n != 0:
n //= 5
ans += n
print(ans) |
p02982 | s039494257 | Wrong Answer | import math
n, d = map(int, input().split())
x = []
ans = [i**2 for i in range(1, n*d)]
for i in range(n):
tmp = list(map(int, input().split()))
x.append(tmp)
cnt = 0
sum_t = 0
for i in range(n):
for j in range(i+1, n):
sum_t = 0
for k in range(d):
sum_t += (x[i][k]-x[j][k])**2
if sum_t in ans:
cnt += 1
print(cnt) |
p02832 | s445152754 | Accepted | n = int(input())
a = [int(i)-1 for i in input().split()]
ans = 0
for i in range(n):
if a[i] != (i - ans):
ans += 1
print(ans if ans != n else -1) |
p02983 | s931357699 | Wrong Answer | L, R = map(int, input().split())
Lmod = L%2019
Rmod = R%2019
if (R-L+1) <= 2019 and Lmod < Rmod:
print((L*(L+1))%2019)
elif (R-L+1) <= 2019 and Lmod > Rmod:
print(0)
elif (R-L+1) > 2019:
print(0)
|
p03617 | s988567234 | Accepted | Q, H, S, D = map(int, input().split())
N = int(input())
cost = [Q, min(Q*2, H), min(Q*4, H*2, S), min(Q*8, H*4, S*2, D)]
print(N//2*cost[3] + N%2*cost[2]) |
p02665 | s777553350 | Accepted | n=int(input())
b0=input().split()
b=[int(x) for x in b0]
ret=0
if b[-1]==0:
ret=-1
else:
maxl=[]
v=1
for i in range(n+1):
maxl.append(v)
v=(v-b[i])*2
if v<0:
ret=-1
break
v=0
vsum=0
if ret!=-1:
for i in range(n,-1,-1):
v=min(v+b[i],maxl[i])
vsum+=v
if ret==-1:
print(-1)
else:
print(vsum) |
p03971 | s479064658 | Wrong Answer | import sys
input = sys.stdin.readline
n, a, b = map(int, input().split())
strings = input()
lists = ['No'] * len(strings)
remain = a + b
b_remain = b
for i in range(len(strings)):
if strings[i] == 'a':
if remain > 0:
lists[i] = 'Yes'
remain = remain - 1
else:
break
elif strings[i] == 'b':
if b_remain > 0:
if remain > 0:
lists[i] = 'Yes'
remain = remain - 1
b_remain = b_remain - 1
else:
pass
for i in lists:
print(i) |
p03645 | s369263909 | Wrong Answer | n,m=map(int,input().split())
g=[[] for i in range(n)]
for _ in range(m):
u,v=map(int,input().split())
g[u-1].append(v-1)
g[v-1].append(u-1)
for x in g[0]:
for y in g[x]:
if y==n-1:
print('POSSIBLE')
exit()
print('No') |
p03037 | s339627035 | Accepted | def main():
_, _, *lst = map(int, open(0).read().split())
l, r = max(lst[::2]), min(lst[1::2])
print(0 if l > r else r - l + 1)
main() |
p02556 | s630390313 | Accepted | n = int(input())
xy = [tuple(map(int, input().split())) for _ in range(n)]
p = [x + y for x, y in xy]
a1 = max(p) - min(p)
q = [x - y for x, y in xy]
a2 = max(q) - min(q)
print(max(a1, a2)) |
p03543 | s780270750 | Wrong Answer | a, b, c, d = input()
count = 0
if a == b:
if a == c or a == d:
count += 1
elif a == c:
if a == d:
count += 1
elif b == c:
if b == d:
count += 1
if count == 1:
print("Yes")
else:
print("No") |
p02744 | s359234376 | Accepted | alp='abcdefghijklmnopqrstuvwxyz'
def f(N, s, x):
if len(s)==N:
print(s)
return
for i in range(x+2):
f(N, s+alp[i], max(x, i))
f(int(input()), 'a', 0) |
p02594 | s909574483 | Accepted | x = int(input())
if x>=30:
print('Yes')
else:
print('No') |
p03556 | s207439697 | Accepted | N = int(input())
ans = 0
for i in range(N+1):
if i*i <= N: ans = i*i
else: break
print(ans)
|
p03059 | s011667392 | Accepted | # ABC125 A
def main():
a, b, t = map(int, input().split())
print((t // a) * b)
if __name__ == '__main__':
main() |
p02627 | s945634992 | Accepted | a = input()
if a.isupper():
print("A")
else:
print("a") |
p03379 | s425030214 | Accepted | N=int(input())
X=list(map(int,input().strip().split()))
Y=sorted(X)
a=Y[N//2-1]
b=Y[N//2]
for n in range(N):
if X[n]<=a:
print(b)
else:
print(a) |
p03592 | s830946835 | Accepted | N, M, K = map(int, input().split())
ans = "No"
for n in range(N+1):
for m in range(M+1):
if (N*m + M*n - 2*m*n) == K:
ans = "Yes"
break
print(ans) |
p03043 | s339059217 | Accepted | n, k = [int(i) for i in input().split()]
ans = 0
for i in range(1, n + 1):
j = 1
while i < k:
j /= 2
i*=2
ans += j
ans /= n
print(ans)
|
p03038 | s350225087 | Accepted | def main():
import sys
input = sys.stdin.readline
n,m = map(int,input().split())
A = list(map(int,input().split()))
BC = [list(map(int,input().split())) for _ in range(m)]
BC = sorted(BC,key=lambda x:(x[1]),reverse=True)
append_list = []
for b,c in BC:
if len(append_list)>=n:
break
append_list+=[c]*b
A+=append_list
A.sort(reverse=True)
print(sum(A[:n]))
if __name__=='__main__':
main() |
p03797 | s040032326 | Wrong Answer | import math
N,M = map(int, open(0).read().split())
X = math.floor((M-2*N)/2)
print(math.floor((2*N+X)/2)) |
p03548 | s994752281 | Accepted | x, y, z = map(int, input().split())
print((x-z) // (y+z))
|
p03557 | s355966111 | Accepted | from bisect import bisect_left,bisect
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
lenc=len(c)
a.sort()
b.sort()
c.sort()
jsum=0
for j in b:
ai=bisect(a,j-1)
ci=lenc-bisect_left(c,j+1)
# print(j,ai,ci)
jsum+=ai*ci
print(jsum) |
p03435 | s232971336 | Accepted | s = [list(map(int,input().split())) for i in range(3)]
def solve():
if not (s[0][1] - s[0][0] == s[1][1] - s[1][0] == s[2][1] - s[2][0]): return False
if not (s[0][2] - s[0][1] == s[1][2] - s[1][1] == s[2][2] - s[2][1]): return False
if not (s[1][0] - s[0][0] == s[1][1] - s[0][1] == s[1][2] - s[0][2]): return False
if not (s[2][0] - s[1][0] == s[2][1] - s[1][1] == s[2][2] - s[1][2]): return False
return True
print('Yes' if solve() else 'No')
|
p02578 | s970012955 | Accepted | N=int(input())
A=[int(i) for i in input().split()]
ans=0
for i in range(1,N):
if A[i]<A[i-1]:
ans+=A[i-1]-A[i]
A[i]=A[i-1]
print(ans)
|
p02948 | s906353418 | Wrong Answer | import sys
import bisect
input = sys.stdin.readline
N, M = map(int, input().split())
AB = sorted([list(map(int, input().split())) for _ in range(N)], key=lambda x: x[1])[::-1]
plan = []
ans = 0
for a, b in AB:
i = bisect.bisect_left(plan, a)
if a+len(plan)-i<=M and len(plan)<M:
plan.insert(i, a)
ans += b
print(ans)
|
p03041 | s111338498 | Accepted | N, K = map(int, input().split())
s = input()
print(s[:K-1]+s[K-1].lower()+s[K:])
|
p03592 | s545040278 | Wrong Answer | n,m,k = map(int, input().split())
ans = "No"
for i in range(n+1):
l = k-i*m
j = n-2*i
if j==0:
if l==0:
ans = "Yes"
else:
continue
else:
if l%j==0:
ans = "Yes"
else:
continue
print(ans) |
p03797 | s590973259 | Wrong Answer | n, m = map(int, input().split())
if 2 * n >= m:
print(n)
else:
print(n + (m-(2*n))//4) |
p03814 | s243313922 | Wrong Answer | s = list(input())
print(s.index('Z')-s.index('A')+1) |
p03408 | s532178547 | Accepted | N=int(input())
s=dict()
for _ in range(N):
S=input()
if S not in s:
s[S]=0
s[S]+=1
M=int(input())
for _ in range(M):
t=input()
if t in s:
s[t]-=1
print(max(max(0,x) for x in s.values()))
|
p03437 | s130990819 | Wrong Answer | x, y = map(int,input().split())
print([-1, x][x>y or y%x>0]) |
p02702 | s552987046 | Accepted | s=input()
l=len(s)
se=dict()
k=0
for i in range(l-1,-1,-1):
k+=(pow(10,l-1-i,2019)*int(s[i]))
k%=2019
if k in se:
se[k]+=1
else:
se[k]=1
ans=0
for j in se:
i=se[j]
if i>1:
ans+=(i*(i-1)//2)
if j==0:
ans+=i
print(ans) |
p03359 | s756408230 | Accepted | a, b = map(int, input().split())
print(a - 1 if a > b else a) |
p02777 | s820385445 | Accepted | S, T = input().split()
A, B = map(int, input().split())
U = input()
if S == U:
A -= 1
else:
B -= 1
print(str(A) + ' ' + str(B)) |
p03696 | s492518382 | Accepted | N=int(input())
S=input()
c1,c2=0,0
for s in S:
if s=='(': c1+=1
elif c1>0: c1-=1
for s in reversed(S):
if s==')': c2+=1
elif c2>0: c2-=1
print('('*c2 + S + ')'*c1) |
p02553 | s464276137 | Accepted | a,b,c,d=map(int,input().split())
ans = -10000000000000000000
ans = max( ans, a*c)
ans = max( ans, a*d)
ans = max( ans, b*c)
ans = max( ans, b*d)
print(ans)
|
p03487 | s080630944 | Wrong Answer | inputs = [input() for i in range(2)]
n = int(inputs[0])
a = map(lambda x: int(x), inputs[1].split(" "))
b = {}
for i in a:
if i not in b:
b[i] = 1
else:
b[i] += 1
count = 0
for k in b.keys():
count += abs(k - b[k])
print(count) |
p02629 | s685589220 | Accepted | N = int(input())
ans = ''
while N >0:
N -=1
ans += chr(ord('a') + N%26)
N //=26
print(ans[::-1]) |
p03951 | s055734397 | Wrong Answer | n = int(input())
s = str(input().split())
t = str(input().split())
a = set(s+t)
print(a)
print(len(a)-3) |
p02718 | s481845711 | Accepted | n,m = map(int,input().split())
a = list(map(int,input().split()))
cnt = 0
for i in a:
if i >= sum(a)/(4*m):
cnt += 1
if cnt >= m:
print("Yes")
else:
print("No") |
p04020 | s379638030 | Wrong Answer | n = int(input())
al = [int(input()) for _ in range(n)]
ans = 0
for i in range(n-1):
rest = ((al[i] + al[i+1]) // 2) * 2
ans += rest
for j in range(2):
if al[i+j] > rest:
al[i+j] -= rest
break
else:
rest -= al[i+j]
al[i+j] = 0
print(ans//2) |
p03284 | s637204859 | Accepted | n,m=map(int,input().split())
if(n%m==0):
print(0)
else:
print(1) |
p03711 | s107982780 | Accepted | l = [1,3,5,7,8,10,12]
m = [4,6,9,11]
a,b = map(int,input().split())
if (a in l and b in l) or (a in m and b in m):
print("Yes")
else:
print("No") |
p02831 | s668554546 | Accepted | import numpy as np
a, b = map(int, input().split())
print(np.lcm(a, b)) |
p03633 | s030871682 | Accepted | n = int(input())
t = [int(input()) for _ in range(n)]
import fractions
ans = t[0]
for i in range(1, n):
ans = ans * t[i] // fractions.gcd(ans, t[i])
print(ans)
|
p02570 | s965492548 | Wrong Answer | D, T, S = map(int, input().split())
if (T * S) >= D :
print("YES")
else :
print("NO") |
p03645 | s245594353 | Wrong Answer | n, m = map(int,input().split())
data = [list(map(int, input().split())) for _ in range(m)]
start = set(i[1] for i in data if i[0] == data[0][0])
goal = set(j[0] for j in data if j[1] == data[-1][1])
if start & goal:
print('POSSIBLE')
else:
print('IMPOSSIBLE') |
p03206 | s379140003 | Accepted | #!/usr/bin/env python3
d = int(input())
if d == 25:
print("Christmas")
elif d == 24:
print("Christmas Eve")
elif d == 23:
print("Christmas Eve Eve")
else:
print("Christmas Eve Eve Eve")
|
p02829 | s958712049 | Accepted | A = int(input())
B = int(input())
ans = [1, 2, 3]
ans.remove(A)
ans.remove(B)
print(ans.pop()) |
p04005 | s235473871 | Accepted | a = list(map(int,input().split()))
cnt = 0
for i in range(3):
if a[i]%2 == 0:
cnt += 1
if cnt == 0:
a.sort()
print(a[0]*a[1])
else:
print(0) |
p02953 | s620754641 | Accepted | def solve():
N = int(input())
H = list(map(int, input().split()))
h_max = H[0]
ret = True
for h in H:
if h_max-1 > h:
ret = False
break
if h_max < h:
h_max = h
print('Yes' if ret else 'No')
solve() |
p02713 | s712841061 | Accepted | def gcd(a, b):
while b != 0:
a, b = b, a % b
return a
K = int(input())
tot = 0
for a in range(1, K+1):
for b in range(1, K+1):
x = gcd(a, b)
for c in range(1, K+1):
y = gcd(x, c)
tot += y
print(tot) |
p03557 | s283102392 | Accepted | import bisect
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort()
B.sort()
C.sort()
ans = 0
for b in B:
a = bisect.bisect_left(A, b)
c = bisect.bisect_right(C, b)
ans += a*(N-c)
print(ans) |
p03745 | s654734287 | Accepted | n = int(input())
a = list(map(int, input().split()))
ans = 1
up = False
down = False
for i in range(n - 1):
if a[i] == a[i + 1]:
continue
if a[i] < a[i + 1]:
up = True
if down:
ans += 1
down = False
up = False
elif a[i] > a[i + 1]:
down = True
if up:
ans += 1
up = False
down = False
print(ans) |
p03017 | s127329048 | Accepted | N, A, B, C, D = map(int, input().split())
S = input()
if C < D:
if '##' not in S[A - 1:D]:
print('Yes')
else:
print('No')
else:
if '##' not in S[A - 1:C] and '...' in S[B - 2: D + 1]:
print('Yes')
else:
print('No') |
p02623 | s689188944 | Wrong Answer | a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
count = 0
sort_array = b + c
sort_array.sort()
num = a[2]
print(sort_array)
for i in range(0,len(sort_array)):
num -= sort_array[i]
if num >= 0:
count += 1
print(count)
|
p02755 | s157455539 | Accepted | a, b = map(int, input().split())
flag = 0
for i in range(1, 1001):
hati = int(i * 0.08)
juu = int(i * 0.1)
if hati == a and juu == b:
flag = 1
print(i)
break
if flag == 0:
print("-1") |
p03607 | s725380754 | Accepted | n = int(input())
a = set()
for i in range(n):
num = int(input())
if num in a:
a.remove(num)
else:
a.add(num)
print(len(a)) |
p03779 | s085432737 | Wrong Answer | x=int(input())
for i in range(1,100001):
t=i*(i+1)//2
s=(i+1)*(i+2)//2
if t<x<=s:
print(i+1)
exit(0) |
p03860 | s010143173 | Accepted | a,s,b=input().split()
print('A'+s[0]+'C') |
p02595 | s061234293 | Accepted | import sys
input=sys.stdin.readline
ans=0
n,d=map(int,input().split())
for i in range(n):
x,y=map(int,input().split())
if x**2+y**2<=d**2:
ans+=1
print(ans) |
p02995 | s212573094 | Wrong Answer | import fractions
A,B,C,D = map(int,input().split())
S = B-A+1
print(S-(S//C + S//D - S//((C*D)//fractions.gcd(C,D)))) |
p03779 | s420590033 | Accepted | x =int(input())
ans=0
sum=0
for i in range(0,50000):
sum+=i
if sum>=x:
break
ans+=1
print(ans)
|
p02843 | s268996446 | Accepted | x = int(input())
y = x//100
if y*100 <= x <= y*105:
print("1")
else:
print("0") |
p02771 | s273686394 | Accepted | a, b, c = map(int, input().split())
if a == b == c or a != b != c != a:
print("No")
else:
print("Yes")
|
p02836 | s287123819 | Accepted | s=input()
t=0
for i in range((len(s))//2):
if s[i]!=s[len(s)-i-1]:
t+=1
print(t) |
p03657 | s347326497 | Wrong Answer | a,b=map(int,input().split())
print(['Impossible','Possible'][a/3==0 or b/3==0 or (a+b)%3==0]) |
p02922 | s809476189 | Wrong Answer | a, b = map(int, input().split())
ans = 1
while True:
if ans * a >= b:
break
ans += 1
print(ans) |
p03145 | s421980582 | Accepted | a, b, c = map(int, input().split())
print(a*b//2) |
p02972 | s221384439 | Accepted | N,*a = map(int,open(0).read().split())
for i in range(N)[::-1]:
part_rem = sum(a[i::i+1]) % 2
if a[i] != part_rem:
a[i] = abs(a[i] - 1)
print(sum(a))
print(*[i+1 for i,v in enumerate(a) if v == 1]) |
p03494 | s977337493 | Wrong Answer | count = int(input())
num_list = list(map(int,input().split()))
count = 3
num_list =[8,12,40]
output = 0
stop_flag = 0
while 1:
for num in num_list:
if((num % 2) == 1 ):
stop_flag = 1
if stop_flag == 0:
output += 1
num_list = list(map(lambda x: x/2,num_list))
if stop_flag == 1:
break
print(output) |
p02971 | s034588424 | Wrong Answer | n = int(input())
lis = [input() for _ in range(n)]
m1 = max(lis)
sort_lis = sorted(lis)
m2 = sort_lis[n-2]
for i in range(n):
if lis[i] == m1:
print(m2)
else:
print(m1) |
p02818 | s265210300 | Accepted | a,b,k=map(int,input().split())
if a>k:
a-=k
k=0
else:
k-=a
a=0
b=max(0,b-k)
print(a,b) |
p04031 | s463174427 | Wrong Answer | k = input()
num = list(map(int, input().split()))
cost = []
for i in range(0,100):
plus_val = list(map(lambda x: x-i, num))
minus_val = list(map(lambda x: x+i, num))
plus_val_cost = sum(list(map(lambda x: x**2, plus_val)))
minus_val_cost = sum(list(map(lambda x: x**2, minus_val)))
cost.append(plus_val_cost)
cost.append(minus_val_cost)
min_val = min(cost)
print(min_val) |
p02640 | s072499926 | Accepted | x,y = map(int,input().split())
ans = 0
for i in range(x+1):
f = (2*i) + 4*(x-i)
if f == y:
print("Yes")
exit()
print("No") |
p03494 | s819000021 | Accepted | input()
A=list(map(int,input().split()))
ans=0
while all(a%2==0 for a in A):
A=[a/2 for a in A]
ans+=1
print(ans) |
p02989 | s828019259 | Accepted | N = int(input())
P = list(map(int, input().split()))
P.sort()
#print(P)
A = P[int(N/2)-1]
B = P[int(N/2)]
#print(A,B)
print(B-A) |
p02615 | s160373229 | Accepted | N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
num = [A[0]]
for a in A[1:]:
num += [a] * 2
ans = sum(num[:N-1])
print(ans) |
p02555 | s741302261 | Wrong Answer | s = int(input())
mod = 10**9 + 7
# dp[i]: 最後に切った場所がi
dp = [0]*(s + 1)
dp[0] = 1
for i in range(3, s+1):
for j in range(3, (i-3)+1):
dp[i] += dp[j]
dp[i] %= mod
print(dp[s]) |
p02773 | s314847063 | Accepted | from collections import Counter
N = int(input())
S = []
for _ in range(N):
S.append(input())
C = Counter(S).most_common()
_,M = C[0]
L = []
for a,b in C:
if b == M:
L.append(a)
print(*sorted(L) ,sep = "\n") |
p03109 | s729051613 | Accepted | y,m,d=map(int,input().split("/"))
from datetime import date
d1 = date(y, m, d)
d2 = date(2019, 4, 30)
print ("Heisei" if d1 <= d2 else "TBD") |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.