problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03317 | s632991988 | Wrong Answer | def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(n // (k - 1))
if __name__ == '__main__':
main() |
p03317 | s654293298 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
one_index = a.index(1)
l = one_index
r = n - 1 - one_index
res = (l + (k - 1 - 1)) // (k - 1) + (r + (k - 1 - 1)) // (k - 1)
print(res) |
p03317 | s289437367 | Wrong Answer | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
L = A.index(1)
R = N - L - 1
if N == K:
print(1)
elif L == 0 or R == N-1:
print((N-1)%(K-1))
else:
ansL = ceil(L/(K-1))
ansR = ceil((max(L%(K-1)-1,0) + R)/(K-1))
print(ansL + ansR)
|
p03317 | s566182293 | Wrong Answer | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n,k = LI()
a = LI()
for i in range(n):
if a[i] == 1:
idx = i
break
ans = (idx-1) // (k-1) + (n-2-idx) // (k-1) + 2
print(ans)
|
p03317 | s506493758 | Wrong Answer | n,k = map(int,input().split())
a = list(map(int,input().split()))
print(n//(k-1)) |
p03317 | s092840829 | Wrong Answer | n,k=map(int,input().split())
a = list(map(int,input().split()))
if n % k == 0:
print(int(n/k))
else:
print(int(n/(k-1))) |
p03317 | s393393923 | 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.floor((i+1)/(K-1)) + math.ceil((N-i-1)/(K-1)))
break |
p03317 | s548836626 | Wrong Answer | N,K = map(int,input().split())
A = list(map(int,input().split()))
N -= 1
K -= 1
print(N // K)
|
p03317 | s154010891 | Wrong Answer | import math
N, K = map(int,input().split())
A = list(map(int,input().split()))
print(math.ceil(N/(K-1))) |
p03317 | s149343070 | Wrong Answer | n,k = map(int,input().split())
a_list = list(map(int,input().split()))
if n == k:
print(1)
else:
print((n+k-2)//(k-1)) |
p03317 | s147666339 | 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 | s596845257 | Wrong Answer | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
if N == K:
print(1)
elif K == 2:
print(N-1)
else:
ans = ceil(N/(K-1))
print(ans)
|
p03317 | s143398033 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
k = A.index(1)
print((k + K - 2) // (K - 1) + (N - k - 1 + K - 2) // (K - 1)) |
p03317 | s061430839 | 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)
print(math.ceil(mae/(K-1))+math.ceil(usiro/(K-1))) |
p03317 | s704211465 | 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 | s218935248 | 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)+ceil((n-ind+1)/k)
print(ans) |
p03317 | s626545289 | Wrong Answer | n, k = map(int, input().split())
print(n // (k - 1))
|
p03317 | s607739214 | 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-1))) |
p03317 | s090804206 | Wrong Answer | import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
i = A.index(1)
left = i
right = N - i - 1
cnt = math.ceil(left / (K - 1)) + math.ceil(right / (K - 1))
print(cnt) |
p03317 | s496271702 | Wrong Answer | import math
def resolve():
N, K = map(int, input().split())
A = list(map(int, input().split()))
if len(A) <= K:
print(1)
return
min_index = A.index(1)
before = len(A[min_index:])
after = len(A[min_index + 1:])
ans = math.ceil(before / K) + math.ceil(after / K)
print(ans)
resolve() |
p03317 | s691528369 | Wrong Answer | N, K = map(int, input().split())
A = sorted(list(map(int, input().split())))
x = N-K
x, m = divmod(x, (K-1))
print(1+x+m)
|
p03317 | s296021289 | Wrong Answer | from math import ceil
n,k = map(int, input().split())
a = list(map(int, input().split()))
p = a.index(1)
ans = ceil(p/(k-1))
ans += ceil((n-1-p)/(k-1))
print(ans) |
p03317 | s963578743 | Wrong Answer | N, K = map(int, input().split())
A = tuple(map(int, input().split()))
a_min = min(A)
c = 0
ans = 0
for idx, a in enumerate(A):
if a == a_min:
if c > 0:
ans += (c+K-2)//(K-1)
c = 0
else:
c += 1
if c > 0:
ans += (c+K-2)//(K-1)
print(ans)
|
p03317 | s520609710 | 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 - 1) // (K - 1)))
if __name__ == '__main__':
main()
|
p03317 | s029591567 | 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)//(k-1))
print(ans) |
p03317 | s143773788 | Wrong Answer | n,k=map(int,input().split())
a=[int(i) for i in input().split()]
print(int(n/(k-1))) |
p03317 | s906872468 | Wrong Answer | n,k=[int(x) for x in input().rstrip().split()]
a=[int(x) for x in input().rstrip().split()]
now=0
ans=0
if n==k:
print(1)
else:
while(0<n):
n-=k
n+=1
ans+=1
print(ans) |
p03317 | s919868462 | Wrong Answer | n,k = map(int,input().split())
a = (n-1)//(k-1)
if (n-1)%(k-1) == "0":
print(a)
else:
print(a+1) |
p03317 | s700073607 | Wrong Answer | import math
n,k=map(int,input().split())
a=list(map(int,input().split()))
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 | s771327231 | Wrong Answer | import sys
import math
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(N):
if A[i] == 1:
print(math.ceil(i/(K-1)) + math.ceil((N-i-1)/(K-1)))
break |
p03317 | s850995988 | Wrong Answer | N,K=map(int,input().split())
*A,=map(int,input().split())
now=A.index(1)
now_l=now
now_r=now
ans=0
while now_l>0:
now_l-=K-1
ans+=1
while now_r<N-1:
now_r+=K-1
ans+=1
print(ans) |
p03317 | s862624249 | 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) - x % (K - 1))) / (K - 1))
# 結果出力
print(ans)
|
p03317 | s763872792 | Wrong Answer | import sys
input = sys.stdin.readline
def main():
n, k = map(int, input().split())
A = list(map(int, input().split()))
index_1 = A.index(1)
left = (index_1 + k - 2) // (k - 1)
right = (n - 1 - index_1 + k - 2) // (k - 1)
print(left + right)
if __name__ == "__main__":
main() |
p03317 | s529878447 | Wrong Answer | n, k = map(int, input().split())
A = tuple(map(int, input().split()))
idx1 = A.index(1)
lcount = -(-idx1 // (k-1))
rcount = -(-(n - 1 - idx1) // (k-1))
print(lcount + rcount)
|
p03317 | s670168951 | Wrong Answer | N,K = map(int,input().split())
A = list(map(int,input().split()))
print((N-1)//(K-1)) |
p03317 | s075101136 | 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())
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 | s926652749 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
print(int((N - 1) / (K - 1)) + (N - 1) % (K - 1))
|
p03317 | s169831397 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = (n-1)/(k-1)#切り上げ
if ans % 1 == 0:
print(int(ans))
else:
print(ans // 1 + 1) |
p03317 | s381497520 | Wrong Answer | n,k=map(int,input().split())
a = list(map(int,input().split()))
if n % k == 0:
print(int(n/k))
else:
print(int(n/k)+1) |
p03317 | s678885522 | Wrong Answer | N,K=map(int,input().split())
List = list(map(int, input().split()))
k=K-1
n = (N-1)/k
nn = int(n)
if n-nn > 0:
n = nn+1
print(n) |
p03317 | s194691185 | 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-1))) |
p03317 | s228474242 | 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)
if left < k-1:
right -= ((k-1) - left)
if right < k-1:
left -= ((k-1) - right)
print(math.ceil(left / (k-1)) + math.ceil(right / (k-1))) |
p03317 | s191361649 | Wrong Answer | import math
n, k = map(int,input().split())
input()
print((n-1)/(k-1), math.ceil((n - 1)/(k - 1)))
|
p03317 | s510828010 | Wrong Answer | Len, Split = map(int, input().split())
print(int(Len / (Split - 1))) |
p03317 | s154824734 | 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
print(int(math.ceil(l/(k-1))+math.ceil(r/(k-1)))) |
p03317 | s379687396 | Wrong Answer | n,k = map(int, raw_input().split())
print (n + k - 1)/k |
p03317 | s635531959 | Wrong Answer | a,b=map(int,input().split())
n=list(map(int,input().split()))
if a==b:
print(1)
exit()
m=n.index(min(n))
o=len(n[:m-1])
p=len(n[m+2:-1])
ans=(o//(b-1))+(min(o%(b-1),1))+(p//(b-1))+(min(p%(b-1),1))
print(ans+1)
|
p03317 | s820781131 | 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)==n-1:
print((n-1)//(k-1))
else:
print((n-1)//(k-1)+1) |
p03317 | s763369217 | Wrong Answer | import math
n,k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
first = a.index(1)
b_num = math.ceil(len(a[:first]) / (k-1))
a_num = math.ceil(len(a[first+1:]) / (k-1))
#print(b_num)
#print(a_num)
print(b_num+a_num)
|
p03317 | s524726522 | Wrong Answer | n , k = map(int,input().split())
l = list(map(int,input().split()))
m = l.index(min(l))
if k <= m:
ans = (m + 1) //k + 1 + (n -m) // k +1
if k > m:
o = k - m
ans = (k - o) // k + 1 |
p03317 | s690214366 | 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:
i,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 | s878520007 | Wrong Answer | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
n,k = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n):
if a[i] == 1:
check = i
break
left = check
right = n - check -1
ans = left//(k-1) + right//(k-1)
if left%(k-1) != 0:
ans += 1
if right%(k-1) != 0:
ans += 1
print(ans) |
p03317 | s342817292 | 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
if left_length > 0:
left_length -= k
counter += 1
while left_length > 0:
counter += 1
left_length -= k-1
if right_length > 0:
counter += 1
right_length -= k
while right_length > 0:
counter += 1
right_length -= k-1
print(counter) |
p03317 | s126865662 | Wrong Answer | # coding: utf-8
# Your code here!
import math
N,K=map(int,input().split())
A=list(map(int,input().split()))
m=A.index(1)
ans=0
l=m
#print(l)
while l>0:
ans+=1
l-=(K-1)
l=m
#print(ans)
while l<N-1:
ans+=1
l+=(K-1)
print(ans) |
p03317 | s337867090 | Wrong Answer | n,k = map(int,input().split())
a = [int(i) for i in input().split()]
print(n // (k-1)) |
p03317 | s229456570 | Wrong Answer | import math
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
print(math.floor(N / (K - 1))) |
p03317 | s651448608 | Wrong Answer | N, K = map(int, input().split())
l = list(map(int, input().split()))
index = l.index(1) + 1
ans = 0
# 0よりも左があるなら左を計算
if index != 0:
p = index - K
ans += 1
if p < 0:
index = K
p += 1
while p > 0:
p = p - K
ans += 1
# 0よりも右があるなら右を計算
while index < N:
index = index + (K - 1)
ans += 1
print(ans)
|
p03317 | s426231582 | 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(ceil((l)/(K-1))+ ceil((r-1)/(K-1))) |
p03317 | s988150635 | 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-2)) // (K-1)
ans += ((N-1-idx1)+(K-2)) // (K-1)
print(ans) |
p03317 | s553092172 | Wrong Answer | import math
def calc_process_num(n):
return 1 + math.ceil((n - K)/(K - 1))
N, K = map(int, input().split())
A = list(map(int, input().split()))
idx_minA = A.index(min(A)) + 1
if N <= K:
print(1)
else:
print(calc_process_num(idx_minA) + calc_process_num(N - idx_minA + 1))
|
p03317 | s266060817 | 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
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 | s437374280 | Wrong Answer | def main():
import sys
input = sys.stdin.readline
N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = []
for x in range(1, N+1):
if x > (N-K)/(K-1) and x <= N/(K-1):
ans.append(x)
print(min(ans))
main() |
p03317 | s571212838 | Wrong Answer | n, k = map(int, input().split())
s = list(map(int, input().split()))
m = n//k
count = m*(m+1)//2
print(count+1 if n%k else count) |
p03317 | s638881959 | Wrong Answer | import math
n, k = map(int,input().split())
a = list(map(int,input().split()))
l = a.index(1)
r = n - l - 1
if n == k:
print(1)
else:
ans = math.ceil(l/(k-1))+ math.ceil(r/(k-1))
print(ans) |
p03317 | s330873156 | Wrong Answer | def main():
from math import ceil
n, k, *a = map(int, open(0).read().split())
i = a.index(1)
if i in [0, n - 2]:
ans = 1 + ceil((n - k) / (k - 2))
else:
k -= 1
l, r = max(0, i - 1), max(0, n - i - 2)
ans = 1 + ceil(l / k) + ceil(r / k)
print(ans)
if __name__ == '__main__':
main()
|
p03317 | s353975050 | Wrong Answer | import math
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = 1
idx = A.index(1)
cnt = 1
right = idx
left = idx
while True:
for i in range(1, K):
right += 1
if(right < len(A)):
A[right] = 1
else:
left -= 1
if(0 <= left):
A[left] = 1
else:
print(cnt)
exit()
if(left == 0 and len(A)-1 == right):
print(cnt)
exit()
else:
cnt += 1
|
p03317 | s293335186 | Wrong Answer | N, K = map(int, input().split())
if N == K:
print(1)
quit()
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 | s852271619 | Wrong Answer | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
if N == K:
print(1)
exit()
print(ceil((N - K + 1) / (K - 1)) + 1)
|
p03317 | s601838218 | Wrong Answer | n,k = map(int,input().split())
a_ls = list(map(int, input().split()))
min_ind = a_ls.index(min(a_ls))
left_len = min_ind
right_len = n - min_ind - 1
one_stroke = k - 1
left_num = -(-left_len // one_stroke)
right_num = -(-right_len // one_stroke)
ans = left_num + right_num
if n == k:
ans = 1
print(ans) |
p03317 | s681000406 | Wrong Answer | n,k=map(int,input().split())
a=list(map(int,input().split()))
print(n//(k-1)) |
p03317 | s922829730 | Wrong Answer | from collections import Counter
n, k = map(int, input().split())
A = [int(x) for x in input().split()]
# most common value
mcv = Counter(A).most_common()[0][0]
idx = 0
ans = 0
while True:
if idx >= n:
break
if A[idx] == mcv:
idx += 1
continue
idx += k - 1
ans += 1
print(ans) |
p03317 | s382106577 | Wrong Answer | def calc_process_num(n):
if n == 1:
return 0
elif n <= K:
return 1
else:
return 1 + int((n - K) / (K - 1)) if (n - K) % (K - 1) == 0 else 2 + int((n - K) / (K - 1))
N, K = map(int, input().split())
A = list(map(int, input().split()))
idx_minA = A.index(min(A)) + 1
if N <= K:
print(1)
else:
print(calc_process_num(idx_minA) + calc_process_num(N - idx_minA + 1))
|
p03317 | s862375202 | Wrong Answer | #import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
#import heapq
#from fractions import gcd
#input=sys.stdin.readline
import bisect
n,k=map(int,input().split())
a=list(map(int,input().split()))
ans=10**9
ix=a.index(1)
ans=math.ceil(ix/(k-1))+math.ceil((n-ix-1)/(k-1))
print(ans) |
p03317 | s708049841 | Wrong Answer | #解説参照
#前の版のn+k-2をm+k-1に修正
#1の両側調整とか考えたのが間違い
#端から貪欲と変わらない
#a要らない気がした
n,k = map(int,input().split( ))
print((n+k-1)//(k-1))
|
p03317 | s452778871 | Wrong Answer | import math
n, k = map(int, input().split())
lst = list(map(int, input().split()))
num = lst.index(1)
if k-1<=num and k-1<=n-num-1:
print(math.ceil(num/(k-1))+math.ceil((n-num-1)/(k-1)))
else:
print(math.ceil(n/k))
|
p03317 | s306140008 | Wrong Answer | n,k=map(int,input().split())
a=list(map(int,input().split()))
num_1=a.index(1)
if num_1%(k-1)==0:
left=num_1//(k-1)
else:
left=num_1//(k-1)+1
if (n-1-num_1)%(k-1)==0:
right=(n-1-num_1)//(k-1)
else:
right=(n-1-num_1)//(k-1)+1
ans=left+right
print(ans) |
p03317 | s239599042 | Wrong Answer | n,k = map(int,input().split())
a = list(map(int,input().split()))
o = a.index(1)
ans = 0
if o==0 or o==n-1 :
ans = -(-(n-1)//(k-1))
else:
ans = -(-o//k)+-(-(n-o-1)//(k-1))
print(ans) |
p03317 | s968439161 | Wrong Answer | import math
N,K=map(int,input().split())
A=list(map(int,input().split()))
ans=math.ceil(N/K)
print(ans) |
p03317 | s198761376 | Wrong Answer | n , k = map(int,input().split())
print((n-1)//k-2+1) |
p03317 | s729293293 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
if k < n:
print(-((-n)//(k-1)))
else:
print(1) |
p03317 | s730709985 | 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
if N == K:
break
print(count) |
p03317 | s572118110 | Wrong Answer | import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
i = A.index(1)
print(math.ceil(i/(K-1))+ math.ceil((N-i-1)/(K-1)))
|
p03317 | s665172031 | Wrong Answer | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(math.ceil(n // (k-1))) |
p03317 | s387593920 | 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)
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 | s935654816 | Wrong Answer | Len, Split = map(int, input().split())
_res = Len % Split
if _res:
print(int((Len / (Split - 1))) + 1)
else:
print(int((Len / (Split - 1))))
|
p03317 | s310630077 | 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 | s546468323 | Wrong Answer | import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
if N <= K:
cnt = 1
else:
i = A.index(1)
left = i
right = N - i - 1
cnt = math.ceil(left / (K - 1)) + math.ceil(right / (K - 1))
print(cnt) |
p03317 | s239531912 | Wrong Answer | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K, *A = map(int, read().split())
print(N // (K - 1))
return
if __name__ == '__main__':
main()
|
p03317 | s399394690 | Wrong Answer | import numpy as np
n, k = map(int, input().split())
A = list(map(int, input().split()))
a = np.argmin(A)
if a != 0 and a < k-1:
ans_1 = 1
a = k-1
else:
ans_1 = (a)//(k-1)
a = ans_1*(k-1)
if n-a-1 != 0 and n-a < k-1:
ans_2 = 1
else:
ans_2 = (n-a)//(k-1)
print(ans_1 + ans_2) |
p03317 | s871275029 | 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 | s335947518 | Wrong Answer | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
print(ceil(N/(K-1))) |
p03317 | s760364129 | 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
while left_length > 0:
counter += 1
left_length -= k-1
while right_length > 0:
counter += 1
right_length -= k-1
print(counter) |
p03317 | s931785099 | Wrong Answer | n, k = [ int(x) for x in input().split(' ') ]
xs = [ int(x) for x in input().split(' ') ]
i0 = xs.index(min(xs))
print(1 + min([ (i + k - 2) // (k - 1) + (n - i - 1) // (k - 1)
for i in range(max(i0 - k + 1, 0), min(i0, n - k) + 1) ])) |
p03317 | s119394254 | 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/2) + math.ceil((n-1-i)/2)
print(v)
resolve() |
p03317 | s076577881 | Wrong Answer | import sys
import math
N, K = map(int, input().split())
li = list(map(int, input().split()))
if N <= K:
print(1)
sys.exit()
print(math.ceil(N / (K-1))) |
p03317 | s020099576 | Wrong Answer | n,k=map(int,input().split());print(-~~-n//~-k) |
p03317 | s610437289 | Wrong Answer | import math
n, k = map(int, input().split())
lst = list(map(int, input().split()))
num = lst.index(1)
if k-1<=num and k-1<=n-num:
print(math.ceil(num/(k-1))+math.ceil((n-num-1)/(k-1)))
else:
print(math.ceil(n/k))
|
p03317 | s445792235 | Wrong Answer | import sys
input = sys.stdin.readline
def main():
N,K=map(int,input().split())
A=list(map(int,input().split()))
num=0
ans=0
for i in range(N):
if A[i]==1:
num=i
break
if i==0:
ans=(N-1+(K-1)-1)//(K-1)
print(ans)
else:
ans+=(num+(K-1)-1)//(K-1)
ans+=(N-num+(K-1)-1)//(K-1)
print(ans)
if __name__=='__main__':
main() |
p03317 | s749024534 | Wrong Answer | import math
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# print(N, K, A)
answer = math.ceil(N / (K - 1))
print(answer)
|
p03317 | s078573450 | Wrong Answer | def main():
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
i_min = A.index(1)
ans = -(-i_min // (k - 1)) -(-(n - i_min - 1) // (k - 1))
print(ans)
if __name__ == '__main__':
main()
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.