problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03107 | s464777243 | Wrong Answer | def solve():
S = input()
one,zero = 0,0
for s in S:
if s=='0':
zero += 1
else:
if zero>0:
one += 1
ans = min(one,zero)*2
return ans
print(solve()) |
p03951 | s441665828 | Accepted | N = int(input())
s = input()
t = input()
lcm = 0
for i in range(N):
f = False
c = 0
idx = 0
for j in range(i, N):
if s[j] == t[idx]:
c += 1
else:
break
idx += 1
lcm = max(lcm, c)
print(N*2-lcm)
|
p02701 | s668978712 | Wrong Answer | x, lists, d = eval(input()), list(map(str, input().split())), {}
for item in lists:
if item in d:
d[item] += 1
else:
d[item] = 1
print(len(d)) |
p03387 | s121733334 | Accepted | a, b, c = map(int, input().strip().split(" "))
m = max(a, b, c)
if (m*3) % 2 == (a+b+c) % 2:
M = m * 3
else:
M = (m+1) * 3
M -= (a+b+c)
print(M//2) |
p02628 | s372127962 | Wrong Answer | N,K=map(int,input().split())
a=map(int,input().split())
ans = sorted(a)
answer = ans[:3]
aaa = sum(answer)
print(aaa) |
p02630 | s951230750 | Accepted | from collections import Counter
n=int(input())
a=list(map(int,input().split()))
q=int(input())
S = [list(map(int, input().split())) for _ in range(q)]
C=Counter(a)
#print(C)
ans=0
for k,v in C.items():
ans+=k*v
#print(ans)
for i in range(q):
if S[i][0] in C:
if C[S[i][0]]>=1:
ans+=(S[i][1]-S[i][0])*C[S[i][0]]
C[S[i][1]]+=C[S[i][0]]
C[S[i][0]]=0
print(ans) |
p03284 | s934558974 | Accepted | n, k = map(int, input().split())
if n%k==0:
print(0)
else:
print(1) |
p03814 | s196294973 | Wrong Answer | s = input()
for i in range(len(s)):
if s[i] == "A":
st = i-1
break
for i in range(len(s)):
if s[-i] == "Z":
en = len(s)-i
break;
print(en - st) |
p03862 | s892680733 | Wrong Answer | n,x = list(map(int,input().split()))
a = list(map(int,input().split()))
op=0
for i in range(len(a)-1):
s = a[i]+a[i+1]
if (s < x):
continue
else:
diff = s - x
op += diff
if a[i] >= a[i+1]:
a[i] -= diff
else:
a[i+1] -= diff
print(op) |
p02555 | s248070389 | Wrong Answer | from operator import mul
from functools import reduce
def combinations_count(n, r):
r = min(r, n - r)
numer = reduce(mul, range(n, n - r, -1), 1)
denom = reduce(mul, range(1, r + 1), 1)
return numer // denom
N = int(input())
ans = 0
amari = int(N % 3)
shou = int(N // 3)
for i in range(shou):
ans = (ans + combinations_count((amari + shou - 1), amari)) % (10**9 + 7)
amari += 3
shou -= 1
print(ans)
print(ans)
|
p03797 | s735798176 | Wrong Answer | import sys;input = lambda : sys.stdin.readline()
n,m = map(int,input().split())
print(n+(m-2*n)//4)
|
p02706 | s358528123 | Accepted | N, M = map(int, input().split())
A = list(map(int, input().split()))
homework = sum(A)
if sum(A) <= N:
print(N - sum(A))
else:
print(-1) |
p02775 | s288649046 | Accepted | s = input()
s = '0' + s[::-1]
dp = [[0, 0] for _ in range(len(s) + 1)]
for i in range(len(s)):
for j in range(2):
if j == 0: #ぴったり
dp[i + 1][j] = min(dp[i]) + int(s[i])
else: #1枚多めに払う
dp[i + 1][j] = min(dp[i][1] + 9 - int(s[i]), dp[i][0] + 11 - int(s[i]))
print(min(dp[-1])) |
p03252 | s640245162 | Accepted | s = str(input())
t = str(input())
ds = {}
dt = {}
for i in range(len(s)):
if s[i] not in ds:
ds[s[i]] = 1
else:
ds[s[i]] += 1
for i in range(len(t)):
if t[i] not in dt:
dt[t[i]] = 1
else:
dt[t[i]] += 1
vs = list(ds.values())
vt = list(dt.values())
vs.sort()
vt.sort()
#print(vs)
#print(vt)
if vs == vt:
print('Yes')
else:
print('No') |
p03211 | s044402814 | Accepted | s = input()
dlist = []
for i in range(len(s)-2):
x = s[i:i+3]
x = int(x)
d = x - 753
if d < 0:
d = -d
dlist.append(d)
else:
dlist.append(d)
print(min(dlist))
|
p02583 | s196764683 | Wrong Answer |
N = input()
L_list = [int(l) for l in input().split()]
L_list = list(set(sorted(L_list)))[::-1]
count = 0
for i in range(len(L_list)):
for j in range(i, len(L_list)):
for k in range(i, len(L_list)):
if L_list[i] + L_list[j] > L_list[k]:
if L_list[i] != +L_list[j] and L_list[k] != L_list[j] and L_list[k] != L_list[i]:
count += 1
print(count) |
p02682 | s602830386 | Wrong Answer | A, B, C, K = map(int, input().split())
ans = 0
if A + B >= K:
print(A)
else:
print(A - (K-(A+B))) |
p02811 | s757525363 | Accepted | k, x = map(int, input().split())
if ((500 * k) >= x):
print("Yes")
else:
print("No") |
p03556 | s390429807 | Accepted | def actual(N):
for i in range(N, 0, -1):
is_square_number = (i ** 0.5) % 1 == 0
if is_square_number:
return i
N = int(input())
print(actual(N)) |
p03419 | s683499898 | Accepted | def myAnswer(N:int,M:int) -> int:
if(N == 1 and M == 1): return 1
if(min(N,M) == 1): return max(N,M) - 2
if(min(N,M) == 2): return 0
return N*M - (max(N,M) * 2 + (min(N,M) - 2) * 2)
def modelAnswer():
return
def main():
N,M = map(int,input().split())
print(myAnswer(N,M))
if __name__ == '__main__':
main() |
p03416 | s992786963 | Accepted | A, B = map(int, input().split())
ans = 0
for i in range(A, B+1):
s = list(str(i))
s.reverse()
s = ''.join(s)
if s == str(i):
ans += 1
print(ans)
|
p02957 | s671048133 | Accepted | import sys
def main():
A, B = map(int, input().split())
ab = abs(A+B)
if ab % 2 == 1:
print('IMPOSSIBLE')
else:
print(ab // 2)
return
if __name__ == "__main__":
main()
sys.exit(0) |
p03657 | s586053647 | Wrong Answer | a=list(map(int,input().split()))
b=sum(a)
if (b%3 ==0 or a[0]%3 ==0 or a[1]==0) :
print('Possible')
else :
print('Impossible') |
p02701 | s419548766 | Accepted | N = int(input())
S = {}
for i in range(N):
temp = input()
S[temp] = 1
ans = 0
for i in S:
ans += 1
print(ans) |
p03487 | s193514189 | Accepted | N = int(input())
A = list(map(int,input().split()))
B = (10**5+1)*[0]
ans = 0
for a in A:
if a<=10**5:
B[a]+=1
else:
ans+=1
for n in range(10**5):
if B[n]<n:
ans+=B[n]
elif n<B[n]:
ans+=B[n]-n
print(ans) |
p02848 | s690267832 | Wrong Answer | N = int(input())
S = input()
arr = "ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ"
c = ""
for s in S:
c = c + arr[arr.find(s)+2:arr.find(s)+3]
print(c) |
p02694 | s207913485 | Accepted | x = int(input())
m = 100
r = 1.01
i = 0
while m < x:
m = int(m*1.01)
i += 1
print(i) |
p03289 | s184973748 | Wrong Answer | S = list(input())
C = S[2:-1]
if S[0] == "A" and "C" in C:
print("AC")
else:
print("WA") |
p02783 | s948700926 | Accepted | H, A = map(int,input().split())
count = 0
while H > 0:
H -= A
count += 1
print(count) |
p02811 | s731358286 | Wrong Answer | a,b = map(int,input().split())
#L = list()map(int,input().split())
if a*500 >= b:
print("YES")
else:
print("NO")
|
p02775 | s256307354 | Wrong Answer | ans = 0
for s in reversed(input()):
n = int(s)
if n < 6:
ans += n
else:
ans += (10 - n) + 1
print(ans) |
p03030 | s560120128 | Accepted | n = int(input())
sp = []
for i in range(n):
s, p = input().split()
sp.append([s, int(p)])
sorted_sp = sorted(sp, key=lambda x: x[1], reverse=True)
sorted_sp = sorted(sorted_sp, key=lambda x: x[0])
for i in range(n):
print(sp.index(sorted_sp[i]) + 1)
|
p03061 | s640738335 | Wrong Answer | from fractions import gcd
n=int(input())
A=list(map(int,input().split()))
L=[0]*n
R=[0]*n
L[0]=A[0]
R[n-1]=A[n-1]
res=0
for i in range(1,n):
L[i]=gcd(L[i-1],A[i-1])
for i in range(0,n-1):
R[n-i-2]=gcd(R[n-i-1],A[n-i-1])
for i in range(1,n-1):
res=max(res,gcd(L[i-1],R[i+1]))
res=max(res,L[n-1],R[0])
print(res) |
p02795 | s693814164 | Wrong Answer | h = int(input())
w = int(input())
n = int(input())
print(n//max(h,w)) |
p02677 | s357724851 | Accepted | import math
a, b, h, m = map(int, input().split())
C = 2 * math.pi * (60*h - 11*m) / 720
c = a**2 + b**2 - 2*a*b*math.cos(C)
print(math.sqrt(c))
|
p02880 | s357543669 | Accepted | def yes_no(flg):
"""
if True return Yes
if False return No
"""
if flg:
print('Yes')
else:
print('No')
n = int(input())
flg = False
for y in range(1,10):
for x in range(1,10):
if y * x == n:
flg = True
yes_no(flg) |
p03352 | s873240285 | Accepted | x=int(input())
a=[]
for i in range(2,11):
for j in range(1,32):
a.append(j**i)
a=[l for l in a if l <= x]
print(max(a)) |
p03219 | s604622838 | Wrong Answer | X,Y=list(map(int,input().split()))
print(X+Y/2) |
p03994 | s704690653 | Wrong Answer | s=list(input())
k=int(input())
cnt=0
for i in range(len(s)):
num_al=ord(s[i])
a_=123-num_al
if k==0:break
if s[i]=='a':continue
if a_<=k:
k-=a_
s[i]='a'
elif a_>k and i<len(s)-1:continue
else:
s[i]=chr(num_al+k)
k=0
print(''.join(s)) |
p02618 | s709874104 | Wrong Answer | for i in range(1,26):
print(i) |
p02947 | s382694087 | Accepted | N=int(input())
ans=0
li=[]
for i in range(N):
s=list(input())
s.sort()
li.append(s)
li.sort()
temp=1
for j in range(N-1):
if li[j]==li[j+1]:
temp+=1
else:
ans+=temp*(temp-1)//2
temp=1
ans+=temp*(temp-1)//2
print(ans)
|
p03774 | s049425673 | Accepted | import numpy as np
N, M = map(int, input().split())
ab = []
for i in range(N):
tmp = list(map(int, input().split()))
ab.append(tmp)
ab = np.array(ab)
dist = np.full([N, M], np.inf)
for m in range(M):
tmp = np.array(list(map(int, input().split())))
for n in range(N):
dist[n, m] = np.abs(ab[n] - tmp).sum()
dist = dist.astype("int")
for d in dist:
print(d.argmin()+1) |
p02594 | s191086082 | Accepted | print('Yes' if int(input()) >= 30 else 'No') |
p03796 | s890799428 | Accepted | import math
print(math.factorial(int(input()))%(10**9+7))
|
p03815 | s829349659 | Accepted | n = int(input())
q, r = divmod(n, 11)
if r == 0:
print(q*2)
elif r <= 6:
print(q*2 + 1)
else:
print(q*2 + 2) |
p03352 | s664648055 | Accepted | def solve():
X = int(input())
ans = 1
for b in range(1, X):
for p in range(2, X):
if b ** p <= X:
ans = max(ans, b ** p)
else:
break
print(ans)
if __name__ == "__main__":
solve()
|
p02880 | s351359892 | Accepted | n=int(input())
ln=[1,2,3,4,5,6,7,8,9]
ls=[]
for i in ln:
for j in ln:
ls.append(i*j)
if n in ls:
print("Yes")
else:
print("No") |
p02726 | s081232679 | Accepted | from itertools import combinations
from collections import Counter
N, X, Y = map(int, input().split())
C = Counter(min(abs(i - j), abs(X - i) + abs(Y - j) + 1, abs(X - j) + abs(Y - i) + 1) for i, j in combinations(range(1, N + 1), 2))
print("\n".join(str(C[k]) for k in range(1, N))) |
p03472 | s761121269 | Accepted | n,h=map(int,input().split())
x=[]
for i in range(n):
a,b=map(int,input().split())
x.append([a,0])
x.append([b,1])
x.sort(reverse=1)
i=ans=0
while h>0:
if x[i][1]:
h-=x[i][0]
ans+=1
else:
ans+=0--h//x[i][0]
h=0
i+=1
print(ans) |
p02665 | s451483584 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
import math
ans=0
for i in range(N, 0, -1):
if A[i]>2**(i):
ans=-1
break
if i!=0:
q=math.ceil(A[i]/2)
if q==0:
q=1
print(A[i]+q)
ans=ans+A[i]+q
print(ans) |
p02754 | s357755233 | Accepted | n, a, b = map(int, input().split())
result = 0
result += (n // (a+b))*a
result += min(a, n%(a+b))
print(result) |
p03644 | s191684552 | Accepted | N = int(input())
for i in range(1, 8):
if 2**i > N:
print(2**(i-1))
exit() |
p02699 | s816495382 | Accepted | S, W = map(int, input().split())
if W >= S:
print('unsafe')
else:
print('safe')
|
p02547 | s192099873 | Wrong Answer | N = int(input())
cnt = []
for i in range(N):
a, b = map(int, input().split())
if a == b:
cnt.append(1)
else:
cnt.append(0)
from itertools import groupby
for key, group in groupby(cnt):
if len(list(group)) >= 3:
print('Yes')
exit()
print('No')
|
p03324 | s333853476 | Accepted | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
d, n = MAP()
m = 100 ** d * n
if n == 100:
m = 100 ** d * 101
print(m) |
p02729 | s121769838 | Accepted | import math
N,M = map(int,input().split())
ans_N=0
ans_M=0
if N != 0:
ans_N=(N*(N-1))//2
if M != 0:
ans_M=(M*(M-1))//2
print(ans_N+ans_M) |
p03478 | s784988964 | Wrong Answer | N, A, B = map(int, input().split())
ans = 0
for i in range(1, 1+N):
s = str(i)
if A <= sum(map(int, s)) <= B:
ans += 1
print(ans)
|
p02881 | s520677768 | Wrong Answer | N = int(input())
X=10**12
Y=10**12
flag = 0
for i in range(2,int(N**0.5)):
if N%i==0:
flag = 1
temp = N//i
if X+Y > temp+i:
X = i
Y = temp
if flag==0:
X = N
Y = 1
print(X+Y-2) |
p03437 | s094957713 | Accepted | '''
Created on 2020/08/20
@author: harurun
'''
def main():
import sys
pin=sys.stdin.readline
pout=sys.stdout.write
perr=sys.stderr.write
X,Y=map(int,pin().split())
if X%Y==0:
print(-1)
return
print(X)
return
main() |
p02818 | s830818439 | Accepted | a, b, k = map(int, input().split())
if k<=a:
print(a-k, b)
elif a<k and k<=(a+b):
print(0, b-(k-a))
else:
print(0, 0) |
p03495 | s867874906 | Accepted | from collections import defaultdict
n,k=map(int,input().split())
l=list(map(int,input().split()))
a=defaultdict(int)
for i in l:
a[i] += 1
a=list(a.items())
if len(a) <= k:
print(0)
else:
ans = 0
a.sort(key = lambda x: x[1])
for i in range(len(a) - k):
ans += a[i][1]
print(ans)
|
p02556 | s358834224 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N = int(input())
XY = [list(mapint()) for _ in range(N)]
XY.sort(key=lambda x:x[0]+x[1])
ans_1 = abs(XY[0][0]-XY[-1][0])+abs(XY[0][1]-XY[-1][1])
XY.sort(key=lambda x:x[0]-x[1])
ans_2 = abs(XY[0][0]-XY[-1][0])+abs(XY[0][1]-XY[-1][1])
print(max(ans_1, ans_2)) |
p02555 | s711746808 | Accepted | import math
n=int(input(""))
mk=n//3
s=0
kaizyou=1
for i in range(1,mk+1):
t=1
a=math.factorial(i-1)
for k in range(i-1):
t*=(n-2*i-1-k)
t%=a*(10**9+7)
t/=a
t%=(10**9+7)
s+=t
s%=(10**9+7)
print(int(s))
|
p03799 | s569302530 | Wrong Answer | n, m = map(int, input().split())
m += n * 2
print(m // 4) |
p02693 | s769136112 | Accepted | k = int(input())
a, b = map(int, input().split())
f = False
for i in range(1, 1001):
t = i * k
if a <= t and t <= b:
f = True
break
if t > b:
break
if f:
print('OK')
else:
print('NG') |
p02696 | s961342899 | Accepted | a,b,n = map(int,input().split())
if n >= b-1: x = b-1
else: x = n
ans = (a * x) // b - a * (x // b)
print(ans) |
p02663 | s360124405 | Accepted | H1,M1,H2,M2,K=map(int, input().split())
min=(H2-H1)*60+M2-M1
print(min-K)
|
p03261 | s873142524 | Accepted | N=int(input())
correct = True
words = set({})
W = input()
words.add(W)
last_letter = W[len(W)-1]
for i in range(1,N):
W = input()
if not W in words and W[0] == last_letter:
words.add(W)
last_letter = W[len(W)-1]
else:
correct = False
break
if correct:
print('Yes')
else:
print('No')
|
p02957 | s979470588 | Wrong Answer | a,b = map(int, input().split())
print((a+b)/2) if (a+b)%2 == 0 else print("IMPOSSIBLE")
|
p03472 | s731017804 | Accepted | n,h=map(int,input().split())
a=[0]*n
b=[0]*n
for i in range(n):
a[i],b[i]=map(int,input().split())
ab=sorted(a+b)[::-1]
ans=0
for i in ab[:ab.index(max(a))]:
h-=i
ans+=1
if h<=0:
print(ans)
exit()
ans+=(h+max(a)-1)//max(a)
print(ans) |
p02777 | s836045314 | Wrong Answer | s,t = map(str,input().split())
a,b = map(int,input().split())
u=input()
if s==u:
print(a-1)
else:
print(b-1) |
p03815 | s340762718 | Wrong Answer | x = int(input())
a = x//11
b = x%11
if b > 6: print(2*a+2)
else: print(2*a+1) |
p03250 | s850392768 | Accepted | a = [int(x) for x in input().split()]
a.sort(reverse=True)
print(a[0]*10+a[1]+a[2])
|
p03486 | s229293489 | Wrong Answer | s = str(sorted(input()))
t = str(sorted(input()))[::-1]
print('Yes' if s < t else 'No')
|
p02817 | s257891661 | Accepted | st = input()
list = (st.split())
print(list[1]+list[0])
|
p02922 | s858247434 | Wrong Answer | a,b = map(int, input().split())
res = 0
c = 1
while c < b:
c += a - 1
res += 1
print(res) |
p02861 | s636284589 | Wrong Answer | from math import sqrt,factorial
n = int(input())
l = []
for i in range(n):
d = list(map(int,input().split()))
l.append(d)
x = 2//n
ans = 0
for i in range(n-1):
for j in range(i+1,n):
ans += x*sqrt(((l[i][0]-l[j][0])**2 + (l[i][1]-l[j][1])**2))
print(ans) |
p03852 | s842148904 | Wrong Answer | a = str(input())
boin = ["a","e","i","o","u"]
if a in boin:
print("voewl")
else:
print("consonant") |
p03679 | s705117800 | Accepted | x, a, b = map(int, input().split())
if -a+b <= 0:
print('delicious')
elif 0 < -a+b <= x:
print('safe')
else:
print('dangerous')
|
p03804 | s714956532 | Accepted | n, m = map(int, input().split())
a = []
b = []
for _ in range(n):
a.append(input())
for _ in range(m):
b.append(input())
def detect(i, j):
flag = True
for k in range(len(b)):
for l in range(len(b)):
if i+k >= n or j+l >= n or a[i+k][j+l] != b[k][l]:
flag = False
break
if not flag:
break
return flag
ans = "No"
for i in range(len(a)):
for j in range(len(a)):
if detect(i, j):
ans = "Yes"
break
if ans == "Yes":
break
print(ans) |
p02628 | s044375741 | Wrong Answer | n,k = map(int,input().split())
p = list(map(int,input().split()))
p.sort()
print(sum(p[:3]))
|
p03352 | s434568752 | Wrong Answer | x = int(input())
ans = 0
for i in range(x + 1):
if i * i > x: break
ans = i * i
print(ans) |
p02661 | s562671706 | Wrong Answer |
N=int(input())
A=[]
B=[]
for i in range(N):
a, b=map(int, input().split())
A.append(a)
B.append(b)
A.sort()
B.sort()
if N%2==0:
sca=scb=N//2-1
lca=lcb=N//2
x=A[lca]+A[sca]
y=B[lcb]+B[lcb]
print(x-y+1)
else:
ca=cb=N//2
ans=B[cb]-A[ca]+1
print(ans)
|
p03795 | s492264368 | Accepted | n = int(input())
print(800 * n - 200 * int(n / 15)) |
p03387 | s762318609 | Wrong Answer | a, b, c = map(int, input().split())
max_num = max(a, b, c)
if max_num % 2 == 0:
max_num += 1
print(int((max_num * 3 - (a + b + c)) / 2))
|
p02690 | s211201892 | Wrong Answer | X = int(input())
for A in range(10**18):
diff = X - A**5
if diff < 0:
minus_flg = False
diff = abs(diff)
else:
minus_flg = True
B = pow(diff, 0.2)
if (isinstance(B, float)) and B.is_integer():
break
if minus_flg:
B = int(B)*-1
print(A, int(B)) |
p03095 | s819899313 | Wrong Answer | n = int(input()); s = input()
a = [0]*26; b = 1
for i in range(n): a[ord(s[i])-97] += 1
for i in range(26): b *= a[i]+1
print(b-1) |
p04011 | s452794299 | Accepted | n = int(input())
k = int(input())
x = int(input())
y = int(input())
print(min(n, k) * x + max(n - k, 0) * y) |
p02623 | s616365723 | Accepted | n,m,k = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a = [0]
b = [0]
for i in range(n):
a.append(a[i] + A[i])
for i in range(m):
b.append(b[i] + B[i])
ans = 0
j = m
for i in range(0, n+1):
if a[i] > k:
break
while b[j] > k - a[i]:
j -= 1
ans = max(ans, i+j)
print(ans) |
p02948 | s964518005 | Wrong Answer | n, m = map(int, input().split())
d = []
for _ in range(n):
a, b = map(int, input().split())
d.append((b, a))
d.sort(reverse=True)
cnt = m
ans = 0
i = 0
while i < min(n, m):
if d[i][1] <= cnt:
ans += d[i][0]
i += 1
cnt -= 1
else:
i += 1
print(ans) |
p02784 | s974702431 | Accepted | H, N = map(int, input().split())
attacks = list(map(int, input().split()))
if sum(attacks) >= H:
print("Yes")
else:
print("No")
|
p02829 | s998175519 | Accepted | a = int(input())
b = int(input())
if a != 3 and b != 3:
print(3)
elif a != 2 and b != 2:
print(2)
else:
print(1) |
p02720 | s831725745 | Accepted | k = int(input())
lis = [1,2,3,4,5,6,7,8,9]
i=0
while len(lis) < k:
m = lis[i]%10
if m != 0:
lis.append(int(str(lis[i])+str(m-1)))
lis.append(int(str(lis[i])+str(m)))
if m!= 9:
lis.append(int(str(lis[i])+str(m+1)))
i+=1
print(lis[k-1]) |
p03486 | s702526442 | Accepted | s=list(input())
t=list(input())
u=sorted(s)
v=sorted(t,reverse=True)
print("Yes" if u<v else "No") |
p02972 | s977161997 | Accepted | n = int(input())
nums = [int(i) for i in input().split()]
box = [0] * n
for i in range(1, n + 1)[::-1]:
c = i * 2
ball = nums[i - 1]
while c <= n:
ball = ball ^ box[c - 1]
c += i
box[i - 1] = ball
ans = box.count(1)
print(ans)
ball = []
for i in range(n):
if box[i] == 1:
ball.append(i + 1)
print(*ball)
|
p02817 | s941507808 | Accepted | s, t = map(str, input().split())
print(t+s) |
p03544 | s605833159 | Accepted | n = int(input())
l = [2, 1]
for i in range(2, n+1):
l.append(l[i-2]+l[i-1])
print(l[-1]) |
p02747 | s011374283 | Wrong Answer | S=input()
SET=set(list(S))
if ("h" in SET) and ("i" in SET) and len(SET)==2:
print("Yes")
else:
print("No") |
p02842 | s167806257 | Wrong Answer | N=int(input())
a=N/1080
if int(a*1080)==N:
print(a)
else:
print(':(')
|
p03061 | s926009372 | Accepted | import math
n = int(input())
a = list(map(int,input().split()))
r ,l = [0] * (n),[0] * (n)
l[0] = 0
r[n-1] = 0
for i in range(1,n):
l[i] = math.gcd(l[i-1],a[i-1])
r[n-i-1] = math.gcd(r[n-i],a[n-i])
m = [0] * n
for i in range(n):
m[i] = math.gcd(l[i],r[i])
print(max(m))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.