input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, M = list(map(int, input().split()))
a = M//N
ans = 0
for i in range(1, a+1):
if M%i == 0:
ans = i
print(ans) | N, M = list(map(int, input().split()))
a = M//N
ans = 0
ok = True
for i in range(1, a+1):
if M%i == 0:
ans = i
if M//i <= a:
print((M//i))
ok = False
break
if ok:
print(ans)
| p03241 |
iN,iM = [int(_) for _ in input().split()]
iD = iM // iN
if iM % iN == 0:
print(iD)
else:
for i in range( iD , 0,-1):
if iM % i == 0:
print(i)
exit()
| iN,iM = [int(_) for _ in input().split()]
iD = iM // iN
if iM % iN == 0:
print(iD)
elif 2*iN > iM :
print((1))
else:
aD = []
for i in range(1,int(iM**0.5)+1):
if iM % i == 0:
if iD > i : aD.append(i)
j = iM // i
if iD > j :aD.append(j)
print((max(aD)))
| p03241 |
iN,iM = [int(_) for _ in input().split()]
iD = iM // iN
if iM % iN == 0:
print(iD)
elif 2*iN > iM :
print((1))
else:
aD = []
for i in range(1,int(iM**0.5)+1):
if iM % i == 0:
if iD > i : aD.append(i)
j = iM // i
if iD > j :aD.append(j)
print((max(aD)))
| def 解():
iN,iM = [int(_) for _ in input().split()]
iD = iM // iN
if iM % iN == 0:
print(iD)
elif 2*iN > iM :
print((1))
else:
aD = []
for i in range(1,int(iM**0.5)+1):
if iM % i == 0:
if iD > i : aD.append(i)
j = iM // i
if iD > j :aD.append(j)
print((max(aD)))
解()
| p03241 |
import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
ni = lambda: int(sys.stdin.readline())
ns = lambda: list(map(int, sys.stdin.readline().split()))
na = lambda: list(map(int, sys.stdin.readline().split()))
# ===CODE===
def main():
def make_divisors(n):
divisors = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
divisors.sort(reverse=True)
return divisors
n, m = ns()
gcd = make_divisors(m)
max_gcd = 1
for d in gcd:
if m // d >= n:
max_gcd = d
break
print(d)
if __name__ == '__main__':
main()
| import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
ni = lambda: int(sys.stdin.readline())
ns = lambda: list(map(int, sys.stdin.readline().split()))
na = lambda: list(map(int, sys.stdin.readline().split()))
# ===CODE===
def main():
def make_divisors(n):
divisors = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
# divisors.sort(reverse=True)
return divisors
n, m = ns()
gcd = make_divisors(m)
max_gcd = 1
for d in gcd:
if m // d >= n:
max_gcd = max(max_gcd, d)
print(max_gcd)
if __name__ == '__main__':
main()
| p03241 |
import collections
import itertools
import math
def eratosthenes(n):
sieve = [True for _ in range(n + 1)]
sieve[0] = False
sieve[1] = False
def _update(p):
if sieve[p]:
for i in range(p * 2, n + 1, p):
sieve[i] = False
_update(2)
p = 3
while p * p <= n:
_update(p)
p += 2
return sieve
n, m = list(map(int, input().split()))
m2 = math.ceil(math.sqrt(m)) + 1
sieve = eratosthenes(m2)
counter = collections.Counter()
mm = m
for k in range(2, m2):
if sieve[k] and m % k == 0:
while mm % k == 0:
mm //= k
counter[k] += 1
if mm > 1:
counter[mm] += 1
es = [list(range(k + 1)) for k in list(counter.values())]
res = 1
for ks in itertools.product(*es):
x = 1
for p, k in zip(list(counter.keys()), ks):
x *= p**k
if x <= m // n:
res = max(res, x)
print(res) | import math
n, m = list(map(int, input().split()))
mm = m // n
res = []
for k in range(int(math.sqrt(m)), 0, -1):
if m % k == 0:
if k > mm:
continue
if m // k <= mm:
k = m // k
res.append(k)
print((max(res))) | p03241 |
N, M = list(map(int, input().split()))
ans = 1
for i in range(1,int(M ** 0.5) + 1):
if M % i == 0:
if i >= N:
ans = max(ans, M // i)
if M // i >= N:
ans = max(ans, i)
print((int(ans)))
| def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
n,m=list(map(int,input().split()))
for i in make_divisors(m)[::-1]:
if n*i<=m:print(i);break | p03241 |
n,m = list(map(int,input().split()))
while True:
if m%n == 0:
print((m//n))
break
n += 1 | n,m = list(map(int, input().split()))
if n*n <= m:
k = n
while k*k <= m:
if m%k == 0:
print((m//k))
exit()
k += 1
else:
n = m//n
k = n
while True:
if m%k == 0:
print(k)
exit()
k -= 1 | p03241 |
N, M = [int(x) for x in input().strip().split(' ')]
for i in range(M//N):
# n = N-i
n = M//N-i
if M % n == 0:
# if M//n >= N:
print(n)
break
| N, M = [int(x) for x in input().strip().split(' ')]
if N >= 1000:
for i in range(M//N):
n = (M//N)-i
if M % n == 0:
print(n)
break
else:
x = M//(M//N)
for i in range(M):
i = x +i
if M % i == 0:
print((M//i))
break
| p03241 |
from itertools import *
n,m=list(map(int,input().split()))
M=m
a=[1]
for i in range(2,int(m**.5)+1):
while m%i==0:
m//=i
a+=[i]
if m!=1:a+=[m]
ans=1
for i in range(len(a)):
for b in combinations(a,i):
c=1
for j in b:
c*=j
if c>=n:
ans=max(ans,M//c)
print(ans) | from itertools import *
n,m=list(map(int,input().split()))
M=m
a=[1]
for i in range(2,int(m**.5)+1):
while m%i==0:
m//=i
a+=[i]
if m!=1:a+=[m]
ans=1
for i in range(len(a)):
for b in combinations_with_replacement(set(a),i):
c=1
for j in b:c*=j
if c>=n and M%c==0:ans=max(ans,M//c)
print(ans) | p03241 |
n,m = list(map(int, input().split() ))
c = []
for i in range(1,m+1) :
if m//i in c :
break
else :
if m%i==0 :
c.append(i)
c.append(m//i)
c.sort()
c.reverse()
for j in range(len(c)) :
if c[j] <= m//n :
print((c[j]))
break | n,m = list(map(int, input().split() ))
c = []
for i in range(1,int(m**0.5)+1) :
if m%i==0 :
c.append(i)
c.append(m//i)
c.sort()
c.reverse()
for j in range(len(c)) :
if c[j] <= m//n :
print((c[j]))
break | p03241 |
N,M=list(map(int,input().split()))
if N==1:
print(M)
exit()
for i in range(N,M+1):
if M%i==0:
print((M//i))
exit() | N,M=list(map(int,input().split()))
if N==1:
print(M)
exit()
if N>=M**0.5:
for i in range(M//N,0,-1):
if M%i==0:
print(i)
exit()
else:
for i in range(N,M+1):
if M%i==0:
print((M//i))
exit()
print((1)) | p03241 |
# AGC112 D - Partition
from math import floor
def divisor(n):
i = 1
table = []
while i * i <= n:
if n%i == 0:
table.append(i)
table.append(n//i)
i += 1
table = list(set(table))
return table
n,m=list(map(int,input().split()))
n_max=floor(m/n)
div_m=divisor(m)
div_m.sort(reverse=True)
ans=0
for i in div_m:
if i<=n_max:
print(i)
exit()
| def create_divisors(n):
divisors=[]
for i in range(1,int(n**0.5)+1):
if n%i==0:
divisors.append(i)
if i!=n//i:
divisors.append(n//i)
divisors.sort(reverse=True)
return divisors
from math import floor
n,m=list(map(int,input().split()))
n_max=floor(m/n)
d=create_divisors(m)
for di in d:
if di<=n_max:
print(di)
exit(0) | p03241 |
n, m = list(map(int, input().split()))
ans = 0
for i in range(1, m//n+1):
if m % i == 0:
ans = max(ans, i)
if m // i > i and m // i <= m // n:
ans = max(ans, m // i)
break
print(ans) | N, M = list(map(int, input().split()))
if M % N == 0:
ans = M // N
else:
for i in range(1, M // N + 1):
if M % i == 0:
ans = i
if M // i > i and M // i <= M // N:
ans = M // i
break
print(ans) | p03241 |
import math as m
N,M = list(map(int,input().split()))
divisor = []
for i in range(1,m.floor(pow(M,1/2)) + 1):
if M % i == 0:
divisor.append(i)
divisor.append(M // i)
ans = 1
for e in divisor:
if e > ans and e <= M // N:
ans = e
print(ans) | # N, D, K = map(int,input().split())
# LR = [list(map(int,input().split())) for _ in range(D)]
# ST = [list(map(int,input().split())) for _ in range(K)]
from math import floor
# 約数全列挙(ソート済み)
# n = 24 -> [1,2,3,4,6,8,12,24]
def divisor(n):
left = [1]
right = [n]
sup = floor(pow(n,1/2))
for p in range(2,sup+1):
if n % p == 0:
if p == n//p:
left.append(p)
continue
left.append(p)
right.append(n//p)
res = left + right[::-1]
return res
N, M = list(map(int,input().split()))
cand = divisor(M)
ans = 1
for ch in cand:
if M // ch >= N:
ans = max(ans, ch)
print(ans) | p03241 |
N, M = list(map(int, input().split()))
S = 1
p = 0
for i in range(2, int(M ** (1/2)) + 1):
if M % i == 0:
p = 1
if p != 0:
for i in range(1, M // N + 1):
if M % i == 0:
S = i
print(S) | N, M = list(map(int, input().split()))
S = 1
p = 0
X = []
for i in range(2, int(M ** (1/2)) + 1):
if M % i == 0:
if i <= M // N:
p = i
X.append(i)
else:
break
if M // N <= int(M ** (1/2)):
if p != 0:
S = p
else:
if p != 0:
S = M
q = 0
while S > M // N:
S = M // X[q]
if S <= M // N:
break
q += 1
if q == len(X):
break
if q == len(X):
S = max(X)
print(S) | p03241 |
from sys import stdin
n,m = list(map(int,stdin.readline().rstrip().split()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
li = make_divisors(m)
point = 1
if n == 1:
print(m)
exit()
for i in range(1,len(li)):
if m//li[i] < n:
point = li[i-1]
break
print(point) | from sys import stdin
n,m = list(map(int,stdin.readline().rstrip().split()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
li = make_divisors(m)
point = m
for i in range(1,len(li)):
if m//li[i] < n:
point = li[i-1]
break
print(point) | p03241 |
n, m = list(map(int, input().split()))
for i in range(m // n + 1)[::-1]:
if m % i == 0:
print(i)
break | def f():
n, m = list(map(int, input().split()))
for i in range(m//n+1)[::-1]:
if m%i==0:return i
print((f())) | p03241 |
from functools import reduce as R
print((R(lambda x, y: x*y, list(range(1, int(eval(input()))+1))))) | import math
print((math.factorial(int(eval(input())))))
| p00019 |
def main():
n = int(eval(input()))
for x in range(1, n):
n *= x
print(n)
if __name__ == "__main__":
main() | n = int(eval(input()))
ans = 1
for i in range(1, n + 1):
ans *= i
print(ans)
| p00019 |
#!/usr/bin/env python3
import sys
def solve(N: int):
n = list(map(int,list(str(N))))
kuriage = 0
LEN = len(n)
pay_count = 0
pay_count = 0
for i in range(LEN-1,-1,-1):
if i != 0:
if n[i-1] >= 5:
if n[i]+kuriage <= 4:
pay_count += n[i]+kuriage
kuriage = 0
else:
pay_count += 10-(n[i]+kuriage)
kuriage = 1
else:
if n[i]+kuriage <= 5:
pay_count += n[i]+kuriage
kuriage = 0
else:
pay_count += 10-(n[i]+kuriage)
kuriage = 1
else:
if n[i]+kuriage <= 5:
pay_count += n[i]+kuriage
kuriage = 0
else:
pay_count += 10-(n[i]+kuriage)
kuriage = 1
if kuriage == 1:
pay_count += 1
print(pay_count)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
solve(N)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def solve(N: str):
n = list(map(int,list(N)))
kuriage = 0
LEN = len(n)
pay_count = 0
for i in range(LEN-1,-1,-1):
if i != 0:
if n[i-1] >= 5:
if n[i]+kuriage <= 4:
pay_count += n[i]+kuriage
kuriage = 0
else:
pay_count += 10-(n[i]+kuriage)
kuriage = 1
else:
if n[i]+kuriage <= 5:
pay_count += n[i]+kuriage
kuriage = 0
else:
pay_count += 10-(n[i]+kuriage)
kuriage = 1
else:
if n[i]+kuriage <= 5:
pay_count += n[i]+kuriage
kuriage = 0
else:
pay_count += 10-(n[i]+kuriage)
kuriage = 1
if kuriage == 1:
pay_count += 1
print(pay_count)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = next(tokens)
solve(N)
if __name__ == '__main__':
main()
| p02775 |
def main():
s = input().rstrip()
t = "0" + s
n = len(t)
dp = [[float("inf")]*2 for _ in range(n+1)]
dp[0][0] = 0
for i in range(n):
for j in range(2):
x = int(t[n-i-1]) + j
if x < 10:
dp[i+1][0] = min(dp[i+1][0], dp[i][j] + x + 0)
if 0 < x:
dp[i+1][1] = min(dp[i+1][1], dp[i][j] + 10 - x)
print((dp[n][0]))
if __name__ == "__main__":
main()
| def main():
s = input().rstrip()
s = "0" + s
dp = [0, float("inf")]
for c in s:
x = int(c)
dp = [min(dp[0] + x, dp[1] + (10-x)), min(dp[0] + x+1, dp[1] + (10-x) - 1)]
print((dp[0]))
if __name__ == "__main__":
main()
| p02775 |
import sys
n = int(sys.stdin.readline())
ans = 0
p = [0,0]
now = [0,0]
p[0] = n%10
p[1] = 10 - n%10
n = n//10
ans = min(p[0], p[1] + 1)
for _ in range(10**6+1):
if n <= 0:break
now[0] = min(p[0] + n%10, p[1] + n%10 + 1)
now[1] = min(p[0] + 10 - n%10, p[1] + 9 - n%10)
ans = min(now[0], now[1] + 1)
n = n//10
p[0],p[1] = now[0],now[1]
print(ans)
| import sys
n = [int(i) for i in sys.stdin.readline().rstrip()[::-1]]
ans = 0
i = 0
p = [n[i],10 - n[i]]
now = [0,0]
i += 1
ans = min(p[0], p[1] + 1)
for i in range(1,len(n)):
now[0] = min(p[0] + n[i]%10, p[1] + n[i]%10 + 1)
now[1] = min(p[0] + 10 - n[i]%10, p[1] + 9 - n[i]%10)
ans = min(now[0], now[1] + 1)
p[0],p[1] = now[0],now[1]
print(ans)
| p02775 |
# 入力が10**5とかになったときに100ms程度早い
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_matrix(H):
'''
H is number of rows
'''
return [list(map(int, read().split())) for _ in range(H)]
def read_map(H):
'''
H is number of rows
文字列で与えられた盤面を読み取る用
'''
return [read()[:-1] for _ in range(H)]
def read_tuple(H):
'''
H is number of rows
'''
ret = []
for _ in range(H):
ret.append(tuple(map(int, read().split())))
return ret
def read_col(H, n_cols):
'''
H is number of rows
n_cols is number of cols
A列、B列が与えられるようなとき
'''
ret = [[] for _ in range(n_cols)]
for _ in range(H):
tmp = list(map(int, read().split()))
for col in range(n_cols):
ret[col].append(tmp[col])
return ret
from functools import lru_cache
import sys
sys.setrecursionlimit(1 << 25)
N = read_a_int()
siharai = ''
@lru_cache(None)
def F(n):
'''
支払う金額を返す。再帰関数
'''
global siharai
# 終了条件
assert n > -1
if n < 5:
siharai += str(n)
return 0
# 桁dpもどき
# 1の位が4以下ならそのまま紙幣で支払うのが得→自身をそのまま答えに採用
# 6以上ならばお釣り狙いのほうが得→自身は0にセットして、上位桁を+1する
# 5ちょうどのときは？ #お釣りもそのまま払っても同じ。だけど上位 お釣り狙いだと上の桁が多くなって支払う金額が増える可能性がある？
# 5ピッタリのときに上位桁に+1すると悪くなる場合が存在する 455 とは 15にってしまう
# 5ピッタリのときはどうするのがよいのか？
q, r = divmod(n, 10)
if r == 5:
qq, rr = divmod(q, 10)
if rr < 5:
# そのまま
joint = 5
F(q)
else:
joint = 0
F(q + 1)
# +1
elif r < 5:
joint = r
F(q)
else:
joint = 0
F(q + 1)
siharai += str(joint)
F(N)
siharai = int(siharai)
oturi = siharai - N
# print(siharai, oturi)
ans = 0
for a in str(siharai) + str(oturi):
ans += int(a)
# print(sum(list(siharai)) + sum(list(str(oturi))))
# print(sum(list(siharai)))
print(ans)
| import sys
read = sys.stdin.readline
# 下の桁から貪欲に見ていくと解ける
# 1の位が4以下ならそのまま紙幣で支払うのが得→自身をそのまま答えに採用 (枚数として加算)
# 6以上ならばお釣り狙いのほうが得→自身は0にセットして、上位桁を+1する (枚数として10-自身を加算)
# 5ちょうどのときは、お釣りもそのまま払っても枚数は変わらない。だけど555みたいに、上位桁に+1すると得になる可能性がある。
# 555→15枚, 1000-445→15枚
# つまり5が出たときは更に上位の桁を見て、4以下ならそのまま払うほうが得,5以上なら桁上りのほうが得
# 5ちょうどのときは？ #お釣りもそのまま払っても同じ。だけど上位 お釣り狙いだと上の桁が多くなって支払う金額が増える可能性がある？
# 5ピッタリのときに上位桁に+1すると悪くなる場合が存在する 455 とは 15にってしまう
# 5ピッタリのときはどうするのがよいのか？
N = '00' + read()[:-1]
N = N[::-1]
ans = 0
# agari = 0
# is_pre5 = False
# for n in N:
# n = int(n) + agari
# print(n, ans)
# if is_pre5:
# if n == 5:
# ans += n
# continue
# if n < 5:
# # そのまま支払う
# ans += n
# agari = 0
# else:
# # 桁上り
# ans += 9 - n
# agari = 1
# else:
# if n == 5:
# is_pre5 = True
# ans += n
# agari = 0
# # もし5だったら5が終わるまでなめる
# elif n < 5:
# ans += n
# agari = 0
# else:
# ans += 10 - n
# agari = 1
# if n != 5:
# is_pre5 = False
i = 0
lo = int(N[i])
while i < len(N) - 1:
hi = int(N[i + 1])
# print(hi, lo, i)
if lo == 5 and hi == 5:
# 5が連続してた場合
# 5の最後まで移動(移動の道中は 5+4+4...としていく)
# 5じゃなくなったhiに対して足し算する必要がある。
ans += 5
i += 1
while i < len(N) - 1 and N[i + 1] == '5':
ans += 4
# print(i)
i += 1
ans += 4
# low = N[i]
hi = int(N[i + 1]) + 1
# print(hi, lo, i)
# loが5以外のとき (お釣りが良いか、そのまま払うのが良いか考えるだけ)
elif lo == 5:
ans += lo
if hi < 5:
pass
else:
hi += 1
elif lo < 5: # 5が連続しないときもここに入る
ans += lo
else:
ans += 10 - lo
hi += 1 # 上の桁が繰り上がる
lo = hi # 桁を一つずらす
i += 1
print(ans)
| p02775 |
import sys
read = sys.stdin.readline
# 下の桁から貪欲に見ていくと解ける
# 1の位が4以下ならそのまま紙幣で支払うのが得→自身をそのまま答えに採用 (枚数として加算)
# 6以上ならばお釣り狙いのほうが得→自身は0にセットして、上位桁を+1する (枚数として10-自身を加算)
# 5ちょうどのときは、お釣りもそのまま払っても枚数は変わらない。だけど555みたいに、上位桁に+1すると得になる可能性がある。
# 555→15枚, 1000-445→15枚
# つまり5が出たときは更に上位の桁を見て、4以下ならそのまま払うほうが得,5以上なら桁上りのほうが得
# 5ちょうどのときは？ #お釣りもそのまま払っても同じ。だけど上位 お釣り狙いだと上の桁が多くなって支払う金額が増える可能性がある？
# 5ピッタリのときに上位桁に+1すると悪くなる場合が存在する 455 とは 15にってしまう
# 5ピッタリのときはどうするのがよいのか？
N = '00' + read()[:-1]
N = N[::-1]
ans = 0
# agari = 0
# is_pre5 = False
# for n in N:
# n = int(n) + agari
# print(n, ans)
# if is_pre5:
# if n == 5:
# ans += n
# continue
# if n < 5:
# # そのまま支払う
# ans += n
# agari = 0
# else:
# # 桁上り
# ans += 9 - n
# agari = 1
# else:
# if n == 5:
# is_pre5 = True
# ans += n
# agari = 0
# # もし5だったら5が終わるまでなめる
# elif n < 5:
# ans += n
# agari = 0
# else:
# ans += 10 - n
# agari = 1
# if n != 5:
# is_pre5 = False
i = 0
lo = int(N[i])
while i < len(N) - 1:
hi = int(N[i + 1])
# print(hi, lo, i)
if lo == 5 and hi == 5:
# 5が連続してた場合
# 5の最後まで移動(移動の道中は 5+4+4...としていく)
# 5じゃなくなったhiに対して足し算する必要がある。
ans += 5
i += 1
while i < len(N) - 1 and N[i + 1] == '5':
ans += 4
# print(i)
i += 1
ans += 4
# low = N[i]
hi = int(N[i + 1]) + 1
# print(hi, lo, i)
# loが5以外のとき (お釣りが良いか、そのまま払うのが良いか考えるだけ)
elif lo == 5:
ans += lo
if hi < 5:
pass
else:
hi += 1
elif lo < 5: # 5が連続しないときもここに入る
ans += lo
else:
ans += 10 - lo
hi += 1 # 上の桁が繰り上がる
lo = hi # 桁を一つずらす
i += 1
print(ans)
| import sys
read = sys.stdin.readline
# 下の桁から貪欲に見ていくと解ける
# 1の位が4以下ならそのまま紙幣で支払うのが得→自身をそのまま答えに採用 (枚数として加算)
# 6以上ならばお釣り狙いのほうが得→自身は0にセットして、上位桁を+1する (枚数として10-自身を加算)
# 5ちょうどのときは、お釣りもそのまま払っても枚数は変わらない。だけど555みたいに、上位桁に+1すると得になる可能性がある。
# 555→15枚, 1000-445→15枚
# つまり5が出たときは更に上位の桁を見て、4以下ならそのまま払うほうが得,5以上なら桁上りのほうが得
# 5ちょうどのときは？ #お釣りもそのまま払っても同じ。だけど上位 お釣り狙いだと上の桁が多くなって支払う金額が増える可能性がある？
# 5ピッタリのときに上位桁に+1すると悪くなる場合が存在する 455 とは 15にってしまう
# 5ピッタリのときはどうするのがよいのか？
N = '00' + read()[:-1]
N = N[::-1]
ans = 0
i = 0
lo = int(N[i])
while i < len(N) - 1:
hi = int(N[i + 1])
# loが5以外のとき (お釣りが良いか、そのまま払うのが良いか考えるだけ)
if lo == 5:
ans += lo
if hi < 5:
pass
else:
hi += 1
elif lo < 5: # 5が連続しないときもここに入る
ans += lo
else:
ans += 10 - lo
hi += 1 # 上の桁が繰り上がる
lo = hi # 桁を一つずらす
i += 1
print(ans)
| p02775 |
def main():
n = int(eval(input()))
s = list(str(n))
s.reverse()
s += ['0']
s = [int(c) for c in s]
m = len(s)
dp = [[10**7, 10**7] for _ in range(len(s)+5)]
# dp[i][0]: 繰り下がりなし
# dp[i][1]: 繰り下がりあり
dp[0][0] = 0
for i in range(m):
for j in range(2):
nd = s[i]
if j == 1:
nd += 1
if dp[i+1][0] >= dp[i][j]+nd:
dp[i+1][0] = dp[i][j]+nd
if dp[i+1][1] >= dp[i][j]+10-nd:
dp[i+1][1] = dp[i][j]+10-nd
#print(dp)
print((dp[m][0]))
if __name__ == '__main__':
main() | def main():
s = list(str(eval(input())))
s.reverse()
for i in range(len(s)):
s[i] = int(s[i])
s += [0]
m = len(s)
dp = [[10**7, 10**7] for _ in range(len(s)+5)]
# dp[i][0]: 繰り下がりなし
# dp[i][1]: 繰り下がりあり
dp[0][0] = 0
for i in range(m):
for j in range(2):
nd = s[i]
if j == 1:
nd += 1
if dp[i+1][0] >= dp[i][j]+nd:
dp[i+1][0] = dp[i][j]+nd
if dp[i+1][1] >= dp[i][j]+10-nd:
dp[i+1][1] = dp[i][j]+10-nd
#print(dp)
print((dp[m][0]))
if __name__ == '__main__':
main() | p02775 |
def main():
s = list(str(eval(input())))
s.reverse()
for i in range(len(s)):
s[i] = int(s[i])
s += [0]
m = len(s)
dp = [[10**7, 10**7] for _ in range(len(s)+5)]
# dp[i][0]: 繰り下がりなし
# dp[i][1]: 繰り下がりあり
dp[0][0] = 0
for i in range(m):
for j in range(2):
nd = s[i]
if j == 1:
nd += 1
if dp[i+1][0] >= dp[i][j]+nd:
dp[i+1][0] = dp[i][j]+nd
if dp[i+1][1] >= dp[i][j]+10-nd:
dp[i+1][1] = dp[i][j]+10-nd
#print(dp)
print((dp[m][0]))
if __name__ == '__main__':
main() | def main():
s = list(str(eval(input())))
s.reverse()
s = [int(c) for c in s]
s += [0]
m = len(s)
dp = [[10**7, 10**7] for _ in range(len(s)+5)]
# dp[i][0]: 繰り下がりなし
# dp[i][1]: 繰り下がりあり
dp[0][0] = 0
for i in range(m):
for j in range(2):
nd = s[i]
if j == 1:
nd += 1
if dp[i+1][0] >= dp[i][j]+nd:
dp[i+1][0] = dp[i][j]+nd
if dp[i+1][1] >= dp[i][j]+10-nd:
dp[i+1][1] = dp[i][j]+10-nd
#print(dp)
print((dp[m][0]))
if __name__ == '__main__':
main() | p02775 |
# -*- coding: utf-8 -*-
N="0"+input()
l=len(N)
F=[ 0 for _ in range(l) ] #繰り上がりなし
T=[ 0 for _ in range(l) ] #繰り上がりあり
#初期化
T[0]="N"
x=int(N[l-1])
F[l-1]=x
T[l-1]=10-x
for i in range(l-1,0,-1):
next_x=int(N[i-1])
F[i-1]=min(F[i]+next_x, T[i]+next_x+1)
T[i-1]=min(F[i]+10-next_x, T[i]+10-(next_x+1))
print(F[0])
| # -*- coding: utf-8 -*-
N="0"+input()
l=len(N)
F=[ 0 for _ in range(l) ] #繰り上がりなし
T=[ 0 for _ in range(l) ] #繰り上がりあり
#初期化
x=int(N[l-1])
F[l-1]=x
T[l-1]=10-x
for i in range(l-1,0,-1):
next_x=int(N[i-1])
#繰上なしへの遷移。前の桁が繰上なしの場合は単に該当桁の数字を足す、
#前の桁が繰上ありの場合は、今の桁の数字が1増える
F[i-1]=min(F[i]+next_x, T[i]+next_x+1)
#繰上ありへの遷移。前の桁が繰上なしの場合は(10-該当桁の数字)を足す、
#前の桁が繰上ありの場合は今の桁の数字が1増えているので(10-該当桁の数字+1)
T[i-1]=min(F[i]+10-next_x, T[i]+10-(next_x+1))
print(F[0])
| p02775 |
def examA():
N = LI()
N.sort()
if N[0]==N[1] and N[0]!=N[2]:
print("Yes")
elif N[1]==N[2] and N[0]!=N[2]:
print("Yes")
else:
print("No")
return
def examB():
N = I()
A = LI()
for a in A:
if a%2==0:
if a%3!=0 and a%5!=0:
print("DENIED")
return
print("APPROVED")
return
def examC():
N = I()
S = [SI()for _ in range(N)]
d = defaultdict(int)
for s in S:
d[s] += 1
t = max(d.values())
ans = []
for s in S:
if d[s]==t:
ans.append(s)
d[s] = 0
ans.sort()
for v in ans:
print(v)
return
def examD():
N, K = LI()
A = LI()
ans = 0
print(ans)
return
def examE():
S = SI()
N = len(S)
flag = False
ans = 0
index4 = "4"*N
for i in range(N):
#print(ans)
if flag:
if int(S[i])>=5:
ans += 9-int(S[i])
else:
if (i<N-1 and int(S[i:])>=int(index4[i:])):
ans += 9-int(S[i])
else:
ans += int(S[i])
flag = False
continue
if (i<N-1 and int(S[i]+S[i+1])>=56) or int(S[i])>=6:
flag = True
ans += 11-int(S[i])
else:
ans += int(S[i])
print(ans)
return
def examF():
ans = 0
print(ans)
return
import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]
if __name__ == '__main__':
examE()
"""
4396817
""" | def examA():
N = LI()
N.sort()
if N[0]==N[1] and N[0]!=N[2]:
print("Yes")
elif N[1]==N[2] and N[0]!=N[2]:
print("Yes")
else:
print("No")
return
def examB():
N = I()
A = LI()
for a in A:
if a%2==0:
if a%3!=0 and a%5!=0:
print("DENIED")
return
print("APPROVED")
return
def examC():
N = I()
S = [SI()for _ in range(N)]
d = defaultdict(int)
for s in S:
d[s] += 1
t = max(d.values())
ans = []
for s in S:
if d[s]==t:
ans.append(s)
d[s] = 0
ans.sort()
for v in ans:
print(v)
return
def examD():
N, K = LI()
A = LI()
ans = 0
print(ans)
return
def examE():
S = SI()
N = len(S)
flag = False
ans = 0
for i in range(N-1,-1,-1):
#print(ans)
cur = int(S[i])
if flag:
cur += 1
if cur>=6:
ans += 10-cur
flag = True
else:
ans += cur
flag = False
if flag:
ans += 1
print(ans)
return
def examE2():
S = SI()
N = len(S)
dp = [[0]*2 for _ in range(N+2)]
dp[0][1] = inf
S = S[::-1]
S += "0"
for i in range(N+1):
s = int(S[i])
dp[i+1][0] = dp[i][0] + s
dp[i+1][1] = dp[i][0] + (10-s)
if s<9:
dp[i+1][0] = min(dp[i+1][0],dp[i][1] + (s+1))
dp[i+1][1] = min(dp[i+1][1],dp[i][1] + (10-s-1))
#print(dp)
ans = min(dp[-1][0],dp[-1][1])
print(ans)
return
def examF():
ans = 0
print(ans)
return
import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]
if __name__ == '__main__':
examE2()
"""
4396817
""" | p02775 |
# https://atcoder.jp/contests/abc155/submissions/10175015
def main():
n = list(map(int, input()[::-1])) + [0]
s = 0
res = 0
for i, ni in enumerate(n[:-1]):
k = ni + s
if k < 5 or (k == 5 and int(n[i + 1]) < 5):
res += k
s = 0
else:
res += 10 - k
s = 1
res += s
print(res)
if __name__ == '__main__':
main() | def main():
n = list(map(int, input()[::-1])) + [0]
s = 0
res = 0
for i, ni in enumerate(n[:-1]):
k = ni + s
if k < 5 or (k == 5 and n[i + 1] < 5):
res += k
s = 0
else:
res += 10 - k
s = 1
res += s
print(res)
if __name__ == '__main__':
main()
| p02775 |
s = [0] + list(map(int,list(input())))
dp = [+float('inf')] * len(s)
for j in range(len(s) - 1, -1, -1):
a = s[j]
if j+ 1 < len(dp): a += dp[j + 1]
dp[j] = min(a, dp[j])
b = s[j] + 1
q = 0
for jj in range(j+1, len(s)):
q += 9 - s[jj]
dp[j] = min(dp[j], b + q + 1 +(dp[jj+1] if jj+1 < len(dp) else 0))
print(dp[0])
| s = list(map(int,list(input())))
dp = [[0,0] for _ in range(len(s))]
for i in range(len(dp)):
a = (dp[i - 1][0] if i - 1 >= 0 else 0) + s[i]
b = (dp[i - 1][1] if i - 1 >= 0 else 1) + 10 - s[i]
dp[i][0] = min(a,b)
a = (dp[i - 1][0] if i - 1 >= 0 else 0) + s[i] + 1
b = (dp[i - 1][1] if i - 1 >= 0 else 1) + 10 - s[i] - 1
dp[i][1] = min(a,b)
print(dp[-1][0])
| p02775 |
import sys
INPUT = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10 ** 9)
def main():
S = INPUT()
N = len(S)
s = ["", ""]
flag = True
for i in range(N):
s[0] += str(i%2)
s[1] += str((i + 1)%2)
cnt = [0, 0]
for i in range(N):
for j in range(2):
if s[j][i] != S[i]: cnt[j] += 1
print((cnt[0] if cnt[0] < cnt[1] else cnt[1]))
if __name__ == '__main__':
main() | import sys
INPUT = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10 ** 9)
def main():
S = INPUT()
N = len(S)
s = ["", ""]
for i in range(N):
for j in range(2):
s[j] += str((i + j)%2)
cnt = [0, 0]
for i in range(N):
for j in range(2):
if s[j][i] != S[i]: cnt[j] += 1
print((cnt[0] if cnt[0] < cnt[1] else cnt[1]))
if __name__ == '__main__':
main() | p03073 |
import sys
def i2s():
return sys.stdin.readline()
def ii2ss(n):
return [sys.stdin.readline() for _ in range(n)]
def sp2nn(sp, sep=' '):
return [int(s) for s in sp.split(sep)]
def ss2nn(ss):
return [int(s) for s in list(ss)]
def main(S):
S = S.rstrip()
c0 = 0
c1 = 0
for i, s in enumerate(S):
if (i % 2) == int(s):
c0 += 1
else:
c1 += 1
cmin = min(c0, c1)
print(cmin)
main(i2s()) | # AtCoder Beginner Contest 124
# https://atcoder.jp/contests/abc124
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline() for _ in range(n)]
ii2nnn = lambda n: ss2nnn(ii2ss(n))
def main(S):
n1 = 0
n2 = 0
for i in range(len(S)):
if i % 2 == 0:
if S[i] == '0':
n1 += 1
else:
n2 += 1
if i % 2 == 1:
if S[i] == '1':
n1 += 1
else:
n2 += 1
n = min(n1, n2)
print(n)
S = i2s()
main(S)
| p03073 |
#!/usr/bin/env python
import sys
def main():
S = sys.stdin.readline().rstrip()
N = len(S)
s1 = ""
s2 = ""
for i in range(N):
if i % 2 == 0:
s1 = s1 + "1"
s2 = s2 + "0"
elif i % 2 == 1:
s1 = s1 + "0"
s2 = s2 + "1"
ans = float("inf")
tmp = 0
for i, j in zip(S, s1):
if i != j:
tmp += 1
ans = min(ans, tmp)
tmp = 0
for i, j in zip(S, s2):
if i != j:
tmp += 1
ans = min(ans, tmp)
print(ans)
if __name__ == '__main__':
main()
| #!/usr/bin/env python
import sys
def main():
S = sys.stdin.readline().rstrip()
N = len(S)
ans = float("inf")
tmp1 = 0
tmp2 = 0
for i in range(N):
if i % 2 == 0:
s1 = "1"
s2 = "0"
if S[i] != s1:
tmp1 += 1
elif S[i] != s2:
tmp2 += 1
elif i % 2 == 1:
s1 = "0"
s2 = "1"
if S[i] != s1:
tmp1 += 1
elif S[i] != s2:
tmp2 += 1
print((min(tmp1, tmp2)))
if __name__ == '__main__':
main() | p03073 |
import sys
import os
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
MOD = 10 ** 9 + 7
def func(q, S):
ret = 0
for s in S:
if q == s:
ret += 1
q = '1' if q == '0' else '0'
return ret
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
S = list(iss())
print((min(func('0', S), func('1', S))))
if __name__ == '__main__':
main()
| import sys
import os
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
MOD = 10 ** 9 + 7
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
S = list(iss())
t = S[::2].count("0") + S[1::2].count("1")
print((min(t, len(S) - t)))
if __name__ == '__main__':
main()
| p03073 |
N, K = list(map(int, input().split()))
l = []
i = 0
for x in input().split():
A = int(x)
if K < N - i:
l.append(A)
if i >= K:
if l.pop(0) < A:
print("Yes")
else:
print("No")
i = i + 1
| N, K = list(map(int, input().split()))
l = []
i = 0
for x in input().split():
A = int(x)
if K < N - i:
l.insert(0, A)
if i >= K:
if l.pop() < A:
print("Yes")
else:
print("No")
i = i + 1
| p02602 |
N,K = list(map(int,input().split()))
a = list(map(int,input().split()))
t = []; u = 1
for i in range(K):
u *= a[K-i-1]
t.append(u)
for i in range(1,N-K+1):
u = u / a[i-1]
u = u * a[K+i-1]
t.append(u)
if t[i-1]<t[i]:
print("Yes")
else:
print("No") | N,K = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(1,N-K+1):
if a[K+i-1]>a[i-1]:
print("Yes")
else:
print("No") | p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
p=1
for i in range(k):
p*=a[i]
p1=0
p2=k
last=p
for i in range(k,n):
p = p//a[p1]
p*=a[p2]
p1+=1
p2+=1
if p>last:
print('Yes')
else:
print('No')
last=p
| n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
p1=0
p2=k
for i in range(k,n):
if a[p2]>a[p1]:
print('Yes')
else:
print('No')
p1+=1
p2+=1
| p02602 |
tmp = (input().split(' '))
n = int(tmp[0])
k = int(tmp[1])
tmp = input().split(' ')
grades = []
for i in range(len(tmp)):
grades.append(int(tmp[i]))
curr_res = grades[0]
prev_res = grades[0]
for i in range(1,k):
curr_res = curr_res * grades[i]
j = k
while j < n:
prev_res = curr_res
curr_res = curr_res/grades[j-k]
curr_res = curr_res*grades[j]
if curr_res > prev_res:
print('Yes')
else:
print('No')
j+=1
| tmp = (input().split(' '))
n = int(tmp[0])
k = int(tmp[1])
tmp = input().split(' ')
map_tmp = list(map(int,tmp))
grades = list(map_tmp)
j = k
while j < n:
curr_res = grades[j]
prev_res = grades[j-k]
if curr_res > prev_res:
print('Yes')
else:
print('No')
j+=1 | p02602 |
def listseki(A,start,end):
ans=1
for i in range(start,end+1):
ans*=A[i]
return ans
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
oldseki=listseki(A,0,K-1)
for i in range(1,N-K+1):
nowseki=listseki(A,i,i+K-1)
if nowseki>oldseki:
print("Yes")
else:
print("No")
oldseki=nowseki | def listseki(A,start,end):
ans=A[end]/A[start-1]
return ans
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
for i in range(1,N-K+1):
nowseki=listseki(A,i,i+K-1)
if nowseki>1:
print("Yes")
else:
print("No") | p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
syaku=1
for i in range(k):
syaku*=a[i]
now=syaku
for i in range(k,len(a)):
pre=now
now=now*a[i]//a[i-k]
if pre<now:
print("Yes")
else:
print("No")
| n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
#for i in range(k):
# syaku*=a[i]
#now=syaku
for i in range(k,len(a)):
#pre=now
#now=now*a[i]//a[i-k]
if a[i]>a[i-k]:
print("Yes")
else:
print("No")
| p02602 |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
V=list()
for i in range(N-K+1):
a=1
for j in range(K):
a=a*A[(i+j)]
V.append(a)
for i in range((N-K)):
if V[i]<V[i+1]:
print("Yes")
else:
print("No") | N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
V=list()
for i in range(N-K):
if A[i]<A[K+i]:
print("Yes")
else:
print("No") | p02602 |
def prod(X):
val = 1
for x in X:
val = val * x
return val
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
G = [prod(A[:K])]
for i in range(K, N):
val = G[-1] // A[i - K] * A[i]
G.append(val)
# print(G)
for i in range(1, len(G)):
print(('Yes' if G[i] > G[i - 1] else 'No')) | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(K, N):
print(('Yes' if A[i] > A[i - K] else 'No')) | p02602 |
n, k = list(map(int, input().split()))
a_list = list(map(int, input().split()))
score = [1] * (n - k + 1)
for i in range(k):
score[0] *= a_list[i]
for i in range(1, n-k+1):
score[i] = (score[i-1] / a_list[i-1]) * a_list[k+i-1]
for i in range(len(score)-1):
if score[i+1] - score[i] > 0:
print("Yes")
else:
print("No")
| n, k = list(map(int, input().split()))
a_list = list(map(int, input().split()))
for i in range(n-k):
if a_list[i] < a_list[k+i]:
print("Yes")
else:
print("No")
| p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(n-k):
c = sum(a[i:i+k])
d = sum(a[i+1:i+k+1])
if c < d:
print("Yes")
else:
print("No") | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(n - k):
if a[i] < a[i + k]:
print("Yes")
else:
print("No") | p02602 |
n, k = list(map(int, input().split()))
a_l = list(map(int, input().split()))
i = 0
score = 1
b_score = None
while i < n:
score *= a_l[i]
if i > k-1:
score = int(score/a_l[i-k])
if b_score is not None:
if score > b_score:
print('Yes')
else:
print('No')
if i >= k-1:
b_score = score
i+=1 | n, k = list(map(int, input().split()))
a_l = list(map(int, input().split()))
i = 0
while i < n:
if i >= k:
if a_l[i] > a_l[i-k]:
print('Yes')
else:
print('No')
i+=1 | p02602 |
n, k = list(map(int,input().split()))
a_list = list(map(int,input().split()))
dp = [1] * (n-k+1)
for i in range(0,k):
dp[0] = dp[0] * a_list[i]
for j in range(1, n-k+1):
dp[j] = dp[j-1] * a_list[k+j-1] / a_list[j-1]
for l in range(len(dp)-1):
if dp[l] < dp[l+1]:
print('Yes')
else:
print('No') | n, k = list(map(int,input().split()))
a_list = list(map(int,input().split()))
for i in range(0, n-k):
if a_list[i] < a_list[k+i]:
print('Yes')
else:
print('No') | p02602 |
def main():
N, K = list(map(int, input().split()))
l = list(map(int, input().split()))
for i in range(N - K):
p = 0
n = 0
for j in range(K):
p = p + l[j+i]
n = n + l[j+i+1]
if p < n:
print('Yes')
else:
print('No')
main()
| def main():
N, K = list(map(int, input().split()))
l = list(map(int, input().split()))
for i in range(K, N):
if l[i] > l[i-K]:
print('Yes')
else:
print('No')
main()
| p02602 |
N,K = [int(i)for i in input().split()]
A = [int(i) for i in input().split()]
S = []
cnt = 0
for i in range(K-1,N):
s = 1
for j in range(i,i-K,-1):
s *= A[j]
S.append(s)
if cnt == 0:
cnt += 1
continue
print(("Yes" if S[cnt-1]<S[cnt] else "No"))
cnt += 1 | N,K = [int(i)for i in input().split()]
A = [int(i) for i in input().split()]
for i in range(K,N):
if A[i] / A[i-K] > 1 :
print("Yes")
else :
print("No") | p02602 |
from sys import stdin
input = stdin.buffer.readline
n, k = list(map(int, input().split()))
*a, = list(map(int, input().split()))
p = 1
for i in range(k):
p *= a[i]
for i in range(k, n):
q = p * a[i] // a[i - k]
if q > p:
print('Yes')
else:
print('No')
p = q
| from sys import stdin
input = stdin.buffer.readline
n, k = list(map(int, input().split()))
*a, = list(map(int, input().split()))
for i in range(k, n):
if a[i] > a[i - k]:
print('Yes')
else:
print('No')
| p02602 |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
point=[1]*N
for i in range(K-1,N):
for j in range(K):
point[i]*=A[i-j]
for i in range(K-1,N-1):
if(point[i]>=point[i+1]):
print("No")
else:
print("Yes") | N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
point=[1]*N
for i in range(N-K):
if(A[K+i]>A[i]):
print("Yes")
else:
print("No")
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
s = [1] * len(a)
s[0] = a[0]
for i in range(n - 1):
s[i + 1] = s[i] * a[i + 1]
num = [0] * (len(a) - k + 1)
num[0] = s[k - 1]
for i in range(len(a) - k):
num[i + 1] = s[i + k] // s[i]
for i in range(len(a) - k):
if num[i] < num[i + 1]:
print('Yes')
else:
print('No')
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(len(a) - k):
if a[i] < a[i + k]:
print('Yes')
else:
print('No') | p02602 |
import functools
import operator
n = functools.partial(functools.reduce, operator.mul)
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
# print(n(A))
S = [0] * K
s = 0
for i in range(K,len(A)+ 1):
# print(i)
# S.append(n(A[(i-1)-(K-1):i]))
# print(n(A[(i-1)-(K-1):i]))
if i == K:
s = n(A[(i-1)-(K-1):i])
continue
else:
if s < n(A[(i-1)-(K-1):i]):
print("Yes")
s = n(A[(i-1)-(K-1):i])
else:
print("No")
s = n(A[(i-1)-(K-1):i])
| import functools
import operator
n = functools.partial(functools.reduce, operator.mul)
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
# print(n(A))
for i in range(K,N):
if A[i-K] < A[i]:
print("Yes")
else:
print("No")
| p02602 |
N,K = list(map(int, input().split()))
Ai = list(map(int, input().split()))
results= []
for i in range(0,N-K + 1):
result = 1
for j in range(i,K + i):
result = result * Ai[j]
results.append(result)
for i in range(0,N-K):
if results[i + 1] > results[i]:
print("Yes")
else:
print("No")
| N,K = list(map(int, input().split()))
Ai = list(map(int, input().split()))
for i in range(0,N-K):
if(Ai[i] < Ai[i+K]):
print("Yes")
else:
print("No")
| p02602 |
n, k = list(map(int, input().split(" ")))
a = list(map(int, input().split(" ")))
score: list = []
for i in range(k - 1, n):
tmp_score = 1
for j in range(k):
tmp_score *= a[i - j]
score.append(tmp_score)
for i in range(len(score) - 1):
# print(score[i], score[i + 1])
if score[i + 1] > score[i]:
print("Yes")
else:
print("No")
| n, k = list(map(int, input().split(" ")))
a = list(map(int, input().split(" ")))
for i in range(k, n):
if a[i - k] < a[i]:
print("Yes")
else:
print("No")
| p02602 |
# coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
#from heapq import heappop, heappush
from collections import defaultdict
sys.setrecursionlimit(10**7)
import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
#from copy import deepcopy
#from collections import deque
def run():
N, K, *A = list(map(int, read().split()))
A = [-1] + A
INF = 1 << 50
X = [INF, 1, 1]
for i, a in enumerate(A[1:], 1):
pre = X[1]
if i <= K:
if a == 0:
X[0] = i
X[1] = 0
X[2] = 1
continue
X[1] *= a
X[2] *= a
if i > K:
if a == 0:
X[0] = i
X[1] = 0
X[2] = 1
continue
if i - K == X[0]:
X[0] = INF
X[1] = X[2]
elif A[i-K] == 0:
pass
else:
X[1] /= A[i-K]
X[1] *= a
X[2] *= a
if pre < X[1]:
print('Yes')
else:
print('No')
if __name__ == "__main__":
run() | # coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
#from heapq import heappop, heappush
from collections import defaultdict
sys.setrecursionlimit(10**7)
import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
#from copy import deepcopy
#from collections import deque
def run():
N, K, *A = list(map(int, read().split()))
A = [-1] + A
INF = 1 << 50
X = [INF, 1, 1]
for i in range(K, N):
if A[i+1] > A[i-K+1]:
print('Yes')
else:
print('No')
if __name__ == "__main__":
run() | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
AA = []
for i in range(N - K + 1):
f = 1
for j in range(i, i + K):
f *= A[j]
AA.append(f)
for i in range(len(AA) - 1):
if AA[i] < AA[i + 1]:
print("Yes")
else:
print("No") | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(K, N):
if A[i - K] < A[i]:
print("Yes")
else:
print("No") | p02602 |
def main():
N, K = input_ints()
A = input_int_list_in_line()
hyouten = 1
for i in range(K):
hyouten *= A[i]
for i in range(N-K):
new_hyouten = hyouten / A[i] * A[i+K]
if hyouten < new_hyouten:
print('Yes')
else:
print('No')
hyouten = new_hyouten
def input_ints():
line_list = input().split()
if len(line_list) == 1:
return int(line_list[0])
else:
return list(map(int, line_list))
def input_int_list_in_line():
return list(map(int, input().split()))
def input_int_tuple_list(n: int):
return [tuple(map(int, input().split())) for _ in range(n)]
main()
| def main():
N, K = input_ints()
A = input_int_list_in_line()
for i in range(N-K):
if A[i] < A[i+K]:
print('Yes')
else:
print('No')
def input_ints():
line_list = input().split()
if len(line_list) == 1:
return int(line_list[0])
else:
return list(map(int, line_list))
def input_int_list_in_line():
return list(map(int, input().split()))
def input_int_tuple_list(n: int):
return [tuple(map(int, input().split())) for _ in range(n)]
main()
| p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
tmp=1
for i in range(k):
tmp*=a[i]
for i in range(n-k):
prev=tmp
tmp=int(tmp/a[i]*a[i+k])
#print(tmp)
if tmp>prev:
print("Yes")
else:
print("No")
| n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(n-k):
if a[i]<a[i+k]:
print("Yes")
else:
print("No")
| p02602 |
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))
N, K = LI()
A = LI()
for i in range(N - K):
if A[i] < A[i + K]:
ans = "Yes"
else:
ans = "No"
print(ans) | #!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))
# N, K = LI()
# A = LI()
# for i in range(N - K):
# if A[i] < A[i + K]:
# ans = "Yes"
# else:
# ans = "No"
# print(ans)
N, K = LI()
A = LI()
for i in range(N - K):
if A[i] < A[i + K]:
ans = "Yes"
else:
ans = "No"
print(ans) | p02602 |
n,k = map(int,input().split())
a = list(map(int,input().split()))
p = 0
if n <= 2:
if a[0] < a[1]:
exit(print('Yes'))
else:
exit(print('No'))
p = 1
for i in range(k): p *= a[i]
for i in range(k,n):
t = p * a[i]
p *= a[i-k]
if p < t:
print('Yes')
else:
print('No')
p = t
| n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(k,n): print(('Yes' if a[i] > a[i-k] else 'No')) | p02602 |
# coding: utf-8
def main():
N, K = list(map(int, input().split()))
A = list((list(map(int, input().split()))))
score = 1
for i in range(K):
score *= A[i]
for i in range(N-K):
pre = score
score = score // A[i] * A[K+i]
if score > pre:
print("Yes")
else:
print("No")
main()
| # coding: utf-8
def main():
N, K = list(map(int, input().split()))
A = list((list(map(int, input().split()))))
for i in range(N-K):
if A[i] < A[K+i]:
print("Yes")
else:
print("No")
main()
| p02602 |
n, k = list(map(int,input().split()))
A = list(map(int,input().split()))
res=[0]*(n-k+1)
for i in range(n-k+1):
x = 1
for j in A[i:k+i]:
x *= j
res[i]=x
for i in range(1,len(res)):
if res[i] > res[i-1]:
print('Yes')
else:
print('No') | n, k = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(n-k):
if A[k+i] > A[i]:
print('Yes')
else:
print('No') | p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
result = 1
for i in range(k):
result *= a[k - i]
for i in range(k, n):
before_result = result
result /= a[i - k]
result *= a[i]
if before_result < result:
print("Yes")
else:
print("No")
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(k, n):
if a[i - k] < a[i]:
print("Yes")
else:
print("No")
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = [0] * (n - k + 1)
b[0]+=a[0]
for i in range(k-1):
b[0] *= a[i + 1]
for j in range(len(b) - 1):
b[j + 1] = (b[j + 1] + b[j]) // a[j] * a[j + k]
for l in range(len(b)-1):
if b[l] < b[l + 1]:
print("Yes")
else:
print("No") | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n - k):
if a[i] >= a[i + k]:
print("No")
else:
print("Yes") | p02602 |
n, k = list(map(int,input().split()))
a = [int(i) for i in input().split()]
a.reverse()
lists = []
answer = a[0]
for i in range(1, k):
answer = answer * a[i]
lists.append(answer)
for i in range(n - k):
answer = answer / a[i] * a[i + k]
lists.append(answer)
lists.reverse()
for i in range(n - k):
if lists[i] < lists[i + 1]:
print("Yes")
else:
print("No")
| n, k = list(map(int,input().split()))
a = [int(i) for i in input().split()]
a.reverse()
lists = []
for i in range(n - k):
if a[i] <= a[i + k]:
lists.append(0)
else:
lists.append(1)
lists.reverse()
for i in range(n - k):
if lists[i] == 1:
print("Yes")
else:
print("No")
| p02602 |
from functools import reduce
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
before = reduce(lambda a, b: a * b, A[:K])
for i in range(0, N - K):
temp = before // A[i] * A[K + i]
if temp > before:
print("Yes")
else:
print("No")
before = temp | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(0, N - K):
if A[i] < A[K + i]:
print("Yes")
else:
print("No") | p02602 |
import math
import collections
import fractions
import itertools
import functools
import operator
def solve():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ruiseki = [1]
ruiseki2 = []
for i in range(1, n+1):
ruiseki.append(a[i-1]*ruiseki[i-1])
for i in range(k-1, n):
ruiseki2.append(ruiseki[i+1]//ruiseki[i-k+1])
for i in range(n-k):
if ruiseki2[i] < ruiseki2[i+1]:
print("Yes")
else:
print("No")
return 0
if __name__ == "__main__":
solve()
| import math
import collections
import fractions
import itertools
import functools
import operator
def solve():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(k, n):
if a[i] > a[i-k]:
print("Yes")
else:
print("No")
return 0
if __name__ == "__main__":
solve() | p02602 |
n, k = list(map(int, input().split()))
dat = list(map(int, input().split()))
prev = 1
for i in range(k):
prev *= dat[i]
for i in range(n-k):
new = dat[k + i]
nukeru = dat[i]
newval = prev // nukeru * new
if newval > prev:
print("Yes")
else:
print("No")
prev = newval | n, k = list(map(int, input().split()))
dat = list(map(int, input().split()))
prev = dat[0]
for i in range(n-k):
new = dat[k + i]
nukeru = dat[i]
if new > nukeru:
print("Yes")
else:
print("No")
prev = new
| p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
seiseki = []
for i in range(N - K + 1):
num = 1
for j in range(K):
num *= A[i + j]
seiseki.append(num)
if i > 0:
if seiseki[-2] < seiseki[-1]:
print("Yes")
else:
print("No") | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
seiseki = []
for i in range(N - K):
if A[i] < A[i + K]:
print("Yes")
else:
print("No") | p02602 |
import math
import collections
import fractions
import itertools
import functools
import operator
def solve():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ruiseki = [1]
for i in range(1, n+1):
ruiseki.append(a[i-1]*ruiseki[i-1])
for i in range(k-1, n-1):
if ruiseki[i+1]//ruiseki[i-k+1] >= ruiseki[i+2]//ruiseki[i+2-k]:
print("No")
else:
print("Yes")
return 0
if __name__ == "__main__":
solve()
| import math
import collections
import fractions
import itertools
import functools
import operator
def solve():
n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(k, n):
print("Yes") if a[i] > a[i-k] else print("No")
return 0
if __name__ == "__main__":
solve()
| p02602 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,k = list(map(int,readline().split()))
a = list(map(int,readline().split()))
c = 1
for i in range(k):
c *= a[i]
for i in range(n-k):
chk = c*a[k+i]//a[i]
if chk > c:
print('Yes')
else:
print('No') | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,k = list(map(int,readline().split()))
a = list(map(int,readline().split()))
for i in range(n-k):
chk = a[k+i]
c = a[i]
if chk > c:
print('Yes')
else:
print('No') | p02602 |
# C - Marks
from functools import reduce
from operator import mul
def main():
N, K, *A = list(map(int, open(0).read().split()))
top_idx, prev_score = 0, reduce(mul, A[:K])
res = []
for top, cur in zip(A, A[K:]):
cur_score = prev_score // top * cur
res.append("Yes" if cur_score > prev_score else "No")
prev_score = cur_score
print(("\n".join(res)))
if __name__ == "__main__":
main()
| # C - Marks
def main():
N, K, *A = list(map(int, open(0).read().split()))
res = ["Yes" if tail > top else "No" for top, tail in zip(A, A[K:])]
print(("\n".join(res)))
if __name__ == "__main__":
main()
| p02602 |
N, K = [int(s) for s in input().split()]
A = [int(s) for s in input().split()]
x = 1
for i in range(N):
x_before = x
x = x * A[i]
if i >= K:
x = x / A[i - K]
if x > x_before:
print('Yes')
else:
print('No') | N, K = [int(s) for s in input().split()]
A = [int(s) for s in input().split()]
x = 1
for i in range(K, N):
if A[i] > A[i - K]:
print('Yes')
else:
print('No') | p02602 |
#!/usr/bin/env python
# coding: utf-8
# In[2]:
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
# In[3]:
def main():
x0 = 1
for i in range(K):
x0 *= A[i]
x = x0
for j in range(K,N):
score = x*A[j]//A[j-K]
if score > x:
print("Yes")
else:
print("No")
x = score
# In[4]:
if __name__ == '__main__':
main()
# In[ ]:
| #!/usr/bin/env python
# coding: utf-8
# In[2]:
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
# In[9]:
def main():
for j in range(K,N):
if A[j] > A[j-K]:
print("Yes")
else:
print("No")
# In[10]:
if __name__ == '__main__':
main()
# In[ ]:
| p02602 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
temp = 1
for i in range(N):
before = temp
temp *= A[i]
if i >= K:
temp /= A[i-K]
if temp > before:
print("Yes")
else:
print("No")
| N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(N):
if i >= K:
if A[i] > A[i-K]:
print("Yes")
else:
print("No")
| p02602 |
from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
n,k=nii()
a=lnii()
p=1
for i in range(k):
p*=a[i]
for i in range(k,n):
old_p=p
p//=a[i-k]
p*=a[i]
if old_p<p:
print('Yes')
else:
print('No') | from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
n,k=nii()
a=lnii()
for i in range(k,n):
old=a[i-k]
new=a[i]
if old<new:
print('Yes')
else:
print('No') | p02602 |
n,k=list(map(int,input().split()))
a=[1] + list(map(int,input().split()))
m=1
for i in range(1,k+1):
m*=a[i]
for i in range(k+1,n+1):
mm=m*a[i]//a[i-k]
if mm>m:
print("Yes")
else:
print("No")
m=mm
| n,k=list(map(int,input().split()))
a=[1] + list(map(int,input().split()))
for i in range(k+1,n+1):
if a[i]>a[i-k]:
print("Yes")
else:
print("No")
| p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
bs = 1
for i in range(K):
bs *= A[i]
for i in range(N - K):
s = bs * A[K + i] // A[i]
if s > bs:
print('Yes')
else:
print('No')
bs = s
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(N - K):
if A[K + i] > A[i]:
print('Yes')
else:
print('No')
| p02602 |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
def score(A,N,K):
s=1
for i in range(N-K+1,N+1):
s*=A[i]
return s
for i in range(K-1,N-1):
a=score(A,i,K)
b=score(A,i+1,K)
if(a<b):
print('Yes')
else:
print('No') | N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
for i in range(K-1,N-1):
a=A[i-K+1]
b=A[i+1]
if(a<b):
print('Yes')
else:
print('No') | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = [1] * (N-K+1)
for i in range(N-K+1):
for j in A[i:K+i]:
B[i] *= j
for i in range(N-K):
if B[i+1] > B[i]:
print('Yes')
else:
print('No')
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(N-K):
if A[i+K] > A[i]:
print('Yes')
else:
print('No')
| p02602 |
n, k = [int(x) for x in input().split()]
list_a = list([int(x) for x in input().split()])
score = 1
for each in list_a[0:k]:
score *= each
for i, next_score in enumerate(list_a[k:]):
score_before = score
score = score_before * next_score / list_a[i]
if score > score_before:
print('Yes')
continue
print('No') | n, k = [int(x) for x in input().split()]
list_a = list([int(x) for x in input().split()])
band_score = 1
for i, score in enumerate(list_a[k:]):
if list_a[i] < score:
print('Yes')
continue
print('No')
| p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
score=1
for i in range(k):
score*=a[i]
for i in range(k,n):
score_b = score
score = score_b/a[i-k]*a[i]
if score_b < score:
print("Yes")
else:
print("No") | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(k,n):
zenkai = a[i-k]
konkai = a[i]
if zenkai < konkai:
print("Yes")
else:
print("No") | p02602 |
n,k = list(map(int,input().split()))
a = [int(n) for n in input().split()]
cur = 1
for i in range(k):
cur *= a[i]
for i in range(k,n):
nxt = cur // a[i - k] * a[i]
if (nxt > cur):
print("Yes")
else:
print("No")
cur = nxt
| n,k = list(map(int,input().split()))
a = [int(n) for n in input().split()]
for i in range(k,n):
if (a[i] > a[i - k]):
print("Yes")
else:
print("No")
| p02602 |
import functools
import operator
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
R = []
for i in range(N-K+1):
X = functools.reduce(operator.mul,A[i:i+K])
R.append(X)
if i ==0:
continue
else:
if X > R[i-1]:
print("Yes")
else:
print("No")
| N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(K-1,N-1):
if A[i-(K-1)] < A[i+1]:
print("Yes")
else:
print("No") | p02602 |
import functools
import operator
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
prod = functools.partial(functools.reduce, operator.mul)
tmp_sum_prod = prod(A[:K])
for i in range(K, N):
sum_prod = int(tmp_sum_prod * A[i]/A[i-K])
if sum_prod > tmp_sum_prod:
print('Yes')
else:
print('No')
tmp_sum_prod = sum_prod
| import functools
import operator
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# prod = functools.partial(functools.reduce, operator.mul)
# tmp_sum_prod = prod(A[:K])
for i in range(K, N):
sum_prod = (A[i]/A[i-K])
if sum_prod > 1.0:
print('Yes')
else:
print('No')
tmp_sum_prod = sum_prod
| p02602 |
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
limit, mul, m = n-k+1, [], 1
for i in range(limit):
if i == 0:
for j in a[i: k+i]:
m *= j
else:
print(('Yes' if m < (m//a[i-1])*a[k+i-1] else 'No'))
m = (m//a[i-1])*a[k+i-1] | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n - k):
if a[k+i] > a[i]:
print('Yes')
else:
print('No') | p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
l=[]
score=1
for i in range(k):
score*=a[i]
l.append(score)
m=k
d=0
multi=a[m]
div=a[d]
for i in range(k+1,n+1):
score=(score*a[m])//a[d]
l.append(score)
m+=1
d+=1
old=l[0]
for i in range(1,len(l)):
if l[i]<=old:
print("No")
else:
print("Yes")
old=l[i]
| n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
m=k
d=0
for i in range(k+1,n+1):
if a[m]<=a[d]:
print("No")
else:
print("Yes")
m+=1
d+=1 | p02602 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
Hk = 1
for i in range(K):
Hk*=A[i]
for i in range(K,N):
pv=Hk
Hk=Hk*A[i]//A[i-K]
# print(Hk)
if Hk>pv:
print('Yes')
else:
print('No')
| #!/usr/bin python3
# -*- coding: utf-8 -*-
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(K,N):
if A[i]>A[i-K]:
print('Yes')
else:
print('No')
| p02602 |
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 S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
N,K = MI()
A = [0] + LI()
for i in range(K+1,N+1):
if A[i] > A[i-K]:
print('Yes')
else:
print('No')
| 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 = [0] + LI()
for i in range(K+1,N+1):
print(('Yes' if A[i] > A[i-K] else 'No'))
| p02602 |
from itertools import accumulate
from operator import mul
from sys import stdin
def main():
input = lambda: stdin.readline()[:-1]
N, K = list(map(int, input().split()))
A = tuple(map(int, input().split()))
point = list(accumulate(A[:K], mul))
for i in range(K, N):
point.append(point[-1] * A[i] // A[i - K])
for i in range(K, N):
if point[i - 1] < point[i]:
print("Yes")
else:
print("No")
main()
| from sys import stdin
def main():
input = lambda: stdin.readline()[:-1]
N, K = list(map(int, input().split()))
A = tuple(map(int, input().split()))
for i in range(K, N):
if A[i - K] < A[i]:
print("Yes")
else:
print("No")
main()
| p02602 |
n, k = list(map(int, input().split()))
scores = list(map(int, input().split()))
evals = []
eval = scores[0:k]
for i in range(k, n, 1):
new = scores[i-k+1:i+1]
if eval[0] < new[-1]:
evals.append('Yes')
else:
evals.append('No')
eval = new
for ans in evals:
print(ans) | n, k = list(map(int, input().split()))
scores = list(map(int, input().split()))
evals = []
cnt = 0
for i in range(k, n, 1):
edge = scores[cnt]
new_edge = scores[i]
if edge < new_edge:
print('Yes')
else:
print('No')
cnt += 1 | p02602 |
n, k = list(map(int, input().split()))
li_a = list(map(int, input().split()))
wk = 1
li_answer = list()
for idx, v in enumerate(li_a):
prev = wk
if idx <= (k - 1):
wk = wk * v
else:
wk = wk * v // li_a[idx - k]
if prev >= wk:
print('No')
else:
print('Yes')
| n, k = list(map(int, input().split()))
li_a = list(map(int, input().split()))
for idx, v in enumerate(li_a):
if idx <= (k - 1):
pass
else:
if v > li_a[idx - k]:
print('Yes')
else:
print('No')
| p02602 |
from collections import deque
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
# まずスタートの点数
p_pre = 1
for item in a[:k]:
p_pre *= item
# n-k回やる
for i in range(n-k):
# iこ目をなくしてk+iこめをふやす
p_next = ((p_pre / a[i]) * a[k+i])
if p_next > p_pre:
print("Yes")
else:
print("No")
p_pre = p_next
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
# n-k回やる
for i in range(n-k):
# iこ目をなくしてk+iこめをふやす
if a[k+i] > a[i]:
print("Yes")
else:
print("No")
| p02602 |
import copy
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
b = copy.deepcopy(a)
for i in range(K-1, N, 1):
for j in range(1, K):
b[i] *= a[i-j]
if i >= K and b[i] > b[i-1]:
print("Yes")
if i >= K and b[i] <= b[i-1]:
print("No") | N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(K, N):
if a[i] > a[i-K]:
print("Yes")
else:
print("No") | p02602 |
def LI():
return list(map(int,input().split()))
n,k=LI()
a=LI()
fir=1
for i in range(k):
fir*=a[i]
# print(fir)
for i in range(k,n):
sec=fir*a[i]
sec=sec//a[i-k]
if sec>fir:
print("Yes")
else:
print("No")
fir=sec
# print(sec) | def LI():
return list(map(int,input().split()))
n,k=LI()
a=LI()
for i in range(n-k):
if a[i]<a[i+k]:
print("Yes")
else:
print("No") | p02602 |
n,k,*a=list(map(int,open(0).read().split()))
for i in range(n-k):print(("Yes" if a[i]<a[i+k] else "No")) | n,k,*a=list(map(int,open(0).read().split()))
for i in range(n-k):
if a[i]<a[i+k]:
print("Yes")
else:
print("No")
| p02602 |
f=lambda:[*list(map(int,input().split()))]
n,k=f()
ｌ=f()
for i in range(n-k):
print(('YNeos'[l[i]>=l[i+k]::2])) | n,k,*l=list(map(int,open(0).read().split()))
for i in range(n-k): print(('YNeos'[l[i]>=l[i+k]::2])) | p02602 |
import operator
import functools
def main():
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
p = 0
for i in range(K-1,N):
lst= A[i-K+1:i+1]
p = sum(lst)
#p = mul(lst)
#p = functools.reduce(operator.mul,lst)
if i != K-1:
if p <= prev:
print('No')
else:
print('Yes')
prev = p
if __name__ == "__main__":
main()
| def main():
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
p = 0
for i in range(K-1,N):
#lst= A[i-K+1:i+1]
#p = sum(lst)
#p = mul(lst)
#p = functools.reduce(operator.mul,lst)
if i != K-1:
if A[i] <= A[i-K]:
print('No')
else:
print('Yes')
if __name__ == "__main__":
main()
| p02602 |
N, K = list(map(int, input().split()))
A = list(int(a) for a in input().split())
Acum = [1] * (N+1)
for i in range(N):
Acum[i+1] = Acum[i] * A[i]
for j in range(K, N):
now = Acum[j] // Acum[j-K]
nxt = Acum[j+1] // Acum[j+1-K]
if now < nxt:
print('Yes')
else:
print('No') | N, K = list(map(int, input().split()))
A = list(int(a) for a in input().split())
B = []
tmp = 1
for i in range(N):
tmp *= A[i]
if i < K-1:
continue
if i > K-1:
tmp //= A[i-K]
B.append(tmp)
for i in range(N-K):
if B[i] < B[i+1]:
print('Yes')
else:
print('No') | p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
st = 1 #k楽器
for i in range(k):
st *= a[i]
for i in range(n-k):
if st < st//a[i]*a[i+k]:
print('Yes')
else:
print('No')
st = st//a[i]*a[i+k]
| n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(n-k):
if a[i] < a[i+k]:
print('Yes')
else:
print('No') | p02602 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.