problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03679 | s773592667 | Accepted | X, A, B = map(int, input().split())
mypoint = 0
if mypoint-A+B<=mypoint:
print("delicious")
elif mypoint-A+B<=X:
print("safe")
else:
print("dangerous") |
p03419 | s341041897 | Accepted | import sys
import math
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def Lx(k):return list(map(lambda x:int(x)*-k,sys.stdin.readline().replace("\n","").split()))
if __name__ == "__main__":
n ,m = I2()
if n == 2 or m == 2:
print(0)
else:
print(max(1, n - 2)*max(1, m - 2)) |
p03254 | s900033476 | Accepted | N, x = map(int, input().split())
an = list(map(int, input().split()))
an.sort()
ans = 0
for a in an:
x -= a
if x < 0:
break
ans += 1
if x > 0:
ans -= 1
print(ans)
|
p02836 | s324761646 | Accepted | a = input()
c = 0
for i in range(len(a) // 2):
if a[i] != a[- 1 - i]:
c += 1
print(c) |
p02909 | s406379994 | Accepted | s = input()
if s == 'Sunny': print('Cloudy')
elif s == 'Cloudy': print('Rainy')
else: print('Sunny') |
p02996 | s784636695 | Wrong Answer | n = int(input())
AB = [list(map(int,input().split())) for _ in range(n)]
AB.sort(key=lambda x: x[1], reverse=True)
# print(AB)
free = 0
now = 0
ok = True
for necessary, deadline in AB:
if necessary <= free:
free -= necessary
continue
if now + necessary > deadline:
ok = False
break
free = deadline - necessary - now
now = deadline
print("Yes" if ok else "No")
|
p02859 | s076440942 | Accepted | print(int(input())**2) |
p03208 | s208836745 | Wrong Answer | N, K = map(int, input().split())
H = [int(input()) for _ in range(N)]
H.sort()
df = 0
min_h = H[K-1]-H[0]
for i in range(1, N-K-1):
new_h = H[i+K-1]-H[i]
if new_h < min_h:
min_h = new_h
print(min_h)
|
p02694 | s033589258 | Wrong Answer | import math
X = int(input())
ans = 0
money = 100 #初期金額
while money < X:
money += math.floor(money*0.01)
ans += 1
print(ans) |
p02607 | s848262667 | Accepted | N = int(input())
a_list = list(map(int, input().split()))
cnt = 0
for i, a in enumerate(a_list, 1):
if i%2==1 and a%2==1:
cnt += 1
print(cnt) |
p03720 | s136973425 | Accepted | n, m = map(int, input().split())
ans = [0]*n
for i in range(m):
a, b = map(int, input().split())
ans[a-1] += 1
ans[b-1] += 1
for i in range(n):
print(ans[i])
|
p02681 | s634784163 | Accepted | print('Yes' if input() == input()[:-1] else 'No') |
p02597 | s180154900 | Accepted | N = int(input())
C = input()
num_R = C.count("R")
num_W = C.count("W")
C_fin = ["R" if i < num_R else "W" for i in range(len(C))]
count = 0
for c, c_fin in zip(C, C_fin):
if(c == c_fin):
count += 1
ans = (len(C) - count)//2
print(ans) |
p02835 | s495941236 | Wrong Answer | A_int_list = list(map(int, input().split()))
if sum(A_int_list) <= 22:
print('bust')
else:
print('win')
|
p02987 | s981033786 | Accepted | s = str(input())
s1 = [s[i] for i in range(4)]
from collections import Counter
s2 = Counter(s1).most_common(2)
if s2[0][1] == 2 and s2[1][1] == 2:
print('Yes')
else:
print('No') |
p03803 | s035733849 | Accepted | a, b = map(int, input().split())
if a == 1:
a = 14
if b == 1:
b = 14
if a == b:
print("Draw")
else:
print("Alice") if a > b else print("Bob")
|
p03555 | s462493124 | Wrong Answer | t=list(input())
s=list(input())
if reversed(t)==s and reversed(s)==t:
print('YES')
else:
print('NO') |
p03644 | s756209053 | Accepted | n = int(input())
i = 0
while(True):
if 2**i > n:
print(2**(i-1))
break
else :
i += 1 |
p02765 | s648203762 | Accepted | # import math
# import bisect
# import heapq
# from collections import deque
# import numpy as np
# n, m = map(int, input().split())
n,r = map(int,input().split())
ans = r
if n < 10:
ans = r + 100 * (10 - n)
print(ans)
|
p03821 | s888383279 | Accepted | A = int(input())
ans = 0
listA = []
for i in range(A):
listA.append(list(map(int,input().split())))
listA = listA[::-1]
for i in range(A):
if (listA[i][0]+ans) % listA[i][1] == 0:
continue
if listA[i][1] == 1:
continue
ans += listA[i][1]-(listA[i][0]+ans)%listA[i][1]
print(ans) |
p02994 | s026969363 | Accepted | def main():
N, L = map(int, input().split())
e = sorted((x + L for x in range(N)), key=lambda x: abs(x))
ans = N * L + (N - 1) * N // 2 - e[0]
print(ans)
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
|
p02772 | s181593544 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
B=[]
C=0
for i in range(N):
if A[i]%2==0:
B.append(A[i])
for i in range(len(B)):
if B[i]%3!=0 and B[i]%5!=0:
C+=1
if C==0:
print('APPRPVED')
if C!=0:
print('DENIED') |
p02606 | s205097945 | Accepted | [L, R, d] = list(map(int, input().split()))
max_d = R // d
min_d = L // d
sho_R = R % d
sho_L = L % d
if sho_R == 0 and sho_L == 0:
ans = max_d - min_d + 1
else:
ans = max_d - min_d
print(ans) |
p02784 | s367812398 | Accepted | H, N = map(int, input().split())
a = list(map(int, input().split()))
if sum(a) >= H:
print('Yes')
else:
print('No') |
p03136 | s994180741 | Accepted | n=int(input())
l=list(map(int,input().split()))
m=max(l)
print('Yes' if sum(l)-m>m else 'No') |
p02768 | s241544867 | Accepted | n, a, b = map(int, input().split())
MOD = 10**9+7
def comb(n, k, MOD):
x = 1
for i in range(k):
x *= (n-i)
x *= pow(i+1, MOD-2, MOD)
x %= MOD
return x
ans = pow(2, n, MOD) - 1 - comb(n, a, MOD) - comb(n, b, MOD)
ans += MOD
ans %= MOD
print(ans) |
p03481 | s213972843 | Wrong Answer | import math
x,y = map(int,input().rstrip().split(' '))
n = int(math.log2(y/x))
print(n) |
p03331 | s174008371 | Accepted | # A - Digits Sum
N = input()
N_int = int(N)
mylist = ['10','100','1000','10000','100000']
ans = 0
if N in mylist:
ans = 10
else:
for i in range(len(N)):
ans += (N_int % 10)
N_int = N_int // 10
print(ans) |
p02697 | s400253131 | Wrong Answer | n, m = map(int, input().split())
if n % 2 == 1:
for i in range(m):
print(1+i, n-1-i)
else:
for i in range(m):
print(1+i, n-i)
|
p03633 | s521717695 | Wrong Answer | nu = int(input())
lis = []
ans = 0
for i in range(nu):
t = int(input())
lis.append(t)
lis.sort()
for i in range(10*18):
tes = lis[-1] * (i+1)
for f in lis:
if tes % f == 0:
ans = 1
else:
ans = -1
break
if ans == 1:
break
print(tes)
|
p02917 | s627302781 | Wrong Answer | N = int(input())
B = list(map(int, input().split()))
B.append(10 ** 5 + 1)
ans = 0
for i in range(N - 1):
ans += min(B[i], B[i + 1])
print(ans) |
p03474 | s171865894 | Accepted | A,B = map(int,input().split())
S = input()
for i in range(A+B+1):
if i < A and S[i] == '-':
print('No')
exit(0)
elif i == A and S[i] != '-':
print('No')
exit(0)
elif i > A and S[i] == '-':
print('No')
exit(0)
print('Yes') |
p03274 | s740261095 | Accepted | n, k = map(int, input().split())
x = list(map(int, input().split()))
if k == 1:
min_num = 10**20
for i in x:
if abs(i) < min_num:
min_num = abs(i)
print(min_num)
exit()
min_dist = 10**20
dist = 0
for i in range(n-k+1):
dist = (x[i+k-1] - x[i])
dist += min(abs(x[i+k-1]), abs(x[i]))
if dist < min_dist:
min_dist = dist
print(min_dist) |
p02615 | s610579290 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
A.sort()
A.reverse()
happy = 0
circle = [A[0], A[1]]
for i in range(2, N):
circle.insert(len(circle)-2, A[i])
happy += min(circle[-1], circle[-3])
print(happy) |
p02723 | s813808845 | Wrong Answer | s = input()
print('YES') if s[2] == s[3] and s[4] == s[5] else print('NO') |
p03317 | s979684668 | Wrong Answer | n,k = map(int, input().split())
A = list(map(int, input().split()))
m = min(A)
i = A.index(m)
cnt = 0
if i!=0:
cnt += -(-(i-1)//(k-1))
if i!=n-1:
cnt += -(-n+i)//(k-1)
print(cnt) |
p03075 | s666254906 | Wrong Answer | a = input()
b = input()
c = input()
d = input()
e = input()
k = input()
if k>e -a:
print "yay"
else:
print":("
|
p02659 | s097046450 | Accepted | from decimal import Decimal
def main():
A, B = input().split()
A = Decimal(A)
B = Decimal(B)
print(int(A * B))
if __name__ == '__main__':
main()
|
p02577 | s491403055 | Wrong Answer | a = int(input())
print("Yes" if a % 9 == 0 and a != 0 else "No") |
p03433 | s764063170 | Accepted | def main():
n,a = (int(input()) for _ in range(2))
print('Yes' if n%500 <= a else 'No')
if __name__ == '__main__':
main() |
p02639 | s971210337 | Wrong Answer | x_ = list(map(int, input().split()))
for i in range(len(x_)):
if x_[i] == 0:
print(i) |
p03251 | s336205274 | Wrong Answer | def main():
n,m,X,Y=sorted(map(int,input().split()))
x=max([X]+list(map(int,input().split())))
y=min([Y]+list(map(int,input().split())))
print("No War" if x<y else "War")
if __name__ == "__main__":
main() |
p03910 | s621805990 | Accepted | n = int(input())
k = 1
i = 1
while k < n:
i += 1
k += i
while n > i:
print(i)
n -= i
i -= 1
print(n) |
p02676 | s819337296 | Wrong Answer | K = int(input())
S = input()
Sl = len(S)
if Sl <= K:
ans = S
else:
newS = S[0 : K-1]
ans = (newS + "...")
print(ans) |
p02555 | s242650581 | Accepted | mod = 10**9+7
f = [1]
for i in range(1, 2001):
f.append(f[-1]*i%mod)
S = int(input())
ans = 0
for n in range(1, S//3+1):
r = S-n*3
ans += f[r+n-1] * pow(f[n-1], mod-2, mod) * pow(f[r], mod-2, mod) % mod # comb(r+n-1, r)
ans %= mod
print(ans)
|
p02873 | s534894924 | Accepted | S=input()
N=[[0,0] for i in range(len(S)+1)]
for i in range(len(S)):
if(S[i]=="<"):
N[i+1][0]=N[i][0]+1
if(S[-1-i]==">"):
N[-2-i][1]=N[-1-i][1]+1
s=0
for i in range(len(N)):
s+=max(N[i][0],N[i][1])
print(s)
|
p03759 | s990648865 | Accepted | a,b,c=map(int,input().split())
if b-a==c-b:
print('YES')
else:
print('NO') |
p02623 | s424575913 | Accepted | n, m, k = map(int, input().split())
a = [0] + list(map(int, input().split()))
b = [0] + list(map(int, input().split()))
for i in range(1, n+1):
a[i] += a[i-1]
for i in range(1, m+1):
b[i] += b[i - 1]
ans = 0
b_cnt = m
for a_cnt in range(n+1):
if a[a_cnt] > k:
continue
while a[a_cnt] + b[b_cnt] > k:
b_cnt -= 1
ans = max(ans, a_cnt + b_cnt)
print(ans)
|
p03862 | s029403717 | Accepted | # coding: utf-8
n, x = map(int,input().split())
A = list(map(int,input().split()))
S = sum(A)
for i in range(n-1):
s = A[i+1] + A[i]
if s > x:
if s-x > A[i+1]:#後ろから全部引ける時
t = s-x-A[i+1]
A[i+1] = 0
A[i] -= t
else:#後ろから全部引くと負になるとき(前からも引く)
A[i+1] -= s - x
print(S - sum(A)) |
p02939 | s651792547 | Wrong Answer | S=input()
prv=''
cnt=1
for i in range(len(S)):
#print(i,S[i],cnt,prv)
if S[i] == prv:
continue
cnt+=1
prv=S[i]
print(cnt) |
p03076 | s355539286 | Wrong Answer | a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
lst = [a,b,c,d,e]
last = 9
ttl = 0
for i in range(5):
if lst[i]%10 != 0:
ttl += (lst[i]+(10-lst[i]%10))
if lst[i]%10 == 0:
ttl += lst[i]
if 0 <(lst[i]%10) <= last:
last = lst[i]%10
print(ttl-(10-last)) |
p03317 | s352300460 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = ((N - 1) + (K - 1 - 1)) // (K - 1)
print(ans)
|
p03359 | s681532125 | Accepted | a,b=map(int,input().split())
if a<=b:print(a)
else:print(a-1) |
p03254 | s086005219 | Wrong Answer | def main():
n, x = map(int, input().split())
A = list(map(int, input().split()))
A_sorted = sorted(A)
res = 0
for kids in A_sorted:
if x - kids >= 0:
x = x - kids
res += 1
print(res)
if __name__ == '__main__':
main() |
p03210 | s755174630 | Wrong Answer | N = int(input())
if N == 7 or N == 5 or N ==3:
print("Yes")
else:
print("No")
|
p02731 | s269015088 | Wrong Answer | L = int(input())
temp = 0
for i in range(1,L):
for j in range(1,L-i):
mult = i*j*(L-i-j)
if(temp < mult):
temp = mult
print(float(temp)) |
p02577 | s176701215 | Wrong Answer | # https://atcoder.jp/contests/abc176/tasks/abc176_b
n = int(input())
if n % 9 == 0:
print('YES')
else:
print('NO') |
p02918 | s614078492 | Accepted | n, k = map(int, input().split())
s = input()
r = 0
for i in range(n - 1):
if s[i] == s[i + 1]:
r += 1
print(min(r + 2 * k, n - 1))
|
p03416 | s512717077 | Wrong Answer | A, B = map(int, input().split())
ans = 0
for i in range(A, B + 1):
sita = i % 100
ue = i // 1000
if sita == ue:
ans += 1
print(ans)
|
p03416 | s912379534 | Wrong Answer | A, B = input().split()
a01 = int(A[0:2])
a43 = int(''.join(list(reversed(A[3:5]))))
if a01 < a43:
amin = int(A[1:3]) + 1
else:
amin = int(A[1:3])
b01 = int(B[0:2])
b43 = int(''.join(list(reversed(B[3:5]))))
if b01 <= b43:
bmin = 100 - int(B[1:3]) - 1
else:
bmin = 100 - int(B[1:3])
n0 = int(B[0]) - int(A[0]) + 1
print(n0 * 100 - amin - bmin) |
p02795 | s058095423 | Wrong Answer | import math
h = int(input())
w = int(input())
n = int(input())
print(math.ceil(n)//max(h, w))
|
p03681 | s646161757 | Accepted | from math import factorial
import sys
sys.setrecursionlimit(2000000)
# import math
# import itertools
# import statistics
# import numpy as np
# import collections
#n = int(input())
n, m = list(map(int, input().split()))
if abs(n-m) >= 2:
print(0)
else:
if n == m:
a = factorial(n) * factorial(m) * 2
else:
a = factorial(n) * factorial(m)
print(a % (pow(10, 9)+7))
|
p02689 | s527178229 | Accepted | n, m = list(map(int, input().split()))
hs = list(map(int, input().split()))
ans = [1]*n
roads = []
for i in range(m):
roads += [list(map(int, input().split()))]
for road in roads:
if hs[road[0]-1] <= hs[road[1]-1]:
ans[road[0]-1] = 0
if hs[road[0]-1] >= hs[road[1]-1]:
ans[road[1]-1] = 0
print(ans.count(1))
|
p03723 | s208381412 | Accepted | A, B, C = map(int, input().split())
i = 0
Ap = A
Bp = B
Cp = C
while A%2 == 0 and B%2 == 0 and C%2 == 0:
A = Bp//2 + Cp//2
B = Ap//2 + Cp//2
C = Bp//2 + Ap//2
i += 1
Ap = A
Bp = B
Cp = C
if A == B == C:
i = -1
break
print(i) |
p03042 | s335813633 | Accepted | s = input()
a = int(s[:2])
b = int(s[2:])
if 0 < a <= 12 and 0 < b <= 12:
print("AMBIGUOUS")
elif (a > 12 or a == 0) and 0 < b <= 12:
print("YYMM")
elif 0 < a <= 12 and (b > 12 or b == 0):
print("MMYY")
else:
print("NA") |
p03448 | s474811849 | Wrong Answer | a=int(input())
b=int(input())
c=int(input())
d=int(input())
count=0
for i in range(a+1):
for j in range(b+1):
for z in range(c+1):
if a*500+b*100+c*50 == d:
count+=1
print(count)
|
p02693 | s553521500 | Accepted | k=int(input())
a,b=map(int,input().split())
if a % k == 0:
print("OK")
elif (a + k - (a % k)) <= b:
print("OK")
else:
print("NG") |
p03323 | s227713017 | Wrong Answer | a, b = map(int, input().split())
if a <= 8 and b <= 8:
print('Yey!')
else:
print(':(') |
p03385 | s953432784 | Accepted | s = input()
print('Yes' if ('a' in s) and ('b' in s) and ('c' in s) else 'No') |
p03627 | s887763493 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))
A = sorted(A, reverse=True)
B = set(A)
ans = 0
keep = 0
for i in B:
if A.count(i) >= 4:
ans = max(keep * i, i**2)
elif A.count(i) >= 2:
ans = keep * i
keep = i
print(ans)
|
p02848 | s000422221 | Accepted | n = int(input())
list_s = list(input())
for i in range(0, len(list_s)):
tmp = ord(list_s[i]) + n
if tmp > ord("Z"):
tmp -= 26
list_s[i] = chr(tmp)
print("".join(list_s)) |
p02622 | s317326896 | Accepted | S = input()
T = input()
N = len(S)
count = 0
for i in range(N):
if S[i] != T[i]:
count += 1
print(count) |
p03241 | s771566137 | Wrong Answer | from copy import *
n,m=map(int,input().split())
t=deepcopy(n)
while True:
if m%t==0:
if t*n<=m:
print(t)
exit()
else:
t-=1
else:
t-=1 |
p02939 | s543322219 | Wrong Answer | s = input()
now = s[0]
cnt = 1
i = 1
while True:
if s[i] != now:
cnt += 1
now = s[i]
i += 1
else:
now = now + s[i]
cnt += 1
i += 2
if i > len(s)-1:
cnt -= 1
if i >= len(s):
break
print(cnt) |
p04030 | s089009703 | Accepted | s = input()
st = []
for e in s:
if e == 'B':
if len(st) != 0:
st.pop()
else:
st.append(int(e))
print(''.join(map(str,st)))
|
p02744 | s840409297 | Accepted | str = 'abcdefghijklmnop'
def bt(n,m,s):
if n == 0:
print(s)
return
for c in range(m):
bt(n-1,m,s+str[c])
#introduce another character
bt(n-1,m+1,s+str[m])
n = int(input())
bt(n,0,'') |
p03821 | s551236485 | Accepted | n = int(input())
ls = [list(map(int,input().split())) for _ in range(n)]
p = 0
for i in range(n):
j = n-1-i
q = ls[j][1] - ((ls[j][0]+p)%ls[j][1])
if q == ls[j][1]:
q = 0
p += q
print(p) |
p02813 | s482424694 | Accepted | import sys
import math
import itertools
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n = ni()
p = na()
q = na()
l = list(itertools.permutations(list(range(1, n+1))))
print(abs(l.index(tuple(p)) - l.index(tuple(q)))) |
p02615 | s492196863 | Accepted | # 入力
n = int(input())
A = list(map(int,input().split()))
A.sort()
ans = 0
can = 1 # lastの数が後何回足されうるか
will = n-1 # 次に足されるであろう数のindex
for i in range(n-1):
ans += A[will]
can -= 1
if can == 0:
# 足されきったら一つ小さい数へ
can = 2 # 最大値以外は2回足されうる
will -= 1
print(ans)
|
p03338 | s220365587 | Accepted | n = int(input())
s = input()
ans = 0
for i in range(n-1):
x = set(s[:i+1])
y = set(s[i+1:])
ans = max(ans,len(x&y))
print(ans) |
p03011 | s125691581 | Wrong Answer | P, Q, R = map(int, input().split(' '))
print(min([P+Q, Q+R])) |
p03360 | s882522012 | Accepted | a, b, c = map(int, input().split())
K = int(input())
S = sum([a, b, c])
m = max([a, b, c])
S -= m
for i in range(K):
m = m * 2
#print(m)
print(S + m)
|
p02802 | s680454111 | Wrong Answer | N,M=map(int,input().split())
PS=[]
for i in range(M):
x,y=input().split()
PS.append((int(x),y))
ac=[0]*N
wa=[0]*N
for i in range(M):
if PS[i][1]=="AC" and ac[PS[i][0]-1]==0:
ac[PS[i][0]-1]=1
elif PS[i][1]=="WA" :
if ac[PS[i][0]-1]!=1:
wa[PS[i][0]-1]+=1
sac=sum(ac)
swa=sum(wa)
print(sac,swa)
|
p04043 | s589777271 | Wrong Answer | a=list(map(int,input().split()))
if a.count(5)==2:
if a.count(7)==1:
print("Yes")
else:
print("No")
|
p02613 | s196876742 | Wrong Answer | t=int(input())
f=[]
for i in range(t):
s=input()
f.append(s)
print("AC"+' '+'*'+' '+str((f.count("AC"))))
print("WA"+' '+'*'+' '+str((f.count("WA"))))
print("TLE"+' '+'*'+' '+str((f.count("TLE"))))
print("RE"+' '+'*'+' '+str((f.count("RE"))))
|
p02629 | s450509415 | Wrong Answer | import string
N = int(input())
char_list = string.ascii_lowercase
char_list = char_list[:-1]
char_list = 'z' + char_list
tmp = 0
count = 0
ans = ''
while 1:
before = tmp
count += 1
tmp += 26**count
if before < N <= tmp:
tmp = N
while 1:
ans = char_list[tmp%26] + ans
tmp = tmp // 26
count -= 1
if count == 0:
break
break
else:
pass
print(ans) |
p03109 | s303346852 | Wrong Answer | s=input()
if s<="2019/04/30":
print("HEISEI")
else:
print("TBD") |
p03971 | s730855306 | Accepted | N, A, B = map(int, input().split())
S = input()
ok_count = 0
ok_fcount = 0
for i in range(N):
if S[i] == 'a':
if ok_count < A+B:
print('Yes')
ok_count +=1
else:
print('No')
elif S[i] == 'b':
if ok_count < A+B and ok_fcount < B:
print('Yes')
ok_count+=1
ok_fcount+=1
else:
print('No')
else:
print('No') |
p03627 | s958723209 | Wrong Answer | from collections import Counter
n = int(input())
a = list(map(int, input().split()))
c = Counter(a)
b1 = [i[0] for i in c.items() if i[1] >= 4]
b2 = [i[0] for i in c.items() if 4 >= i[1] >= 2]
b = b1 + b2 + [0,0]
b.sort()
print(b[-1]*b[-2]) |
p02594 | s834737386 | Accepted | x = int(input())
if x >= 30:
print('Yes')
else:
print('No') |
p03860 | s883249033 | Wrong Answer | a, b, c = map(str, input().split())
print(a[0], "")
print(b[0], "")
print(c[0]) |
p02707 | s736348844 | Accepted | import collections
n = int(input())
base = input().split()
x = []
for i in base:
x.append(int(i))
#x.sort(reverse = False)
c = collections.Counter(x)
for i in range(1,n):
print(c[i])
print(0) |
p04020 | s361640169 | Wrong Answer | N = int(input())
A = [int(input()) for _ in range(N)]
cnt = 0
for i in range(N):
cnt += A[i]//2
A[i] = A[i]%2
for i in range(1,N-1):
if A[i-1]+A[i]==2:
cnt += 1
A[i]=0
print(cnt) |
p02756 | s291218314 | Wrong Answer | A = input()
B = int(input())
C = ""
for i in range(B):
D = input().split()
if D[0] == "1":
A,C = C,A
else:
if D[1] == "1":
A += D[2]
else:
C += D[2]
A = A[::-1]
print(A+C) |
p03241 | s078782269 | Wrong Answer | n, m = map(int, input().split())
def make_divisors(num):
divisors = []
for i in range(1, int(n**0.5)+1):
if num % i == 0:
divisors.append(i)
if i != num // i:
divisors.append(num//i)
return divisors
div = make_divisors(num=m)
div.sort()
ans = 0
for x in div:
if x*n <= m:
ans = max(ans, x)
print(ans)
|
p02820 | s208854379 | Wrong Answer | n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = input()
m = {'p': s, 'r': p, 's': r}
dp = [''] * n
a = 0
for i in range(k):
a += m[t[i]]
for i in range(k, n):
if t[i] != dp[i-k]:
a += m[t[i]]
dp[i] = t[i]
print(a) |
p03723 | s935527698 | Accepted | A,B,C=map(int,input().split())
ans=0
if A%2!=0 or B%2!=0 or C%2!=0:
pass
elif A==B and B==C:
ans=-1
else:
while True:
if A%2!=0 or B%2!=0 or C%2!=0:
break
A,B,C=B/2+C/2,A/2+C/2,A/2+B/2
ans+=1
print(ans) |
p02665 | s558740711 | Wrong Answer | n=int(input())
arr=list(map(int,input().split()))
ans=sum(arr)
if n==0:
if arr[0]==0:
print(-1)
else:
print(1)
exit()
maxs=[0]*n
maxs[0]=1
if arr[0]>=1:
print(-1)
exit()
for i in range(1,n):
maxs[i]=2*maxs[i-1]-arr[i]
if i<=30 and arr[i]>=2**i:
print(-1)
exit()
maxs[n-1]=min(maxs[n-1],arr[n])
tmp=arr[n]
for i in range(n-2,-1,-1):
tmp+=arr[i+1]
maxs[i]=min(maxs[i],tmp)
ans+=sum(maxs)
print(ans) |
p04043 | s501830877 | Wrong Answer | S = list(map(int, input().split()))
S.sort()
if S.sort()==[5,5,7]:
print("YES")
else: print("NO") |
p03286 | s156308902 | Accepted | import math
import sys
N = int(input())
ans = []
if N == 0:
print(0)
sys.exit()
while(N != 0):
m = N % (-2)
if m == -1:
m = 1
ans.insert(0, str(m))
N = math.ceil(N / (-2))
print("".join(ans)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.