problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03317 | s405281817 | 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 | s604795954 | 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 - b
if K < b:
a -= K - a
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 | s910854218 | Wrong Answer | import math
def resolve():
n, k = map(int, input().split())
a = list(map(int, input().split()))
i = a.index(min(a))
v = math.ceil(i/(k-1)) + math.ceil((n-1-i)/(k-1))
print(v)
resolve() |
p03317 | s269135430 | Wrong Answer | N,K = map(int,input().split())
print(N//(K-1)) |
p03317 | s735906357 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
n = A.index(1)
ans = ((n+1) // (K-1)) + ((N-n) // (K-1))
print(ans) |
p03317 | s803566334 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
if N == K:
y = 0
else:
minA = min(A)
count_minA = sum([x == minA for x in A])
n_target = N - count_minA
n_1 = n_target // (K - 1)
n_2 = n_target % (K - 1)
y = n_1 + n_2
print(y) |
p03317 | s171237682 | 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 = math.ceil(mi/2)
rc = math.ceil((N-mi-1)/2)
print(lc+rc)
|
p03317 | s404554687 | 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+k):
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 | s896424383 | 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
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 | s031992923 | 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
mn = min(left_length,right_length)
mx = max(left_length,right_length)
mx -= mn % (k-1)
while mn > 0:
counter += 1
mn -= k-1
mx -= mn % (k-1)
while mx > 0:
counter += 1
mx -= k-1
print(counter) |
p03317 | s843901074 | 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 = math.ceil(mi//2)
rc = math.ceil((N-mi-1)//2)
print(lc+rc)
|
p03317 | s956147074 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
fi = 0
for i in range(n):
if a[i] == 1:
fi = i
break
print((n - fi) // (k - 1) + fi // (k - 1))
|
p03317 | s685563687 | Wrong Answer | n,k = map(int,input().split())
a = [int(i) for i in input().split()]
b = a.index(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 | s977621902 | Wrong Answer | def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = 10**10
for k in range(K):
v = 0
if k > 0:
v += 1
v += (N - k) // (K - 1)
if (N - k) % K > 1:
v += 1
if v < ans:
ans = v
print(ans)
if __name__ == '__main__':
main()
|
p03317 | s097571492 | Wrong Answer | n, k = [int(i) for i in input().split()]
nums = [int(i) for i in input().split()]
print(n//(k-1))
|
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) |
p03317 | s137860752 | Wrong Answer | x, y = map(int,input().split())
li = list(map(int,input().split()))
a = li.index(1) #1より前にある数
b = x-1-a #1より後にある数
if a%(y-1) == 0 and b%(y-1) == 0:
print(a//(y-1)+b//(y-1))
elif a%(y-1) == 0 or b%(y-1) == 0:
print(a//(y-1)+b//(y-1)+1)
else:
print(a//(y-1)+b//(y-1)+2) |
p03317 | s072840475 | Wrong Answer | from math import ceil, floor
N, K = map(int, input().split())
A = list(map(int, input().split()))
if N == K:
print(1)
exit()
idx = 0
for i in range(N):
if A[i] == 1:
idx = i
break
cnt = 0
if idx + 1 == K:
cnt += 1
else:
cnt += ceil((idx + 1) / (K - 1))
if N - idx == K:
cnt += 1
else:
cnt += ceil((N - idx) / (K - 1))
print(cnt)
|
p03317 | s728848156 | 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 | s694135441 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
if N % (K-1) == 0:
ans = N // (K-1)
else:
ans = (N // (K-1)) + 1
if N == K:
ans -= 1
print(ans) |
p03317 | s799171944 | Wrong Answer | def resolve():
N, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
i = A.index(1)
import math
print(math.ceil(len(A[:i])/(K-1)) + math.ceil(len(A[i+1:])/(K-1)))
if '__main__' == __name__:
resolve() |
p03317 | s370690631 | Wrong Answer | n,k = map(int,input().split())
A = list(input().split())
place_1 = A.index("1")
L = place_1
R = n - L - 1
print(-(-L//(k-1)) + -(-R//(k-1))) |
p03317 | s260362536 | Wrong Answer | import math
n, k = map(int, input().split())
a = [int(_) for _ in input().split()]
if n == k:
print(1)
exit()
idx = a.index(1)
print(math.ceil(idx / (k-1)) + math.ceil((n - idx - 1) / (k-1))) |
p03317 | s029632065 | Wrong Answer | import math
N, K = map(int, input().split())
A = list(input().split())
A_lis = [int(A[i]) for i in range(N)]
index = A_lis.index(1)
if N == K:
print(1)
else:
print(math.ceil(index / (K-1)) + math.ceil((N-index-1 - (index % (K-1))) / (K-1))) |
p03317 | s353118414 | Wrong Answer | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = math.ceil(n/k)
print(ans) |
p03317 | s006908066 | Wrong Answer | S = input().split(" ")
N = int(S[0])
K = int(S[1])
ARR = input().split(" ")
import re
import math
def calculate(n,k,arr):
miniest = int(min(arr))
s = "".join(arr)
brr = re.split(str(miniest)+'{1,}',s)
counts = 0
for br in brr:
counts += math.ceil(len(br) / (k-1))
return counts
result = calculate(N,K,ARR)
print(result)
|
p03317 | s680900645 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
ind = a.index(1)
cnt = k - 1
ans = 0
for i in reversed(range(ind + 1)):
cnt -= 1
if cnt == 0:
ans += 1
cnt = k - 1
if n > k:
cnt = k - 1
for i in range(ind, n):
cnt -= 1
if cnt == 0:
ans += 1
cnt = k - 1
print(ans) |
p03317 | s546835137 | 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))
print(L+R)
|
p03317 | s263095926 | 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 | s164171783 | Wrong Answer | import math
N, K = map(int,input().split())
l = list(map(int,input().split()))
tag = l.index(1)
print(math.ceil((N-1-tag)/(K-1))+math.ceil(tag/(K-1))) |
p03317 | s393873086 | 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 // (K-1)
if (left % (K-1) == 1) :
count += 1
if (right > 0) :
count += right // (K-1)
if (right % (K-1) == 1) :
count += 1
print(count) |
p03317 | s196555184 | Wrong Answer | import math
n , k = map(int, input().split())
a = list(map(int, input().split()))
print(math.ceil(n/k)) |
p03317 | s541135875 | Wrong Answer | n,k = [int(x) for x in input().split()]
print(1 + (n-k)%(k-1)) |
p03317 | s361099705 | Wrong Answer | import math
n, k, *nums = map(int, open(0).read().split())
print(math.ceil((n-k)/2)+1) |
p03317 | s959824151 | Wrong Answer | N,K = map(int,input().split())
A = list(map(int,input().split()))
P = K - 1
print(N // P)
|
p03317 | s901448249 | 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 - 1
if K > b:
a -= K - b - 1
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 | s302533740 | 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 -= min(0,Right%(K-1))
Count += (Left%(K-1)!=0)+Left//2
print(Count) |
p03317 | s600679752 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
a_min = min(A)
pos = 0
ans = 0
for pos in range(N):
if A[pos] != a_min:
for i in range(pos, min(pos+K-1, N)):
A[i] = a_min
ans += 1
print(ans) |
p03317 | s540956807 | Wrong Answer |
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
#A.sort()
arr = []
for i in range(1,K):
if N % i == 0:
arr.append(i)
#print(arr)
tmp = max(arr)
#print(tmp)
if N==K:
tmp = N
print(N//tmp)
|
p03317 | s094705631 | 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+1)/k)+ceil((n-ind+1)/k)
print(ans) |
p03317 | s685942833 | Wrong Answer | #基本全部1にする
import math
n,k = list(map(int, input().split()))
As = list(map(int,input().split()))
pos = As.index(1)
#print(pos)
pos_b = math.ceil((n-1-pos)/(k-1))
pos_f = math.ceil(pos/(k-1))
print(pos_b+pos_f) |
p03317 | s126366706 | Wrong Answer | from math import ceil
n, k = map(int, input().split())
a = list(map(int, input().split()))
idx = a.index(1)
if idx == 0:
print(ceil(len(a[(idx + 1):]) / (k - 1)))
elif idx == (n - 1):
print(ceil(len(a[:idx]) / (k - 1)))
else:
print((ceil(len(a[:idx]) / (k - 1))) + (ceil(len(a[(idx + 1):]) / (k - 1))))
|
p03317 | s486647852 | 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 | s152315138 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
mini = a.index(1)
l = mini // (k-1)
lm = mini % (k-1)
r = (n - mini - 1) // (k-1)
rm = (n - mini - 1) % (k-1)
# print(l, r, lm, rm)
print(l + r + ((lm + rm + 1) // k + ((lm + rm + 1) % k != 0))) |
p03317 | s033642188 | Wrong Answer | import math
n,k=[int(i) for i in input().split()]
a=[int(i) for i in input().split()]
def get_1_index(a):
for i,j in enumerate(a):
if j==1:
return i
index=get_1_index(a)
mae=index
usiro=n-index-1
print(math.ceil(mae/(k-1))+math.ceil(usiro/(k-1))) |
p03317 | s114710640 | Wrong Answer | n,k=map(int,input().split())
l=list(map(int,input().split()))
for i in range(n):
if l[i]==1:
tmp=i
print(tmp//2+(n-tmp)//2) |
p03317 | s501556894 | 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)
# 怒りの全探索
ans = 0
for j in range(0, N, K):
ans += 1
print(ans)
|
p03317 | s569550261 | Wrong Answer | N,K = map(int,input().split())
A = list(map(int,input().split()))
B = A.index(1)
#print(B)
ans = 0
C = B
if K == N:
print(1)
else:
while C < N:
C += K - 1
ans += 1
while B > 0:
B -= K - 1
ans += 1
print(ans) |
p03317 | s586182166 | Wrong Answer | import math
N, K = map(int, input().split())
A = list(input().split())
A_lis = [int(A[i]) for i in range(N)]
index = A_lis.index(1)
if N == K:
print(1)
else:
left = math.ceil(index / (K-1))
leftamari = index % (K-1)
right = math.ceil(max(0, N - K - index + leftamari) / (K-1))
print(left + right)
|
p03317 | s405255373 | Wrong Answer | N,K = map(int,input().split())
A = list(map(int,input().split()))
index = A.index(1)
cnt = 1
right = 0
left = 0
if (N-1)//2 < index:
right = N-1-index
left = index-(K-1)
else:
left = index
right = N-1-index-(K-1)
if left%(K-1) == 0:
cnt += left//(K-1)
else:
cnt += left//(K-1)+1
if right%(K-1) == 0:
cnt += right//(K-1)
else:
cnt += right//(K-1)+1
print(cnt) |
p03317 | s557153506 | Wrong Answer | n,m=map(int,input().split())
l=list(map(int,input().split()))
print(-(-int(len(l)-m/m-1))) |
p03317 | s982431565 | Wrong Answer | n,k=map(int,input().split())
a=[int(x) for x in input().split()]
ans=1
n-=k
ans+=(n+k-1)//k
print(ans) |
p03317 | s548242520 | Wrong Answer | import math
def process_smaller_index(K, min_index):
if min_index == 0:
return 0
else:
return math.ceil(min_index / K)
def process_larger_index(last_index, K, min_index):
if min_index == last_index:
return 0
else:
return math.ceil((last_index - min_index) / K)
N, K = map(int, input().split())
A = [int(i) for i in input().split()]
min_index = A.index(1)
print(process_smaller_index(K - 1, min_index) + process_larger_index(len(A)-1, K - 1, min_index)) |
p03317 | s933335258 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
if n == k:
print(1)
elif k == 2:
print(n-1)
else:
print(n // (k-1)) |
p03317 | s922936983 | 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/(k-1))+math.ceil((n-i)/(k-1))) |
p03317 | s408127523 | 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()
i = A.index(1)
print(math.ceil(i/(K-1))+math.ceil((N-i-1)/(K-1))) |
p03317 | s201819051 | Wrong Answer | n,k=map(int,input().split())
a=list(map(int,input().split()))
if n<k:
print(1)
else:
print(n//(k-1)) |
p03317 | s746995590 | 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])-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 | s999441101 | Wrong Answer | import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
if N == K:
print(1)
elif K == 2:
print(N-1)
else:
print(math.ceil(N/(K-1)))
|
p03317 | s424503246 | Wrong Answer | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9+7
MAX = 10**18
MIN = -10**18
n,k = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n):
if a[i] == 1:
start = i
break
start += 1
r = n - start + 1
l = start
print(r//(k-1) + l//(k-1)) |
p03317 | s320115259 | Wrong Answer | import math
N,K = map(int,input().split())
lsA = list(map(int,input().split()))
P = lsA.index(1)
ans = math.ceil(P/(K-1)) + math.ceil((N-1-P)/(K-1))
print(ans) |
p03317 | s433341651 | Wrong Answer | n,k=map(int,input().split())
a=list(map(int,input().split()))
print(n//(k-1))
|
p03317 | s806972575 | Wrong Answer | N, K = map(int,input().split())
list_ai = map(int,input().split())
print(((N-1)//(K-1))+1)
|
p03317 | s508862027 | Wrong Answer | N, K = map(int, input().split())
arr = list(map(int, input().split()))
index = arr.index(1)
left = -(-index//2)
right = -(-(N - (index + 1))//2)
print(left+right) |
p03317 | s211854898 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
ind = a.index(1)
cnt = k - 1
ans = 0
for i in reversed(range(ind)):
cnt -= 1
if cnt == 0:
ans += 1
cnt = k - 1
for i in range(ind, n):
cnt -= 1
if cnt == 0:
ans += 1
cnt = k - 1
print(ans) |
p03317 | s762258562 | 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:
if (N-K+1)%K == 0:
ans += N-K+1
else:
ans += (N-K+1)%K+1
print(ans)
|
p03317 | s823333925 | Wrong Answer | from math import ceil
N, K = map(int, input().split())
ll = list(map(int, input().split()))
idx = ll.index(1)
l, r = idx, N-idx
print(l, r)
print(ceil((l)/(K-1))+ ceil((r-1)/(K-1))) |
p03317 | s417922913 | 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:
l=max(0,l-K+1)
cnt+=1
while r!=N-1:
r=min(N-1,r+K-1)
cnt+=1
print(cnt) |
p03317 | s780263924 | 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+1)-K) % (K-1) == 0:
ans += ((idx+1)-K)//(K-1)+1
else:
ans += ((idx+1)-K)//(K-1)+1+1
print(ans) |
p03317 | s099488953 | Wrong Answer | #import collections
#aa = collections.Counter(a) # list to list
#from itertools import combinations # (string,3) 3回
mod = 10**9 + 7
def readInts():
return list(map(int,input().split()))
def main():
n,k = readInts()
A = readInts()
Alen = len(A)
nokori = Alen - k
print(1 + nokori // (k-1) + nokori % (k-1))
if __name__ == '__main__':
main()
|
p03317 | s254294430 | 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 | s127160820 | Wrong Answer | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# print(N, K, A)
answer = N / (K - 1)
print(answer)
|
p03317 | s731089665 | Wrong Answer | n, k = map(int, input().split())
a = [int(i) for i in input().split()]
if len(a) == k:
print(1)
exit()
print(((len(a)-1) //( k -1)) + 1) |
p03317 | s293243123 | 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
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 | s918604974 | 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 - 1
if b < 0:
b = 1
if K > b:
a -= K - b - 1
if a < 0:
a = 1
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 | s914914957 | Wrong Answer | import math
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=a.index(min(a))
print(math.ceil(b/(k-1))+math.ceil((n-b-1)/(k-1))) |
p03317 | s438509591 | Wrong Answer | import math
n,k = map(int,input().split())
a = list(map(int,input().split()))
if k >= n:
print(1)
exit()
s = a.index(1)
left = s
right = n - (s + 1)
print(math.ceil(left / (k-1)) + math.ceil(right / (k-1))) |
p03317 | s440225194 | Wrong Answer |
N, K = map(int, input().split())
A = list(map(int, input().split()))
print(N // (K-1)) |
p03317 | s861880920 | 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 - 1
if b < 0:
b = 1
if K >= b:
a -= K - b - 1
if a < 0:
a = 1
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 | s895995898 | Wrong Answer | N,K=map(int,input().split())
A=list(map(int,input().split()))
M=K-1
if N%M==0:
print(N//M)
else:
print(N//M+1) |
p03317 | s328866473 | Wrong Answer | import math
def read_ints():
return[int(i) for i in input().split()]
def main():
n, k = read_ints()
print(math.ceil(n / k))
if __name__ == '__main__':
main() |
p03317 | s644084026 | Wrong Answer | NK = list(map(int,input().split()))
A = list(map(int,input().split()))
N = NK[0]
K = NK[1]
# print(N)
# print(K)
# print(A)
min_index = A.index(min(A))
# print(min_index)
leftLength = min_index
rightLength = N - 1 - leftLength
# print(leftLength)
# print(rightLength)
delta = K - 1
# print(delta)
count = 0
leftTimes = leftLength // delta
remain = leftLength % delta
if remain > 0:
leftTimes = leftTimes + 1
rightLength = rightLength - remain
rightTimes = rightLength // delta
remain = rightLength % delta
if remain > 0:
rightTimes = rightTimes + 1
count = leftTimes + rightTimes
print(count)
|
p03317 | s496896776 | Wrong Answer | import math
n, k = map(int, input().split())
aa = tuple(map(int, input().split()))
p = 0
for i in range(n):
if aa[i] == 1:
p = i
break
x = 0
k -= 1
x += math.ceil(p / k)
x += math.ceil((n - p - 1) / k)
print(x)
|
p03317 | s889337526 | Wrong Answer | N,K = list(map(int,input().split()))
n=(N-K)//(K-1)+1
mod=(N-K)%(K-1)
print(n+1) |
p03317 | s560857840 | Wrong Answer | n,k = map(int,input().split())
a = list(map(int,input().split()))
p = min(a)
ans = 0
indl = [-1,n]
for i in range(n):
if a[i]==p:
indl.append(i)
indl.sort(reverse=True)
for i in range(len(indl)-1):
ans += (indl[i]-indl[i+1]-1)//(k-1)+((indl[i+1]-indl[i]-1)%(k-1)!=0)
print(ans) |
p03317 | s121893699 | Wrong Answer | import math
n, k = map(int, input().split())
lis = list(map(int, input().split()))
if n == k:
print(1)
else:
print(math.ceil(n/(k-1))) |
p03317 | s141585555 | Wrong Answer | n,k = map(int,input().split())
a = list(map(int,input().split()))
idx = a.index(1)
print(-(-idx // (k-1)) - (-(n - idx - 1) // (k-1)))
|
p03317 | s218394396 | Wrong Answer | N, K = map(int, input().split())
l = list(map(int, input().split()))
index = l.index(1)
ans = 0
if index != 0:
p = (index + 1) - K
ans += 1
if p < 0:
index = K - 1
while p > 0:
p = p - K
ans += 1
while index < (N - 1):
index = index + K - 1
ans += 1
print(ans) |
p03317 | s785641425 | Wrong Answer | from math import ceil
n, k = map(int, input().split())
a = list(map(int, input().split()))
idx = a.index(1)
if idx == 0:
print(ceil(len(a[(idx + 1):]) / (k - 1)))
elif idx == (n - 1):
print(ceil(len(a[:idx]) / (k - 1)))
else:
ans = (ceil(len(a[:idx]) / (k - 1))) + (ceil(len(a[(idx + 1):]) / (k - 1)))
if (k - 1) < len(a[:idx]) % (k - 1) + len(a[(idx + 1):]) % (k - 1):
ans -= 1
print(ans) |
p03317 | s925234424 | 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):
# 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 | s254557161 | 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 arr[0] ==1 or arr[-1] ==1:
print(ans-1)
exit()
else:
print(ans) |
p03317 | s564679312 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int , input().split()))
if n == k:
print(1)
exit()
print((n + (n // k)) // (k-1)) |
p03317 | s928033564 | 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 -= Right%(K-1)
Count += (Left%(K-1)!=0)+Left//2
print(Count) |
p03317 | s588971576 | Wrong Answer | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
m = (n) // (k-1)
print(m) |
p03317 | s553238193 | Wrong Answer | # coding: utf-8
N, K = map(int,input().split())
A = list(map(int,input().split()))
for i in range(N):
if A[i] == 1:
cnt = i
break
a = cnt + 1
b = N - 1 - i + 1
#print(a, b)
m1 = a // (K - 1)
n1 = a % (K - 1)
m2 = b // (K - 1)
n2 = b % (K - 1)
ans = 0
#print(m1, m2)
ans += m1 + m2
if n1 > 1:
ans += 1
if n2 > 1:
ans += 1
if N <= K:
ans = 1
if K == 2:
ans = 0
ans += a - 1
ans += N - 1 - cnt
print(ans) |
p03317 | s400562988 | Wrong Answer | import math
n, k = map(int,input().split())
input()
print(int(math.ceil((n - 1)//(k - 1))))
|
p03317 | s617782199 | Wrong Answer | n,k=map(int,input().split())
k-=1
r=list(map(int,input().split()))
a=r.index(1)
b=n-a-1
print((a+k-1)//k+(b+k-1)//k) |
p03317 | s921428061 | Wrong Answer | import math
def process_smaller_index(K, min_index):
if min_index == 0:
return 0
else:
return math.ceil(min_index / K)
def process_larger_index(last_index, K, min_index):
if min_index == last_index:
return 0
else:
return math.ceil((last_index - min_index) / K)
N, K = map(int, input().split())
A = [int(i) for i in input().split()]
min_index = A.index(1)
print(process_smaller_index(K - 1, min_index) + process_larger_index(len(A)-1, K - 1, min_index)) |
p03317 | s914414599 | Wrong Answer | import math
n,k = map(int,input().split())
alist = list(map(int,input().split()))
aleft = alist[:alist.index(1)]
aright = alist[alist.index(1)+1:]
ans = math.ceil(len(aleft)/(k-1)) + math.ceil(len(aright)/(k-1))
print(ans)
|
p03317 | s653647449 | Wrong Answer | n,k = map(int, input().split())
A = list(map(int, input().split()))
m = min(A)
i = A.index(m)
k -= 1
cnt = 0
left = i
right = n-1-i
cnt += -(-left//k)
cnt += -(-right//k)
print(cnt) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.