problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03243 | s109437564 | Wrong Answer | print(max(input())*3) |
p02755 | s078921968 | Accepted | import math
import numpy as np
a, b = [int(v) for v in input().split()]
try:
print(min(np.intersect1d(np.arange(math.ceil(a/0.08), (a+1) //0.08+ 1).astype(int), np.arange(math.ceil(b/0.1), (b+1)//0.1 + 1).astype(int))))
except:
print(-1)
|
p03208 | s300105414 | Wrong Answer | import sys
from collections import defaultdict
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
n,k = map(int, input().split())
h = []
d = defaultdict(int)
cnt = []
for i in range(n):
x = int(input())
h.append(x)
d[x] += 1
sh = sorted(h)
if d[sh[0]] == k or d[sh[k - 1]] == k:
print(0)
else:
print(sh[k - 1] - sh[0])
|
p03407 | s650914560 | Accepted | A, B, C = map(int,input().split())
if A + B >= C:
r = 'Yes'
else:
r = 'No'
print(r) |
p02606 | s763499248 | Accepted | import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
L,R,d = LI()
ans = 0
for i in range(L,R+1):
if i % d == 0:
ans += 1
print(ans) |
p02779 | s179267723 | Wrong Answer | N = int(input())
A_list = list(map(int, input().split()))
if len(A_list) == len(set(A_list)):
print("Yes")
else:
print("No") |
p02759 | s523282952 | Accepted | n = int(input())
if n %2 :
print(n//2+1)
else:
print(n//2) |
p03017 | s525933287 | Accepted | import sys
input = sys.stdin.readline
def log(*args):
print(*args, file=sys.stderr)
def main():
N, A, B, C, D = map(int, input().split())
log(N, A, B, C, D)
S = input()
if "##" in S[A-1:max(D, C)]:
print("No")
return
if C < D:
print("Yes")
return
log(S[B-2:D+1])
if "..." in S[B-2:D+1]:
print("Yes")
return
print("No")
if __name__ == '__main__':
main()
|
p04043 | s931307079 | Accepted | a,b,c=map(int,input().split())
if(a==5):
if(b==7 and c==5):
print("YES")
elif(b==5 and c==7):
print("YES")
else:
print("NO")
elif(a==7):
if(b==5 and c==5):
print("YES")
else:
print("NO")
else:
print("NO") |
p03077 | s852841961 | Wrong Answer | N = int(input())
T = []
for i in range(4):
T.append(int(input()))
k = 0
for i in range(4):
if N % T[i] == 0:
k = max(k, N//T[i])
else:
k = max(k, N//T[i] + 1)
print(4 + k) |
p02789 | s683362688 | Accepted | k = [int(i) for i in input().split()]
ans='No'
if k[0] == k[1]: ans='Yes'
print(ans)
|
p02729 | s239441391 | Accepted | n,m = map(int,input().split())
print(n*(n-1)//2 + m*(m-1)//2) |
p03486 | s374170740 | Wrong Answer | s = input()
t = input()
mins = 1000
maxt = 0
for i in range(len(s)):
mins = min(mins,ord(s[i]))
for i in range(len(t)):
maxt = max(maxt,ord(t[i]))
if mins < maxt: print('Yes')
elif mins == maxt:
if len(s) >= len(t): print('No')
else: print('Yes')
else: print('No') |
p03163 | s207098287 | Wrong Answer | def solve(N, W, weight_values):
dp = [[0 for _ in range(W + 1)] for _ in range(N + 1)]
dp[0][0] = 1
for i in range(N + 1):
i_weight, i_value = weight_values[i - 1]
for w in range(i_weight, W + 1):
dp[i][w] = max(dp[i - 1][w - i_weight] + i_value, dp[i - 1][w])
print(dp[N][W])
def iln(): return list(map(int, input().split()))
N, W = iln()
w_v = []
for i in range(N):
w_v.append(iln())
solve(N, W, w_v)
|
p02888 | s888965314 | Accepted | import sys
from bisect import bisect_left
input = sys.stdin.readline
def solve(N, L):
L.sort()
ans = 0
for a in range(N - 2):
for b in range(a + 1, N - 1):
c = bisect_left(L, L[a] + L[b]) - 1
ans += c - b
return ans
def main():
N = int(input())
L = list(map(int, input().split()))
ans = solve(N, L)
print(ans)
if __name__ == "__main__":
main()
|
p02601 | s798916645 | Accepted | a,b,c = map(int,input().split())
r = int(input())
for i in range(r):
if a >= b:
b = b*2
elif b >= c:
c = c*2
if a < b and b < c:
print('Yes')
break
else:
print('No')
|
p02773 | s450033753 | Wrong Answer | import collections
def main():
n =int( input())
cnt=dict()
for _ in range(n):
s=input()
if s in cnt:
cnt[s]+=1
else :
cnt[s]=1
#print(cnt)
a = [k for k, v in cnt.items() if v == max(cnt.values())]
print("aa")
a.sort()
for elm in a:
print(elm)
main()
|
p03624 | s569465375 | Accepted | s=input()
a="abcdefghijklmnopqrstuvwxyz"
for i in range(26):
if a[i] in s:
continue
else:
print(a[i])
exit()
print("None") |
p02694 | s794125090 | Accepted | x = int(input())
ans = 0
money = 100
while True:
money = int(money * 1.01)
ans += 1
if money >= x:
print(ans)
exit()
|
p03331 | s436103419 | Accepted | def main():
N = list(str(input()))
n = int("".join(N))
sum_N = sum(list(map(int,N)))
if n%10 == 0 and sum_N == 1:
print(10)
else:
print(sum_N)
if __name__ == '__main__':
main() |
p03623 | s367708945 | Accepted | # ABC 071: A – Meal Delivery
x, a, b = [int(s) for s in input().split()]
print('A' if abs(x - a) < abs(x - b) else 'B') |
p03274 | s969287894 | Accepted | N, K = map(int, input().split())
X = list(map(int, input().split()))
ans = float("inf")
for i in range(N - K + 1):
left, right = X[i], X[i + K - 1]
if left * right <= 0:
ans = min(ans, abs(left) + right + min(abs(left), right))
elif left > 0:
ans = min(ans, right)
else:
ans = min(ans, abs(left))
print(ans)
|
p04045 | s159008260 | Accepted | n, k, *d = map(int, open(0).read().split())
d = set(d)
while 1:
for i in str(n):
if int(i) in d: break
else:
print(n)
break
n += 1 |
p03659 | s640379723 | Accepted | import sys
input = sys.stdin.readline
def main():
N = int(input())
A = list(map(int, input().split()))
X = [0]*(N+1)
for i in range(1,N+1):
X[i] += A[i-1] + X[i-1]
ans = float('INF')
for i in range(1,N):
ans = min(ans,abs(X[N] - 2*X[i]))
print(ans)
if __name__ == '__main__':
main() |
p03285 | s677318151 | Wrong Answer | # input
N = int(input())
pat = set(
[
fn
for fn in range(4, 100, 4)
] + [
sn
for sn in range(7, 100, 7)
]
)
if N in pat:
print("Yes")
else:
print("No") |
p02659 | s747665265 | Accepted | A,B=input().split()
A=int(A)
B=list(B)
N=B[0]+B[2]+B[3]
N=int(N)
C=int(A*N//100)
print(C) |
p02600 | s132016757 | Accepted | a=int(input())
if(400<=a<=599):
b=8
if(600<=a<=799):
b=7
if(800<=a<=999):
b=6
if(1000<=a<=1199):
b=5
if(1200<=a<=1399):
b=4
if(1400<=a<=1599):
b=3
if(1600<=a<=1799):
b=2
if(1800<=a<=1999):
b=1
print(b) |
p02796 | s979670862 | Wrong Answer | N = int(input())
A = [list(map(int, input().split())) for _ in range(N)]
A.sort(key=lambda x:x[0])
X = []
L = []
for l in A:
X.append(l[0])
L.append(l[1])
pl = X[0] + L[0]
k = 0
for i in range(1, N):
pr = X[i] - L[i]
if pl > pr:
k += 1
else:
pl = min(pl, X[i] + L[i])
print(N - k) |
p02608 | s916758977 | Accepted | n = int(input())
table = [0] * 10001
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
k = (x * x) + (y * y) + (z * z) + (x * y) + (y * z) + (z * x)
if k < 10001:
table[k] += 1
for i in range(1, n + 1):
print(table[i])
|
p02678 | s144923714 | Accepted | from collections import deque
N, M = map(int, input().split())
G = [[] for _ in range(N)]
for i in range(M):
a, b = map(int, input().split())
a, b = a - 1, b - 1
G[a].append(b)
G[b].append(a)
que = deque([0])
guideposts = [-1] * N
guideposts[0] = None
while que:
n = que.pop()
for to in G[n]:
if guideposts[to] != -1:
continue
guideposts[to] = n
que.appendleft(to)
print('Yes')
print(*[guisepost + 1 for guisepost in guideposts[1:]], sep="\n")
|
p02664 | s031996103 | Wrong Answer | t = list(input())
for i in range(len(t)):
if t[i] == '?':
t[i] = 'D'
print(t) |
p03817 | s473378743 | Accepted | x = int(input())
cnt = 1
if x % 11 >= 7:
cnt += 1
cnt += int(x/11) * 2
if x % 11 == 0:
print(x//11*2)
else:
print(cnt) |
p03814 | s377857874 | Accepted | s = input()
a = s.find('A')
z =s.rfind('Z')
print(z-a+1) |
p02695 | s777928796 | Wrong Answer | import sys
import itertools
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M, Q = map(int, input().split())
ABCD = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for lst in itertools.combinations_with_replacement(range(1, N + 1), N):
s = 0
for a, b, c, d in ABCD:
if (lst[b - 1] - lst[a - 1]) == c:
s += d
ans = max(ans, s)
print(ans)
|
p02793 | s568233439 | Accepted | import fractions
n = int(input())
a = list(map(int, input().split()))
l = 1
for i in range(n):
l = l // fractions.gcd(l, a[i])*a[i]
ans = 0
for i in range(n):
ans += l//a[i]
print(ans%(10**9+7)) |
p02973 | s342047158 | Accepted | import bisect
from collections import deque
N = int(input())
A = []
for _ in range(N):
A.append(int(input()))
buf = deque()
for a in A:
i = bisect.bisect_right(buf, a-1)-1
if i < 0:
buf.appendleft(a)
else:
buf[i] = a
print(len(buf)) |
p02790 | s414861483 | Accepted | a,b = map(str,input().split())
a_L = []
a_L.append(a*int(b))
a_L.append(b*int(a))
a_L.sort()
print(a_L[0])
|
p03627 | s504729248 | Accepted | N = int(input())
A = list(map(int,input().split()))
dls = []
A.sort()
A.reverse()
now = 0
for i in range(N-1):
if now >= N-1:
break
else:
if A[now] == A[now+1]:
dls.append(A[now])
now += 2
else:
now += 1
if len(dls) >= 2:
print(dls[0]*dls[1])
else:
print(0)
|
p02783 | s683325590 | Wrong Answer | H, A = map(int, input().split())
i = 0
while H>=0:
H = H-A
i += 1
print(i) |
p03493 | s799803365 | Accepted | s = list(input())
count = 0
for i in range(0, 3):
if s[i] == '1':
count += 1
print(count) |
p02790 | s900162105 | Accepted | a_s, b_s = input().split()
a_i = int(a_s)
b_i = int(b_s)
a,b = "",""
for _ in range(a_i):
b += b_s
for _ in range(b_i):
a += a_s
ans = []
ans.append(a)
ans.append(b)
ans.sort()
print(ans[0]) |
p03327 | s945807298 | Wrong Answer | N = int(input())
if 1998>=N>=999:
print('ABD')
else:
print('ABC') |
p02811 | s241339279 | Accepted | k, x = map(int, input().split())
if 500*k >= x:
print("Yes")
else:
print("No")
|
p04043 | s734647227 | Accepted | str = input()
if str.count('5') == 2 and str.count('7') == 1:
print('YES')
else:
print('NO') |
p03494 | s665054322 | Accepted | import numpy as np
input()
x = np.array(input().split(),dtype=np.int32)
ans = 0
while (x%2==0).all():
x //= 2
ans += 1
print(ans) |
p03827 | s045903117 | Accepted | def main():
n = int(input())
s = list(input())
x = 0
ans = 0
for i in range(n):
if s[i] == 'I':
x += 1
if s[i] == 'D':
x -= 1
ans = max(ans, x)
print(ans)
if __name__ == "__main__":
main()
|
p02663 | s040902659 | Wrong Answer | h1, m1, h2, m2, k = list(map(int, input().split()))
if m2 >= m1:
time = (h2 - h1) * 60 + abs(m1 - m2) - k
else:
time = abs(m1 - m2) - k
print(time) |
p03106 | s625531631 | Accepted | A,B,K=map(int,input().split())
lst=[]
a=min(A,B)
for i in range(1,a+1):
if A%i==0:
if B%i==0:
lst.append(i)
lst.reverse()
print(lst[K-1]) |
p03555 | s560187562 | Accepted | C1=input()
C2=input()
print('YES' if C1==C2[2]+C2[1]+C2[0] else 'NO')
|
p02987 | s823692695 | Accepted | print(["No","Yes"][len(set(list(input())))==2]) |
p03543 | s787205338 | Accepted | N = str(input())
if N[0] == N[1] == N[2] or N[1] == N[2] == N[3]:
print('Yes')
else:
print('No') |
p03637 | s374625530 | Wrong Answer | n, *A = map(int, open(0).read().split())
def f(x):
y = 0
q, r = divmod(x, 2)
while r == 0:
y += 1
q, r = divmod(q, 2)
return y
B = [0] * 3
for a in A:
b = f(a)
B[0] += b == 0
B[1] += b == 1
B[2] += b >= 2
print('Yes' if B[0] + (B[1]!=0) <= B[2] else 'No') |
p02761 | s975395670 | Accepted | n,m=map(int,input().split())
SC=[list(map(int,input().split())) for _ in range(m)]
ans=-1
if n==1:
r=range(10)
elif n==2:
r=range(10,100)
else:
r=range(100,1000)
for i in r :
i=str(i)
for j ,k in SC:
if i[j-1]!=str(k):
break
else:
print(i)
exit()
print(-1) |
p03544 | s098873915 | Accepted | N = int(input())
L = [2, 1]
for i in range(2, N+1):
L.append(L[i-1] + L[i-2])
print(L[N]) |
p03417 | s021258049 | Accepted | N, M = map(int, input().split())
answer = 0
if N == 1 and M == 1:
answer = 1
elif N == 1 or M == 1:
answer = max(N, M)-2
else:
answer = (N-2)*(M-2)
print(answer)
|
p02765 | s037177212 | Accepted | n,r=map(int,input().split())
if n>=10:
print(str(r))
else :
print(r+(100*(10-n))) |
p03323 | s481551085 | Accepted | def resolve():
a, b = map(int, input().split())
if a > 8 or b > 8:
print(':(')
else:
print('Yay!')
resolve() |
p04019 | s855922926 | Wrong Answer | s = input()
set_s = list(set(s))
s_n = len(set_s)
if s_n == 1 or s_n == 3:
print("No")
elif s_n==2:
if "N" in set_s and "S" in set_s:
print("Yes")
elif "E" in set_s and "W" in set_s:
print("YES")
else:
print("No")
else:
print("Yes") |
p03455 | s174542782 | Accepted | a, b = map(int, input().split())
if a * b % 2 == 0:
print("Even")
else:
print("Odd") |
p02922 | s067377585 | Accepted | A,B = map(int,input().split())
tap = 0
plg = 1
for n in range(20):
if plg>=B:
print(tap)
exit()
else:
plg+=A-1
tap+=1
print(tap) |
p02694 | s503083810 | Accepted | import math
x = int(input())
year = 0
now = 100
while True:
now = math.floor(now * 0.01) + now
year += 1
if now >= x:
print(year)
exit() |
p03319 | s317597686 | Accepted | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = math.ceil((n - k) / (k - 1)) + 1
print(ans)
|
p02623 | s654078614 | Accepted | import itertools
import bisect
n,m,k=map(int,input().split())
a=[0]+list(map(int,input().split()))
b=list(map(int,input().split()))
aa=list(itertools.accumulate(a))
bb=list(itertools.accumulate(b))
r=0
for i,ax in enumerate(aa):
bis=bisect.bisect_right(bb,k-ax)
if bis==0 and ax>k:continue
r=max(r,i+bis)
print(r) |
p03481 | s424553838 | Wrong Answer | import math
x, y = map(int, input().split())
print(int(math.log2(y//x))+1) |
p03804 | s955560877 | Accepted | n, m = map(int, input().split())
a = [list(input()) for i in range(n)]
b = [list(input()) for i in range(m)]
check = False
for i in range(n - m + 1):
for j in range(n - m + 1):
tmp_check = True
for k in range(m):
for l in range(m):
if not (a[i + k][j + l] == b[k][l]):
tmp_check = False
check = check or tmp_check
print("Yes" if check else "No") |
p03433 | s423092138 | Accepted | n, a = int(input()), int(input())
flg = n % 500 - a > 0
print('No' if flg else 'Yes') |
p02684 | s612242777 | Accepted | n,k=map(int,input().split())
l=list(map(int,input().split()))
s=1
q=[0]*n
q[0]=1
r=[1]
for i in range(k):
s=l[s-1]
if q[s-1]==0:
q[s-1]+=1
r.append(s)
if i==k-1:
print(s)
else:
x=r.index(s)
mod=len(r)-x
t=(k-x)%mod
print(r[x+t])
break
|
p03478 | s318311220 | Wrong Answer | in_all = list(map(int, input().split()))
cnt = 0
for n in range(in_all[0]):
tmp = str(n)
all = 0
for t in tmp:
all += int(t)
if all>=in_all[1] and all<=in_all[2]:
cnt += 1
print(cnt) |
p02946 | s080824973 | Accepted | kx = list(map(int, input().split()))
k, x = kx[0], kx[1]
minimum = x - k + 1
maximum = x + k - 1
minimum = max(minimum, -1000000)
maximum = min(maximum, 1000000)
r = [i for i in range(minimum, maximum + 1)]
print(" ".join(list(map(str, r))))
|
p03637 | s252280700 | Accepted | n = int(input())
a = list(map(int, input().split()))
bai4 = []
bai2 = []
bai_ = []
for ai in a:
if ai % 4 == 0:
bai4.append(ai)
elif ai % 2 == 0:
bai2.append(ai)
else:
bai_.append(ai)
len_bai_ = len(bai_)
len_bai2 = len(bai2)
len_bai4 = len(bai4)
if len_bai_ > len_bai4:
if len_bai_ == len_bai4 + 1 and n == len_bai_ + len_bai4:
print("Yes")
else:
print("No")
else:
print("Yes") |
p03012 | s213209359 | Wrong Answer | n=int(input())
p=list(map(int,input().split()))
cnt=0
for i in range(n):
if cnt<sum(p)/2:
cnt+=p[i]
print(abs(sum(p)-cnt*2)) |
p03105 | s111956260 | Accepted | a,b,c=map(int,input().split())
print(min(c,b//a)) |
p02677 | s838096424 | Accepted | import math
a,b,h,m = map(int,input().split())
s=abs(h*30+m*0.5-m*6)
d=min(s,360-s)
c=a*a+b*b-2*a*b*math.cos(math.radians(d))
print(math.sqrt(c)) |
p02661 | s163178590 | Wrong Answer | n = int(input())
AB = [tuple(map(int, input().split())) for i in range(n)]
A = [AB[i][0] for i in range(n)]
B = [AB[i][1] for i in range(n)]
# A = [(AB[i][0], i) for i in range(n)]
# B = [(AB[i][1], i) for i in range(n)]
A.sort()
B.sort()
if n % 2 == 1:
print(B[n % 2] - A[n % 2] + 1)
if n % 2 == 0:
print(B[n % 2 + 1] - A[n % 2] + 1)
|
p02772 | s689306826 | Accepted | n = int(input())
a = list(map(int, input().split()))
for i in range(n):
if a[i] % 2 == 1: continue
if a[i] % 3 != 0 and a[i] % 5 != 0:
print("DENIED")
break
else:
print("APPROVED") |
p02771 | s095044196 | Wrong Answer | input_text = input()
count = len(set(input_text.split(" ")))
if count == 1:
print("No")
else:
print("Yes") |
p03000 | s709101991 | Wrong Answer | n,x=list(map(int,input().split()))
l=list(map(int,input().split()))
d=[0]*n
d.append(0)
for i in range(1,len(l)+1):
d[i]=d[i-1]+l[i-1]
if d[1]>x:
print(0)
exit()
for i in range(len(d)):
if d[i]>x:
print(i)
exit()
|
p02823 | s713275847 | Wrong Answer | n,a,b=map(int,input().split())
if (b-a)%2==0:
ans=(b-a)//2
else:
ans=(b-a)//2+1
print(ans) |
p03761 | s861078128 | Accepted | from collections import Counter
n = int(input())
s = [Counter(input()) for _ in range(n)]
cnt = s[0]
for scnt in s:
for str in (scnt | cnt):
cnt[str] = min(cnt[str], scnt[str])
a = ord('a')
ans = [chr(a + i) * cnt[chr(a + i)] for i in range(26)]
print(*ans, sep='')
|
p03817 | s384921905 | Wrong Answer | x=int(input())
ans = x//11
ans *=2
ans+=1
if x%11==0:
ans -=1
if x%11>5:
ans +=1
print(ans) |
p02683 | s461514732 | Accepted | n,m,x = map(int,input().split())
books = [list(map(int, input().split())) for _ in range(n)]
ans = []
for i in range( 1 << n):
total = [0] * (m + 1)
for j in range(n):
if (i >> j) & 1:
total = [total[k] + books[j][k] for k in range(m+1)]
over = True
for j in range(1, m+1):
if total[j] < x:
over = False
if over:
ans.append(total[0])
if len(ans) > 0:
print(min(ans))
else:
print('-1')
|
p03254 | s294878582 | Accepted | N, x=map(int, input().split())
a=list(map(int, input().split()))
a.sort()
i=0
while i<N and x>=a[i]:
x-=a[i]
i+=1
if i==N and x>0:
i-=1
print(i) |
p04020 | s083665882 | Wrong Answer | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(input())
A = list(int(input()) for _ in range(n))
res = 0
for i in range(1, n):
cnt = min(A[i - 1], A[i])
A[i - 1] -= cnt
A[i] -= cnt
res += cnt
if A[i - 1]:
res += (A[i - 1]) // 2
if A[n - 1]:
res += (A[n - 1]) // 2
print(res)
if __name__ == '__main__':
resolve()
|
p02795 | s472925865 | Accepted | h = int(input())
w = int(input())
if h < w:
h, w = w, h
n = int(input())
print(-(-n//h)) |
p03760 | s641366132 | Wrong Answer | O = list(input())
E = list(input())
ans = list()
for i in range(len(O)):
ans.append(O[i])
if len(E) >= i:
ans.append(O[i])
result = "".join(ans)
print(result) |
p04029 | s330563039 | Accepted | n = int(input())
total = 0
for i in range(1,n+1):
total += i
print(total) |
p02888 | s146161531 | Accepted | # coding: utf-8
import bisect
N=int(input())
L=list(map(int,input().split()))
L.sort()
ans=0
for i in range(N-2):
for j in range(i+1,N-1):
n=L[i]+L[j]
ans+=bisect.bisect_left(L,n)-j-1
#print(L[i],L[j],n)
print(ans) |
p03910 | s777794310 | Wrong Answer | # -*- coding: utf-8 -*-
"""
Created on Fri Jun 12 20:20:11 2020
@author: NEC-PCuser
"""
N = int(input())
i = 1
li = []
while (N >= (i * (i + 1)) // 2):
li.append(i)
i += 1
value = (i - 1) * i // 2
print(value)
index = len(li) - 1
for i in range(value, N):
li[index] += 1
index -= 1
for i in li:
print(i) |
p03136 | s853938806 | Accepted | N = int (input ())
l = [int(x) for x in input ().split ()]
m = max (l)
s = sum (l)
if m*2 < s:
print ('Yes')
else:
print ('No') |
p02618 | s283094115 | Wrong Answer | import random
import numpy as np
d = int(input())
c = list(map(int, input().split()))
s = []
for i in range(d):
temp = list(map(int, input().split()))
s.append(temp)
s = np.array(s)
#print(s)
with open('output.txt', 'w') as f:
dice = list(range(26))
w = c
samples = random.choices(dice, k=d, weights=w)
for one in samples:
print(one+1, file=f) |
p03371 | s715669250 | Accepted | A, B, C, X, Y = map(int, input().split())
cost = 10**9
for i in range(2*10**5+1):
if i%2==0:
a_num = X-int(0.5*i)
b_num = Y-int(0.5*i)
if a_num < 0 and b_num < 0:
break
cost = min(cost, A*max(a_num, 0)+B*max(b_num, 0)+C*i)
print(cost) |
p03059 | s969662806 | Accepted | a, b, t = map(int, input().split())
print(b * (t // a)) |
p03319 | s072322028 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
if (n-1)%(k-1)==0:
print((n-1)//(k-1))
else:
print((n-1)//(k-1)+1) |
p02791 | s040229430 | Accepted | n=int(input())
a=list(map(int,input().split()))
ans=0
t=10**6
for i in range(n):
if a[i]<t:
ans+=1
t=a[i]
print(ans) |
p03407 | s277006891 | Accepted | a,b,c = map(int,input().split())
if (a+b)>= c:
print("Yes")
else:
print("No")
|
p03971 | s808221891 | Accepted | n, a, b = map(int, input().split())
s = input()
all = list(s)
count = 0
count_b = 0
for i in all:
if i == 'a':
if count < a + b:
print('Yes')
count += 1
else:
print('No')
elif i == 'b':
if (count < a + b) and (count_b < b):
print('Yes')
count += 1
count_b += 1
else:
print('No')
else:
print('No')
|
p03126 | s993139573 | Accepted | n, m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(n)]
x = [0]*m
for i in range(n):
for j in range(1, a[i][0] + 1):
for k in range(1, 31):
if a[i][j] == k:
x[k-1] += 1
ans = 0
for l in x:
if l == n:
ans += 1
print(ans) |
p03605 | s343236738 | Wrong Answer | n=input()
print("YES" if "9" in n else "NO") |
p03150 | s631602602 | Wrong Answer | s=input()
ans='No'
for i in range(1,len(s)):
for j in range(i,len(s)):
if s[:i]+s[j:]=='keyence':
ans='Yes'
break
print(ans) |
p02603 | s807239919 | Accepted | import sys
import numpy as np
def Ss():
return sys.stdin.readline().rstrip().split(' ')
def Is():
ss = Ss()
return map(int, ss) if len(ss) > 1 else int(ss[0])
money = 1000
n = Is()
prices = [*Is()]
for today, tomorrow in zip(prices, prices[1:] + [0]):
buyable_stock_count = int(money / today)
new_money = money + buyable_stock_count * (tomorrow - today)
if new_money > money:
money = new_money
print(money) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.