problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03221 | s674012200 | Accepted | import sys
from collections import defaultdict
(n, m), *q = [[*map(int, i.split())] for i in sys.stdin]
d = defaultdict(list)
for k, v in q:
d[k].append(v)
c = defaultdict(dict)
for k, v in d.items():
for i, j in enumerate(sorted(v)):
c[k][j] = i + 1
for p, y in q:
print("{:0>6}{:0>6}".format(p, c[p][y]))
|
p03087 | s259962200 | Accepted | import itertools
N, Q = map(int, input().split())
S = input()
cnt = [0]*N
for i in range(N):
if i >= N-1:
continue
if S[i] == "A":
if S[i+1] == "C":
cnt[i+1] = 1
acum = list(itertools.accumulate(cnt))
for j in range(Q):
l, r = map(int, input().split())
print(acum[r-1]-acum[l-1]) |
p04020 | s575554558 | Accepted | n = int(input())
c = 0
b = 0
for _ in range(n):
a = int(input())
if a == 0:
b = 0
continue
a += b
c += a // 2
b = a % 2
print(c) |
p02775 | s295120057 | Accepted | l=[0]+[int(i) for i in input()]
l.reverse()
su=0
for i in range(len(l)):
if l[i]>5:
l[i]=10-l[i]
l[i+1]+=1
elif l[i]==5 and l[i+1]>4:
l[i+1]+=1
su+=l[i]
print(su) |
p03160 | s576536680 | Wrong Answer | n=int(input())
h=list(map(int,input().split()))
c=0
i=0
while i<n-1:
if i+1==n-1:
c+=abs(h[i+1]-h[i])
i+=1
elif abs(h[i+2]-h[i])<=abs(h[i+2]-h[i+1])-abs(h[i+1]-h[i]):
c+=abs(h[i+2]-h[i])
i+=2
else:
c+=abs(h[i+1]-h[i])
i+=1
print(c) |
p03910 | s189781122 | Wrong Answer | # coding: utf-8
N = int(input())
if N == 1:
print(1)
exit()
ans = 0
for i in range(1, N+1):
ans += i
if ans >= N:
end = i
break
res = ans - N
for i in range(1, end):
if i != res:
print(i) |
p02555 | s513508174 | Accepted | N = int(input())
MOD_CONST = 10 ** 9 + 7
if N <= 2:
print(0)
exit()
res = [1] * N
res[0] = res[1] = 0
for i in range(5, N):
res[i] = res[i - 4] + res[i - 3] + res[i - 2]
print(res[N-1] % MOD_CONST)
|
p02947 | s176943041 | Accepted | def resolve():
n = int(input())
dict = {}
s = [",".join(sorted(input())) for _ in range(n)]
count = 0
for i in range(n):
if s[i] in dict:
count += dict[s[i]]
dict[s[i]] += 1
else:
dict[s[i]] =1
print(count)
resolve() |
p02777 | s917888062 | Wrong Answer | s,t = input().split()
a,b = map(int,input().split())
j = input()
if s == j or t == j:
print(a+b-1)
else:
print(a+b) |
p03645 | s498636691 | Accepted | N, M = map(int, input().split())
abl1 = set()
abl2 = set()
for _ in range(M):
ab = list(map(int,input().split()))
if ab[0] == 1:
abl1.add(ab[1])
elif ab[1] == N:
abl2.add(ab[0])
for i in abl1:
if i in abl2:
print("POSSIBLE")
exit()
print("IMPOSSIBLE") |
p02779 | s556577149 | Wrong Answer | N = input()
A = input().split()
if len(set(A)) == N :
print('YES')
else:
print('NO') |
p04033 | s694883409 | Accepted | a, b = map(int, input().split())
if a < 0 and b < 0:
if abs(b-a)%2 == 0:
print('Negative')
else:
print('Positive')
elif a <= 0 and b >=0:
print('Zero')
else:
print('Positive') |
p02743 | s211163974 | Accepted | #!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: C
# CreatedDate: 2020-03-14 21:31:08 +0900
# LastModified: 2020-03-16 13:10:13 +0900
#
import os
import sys
import math
def main():
a,b,c = map(int,input().split())
if 4*a*b<(c-a-b)**2 and c-a-b>0:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
p02582 | s409381776 | Accepted | s=input()
if s.count('R')==3:
print(3)
elif s[0]==s[1]=='R' or s[1]==s[2]=='R':
print(2)
elif s.count('R')!=0:
print(1)
else:
print(0) |
p03778 | s412532295 | Accepted | w,a,b = map(int,input().split())
if a < b:
print(max(0,b-a-w))
else:
print(max(0,a-b-w)) |
p03943 | s875616281 | Wrong Answer | a,b,c=map(int,input().split())
t=a+b+c
k=0
k|=0 if t-a in [a,b,c] else 1
k|=0 if t-b in [a,b,c] else 1
k|=0 if t-c in [a,b,c] else 1
print('YNeos'[k::2]) |
p04005 | s179823873 | Wrong Answer | import math
a, b, c = map(int, input().split())
if a % 2 == 0 or b % 2 == 0 or c % 2 == 0:
print(0)
else:
print(abs(a * b * (c // 2) - (a * b * (math.ceil(c / 2)))))
|
p02818 | s864586702 | Accepted | a,b,k=map(int,input().split())
a-=k
if a<0:
b+=a
print(max(0,a),max(0,b)) |
p03910 | s824434485 | Accepted | n = int(input())
s = 0
ans = []
for i in range(1, n+1):
s += i
ans.append(i)
if s >= n:
if s > n:
ans.remove(s-n)
break
for x in ans:
print(x) |
p02787 | s149143669 | Accepted | def main():
h, n = map(int, input().split())
magic_list = []
for _ in range(n):
a, b = map(int, input().split())
magic_list.append((a, b))
ans = solve(h, magic_list)
print(ans)
def solve(h, magic_list):
# 1-origin
max_attack = max(magic_list)[0]
dp = [0] * (h + max_attack)
# time O(HN)
for hp in range(1, h + 1):
dp[hp] = min(dp[hp - attack] + mp for attack, mp in magic_list)
return dp[h]
main()
|
p02724 | s331469301 | Accepted | X = int(input())
happy = 0
happy += X // 500 * 1000
X = X % 500
happy += X //5 * 5
print(happy) |
p03672 | s598482704 | Accepted | S=input()
s=""
s1=""
s2=""
for i in range(len(S)-1):
s=S[:len(S)-i-1]
if (len(s)%2==0):
s1=s[:int(len(s)/2)]
s2=s[int((len(s)+1)/2):]
if s1==s2:
print(len(s))
break |
p03997 | s178036381 | Accepted | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
a=int(input())
b=int(input())
h=int(input())
print((a+b)*h//2) |
p04034 | s136972002 | Accepted | n,m=map(int,input().split())
ans=[0 for _ in range(n+1)]
cnt=[1 for _ in range(n+1)]
ans[1]=1
for i in range(m):
a,b=map(int,input().split())
if ans[a]==1:
ans[b]=1
if cnt[a]==1:
ans[a]=0
cnt[a]-=1
cnt[b]+=1
print(sum(ans)) |
p03126 | s226388157 | Wrong Answer | n, m = map(int, input().split())
cnt = [0]*30
for i in range(n):
l = list(map(int, input().split()))
for j in range(1, l[0]+1):
cnt[l[j]-1] += 1
print(cnt)
ans = 0
for i in cnt:
if i == n:
ans += 1
print(ans) |
p03862 | s143865868 | Wrong Answer | N, x = map(int, input().split())
A = [int(i) for i in input().split()]
ans = 0
for i in range(1, N):
if A[i-1]+A[i] > x:
e = A[i-1]+A[i]-x
ans += e
A[i] -= e
print(ans)
|
p03274 | s594584860 | Accepted | def main():
n,k = map(int, input().split())
X = list(map(int, input().split()))
tmp = []
for i in range(n-k+1):
l = X[i]
r = X[i+k-1]
tmp.append(abs(l)+abs(r-l))
tmp.append(abs(r)+abs(r-l))
print(min(tmp))
if __name__ == '__main__':
main()
|
p02719 | s495443917 | Wrong Answer | n, k = map(int, input().split())
ans = n % k
s = n // 2
if s >= ans:
print(ans)
else:
print(abs(ans - s)) |
p03103 | s325897735 | Accepted | #abc121_c
N, M = map(int,input().split())
AB = [list(map(int,input().split())) for i in range(N)]
AB= sorted(AB,key=lambda x:x[0])
ans = 0
for yen,num in AB:
if num < M:
ans += num*yen
M-=num
else:
ans += M*yen
break
print(ans)
|
p02982 | s082071627 | Accepted | # -*- coding: utf-8 -*-
import math
n,d=map(int,input().split())
x=[list(map(int,input().split())) for _ in range(n)]
ans=0
for i in range(n-1):
for j in range(i+1,n):
diff=0
for k in range(d):
diff+=(x[i][k]-x[j][k])**2
if math.sqrt(diff).is_integer():
ans+=1
print(ans)
|
p02631 | s852115934 | Accepted | N = int(input())
As = list(map(int, input().split()))
al = 0
for a in As:
al ^= a
rlt = []
for a in As:
tmp = al ^ a
rlt.append(tmp)
print(" ".join(map(str, rlt))) |
p03030 | s417651002 | Wrong Answer | import sys
n = int(input())
s = []
p = []
for i in range(n):
s.append(input().split())
ls = sorted(s)
ls.sort(key=lambda x: x[1],reverse=True)
ls.sort(key=lambda x: x[0])
for i in range(n):
print(s.index(ls[i])+1) |
p02555 | s901207872 | Accepted | S = int(input())
i = 0
ans = 0
mod = 10 ** 9 + 7
def comb(n, k):
de = 1
nu = 1
for i in range(k):
de *= (n - i) % mod
nu *= (i + 1) % mod
nu = pow(nu, -1, mod)
return de * nu
while 1:
S -= 3
if S <= 0:
if S == 0:
ans += 1
print(ans)
exit()
ans += comb(S+i, i)
ans = ans % mod
i += 1 |
p02963 | s264511220 | Accepted | s = int(input())
v = 10**9
x = (v-s%v)%v
y = (s+x)//v
print(0,0,10**9,1,x, y) |
p02731 | s721680311 | Accepted | l = int(input())
a = l**3/27
print(a) |
p03293 | s969551946 | Accepted | s=list(input())
t=list(input())
flag=0
if s==t:
flag=1
for i in range(len(s)):
s.insert(0,s[-1])
s.pop(-1)
if s==t:
flag=1
if flag==1:
print('Yes')
else:
print('No') |
p02922 | s335892771 | Accepted | A,B = list(map(int,input().split()))
C = B - A
if C % (A-1) == 0:
print(C//(A-1)+1)
else:
print(C//(A-1)+2)
|
p03309 | s008328521 | Accepted | n=int(input())
a=list(map(int,input().split()))
dp=[0]*n
for i in range(n):
dp[i]=a[i]-i
dp.sort()
ans=0
for j in range(n):
ans+=abs(dp[j]-dp[n//2])
print(ans)
|
p02595 | s393139179 | Accepted | import math
N, D = map(int, input().split())
XY = []
for _ in range(N):
x, y = map(int, input().split())
XY.append([x, y])
ans = 0
for xy in XY:
x = xy[0]
y = xy[1]
d = math.sqrt(x**2 + y**2)
if d <= D:
ans += 1
print(ans)
|
p02911 | s713687182 | Accepted | from collections import Counter
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
c = Counter(A)
for i in range(N):
if K - (Q - c[i+1]) > 0:
print('Yes')
else:
print('No') |
p03360 | s449613611 | Wrong Answer | # B
a = list(map(int, input().split()))
k = int(input())
a.sort(reverse=True)
a[0] = a[0]*2*k
print(sum(a)) |
p03387 | s556881024 | Accepted | a,b,c=sorted(map(int,input().split()))
ans=0
if a==b==c:
ans=0
else:
ans+=c-b
if (b-a)%2==0:
ans+=(b-a)//2
else:
ans+=(b-a+3)//2
print(ans) |
p03693 | s840353264 | Accepted | #ABC064
r,g,b = map(int,input().split())
k = 100*r + 10*g + b
if k % 4 == 0:
print("YES")
else:
print("NO") |
p02701 | s400001689 | Wrong Answer | # C - gacha
n = int(input())
s = []
c = 0
for i in range(n):
s.append(input())
s.sort()
for j in range(n-1):
if s[j] != s[j+1]:
c += 1
print(c)
|
p03607 | s992296413 | Accepted | from sys import stdin
def main():
n = int(stdin.readline())
a = [int(stdin.readline()) for _ in range(n)]
l = {}
for ai in a:
if ai not in l:
l[ai] = 1
else:
l[ai] = l[ai] + 1
ans = 0
for key in l:
if l[key] % 2 == 1:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p02773 | s658253547 | Accepted | N = int(input())
List_S = [input() for i in range(N)]
List_S.sort()
List_S.append(-1)
result = []
count_list = []
count = 1
for i in range(N):
if List_S[i] == List_S[i + 1]:
count += 1
else:
result.append(List_S[i])
count_list.append(count)
count = 1
ma = max(count_list)
for i in range(len(result)):
if count_list[i] == ma:
print(result[i])
|
p03011 | s425872214 | Accepted | P,Q,R=map(int,input().split())
print(min(P+Q,P+R,Q+R)) |
p03680 | s140933635 | Wrong Answer | import sys
n = int(input())
a = [0] + [int(sys.stdin.readline()) for _ in range(n)]
button = 1
count = 0
for _ in range(n + 1):
if button == 2:
print(count)
break
button = a[button]
count += 1
if count == n:
print(-1) |
p03639 | s050628401 | Accepted | n=int(input())
l=list(map(int,input().split()))
c_4=0
even=0
odd=0
for i in l:
if i%4==0:
c_4+=1
elif i%2==0:
even+=1
else:
odd+=1
if even==0 and odd-1 <= c_4:
ans="Yes"
else:
ans="No"
if even>0 and odd <= c_4:
ans="Yes"
else:
"No"
print(ans) |
p02946 | s454390252 | Accepted | k,x= map(int,input().split())
min = x-k+1
max= x+k-1
ans = []
for i in range(min,max+1):
ans.append(i)
print(*ans) |
p02983 | s633794906 | Accepted | l,r=map(int,input().split())
if r-l<2019:
l=l
r=r
else:
l=l
r=l+2019
ans=2019
for i in range(l,r):
for j in range(i+1,r+1):
if (i*j)%2019<ans:
ans=(i*j)%2019
print(ans) |
p03485 | s299385787 | Wrong Answer | a,b = map(int,input().split())
ans = (a + b) // 2
print(ans) |
p03105 | s181701977 | Wrong Answer | #!/usr/bin/python
input_data = list(map(int,input().split()))
d1 = input_data[0]
d2 = input_data[1]
d3 = input_data[2]
total = 0
d4 = int(d2 / d1)
if d4 > d3:
total = d3
print(total)
|
p03761 | s182103905 | Accepted | n=int(input())
for k in range(n):
s=input()
tmp=[0]*26
for i in range(len(s)):
tmp[ord(s[i])-ord("a")]+=1
if k==0: ans=tmp
else:
for i in range(26):
ans[i]=min(ans[i],tmp[i])
p=ord("a")
for i in range(26):
for _ in range(ans[i]):
print(chr(p+i),end="") |
p03105 | s479659939 | Wrong Answer | a,b,c=map(int,input().split())
print(max((b // a),c))
|
p02924 | s013206187 | Accepted | n=int(input())
print((n * (n-1)) // 2 ) |
p03037 | s088629246 | Accepted | N, M = map(int, input().split())
max_L = 0
min_R = 10**5
for _ in range(M):
L, R = map(int, input().split())
max_L = max(max_L, L)
min_R = min(min_R, R)
print(len(list(range(max_L, min_R+1)))) |
p03861 | s093404399 | Wrong Answer | a, b, x = map(int, input().split())
ans = 0
A = a%x
B = (b-a)%x
if A<=B:
ans += 1
ans += (b-a)//x
print(ans) |
p02785 | s233799783 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
if k > n:
print(0)
exit()
total = sum(h[0: n - k])
print(total)
|
p02761 | s319140770 | Accepted | N, M = map(int, input().split())
SC = [list(map(int, input().split())) for _ in range(M)]
start = 10 ** (N - 1) if N != 1 else 0
for i in range(start, 10 ** N):
flag = 1
si = str(i)
for s, c in SC:
if si[s - 1] != str(c):
flag = 0
break
if flag:
print(i)
exit()
print(-1) |
p03345 | s482121688 | Wrong Answer | a,b,c,k = map(int,input().split())
x = abs(a-b)
if x > 10**18:
print('Unfair')
else:
if a <= b:
if k % 2== 0:
print(a-b)
else:
print(abs(a-b))
else:
if k % 2== 0:
print(abs(a - b))
else:
print(a - b) |
p03043 | s560603535 | Accepted | n, k = map(int, input().split())
ans = 0
for i in range(1, n+1):
double = 0
while True:
if i >= k:
break
i *= 2
double += 1
ans += 0.5 ** double / n
print(ans)
|
p03524 | s919902896 | Accepted | s=str(input())
lis=[0]*3
lis[0]=s.count("a")
lis[1]=s.count("b")
lis[2]=s.count("c")
n=len(s)//3
ans="YES"
for i in lis:
if n<=i<=n+1:
continue
else:
ans="NO"
print(ans) |
p03836 | s975160970 | Accepted | sx,sy,tx,ty = map(int,input().split())
diff_x = tx-sx
diff_y = ty-sy
ans = []
for i in range(diff_x):
ans.append("R")
for j in range(diff_y):
ans.append("U")
for i in range(diff_x):
ans.append("L")
for j in range(diff_y):
ans.append("D")
ans.append("D")
for i in range(diff_x+1):
ans.append("R")
for j in range(diff_y+1):
ans.append("U")
ans.append("L")
ans.append("U")
for i in range(diff_x+1):
ans.append("L")
for j in range(diff_y+1):
ans.append("D")
ans.append("R")
print("".join(ans))
|
p02701 | s251540728 | Accepted | N = int(input())
dict = {}
for i in range(N):
item = input()
if item in dict.keys():
dict[item] += 1
else:
dict[item] = 1
print(len(dict))
|
p02633 | s468828501 | Wrong Answer | import math
n = int(input())
print(int(math.ceil(360/n)))
|
p02832 | s335075773 | Accepted | N = int(input())
brick = list(map(int,input().split()))
def Break(n, lst):
counter = 0
cur = 1
for i in range(len(lst)):
if lst[i] == cur:
cur += 1
else:
counter += 1
if cur == 1:
return -1
return counter
print(Break(N, brick))
|
p02747 | s122482263 | Accepted | s = input()
if len(s) %2 !=0:
print("No")
else:
c =0
for i in range(len(s)//2):
hi = s[2*i:2*i+2]
if hi == "hi":
pass
else:
c = 1
break
if c ==0:
print("Yes")
else:
print("No")
|
p02641 | s754533867 | Accepted | x,n = list(map(int,input().split()))
p = list(map(int,input().split()))
ans=1000
for i in range(-105,102):
if i in p:
continue
if abs(x-ans)>abs(i-x):
ans=i
print(ans) |
p02615 | s954920827 | Accepted | N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
a = min(A[0], A[1])
ans = A[0]
idx = 1
c = 1
while c <= N-1:
if(c == N-1):
break
if(c == N-2):
ans += a
break
ans += a*2
c += 2
idx += 1
a = min(A[idx], A[idx-1])
print(ans) |
p02576 | s914788416 | Accepted | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
n,x,t=map(int,input().split())
print(t*(-(-n//x))) |
p03103 | s655642264 | Wrong Answer | N,M=map(int,input().split())
k=M
s=0
A=[list(map(int,input().split())) for i in range(N)]
A=sorted(A,key=lambda x:x[0])
for i in range(N):
while k>0:
if k>A[i][1]:
s+=A[i][0]*A[i][1]
k=k-A[i][1]
else:
s+=A[i][0]*k
k=0
print(s)
|
p02766 | s217782229 | Accepted | import math
n, k = map(int, input().split())
digit = math.log(n, k)
if digit.is_integer():
print(int(digit)+1)
else:
print(math.ceil(digit)) |
p03264 | s239840057 | Wrong Answer | k=int(input())
print((k//2)*(k//2+1)) |
p03250 | s425733470 | Accepted | a,b,c=map(int,input().split())
print(a+b+c+max(a,b,c)*9) |
p02695 | s785473907 | Accepted | N,M,Q=map(int,input().split())
from itertools import combinations_with_replacement
A=[0]*N
conditions = []
for i in range(Q):
con =list(map(int,input().split()))
conditions.append(con)
c = combinations_with_replacement(range(1,M+1),N)
total =0
for seq in c:
total_tmp=0
for q in conditions:
if seq[q[1]-1] - seq[q[0]-1] == q[2]:
total_tmp += q[3]
total = max(total,total_tmp )
print(total)
|
p02578 | s216104514 | Wrong Answer | A = list(map(int,input().split()))
sm = 0
now = A[0]
for num in A:
if num < now:
sm += now-num
elif num > now:
now = num
print(sm)
|
p02687 | s952982890 | Accepted | S=input()
if S=='ABC':
print('ARC')
else:
print('ABC') |
p03721 | s760811246 | Accepted | n,k = map(int,input().split())
lst = [list(map(int,input().split())) for i in range(n)]
lst.sort()
counter = 0
for i in range(n):
counter += lst[i][1]
if counter>=k:
print(lst[i][0])
break
|
p03795 | s001718480 | Accepted | n = int(input())
print(800*n - 200*(n//15)) |
p03698 | s033595167 | Accepted | s = input()
words = set()
ans = 'yes'
for c in s:
if c in words:
ans = 'no'
break
words.add(c)
print(ans) |
p03495 | s006606689 | Wrong Answer | n,k = map(int,input().split())
A = list(map(int,input().split()))
if len(set(A))<=k:
print(0)
else:
d = {i:0 for i in set(A)}
for a in A:
d[a] += 1
ans = list(d.values())
print(sum(ans[k:])) |
p03448 | s497376904 | Accepted | x=int(input())
c=0
y,z,d=int(input()),int(input()),int(input())
for i in range(x+1):
for j in range(y+1):
for k in range(z+1):
f=500*i+100*j+50*k
if(f==d):
c+=1
print(c)
|
p02546 | s735075147 | Accepted | s = list(input())
if(s[-1] == "s"):
s.append("es")
else:
s.append("s")
for i in s:
print(i,end="") |
p03486 | s347801499 | Wrong Answer | s = list(input())
t = list(input())
s.sort(reverse=True)
t.sort(reverse=True)
s_len = len(s)
t_len = len(t)
if(s_len < t_len):
short = s_len
else:
short = t_len
flag = False
equal = True
for i in range(short):
if(s[i] < t[i]):
flag = True
break
elif(s[i] == t[i] and equal == True):
continue
else:
equal = False
else:
if(s_len < t_len and equal == True):
flag = True
if(s < t or flag):
print('Yes')
else:
print('No') |
p03327 | s546601846 | Accepted | N=int(input())
if N<1000:
print('ABC')
else:
print('ABD') |
p02818 | s881737737 | Wrong Answer | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
A, B, K = map(int, input().split())
diff = A - K
if diff < 0:
print(0, B + diff)
else:
print(diff, B)
if __name__ == "__main__":
main()
|
p02630 | s140413282 | Accepted | from collections import Counter
N = int(input())
A = list(map(int, input().split()))
c = Counter(A)
total = sum(A)
Q = int(input())
for i in range(Q):
B, C = map(int, input().split())
v = c.get(B)
if v:
c[B] = 0
c[C] += v
total += (C-B) * v
print(total) |
p04045 | s141797748 | Accepted | N, K = map(int, input().split())
D = set(list(input().split()))
while True:
if set(list(str(N))) & D:
N += 1
else:
print(N)
exit()
|
p03730 | s044831970 | Wrong Answer | A, B, C = map(int, input().split())
for i in range(1, 110):
if (B * i + C) % A == 0:
print("Yes")
exit()
print("No") |
p02665 | s934231059 | Accepted | n,*a=map(int,open(0).read().split())
t,v,w=sum(a),1,1
for q in a:
w=min(2*(w-q),t:=t-q);(v:=v+w)
if w<0:print(-1);exit()
print(v) |
p03427 | s165004776 | Wrong Answer | n = int(input())
lst = list(map(int,str(n)))
if set(lst[1:]) == {9}:
print(lst[0] + 9*(len(lst)-1))
else:
print((lst[0]-1) + 9*(len(lst)-1)) |
p02756 | s528817716 | Accepted | s = input()
back = ""
q = int(input())
rev = False
for i in range(q):
inpt = input().split( )
if len(inpt)>1:
fi,ci = inpt[1],inpt[2]
if not ((fi == "1") ^ rev):
s += ci
else:
back += ci
else:
rev = not rev
back = back[::-1]
ans = back+s
if not rev:
print(ans)
else:
ans = ans[::-1]
print(ans)
|
p02880 | s547893816 | Wrong Answer | N = int(input())
for i in range(1,10):
for j in range(1,10):
ij = i * j
if(N == i*j):
print("Yes")
break
if(N > 81):
print("No") |
p03986 | s419301112 | Accepted | # 05
s = input()
x = 0
y = 0
for i in s:
if i == 'S':
y -= 1
else:
y += 1
#print(x, y)
x = max(x, y)
print(x*2) |
p02948 | s533218866 | Accepted | import heapq
N, M = map(int, input().split())
AB = []
for i in range(N):
A, B = map(int, input().split())
AB.append([A, B])
AB.sort(reverse=True)
q = []
cnt = 0
for i in range(1, M+1):
while len(AB) > 0 and AB[-1][0] <= i:
tmp = AB.pop()
heapq.heappush(q, -tmp[1])
if len(q) > 0:
max_val = -heapq.heappop(q)
cnt += max_val
print(cnt)
|
p02988 | s155850132 | Accepted | N=int(input())
p=list(map(int,input().split()))
ANS=0
ans=p[0]-p[1]
for i in range(2,N):
if (p[i-1]-p[i])*ans>=0:
ANS+=1
ans=(p[i-1]-p[i])//abs(p[i-1]-p[i])
print(ANS) |
p02744 | s871539912 | Accepted | n=int(input())
if n==1:
print('a')
exit()
ans=['a']
al=list('abcdefghijklmnopqrsruvwxyz')
for i in range(n-1):
tmp=[]
for j in ans:
sn=len(set(j))
for k in range(sn+1):
tmp.append(j+al[k])
ans=tmp
ans.sort()
for i in ans:
print(i) |
p03371 | s679986086 | Wrong Answer | A, B, C, X, Y = map(int, input().split())
if X > Y:
many = A
else:
many = B
if min(A, B) > 2 * C:
ans = C * 2 * max(X, Y)
elif (A + B) / 2 < C:
ans = A * X + B * Y
else:
ans = min(X, Y) * 2 * C + (max(X, Y) - min(X, Y)) * many
print(ans) |
p02935 | s268569779 | Accepted | N = int(input())
v = list(map(int, input().split()))
while len(v) > 1:
v.sort()
t1 = v.pop(0)
t2 = v.pop(0)
v.append((t1 + t2) / 2)
print(v[0]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.