problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03803 | s440654557 | Accepted | A,B = map(int, input().split())
if A == 1:
if B == 1:
print("Draw")
else:
print("Alice")
elif B == 1:
print("Bob")
else:
if A > B:
print("Alice")
elif A < B:
print("Bob")
else:
print("Draw") |
p03474 | s872145629 | Accepted | a,b = map(int, input().split())
s = input()
print('Yes' if s[a] == '-' and (s[:a] + s[a + 1:]).isdigit() else 'No')
|
p02918 | s318535684 | Wrong Answer | n, k = [int(i) for i in input().split()]
s = input()
n_group = 0
now = s[0]
cnt = 0
happy = 0
s += 'z'
for i in s:
if now != i:
n_group += 1
if cnt > 1:
happy += cnt - 1
cnt = 1
else:
cnt += 1
now = i
for i in range(k):
if n_group > 2:
n_group -= 2
happy += 2
else:
happy += 1
print (happy) |
p03136 | s778052759 | Wrong Answer | N = int(input())
li = list(map(int, input().split()))
li.sort()
sum = 0
for i in li[:-2]:
sum = i + sum
Nmax = li[-1]
if Nmax >= sum:
print("No")
else:
print("Yes")
|
p03612 | s465244914 | Accepted | def solve():
n = int(input())
l = list(map(int,input().split()))
res = 0
for i in range(n-1):
if l[i]==i+1:
l[i],l[i+1]=l[i+1],l[i]
res+=1
if l[n-1]==n:
res+=1
print(res)
if __name__=='__main__':
solve() |
p02618 | s376812477 | Wrong Answer | # -*- coding: utf-8 -*-
def main():
import sys
input = sys.stdin.readline
d = int(input())
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(d)]
for i in range(1, d + 1):
print(i)
if __name__ == '__main__':
main()
|
p02663 | s502500788 | Wrong Answer | h1, m1, h2, m2, k = map(int, input().split())
pos = 60 * (h2 - h1) + abs(m2 - m1)
print(pos - k)
|
p03645 | s952382117 | Accepted | n, m = map(int, input().split())
a = [False]*n
b = [False]*n
for i in range(m):
left, right = map(int, input().split())
if left == 1:
b[right-1] = True
if right == n:
a[left-1] = True
ans = 'IMPOSSIBLE'
for i in range(n):
if a[i] == True and b[i] == True:
ans = 'POSSIBLE'
print(ans)
|
p02882 | s365444641 | Wrong Answer | import math
a, b, x = map(int, input().split())
if a**2*b == x:
s = 0
elif (a**2)*b/2 <= x:
s = math.degrees(math.atan(a/(2*(b-(x/(a**2))))))
else:
s = math.degrees(math.atan(2*x/(a*b**2)))
print(90-s) |
p03208 | s349420749 | Wrong Answer | n, k = map(int, input().split())
H = sorted([int(input()) for _ in range(n)])
ans = 10e5
for i in range(n - k + 1):
select = H[i: i + k]
ans = min(ans, select[-1] - select[0])
print(ans) |
p02957 | s899200890 | Wrong Answer | A, B = map(int, input().split())
div, rem = divmod(abs(A - B), 2)
print("IMPOSSIBLE" if rem else abs(A - div)) |
p03695 | s326305511 | Accepted | n,*l=map(int,open(0).read().split())
c=[0]*13
for i in l: c[i//400]+=1
a=8-c[:8].count(0)
print(max(1,a),a+sum(c[8:])) |
p03387 | s337072020 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def main():
L = list(map(int, input().split()))
L.sort()
a, b, c = L[0], L[1], L[2]
ans = c - b
a += ans
if (c - a) % 2 != 0:
ans += 1
c += 1
print(ans + (c - a) // 2)
if __name__ == "__main__":
main()
|
p02832 | s194087600 | Accepted | N = int(input())
a = list(map(int, input().split()))
checknum = 1
for i in range(N):
if a[i] == checknum:
checknum += 1
if checknum == 1:
print(-1)
else:
print(N - checknum + 1)
|
p02700 | s422231614 | Accepted | A, B, C, D = list(map(int, input().split()))
while (C > 0) and (A > 0):
C = C - B
if C > 0:
A = A - D
else:
break
if A > 0:
print('Yes')
else:
print('No') |
p02631 | s605384390 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
#xor_a = [bin(x) for x in a]
#print(xor_a)
b = [sum(a) ^ a[x] for x in range(N)]
#b = [sum(a) ^ x for x in a] でもいける
print(' '.join(map(str, b))) #' 'joinにより空白を間にいれる。mapにより文字列に直す |
p03448 | s718228659 | Accepted | a = int(input())
b = int(input())
c = int(input())
x = int(input())
cnt = 0
for i in range(a+1):
for j in range(b+1):
for k in range(c+1):
if 500*i + 100*j + 50*k == x:
cnt += 1
print(cnt) |
p02683 | s845394217 | Accepted | import itertools
N, M, X = map(int, input().split())
CA = [list(map(int, input().split())) for _ in range(N)]
ans = 10 ** 7
for combs in itertools.product([0, 1], repeat=N):
tCA = [0] * (M + 1)
for i, c in enumerate(combs):
if c:
for j in range(M + 1):
tCA[j] += CA[i][j]
if sum([1 for a in tCA[1:] if a >= X]) == M:
ans = min(ans, tCA[0])
print(-1 if ans == 10 ** 7 else ans)
|
p03721 | s386560863 | Wrong Answer | n,k = map(int,input().split())
array = [0]*(10**5+1)
for i in range(n):
a,b = map(int,input().split())
array[a] += b
for i in range(1,n+1):
k -= array[i]
if k <= 0:
print(i)
break |
p03417 | s887461903 | Accepted | N, M = map(int,input().split())
if N > M:
N, M = M, N
if N == 1:
if M == 1:
ans = 1
else:
ans = M - 2
elif N == 2:
ans = 0
else:
ans = (N - 2) * (M - 2)
print(ans) |
p02682 | s095770850 | Accepted | a,b,c,k=map(int,input().split())
sum=0
if k>=a:
sum=a
rem=k-a
else:
sum=k
rem=0
if rem==0:
print(sum)
else:
if rem>=b:
rem=rem-b
else:
rem=0
print(sum)
if rem!=0:
sum=sum-rem
print(sum)
else:
print(sum)
|
p02918 | s456204837 | Wrong Answer | n,k=list(map(int,input().split()))
S=input()
c,row_count=S[0],1
for s in S:
if c != s:
c = s
row_count += 1
if row_count-1 <= k:
row_count = 1
else:
row_count -= k*2
print(n-row_count) |
p03835 | s358306148 | 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 z >= 0 and z <= K:
ans +=1
print(ans)
|
p02676 | s426485902 | Accepted | k=int(input())
s=input()
len_s=len(s)
if(len_s <= k):
print(s)
else:
print(s[:k]+"...") |
p03698 | s373883663 | Accepted | S = input()
cnt = 0
for i in range(len(S)):
for j in range(len(S)):
if i == j : pass
elif S[i] == S[j]: cnt += 1
else: pass
if cnt != 0: break
if cnt != 0 :break
print("yes" if cnt == 0 else "no")
|
p03494 | s661332178 | Accepted | n = int(input())
a = [ int(x) for x in input().split() ]
cnt = [ 0 for _ in range(n) ]
for i in range(n):
c = 0
while True:
if a[i] & 1:
break
c += 1
a[i] //= 2
cnt[i] = c
print(min(cnt)) |
p03371 | s168027380 | Accepted | a,b,c,x,y=map(int,input().split())
if a+b<=2*c:
print(a*x+b*y)
else:
if x>=y:
total=y*2*c
if a*(x-y)>=2*c*(x-y):
total+=2*c*(x-y)
else:
total+=a*(x-y)
else:
total=x*2*c
if b*(y-x)>=c*2*(y-x):
total+=2*c*(y-x)
else:
total+=b*(y-x)
print(total) |
p02556 | s609751337 | Wrong Answer | N=int(input())
arr=[]
for i in range(N):
x,y=map(int,input().split())
arr.append([x,y])
arr1=arr.copy()
arr1.sort()
arr2=arr.copy()
arr2.sort(key=lambda x:x[1])
print(max((abs(arr1[0][0]-arr1[-1][0])+abs(arr1[0][1]-arr1[-1][1])),abs(arr2[0][0]-arr2[-1][0])+abs(arr2[0][1]-arr2[-1][1]))) |
p02681 | s623285209 | Wrong Answer | S = input()
T = input()
if len(S) < 1:
print("NO")
elif len(S) > 10:
print("NO")
elif T[:-1] != S:
print("NO")
elif set(T) - set("abcdefghijklmnopqrstuvwxyz"):
print("NO")
else:
print("Yes") |
p02836 | s322901050 | Wrong Answer | s =input()
cnt =0
a =len(s)
if a%2==0:
a = a/2-1
else:
a = a//2 -1
for i in range(int(a)):
if s[i]!=s[-i-1]:
cnt +=1
print(cnt)
|
p03657 | s690303189 | Accepted | a,b = map(int, input().split())
if a%3 == 0 or b%3 ==0 or (a+b)%3 ==0:
print("Possible")
else:
print("Impossible") |
p02696 | s022174038 | Accepted | from math import floor
A,B,N = map(int,input().split())
x = min(B-1,N)
print(floor(A*x/B)-A*floor(x/B))
|
p02725 | s847454452 | Accepted | #!/usr/bin/env python3
k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
a.reverse()
for i in range(n-1):
a[i]-=a[i+1]
a[n-1] = 0
a.append(k-sum(a))
ans = k-max(a)
print(ans) |
p03433 | s354888400 | Wrong Answer | N = int(input())
a = sorted(list(map(int,input().split())), reverse = True)
print(sum(a[::2])-sum(a[1::2])) |
p02547 | s227083533 | Accepted | n = int(input())
c = 0
flag = False
for _ in range(n):
a, b = map(int, input().split())
if a == b:
c += 1
if c >= 3:
flag = True
else:
c = 0
print('Yes' if flag else 'No') |
p02900 | s946334349 | Wrong Answer | import math
import fractions
A,B=map(int,input().split())
s=fractions.gcd(A,B)
t=math.floor(math.sqrt(s))+1
l=set()
if s%2==0:
l.add(2)
while s%2==0:
s//=2
i=3
while i<=t:
if s%i==0:
l.add(s)
while s%i==0:
s=s//i
i+=2
print(len(l)+1) |
p03611 | s630037225 | Accepted | input()
*A,=map(int,input().split())
D=[0]*(10**7)
for a in A:
D[a-1]+=1
D[a]+=1
D[a+1]+=1
print(max(D)) |
p02678 | s135422806 | Wrong Answer | print("No") |
p03449 | s264393548 | Accepted | def main():
N = int(input())
Up = list(map(int,input().split()))
Down = list(map(int,input().split()))
ans = 0
for i in range(N):
tmp = sum(Up[:i+1]) + sum(Down[i:])
ans = max(ans,tmp)
print(ans)
if __name__ == "__main__":
main() |
p03385 | s413790093 | Accepted | s = input()
s = set(s)
if len(s) == 3:
print('Yes')
else:
print('No')
|
p02684 | s977221239 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
T = [1]
c = [0]*N
k = 1
st = 0
c[0] = 1
cc = 1
for i in range(N):
k = A[k-1]
if c[k-1] == 1:
st = T.index(k)
f = T[:st]
r = T[st:]
break
T.append(k)
c[k-1] += 1
cc += 1
ff = len(f)
if K < ff:
print(f[K])
else:
print(r[(K-ff)%(cc-ff)])
|
p03030 | s069511720 | Accepted | N = int(input())
table = []
for i in range(N):
tmp = list(input().split())
tmp[1] = int(tmp[1]) * (-1)
tmp_table = [tmp, i+1]
table.append(tmp_table)
table.sort()
for i in range(N):
print(table[i][1]) |
p02767 | s220818829 | Wrong Answer | def resolve():
N = int(input())
x_list = list(map(int, input().split()))
x_min = min(x_list)
x_max = max(x_list)
hp_min = 10**18
for i in range(x_min, x_max):
tmp_hp = 0
for j in x_list:
tmp_hp += (j - i)**2
if (hp_min is None) or (tmp_hp < hp_min):
hp_min = tmp_hp
print(hp_min)
if __name__ == "__main__":
resolve() |
p02785 | s894123881 | Wrong Answer | N,K=map(int,input().split())
H=list(map(int,input().split()))
H.sort()
if K>=N:
print(0)
else:
H=H[K:]
print(sum(H)) |
p02606 | s515798903 | Accepted | l, r, d = map(int, input().split())
ans = r//d - l//d
if l%d == 0 and r%d == 0:
ans += 1
print(ans) |
p02882 | s460957889 | Accepted | # ABC144 D
from math import atan2,pi
a,b,x=map(int,input().split())
if a*a*b>2*x:
h=2*x/(a*b)
print(90-atan2(2*x,a*b*b)*180/pi)
else:
print(atan2((2*(a*a*b-x)),a**3)*180/pi) |
p02546 | s354502555 | Accepted | S = list(input())
if S[-1] == 's':
S.append('e')
S.append('s')
else:
S.append('s')
strS = ''.join(S)
print(strS) |
p02629 | s850887769 | Accepted | N = int(input())
alpha = [chr(i) for i in range(97, 97+26)]
k=0
while N>=0:
N -= 26**k
k += 1
A = []
k -= 1
len_k = k
while k >= 0:
A.append(N//(26**k))
N %= (26**k)
k -= 1
res = []
for i in A[-len_k:]:
res.append(alpha[i])
print("".join(res)) |
p03208 | s499164341 | Accepted | N, K = map(int, input().split())
A = sorted([int(input()) for _ in range(N)])
ans = 1<<60
for i in range(N-K+1):
x = A[i+K-1] - A[i] # max-min
ans = min(ans, x)
print(ans) |
p02676 | s060835306 | Accepted | k=int(input())
s=input()
if len(s)<=k:
print(s)
else:
print(s[:k]+"...") |
p04005 | s099750860 | Wrong Answer | A,B,C = map(int, input().split())
if A%2==B%2==C%2==0:
print(0)
else:
print(min([A*B,B*C,C*A])) |
p02971 | s183541096 | Wrong Answer | import heapq
n = int(input())
a = [int(input()) for _ in range(n)]
m1, m2 = heapq.nlargest(2, a)
for ai in a:
print(ai if ai != m1 else m2)
|
p02766 | s330333850 | Accepted | def L():
return list(map(int, input().split()))
import math
[n,k]=L()
print(math.floor(math.log(n,k))+1) |
p02618 | s854753873 | Wrong Answer | de=int(input())
c=list(map(int,input().split()))
d=0
f=0
for i in range(de):
g=sum(list(map(int,input().split())))
if g>d:
d=g;f=i
for i in range(d):print(f) |
p02780 | s299673276 | Accepted | N,K = map(int,input().split())
p = list(map(int,input().split()))
s = 0
for i in range(0,K):
s = s + p[i]
t = s
for j in range(0,N-K):
u = s + p[j+K] - p[j]
if u > t:
t = u
s = u
print((t+K)/2) |
p02624 | s645049213 | Accepted | N = int(input())
ans = 0
for x in range(1, N + 1):
n = N // x
ans += n * (2 * x + (n - 1) * x) // 2
print(ans) |
p02658 | s865427197 | Accepted | N = int(input())
a = sorted(list(map(int,input().split())))
ans = 1
for i in a:
ans *= i
if ans > 10**18:
print(-1)
exit()
elif ans == 0:
print(0)
exit()
print(ans)
|
p03043 | s054707585 | Wrong Answer | N, K = [int(i) for i in input().split()]
c = 0
for i in range(1, N+1):
a = K // i
b = 1/N*pow(0.5, a)
c += b
print(c) |
p03720 | s340550834 | Accepted | L = []
n, m = map(int, input().split())
for i in range(m):
a, b = map(int, input().split())
L.append(a)
L.append(b)
for j in range(n):
print(L.count(j+1)) |
p03680 | s099705515 | Wrong Answer | n=int(input())
a=[int(input()) for _ in range(n)]
ans=2
count=0
if 2 in a:
while count<n:
for i in range(n):
if a[i]==ans:
ans=i+1
count+=1
if i==0:
print(count)
exit()
break
elif i==n-1:
print(-1)
exit()
print(-1) |
p02759 | s594871729 | Accepted | N = int(input())
if N % 2 == 0:
print(N//2)
else:
print(N//2 + 1) |
p02723 | s646576764 | Accepted | cf = str(input())
if cf[2] == cf[3]:
if cf[4] == cf[5]:
print("Yes")
else:
print("No")
else:
print("No") |
p03011 | s442443211 | Accepted | P, Q, R = map(int,input().split())
list = [P + Q, Q + R, R + P]
list.sort(reverse=False)
print(list[0]) |
p02801 | s633804049 | Accepted | c = input()
print(chr(ord(c)+1))
|
p02829 | s288894595 | Accepted | a = int(input())
b = int(input())
ans = [1,2,3]
ans.remove(a)
ans.remove(b)
print(ans[0]) |
p02768 | s613747747 | Accepted | n,a,b = map(int,input().split( ))
mod = 10**9+7
ans = pow(2,n,mod)
def chs(t,s):
res = 1
for i in range(t,t-s,-1):
res *= i
res %=mod
for i in range(1,s+1):
rev = pow(i,mod-2,mod)
res *= rev
res %=mod
return res
ans -= chs(n,a)
ans -= chs(n,b)
ans -= 1
ans %=mod
print(ans)
|
p02773 | s503421403 | Accepted | from sys import stdin
from itertools import groupby
n = int(stdin.readline().rstrip())
li = [stdin.readline().rstrip() for _ in range(n)]
li.sort()
lin = []
for key, value in groupby(li):
lin.append((key,len(list(value))))
lin.sort(key=lambda x:(x[1]*(-1),x[0]))
point = lin[0][1]
for i,j in lin:
if j == point:
print(i)
else:
break |
p03071 | s011033483 | Wrong Answer | def main():
num_list = list(map(int, input().split()))
sorted(num_list, reverse=True)
if num_list[0] -1 >= num_list[1]:
ans = num_list[0] + num_list[0] -1
else:
ans = num_list[0] + num_list[1]
print(ans)
if __name__ == '__main__':
main()
|
p03681 | s179114470 | Wrong Answer | N, M = map(int, input().split())
if abs(N - M) > 2:
print(0)
quit()
MOD = 10 ** 9 + 7
fact = [0] * (max(N, M) + 1)
f = 1
for i in range(1, max(N, M) + 1):
f = f * i % MOD
fact[i] = f
print(((N == M) + 1) * fact[N] * fact[M] % MOD) |
p02854 | s931929768 | Accepted | n=int(input())
l=list(map(int,input().split()))
count=0
suml=sum(l)
i=0
while count<suml/2:
count+=l[i]
i+=1
k=suml/2
a=l[i-1]
if count==k:
print(0)
else:
print(int(2*(min(count-k,a-count+k))))
|
p02618 | s545014833 | Accepted | D = int(input())
C = list(map(int, input().split()))
S = [list(map(int, input().split())) for i in range(D)]
for s in S:
print(s.index(max(s))+1) |
p02607 | s974510718 | Wrong Answer | N = int(input())
arr = list(map(int, input().split()))
count = 0
for i in range(N):
if (i%2 == 1) and (arr[i]%2 == 1):
count += 1
print(count) |
p04030 | s580826226 | Wrong Answer | s = list(input())
word = ""
for i in s:
if i != "B":
word += i
else:
if word != "":
word = word.rstrip(word[-1])
else:
pass
print(word) |
p02552 | s719939710 | Accepted | x = int(input())
print((x + 1) % 2) |
p03286 | s091981563 | Wrong Answer | n = int(input())
x = ''
while n != 0:
x += str(n%2)
n = -(n//2)
if x == '':
print(0)
else:
print(x)
|
p02677 | s089934623 | Accepted | import math
A, B, H, M = map(int, input().split())
deg_h = 0.5 * (60 * H + M)
deg_m = 6 * M
rad_h = math.radians(deg_h)
rad_m = math.radians(deg_m)
theta = abs(rad_h - rad_m)
c2 = (A ** 2) + (B ** 2) - (2 * A * B * math.cos(theta))
print(math.sqrt(c2)) |
p02759 | s853270517 | Wrong Answer | N=int(input())
if N%2==0:
print(N/2)
else:
print(N/2+1) |
p03419 | s569036423 | Wrong Answer | def main():
N, M = map(int, input().split())
if N == 1 or M == 1:
print(N*M-2)
return
if N == 2 or M == 2:
print(N*M-4)
return
print((N-2)*(M-2))
if __name__ == '__main__':
main()
|
p03137 | s104983644 | Wrong Answer | N, M = [int(x) for x in input().split()]
X = [int(x) for x in input().split()]
X.sort()
gap = [X[i + 1] - X[i] for i in range(M - 1)]
gap.sort()
# gapのエントリのうち大きい方からN - 1個は使わない
# 使うのは (M - 1) - (N - 1) = M - N個
print(sum(gap[0 : M - N])) |
p02712 | s789824918 | Accepted | num = int(input())
gou = 0
for i in range(num+1):
if (i % 3 == 0) or (i % 5 == 0):
gou = gou
else:
gou += i
print(gou)
|
p03274 | s204913459 | Wrong Answer | n, k = map(int, input().split())
X = list(map(int, input().split()))
Xl, Xr = [0], [0]
for x in X:
if x < 0:
Xl.append(abs(x))
else:
Xr.append(x)
while len(Xl) <= k:
Xl.append(10**9)
while len(Xr) <= k:
Xr.append(10**9)
Xl.sort()
ans = 10**9
for i in range(k):
ans = min(ans, Xl[i] + 2*Xr[k-i], 2*Xl[i] + Xr[k-i])
print(ans)
|
p03455 | s865623372 | Wrong Answer | a,b=input().split()
a=int(a)
b=int(b)
if (a*b)%2==0:
print('Odd')
else:
print('Even') |
p03328 | s487067469 | Accepted | a,b=map(int,input().split())
k=b-a
print(((1+k)*k)//2-b)
|
p03061 | s777088856 | Accepted | from itertools import accumulate
from math import gcd
N = int(input())
*A, = map(int, input().split())
L = list(accumulate(A, gcd))
R = list(accumulate(A[::-1], gcd))[::-1]
ans = max(gcd(l, r) for l, r in zip([0]+L[:-1], R[1:]+[0]))
print(ans)
|
p02910 | s617133405 | Accepted | s = input()
print('No' if 'L' in s[::2] or 'R' in s[1::2] else 'Yes') |
p02624 | s702255767 | Wrong Answer | from math import sqrt
N = int(input())
sqN = int(sqrt(N))
ans = 0
for i in range(1,sqN+1):
ans += i*(N//i)*(N//i+1)//2
if N % i == 0:
j = N//i
if j > i:
ans += j*((N//j)*(N//j+1)//2 - 1)
ans += (N - sqN)*(sqN+1+N)//2
print(ans)
|
p04045 | s474753724 | Accepted | n,k = input().split()
hate_num = input().split()
num = int(n)
boo = False
while(boo == False):
dec = []
for i in str(num):
dec.append(i not in hate_num)
if(False not in dec):
boo = True
num += 1
print(num-1) |
p02754 | s553682001 | Accepted | N,A,B = map(int,input().split())
a = N//(A+B)
ans = a*A
ans2 = min(N-(A+B)*a,A)
print(ans+ans2) |
p03136 | s546149810 | Accepted | n = int(input())
ar = list(map(int,input().split()))
l = max(ar)
if 2*l < sum(ar):
print('Yes')
else:
print('No') |
p02677 | s963979462 | Wrong Answer | import math
A,B,H,M = map(int,input().split())
print(( A**2 + B **2 - 2*B*A*(math.cos(math.radians(abs(30*H-6*M)))) )**0.5)
|
p02959 | s719426009 | Accepted | ## C - City Savers
N = int(input()) + 1
A = list(map(int,input().split()))
B = list(map(int,input().split())) + [0]
win = 0
remain = 0
for n in range(N):
if A[n] < remain:
win += A[n]
A[n] = 0
else:
win += remain
A[n] -= remain
if A[n] < B[n]:
win += A[n]
remain = B[n] - A[n]
else:
win += B[n]
remain = 0
print(win) |
p02784 | s448981375 | Accepted | H, N = input().split()
this_list = [int(x) for x in input().split()]
a = sum(this_list)
if(a>= int(H)):
print("Yes")
else:
print("No") |
p02753 | s511939409 | Wrong Answer | S = input()
if S == 'AAA' or 'BBB':
print('No')
else:
print('Yes') |
p03943 | s373706128 | Accepted | n = input().split()
a = int(n[0])
b = int(n[1])
c = int(n[2])
if (a + b) == c:
print('Yes')
elif (b + c) == a:
print('Yes')
elif (a + c) == b:
print('Yes')
else:
print('No') |
p02615 | s659564127 | Accepted | #!/usr/bin python3
# -*- coding: utf-8 -*-
def main():
N = int(input())
A = list(map(int, input().split()))
A.sort(reverse = True)
ret = 0
for i in range(1,N):
ret += A[i//2]
print(ret)
if __name__ == '__main__':
main() |
p03774 | s428092089 | Accepted | n,m = map(int,input().split())
a = [list(map(int,input().split())) for _ in range(n)]
b = [list(map(int,input().split())) for _ in range(m)]
for x in a:
ans,dist = -1,1000000000
for i in range(m):
d = abs(x[0]-b[i][0])+abs(x[1]-b[i][1])
if d < dist:
ans, dist = i+1,d
print(ans) |
p03000 | s774427925 | Accepted | n, x = map(int, input().split())
l = map(int, input().split())
d = 0
ans = 1
for li in l:
d += li
if d > x:
break
ans += 1
print(ans)
|
p02608 | s031105109 | Accepted | def resolve():
n=int(input())
a=[0]*(60000)
nn=int(n**0.5)
for x in range(1,nn):
for y in range(1, nn):
for z in range(1, nn):
a[x**2+y**2+z**2+x*y+y*z+z*x]+=1
for i in range(n):
print(a[i+1])
resolve() |
p03037 | s884765755 | Accepted | n, m = map(int, input().split())
inf = 0
sup = 100001
for i in range(m) :
l, r = map(int, input().split())
inf = max(inf, l)
sup = min(sup, r)
if sup >= inf :
print(sup-inf+1)
else :
print("0")
|
p03136 | s012548028 | Accepted | # -*- coding: utf-8 -*-
N = int(input().strip())
L_list=[int(i) for i in input().rstrip().split()]
#-----
L_list.sort()
print("Yes" if L_list[-1] < sum(L_list[:-1]) else "No")
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.