input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from functools import reduce
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
res = [0] * (n-k+1)
res[0] = reduce(lambda x, y: x*y , A[0:k+1])
for i in range(1, n-k+1):
res[i] = res[i-1]//A[i-1]*A[i+k-1]
print(('Yes' if res[i-1] < res[i] else 'No'))
| from functools import reduce
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(0, n-k):
print(('Yes' if A[i] < A[i+k] else 'No'))
| p02602 |
NK = list(map(int, input().split(' ')))
N = NK[0]
K = NK[1]
A = list(map(int, input().split(' ')))
score = A[0]
for i in range(1, K):
score = score * A[i]
for i in range(K, N):
prev_score = score
score = score * A[i] / A[i-K]
if (prev_score < score):
print('Yes')
else:
print('No')
| NK = list(map(int, input().split(' ')))
N = NK[0]
K = NK[1]
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()))
score=[0]*(n-k+1)
for i in range(k-1,n):
score[i-k+1]=1
for j in range(k):
score[i-k+1]*=a[i-j]
for i in range(1,n-k+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]>a[i-k]:
print('Yes')
else:
print('No')
| p02602 |
N,K = list(map(int,input().split()))
A = [1]+list(map(int,input().split()))
for i in range(1,N+1):
A[i] = A[i-1]*A[i]
for i in range(K+1, N+1):
prev = A[i-1] // A[i-K-1]
now = A[i] // A[i-K]
if now > prev:
print('Yes')
else:
print("No") | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
prev = 1
for i in range(K):
prev *= A[i]
for i in range(K+1, N+1):
now = (prev // A[i-K-1]) * A[i-1]
if now > prev:
print('Yes')
else:
print("No")
prev = now
| p02602 |
# coding: utf-8
import sys
from math import log
def change_into_int(lists):
tmps = lists.split(' ')
num_list = []
for n in tmps:
num_list.append(int(n))
return num_list
def create_result(one_list):
ans = 0
for n in one_list:
ans = ans + log(n)
return ans
def create_lists(data, point):
num_lists = []
flag = 0
count = 0
while(flag == 0):
tmp_list = []
for i in range(point):
tmp_list.append(data[i+count])
# print(i+count)
if i+count == len(data)-1:
flag = 1
count = count + 1
ans = create_result(tmp_list)
num_lists.append(ans)
return num_lists
if __name__ == "__main__":
lines = []
result_list = []
# 入力
for l in sys.stdin:
lines.append(l.rstrip('\r\n'))
# int
num1 = change_into_int(lines[0])
data = change_into_int(lines[1])
# k個分のlistを作成
# [2,3,4,5,6]
# [[2,3],[3,4], ...]
result_list = create_lists(data, num1[1])
# # 取り出して積つくる
# for one_list in lists:
# result_list.append(create_result(one_list))
# 判断
for n in range(len(result_list)-1):
if result_list[n] < result_list[n+1]:
print("Yes")
else:
print("No")
| # coding: utf-8
import sys
from math import log
def change_into_int(lists):
tmps = lists.split(' ')
num_list = []
for n in tmps:
num_list.append(int(n))
return num_list
if __name__ == "__main__":
lines = []
result_list = []
# 入力
for l in sys.stdin:
lines.append(l.rstrip('\r\n'))
# int
num1 = change_into_int(lines[0])
data = change_into_int(lines[1])
i = 0
while(True):
ans = data[i] - data[i+num1[1]]
if ans < 0:
print("Yes")
else:
print("No")
i = i + 1
if i+num1[1] == len(data):
break
| p02602 |
s = input().split()
N = int(s[0])
K = int(s[1])
A = input().split()
for i in range(K, N):
m1 = 1
m2 = 1
for j in range(K):
m1 *= int(A[i - j - 1])
m2 *= int(A[i - j - 0])
print(('Yes' if m1 < m2 else 'No'))
| s = input().split()
N = int(s[0])
K = int(s[1])
A = input().split()
for i in range(K, N):
m1 = int(A[i - K])
m2 = int(A[i])
print(('Yes' if m1 < m2 else 'No'))
| p02602 |
from itertools import accumulate
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
acc = [0]
acc.extend(list(accumulate(A)))
#print(acc)
scores = []
for i in range(K, N + 1):
scores.append(acc[i] - acc[i - K])
#print(scores)
for i in range(1, N - K + 1):
if scores[i] > scores[i - 1]:
print('Yes')
else:
print('No')
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = ['Yes' if A[i] > A[i - K] else 'No' for i in range(K, N)]
print(("\n".join(ans))) | p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list()
x=1
for i in range(k):
x*=a[i]
b.append(x)
for i in range(k, n):
x/=a[i-k]
x*=a[i]
b.append(x)
x=0
for i in b:
if x==0:
x=i
else:
if x<i:
x=i
print("Yes")
else:
x=i
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])>1:
print("Yes")
else:
print("No")
| p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
prev = 1
for i in range(K):
prev *= A[i]
idx = 0
for i in range(K, N):
now = prev // A[idx] * A[i]
if prev < now:
ans = "Yes"
else:
ans = "No"
print(ans)
prev = now
idx += 1 | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
idx = 0
for i in range(K, N):
if A[idx] < A[i]:
ans = "Yes"
else:
ans = "No"
print(ans)
idx += 1 | p02602 |
from operator import mul
from functools import reduce
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
for i in range(N-K) :
x=reduce(mul,A[i:i+K])
y=reduce(mul,A[i+1:i+K+1])
if x<y :
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")
elif A[i]>=A[i+K] :
print("No") | p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = [1]
for i in range(n):
b.append(a[i]*b[-1])
for i in range(n-k):
if b[i+k+1]/b[i+1] > b[i+k]/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] < a[i+k]:
print("Yes")
else:
print("No") | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(K+1,N+1):
# print(A[i-K-1:i-1],A[i-K:i])
if sum(A[i-K-1:i-1]) < sum(A[i-K:i]):
print("Yes")
else:
print("No") | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
prev = sum(A[0:K])
for i in range(K+1,N+1):
curr = prev - A[i-K-1] + A[i-1]
if prev < curr:
print("Yes")
else:
print("No")
prev = curr | p02602 |
from operator import mul
from functools import reduce
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
r = [0] * (n - k + 1)
for i in range(n - k + 1):
r[i] = reduce(mul, a[i : i + k])
if i > 0:
if r[i] > 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, n):
if a[i - k] < a[i]:
print("Yes")
else:
print("No")
| p02602 |
n,k = list(map(int,input().split()))
alis = list(map(int,input().split()))
value = 1
for i in range(k):
value = value * alis[i]
vlis = [value]
for i in range(k,n):
vlis.append(vlis[i-k]*alis[i]/alis[i-k])
for i in range(1,n-k+1):
if vlis[i] > vlis[i-1]:
print('Yes')
else:
print('No') | n,k = list(map(int,input().split()))
alis = list(map(int,input().split()))
for i in range(n-k):
if(alis[i]<alis[i+k]):
print('Yes')
else:
print('No') | p02602 |
N,K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
def cal(a):
res = 1
for i in a:
res*=i
return res
score = [cal([j for j in A[i-K:i] ]) for i in range(K,N+1)]
for i in range(len(score)):
if i==0: continue
if score[i] > score[i-1]:
print("Yes")
else:
print("No") | N,K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
for i in range(K,N):
if A[i] > A[i-K]:
print("Yes")
else:
print("No") | p02602 |
# coding: utf-8
import itertools
from functools import reduce
from collections import deque
N, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
seiseki = deque([])
seiseki2 = []
for i in range(N):
seiseki.append(A[i])
if len(seiseki) == K:
seiseki2.append(reduce(lambda a, b: a * b, seiseki, 1))
seiseki.popleft()
zenkai = seiseki2[0]
for i in range(1, len(seiseki2)):
if seiseki2[i] > zenkai:
print("Yes")
else:
print("No")
zenkai = seiseki2[i]
| # coding: utf-8
import itertools
from functools import reduce
from collections import deque
N, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
for i in range(N):
if i > K-1:
if A[i] > A[i-K]:
print("Yes")
else:
print("No")
| p02602 |
import sys
import copy
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
INF = 1000000000000
n,k = LI()
a = LI()
preval = 1
val = 1
for i in range(n):
val = val * a[i]
if(i >= k):
val = val // a[i-k]
if(preval < val):
print('Yes')
else:
print('No')
preval = val | import sys
import copy
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
INF = 1000000000000
n,k = LI()
a = LI()
for i in range(n):
if(i >= k):
if(a[i] > a[i-k]):
print('Yes')
else:
print('No') | p02602 |
def main():
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
hyouka = [0]*(N-K+1)
kekka = 1
for i in range(N-K+1):
if i == 0:
for j in As[i:i+K]:
kekka *= j
hyouka[i]=kekka
else:
kekka = kekka/As[i-1]*As[i+K-1]
hyouka[i]=int(kekka)
#print(hyouka)
for j in range(len(hyouka)):
if j>0:
if hyouka[j] > hyouka[j-1]:
print('Yes')
else:
print("No")
if __name__ == '__main__':
main() | def main():
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
hyouka = [0]*(N-K+1)
"""
kekka = 1
for i in range(N-K+1):
if i == 0:
for j in As[i:i+K]:
kekka *= j
hyouka[i]=kekka
else:
kekka = kekka/As[i-1]*As[i+K-1]
hyouka[i]=int(kekka)
#print(hyouka)
for j in range(len(hyouka)):
if j>0:
if hyouka[j] > hyouka[j-1]:
print('Yes')
else:
print("No")
"""
for i in range(N-K):
if As[i] < As[i+K]:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main() | p02602 |
from functools import reduce
from operator import mul
N,K,*A = list(map(int,open(0).read().split()))
base = reduce(mul,A[:K])
for i in range(K,N):
score = base // A[i-K] * A[i]
print(("Yes" if base < score else "No"))
base = score
| from functools import reduce
from operator import mul
N,K,*A = list(map(int,open(0).read().split()))
base = sum(A[:K])
for i in range(K,N):
score = base - A[i-K] + A[i]
print(("Yes" if base < score else "No"))
base = score | p02602 |
def resolve():
from collections import deque
N, K = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
sA = 1
s = deque()
for i in range(K):
s.append(A[i])
sA *= A[i]
tmp = sA
for i in range(K, N):
sA //= s.popleft()
s.append(A[i])
sA *= A[i]
if tmp < sA:
print("Yes")
else:
print("No")
tmp = sA
resolve()
| def resolve():
from collections import deque
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 - K] < A[i]:
print("Yes")
else:
print("No")
resolve()
| p02602 |
n,k = list(map(int , input().split()))
sum = 0
a = list(map(int , input().split()))
tmp = 1
for i in range(0,k):
tmp *= a[i]
for i in range(k,n):
# print(tmp)
if tmp*a[i]/a[i-k] > tmp:
print("Yes")
else:
print("No")
tmp = tmp*a[i]/a[i-k] | n,k = list(map(int , input().split()))
sum = 0
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 = (int(x) for x in input().split())
A = [int(x) for x in input().split()]
#print(N)
#print(K)
#print(A)
preX = 0
nowX = 1
for i in range(K,N+1):
# print(str(i)+'学期')
if i == K:
for x in range(K):
nowX *= A[x]
else:
nowX = int(preX / A[i-K-1]) * A[i-1]
# print(str(preX) +', '+ str(nowX))
if preX < nowX:
print('Yes')
else:
print('No')
preX = nowX
| N,K = (int(x) for x in input().split())
A = [int(x) for x in input().split()]
#print(N)
#print(K)
#print(A)
preX = 0
nowX = 1
for i in range(K+1,N+1):
# print(str(i)+'学期')
# if i == K:
# for x in range(K):
# nowX *= A[x]
# else:
# nowX = int(preX / A[i-K-1]) * A[i-1]
# print(str(preX) +', '+ str(nowX))
# if preX < nowX:
# print('Yes')
# else:
# print('No')
# preX = nowX
if A[i-K-1] < A[i-1]:
print('Yes')
else:
print('No')
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
t = 0
s = 1
u = 0
k_k = k
temp = []
while k != n+1:
for i in range(t, k):
alpha = a[i]
s = s * alpha
temp.append(s)
k = k + 1
s = 1
t = t+1
if u != 0:
t_s = temp[u-1]
t_t = temp[u]
if t_s < t_t:
print("Yes")
u = u + 1
else:
print("No")
u = u + 1
else:
u = u + 1
| 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()))
num = 1
for i in range(n):
pre_num = num
num *= a[i]
if i >= k:
num /= a[i-k]
if i >= k and num > pre_num:
print('Yes')
elif i >= k and num <= pre_num:
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 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
score = [1 for _ in range(n-k+1)]
temp = 1
for i in range(k):
temp *= a[i]
score[0] = temp
for j in range(1,n-k+1):
score[j] = score[j-1]*a[j+k-1]//a[j-1]
#print(score)
for i in range(1,n-k+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 |
#n=int(input())
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
mul=1
for i in range(k):
mul=mul*l[i]
z=mul
j=0
for i in range(k,n):
z=z//l[j]
z=z*l[i]
if z>mul:
print('Yes')
else:
print('No')
j+=1
mul=z | #n=int(input())
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
mul=1
for i in range(k):
mul=mul+l[i]
z=mul
j=0
for i in range(k,n):
z=z-l[j]
z=z+l[i]
if z>mul:
print('Yes')
else:
print('No')
j+=1
mul=z | p02602 |
INT = lambda: int(eval(input()))
INTM = lambda: list(map(int,input().split()))
STRM = lambda: list(map(str,input().split()))
STR = lambda: str(eval(input()))
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
n,k=INTM()
A=LIST()
#flg=True
Ave=[0]*(n-k+1)
for i in range(n-k+1):
Ave[i]=float(sum(A[i:i+k])/k)
for i in range(n-k):
if Ave[i+1]>Ave[i]:
print('Yes')
else:
print('No')
if __name__ == '__main__':
do() | INT = lambda: int(eval(input()))
INTM = lambda: list(map(int,input().split()))
STRM = lambda: list(map(str,input().split()))
STR = lambda: str(eval(input()))
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
n,k=INTM()
A=LIST()
for i in range(n-k):
#print(A[i],A[i+k])
if A[i]<A[i+k]:
print('Yes')
else:
print('No')
if __name__ == '__main__':
do() | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
t = 1
for i in range(K):# A[0] ~ A[K-1]
t *= A[i]
for i in range(K, N):
temp = t // A[i-K] * A[i]
if t < temp:
print('Yes')
else:
print('No')
t = temp
| 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 |
from operator import mul
from functools import reduce
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
beforePoint = reduce(mul, A[:K])
for i in range(0, N-K):
point = (beforePoint//A[i]) * A[i+K]
# print(beforePoint, point)
if beforePoint < point:
print("Yes")
else:
print("No")
beforePoint = point
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(N-K):
# print(A[i], A[i+K])
if A[i] < A[i+K]:
print("Yes")
else:
print("No") | p02602 |
from operator import mul
from functools import reduce
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
score = reduce(mul, A[:k])
for i in range(k, n):
nscore = score//A[i-k]*A[i]
if score < nscore:
print('Yes')
else:
print('No')
score = nscore
| 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()))
prev = 1
for i in range(k):
prev *= A[k-i-1]
left = 0
right = k
tmp = prev
while right<n:
tmp /= A[left]
tmp *= A[right]
if tmp>prev:
print("Yes")
else:
print("No")
prev = tmp
left += 1
right += 1 | n,k = list(map(int,input().split()))
A = list(map(int,input().split()))
left = 0
right = k
while right<n:
if A[right]>A[left]:
print("Yes")
else:
print("No")
left += 1
right += 1 | p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
score = 1
for i in range(k):
score *= a[i]
ans = [score]
for i in range(k, n):
score = score * a[i] // a[i-k]
ans.append(score)
for i in range(n-k):
if ans[i] < ans[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 |
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
now = 1
for i in range(k):
now *= a[i]
for i in range(k,n):
prv = now
now *= a[i]
now /= a[i-k]
if prv < now:
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] > a[i-k]:
print("Yes")
else:
print("No") | p02602 |
def inN():
return int(eval(input()))
def inL():
return list(map(int,input().split()))
n,k = inL()
a = inL()
sum = 1
sum2 = 1
for i in range(k):
sum2 *= a[i]
for i in range(k,n):
#print(sum2)
sum = sum2 * a[i] / a[i-k]
if sum > sum2:
print('Yes')
else:
print('No')
sum2 = sum | def inN():
return int(eval(input()))
def inL():
return list(map(int,input().split()))
n,k = inL()
a = inL()
for i in range(k,n):
if a[i] > a[i-k]:
print('Yes')
else:
print('No')
| p02602 |
N,K = input().split()
scores = [int(s) for s in input().split()]
N = int(N)
K = int(K)
SCORES = 1
answer = []
for i in range(K-1,N):
for j in range(i,i-(K),-1):
SCORES *= scores[j]
answer.append(SCORES)
SCORES = 1
#print(answer)
for l in range(N-K):
if answer[l] < answer[l+1]:
print("Yes")
else:
print("No") | N,K = input().split()
scores = [int(s) for s in input().split()]
N = int(N)
K = int(K)
for i in range(K,N):
if scores[i] <= scores[i-K]:
print("No")
else:
print("Yes") | p02602 |
n,k = list(map(int,input().split()))
A = list(map(int,input().split()))
sc = [0]*(n-k+1)
sc[0] = 1
for i in range(k):
sc[0] *= A[i]
for i in range(1,n-k+1):
sc[i] = (sc[i-1]/A[i-1])*A[k-1+i]
if sc[i] > sc[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[i] < A[k+i]:
print("Yes")
else:
print("No")
| p02602 |
n, k = [int(w) for w in input().split()]
la = [int(w) for w in input().split()]
mul = 1
for i in range(k):
mul *= la[i]
bef = mul
for i in range(k, n):
mul /= la[i-k]
mul *= la[i]
cond = mul > bef
print(("Yes" if cond else "No"))
bef = mul
| n, k = [int(w) for w in input().split()]
la = [int(w) for w in input().split()]
for i in range(k, n):
cond = la[i] > la[i-k]
print(("Yes" if cond else "No"))
| p02602 |
from functools import reduce
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
cum = [0] * (n - k + 1)
cum[0] = reduce(lambda x, y: x * y, a[0:0 + k])
for i in range(1, n - k + 1):
cum[i] = cum[i - 1] * a[i + k - 1] // a[i - 1]
for i in range(1, len(cum)):
if cum[i] > cum[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] < 1:
print('Yes')
else:
print('No')
| p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
tmp = 1
ans = []
for i in range(N):
if i+1 < K:
tmp *= A[i]
continue
tmp *= A[i]
ans.append(tmp)
tmp //= A[i-K+1]
for i in range(1,len(ans)):
if ans[i-1] < ans[i]:
print("Yes")
else:
print("No")
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
tmp = 1
ans = []
for i in range(N):
if i+1 <= K:
continue
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()))
z = 1
for i in range(k):
z = z * a[i]
for i in range(n-k):
t = a[k+i] * z / a[i]
if z < t:
print("Yes")
else:
print("No")
z = t | 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 = [int(i) for i in input().split()]
s = [0 for i in range(n)]
p = [0 for i in range(n)]
s[0] = a[0]
for i in range(1, n):
s[i] = s[i-1] * a[i]
p[k-1] = s[k-1]
for i in range(k, n):
p[i] = int(s[i] / s[i-k])
for i in range(k, n):
if p[i] > p[i-1]:
print("Yes")
else:
print("No")
| n, k = list(map(int, input().split()))
a = [int(i) for i in input().split()]
res = 0
for i in range(n-k):
if a[i+k] - a[i] > 0:
print("Yes")
else:
print("No") | p02602 |
from functools import reduce
from operator import mul
from collections import deque
N,K = list(map(int,input().split()))
A = [int(i) for i in input().split()]
B = deque(A[:K])
C = reduce(mul,B)
for i in range(K,N):
B.popleft()
B.append(A[i])
D = reduce(mul,B)
if C < D:
print('Yes')
else:
print('No')
C = D | from collections import deque
N,K = list(map(int,input().split()))
A = [int(i) for i in input().split()]
B = deque(A[:K])
for i in range(K,N):
if B.popleft() < A[i]:
print('Yes')
else:
print('No')
B.append(A[i])
| p02602 |
import functools
def read():
N, K = list(map(int, input().split(' ')))
As = list(map(int, input().split(' ')))
return N, K, As
def mul(l):
return functools.reduce(lambda x, y: x * y, l)
def fun(N, K, As):
for i in range(N - K):
prev = mul(As[i:i+K])
current = mul(As[i+1:i+K+1])
if current > prev:
print('Yes')
else:
print('No')
if __name__ == '__main__':
N, K, As = read()
fun(N, K, As) | def read():
N, K = list(map(int, input().split(' ')))
As = list(map(int, input().split(' ')))
return N, K, As
def fun(N, K, As):
for i in range(N - K):
prev = As[i]
current = As[i+K]
if current > prev:
print('Yes')
else:
print('No')
if __name__ == '__main__':
N, K, As = read()
fun(N, K, As) | p02602 |
N, K = list(map(int,input().split()))
A = list(map(int,input().split()))
S = [1]
for i in range(0,N):
tmp = S[-1] * A[i]
S.append(tmp)
# print(S)
B = []
for i in range(K,N+1):
B.append(S[i]//S[i-K])
for i in range(1,len(B)):
if(B[i]>B[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]>A[i-K]):
print('Yes')
else:
print('No') | p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
sum = []
s = 1
for i in range(k):
s *= a[i]
sum.append(s)
for i in range(k+1, n+1):
i -= 1
s = s * a[i] // a[i-k]
sum.append(s)
for i in range(n-k):
i += 1
if sum[i] > sum[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):
i -= 1
if a[i-k] < a[i]:
print("Yes")
else:
print("No")
| p02602 |
import sys
from collections import defaultdict, deque, Counter
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: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]
INF = 10 ** 20
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)
def nck(n, k, kaijyo):
return (npk(n, k, kaijyo) * divide(kaijyo[k])) % MOD
def npk(n, k, kaijyo):
if k == 0 or k == n:
return n % MOD
return (kaijyo[n] * divide(kaijyo[n-k])) % MOD
def kaijyo(n):
ret = [1]
for i in range(1, n + 1):
ret.append((ret[-1] * i)% MOD)
return ret
def solve():
n, k = getList()
nums = getList()
pro = [1]
for num in nums:
pro.append(pro[-1] * num)
# print(pro)
for i in range(n - k):
# print(i)
ku = pro[k+i] / pro[i]
ku2 = pro[k+i + 1] / pro[i+ 1]
if ku2 > ku:
print("Yes")
else:
print("No")
if __name__ == "__main__":
# main()
solve() | import sys
from collections import defaultdict, deque, Counter
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: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]
INF = 10 ** 20
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)
def nck(n, k, kaijyo):
return (npk(n, k, kaijyo) * divide(kaijyo[k])) % MOD
def npk(n, k, kaijyo):
if k == 0 or k == n:
return n % MOD
return (kaijyo[n] * divide(kaijyo[n-k])) % MOD
def kaijyo(n):
ret = [1]
for i in range(1, n + 1):
ret.append((ret[-1] * i)% MOD)
return ret
def solve():
n, k = getList()
nums = getList()
# pro = [1]
# for num in nums:
# pro.append(pro[-1] * num)
# print(pro)
for i in range(n - k):
# print(i)
# ku = pro[k+i] / p/] / pro[i+ 1]
if nums[i] < nums[i+k]:
print("Yes")
else:
print("No")
if __name__ == "__main__":
# main()
solve() | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans1 = 1
B = []
for i in range(K):
ans1 = ans1*A[i]
B.append(ans1)
for i in range(N-K):
ans1 = ans1*A[K+i]/A[i]
B.append(ans1)
for i in range(N-K):
if B[i] < B[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[i] < A[K+i]:
print('Yes')
else:
print('No') | p02602 |
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
b = 1
c = 1
a = 0
while K < N:
for i in range(a,K):
b *= A[i]
for j in range(a+1,K+1):
c *= A[j]
if c > b:
print("Yes")
else:print("No")
b=1
c=1
K += 1
a += 1 | N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
a = 0
while K < N:
if A[a] < A[K]:
print("Yes")
else:print("No")
K += 1
a += 1 | p02602 |
N, K = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
#%%
temp1 = 1
T = A[0: K]
for i in T:
temp1 *= i
arr = []
arr.append(temp1)
for i in range(K, N):
temp1 = arr[-1]
temp2 = arr[-1]
temp2 /= A[i - K]
temp2 *= A[i]
arr.append(temp2)
if temp1 < temp2:
print("Yes")
else:
print("No")
|
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 - K] < A[i]:
print("Yes")
else:
print("No") | p02602 |
n, k = list(map(int, input().split()))
arr = list(map(int, input().split()))
for i in range(n - k):
c = sum(arr[i + 1:k + i + 1])
d = sum(arr[i:k + i])
if c > d:
print("Yes")
else:
print("No") | n, k = list(map(int, input().split()))
arr = list(map(int, input().split()))
for i in range(n - k):
if arr[i] < arr[i + k]:
print("Yes")
else:
print("No") | p02602 |
import sys
def IL(): return list(map(int,sys.stdin.readline().rstrip().split()))
if __name__=='__main__':
n,k = IL()
a = list(IL())
l = n-k+1
pre = b = 0
for i in range(l):
result = 1
for rep in a[i:i+k]:
result = result*rep
pre = b
b = result
if 0<i:
if pre<b:
print('Yes')
else:
print('No')
exit() | import sys
def IL(): return list(map(int,sys.stdin.readline().rstrip().split()))
if __name__=='__main__':
n,k = IL()
a = list(IL())
l = n-k
pre = b = 0
for i in range(l):
if a[i]<a[i+k]:
print('Yes')
else:
print('No')
exit() | p02602 |
n, k= list(map(int, input().split()))
a = list(map(int, input().split()))
def main():
scores = []
score = 1
for i in range(k-1, -1, -1):
score *= a[i]
scores.append(score)
scores_append = scores.append
for j in range(k, n):
score_before = scores[-1]
score = score_before * a[j] / a[j-k]
scores_append(score)
if score > score_before:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() | 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()))
answer = 'Yes'
score = 1
for i in range(K):
score *= A[i]
for i in range(N - K):
next_score = score * A[K + i] // A[i]
print(('Yes' if next_score > score else 'No'))
score = next_score
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
answer = 'Yes'
score = 0
for i in range(K):
score += A[i]
for i in range(N - K):
next_score = score + A[K + i] - A[i]
print(('Yes' if next_score > score else 'No'))
score = next_score
| p02602 |
# -*- coding: utf-8 -*-
# 入力を整数に変換して受け取る
def input_int():
return int(eval(input()))
# マイナス1した値を返却
def int1(x):
return int(x) - 1
# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
return list(map(int, input().split()))
# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
return tuple(map(int, input().split()))
# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
return tuple(map(int1, input().split()))
def main():
n, k = input_to_int_map()
a_array = input_to_int_tuple()
temp = [1]
val = 1
for a in a_array:
val *= a
temp.append(val)
pre_k_val = temp[k + 1 - 1]
ini_pre_k_val = temp[k + 1 - 1 - k]
pre_k_val /= ini_pre_k_val
for i in range(k + 1, n + 1):
k_val = temp[i]
ini_k_val = temp[i - k]
k_val /= ini_k_val
if pre_k_val < k_val:
print("Yes")
else:
print("No")
pre_k_val = k_val
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
# 入力を整数に変換して受け取る
def input_int():
return int(eval(input()))
# マイナス1した値を返却
def int1(x):
return int(x) - 1
# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
return list(map(int, input().split()))
# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
return tuple(map(int, input().split()))
# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
return tuple(map(int1, input().split()))
def main():
n, k = input_to_int_map()
a_array = input_to_int_tuple()
for k_val, pre_k_val in zip(a_array[k:], a_array[k - k:]):
if k_val > pre_k_val:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
| p02602 |
# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, K, A):
st = SegmentTree(f=lambda x, y: x * y, identity_factory=lambda: 1, initial_values=A)
prev = st.query(0, K)
for i in range(K + 1, N + 1):
curr = st.query(i - K, i)
print(('Yes' if curr > prev else 'No'))
prev = curr
class SegmentTree:
def __init__(self, n=None, f=max, identity_factory=int, initial_values=None):
assert(n or initial_values)
size = n if n else len(initial_values)
d = [identity_factory() for _ in range(2 * size + 1)]
self.__n, self.__d, self.__f, self.__e = size, d, f, identity_factory
if initial_values:
for i, v in enumerate(initial_values): d[size + i] = v
for i in range(size - 1, 0, -1): d[i] = f(d[i << 1], d[i << 1 | 1])
def get_val(self, index):
return self.__d[index + self.__n]
def set_val(self, index, new_value):
i, d, f = index + self.__n, self.__d, self.__f
if d[i] == new_value: return
d[i] = new_value
while i:
i = i >> 1
d[i] = f(d[i << 1], d[i << 1 | 1])
def modify(self, index, value):
self.set_val(index, self.__f(self.__d[index + self.__n], value))
def query(self, from_inclusive, to_exclusive):
ans = self.__e()
if to_exclusive <= from_inclusive: return ans
l, r, d, f = from_inclusive + self.__n, to_exclusive + self.__n, self.__d, self.__f
while l < r:
if l & 1: ans, l = f(ans, d[l]), l + 1
if r & 1: ans, r = f(d[r - 1], ans), r - 1
l, r = l >> 1, r >> 1
return ans
if __name__ == '__main__':
input = sys.stdin.readline
N, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
main(N, K, A)
| # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, K, A):
for i in range(K, N):
print(('Yes' if A[i] > A[i - K] else 'No'))
if __name__ == '__main__':
input = sys.stdin.readline
N, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
main(N, K, A)
| p02602 |
#Problem C
N,K = list(map(int, input().split()))
a = list(map(int,input().split()))
p1 = 1
p2 = 0
for i in range(K):
p1 *= a[i]
for i in range(N-K):
p2 = p1/a[i]*a[K+i]
if p2 > p1:
print("Yes")
else:
print("No")
p1 = p2 | #Problem C
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 = list(map(int, input().split()))
b = []
i = 0
while k != n+1:
total = 1
for j in range(i, k):
total *= a[j]
b.append(total)
i += 1
k += 1
l = len(b)
#print(b)
for i in range(l-1):
if b[i] < b[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[i] < a[i+k] :
print('Yes')
else :
print('No')
| p02602 |
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
i = N - K
while i > 0:
print(('Yes' if A[K] > A[0] else 'No'))
A.pop(0)
i -= 1 | 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(map(int,input().split()))
b = []
for i in range(k-1,n):
c = 1
for j in range(k):
c *= a[i - j]
b.append(c)
for i in range(n-k):
if b[i] < b[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 |
import collections
n,k = list(map(int , input().split()))
q = collections.deque([])
cumul = 1
prev = 0
for ai in map(int, input().split()):
cumul *= ai
q.append(ai)
if len(q) == k + 1:
cumul /= q.popleft()
if len(q) == k:
if prev != 0:
print('Yes' if cumul > prev else 'No')
prev = cumul | n,k = list(map(int , input().split()))
ais = list(map(int, input().split()))
for ii in range(k, n):
print('Yes' if ais[ii] > ais[ii - k] else 'No') | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
lst = [0]*(N-K+1)
lst[0] = 1
for i in range(K):
lst[0] = lst[0] * A[i]
for i in range(1,N-K+1):
lst[i] = lst[i-1] / A[i-1]
lst[i] = lst[i] * A[K-1+i]
if lst[i] > lst[i-1]:
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-1+i] / A[i-1]) > 1:
print("Yes")
else:
print("No") | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
s = 1
for j in range(K-1):
s *= A[j]
for i in range(K, N):
if A[i] > A[i-K]:
print("Yes")
else:
print("No")
s *= A[i]
s //= A[i-K] | 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()))
points = [int(i) for i in input().split()]
scores = [0] * n
scores[0] = points[0]
for i in range(1, n):
scores[i] = scores[i - 1] * points[i]
if k <= i:
scores[i] //= points[i - k]
for i in range(k, n):
if scores[i - 1] < scores[i]:
print('Yes')
else:
print('No') | n, k = list(map(int, input().split()))
points = [int(i) for i in input().split()]
for i in range(k, n):
if points[i - k] < points[i]:
print('Yes')
else:
print('No')
| p02602 |
import copy
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
memo = copy.copy(a)
for i in range(k, n+1, 1):
for j in range(i-k, i-1, 1):
memo[i-1] *= a[j]
for i in range(k, n, 1):
if memo[i-1] < memo[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 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
p = 1
for i in range(K):
p = p * A[i]
for i in range(K, N):
pre = p
p = (p // A[i - K]) * A[i]
if (pre < p):
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()))
X = []
ans = 1
for i in range(K):
ans = ans*A[i]
X.append(ans)
for i in range(K+1,N+1):
ans = (ans//A[i-1-K])*A[i-1]
X.append(ans)
for i in range(N-K):
if X[i] < X[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] > A[i-K]:
print("Yes")
else:
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-1, n-1):
if int(score) < int(score*a[i+1]/a[i-k+1]):
print('Yes')
else:
print('No')
score = score*a[i+1]/a[i-k+1] | n, k = list(map(int, input().split(' ')))
a = list(map(int, input().split(' ')))
for i in range(k, n):
score = 1
if score < score*a[i]/a[i-k]:
print('Yes')
else:
print('No') | p02602 |
# C
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
num = 1
cnt = 0
lst = []
for i in range(N):
if (i < K):
num *= A[i]
else:
lst.append(num)
num = (num // A[cnt]) * A[i]
cnt += 1
lst.append(num)
for i in range(len(lst) - 1):
if (lst[i] < lst[i+1]):
print('Yes')
else:
print('No') | # C
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
cnt = 0
for i in range(K, N):
if (A[cnt] < A[i]):
print('Yes')
else:
print('No')
cnt += 1 | p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
memo = {}
tmp = 1
for i in range(k):
tmp *= a[i]
memo[k-1] = tmp
for i in range(k,n):
before = memo[i-1]
after = 1
for j in range(k):
after *= a[i-j]
if before < after:
print("Yes")
else:
print("No")
memo[i] = after
| n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
memo = {}
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()))
ac = 1
for i in range(K):
ac *= A[i]
for i in range(K, N):
if A[i-K] < A[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 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
k_mul = 1
for i in range(k):
k_mul *= a[i]
first = k_mul
for i in range(k, n):
new = (first // a[i-k]) * a[i]
if first < new:
print("Yes")
else:
print("No")
first = new | 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, A):
for i in range(K-1, N): # 0 から数えるから K-1
# 総積
this = A[i-(K-1):i+1] # 直近3学期． i+1はスライスのときその数字は入らないから．
# print
if i != K-1:
if this[-1] > before[0]:
print('Yes')
else:
print('No')
before = this
if __name__ == '__main__':
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
main(N, K, A) | def main(N, K, A):
for i in range(K, N): # 0 から数えるから K-1
this = A[i]
before = A[i-K]
if this > before:
print('Yes')
else:
print('No')
if __name__ == '__main__':
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
main(N, K, A) | p02602 |
n, k = list(map(int,input().split()))
a = list(map(int,input().split()))
s1 = 1
s2 = 1
for i in range(k):
s1 = s1 * a[i]
s2 = s2 * a[i+1]
if s1 < s2:
print("Yes")
else:
print("No")
for i in range(1,n-k):
s1 = s2
s2 = int(s1 / a[i] * a[k+i])
if s1 < s2:
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[k+i]:
print("Yes")
else:
print("No") | p02602 |
import functools
n, k = list(map(int, input().split()))
scores = list(map(int, input().split()))
answers = []
prev_mul_scores_last_k = functools.reduce(lambda acc, score: acc * score, scores[:k])
prev_score = scores[0]
for i in range(k, n):
mul_scores_last_k = (prev_mul_scores_last_k // prev_score) * scores[i]
if prev_mul_scores_last_k < mul_scores_last_k:
answers.append('Yes')
else:
answers.append('No')
prev_mul_scores_last_k = mul_scores_last_k
prev_score = scores[i - (k - 1)]
for answer in answers:
print(answer)
| n, k = list(map(int, input().split()))
scores = list(map(int, input().split()))
answers = []
prev_score = scores[0]
for i in range(k, n):
if prev_score < scores[i]:
answers.append('Yes')
else:
answers.append('No')
prev_score = scores[i - (k - 1)]
for answer in answers:
print(answer)
| p02602 |
N, K = list(map(int, input().strip().split(" ")))
scores = input().strip().split(" ")
i = 0
grade = 1
for i in range(K):
grade *= int(scores[i])
for i in range(K, N):
last = grade
grade = int(grade / int(scores[i-K]))
grade *= int(scores[i])
if (grade > last):
print("Yes")
else:
print("No") | N, K = list(map(int, input().strip().split(" ")))
scores = input().strip().split(" ")
for i in range(K, N):
if (int(scores[i]) > int(scores[i-K])):
print("Yes")
else:
print("No") | p02602 |
n,k=(int(i) for i in input().split())
l=[int(i) for i in input().split()]
l1=[0]*(k-1)+[1]
for i in range(k):
l1[k-1]*=l[i]
for i in range(k,n):
l1+=[(l1[i-1]//l[i-k])*l[i]]
for i in range(k,n):
if(l1[i]>l1[i-1]):
print("Yes")
else:
print("No") | n,k=(int(i) for i in input().split())
l=[int(i) for i in input().split()]
for i in range(k,n):
if(l[i]>l[i-k]):
print("Yes")
else:
print("No") | p02602 |
a = list(map(int, input().split()))
b = list(map(int, input().split()))
x = [1]*(a[0]-a[1]+1)
for i in range(a[1]-1,len(b)):
for j in range(0,a[1]):
x[i-(a[1]-1)] = x[i-a[1]+1]*b[i-j]
for i in range(1, len(x)):
if int(x[i]) > int(x[i-1]):
print("Yes")
else:
print("No") | a = list(map(int, input().split()))
b = list(map(int, input().split()))
for i in range(a[1],len(b)):
if b[i]>b[i-a[1]]:
print("Yes")
else:
print("No") | p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = []
for i in range(n-k):
if (a[i+k] == 0):
ans.append("No")
continue
if (0 in a[i:i+k-1]):
ans.append("Yes")
continue
if (a[i] < a[i+k]):
ans.append("Yes")
else:
ans.append("No")
for i in range(len(ans)):
print((ans[i]))
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = []
for i in range(n-k):
if (a[i] < a[i+k]):
ans.append("Yes")
else:
ans.append("No")
for i in range(len(ans)):
print((ans[i]))
| p02602 |
import os, sys, atexit
from io import BytesIO, StringIO
input = BytesIO(os.read(0, os.fstat(0).st_size)).readline
_OUTPUT_BUFFER = StringIO()
sys.stdout = _OUTPUT_BUFFER
@atexit.register
def write():
sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
ans = [0] * (n - k + 1)
x = 0
for i in range(1, n):
l[i] *= l[i - 1]
for i in range(k - 1, n):
if i == k - 1:
ans[x] = l[i]
x -= -1
else:
ans[x] = l[i] // l[i - k]
x -= -1
for i in range(1, len(ans)):
if ans[i] > ans[i - 1]: print('Yes')
else: print('No') | 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') | p02602 |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
ans=1
for i in range(K):
ans*=A[i]
for i in range(K,N):
bns=ans//A[i-K]*A[i]
if ans<bns:
print('Yes')
else:
print('No')
ans=bns | 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 |
from sys import stdin,stdout
def fn(i):
return pro[i]//(pro[i-k] if i-k>=0 else 1)
n,k=list(map(int,stdin.readline().split()))
a=list(map(int,stdin.readline().split()))
pro=[a[0]]
for v in a[1:]:
pro+=[pro[-1]*v]
for i in range(k,n):
#print(fn(i),fn(i-1))
if fn(i)>fn(i-1):print('Yes')
else:print('No')
| from sys import stdin,stdout
n,k=list(map(int,stdin.readline().split()))
a=list(map(int,stdin.readline().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(map(int, input().split()))
score = 1
for i in range(K):
score *= A[i]
prev = score
for i,j in zip(list(range(K, N)), list(range(N-K))):
score /= A[j]
score *= A[i]
print(("Yes" if score > prev else "No"))
prev = score | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i,j in zip(list(range(K, N)), list(range(N-K))):
print(("Yes" if A[i] > A[j] else "No"))
| p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# point = [0] * (N - K + 1)
tmplist = A[0:K]
tmppoint = tmplist[0]
for j in range(1, K):
tmppoint = tmppoint * tmplist[j]
point = tmppoint
for i in range(1, N - K + 1):
tmplist = A[i : i + K]
tmppoint = tmplist[0]
for j in range(1, K):
tmppoint = tmppoint * tmplist[j]
if point < tmppoint:
print("Yes")
else:
print("No")
point = tmppoint
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
i = 0
while i < N - K:
if A[i] < A[i + K]:
print("Yes")
else:
print("No")
i = i + 1
| p02602 |
n, k = (int(x) for x in input().split())
a = input().split()
point = []
for j in range(n-k+1):
temp = int(a[j])
for i in range(j+1,k+j):
temp = temp * (int(a[i]))
point.append(temp)
for i in range(1,n-k+1):
if(point[i-1] >= point[i]):
print("No")
else:
print("Yes")
|
n, k = (int(x) for x in input().split())
a = input().split()
for i in range(1,n-k+1):
if(int(a[i-1]) >= int(a[k+i-1])):
print("No")
else:
print("Yes") | p02602 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
rep = 1
for i in range(K):
rep *= A[i]
#この段階でrepはK学期の評価
tmp = rep
for i in range(K,N):
tmp = rep*A[i]//A[i-K]
if tmp > rep:
print("Yes")
else:
print("No")
rep = tmp
| mod = 10**9 +7
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()))
LIST_A = list(map(int,input().split()))
import functools
import operator
for i in range(N-K):
target_1 = LIST_A[i:i+K]
target_2 = LIST_A[i+1:i+K+1]
#print(target_1,target_2)
result_1 = functools.reduce(operator.mul, target_1)
result_2 = functools.reduce(operator.mul, target_2)
if result_1 < result_2:
print("Yes")
else:
print("No")
| N,K = list(map(int,input().split()))
LIST_A = list(map(int,input().split()))
for i in range(N-K):
target_1 = LIST_A[i+K]-LIST_A[i]
if target_1 > 0:
print("Yes")
else:
print("No") | p02602 |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
A_max=max(A)
for i in A:
i=i/A_max
ans=list()
tmp=1
for i in range(K):
tmp=tmp*A[i]
for i in range(K,N):
tmp_old=tmp
tmp=tmp_old*A[i]/A[i-K]
if tmp_old<tmp:
ans.append('Yes')
else:
ans.append('No')
for i in ans:
print(i) | N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
ans=list()
for i in range(K,N):
if A[i-K]<A[i]:
ans.append('Yes')
else:
ans.append('No')
for i in ans:
print(i) | p02602 |
def main():
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')
if __name__ == '__main__':
main()
| def main():
n, k = map(int, input().split())
A = list(map(int, input().split()))
[print('Yes') if a < b else print('No') for a, b in zip(A[:n - k], A[k:])]
if __name__ == '__main__':
main()
| p02602 |
n, k = map(int, input().split())
A = list(map(int, input().split()))
mul = [1]
for i in range(n):
mul.append(mul[i] * A[i])
#print(mul)
output = []
for i in range(k+1, n+1):
if mul[i]/mul[i-k] > mul[i-1]/mul[(i-1)-k]: output.append("Yes")
else: output.append("No")
print(*output, sep="\n")
| n, k = map(int, input().split())
A = list(map(int, input().split()))
tmp = 1
for i in range(k):
tmp *= A[i]
output = []
count = 0
for i in range(k, n):
if tmp < int(tmp * A[i] / A[count]):
output.append("Yes")
else:
output.append("No")
tmp = int(tmp * A[i] / A[count])
count += 1
print(*output, sep="\n")
| p02602 |
n, k = map(int, input().split())
A = list(map(int, input().split()))
tmp = 1
for i in range(k):
tmp *= A[i]
output = []
count = 0
for i in range(k, n):
if tmp < int(tmp * A[i] / A[count]):
output.append("Yes")
else:
output.append("No")
tmp = int(tmp * A[i] / A[count])
count += 1
print(*output, sep="\n")
| n, k = map(int, input().split())
A = list(map(int, input().split()))
output = []
count = 0
for i in range(k, n):
if A[i] > A[count]:
output.append("Yes")
else:
output.append("No")
count += 1
print(*output, sep="\n")
| p02602 |
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
n,k=LI()
l=LI()
ind=0
sm=1
for i in range(k):
sm*=l[i]
before=sm
ans=[]
nxt=k
for _ in range(n-k):
sm//=l[ind]
sm*=l[nxt]
if before<sm:
ans.append('Yes')
else:
ans.append('No')
before=sm
ind+=1
nxt+=1
for x in ans:
print(x)
main()
# print(main())
| import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
n,k=LI()
l=LI()
ind=0
nxt=k
ans=[]
for _ in range(n-k):
if l[ind]<l[nxt]:
ans.append('Yes')
else:
ans.append('No')
ind+=1
nxt+=1
for x in ans:
print(x)
main()
# print(main())
| p02602 |
n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
ave=[0 for i in range(n-k+1)]
for i in range(n-k+1):
temp=1
for s in range(i,i+k):
temp*=A[s]
ave[i]=temp
for i in range(n-k):
if ave[i+1]>ave[i]:
print('Yes')
else:
print('No') | n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
ave=[0 for i in range(n-k+1)]
for i in range(n-k):
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()))
ans=[0]*(n-k+1)
r=1
for i in range(k):
r=r*a[i]
ans[0]+=r
for i in range(1,n-k+1):
ans[i]+=(ans[i-1]*a[i+k-1])//a[i-1]
if ans[i]>ans[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_arr = list(map(int, input().split()))
k_idx = K - 1
term_val_arr = []
ans_arr = []
for i in range(N - K + 1):
val = 1
if len(term_val_arr) == 0:
for j in range(K):
val *= a_arr[k_idx - j]
term_val_arr.append(val)
else:
term_val_arr.append(a_arr[k_idx] * term_val_arr[i - 1] / a_arr[i-1])
if i != 0:
if term_val_arr[i - 1] < term_val_arr[i]:
ans_arr.append('Yes')
else:
ans_arr.append('No')
k_idx += 1
for i in ans_arr:
print(i) | N,K = list(map(int, input().split()))
a_arr = list(map(int, input().split()))
k_idx = K - 1
ans_arr = []
for i in range(N - K):
if a_arr[i] < a_arr[k_idx + 1]:
ans_arr.append('Yes')
else:
ans_arr.append('No')
k_idx += 1
for i in ans_arr:
print(i) | p02602 |
n, k = [int(x) for x in input().split()]
arr = [int(x) for x in input().split()]
p = 1
for i in range(k):
p *= arr[i]
for i in range(k, n):
l = p
l /= arr[i-k]
l *= arr[i]
if l > p:
print("Yes")
else:
print("No")
p = l | n, k = [int(x) for x in input().split()]
arr = [int(x) for x in input().split()]
for i in range(k, n):
if arr[i] > arr[i-k]:
print("Yes")
else:
print("No") | p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
l = [0]*(n-k+1)
t = 1
for i in range(k):
t *= a[i]
l[0] = t
for i in range(1,n-k+1):
t = t//a[i-1]
t = t*a[k+i-1]
l[i] = t
for i in range(n-k):
if l[i] < l[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[i] < a[i+k]:
print("Yes")
else:
print("No") | p02602 |
import math
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
count=0
before=0
now=1
for i in range(N):
now*=A[i]
if i+1>K:
now=now/A[i-K]
if now>before:
print("Yes")
else:
print("No")
if i+1>=K:
before=now | import math
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
count=0
before=0
now=1
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(" ")))
sum=1
for i in range(k-1):
sum*=a[i]
hoge=[0 for i in range(n)]
for i in range(k-1,n):
sum*=a[i]
hoge[i]=sum
sum=sum//a[i-k+1]
for i in range(k,n):
#print(hoge[i-1],hoge[i],end=" ")
if hoge[i-1]<hoge[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):
#print(hoge[i-1],hoge[i],end=" ")
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()))
old=1
for j in range(k):
old*=a[k-1-j]
for i in range(n-k+1):
new=1
for s in range(k):
new*=a[k-1-s+i]
if i>0 and new>old:
print('Yes')
elif i>0 and new<=old:
print('No')
old=new | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(n-k+1):
if i+k<n:
if a[i]<a[i+k]:
print('Yes')
else:
print('No') | p02602 |
C, K = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
tmp = 1
for i in range(K):
tmp = A[i] * tmp
for i in range(K,C):
tmp_tmp = (tmp / A[i-K]) * A[i]
if tmp < tmp_tmp:
print("Yes")
else:
print("No")
tmp = tmp_tmp
| N, K = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
for i in range(N-K):
if A[K+i] > A[i]:
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.