problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03317 | s082087848 | Wrong Answer | n,k=map(int,input().split())
if n==k:
print(1)
elif n%(k-1)==1:
print(n//(k-1))
else:
print((n+k-2)//(k-1)) |
p03317 | s890129494 | Wrong Answer | N,K = (int(X) for X in input().split())
A = [int(X) for X in input().split()]
Left = A.index(1)
Right = (N-1)-Left
Count = (Right%(K-1)!=0)+Right//2
Left = max(0,Left-Right%(K-1))
Count += (Left%(K-1)!=0)+Left//2
print(Count) |
p03317 | s044442496 | Wrong Answer | N, K = map(int,input().split())
Alist = list(map(int,input().split()))
print(-(-N-1//K-1)) |
p03317 | s470047295 | Wrong Answer | import math
N, K = map(int,input().split())
A = list(map(int,input().split()))
index = 0
for i in range(N):
if A[i] < A[index]:
index = i
print(math.ceil(index / (K-1)) + math.ceil((N-index-1) / (K-1))) |
p03317 | s467407046 | Wrong Answer | N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = (N // (K-1))
print(ans)
|
p03317 | s982939159 | Wrong Answer | n,k=map(int,input().split())
a = list(map(int,input().split()))
if n % k == 0:
print(int(n/k))
elif n % (k-1) == 0:
print(int(n/(k-1)))
else:
print(int(n/(k-1)+1)) |
p03317 | s845424198 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
m = n-k
if n>k:
print(m//(k-1) + 2)
else:
print(m//(k-1) + 1) |
p03317 | s165371027 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
print(N // (K - 1)) |
p03317 | s730753869 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int , input().split()))
idx = a.index(1)
l = idx + 1
r = n - idx
if n == k:
print(1)
exit()
ln = 1
if l >= k:
ln = l // (k-1)
rn = 1
if r >= k:
rn = r // (k-1)
print(ln + rn)
|
p03317 | s970387051 | Wrong Answer | N,K = map(int,input().split())
A = list(map(int,input().split()))
i = 0
cnt = 0
while True:
if N == K:
cnt += 1
#print(1)
break
ans = A[i*2:i*2+K]
if not ans:
break
i+=1
#print(ans)
cnt +=1
print(cnt) |
p03317 | s035126791 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
if n>k:
print((n+1)//k+1)
else:
print(1) |
p03317 | s745031294 | Wrong Answer | N,K=map(int,input().split())
x=list(map(int,input().split()))
if N%K==0:
print(N//K)
else:
print(N//K+1) |
p03317 | s542230384 | Wrong Answer | import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
A_min = min(A)
index = A.index(A_min)
ans = 0
left = index
right = N - 1 - index
if left % (K - 1) == 1:
right -= 1
elif right % (K - 1) == 1:
left -= 1
ans += math.ceil(left / (K - 1))
ans += math.ceil(right / (K - 1))
print(ans) |
p03317 | s953593941 | Wrong Answer | n,k = map(int,input().split())
a = list(map(int, input().split()))
print(1 if n==k else 1+(n-1)//(k-1)) |
p03317 | s064893894 | Wrong Answer | n,k = map(int, input().split())
al = list(map(int, input().split()))
if n==k:
print(1)
exit()
x = n//(k-1)
y = n%(k-1)
if y >0:
print(x+1)
else:
print(x) |
p03317 | s887716805 | Wrong Answer | import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10**9)
mod = 10**9+7
N,K = I()
A = l()
m = min(A)
start = 0
ans = 0
for i in range(N):
if A[i] == m:
ans += math.ceil((i-start)/(K-1))
start = i+1
ans += math.ceil((N-start)/(K-1))
print(ans) |
p03317 | s162758278 | Wrong Answer | n, k = map(int, input().split())
As = list(map(int, input().split()))
idx = As.index(1)
nf = n-1 - idx
nb = idx
ans = 0
while nf > 0:
nf -= k-1
ans += 1
while nb > 0:
nb -= k-1
ans += 1
print(ans)
|
p03317 | s183508050 | Wrong Answer | import math
n,k = map(int,input().split())
ls = list(map(int,input().split()))
a = min(ls)
i = ls.index(a)
l = i
r = n - i - 1
if r < l:
l,r = r,l
if n == k:
print("1")
elif l < k-1:
print(int(r-k+1+l)+1)
else:
print(int(math.ceil(l/(k-1))+math.ceil(r/(k-1)))) |
p03317 | s678578313 | Wrong Answer | N,K=map(int,input().split())
A=list(map(int,input().split()))
ans=-(-A.index(1))//(K-1)-(-N+A.index(1)+1)//(K-1)
print(ans) |
p03317 | s256409550 | Wrong Answer | n, k = map(int, input().split())
A = [int(x) for x in input().split()]
i1 = A.index(1)
ans = 0
tmp = i1
while True:
if tmp <= 0:
break
tmp -= k - 1
ans += 1
tmp = i1
while True:
if n - 1 <= tmp:
break
tmp += k - 1
ans += 1
print(ans)
|
p03317 | s970382172 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
k -= 1
ans = n // k
print(ans)
|
p03317 | s822702743 | Wrong Answer | n, k = map(int, input().split())
A = list(map(int, input().split()))
idx = A.index(1)
d = k-1
if idx == 0 or idx == n-1:
ans = (n - 1 + d - 1) // d
elif idx <= k-1 or n-k <= idx:
ans = 1 + (n - k + d - 1) // d
else:
ans = (idx + d - 1) // d + (n - idx - 1 + d - 1) // d
print(ans) |
p03317 | s896163959 | Wrong Answer | N, K = map(int, input().split())
A = [int(x) for x in input().split()]
c = 0
while N > 0:
c += 1
N -= K-1
print(c)
|
p03317 | s337361196 | Wrong Answer | # https://atcoder.jp/contests/abc101/tasks/arc099_a
import sys
read = sys.stdin.readline
ra = range
enu = enumerate
def read_ints():
return list(map(int, read().split()))
N, K = read_ints()
A = read_ints()
K -= 1
i = A.index(1)
right = (i - 1) // K + 1
left = (N - 1 - i - 1) // K + 1
# コーナーケース対策
print(right + left if N != K else 1)
|
p03317 | s391311177 | Wrong Answer | N,K=map(int,input().split())
A=list(map(int,input().split()))
if K == N:
print(1)
exit()
MIN = min(A)
argmin=[]
for i in range(N):
if A[i]==MIN:argmin.append(i)
a = argmin[0]
SUM=0
SUM += (a+(K-2)) // (K-1)
SUM += ((N-1-a)+(K-2))//(K-1)
print(SUM) |
p03317 | s374348338 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
mn = 0
for i in range(n):
mn = min(mn, a[i])
ans = 0
if (k != 1):
k -= 1
for i in range(0, n, k):
ans += 1
if n == k + 1 or k == 1:
ans -= 1
print(ans)
|
p03317 | s269516078 | Wrong Answer | import math
n,k=map(int,input().split())
a=[int(x) for x in input().split()]
print(math.ceil(n/k)) |
p03317 | s261090535 | Wrong Answer | N , K = map(int,input().split())
print(N//(K-1)) |
p03317 | s972735366 | Wrong Answer | import math
N, K = map(int, input().split())
arr = list(map(int, input().split()))
if N == K:
print(1)
exit()
mae = arr.index(1)
usiro = len(arr)-1-arr.index(1)
ans = math.ceil(mae/(K-1))+math.ceil(usiro/(K-1))
if mae ==0 or mae ==N-1:
print(ans-1)
exit()
else:
print(ans) |
p03317 | s817987490 | Wrong Answer | import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N,K = MI()
A = LI()
i = A.index(1)
j = N-1-i
print((i+1)//2 + (j+1)//2)
|
p03317 | s220975459 | Wrong Answer | N,K=map(int,input().split())
A=list(map(int,input().split()))
result=-(-len(A)//K)
print(result)
|
p03317 | s380577533 | Wrong Answer | import math
n,k = map(int,input().split())
a = list(map(int,input().split()))
m = 0
for i in range(n):
if a[i] == 1:
m = i
break
print(math.ceil((i-1)/(k-1))+math.ceil((n-i)/(k-1)))
|
p03317 | s776904805 | Wrong Answer | N,K=map(int,input().split())
a=list(map(int,input().split()))
index=a.index(1)
l=index
r=index
cnt=0
while l!=0:
if cnt==0:
if l-K+1<0:
r=K-1
l=max(0,l-K+1)
cnt+=1
while r!=N-1:
r=min(N-1,r+K-1)
cnt+=1
print(cnt) |
p03317 | s382063617 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
if k < n:
left = a.index(1)
if left % (k - 1) == 0:
ans = left // (k - 1)
else:
ans = (left // (k - 1)) + 1
right = n - left - 1
if right % (k - 1) == 0:
ans += right // (k - 1)
else:
ans += (right // (k - 1)) + 1
else:
ans = 1
print(ans) |
p03317 | s584237293 | Wrong Answer | from math import ceil
import sys
N, K = map(int, input().split())
A = list(map(int, input().split()))
if N == K:
print(1)
sys.exit()
idx = A.index(1)
ans = ceil((N - idx) / 2)
ans += idx // 2
print(ans)
|
p03317 | s026989452 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
if n==k:
print(1)
else:
print((n+k-2)//(k-1)) |
p03317 | s995246309 | Wrong Answer | N,K = map(int, input().split())
A=list(map(int,input().split()))
min_num=min(A)
count=K-1
print(int(-(-len(A)/count))) |
p03317 | s743001599 | Wrong Answer | import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
A_min = min(A)
cnt = 0
now = 0
for i in range(N):
if A[i] == A_min:
if now == 0:
cnt += math.ceil((i - now) / 2)
now = i
else:
cnt += math.ceil((i - now - 1) / 2)
now = i
if (i - now) % 2 == 1:
now += 1
cnt += math.ceil((N - 1 - now) / 2)
print(cnt) |
p03317 | s610884986 | Wrong Answer | N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
print(N // (K - 1)) |
p03317 | s881167590 | Wrong Answer | import math
N,K=list(map(int, input().split()))
A=list(map(int, input().split()))
if((N+1)/K==2):
print(math.ceil(N/(K-1)))
elif(N!=K):
print(2)
else:
print(1) |
p03317 | s530511043 | Wrong Answer | N,K=map(int,input().split())
alist=list(map(int,input().split()))
print(N//(K-1)) |
p03317 | s763084513 | Wrong Answer | #!/usr/bin/env python3
import math
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
index = a.index(1)
pre = index
post = n-index-1
post = max(post - pre % (k-1), 0)
ans = 0
ans += math.ceil(pre/(k-1))
ans += math.ceil(post/(k-1))
print(ans)
|
p03317 | s275095357 | Wrong Answer | def resolve():
import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
one = A.index(1)+1
print(math.ceil((one-1)/(K-1))+math.ceil((N-one)/(K-1)))
resolve() |
p03317 | s802464833 | Wrong Answer | N, K = map(int,input().split())
Alist = list(map(int,input().split()))
n = 0
for i in range(N):
if Alist[i] == 1:
p = i
n = n -(-p//(K-1))
n = n -(-(N-p-1)//(K-1))
print(n) |
p03317 | s138293535 | Wrong Answer | import math
N,K=list(map(int, input().split()))
A=list(map(int, input().split()))
if((N+1)/K==2):
print(2)
elif(N!=K):
print(math.ceil(N/(K-1)))
else:
print(1) |
p03317 | s594961719 | Wrong Answer | n,k=map(int,input().split())
k-=1
a=list(map(int, input().split()))
for i in range(n):
if a[i]==1:
index=i
print(-(-index//k)-(-(n-index-1)//k))#pythonで切り上げの書き方 |
p03317 | s424155167 | Wrong Answer | n, k = map(int, input().split())
As = list(map(int, input().split()))
idx = As.index(min(As))
left = idx
right = n - idx - 1
n_l = (left + k - 2) // (k - 1)
n_r = (right + k - 2) // (k - 1)
print(n_l + n_r) |
p03317 | s286344271 | Wrong Answer | n,k = map(int,input().split())
a = list(map(int,input().split()))
print(n//(k-1)) |
p03317 | s176208762 | Wrong Answer | n,k=map(int,input().split())
a = list(map(int,input().split()))
print((n-1)//(k-1)) |
p03317 | s055332255 | Wrong Answer | ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n,k = nm()
a = nl()
m = min(a)
ans=0
cnt=0
for i in range(n):
cnt+=1
if cnt == k:
ans+=1
cnt=1
if a[i]==m:
cnt=1
if cnt!=1:
ans+=1
print(ans) |
p03317 | s923359486 | Wrong Answer | x, y = map(int,input().split())
li = list(map(int,input().split()))
a = li.index(1)
b = x-a+1
if x == y:
print(1)
else:
print(a//(y-1)+b//(y-1)) |
p03317 | s748298395 | Wrong Answer | n,k=map(int,input().split())
a=list(map(int,input().split()))
z=a.index(1)
L= -(-z//(k-1))
R=-(-(n-z-1)//(k-1))
if z%(k-1)+(n-z-1)%(k-1)>=k:
print(L+R-1)
else:
print(L+R) |
p03317 | s739776650 | Wrong Answer | #!/usr/bin/env python3
# スペース区切りの整数の入力
n, k = map(int, input().split())
#配列の入力
data = list(map(int, input().split()))
min = data.index(1)
ret = 0
a = len(data[:min])-1
b = len(data[min:])-1
#print(a)
#print(b)
if a > 0:
ret += -(-a // (k-1))
if b > 0:
ret += -(-b // (k-1))
print(ret)
|
p03317 | s055101333 | Wrong Answer | N,K = map(int,input().split())
A = list(map(int,input().split()))
if (N-1)%(K-1) == 0:
print(N-1//K-1)
else:
print(N-1//K-1 + 1) |
p03317 | s494669389 | Wrong Answer | n,k = map(int,input().split())
a = [int(i) for i in input().split()]
b = a.index(1)
if b < k-1:
b += k-1 -b
if b > (n-1) -(k-1):
b -= b - (k-1)
c,d = divmod(b,k-1)
ans = c
rem = d
if d != 0:
ans +=1
e = n-1 -b
c,d = divmod(e,k-1)
ans += c
if d != 0:
ans +=1
if rem + d <= k-1:
ans -=1
print(ans)
|
p03317 | s423088198 | Wrong Answer | n,k = map(int,input().split())
a = list(map(int,input().split()))
print((n-1) // (k-1)) |
p03317 | s178150974 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
if (n-k)%(k-1) ==0:
print((n-k)//(k-1)+1)
else:
print((n-k)//(k-1)+3)
|
p03317 | s831168231 | Wrong Answer | ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n,k = nm()
a = nl()
import math
for i in range(n):
if a[i]==1:
x = math.ceil(i/(k-1))
y = math.ceil((n-i-1)/(k-1))
ans = x+y
print(ans) |
p03317 | s729923757 | Wrong Answer | n,k=map(int,input().split());a=list(map(int,input().split()))
print(int(n/(k-1))) |
p03317 | s783014953 | Wrong Answer | n,k=(int(i) for i in input().strip().split(" "))
ar=[int(i) for i in input().strip().split(" ")]
from math import ceil
pos=ar.index(1)
a=n-1-pos
b=pos
ans=ceil(a/(k-1))
ans+=ceil(b/(k-1))
print(ans) |
p03317 | s728524641 | Wrong Answer | import math
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
if(K-1 == 1):
print(N - 1)
else:
print(N // (K - 1)) |
p03317 | s366129037 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
# 1の場所を探す
pos = A.index(1)
count = 0
range_s = pos - 1 # 1でない前方位置はここまで
range_e = pos + 1 # 1でない後方位置はここから
while range_s >= 0: # 先頭まで1にする
range_s -= K-1
count += 1
while range_e < N: # 末尾まで1にする
range_e += K-1
count += 1
print(count)
|
p03317 | s449209194 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
x = a.index(1)
left = x
right = n - x - 1
ans = n
for i in range(k):
if left < i:
continue
a = left - i + 1
if right - k + 2 + i < 0:
continue
b = right - k + 2 + i
print(a, b)
w = a//(k-1) + b//(k-1)
ans = min(ans, w)
print(ans + 1)
|
p03317 | s034245334 | Wrong Answer | def LI():
return [ int(s) for s in input().split() ]
N,K = LI()
print(N//K + 1) if N%K != 0 else print(N//K) |
p03317 | s158708073 | Wrong Answer | N, K = map(int, input().split())
arr = list(map(int, input().split()))
index = arr.index(1) + 1
left = -(-(index - 3)//2) + 1
right = -(-(N - index + 1 - 3)//2) + 1
print(left+right) |
p03317 | s201920965 | Wrong Answer | import math
N,K=map(int,input().split())
A=list(map(int,input().split()))
if N==K:
print(1)
else:
print(math.ceil(N/(K-1))) |
p03317 | s338794531 | Wrong Answer | import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
min_index = A.index(1)
answer = math.ceil(min_index/(K-1)) + math.ceil((N-min_index-1)/(K-1))
print(answer)
|
p03317 | s098629299 | Wrong Answer | N, K = map(int, input().split())
A = tuple(map(int, input().split()))
left = A.index(1)
right = N - left - 1
div_l, rem_l = divmod(left, K - 1)
div_r, rem_r = divmod(right, K - 1)
print(div_l + bool(rem_l) + div_r + bool(rem_r)) |
p03317 | s474255526 | Wrong Answer | import sys
input = sys.stdin.readline
def main():
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
x = A.index(1)
print(x // (K - 1) + (N - x) // (K - 1))
if __name__ == '__main__':
main()
|
p03317 | s851916691 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = n //(k-1)
print(ans) |
p03317 | s608115188 | Wrong Answer | N,K = map(int, input().split())
A =list(map(int, input().split()))
for i in range(N):
if A[i] == 1:
n = i
n = n+1
def main(M,P):
cnt = 1
while True:
M -= P
M += 1
if M > P:
cnt += 1
if M == 0:
break
if M != 0 and P > M:
cnt += 1
break
return cnt
if N == K:
print("1")
elif K >= n :
print(main(N,K))
else :
N1 = n
N2 = N-n+1
print(main(N1,K)+main(N2,K)) |
p03317 | s097637718 | Wrong Answer | import sys
import math
mod=10**9+7
inf=float("inf")
from math import sqrt
from collections import deque
from collections import Counter
input=lambda: sys.stdin.readline().strip()
sys.setrecursionlimit(11451419)
from functools import lru_cache
#メモ化再帰defの冒頭に毎回 @lru_cache(maxsize=10**10)
#引数にlistはだめ
#######ここまでテンプレ#######
#######ここから天ぷら########
n,k=map(int,input().split())
ans=1
now=k
while now<n:
n= n-k+1
ans+=1
now+=k-1
print(ans) |
p03317 | s635092427 | Wrong Answer | def main():
N, K = map(int, input().split())
A = input()
if N == K:
print('1')
elif N % (K-1) == 0:
print(N//(K-1))
else:
print(N//(K-1) + 1)
main()
|
p03317 | s313365388 | Wrong Answer | #import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left, bisect_right #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')
N, K = map(int, input().split())
A = list(map(int, input().split()))
mi = A.index(1)
lc = (mi+1)//2
rc = (N-mi)//2
print(lc+rc)
|
p03317 | s869512195 | Wrong Answer | n,k = map(int,input().split())
lst = list(map(int,input().split()))
id_one = lst.index(1)
left_length = len(lst[0:id_one])-1
right_length = len(lst[id_one:])-1
counter = 0
while left_length > 0:
counter += 1
left_length -= k-1
while right_length > 0:
counter += 1
right_length -= k-1
print(counter) |
p03317 | s555373694 | Wrong Answer | import math
N, K = map(int,input().split())
A = list(map(int,input().split()))
print(int(N/(K-1))) |
p03317 | s864329032 | Wrong Answer | # C - Minimization
N, K = map(int, input().split())
A = list(int(a) for a in input().split())
ans = 0
idx1 = A.index(1)
ans += idx1 // (K-1)
ans += (N-idx1) // (K-1)
print(ans) |
p03317 | s978668341 | Wrong Answer | N, K = map(int, input().split())
l = list(map(int, input().split()))
index = l.index(1) + 1
ans = 0
# 1よりも左に数列があるなら左を計算
if index != 1:
if index < K:
ans += 1
index = K
else:
p = index
while p > 1:
p -= (K-1)
ans += 1
# 1よりも右に数列があるなら右を計算
while index < N:
index = index + (K - 1)
ans += 1
print(ans)
|
p03317 | s704911333 | Wrong Answer | import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
index = A.index(min(A))
print(math.ceil(index / (K - 1)) + math.ceil((N - index - 1) / (K - 1)))
|
p03317 | s434435671 | Wrong Answer | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
i = a.index(1)
s = n
for j in range(i-k+1, i+1):
if j < 0:
continue
elif j >= n:
continue
else:
l = j
u = (n-1-j)
t = (l+1) // (k-1) + (u+1) // (k-1)
#print(t)
s = min(s, t)
print(s) |
p03317 | s705920666 | Wrong Answer | from math import ceil
n,k = map(int, input().split())
a = list(map(int, input().split()))
start = a.index(1)
if start == 0 or start == n-1:
print(ceil((n-1)/2))
else:
print(ceil((start-1)/2) + 1 + ceil((n-start-2)/2)) |
p03317 | s329628227 | Wrong Answer | n, k = map(int, input().split())
lis = list(map(int, input().split()))
if n == k:
print(1)
else:
print(n//(k-1)) |
p03317 | s667944241 | Wrong Answer | N,K = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
count = 0
for i in range(0,N,K-1):
count += 1
print(count) |
p03317 | s886731692 | Wrong Answer | from math import ceil
n,k = map(int, input().split())
a = list(map(int, input().split()))
m = a.index(1)
print(ceil(m/(k-1)) + ceil((n-1-m)/(k-1))) |
p03317 | s536823342 | Wrong Answer | n,k=map(int,input().split())
a=list(map(int,input().split()))
index = a.index(1)
left = a[:index]
right = a[index+1:]
import math
num_left = math.ceil( len(left)/(k-1) )
num_right = math.ceil( len(right)/(k-1) )
print(num_left+num_right) |
p03317 | s116126347 | Wrong Answer | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
if n<=k:
print(1)
exit()
n=n-k
if n%k==0:
print(1+n//(k-1))
else:
print(1+n//(k-1)+1) |
p03317 | s449283973 | Wrong Answer | import math
n,k=map(int,input().split())
a=list(map(int,input().split()))
ind=10**7
ans=0
for i in range(n):
if a[i]==1:
ind=i
break
ans+=math.ceil(ind/(k-1))+math.ceil((n-ind)/(k-1))
print(ans) |
p03317 | s252387757 | Wrong Answer | from math import ceil
n,k = map(int, input().split())
a = list(map(int, input().split()))
t = a.index(1)
print(ceil(t/(k-1)) + ceil((n-1-t)/(k-1))) |
p03317 | s193987267 | Wrong Answer | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
if n <= k:
print(1)
else:
print(n//(k-1)) |
p03317 | s142094572 | Wrong Answer | n, k = map(int, input().split())
A = list(map(int, input().split()))
answer = 50001
while True:
if n <= k + (k - 1) * (answer - 1):
answer -= 1
else:
break
print(answer + 1) |
p03317 | s842249306 | Wrong Answer | import math
N,K=list(map(int, input().split()))
A=list(map(int, input().split()))
if(N!=K):
print(math.ceil(N/(K-1)))
else:
print(1) |
p03317 | s651263554 | Wrong Answer | import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
#======================================================#
def main():
n, k = MII()
aa = MII()
print((-(-n//(k-1))) if n > 3 else 1)
if __name__ == '__main__':
main() |
p03317 | s987629128 | Wrong Answer | n,k=map(int,input().split())
input()
if n==k:
print(1)
else:
print((n+k-2)//(k-1)) |
p03317 | s697132167 | Wrong Answer | import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
index = A.index(1)
ans = math.ceil((N-1-index)/(K-1)) + math.ceil(index/(K-1))
print(ans)
|
p03317 | s337778015 | Wrong Answer | # -*- coding: utf-8 -*-
# モジュールのインポート
import math
# 標準入力を取得
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# 求解処理
x = A.index(1)
y = N - x - 1
ans = math.ceil(x / (K - 1)) + math.ceil((y - (x % (K - 1))) / (K - 1))
# 結果出力
print(ans)
|
p03317 | s137923485 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int , input().split()))
idx = a.index(1)
l = idx + 1
r = n - idx
print(max(0,l // (k-1)) + max(0,r // (k-1)))
|
p03317 | s021098456 | Wrong Answer | n,k=map(int,input().split())
a=map(int,input().split())
ans=0
while n>0:
ans+=1
n-=k
n+=1
print(ans)
|
p03317 | s975533334 | Wrong Answer | n, k = map(int, input().split())
A = list(map(int, input().split()))
part = []
ln = 0
for a in A:
if a == 1:
if ln > 0:
part.append(ln)
ln = 0
else:
ln += 1
else:
if ln > 0: part.append(ln)
ans = 0
for p in part:
ans += (p + 1) // 2
print(ans) |
p03317 | s827847019 | Wrong Answer | N, K = map(int, input().split())
S = map(int, input().split())
print(int(N / (K - 1))) |
p03317 | s845403902 | Wrong Answer | n, k = map(int,input().split())
print(n//(k-1) + 1)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.