input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
while 1:
n=list(input())
if n==["0"]*4: break
elif n[0]==n[1]==n[2]==n[3]:
print("NA")
continue
count=0
while 1:
if n==["6","1","7","4"]:
print(count)
break
l=int("".join(map(str,sorted(n)[::-1])))
s=int("".join(map(str,sorted(n)[n.count("0"):])))
n=list(str(l-s))
n=["0"]*(4-len(n... | while 1:
n=list(input())
if n==["0"]*4: break
elif n[0]==n[1]==n[2]==n[3]:
print("NA")
continue
count=0
while 1:
if n==["6","1","7","4"]:
print(count)
break
n=sorted(n)
l=int("".join(map(str,n[::-1])))
s=int("".join(map(str,n[n.count("0"):])))
n=list(str(l-s))
n=["0"]*(4-len(n)... | p00254 |
while 1:
n=list(input())
if n==["0"]*4: break
elif n[0]==n[1]==n[2]==n[3]:
print("NA")
continue
count=0
while 1:
if n==["6","1","7","4"]:
print(count)
break
n=sorted(n)
l=int("".join(map(str,n[::-1])))
s=int("".join(map(str,n[n.count("0"):])))
n=list(str(l-s))
n=["0"]*(4-len(n)... | while 1:
n=input()
if n=="0000": break
if int(n)%1111==0:
print("NA")
continue
ans = 0
while n!="6174":
n="".join(sorted(n))
n=str(int(n[::-1])-int(n)).zfill(4)
ans+=1
print(ans) | p00254 |
def main():
X, Y = list(map(int, input().split()))
tmp = X
cnt = 1
# print(tmp)
while tmp * 2 <= Y:
cnt += 1
tmp = 2 * tmp
# print(tmp)
print(cnt)
if __name__ == "__main__":
main() | X, Y = list(map(int, input().split()))
t = X
cnt = 0
while t <= Y:
cnt += 1
t *= 2
print(cnt) | p03479 |
X, Y = list(map(int, input().split()))
ans = 1
while 2 ** ans <= Y // X:
ans += 1
print(ans)
| X, Y = list(map(int, input().split()))
ans = 0
tgt = X
while tgt <= Y:
tgt *= 2
ans += 1
print(ans)
| p03479 |
def main():
x, y = list(map(int, input().split()))
r = 1
a = x
while True:
a *= 2
if a <= y:
r += 1
else:
break
print(r)
if __name__ == '__main__':
main()
| def main():
x, y = list(map(int, input().split()))
cnt = 0
while x <= y:
cnt += 1
x *= 2
print(cnt)
if __name__ == '__main__':
main()
| p03479 |
from math import log2
x, y = list(map(int, input().split()))
k = int(log2(y)-log2(x)+1)
n =x*2**(k-1)
if n <= y:
if 2*n <= y:
print((k+1))
else:
print(k)
else:
print((k-1))
| x, y = list(map(int, input().split()))
for i in range(1, 100):
n = x*2**(i-1)
if n <= y:
ans = i
else:
print(ans)
exit()
| p03479 |
x, y = list(map(int, input().split()))
a = []
t = x
while True:
if t > y:
break
a.append(t)
t *= 2
print((len(a))) | x, y = list(map(int, input().split()))
total = 1
now = x
while now*2 <= y:
now *= 2
total += 1
print(total) | p03479 |
#ABC083
x,y=list(map(int,input().split()))
cnt=1
now=x
while True:
now*=2
if now>y:break
cnt+=1
print(cnt) | x,y=list(map(int,input().split()))
ans=1
now=x
while True:
if now*2>y:
break
else:
now*=2
ans+=1
print(ans) | p03479 |
# coding: utf-8
# input
x, y = list(map(int, input().split()))
# main
count = 0
while x <= y:
count += 1
x *= 2
print(count) | # input
x, y = list(map(int, input().split()))
# main
c = 0
while x <= y:
x *= 2
c += 1
print(c) | p03479 |
import sys
sys.setrecursionlimit(1000000)
from operator import itemgetter
X,Y = list(map(int, input().split()))
cnt = 1
temp = X
for i in range(100):
if temp * 2 <= Y:
cnt += 1
temp = temp * 2
else:
break
print(cnt) | x,y = list(map(int,input().split()))
cnt = x
ans = 1
while cnt * 2 <= y:
ans += 1
cnt = cnt * 2
print(ans) | p03479 |
import sys
import math
x, y = [int(x) for x in sys.stdin.readline().split()]
count = 0
while x <= y:
count += 1
x *= 2
print(count)
| import sys
x, y = list(map(int, sys.stdin.readline().split()))
def main():
a = x
cnt = 0
while a <= y:
cnt += 1
a *= 2
return cnt
if __name__ == '__main__':
ans = main()
print(ans) | p03479 |
x, y = list(map(int, input().split()))
result = 0
while x <= y:
result += 1
x *= 2
print(result)
| x, y = list(map(int, input().split()))
print(((y // x).bit_length())) | p03479 |
X,Y = list(map(int,input().split()))
def solve(now,y,ans=1):
if now*2 > y:
return ans
else:
return solve(now*2,y,ans+1)
print((solve(X,Y))) | X,Y = list(map(int,input().split()))
def solve(now,y,ans=0):
ans = 0
while now <= y:
ans += 1
now *= 2
return ans
print((solve(X,Y))) | p03479 |
X, Y = list(map(int, input().split()))
ans = 1
while True:
if 2*X <= Y:
X *= 2
ans += 1
else:
break
print(ans) | X, Y = list(map(int, input().split()))
print((len(bin(Y // X)[2:]))) | p03479 |
X,Y=[int(i) for i in input().split()]
lenCount = 0
while X <= Y:
X *= 2
lenCount += 1
print(lenCount) | X,Y = list(map(int,input().split()))
res = 0
while X <= Y:
X *= 2
res += 1
print(res) | p03479 |
X, Y = list(map(int, input().split()))
ans = 1
for i in range(10**18):
X *= 2
if X <= Y:
ans += 1
else:
break
print(ans) | X, Y = list(map(int, input().split()))
ans = 1
for i in range(10**5):
X *= 2
if X <= Y:
ans += 1
else:
break
print(ans)
| p03479 |
# -*- coding: utf-8 -*-
x,y = list(map(int,input().split()))
under = x
up = 0
ans = 0
for i in range(90):
temp = x * 2 ** i
if temp > y and up == 0:
up = temp / 2
ans = i
break
print(ans)
| # -*- coding: utf-8 -*-
x,y = list(map(int,input().split()))
num = x
cnt = 0
while x <= y:
x *= 2
cnt += 1
print(cnt)
| p03479 |
X, Y = list(map(int, input().split()))
t = X
ans = 0
while t <= Y:
t *= 2
ans += 1
print(ans) | X, Y = list(map(int,input().split()))
ans = 0
while X <= Y:
X *= 2
ans += 1
print(ans)
| p03479 |
x,y=list(map(int,input().split()))
ans_li=[]
for i in range(1000):
if x*(2**i)<=y:
ans_li.append(i+1)
print((max(ans_li))) | x,y=list(map(int,input().split()))
ans=0
while x<=y:
x*=2
ans+=1
print(ans) | p03479 |
x,y = list(map(int,input().split()))
import copy
x1=copy.deepcopy(x)
y1=copy.deepcopy(y)
count=0
while(y1>=x1):
y1//=2
count+=1
print(count)
| X, Y = list(map(int,input().split()))
A = X
ans = 1
while(1):
if X*2 > Y:
break
X *= 2
ans += 1
print(ans) | p03479 |
x,y=list(map(int,input().split()))
i=1
while True:
x*=2
if x>y:
break
i+=1
print(i) | x,y=list(map(int,input().split()))
a=0
while x<=y:
x*=2
a+=1
print(a) | p03479 |
X,Y = list(map(int,input().split()))
print((len(bin(Y//X))-2)) | X,Y = list(map(int,input().split()))
ans = 0
while X<=Y:
ans+=1
X*=2
print(ans) | p03479 |
# vim: set fileencoding=utf-8:
"""
X,Yの区間は[1, pow(10,18)]であり、全探索すると日が暮れる。
厳密には、区間[X, Y]のすべてを検証する必要はないはずで、
[X, 2*X]でいいはずである。たぶん。
"""
def main():
X, Y = list(map(int, input().split()))
ans = 0
temp = 0
X2 = 2 * X
ct = 0
for i, _ in enumerate(range(X2), X):
ct += 1
... | #!/usr/bin/python3
# vim: set fileencoding=utf-8:
import sys
input = sys.stdin.readline
"""
H = int(input())
h = [int(ele) for ele in input().split()]
h = [0] + h
"""
def main():
A = []
X, Y = list(map(int, input().split()))
n = X
A.append(n)
while n * 2 <= Y:
n = n*2
... | p03479 |
x, y = list(map(int, input().split()))
count = 0
z = x
while True:
z *= 2
count += 1
if z > y:
break
print(count) | x, y = list(map(int, input().split()))
current = x
ans = 1
while True:
current *= 2
if current > y:
break
ans += 1
print(ans) | p03479 |
x, y = list(map(int, input().split()))
ans = 1
while x <= y:
x *= 2
if x > y:
break
ans += 1
print(ans) | X, Y = list(map(int, input().split()))
ans = 1
while X <= Y:
X *= 2
if X > Y:
break
ans += 1
print(ans) | p03479 |
X, Y = list(map(int,input().split()))
ans = 0
while X <= Y:
X *= 2
ans += 1
print(ans) | X, Y = list(map(int,input().split()))
cnt = 0
while X <= Y:
X *= 2
cnt += 1
print(cnt) | p03479 |
def c_MultipleGift(X, Y):
ans = 0
while X <= Y:
X *= 2
ans += 1
return ans
X,Y = [int(i) for i in input().split()]
print((c_MultipleGift(X, Y))) | def c_multiple_gift(X, Y):
ans = 1 # A_1=Xとなる長さ1の数列が必ず作れる
while X <= Y:
X *= 2 # A_{i+1} = 2A_iとする
ans += 1
ans -= 1 # whileの最後でYを超える要素を1つ入れたので除く
return ans
X,Y = [int(i) for i in input().split()]
print((c_multiple_gift(X, Y))) | p03479 |
X, Y = list(map(int, input().split()))
ans = 0
tmp = X
while tmp <= Y:
tmp *= 2
ans += 1
print(ans)
| X, Y = list(map(int, input().split()))
cnt = 0
while X <= Y:
cnt += 1
X *= 2
print(cnt)
| p03479 |
n=int(input())
a=sorted(map(int,input().split()))
a.reverse()
i=0
while i<n and a[i]>=i+1:i+=1
m1=a[i-1]-i
j=i
while j<n and a[j]>=i:j+=1
m2=j-i
print('First' if (m1%2 or m2%2) else 'Second')
| n=int(input())
a=sorted(map(int,input().split()))
a.reverse()
i=0
while i<n and a[i]>=i+1:i+=1
j=i
while j<n and a[j]>=i:j+=1
print('First' if (a[i-1]-i)%2 or (j-i)%2 else 'Second') | p04037 |
N = int(eval(input()))
b = list(map(int, input().split()))
a = []
for i in range(N-1):
if(i == 0):
a.append(b[i])
else:
if(b[i] > b[i-1]):
a.append(b[i-1])
else:
a.append(b[i])
if(i == N-2):
a.append(b[i])
print((sum(a))) | N = int(eval(input()))
b = list(map(int, input().split()))
a = []
a.append(b[0])
for i in range(1, N-1):
a.append(min(b[i], b[i-1]))
a.append(b[N-2])
print((sum(a))) | p02917 |
n = int(eval(input()))
b = list(map(int, input().split()))
a = [0]*n
a[0] = b[0]
a[-1] = b[-1]
for i in range(1, n-1):
a[i] = min(b[i-1], b[i])
print((sum(a))) | n = int(eval(input()))
b = list(map(int, input().split()))
ans = [0]*n
ans[0] = b[0]
ans[-1] = b[-1]
for i in range(1,n-1):
ans[i] = min(b[i-1],b[i])
print((sum(ans))) | p02917 |
n=int(eval(input()))
bl=list(map(int,input().split()))
al=[0 for i in range(n)]
al[n-1]=bl[n-2]
for i in range(n-2,-1,-1):
if al[i+1]>bl[i]:
al[i+1]=bl[i]
al[i]=bl[i]
print((sum(al)))
| n=int(eval(input()))
#a,b,x=map(int,input().split())
bl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
al=[0 for i in range(n)]
al[n-1]=bl[-1]
for i in range(n-2,-1,-1):
al[i]=bl[i]
if al[i+1]>bl[i]:
al[i+1]=bl[i]
print((sum(al)))
| p02917 |
n = int(eval(input()))
b = list(map(int, input().split()))
a = [b[0]]
for i in range(n-1):
if i < n-2:
a.append(b[i] if b[i+1] >= b[i] else b[i+1])
else:
a.append(b[i])
while b[i] < max(a[i], a[i+1]):
a[i+1] += 1
print((sum(a)))
| n = int(eval(input()))
b = list(map(int, input().split()))
a = [b[0]]
for i in range(n-1):
if i < n-2:
a.append(b[i] if b[i+1] >= b[i] else b[i+1])
else:
a.append(b[i])
print((sum(a)))
| p02917 |
n=int(eval(input()))
b=list(map(int,input().split()))
a=[0]*n
a[0]=b[0]
for i in range(1,n-1):
a[i]=min(b[i],b[i-1])
print((sum(a)+b[-1])) | n=int(eval(input()))
b=list(map(int,input().split()))
a=[0]*n
a[0]=b[0]
a[-1]=b[-1]
for i in range(1,n-1):
a[i]=min(b[i],b[i-1])
print((sum(a))) | p02917 |
N = int(eval(input()))
B = list(map(int, input().split()))
A=[10**6]*N
for i in range(N-1):
if A[i] >= B[i]:
A[i] = B[i]
if A[i+1] >= B[i]:
A[i+1] = B[i]
print((sum(A))) | N=int(eval(input()))
B=list(map(int,input().split()))
A=[0]*N
A[0]=B[0]
A[1]=B[0]
for i in range(1,N-1):
A[i+1]=B[i]
if A[i] > B[i]:
A[i] = B[i]
print((sum(A))) | p02917 |
n = int(eval(input()))
b = list(map(int, input().split()))
a = [0 for k in range(n)]
a[0] = b[0]
a[n-1] = b[n-2]
for i in range(1, n-1):
j=0
while not j == min(b[i], b[i-1]):
j += 1
a[i]=j
ans = 0
for x in range(n):
ans += a[x]
print(ans) | n = int(eval(input()))
b = list(map(int, input().split()))
a = [0 for k in range(n)]
a[0] = b[0]
a[n-1] = b[n-2]
for i in range(1, n-1):
a[i]=min(b[i], b[i-1])
ans = 0
for x in range(n):
ans += a[x]
print(ans) | p02917 |
n=int(eval(input()))
B=list(map(int,input().split()))
ans=[B[0],B[n-2]]
for i in range(n-2):
ans.append(min(B[i],B[i+1]))
print((sum(ans))) | n=int(eval(input()))
B=list(map(int,input().split()))
ans = B[0]+B[n-2]
for i in range(n-2):
ans += min(B[i],B[i+1])
print(ans) | p02917 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
B = list(map(int, input().split()))
C = [None] * N
C[0] = B[0]
C[-1] = B[-1]
for i in range(1, N - 1):
C[i] = min(B[i - 1], B[i])
print((sum(C))) | N = int(eval(input()))
B = list(map(int, input().split()))
A = [None] * N
A[0] = B[0]
A[-1] = B[-1]
for i in range(1, len(B)):
A[i] = min(B[i], B[i - 1])
print((sum(A)))
| p02917 |
N = int(eval(input()))
B = [int(i) for i in input().split()]
A = [0 for i in range(N)]
A[0] = B[0]
for i in range(N-1):
A[i] = min(A[i], B[i])
A[i+1] = B[i]
print((sum(A))) | n = int(eval(input()))
bl = list(map(int, input().split()))
ans = bl[0]+bl[-1]
for i in range(n-2):
ans+=min(bl[i], bl[i+1])
print(ans)
| p02917 |
N = int(eval(input()))
if N == 2:
ans = 2 * int(eval(input()))
else:
B = list(map(int, input().split()))
ans = B[0] + B[N-2]
for i in range(1, N-1):
ans += min(B[i], B[i-1])
print(ans) | N = int(eval(input()))
B = list(map(int, input().split()))
ans = B[0] + B[N-2]
for i in range(1, N-1):
ans += min(B[i], B[i-1])
print(ans) | p02917 |
n = int(eval(input()))
B = list(map(int, input().split()))
a = [-1] * n
for i, b in enumerate(B):
if a[i] > B[i]:
a[i] = b
a[i+1] = b
elif a[i] != -1:
a[i+1] = b
elif a[i] == -1:
a[i] = b
a[i+1] = b
print((sum(a))) | n = int(eval(input()))
B = list(map(int, input().split()))
a = [0] * n
a[0] = B[0]
a[-1] = B[-1]
for i in range(1, n-1):
a[i] = min(B[i-1], B[i])
print((sum(a)))
| p02917 |
_,b=open(0);*b,=list(map(int,b.split()));print((b[0]+sum(min(t)for t in zip(b,b[1:]))+b[-1])) | _,b=open(0);*b,=list(map(int,b.split()));print((b[0]+sum(map(min,list(zip(b,b[1:]))))+b[-1])) | p02917 |
def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
b = list(map(int, input().rstrip('\n').split()))
a = [10 ** 10] * n
for i in range(n-1):
a[i] = min(b[i], a[i])
a[i+1] = min(b[i], a[i+1])
print((sum(a)))
if __name__ == '__main__':... | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
b = list(map(int, readline().split()))
a = [0] * n
for i in range(n):
if i == 0:
a[i] = b[i]
elif i == n - 1:
a[i] = b[i-1]
else:
... | p02917 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
from collections import deque
def getN():
return int(eval(input()))
def getList():
return list(map(int, input().split()))
import math
n = getN()
INF = 100000000000
nums = [INF] + getList() + [INF]
ans = 0
for i, j in zip(nums, n... | import sys
from collections import defaultdict, deque
import math
# import copy
# from bisect import bisect_left, bisect_right
# import heapq
# sys.setrecursionlimit(1000000)
# input aliases
input = sys.stdin.readline
getS = lambda: input().strip()
getN = lambda: int(eval(input()))
getList = lambda: ... | p02917 |
import sys
import math
def input():
return sys.stdin.readline().strip()
def iinput():
return int(eval(input()))
def finput():
return float(eval(input()))
def tinput():
return input().split()
def rinput():
return list(map(int, tinput()))
def rlinput():
return list(rinput(... | A = []
n = int(eval(input()))
B = [1000000] +list(map(int, input().split()))+[1000000]
#print(B)
for i in range(n):
A += [min(B[i],B[i+1])]
print((sum(A)))
| p02917 |
# C
n = int(eval(input()))
b = list(map(int, input().split()))
a = [0 for i in range(n+1)]
a[0] = b[0]
for i in range(n-2):
a.append(min(b[i], b[i+1]))
a.append(b[-1])
print((sum(a))) | n = int(eval(input()))
b = list(map(int, input().split()))
a = [0 for i in range(n+1)]
a[0] = b[0]
for i in range(n-2):
a.append(min(b[i], b[i+1]))
a.append(b[-1])
print((sum(a))) | p02917 |
N = int(eval(input()))
B = [int(x) for x in input().split()]
A = [0]*N
A[0] = B[0]
A[N-1] = B[N-2]
for T in range(0,N-2):
A[T+1] = min(B[T],B[T+1])
print((sum(A))) | N = int(eval(input()))
B = [int(x) for x in input().split()]
Sum = B[0]+B[N-2]
for T in range(0,N-2):
Sum += min(B[T],B[T+1])
print(Sum) | p02917 |
import math
while True:
try:
v = eval(input())
t = v/9.8
y = v/2*t
n = math.ceil(y/5.0)+1
print(int(n))
except:
break | import math,sys
for e in sys.stdin:
v=float(e[:-1])
t=v/9.8
y=v/2*t
n=int(math.ceil(y/5))+1
print(n) | p00024 |
from array import array;
while True:
n = int(input())
if n == 0:
break
m = int(input())
s = input()
cache = array('i', (0 for x in range(m)))
for i in range(len(s) - 2):
if s[i:i+3] == 'IOI':
cache[i + 2] = cache[i] + 1
print(len([x for x in cac... | from array import array;
while True:
n = int(input())
if n == 0:
break
m = int(input())
s = input()
cache = array('i', (0 for x in range(m)))
for i in range(len(s) - 2):
if s[i:i+3] == 'IOI':
cache[i + 2] = cache[i] + 1
print(sum(1 for x in cach... | p00461 |
while 1:
n=eval(input())
if n==0:break
m=eval(input())
a=input()
P="I"+"OI"*n
l=1+2*n
c=0
for i in range(m-l+1):
for k in range(l):
if a[i+k]!=P[k]:
break
else:c+=1
print(c)
| while 1:
n=int(input())
if n==0:break
m=int(input())
a=input()
P="I"+"OI"*n
l=1+2*n
c=0
for i in range(m-l+1):
if a[i:i+l]==P:c+=1
print(c) | p00461 |
while True:
n = eval(input())
if n == 0:
break
m = eval(input())
s = input()
cur,score = 0,0
for c in s:
if cur <= 2*n:
if cur % 2 == 0:
cur = cur+1 if c=="I" else 0
else:
... | while True:
n = eval(input())
if n == 0:
break
m = eval(input())
s = input()
graph = []
for i in range(n):
graph.append({"I":2*i+1,"O":0,"score":0})
graph.append({"I":1,"O":2*(i+1),"score":0})
graph.append({"I":2*n+1,"... | p00461 |
# AOJ 0538: IOIOI
# Python3 2018.7.1 bal4u
while True:
n = int(eval(input()))
if n == 0: break
m = int(eval(input()))
s = input().strip()
ans = cnt = i = 0
while i < m:
if i+1 < m and s[i:i+2] == 'IO':
cnt += 1
i += 1
elif cnt > 0:
if s[i] == 'O': cnt -= 1
if cnt >= n: ans += cnt-n... | # AOJ 0538: IOIOI
# Python3 2018.7.1 bal4u
import sys
from sys import stdin
input = stdin.readline
while True:
n = int(eval(input()))
if n == 0: break
m = int(eval(input()))
s = input().strip()
ans = cnt = i = 0
while i < m:
if i+1 < m and s[i:i+2] == 'IO':
cnt += 1
i += 1
elif cnt > ... | p00461 |
#encoding=utf-8
while True:
x, num = list(map(int,input().split()))
if x == num == 0:
break
count = 0
for a in range(10):
if num == a and x == 1:
count += 1
if x > 1:
for b in range(a + 1,10):
if num == a+b and x == 2:
count += 1
if x > 2:
for c in range(b + 1,10):
... | import itertools as iter
while True:
count = 0
x,y = list(map(int,input().split()))
if x == y == 0: break
for element in iter.combinations(list(range(10)),x):
if sum(element) == y:
count += 1
print(count) | p00030 |
def f2(cnt, n, ci):
if n < ci:
return 0
elif n == ci and cnt > 1:
return 0
elif n == ci and cnt == 1:
return 1
else:
v = f2(cnt - 1, n - ci, ci + 1)
v += f2(cnt, n, ci + 1)
return v
while 1:
n, s = list(map(int, input().split()))
i... | def f2(cnt, n, ci):
if ci >= 10 or n > 45:
return 0
elif n < ci:
return 0
elif n == ci and cnt > 1:
return 0
elif n == ci and cnt == 1:
return 1
else:
v = f2(cnt - 1, n - ci, ci + 1)
v += f2(cnt, n, ci + 1)
return v
while 1:
... | p00030 |
from collections import deque
class Bt(object):
def __init__(self):
self.used = [False] * 10 # 0-9????????°???????????¨?????????????????????????????°
self.answers = [] # ?????¶???????????????????????????
self.Q = deque() # ????????§???????????¢??????????????°???????¨???¶??¨
... | from collections import deque
class Bt(object):
def __init__(self):
self.used = [False] * 10 # 0-9????????°???????????¨?????????????????????????????°
self.answers = [] # ?????¶???????????????????????????
self.Q = deque() # ????????§???????????¢??????????????°???????¨???¶??¨
... | p00030 |
def dec2bin(n, base=10):
s = format(n,'b')
s = "0"*(10-len(s))+s
return s
x=[[0]*50 for i in range(11)]
for i in range(0, 2**10):
B = dec2bin(i)
s = 0
c = B.count("1")
j = 0
for e in B:
if e=="1": s+=j
j+=1
x[c][s]+=1
while 1:
n, s=list(map(int... | x = [[0]*50 for i in range(11)]
for i in range(0, 2**10):
B = format(i,'b')[::-1]
s,c,j = 0,0,0
for e in B:
if e=="1": s,c = s+j, c+1
j += 1
x[c][s]+=1
while 1:
n, s=list(map(int, input().split()))
if n==0 and s==0: break
print(0 if s>=50 else x[n][s]) | p00030 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
print(((n-2)//(k-1)+1)) | n,k=list(map(int,input().split()))
print(((n-2)//(k-1)+1)) | p03319 |
import sys
import math
N,K=list(map(int,input().split()))
A=[int(i) for i in input().split()]
a=0
for i in range(N):
if A[i]==1:
a=i
break
if a <=K-1:
print((math.ceil((N-K)/(K-1))+1))
sys.exit()
if N-K<=a:
print((math.ceil((N-K)/(K-1))+1))
sys.exit()
print((math.ceil(... | import math
N,K=list(map(int,input().split()))
A=[int(i) for i in input().split()]
print((math.ceil((N-K)/(K-1))+1)) | p03319 |
n, k = list(map(int,input().split()))
dat = list(map(int, input().split()))
i = dat.index(1) + 1 # 1originでi個目に1がある
import math
b1 = k # 今1で占有した場所
a1 = 1 # 1にたどり着くまでに必要な個数
a2 = 0
if b1 < i: # もし、iがいまよりも手前にあるなら
a2 += math.ceil( (i - k) / (k - 1) )
b1 += a2 * (k - 1)
b1 = n if b1 > n else b1 # 1のターンでたどり着い... | import math
n, k = list(map(int,input().split()))
dat = list(map(int, input().split()))
i = dat.index(1) + 1 # 1 origin で i 個目に 1 がある
reach = k # 今1で占有した場所
a = math.ceil((n - reach) / (k - 1))
print((1+a)) | p03319 |
# ABC099C - Minimization
from math import ceil
N, K = list(map(int, input().rstrip().split()))
_ = list(map(int, input().rstrip().split()))
print((1 + ceil((N - K) / (K - 1)))) | # ARC099C - Minimization
from math import ceil
N, K = list(map(int, input().rstrip().split()))
print((1 + ceil((N - K) / (K - 1)))) | p03319 |
import math
n, k = list(map(int, input().split()))
al = list(map(int, input().split()))
ans = math.ceil((n-1)/(k-1))
print(ans) | import math
n, k = list(map(int, input().split()))
al = list(map(int, input().split()))
print((math.ceil((n-1)/(k-1))))
| p03319 |
def main():
n,k = input_list()
a = input_list()
ans = 0
r = 1
while True:
r += k-1
ans += 1
if r >= n:
break
print(ans)
def input_list():
return list(map(int, input().split()))
def input_list_str():
return list(map(str, input().split()))
def lcm_base(x, y):
... | import math
def main():
n, k = input_list()
a = input_list()
a = math.ceil((n-k)/(k-1))
print((1+a))
def input_list():
return list(map(int, input().split()))
if __name__ == "__main__":
main()
| p03319 |
# import sys
# input = sys.stdin.readline
import collections
import itertools
def main():
n, k = input_list()
a = input_list()
if (n - 1) % (k - 1) == 0:
print(((n-1) // (k-1)))
else:
v = (n-1) // (k-1)
print((v + 1))
def input_list():
return list(map(int, ... | # import sys
# input = sys.stdin.readline
import collections
import itertools
def main():
n, k = input_list()
a = input_list()
b = n - 1
x = k - 1
ans = b // x
if b % x == 0:
print(ans)
else:
print((ans + 1))
def input_list():
return list(map(int, input... | p03319 |
#!/usr/bin/env python3
n, k, *a = list(map(int, open(0).read().split()))
print((-(-(n - 1) // (k - 1))))
| n, k = list(map(int, input().split()))
print((-(-~-n // ~-k)))
| p03319 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def MI(): return list(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-1+K-2)//(K-1)))
| p03319 |
import collections
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = collections.Counter(A)[min(A)]
print((-(-(N-B)//(K-1)))) | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
print((-(-(N-1)//(K-1)))) | p03319 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(N):
if A[i] == 1:
loc = i
break
#print(loc) #locは0index
left = loc
right = N-(loc+1)
ans = left//(K-1) + right//(K-1)
nokori = left%(K-1) + 1 + right%(K-1)
#print(ans,nokori)
if nokori == 1:
ans += 0
eli... | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
n = N-1
k = K-1
ans = (n+k-1)//k
print(ans) | p03319 |
N, K = list(map(int, input().split()))
A = [int(x) for x in input().split()]
n = N - K
if n % (K - 1) == 0:
ans = 1 + n // (K - 1)
else:
ans = 2 + n // (K - 1)
print(ans) | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
n = N - K
if n % (K - 1) == 0:
ans = 1 + n // (K - 1)
else:
ans = 2 + n // (K - 1)
print(ans) | p03319 |
import math
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
assert isinstance(A,list)
a = A.index(1)
print((math.ceil((N-1)/(K-1)))) | import math
N, K = list(map(int, input().split()))
print((math.ceil((N-1)/(K-1)))) | p03319 |
n,k = list(map(int,input().split()))
a = [int(i) for i in input().split()]
ans = (n-1)//(k-1)
if ans == (n-1)/(k-1):
print(ans)
else:
print((ans+1))
| n,k = list(map(int,input().split()))
a = [int(i) for i in input().split()]
if (n-1)%(k-1)!=0:
ans = (n-1)//(k-1)+1
else:
ans = (n-1)//(k-1)
print(ans) | p03319 |
n, k = list(map(int, input().split()))
if n == k:
print((1))
else:
i = 0
for i, a in enumerate(map(int, input().split())):
if a == 1:
break
left = (i - 1) // (k - 1) + 1
lr = (k - 1) * left + 1
print((left + (n - lr - 1) // (k - 1) + 1))
| n, k = list(map(int, input().split()))
print(((n - 2) // (k - 1) + 1))
| p03319 |
n,k,*a=list(map(int,open(0).read().split()))
print((((n-1)-1)//(k-1)+1)) | n,k=list(map(int,input().split()));print(((~-n-1)//~-k+1)) | p03319 |
n, k = list(map(int, input().split()))
a = [int(x) for x in input().split()]
idx = r = 0
while idx < n:
if idx == 0: idx += k
else: idx += k - 1
r += 1
print(r) | n, k = list(map(int, input().split()))
a = [int(x) for x in input().split()]
idx = k
r = 1
while idx < n:
idx += k - 1
r += 1
print(r) | p03319 |
from math import ceil
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
if K >= N:
print((1))
else:
print((ceil((N-1)/(K-1)))) | from math import ceil
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
print((ceil((N-1)/(K-1)))) | p03319 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
mini = min(A)
idx = N + 1
mid = N / 2
for i, a in enumerate(A):
if a == mini and abs(idx - mid) > abs(i - mid):
idx = i
ans = i // (K - 1)
rem = i % (K - 1)
if rem:
ans += 1
if (N - i - 1 - (K - rem)) // (K - 1) > 0:
... | N,K=map(int,input().split())
print((N-1)//(K-1)+1)if(N-1)%(K-1)else print((N-1)//(K-1))
| p03319 |
N, K = [int(x) for x in input().split()]
A_lst = [int(x) for x in input().split()]
r = -1
l = -1
for i in range(N):
if A_lst[i] == 1:
r = i
l = N - i - 1
print(((r + l + K - 2)//(K - 1)))
| N, K = [int(x) for x in input().split()]
print(((N + K - 3)//(K - 1)))
| p03319 |
import sys
from collections import deque
def solve():
input = sys.stdin.readline
N, K = list(map(int, input().split()))
A = [int(a) for a in input().split()]
l = A.index(1)
count = 1
r = K - 1
while r < l:
r += (K - 1)
count += 1
if r < N - 1:
... | import sys
def solve():
input = sys.stdin.readline
N, K = list(map(int, input().split()))
A = [int(a) for a in input().split()]
mid = A.index(1)
count = 1
r = K - 1
while r < mid:
r += (K - 1)
count += 1
if r < N - 1:
l = N - K
count += 1
... | p03319 |
import sys
input = sys.stdin.readline
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
idx = a.index(1)
left = idx
right = n - (idx + 1)
ans = 10 ** 10
for i in range(k):
cnt = 1
left_ = left - i
right_ = right - (k - 1 - i)
cnt += left_//(k - 1) + rig... | import sys
input = lambda: sys.stdin.readline().rstrip()
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n):
if a[i] == 1:
break
left = len(a[:i])
right = len(a[i + 1:])
ans = left // (k - 1) + right//(k - 1) + (left%(k-1) + right%(k-1))//(k-1) + int((... | p03319 |
from math import ceil
N, K = list(map(int, input().split()))
Alist = list(map(int, input().split()))
print((ceil((N-K)/(K-1))+1)) | from math import ceil
N, K = list(map(int, input().split()))
Alist = list(map(int, input().split()))
print((ceil((N-1)/(K-1)))) | p03319 |
def inpl(): return list(map(int, input().split()))
N, K = inpl()
A = list(inpl())
i = A.index(1)
print((-((K-N)//(K-1)) + 1)) | N,K=list(map(int,input().split()));print((-((1-N)//(K-1)))) | p03319 |
n, k, *_ = list(map(int, open(0).read().split()))
print(((n - 2) // (k - 1) + 1)) | n, k = list(map(int, open(0).readline().split()))
print(((n - 2) // (k - 1) + 1)) | p03319 |
from math import ceil
N,K=list(map(int, input().split()))
A=list(map(int, input().split()))
left=0
right=0
for i in range(N):
if A[i]==1:
left=i
right=N-(i+1)
ans=ceil((left+right)/(K-1))
print(ans)
| from math import ceil
N,K=list(map(int, input().split()))
A=list(map(int, input().split()))
if K==N:
print((1))
exit()
print((ceil((N-1)/(K-1)))) | p03319 |
import math
N, K, *A = list(map(int, open(0).read().split()))
I = A.index(1)
print((math.ceil((N-1)/(K-1)))) | N, K = list(map(int, input().split()))
print(((N+K-3)//(K-1)))
| p03319 |
import math
n,k = list(map(int, input().split()))
a = list(map(int,input().split()))
for i in range(n):
if n/(k+((k-1)*i)) <= 1:
print((i+1))
break | import math
n,k = list(map(int, input().split()))
a = list(map(int,input().split()))
print((math.ceil(((n-k)/(k-1)))+1)) | p03319 |
n, k, *a = list(map(int, open(0).read().split()))
mn = min(a)
cnt = sum([1 for x in a if x != mn])
print((0 - - cnt // (k - 1)))
| n, k, *a = list(map(int, open(0).read().split()))
print((0 - - (n - 1) // (k - 1))) | p03319 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
i = A.index(1)
j = K-1
l = i
r = N - l - 1
ans, e = divmod(l, j)
if e:
ans += 1
r -= K - e - 1
ans += (r+j-1)//j
print(ans) | N,K=list(map(int, input().split()))
*A,=list(map(int, input().split()))
print((((N-1)+(K-1)-1)//(K-1))) | p03319 |
import math
N, K, *A = list(map(int, open(0).read().split()))
print((math.ceil((N-1)/(K-1))))
| import math
N, K = list(map(int, input().split()))
print((math.ceil((N-1)/(K-1))))
| p03319 |
import sys
input = sys.stdin.readline
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
q, r, = divmod(N - 1, K - 1)
ans = q + int(r > 0)
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
N, K = list(map(int, input().split()))
# A = list(map(int, input().split()))
q, r, = divmod(N - 1, K - 1)
ans = q + int(r > 0)
print(ans)
if __name__ == "__main__":
main()
| p03319 |
# -*- coding: utf-8 -*-
n, k = list(map(int,input().split()))
a = [int(i) for i in input().split()]
ans = ((n - 1) + (k - 1) - 1) // (k - 1)
print(ans)
| import math
n, k = list(map(int,input().split()))
a = list(map(int, input().split()))
ans = math.ceil((n - 1) / (k - 1))
print(ans) | p03319 |
#!/usr/bin/env python3
import math
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
if n == k:
ans = 1
elif (n-1)%(k-1)==0:
ans = (n-1)//(k-1)
else:
ans = (n-1)//(k-1) + 1
print(ans)
| #!/usr/bin/env python3
import math
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = math.ceil((n-1)/(k-1))
print(ans)
| p03319 |
N, M = list(map(int, input().split()))
LRD = [list(map(int, input().split())) for i in range(M)]
class WeightedUnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
self.weight = [0] * (n+1)
# 検索
def find(self, x):
if self... | class WeightedUnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
# 根への距離を管理
self.weight = [0] * (n+1)
# 検索
def find(self, x):
if self.par[x] == x:
return x
else:
y = self.find(self.... | p03452 |
import sys
sys.setrecursionlimit(10 ** 6)
N, M = list(map(int, sys.stdin.readline().split()))
G = [[] for i in range(N)]
for i in range(M):
l, r, d = list(map(int, sys.stdin.readline().split()))
l, r = l - 1, r - 1
G[l].append((r, d))
G[r].append((l, -d))
R = [None] * N
def dfs(u):
... | import sys
sys.setrecursionlimit(10 ** 6)
N, M = list(map(int, sys.stdin.readline().split()))
G = [[] for i in range(N)]
for i in range(M):
l, r, q = list(map(int, sys.stdin.readline().split()))
G[l - 1].append((r - 1, q))
G[r - 1].append((l - 1, -q))
R = [None] * N
def dfs(u):
global R,... | p03452 |
import sys
from collections import deque
n, m = list(map(int, input().split()))
ed = [[] for _ in range(n)]
v = [None] * n
for _ in range(m):
l, r, d = list(map(int, input().split()))
ed[l-1].append([r-1, d])
ed[r-1].append([l-1, -d])
def bfs(start):
global ed, v
visited = [False] * n
s = deque([s... | import sys
n, m = list(map(int, input().split()))
ed = [[] for _ in range(n)]
v = [None] * n
for _ in range(m):
l, r, d = list(map(int, input().split()))
ed[l-1].append([r-1, d])
ed[r-1].append([l-1, -d])
visited = [False] * n
def dfs(start):
global ed, v, visited
s = [start]
v[start] = 0
whil... | p03452 |
import sys
from collections import deque
n,m = list(map(int, input().split()))
adj_list = [[] for i in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
adj_list[l-1].append((r-1, d))
adj_list[r-1].append((l-1, -d))
def search(start, dist_all):
q = deque([[start]])
d... | import sys
from collections import deque
n,m = list(map(int, input().split()))
adj_list = [[] for i in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
adj_list[l-1].append((r-1, d))
adj_list[r-1].append((l-1, -d))
def search(start, dist_all):
q = deque([start])
dis... | p03452 |
import sys
sys.setrecursionlimit(100000)
def check(i, xs, checked):
xi = xs[i]
children = set()
for j, d in links[i]:
if j in checked:
continue
xj = xs[j]
if xj is None:
xs[j] = xi + d
elif xi + d != xj:
return False
... | import sys
sys.setrecursionlimit(100000)
def check(i, xs, checked):
xi = xs[i]
children = set()
for j, d in links[i]:
if checked[j]:
continue
if j not in xs:
xs[j] = xi + d
elif xi + d != xs[j]:
return False
children.add(j... | p03452 |
import sys
sys.setrecursionlimit(100000)
def check(i, xs, checked):
xi = xs[i]
children = set()
for j, d in links[i]:
if j in checked:
continue
if j not in xs:
xs[j] = xi + d
elif xi + d != xs[j]:
return False
children.add... | import sys
sys.setrecursionlimit(100000)
def check(i, xs, checked):
xi = xs[i]
children = set()
for j, d in links[i]:
if checked[j]:
continue
if j not in xs:
xs[j] = xi + d
elif xi + d != xs[j]:
return False
children.add(j... | p03452 |
import sys
sys.setrecursionlimit(100000)
def check(i, xs, checked):
xi = xs[i]
children = set()
for j, d in links[i]:
if checked[j]:
continue
if j not in xs:
xs[j] = xi + d
elif xi + d != xs[j]:
return False
children.add(j... | def check(si, xs, checked):
q = [si]
while q:
i = q.pop()
xi = xs[i]
for j, d in links[i]:
if checked[j]:
continue
if j not in xs:
xs[j] = xi + d
elif xi + d != xs[j]:
return False
... | p03452 |
def check(si, xs, checked):
q = [si]
while q:
i = q.pop()
xi = xs[i]
for j, d in links[i]:
if checked[j]:
continue
if j not in xs:
xs[j] = xi + d
elif xi + d != xs[j]:
return False
... | def check(si, xs, checked):
q = {si}
while q:
i = q.pop()
xi = xs[i]
for j, d in links[i]:
if checked[j]:
continue
if j not in xs:
xs[j] = xi + d
elif xi + d != xs[j]:
return False
... | p03452 |
def inpl(): return [int(i) for i in input().split()]
def find(x):
if par[x] == x:
return x
else:
par[x],dist[x] = find(par[x]),dist[x]+dist[par[x]]
return par[x]
N, M = inpl()
par = list(range(N+1))
dist = [0 for _ in range(N+1)]
for _ in range(M):
l, r, d = inpl()
... | def inpl(): return [int(i) for i in input().split()]
def find(x):
if par[x] == x:
return x
else:
par[x],dist[x] = find(par[x]),dist[x]+dist[par[x]]
return par[x]
N, M = inpl()
par = list(range(N+1))
dist = [0 for _ in range(N+1)]
for _ in range(M):
l, r, d = inpl()
... | p03452 |
def inpl(): return [int(i) for i in input().split()]
def find(x):
if par[x] == x:
return x
else:
par[x],dist[x] = find(par[x]),dist[x]+dist[par[x]]
return par[x]
N, M = inpl()
par = list(range(N+1))
dist = [0 for _ in range(N+1)]
for _ in range(M):
l, r, d = inpl()
... | import sys
readline = sys.stdin.readline
class UFP():
def __init__(self, num):
self.par = [-1]*num
self.dist = [0]*num
def find(self, x):
if self.par[x] < 0:
return x
else:
res = 0
xo = x
while self.par[x] >= 0:
... | p03452 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.