problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03062 | s209956249 | Accepted | n=int(input())
a=list(map(int,input().split()))
cnt=0
for i in range(n):
if a[i]<0:
cnt+=1
if min(a)>=0:
print(sum(a))
exit()
b=[abs(a[i]) for i in range(n)]
s=sum(b)
if cnt%2==0:
print(s)
exit()
ans=-10**18
for i in range(n):
ans=max(ans,s-2*b[i])
print(ans)
|
p02714 | s875949843 | Wrong Answer | n = int(input())
s = str(input())
cnt=0
for i in range(n):
for j in range(i+1,n):
for k in range(j+1,n):
if s[i]!=s[j]!=s[k]and j-i!=k-j:
cnt+=1
print(cnt) |
p02627 | s948016408 | Accepted | s = input()
if 'a'<= s <= 'z':
print('a')
else:
print('A')
|
p02602 | s243611048 | Accepted | import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n,k = map(int,readline().split())
lst1 = list(map(int,readline().split()))
for i in range(n-k):
if lst1[i] >= lst1[i+k]:
print("No")
else:
print("Yes") |
p02973 | s908112457 | Wrong Answer | import heapq
import bisect
def main():
N = int(input())
l = []
for i in range(N):
a = int(input())
if len(l) == 0 or a <= l[0]:
heapq.heappush(l, a)
else:
ind = bisect.bisect_right(l, a)
l[ind-1] = a
print(len(l))
if __name__ == "__main__":
main()
|
p03817 | s888238574 | Wrong Answer | x = int(input())
x,y=divmod(x, 11)
if y > 6:
print(x+2)
elif y > 0:
print(x+1)
else:
print(x)
|
p03544 | s508449909 | Accepted | A=int(input())
b0=2
b1=1
save=0
for i in range(A-1):
save=b1
b1=b0+b1
b0=save
print(b1) |
p02771 | s491284402 | Accepted | A, B, C = map(int, input().split())
if (A == B and B == C) or (A != B and B != C and C != A):
print('No')
else:
print('Yes') |
p02835 | s258178562 | Accepted | a=list(map(int,input().split()))
al=sum(a)
if al <=21:
print("win")
else:
print("bust") |
p02859 | s220038519 | Wrong Answer |
def main():
num = input()
return num*num |
p03324 | s905217922 | Accepted | d, n = map(int, input().split())
if n == 100:
print(100 ** d * (n+1))
exit()
print(100 ** d * n)
|
p03799 | s317335239 | Accepted | n, m = map(int, open(0).read().split())
if n >= m//2:
print(m//2)
else:
print(n + (m-2*n)//4) |
p02582 | s824358951 | Accepted | s = input()
ans = 0
for r in s:
if r == 'R':
ans += 1
if ans == 2 and s == 'RSR':
print(1)
else:
print(ans) |
p02953 | s461285636 | Wrong Answer | n = int(input())
h = list(map(int, input().split()))
for i in range(1,n):
if h[i-1]-h[i]>0:
print('No')
exit()
elif h[i-1]-h[i] == -1:
h[i] -= 1
print('Yes')
|
p03821 | s828903809 | Accepted | n=int(input())
ans=0
a=[]
for i in range(n):
a.append(list(map(int,input().split())))
for i in reversed(range(n)):
if a[i][1] != 1 and a[i][0] != 0:
a[i][0] += ans
if a[i][0] % a[i][1] != 0:
ans += a[i][1] - a[i][0] % a[i][1]
print(ans) |
p03474 | s289371870 | Accepted | a,b=map(int,input().split())
S=input()
for i in range(len(S)):
if i==a:
if S[i]!="-":
print("No")
break
else:
try:
Si = int(S[i])
except:
print("No")
break
else:
print("Yes") |
p03795 | s318210278 | Wrong Answer | a = int(input())
ans = a*800 - (a%15)*200
print(ans) |
p02693 | s590189679 | Accepted | k=int(input())
a,b=map(int,input().split())
n=1
while k*n<=b:
n+=1
print('OK' if a<=(n-1)*k<=b else 'NG') |
p02743 | s527293749 | Accepted | from math import sqrt
a,b,c=map(int,input().split())
if (c-a-b)>0 and 4*a*b<(c-a-b)*(c-a-b):
print("Yes")
else:
print("No")
|
p03163 | s086552633 | Accepted | N, W = map(int, input().split())
wv = [tuple(map(int, input().split()))for _ in range(N)]
dp = [[0]*(W+1) for _ in range(N+1)]
for i in range(N):
for j in range(W):
w, v = wv[i]
if N < i+1:
continue
dp[i+1][j] = max(dp[i+1][j], dp[i][j])
if W < j+w:
continue
dp[i+1][j+w] = max(dp[i][j+w], dp[i][j]+v)
print(dp[-1][-1])
|
p02700 | s859040561 | Accepted | a,b,c,d = map(int,input().split())
import math
if math.ceil(c/b)<=math.ceil(a/d):
print('Yes')
else:
print('No') |
p03145 | s049727148 | Accepted | a,b,c = map(int,input().split())
print(a * b // 2) |
p03329 | s869069148 | Accepted | n = int(input())
dp = [10**6 for _ in range(10**6)]
dp[0] = 0
for i in range(n):
j6 = 1
while j6 <= n:
dp[i+j6] = min(dp[i+j6],dp[i]+1)
j6 *= 6
j9 = 1
while j9 <= n:
dp[i+j9] = min(dp[i+j9],dp[i]+1)
j9 *= 9
print(dp[n]) |
p02689 | s633157633 | Accepted | n, m = map(int, input().split())
h = list(map(int, input().split()))
a = []
b = []
for i in range(m):
x = list(map(int, input().split()))
a.append(x[0])
b.append(x[1])
ans = [True for i in range(n)]
for x, y in zip(a, b):
if h[x-1] < h[y-1]:
ans[x-1] = False
elif h[x-1] > h[y-1]:
ans[y-1] = False
elif h[x-1] == h[y-1]:
ans[x-1] = False
ans[y-1] = False
print(ans.count(True))
|
p02761 | s215223091 | Wrong Answer | N, M = map(int, input().split())
hints = []
for _ in range(M):
a, b = map(int, input().split())
hints.append((a, b))
def solve(n, hints):
for i in range(10 ** (N + 1)):
s = str(i)
if all(len(s) == N and s[hint[0] - 1] == str(hint[1]) for hint in hints):
return i
return -1
print(solve(N, hints)) |
p03017 | s920805057 | Accepted | n, a, b, c, d = map(int, input().split())
s = input()
print('No' if ('##' in s[a-1:c]) or ('##' in s[b-1:d]) or (c > d and '...' not in s[b-2:d+1]) else 'Yes') |
p03069 | s079954856 | Accepted | n=int(input())
s=list(input())
w=s.count('.')
if s[0]=='.':
sm=1
else:
sm=0
def change(y):
total=(y+1-sm)+(w-sm)
return total
mn=change(0)
for i in range(1,n):
if s[i]=='.':
sm += 1
mn=min(mn,change(i))
mn=min(mn,w)
print(mn) |
p03160 | s747431980 | Accepted | n = int(input())
h = list(map(int,input().split()))
dp = [0,abs(h[0]-h[1])]
for i in range(2,n):
dp.append(min(dp[i-2]+abs(h[i]-h[i-2]),dp[i-1]+abs(h[i]-h[i-1])))
print(dp[-1]) |
p02759 | s722803419 | Accepted | N = int(input())
if N % 2 == 0:
print(N//2)
else:
print((N//2)+1)
|
p02814 | s153693992 | Wrong Answer | n,m = map(int,input().split())
a = list(map(int,input().split()))
now = 1
from fractions import gcd
def lcm(x, y):
return (x * y) // gcd(x, y)
for i in a:
now = lcm(now,i//2)
print(m//now-(m//now)//2) |
p02554 | s205145092 | Accepted | N = int(input())
ans = (10 ** N - 2 * 9 ** N + 8 ** N) % (10 ** 9 + 7)
print(int(ans)) |
p02982 | s604375353 | Accepted | from math import sqrt
N, D = [int(i) for i in input().split()]
XS = [list(int(i) for i in input().split()) for _ in range(N)]
cnt = 0
for i in range(N):
for j in range(i+1, N):
if sqrt(sum((y - z) ** 2 for y, z in zip(XS[i], XS[j]))).is_integer():
cnt += 1
print(cnt)
|
p02681 | s805184258 | Accepted | S = input()
T = input()
if len(S) + 1 == len(T) and T.startswith(S):
print('Yes')
else:
print('No')
|
p03760 | s143482947 | Accepted | O=input()
E=input()
p=""
if len(O)==len(E):
for i in range(len(O)):
p+=O[i]
p+=E[i]
elif len(O)>len(E):
for i in range(len(O)-1):
p+=O[i]
p+=E[i]
p+=O[-1]
print(p) |
p03723 | s399911746 | Accepted | A,B,C=map(int,input().split())
count=0
if A==B==C and A%2==0:
print(-1)
exit()
while A%2==0 and B%2==0 and C%2==0:
A,B,C=B//2+C//2,A//2+C//2,B//2+C//2
count+=1
print(count)
|
p02658 | s814792058 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
count = 1
l = 0
for i in a:
count *= i
if count > 1000000000000000000:
l = -1
break
if l == 0:
print(count)
else:
print(-1)
|
p02719 | s862055803 | Accepted | #!python3
iim = lambda: map(int, input().rstrip().split())
def resolve():
N, K = iim()
ans = N % K
print(min(ans, K - ans))
if __name__ == "__main__":
resolve()
|
p03379 | s793719207 | Wrong Answer | import statistics
n = int(input())
X = list(map(int, input().split()))
med = sorted(X)[n//2-1]
X_ = sorted(X)
X_.remove(med)
for i in range(n-1):
if X_[i]>=med:
med_2 = X_[i]
break
for i in range(n):
if X[i]>med:
print(med)
elif X[i]==med:
print(med_2)
else:
print(med_2) |
p02693 | s332946874 | Wrong Answer | k = int(input())
n = 0
a,b = map(int,input().split())
while True:
n += k
if n >= a and n >= b:
print("OK")
break
if n > b:
print("NG")
break |
p02970 | s276815039 | Accepted | N, D = map(int, input().split())
print(-(-N // (D * 2 + 1))) |
p02697 | s752688165 | Accepted | N,M = map(int,input().split())
if N % 2 == 1:
for i in range(M):
print(i+1,N-i)
else: #こっちに問題あり
for i in range(M):
if i<N//4:
print(i+1,N-i)
else:
print(i+1,N-i-1) |
p03107 | s383140007 | Wrong Answer | S=input()
num0=0
num1=1
for i in range(len(S)):
if S[i]=='0':
num0+=1
else:
num1+=1
print(2*min(num0,num1)) |
p02725 | s080135224 | Wrong Answer | K,N=map(int,input().split())
A=list(map(int,input().split()))
ans=0
ans+=min(abs(A[0]-A[-1]),abs(A[0]-A[1]))
for i in range(1,N-1):
ans+=min(abs(A[i-1]-A[i]),abs(A[i]-A[i+1]))
print(ans) |
p02817 | s148196014 | Accepted | #!/usr/bin/env python3
S = input().split(" ")
print(S[1] + S[0]) |
p03624 | s723741536 | Wrong Answer | def main():
s = list(input())
s = sorted(set(s))
ans = 'None'
if 'a' not in s:
ans = 'a'
print(ans)
exit()
for i in range(len(s)-1):
if s[i] == 'z':
break
if ord(s[i])+1 != ord(s[i+1]):
ans = chr(ord(s[i])+1)
break
print(ans)
if __name__ == "__main__":
main()
|
p03243 | s329745015 | Accepted | a=[111,222,333,444,555,666,777,888,999]
i=0
n=int(input())
while a[i]<n:
i=i+1
print(a[i])
|
p03493 | s382015151 | Wrong Answer | arr = map(int,input().split())
print(sum(arr)) |
p03106 | s763997015 | Accepted | a, b, k = map(int, input().split())
com_dev = [1]
for i in range(2, 101):
if a % i == 0 and b % i == 0:
com_dev.append(i)
print(com_dev[len(com_dev) - k]) |
p02862 | s606349123 | Accepted | #17:23
x,y = map(int,input().split())
if (x+y) % 3 != 0:
print(0)
elif x*2 < y or y*2 < x:
print(0)
else:
a = (x + y) // 3
b = y - a
mod = 10 ** 9 + 7
def inv(x):
y = 1
while x != 1:
y *= mod // x + 1
y %= mod
x -= mod % x
return y
ans = 1
for i in range(b):
ans *= a - i
ans %= mod
ans *= inv(b-i)
ans %= mod
print(ans) |
p02556 | s719221024 | Accepted | import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
N = I()
A,B = [],[] # x+y,x-y たちのリスト
for i in range(N):
x,y = MI()
A.append(x+y)
B.append(x-y)
print(max(max(A)-min(A),max(B)-min(B)))
|
p02615 | s524924821 | Accepted | def solve(A,N):
A.sort(reverse = True)
ans = A[0]
if N % 2 == 0:
pt = N // 2 - 1
for i in range(1,pt+1):
ans += (2 * A[i])
else:
pt = (N-1) // 2
for i in range(1,pt):
ans += (2 * A[i])
ans += A[pt]
return ans
def main():
N = int(input())
A = list(map(int,input().split()))
print(solve(A,N))
if __name__ == "__main__":
main()
|
p02629 | s658259835 | Wrong Answer | import string
Al = string.ascii_lowercase
N = int(input())
S = 0
for i in range(1,16):
S += 26**i
if N < S:
maxi = i
break
Answer = []
for i in range(maxi):
j = maxi - (i+1)
mo = N//(26**j)
Answer.append(mo)
N = N-(26**j)*mo
A = str()
for k in range(len(Answer)):
A = A + (Al[Answer[k]-1])
print(A) |
p04033 | s932257081 | Wrong Answer | a,b = map(int, input().split())
if a > 0 and b > 0: ans = "Positive"
elif a < 0 and b < 0:
if (b-a+1)%2 != 0: ans = "Negative"
else: ans = "Positive"
else: ans = "zero"
print(ans) |
p03665 | s251018927 | Accepted | import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
N, P = map(int, input().split())
A = list(map(int, input().split()))
even=0
odd=0
for i in range(N):
if A[i] % 2==0:
even+=1
odd=N-even
if odd==0:
print(2**N if P==0 else 0)
else:
print(2**(N-1))
resolve() |
p03339 | s269082399 | Accepted | N = int(input())
S = input()
oder = N
l = [0 for _ in range(N)]
r = [0 for i in range(N)]
for i in range(1, N):
l[i] = l[i-1] + (S[i-1] == 'W')
r[-i-1] = r[-i] + (S[-i] == 'E')
for i in range(N):
oder = min(oder, l[i]+r[i])
print(oder)
|
p03211 | s762413363 | Accepted | #!/usr/bin/env python3
s = str(input())
ans = 999
for i in range(len(s)-2):
num = int(s[i:i+3])
ans = min(ans, abs(num-753))
print(ans)
|
p03910 | s445512488 | Accepted | num = 0
counter = 1
N = int(input())
while num < N:
num += counter
counter += 1
diff = num - N
for i in range(1, counter):
if i != diff:
print(i)
|
p02600 | s413625983 | Wrong Answer | x = int(input())
if x >= 400 and x <= 599:
s = 8
elif x >= 600 and x <= 799:
s = 7
elif x >= 800 and x <= 999:
s = 6
elif x >= 1000 and x <= 1199:
s = 5
elif x >= 1200 and x <= 1399:
s = 4
elif x >= 1400 and x <= 1599:
s = 3
elif x >= 1600 and x <= 1799:
s = 2
else:
s = 1 |
p02548 | s830540097 | Accepted | N = int(input())
ans = 0
for n in range(1,N):
ans += int((N-1)/n)
print(ans) |
p03543 | s830395535 | Accepted | # A - Good Integer
# https://atcoder.jp/contests/abc079/tasks/abc079_a
s = input()
if len(set(s[:3])) == 1 or len(set(s[1:])) == 1:
print('Yes')
else:
print('No')
|
p02899 | s821505010 | Accepted | n = int(input())
ls = list(map(int,input().split()))
ls2 = [0 for i in range(n)]
for j in range(n):
a = ls[j]
#aは出席番号j+1番目の順位
ls2[a - 1] = j + 1
for k in range(n):
print(ls2[k], end = " ")
|
p02724 | s370718081 | Accepted | x=int(input())
a=x//500
b=x%500
c=b//5
print(1000*a+5*c) |
p03038 | s060360542 | Wrong Answer | import heapq
N, M = map(int, input().split())
A = [int(a) * (-1) for a in input().split()]
for _ in range(M):
B, C = map(int, input().split())
tmp = [C * (-1)] * B
A.extend(tmp)
print(A)
heapq.heapify(A)
ans = 0
for _ in range(N):
ans += heapq.heappop(A)
print(ans * (-1)) |
p04029 | s861688749 | Accepted | x = int(input())
print(int((1+x)*x/2))
|
p02613 | s590360950 | Wrong Answer | a=int(input())
b=[input() for i in range(a)]
c=b.count("AC")
d=b.count("WA")
e=b.count("TLE")
f=b.count("RE")
print("AC × {}".format(c))
print("WA × {}".format(d))
print("TLE × {}".format(e))
print("RE × {}".format(f)) |
p02939 | s059815434 | Accepted | s = input()
a = b = ''
ans = 0
for i in s:
b += i
if a != b:
ans += 1
a = b
b = ''
print(ans)
|
p02713 | s506909553 | Wrong Answer | import math
K = int(input())
s = 0
def gcd(a, b):
while b != 0:
a, b = b, a % b
return a
for i in range(1, K+1):
for j in range(i, K+1):
for k in range(j, K+1):
a, b, c = sorted([i, j, k])
s += gcd(a, gcd(b, c))
print(s)
|
p02939 | s955018475 | Accepted | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
S = input()
L = len(S)
pre = ''
s = ''
ans = 0
for i in range(L):
s += S[i]
if s!=pre:
ans += 1
pre = s
s = ''
print(ans)
if __name__ == '__main__':
main() |
p02748 | s857279805 | Accepted | s = list(map(int, input().split(" ")))
a = s[0]
b = s[1]
m = s[2]
a_l = list(map(int, input().split(" ")))
b_l = list(map(int, input().split(" ")))
ans = min(a_l) + min(b_l)
for i in range(m):
x = list(map(int, input().split(" ")))
if ans > (a_l[x[0] - 1] + b_l[x[1] -1] - x[2]):
ans = a_l[x[0] -1] + b_l[x[1] -1] - x[2]
print(ans) |
p03696 | s395386692 | Accepted | n,s,sj=int(input()),input(),''.join
l=sum([1 if c==')' else 0 for c in s])
r=n-l
t=s[:]
while True:
for i in range(len(t)-1):
if t[i:i+2]=='()':
t,l,r=t[:i]+t[i+2:],l-1,r-1
break
else:break
print(sj(['(']*l)+s+sj([')']*r)) |
p02982 | s107768302 | Accepted | import itertools
N,D=map(int,input().split())
X=[list(map(int,input().split())) for i in range(N)]
cmb=list(itertools.combinations(range(N),2))
ans=int(0)
for j in range(len(cmb)):
xdis=0
for k in range(D):
xdis+=(X[cmb[j][0]][k]-X[cmb[j][1]][k])**2
xdis=xdis**0.5
if xdis-int(xdis)==0:
ans+=1
else:
ans+=0
print(ans) |
p03220 | s219038234 | Accepted | N = int(input())
T,A = map(int,input().split())
H = list(map(int,input().split()))
for i in range(N):
H[i] = abs(T - H[i] * 0.006 - A)
print(H.index(min(H))+1) |
p03994 | s269462162 | Accepted | S=list(input())
k=int(input())
for i in range(len(S)):
s=S[i]
if s=="a":continue
x=123-ord(s)
#print(s,x,ord("z"))
if k>=x:
k-=x
S[i]="a"
else:continue
k%=26
for i in range(len(S)):
if S[-1-i]!="a":
S[-1-i]=chr((ord(S[-1-i])-97+k%26)+97)
print("".join(S));break
else:
S[-1]=chr((ord(S[-1])-97+k%26)+97)
print("".join(S)) |
p02582 | s143015030 | Accepted | s=input()
cnt=0
for i in range(3):
if(s[i]=='R'):
cnt+=1
if(cnt!=2):
print(cnt)
elif(s=="RSR"):
print(1)
else:
print(2) |
p02556 | s360056663 | Accepted | n = int(input())
pointx = []
pointy = []
for i in range(n):
x, y = map(int, input().split())
pointx.append(x-y)
pointy.append(x+y)
print(max(max(pointx)-min(pointx),(max(pointy)-min(pointy))))
|
p03799 | s457595174 | Accepted | n, m = map(int, input().split())
if m >= 2*n:
ans = n
ans += (m-2*n)//4
else:
ans = m//2
print(ans)
|
p03767 | s866081759 | Accepted | import collections
n = int(input())
*a, = map(int, input().split())
a.sort()
a = collections.deque(a)
ans = 0
while n:
a.popleft()
a.pop()
ans += a.pop()
n -= 1
print(ans) |
p02785 | s764092852 | Wrong Answer | n, k = map(int, input().split())
h = list(map(int, input().split()))
h = sorted(h)
# print(h[:-1], h)
if k > len(h):
print(0)
else:
if k != 0:
del h[-k]
print(sum(h)) |
p02911 | s181550948 | Accepted | N, K, Q = map(int, input().split())
count = [0] * N
for _ in range(Q):
count[int(input())-1] += 1
for c in count:
if K - (Q - c) > 0:
print('Yes')
else:
print('No') |
p02717 | s147762920 | Wrong Answer | x,y,z=map(int,input().split())
print(z,y,x)
|
p03457 | s429053242 | Wrong Answer | n = int(input())
for _ in range(n):
t,x,y = map(int,input().split())
if (t%2 != (x + y)%2) or (t%2 != (x + y)%2):
print("No")
exit()
elif t < (x + y):
print("No")
exit()
else:
continue
print("Yes") |
p03680 | s224500234 | Accepted | N = int(input())
a = [int(input()) for _ in range(N)]
num = 1
cnt = 0
for i in range(200000):
num = a[num-1]
cnt += 1
if num == 2:
print(cnt)
exit()
print(-1) |
p03035 | s556072538 | Accepted | A,B = map(int,input().split())
L = B // 2
if A >= 13:
print(B)
elif A <= 12 and A >= 6:
print(L)
elif A <= 6:
print(0) |
p02663 | s912483157 | Wrong Answer | from math import ceil
h1, m1, h2, m2, k = map(int, input().split())
diff = int((h2-h1)*60 + (m2-m1))
print(max(0, int(k*(ceil(diff/k)-1)))) |
p02682 | s473787092 | Wrong Answer | A,B,C,K=map(int,input().split())
n=0
if K>=A :
K=K-A
n+=A
if K>=B :
K=K-B
if K>=C :
K=K-C
n-=C
else :
K=C-K
n-=C-K
else :
K=B-K
else :
K=A-K
n+=K
print(n) |
p03994 | s890527171 | Accepted | X='abcdefghijklmnopqrstuvwxyz'*2
S=input()
k=int(input())
N=[]
for s in S:
if s=='a':
N.append(0)
else:
N.append(26-X.index(s))
ans=''
for i in range(len(S)):
if N[i]<=k :
k-=N[i]
ans+='a'
else:
ans+=S[i]
ans=ans[:-1]+X[X.index(ans[-1])+k%26]
print(ans) |
p03457 | s312199400 | Accepted | n = int(input())
px = py = pt = 0
for i in range(n):
t,x,y = map(int,input().split())
d = abs(x - px) + abs(y - py)
nt = t - pt
if nt < d or d%2 != nt%2:
print("No")
exit()
px = x
py = y
pt = t
print("Yes") |
p02630 | s742122973 | Accepted | n = int(input())
a = [int(i) for i in input().split()]
q = int(input())
num = [0] * 100010
b = [0] * q
c = [0] * q
for i in range(q):
b[i], c[i] = map(int, input().split())
for i in a:
num[i] += 1
s = sum(a)
for i in range(q):
s += (c[i]-b[i])*num[b[i]]
num[c[i]] += num[b[i]]
num[b[i]] = 0
print(s) |
p03474 | s810197241 | Wrong Answer | a,b = map(int,input().split())
s = input()
if s[a:a+1] == '-' and s[0:a].isdecimal() and s[a+1:a+b+1]:
print('Yes')
else:
print('No')
#print(s[0:a])
#print(s[a+1:a+b+1]) |
p03061 | s527928209 | Accepted | from fractions import gcd
N = int(input())
A = list(map(int, input().split()))
L = [0]*(N+2)
R = [0]*(N+2)
for i in range(N):
L[i+1] = gcd(L[i], A[i])
for i in range(N, 0, -1):
R[i] = gcd(R[i+1], A[i-1])
ans = 1
for i in range(1, N+1):
ans = max(ans, gcd(L[i-1], R[i+1]))
print(ans) |
p02754 | s928561615 | Wrong Answer | n, a, b = map(int, input().split())
ans = []
for i in range(10000):
for j in range(a):
ans.append('b')
for k in range(b):
ans.append('r')
hints = ans[0:n]
count = 0
for l in hints:
if l == 'b':
count += 1
print(count) |
p03107 | s049393352 | Wrong Answer | import sys
def main():
S = list(map(int, input()))
o = S.count(0)
l = S.count(1)
print(o,l)
print(min(o, l) * 2)
main() |
p03011 | s421295581 | Wrong Answer | P, Q, R = map(int, input().split())
list_m = [P + Q,R + Q,P + R,Q + R,R + P,Q + P]
min = 100
for i in range(len(list_m)):
if min > int(list_m[i]):
min = list_m[i]
print(min) |
p03001 | s622825323 | Wrong Answer | W, H, x, y = map(int, input().split())
ans = 0
count = 0
if x == y:
ans = min(x*H, (W-x)*H)
count = 1
elif x < y:
ans = min(x*H, (W-x)*H)
else:
ans = min(y*W, (H-y)*W)
print(ans, count) |
p02951 | s944052472 | Wrong Answer | a,b,c=map(int,input().split())
box=a-b
c-=box
ans=min(box,0)
print(ans) |
p02785 | s088267955 | Wrong Answer | '''N, K = map(int, input().split())
H = list(map(int, input().split()))
for i in range(K):
if len(H)!=0:
H.remove(max(H))
#print(H)
else:
#print(0)
break
print(sum(H))'''
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
print(sum(H[K+1:]))
|
p03457 | s613667204 | Accepted | n=int(input())
s=v=w=0
for _ in range(n):
t,x,y=map(int,input().split())
dt,dx,dy=t-s,x-v,y-w
if (dt+dx+dy)%2>0 or dt<abs(dx)+abs(dy): print('No'); break
s,v,w=t,x,y
else: print('Yes') |
p02747 | s314415514 | Wrong Answer | S=input()
N=len(S)
n1=0
n2=0
for i in range(N):
if S[i]=="h":
n1=n1+1
if S[i]=="i":
n2=n2+1
if (n1==n2)and(n1+n2==N):
print("Yes")
else:
print("No") |
p03386 | s274471273 | Accepted | A, B, K = map(int, input().split())
X = []
for x in range(K):
if B >= A+x or B-x >= A:
X.append(A+x)
X.append(B-x)
sortX = sorted(set(X))
# print(" ".join(sortX))
for x in sortX:
print(x)
|
p03037 | s718242833 | Wrong Answer | N, M = [int(a) for a in input().split()]
L = []
R = []
for _ in range(M):
l, r = [int(a) for a in input().split()]
L.append(l)
R.append(r)
mingate = max(L)
maxgate = min(R)
print(maxgate - mingate + 1) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.