problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02742 | s594267326 | Wrong Answer | a, b = map(int,input().split())
if (a*b)%2==1:
print((a*b)//2+1)
else:
print(a*b/2) |
p02664 | s484415715 | Accepted | t = input()
ans = ""
j = 0
for i in t:
if i in ["?"]:
ans += "D"
else:
ans += i
print(ans) |
p02899 | s858922889 | Accepted | def main():
n = int(input())
alist = map(int, input().split())
print(" ".join(
[str(i + 1) for i, _ in sorted(enumerate(alist), key=lambda x: x[1])]))
main()
|
p02784 | s130812968 | Accepted | h, n = map(int, input().split())
a = map(int, input().split())
if sum(a) < h:
print('No')
else:
print('Yes')
|
p02705 | s293725987 | Accepted | import math
print(2*math.pi*int(input())) |
p02601 | s734611267 | Accepted | a,b,c,k=map(int,open(0).read().split())
while a>=b:b+=b;k-=1
while b>=c:c+=c;k-=1
print('YNeos'[k<0::2]) |
p02688 | s963390893 | Accepted | n, k = map(int, input().split())
ans = []
for i in range(k):
x = int(input())
x = list(map(int, input().split()))
for j in x:
ans.append(j)
ans = set(ans)
cnt = 0
for i in range(1, n+1):
if not i in ans:
cnt += 1
print(cnt) |
p02842 | s835254174 | Accepted | N = int(input())
div = int(N / 1.08)
if int(int(div) * 1.08) == N:
print(div)
elif int(int(div + 1) * 1.08) == N:
print(div + 1)
else:
print(":(")
|
p02576 | s016611768 | Wrong Answer | def calculate(N,X,T):
x = N // X
if x ==0:
return T
elif not N % X == 0:
return (x + 1)*T;
else:
return x*T
N,X,T = 100,20,30
result = calculate(N,X,T)
print(result) |
p03251 | s696200293 | Accepted | n,m,x,y = map(int,input().split())
xlist = list(map(int,input().split()))
ylist = list(map(int,input().split()))
if max(xlist)<y and x<min(ylist) and max(xlist)<min(ylist):
print("No War")
else:
print("War") |
p03745 | s763378007 | Accepted | N = int(input())
A = list(map(int, input().split()))
cnt = 1
status = 0
for i in range(N-1):
if A[i] > A[i+1]:
if status == 0: status = 1
elif status == -1:
status = 0
cnt += 1
elif A[i] < A[i+1]:
if status == 0: status = -1
elif status == 1:
status = 0
cnt += 1
print(cnt) |
p03962 | s765683014 | Accepted | a,b,c=input().split()
if a==b==c:
print("1")
elif a==b or b==c or c==a:
print("2")
else:
print("3") |
p03351 | s243448974 | Wrong Answer | a, b, c, d = map(int, input().split())
if abs(a-c) <= d or abs(b-c) <= d:
print('Yes')
else:
print('No')
# aとcが直接的もしくはbとcが直接的だと成り立つ
# or構文に変更
|
p03282 | s688344630 | Accepted | s = input()
k = int(input())
ans = 1
for i in range(k):
if s[i] != '1':
ans = s[i]
break
print(ans) |
p02866 | s053928179 | Accepted | n = int(input())
d = list(map(int, input().split()))
mod = 998244353
a = [0] * n
for d_ in d:
a[d_] += 1
res = d[0] == 0 and a[0] == 1
pre = 1
for a_ in a:
res *= pre ** a_
res %= mod
pre = a_
print(res) |
p02785 | s160609692 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
if n <= k:
print("0")
else:
h.sort(reverse=True)
h_new = h[k:]
print(sum(h_new))
|
p02747 | s029811228 | Accepted | s = input()
hi = 'hi'
if s =='hi' or s == 'hihi' or s == 'hihihi' or s == 'hihihihi' or s == 'hihihihihi':
print('Yes')
else:
print('No')
|
p02792 | s461069333 | Wrong Answer | N = int(input())
l = [[0] * 10 for _ in range(10)]
ans = 0
for i in range(N):
s = int(str(i)[0])
t = int(str(i)[-1])
l[s][t] += 1
for i in range(1, 10):
for j in range(1, 10):
ans += l[i][j] * l[j][i]
print(ans) |
p02742 | s434776834 | Accepted | h,w=map(int,input().split())
if h==1 or w==1:
print(1)
exit()
print(-(-h*w//2)) |
p02801 | s524161773 | Wrong Answer | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
c = read().decode("utf-8")
l = [chr(ord('a') + i) for i in range(26)]
if c == "z":
print("a")
quit()
f = False
for a in l:
if a == c:
f = True
... |
p02713 | s864830246 | Accepted | import sys
from math import gcd
def solve(K: int):
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += gcd(gcd(i, j), k)
print(ans)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for wo... |
p03469 | s059820968 | Accepted | S = input()
Sn = S.replace('2017','2018')
print(Sn) |
p03434 | s657488923 | Accepted | import sys
from itertools import combinations
import math
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
A = LI()
A.sor... |
p03699 | s581526559 | Accepted | n = int(input())
s = sorted([int(input()) for _ in range(n)])
a = sum(s)
if a % 10:
print(a)
else:
for si in s:
if si % 10:
print(a - si)
break
else:
print(0) |
p03486 | s388318371 | Accepted | import sys
S = "".join(sorted(input()))
T = "".join(sorted("".join(sorted(input())), reverse=True))
print("Yes" if S < T else "No") |
p02584 | s793537085 | Wrong Answer | X,K,D = map(int, input().split())
place = X
if K > 50000 and K % 2 == 0:
K = 10000
if K > 50000 and K % 2 == 1:
K = 10001
for i in range(K):
if place == 0 and (K-i)%2==0:
break
if place >= 0 and (place - D) >= 0:
place -= D
elif place >= 0 and (place - D) <= 0:
place -= D... |
p03371 | s460195964 | Accepted | A, B, C, X, Y = map(int, input().split(" "))
prices = []
if X > Y:
half_max_count = X + 1
else:
half_max_count = Y + 1
# 3 for文はダメなので削減する
# sliceで半分にできる多分。
for i in range(0, half_max_count):
a_price = int(X - i) * A if (int(X - i) >= 0) else 0
b_price = int(Y - i) * B if (int(Y - i) >= 0) else 0
h... |
p03241 | s146246311 | Accepted | N,M = map(int,input().split())
gcd = M//N
while gcd*N!=M:
gcd = M//N
N = 1+(M-1)//gcd
print(gcd) |
p03659 | s956863016 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
B = [0]
for i in range(N):
B.append(B[i]+A[i])
ans = pow(10,9)
for i in range(N):
ans = min(ans,abs(B[N]-2*B[i]))
print(ans) |
p02578 | s894079295 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(len(a)-1):
if a[i]>a[+1]:
s+=0
else:
s+=a[i+1]-a[i]
print(s)
|
p03971 | s614000991 | Accepted | n,a,b=map(int,input().split())
cab,cb=0,0
S=input()
for i in range(n):
s=S[i]
if s=='c':
print('No')
if s=='a':
if cab<a+b:
print('Yes')
cab+=1
else:
print('No')
if s=='b':
if cab<a+b and cb<b:
print('Yes')
cab+=1
cb+=1
else:
print('No')
|
p03059 | s862794006 | Accepted | a,b,t = map(int,input().split())
print(t//a * b)
|
p02661 | s904527187 | Accepted | n,*l=map(int,open(0).read().split())
m,M=sorted(l[::2]),sorted(l[1::2])
d=n//2
print(M[d]-m[d]+1+(M[d-1]+-m[d-1])*(n%2^1)) |
p02657 | s561569609 | Accepted | a,b=map(int,input().split())
print(a*b) |
p02606 | s881165053 | Accepted | L , R , d = map(int,input().split())
k = 0
for i in range(L,R+1):
if i%d == 0:
k +=1
print(k) |
p03485 | s450596341 | Accepted | import math
a,b = map(int,input().split())
print(math.ceil((a+b)/2)) |
p02689 | s453184620 | Wrong Answer | (N,M)=input().split()
(N,M)=(int(N),int(M))
H=list(map(int, input().split()))
Bad=[]
AB=list(range(M))
for i in range(M):
AB[i]=list(map(int, input().split()))
if H[AB[i][0]-1] > H[AB[i][1]-1]:
Bad.append(H[AB[i][1]-1])
elif H[AB[i][0]-1] < H[AB[i][1]-1]:
Bad.append(H[AB[i][0]-1])
for i in range(len(Bad))... |
p03719 | s638770329 | Accepted | # https://atcoder.jp/contests/abc061/tasks/abc061_a
A, B, C = map(int, input().split())
if A <= C <= B:
print('Yes')
else:
print('No') |
p03106 | s249232746 | Wrong Answer | a,b,k=map(int,input().split())
for i in range(1,max(a,b)+1):
if a%i==0 and b%i==0:
k-=1
if k==1:
break
print(i)
|
p03723 | s594228762 | Accepted | a ,b ,c = map(int,input().split())
if a == b == c and a % 2 == 0:
ans = -1
else:
ans = 0
while True:
if a % 2 == 1 or b % 2 == 1 or c % 2 == 1:
break
na = a
nb = b
nc = c
a = (nb + nc)//2
b = (na + nc)//2
c = (na + nb)//2
ans += 1
p... |
p02790 | s076264129 | Accepted | a,b = input().split()
a2 = a*int(b)
b2 = b*int(a)
print(min(a2,b2)) |
p02582 | s427768631 | Accepted | S = input()
if S == 'RRR':
print(3)
elif S == 'SSS':
print(0)
elif S == 'SRR' or S == 'RRS':
print(2)
else:
print(1) |
p03035 | s560614087 | Accepted | a,b = map(int, input().split())
if(a>=13):
print(b)
elif(a<=5):
print(0)
else:
print(int(b/2)) |
p02760 | s896858273 | Accepted | sheet=[list(map(int,input().split())) for i in range(3)]
n=int(input())
number=[int(input()) for i in range(n)]
answer="No"
for i in range(3):
for j in range(3):
if sheet[i][j] in number:
sheet[i][j]=0
if sheet[0][0]+sheet[1][1]+sheet[2][2]==0 or sheet[2][0]+sheet[1][1]+sheet[0][2]==0:
answer="Yes"... |
p02873 | s873143757 | Accepted | s = input()
n = len(s)+1
ans = 0
ls = [0 for _ in range(n)]
rs = [0 for _ in range(n)]
for i in range(n-1):
if s[i] == '<':
ls[i+1] = ls[i]+1
for i in range(n-1):
if s[-1-i] == '>':
rs[-2-i] = rs[-1-i]+1
for i,j in zip(ls,rs):
ans += max(i,j)
print(ans) |
p03282 | s232092401 | Wrong Answer | S = list(map(int,input()))
K = int(input())
for i in range(K):
if S[i] != 1:
print(S[i])
break |
p03997 | s336898466 | Accepted | a = int(input())
b = int(input())
h = int(input())
print(int((a+b)*h/2))
|
p03087 | s969337280 | Accepted | n, q = map(int, input().split())
s = input()
lc = [0]
c = 0
for i in range(n-1):
if s[i] == "A" and s[i+1] == "C":
c += 1
lc.append(c)
for i in range(q):
l, r = map(int, input().split())
print(lc[r-1]-lc[l-1])
|
p03385 | s707943920 | Wrong Answer |
S = list(input())
print(S)
if S.count('a') ==1 and S.count('b') and S.count('c'):
print('Yes')
else:
print('No') |
p03105 | s885638294 | Wrong Answer | A,B,C=map(int,input().split())
if A*C<B:
print(B)
else:
print(B//A) |
p02772 | s679119777 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
flag = 'APPROVED'
for a in A:
print(a)
if a % 2 == 0:
if a % 3 != 0:
if a % 5 != 0:
flag = 'DENIED'
break
print(flag) |
p03475 | s963263650 | Accepted | n = int(input())
csf = []
for _ in range(n-1):
c, s, f = map(int, input().split())
csf.append((c, s, f))
ans = [0]*n
for i, (c, s, f) in enumerate(csf):
for j in range(0, i+1):
if ans[j] <= s:
ans[j] = c+s
else:
ans[j] = (ans[j]+f-1)//f*f+c
for i in ans:
print(i) |
p02554 | s700512984 | Accepted | N=int(input())
print((pow(10,N)-2*pow(9,N)+pow(8,N))%(pow(10,9)+7)) |
p02795 | s020661950 | Accepted | h = int(input())
w = int(input())
n = int(input())
x = max(h, w)
if n%x == 0:
print(n//x)
else:
print(n//x+1) |
p03075 | s786248113 | Accepted | lis = []
for i in range(5):
lis.append(int(input()))
if max(lis)-min(lis) > int(input()):
print(":(")
else:
print("Yay!") |
p03239 | s984937245 | Accepted | # ABC112B
n, T = map(int, input().split())
Min = -1
for i in range(n):
c, t = map(int, input().split())
if t <= T:
if Min == -1:
Min = c
else:
Min = min(Min, c)
if Min == -1:
print('TLE')
else:
print(Min)
|
p03137 | s497137877 | Accepted | n,m = map(int,input().split())
n=min(n,m)
x = list(map(int,input().split()))
x = sorted(x)
#print("x",x)
y = []
for i in range(m-1):
y.append(x[i+1]-x[i])
y = sorted(y, reverse=True)
#print("y",y)
skip = 0
for i in range(n-1):
skip += y[i]
print(max(x)-min(x)-skip)
|
p03817 | s922823843 | Accepted | def solve():
X = int(input())
num, mod = divmod(X,11)
print(2*num+(mod+5)//6)
if __name__ == '__main__':
solve()
|
p02987 | s676695790 | Wrong Answer | S = input()
temp = S[0]
a = 1
b = 0
for i in range(1,4):
if temp == S[i]:
a = a+1
else:
b = b+1
if b == 2 and a == 2:
print('Yes')
else:
print('No') |
p03062 | s088069341 | Accepted | n=int(input())
a=list(map(int,input().split()))
A=[]
B=[]
for i in range (n):
p=abs(a[i])
A.append(p)
if a[i]<0:
B.append(a[i])
if len(B)%2==0:
print(sum(A))
else:
print(sum(A)-(min(A)*2),)
|
p02811 | s572123812 | Wrong Answer | k, yen = input().split()
print('Yes' if k*500>yen else 'No') |
p03778 | s394098730 | Wrong Answer | W,a,b=map(int,input().split())
if a+W<b:
print(b-(W+a))
else:
print(0) |
p03206 | s467710754 | Wrong Answer | d = input()
if d == 25:
print("Christmas")
elif d == 24:
print("Christmas eve")
elif d == 23:
print("Christmas eve eve")
else:
print("Christmas eve eve eve") |
p02726 | s653026084 | Accepted | n, x, y = [int(i) for i in input().split()]
ans = [0]*n
for i in range(1, n):
for j in range(i+1, n+1):
ans[min(j-i, abs(x-i)+abs(j-y)+1)] += 1
print(*ans[1:], sep='\n') |
p02707 | s954514168 | Accepted | N = int(input())
A = list(map(int, input().split()))
answer = [0] * N
for i in A:
answer[i-1] += 1
for n in answer:
print(n) |
p04011 | s621154003 | Wrong Answer | N=int(input())
K=int(input())
X=int(input())
Y=int(input())
print(K*X+(N-K)*Y) |
p03408 | s911449001 | Wrong Answer | n = int(input())
s = [input().split() for _ in range(n)]
m = int(input())
t = [input().split() for _ in range(m)]
ans = -100
for i in s:
ans = max(ans,s.count(i) - t.count(i))
print(ans) |
p03637 | s024035536 | Accepted | n = int(input())
lis = list(map(int, input().split()))
b = [0]*3
for i in lis:
if i % 4 == 0:
b[2] += 1
elif i % 2 == 0:
b[1] += 1
else:
b[0] += 1
if b[1] == 0:
if b[2] + 1 >= b[0]:
print("Yes")
exit()
else:
print("No")
exit()
if b[2] >=... |
p02994 | s711123006 | Accepted | n, l = map(int, input().split())
scores = [ i+l for i in range(n) ]
min_abs = float("inf")
for s in scores:
if abs(s) < abs(min_abs):
min_abs = s
print(sum(scores)-min_abs) |
p02547 | s965797144 | Wrong Answer | N = int(input())
xy = [map(int, input().split()) for _ in range(N)]
x, y = [list(i) for i in zip(*xy)]
flag = 0
count = 0
for i in range(N-1):
if x[i] == y[i]:
count += 1
if count >= 3:
flag = 1
else:
count = 0
if flag == 1:
print('Yes')
else:
print('No') |
p03797 | s143134195 | Accepted | s, c = map(int, input().split())
c = c//2
if s == c:
print(s)
elif s > c:
print(c)
elif s < c:
t = c - s
print(s + t//2) |
p03548 | s702720517 | Wrong Answer | a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
print((a-c)//b) |
p03720 | s977136010 | Accepted | n, m = map(int, input().split())
ans = [0] * n
for _ in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
ans[a] += 1
ans[b] += 1
for i in ans:
print(i) |
p02645 | s002607755 | Accepted | S = input()
print(S[0]+S[1]+S[2]) |
p02554 | s643674266 | Accepted | N=int(input())
mod = 10**9+7
A=pow(10,N,mod)-2*pow(9,N,mod)+pow(8,N,mod)
print(A%mod) |
p03698 | s676315458 | Wrong Answer | # import math
# import statistics
a=input()
#b,c=int(input()),int(input())
c=[]
for i in a:
c.append(i)
#e1,e2,e3,e4 = map(int,input().split())
#f = list(map(int,input().split()))
#g = [input() for _ in range(a)]
count=0
for i in range(len(c)-1):
if c[i]==c[i+1]:
count+=1
if count>0:
print("no")
els... |
p02924 | s024836529 | Accepted | n = int(input())
print(n*(n-1)//2) |
p03105 | s379012135 | Accepted | A,B,C = map(int,input().split())
print(min(C, B//A)) |
p02678 | s032054512 | Wrong Answer | from collections import deque
N,M=map(int,input().split())
tree=[[0] for _ in range(N)]
for _ in range(M):
A,B=map(int,input().split())
tree[A-1].append(B-1)
tree[B-1].append(A-1)
dist = [-1]*N
que = deque([0])
dist[0] = 0
while que:
v = que.popleft()
d = dist[v]
for w in tree[v]:
if... |
p03379 | s661294722 | Accepted | import copy
n=int(input())
x=list(map(int,input().split()))
y=copy.copy(x)
y.sort()
left=y[n//2-1]
right=y[n//2]
for i in range(n):
if x[i]<=left:
print(right)
else:
print(left)
|
p02797 | s388195091 | Wrong Answer | from math import ceil
N, K, S = map(int,input().split())
if N == K:
for i in range(K): print(S,end=" ")
else:
for i in range(ceil(K/2)):
print(S-1,end=" ")
print(1,end=" ")
if K%2 == 0:
print(S-1,end=" ")
for i in range(N-ceil(K/2)*2-1):
print(10**9,end=" ")
else:
for i in range(N... |
p02711 | s251839946 | Wrong Answer | print('7' in input()) |
p02595 | s691987425 | Accepted | N, D = map(int, input().split())
x, y = 0, 0
res = 0
for _ in range(N):
x, y = map(int, input().split())
if (x ** 2 + y ** 2) ** 0.5 <= D:
res += 1
print(res)
|
p02814 | s477506692 | Accepted | import sys
input = sys.stdin.readline
n,m = map(int,input().split())
a = [int(i) for i in input().split()]
a = sorted(list(set(a)))
from fractions import gcd
lc = a[0]
if n != 1:
for num,i in enumerate(a[1:]):
if lc == 0:
break
lc = lc * i // gcd(lc, i)
if gcd(lc, i) == min(i,lc):
for j in a[:... |
p02711 | s055376563 | Accepted | n = input()
if '7' in n:
print('Yes')
else:
print('No')
|
p03711 | s721769974 | Wrong Answer | x, y = map(int, raw_input() .split())
list1 = [1, 3, 5, 7, 8, 10, 12]
list2 = [4, 6, 9, 11]
list3 = [2]
if x and y in list1 or list2 or list3:
print "Yes"
else:
print "No"
|
p03862 | s987817342 | Wrong Answer | def candy():
boxNum, x = [int(i) for i in input().split()]
ain = input()
alist = ain.split(' ')
s = 0
if int(alist[0]) > x:
s = x - int(alist[0])
alist[0] = x
for i in range(0, boxNum-1):
if int(alist[i+1]) + int(alist[i]) > x:
s = s + (int(alist[i+1]) + in... |
p03836 | s037705846 | Accepted | sx, sy, tx, ty=map(int,input().split())
hrz=tx-sx
vrt=ty-sy
a="U"*vrt
b="R"*hrz
c="D"*vrt
d="L"*hrz
ans1=a+b+c+d
a2=a+"U"
b2=b+"R"
c2=c+"D"
d2=d+"L"
ans2="L"+a2+b2+"DR"+c2+d2+"U"
print(ans1+ans2) |
p03262 | s752042132 | Wrong Answer | from fractions import gcd
n,X=map(int,input().split())
x=list(map(int,input().split()))
x.append(X)
x.sort()
ans=x[1]-x[0]
for i in range(2,n):
ans=gcd(ans,x[i]-x[i-1])
print(ans) |
p02817 | s748755006 | Accepted | words = input().split(' ')
print(words[1]+words[0]) |
p02801 | s253131570 | Accepted | C = input()
C = ord(C)
C = C+1
print(chr(C)) |
p03962 | s704601052 | Wrong Answer | if __name__ == "__main__":
a, b, c = map(int,input().split())
ans = 3
if a == b:
ans -= 1
if b == c:
ans -= 1
print(ans)
|
p02795 | s128485862 | Accepted | line = int(input())
column = int(input())
min_black_tile = int(input())
paint_tile = 0
count = 0
if line > column:
while paint_tile < min_black_tile:
paint_tile += line
count += 1
print(count)
else:
while paint_tile < min_black_tile:
paint_tile += column
count += 1
print(count) |
p03043 | s157626288 | Accepted | import math
N, K = map(int, input().split())
ans = sum(0.5 ** math.ceil(math.log2(K / i)) if K > i else 1 for i in range(1, N + 1)) / N
print(ans)
|
p03289 | s762449229 | Accepted | S = input()
if S[0] == "A":
S_cpy = S.lstrip("A")
else:
print("WA")
exit()
if S[2:-1].count("C") == 1:
S_cpy = S_cpy.replace("C", "")
else:
print("WA")
exit()
if S_cpy.islower():
print("AC")
else:
print("WA") |
p02792 | s334419243 | Wrong Answer | n=int(input())
ct=0
for i in range(n):
j=str(i)
if int(j[::-1])<i:
ct+=1
elif int(j[::-1])==i:
ct+=len(j)
print(ct) |
p02555 | s763413664 | Accepted | n=int(input())
if n<7:print(n//3);quit()
M=10**9+7
ln,hn,dp=n-6,n-5,2
s=n-4
n,d=n-5,1
while n:
for i in range(3):n=(n*ln)%M;ln-=1
for i in range(2):n=(n*pow(hn,-1,M))%M;hn-=1
d=(d*pow(dp,-1,M))%M;dp+=1
s=(s+n*d)%M
print(s) |
p02756 | s772333273 | Accepted | from collections import deque
S = deque(input())
Q = int(input())
flip = False # False: left side is the head
for i in range(Q):
Query_i = list(map(str, input().split()))
if Query_i[0]=='1':
flip = not flip
elif Query_i[1] == '1' and not flip:
S.appendleft(Query_i[2])
elif Query_i[1] == '1' and flip:
... |
p03013 | s645862368 | Accepted | fib = [0 for i in range(10**5+1)]
fib[0] = 1
fib[1] = 1
for i in range(2,10**5+1):
fib[i] = fib[i-1] + fib[i-2] % (10**9+7)
n,m = map(int,input().split())
a = [-1]
for i in range(m):
ai = int(input())
if ai - a[i] == 1:
print(0)
exit()
a.append(ai)
a.append(n+1)
ans = 1
for i in range(1,... |
p02989 | s513960713 | Accepted | N=int(input())
d=list(map(int, input().split()))
d=sorted(d)
ans=0
for i in range(1+10**5):
if d[int(N/2-1)] < i and i <= d[int(N/2)]:
ans +=1
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.