problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03317 | s297391647 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
if k < n:
c = 1
n -= k
c += -((-n)//(k-1))
print(c)
else:
print(1) |
p03317 | s028201077 | Accepted | import math
ni = lambda: int(input())
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 | s395887121 | Accepted | import math,sys
N, K = map(int, input().split())
window = K - 1
A = list(map(int, input().split()))
# mi_index = A.index(min(A))
# left_count = math.ceil(mi_index / (K - 1))
# right_count = math.ceil((N - (mi_index + 1)) / (K - 1))
# left = mi_index
# right = mi_index
# while left > 0 or right < N-1:
# if left >= 0 and left > window:
# left -= window
# elif N - 1 - right >= window:
# right += window
# print(left, right)
l = K
count = 1
if l >= N:
print(count)
sys.exit()
while l < N:
l += K - 1
count += 1
print(count) |
p03317 | s595259095 | Accepted |
n,k=map(int,input().split())
a=list(map(int,input().split()))
print((n-2)//(k-1)+1) |
p03317 | s205465107 | Accepted | import math
def Minimization(n , k , al):
ans = math.ceil((n - 1) / (k - 1))
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 | s618072394 | Accepted | import math
N,K = map(int,input().split())
L = [i for i in map(int,input().split())]
#if (N-1) % (K-1) != 0:
#print(((N-1)//(K-1))+1)
#else:
#print((N-1) % (K-1)) #equivalent to ceil.
print(math.ceil((N-1)/(K-1))) |
p03317 | s053978722 | Accepted | n, k = map(int, input().split());print(1 + (n - k) // (k - 1) + ((n - k) % (k - 1) != 0))
|
p03317 | s367425377 | Accepted | n,k=map(int,input().split())
print((n-1)//(k-1)+((n-1)%(k-1)!=0))
|
p03317 | s928078780 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
import math
print( math.ceil( (n-1)/(k-1) ) ) |
p03317 | s659522774 | Accepted | def main():
n, k, *a = map(int, open(0).read().split())
ans = 1 + (n - k) // (k - 1) + ((n - k) % (k - 1) != 0)
print(ans)
if __name__ == '__main__':
main()
|
p03317 | s200563429 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
idx = a.index(1)
if idx == 0:
print(-(-len(a[(idx + 1):]) // (k - 1)))
elif idx == (n - 1):
print(-(-len(a[:idx]) // (k - 1)))
else:
print(-(-(n - 1) // (k - 1)))
|
p03317 | s300372743 | Accepted | import sys
import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
print(math.ceil((N-1)/(K-1))) |
p03317 | s640049728 | Accepted | n,k = map(int,input().split())
if (n-k)%(k-1) == 0:
print((n-k)//(k-1)+1)
else:
print((n-k)//(k-1)+2) |
p03317 | s616055501 | Accepted | import math
n, k = map(int, input().split())
a = [int(_) for _ in input().split()]
print(math.ceil((n-1) / (k-1))) |
p03317 | s639028249 | Accepted | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
N,K=map(int,input().split())
print(-(-(N-1)//(K-1))) |
p03317 | s197551974 | 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 | s159079073 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
eq = 1
cnt = int()
while eq<N:
eq += (K-1)
#print(cnt, eq)
cnt +=1
print(cnt) |
p03317 | s949374443 | Accepted | #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()))
print(math.ceil((N-1)/(K-1)))
|
p03317 | s299323096 | Accepted | import sys
readline = sys.stdin.readline
import math
def main():
N, K = map(int, readline().rstrip().split())
A = list(map(int, readline().rstrip().split()))
print(math.ceil((N-1)/(K-1)))
if __name__ == '__main__':
main() |
p03317 | s795240021 | Accepted | n, k = map(int, input().split())
a = 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 | s828913533 | 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 | s490742291 | Accepted | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
n -= 1
k -= 1
ans = math.ceil(n / k)
print(ans)
|
p03317 | s206363348 | Accepted | N,K=map(int,input().split())
*A,=map(int,input().split())
argmin = A.index(1)
back = (argmin+(K-1)-1)//(K-1)
forward = (N-argmin-1+(K-1)-1)//(K-1)
ans1 = back+forward
ans2 = ((N-1)+(K-1)-1)//(K-1)
print(min(ans1,ans2)) |
p03317 | s550739845 | Accepted | # -*- 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))
if x % (K - 1) != 0:
y -= K - 1 - (x % (K - 1))
ans += math.ceil(y / (K - 1))
# 結果出力
print(ans)
|
p03317 | s602936567 | Accepted | from math import ceil
n,k=map(int,input().split())
a=list(map(int,input().split()))
print(ceil((n-1)/(k-1))) |
p03317 | s188375236 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
ans=len(a)
ans-=k
if ans%(k-1)==0:
print(ans//(k-1)+1)
else:
print(ans//(k-1)+2) |
p03317 | s222524020 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
print((len(A)-1)//(K-1) + int(bool((len(A)-1)%(K-1)))) |
p03317 | s618676641 | Accepted | n,k = map(int,input().split())
import math
print(math.ceil((n-1)/(k-1))) |
p03317 | s771147841 | Accepted | N,K = list(map(int,input().split()))
n=(N-K)//(K-1)+1
mod=(N-K)%(K-1)
if mod!=0:
n+=1
print(n) |
p03317 | s317849079 | Accepted | n, k = map(int, input().split())
input()
print((n-2)//(k-1) + 1) |
p03317 | s039371859 | Accepted | import math
def main():
n, k = [int(e) for e in input().split()]
A = [int(e) for e in input().split()]
ans = math.ceil((n - 1)/(k - 1))
print(ans)
if __name__ == "__main__":
main()
|
p03317 | s625763027 | Accepted | import math
N, K = map(int, input().split(' '))
n = max(0, N - K)
print(1 + math.ceil(n / (K - 1)))
|
p03317 | s527794891 | Accepted | n,k = map(int,input().split())
print((n+k-3) // (k-1)) |
p03317 | s049388067 | Accepted | N,K=map(int,input().split())
if (N-1)%(K-1)==0:
print((N-1)//(K-1))
else:
print((N-1)//(K-1)+1) |
p03317 | s812281491 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
print((n-2)//(k-1)+1) |
p03317 | s250970200 | Accepted | import math
n,k = map(int,input().split())
print(math.ceil((n-1)/(k-1))) |
p03317 | s636865620 | Accepted | n,k=map(int,input().split())
cnt=1
n-=k
cnt+=(n+k-2)//(k-1)
print(cnt) |
p03317 | s584198895 | Accepted | import math
N,K=list(map(int, input().split()))
A=list(map(int, input().split()))
print(math.ceil((N-1)/(K-1))) |
p03317 | s552600057 | Accepted | n,k=map(int,input().split())
*a,=map(int,input().split())
print((n-2)//(k-1)+1) |
p03317 | s689378345 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
ans = k
count = 1
while ans < n:
ans += k-1
count += 1
print(count) |
p03317 | s707451446 | Accepted | import math
n, k = map(int,input().split())
input()
print(math.ceil((n-1)/(k-1))) |
p03317 | s141008207 | Accepted | from math import ceil
n,k = map(int,input().split(" "))
print(ceil((n - 1) / (k - 1)))
|
p03317 | s511144824 | Accepted | [N,K] = list(map(int,input().split()))
A = list(map(int,input().split()))
if (N-1)%(K-1)==0:
out=(N-1)//(K-1)
else:
out=(N-1)//(K-1)+1
print(out)
|
p03317 | s166443060 | Accepted | N,K=map(int,input().split())
a=(N-1)%(K-1)
b=(N-1)//(K-1)
if a==0:
print(b)
else:
print(b+1) |
p03317 | s286993631 | Accepted | N, K = map(int, input().split())
if (N - 1) % (K - 1) == 0:
print((N-1)//(K-1))
else:
print((N-1)//(K-1)+1)
|
p03317 | s532152758 | Accepted | n=input().rstrip().split()
preans=(int(n[0])-1)/(int(n[1])-1)
ans=int(preans)
if (int(n[0])-1)%(int(n[1])-1)!=0:
ans+=1
print(ans) |
p03317 | s307015377 | Accepted | #!usr/bin/env python3
import math
N, K = map(int, input().split())
print(math.ceil((N-1)/(K-1))) |
p03317 | s866589016 | Accepted | import math
N, K = list(map(lambda k: int(k), input().split(" ")))
A = list(map(lambda a: int(a), input().split(" ")))
print(math.ceil((N - K) / (K - 1)) + 1) |
p03317 | s175623810 | Accepted | n,k=list(map(int, input().split()))
a= list(map(int, input().split()))
final=min(a)
ans=0
flag=-1
check=0
for v in a:
if flag==-1 and v!=final:
flag=2
ans+=1
check=0
if flag==k:
flag=-1
elif flag>=0:
if check==0 and v==final:
flag-=1
check=1
flag+=1
if flag==k:
flag=-1
print(ans) |
p03317 | s257198625 | Accepted | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
if n<=k:
print(1)
exit()
n=n-k
if n%(k-1)==0:
print(1+n//(k-1))
else:
print(1+n//(k-1)+1) |
p03317 | s334346614 | Accepted | n, k = [int(i) for i in input().split()]
nums = [int(i) for i in input().split()]
count = 0
while n > 0:
if n > k:
n -= k-1
else:
n -= k
count += 1
print(count)
|
p03317 | s434180743 | Accepted | import math
N,K = map(int,input().split())
lsA = list(map(int,input().split()))
print(math.ceil((N-1)/(K-1))) |
p03317 | s654468146 | Accepted | n,k=map(int,input().split())
print(-(-(n-1)//(k-1))) |
p03317 | s658869219 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
ans=0
while 1:
if N>K:
N -= (K-1)
ans+=1
else:
ans+=1
break
print(ans)
|
p03317 | s056176918 | Accepted | from math import ceil
n,k=map(int,input().split())
ans=1
n-=k
print(ans+ceil(n/(k-1)))
|
p03317 | s364035632 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
count = 1
n = n-k
while n > 0:
n -= k-1
count += 1
print(count) |
p03317 | s393005271 | Accepted | import math
n,k=map(int,input().split())
input()
print(math.ceil((n-1)/(k-1))) |
p03317 | s453805873 | Accepted | import math
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
print(int(math.ceil((len(a)-1) / ( k -1)))) |
p03317 | s658980682 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
a=A.index(min(A))
r=a
l=N-(r+1)
rc=r//(K-1)
lc=l//(K-1)
if N-(rc+lc)*(K-1)==1:
print(rc+lc)
elif 1<N-(rc+lc)*(K-1)<=K:
print(rc+lc+1)
else:
print(rc+lc+2) |
p03317 | s454882705 | Accepted | n, k = map(int,input().split())
print((n-1+k-2)//(k-1))
|
p03317 | s616904882 | Accepted | import math
n,k = map(int,input().split())
s = input()
#print(n-1,k-1)
print(math.ceil((n-1)/(k-1))) |
p03317 | s046408345 | Accepted | from math import ceil
N, K = map(int, input().split())
ll = list(map(int, input().split()))
print(ceil((N-1) / (K-1))) |
p03317 | s110666861 | Accepted | n, k = map(int, input().split())
a = list(map(int , input().split()))
if n == k:
print(1)
exit()
import math
print(1 + math.ceil(((n - k) / (k-1)))) |
p03317 | s770148835 | Accepted | import math
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
print(math.ceil((n - k) / (k - 1)) + 1) |
p03317 | s824963043 | Accepted | from math import ceil
n,k=map(int,input().split())
a=[int(i) for i in input().split()]
n=n-k
c=1
if(n>0):
c+=ceil(n/(k-1))
print(c) |
p03317 | s632579858 | Accepted | import math
n , k = map(int, input().split())
a = list(map(int, input().split()))
g = 1
i = 0
while g < n:
g += (k -1)
i += 1
print(i) |
p03317 | s291714232 | Accepted | def main():
n, k = map(int, input().split())
if (n - k) % (k - 1):
print(1 + (n - k) // (k - 1) + 1)
else:
print(1 + (n - k) // (k - 1) )
if __name__=="__main__":
main()
|
p03317 | s964412282 | Accepted | import math
n, k = map(int, input().split())
ls = list(map(int, input().split()))
print(math.ceil((n - 1) / (k - 1))) |
p03317 | s595781432 | Accepted | n,k=map(int,input().split())
if n==k:
print(1)
elif k==2:
print(n-1)
elif n%(k-1)==1:
print(n//(k-1))
else:
print((n+k-2)//(k-1)) |
p03317 | s195305435 | Accepted | import math
n, k = map(int,input().split())
a = list(map(int,input().split()))
print(math.ceil((n-1)/(k-1))) |
p03317 | s221365188 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
print(((n-2)//(k-1))+1) |
p03317 | s108485397 | Accepted | N,K=list(map(int, input().split()))
A=list(map(int, input().split()))
A.pop(1)
f=len(A)//(K-1)
if len(A)%(K-1)==0:
print(f)
else:
print(f+1) |
p03317 | s437182208 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
print(-(-(n - 1) // (k - 1))) |
p03317 | s393930819 | Accepted | import math
N, K = map(int,input().split())
list_ai = map(int,input().split())
print(math.ceil(1+(N-K)/(K-1)))
|
p03317 | s752642653 | Accepted | import math
N, K = map(int, input().split())
A = [int(i) for i in input().split()]
print(math.ceil((N-1)/(K-1))) |
p03317 | s573808885 | Accepted | 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(True):
n-=k
ans+=1
if n<=0:
break
else:
n+=1
print(ans) |
p03317 | s360911456 | Accepted | N,K = map(int,input().split())
a = list(map(int,input().split()))
cnt = 1
ans = K
while ans < N:
cnt += 1
ans += K-1
print(cnt) |
p03317 | s157360077 | Accepted | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = n - k
c = 0
if ans > 0:
c = math.ceil(ans / (k-1))
print(c+1) |
p03317 | s650427516 | Accepted | [N,K] = list(map(int,input().split()))
A = list(map(int,input().split()))
N = N-K
if N%(K-1)==0:
print(N//(K-1)+1)
else:
print(N//(K-1)+1+1)
|
p03317 | s871903491 | Accepted | N, K = map(int, input().split())
ans = 1 + ((N - K) + (K - 2)) // (K - 1)
print(ans)
|
p03317 | s998447081 | Accepted | n,k=map(int,input().split())
print((n+k-3)//(k-1)) |
p03317 | s942438409 | Accepted | n, k = list(map(int, input().split()))
a = input()
ans = []
left = a.index('1')
right = n -left -1
for i in range(k):
l = left-i
r = right-k+1+i
if l==0:
ans.append(right//k+1)
else:
ans.append((l-1)//(k-1)+1+1+(r-1)//(k-1)+1)
print(min(ans)) |
p03317 | s480594846 | 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 | s656994881 | Accepted | import math
n,k=map(int,input().split())
A=list(map(int,input().split()))
if n==k:
print(1)
else:
n-=k
print(1+math.ceil(n/(k-1))) |
p03317 | s417934200 | Accepted | N,K = map(int,input().split())
print(-((1-N)//(K-1))) |
p03317 | s479841997 | Accepted | N,K=map(int,input().strip().split())
A=list(map(int,input().strip().split()))
i=A.index(1)+1
if i<=K or i>=N-K:
ans=(N-K)//(K-1)+1 if (N-K)%(K-1)==0 else (N-K)//(K-1)+2
else:
for a in range(K):
if (i-a)%(K-1)==0 and (N-(i+(K-a)))%(K-1)==0:
b=0
else:
b=1
front=i//(K-1)
back=(N-(i+K))//(K-1)
ans=front+back+1+b
print(ans) |
p03317 | s253208007 | Accepted | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(math.ceil((n-1)/(k-1))) |
p03317 | s142985353 | Accepted | from math import ceil
n,k=map(int,input().split())
A=list(map(int,input().split()))
print(ceil((n-1)/(k-1))) |
p03317 | s122362719 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
x = (N-1)//(K-1)
if (N-1)%(K-1) != 0:
x += 1
print(x) |
p03317 | s789763871 | Accepted | import sys
import bisect
# from collections import Counter, deque, defaultdict
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
import itertools
# from operator import attrgetter, itemgetter
import math
# import numpy as np
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n, k = list(map(int, readline().split()))
a = list(map(int, readline().split()))
ans = 1
rem = max(n - k, 0)
ans += math.ceil(rem / (k - 1))
print(ans)
if __name__ == '__main__':
main()
|
p03317 | s298153447 | Accepted | from math import ceil
n,k = map(int, input().split())
a = list(map(int, input().split()))
m = a.index(1)
print(ceil((n-1)/(k-1))) |
p03317 | s882776846 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
count = 0
i = 1
for _ in range(N):
i = i + K - 1
if i < N:
count += 1
else:
count += 1
break
print(count)
|
p03317 | s067079572 | Accepted | 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:
nn = nn+1
print(nn) |
p03317 | s373882176 | Accepted | n, k = map(int, input().split())
A = tuple(map(int, input().split()))
count = -(-(n - 1) // (k-1))
print(count) |
p03317 | s836717294 | Accepted | n, k = map(int, input().split())
input()
print((n-2)//(k-1) + 1) |
p03317 | s126689984 | Accepted | def main():
N, K = map(int, input().split())
A = input()
if N == K:
print('1')
elif (N-1) % (K-1) == 0:
print((N-1)//(K-1))
else:
print((N-1)//(K-1) + 1)
main()
|
p03317 | s095102392 | Accepted | N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
print(-((1 - N) // (K - 1))) |
p03317 | s844943040 | Accepted |
def read_input():
n, k = map(int, input().split())
alist = map(int, input().split())
return n, k, alist
def submit():
n, k, alist = read_input()
if k >= n:
print(1)
return
n = n - k
if n % (k - 1):
print(n // (k - 1) + 2)
else:
print(n // (k - 1) + 1)
if __name__ == "__main__":
submit()
|
p03317 | s610272098 | Accepted | import math
N, K_ko = map(int, input().split())
A = input()
ans = math.ceil((N - K_ko) / (K_ko - 1)) + 1
print(ans) |
p03317 | s366350143 | Accepted | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
indx = a.index(min(a))
i = (indx-1) + (n-indx)
if i % (k-1) == 0:
print(int(i/(k-1)))
else:
print(int(i/(k-1))+1)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.