problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03317 | s324065419 | Accepted | import math
n, k = map(int, input().split())
A = input()
print(math.ceil((n-1) / (k-1)))
|
p03317 | s771566221 | 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 | s653144381 | Accepted | import math
N, K = list(map(int,input().split()))
print(math.ceil((N - 1) / (K - 1))) |
p03317 | s975497987 | Accepted | n,k = map(int, input().split())
al = list(map(int, input().split()))
if n==k:
print(1)
exit()
x = 1+(n-k)//(k-1)
y = (n-k)%(k-1)
if y >0:
print(x+1)
else:
print(x) |
p03317 | s052245540 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
if N<=K:
print(1)
else:
i=K
a=1
while i<N:
i+=(K-1)
a+=1
print(a) |
p03317 | s403245117 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
s = k
i = 1
while n > s:
s += (k-1)
i += 1
print(i) |
p03317 | s752677655 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
#最終的にすべての値は1になる
if N==K:
print(1)
exit()
ans = 1
t = K
while(1):
if t >= N:
print(ans)
exit()
t += (K-1)
ans += 1
|
p03317 | s252311914 | Accepted | n,k = map(int,input().split())
A = list(map(int,input().split()))
print(-(-(n-1)//(k-1))) |
p03317 | s273582175 | Accepted | import math
n,k = map(int,input().split())
a = list(map(int,input().split()))
print(math.ceil((n-1) / (k-1))) |
p03317 | s241462018 | Accepted | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
print((N + K - 3) // ~-K)
if __name__ == "__main__":
main()
|
p03317 | s755593740 | Accepted | print(eval('0--~-'+input().replace(' ','//~-'))) |
p03317 | s133932812 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
idx = A.index(1)
ans = N
for k in range(K + 1):
L = idx - (K - k - 1)
R = (N - 1 - idx) - k
cntL = 0
cntR = 0
while L > 0:
cntL += 1
L -= K - 1
while R > 0:
cntR += 1
R -= K - 1
ans = min(ans, cntL + cntR + 1)
print(ans)
|
p03317 | s312506886 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
print(-(-(n - 1) // (k - 1))) |
p03317 | s590306260 | Accepted | n,k=list(map(int,input().split()))
print(-(-(n-k)//(k-1))+1) |
p03317 | s460681259 | Accepted | n, k = map(int, input().split())
aaa = list(map(int, input().split()))
cnt = 1
b = n - k
while b > 0:
b -= k - 1
cnt += 1
print(cnt) |
p03317 | s900832254 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
if (N-1)%(K-1) == 0:
print(int((N-1)/(K-1)))
else:
print(int((N-1)/(K-1)) + 1) |
p03317 | s980536344 | Accepted | def main():
n, k = map(int, input().split())
a_lst = list(map(int, input().split()))
tmp = k
count = 1
while tmp < n:
tmp += k - 1
count += 1
print(count)
if __name__ == '__main__':
main() |
p03317 | s972902914 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
import math
print(math.ceil((n-1)/(k-1))) |
p03317 | s293537294 | Accepted | import math
n,k = map(int,input().split())
a = list(map(int,input().split()))
print(math.ceil((n-1) / (k-1)))
# 1以外のn-1個のうち、1回で最大k-1個まで1にできる
|
p03317 | s071647362 | Accepted | import math
n,k = list(map(int, input().split()))
As = list(map(int,input().split()))
print(math.ceil((n-1)/(k-1))) |
p03317 | s526168533 | Accepted | k,n=map(int,input().split())
a=input()
i=0
while True:
if k<=n+(n-1)*i:print(i+1);break
i+=1 |
p03317 | s520014959 | Accepted | n,k=map(int,input().split())
a=[int(x) for x in input().split()]
ans=(n-1)//(k-1)
if (n-1)%(k-1)!=0:
ans+=1
print(ans)
|
p03317 | s549670032 | Accepted | #!python3
# input
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
def main():
s = N - K
k = K - 1
ans = 1
ans += s // k
if s % k != 0:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p03317 | s159769710 | Accepted | n, k = map(int, input().split())
s = input()
i = s.find("1")/2
ans = 0
# former part
while ans * (k-1) < i:
ans += 1
i = max(i, ans * (k-1))
# latter part
tmp = 0
while tmp * (k-1) + i < n-1:
tmp += 1
print(ans + tmp)
|
p03317 | s687010919 | Accepted | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9+7
MAX = 10**18
MIN = -10**18
n,k = map(int,input().split())
a = list(map(int,input().split()))
print(math.ceil((n-1)/(k-1))) |
p03317 | s275169647 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
count=1
n=n-k
while(n>0):
n=n-(k-1)
count+=1
print(count) |
p03317 | s281714387 | Accepted | n,k = map(int,input().split())
A = list(map(int,input().split()))
from math import ceil
def main():
print(ceil((n-1)/(k-1)))
if __name__ == "__main__":
main()
|
p03317 | s152943234 | Accepted | 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
counter = 0
while total > 0:
counter += 1
total -= k - 1
print(counter) |
p03317 | s979711357 | Accepted | # import bisect
# from collections import Counter, deque
# import copy
# from fractions import gcd
# from functools import reduce
# from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
# import math
# import numpy as np
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
def resolve():
N,K=map(int,input().split())
A=list(map(int,input().split()))
if N==K:
print(1)
else:
N=N-K
print(1+-(-N//(K-1)))
resolve() |
p03317 | s956371915 | Accepted | def main():
import sys
input = sys.stdin.readline
N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = 0
for x in range(1, N+1):
if (K-1)*x + 1 >= N:
ans = x
break
print(ans)
main() |
p03317 | s749131708 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
cnt = 1
length = K
while True:
if length >= N:
print(cnt)
break
length += K-1
cnt += 1 |
p03317 | s004252020 | Accepted | from math import ceil
def main():
length, section_range = map(int, input().split(" "))
numbers = list(map(int, input().split(" ")))
print(ceil((length - 1) / (section_range - 1)))
if __name__ == '__main__':
main() |
p03317 | s787991202 | Accepted | import math
n,k=map(int,input().split())
a=list(map(int,input().split()))
x=a.index(1)
print(math.ceil((n-1)/(k-1))) |
p03317 | s244570060 | Accepted | import math
s = list(map(int, input().split()))
n=s[0]
k=s[1]-1
s = list(map(int, input().split()))
ind=s.index(1)
# print(ind,n-ind-1,math.ceil(ind/k),math.ceil((n-ind-1)/k))
print(math.ceil((n-1)/(k))) |
p03317 | s460302043 | Accepted | from math import ceil
n,k=map(int,input().split())
a=list(map(int,input().split()))
print(ceil((n-1)/(k-1)))
|
p03317 | s152308522 | 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 | s653357255 | Accepted | n,k = map(int,input().split())
A = input()
ans = 1 + -(-(n-k)//(k-1))
print(ans) |
p03317 | s146139589 | 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 | s078947775 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
def solve(N,K,A):
ans = -(-(N-1)//(K-1))
return ans
print(solve(N,K,A)) |
p03317 | s705039586 | Accepted | # 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)
# 怒りの全探索
ans = 0
for j in range(0, N - 1, K):
ans += 1
print(ans)
|
p03317 | s298387184 | Accepted | n,k = map(int, input().split())
a = list(map(int, input().split()))
if (n==k):
print(1)
else:
print(1+(n-k-1)//(k-1)+1) |
p03317 | s943186746 | Accepted | 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 | s516332436 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
count =0
while True:
count += 1
n -= (k)
if n <= 0:
break
n += 1
print(count)
|
p03317 | s428463177 | Accepted | n, k = map(int, input().split())
print((n + k - 3) // (k - 1))
|
p03317 | s254259195 | Accepted | import math
N, K = map(int, input().split())
*A, = map(int, input().split())
print(math.ceil((N - 1) / (K - 1))) |
p03317 | s266772557 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
print((N+K-3)//(K-1)) |
p03317 | s474013155 | Accepted | #!/usr/bin/env python3
import sys
def main():
N, K = map(int,input().split())
a = list(map(int,input().split()))
answer = 0
for i in range(N):
if K + (i-1)*(K-1) >= N:
answer = i
break
print(answer)
return
if __name__ == '__main__':
main()
|
p03317 | s561318572 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
idx = a.index(1)
ans = 0
ans += -(-idx // (k-1))
ans += -(-(n - ans * (k-1) - 1) // (k-1))
print(ans)
|
p03317 | s352300460 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = ((N - 1) + (K - 1 - 1)) // (K - 1)
print(ans)
|
p03317 | s571150202 | 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 | s271425089 | Accepted | def resolve():
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(-(-(n-1)//(k-1)))
resolve() |
p03317 | s746156404 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
print((N+K-3)//(K-1)) |
p03317 | s835389688 | Accepted | import math
def resolve():
n, k = map(int, input().split())
a = list(map(int, input().split()))
i = a.index(min(a)) + 1
if k - 1 > i:
v = max(0, math.ceil((n - k - 2) / (k - 1))) + 1
else:
v = math.ceil(i / (k - 1)) + math.ceil((n - i - 1) / (k - 1))
print(v)
resolve() |
p03317 | s734135688 | Accepted | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
print(ceil((N - 1) / (K - 1)))
|
p03317 | s941583741 | Accepted | a=input().split();print(0--~-int(a[0])//~-int(a[1])) |
p03317 | s655526662 | Accepted | n,k=map(int,input().split())
k-=1
a=list(map(int, input().split()))
for i in range(n):
if a[i]==1:
index=i
print(-(-i//k)-(-(n-i-1)//k)) |
p03317 | s682182508 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
now = k
res = 1
while now < n:
now += k-1
res += 1
print(res) |
p03317 | s884353473 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
if n==k:
print(1)
exit()
i=n-k
ans=1
while i>0:
i=i-k+1
ans+=1
print(ans) |
p03317 | s959504916 | Accepted |
def solve():
N, K = map(int, input().split())
Ax = list(map(int, input().split()))
if N == K:
print(1)
exit()
N -= K
ans = 1
while N > 0:
N = N-(K-1)
ans += 1
print(ans)
# Solve
if __name__ == "__main__":
solve()
|
p03317 | s742461131 | Accepted | n,k=map(int,input().split())
k-=1
a=list(map(int, input().split()))
i=n-1
print(-(-i//k)-(-(n-i-1)//k))#pythonで切り上げの書き方 |
p03317 | s256093382 | Accepted | # coding: utf-8
# https://atcoder.jp/contests/abc101
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = 1
N -= K
if N % (K-1) == 0:
ans += N // (K-1)
else:
ans += N // (K-1) + 1
return ans
print(main())
|
p03317 | s536940709 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
ans=1
X=N-K
while X>0:
X-=K-1
ans+=1
print(ans)
|
p03317 | s018982954 | Accepted | import math
def main():
N, K = map(int, input().split())
input()
print(math.ceil((N-K)/(K-1) + 1.0))
main() |
p03317 | s027574903 | Accepted | n,m=map(int,input().split())
l=list(map(int,input().split()))
print(-(-(len(l)-m)//(m-1))+1) |
p03317 | s015383508 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
print((N-1-1)//(K-1)+1)
|
p03317 | s573255287 | Accepted | import math
n,k = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
tmp = a.index(1)
ans += math.ceil(tmp/(k-1))
tmp = ans * (k-1) +1
ans += math.ceil((n-tmp)/(k-1))
print(ans) |
p03317 | s077117808 | Accepted | import math
n,k=[int(i) for i in input().split()]
a=[int(i) for i in input().split()]
def get_1_index(a):
for i,j in enumerate(a):
if j==1:
return i
index=get_1_index(a)
mae=index
usiro=n-index-1
# print(math.ceil(mae/(k-1))+math.ceil(usiro/(k-1)))
print(math.ceil((n-1)/(k-1))) |
p03317 | s030417009 | Accepted | N,K = map(int, input().split())
A = [int(i) for i in input().split()]
if N == K:
print(1)
else:
cnt = 1
N -= K
while N > 0:
cnt += 1
N -= K
N += 1
print(cnt) |
p03317 | s266036131 | Accepted | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(math.ceil( (n-k)/(k-1) )+1) |
p03317 | s881415540 | Accepted | n, k = map(int, input().split())
A = list(map(int, input().split()))
min_a = A.index(min(A))
left = min_a
right = n - min_a - 1
min_ = min(left, right)
max_ = max(left, right)
t = 0
min_ = min_ - k
t +=1
temp = 0
if min_ > 0:
if min_ % (k - 1) != 0:
temp = min_ // (k - 1)
else:
temp = min_ // (k - 1) + 1
min_ -= temp * (k - 1)
t += temp
max_ = max_ + min_ + 1
if max_ % (k - 1) == 0:
t += max_ // (k - 1)
else:
t += max_ // (k - 1) + 1
print(t) |
p03317 | s110296542 | Accepted | n,k = map(int,input().split())
_ = input()
print(1 + -(-(n-k)//(k-1))) |
p03317 | s678772018 | Accepted | n, k = map(int, input().split())
print(1 + (n - 2) // (k - 1)) |
p03317 | s436548965 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
b=min(A)
p=0
for i in range(N):
if A[i]!=b:
p+=1
if p%(K-1)==0:
print(p//(K-1))
else:
print(p//(K-1)+1) |
p03317 | s639315386 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
ans = (N-1)//(K-1)
if (N-1)%(K-1)!=0:
ans+=1
print(ans) |
p03317 | s237245530 | Accepted | N, K = map(int, input().split())
print((N-2)//(K-1)+1)
|
p03317 | s806011943 | Accepted | n,k,*a=map(int,open(0).read().split())
print((n+k-3)//(k-1)) |
p03317 | s068761335 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = 0 - -(n - 1)//(k - 1)
print(ans) |
p03317 | s788607284 | Accepted | N, K = map(int, input().split())
print(((N - 1) + (K - 2)) // (K - 1)) |
p03317 | s263301076 | Accepted | N,K = (int(X) for X in input().split())
A = [int(X) for X in input().split()]
Left = A.index(1)
Right = (N-1)-Left
Count = (Right%(K-1)!=0)+Right//(K-1)
Left -= (Right%(K-1)!=0)*((K-1)-Right%(K-1))
Count += (Left%(K-1)!=0)+Left//(K-1)
print(Count) |
p03317 | s455449676 | Accepted | n, k = map(int, input().split())
m = n - 1
l = k - 1
if m % l == 0:
print(m // l)
else:
print(m // l + 1) |
p03317 | s609865425 | Accepted | n, k = map(int, input().split())
As = list(map(int, input().split()))
a=n-1
b=k-1
if a % b == 0:
print(a//b)
else:
print((a//b) + 1) |
p03317 | s773695144 | Accepted | import math
n, k = map(int, input().split())
[int(i) for i in input().split()]
print(math.ceil((n-k) / (k - 1) + 1)) |
p03317 | s941755551 | Accepted | def main():
n, k = map(int, input().split())
ans = 1 + (n - k) // (k - 1) + ((n - k) % (k - 1) != 0)
print(ans)
if __name__ == '__main__':
main()
|
p03317 | s417567538 | Accepted | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
i = a.index(1)
s = n
for j in range(i-k+1, i+k):
if j < 0:
continue
elif j >= n:
continue
else:
l = j
u = (n-1-j)
t = (l+k-2) // (k-1) + (u+k-2) // (k-1)
#print(t)
s = min(s, t)
print(s) |
p03317 | s266003007 | Accepted | import math
import itertools
#n = int(input())
#n, d = list(input().split())
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
point = 0
i = 0
while N > point:
i+=1
if i==1:
point+=K
else:
point+=(K-1)
print(i)
|
p03317 | s577930459 | Accepted | # -*- coding: utf-8 -*-
"""
Created on Fri Sep 18 09:56:28 2020
@author: liang
"""
from math import ceil
N, K = map(int, input().split())
A = [int(x) for x in input().split()]
ans = ceil((N-K)/(K-1)) + 1
print(ans) |
p03317 | s976954507 | Accepted | print(eval('0--~-'+''.join([i if i!=' ' else '//~-' for i in input()]))) |
p03317 | s676948744 | Accepted | import math
N, K = map(int, input().split())
a = list(map(int, input().split()))
M = math.ceil((N-1)/(K-1))
print(M) |
p03317 | s422974983 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
for i in range(100000):
if N<=K+i*(K-1) :
print(i+1)
exit() |
p03317 | s740543691 | Accepted | n, k = map(int, input().split())
*a, = map(int, input().split())
mar = k - 1 # max replacible count
ret = 1 + (n - k + mar - 1) // mar
print(ret)
# 左端から長さKの区間をのりしろ1で貼り続ける
# 最小値1を含む要素に重なる区間から順に操作を始めれば可能
# 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 | s906906416 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = 1
n -= k
k -= 1
if n % k == 0:
ans += n // k
else:
ans += n // k + 1
print(ans)
|
p03317 | s145513629 | 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 | s253797527 | Accepted | import sys
def resolve():
N, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
res = 0
covered = 0
while True:
if covered >= N:
break
if res == 0:
covered = K
else:
covered += K - 1
res += 1
print(res)
if '__main__' == __name__:
resolve() |
p03317 | s703520667 | Accepted | 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 | s798349986 | Accepted | import math as m
n,k=map(int,input().split())
a=list(map(int,input().split()))
print(m.ceil((n-1)/(k-1))) |
p03317 | s910152355 | Accepted | import math
N,K=map(int,input().split())
print(math.ceil((N-1)/(K-1))) |
p03317 | s581513573 | Accepted | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
n, k = map(int, readline().split())
print((((n-k)+(k-1)-1)//(k-1))+1)
if __name__ == '__main__':
main()
|
p03317 | s558246017 | Accepted | import math
a,b = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
ans = 1 + int(math.ceil((a-b)/(b-1)))
print(ans) |
p03317 | s148701054 | Accepted | N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = -(-(N-1) // (K-1))
print(ans) |
p03317 | s826653825 | Accepted | n,k,*_=map(int,open(0).read().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.