problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02690 | s436297469 | Accepted | from sys import stdin
def main():
#入力
readline=stdin.readline
x=int(readline())
flag=False
for A in range(-200,201):
for B in range(-200,201):
if A**5-B**5==x:
print(A,B)
flag=True
if flag:
break
if __name__=="__main__":
main() |
p03475 | s543627359 | Accepted | import math
def main():
n=int(input())
csf=[list(map(int,input().split())) for _ in range(n-1)]
for i in range(n):
if i == n-1:
print(0)
else:
t=0
for c,s,f in csf[i:]:
t = max(s,t)
t = math.ceil(t/f)*f+c
#print("start:", i, t)
print(t)
if __name__ == "__main__":
main() |
p02784 | s739472474 | Wrong Answer | H, N = map(int, input().split())
count = 0
arr = list(map(int, input().split()[:N]))
attack = H
for i in range(N):
attack = attack - arr[i]
count = count + 1
i = i + 1
if attack <= 0 and count > 1:
print('Yes')
else:
print('No')
|
p02993 | s849052662 | Accepted | S = input()
flag = True
for i in range(3):
if S[i] == S[i+1]:
flag = False
if flag == True:
print("Good")
else:
print("Bad") |
p03328 | s914015361 | Accepted | A, B = map(int, input().split())
# Bの本来の高さ
B_true = (B - A) * (B - A + 1) // 2
answer = B_true - B
print(answer) |
p02766 | s437635552 | Accepted | n,k = map(int,input().split())
def Base_10_to_n(X, n):
if (int(X/n)):
return Base_10_to_n(int(X/n), n)+str(X%n)
return str(X%n)
ans=Base_10_to_n(n,k)
print(len(ans)) |
p02842 | s264339118 | Accepted | n = int(input())
for i in range(1,50001):
if (i*1.08)//1 == n:
print(i)
exit()
if (i*1.08)//1 > n:
print(':(')
exit()
|
p03408 | s175669976 | Wrong Answer | lst_blue = []
lst_red = []
dic = {}
N = int(input())
for i in range(0,N):
lst_blue.append(input())
M = int(input())
for i in range(0,M):
lst_red.append(input())
for i in list(set(lst_blue)):
dic[i] = int(lst_blue.count(i))
for i in lst_red:
if i in dic:
dic[i] -= 1
print(max(dic.values())) |
p03035 | s228124113 | Accepted | a,b = map(int, input().split())
if a >= 13:
print(b)
elif a >= 6:
print(b//2)
else:
print(0) |
p03457 | s821191428 | Accepted | n = int(input())
plcs = [list(map(int,input().split())) for _ in range(n)]
A = [0, 0, 0]
for i in range(n):
A = [plcs[i][j] - A[j] for j in range(3)]
if A[0] >= abs(A[1]) + abs(A[2]) and plcs[i][0] % 2 == (abs(plcs[i][1]) + abs(plcs[i][2])) % 2:
continue
else:
print('No')
exit()
print('Yes') |
p03797 | s746567898 | Accepted | N,M=map(int,input().split())
m=M//2
if N>=m:
print(m)
else:
print((N+m)//2) |
p03760 | s609267689 | Accepted | o=input()
e=input()
ans=['' for i in range(len(o)+len(e))]
count=0
for oo in o:
ans[count] = oo
count+=2
count=1
for ee in e:
ans[count] = ee
count+=2
print("".join(ans))
|
p03779 | s218216701 | Wrong Answer | def get_index(n):
i=1
while True:
if n<piramid(i):
return i-1
i+=1
def piramid(n):
return n*(n+1)//2
n=int(input())
index=get_index(n)
print(min(index+n-piramid(index),index+2+piramid(index+1)-n))
|
p03827 | s952173437 | Accepted | N = int(input())
S = input()
ans = 0
x = 0
for i in range(N):
if S[i] == "I":
x += 1
else:
x -= 1
ans = max(ans,x)
print(ans) |
p03059 | s138274278 | Accepted | A = list(map(int,input().split()))
print(int((A[2]+ 0.5) // A[0] * A[1])) |
p03324 | s445865823 | Accepted | d, n = map(int, input().split())
print(100**d * (n + n//100))
|
p03785 | s208167490 | Accepted | n,c,k = map(int,input().split())
t = sorted([int(input()) for _ in range(n)])
ans,ppl = 1,1
temp = t[0]
for v in t[1:]:
if v-temp>k or ppl>=c:
ans += 1
ppl = 1
temp = v
else:
ppl += 1
#print(ans)
print(ans) |
p03910 | s829505205 | Wrong Answer | n = int(input())
cnt = 0
pbm = 0
for i in range(1, 10**6):
cnt += i
if cnt > n:
pbm = i
break
ans = []
for i in range(pbm, 0, -1):
if i <= n:
ans.append(i)
n -= i
for i in ans:
print(i) |
p03077 | s827274973 | Accepted | n = int(input())
lst = [int(input()) for i in range(5)]
mini = min(lst)
ans = (n - 1) // mini + 5
print(ans) |
p03059 | s164375611 | Accepted | a, b, t = map(int, input().split())
time = 1
biscuit = 0
while time < t + 0.5:
if time % a == 0:
biscuit += b
time += 1
print(biscuit)
|
p02630 | s592523380 | Accepted | from collections import defaultdict
def main():
n = int(input())
d = defaultdict(int)
res = 0
for a in input().split():
aa = int(a)
d[int(aa)] += 1
res += aa
nq = int(input())
for q in range(nq):
b, c = [int(i) for i in input().split()]
res += (c - b) * d[b]
d[c] += d[b]
d[b] = 0
print(res)
if __name__ == '__main__':
main()
|
p02873 | s437550970 | Accepted | S = list(input())
A = [0]*(len(S)+1)
node_value = 0
for i in range(len(S)):
if S[i] == "<":
node_value += 1
A[i+1] = node_value
else:
node_value = 0
node_value = 0
for i in range(len(S)-1,-1,-1):
if S[i] == ">":
node_value += 1
A[i] = max(A[i], node_value)
else:
node_value = 0
print(sum(A)) |
p03107 | s891898668 | Accepted | s = input()
zero = s.count('0')
one = s.count('1')
print(min(zero,one)*2) |
p02618 | s867941624 | Accepted | import random
for i in range(365):
print(random.randint(1,26))
|
p02696 | s907804001 | Accepted | a , b , n = map(int,input().split())
if n >= b-1:
print(a*(b-1)//b)
elif b-1 > n:
print(a*n//b) |
p02760 | s924979009 | Wrong Answer | d=[list(map(int,input().split()))for i in range(3)]
row=int(input())
num=[int(input()) for j in range(row)]
bingo=0
for a in range(3):
if d[0][a] and d[1][a] and d[2][a] in num:
bingo=bingo+1
if d[a][0] and d[a][1] and d[a][1] in num:
bingo=bingo+1
if d[1][1] and d[2][2] and d[0][0] in num:
bingo=bingo+1
if d[0][1] and d[2][2] and d[1][0] in num:
bingo=bingo+1
if bingo>0:
print('Yes')
else:
print('No') |
p02547 | s649102416 | Wrong Answer | N = int(input())
D = [input().split() for _ in range(N)]
ans = "no"
for i in range(N - 2):
if D[i][0] == D[i][1]:
if D[i + 1][0] == D[i + 1][1]:
if D[i + 2][0] == D[i + 2][1]:
ans = "yes"
break
print(ans) |
p02939 | s278404104 | Wrong Answer | s = input()
k = 0
def f(s):
s += '0'
res = 0
ex = ''
for i in range(len(s)):
c = s[i]
if c == ex:
ex = ex+c
else:
res += 1
ex = c
return res
print(max(f(s), f(s[::-1]))) |
p03379 | s195181355 | Wrong Answer | N=int(input())
X=list(map(int,input().split()))
for i in range(N):
if i<N/2:
print(X[N//2])
else:
print(X[N//2-1]) |
p02832 | s243903581 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
if 1 not in a:
print(-1)
exit()
num_break = 0
pos = 1
for i in a:
if i == pos:
pos += 1
else:
num_break += 1 |
p02848 | s609411750 | Accepted | n = int(input())
s = list(input())
ret = []
for i in s:
iz = ord(i) + n
if iz > ord('Z'): iz -= 26
ret.append(chr(iz))
print("".join(ret))
|
p02897 | s940423729 | Wrong Answer | n = int(input())
print((n//2 + n%1)/n) |
p03495 | s046914961 | Wrong Answer | from collections import Counter
def resolve():
n, k = map(int, input().split())
a = list(map(int, input().split()))
c = Counter(a)
lc = len(c.keys())
if lc > k:
v = sum(sorted(c.values())[:k-1])
print(v)
else:
print(0)
resolve() |
p03624 | s815104535 | Accepted | mset=set(list(input()))
aset=set(list("qazwsxedcrfvtgbyhnujmikolp"))
aset=aset-mset
lis=sorted(list(aset))
if len(lis):
print(lis[0])
else:
print("None") |
p03252 | s128238203 | Accepted | from collections import Counter
s = sorted(Counter(list(input())).values())
t = sorted(Counter(list(input())).values())
print("Yes" if s==t else "No") |
p03103 | s403116462 | Accepted | N,M=map(int,input().split())
l=[]
for i in range(N):
A,B=map(int,input().split())
l.append([A,B])
l.sort()
left_drinks=M
prices=0
for i in l:
if left_drinks<=0:
break
drinks = min(i[1],left_drinks)
left_drinks -= drinks
prices += i[0] * drinks
print(prices) |
p03637 | s382479571 | Accepted | N = int(input())
A = list(map(int,input().split()))
four = 0
two = 0
odd = 0
for i in A:
if i%4 == 0:
four += 1
elif i%2 == 0:
two += 1
else:
odd += 1
if two >= 1:
odd += 1
if odd <= four+1:
print("Yes")
else:
print("No") |
p03042 | s049584986 | Accepted | import sys
A=int(sys.stdin.readline(2))
D=int(sys.stdin.readline(2))
if A>=1 and A<=12:
if D>=1 and D<=12:
print("AMBIGUOUS")
else:
print("MMYY")
elif D>=1 and D<=12:
print("YYMM")
else:
print("NA") |
p02779 | s876090821 | Accepted | def main():
N = int(input())
A = [int(i) for i in input().split()]
A.sort()
for i in range(N-1):
if A[i] == A[i+1]:
return print("NO")
print("YES")
if __name__ == '__main__':
main()
|
p02640 | s622800203 | Accepted | x, y = map(int, input().split())
n = (4*x - y)/2
m = (y - 2*x)/2
if n >=0 and m >=0:
if n == int(n) and m == int(m):
print("Yes")
else:
print("No")
else:
print("No")
|
p03059 | s125521657 | Wrong Answer | A, B, T = map(int, input().split())
print(B * ((T + 0.5) // A)) |
p03611 | s010836699 | Accepted | n=int(input())
a=list(map(int,input().split()))
l=[0]*(10**5+5)
for i in a:
l[i]+=1
p=0
for j in range(10**5):
p=max(p,l[j]+l[j+1]+l[j+2])
print(p) |
p02993 | s004553622 | Accepted | s = input()
ans = "Good" if s[0] != s[1] != s[2] != s[3] else "Bad"
print(ans) |
p03323 | s247689747 | Accepted | a,b = map(int,input().split())
if a<=8 and b<=8:
print("Yay!")
else:
print(":(") |
p02642 | s604315824 | Accepted | M = 10 ** 6 + 5
N = int(input())
A = list(map(int, input().split()))
cnt = [0] * M
for i in A:
if(cnt[i] >= 2):
continue
for j in range(i, M, i):
cnt[j] += 1
ans = 0
for i in A:
if(cnt[i] == 1):
ans += 1
print(ans) |
p02694 | s924806767 | Wrong Answer | # -*- coding: utf-8 -*-
# スペース区切りの整数の入力
#N, K = map(int, input().split())
# 文字列の入力
X = float(input())
#開業されたN個要素を受け付ける
#list = [input() for i in range(N)]
yokin = float(100)
i=0
while(yokin < X):
yokin = yokin*1.01
i=i+1
print(i)
|
p02768 | s578622328 | Accepted | m = 10**9+7
n,a,b = map(int,input().split())
def c(k):
v = 1
w = 1
for i in range(k):
v = v*(n-i)%m
w = w*(i+1)%m
return (v*pow(w,m-2,m)%m)
print((pow(2,n,m)-1-c(a)-c(b))%m) |
p03485 | s855469928 | Wrong Answer | a,b = map(int, input().split())
print(int(((a+b)/2)//1)) |
p03838 | s810313044 | Accepted | x,y=map(int,input().split())
if y==0:
if 0>=x:
print(-x)
else:
print(x+1)
elif x==0:
if y>0:
print(y)
else:
print(-y+1)
elif x*y>0:
if y>=x:
print(abs(abs(y)-abs(x)))
else:
print(abs(abs(y)-abs(x))+2)
else:
if y<x:
print(abs(abs(y)-abs(x))+1)
else:
print(abs(abs(y)-abs(x))+1)
|
p02647 | s359313438 | Wrong Answer | n,k=map(int,input().split())
A=list(map(int,input().split()))
def culc(L):
subL=[0]*(n+1)
for i in range(n):
temp=L[i]
bottom=max(i-temp,0)
top=min(i+temp,n-1)
subL[bottom]+=1
subL[top+1]-=1
resL=[0]*n
resL[0]=subL[0]
for i in range(1,n):
resL[i]=resL[i-1]+subL[i]
return resL
for i in range(min(k,20)):
A=culc(A)
print(*A)
|
p03438 | s459035665 | Accepted | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_cnt = 0
b_cnt = 0
for i in range(n):
if a[i] > b[i]:
b_cnt += (a[i] - b[i])
elif a[i] < b[i]:
k = (b[i] - a[i])
if k % 2 == 0:
a_cnt += k//2
else:
b_cnt += 1
a_cnt += (k+1)//2
if a_cnt >= b_cnt:
print("Yes")
else:
print("No")
|
p03329 | s620739928 | Accepted | import sys
readline = sys.stdin.readline
N = int(readline())
INF = 10 ** 10
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(10,0,-1):
for j in range(N + 1):
if dp[j] != INF:
if j + 6 ** i <= N:
dp[j + 6 ** i] = min(dp[j + 6 ** i], dp[j] + 1)
if j + 9 ** i <= N:
dp[j + 9 ** i] = min(dp[j + 9 ** i], dp[j] + 1)
ans = INF
for i in range(len(dp) - 1, -1, -1):
money = dp[i] + N - i
if ans > money:
ans = money
print(ans) |
p03435 | s122100099 | Wrong Answer | import sys
C11,C12,C13 = map(int, input().split())
C21,C22,C23 = map(int, input().split())
C31,C32,C33 = map(int, input().split())
if (abs(C11+C22) == abs(C12 - C21)) and (abs(C12+C23) == abs(C13+C22)) and (abs(C22+C33) == abs(C23 + C32)) and (C21+C32 == C23+C32):
print("Yes")
print("No") |
p03103 | s086718434 | Accepted | n, m=map(int, input().split())
ab=[list(map(int, input().split())) for _ in range(n)]
ab.sort()
ans=0
for i in range(n):
if ab[i][1]<=m:
ans+=ab[i][0]*ab[i][1]
m-=ab[i][1]
else:
ans+=ab[i][0]*m
break
print(ans) |
p02726 | s235104954 | Accepted | def main():
n,x,y=map(int,input().split())
Ans=[0]*n
for i in range(1,n):
for j in range(i+1,n+1):
Ans[min(abs(j-i),abs(x-i)+1+abs(j-y),abs(y-i)+1+abs(j-x))]+=1
for ans in Ans[1:]:
print(ans)
if __name__=='__main__':
main() |
p02572 | s872817238 | Accepted | def resolve():
N = int(input())
A = [int(i) for i in input().split(maxsplit=N)]
presum = [0 for _ in range(N + 1)]
for i in range(N):
presum[i + 1] = presum[i] + A[i]
sumA = 0
for i in range(1, N):
sumA += (A[i] * (presum[i])) % (10**9 + 7)
print(sumA % (10**9 + 7))
resolve()
|
p02723 | s508518935 | Accepted | S = list(input())
if (S[2]==S[3]) & (S[4]==S[5]):
print("Yes")
else:
print("No")
|
p02720 | s432552023 | Wrong Answer | #!/usr/bin/env python3
from collections import deque
k = int(input())
que = deque(reversed([i for i in range(1, 10)]))
x = -1
for _ in range(k):
# print(f"loop: {_}")
# print(f"que: {que}")
x = que.pop()
# print(f"x: {x}\n")
if x % 10 != 0:
que.appendleft(x * 10 + x % 10 - 1)
que.appendleft(x * 10 + x % 10)
if x % 10 != 9:
que.appendleft(x * 10 + x % 10 - 1)
print(x)
|
p03730 | s238255058 | Accepted |
def main():
A,B,C = map(int, input().split())
temp = A
while temp % B != C:
temp += A
if temp % B == A % B:
print('NO')
return
print('YES')
if __name__ == '__main__':
main()
|
p02835 | s060893171 | Accepted | a, b, c = map(int, input().split())
if (a + b + c) >= 22:
print('bust')
else:
print('win') |
p03605 | s457362517 | Accepted | # -*- coding: utf-8 -*-
"""
Created on Thu May 14 11:36:43 2020
@author: shinba
"""
n = input()
if n.count("9") != 0:
print("Yes")
else:
print("No")
|
p03419 | s608858286 | Accepted | n,m=map(int, input().split())
if n == 1 and m == 1:
print(1)
elif n == 1:
print(m-2)
elif m == 1:
print(n-2)
else:
Ans = (m-2) * (n-2)
print(Ans) |
p02780 | s552094379 | Accepted | import itertools
N,K = list(map(int,input().split()))
p = list(map(int,input().split()))
k = [(1+i)/2 for i in p]
a = list(itertools.accumulate(k))
max = a[K-1]
for i in range(K,N):
if max < a[i] - a[i-K]:
max = a[i] - a[i-K]
print(max) |
p03289 | s895722987 | Accepted | S = list(input())
if S[0] == 'A':
cnt = 0
for i in range(2, len(S)-1):
if S[i] == 'C':
cnt += 1
if cnt == 1:
S.sort()
for i in range(2, len(S)):
if S[i].isupper():
print('WA')
exit()
print('AC')
else:
print('WA')
else:
print('WA')
|
p02771 | s501064490 | Accepted | A, B, C = input().split()
if len(set([A, B, C])) == 2:
print('Yes')
else:
print('No')
|
p04029 | s626892679 | Accepted | N = int(input())
print(int(N / 2 * (N + 1))) |
p03455 | s129863630 | Accepted |
a, b = (int(x) for x in input().split())
if (a * b) % 2 == 0 :
print('Even')
else :
print('Odd') |
p03162 | s353401191 | Accepted | n = int(input())
happiness = [list(map(int, input().split())) for i in range(n)]
dp = [[0] * 3 for i in range(n + 1)]
for i in range(n):
dp[i + 1][0] = max(dp[i][1], dp[i][2]) + happiness[i][0]
dp[i + 1][1] = max(dp[i][2], dp[i][0]) + happiness[i][1]
dp[i + 1][2] = max(dp[i][1], dp[i][0]) + happiness[i][2]
print(max(dp[n]))
|
p03611 | s283417303 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
A.sort()
cnt=0
ans=[]
a=A[0]
for i in range(1,N):
if A[i]-a<=2:
cnt+=1
else:
a=A[i]
ans.append(cnt)
cnt=0
ans.append(cnt)
MAX=max(ans)
if MAX>0:
print(MAX+1)
else:
print(MAX) |
p03543 | s968986100 | Accepted | n = input()
if (n[0] == n[1] and n[1] == n[2]) or (n[1] == n[2] and n[2] == n[3]):
print("Yes")
else:
print("No") |
p02618 | s037836463 | Accepted | D = int(input())
C = list(map(int, input().split()))
S = [list(map(int, input().split())) for i in range(D)]
A = [0 for i in range(26)]
ans = 0
for i in range(D):
K = []
for k in range(26):
c = 0
for j in range(26):
if j != k:
c += C[j] * (i+1-A[j])
an = S[i][k]-c
K.append([an, k+1])
K.sort()
a = K[-1][1]
print(a)
A[a-1] = i+1
ans += K[-1][0]
|
p03612 | s639420507 | Wrong Answer | N, *X = map(int, open(0).read().split())
ans = 0
tmp = 0
for i in range(N):
if X[i] == i + 1:
tmp += 1
if tmp == 2:
ans += 1
tmp = 0
else:
ans += int(tmp > 0)
tmp = 0
print(ans)
|
p02646 | s822218928 | Accepted | #鬼
a,v=map(int,input().split())
#逃げている
b,w=map(int,input().split())
#t秒以内
t=int(input())
if v>w:
if abs(a-b)<=(v-w)*t:
print("YES")
exit()
print("NO") |
p02684 | s609172035 | Wrong Answer | N, K = [int(i) for i in input().split()]
A = [0] + [int(i) for i in input().split()]
B = [1]
while(True):
tmp = A[B[-1]]
if not tmp in B:
B += [tmp]
else:
head = B.index(tmp)
break
K = (K - len(B[:head])) % len(B[head:])
print(B[head:][K]) |
p02665 | s294690576 | Accepted | import sys
input=sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))
asum=[]
s=sum(a)
for i in range(n):
s=s-a[i]
asum.append(s)
ans=1
x=2**n
p=1
if n==0:
if a[0]==1:
print(1)
else:
print(-1)
sys.exit()
for i in range(n):
x//=2
p-=a[i]
if 2*p<asum[i]/x or asum[i]<p:
print(-1)
sys.exit()
p=min(2*p,asum[i])
ans+=p
print(ans)
|
p03624 | s711982919 | Accepted | S = input()
wordNum = [0 for i in range(26)]
for wordOne in S:
idx = ord(wordOne) - ord('a')
wordNum[idx] += 1
ans = "None"
for i in range(26):
if wordNum[i] == 0:
ans = chr(ord('a') + i)
break;
print(ans)
|
p02713 | s153546902 | Wrong Answer | from functools import lru_cache
@lru_cache(None)
def gcd(x, y):
return x if y == 0 else gcd(y, y % x)
k = int(input())
ans = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
for p in range(1, k + 1):
ans += gcd(i, gcd(j, p))
print(ans)
|
p02765 | s428073532 | Accepted | n,r = list(map(int,input().split()))
if n >= 10:
print(r)
else:
print(r + (100 * (10-n))) |
p02707 | s104172144 | Accepted | from collections import Counter
n = int(input())
ls = list(map(int,input().strip().split()))
dic = Counter(ls)
for i in range(1,n+1):
print(dic[i])
|
p02935 | s304139962 | Accepted | n=int(input())
v =list(map(int,input().split()))
v.sort()
x = v[0]
if n > 2:
for i in range(1,n):
x += v[i]*2**(i-1)
ans = x/2**(n-1)
print(ans)
else:
print((x+v[1])/2) |
p02661 | s470689684 | Wrong Answer | import heapq as hp
n = int(input())
if n%2 ==0:
m = n//2 + 1
else:
m = (n+1) //2
a,b = [],[]
for i in (0,n):
c = list(map(int, input().split()))
a.append(c[0])
b.append(c[1])
la = hp.nlargest(m,a)
lb = hp.nlargest(m,b)
if n%2 == 0:
c = la[-1] + la[-2]
d = lb[-1] + lb[-2]
print(d-c+1)
else:
print(lb[-1]//2-la[-1]//2+1)
|
p02583 | s533159408 | Accepted | N = int(input())
L = list(map(int, input().split()))
import itertools
ans = 0
for K in itertools.combinations(L, 3):
if K[0] != K[1] and K[1] != K[2] and K[2] != K[0]:
k_sorted= sorted(K)
#print(k_sorted)
if k_sorted[2] < k_sorted[0] + k_sorted[1]:
ans += 1
print(ans)
|
p02627 | s302001211 | Accepted | def main():
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
a = input()[:-1]
if ord('a') <= ord(a) <= ord('z'):
print('a')
else:
print('A')
main() |
p03493 | s269534962 | Wrong Answer | s = list(map(int,input().split()))
print(s.count(1)) |
p02699 | s009136453 | Accepted | s, w = map(int, input().split())
print('unsafe' if s <= w else 'safe') |
p03695 | s892614282 | Accepted | n = int(input())
a = list(map(int,input().split()))
a = sorted([i//400 for i in a])
min_a = 0
max_a = 0
flag = -1
for i in range(n):
if a[i] >= 8:
max_a += 1
elif flag != a[i]:
min_a += 1
max_a += 1
flag = a[i]
print(max(1,min_a),max_a) |
p03607 | s469829278 | Accepted | import collections
n = int(input())
l = list(int(input()) for i in range(n))
d = collections.Counter(l)
ans = 0
for v in d.values():
ans += v % 2
print(ans) |
p03127 | s690170047 | Accepted | import fractions
n=int(input())
a=list(map(int,input().split()))
gcd=a[0]
for i in range(1,n):
gcd=fractions.gcd(a[i],gcd)
print(gcd)
|
p03745 | s348655191 | Wrong Answer | n = int(input())
a_ls = list(map(int, input().split()))
times = 0
i = 0
# indの右側を切断するかどうか
cut = [0] * n
while i+2 < n:
if a_ls[i] < a_ls[i+1] > a_ls[i+2] or a_ls[i] > a_ls[i+1] < a_ls[i+2] and not cut[i]:
times += 1
cut[i+1] = 1
i += 1
if times > 0:
print(times+1)
else:
print(0) |
p02681 | s837504499 | Accepted | base_name=input()
new_name=input()
if new_name[:-1]==base_name:
print("Yes")
else:
print("No") |
p03486 | s991805813 | Wrong Answer | a = sorted(input(), reverse=True)
b = sorted(input(), reverse=True)
aa = ''.join(a)
bb = ''.join(b)
ans = 'No'
k = [aa, bb]
sorted(k)
if k[0] == bb:
print('Yes')
else:
print('No') |
p02678 | s549652398 | Accepted | from collections import deque
n, m = map(int, input().split())
rooms = [[] for i in range(n + 1)]
for i in range(m):
a, b = map(int, input().split())
rooms[a].append(b)
rooms[b].append(a)
q = deque()
q.append(1)
signs = [-1]*(n + 1)
signs[1] = 0
while q:
rnum = q.popleft()
for i in rooms[rnum]:
if signs[i] == -1:
signs[i] = rnum
q.append(i)
print("Yes")
for i in signs[2:]:
print(i) |
p03385 | s773992331 | Accepted | s = list(str(input()))
a = 0
b = 0
c = 0
for i in range(len(s)):
if s[i] == 'a':
a += 1
elif s[i] == 'b':
b += 1
elif s[i] == 'c':
c += 1
if a == 1 and b == 1 and c == 1:
print('Yes')
else:
print('No')
|
p02866 | s275224162 | Wrong Answer | from collections import Counter
N = input()
D_list = list(map(int, input().split()))
max_D = max(D_list)
cnt_dic = dict(Counter(D_list))
if (D_list[0] == 0) & (cnt_dic.get(0) == 1):
ans = 1
for n in range(1, max_D + 1):
ans *= cnt_dic.get(n - 1, 0) ** cnt_dic.get(n, 1)
print(ans)
else:
print(0) |
p03250 | s694322602 | Wrong Answer | a, b, c = map(int, input().split())
ans = []
ans.append(100* a + 10*b + c)
ans.append(100* a + 10*c + b)
ans.append(100* b+ 10*a + c)
ans.append(100* b + 10*b + a)
ans.append(100* c + 10*a + b)
ans.append(100* c + 10*b + a)
print(max(ans)) |
p03997 | s579348858 | Wrong Answer | a = int(input())
b = int(input())
h = int(input())
print((a + b) * h / 2)
|
p03803 | s736188532 | Wrong Answer | a,b=map(int,input().split())
if a>b:
print('Alice')
elif a<b:
print('Bob')
else:
print('Draw') |
p02789 | s119523582 | Accepted | n, m = list(map(int, input().split()))
print('Yes' if n == m else 'No')
|
p02683 | s128265053 | Accepted | N,M,X=[int(s) for s in input().split()]
Book=[[int(s) for s in input().split()] for _ in range(N)]
INF=10**7
ans=set()
ans.add(INF)
for n in range(2**N):
#Bit全探索
Xls=[0 for i in range(M)]
cost=0
for i in range(N):
if ((n>>i)&1)==1:
cost+=Book[i][0]
for b in range(M):
Xls[b]+=Book[i][b+1]
if min(Xls)>=X:
ans.add(cost)
if min(ans)==INF:
print(-1)
else:
print(min(ans)) |
p02859 | s415929026 | Accepted | r = int(input())
print(r*r) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.