problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03286 | s337064522 | Accepted | n=int(input())
x=""
while n!=0:
x=str(n%2)+x
n=-(n//2)
print(0 if x=="" else x) |
p03000 | s333314904 | Wrong Answer | import itertools
import bisect
n, x = map(int, input().split())
ll = list(map(int, input().split()))
dl = [0] + list(itertools.accumulate(ll))
print(bisect.bisect_right(ll, x)) |
p02552 | s323252879 | Accepted | x = int(input())
if x == 0:
print(1)
else:
print(0) |
p02959 | s032283272 | Accepted | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
total = 0
for i in range(len(B)):
num_of_defeated = min(A[i], B[i])
A[i] -= num_of_defeated
total += num_of_defeated
remainder = B[i] - num_of_defeated
num_of_defeated = min(A[i + 1], remainder)
A[i + 1] -= num_of_defeated
total += num_of_defeated
print(total)
|
p02900 | s247927661 | Accepted | from math import gcd
A, B = map(int, input().split())
d = gcd(A, B)
ans = 1
i = 2
while i <= pow(d, 1/2)+1:
if d%i == 0:
ans += 1
while d%i == 0:
d //= i
i += 1
ans += (d > 1)
print(ans) |
p02676 | s889342694 | Accepted | k = int(input())
s = input()
if len(s) > k:
print(s[0:k] + '...')
else:
print(s)
|
p03073 | s678489628 | Accepted | S = input()
C = ["0","1"]
count1=count2=0
for i in range(len(S)):
# case 1
if S[i] == C[i%2]:
count1+=1
# case 2
if S[i] == C[(i+1)%2]:
count2+=1
print(min([count1, count2])) |
p02717 | s942814936 | Wrong Answer | A,B,C=list(map(int,input().split()))
A,B,C=B,C,A
print(A,B,C) |
p03329 | s510469415 | Accepted | n = int(input())
dp=[0]
#dp[n]を求める
for i in range(1,n+1):
c = []
c.append(dp[i-1]+1)
p6=1
while i >=6**p6:
c.append(dp[i-6**p6]+1)
p6 +=1
p9=1
while i >=9**p9:
c.append(dp[i-9**p9]+1)
p9 +=1
dp.append(min(c))
print(dp[n]) |
p02918 | s844083816 | Accepted | n, k = map(int, input().split())
s = input()
s = "_" + s + "_"
count = 0
for i in range(1, n+1):
if s[i] == s[i-1] == "R" or s[i] == s[i+1] == "L":
count += 1
print(min(n-1, count + k*2)) |
p03379 | s309480931 | Accepted | n=int(input())
X=list(map(int,input().split()))
X_sort=sorted(X)
for i in range(n):
a=X_sort[n//2-1]
b=X_sort[n//2]
if X[i]<=a:
print(b)
else:
print(a) |
p02708 | s569696348 | Accepted | N, K = map(int, input().split())
count = 0
for p in range(K, N+2):
count += p * (N - p + 1) + 1
print(count % (10**9 + 7))
|
p02832 | s198746610 | Accepted | N = int(input())
a = list(map(int,input().split()))
b = N
num = 1
for i in range(N):
if a[i] == num:
num += 1
b -= 1
if b == N:
print(-1)
else:
print(b) |
p02939 | s422752300 | Wrong Answer | s = input()
dp = [0 for _ in range(len(s))]
dp[0] = 1
for i in range(1,len(s)):
if(s[i] != s[i-1]):dp[i] = dp[i-1] + 1
else:
if(i >= 3):dp[i] = dp[i-3] + 2
else:dp[i] = dp[i-1]
print(dp[-1]) |
p03211 | s400424933 | Accepted | S = input()
m = float("inf")
for i in range(len(S)-2):
m = min(m, abs(753 - int(S[i:i+3])))
print(m) |
p02795 | s098268972 | Wrong Answer | ans = "123"
print(ans.replace(input(),"").replace(input(),""))
|
p02613 | s308800109 | Accepted | N=int(input())
d=dict()
for tt in range(N):
s=input()
if s not in d:
d[s]=1
else:
d[s]+=1
for st in ["AC","WA","TLE","RE"]:
if st not in d:
print(st," x ",0)
else:
print(st," x ",d[st]) |
p03705 | s696123122 | Wrong Answer | # A - A+...+B Problem
N, A, B = map(int, input().split())
if A>B or (N==1 and A!=B):
print(0)
else:
print((N-1)*B+A - (N-1)*A+B + 1) |
p03137 | s037507282 | Wrong Answer | def main():
N, M = map(int, input().split())
X = [int(a) for a in input().split()]
X.sort()
dlist = list()
for i in range(M-1):
d = abs(X[i] - X[i+1])
dlist.append(d)
dlist.sort()
print(sum(dlist[:len(dlist) - (N-1)]))
if __name__ == "__main__":
main() |
p02819 | s178858137 | Wrong Answer | X = int(input())
for i in range(X+1, 999999999):
flag = 1
for j in range(2, X):
if i % j == 0:
flag = -12
break
if X == 2:
print(2)
break
elif X == 3:
print(3)
break
elif flag == 1:
print(i)
break |
p03282 | s998220366 | Accepted | import sys
s = input()
n = int(input())
cnt = 0
if n == 1:
print(s[0])
sys.exit()
for i in s:
if i == '1':
cnt += 1
else:
break
if n <= cnt:
print(1)
sys.exit()
for i in s:
if i != '1':
print(i)
sys.exit()
print(1) |
p03371 | s253136676 | Accepted | import sys
a, b, c, x, y = map(int, sys.stdin.readline().split())
if x > y:
a, b = b, a
x, y = y, x
def main():
res = min(c * 2, a + b) * x + min(c * 2, b) * (y - x)
print(res)
if __name__ == '__main__':
main() |
p02847 | s964291726 | Accepted | #a,b = map(int,input().split())
s = str(input())
S = ['SUN','MON','TUE','WED','THU','FRI','SAT']
print(7-S.index(s))
|
p02696 | s199114160 | Accepted | A, B, N = map(int, input().split())
def f(x):
return (A*x)//B - A*(x//B)
if B-1 < N:
print(f(B-1))
else:
print(f(N)) |
p03665 | s783944653 | Wrong Answer | # A - Biscuits
N, P = map(int, input().split())
print(2**N) |
p03623 | s816555986 | Accepted | x, a, b = map(int,input().split())
if abs(x - a) < abs(x - b):
print("A")
else:
print("B") |
p02970 | s196160073 | Wrong Answer | a, b = map(int, input().split())
ans = a // (b * 2 + 1) + 1
print(ans) |
p02829 | s829075071 | Accepted | a = int(input())
b = int(input())
arr = [0] * 4
arr[a] = 1
arr[b] = 1
for i in range(1,4):
if arr[i] == 0:
print(i)
|
p02701 | s035005688 | Accepted | N = int(input())
s = [0] * N
for i in range(N):
s[i] = input()
d = set()
for v in s:
d.add(v)
print(len(d))
|
p02860 | s666861119 | Accepted | import sys
N = int(input())
S = input()
if not ( 1 <= N <= 100 ): sys.exit()
if not S.islower(): sys.exit()
if not ( len(S) == N ): sys.exit()
if N % 2 == 1: print('No'); sys.exit()
print('Yes') if ( S[:N//2] + S[:N//2] == S ) else print('No') |
p02935 | s281687806 | Accepted | n=int(input())
a=sorted(list(map(int,input().split())))
ans=(a[0]+a[1])/2
for i in range(2,len(a)):
ans=(ans+a[i])/2
print(ans) |
p03796 | s466338822 | Accepted | import math
n = int(input())
print(math.factorial(n) % (10 ** 9 + 7)) |
p03719 | s591895178 | Accepted | a,b,c=map(int,input().split())
if c >=a and c <= b:
print("Yes")
else:
print("No") |
p03163 | s558072905 | Accepted | n,w=map(int,input().split())
wv=[]
for i in range(n):
wv.append(tuple(map(int,input().split())))
dp=[[0]*(w+1) for _ in range(n+1)]
for i in range(1,n+1):
wei,val=wv[i-1]
for j in range(1,w+1):
if 0<=j-wei<=w:
dp[i][j]=max(dp[i-1][j], dp[i-1][j-wei]+val)
else:
dp[i][j]=dp[i-1][j]
print(dp[-1][-1]) |
p02802 | s027352603 | Accepted | n, m= map(int, input().split())
flag_ac = [0]*n
cnt_wa = [0]*n
cnt_penalty = 0
for _ in range(m):
p, s = input().split()
if s == "WA":
cnt_wa[int(p)-1] += 1
elif s == "AC" and flag_ac[int(p)-1] == 0:
flag_ac[int(p)-1] = 1
cnt_penalty += cnt_wa[int(p)-1]
print(sum(flag_ac), cnt_penalty) |
p02615 | s416443614 | Accepted | import math
n = int(input())
a = list(map(int,input().split()))
b = sorted(a,reverse=True)
x = math.ceil(len(b)/2)
y = b[:x]
z = sum(y*2)-y[0]
if len(b)%2==1:
print(z-y[-1])
else:
print(z) |
p02547 | s423237843 | Wrong Answer | n = int(input())
pv = []
con = 0
while n > 0:
n -= 1
s = str(input())
d = s.split()
if d[0] == d[1]:
con += 1
else:
pv += [con]
con = 0
pv += [con]
ans = max(pv)
if ans >= 3:
print('Yes')
else:
print('NO') |
p02645 | s228173902 | Accepted | s = input()
if len(s) == 3:
print(s)
exit()
print(s[0:3]) |
p02755 | s151453730 | Wrong Answer | A,B = [int(x) for x in input().split()]
number1 = int(A*100//8)
number2 = int(B*100//10)
if number1//10 == B:
if number2*8//100 == A:
if number1 <= number2:
print(number1)
else:
print(number2)
else:
print(number1)
else:
if number2*8//100 == A:
print(number2) |
p02859 | s057268496 | Wrong Answer | r = int(input("long?"))
a = int(r^2)
print(a) |
p03721 | s465022992 | Accepted | N, K = map(int, input().split())
li = sorted([tuple(map(int, input().split())) for _ in range(N)])
cnt = 0
for a, b in li:
cnt += b
if cnt >= K:
print(a)
break |
p03612 | s647920464 | Wrong Answer | N = int(input())
p = list(map(int,input().split()))
ans = 0
for i in range(N-1):
if p[i] == i+1:
p[i],p[i+1] = p[i+1],p[i]
ans += 1
print(ans) |
p02578 | s810012959 | Accepted | n = int(input())
a = [int(i) for i in input().split()]
c = 0
t = a[0]
for i in a:
if t>i:
b=t-i
c+=b
else:
t=i
print(c) |
p02711 | s543295482 | Accepted | N=input()
if '7' in N:
print('Yes')
else:
print('No') |
p03107 | s206847110 | Wrong Answer | import numpy as np
S = str(input())
r = '01'
b = '10'
count=0
i=0
while i < (len(S)-1):
if r == S[i:i+2]:
S = S.replace(r,'',1)
count+=1
i=0
if b == S[i:i+2]:
S = S.replace(b,'',1)
count+=1
i=0
else:
i+=1
print(int(2*count)) |
p03285 | s160337327 | Wrong Answer | N = int(input())
for i in range(1, N // 4 + 1):
for j in range(1, N // 7 + 1):
if (4 * i) + (7 * j) == N:
print('Yes')
exit()
print('No') |
p03472 | s272875361 | Accepted | import heapq
n, h = map(int, input().split())
hq = []
nmax = 0
for i in range(n):
a, b = map(int,input().split())
nmax = max(nmax, a)
heapq.heappush(hq, -b)
heapq.heappush(hq, -nmax)
ans = 0
while h > 0:
d = -heapq.heappop(hq)
if d == nmax:
ans+=max(0, (h+nmax-1)//nmax)
break
else:
h -= d
ans+=1
print(ans) |
p03449 | s442460888 | Wrong Answer | N = int(input())
A = [list(map(int,input().split())) for _ in range(2)]
ans = []
max = 0
for i in range(1,N):
s = sum(A[0][0:i])+sum(A[1][i-1:N])
if s > max:
max = s
print(max) |
p02682 | s916158569 | Wrong Answer | A,B,C,K=map(int,input().split())
if A+B>=K:
print(A)
else:
print(A*2-K+B)
|
p03705 | s202516656 | Accepted | n, a, b = map(int, input().split())
if n == 0 or b < a or (n == 1 and a != b):
print(0)
elif n == 1 and a == b:
print(1)
else:
print(1+(b-a)*(n-2)) |
p02748 | s809416956 | Accepted | (A, B, M) = (int(x) for x in input().split(' '))
#print(A, B, M)
ai = [int(x) for x in input().split(' ')]
bj = [int(x) for x in input().split(' ')]
ck = []
for k in range(int(M)):
ck.append([int(x) for x in input().split(' ')])
amin = min(ai)
bmin = min(bj)
abmin = amin + bmin
#print(abmin)
for cupon in ck:
ac = ai[cupon[0]-1]
bc = bj[cupon[1]-1]
cost = ac + bc - cupon[2]
# print(cost)
if cost < abmin:
abmin = cost
print(abmin)
|
p03814 | s723202004 | Wrong Answer | s = input()
a = s.find("A")
z = s. find("Z")
print(z - a + 1)
|
p03796 | s577108268 | Accepted | MOD = 1000000007
import math
N = int(input())
print(math.factorial(N)%MOD)
|
p02765 | s523854511 | Accepted | n, r = list(map(int, input().split()))
print(r if n >= 10 else r + (100 * (10 - n))) |
p04019 | s783931320 | Accepted | S = input().strip()
C = {"N":0,"S":0,"E":0,"W":0}
for i in range(len(S)):
C[S[i]] += 1
if (C["N"]*C["S"]>0 or (C["N"]==0 and C["S"]==0)) and (C["E"]*C["W"]>0 or (C["E"]==0 and C["W"]==0)):
print("Yes")
else:
print("No") |
p03795 | s683676389 | Accepted | n = int(input())
x = n * 800
y = n // 15 * 200
print(x - y) |
p03943 | s801732167 | Accepted | a, b, c = map(int, input().split())
if a + b + c == max(a, b, c) * 2:
print("Yes")
else:
print("No") |
p02657 | s030228694 | Accepted | A, B = map(int,input().split())
print(A*B) |
p02582 | s697163125 | Accepted | import re
S = input()
rrr = S.count("RRR")
rr = S.count("RR")
r = S.count("R")
if rrr == 1:
print(3)
elif rr == 1:
print(2)
elif r == 1 or r == 2:
print(1)
else:
print(0) |
p02859 | s233688940 | Accepted | r = int(input())
print(r*r) |
p03665 | s267576726 | Accepted | N,P = map(int, input().split())
A = list(map(int, input().split()))
dp = [[0 for _ in range(2)] for _ in range(N+1)]
dp[0][0] = 1
for i in range(1,N+1):
if A[i-1]%2 == 0:
dp[i][0] = 2*dp[i-1][0]
dp[i][1] = 2*dp[i-1][1]
else:
dp[i][0] = dp[i-1][0] + dp[i-1][1]
dp[i][1] = dp[i-1][0] + dp[i-1][1]
print(dp[N][P]) |
p02713 | s672526284 | Accepted | def gcd(a, b):
while b:
a, b = b, a % b
return a
K = int(input())
A = B = C = [i for i in range(1, K+1)]
L = [gcd(a,b) for a in A for b in B]
cnt = sum([gcd(l,c) for l in L for c in C])
print(cnt) |
p03721 | s345963756 | Accepted | n,k=map(int,input().split())
d={}
l=[]
num=0
for i in range(n):
a,b=map(int,input().split())
try:
d[a]+=b
except:
d[a]=b
l.append(a)
l.sort()
for i in range(len(l)):
num+=d[l[i]]
if num>=k:
print(l[i])
break
|
p03617 | s432355973 | Wrong Answer | Q, H, S, D = map(int, input().split())
N = int(input())
s = [(Q / 0.25, 0.25), (H / 0.5, 0.5), (S, 1.0), (D / 2, 2.0)]
s.sort()
ans = 0
for i in range(4):
ans += (N // s[i][1]) * (s[i][0] * s[i][1])
N %= s[i][1]
print(int(ans))
|
p03345 | s653518900 | Accepted | a, b, c, k = map(int, input().split())
if abs(a - b) > 10 ** 18:
print("Unfair")
else:
if k % 2 == 0:
print(a - b)
else:
print(b - a)
|
p02854 | s675045554 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = (sum(a)%2) * 2
print(ans) |
p03944 | s017056434 | Accepted | w,h,n=map(int,input().split())
p,q,r,s=0,w,0,h
for i in range(n):
x,y,a=map(int,input().split())
if a==1:
p=max(p,x)
elif a==2:
q=min(q,x)
elif a==3:
r=max(r,y)
elif a==4:
s=min(s,y)
print(max(0,q-p)*max(0,s-r))
|
p03803 | s270910816 | Wrong Answer | a,b=map(int,input().split())
if (a>b):
print('Alice')
elif (b>a):
print('Bob')
else:
print('draw')
|
p04030 | s694309459 | Accepted | s = input()
ans = ''
for c in s:
if c == '0':
ans += '0'
if c == '1':
ans += '1'
if c == 'B':
ans = ans[:-1]
print(ans)
|
p03371 | s764467547 | Accepted | A, B, C, X, Y = list(map(int, input().split()))
C *= 2
min_cost = float('inf')
for ab in range(max(X + 1, Y + 1)):
cost = ab * C
cost += A * max(0, X - ab)
cost += B * max(0, Y - ab)
if min_cost > cost:
min_cost = cost
print(min_cost)
|
p02584 | s430220992 | Wrong Answer | x,k,d=map(int,input().split())
n=max(round(k/2-x/(2*d)),0)
print(min(abs(x+(2*n-k)*d),abs((k-2*n)*d-x))) |
p03774 | s315393159 | Wrong Answer | n,m=map(int,input().split())
gakusei=[]
for i in range(n):
gakusei.append(list(map(int,input().split())))
check=[]
for j in range(m):
check.append(list(map(int,input().split())))
for i in range(0,n):
minkyori=10*100
keep=0
for j in range(0,m):
kyori=abs(gakusei[i][0]-check[j][0])+abs(gakusei[i][1]-check[j][1])
if kyori<minkyori:
minkyori=kyori
keep=j
print(keep+1)
|
p02820 | s912341010 | Wrong Answer | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
r1 = []
for j in range(N):
if T[j] == 'r':
r1.append(P)
elif T[j] == 's':
r1.append(R)
else:
r1.append(S)
for i in range(K,N):
if r1[i] == r1[i - K]:
r1[i] = 0
print(sum(r1)) |
p02647 | s438427120 | Wrong Answer | n,k=map(int,input().split(" "))
A=list(map(int,input().split(" ")))
B=[0 for i in range(n)]
for i in range(k):
for j in range(n):
B[j]=0
d=A[j]
mi=j-d
ma=j+d
if mi<=0:
mi=0
if ma>=n:
ma=n-1
while mi<=ma:
B[mi]=B[mi]+1
mi=mi+1
A=B
for i in range(int(len(A))):
print(A[i],end="")
if i!=int(len(A)):
print(" ",end="") |
p03407 | s446378245 | Wrong Answer | A,B,C=map(int,input().split())
if (A+B*2)>=C:
print("Yes")
else:
print("No") |
p03145 | s352922774 | Accepted | l=list(map(int,input().split()))
l.sort()
print(l[0]*l[1]//2) |
p02697 | s009610821 | Accepted | N, M = [int(_) for _ in input().split()]
l = 1
r = N
ans = []
for _ in range(M - M // 2):
ans += [l, r]
l += 1
r -= 1
if (r - l) % 2 == (l + N - r) % 2:
r -= 1
for _ in range(M // 2):
ans += [l, r]
l += 1
r -= 1
ans = ans[:2 * M]
print('\n'.join(f'{a} {b}' for a, b in zip(ans[::2], ans[1::2])))
|
p03289 | s525666552 | Accepted | S = input()
if S[0] == "A":
if (S.count("C") == 1) and (S[2:-1].count("C")==1):
S = S[1:].replace("C", "")
if S.islower():
print("AC")
exit(0)
print("WA") |
p03206 | s406065127 | Accepted | #ABC-115-A
D = int(input())
add_eve = 25-D
print("Christmas"+" Eve"*add_eve) |
p03698 | s660671920 | Accepted | S = input()
count = len(S)
a = 0
for i in range(count):
if S[i] in S[i+1:]:
a = a+1
else:
pass
if a>0:
print("no")
else:
print("yes")
|
p03761 | s628174162 | Wrong Answer | from collections import Counter
n = int(input())
l = [Counter(input()) for _ in range(n)]
ans = ''
c = l[0]
for key, val in c.most_common():
m = val
for i in range(1, n):
m = min(m, l[i][key])
ans += key * m
print(ans)
|
p02988 | s693293576 | Wrong Answer | n=int(input())
p=list(map(int,input().split()))
a=0
for i in range(1,n-1):
if p[i-1]<p[i]<p[i+1]:
a+=1
print(a) |
p03817 | s814343725 | Wrong Answer | x = int(input())-1
ans = 2 * (x // 11)
if x % 11 > 5:
ans += 2
elif 0 < x % 11 and x % 11 < 6:
ans += 1
print(ans) |
p02787 | s391387456 | Wrong Answer | import sys
def input():
return sys.stdin.readline()[:-1]
H,N=map(int,input().split())
l=[1000000000]*(H+1)
l[0]=0
for i in range(N):
A,B=map(int,input().split())
for j in range(H):
if j+A<=H and l[j]+B<l[j+A]:
l[j+A]=l[j]+B
t=1000000000
for j in range(H,-1,-1):
if l[j]>t:
l[j]=t
else:
t=l[j]
print(l[-1]) |
p03109 | s634022226 | Wrong Answer | s = int(input().replace('/',''))
print('Heisei') if s <= 2019430 else('TBD') |
p03030 | s241122013 | Accepted | from operator import itemgetter
N=int(input())
hako=[]
for i in range(N):
A,B=input().split()
hako.append([A,int(B)*-1])
kari=hako.copy()
#print(kari)
hako.sort()
#print(hako)
for i in range(N):
print(kari.index(hako[i])+1)
|
p02767 | s528114027 | Accepted | import math
N = int(input())
X = list(map(int, input().split()))
sX = sum(X)
kouho1 = math.ceil(sX / N)
kouho2 = sX // N
kouho3 = math.floor(sX / N)
ans1, ans2, ans3 = 0, 0, 0
for p in X:
ans1 += (p - kouho1) ** 2
ans2 += (p - kouho2) ** 2
ans3 += (p - kouho3) ** 2
print(min(ans1, ans2, ans3)) |
p02596 | s278102659 | Accepted | # C - Repsept
def get_mod(prev_mod):
global K
return (prev_mod * 10 + 7) % K
K = int(input())
mod = 0
count = 0
mods = set()
while True:
mod = get_mod(mod)
count += 1
if mod == 0:
print(count)
break
else:
if mod in mods:
print(-1)
break
else:
mods.add(mod) |
p02689 | s642112930 | Accepted | N, M = map(int, input().split())
H = list(map(int, input().split()))
adj = [list() for _ in range(N)] # 頂点の個数
for _ in range(M):
A, B = map(int, input().split())
A -= 1
B -= 1
adj[A].append(B)
adj[B].append(A)
def is_higher(i):
for j in adj[i]:
if H[i] <= H[j]:
return False
return True
cnt = 0
for i in range(N):
if is_higher(i):
cnt += 1
print(cnt)
|
p02629 | s995951682 | Wrong Answer | n = int(input())
c = ord("a")
l = ""
while not n < 26:
b = n//26
a = n-26*b
n = b
l = l+chr(c+a-1)
l = l+chr(c+n-1)
print(l[::-1])
|
p02909 | s535479638 | Accepted | today = input()
if today == 'Sunny':
print('Cloudy')
elif today == 'Cloudy':
print('Rainy')
else:
print('Sunny') |
p03161 | s032440759 | Wrong Answer | n,k = map(int,input().split())
h = list(map(int,input().split()))
# dp[i] = 足場i(0~n-1)に到着するコストの最小値
dp = [10*18]*(n)
dp[0] = 0
for i in range(n) :
for j in range(1,k+1) :
if i+j >= n :
continue
dp[i+j] = min(dp[i+j],dp[i]+abs(h[i]-h[i+j]))
print(dp[n-1]) |
p02630 | s042547775 | Accepted | import numpy as np
n = int(input())
a = input().split()
np_a=np.array(a, dtype=int)
sum=np.int(sum(np_a))
count=np.zeros(100001, dtype='int64')
for i in range(0,n):
count[np_a[i]]+= 1
q = int(input())
for i in range(0,q):
b, c= map(int, input().split())
sum=sum+(c-b)*count[b]
count[c]=count[c]+count[b]
count[b]=0
print (sum)
|
p04020 | s088590420 | Wrong Answer | import sys
stdin = sys.stdin
import itertools
mod = 10**9 + 7
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
N = ni()
A = list()
for _ in range(N):
A.append(ni())
cnt = 0
for i in range(N-1):
ccnt = (A[i] + A[i+1]) //2
A[i+1] = max(0, A[i+1] - ccnt*2 - A[i])
A[i] = max(0, A[i] - ccnt*2)
cnt += ccnt
print(cnt) |
p02729 | s698083332 | Accepted | a,b=map(int,input().split())
n=(a*(a-1))//2
m=(b*(b-1))//2
if b<2 and a<2:
print(0)
elif b<2:
print(n)
else:
print(n+m)
|
p03282 | s015287894 | Accepted | def main():
s = input()
k = int(input())
m = 0
ans = ""
for i in range(len(s)):
if s[i] != "1":
m = i+1
ans = s[i]
break
if k < m:
print(1)
elif m == 0:
print(1)
else:
print(int(ans))
if __name__ == "__main__":
main() |
p02880 | s479890292 | Accepted | a=int(input())
for i in range(1,10):
if a%i==0 and a//i<10:
print("Yes")
exit()
print("No")
|
p03328 | s132227723 | Wrong Answer | def main():
a,b = map(int, input().split())
sum = 0
for height in range(1,999):
sum += height
if b-a == height:
print(sum-b)
break;
if __name__ == "__main__":
main() |
p03910 | s032840754 | Accepted | N=int(input())
S=0
i=0
while S<N:
i+=1
S+=i
T=set()
for a in range(i,0,-1):
if N>=a:
T.add(a)
N-=a
print("\n".join(map(str,T)))
|
p03951 | s268665096 | Wrong Answer | n = int(input())
s = set(input())
t = set(input())
print(n + n - len(s & t))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.