problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03317 | s846868466 | Accepted | n,k = map(int,input().split())
count = 1
n = n-k
while 0<n:
n = (n+1) - k
count = count + 1
print(count) |
p03317 | s693231737 | 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 | s535236291 | Accepted | import math
n,k=map(int,input().split())
a=[int(x) for x in input().split()]
print(math.ceil((n-1)/(k-1))) |
p03317 | s672190169 | Accepted | a,b = map(int,input().split())
c = input()
print((a+b-3)//(b-1)) |
p03317 | s916664363 | Accepted | import math
n, k = map(int,input().split())
input()
print(math.ceil((n-1)/(k-1)))
|
p03317 | s931087935 | Accepted | import math
n, k = map(int,input().split())
a = list(map(int,input().split()))
print(math.ceil((n-1)/(k-1))) |
p03317 | s880220232 | Accepted | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
print((n - 1 + k - 2) // (k - 1))
|
p03317 | s740440517 | Accepted | import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N,K = MI()
A = LI()
print((N+K-3)//(K-1))
|
p03317 | s677503577 | Accepted | import math
N, K = map(int, input().split())
A_list = [int(i) for i in input().split()]
print(math.ceil((N-1)/(K-1))) |
p03317 | s712340604 | Accepted | n,k = map(int,input().split())
print((n-1+(k-2))//(k-1)) |
p03317 | s763182722 | Accepted | import sys
import math
mod=10**9+7
inf=float("inf")
from math import sqrt
from collections import deque
from collections import Counter
input=lambda: sys.stdin.readline().strip()
sys.setrecursionlimit(11451419)
from functools import lru_cache
#メモ化再帰defの冒頭に毎回 @lru_cache(maxsize=10**10)
#引数にlistはだめ
#######ここまでテンプレ#######
#######ここから天ぷら########
n,k=map(int,input().split())
ans=1
now=k
while now<n:
ans+=1
now+=k-1
print(ans)
|
p03317 | s912873439 | Accepted | import math
n,k = map(int,input().split())
a = list(map(int,input().split()))
m = a.index(1)
ans = 9999999999
left = len(a[:m])
right = len(a[m:])
for i in range(k):
x = left - i
y = right - (k-i)
if x < 0 or y < 0:
continue
count = 1 + math.ceil(x/(k - 1)) + math.ceil(y/(k - 1))
ans = min(ans,count)
print(ans) |
p03317 | s226868266 | Accepted | import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy
def main():
n,k = map(int, input().split())
a_list = list(map(int, input().split()))
print(ceil((n-1)/(k-1)))
if __name__ == "__main__":
main() |
p03317 | s292519372 | Accepted | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, K = lr()
A = lr()
answer = -(-(N-1)//(K-1))
print(answer)
|
p03317 | s756743491 | Accepted | import math
N, K = list(map(int,input().split()))
A = list(map(int,input().split()))
print(math.ceil((N-1)/(K-1))) |
p03317 | s360044092 | Accepted | # coding: utf-8
from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
cnt = 1
for i in range(1, N):
if A[0] == A[i]:
cnt += 1
print(ceil((N-cnt)/(K-1))) |
p03317 | s322163631 | Accepted | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
K -= 1
a1_i = A.index(1)
left = (a1_i + K - 1) // K
right = (N - 1 - (left * K) + K - 1) // K
print(left + right)
if __name__ == '__main__':
main()
|
p03317 | s011751529 | Accepted | n, k = map(int, input().split())
a = [int(x) for x in input().split()]
minimum = 10**9
index = -1
for i in range(n):
if minimum > a[i]:
index = i
minimum = a[i]
ans = 1+(i-1)//(k-1)+(n-i-1)//(k-1)
print(ans) |
p03317 | s844970291 | Accepted | N, K = map(int, input().split())
A = [int(x) for x in input().split()]
print((N-1 + K-1 -1)//(K-1))
|
p03317 | s071097743 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n+10):
if k*i-(i-1)>=n:
print(i)
break
|
p03317 | s189387079 | Accepted | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
n -= 1
k -= 1
ans = (n + k - 1) // k
print(ans)
|
p03317 | s944052935 | Accepted | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from math import ceil
def main():
n, k, *a = map(int, read().split())
if n <= k:
print(1)
sys.exit()
else:
r = ceil((n - 1) / (k - 1))
print(r)
if __name__ == '__main__':
main() |
p03317 | s858191981 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
print(-(-(n-k)//(k-1))+1)
|
p03317 | s539330138 | Accepted | N, K = map(int, input().split())
A = [int(x) for x in input().split()]
print((N+K-3)//(K-1)) |
p03317 | s316227754 | Accepted | N, K = [int(i) for i in input().split()]
array = [int(i) for i in input().split()]
n = N - K
q, r = divmod(n, (K-1))
if r == 0:
print(q + 1)
else :
print(q + 2) |
p03317 | s012398472 | Accepted | import math
def read_ints():
return[int(i) for i in input().split()]
def main():
n, k = read_ints()
print(math.ceil((n - 1) / (k - 1)))
if __name__ == '__main__':
main() |
p03317 | s789392955 | Accepted | from math import ceil
n,k = map(int, input().split())
a = list(map(int, input().split()))
print(ceil((n-1)/(k-1))) |
p03317 | s892668345 | Accepted | import math
N, K = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
ans = math.ceil((N - 1) / (K - 1))
print(ans)
|
p03317 | s091420893 | 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 | s541876545 | Accepted | S = input().split(" ")
N = int(S[0])
K = int(S[1])
ARR = input().split(" ")
def calculate(n,k):
counts = 0
while n > 0:
if n == k:
counts += 1
break
n = n - (k - 1)
counts += 1
return counts
result = calculate(N,K)
print(result)
|
p03317 | s503956918 | 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 | s252963870 | Accepted | import math
n,k = map(int,input().split())
s = input()
print(math.ceil((n-1)/(k-1))) |
p03317 | s390902886 | Accepted | import math
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = 1
idx = A.index(1)
cnt = 1
right = idx
left = idx
while True:
for i in range(1, K):
right += 1
if(right < len(A)):
A[right] = 1
else:
left -= 1
if(0 <= left):
A[left] = 1
else:
print(cnt)
exit()
if(left <= 0 and len(A)-1 <= right):
print(cnt)
exit()
else:
cnt += 1
|
p03317 | s768073669 | Accepted | N,K=map(int,input().split())
alist=list(map(int,input().split()))
if (N-1)%(K-1)==0:
print((N-1)//(K-1))
else:
print((N-1)//(K-1)+1) |
p03317 | s425527758 | Accepted | n, k = map(int, input().split())
q = (n-1) // (k-1)
r = (n-1) % (k-1)
if r: print(q+1)
else: print(q) |
p03317 | s919632192 | Accepted | n,k = map(int, input().split())
x=(n-k)//(k-1)
y=(n-k)%(k-1)
print(x+1) if y==0 else print(x+2) |
p03317 | s153684496 | Accepted | n, k = map(int, input().split())
A = list(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 | s433495402 | Accepted | #101_C
N,K=map(int,input().split())
A=list(map(int,input().split()))
print(-(-(N-1)//(K-1))) |
p03317 | s632713324 | 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 -= ((K-1)-Right%(K-1))%(K-1)
Count += (Left%(K-1)!=0)+Left//(K-1)
print(Count) |
p03317 | s739147881 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
x=a.index(1)
#print(x)
if n==k:
print(1)
else:
#if x<=k-1 or x>=n-k:
if (n-k)%(k-1)==0:
ans=1+(n-k)//(k-1)
else:
ans=1+(n-k)//(k-1)+1
print(ans) |
p03317 | s565294907 | Accepted | # coding: utf-8
N,K=map(int,input().split())
A=list(map(int,input().split()))
ans=-(-(N-1)//(K-1))
print(ans)
|
p03317 | s435662919 | Accepted | n,k=map(int,input().split())
print((n-1+k-2)//(k-1)) |
p03317 | s213937094 | Accepted | n,k=map(int,input().split())
a=list(map(int, input().split()))
print(-(-(n-1)//(k-1))) |
p03317 | s936523417 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
n-=1
k-=1
if n%k==0: print(n//k)
else: print(n//k+1) |
p03317 | s313875687 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
print(1+(N-2)//(K-1)) |
p03317 | s896921313 | Accepted | n, k = map(int,input().split())
a = list(map(int,input().split()))
num = k
ans = 1
while num < n:
num += k-1
ans += 1
print(ans)
|
p03317 | s668916535 | Accepted | n,k=map(int,input().split())
A=list(map(int,input().split()))
import math
print(math.ceil((n-1)/(k-1))) |
p03317 | s339575594 | Accepted | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(math.ceil((n-1)/(k-1))) |
p03317 | s208210919 | Accepted | import math
n, k = map(int, input().split())
# a = list(map(int, input().split()))
n -= 1
k -= 1
ans = (n + k - 1) // k
print(ans)
|
p03317 | s302788114 | Accepted | import sys
input = sys.stdin.readline
def main():
N,K=map(int,input().split())
A=list(map(int,input().split()))
if (N-1)%(K-1):
print((N-1)//(K-1)+1)
else:
print((N-1)//(K-1))
if __name__=='__main__':
main() |
p03317 | s224366912 | Accepted | import math
total = 0
N,M = list(map(int,input().split()))
M = M-1
n_l = "".join(input().split())
A = n_l.find("1")
before = A
after = N-A-1
while before > 0:
before-=M
total +=1
if before < 0:
before = abs(before)
after -= before
while after > 0:
after-=M
total +=1
print(total) |
p03317 | s998338306 | Accepted | n,k=map(int,input().split())
lst=list(map(int,input().split()))
import math
p=len(lst)
p-=k
ans=1
ans+=math.ceil(p/(k-1))
print(ans) |
p03317 | s882967681 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
N -= K
K -= 1
ans = 1
ans += (N-1)//K + 1
print(ans)
|
p03317 | s037893378 | Accepted | def main():
from math import ceil
n, k, *a = map(int, open(0).read().split())
i = a.index(1)
ans = 1 + ceil((n - k) / (k - 1))
print(ans)
if __name__ == '__main__':
main()
|
p03317 | s867128219 | Accepted | import math
N,K = (int(x) for x in input().split())
A = list(map(int, input().split()))
if N == K:
print('1')
else:
print(math.ceil((N-1)/(K-1))) |
p03317 | s029366868 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
# 並び順を変えても普遍
ans = 0
i = 0
while True:
if i*(K-1) >= N-1:
break
ans += 1
i += 1
print(ans) |
p03317 | s860953748 | Accepted | import math
n,k = map(int,input().split())
a = list(map(int,input().split()))
print(math.ceil(((n-k)/(k-1)))+1) |
p03317 | s550042343 | Accepted | from math import ceil
n, k = map(int, input().split())
A = list(map(int, input().split()))
print( ceil((n-1)/(k-1)) ) |
p03317 | s877621732 | 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)
def resolve():
n, k = map(int, input().split())
a = list(map(int, input().split()))
v = math.ceil((n - k) / (k-1) + 1)
print(v)
resolve() |
p03317 | s338560386 | Accepted | import math
a,b = map(int,input().split())
l = sorted(list(map(int,input().split())))
ans = math.ceil((a-1) / (b-1))
print(ans) |
p03317 | s584115192 | Accepted | import sys
import math
N, K = map(int, input().split())
ans = math.ceil((N - 1) / (K-1))
print(ans) |
p03317 | s238868232 | Accepted | N, K = map(int,input().split())
Alist = list(map(int,input().split()))
print(-(-(N-1)//(K-1))) |
p03317 | s684780026 | Accepted | import math
N, K = map(int,input().split())
print(math.ceil((N-1)/(K-1))) |
p03317 | s439137085 | Accepted | from math import ceil
N,K = map(int,input().split())
A = list(map(int,input().split()))
#mini = A.index(1)
print(ceil((N-K)/(K-1))+1)
|
p03317 | s021064237 | Accepted | n, k = map(int, input().split())
lst = list(map(int, input().split()))
n -= 1
k -= 1
print(-(-n // k)) |
p03317 | s715343663 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
result=-(-(len(A)-1)//(K-1))
print(result)
|
p03317 | s130668152 | Accepted | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
if n <= k:
print(1)
else:
print(math.ceil((n - k) / (k - 1)) + 1)
|
p03317 | s084971320 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = 1 + (N - K) // (K - 1)
if (N - K) % (K - 1) != 0:
ans += 1
print(ans) |
p03317 | s203281861 | Accepted | def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
N -= K
if N <= 0:
return 1
return 1 + (N + K - 2) // (K - 1)
print(main())
|
p03317 | s327037267 | 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 | s190142972 | 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 | s066285602 | Accepted | ## n-1 + k-1 -1 = n+k-3が正しい
n,k = map(int,input().split( ))
print((n+k-3)//(k-1)) |
p03317 | s889241452 | Accepted | n,k = map(int,input().split())
input()
print(-((1-n)//(k-1))) |
p03317 | s483303417 | Accepted | 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)
|
p03317 | s712592692 | Accepted | import math
N, K = list(map(lambda k: int(k), input().split(" ")))
A = list(map(lambda a: int(a), input().split(" ")))
pos_of_1 = A.index(1)
if K >= pos_of_1 + 1 or N - K <= pos_of_1:
print(math.ceil((N - K) / (K - 1)) + 1)
else:
L = A[:pos_of_1 + 1]
R = A[pos_of_1:]
res = []
for i in range(1, K):
l = math.ceil((len(L) - i) / (K - 1)) + 1
r = math.ceil((len(R) - K - 1 + i) / (K - 1)) + 1
res.append(l + r - 1)
print(min(res)) |
p03317 | s904499483 | Accepted | import sys
import math
n,k=map(int,input().split())
alist=list(map(int,input().split()))
print(math.ceil((n-1)/(k-1))) |
p03317 | s240129029 | Accepted | import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
if K == N:
print(1)
else:
print(math.ceil((N - K) / (K - 1)) + 1) |
p03317 | s192219435 | Accepted | n, k = map(int, input().split())
print((n - 1) // (k - 1) + (0 if (n - 1) % (k - 1) == 0 else 1))
|
p03317 | s412241035 | Accepted | N, K = map(int,input().split())
AN = list(map(int,input().split()))
AN.sort()
N = N - AN.count(AN[0])
print( -(-N//(K-1)) )
|
p03317 | s910471756 | Accepted | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
print(ceil((N - 1) / (K - 1)))
|
p03317 | s059968348 | Accepted | import math
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n, k, *a = map(int, readline().split())
ans = math.ceil((n-1)/(k-1))
print(ans) |
p03317 | s626717882 | 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 | s800558918 | Accepted | import math
N, K = map(int, input().split())
print(math.ceil((N-1) /(K-1))) |
p03317 | s624558923 | Accepted | # -*- coding: utf-8 -*-
# モジュールのインポート
import math
# 標準入力を取得
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# 求解処理
ans = math.ceil((N - 1) / (K - 1))
# 結果出力
print(ans) |
p03317 | s385175145 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
num=min(a)
if a[0]==num:
n-=1
if a[-1]==num:
n-=1
n-=1
k-=1
print(-1*(n//-k))
|
p03317 | s514920650 | Accepted | 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()
if K == 2:
print(N - 1)
exit()
q, r = divmod(N, K - 1)
if r in (0, 1):
ans = q
else:
ans = q + 1
print(ans)
if __name__ == '__main__':
main()
|
p03317 | s816762442 | Accepted | n,k=map(int,input().split())
a=sorted(list(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 | s741846044 | Accepted | 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
print(count)
|
p03317 | s068251307 | Accepted | import math
n,k = map(int,input().split())
s = list(map(int,input().split()))
s.sort()
s.remove(s[0])
ans = math.ceil(len(s)/(k-1))
print(ans) |
p03317 | s518107023 | 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 | s206469445 | Accepted | from math import ceil
a,b = map(int,input().split())
c = input()
print(ceil((a-1)/(b-1))) |
p03317 | s292940780 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
count =0
first = True
while N >=K:
if first ==True:
count +=1
N-=K
first =False
else:
count+=1
N-=(K-1)
if N!=0:
count+=1
print(count)
|
p03317 | s275476695 | Accepted | n,k=map(int,input().split())
print((n+k-3)//(k-1))
|
p03317 | s438765618 | Accepted | import math
def main():
n,k = map(int, input().split())
A = list(map(int, input().split()))
print(math.ceil((n-1)/(k-1)))
if __name__ == '__main__':
main()
|
p03317 | s002979778 | Accepted | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n,k = LI()
a = LI()
print((n-2)//(k-1)+1)
|
p03317 | s790161732 | Accepted | import math
n,k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
print(math.ceil((n-1)/(k-1)))
|
p03317 | s562537443 | Accepted | import math
def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(math.ceil((n -1) / (k - 1)))
if __name__ == '__main__':
main() |
p03317 | s493004051 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
count = 0
while N > 1:
N -= K - 1
count += 1
print(count) |
p03317 | s305757185 | Accepted | import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
print(math.ceil((N-1)/(K-1))) |
p03317 | s123782105 | Accepted | import math
n,k=map(int,input().split())
print(math.ceil((n-k)/(k-1))+1) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.