input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n, k = list(map(int, input().split()))
an = list(map(int, input().split()))
from functools import reduce
prod = reduce(lambda x,y: x*y, an[:k])
for i in range(k, n):
prod_next = prod // an[i - k] * an[i]
print((['No', 'Yes'][prod_next > prod]))
prod = prod_next
| n, k = list(map(int, input().split()))
an = list(map(int, input().split()))
ank = an[:k]
for i in range(k, n):
print((['No', 'Yes'][an[i] > ank[0]]))
ank.pop(0)
ank.append(an[i])
| p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
x = 1
for i in range(n):
if i<k:
x *= a[i]
else:
c = x//a[i-k]*a[i]
print(('Yes' if c>x else 'No'))
x = c | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(n):
if i>=k:
print(('Yes' if a[i-k]<a[i] else 'No'))
| p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = a[:]
for i in range(1,k):
a[i] = a[i] * a[i-1]
for i in range(k,n):
a[i] = a[i] * a[i-1] // b[i-k]
if a[i] > a[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 |
from functools import reduce
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
# 評点計算
# s[0]~s[k-2]まで0埋め
s = [0 for _ in range(k-1)]
# s[n-k] = a[0] * a[1] * ... * a[n-k]
s.append(reduce(lambda x, y: x*y, [a[i] for i in range(0, n-k+1)]))
# s[i+1] = s[i] / a[i-k+1] * a[i+1]
for i in range(k-1, n-1):
s.append(s[i] / a[i-k+1] * a[i+1])
# 出力
for i in range(k, n):
print(("Yes" if s[i] > s[i-1] else "No" )) | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(k-1, n-1):
print(("Yes" if a[i+1] > a[i-k+1] else "No")) | p02602 |
import sys
input=sys.stdin.readline
n,k=list(map(int,input().split()))
arr=list(map(int,input().split()))
prev=1
for i in range(k):
prev*=arr[i]
ans=[]
for i in range(k,n):
if(prev<prev*arr[i]/arr[i-k]):
print('Yes')
else:
print('No')
prev=prev*arr[i]/arr[i-k]
| import sys
input=sys.stdin.readline
n,k=list(map(int,input().split()))
arr=list(map(int,input().split()))
for i in range(k,n):
if(arr[i-k]<arr[i]):
print('Yes')
else:
print('No')
| p02602 |
from functools import reduce
import operator
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
cnt, precnt = 0, reduce(operator.mul, a[:k])
for i in range(1, n-k+1):
cnt = reduce(operator.mul, a[i:k+i])
if cnt > precnt:
print("Yes")
else:
print("No")
precnt = cnt
| 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("No")
else:
print("Yes") | p02602 |
n,k=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
mark=[0]*(n-k+1)
m=[1]*(k+1)
for i in range(k):
m[i+1]=a[i]*m[i]
mark[0]=m[k]
for j in range(1,n-k+1):
mark[j]=(mark[j-1]/a[j-1])*a[j+k-1]
if mark[j-1]<mark[j]:
print("Yes")
else:
print("No") | n,k=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
for i in range(n-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(' ')))
def hyoka(j,p,b_point):
if j == k:
point = reduce(mul, A[0:j])
return point
else:
point = b_point/A[j-k-1]*p
if b_point < point:
print('Yes')
else:
print('No')
return point
b_point = 0
for j,p in enumerate(A[k-1:n+1]):
i = j+k-1
result = hyoka(i+1,p,b_point)
if result > 0:
b_point = result
| [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=[int(i) for i in input().split()]
ans=[a[0]]
for i in range(n-1):
ans.append(ans[-1]*a[i+1])
com=ans[k-1]
for i in range(n-k):
if com>=ans[i+k]/ans[i]:
print("No")
else:
print("Yes")
com=ans[i+k]/ans[i] | n,k=list(map(int,input().split()))
a=[int(i) for i in input().split()]
for i in range(n-k):
if a[i]>=a[i+k]:
print("No")
else:
print("Yes") | p02602 |
def main():
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
a2 = [1] * (n-k+1)
for i in range(n-k+1):
for j in range(i,i+k):
a2[i] *= a[j]
#print(a2)
for i in range(len(a2)-1):
if a2[i] < a2[i+1]:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main() | def main():
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n-k):
print(("Yes" if a[i] < a[i+k] else "No"))
if __name__ == '__main__':
main() | p02602 |
n, k = list(map(int, input().split(" ")))
a_lst = list(map(int, input().split(" ")))
# previousの値を取っておいて真に掛け算した評定が高かったかを判定
previous = 1
for i in range(k):
previous *= a_lst[i]
for i in range(k, n):
now = previous / a_lst[i - k] * a_lst[i]
if now > previous:
print("Yes")
else:
print("No")
previous = now
| n, k = list(map(int, input().split(" ")))
a_lst = list(map(int, input().split(" ")))
for i in range(k, n):
if a_lst[i] > a_lst[i - k]:
print("Yes")
else:
print("No")
| p02602 |
import sys
input = sys.stdin.readline
def main():
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(K,N):
n = tmp * A[i] / A[i-K]
if n > tmp:
print('Yes')
else:
print('No')
tmp = n
if __name__ == '__main__':
main() | import sys
input = sys.stdin.readline
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# tmp = 1
# for i in range(K):
# tmp *= A[i]
# print(tmp)
for i in range(K,N):
# n = tmp * A[i] / A[i-K]
n = A[i]/A[i-K]
if n > 1:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() | p02602 |
from sys import stdin
def readline_from_stdin() -> str:
return stdin.readline().rstrip
if __name__ == '__main__':
N, K, = input().split()
A = [int(i) for i in input().split()]
N, K = int(N), int(K)
score = 1
for i in range(K):
score *= A[i]
for i in range(N-K):
new_score = int(score / A[i]) * A[K+i]
if new_score > score:
print("Yes")
else:
print("No")
score = new_score
# scores = [score]
# for i in range(N-K):
# print(i, K+i)
# score = int(score / A[i]) * A[K+i]
# scores.append(score)
#
# print(scores)
#
# results = [False for i in range(len(scores)-1)]
#
# for i in range(len(scores)-1):
# results[i] = scores[i+1] > scores[i]
#
# [print("Yes") if r else print("no") for r in results]
| from sys import stdin
def readline_from_stdin() -> str:
return stdin.readline().rstrip
if __name__ == '__main__':
N, K, = input().split()
A = [int(i) for i in input().split()]
N, K = int(N), int(K)
for i in range(N-K):
if A[i] < A[K+i]:
print("Yes")
else:
print("No") | p02602 |
# import decimal
import time
time1 = time.time()
N, K = list(map(int, input().split()))
# N = 200000
# K = 50000
A_list = list(map(int, input().split()))
# A_list = [2 for i in range(N)]
Score_list = [1 for i in range(N+1)]
for i in range(K, N+1):
if i == K:
S = 1
for j in range(i-K, i):
S *= A_list[j]
Score_list[i] = S
else:
Score_list[i] = int(Score_list[i-1] / A_list[i-1-K])
Score_list[i] *= A_list[i-1]
if i > K:
if Score_list[i] > Score_list[i-1]:
print("Yes")
else:
print("No")
# print(Score_list)
# print(Score_list)
time2 = time.time()
# print(time2-time1)
| # import decimal
import time
time1 = time.time()
N, K = list(map(int, input().split()))
# N = 200000
# K = 50000
A_list = list(map(int, input().split()))
# A_list = [2 for i in range(N)]
# Score_list = [1 for i in range(N+1)]
for i in range(K+1, N+1): #KからNの数字が入る
# print(i-1)
# print(i-2-K)
if A_list[i-1] > A_list[i-1-K]:
print("Yes")
else:
print("No")
# if i == K:
# S = 1
# for j in range(i-K, i):
# S *= A_list[j]
# Score_list[i] = S
# else:
# Score_list[i] = int(Score_list[i-1] / A_list[i-1-K])
# Score_list[i] *= A_list[i-1]
# if i > K:
# if Score_list[i] > Score_list[i-1]:
# print("Yes")
# else:
# print("No")
# # print(Score_list)
# print(Score_list)
time2 = time.time()
# print(time2-time1)
| p02602 |
def main():
n, k= list(map(int, input().split()))
a = list(map(int, input().split()))
pre = 1
for b in a[0:k]:
pre *= b
now = pre
for i in range(1, n-k+1):
now = pre // a[i - 1] * a[k+ i -1]
if pre < now:
print('Yes')
else:
print('No')
pre = now
if __name__ == '__main__':
main() | def main():
n, k= list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(1, n-k+1):
if a[i - 1] < a[k+ i -1]:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
prefix = [1] * (N + 1)
for i, a in enumerate(A, 1):
prefix[i] = prefix[i - 1] * a
for i in range(K + 1, N + 1):
prev = prefix[i - 1] // prefix[i - K - 1]
cur = prefix[i] // prefix[i - K]
if cur > prev:
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()))
mul = [1]
for i in range(n):
mul.append(mul[i]*a[i])
total = mul[-1]
pre = mul[k]
for i in range(k+1, n+1):
now = mul[i] // mul[i-k]
if pre < now:
print('Yes')
else:
print('No')
pre = now | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
s = 1
for i in range(k):
s *= a[i]
pre = s
for i in range(k, n):
s *= a[i]
s //= a[i-k]
if pre < s:
print('Yes')
else:
print('No')
pre = s | p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
s = 1
for i in range(k):
s *= a[i]
pre = s
for i in range(k, n):
s *= a[i]
s //= a[i-k]
if pre < s:
print('Yes')
else:
print('No')
pre = s | 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()))
rl = []
for i in range(k-1,n):
r = 1
for j in range(k):
r *= a[i-j]
j += 1
rl.append(r)
i += 1
for m in range(n-k):
if rl[m+1] > rl[m]:
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()))
point = 1
points = []
for i in range(n):
point *= a[i]
if i >= k - 1:
points.append(point)
if i >= k:
if points[-1] > points[-2]:
print("Yes")
else:
print("No")
point //= a[i - k + 1] | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
"""
point = 1
points = []
for i in range(n):
point *= a[i]
if i >= k - 1:
points.append(point)
if i >= k:
if points[-1] > points[-2]:
print("Yes")
else:
print("No")
point //= a[i - k + 1]
"""
for i in range(n):
if i >= k:
if a[i] > a[i - k]:
print("Yes")
else:
print("No") | p02602 |
def s(): return eval(input())
def i(): return int(eval(input()))
def S(): return input().split()
def I(): return list(map(int,input().split()))
def X(): return list(eval(input()))
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
count = 0
ans = "No"
N,K = I()
A = l()
before = 1
for i in range(K):
before *= A[i]
for i in range(N-K):
after = before / A[i] * A[K+i]
if after > before:
print("Yes")
else:
print("No")
before = after
| def s(): return eval(input())
def i(): return int(eval(input()))
def S(): return input().split()
def I(): return list(map(int,input().split()))
def X(): return list(eval(input()))
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
count = 0
ans = "No"
N,K = I()
A = l()
for i in range(N-K):
if A[K+i]/A[i] > 1:
print("Yes")
else:
print("No")
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
# prepare
mul = 1
for i in range(k):
mul *= a[i]
prev = mul
for i in range(k, n):
next = prev / a[i - (k)] * a[i]
if next > prev:
print('Yes')
else:
print('No')
prev = next | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(k, n):
prev = a[i - k]
next = a[i]
if next > prev:
print('Yes')
else:
print('No') | p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
cur = 1
for i in range(k):
cur *= a[i]
for i in range(0, n - k):
new = cur
new *= a[i + k]
new //= a[i]
if new > cur:
print('Yes')
else:
print('No')
cur = new | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(0, 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()))
nums = [0]*n
for i in range(n-k+1):
nums[k+i-1] = sum(a[i:k+i])
for i in range(k,n):
if nums[i-1] < nums[i]: print("Yes")
else: print("No") | n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
nums = [0]*n
nums[k-1] = sum(a[:k])
for i in range(k,n):
nums[i] = nums[i-1] + a[i] - a[i-k]
for i in range(k,n):
if nums[i-1] < nums[i]: print("Yes")
else: print("No") | p02602 |
def solve():
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
tmp = 1
for i in range(k):
tmp *= A[i]
for j in range(k + 1, n + 1):
x = tmp * 1
tmp //= A[j - k - 1]
tmp *= A[j - 1]
if tmp > x:
print("Yes")
else:
print("No")
solve()
| def solve():
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for j in range(k + 1, n + 1):
if A[j - k - 1] < A[j - 1]:
print("Yes")
else:
print("No")
solve()
| p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
DP = [1] * (2 * 10 ** 6)
DP[0] = A[0]
for i in range(1, K):
DP[i] = DP[i - 1] * A[i]
for i in range(K, N):
DP[i] = DP[i - 1] * A[i] // A[i - K]
if DP[i] > DP[i - 1]:
print("Yes")
else:
print("No")
| import sys
#import numpy as np
N, K = list(map(int, sys.stdin.readline().split()))
A = list(map(int, sys.stdin.readline().split()))
# DP = [1] * (2 * 10 ** 6)
# DP[K - 1] = np.prod(A[0:K])
for i in range(K, N):
if A[i] / A[i - K] > 1:
print("Yes")
else:
print("No") | p02602 |
import sys
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('No')
else:
print('Yes') | 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 = input().split()
AList = list(map(int, input().split()))
CSList = []
i=int(K)
j=0
while j<=int(N)-int(K):
BList=AList[j:i]
if j==0:
MAE=BList[0]
elif MAE>=BList[-1]:
print("No")
MAE=BList[0]
elif MAE<BList[-1]:
print("Yes")
MAE=BList[0]
i+=1
j+=1
|
N,K = list(map(int, input().split()))
AList = list(map(int, input().split()))
A=str(K)
i=int(A)
j=0
while j<=N-K:
#BList=AList[j:i]
if j==0:
MAE=AList[j]
elif MAE>=AList[i-1]:
print("No")
MAE=AList[j]
elif MAE<AList[i-1]:
print("Yes")
MAE=AList[j]
i+=1
j+=1 | p02602 |
semester, K = list(map(int, input().split()))
score = input().split()
result1 = 1
result2 = 1
for i in range(semester - K + 1) :
if i == 0 :
for j in range(K) :
result1 = result1 * int(score[K - 1 - j])
continue
result2 = result1 // int(score[K - K + i - 1]) * int(score[K - 1 + i])
if result1 < result2 :
print("Yes")
else :
print("No")
result1 = result2
result2 = 1
| semester, K = list(map(int, input().split()))
score = input().split()
for i in range(semester - K + 1) :
if i == 0 :
continue
if int(score[K - K + i - 1]) < int(score[K - 1 + i]) :
print("Yes")
else :
print("No")
| p02602 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n,k = LI()
a = LI()
tmp = 1
for i in range(k):
tmp *= a[i]
for i in range(k, n):
tmp1 = tmp
tmp1 *= a[i]
tmp1 //= a[i-k]
if tmp < tmp1:
print('Yes')
else:
print('No')
tmp = tmp1
| #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n,k = LI()
a = LI()
for i in range(k, n):
if a[i] > a[i-k]:
print('Yes')
else:
print('No')
| p02602 |
import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N, K = list(map(int, readline().split()))
A = list(map(int, readline().split()))
X = 1
for i in range(K):
X *= A[i]
B = [X]
for i in range(K,N):
tmp = B[-1] * A[i] // A[i-K]
B.append(tmp)
for i in range(N-K):
if B[i+1]<=B[i]:
print('No')
else:
print('Yes')
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N, K = list(map(int, readline().split()))
A = list(map(int, readline().split()))
for i in range(K,N):
if A[i]<=A[i-K]:
print('No')
else:
print('Yes')
if __name__ == '__main__':
main()
| p02602 |
N,K = list(map(int,input().split()))
gakki = list(map(int,input().split()))
temp1 = gakki[0]
for i in range(1,K):
temp1 *= gakki[i]
for i in range(N - K):
temp2 = int(temp1 / gakki[i] * gakki[K + i])
if temp1 < temp2:
print("Yes")
else:
print("No")
temp1 = temp2
| N,K = list(map(int,input().split()))
gakki = list(map(int,input().split()))
for i in range(N - K):
temp1 = gakki[i]
temp2 = gakki[K + i]
if temp1 < temp2:
print("Yes")
else:
print("No")
temp1 = temp2
| p02602 |
N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
i_list = [0] * (N+1)
cnt = 0
for k in range(K, N+1):
A_sum = A[cnt]
for i in range(cnt, K+cnt-1):
if A[i+1] == 0:
A_sum = 0
break
else:
A_sum = A_sum * A[i+1]
i_list[k] = A_sum
A_sum = 0
cnt = cnt + 1
for k in range(K, N):
if i_list[k] < i_list[k+1]:
print('Yes')
else:
print('No') | N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
i_list = [0] * N
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 = 1
for i in range(k):
score *= a[i]
top = 0
for i in range(k, n):
pre_score = score
score /= a[top]
top += 1
score *= a[i]
if score > pre_score:
print("Yes")
else:
print("No")
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
score = sum(a[:k])
top = 0
for i in range(k, n):
if a[i] > a[top]:
print("Yes")
else:
print("No")
top += 1
| p02602 |
n, k = list(map(int,input().split()))
a = list(map(int,input().split()))
scores = []
s = 0
score = 1
for i in range(k):
score *= a[i]
scores.append(score)
for i in range(k,n):
score = score // a[s] * a[i]
s += 1
scores.append(score)
#print(scores)
for i in range(len(scores)-1):
if scores[i+1] > scores[i]:
print('Yes')
else:
print('No') | n, k = list(map(int,input().split()))
a = list(map(int,input().split()))
f = 0
for _ in range(n-k):
if a[f] < a[f+k]:
print('Yes')
else:
print('No')
f += 1 | p02602 |
#n=int(input())
n,k=list(map(int,input().split()))
al=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
def f(l):
res=1
for li in l:
res=res*li
return res
sc=[]
alr=0
for i in range(k-1,n):
if alr==0:
score=f(al[i-k+1:i+1])
alr=1
else:
first=al[i-k]
last=al[i]
score=(score//first)*last
sc.append(score)
for i in range(n-k):
if sc[i+1]>sc[i]:
print('Yes')
else:
print('No') | #n=int(input())
n,k=list(map(int,input().split()))
al=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
def f(l):
res=1
for li in l:
res=res*li
return res
sc=[]
alr=0
for i in range(k-1,n):
if i==k-1:
#score=f(al[i-k+1:i+1])
first=al[i-k+1]
alr=1
else:
#first=al[i-k]
last=al[i]
if last>first :
print('Yes')
else:
print('No')
first=al[i-k+1]
| p02602 |
#n=int(input())
n,k=list(map(int,input().split()))
al=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
def f(l):
res=1
for li in l:
res=res*li
return res
sc=[]
alr=0
for i in range(k-1,n):
if i==k-1:
#score=f(al[i-k+1:i+1])
first=al[i-k+1]
alr=1
else:
#first=al[i-k]
last=al[i]
if last>first :
print('Yes')
else:
print('No')
first=al[i-k+1]
| #n=int(input())
n,k=list(map(int,input().split()))
al=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
first = al[0]
for i in range(k, n):
last = al[i]
if first < last :
print('Yes')
else:
print('No')
first = al[i-k+1]
| p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
f = 0
d = 1
e = 1
for i in range(n-k):
for j in range(k):
d *= a[i+j]
e *= a[i+j+1]
if d < e:
print("Yes")
d,e = 1,1
else:
print("No")
d,e = 1,1 | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
f = 0
d = 1
e = 1
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()))
ma = min(a)
a = list([x - ma + 1 for x in a])
befscore = 1
score = 1
f = True
for i in range(n):
score = score * a[i]
if i >= k:
score = int(score / a[i - k])
if befscore >= score:
print("No")
else:
print("Yes")
befscore = score
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ma = min(a)
a = list([x - ma for x in a])
befscore = 1
score = 1
f = True
for i in range(n):
score = score + a[i]
if i >= k:
score = int(score - a[i - k])
if befscore >= score:
print("No")
else:
print("Yes")
befscore = score
| p02602 |
n=list(map(int,input().strip().split()))
m=list(map(int,input().strip().split()))
a=[]
c=0
x=1
for i in range(0,n[1]):
x*=m[i]
a.append(x)
#print(a)
l=0
k=n[1]
for i in range(0,n[0]-n[1]):
x//=m[l]
x*=m[k]
a.append(x)
#print(a)
l+=1
k+=1
for i in range(0,len(a)-1):
if(a[i]<a[i+1]):
print("Yes")
else:
print("No") | n=list(map(int,input().strip().split()))
m=list(map(int,input().strip().split()))
for i in range(n[0]-n[1]):
if(m[i+n[1]]>m[i]):
print("Yes")
else:
print("No") | p02602 |
N, K = input().split()
N = int(N)
K = int(K)
a = input().split()
A = [int(u) for u in a]
Prod = 1
G = []
for i in range(0, N):
Prod *= A[i]
if i >= K:
Prod = Prod // A[i - K]
if i >= K - 1:
G.append(Prod)
for i in range(0, N - K):
if G[i] < G[i + 1]:
print("Yes")
else:
print("No") | N, K = input().split()
N = int(N)
K = int(K)
a = input().split()
A = [int(u) for u in a]
for i in range(0, 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()))
tmp = 1
for i in range(k):
tmp *= a[i]
for i in range(k,n):
now = (tmp/a[i-k])*a[i]
if now > tmp:
print("Yes")
else:
print("No")
tmp = now
| 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 math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import itertools
def S(): return eval(input())
def I(): return int(eval(input()))
def MS(): return list(map(str,input().split()))
def MI(): return list(map(int,input().split()))
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in eval(input())]
def LLI(): return [list(map(int, l.split() )) for l in eval(input())]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
N,K = MI()
A = LI()
multi = {}
start = 1
for k in range(0,K):
start = start * A[k]
for j in range(K, N+1):
if j == K:
multi[j] = start
continue
start = start // A[j-K-1] * A[j-1]
multi[j] = start
if j-1 in multi:
if multi[j] > multi[j-1]:
print("Yes")
else:
print("No")
| from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import itertools
def S(): return eval(input())
def I(): return int(eval(input()))
def MS(): return list(map(str,input().split()))
def MI(): return list(map(int,input().split()))
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in eval(input())]
def LLI(): return [list(map(int, l.split() )) for l in eval(input())]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
N,K = MI()
A = LI()
for j in range(K, N+1):
if j == K:
continue
if A[j-K-1] < A[j-1]:
print("Yes")
else:
print("No") | p02602 |
import functools
import operator
prod = functools.partial(functools.reduce, operator.mul)
listS = []
N, K = list(map(int, input().split()))
A = list(map(int,input().split()))
for i in range(0,N-K):
if prod(A[i:K+i]) < prod(A[i+1:K+i+1]):
print("Yes")
else:
print("No") | N, K = list(map(int, input().split()))
A = list(map(int,input().split()))
for i in range(0,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()))
score = 1
for i in range(K):
score *= A[i]
last = score
for i in range(K,N):
score //=A[i-K]
score *= A[i]
#print(score)
if score > last:
print('Yes')
else:
print('No')
last = score
| N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
score = 1
for i in range(K,N):
if A[i] > A[i-K]:
print('Yes')
else:
print('No')
| p02602 |
import bisect,collections,copy,heapq,itertools,math,string
import sys
from collections import deque
def S(): return sys.stdin.readline().rstrip()
def M(): return list(map(int,sys.stdin.readline().rstrip().split()))
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())
n, k = M()
A = deque(LI())
ans = deque()
for i in range(n-1, k-1, -1):
if A[i] > A[i-k]:
ans.appendleft('Yes')
else:
ans.appendleft('No')
for s in ans:
print(s) | import bisect,collections,copy,heapq,itertools,math,string
import sys
from collections import deque
def S(): return sys.stdin.readline().rstrip()
def M(): return list(map(int,sys.stdin.readline().rstrip().split()))
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())
n, k = M()
A = deque(LI())
ans = deque()
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=[int(s) for s in input().split()]
dp=[0]*(N-K+2)
dp[1]=1
for j in range(K):
dp[1]*=A[j]
for i in range(1,N-K+1):
dp[i+1]=dp[i]*A[K+i-1]/A[i-1]
if dp[i+1]>dp[i]:
print('Yes')
else:
print('No') | N,K=list(map(int,input().split()))
A=[int(s) for s in input().split()]
for i in range(N-K):
if A[K+i]/A[i]>1:
print('Yes')
else:
print('No') | p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=[1]
for i in range(k):b[0]*=a[i]
for i in range(k,n):
b.append(b[-1]*a[i]//a[i-k])
for i in range(len(b)-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(k,n):
if a[i-k]<a[i]:print('Yes')
else:print('No') | p02602 |
import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(eval(input()))
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return eval(input())
def LS(): return input().split()
INF = float('inf')
n, k = LI()
a = LI()
base = 1
for elem in a[:k]:
base *= elem
for i in range(k, n):
rate = a[i] / a[i-k]
# print(rate)
if rate > 1:
ans = 'Yes'
else:
ans = 'No'
print(ans)
| import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(eval(input()))
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return eval(input())
def LS(): return input().split()
INF = float('inf')
n, k = LI()
a = LI()
base = 1
for i in range(k, n):
rate = a[i] / a[i-k]
if rate > 1:
ans = 'Yes'
else:
ans = 'No'
print(ans)
| p02602 |
import operator
import functools
prod = functools.partial(functools.reduce, operator.mul)
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
l = n - k + 1
lis = [0]*l
#0, 1, 2
for i in range(l):
lis[i] = prod(a[i:i+k])
for i in range(n - k):
if lis[i] < lis[i + 1]:
print("Yes")
else:
print("No") | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
#0, 1
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()))
a = 1
for i in range(k):
a *= A[i]
ans = a
for i in range(k,n):
a = a//A[i-k] * A[i]
if ans < a: print("Yes")
else: print("No")
ans = a | n,k = list(map(int, input().split()))
A = list(map(int, input().split()))
a = 0
for i in range(k):
a += A[i]
ans = a
for i in range(k,n):
a = a-A[i-k] + A[i]
if ans < a: print("Yes")
else: print("No")
ans = a | p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
pre_score = 1
for i in range(k):
pre_score *= a[i]
for i in range(k, n):
after_score = pre_score*a[i]/a[i-k]
if after_score > pre_score:
print('Yes')
else:
print('No') | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
pre_score = 1
for i in range(k, n):
after_score = pre_score*a[i]/a[i-k]
if after_score > pre_score:
print('Yes')
else:
print('No') | p02602 |
N,K=list(map(int,input().split()))
a_list=list(map(int,input().split()))
a_mul = [1]
for i,a in enumerate(a_list):
a_mul.append(a_mul[i] * a)
for i in range(K+1,N+1):
iscore = a_mul[i]//a_mul[i-K]
i_score = a_mul[i-1]//a_mul[i-1-K]
print(('Yes' if iscore > i_score else 'No')) | N,K=list(map(int,input().split()))
a_list=list(map(int,input().split()))
for i in range(K,N):
iscore = a_list[i]
i_score = a_list[i-K]
print(('Yes' if iscore > i_score else 'No')) | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# import functools
# import operator
# prod = functools.partial(functools.reduce, operator.mul)
# i=K+1の時、直近K回の期末テストの点数
# p_K = prod(A[:K])
p_K = 1
for i in range(K):
p_K *= A[i]
for i in range(K, N):
p_Kp1 = p_K / A[i-K] * A[i]
if p_K < p_Kp1:
print('Yes')
else:
print('No')
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# import functools
# import operator
# prod = functools.partial(functools.reduce, operator.mul)
# i=K+1の時、直近K回の期末テストの点数
# p_K = prod(A[:K])
p_K = 1
for i in range(K, N):
t = A[i] / A[i-K]
p_Kp1 = p_K * t
if p_K < p_Kp1:
print('Yes')
else:
print('No')
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
m = 1
for i in range(k):
m *= a[i]
tmp = m
for i in range(k, n):
m *= a[i]
m //= a[i - k]
if m > tmp:
print('Yes')
else:
print('No')
tmp = m
| 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()))
x = []
for i in range(n-k+1):
tmp = 1
for j in range(k):
tmp *= a[i+j]
x.append(tmp)
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(n-k):
if a[i] < a[i+k]:
print("Yes")
else:
print("No") | p02602 |
N=list(map(int,input().split()))
A=list(map(int,input().split()))
n=N[0]
k=N[1]
aves=[]
for x in range(n-k+1):
ave=1
for i in range(x,k+x):
ave=ave*A[i]
aves.append(ave)
for y in range(len(aves)-1):
if aves[y]<aves[y+1]:
print("Yes")
else:
print("No") | N=list(map(int,input().split()))
A=list(map(int,input().split()))
n=N[0]
k=N[1]
for i in range(n-k):
if A[i]<A[k+i]:
print("Yes")
else:
print("No") | p02602 |
# cook your dish here
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
scores = []
start = k-1
kk = k
i = k-1
while i<n:
cnt = kk
temp = 0
ans = 1
while cnt>0:
ans = ans*l[i-temp]
temp=temp+1
cnt=cnt-1
scores.append(ans)
i=i+1
if len(scores)==1:
print("Yes")
else:
i = 1
while i<len(scores):
if scores[i]>scores[i-1]:
print("Yes")
else:
print("No")
i = i+1 | # cook your dish here
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
for i in range(k, n):
if l[i-k] < l[i]:
print("Yes")
else:
print("No") | p02602 |
N,K = list(map(int,input().split()))
A = list(map(int, input().split()))
sum = 1
last = 1
sw = 0
for num in range(K):
last *= A[num]
for i in range(1,N-K+1):
for j in range(K):
sum *= A[i+j]
if last < sum:
print("Yes")
sw = 1
break
if sw ==0:
print("No")
last = sum
sum = 1
sw = 0 | N,K = list(map(int,input().split()))
A = list(map(int, input().split()))
for i in range(0,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()))
def last_k(a, i):
p = 1
for j in range(k):
p=p*a[i-j]
return p
seed = last_k(a, k-1)
for i in range(n-k):
if seed < int(seed*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(n-k):
if a[i+k] > a[i]:
print('Yes')
else:
print('No')
| p02602 |
import functools
import operator
def prod(arr):
return functools.reduce(operator.mul, arr)
def main():
N, K = (int(x) for x in input().split(" "))
A = [int(x) for x in input().split(" ")]
lastest_score = prod(A[0:K])
result = ["No"] * (N-K+1)
for i in range(1, N-K+1):
current_score = lastest_score - A[i-1] + A[i + K-1]
if lastest_score < current_score:
result[i] = "Yes"
lastest_score = current_score
[print(x) for x in result[1:]]
if __name__ == '__main__':
main()
| def prod(arr):
s = 0
for x in arr:
s += x
return s
def main():
N, K = (int(x) for x in input().split(" "))
A = [int(x) for x in input().split(" ")]
lastest_score = prod(A[0:K])
result = ["No"] * (N-K+1)
for i in range(1, N-K+1):
current_score = lastest_score - A[i-1] + A[i + K-1]
if lastest_score < current_score:
result[i] = "Yes"
lastest_score = current_score
[print(x) for x in result[1:]]
if __name__ == '__main__':
main()
| p02602 |
n, k = list(map(int, input().split(' ')))
a = [int(tmp) for tmp in input().split(' ')]
point = 1
for i in range(k):
point *= a[i]
for i in range(n - k):
f_point = point // a[i] * a[k+i]
if point < f_point:
print('Yes')
else:
print('No')
point = f_point
| n, k = map(int, input().split(' '))
a = [int(tmp) for tmp in input().split(' ')]
[print('Yes') if a < b else print('No') for a, b in zip(a[:n - k], a[k:])]
| p02602 |
# 入力
N,K = list(map(int, input().split()))
A_list = list(map(int, input().split()))
for i in range(N-K):
score1, score2 = (1,1)
for j in range(K):
score1 *= A_list[i+j]
score2 *= A_list[i+j+1]
if((score2 - score1) > 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+K] - A_list[i]) > 0):
print('Yes')
else:
print('No')
| p02602 |
N,K = list(map(int,input().split()))
A = [int(i) for i in input().split()]
temp = 1
arr = []
for k in range(K-1):
temp *= A[k]
for i in range(N-K+1):
temp *= A[i+K-1]
arr.append(temp)
temp = temp // A[i]
for i in range(N-K):
if arr[i] < arr[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(N-K):
if A[i] < A[i+K]:
print('Yes')
else:
print('No')
| p02602 |
n,k=list(map(int,input().split()))
aa=list(map(int,input().split()))
value=1
for i in range(k):
value*=aa[i]
for i in range(k,n):
a=int(value*aa[i]/aa[i-k])
if value<a:
print("Yes")
else:
print("No")
value=a | n,k=list(map(int,input().split()))
aa=list(map(int,input().split()))
for i in range(k,n):
if aa[i]/aa[i-k]>1:
print("Yes")
else:
print("No")
| p02602 |
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
dp=[0]*(n)
m=1
for i in range(n):
if i>=k:
m*=l[i]
if m//dp[i-k] > cur:
print("Yes")
else:
print("No")
dp[i]=m
cur=m//dp[i-k]
else:
m*=l[i]
cur=m
dp[i]=m
| 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
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n, k = list(map(int, readline().split()))
a = list(map(int, readline().split()))
for i in range(k, n):
if a[i - k] < a[i]:
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 - k] < a[i]:
print("Yes")
else:
print("No") | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
times = 1
for i in range(K):
times *= A[i]
# print(times)
for i in range(K , N):
pre_times = times
# print(i)
# print(i)
# print(A[i - K])
# print(A[i])
times = times // A[i - K ]
times *= A[i]
# print(times)
if pre_times < times:
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=input().split()
A=[int(b) for b in a]
numbers=[]
for n in range(N-K+1):
suuji=A[n:n+K]
answer=1
for k in suuji:
answer*=k
numbers.append(answer)
for k in range(N-K):
if numbers[k]<numbers[k+1]:
print('Yes')
else:
print('No')
| N,K=list(map(int,input().split()))
a=input().split()
A=[int(b) for b in a]
for k in range(N-K):
if A[k]<A[k+K]:
print('Yes')
else:
print('No')
| p02602 |
from functools import reduce
n, k = list(map(int, input().split()))
ai = list(map(int, input().split()))
before = 1
for a in ai[ 0 : k ]:
before *= a
for i in range(n - k):
after = before * ai[i + k] // ai[i]
if before < after:
print('Yes')
else:
print('No')
before = after
| from math import log2
n, k = list(map(int, input().split()))
ai = list([log2(int(x)) for x in input().split()])
before = sum(ai[ 0 : k ])
for i in range(n - k):
after = before + ai[i + k] - ai[i]
if before < after:
print('Yes')
else:
print('No')
before = after
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
li = []
for i in range(n-k +1):
tmp = a[i]
for j in range(1, k):
tmp *= a[i +j]
li.append(tmp)
for i in range(len(li) -1):
if (li[i] >= li[i+1]):
print("No")
else:
print("Yes") | 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("No")
else:
print("Yes") | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
H_now = 1
for i in range(K):
H_now *= A[i]
for j in range(K, N):
H_next = H_now * A[j] / A[j-K]
if H_next > H_now:
print('Yes')
else:
print('No')
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for j in range(K, N):
if A[j] > A[j-K]:
print('Yes')
else:
print('No')
| p02602 |
n, k = list(map(int,input().split()))
A = [int(i) for i in input().split()]
scores = []
hyotei = 1
for i in range(0,n-k+1):
for j in range(i,i+k):
hyotei *= A[j]
scores.append(hyotei)
hyotei = 1
for i in range(n-k):
if scores[i+1]>scores[i]:
print("Yes")
else:
print("No")
| n, k = list(map(int,input().split()))
A = [int(i) for i in 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()))
sc = [1]*(N-K+1)
for j in range(N-K+1):
for i in range(K):
sc[j] = sc[j]*A[j+i]
for j in range(N-K):
if sc[j+1] > sc[j]:
print('Yes')
else:
print('No') | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for j in range(N-K):
if A[j+K] > A[j]:
print('Yes')
else:
print('No') | p02602 |
n, k = list(map(int, input().split()))
a = tuple(map(int, input().split()))
# 累積積を求める
acc = []
acc.append(a[0])
for v in a[1:]:
acc.append(acc[-1]*v)
cand = []
cand.append(acc[k-1])
tmp = k
while tmp <= n-1:
cand.append(acc[tmp]//acc[tmp-k])
tmp += 1
for i in range(len(cand)-1):
if cand[i] < cand[i+1]:
print("Yes")
else:
print("No") | n, k = list(map(int, input().split()))
a = tuple(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()))
point = 1
for i in range(k):
point = point*a[i]
#print(point)
t = 0
for j in range(k, n):
point0 = point
point = point*a[j]/a[t]
t+=1
if point > point0:
print("Yes")
else:
print("No")
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
#point = 1
t = 0
"""for i in range(t, n):
point = point*a[i]"""
#print(point)
#t = 0
for j in range(k, n):
#point0 = point
#point = point*a[j]/a[t]
if a[j] > a[t]:
print("Yes")
else:
print("No")
t+=1
| p02602 |
from functools import reduce # @lru_cache(None)
from operator import mul
n, k = (int(x) for x in input().split())
A = list(int(x) for x in input().split())
point = reduce(mul, A[:k])
for i in range(n-k):
tmp = point
point //= A[i]
point *= A[k+i]
if tmp >= point:
print("No")
else:
print("Yes") | n, k = (int(x) for x in input().split())
A = list(int(x) for x in input().split())
for i in range(n - k):
if A[i] >= A[k + i]:
print("No")
else:
print("Yes")
| p02602 |
N, K = list(map(int,input().split()))
A = list(map(int,input().split()))
ans = 1
for i in range(K):
ans = ans*A[i]
X = []
X.append(ans)
#print(X[0])
for i in range(K, N):
ans = ans/A[i - K]
ans = ans*A[i]
X.append(ans)
#print(X[i - K + 1])
if X[i - K] < X[i - K + 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()))
fact = [1] + [0] * N
for i,ai in enumerate(A, 1):
fact[i] = fact[i-1] * ai
for i in range(1, N - K + 1):
score_2 = fact[K + i] // fact[i]
score_1 = fact[K + i - 1] // fact[i - 1]
print(('Yes' if score_1 < score_2 else 'No')) | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(N - K):
score_2 = A[i+K]
score_1 = A[i]
print(('Yes' if score_1 < score_2 else 'No')) | p02602 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def TUPLE(): return tuple(map(int, input().split()))
def ZIP(n): return list(zip(*(MAP() for _ in range(n))))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
#mod = 998244353
#from decimal import *
#import numpy as np
#decimal.getcontext().prec = 10
def main():
N, K = MAP()
A = LIST()
tmp = 1
for i in range(K):
tmp *= A[i]
tmp2 = tmp
for i in range(K, N):
tmp = tmp // A[i-K] * A[i]
if tmp2 < tmp:
print("Yes")
else:
print("No")
tmp2 = tmp
if __name__ == '__main__':
main()
| import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def TUPLE(): return tuple(map(int, input().split()))
def ZIP(n): return list(zip(*(MAP() for _ in range(n))))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
#mod = 998244353
#from decimal import *
#import numpy as np
#decimal.getcontext().prec = 10
def main():
N, K = MAP()
A = LIST()
for i in range(K, N):
if A[i-K] < A[i]:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
| p02602 |
from operator import mul
from functools import reduce
if __name__ == "__main__":
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
score = reduce(mul, A[:K])
for i in range(K, len(A)):
if A[i-K] < A[i]:
print("Yes")
else:
print("No")
| if __name__ == "__main__":
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(K, len(A)):
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()))
val = 1
for i in range(0, k):
val *= a[i]
for i in range(k, n):
num = val*a[i]/a[i-k]
if num > val:
print('Yes')
else:
print('No')
val = num
| 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 resolve():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
tmp = 1
for i in a[:k]:
tmp *= i
for i in range(k, n):
cost = tmp * a[i] // a[i-k]
print(('Yes' if cost > tmp else 'No'))
tmp = cost
if __name__ == "__main__":
resolve()
| def resolve():
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'))
if __name__ == "__main__":
resolve()
| p02602 |
import itertools
import operator
N, K = [int(x) for x in input().split(" ")]
A = [int(x) for x in input().split(" ")]
pro = [1] + list(itertools.accumulate(A, func=operator.mul))
for i in range(K + 1, N + 1):
if pro[i] * pro[i - K - 1] > pro[i - K] * (pro[i - 1]):
print("Yes")
else:
print("No")
| N, K = [int(x) for x in input().split(" ")]
A = [int(x) for x 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()))
A = list(map(int, input().split()))
def kakeru(ary):
result = 1
for i in ary:
result *= i
return result
tmp = kakeru(A[0:k])
point = tmp
for i in range(n-k):
point = point * A[k+i] / A[i]
if point > tmp:
tmp = point
print('Yes')
else:
tmp = point
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 |
# Author: S Mahesh Raju
# Username: maheshraju2020
# Date: 25/07/2020
from sys import stdin,stdout
from math import gcd, ceil, sqrt
from collections import Counter
from bisect import bisect_left, bisect_right
ii1 = lambda: int(stdin.readline().strip())
is1 = lambda: stdin.readline().strip()
iia = lambda: list(map(int, stdin.readline().strip().split()))
isa = lambda: stdin.readline().strip().split()
mod = 1000000007
n, k = iia()
arr = iia()
tot = 1
for i in range(k):
tot *= arr[i]
for i in range(k, n):
cur = tot
tot *= arr[i]
tot //= arr[i - k]
if tot > cur:
print('Yes')
else:
print('No')
| # Author: S Mahesh Raju
# Username: maheshraju2020
# Date: 25/07/2020
from sys import stdin,stdout
from math import gcd, ceil, sqrt
from collections import Counter
from bisect import bisect_left, bisect_right
ii1 = lambda: int(stdin.readline().strip())
is1 = lambda: stdin.readline().strip()
iia = lambda: list(map(int, stdin.readline().strip().split()))
isa = lambda: stdin.readline().strip().split()
mod = 1000000007
n, k = iia()
arr = iia()
tot = 1
for i in range(k, n):
if arr[i] > arr[i - k]:
print('Yes')
else:
print('No') | p02602 |
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import copy
import decimal
class Scanner():
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [Scanner.string() for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [Scanner.int() for i in range(n)]
def solve():
N, K = Scanner.map_int()
A = Scanner.map_int()
S = 1
for i in range(K - 1):
S *= A[i]
for i in range(K, N):
if A[i - K] < A[i]:
print('Yes')
else:
print('No')
def main():
# sys.setrecursionlimit(1000000)
# sys.stdin = open("sample.txt")
solve()
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import copy
import decimal
class Scanner():
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [Scanner.string() for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [Scanner.int() for i in range(n)]
def solve():
N, K = Scanner.map_int()
A = Scanner.map_int()
for i in range(K, N):
if A[i - K] < A[i]:
print('Yes')
else:
print('No')
def main():
# sys.setrecursionlimit(1000000)
# sys.stdin = open("sample.txt")
solve()
if __name__ == "__main__":
main()
| p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
a_old = 1
for i in range(K):
a_old = a_old*A[i]
a_new = a_old
for i in range(K, N):
a_new = (a_old // A[i-K])*A[i]
if a_new > a_old:
print('Yes')
else:
print('No')
a_old = a_new | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
a = K
b = 0
for _ in range(N-K):
if A[a] > A[b]:
print('Yes')
else:
print('No')
a += 1
b += 1 | p02602 |
n,k = list(map(int,input().split()))
a = [int(x) for x in input().split()]
num = n-k
ans = 1
before = 0
for i in range(num+1):
ans *= a[i]
for i in range(1,num+1):
before = ans
ans = ans/ a[i-1] * a[i+k-1]
if before >= ans:
print("No")
else:
print("Yes")
| n,k = list(map(int,input().split()))
a = [int(x) for x in input().split()]
num = n-k
for i in range(1,num+1):
if a[i-1] >= a[i+k-1]:
print("No")
else:
print("Yes")
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = []
start = 1
for i in range(k):
start *= a[i]
b.append(start)
score = start
for i in range(k, n):
score = score / a[i-k] * a[i]
b.append(score)
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[i + k]:
print('Yes')
else:
print('No') | p02602 |
from operator import mul
from functools import reduce
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
base = []
ans2=0
for n in range(K, N+1):
ans1=ans2
start = n-K
ans = 1
ans = reduce(mul, As[start:n])
ans2 = ans
if n != K:
if ans1 < ans2:
print("Yes")
else:
print("No") | N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
ans2=0
for n in range(K+1, N+1):
ans1 = As[n-K-1]
ans2 = As[n-1]
if ans1 < ans2:
print("Yes")
else:
print("No") | p02602 |
import functools
import operator
prod = functools.partial(functools.reduce, operator.mul)
N,K,*A = list(map(int, open(0).read().split()))
p = None
j = 0
for i in range(K, N+1):
c = prod(A[j:i])
if p:
if p < c:
print('Yes')
else:
print('No')
p = c
j += 1 | N,K,*A = list(map(int, open(0).read().split()))
for i,n in enumerate(range(K-1, N)):
if i == 0:
continue
if A[n-K] < A[n]:
print('Yes')
else:
print('No') | p02602 |
from copy import deepcopy
n,k=list(map(int, input().split()))
a=list(map(int,input().split()))
tmp = 1
for i in range(k):
tmp*=a[i]
p = tmp
p //= a[0]
p *= a[k]
for j in range(n-k):
#print(tmp,p)
if tmp < p:
print("Yes")
else:
print("No")
if k+j+1 > n-1:
break
tmp = p
#print(a[j+1],a[k+j])
p //= a[j+1]
p *= a[k+j+1]
| n,k = list(map(int, input().split()))
a=list(map(int,input().split()))
for i in range(n-k):
#print(i,k+i)
if a[i] < a[k+i]:
print("Yes")
else:
print("No") | p02602 |
# @uthor : Kaleab Asfaw
import sys
input = sys.stdin.readline
def product(lst):
x = 1
for i in lst:
x *= i
return x
def main(n, k, lst):
prev = product(lst[:k])
for i in range(n-k):
curr = (prev / lst[i]) * lst[i+k]
if curr > prev: print("Yes")
else: print("No")
prev = curr
n, k = list(map(int, input().split()))
lst = list(map(int, input().split()))
main(n, k, lst)
| # @uthor : Kaleab Asfaw
import sys
input = sys.stdin.readline
def main(n, k, lst):
for i in range(n-k):
if lst[i+k] > lst[i]:print("Yes")
else: print("No")
n, k = list(map(int, input().split()))
lst = list(map(int, input().split()))
main(n, k, lst)
| p02602 |
N, K = list(map(int, input().split()))
A = [0] + list(map(int, input().split()))
m_cur = 1
for i in range(1, K+1):
m_cur *= A[i]
for i in range(K+1, N+1):
a_latest, a_last = A[i], A[i-K]
m_last, m_cur = m_cur, (m_cur // a_last) * a_latest
if m_last < m_cur:
print("Yes")
else:
print("No")
| N, K = list(map(int, input().split()))
A = [0] + list(map(int, input().split()))
for i in range(K+1, N+1):
a_latest, a_last = A[i], A[i-K]
if a_latest > a_last:
print("Yes")
else:
print("No")
| p02602 |
def main():
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"))
if __name__ == '__main__':
main() | def main():
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = []
for i in range(k,n):
ans.append("Yes" if a[i] > a[i-k] else "No")
print(("\n".join(ans)))
if __name__ == '__main__':
main() | 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):
new = (now/a[i-k])*a[i]
if now < new:
print("Yes")
else:
print("No")
now = 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 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
def read_float():
return float(buff_readline())
def read_float_n():
return list(map(float, buff_readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, K, A):
p = reduce(mul, A[:K], 1)
for i, a in enumerate(A[K:]):
np = p//A[i] * a
if p < np:
print('Yes')
else:
print('No')
p = np
def main():
N, K = read_int_n()
A = read_int_n()
(slv(N, K, A))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
def read_float():
return float(buff_readline())
def read_float_n():
return list(map(float, buff_readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, K, A):
for i, a in enumerate(A[K:]):
if A[i] < a:
print('Yes')
else:
print('No')
def main():
N, K = read_int_n()
A = read_int_n()
(slv(N, K, A))
if __name__ == '__main__':
main()
| 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):
pre=score
score//=A[i-K]
score*=A[i]
if score>pre:
print("Yes")
else:
print("No") | 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):
pre=score
score-=A[i-K]
score+=A[i]
if score>pre:
print("Yes")
else:
print("No") | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
point = 1
point_ = 1
for i in range(K):
point *= A[i]
for i in range(N - K):
for x in range(K):
point_ *= A[i + x + 1]
if point < point_:
print("Yes")
else:
print("No")
point = point_
point_ = 1 | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(N - K):
point = A[i]
point_ = A[i + K]
if point < point_:
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.