problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02725 | s866643948 | Accepted | K, N = map(int, input().split())
house_list = list(map(int, input().split()))
saidai_kyori = 0
sou_kyori = 0
for i, position in enumerate(house_list):
kyori = 0
if i == 0:
kyori = K + house_list[0] - house_list[-1]
else:
kyori = house_list[i] - house_list[i-1]
if kyori > saidai_kyori:
... |
p02899 | s085110591 | Accepted | n=int(input())
a_tmp=list(map(int,input().split()))
a=[]
for i in range(n):
a.append([a_tmp[i],i+1])
a.sort(key=lambda x:x[0])
for i in range(n):
print(a[i][1],end=" ")
|
p02688 | s534033768 | Wrong Answer | n,k = map(int,input().split())
master = []
count = 0
for num in range(k):
d = input()
sunuke = list(map(int,input().split()))
master+=sunuke
print(3-len(set(master))) |
p02959 | s428616643 | Wrong Answer | n = int(input())
al = list(map(int, input().split()))
bl = list(map(int, input().split()))
bl.append(0)
mons = 0
b0 = 0
for a, b in zip(al, bl):
if a >= (b+b0):
mons += (b+b0)
else:
mons += a
b0 = b-(a-b0)
print(mons) |
p03544 | s370597772 | Accepted | n = int(input())
ans = [0] * 87
ans[0] = 2
ans[1] = 1
for i in range(2, n + 1):
ans[i] = ans[i - 2] + ans[i - 1]
print(ans[n]) |
p02935 | s526369476 | Wrong Answer | n = int(input())
v = list(map(int, input().split()))
#h, w = list(map(int, input().split()))
v.sort()
ans = 0
point = (v[0]+v[1])/2
if n == 2:
print(point)
else:
for i in range(2, n):
point = (point+v[i])/2
print(point)
|
p03997 | s533819705 | Wrong Answer | x=int(input())
y=int(input())
z=int(input())
print((x+y)*z/2) |
p03474 | s282741236 | Wrong Answer | a,b = map(int,input().split())
num = input()
if len(num) == 8 and num[:3].isdecimal() and num[3]== "-" and num[4:].isdecimal():
print("Yes")
else:
print("No") |
p03485 | s406038162 | Accepted | import math
a,b=map(int,input().split())
print(int(math.ceil((a+b)/2))) |
p03548 | s597145555 | Accepted | x,y,z=list(map(int,input().split()))
print((x-z)//(y+z))
|
p03623 | s210836972 | Accepted | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
X, A, B = map(int, input().split())
print('A'if abs(X - A) < abs(X - B)else 'B')
if __name__ == "__main__":
main()
|
p02801 | s809225835 | Accepted | l = a = [chr((ord("a") + i)) for i in range(26)]
print(l[l.index(input())-25]) |
p02842 | s937817258 | Accepted | import math
n=int(input())
if int(math.ceil(n/1.08)*1.08)==n:
print(math.ceil(n/1.08))
else:
print(":(") |
p03745 | s060550245 | Accepted | n = int(input())
a = list(map(int, input().split()))
if n < 3:
print(1)
exit(0)
cnt = 1
increase = a[1] - a[0];
for i in range(2, len(a)):
new_inc = a[i] - a[i-1];
if increase * new_inc < 0:
cnt += 1
increase = 0
elif increase == 0:
increase = new_inc
print(cnt)
|
p02873 | s086264860 | Wrong Answer | s = input()
n = len(s)+1
ans = 0
ls = [0 for _ in range(n)]
rs = [0 for _ in range(n)]
for i in range(n-1):
if s[i] == '<':
ls[i+1] = ls[i]+1
for i in range(n-1):
if s[i] == '>':
rs[-2-i] = rs[-1-i]+1
for i,j in zip(ls,rs):
ans += max(i,j)
print(ans) |
p02725 | s554469036 | Accepted | K, N = map(int, input().split())
A = list(map(int, input().split()))
diff = [A[0] + K-A[-1]]
for i in range(N-1):
diff.append(A[i+1] - A[i])
print(K - max(diff)) |
p03161 | s755015799 | Accepted | n,k = map(int,input().split())
lst = list(map(int,input().split()))
dp = [float('inf')]*n
dp[0] = 0
for i in range(1, min(k, len(lst))):
dp[i] = abs(lst[i] - lst[0])
for i in range(k, n):
for j in range(1, k+1):
dp[i] = min(dp[i], dp[i-j]+abs(lst[i]-lst[i-j]))
print(dp[-1]) |
p03797 | s944814895 | Accepted | n, m = map(int, input().split())
if n*2 >= m:
ans = m//2
else:
ans = n + (m-2*n)//4
print(ans)
|
p03239 | s098846900 | Accepted | N, T = map(int, input().split())
res = 10 ** 9
for _ in range(N):
c, t = map(int, input().split())
if t <= T:
res = min(res, c)
if res < 10 ** 9:
print(res)
else:
print("TLE")
|
p03352 | s420627842 | Accepted | import math
x = int(input())
for i in range(x,0,-1):
if math.sqrt(i)%1 == 0 or (math.ceil(i ** (1/3)))**3 == i or (math.ceil(i ** (1/5)))**5 == i:
print(i)
break |
p02838 | s286750568 | Accepted | mod = 10**9 + 7
n = int(input())
A = list(map(int, input().split()))
A = [format(a, "060b")[::-1] for a in A]
answer = 0
for i in range(60):
x, y = 0, 0
for a in A:
if a[i] == "0":
x += 1
else:
y += 1
answer += (x * y) * 2**i
answer %= mod
print(answer)
|
p03038 | s183122092 | Wrong Answer | from collections import Counter
N,M = map(int,input().split())
A = Counter(list(map(int,input().split())))
for i in range(M):
b,c = map(int,input().split())
if c in A.keys():
A[c] += b
else:
A[c] = b
A = sorted(A.items(),reverse=True)
check = N
ans = 0
for i in A:
if i[1]<check:
... |
p03545 | s006582076 | Wrong Answer | def myfunc(op):
if op == 1:
return "+"
else:
return "-"
a, b, c, d = [int(i) for i in list(input())]
for j in range(8):
op = [1, 1, 1]
for i in range(3):
if (j >> i) & 1:
op[i] = -1
if a + b * op[0] + c * op[1] + d * op[2] == 7:
x = myfunc(op[0])
... |
p02835 | s369222632 | Accepted | print('bwuisnt'[eval(input().replace(*' +'))<22::2]) |
p02725 | s044077761 | Accepted | K, N = map(int, input().split())
A = list(map(int, input().split()))
M = 0
for i in range(N-1):
M = max(M, A[i+1] - A[i])
M = max(M, A[0] + K - A[-1])
print(K - M) |
p03220 | s261819330 | Wrong Answer | n = int(input())
t,a = map(int,input().split())
l = []
ans = []
l = list(map(int,input().split()))
for i in range(n):
ans.append(a - t - (l[i] * 0.006))
print(ans.index(min(ans,key=abs))+1) |
p02699 | s358417133 | Accepted | s,w = map(int,input().split())
if s <= w:
print("unsafe")
else:
print("safe") |
p04020 | s472330273 | Accepted | import sys
input = sys.stdin.readline
from math import floor
def main():
n = int(input())
A = [int(input()) for _ in range(n)]
x = 0
for a in A:
if a == 0:
yield x // 2
x = 0
x += a
yield x // 2
print(sum(main()))
|
p03487 | s528132295 | Accepted | # -*- coding: utf-8 -*-
from collections import Counter
N = int(input().strip())
a_list = list(map(int, input().rstrip().split()))
#-----
cnt_dic = Counter(a_list)
cnt=0
for i,value in cnt_dic.items():
if i == value:
continue
elif i > value:
cnt += value
elif i < value:
cnt += (va... |
p03206 | s919156581 | Accepted | 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") |
p03251 | s965098764 | Wrong Answer | N,M,X,Y=map(int,input().split())
x=list(map(int,input().split()))
y=list(map(int,input().split()))
for i in range(X+1,Y+1):
if max(x)<i and min(y)<=i:
print('No War')
break
elif i==Y:
print('War')
|
p03274 | s812956006 | Accepted | N, K = map(int, input().split())
D = [int(n) for n in input().split()]
ans = 10000000000
for i in range(N-K+1):
L = D[i]
R = D[i+K-1]
LR = abs(L) + abs(L - R)
RL = abs(R) + abs(R - L)
ans = min(ans, min(LR, RL))
print(ans)
|
p03243 | s787807307 | Accepted | N = int(input())
def checkDigit(n):
a = n % 10
n = (n-a)//10
b = n % 10
c = (n-b)//10
if a == b and b == c:
return True
else:
return False
for i in range(1000):
if checkDigit(N):
print(N)
break
N += 1 |
p03625 | s505302334 | Accepted | from collections import Counter
n = int(input())
A = list(map(int, input().split()))
# 長さと個数の辞書
length_num = Counter(A)
# 長い順からの長さのリスト
lengths = sorted(list(length_num.keys()), reverse=True)
ans = 0
sides = []
# 長い辺の順にループ
for l in lengths:
if length_num[l] >= 4:
ans = max(ans, l * l)
if length_num[l] >= 2:
... |
p02711 | s608538489 | Wrong Answer | N = input()
if N in '7':
print('Yes')
else:
print('No') |
p03352 | s973526524 | Accepted | X = int(input())
res = 0
for b in range(1, 33):
for p in range(2, 10):
if b ** p <= X:
res = max(res, b ** p)
print(res)
|
p03371 | s716671620 | Wrong Answer | a, b, c, x, y = map(int, input().split())
ans = 10**5
for i in range(10**5):
tmp = 2*c*i + (x-i)*a + (y-i)*b
ans = min(ans, tmp)
if i >= x or i >= y:
break
print(ans) |
p02603 | s146332072 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
total = 1000
kabu = 0
for i in range(N-1):
if (A[i] <= A[i+1]):
kabu += total//A[i]
total -= kabu*A[i]
elif(A[i] >= A[i+1]):
total += (kabu*A[i])
kabu = 0
#最後
i += 1
total += (kabu * A[i])
kabu = 0
print(total) |
p03719 | s070858158 | Accepted | A, B, C = map(int, input().split())
if A <= C and C <= B:
print('Yes')
else:
print('No') |
p03796 | s623091620 | Accepted | n = int(input())
ans =1
mod = 10**9+7
for i in range(1, n+1):
ans =((ans%mod)*(i%mod))%mod
ans = ans%mod
print(ans) |
p03293 | s156834190 | Accepted | S, T = input(), input()
ans = 'No'
for i in range(len(S)):
S = S[1:] + S[:1]
if S == T:
ans = 'Yes'
print(ans) |
p03385 | s287944541 | Accepted | s = input()
if s.count('a') and s.count('b') and s.count('c'):
print('Yes')
else:
print('No')
|
p03327 | s125432378 | Wrong Answer | n = int(input())
if n<10:
print('ABC00' + str(n) )
elif n<100:
print('ABC0' + str(n))
elif n<1000:
print('ABC' + str(n))
else:
print('ABD' + str(n+1)) |
p03665 | s552416603 | Accepted | import sys,math
input = sys.stdin.readline
def f(s):
n = int(s)%2
return n
N,P = list(map(int,input().split()))
A = list(map(f,input().split()))
c0 = A.count(0)
c1 = A.count(1)
fact = [1]* (c1+1)
for i in range(1,c1+1):
fact[i]= fact[i-1]*i
cnt = 0
for i in range(P,c1+1,2):
cnt += fact[c1]//fact[i]/... |
p03208 | s992500628 | Wrong Answer | n, k = map(int, input().split())
h = [int(input()) for i in range(n)]
h.sort()
height = []
for i in range(n - 1):
height.append(h[i + 1] - h[i])
height.sort()
ans = 0
for j in range(k - 1):
ans += height[j]
print(ans) |
p03617 | s746662240 | Accepted | Q, H, S, D = map(int, input().split())
L = int(input())
quantities = [(8*Q, 'Q'), (4*H, 'H'), (2*S, 'S'), (D, 'D')]
rest = {'Q': 4*Q, 'H': 2*H, 'S': S, 'D': D//2}
quantities.sort()
if quantities[0][1] == 'D' and L%2 != 0:
print(L//2*D + rest[quantities[1][1]])
elif quantities[0][1] == 'D' and L%2 == 0:
print(L//2*D... |
p03699 | s527204363 | Accepted | N = int(input())
s = [int(input()) for _ in range(N)]
if sum(s) % 10:
print(sum(s))
else:
s2 = [i for i in s if i % 10]
if s2:
print(sum(s) - min(s2))
else:
print(0) |
p02797 | s560065291 | Accepted | # coding: utf-8
N, K, S = map(int, input().split())
if S < 10**9:
for _ in range(K):
print(S, end=" ")
for _ in range(N-K-1):
print(S+1, end=" ")
if K != N:
print(S+1)
else:
for _ in range(K):
print(S, end=" ")
for _ in range(N-K-1):
print(S-1, end=" ")
... |
p02570 | s678683197 | Accepted | def solve(d,t,s):
if d/s <= t:
return "Yes"
return "No"
d,t,s = map(int,input().split())
print(solve(d,t,s)) |
p03625 | s364417360 | Accepted | from collections import Counter
def main():
n = int(input())
a = list(map(int, input().split()))
ac = Counter(a)
acl = [i for i in ac if ac[i] >= 2]
acl.sort(reverse=True)
if len(acl) == 0:
print(0)
elif ac[acl[0]] >= 4:
print(int(acl[0] * acl[0]))
elif len(acl) <= 1:
... |
p03611 | s814190486 | Accepted | n = int(input())
a = list(map(int,input().split()))
point = [0]*(10**5+2)
for i in a:
if i == 1:
point[1] += 1
point[2] += 1
else:
point[i] += 1
point[i-1] += 1
point[i+1] += 1
print(max(point)) |
p02661 | s343328740 | Accepted | import sys
import math
N = int(sys.stdin.readline().strip())
ABlist = []
for _ in range(N):
a, b = map(int, sys.stdin.readline().strip().split())
ABlist.append((a, b))
Asorted = sorted(ABlist)
Bsorted = sorted(ABlist, key=lambda x: x[1])
if N % 2 == 1:
left = Asorted[N//2][0]
right = Bsorted[N//2][1]
... |
p03761 | s621083847 | Wrong Answer | n=int(input())
a=[list(map(str,input().split())) for i in range(n)]
# print(a)
# print(len(a[0][0]))
ans=[]
cnt=0
# print(a[0][0][0])
for i in range(len(a[0][0])):
cnt=0
for k in range(1,n):
if (a[0][0][i] in a[k][0]):
a[k][0].replace(a[0][0][i],"",1)
cnt+=1
if cnt==n-1:
... |
p03206 | s678673854 | Wrong Answer | d = int(input())
print("Christmas" + "Eve" *(25-d)) |
p02658 | s611206171 | Accepted | def resolve():
N = int(input())
A = list(map(int, input().split()))
ans = A[0]
if 0 in A:
print(0)
return
for i in range(1, N):
ans = ans * A[i]
if ans > (10 ** 18):
ans = -1
break
print(ans)
resolve() |
p03146 | s894867368 | Wrong Answer | s=int(input())
count=0
a=[0]*1000000
for i in range(1000000):
if s%2==1:
s=s*3+1
else:
s=s//2
if s in a:
print(i+2)
break
a[i]=s |
p02747 | s493072887 | Wrong Answer | s = input()
s = s.split('hi')
s = set(s)
if len(s) == 1:
print("Yes")
else:
print("No") |
p02697 | s331364636 | Wrong Answer | n,m=map(int,input().split())
if n%2==1:
for i in range(0,m):
print(i+1,m-i)
else:
lis1=[]
lis2=[]
for i in range(1,m+1):
lis1.append(i)
lis2.append(2*m+1-i)
for k in range(0,len(lis1)):
if k%2==1:
print(lis1[k],lis2[-1-k])
else:
print(lis1[k],lis2[k]) |
p03485 | s556040302 | Accepted | a,b=map(int,input().split()) #入力を改行ではなくてスペース1マスあける
x=(a+b)/2
if x%1==0:
print(int(x))
else:
print(int(x)+1)
|
p02862 | s536295551 | Accepted | from functools import reduce
def mycmb(n,r,p):
r = min(r,n-r)
if r == 0:
return 1
over = reduce(lambda x,y:x*y%p,range(n,n-r,-1))
under = reduce(lambda x,y:x*y%p,range(1,r+1))
return (over * pow(under,p-2,p))%p
mod = 10**9+7
x,y = map(int, input().split())
n = (2*x-y) // 3
m = (2*y-x) //... |
p03804 | s812671580 | Accepted | N,M=map(int,input().split())
A=[input() for i in range(N)]
B=[input() for i in range(M)]
def F(a,b):
for k in range(M):
for l in range(M):
if A[a+l][b+k]!=B[l][k]:
return False
return True
for i in range(N-M+1):
for j in range(N-M+1):
if F(i,j):
print('Yes')
exit()
print('No')... |
p02598 | s962023493 | Accepted | n,k = map(int, raw_input().split())
ais = map(int, raw_input().split())
def p(m,ais,k):
t = [ m, ais, k]
for ai in ais:
if ai > m:
k-= ai / m
return k >=0
lo,hi = 1, max(ais)
while(lo < hi):
med = (lo + hi)/2
if p(med, ais, k):
hi = med
else:
lo = med + 1
print lo
|
p03206 | s365099166 | Accepted | d=int(input())
if d==25:
print("Christmas")
elif d==24:
print("Christmas Eve")
elif d==23:
print("Christmas Eve Eve")
elif d==22:
print("Christmas Eve Eve Eve") |
p02983 | s712673197 | Wrong Answer | l, r = map(int, input().split())
l, r = l%2019, r%2019
ans = 2019
for i in range(l, r):
for j in range(i+1, r+1):
ans = min(ans, (i*j)%2019)
print(ans) |
p03695 | s598001507 | Accepted | n=int(input())
A=list(map(int,input().split()))
A=[a for a in A if a<3200]
free=n-len(A)
A=set(map(lambda x: x//400,A))
print(max(1,len(A)),len(A)+free) |
p02785 | s178908662 | Accepted | N, K = map(int, input().split())
H = list(sorted(list(map(int, input().split())), reverse=True))
ans = 0
for h in H[K:]:
ans += h
print(ans) |
p02935 | s116962045 | Wrong Answer | n=int(input())
v=sorted(list(map(int,input().split())))
ans=v[0]
for i in range(n-1):
ans=(ans+v[i+1])//2
print(ans) |
p04012 | s448420304 | Accepted | w = input()
for a in [chr(ord("a")+i) for i in range(26)]:
if w.count(a) % 2 == 1:
print("No")
exit()
print("Yes") |
p03338 | s568801470 | Wrong Answer | N = int(input())
S = list(input())
maxCommon = 1
for i in range(1, N):
# print(set(S[0:i]))
# print(set(S[i:]))
#print(set(S[0:i]) & set(S[i:]))
commonNum = len(list(set(S[0:i]) & set(S[i:])))
if commonNum > maxCommon:
maxCommon = commonNum
print(maxCommon)
|
p03076 | s347891345 | Accepted | S = [input() for _ in range(5)]
T = []
U = []
for i in range(5):
T.append(S[i])
if int(T[i][-1]) == 0:
U.append(9)
else:
U.append(int(T[i][-1]))
del T[U.index(min(U))]
import math
a = 0
for i in range(4):
a += math.ceil(int(T[i])*0.1)*10
a += int(S[U.index(min(U))])
print(a) |
p03319 | s512757145 | Accepted | n, k = map(int, input().split())
print(1-(k-n)//(k-1))
|
p03262 | s606584623 | Wrong Answer | import fractions
import math
n,X= map(int,input().split())
x = list(map(int, input().split()))
x.append(X)
difflis = [0] * (n)
for i in range(n):
difflis[i] = math.fabs(x[i+1] - x[i])
ans = difflis[0]
for i in range(i,len(difflis)):
ans = fractions.gcd(ans,difflis[i])
print(int(ans)) |
p03329 | s813132615 | Wrong Answer | N = int(input())
dp = [float('inf')]*(N+1)
dp[0] = 0
for i in range(N+1):
if i+1 <= N:
dp[i] = min(dp[i],dp[i-1]+1)
for j in range(1,N+1):
if i < 6**j:
break
dp[i] = min(dp[i-6**j]+1,dp[i])
for k in range(1,N+1):
if i < 9**k:
break
dp[i] = min(... |
p02823 | s739056027 | Accepted | n,a,b = map(int,input().split())
if (b-a)%2 == 0:
print((b-a)//2)
exit()
print(min(b,n-a+1,a+(b-a)//2,n-b+1 + (b-a-1)//2) ) |
p02843 | s868264729 | Accepted | X = int(input())
dp = [False] * (X+1)
dp[0] = True
def judge(i, j):
if i >= j:
return dp[i-j]
else:
return False
for i in range(1, X+1):
dp[i] = judge(i, 100) or judge(i, 101) or judge(i, 102) or judge(i, 103) or judge(i, 104) or judge(i, 105)
print(int(dp[X])) |
p02702 | s955633364 | Wrong Answer | S=input()
N=len(S)
Slis=[]
for i in range(N):
Slis+=[int(S[i])]
T=[int(S[i:]) for i in range(N)]
MOD=[0 for i in range(2019)]
for i in range(N):
tmp=T[i]%2019
MOD[tmp]+=1
ans=0
for i in range(2019):
tmp=MOD[i]
ans+=tmp*(tmp-1)//2
print(ans)
|
p02628 | s280340654 | Accepted | n, k = map(int, input().split())
lst = list(map(int, input().split()))
lst.sort()
print(sum(lst[:k]))
|
p02888 | s675081065 | Accepted | from bisect import bisect_left
N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(N - 2):
a = L[i]
for j in range(i + 1, N - 1):
b = L[j]
c = bisect_left(L, a + b)
ans += c - j - 1
print(ans) |
p03774 | s871540261 | Accepted | n, m = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(n)]
cd = [list(map(int, input().split())) for _ in range(m)]
for i in range(n):
d = (10**8)*4
result = 0
for j in range(m):
if abs(ab[i][0] - cd[j][0]) + abs(ab[i][1] - cd[j][1]) < d:
d = abs(ab[i][0] ... |
p03327 | s227323506 | Wrong Answer | # import bisect
# from collections import Counter, defaultdict, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math
import sys
# import numpy as np
ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF... |
p02952 | s629522909 | Accepted | N = int(input())
ans = 0
for n in range(1, N + 1):
if len(str(n)) % 2 == 1:
ans += 1
print(ans)
|
p03544 | s110797575 | Accepted | def Ryuka(n):
L = [2,1]
for i in range(n-1):
L.append(L[len(L)-1]+L[len(L)-2])
return L[len(L)-1]
def main():
N = int(input())
print(Ryuka(N))
if __name__ == "__main__":
main()
|
p03469 | s606463171 | Accepted | S = input()
print("2018"+S[4::]) |
p04045 | s687833781 | Wrong Answer | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9+7
MAX = 10**18
MIN = -10**18
n,k= map(int,input().split())
d = list(map(int,input().split()))
able = [True]*10
for i in range(k):
able[d[i]] = False
n = st... |
p02823 | s128014440 | Accepted | N, A, B = map(int, input().split())
if (B-A) % 2 == 0: print((B-A)//2)
else: print(min((A-1+B-1+1)//2, (N-A+N-B+1)//2))
|
p03077 | s293530060 | Accepted | import math
N = int(input())
a = min([int(input()) for _ in range(5)])
print(4+math.ceil(N/a)) |
p04034 | s397232992 | Accepted | n,m=map(int,input().split())
a=[1]*n
b=[0]*n
b[0]=1
for _ in range(m):
x,y=map(int,input().split())
x-=1
y-=1
if a[x]>1:
if b[x]==1:
b[y]=1
a[x]-=1
a[y]+=1
else:
if b[x]==1:
b[x]=0
b[y]=1
a[x]-=1
a[y]+=1
print(sum(b)... |
p02835 | s828901410 | Accepted | s=sum(list(map(int,input().split())))
if s<=21:
print("win")
else:
print("bust") |
p03000 | s223420581 | Accepted | n,x=map(int,input().split())
l=list(map(int,input().split()))
d=0
ans=1
i=0
for i in range(n):
d+=l[i]
if d<=x:
ans+=1
#print(d)
else:
break
print(ans)
|
p02772 | s695210820 | Wrong Answer | n = int(input())
l = list(map(int, input().split()))
l2 = [i for i in l if i % 2 == 0]
l3 = [i for i in l2 if i % 3 == 0]
l4 = [i for i in l2 if i % 5 == 0]
l5 = list(set(l4+l3))
if len(l5) != len(l2):
print('DENIED')
else:
print('APPROVED') |
p02854 | s844941737 | Accepted | n = int(input())
a = list(map(int, input().split()))
def ruiseki(a):
right, left = [], []
l, r = 0, 0
for i in range(n):
l += a[i]
left.append(l)
r += a[-(i+1)]
right.append(r)
return left, right[::-1]
l, r = ruiseki(a)
ans = [abs(l[i] - r[i+1]) for i in range(n-1)... |
p03438 | s338012133 | Wrong Answer | import sys
s=0
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
a=sum(A)
b=sum(B)
if a>b:
print("No")
sys.exit()
for i in range(N):
if A[i]-B[i]>0:
s+=A[i]-B[i]
if b-a<s:
print("No")
sys.exit()
else:
print("Yes") |
p03730 | s586575401 | Accepted | A, B, C = map(int, input().split())
#%%
m = 1
while True:
if (A * m) % B == 0:
ans = 'NO'
break
elif (A * m) % B == C:
ans = 'YES'
break
m += 1
print(ans) |
p03385 | s379466149 | Accepted | S = input()
for s in "abc":
if s not in S:
print("No")
exit()
print("Yes") |
p03352 | s762312853 | Accepted | x=int(input())
ans=1
for i in range(1,1000+1):
for j in range(2,11):
if i**j<=x:
ans=max(ans,i**j)
print(ans) |
p03103 | s341298637 | Accepted | n, m = map(int, input().split())
ab = []
for _ in range(n):
a, b = map(int, input().split())
ab.append((a, b))
ab.sort()
ans = 0
for a, b in ab:
buy = [m, b][0 <= m-b]
m -= buy
ans += a*buy
print(ans)
|
p03699 | s337398159 | Wrong Answer | N = int(input())
qustions = []
summation = [0]*(N+1)
for i in range(N):
tmp = int(input())
summation[i + 1] = summation[i] + tmp
max = 0
for i in range(N+1):
for j in range(N+1):
diff = summation[j] - summation[i]
if diff % 10 == 0:
diff = 0
if diff > max:
max... |
p03095 | s186354238 | Wrong Answer | n=int(input())
s=input()
# 数値(1〜26)→アルファベット(a〜z)
n2a = lambda c: chr(c+64).lower()
al=[]
for i in range(1,27):
c=s.count(n2a(i))
if c!=0:
al.append(c)
def func(nums):
if len(nums)==1:
return nums[0]
elif len(nums)==2:
return nums[0]+nums[1]+nums[0]*nums[1]
else:
num=func(nums[1:])
return n... |
p02603 | s352802011 | Wrong Answer | n = int(input())
a = list(map(int, (input().split())))
a.append(0)
mon = 1000
kab = 0
x = 0
for i in range(n):
if a[i] <= a[i+1]:
kab += mon//a[i]
mon += kab*(a[i+1]-a[i])
print(mon) |
p02576 | s646584630 | Wrong Answer | N, X, T = map(int, input().split())
print((N//X+1)*T) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.