problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03282 | s331998310 | Accepted | s = input()
k = int(input())
ans = 1
for i in range(k):
if s[i] != '1':
ans = s[i]
break
print(ans) |
p02820 | s522262407 | Accepted | def main():
n,k = map(int,input().split())
r,s,p = map(int,input().split())
t = list(input())
res = 0
dic = {'r':p,'s':r,'p':s}
for i in range(n):
if i < k or t[i-k] != t[i]:
res += dic[t[i]]
else:
t[i] = ' '
print(res)
if __name__ == '__main__':
main()
|
p03644 | s345673888 | Wrong Answer | import sys
n = int(input())
a = [2**i for i in range(0,7)]
for i in range(len(a)):
if n == a[i]:
print(a[i])
sys.exit()
elif n < a[i]:
print(a[i-1])
sys.exit() |
p03126 | s660903814 | Accepted | n, m = map(int, input().split())
s = set(range(1, m+1))
for _ in range(n):
k, *a = map(int, input().split())
s&=set(a)
print(len(s)) |
p02796 | s412658347 | Accepted | #わからんけどとりあえず貪欲
N = int(input())
robots = []
for i in range(N):
X,L = list(map(int,input().split()))
robots.append((X-L,X+L))
robots.sort(key=lambda x:x[1])
point = -(10**9)
ans = 0
for i in range(N):
if point <= robots[i][0]:
ans += 1
point = robots[i][1]
print(ans)
|
p02631 | s570432722 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
AA = [0] * (N)
for i in range(N):
AA[i] = list(format(A[i], 'b'))
ans = [0] * 42
for i in range(N):
AA[i].reverse()
for j in range(len(AA[i])):
ans[j] += int(AA[i][j])
ret = []
for i in range(N):
temp = 0
for j in range(len(AA[i])):
if (ans[j] - int(AA[i][j])) % 2 == 1:
temp += 1 << j
ret.append(temp)
print(*ret)
|
p02982 | s802814256 | Wrong Answer | n, d = map(int, input().split())
x = [list(map(int, input().split())) for _ in range(n)]
ans = 0
def check(i, j):
d2 = 0
for k in range(d):
d2 += (x[i][k] * x[j][k]) ** 2
for j in range(d2 + 1):
if j ** 2 > d2:
return False
if j ** 2 == d2:
return True
return False
for i in range(n):
for j in range(i + 1, n):
if check(i, j):
ans += 1
print(ans)
|
p02547 | s574351674 | Accepted | N = int(input())
ans = 0
for i in range(N):
d1,d2 = map(int, input().split())
if d1 == d2:
ans += 1
if ans == 3:
print("Yes")
exit()
else:
ans = 0
else:
print("No") |
p03105 | s417580784 | Wrong Answer | A,B,K=map(int,input().split())
cnt=0
num=1
for i in range((min(A,B)),0,-1):
if cnt<K:
if A%i==0 and B%i==0:
cnt+=1
num=i
else:
break
print(num) |
p02701 | s281819917 | Accepted | N = int(input())
S = []
for _ in range(N):
S.append(input())
print(len(set(S))) |
p03324 | s572473662 | Wrong Answer | D,N=map(int, input().split())
base=10**(2*D)
print(N*base) |
p02624 | s885880918 | Wrong Answer | def solve(n):
ans = 0
for i in range(1,n+1):
y = n//i
print(y)
ans += (y*(y+1)*i)/2
return ans
def main():
n = int(input())
print(int(solve(n)))
if __name__ == "__main__":
main()
|
p03037 | s369141725 | Accepted | def main():
N, M = map(int, input().split())
cards = [0] * (N + 1)
for _ in range(M):
l, r = [int(v) - 1 for v in input().split()]
cards[l] += 1
cards[r+1] -= 1
count = 0
if cards[0] == M:
count += 1
for i in range(1, N+1):
cards[i] += cards[i - 1]
if cards[i] == M:
count += 1
print(count)
main()
|
p03011 | s975237786 | Accepted | p = list(map(int,input().split()))
mn = 200
for i in range(2):
for j in range(i+1,3):
if (p[i]+p[j] < mn):
mn = p[i]+p[j]
print(mn)
|
p03371 | s844773950 | Accepted | a,b,c,x,y=map(int,input().split())
p = a*x + b*y
q = 2*c*max(x,y)
r = 2*c*x + b*(y-x)
s = 2*c*y + a*(x-y)
if x >=y:
print(min(p,q,s))
else:
print(min(p,q,r)) |
p03252 | s371375160 | Wrong Answer | s = input()
t = input()
dic = {}
for i,j in zip(s,t):
if i == j:
continue
if j in dic:
if dic[j] != i:
print("No")
exit()
else:
dic[j] = i
print("Yes") |
p03261 | s652092618 | Accepted | n = int(input())
resl = "Yes"
wrds = set()
for i in range(n):
sng = input()
if i==0:
lst = sng[len(sng)-1]
wrds.add(sng)
elif sng[0]==lst and (sng not in wrds):
lst = sng[len(sng)-1]
wrds.add(sng)
else:
resl = "No"
print(resl) |
p03220 | s231883642 | Wrong Answer | n = int(input())
t,a = map(int, input().split())
h = list(map(int, input().split()))
dic = []
for i in h:
b = abs((i - t * 0.006) - a)
dic.append(b)
print(dic.index(min(dic)) + 1) |
p02860 | s599446342 | Accepted | n = int(input())
s = input()
half = n // 2
if s[:half] == s[half:]:
print("Yes")
else:
print("No")
|
p03804 | s545024960 | Wrong Answer | N,M=map(int, input().split())
N_str = []
M_str = []
for i in range(N):
n=str(input())
N_str.append(n)
for i in range(M):
m=str(input())
M_str.append(m)
equal = False
for i in range(N-M+1):
for k in range(N-M+1):
each_equal = True
for l in range(M):
each_equal = each_equal and (N_str[i+l][k:k+M] == M_str[l])
equal = each_equal
print(["No","Yes"][equal])
|
p03944 | s372355658 | Wrong Answer | W, H, N = map(int, input().split())
w = 0
h = 0
lx = list()
ly = list()
la = list()
for i in range(1, N+1):
X, Y, A = map(int, input().split())
lx.append(X)
ly.append(Y)
la.append(A)
if A == 1 and w < X:
w = X
elif A == 2 and X < W:
W = X
elif A == 3 and h < Y:
h = Y
elif A == 4 and Y < H:
H = Y
S = (W - w)*(H - h)
if S < 0:
S = 0
print(S) |
p03371 | s439804065 | Accepted | a,b,c,x,y = list(map(int,input().split()))
if 2*c > a+b:
ans = a*x + b*y
else:
ans = min(x,y)*2*c+(x-min(x,y))*(min(2*c,a))+(y-min(x,y))*(min(2*c,b))
print(ans) |
p03625 | s162796846 | Accepted | D = {}
N = int(input())
A = list(map(int, input().split()))
Rec = []
Sq = []
for i in A:
if i in D:
D[i] += 1
else:
D[i] = 1
for i in D:
if D[i] >= 4:
Sq.append(i)
if D[i] >= 2:
Rec.append(i)
Rec.sort(reverse=True)
if len(Rec) <= 1 and len(Sq) == 0:
print(0)
elif len(Sq) != 0 and len(Rec) >= 2:
print(max(Rec[0] * Rec[1], max(Sq) * max(Sq)))
elif len(Sq) == 0 and len(Rec) >= 2:
print(Rec[0] * Rec[1])
|
p03495 | s362203603 | Accepted | import collections
n,k=map(int,input().split())
A=list(map(int,input().split()))
a=collections.Counter(A)
a=a.most_common()
cnt=0
for i in range(len(a)):
if i>k-1:
cnt+=a[i][1]
print(cnt) |
p02727 | s877789688 | Wrong Answer | def main():
import heapq
x, y, a, b, c = map(int, input().split())
rlis = list(map(int, input().split()))
glis = list(map(int, input().split()))
clis = list(map(int, input().split()))
lis = []
rlis.extend(clis)
glis.extend(clis)
anslis1 = heapq.nlargest(x,rlis)
anslis2 = heapq.nlargest(y,glis)
anslis1.extend(anslis2)
print(sum(int(i) for i in anslis1))
if __name__ == '__main__':
main()
|
p03210 | s689625715 | Accepted | x = int(input())
if x == 3 or x == 5 or x == 7:
ans = 'YES'
else:
ans = 'NO'
print(ans) |
p02714 | s466705554 | Accepted | N = int(input())
S = input()
#条件1を満たす(i,j,k)の組→R,G,Bの選び方
r,g,b = S.count('R'),S.count('G'),S.count('B')
ans = r*g*b
for i in range(N):
for j in range(i+1,N):
k = 2*j - i
if k >= N:
break
else:
if S[i]!=S[j] and S[i]!=S[k] and S[j]!=S[k]:
ans -= 1
print(ans)
|
p03479 | s972931579 | Accepted |
X,Y=open(0).read().split()
X=int(X)
Y=int(Y)
for i in range(110000):
if (2**i) >= 1000000000000000000:
#print(i)
break
list1=[2**i*X for i in range(61) if 2**i*X <= Y]
print(len(list1))
|
p02952 | s473981074 | Accepted | N = int(input())
ans = 0
for n in range(1,N+1):
if len(str(n)) % 2 == 1:
ans += 1
print(ans) |
p02730 | s561506019 | Accepted | s=list(map(str, input()))
s_=s.copy()
s.reverse()
a=s_[:int((len(s_)-1)/2)]
a_=a.copy()
a.reverse()
b=s_[int((len(s_)+3)/2)-1:]
b_=b.copy()
b.reverse()
if s_==s and a_==a and b_==b:
print('Yes')
else:
print('No') |
p03835 | s843437119 | Accepted | K, S = map(int, input().split())
ans = 0
for x in range(K+1):
for y in range(K+1):
z = S - x - y
if 0 <= z <= K:
ans += 1
print(ans) |
p02576 | s190386417 | Accepted | n, x, t = map(int, input().split())
a = n // x
if n % x != 0:
a += 1
print(a * t)
|
p03239 | s846836883 | Accepted | n, t = [int(i) for i in input().split()]
list_route = [list(map(int, input().split())) for list_route in range(n)]
ans = 1001
for i in range(0, n):
if list_route[i][1] <= t and ans >= list_route[i][0]:
ans = list_route[i][0]
if ans != 1001: print(ans)
else: print("TLE") |
p02603 | s743467276 | Accepted | N = int(input())
A = list(map(int, input().split()))
dp = [0] * (N+1)
dp[0] = 1000
for i in range(1, N+1):
dp[i] = dp[i-1]
for j in range(1,i):
dp[i] = max(dp[i], dp[j] // A[j-1] * A[i-1] + (dp[j] % A[j-1]))
print(dp[-1])
|
p02691 | s013077276 | Wrong Answer | import collections
N = int(input())
A = list(map(int,input().split()))
#index,h
pp =[]
pm = []
all_set = set()
for i in range(N):
pp.append(i + A[i])
pm.append( i - A[i])
count = 0
c = collections.Counter(pp)
#print(c)
for i in range(N):
count += c[pm[i]]
print(c[pm[i]])
#count += pp.count(pm[i])
#count += pm.count(pp[i])
print(count) |
p03251 | s015327399 | Wrong Answer | n, m, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
max_x = max(x)
min_y = min(y)
if Y-X >=1 and min_y - max_x >= 1 and max_x - Y >= 1 and min_y - X >= 1:
print('No War')
else:
print('War')
|
p03061 | s167451378 | Wrong Answer | import sys
from functools import reduce
def gcd(m, n):
r = m % n
return gcd(n, r) if r else n
def gcd_list(numbers):
return reduce(gcd, numbers)
n = int(input())
a = list(map(int, sys.stdin.readline().split()))
c = [gcd_list(a[:i] + a[i+1:]) for i in range(n)]
c.sort()
if n == 2:
print(c[1])
else:
print(c[2]) |
p02732 | s932787091 | Accepted | N = int(input())
A = list(map(int, input().split()))
def comb(x):
if x > 1:
return int(x*(x-1)/2)
return 0
M = [0 for _ in range(N+1)]
C = [0 for _ in range(N+1)]
_C = [0 for _ in range(N+1)]
for i in range(N):
M[A[i]] += 1
for i in range(N):
cnt = M[A[i]]
C[A[i]] = comb(cnt)
_C[A[i]] = comb(cnt-1)
S = sum(C)
for i in range(N):
print(S - C[A[i]] + _C[A[i]])
|
p02789 | s725732975 | Accepted | N,M = list(map(int,input().split()))
if N == M:
print('Yes')
else:
print('No') |
p02785 | s367645941 | Wrong Answer | eneNum, spNum = map(int, input().split())
eneHp = map(int, input().split())
eneHpList = list(eneHp)
# TLE
#count = 0
#for i in range(spNum):
# if len(eneHpList) > 0:
# maxEneHp = max(eneHpList)
# eneHpList.remove(maxEneHp)
# new method
eneHpList.reverse()
del eneHpList[0:spNum]
count = sum(eneHpList)
print("{}".format(count)) |
p02993 | s479265321 | Wrong Answer | S=input()
if(S[0]==[1] or S[1]==S[2] or S[2]==S[3]):
print("Bad")
else:
print("Good")
|
p03456 | s056669269 | Accepted | import math
a, b = input().split()
s = a + b
i = int(s)
r = math.sqrt(i)
if r.is_integer():
print("Yes")
else:
print("No") |
p02873 | s272336837 | Accepted | s = input()
A = [0] * (len(s) + 1)
for i, c in enumerate(s):
if c == '<':
A[i+1] = A[i] + 1
for i, c in enumerate(s[::-1]):
if c == '>':
x = len(s) - i
A[x-1] = max(A[x-1], A[x] + 1)
print(sum(A)) |
p03284 | s225413527 | Wrong Answer | a,b=map(int,input().split())
if a%b==1:
print(1)
else:
print(0)
|
p03208 | s587634067 | Accepted | N, K = map(int, input().split())
hs = [int(input()) for i in range(N)]
hs.sort()
m = hs[K-1] - hs[0]
for i in range(1,N-K+1):
m = min(m, hs[i + K - 1] - hs[i])
print(m) |
p03077 | s252429410 | Accepted | # C - Five Transportations /
n = int(input())
t = []
for i in range(5):
t.append(int(input()))
m = min(t)
print((n+m-1)//m - 1 + 5 ) |
p03997 | s501635717 | Accepted | a = int(input())
b = int(input())
h = int(input())
area = h * min(a, b) + h * abs(b - a) * 0.5
print(int(area)) |
p02622 | s601279732 | Accepted | s = input()
t = input()
ans = 0
for i in range(len(s)):
ans += 1 if s[i] != t[i] else 0
print(ans) |
p02958 | s912859351 | Wrong Answer | n = int(input())
p = input().split()
P = sorted(p)
length = len(p)
count = 0
for i in range(0, length):
if p[i] != P[i]:
count += 1
if count >= 3:
print('YES')
else:
print('NO') |
p03261 | s432755379 | Accepted | N = int(input())
W = [input() for _ in range(N)]
def puts(s): # 個人的にこのほうが解りやすいので。。。
print(s)
ans = 'Yes'
for i in range(N - 1):
if W[i][-1] != W[i + 1][0]:
ans = 'No'
break
W.sort()
for i in range(N - 1):
if W[i] == W[i + 1]:
ans = 'No'
break
puts(ans) |
p03680 | s396591114 | Accepted | n = int(input())
buttons = []
for _ in range(n):
buttons.append(int(input()))
light = buttons[0]
for i in range(n):
if light == 2:
print(i+1)
break
light = buttons[light-1]
else:
print(-1)
|
p03785 | s195615619 | Accepted | def main():
N, C, K = map(int, input().split())
T = [int(input()) for _ in range(N)]
T = sorted(T)
num_bus = 1
num_passenger = 1
first_passenger = T[0]
for i in range(1, N):
if first_passenger + K < T[i]:
first_passenger = T[i]
num_passenger = 1
num_bus += 1
elif num_passenger == C:
first_passenger = T[i]
num_passenger = 1
num_bus += 1
else:
num_passenger += 1
print(num_bus)
if __name__ == "__main__":
main() |
p03319 | s522738372 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
x = K
ans = 1
while x < N:
x += K-1
ans += 1
print(ans) |
p03107 | s851159414 | Accepted | s = input()
z = s.count("0")
o = s.count("1")
print(min(z, o)*2)
|
p03854 | s070843406 | Accepted | S = input()
i = 0
n = len(S)
while i <= n-5:
if S[i:i+5] == "dream":
i += 5
if S[i:i+2] == "er" and S[i:i+5] != "erase":
i += 2
elif S[i:i+5] == "erase":
i += 5
if S[i:i+1] == "r":
i += 1
else:
break
if i != len(S):
print("NO")
else:
print("YES") |
p04011 | s678632115 | Accepted | n=int(input())
k=int(input())
x=int(input())
y=int(input())
if n>=k:
print(k*x+(n-k)*y)
else:
print(n*x) |
p02688 | s012517503 | Accepted | n, k = list(map(int, input().split()))
l = set()
d = [input().split() for _ in range(k*2)]
for i in range(len(d)):
if i % 2 == 1:
l = l | set(d[i])
print(n - len(l)) |
p02640 | s081794641 | Accepted | x,y = map(int, input().split())
b = (y/2-x)
a = x - b
if 2*a+4*b != y or y%2 or x*2 > y or x*4 < y:
print("No")
else:
print("Yes") |
p02923 | s466354660 | Accepted | N=int(input())
h=list(map(int, input().split()))
cnt=0
ans=0
for i in range(N-1):
if h[i]>=h[i+1]:
cnt+=1
else:
cnt=0
if cnt>ans:
ans=cnt
print(ans) |
p03127 | s495917631 | Accepted | import fractions
from functools import reduce
def gcd(*numbers):
return reduce(fractions.gcd, numbers)
n = int(input())
a = list(map(int,input().split()))
print(gcd(*a)) |
p03419 | s282147217 | Accepted | N, M = list(map(int, input().split()))
if N > M:
N, M = M, N
res = 0
if M == 1:
res = 1
elif N == 2 or M == 2:
res = 0
elif N == 1:
res = M - 2
else:
res = (N - 2) * (M - 2)
print(res)
|
p02596 | s304287973 | Accepted | K = int(input())
c = 0
a = 7 % K
for i in range(K + 1):
if a == 0:
print(i + 1)
exit()
a = (a * 10 + 7) % K
print(-1) |
p03145 | s124166731 | Accepted | a,b,c=map(int,input().split())
print(int(a*b/2)) |
p03607 | s309578057 | Accepted | n=int(input())
L=[0 for _ in range(n+1)]
for i in range(n):
L[i]=int(input())
list.sort(L, reverse=True)
ans=0
cnt=1
for i in range(n):
if L[i]==L[i+1]:
cnt+=1
else:
if cnt%2!=0:
ans+=1
cnt=1
print(ans) |
p02761 | s147066205 | Accepted | n, m = map(int, input().split())
sc = [list(map(int, input().split())) for _ in range(m)]
if n == 1:
num_list = list(range(10))
else:
num_list = list(range(10**(n-1), 10**n))
for i in num_list:
flg = True
for s, c in sc:
if str(i)[s-1] != str(c):
flg = False
break
if flg:
print(i)
exit()
print(-1) |
p03698 | s911119712 | Accepted | import string
al = string.ascii_lowercase
S = input()
ans = "yes"
for a in al:
if S.count(a) > 1:
ans = "no"
print(ans)
|
p02595 | s472580528 | Wrong Answer | nd=input().split()
n=int(nd[0])
d=int(nd[1])
L=[]
for i in range(0,n):
xy=input().split()
x=int(xy[0])
y=int(xy[1])
L.append((x,y))
L.sort()
z=d*d
a=(L[0][0])**2+(L[0][1])**2
if(a<=z):
count=1
else:
count=0
for i in range(1,n):
if(L[i]!=L[i-1]) and ((L[i][0])**2+(L[i][1])**2<=z):
count+=1
print(count)
|
p02622 | s268292637 | Accepted | S = input()
T = input()
print(sum(a!=b for a,b in zip(S,T))) |
p03469 | s868622839 | Wrong Answer | N = list(input())
N[3] = "7"
date = ''.join(N)
print(date) |
p02922 | s527004799 | Accepted | import math
a,b=map(int,input().split())
print(1+math.ceil((b-a)/(a-1))) |
p02658 | s459094619 | Accepted | N = int(input())
*A, = map(int, input().split())
ans = 1
mx = 10**18
for a in A:
if a == 0:
print(0)
exit()
for a in A:
ans *= a
if ans > mx:
print(-1)
exit()
print(ans)
|
p03485 | s222949351 | Accepted | a, b = map(int, input().split())
print((a + b + 1) // 2)
|
p03210 | s557711778 | Accepted | print("YES" if input() in "357" else "NO") |
p03994 | s616080605 | Wrong Answer | s = input()
l = ''
n = int(input())
alp = [chr(ord('a')+i) for i in range(26)]
for i in range(len(s)):
if i != len(s)-1:
if 97+26-ord(s[i]) <= n:
n -= (123-ord(s[i]))
l += 'a'
else:
l += s[i]
else:
t = ord(s[i])
if t+n <= 122:
l += chr(t+n)
else:
n = n%26
if t+n <= 122:
l += chr(t+n)
else:
l += chr(t+n-26)
print(l) |
p02900 | s197057267 | Accepted | from fractions import gcd
A, B = map(int, input().split())
g = gcd(A, B)
ans = 1
n = 2
while g > 1:
if n * n > g:
ans += 1
break
if g % n == 0:
ans += 1
while g % n == 0:
g //= n
n += 1
print(ans)
|
p02811 | s305585307 | Accepted | # 150 A
k, x = map(int, input().split())
sum = k * 500
if sum >= x:
print("Yes")
else:
print("No") |
p02595 | s181182477 | Accepted | n, d = map(int, input().split())
xy = [list(map(int, input().split())) for _ in range(n)]
cnt = 0
for i in range(n):
if xy[i][0] ** 2 + xy[i][1] ** 2 <= d ** 2:
cnt += 1
print(cnt) |
p03910 | s401371464 | Accepted | n = int(input())
now = 1
L = []
while now*(now-1)//2 < n:
L.append(now)
now += 1
c = sum(L)
if c > n:
L.remove(c-n)
print(*L, sep="\n") |
p02775 | s174453874 | Accepted | s =list(map(int, list(input())))
INF = 1001001001001
dp1=[INF]*1001001
dp2=[INF]*1001001
n=len(s)
dp1[n-1]=s[n-1]
dp2[n-1]=10-s[n-1]
for i in reversed(range(n-1)):
if s[i]<9:
dp1[i] = min(dp1[i+1]+s[i],dp2[i+1]+s[i]+1)
else:
dp1[i] = dp1[i+1]+s[i]
dp2[i] = min(dp1[i+1]+10-s[i], dp2[i+1]+10-s[i]-1)
dp2[0]+=1
print(min(dp1[0], dp2[0]))
|
p03071 | s327210343 | Accepted | A, B = list(map(int, input().split()))
ans = 0
for _ in range(2):
ans += max(A, B)
if A > B:
A -= 1
else:
B -= 1
print(ans)
|
p03475 | s967063006 | Wrong Answer | N = int(input())
CSF = [list(map(int, input().split())) for _ in range(N - 1)]
for i in range(N):
t = 0
for c, s, f in CSF[i:]:
# 待ち時間
if t < s:
t = s
else:
t += (t - s) % f
# i -> i+1に移動
t += c
print(t)
|
p02957 | s529899163 | Accepted | a,b=map(int,input().split())
if (a+b)%2==0:
print((a+b)//2)
else:
print("IMPOSSIBLE") |
p02742 | s939300500 | Accepted | import math
h,w = map(int,input().split())
if h == 1 or w == 1:
print(1)
else:
print(math.ceil(h*w/2))
|
p04019 | s020253223 | Accepted | s=set(input())
if len(s)==4:
print("Yes")
elif len(s)%2:
print("No")
else:
if ("N" in s and "S" in s) or ("W"in s and "E" in s):
print("Yes")
else:
print("No")
|
p02917 | s291432697 | Wrong Answer | import sys
def solve(inp):
N = int(inp.readline().strip())
B = list(map(int, inp.readline().strip().split(' ')))
A = [0 for i in range(N)]
A[N - 1] = B[N - 2]
A[0] = B[0]
n = N - 2
while n >= 1:
A[n] = min(B[n], B[n - 1])
n -= 1
# print(" ".join(map(str, A)))
return sum(A)
def main():
result = solve(sys.stdin)
if result:
print(result)
if __name__ == '__main__':
main()
|
p03035 | s582722089 | Wrong Answer | A,B=map(int,input().split())
if A>=13:
print(B)
elif 6<=B<=12:
print(B//2)
else:
print(0) |
p04011 | s196664843 | Wrong Answer | a=int(input())
b=int(input())
c=int(input())
d=int(input())
print(int((c*a)+d*(b-a))) |
p04011 | s121124425 | Accepted | n = int(input())
k = int(input())
x = int(input())
y = int(input())
ryoukin = 0
if n <= k:
ryoukin = x * n
else:
ryoukin = k * x + (n - k) * y
print(ryoukin) |
p03696 | s034859120 | Accepted | N = int(input())
S_ = input()
s=S_
count = 0
new_left = 0
new_right = 0
for si in s:
if si == '(':
count += 1
else:
count -= 1
if count == -1:
count = 0
new_left += 1
new_right = count
print('(' * new_left + s + ')' * new_right) |
p02688 | s161885547 | Accepted | N, K = map(int, input().split())
A = [0] * N
for i in range(K):
D = int(input())
B = list(map(int, input().split()))
for j in range(D):
A[B[j] - 1] += 1
print(A.count(0))
|
p03555 | s030173713 | Accepted | c_1 = list(input())
c_2 = list(input())
if c_1[0] == c_2[2] and c_1[1] == c_2[1] and c_1[2] == c_2[0]:
print("YES")
else:
print("NO")
|
p03854 | s754787074 | Accepted | s=input().replace("eraser","").replace("erase","").replace("dreamer","").replace("dream","")
if s:
print("NO")
else:
print("YES") |
p02683 | s280006521 | Wrong Answer | from itertools import combinations
n, m, x = map(int, input().split())
def aryadd(ary):
a = []
for i in zip(*ary):
a.append(sum(i))
return a
a = []
for i in range(n):
a.append(list(map(int, input().split())))
ans = 10**10
for i in range(2, n+1):
for j in combinations(a, i):
sm = aryadd(j)
if len(list(filter(lambda y: y >= x, sm[1:]))) >= m:
if ans >= sm[0]:
ans = sm[0]
if ans == 10**10:
print(-1)
else:
print(ans)
|
p02642 | s054881502 | Wrong Answer | N = int(input())
A = sorted(map(int, input().split()), reverse=False)
dp = [0] * (max(A)+1)
for i in range(N):
if dp[A[i]] == 0:
dp[A[i]] = 1
for j in range(i+1, N):
if dp[A[j]] == 0 and A[j] % A[i] == 0:
dp[A[j]] = 2
print(dp.count(1))
|
p02622 | s957767768 | Accepted | S=input()
T=input()
ans=0
for i in range(len(S)):
if(S[i]!=T[i]):
ans+=1
print(ans)
|
p03659 | s443190684 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
cnt = n//2
ans=abs(sum(a[:cnt]) - sum(a[cnt:]))
for i in range(1,cnt):
if ans > abs(sum(a[:cnt+i]) - sum(a[cnt+i:])):
ans = abs(sum(a[:cnt+i]) - sum(a[cnt+i:]))
else:
break
for i in range(1,cnt):
if ans > abs(sum(a[:cnt-i]) - sum(a[cnt-i:])):
ans = abs(sum(a[:cnt-i]) - sum(a[cnt-i:]))
else:
break
print(ans) |
p02720 | s171586435 | Accepted | import queue
target = int(input())
q = queue.Queue()
for i in range(1,10):
q.put(str(i))
for cnt in range(1, target):
num = q.get()
mod = int(num) % 10
if mod == 0:
q.put(num + "0")
q.put(num + "1")
elif mod == 9:
q.put(num + "8")
q.put(num + "9")
else:
q.put(num + str(mod - 1))
q.put(num + str(mod))
q.put(num + str(mod + 1))
print(q.get()) |
p02765 | s572416067 | Wrong Answer | a,b = map(int, input().split())
if a < 10:
c=int(b-100*(10-a))
else:
c=int(b)
print(c)
|
p02724 | s109175141 | Wrong Answer | input_X = int(input())
result_500 = input_X // 500
result_500ureshi = result_500 * 1000
result_5ureshi = (input_X - result_500 * 500) // 5 * 5
print(result_500ureshi)
print(result_5ureshi)
result = int(result_500ureshi + result_5ureshi)
print(result) |
p02606 | s121828805 | Wrong Answer | l, r, d = map(int, input().split())
result=0
for i in range(r-l+1):
if (r+i) % d == 0:
result+=1
print(result)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.