problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03317 | s699919983 | Wrong Answer | n,k = map(int, input().split())
A = list(map(int, input().split()))
m = min(A)
i = A.index(m)
cnt = 0
cnt += -(-(i-1)//(k-1))
cnt += -(-n+i)//(k-1)
print(cnt) |
p03317 | s751472606 | Wrong Answer | n, k = map(int, input().split())
print(n // (k - 1)) |
p03317 | s938357416 | 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 <= K or R <= K:
print(ceil((N-1)/(K-1)))
else:
ansL = ceil(L/(K-1))
ansR = ceil(R/(K-1))
print(ansL + ansR)
|
p03317 | s765693495 | Wrong Answer | import math
n, k = map(int, input().split())
A = list(map(int, input().split()))
index = A.index(1)
right_num = n - 1 - index
left_num = index
ans = math.ceil(right_num / (k-1))
ans += math.ceil(left_num / (k-1))
print(ans)
|
p03317 | s070649130 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
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 | s440794329 | 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 n == k:
print("1")
else:
print(int(math.ceil(l/(k-1))+math.ceil(r/(k-1)))) |
p03317 | s339469859 | 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:
print(N//(K-1)) |
p03317 | s238756864 | Wrong Answer | # ABC101 C - Minimization
from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
r = ceil((N - (A.index(1)+1)) / (K-1))
l = ceil(A.index(1) / (K-1))
print(l+r) |
p03317 | s696425122 | Wrong Answer | N,K = (int(X) for X in input().split())
A = [int(X) for X in input().split()]
OI = A.index(1)
L = (OI+(K-2))//(K-1)
R = ((N-OI-1)+(K-2))//(K-1)
print(L+R) |
p03317 | s580691025 | Wrong Answer | n, k = map(int,input().split())
input()
print((n - 1)//(k-1) + 1)
|
p03317 | s228730211 | Wrong Answer | n, k = map(int, input().split())
print((n + k - 2) // (k - 1)) |
p03317 | s949248190 | 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
print(l,r)
if n == k:
print("1")
elif l < k-1:
print(int(math.ceil((r-k+1+l)/(k-1)))+1)
else:
print(int(math.ceil(l/(k-1))+math.ceil(r/(k-1))))
|
p03317 | s268857246 | Wrong Answer | N, K = map(int, input().split())
nums = [int(i) for i in input().split()]
def calc(n, k):
cnt = 0
while True:
tmp = n // 3
n = tmp + n % 3
cnt += tmp
if n <= K:
cnt += 1
return cnt
if len(nums) <= K:
print(1)
else:
print(calc(N, K))
|
p03317 | s379176242 | Wrong Answer | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
if N == K:
print(1)
else:
ans = ceil(N/(K-1))
print(ans)
|
p03317 | s976874112 | 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 and i >= (N - K):
print(2)
exit()
elif 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 | s129837701 | Wrong Answer | n, k = map(int,input().split())
print((n-1+k-1)//(k-1))
|
p03317 | s802987234 | Wrong Answer | def Minimization(n , k , al):
ans = -(-n // k)
return ans
def main():
n , k = map(int , input().split())
al = list(map(int , input().split()))
print(Minimization(n , k , al))
if __name__ == '__main__':
main() |
p03317 | s617694440 | Wrong Answer | N, K = list(map(int, input().split()))
numlist = list(map(int, input().split()))
print(N // (K - 1)) |
p03317 | s043067675 | Wrong Answer | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
if N == K:
print(1)
elif N == (K-1)*2 + 1:
print(2)
elif K == 2:
print(N-1)
else:
ans = ceil(N/(K-1))
print(ans)
|
p03317 | s290884280 | 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 | s286770939 | Wrong Answer | n,k,*_=map(int,open(0).read().split())
print(-~n//-~k) |
p03317 | s611463101 | Wrong Answer | def main():
n, k = map(int, input().split())
a_lst = list(map(int, input().split()))
min_index = a_lst.index(1)
before = 0
tmp1 = 0
while tmp1 < min_index:
before += 1
tmp1 = (k - 1) * before
after = 0
tmp2 = 0
while tmp2 < n - 1 - min_index:
after += 1
tmp2 = (k - 1) * after
answer = before + after
print(answer)
if __name__ == '__main__':
main() |
p03317 | s823000969 | 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)
if N==K:
print(1)
else:
while l>0:
ans+=1
l-=(K-1)
l=m
while l<N-1:
ans+=1
l+=(K-1)
print(ans) |
p03317 | s513191401 | Wrong Answer | import numpy as np
N,K= map(int,input().split())
A = list(map(int,input().split()))
mi=np.argmin(A)
mi2=np.argmin(A)
s=0
while True:
if mi>0:
mi=mi-K+1
s=s+1
#print(s,mi)
else:
break
while True:
if mi2<N-1:
mi2=mi2+K-1
s=s+1
#print(s,mi2)
else:
break
print(s) |
p03317 | s787232260 | Wrong Answer |
N,K = map(int,input().split())
A = list(map(int,input().split()))
if N==K:
print(1)
exit(0)
index = A.index(1)
ans = (N-1-index+K-2)//(K-1) + (index+K-2)//(K-1)
print(ans)
|
p03317 | s722138290 | Wrong Answer | import math
def solve():
N, M = map(int, input().split())
A = list(map(int, input().split()))
i = A.index(1)
before = len(A[:i])
after = len(A[i+1:])
return math.ceil(before / (M - 1)) + math.ceil(after / (M - 1))
print(solve()) |
p03317 | s451119595 | Wrong Answer | N,K=map(int,input().split())
A=list(map(int,input().split()))
ans = 1
N -= K
while N<=0:
ans += 1
N -= K-1
print(ans) |
p03317 | s256809100 | Wrong Answer | n, k = map(int, input().split())
print(n // (k-1)) |
p03317 | s175130612 | 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
# print("left", left, "right", right)
count = 0
if (N == K) :
count = 1
else :
if (left > 0) :
count += left // (K-1)
if (left % (K-1) != 0) :
count += 1
if (right > 0) :
count += right // (K-1)
if (right % (K-1) != 0) :
count += 1
print(count) |
p03317 | s838462084 | Wrong Answer | N, K = list(map(int, input().split()))
numlist = list(map(int, input().split()))
listlengh = len(numlist)
minpos = numlist.index(1) + 1
front = (listlengh - minpos) + 1
print(front // (K - 1 ) + minpos // (K - 1)) |
p03317 | s883649202 | Wrong Answer | n,k = map(int,input().split())
lst = list(map(int,input().split()))
id_of_one = lst.index(1) #リスト内の最小値1のインデックスを取得
left = len(lst[0:id_of_one]) #1より左側にある数列の長さ
right = len(lst[id_of_one+1:]) #1より右側にある数列の長さ
total = left + right
amari = max(left%(k-1),right%(k-1))
total -= amari
counter = 0
while total > 0:
counter += 1
total -= k - 1
print(counter) |
p03317 | s307136571 | Wrong Answer | N, K = map(int, input().split())
A = tuple(map(int, input().split()))
a_min = min(A)
pos = 0
ans = 0
while pos < N:
if A[pos] != a_min:
pos += K - 1
ans += 1
else:
pos += 1
print(ans)
|
p03317 | s875301261 | Wrong Answer | import math
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
l = r = A.index(1)
ans = 0
while r < N-1 or l > 0:
if r < N-1:
ans += 1
r += K-1
if l > 0:
ans += 1
l -= K+1
print(ans)
main() |
p03317 | s773040375 | 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
ans += m1 + m2
if n1 > 1:
ans += 1
if n2 > 1:
ans += 1
if N <= K:
ans = 1
print(ans) |
p03317 | s190679615 | Wrong Answer | N,K = (int(X) for X in input().split())
A = [int(X) for X in input().split()]
OI = A.index(1)
L = (OI+1)//(K-1)
R = (N-OI)//(K-1)
print(L+R) |
p03317 | s079219630 | Wrong Answer | import math
N,M = list(map(int,input().split()))
n_l = "".join(input().split())
A = n_l.find("1")
before = math.ceil(A / (M-1))
after = math.ceil((N-A-1) / (M-1))
print(before+after) |
p03317 | s989102969 | 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 + 1
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 | s034577579 | 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 <= 1:
break
tmp -= k - 1
ans += 1
tmp = i1
while True:
if n <= tmp:
break
tmp += k - 1
ans += 1
print(ans) |
p03317 | s961166517 | 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 - K + 1
ans += 1
if p < 0:
index = index + (-1 * p)
elif p > 0:
while p > 0:
p = p - K + 1
ans += 1
if index < (N - 1):
ans += 1
index = index + K - 1
while index < (N - 1):
index = index + K - 1
ans += 1
print(ans) |
p03317 | s513907709 | Wrong Answer | n, k=map(int,input().split())
a=list(map(int,input().split()))
print((n-1)//(k-1)) |
p03317 | s448769138 | Wrong Answer |
N, K = map(int, input().split())
A = list(map(int, input().split()))
print(N // 2) |
p03317 | s339039018 | 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) + math.ceil(right / K)
print(ans) |
p03317 | s114366529 | 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)))
elif((N+1)/K==2):
print(2)
else:
print(1) |
p03317 | s315785557 | 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)
ans = 10**9
for a in argmin:
SUM=0
SUM += (a+(K-2)) // (K-1)
SUM += ((N-1-a)+(K-2))//(K-1)
if ans > SUM:ans=SUM
print(ans) |
p03317 | s919678236 | Wrong Answer | listlen, rensuu = map(int, input().split())
listnum = list(map(int, input().split()))
count = 0
count += (listlen - 1) // (rensuu - 1)
count += 1 if (listlen - 1) % (rensuu - 1) > 0 else 0
oneposi = listnum.index(1)
if rensuu < oneposi + 1 < listlen - rensuu:
count = len(listnum[:oneposi]) // (rensuu - 1) + len(listnum[oneposi + 1:]) // (rensuu - 1)
print(count)
|
p03317 | s750760853 | Wrong Answer | import math
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n,k = nm()
a = nl()
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
if n==k:
ans=1
print(ans) |
p03317 | s920779577 | Wrong Answer | n, k = map(int,input().split())
a = list(map(int,input().split()))
g=1
while k+(k-1)*(g-1)<= n:
g+=1
print(g) |
p03317 | s599148377 | 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(len(A[:min_idx]) / (K - 1))
if min_idx == N - 1:
l_cnt = 0
else:
l_cnt = ceil(len(A[min_idx + 1:]) / (K - 1))
print(r_cnt + l_cnt) |
p03317 | s677341158 | Wrong Answer | n,m=map(int,input().split())
l=list(map(int,input().split()))
print(-(-(len(l)-m)//(m-1)))
|
p03317 | s357566784 | Wrong Answer | import sys
readline = sys.stdin.readline
import math
def main():
N, K = map(int, readline().rstrip().split())
A = list(map(int, readline().rstrip().split()))
mi = A.index(1)
ans = math.ceil(mi / (K-1)) + math.ceil((N-mi-1) / (K-1))
print(ans)
if __name__ == '__main__':
main() |
p03317 | s481174513 | Wrong Answer | n, k = map(int, input().split())
*a, = map(int, input().split())
i = a.index(1)
mar = k - 1 # max replacible count
le = (i + mar - 1) // mar # [0,i)
ri = (n - i - 1 + mar - 1) // mar # [i+1,n)
print(le + ri)
|
p03317 | s722275660 | 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
print(cnt)
else:
print(N//K + 1) if N%K != 0 else print(N//K) |
p03317 | s037566291 | 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 | s487955855 | Wrong Answer | N, K = map(int, input().split())
A = map(int, input().split())
print(int((N - 1) / 2) + (N - 1) % 2)
|
p03317 | s175634372 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
if k < n:
ans = 0
while n > 0:
n -= k - 1
ans += 1
else:
ans = 1
print(ans)
|
p03317 | s580804059 | 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 + k - 2) // k
elif p < k-1 or n-k < p:
ans = 1 + (n-1) // k
else:
ans = (p + k - 1) // k + (n - p + k) // k
print(ans) |
p03317 | s508648458 | Wrong Answer | import math
n, k = map(int,input().split())
a = list(map(int,input().split()))
print(math.ceil(n-1)/(k-1)) |
p03317 | s985823184 | 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 <= K-1 or R <= K-1:
print(ceil((N-1)/(K-1)))
else:
ansL = ceil(L/(K-1))
ansR = ceil((R-max(L%(K-1)-1,0))/(K-1))
print(ansL + ansR)
|
p03317 | s313503317 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
idx = a.index(1)
def ceil(a, b):
return -(-a // b)
print(ceil((idx+1), k) + ceil((n-idx+1), k))
|
p03317 | s009217923 | Wrong Answer | def main():
n, k = map(int, input().split())
a_lst = list(map(int, input().split()))
min_index = a_lst.index(1)
if min_index - 1 >= 0:
before = 1 + (min_index - 1) // (k - 1)
else:
before = 1
tmp = n - min_index - 1
if tmp - 1 >= 0:
after = 1 + (tmp - 1) // (k - 1)
else:
after = 1
answer = before + after
print(answer)
if __name__ == '__main__':
main() |
p03317 | s084556948 | Wrong Answer | 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 l % 2 != 0:
l += 1
if r % 2 != 0:
r += 1
print(int((r+l)/2)) |
p03317 | s492178606 | Wrong Answer | def resolve():
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(n // (k - 1))
resolve() |
p03317 | s151475211 | Wrong Answer | n,k=map(int,input().split())
a=list(map(int, input().split()))
for i in range(n):
if a[i]==1:
index=i
print((i-1)//2+(n-i)//2+1) |
p03317 | s808747557 | 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-1)/(K-1))+ ceil((r-1)/(K-1))) |
p03317 | s041210501 | Wrong Answer | n, k = map(int, input().split())
print(n//(k-1)) |
p03317 | s443138854 | 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(l + r)
|
p03317 | s753753409 | Wrong Answer | n,k=map(int,input().split())
a=[int(x) for x in input().split()]
print(n//(k-1))
|
p03317 | s916612159 | Wrong Answer | A = list(map(int, input().split()))
B = input()
if A[0]%2 == 0:
A[0] += 1
ans = A[0] // (A[1]-1)
if ans == 0:
ans = 1
print(ans)
|
p03317 | s459554226 | 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
w = a//(k-1) + b//(k-1)
ans = min(ans, w)
print(ans + 1)
|
p03317 | s684409268 | 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%2==0:
ans+=b//2
else:
ans+=b//2+1
if c%2==0:
ans+=c//2
else:
ans+=c//2+1
print(ans) |
p03317 | s346352035 | Wrong Answer | #!usr/bin/env python3
N, K = map(int, input().split())
A = list(map(int, input().split()))
#print(N, K, A)
print(N//(K-1)) |
p03317 | s889641889 | 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-1-K)/(K-1) and x <= (N-1)/(K-1):
ans.append(x)
print(min(ans))
main() |
p03317 | s188251390 | Wrong Answer | import math
n, k = map(int, input().split())
lis = list(map(int, input().split()))
m = min(lis)
if n == k:
print(1)
elif lis[0] == m or lis[n-1] == m:
print(math.ceil(n/(k-1))-1)
else:
print(math.ceil(n/(k-1))) |
p03317 | s262337248 | 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) / (K-1))) |
p03317 | s071775893 | 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
ans += m1 + m2
if n1 > 1:
ans += 1
if n2 > 1:
ans += 1
print(ans) |
p03317 | s186957865 | Wrong Answer | N,K = (int(X) for X in input().split())
A = [int(X) for X in input().split()]
OI = A.index(1)
if OI==0 or OI==(N-1):
print(N//(K-1))
else:
L = max(1,(OI+1)//(K-1))
R = max(1,(N-OI)//(K-1))
print(L+R) |
p03317 | s060516087 | Wrong Answer | import math
N,K=map(int,input().split())
if N==K:
print(1)
else:
print(math.ceil((N+K-1)/K)) |
p03317 | s671557404 | Wrong Answer | import math
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
if(K-1 == 1):
print(N - 1)
elif(K == N):
print(1)
else:
print(N // (K - 1)) |
p03317 | s759493489 | Wrong Answer | n,k=map(int,input().split())
l=[int(i) for i in input().split()]
c=0
mn=min(l)
while len(l)>=1:
if mn==min(l):
m=l.index(min(l))
if m!=0:
c+=m//(k-1)
if m%(k-1)!=0:
c+=1
l=l[m+1:]
else:
c+=len(l)//(k-1)
if len(l)%(k-1)!=0:
c+=1
l=[]
print(c)
|
p03317 | s164327103 | Wrong Answer | import sys
from math import ceil
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_nl = lambda: list(map(int, readline().split()))
in_na = lambda: map(int, read().split())
in_s = lambda: readline().rstrip().decode('utf-8')
def main():
N, K = in_nn()
readline()
ans = ceil(N / (K - 1))
if N % (K - 1) == 1:
ans -= 1
print(ans)
if __name__ == '__main__':
main()
|
p03317 | s214358940 | 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()))
if n%(k-1)==0:print(1+n//(k-1))
else:print(2+n//(k-1)) |
p03317 | s858595094 | 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
ans = 0
ans += math.ceil(pre/(k-1))
ans += math.ceil(post/(k-1))
print(ans)
|
p03317 | s111197672 | Wrong Answer | n,k = map(int,input().split())
l = list(map(int,input().split()))
a = l.index(1)
left = -(-a//2)
right = -(-(n-a)//2)
print(left+right) |
p03317 | s310391312 | Wrong Answer | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_nl = lambda: list(map(int, readline().split()))
in_na = lambda: map(int, read().split())
in_s = lambda: readline().rstrip().decode('utf-8')
def main():
N, K = in_nn()
readline()
q, r = divmod(N, K - 1)
if r in (0, 1):
ans = q
else:
ans = q + 1
print(ans)
if __name__ == '__main__':
main()
|
p03317 | s518134200 | Wrong Answer | n, k = map(int, input().split())
print((n - 1) // (k - 1)) |
p03317 | s122984113 | 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 == 1:
ln = 0
elif l >= k:
ln = l // (k-1)
rn = 1
if r == 1:
rn = 0
elif r >= k:
rn = r // (k-1)
print(ln + rn)
|
p03317 | s664858412 | Wrong Answer | def main():
n, k = map(int, input().split())
a_lst = list(map(int, input().split()))
min_index = a_lst.index(1)
if min_index - 1 >= 0:
before = 1 + (min_index - 1) // 2
else:
before = 1
tmp = n - min_index - 1
if tmp - 1 >= 0:
after = 1 + (tmp - 1) // 2
else:
after = 1
answer = before + after
print(answer)
if __name__ == '__main__':
main() |
p03317 | s294153432 | 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 | s247213515 | Wrong Answer | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
ind = A.index(1)
L = ind
R = N - L - 1
if N == K:
print(1)
else:
if L > 0:
ansL = ceil(L/(K-1))
else:
ansL = 0
if R > 0:
ansR = ceil((max(L%(K-1)-1,0) + R)/(K-1))
else:
ansR = 0
print(ansL + ansR)
|
p03317 | s233953670 | Wrong Answer | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
if N == K:
print(1)
if K == 2:
print(N-1)
else:
ans = ceil(N/(K-1))
print(ans)
|
p03317 | s389407985 | 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(math.ceil((r-k+1+l)/(k-1)))+1)
else:
print(int(math.ceil(l/(k-1))+math.ceil(r/(k-1))))
|
p03317 | s488079512 | Wrong Answer | N, K = map(int, input().split())
l = list(map(int, input().split()))
index = l.index(1) + 1
ans = 0
# 0よりも左があるなら左を計算
if index != 1:
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 | s023332434 | Wrong Answer | import math
n,k = map(int,input().split())
a = list(map(int,input().split()))
now = a.index(1)
r = n-now-1
l = now
if l <= k-1 or r <= k-1:
print(math.ceil(n/(k-1)))
else:
print(math.ceil(l/(k-1))+math.ceil(r/(k-1))) |
p03317 | s587956595 | Wrong Answer | n, k = map(int, input().split())
_ = input()
count = 0
for i in range(0, n, k - 1):
count += 1
print(count) |
p03317 | s476356060 | Wrong Answer | import math
n, k = map(int, input().split())
a = [int(_) for _ in input().split()]
idx = a.index(1)
num_l = idx
num_r = n - idx - 1
ans = math.ceil(num_l / (k-1)) + math.ceil(num_r / (k-1))
print(ans) |
p03317 | s244356520 | Wrong Answer | N,K=map(int,input().split())
A=list(map(int,input().split()))
print(((N-1)+(K-1))//(K-1))
|
p03317 | s724918703 | 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:]
left_count = math.ceil(len(left_list) / (K-1))
right_count = math.ceil(len(right_list) / (K-1))
print(left_count + right_count) |
p03317 | s161048608 | Wrong Answer | n,k=map(int,input().split())
a = list(map(int,input().split()))
cnt = 0
if n % k == 0:
cnt = int(n / k)
else:
while n > 0:
n = n - (k-1)
cnt +=1
print(cnt) |
p03317 | s330627073 | Wrong Answer | import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
if N==K:
print(1)
exit(0)
index = A.index(1)
ans = math.ceil((N-1-index)/(K-1)) + math.ceil(index/(K-1))
print(ans)
|
p03317 | s044549104 | Wrong Answer |
def solve():
cnt = (N - 1) // (K - 1) + 1
if N == K:
cnt = (N - 1) // (K - 1)
print(cnt)
if __name__ == "__main__":
N,K = list(map(int, input().split()))
a = list(map(int, input().split()))
solve()
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.