problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03317 | s863389682 | Accepted | # ABC101 C - Minimization
# N <= K + (K-1)(g-1)を満たす最小のgが答え
from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
g = 1
while True:
if N <= K + (K-1)*(g-1):
break
else:
g += 1
print(g) |
p03317 | s386569862 | Accepted | import math
n,k=map(int,input().split());print(math.ceil((n-1)/(k-1))) |
p03317 | s282537508 | Accepted | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
import math
print(math.ceil((N-1)/(K-1))) |
p03317 | s293630163 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
import math
ans = math.ceil((n - 1) / (k - 1))
print(ans)
|
p03317 | s605295107 | Accepted | n , k = map(int,input().split())
print((n-2)//(k-1)+1) |
p03317 | s658935479 | Accepted | import math
n, k = map(int, input().split())
lst = list(map(int, input().split()))
print(math.ceil((n-1)/(k-1)))
|
p03317 | s640405977 | Accepted | import math
n, k = map(int, input().split())
a = [int(_) for _ in input().split()]
if n == k:
print(1)
exit()
idx = a.index(1)
num_l = idx
num_r = n - idx - 1
print(math.ceil((n-1) / (k-1)))
|
p03317 | s559243254 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
ii=0
for i in range(N):
if A[i]==1:
ii=1
print(((N-1)+(K-2))//(K-1))
|
p03317 | s608590108 | Accepted | import math
n,k=map(int,input().split());input();print(math.ceil((n-1)/(k-1))) |
p03317 | s007318867 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
# 1以外の要素n-1個を、k-1で割る(1項ずつ重複させるため)。余りは1回と数えるので、切り上げる
print(-((-n+1) // (k-1))) |
p03317 | s225981697 | Accepted | n,k=map(int,input().split())
A=list(map(int,input().split()))
print((n-2)//(k-1)+1) |
p03317 | s441270621 | Accepted | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
if N == K:
print(1)
elif (N-1)%(K-1) == 0:
print((N-1)//(K-1))
elif K == 2:
print(N-1)
else:
ans = ceil(N/(K-1))
print(ans)
|
p03317 | s296899672 | Accepted | import math
n,k=map(int,input().split());input();print([math.ceil((n-k)/(k-1))+1,1][n==k]) |
p03317 | s614149616 | Accepted | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = ceil((N-1)/(K-1))
print(ans) |
p03317 | s628360358 | Accepted | x, y = map(int,input().split())
li = list(map(int,input().split()))
if (x-1)%(y-1) == 0:
print((x-1)//(y-1))
else:
print((x-1)//(y-1)+1) |
p03317 | s939460286 | Accepted | import math
n,k=map(int,input().split());a=list(map(int,input().split()))
print([math.ceil((n-k)/(k-1))+1,1][n==k]) |
p03317 | s071831370 | Accepted | N, K = map(int, input().split())
A = [int(x) for x in input().split()]
ans = 1
n = (N-K)//(K-1)
ans += n
if N-K-n*(K-1) > 0:
ans += 1
print(ans)
|
p03317 | s409154268 | Accepted | import math
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=math.ceil((n-1)/(k-1))
print(b) |
p03317 | s739935830 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
if (A.index(1)+1)>=K and (N-A.index(1))>=K:
ans=-(-A.index(1))//(K-1)-(-N+A.index(1)+1)//(K-1)
else:
ans=1-(-N+K)//(K+1)
print(ans) |
p03317 | s958813728 | Accepted | def main():
from math import ceil
n, k, *a = map(int, open(0).read().split())
ans = 1 + ceil((n - k) / (k - 1))
print(ans)
if __name__ == '__main__':
main()
|
p03317 | s356374564 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
i = 1
while n > k + (k-1)*(i-1):
i += 1
print(i)
|
p03317 | s873151168 | Accepted | n,k=map(int,input().split())
l=list(map(int,input().split()))
if n<=k:
print(1)
exit()
c=1
while 1:
if n<=k:
break
n-=(k-1)
c+=1
print(c)
|
p03317 | s243961552 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
cnt=0
for i in range(10**5+1):
N-=K
cnt+=1
if N<=0:
break
else:
N+=1
print(cnt) |
p03317 | s380851545 | Accepted | n,k = map(int , raw_input().split())
c = n - k
p = k - 1
print 1 + (c + p-1)/p |
p03317 | s918066411 | Accepted | 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
n -= 1
k -= 1
x = math.ceil(n / k)
print(x)
|
p03317 | s442804179 | Accepted | n, k = map(int, input().split())
print((n - 2) // (k - 1) + 1) |
p03317 | s088207291 | Accepted | N, K = map(int, input().split())
L = list(map(int, input().split()))
## Trivial = (N-1)//(K-1)
if (N-1) % (K-1) == 0:
print( (N-1)//(K-1) )
else:
print( (N-1)//(K-1) + 1) |
p03317 | s261084570 | Accepted | #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()))
ix=a.index(1)
i=math.ceil((n-k)/(k-1))+1
print(i) |
p03317 | s250213747 | Accepted | 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 and (lm + rm) != 0))) |
p03317 | s996953826 | Accepted | from math import ceil
n,k=map(int,input().split())
a=list(map(int,input().split()))
n-=1
k-=1
print(ceil(n/k)) |
p03317 | s029039883 | Accepted | N, K = map(int, input().split())
A = input()
print((N+K-3)//(K-1)) |
p03317 | s446029205 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
from math import ceil
print(ceil((N-1) / (K-1))) |
p03317 | s917776426 | Accepted | n,k = map(int,input().split())
x = tuple(map(int, input().split()))
for i,v in enumerate(x):
if v == 1:
r = i
a,b = divmod(r,k-1)
if b > 0:
a += 1
r = a * (k-1)
l = n-r-1
if l > 0:
c,d = divmod(l, k-1)
if d > 0:
c += 1
a += c
print(a) |
p03317 | s273223670 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
aa=min(a)
n-=k
import math
q=0
if n%(k-1)==0:
q+=n//(k-1)
else:
q+=n//(k-1)+1
print(q+1) |
p03317 | s842170509 | Accepted | #!/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 = 10**10
for i in range(0, k):
ans_tmp = 0
pre_tmp = max(0, pre-i)
post_tmp = max(0, post-(k-1-i))
ans_tmp += math.ceil(pre_tmp/(k-1))
ans_tmp += math.ceil(post_tmp/(k-1))
ans = min(ans, ans_tmp)
# print(pre_tmp, post_tmp, ans)
print(ans+1)
|
p03317 | s894919019 | Accepted | import math
n, k = map(int, input().split())
lis = list(map(int, input().split()))
print(math.ceil((n-1)/(k-1))) |
p03317 | s894072160 | Accepted | N,K = map(int,input().split())
L = [i for i in map(int,input().split())]
res = (N-1)//(K-1)
if (N-1) % (K-1) != 0:
print(res+1)
else:
print(res) |
p03317 | s268733497 | Accepted | import math
N, K = map(int, input().split())
print(math.ceil((N-1)/(K-1))) |
p03317 | s989738263 | Accepted | 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:
ans = N
for j in range(max(0, i-(K-1)), min(N, i+K-1)):
ans = min(math.ceil(j/(K-1)) + math.ceil((N-j-1)/(K-1)), ans)
break
print(ans) |
p03317 | s901820705 | Accepted | import math
n,k = map(int,input().split())
a = list(map(int,input().split()))
print(math.ceil((n-1)/(k-1)))
|
p03317 | s011381223 | Accepted | n,k = map(int,input().split())
l = list(map(int,input().split()))
print(-(-(n-1)//(k-1)))
|
p03317 | s895995673 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
def ceil(a, b):
return -(-a // b)
print(ceil(n-1, k-1))
|
p03317 | s879130252 | Accepted | from math import ceil
N, K = map(int, input().split())
print(ceil((N - 1) / (K - 1))) |
p03317 | s831390934 | Accepted | import math
n,k = map(int,input().split())
a_list = list(map(int,input().split()))
print(math.ceil((n-1)/(k-1))) |
p03317 | s864876515 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
print((n+k-3)//(k-1)) |
p03317 | s144952968 | Accepted | 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
if (n - 1) % (k - 1) == 0:
print((n - 1) // (k - 1))
else:
print((n - 1) // (k - 1) + 1)
|
p03317 | s895538455 | Accepted | import sys
n,k = map(int,input().split())
a = list(map(int,input().split()))
a.sort()
start = 0
end = k
count = 0
for i in range(n):
if a[n-1]==1:
print(count)
sys.exit()
a[start:end] = [1]*k
start += (k-1)
end += (k-1)
count += 1 |
p03317 | s248173541 | Accepted | import sys
n, k = map(int, sys.stdin.readline().split())
def main():
print((n + k - 3) // (k - 1))
if __name__ == '__main__':
main() |
p03317 | s919088869 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
print(((N-2) // (K-1))+1)
|
p03317 | s498543440 | Accepted | import math
n,k=map(int,input().split())
a=list(map(int,input().split()))
print(math.ceil((n-1)/(k-1))) |
p03317 | s255975589 | Accepted | import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15
def main():
N,K = map(int,input().split())
A = list(map(int,input().split()))
ans = 1
N -= K
ans += (N + K - 2)//(K - 1)
print(ans)
if __name__ == '__main__':
main() |
p03317 | s140135369 | Accepted | N, K = map(int, input().split())
A=list(map(int, input().split()))
num=0
while num*K-(num-1)<N:
num+=1
print(num) |
p03317 | s240019516 | Accepted | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(math.ceil((n-1)/(k-1))) |
p03317 | s846338805 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
if (N-1) % (K-1) == 0:
print((N-1)//(K-1))
else:
print(1 + (N-1)//(K-1)) |
p03317 | s823105424 | Accepted | import sys
input = sys.stdin.readline
def main():
n, k = map(int, input().split())
A = list(map(int, input().split()))
ans = 1
n -= k
ans += (n+k-2) // (k-1)
print(ans)
if __name__ == "__main__":
main() |
p03317 | s506830840 | Accepted | import math
N, K = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
if N == K:
print(1)
else:
print(math.ceil((N-1)/(K-1)))
|
p03317 | s376453883 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = 0
index = 1
while index <= (N - 1):
ans += 1
index += (K-1)
print(ans) |
p03317 | s678406598 | Accepted | N, K = map(int, input().split())
A = [int(i) for i in input().split()]
A.sort()
for i in range(1, N):
if A[i] != A[0]:
idx = i
break
# int((N - idx) / K)
if (N - idx) % (K - 1) == 0:
print(int((N - idx) / (K - 1)))
else:
print(int((N - idx) / (K - 1)) + 1) |
p03317 | s378748518 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
if (n + k - 1) // k == 1:
print(1)
else:
res = ((n - k) + (k - 2)) // (k - 1) + 1
print(res)
|
p03317 | s774149963 | Accepted | #全部1にしたい
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
#端っこから区間をあらかじめ区切っておく
ans=0
i=0
while i<n-1:
ans=ans+1
i=i+k-1
print(ans)
|
p03317 | s362783739 | Accepted | n,k=map(int,input().split())
a = list(map(int,input().split()))
if (n-1)%(k-1) != 0:
cnt = (n-1)//(k-1)+1
else:
cnt = (n-1)//(k-1)
print(cnt) |
p03317 | s027030729 | Accepted | #!/usr/bin/env python3
#ABC101 C
import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
print(math.ceil((N-1)/(K-1)))
|
p03317 | s066633204 | Accepted | import numpy as np
n, k = map(int, input().split())
print(-(-(n-1)//(k-1))) |
p03317 | s199511593 | Accepted | import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = 0
print(math.ceil((N-1)/(K-1)))
|
p03317 | s120967178 | Accepted | import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n, k = nm()
a = nl()
print(math.ceil((n - 1) / (k - 1))) |
p03317 | s193183716 | Accepted | from math import ceil
n,k=map(int,input().split())
a=list(map(int,input().split()))
print(ceil((n-1)/(k-1))) |
p03317 | s678092788 | Accepted | import math
n, k = map(int,input().split())
a = list(map(int,input().split()))
print(math.ceil((n-1)/(k-1))) |
p03317 | s483151711 | Accepted | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = ceil((N-1)/(K-1))
print(ans)
|
p03317 | s180180364 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
p = 0
cnt= 0
while p < n - 1:
p += k - 1
cnt += 1
print(cnt) |
p03317 | s137640326 | Accepted | n, k = map(int, input().split())
As = list(map(int, input().split()))
idx = As.index(min(As))
left = idx
n_l = (left + k - 2) // (k - 1)
right = n - ((n_l) * (k-1)) - 1
n_r = (right + k - 2) // (k - 1)
print(n_l + n_r) |
p03317 | s282772223 | Accepted | N, K = map(int, input().split())
alist = list(map(int, input().split()))
ans = 1
N -= K
while N > 0:
N -= K-1
ans += 1
print(ans)
|
p03317 | s349019937 | Accepted | n,k = map(int,input().split())
a_L = list(map(int,input().split()))
ans = 1
n = n-k
while True:
if n<=0:
print(ans)
exit()
n = n-k+1
ans += 1 |
p03317 | s170486506 | Accepted | n, k = (int(x) for x in input().split())
a = [int(x) for x in input().split()]
if n == k:
print(1)
elif k == 2:
print(n-1)
else:
rem = n % (k-1)
m = (n - rem) / (k-1)
if rem <= 1:
print(int(m))
else:
print(int(m+1))
|
p03317 | s716302043 | Accepted | from math import ceil
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(ceil((n-1)/(k-1))) |
p03317 | s106238463 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
ans = -(-(n-1)//(k-1))
print(ans) |
p03317 | s412878952 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
def ceil(x, y):
if x % y == 0:
return x // y
else:
return x // y + 1
print(ceil(n-1, k-1))
|
p03317 | s009517708 | Accepted | N, K = map(int, input().split())
A = list(int(a) for a in input().split())
print(((N-1)+(K-2))//(K-1)) |
p03317 | s890156711 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
N=N-1
K=K-1
if N==K:
print(1)
exit()
if N%K==0:
print(N//K)
else:
print(N//K+1) |
p03317 | s331635260 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
if k < n:
c = 1
n -= k
while n > 0:
n -= k-1
c += 1
print(c)
else:
print(1) |
p03317 | s934548861 | Accepted | def main():
n, k = map(int, input().split())
As = list(map(int, input().split()))
ans = (n-2) // (k-1) + 1
print(ans)
if __name__ == "__main__":
main()
|
p03317 | s488000003 | Accepted | n,k = map(int,input().split())
a = [int(i) for i in input().split()]
b = a.index(1)
ans = 0
b -= (k-1)
if b < 0:
b = a.index(1) + abs(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,f = divmod(n-1 - b,k-1)
ans += e
if f != 0:
ans +=1
if d != 0 and f != 0 and d + f <= k-1:
ans -=1
print(ans) |
p03317 | s986416362 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
print(-(-(n-1)//(k-1)))
|
p03317 | s739317721 | Accepted | 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 - 2) // (K - 1) + 1)
return
if __name__ == '__main__':
main()
|
p03317 | s691113034 | Accepted | 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 - 1 - index - (K - 1 - leftamari if leftamari != 0 else 0)) / (K-1))
print(left + right)
|
p03317 | s131077623 | Accepted | n,k = map(int,input().split())
input()
print(1 if n==k else 1+(n-2)//(k-1)) |
p03317 | s105794040 | Accepted | import math
def main():
n, k = map(int, input().split())
As = list(map(int, input().split()))
ans = math.ceil((n-1)/(k-1))
print(ans)
if __name__ == "__main__":
main()
|
p03317 | s122474345 | Accepted | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
print((n-1+k-2)//(k-1)) |
p03317 | s343630986 | Accepted | 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) / (K - 1)) + 1)
|
p03317 | s800829823 | Accepted | n,k=map(int,input().split())
a=[int(i) for i in input().split()]
x=n-1
y=k-1
print((x+y-1)//y) |
p03317 | s979836985 | Accepted | N,K=map(int,input().split())
*A,=map(int,input().split())
print((N-2)//(K-1)+1) |
p03317 | s962658893 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
# 1の場所を探す
pos = A.index(1)
count = 0
num_forward = pos # 前方の残り数
num_backward = N - pos - 1 # 後方の残り数
# 前方にX回試行したときに負の余りが生じる場合は後方に回す
rest = num_forward % -(K - 1)
num_backward += rest
while num_forward > 0: # 先頭まで1にする
num_forward -= K - 1
count += 1
while num_backward > 0: # 末尾まで1にする
num_backward -= K - 1
count += 1
print(count)
|
p03317 | s877529131 | Accepted | import math
def solve(n, k, A):
return math.ceil((len(A) - A.count(min(A))) / (k - 1))
_n, _k = map(int, input().split())
_A = list(map(int, input().split()))
print(solve(_n, _k, _A))
|
p03317 | s328230947 | Accepted | n, k = map(int, input().split())
A = list(map(int, input().split()))
answer = 100000
while True:
if n <= k + (k - 1) * (answer - 1):
answer -= 1
else:
break
print(answer + 1) |
p03317 | s717118235 | Accepted | import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
N -= K
K -= 1
C = math.ceil(N/K)
print(C+1)
|
p03317 | s156780439 | Accepted | n, k = map(int, input().split())
an = list(map(int, input().split()))
mini = min(an)
need = 0
for a in an:
if a != mini:
need += 1
print(-(-need//(k-1)))
|
p03317 | s606727605 | Accepted | N,K = map(int, input().split())
A = list(map(int, input().split()))
print((N+K-3)//(K-1)) |
p03317 | s141705053 | Accepted | n,k = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
k -= 1
cnt = -(-(n-1)//k)
print(cnt) |
p03317 | s481834922 | Accepted | import math
n,k = map(int,input().split())
A = list(map(int,input().split()))
print(math.ceil((n-1)/(k-1))) |
p03317 | s700422312 | Accepted | n,k=map(int,input().split())
A = list(map(int,input().split()))
n -= k
k -= 1
ans = 1
ans += (n+k-1)//k
print(ans) |
p03317 | s830392454 | Accepted | n,k=map(int,input().split())
print(0--~-n//~-k) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.