problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02775 | s726077729 | Accepted | n = list(map(int, reversed(input()))) + [0]
ans = 0
for i in range(len(n)-1):
if n[i] < 5:
ans += n[i]
elif n[i] == 5:
if i != len(n) - 1 and n[i + 1] >= 5:
n[i+1] += 1
ans += 10 - n[i]
else:
ans += n[i]
else:
n[i+1] += 1
ans += 10 - n[i]
if n[-1] > 0:
ans += n[-1]
print(ans) |
p02726 | s703039157 | Accepted | N, X, Y = map(int, input().split())
ls = [0] * N
for i in range(1, N+1):
for j in range(i+1, N+1):
dis = min([abs(j-i), abs(X-i) + 1 + abs(j-Y), abs(Y-i) + 1 + abs(j-X)])
ls[dis] += 1
for i in range(1, len(ls)):
print(ls[i]) |
p02880 | s780535855 | Accepted | n=int(input())
for i in range(1,10):
for j in range(1,10):
if i*j==n:
print('Yes')
exit()
print('No')
|
p03778 | s617128495 | Accepted |
x, a, b = map(int, input().split())
print(a - (b + x) if a > b else max(0, b - (a + x))) |
p02952 | s474052791 | Accepted | def main():
n = int(input())
ans = 0
for i in range(1, n+1):
if len(str(i)) % 2 != 0:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p03672 | s978589525 | Wrong Answer | s = input()
D = {}
for c in s:
if c in D.keys():
D[c] += 1
else:
D[c] = 1
for i in range(len(s)+1):
for k in D.values():
if k % 1:
break
else:
ans = len(s)-i
break
D[s[len(s)-1-i]] -= 1
print(ans) |
p02730 | s395486668 | Accepted | # coding: utf-8
s = input()
n = len(s)
f = 1
ss = s[:(n-1)//2]
for i in range((n-1)//4):
if not ss[i] == ss[-1*(i+1)]:
f = 0
break
tt = s[(n+3)//2-1:]
for i in range((n-1)//4):
if not tt[i] == tt[-1*(i+1)]:
f = 0
break
if ss != tt:
f = 0
if f:
print('Yes')
else:
print('No') |
p03038 | s157760341 | Accepted | from collections import Counter
n, m = map(int, input().split())
a = Counter(list(map(int, input().split())))
for i in range(m):
b, c = map(int, input().split())
a[c] += b
num = sorted(a.items(), key=lambda x: x[0], reverse=True)
ans = 0
for key, val in num:
if n > val:
ans += key * val
n -= val
else:
ans += key * n
break
print(ans) |
p03730 | s441937675 | Wrong Answer | a, b, c = map(int, input().split())
ans = 'NO'
total = 0
for i in range(1, 100000, a):
total += i
if total%b == c:
ans = 'YES'
break
print(ans)
|
p02707 | s913459747 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
data = [0 for i in range(N-1)]
for i in range(N-1):
data[A[i]-1] += 1
for j in range(N-1):
print(data[j], end = '\n') |
p03548 | s104289917 | Accepted | X,Y,Z = map(int,input().split())
temp = X-Z
ans = temp//(Y+Z)
print(ans) |
p02600 | s377193346 | Accepted | X = int(input())
if X >= 400 and X < 600:
print(8)
elif X>= 600 and X < 800:
print(7)
elif X>= 800 and X < 1000:
print(6)
elif X>= 1000 and X < 1200:
print(5)
elif X>= 1200 and X < 1400:
print(4)
elif X>= 1400 and X < 1600:
print(3)
elif X>= 1600 and X < 1800:
print(2)
elif X>= 1800 and X < 2000:
print(1) |
p03017 | s381006097 | Accepted | n, a, b, c, d = map(int, input().split())
a, b, c, d = a-1, b-1, c-1, d-1
s = input()
if "##" in s[a:d]:
print("No")
exit()
if c < d:
for i in range(b, d):
if s[i:i+2] == "##":
print("No")
exit()
print("Yes")
else:
for i in range(b, d+1):
if s[i] != "#" and s[i-1] == "." and s[i+1] == ".":
print("Yes")
exit()
print("No") |
p02582 | s771098075 | Accepted | import sys
sys.setrecursionlimit(10**9)
def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))
INF=10**20
def main():
S = input()
if S == "RRR":
print(3)
elif S[1:3] == "RR" or S[0:2] == "RR":
print(2)
else:
ans = 0
for s in S:
if s == "R":
ans = 1
print(ans)
if __name__ == "__main__":
main() |
p02777 | s449784190 | Wrong Answer | S, T = input().split()
A, B = [int(i) for i in input().split()]
U = input()
dic = {S: A, T: B}
dic[U] -= 1
print(' '.join(map(str, dic.values()))) |
p02983 | s083293272 | Accepted | l,r=map(int,input().split())
m=l//2019
l-=m*2019
r-=m*2019
if r>=2019:
print(0)
exit()
ans=2018
for i in range(l,r+1):
for j in range(i+1,r+1):
ans=min(ans,i*j%2019)
print(ans) |
p03035 | s350182548 | Accepted | a,b=map(int,input().split())
if a>=13:
print(b)
elif a>=6:
print(b//2)
else:
print(0) |
p03069 | s897370076 | Accepted | N = int(input())
S = input()
white_count = [0]*(N+1)
black_count = [0]*(N+1)
for i in range(N):
black_count[i+1] = black_count[i]
if S[i] == "#":
black_count[i+1] += 1
S = S[::-1]
for i in range(N):
white_count[i+1] = white_count[i]
if S[i] == ".":
white_count[i+1] += 1
answer = 10**6
for i in range(N+1):
answer = min(answer,black_count[i]+white_count[N-i])
print(answer) |
p02582 | s290142508 | Accepted | A = input()
count = 0
for a in range(3):
if A[a] == 'R':
count+=1
if count == 2 and A[1] == 'S':
count = 1
print(count) |
p02832 | s117831057 | Accepted | N = int(input())
A = list(map(int, input().split()))
cur = 1
cnt = 0
for a in A:
if (a == cur):
cur += 1
else:
cnt += 1
if cnt == N:
print(-1)
else:
print(cnt)
|
p02779 | s539622634 | Accepted | n = int(input())
a_set = set(map(int, input().split()))
if len(a_set) == n:
print("YES")
else:
print("NO") |
p03331 | s700678817 | Wrong Answer | a = int(input())
lim = a // 2
soma_lista = []
menor = 100000
for i in range(a - 1, lim, -1):
b = str(a - abs(i)) + str(abs(i))
soma = 0
for digit in b:
soma += int(digit)
if soma < menor:
menor = soma
if a == 2:
print(a)
print(menor)
|
p03086 | s907502350 | Accepted | s = input()
count = 0
max_count = 0
for c in s:
if c in ['A','C','G','T']:
count += 1
if max_count < count:
max_count = count
else:
count = 0
print(max_count)
|
p02571 | s379306271 | Wrong Answer | s=str(input())
t=str(input())
l=0
for i in range(len(s)-len(t)+1):
print(s[i:i+len(t)])
p=0
for j in range(len(t)):
if t[j] == s[i:i+len(t)][j]:
p+=1
l=max(l,p)
print(len(t)-l) |
p03328 | s958645307 | Accepted | a, b = map(int, input().split())
for i in range(1000):
if b-a == i:
print(i*(i-1)//2 - a)
break |
p02970 | s254803162 | Accepted | n,d = map(int,input().split())
d += d + 1
print((n+d-1)//d) |
p02661 | s158463935 | Accepted | n = int(input())
a = []
b = []
for _ in range(n):
aa, bb = list(map(int, input().split()))
a.append(aa)
b.append(bb)
import numpy as np
if n%2 == 0:
print(int((np.median(b) - np.median(a)) / 0.5) + 1)
else:
print(int((np.median(b) - np.median(a))) + 1) |
p03360 | s253359874 | Accepted | # スマホ
l=list(map(int,input().split()))
k=int(input())
s=max(l)
ans=sum(l)-s
ans+=s*pow(2,k)
print(ans) |
p03481 | s758332219 | Accepted | x,y=[int(_) for _ in input().split()]
ans=0
while x<=y:
x*=2
ans += 1
print(ans) |
p03281 | s758561164 | Wrong Answer | N = int(input())
ans = 0
if N>=105:
ans = 1
print(ans) |
p02724 | s413781962 | Accepted | x = int(input())
gohyaku = x // 500
goen = (x -500*gohyaku) // 5
print(gohyaku*1000 + 5 * goen)
|
p03037 | s791555230 | Accepted | import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
N,M = MI()
A = [0]*(N+2)
for i in range(M):
l,r = MI()
A[l] += 1
A[r+1] -= 1
from itertools import accumulate
A = list(accumulate(A))
print(sum(A[i] == M for i in range(1,N+1)))
|
p03672 | s422294525 | Accepted | s=list(input())
while True:
s.pop()
l=len(s)
if l%2==0 and s[0:l//2]==s[l//2:] :
print(l)
exit()
|
p02618 | s494759655 | Wrong Answer | import numpy as np
D = int(input())
c = np.array( list(map(int, input().split())) )
#
s = [[] for i in range(D)]
for i in range(D):
s[i] = np.array( list(map(int, input().split())) )
#
v = 0
cc = np.array( [0]*26 )
last = np.array( [-1]*26 )
for d in range(D):
cc += c
av = s[d] - sum( cc ) + cc
av2 = av + cc*min((D-d-1),13)
m = max(av2)
for t in range(26):
if av2[t] == m:
cc[t] = 0
v += av[t]
print(t+1)
break
#
print( v )
|
p02971 | s016325860 | Accepted | N = int(input())
List = [int(input()) for _ in range(N)]
s_list = sorted(List,reverse=True)
Max1 = s_list[0]
Max2 = s_list[1]
for i in range(N):
if List[i]==Max1:
print(Max2)
else:
print(Max1) |
p02747 | s252265605 | Wrong Answer | # coding: utf-8
d = {"h":0, "i":0}
S = input()
if len(S) == 1:
print("No")
exit()
flag = True
for i in range(len(S)-1):
if S[i:i+2] != "hi":
flag = False
break
print("Yes" if flag else "No") |
p03323 | s068312467 | Wrong Answer | a,b = map(int,input().split())
if a > 8 or b > 8:
print(":(")
else:
print("Yey!") |
p03285 | s783184522 | Accepted | N = int(input())
ans = 'No'
for i in range((N // 7) + 1):
if (N - 7 * i) % 4 == 0:
ans = 'Yes'
print(ans) |
p03639 | s821816986 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))
f2 = 0
f4 = 0
for a in A:
#c = collections.Counter(prime_factorize(a))
if a%4 == 0:
f4 += 1
elif a%2 == 0:
f2 += 1
if n -f2//2 *2 -f4 *2 <= 0:
print('Yes')
else:
print('No') |
p03285 | s277684453 | Accepted | #!/usr/bin/env python3
n = int(input())
a = 0
while(1):
tmp = n - 7*a
if tmp % 4 == 0:
print("Yes")
exit()
a += 1
if a*7 > n:
print("No")
exit()
|
p02723 | s789591910 | Wrong Answer | a = input()
if len(a) == 6:
print("No")
else:
if (a[2] == a[3])and(a[4] == a[5]):
print("Yes")
else:
print("No") |
p02972 | s050960214 | Accepted | N = int(input())
a = list(map(int,input().split()))
m_list = []
m_num = 0
ans_ls = [0]*N
for i in range(N):
temp = 0
num = N - i
j = 1
while num*j <= N:
temp += ans_ls[num*j-1]
j += 1
if (temp + a[num-1])%2 == 1:
ans_ls[num-1] = 1
m_list.append(str(num))
m_num += 1
m_list.sort()
print(m_num)
print(' '.join(m_list))
|
p02615 | s928750946 | Accepted | import sys
N=int(sys.stdin.readline().strip())
A=map(int, sys.stdin.readline().split())
A.sort(reverse=True)
N-=1
ans=0
for i,a in enumerate(A):
if i==0:
ans+=a
N-=1
else:
if 2<=N:
ans+=a*2
N-=2
elif N==1:
ans+=a
N-=1
elif N==0:
print ans
quit()
|
p03150 | s226576498 | Wrong Answer | S = input()
if (S[0:3] == 'key' and S[-4:] == 'ence') or (S[0:7] == 'keyence') or (S[-7:] == 'keyence'):
print("YES")
else:
print("NO") |
p03103 | s327297945 | Wrong Answer | n, m = map(int, input().split())
ab = []
for i in range(n):
a, b = map(int, input().split())
ab.append([a,b])
ab.sort()
ans = 0
if len(ab) == 1:
if m >= ab[0][1]:
print(ab[0][0] * ab[0][1])
exit()
else:
print(ab[0][0] * m)
exit()
for i, j in ab:
for k in range(j):
if m != 0:
print(m)
m -= 1
ans += i
else:
print(ans)
exit()
|
p02659 | s531727217 | Accepted | a,b=input().split()
a=int(a)
b=int(b[0])*100+int(b[2])*10+int(b[3])
ans=a*b
print(int(ans//100))
|
p03760 | s201771180 | Wrong Answer | O = list(input())
E = list(input())
for x,y in zip(O,E):
print(x+y,end="")
|
p02971 | s973198427 | Accepted | n = int(input())
l = [int(input()) for i in range(n)]
l2 = sorted(l)
c2 = l.index(l2[-2])
c = l.index(max(l))
d = max(l)
for i in range(n):
if i != c:
print(d)
else:
print(l2[-2]) |
p02627 | s004047372 | Accepted | a = input()
if ord(a) >= 97:
print("a")
else:
print("A") |
p03544 | s404301441 | Accepted | n = int(input())
ans = [0] * (n + 1)
ans[0] = 2
ans[1] = 1
for i in range(n - 1):
ans[i + 2] = ans[i + 1] + ans[i]
print(ans[-1]) |
p03417 | s114033936 | Accepted | #n = int(input())
#s = input()
n,m = map(int,input().split())
#da = list(map(int,input().split()))
if(n == 1 and m == 1): print(1)
elif (n == 1 or m == 1): print(n*m-2)
else: print((m-2)*(n-2)) |
p02772 | s353457417 | Accepted | N = int(input())
A = list(map(int,input().split()))
flag = 0
for num in range(N):
tmp = A[num]
flag = 0 if (tmp%2==0 and (tmp%3==0 or tmp%5==0)) or tmp%2==1 else 1
if flag == 1:
break
ans = 'APPROVED' if flag==0 else 'DENIED '
print(ans) |
p02596 | s537390892 | Accepted | k = int( input() )
# a = 7
# for _ in range( 30 ):
# print( a % k )
# a = 10 * a + 7
rem_list = []
first_rem = 7 % k
a = 7
cnt = 0
while True:
r = a % k
cnt += 1
if r == 0:
print( cnt )
break
elif cnt > 2 and cnt > k:
print( -1 )
break
else:
a = ( 10 * r + 7 ) % k |
p03251 | s297918827 | Wrong Answer | n,m,x,y=map(int,input().split())
p=list(map(int,input().split()))
q=list(map(int,input().split()))
if y-x>=1:
kouho=[t for t in range(y+1)][x+1:]
p.sort()
q.sort()
c=0
for i in range(0,len(kouho)-1):
c+=1
if p[n-1]<kouho[i]<=q[0]:
print("No War")
break
if c==len(kouho):
print("War")
else:
print("War") |
p03835 | s944416719 | Wrong Answer | k,s = map(int,input().split())
ans = 0
for i in range(k+1):
for j in range(k+1):
if 0 <= s - i - j <= k: ans += 1
elif s - i - j > k: break
print(ans) |
p03632 | s195870656 | Wrong Answer | a, b, c, d = map(int, input().split())
if a < c and c < b and b < d:
print(b-c)
elif a < c and d < b:
print(b-a)
elif c < a and b < d:
print(d-c)
else:
print(0)
|
p02627 | s164724028 | Accepted | str = input()
if str.isupper() == True:
print('A')
else:
print('a') |
p02628 | s664486967 | Wrong Answer | N,K=map(int,input().split())
p=list(map(int,input().split()))
B=0
p.sort()
N=N-5
K=K-1
for i in range(0,K):
B=B+p[i]
i=i+1
print(B)
|
p03544 | s334604132 | Accepted | N = int(input())
L = [0] * (N + 1)
def f(i):
if i == 0:
return 2
if i == 1:
return 1
if L[i] == 0:
L[i] = f(i - 1) + f(i - 2)
return L[i]
print(f(N))
|
p03986 | s243986015 | Accepted | a = b = 0
for s in input():
if s == 'S':
a += 1
else:
if a == 0:
b += 1
else:
a -= 1
print(a+b) |
p02699 | s029105378 | Accepted | num_list = [int(i) for i in input().split()]
if num_list[0] <= num_list[1]:
print('unsafe')
else:
print('safe') |
p02789 | s365142061 | Accepted | N,M = map(int,input().split())
if(N == M):
print("Yes")
else:
print("No") |
p03208 | s756880462 | Accepted | n, k = map(int, input().split())
h = sorted([int(input()) for _ in range(n)])
min_diff = 10**9
for i in range(n - k + 1):
min_diff = min(min_diff, h[i + k - 1] - h[i])
print(min_diff) |
p02879 | s960705393 | Wrong Answer | A, B = map(int, input().split())
print(-1 if A*B > 81 else A*B) |
p03086 | s008376708 | Wrong Answer | s = input()
L = "ACGT"
ans = ""
ss = ""
for i in range(len(s)):
if s[i] in L:
ans += s[i]
flag = True
else:
if len(ans)>len(ss):
ss = ans
break
print(len(ss)) |
p02595 | s137799269 | Accepted | n,d=map(int,input().split())
c=0
for _ in range(n):
x,y=map(int,input().split())
k=(x**2+y**2)**(1/2)
if k<=d:
c+=1
print(c)
|
p02761 | s845638331 | Accepted | import sys
N, M = map(int, input().split())
num_map = [None for _ in range(N)]
for _ in range(M):
s, c = map(int, input().split())
s -= 1
if s > N or (num_map[s] is not None and num_map[s] != c) or (s == 0 and c == 0 and N > 1):
print(-1)
sys.exit()
num_map[s] = c
num_map.reverse()
ans = 0
for i, num in enumerate(num_map):
if num is not None:
ans += num*(10**i)
elif i == N-1 and N > 1:
ans += (10**i)
print(ans)
|
p02778 | s629705928 | Wrong Answer | S = input()
T = S.replace("*","x")
print(T) |
p03971 | s959722725 | Accepted | n,a,b=map(int,input().split())
s=input()
j=0#japan
f=0#foreign
for i in s:
if i=='a':
if j+f<a+b:
j+=1
print('Yes')
else:
print('No')
elif i=='b':
if j+f<a+b and f<b:
f+=1
print('Yes')
else:
print('No')
else:
print('No') |
p03059 | s912777587 | Wrong Answer | import sys
input = lambda: sys.stdin.readline().rstrip()
A,B,T = map(int, input().split())
T = T + 0.5
times = T // A
print(B*times) |
p02729 | s539216027 | Wrong Answer | n,m=map(int,input().split())
print(n//2+m//2) |
p03075 | s138144412 | Accepted | a = [int(input()) for _ in range(5)]
k = int(input())
for i in range(4):
if a[i+1] - a[0] > k:
print(":(")
exit()
print("Yay!") |
p02691 | s265886457 | Accepted | from collections import Counter
N = int(input())
A = list(map(int, input().split()))
A1 = []
A2 = []
for i in range(1,N+1):
A1.append(i + A[i-1])
A2.append(i - A[i-1])
c1 = Counter(A1)
c2 = Counter(A2)
result = 0
for k in set(c1).intersection(c2):
result += c1[k] * c2[k]
print(result) |
p02607 | s665193242 | Accepted | N=int(input())
A=list(map(int,input().split()))
ans=0
for i in range(N):
if i%2==0 and A[i]%2!=0:
ans+=1
print(ans)
|
p03472 | s049917594 | Wrong Answer | N,H=map(int,input().split())
A=[list(map(int,input().split())) for i in range(N)]
B=[]
C=[]
for a,b in A:
B.append(a)
C.append(b)
D=sorted(B)[::-1]
b=D[0]
F=[]
for i in C:
if b<i:
F.append(i)
cnt=0
for i in F:
H-=i
cnt+=1
if H<=0:
print(cnt)
exit()
print(cnt-((-H)//b)) |
p03437 | s080629664 | Accepted | x,y=map(int,input().split())
print(-1 if x%y==0 else x)
|
p03745 | s155423932 | Accepted | N = int(input())
A = list(map(int,input().split()))
A = A
f = 0
ans = 1
for k in range(N-1):
if f == 0:
if A[k] > A[k+1]:
f = -1
elif A[k] < A[k+1]:
f = 1
elif f == 1:
if A[k] > A[k+1]:
ans += 1
f = 0
else:
if A[k] < A[k+1]:
ans += 1
f = 0
print(ans)
|
p03385 | s821823688 | Accepted | s = input()
if "a" in s and "b" in s and "c" in s:
print("Yes")
else:
print("No")
|
p02866 | s990365630 | Accepted | n = int(input())
mod = 998244353
count = [0]*(10**5+1)
L = list(map(int,input().split()))
M = max(L)
ans = 0
for i in range(n):
count[L[i]] += 1
for i in range(M+1):
if count[i] == 0:
ans = 0
break
else:
if i == 0:
if count[i] != 1:
ans = 0
break
else:
ans = 1
else:
ans = ans*((count[i-1]**count[i])%mod)
ans = ans%mod
if L[0] == 0:
print(ans)
else:
print(0) |
p02583 | s421942549 | Accepted | n = int(input())
l = list(map(int,input().split()))
l.sort()
ans = 0
for i in range(n):
for j in range(i+1,n):
for k in range(j+1,n):
a = l[i]
b = l[j]
c = l[k]
if a == b or b == c or c == a:
continue
if l[i] + l[j] > l[k]:
ans += 1
print(ans) |
p03221 | s868950804 | Accepted | from collections import defaultdict
N, M = map(int, input().split())
iPY = []
D = defaultdict(list)
E = defaultdict(int)
for i in range(M):
P, Y = map(int, input().split())
iPY.append((i, P, Y))
iPY.sort(key = lambda x: x[2])
for i, P, Y in iPY:
D[P].append(Y)
for P, Ys in D.items():
for i, Y in enumerate(Ys):
E[Y] = "000000"+str(i+1)
iPY.sort()
for i, P, Y in iPY:
U = "000000"+str(P)
L = E[Y]
print(U[-6:]+L[-6:]) |
p02623 | s461063118 | Wrong Answer | n, m, k = map(int, input().split())
a_list = list(map(int, input().split()))
b_list = list(map(int, input().split()))
max = 10 ** 9 + 1
time = 0
ans = 0
a = 0
b = 0
for i in range(n + m):
if a_list[a] < b_list[b]:
time += a_list[a]
a += 1
else:
time += b_list[b]
b += 1
if time > k:
break
else:
ans += 1
if a >= n:
a_list.append(max)
if b >= m:
b_list.append(max)
print(ans)
|
p02572 | s505082819 | Wrong Answer | import numpy as np
N = int(input())
As = np.array(list(map(int, input().split())))
m = 10**9 + 7
result = 0
a = (As.sum() ** 2)
b = (As ** 2).sum()
print(int(((a - b)/2)%m)) |
p03611 | s811903672 | Accepted | n=int(input())
a=list(map(int,input().split()))
from collections import Counter
c=Counter(a)
a=set(a)
ans=0
for aa in a:
t=0
t+=c[aa-1]
t+=c[aa]
t+=c[aa+1]
ans=max(ans,t)
print(ans)
|
p03075 | s081774075 | Accepted | l = [int(input()) for _ in range(5)]
k = int(input())
for i in range(5):
for j in range(i+1,5):
if l[j]-l[i] > k:
print(":(")
exit(0)
print("Yay!") |
p02603 | s239365038 | Accepted | n = int(input())
a_li = list(map(int,input().split()))
low = a_li[0]
high = a_li[0]
old = a_li[0]
yen = 1000
for i in range(1,n):
if old < a_li[i]:
div, yen = divmod(yen, old)
yen += div * a_li[i]
old = a_li[i]
print(yen) |
p02860 | s828883081 | Accepted | n=int(input())
s=input()
if s[0:n//2]==s[n//2:n]:
print("Yes")
else:
print("No") |
p02772 | s306597956 | Accepted | N=int(input())
A=list(map(int, input().split()))
tmp=[]
ans=True
for i in A:
if i%2==0:
tmp.append(i)
else:
continue
for i in tmp:
if i%3==0 or i%5==0:
continue
else:
ans=False
if ans:
print("APPROVED")
else:
print("DENIED") |
p02989 | s024472678 | Accepted | n=int(input())
dif=list(map(int,input().split()))
dif.sort()
print(dif[int(n/2)]-dif[int(n/2-1)]) |
p03254 | s423831918 | Accepted | n,x = map(int,input().split())
a = list(map(int,input().split()))
a = sorted(a)
count = 0
s = 0
for i in range(n):
if i == n-1:
if x == a[i]:
count += 1
else:
s += a[i]
if x > a[i]:
x -= a[i]
count += 1
elif x < a[i]:
break
else:
count += 1
break
print(count) |
p03951 | s839388945 | Accepted | n = int(input())
s = input()
t = input()
a = 0
for i in range(n):
if s[n - i - 1:] == t[:i + 1]:
a = i + 1
print(n * 2 - a)
|
p02699 | s188390861 | Accepted | (s, w) = tuple(map(int, input().split(" ")))
if w >= s:
print("unsafe")
else:
print("safe") |
p02780 | s456777178 | Accepted | N,K = map(int,input().split())
P = list(map(int,input().split()))
cums = [0]
for p in P:
cums.append(cums[-1] + (p+1)/2)
ans = 0
for i in range(N-K+1):
ans = max(ans, cums[i+K] - cums[i])
print(ans) |
p03419 | s451535117 | Wrong Answer | N, M = map(int, input().split())
if N == 1 and M == 1:
print(1)
elif N == 1:
print(M - 2)
else:
print((N - 2) * (M - 2))
|
p03043 | s622505413 | Accepted | n, k = map(int, input().split())
ans = 0
for i in range(n):
for j in range(21):
if (i+1)*(2**j) >= k:
break
ans += 1/(n * 2**j)
if j == 0:
break
ans += (n-i-1)/n
print(ans) |
p03679 | s909020968 | Wrong Answer | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
X, A, B = map(int, input().split())
if X - A < 0:
print('dangerous')
elif A - B < 0:
print('safe')
else:
print('delicious')
if __name__ == "__main__":
main()
|
p02633 | s109335999 | Accepted | import math
k, = list(map(int,input().split()))
print(abs(360*k) // math.gcd(360, k) // k) |
p03293 | s848907886 | Accepted | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))
s = list(input())
n = len(s)
t = list(input())
for i in range(n+5):
now = []
now.append(s[-1]); s.pop(-1)
now += s
s = now
if s == t:
print('Yes')
break
else:
print('No') |
p02958 | s345778117 | Accepted | import numpy as np
n = int(input())
a = np.array(list(map(int, input().split())))
b = np.array(list(range(1, n+1)))
if sum(a != b) <= 2:
print("YES")
else:
print("NO") |
p03220 | s054811917 | Accepted | N=int(input())
T, A=map(int, input().split())
H=input().split()
V=[abs(T-0.006*int(h)-A) for h in H]
minv = V[0]
index=0
for i,v in list(enumerate(V)):
if v<minv:
minv=v
index=i
print(index+1)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.