problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03317 | s580515340 | Wrong Answer | n, k = list(map(int, input().split()))
a = input()
left = a.index('1')
right = n -left -1
b = k-1
p1 = (left+1)//b + (right+1)//b
p2 = 1 + left//b + right//b
print(min(p1, p2)) |
p03317 | s275145299 | Wrong Answer | n,k=map(int,input().split())
a=list(map(int,input().split()))
m=1000000
for i in range(n):
if a[i]==1:
x=i+1
b=x-1
c=n-x
ans=0
if b%(k-1)==0:
ans+=b//(k-1)
else:
ans+=b//(k-1)+1
if c%(k-1)==0:
ans+=c//(k-1)
else:
ans+=c//(k-1)+1
print(ans) |
p03317 | s646606773 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
idx = a.index(1)
if idx == 0:
print(-(-len(a[(idx + 1):]) // (k - 1)))
elif idx == (n - 1):
print(-(-len(a[:idx]) // (k - 1)))
else:
print(-(-n // (k - 1)))
|
p03317 | s158300762 | Wrong Answer | import math
n, k = map(int,input().split())
a = list(map(int,input().split()))
ans = math.floor(n//(k-1))
print(ans) |
p03317 | s533315481 | Wrong Answer | n, k = map(int, input().split())
As = list(map(int, input().split()))
ind = As.index(1)
f=0
b=0
nf = 0
nb = 0
while f < n-ind:
nf += 1
f += k-1
while b < ind:
nb +=1
b += k-1
print(nf + nb) |
p03317 | s266847496 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
idx = A.index(1)
L = idx // (K - 1) + (idx % (K - 1) != 0)
R = (N - 1 - idx) // (K - 1) + ((N - 1 - idx) % (K - 1) != 0)
print(L + R)
|
p03317 | s379129745 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
if n == k:
print(1)
elif (n - k) % (k - 1) == 0:
print((n - k) / (k - 1) + 1)
else:
print((n - k) // (k - 1) + 2)
|
p03317 | s414802859 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
one = 0
for i in range(n):
if a[i] == 1:
one = i + 1
break
front = -(-(one - 1) // (k - 1))
back = -(-(n - one) // (k - 1))
#print(front, back)
print(front + back) |
p03317 | s167741914 | Wrong Answer | import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
mi_index = A.index(min(A))
left_count = math.ceil(mi_index / (K - 1))
right_count = math.ceil((N - (mi_index + 1)) / (K - 1))
print(left_count + right_count) |
p03317 | s078763963 | Wrong Answer | Len, Split = map(int, input().split())
_res = Len % (Split - 1)
if _res:
print(int((Len / (Split - 1))) + 1)
else:
print(int((Len / (Split - 1)))) |
p03317 | s283475923 | Wrong Answer | import math
def main():
N, K = map(int, input().split())
input()
print(math.floor(N/(K-1)))
main() |
p03317 | s443055645 | Wrong Answer | import sys
import math
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
if N == K:
print(1)
sys.exit()
for i in range(N):
if A[i] == 1:
print(math.ceil(i/(K-1)) + math.ceil((N-i-1)/(K-1)))
break |
p03317 | s512787989 | Wrong Answer | Len, Split = map(int,input().split())
Nums = map(int,input().split())
print(Len/(Split-1)) |
p03317 | s157298393 | Wrong Answer | N, K = map(int, input().split())
A = [int(x) for x in input().split()]
ans = 1
if N == K:
print(1)
exit()
else:
ans += (N-K+1)//K+1
print(ans)
|
p03317 | s017907005 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
if N % (K-1) != 0:
if N == K:
ans = 1
else:
ans = (N // (K-1)) + 1
else:
if N == K:
ans = 1
else:
ans = N // (K-1)
print(ans) |
p03317 | s492758870 | Wrong Answer | N,K = map(int,input().split())
A = list(map(int,input().split()))
index = A.index(1)
ans = 0
right = N-1-index
left = index
def judge(value,k,ans):
if value%k == 0:
return value//k
else:
return value//k+1
ans += judge(right,K-1,ans)
ans += judge(left,K-1,ans)
print(ans) |
p03317 | s178809433 | Wrong Answer | n,k=map(int,input().split())
a = list(map(int,input().split()))
cnt = 0
while n > 0:
n = n - (k-1)
cnt +=1
print(cnt) |
p03317 | s629318270 | Wrong Answer | import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy
def main():
n,k = map(int, input().split())
a_list = list(map(int, input().split()))
if n == k:
print(1)
else:
print((n//k) + 1)
if __name__ == "__main__":
main() |
p03317 | s455018925 | Wrong Answer | import math
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
idx = a.index(1)
l = math.ceil(idx / (k - 1))
r = math.ceil((n - idx - 1) / (k - 1))
print(1 if n == k else l + r)
|
p03317 | s409520304 | Wrong Answer | from math import ceil
n,m = map(int, input().split())
a = list(map(int, input().split()))
t = a.index(1)
print(ceil(t/2) + ceil((n-1-t)/2)) |
p03317 | s148716158 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
if min(a) == a[0] or min(a) == a[n-1]:
print((n+1)//k)
else:
print((n+1)//k + 1) |
p03317 | s773016662 | Wrong Answer | n , k = map(int,input().split())
ans = (n-1)//(k-1)+1
print(ans) |
p03317 | s010251227 | Wrong Answer | n,k=map(int,input().split())
A=list(map(int,input().split()))
b=A.index(1)
print((b-1)//(k-1)+1+(n-b-2)//(k-1)+1)
|
p03317 | s283100238 | Wrong Answer | import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
i = A.index(1)
left = len(A[:i])
right = len(A[i+1:])
cnt = math.ceil(left / (K - 1)) + math.ceil(right / (K - 1))
print(cnt) |
p03317 | s897346713 | Wrong Answer | N,K = map(int,input().split())
li = [int(i) for i in input().split()]
min_index = li.index(1)
left = min_index
right = len(li) - left - 1
count = 0
if (left > 0) :
count += left // 2
if (left % 2 == 1) :
count += 1
if (right > 0) :
count += right // 2
if (right % 2 == 1) :
count += 1
print(count) |
p03317 | s162611704 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
a = A.index(1)
K -= 1
from math import ceil
print(ceil(a / K) + ceil((N - a - 1) / K)) |
p03317 | s732083631 | Wrong Answer | n,k=map(int,input().split())
n=n-k
if n<=k:print(1)
else:
n=n-k
r=list(map(int,input().split()))
print(1+(n+k-2)//(k-1)) |
p03317 | s662413869 | 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])
print(left_length)
right_length = len(lst[id_one:])-1
print(right_length)
counter = 0
if min(left_length,right_length) < k-1:
if left_length < right_length:
right_length -= left_length%(k-1)
else:
left_length -= right_length%(k-1)
while left_length > 0:
counter += 1
left_length -= k-1
while right_length > 0:
counter += 1
right_length -= k-1
print(counter) |
p03317 | s974595159 | Wrong Answer | import math
def main():
N, K = list(map(int, input().split(' ')))
A = list(map(int, input().split(' ')))
index_one = A.index(1)
min_cnt = N
for left_index in (index_one - (K - 1), index_one + 1):
right_index = left_index + (K - 1)
cnt = math.ceil((left_index + 1) / (K - 1)) + math.ceil((N + 1 - right_index) / (K - 1))
min_cnt = min([min_cnt, cnt])
print(min_cnt)
if __name__ == '__main__':
main()
|
p03317 | s306108673 | 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()
if N == K:
print(1)
exit()
A = read_ints()
K -= 1
i = A.index(1)
# コーナーケース対策
if i <= K:
i = K
elif i >= (N - K):
i = N - K - 1
right = (i - 1) // K + 1
left = (N - 1 - i - 1) // K + 1
# print(right, left)
print(right + left)
|
p03317 | s847904262 | Wrong Answer | from math import ceil
# input
N, K = map(int, input().split())
A = list(map(int, input().split()))
# check
if N == K:
print(1)
else:
min_idx = A.index(1)
if min_idx == 0:
r_cnt = 0
else:
r_cnt = ceil(min_idx / (K - 1))
if min_idx == N - 1:
l_cnt = 0
else:
l_cnt = ceil((N - min_idx - 1) / (K - 1))
print(r_cnt + l_cnt) |
p03317 | s610823617 | Wrong Answer | import sys
N,K = map(int,input().split())
A = list(map(int,input().split()))
#print(A)
count = 0
mn = 10**10
for i in range(0,N-K+2,K-1):
A = A[:i] + [min(A[i:i+K])]*K+A[i+3:]
count += 1
if len(list(set(A))) == 1:
print(count)
sys.exit() |
p03317 | s440097681 | 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
ans+=math.ceil(ind/(k-1))+math.ceil((n-ind-1)/(k-1))
print(ans) |
p03317 | s890637775 | Wrong Answer | N, K = map(int, input().split())
S = map(int, input().split())
import math
print(int(math.ceil(N / (K - 1)))) |
p03317 | s571216818 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int , input().split()))
if n == k:
print(1)
exit()
print(1 + ((n - k) + 1) // (k-1)) |
p03317 | s969631833 | Wrong Answer | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
min_index = a.index(min(a))
left_count = min_index
right_count = n - min_index - 1
print( math.ceil(left_count / (k-1)) + math.ceil(right_count / (k-1)) ) |
p03317 | s547499891 | Wrong Answer | n,m=map(int,input().split())
l=list(map(int,input().split()))
print(-(-((len(l)-m)//(m-1)))) |
p03317 | s731279018 | Wrong Answer | n,k = map(int,input().split())
a = list(map(int,input().split()))
ind_1 = 0
for i in range(n):
if a[i] == 1:
ind_1 = i
break
a_mae = len(a[:ind_1])
a_ato = len(a[ind_1+1:])
print(-(-a_mae//(k-1))-(-a_ato//(k-1)))
|
p03317 | s970700883 | Wrong Answer | #C - Minimization
N,K = map(int, input().split())
A = list(map(int, input().split()))
tmp = 0
# for i in range(N):
# if A[i] == 1:
# tmp = i+1
# break
if N % K > 0:
ans = N//K +N//K
else:
ans = N//K
print(ans) |
p03317 | s145790388 | Wrong Answer | import math
N, K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(N):
if A[i] == 1:
ind = i
break
left = ind
right = N - ind - 1
ans = math.ceil(left / (K - 1)) + math.ceil(right / (K - 1))
print(ans) |
p03317 | s381793794 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = n//k
mod = (n-k)//(k-1) + min((n-k)%(k-1), 1)
print(ans + mod) |
p03317 | s921352857 | Wrong Answer | n,k=map(int,input().split())
a = list(map(int,input().split()))
cnt = 0
if n == k:
cnt = int(n / k)
else:
while n > 0:
n = n - (k-1)
cnt +=1
print(cnt) |
p03317 | s554155624 | Wrong Answer | n,k = map(int,input().split())
a = [int(i) for i in input().split()]
if n == k:
print(1)
else:
b = a.index(1)
if b < k-1:
b +=1
if b > (n-1) -k-1:
b -=1
c,d = divmod(b,k-1)
ans = c
if d != 0:
ans +=1
e = n-1 -b
c,d = divmod(e,k-1)
ans += c
if d != 0:
ans +=1
print(ans) |
p03317 | s519806612 | Wrong Answer | n, k = map(int, input().split())
As = list(map(int, input().split()))
if n == k:
print(1)
exit()
for i in range(10000):
if i * (k - 1) + k < n and n == (i + 1) * (k - 1) + k:
print(i+1)
elif i * (k - 1) + k < n and n < (i + 1) * (k - 1) + k:
print(i+2) |
p03317 | s441697018 | 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 and rem != 0 or d != 0:
ans -=1
print(ans)
|
p03317 | s176705524 | Wrong Answer | a,b = map(int,input().split())
c = input()
print((a+b-1)//b) |
p03317 | s479219346 | Wrong Answer | n,k=map(int,input().split())
a=[int(i) for i in input().split()]
i=a.index(1)
print((i+(k-1)-1)//(k-1)+(n-(i+1)+(k-1)-1)//(k-1)) |
p03317 | s447280760 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
idx = 0
for i in range(N):
if A[i] == 1:
idx = i
break
ans = 0
# Left
if (N-(idx+K)) % (K-1) == 0:
ans += (N-(idx+K))//(K-1)+1
else:
ans += (N-(idx+K))//(K-1)+1+1
# Right
if (idx-(K-1)) % (K-1) == 0:
ans += (idx-(K-1))//(K-1)+1
else:
ans += (idx-(K-1))//(K-1)+1+1
print(ans) |
p03317 | s200958586 | 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()
if N == K:
print(1)
exit()
A = read_ints()
K -= 1
i = A.index(1)
# コーナーケース対策
if i < K:
i = K
elif i >= (N - K):
i = N - K - 1
right = (i - 1) // K + 1
left = (N - 1 - i - 1) // K + 1
# print(right, left)
print(right + left)
|
p03317 | s912015043 | Wrong Answer | n=input().rstrip().split()
preans=int(n[0])/int(n[1])
ans=int(preans)+1
print(ans) |
p03317 | s794452936 | Wrong Answer | n, k = map(int, input().split())
As = list(map(int, input().split()))
if n == k:
print(1)
exit()
for i in range(10):
# print(i * (k - 1) + k)
# print((i + 1) * (k - 1) + k)
if i * (k - 1) + k < n and n <= (i + 1) * (k - 1) + k:
print(i+2) |
p03317 | s496513065 | Wrong Answer | import sys
import math
n,k=map(int,input().split())
alist=list(map(int,input().split()))
if alist[0] == 1 or alist[-1] == 1:
print(math.ceil((n-1)//(k-1)))
sys.exit()
for i in range(n):
if alist[i] == 1:
mini=i
sho=i
dai=n-i-1
break
shomod=sho%(k-1)
daimod=dai%(k-1)
if shomod + daimod <= k-1 :
print(sho//(k-1) + dai//(k-1)+1)
else:
print(sho//(k-1) + dai//(k-1)+2)
|
p03317 | s569357265 | Wrong Answer | N, K = map(int, input().split())
print((N-1)//(K-1)+1)
|
p03317 | s199004967 | Wrong Answer | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from math import ceil
def main():
n, k, *a = map(int, read().split())
if n <= k:
print(1)
sys.exit()
pos = a.index(1)
mae = ceil(pos / (k - 1))
ushiro = ceil((n - 1 - pos) / (k - 1))
r = mae + ushiro
print(r)
if __name__ == '__main__':
main()
|
p03317 | s389273532 | Wrong Answer | n,k,*_=map(int,open(0).read().split())
print(~-n//~-k) |
p03317 | s870861714 | Wrong Answer | n,m=map(int,input().split())
l=list(map(int,input().split()))
print(-(-int((len(l)-m)//(m-1))))
|
p03317 | s172245333 | Wrong Answer | import math
n, k = [int(i) for i in input().split()]
nums = [int(i) for i in input().split()]
if n == k:
print(1)
else:
print(math.ceil(n/(k-1)))
|
p03317 | s355180278 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = n // (k-1)
print(ans) |
p03317 | s497865806 | Wrong Answer | n,k=map(int,input().split())
A=list(map(int,input().split()))
b=A.index(1)
print((b-1)//(k-1)+1+(n-b-2)//(k-1)+1) |
p03317 | s791302122 | 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
k -= 1
for i in range(0, n, k):
ans += 1
if n == k + 1:
ans -= 1
print(ans)
|
p03317 | s862283958 | Wrong Answer | n, k = map(int, input().split())
print(n // (k - 1) + (0 if n % (k - 1) == 0 else 1)) |
p03317 | s183490882 | Wrong Answer | n,k=map(int,input().split())
a=list(map(int,input().split()))
if n==k:
print(1)
exit()
i=n-k+1
ans=1
while i>0:
i=i-k+1
ans+=1
print(ans) |
p03317 | s953115822 | Wrong Answer | nk = list(map(int,input().split()))
A = list(map(int,input().split()))
n = nk[0]
k = nk[1]
for i in range(n):
if A[i] == 1:
index = i
lef = index
rig = n -lef - 1
if lef % (k-1)== 0:
lefs = lef // (k-1)
else:
lefs = lef // (k-1) +1
if rig % (k-1)== 0:
rigs = rig // (k-1)
else:
rigs = rig // (k-1) +1
ans = rigs + lefs
print(ans)
|
p03317 | s428418637 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
print(1+(N-K)//(K-1))
cnt = 1
length = K
while True:
if length >= N:
print(cnt)
break
length += K-1
cnt += 1 |
p03317 | s444290925 | Wrong Answer | n,k = map(int,input().split())
a_list = list(map(int,input().split()))
print((n+k)//k) |
p03317 | s014141334 | Wrong Answer | import math
def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(math.ceil((n -1) // (k - 1)))
if __name__ == '__main__':
main() |
p03317 | s396610199 | Wrong Answer | import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy
def main():
n,k = map(int, input().split())
a_list = list(map(int, input().split()))
if n == k:
print(1)
else:
print(ceil(n/k) + 1)
if __name__ == "__main__":
main() |
p03317 | s451801477 | 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)
cnt += math.ceil((N - 1 - now) / 2)
print(cnt) |
p03317 | s818184531 | 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)
l = -(-(x // (K - 1)))
lmod = (x + 1) % K
r = -(-(N - x - 1 - lmod) // (K - 1))
print(l + r)
if __name__ == '__main__':
main()
|
p03317 | s163124849 | Wrong Answer | Len, Split = map(int, input().split())
_res = Len % (Split-1)
if _res:
res = int((Len / (Split - 1)) + 1)
print(res)
else:
res = int(Len / (Split - 1))
print(res) |
p03317 | s086224993 | Wrong Answer | import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
min_index = A.index(1)
if min_index == 0:
answer = math.ceil((N-min_index)/K)
elif min_index == N-1:
answer = math.ceil(min_index/K)
else:
answer = math.ceil((min_index+1)/K) + math.ceil((N-min_index+1)/K)
print(answer)
|
p03317 | s437231205 | Wrong Answer | N,K=map(int,input().split())
x=list(map(int,input().split()))
print(N//K)
if N%K==0:
print(N//K)
else:
print(N//K+1) |
p03317 | s472515130 | Wrong Answer | import math
N, K = map(int, input().split())
A_list = [int(i) for i in input().split()]
index = A_list.index(1)
left_list = A_list[:index]
right_list = A_list[index+1:]
if len(left_list) < K-1:
left_count = 1
right_list = right_list[(K-1-len(left_list)):]
right_count = math.ceil(len(right_list) / (K-1))
else:
left_count = math.ceil(len(left_list) / (K-1))
right_count = math.ceil(len(right_list) / (K-1))
print(left_count + right_count)
|
p03317 | s020198769 | Wrong Answer | N, K = list(map(int, input().split()))
numlist = list(map(int, input().split()))
front = N - (numlist.index(1))
print(front // (K - 1) + (numlist.index(1) + 1) // (K-1)) |
p03317 | s679652440 | Wrong Answer | n, k = map(int, input().split())
count = 1
if n > k:
for i in range(k - 1, n, k - 1):
count += 1
print(count) |
p03317 | s938043045 | Wrong Answer | n, k = map(int, input().split())
A = list(map(int, input().split()))
p = A.index(1)
if p == 0 or p == n-1:
ans = n // 2
elif p == 1 or p == n-2:
ans = 1 + (n-2) // 2
else:
ans = (p + 1) // 2 + (n - p + 1) // 2
print(ans) |
p03317 | s485682998 | Wrong Answer | from math import ceil
n, k = [int(x) for x in input().split()]
a_list = [int(x) for x in input().split()]
if k >= n:
print(1)
exit()
i = a_list.index(1)
ans = ceil(i / (k - 1)) + ceil((n - 1 - i) / (k - 1))
print(ans) |
p03317 | s330148137 | Wrong Answer | import math
N, K = map(int, input().split())
A = [int(i) for i in input().split()]
minA = [i for i,a in enumerate(A) if a==1][0]
print(math.ceil(len(A[:minA])/(K-1)) + math.ceil(len(A[minA+1:])/(K-1))) |
p03317 | s187050555 | Wrong Answer | n,k = map(int,input().split())
a = list(map(int,input().split()))
a.sort()
if n%(k-1) == 0:
print(n//(k-1))
elif n == k:
print('1')
else:
print(n//(k-1)+1) |
p03317 | s528606826 | Wrong Answer | import math
N, K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(N):
if A[i] == 1:
ind = i
break
left = ind
right = N - ind - 1
ans = 0
if left:
temp = K - 1
while(1):
ans += 1
if temp >= left:
break
temp += K - 1
if right:
temp = K - 1
while(1):
ans += 1
if temp >= right:
break
temp += K - 1
print(ans) |
p03317 | s100878342 | Wrong Answer | import math
N, K = map(int,input().split())
A = list(map(int,input().split()))
print(int((N-1)/(K-1))) |
p03317 | s587281708 | Wrong Answer | n,k=map(int,input().split())
A=list(map(int,input().split()))
b=A.index(1)
print((b-1)//(k-1)+1+(n-b-2)//(k-1)+1) |
p03317 | s977171703 | Wrong Answer | from math import ceil
n,k=map(int,input().split())
a=list(map(int,input().split()))
idx=-1
b=10**18
for i in range(n):
if b>a[i]:
idx=i
b=a[i]
print(ceil(idx/(k-1))+ceil((n-idx-1)/(k-1))) |
p03317 | s437707648 | Wrong Answer | n,k=map(int, input().split())
a=list(map(int,input().split()))
m=n%k
print(n//k+m) |
p03317 | s798590251 | Wrong Answer | import sys
import math
N, K = map(int, input().split())
ans = math.ceil(N / (K-1))
print(ans) |
p03317 | s152903448 | Wrong Answer | import numpy as np
n, k = map(int, input().split())
A = list(map(int, input().split()))
a = np.argmin(A)
print((a)//(k-1)+(n-a)//(k-1)) |
p03317 | s312467118 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
x = n//(k-1) + 1
print(x) |
p03317 | s311992866 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
if N == K:
print(1)
exit()
q, r = divmod(N, K - 1)
if r == 0:
print(q)
else:
print(q + 1) |
p03317 | s544761726 | Wrong Answer | n,k=map(int,input().split())
a=list(map(int,input().split()))
s=min(a)
x=[-1]
for i in range(n):
if a[i]==s:
x.append(i)
x.append(n)
X=len(x)
ans=0
for i in range(X-1):
y=(x[i+1]-x[i]-1)//(k-1)
if (x[i+1]-x[i]-1)%(k-1)!=0:
y+=1
ans+=y
print(ans) |
p03317 | s503709749 | Wrong Answer | def LI():
return [ int(s) for s in input().split() ]
N,K = LI()
A = LI()
for idx,a in enumerate(A):
if a == 1:
min_index = idx
break
if N - idx+1 > K and idx+1 > K:
cnt = 0
if (N-idx+1)%K == 0:
cnt += (N-idx+1)//K
else:
cnt += (N-idx+1)//K + 1
if (idx+1)%K == 0:
cnt += (idx+1)//K
else:
cnt += (idx+1)//K + 1
else:
print(N//K + 1) if N%K != 0 else print(N//K) |
p03317 | s365792852 | Wrong Answer | from math import ceil
n,k=map(int,input().split())
if n <= k:
print(1)
quit()
A=list(map(int,input().split()))
ind = A.index(1)
ans = ceil((ind)/(k-1))+ceil((n-ind)/(k-1))
print(ans) |
p03317 | s615992548 | Wrong Answer | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
minpos = 0
for i in range(0, n):
if a[i] == 1: minpos = i
print((minpos + k - 2) // (k - 1) + (n - minpos - 1 + k - 2) // (k - 1))
|
p03317 | s716840762 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
one = 0
for i in range(n):
if a[i] == 1:
one = i + 1
break
print(-( -(one - 1) // (k - 1)) + -( -(n - one) // (k - 1))) |
p03317 | s845200585 | 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 / (K - 1))
# 結果出力
print(ans)
|
p03317 | s952906249 | Wrong Answer | import math
N, K = map(int, input().split())
a = list(map(int, input().split()))
ans = math.ceil(N / (K - 1))
print(ans) |
p03317 | s680893147 | Wrong Answer | import numpy as np
N,K = map(int,input().split())
an = list(map(int,input().split()))
min_an_index = np.argmin(an)
a = min_an_index
b = N - min_an_index - 1
if K < a:
b -= K - a
if K < b:
a -= K - b
a1 = a // (K-1)
if a % (K-1) != 0:
a1 += 1
b1 = b // (K-1)
if b % (K-1) != 0:
b1 += 1
count = a1 + b1
print(count) |
p03317 | s919460198 | Wrong Answer | import math
n,k = map(int,input().split())
a = list(map(int,input().split()))
s = a.index(1)
left = s
right = n - (s + 1)
print(math.ceil(left / (k-1)) + math.ceil(right / (k-1))) |
p03317 | s875318498 | Wrong Answer | n,k=map(int,input().split())
r=list(map(int,input().split()))
a=r.index(1)
b=n-a-1
print((a+k-1)//k+(b+k-1)//k) |
p03317 | s241653837 | Wrong Answer | n,k = map(int, input().split( ))
*a, = map(int, input().split( ))
i = a.index(1)
if (i-1)%(k-1)+(n-i)%(k-1)==k-1:##
print((n-1)//(k-1))
else:
print((n-1)//(k-1)+1) |
p03317 | s836078277 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
print(N//(K-1)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.