problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03317 | s677646405 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
print((n-1)//(k-1)+1 if (n-1)%(k-1)!=0 else (n-1)//(k-1)) |
p03317 | s616371560 | 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 | s212569113 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = 0
while n > 0:
if n == k:
ans += 1
break
n -= k - 1
ans += 1
print(ans) |
p03317 | s400671463 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
import math
print(math.ceil((n-1)/(k-1)))
|
p03317 | s421054466 | 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((n-1)//(k-1)+1) |
p03317 | s830294678 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
p = min(a)
a += [p]
ans,i,temp = 0,0,0
while i<n:
if a[i]==p:
m = -(-(i-temp)//(k-1))
ans += m
temp += m*(k-1)+1
i = temp
else:
i += 1
ans += -(-(n-temp)//(k-1))
print(ans) |
p03317 | s146640086 | Accepted | import math
N, K = map(int, input().split())
print(math.ceil((N-1)/(K-1))) |
p03317 | s353644678 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
g = 1
while N > K + (K - 1) * (g - 1):
g += 1
print(g)
|
p03317 | s538413246 | Accepted | print(eval('0--~-'+''.join([i if i!=' 'else'//~-'for i in input()]))) |
p03317 | s826365612 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
print((n-1+k-2)//(k-1))
|
p03317 | s708037816 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
x = n-k
if x == 0:
print(1)
else:
print(1 + (x+k-2)//(k-1)) |
p03317 | s614115542 | Accepted | # 1回の操作で増やせる1に等しい要素の数はK−1
N, K = map(int, input().split())
A = sorted(list(map(int, input().split())))
# ceil(N-1/K-1)
print((N-1+K-2)//(K-1)) # ceil = x+y-1 |
p03317 | s594904818 | Accepted | a,b = map(int,input().split())
c = list(map(int,input().split()))
ans = -(-(a - b) // (b - 1)) + 1
print(ans)
|
p03317 | s898833693 | Accepted | #!/usr/bin/env python3
n, k = map(float, input().split())
ans = -(-(n-1) // (k-1))
print(int(ans)) |
p03317 | s952200623 | Accepted | import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = 0
least_g = (N-1) / (K-1)
if least_g.is_integer():
print(int(least_g))
else:
print(int(least_g)+1)
|
p03317 | s558545345 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = 1
ref = K
while ref < N:
ans += 1
ref += K-1
print(ans) |
p03317 | s211570512 | Accepted | import math
n,k = map(int,input().split())
ls = list(map(int,input().split()))
print(math.ceil((n-1)/(k-1)))
|
p03317 | s404984431 | Accepted | import math
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:
ans = float('inf')
for i in range(max(1, idx_minA - K + 1), idx_minA + 1):
ans = min(ans, 1 + math.ceil((i - 1) / (K - 1)) + math.ceil((N - (i + K - 1)) / (K - 1)))
print(ans)
|
p03317 | s073130397 | Accepted | NK = list(map(int,input().split()))
A = list(map(int,input().split()))
N = NK[0]
K = NK[1]
answer = (N - 1) // (K - 1)
remain = (N - 1) % (K - 1)
if remain > 0:
answer = answer + 1
print(answer) |
p03317 | s898520412 | Accepted | N,M = map(int,input().split())
ans = (N-1) // (M-1)
if (N-1) % (M-1) != 0:
ans += 1
print(ans)
|
p03317 | s340061343 | Accepted | #101_C
N,K=map(int,input().split())
A=input()
print(-(-(N-1)//(K-1))) |
p03317 | s685110273 | Accepted | import math
N, K = map(int,input().split())
A = list(map(int,input().split()))
print(math.ceil((N-1)/(K-1))) |
p03317 | s228071247 | Accepted | input_line = input().split()
num_array = int(input_line[0])
num_equal = int(input_line[1])
input_line = input() # 無視
equalized = 1
i = 0
while equalized < num_array:
equalized += (num_equal - 1)
# print(i, equalized)
i += 1
print(str(i))
|
p03317 | s279327552 | Accepted | N,K = map(int, input().split())
A=list(map(int,input().split()))
min_num=min(A)
count=A.count(min_num)
target=len(A)-count
K_num=K-1
print(int(-(-target//K_num))) |
p03317 | s899637776 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
print((N-1-1)//(K-1)+1)
|
p03317 | s664285059 | Accepted | n,k = map(int, input().split())
num_list = list(map(int, input().split()))
if (n-k) % (k-1) == 0:
print((n-k)//(k-1)+1)
else:
print((n-k)//(k-1) + 2) |
p03317 | s963588594 | Accepted | from bisect import bisect_left
n, k = map(int, input().split())
a = list(map(int, input().split()))
pos = bisect_left(a, 1)
print((pos + k - 2) // (k - 1) + (n - pos + k - 3) // (k - 1)) |
p03317 | s533505009 | Accepted | n,k = map(int,input().split())
A = list(map(int,input().split()))
print(-((1-n)//(k-1)))
|
p03317 | s015604267 | Accepted | import math
n, k = map(int, input().split())
an = list(map(int, input().split()))
n = n-k
ans = math.ceil(n/(k-1)) + 1
print(ans) |
p03317 | s517994197 | Accepted | from math import ceil
n, k = [int(x) for x in input().split()]
a_list = [int(x) for x in input().split()]
print(ceil((n - 1) / (k - 1))) |
p03317 | s677877421 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
print((n-2)//(k-1)+1) |
p03317 | s108764930 | Accepted | import math
n,k=map(int,input().split())
a=list(map(int,input().split()))
print(math.ceil((n-1)/(k-1))) |
p03317 | s985790306 | Accepted | import sys
input = sys.stdin.readline
import math
def main():
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
print(-((-(N - 1)) // (K - 1)))
if __name__ == '__main__':
main()
|
p03317 | s805140307 | Accepted | n, k = [ int(i) for i 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 - 2) // (k - 1)
for i in range(max(i0 - k + 1, 0), min(i0, n - k) + 1) ])) |
p03317 | s044802743 | Accepted | import math
N, K = map(int, input().split())
a = list(map(int, input().split()))
ans = math.ceil((N - 1)/ (K - 1))
print(ans) |
p03317 | s419850941 | Accepted | import math
N, K = map(int, input().split())
A = input()
print(math.ceil((N-K)/(K-1))+1) |
p03317 | s656115857 | Accepted | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
one = 1
ans = 0
while one < N:
one += K-1
ans += 1
print(ans) |
p03317 | s460871206 | Accepted |
import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
N -= K
print(math.ceil(N/(K-1))+1) |
p03317 | s678095665 | Accepted | n, k = map(int,input().split())
a = [int(i) for i in input().split()]
if n == k:
cnt = 1
else:
cnt = (n - 2) // (k-1) + 1
print(cnt) |
p03317 | s733757189 | Accepted | def main():
n, k = map(int, input().split())
m = 1 + (n - k) // (k - 1)
if (n - k) % (k - 1) == 0:
print(m)
else:
print(m + 1)
if __name__=="__main__":
main()
|
p03317 | s813245969 | Accepted | from math import ceil
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(1 + ceil((n - k) / (k - 1))) |
p03317 | s971529647 | Accepted | n, k = map(int, input().split())
lst = list(map(int, input().split()))
idx = lst.index(1)
k -= 1
a = (len(lst[:idx]) + k - 1) // k
b = (len(lst[idx + 1:]) + k - 1) // k
c = ((n - 1) + k - 1) // k
print(min(c, a + b)) |
p03317 | s870284902 | Accepted | n,k=map(int,input().split())
i=1
cnt=0
while i<n:
i+=k-1
cnt+=1
print(cnt) |
p03317 | s742575865 | Accepted | from math import ceil
n,k=map(int,input().split())
print(ceil((n-1)/(k-1))) |
p03317 | s663969229 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = 0
tmp = len(A)
while True:
tmp -= K
ans += 1
if tmp <= 0:
break
else:
tmp += 1
print(ans)
|
p03317 | s719309829 | Accepted | n, k = map(int,input().split())
a = list(map(int,input().split()))
print((n-k-1)//(k-1)+2)
|
p03317 | s682514096 | Accepted | N,K = map(int,input().split())
print((N+K-3)//(K-1)) |
p03317 | s855642048 | Accepted | import math
n, k, *nums = map(int, open(0).read().split())
print(math.ceil((n-k)/(k-1))+1) |
p03317 | s124612130 | Accepted | import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
a = math.ceil(A.index(1)/(K-1))
b = math.ceil((N-a*(K-1))/(K-1))
ans = min(a+b, math.ceil((N-1)/(K-1)))
print (ans) |
p03317 | s500200839 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
from math import ceil
print(ceil((N-1)/(K-1))) |
p03317 | s759711928 | Accepted | n,k=map(int,input().split())
a=map(int,input().split())
ans=0
while n>1:
ans+=1
n-=k
n+=1
print(ans)
|
p03317 | s859167070 | Accepted | import sys
stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))
def main():
n, k = nm()
A = nl()
print((n - 1) // (k - 1) if (n - 1) %
(k - 1) == 0 else (n - 1) // (k - 1) + 1)
if __name__ == '__main__':
main()
|
p03317 | s982016053 | Accepted | n, k = map(int, input().split())
a = [int(i) for i in input().split()]
print(1 if n <= k else 1 + -(-(n - k) // (k - 1))) |
p03317 | s753577663 | Accepted | import math
def main():
N, K = list(map(int, input().split(' ')))
A = list(map(int, input().split(' ')))
index_one = A.index(1)
min_cnt = N
for left_index in range(index_one - (K - 1), index_one + 1):
right_index = left_index + (K - 1)
if left_index < 0 or right_index > N - 1:
continue
cnt = 1 + math.ceil(left_index / (K - 1)) + math.ceil((N - 1 - right_index) / (K - 1))
min_cnt = min([min_cnt, cnt])
print(min_cnt)
if __name__ == '__main__':
main() |
p03317 | s130497159 | Accepted | import bisect
N,K = map(int,input().split())
A = list(map(int,input().split()))
if N==K: print(1);exit()
N-=K
ans = 1
while N>0:
N -=K-1
ans += 1
print(ans)
|
p03317 | s866383709 | Accepted | import math
n,k=map(int,input().split())
a=list(map(int,input().split()))
"""
すべて1にする
"""
print(math.ceil((n-k)/(k-1))+1)
|
p03317 | s721384400 | Accepted | import math
n,k = map(int,input().split())
l = list(map(int,input().split()))
if k >= n:
print(1)
exit()
n -= k
print(math.ceil(n/(k-1))+1) |
p03317 | s870636826 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
cnt = 0
B = N - K
cnt += 1
if B % (K-1) == 0:
cnt += B // (K-1)
else:
cnt += B // (K-1)
cnt += 1
print(cnt) |
p03317 | s124793635 | Accepted | n,k=map(int,input().split())
a=[int(x) for x in input().split()]
ans=1
n-=k
k-=1
ans+=(n+k-1)//k
print(ans)
|
p03317 | s960919740 | Accepted | import sys
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
n, k = MI()
a = LI()
ans = -(-(n-1) // (k-1))
print(ans)
if __name__ == '__main__':
main() |
p03317 | s469401547 | Accepted | #!/usr/bin/env python3
n, k = map(int, input().split())
print(0--~-n//~-k) |
p03317 | s593186647 | Accepted | import math
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# print(N, K, A)
answer = math.ceil((N - 1)/ (K - 1))
print(answer)
|
p03317 | s685880036 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
if n==k:
print(1)
else:
print((n+k-3)//(k-1)) |
p03317 | s344750175 | Accepted | import math
def main():
N, K = map(int, input().split())
A = [int(a) for a in input().split()]
if N == 1:
print(0)
elif N <= K:
print(1)
else:
print(1+math.ceil((N-K)/(K-1)))
if __name__ == "__main__":
main() |
p03317 | s288878231 | Accepted | N, K = map(int,input().split())
A = list(map(int,input().split()))
if (N-K)%(K-1)==0:
ans = 1+(N-K)//(K-1)
else:
ans = 2+(N-K)//(K-1)
print(ans)
|
p03317 | s870874026 | Accepted | NK = list(map(int, input().split()))
no = list(map(int, input().split()))
zan = NK[0]
counter = 0
while(NK[1] < zan):
zan -= NK[1] - 1
counter += 1
print(counter + 1) |
p03317 | s852426488 | 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 + K - 3) // (K - 1))
return
if __name__ == '__main__':
main()
|
p03317 | s094240285 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
n-=k
k-=1
count=1
if n<=0:
pass
else:
while n>0:
n-=k
count+=1
print(count) |
p03317 | s592522684 | Accepted | import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
print(math.ceil((N - 1) / (K - 1)))
|
p03317 | s357834288 | Accepted | from math import ceil
n,k = map(int,input().split())
a = list(map(int,input().split()))
print(ceil((n-1)/(k-1))) |
p03317 | s199099397 | Accepted | #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()
import math
nokori = n - k
#print(nokori)
cnt = 1
cnt += math.ceil(nokori/(k-1))
print(cnt)
if __name__ == '__main__':
main()
|
p03317 | s570535856 | Accepted | import math
def solve():
N,K = map(int, input().split())
A = map(int, input().split())
print(math.ceil((N-1)/(K-1)))
solve() |
p03317 | s034865707 | Accepted | n,k = map(int,input().split())
lst = list(map(int,input().split()))
id = lst.index(1)
left = len(lst[0:id])
right = len(lst[id+1:])
mod = max(left%(k-1),right%(k-1))
total = left + right
counter = 0
while total > 0:
counter += 1
total -= k - 1
print(counter) |
p03317 | s348910497 | Accepted | N,K = (map(int , input().split()))
A = list(map(int , input().split()))
con = 0
ans = 0
iti = 1
ans = K-1 + iti
while N > ans:
ans += K-1
con += 1
print(con+1) |
p03317 | s292687580 | Accepted | n,k = map(int, input().split())
A = list(map(int, input().split()))
counter = 0
for i in range(0,n,k-1):
min_n = min(A[i:i+k])
max_n = max(A[i:i+k])
if min_n != max_n:
counter += 1
if i+k-1 < n:
A[i+k-1] = min_n
print(counter) |
p03317 | s728347058 | Accepted | x,y = map(int,input().split())
t = list(map(int,input().split()))
if x-y <= 0:
print(1)
exit()
else:
x -= y
if x%(y-1)!=0:
print(2+x//(y-1))
else:
print(1+x//(y-1)) |
p03317 | s111217851 | Accepted | n,k = [int(i) for i in input().split()]
an = input()
count = 1
n -= k
k -= 1
while(n > 0):
n -= k
count += 1
print(count) |
p03317 | s491757978 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
ans=1
n-=k
while n>0:
n-=(k-1)
ans+=1
print(ans) |
p03317 | s456844924 | Accepted | import math
N, K = map(int,input().split())
A = list(map(int,input().split()))
print(math.ceil((N-1)/(K-1))) |
p03317 | s237332451 | Accepted | import math
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
print(math.ceil((n-1)/(k-1))) |
p03317 | s822034492 | Accepted | import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
N, K = map(int, input().split())
A = len(input().split())
print((N - 2) // (K - 1) + 1)
|
p03317 | s158895918 | Accepted | n, k = map(int, input().split())
if (n - k) % (k - 1) == 0:
print(1 + (n - k) // (k - 1))
else:
print(1 + (n - k) // (k - 1) + 1)
|
p03317 | s307127811 | Accepted | n,k = map(int, input().split())
x=(n-k)//(k-1)
y=(n-k)%(k-1)
if y==0:
print(x+1)
else:
print(x+2) |
p03317 | s712570284 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
m = n-k
if m>0:
if m%(k-1)==0:
print(m//(k-1) + 1)
else:
print(m//(k-1) + 2)
else:
print(m//(k-1) + 1) |
p03317 | s220059239 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
l=n-k
r=k-1
if l%r==0:
print(l//r+1)
else:
print(l//r+2) |
p03317 | s450191693 | Accepted | # solution
nim,mike=map(int,input().split())
array=[int(x) for x in input().split()]
print((nim+mike-3)//(mike-1)) |
p03317 | s824881007 | Accepted | import math
n,k = map(int,input().split())
s = input()
print(math.ceil((n-1)/(k-1))) |
p03317 | s234192802 | Accepted | import math
n, k = map(int, input().split())
a = map(int, input().split())
print(math.ceil((n-1)/(k-1))) |
p03317 | s300589797 | Accepted | n, k, *a = map(int, open(0).read().split())
print((n+k-3)//(k-1)) |
p03317 | s183815460 | Accepted | 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)
ans = 10**9
for j in range(K):
ans = min(ans,math.ceil(max(i-j,0)/(K-1))+math.ceil(min((N-i-1+j),N-1)/(K-1)))
print(ans) |
p03317 | s669810215 | Accepted | n,k = map(int, input().split())
a = list(map(int, input().split()))
t=k
ans=1
while t < n:
t+=k-1
ans+=1
print(ans) |
p03317 | s360546968 | Accepted | import math
N,K=map(int,input().split())
print(math.ceil((N-1)/(K-1))) |
p03317 | s855501782 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
import math
print(math.ceil((N-1)/(K-1))) |
p03317 | s384271565 | Accepted | import math
N, K = map(int, input().split())
print(math.ceil((N-1)/(K-1))) |
p03317 | s838425811 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = 1
tmp = N - K
ans += tmp // (K - 1)
if tmp%(K - 1) != 0:
ans += 1
print(ans) |
p03317 | s621334453 | Accepted | import math
n, k = map(int, input().split())
a_list = list(map(int, input().split()))
print(math.ceil((n - 1) / (k - 1))) |
p03317 | s887350610 | Accepted | def resolve():
import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
print(math.ceil((N-1)/(K-1)))
resolve() |
p03317 | s898709589 | Accepted | import math
n,k = map(int,input().split())
A = list(map(int,input().split()))
print(int(math.ceil((len(A)-k)/(k-1)))+1) |
p03317 | s861175171 | Accepted | import math
n,k = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
ans = math.ceil((n-1)/(k-1))
print(ans) |
p03317 | s660565022 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
print(-(-(n-1)//(k-1))) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.