input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
point = 1
for i in range(n):
if k > i:
point *= a[i]
continue
now = point
now //= a[i - k]
now *= a[i]
if now > point:
print('Yes')
else:
print('No')
point = now
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
point = 0
for i in range(n):
if k > i:
point += a[i]
continue
now = point
now -= a[i - k]
now += a[i]
if now > point:
print('Yes')
else:
print('No')
point = now
| p02602 |
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
t=1
for i in a[:k]:
t *= i
temp = [t]
for index, i in enumerate(a[k:]):
temp.append(temp[-1] * i // a[index])
for i,j in zip(temp, temp[1:]):
if i < j:
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()))]
pre = 1
for i in range(k):
pre *= A[i]
for i in range(k,n):
now = pre//A[i-k] *A[i]
if pre < now:
print('Yes')
else:
print('No')
pre = 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 |
# -*- coding: utf-8 -*-
def main():
import sys
import math
N,K = list(map(int, sys.stdin.readline().split()))
A_list = list(map(int, sys.stdin.readline().split()))
for i in range(len(A_list)):
A_list[i] = math.log10( A_list[i] )
point_K = 0
for i in range(K):
point_K += A_list[i]
prev = point_K
for i in range(K, len(A_list)):
current = prev - A_list[i-K] + A_list[i]
if current > prev:
print("Yes")
else:
print("No")
prev = current
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
import sys
def main():
N,K = list(map(int, sys.stdin.readline().split()))
A_list = list(map(int, sys.stdin.readline().split()))
for i in range(K, len(A_list)):
if A_list[i] > A_list[i-K]:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
| p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
from operator import mul
from functools import reduce
scores = []
judge_str = {True: "Yes", False: "No"}
for i in range(K, N+1):
scores.append(reduce(mul, A[i-K:i]))
if len(scores) == 1:
continue
else:
print((judge_str[scores[i-K-1] < scores[i-K]]))
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
judge_str = {True: "Yes", False: "No"}
for i in range(K+1, N+1):
print((judge_str[A[i-K-1] < A[i-1]])) | p02602 |
# -*- coding: utf-8 -*-
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
score = [1] * (N-K+1)
for i in range(K, N+1):
if i == K:
for j in range(K):
score[0] *= A[j]
continue
score[i-K] = (score[i-K-1] // A[i-K-1]) * A[i-1]
if score[i-K] > score[i-K-1]:
print('Yes')
else:
print('No') | # -*- coding: utf-8 -*-
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(K, N):
if A[i] > A[i-K]:
print('Yes')
else:
print('No') | p02602 |
n, k = list(map(int, input().split()))
data = list(map(int, input().split()))
for i in range(n-k):
if data[i:i+k][0] < data[i+1:i+k+1][-1]:
print("Yes")
# print( data[i:i+k] )
# print( data[i+1:i+k+1] )
else:
print("No")
| n, k = list(map(int, input().split()))
data = list(map(int, input().split()))
for i in range(n-k):
# if data[i:i+k][0] < data[i+1:i+k+1][-1]:
# print("-----------------")
# print( data[i:i+k] )
# print( data[i+1:i+k+1] )
# print( data[i] )
# print( data[k+i] )
# print("-----------------")
if data[i] < data[k+i]:
print("Yes")
# print( data[i:i+k] )
# print( data[i+1:i+k+1] )
else:
print("No")
| p02602 |
n,k = list(map(int,input().split()))
A = list(map(int,input().split()))
pre = 1
for i in range(k):
pre*=A[i]
for j in range(n-k):
tmp = pre//A[j]*A[j+k]
if pre<tmp:
print('Yes')
else:
print('No')
pre=tmp
| 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()))
mod = 10 ** 9 + 7
memo = []
for i in range(k,n+1):
x = a[i-1] % mod
for j in range(i-1, i-k, -1):
y = a[j-1] % mod
x *= y
memo.append(x)
for test in range(1, len(memo)):
if memo[test - 1] < memo[test]:
print("Yes")
else:
print("No") | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(k+1, n+1):
if a[i-1] > a[i-k-1]:
print("Yes")
else:
print("No")
| p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
s=sum(a[:k])
for i in range(n-k):
t=sum(a[i+1:k+i+1])
print(('YNeos'[s>=t::2]))
s=t | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
s=sum(a[:k])
for i in range(n-k):
t=s-a[i]+a[k+i]
print(('YNeos'[s>=t::2]))
s=t | p02602 |
from functools import reduce
from operator import mul
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
p_score = reduce(mul, a[:k])
answers = []
for i in range(k, n):
answers.append(a[i-k] < a[i])
for ans in answers:
if ans:
print("Yes")
else:
print("No")
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
answers = []
for i in range(k, n):
answers.append(a[i-k] < a[i])
for ans in answers:
if ans:
print("Yes")
else:
print("No")
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = [1] * (n-k+1)
for i in range(k):
b[0] *= a[i]
for i in range(n-k):
b[i+1] = b[i] * a[k+i] // a[i]
if b[i+1] > b[i]:
print("Yes")
else:
print("No") | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = [1] * (n-k+1)
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()))
al = list(map(int, input().split()))
t = 1
for i in range(n):
tt = t
t *= al[i]
if i < k:
continue
else:
t //= al[i-k]
if tt < t:
print('Yes')
else:
print('No')
| n, k = list(map(int, input().split()))
al = list(map(int, input().split()))
t = 1
for i in range(n):
if i < k:
continue
else:
t //= al[i-k]
if al[i-k] < al[i]:
print('Yes')
else:
print('No')
| p02602 |
def main():
[n, k] = [int(x) for x in input().split()]
arr = [int(x) for x in input().split()]
temp = 1
for i in range(k):
temp *= arr[i]
t = temp
for i in range(k, n):
t = (temp // arr[i-k])
t *= arr[i]
if t > temp:
print('Yes')
else:
print('No')
temp = t
main()
| def main():
[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-k] >= arr[i]:
print('No')
else:
print('Yes')
main()
| p02602 |
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = []
flag = 1
for i in range(N):
if a[i] < a[i + K]:
print('Yes')
else:
print("No")
flag += 1
if flag == N-K+1:
break | N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
flag = 1
for i in range(N):
if a[i] < a[i + K]:
print('Yes')
else:
print("No")
flag += 1
if flag == N-K+1:
break | p02602 |
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
flag = 1
for i in range(N):
if a[i] < a[i + K]:
print('Yes')
else:
print("No")
flag += 1
if flag == N-K+1:
break | 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 = [int(x) for x in input().strip().split(" ")]
A = [int(x) for x in input().strip().split(" ")]
def mul(A):
b = 1
for a in A:
b *= a
return b
scores = [mul(A[i-K+1:i+1]) for i in range(K-1, N)]
for i, S in enumerate(scores):
if i == 0:
continue
if S > scores[i - 1]:
print("Yes")
else:
print("No")
| N, K = [int(x) for x in input().strip().split(" ")]
A = [int(x) for x in input().strip().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=[0]*n
sum[0]=a[0]
for i in range(1,n):
sum[i]=sum[i-1]*a[i]
p=[0]*n
for i in range(k-1,n):
if i==k-1:
p[i]=sum[i]
else:
p[i]=sum[i]/sum[i-k]
for i in range(k,n):
if p[i]>p[i-1]:
print('Yes')
else:
print('No')
| import sys
def input():
return sys.stdin.readline()[:-1]
def main():
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
sum=[0]*n
sum[0]=a[0]
for i in range(1,n):
sum[i]=sum[i-1]*a[i]
p=[0]*n
for i in range(k-1,n):
if i==k-1:
p[i]=sum[i]
else:
p[i]=sum[i]/sum[i-k]
for i in range(k,n):
if p[i]>p[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()))
prod=1
for i in range(0,k):
prod=prod*a[i]
i=0
for j in range(k,len(a)):
if a[j]>a[i]:
print("Yes")
else:
print("No")
i+=1
| n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
i=0
for j in range(k,len(a)):
if a[j]>a[i]:
print("Yes")
else:
print("No")
i+=1
| p02602 |
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
i = n - k
score_prev = 1
for i in range(k):
score_prev *= A[i]
#print(score_prev)
for i in range(k, n):
score_now = score_prev*A[i]//A[i-k]
# print(score_now)
if score_now > score_prev:
print('Yes')
else:
print('No')
score_prev = score_now | 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
input = sys.stdin.readline
n, k = list(map(int, input().split()))
AA =[]
c =False
for a in input().strip().split():
a = int(a)
if not c:
AA.append(a)
if len(AA) == k:
c = True
else:
base = AA[0]
next = a
if next - base > 0:
print("Yes")
else:
print("No")
AA = AA[1:]
AA.append(a)
| n, k = list(map(int, input().split()))
AA =[int(a) for a in input().split()]
for b, t in zip(AA, AA[k:]):
if t > b:
print("Yes")
else:
print("No")
| p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = [0]*(n-k+1)
ans[0] = sum(a[0:k])
for i in range(1,n-k+1):
ans[i] = sum(a[i:k+i])
if ans[i-1] < ans[i]:
print("Yes")
else:
print("No") | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(1,n-k+1):
if a[k+i-1] > a[i-1]:
print("Yes")
else:
print("No") | p02602 |
# 解説
def main():
from math import log10
N, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
def accumulate(a):
s = 0
for x in a:
s += log10(x)
yield s
*acc, = accumulate(A)
for i in range(N - 1, K - 1, -1):
acc[i] -= acc[i - K]
for i in range(K, N):
if acc[i] > acc[i - 1] + 1e-10:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| def main():
N, K = map(int, input().split())
*A, = map(int, input().split())
ans = []
for i in range(K, N):
cond = A[i] > A[i - K]
ans.append('Yes' if cond else 'No')
print(*ans, sep='\n')
if __name__ == '__main__':
main()
| p02602 |
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(eval(input()))
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print((k.join(list(map(str, lst)))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np # cumsum
# from bisect import bisect_left, bisect_right
def solve():
N, K = MI()
A = LI()
B = [1] * N
B[0] = A[0]
for i in range(1, N):
B[i] = B[i-1] * A[i]
# print(B)
B = [1] + B
for i in range(K+1, N+1):
tmp = B[i] / B[i-K]
tmp2 = B[i-1] / B[i-1-K]
# print(tmp, tmp2)
if tmp > tmp2:
print('Yes')
else:
print('No')
if __name__ == '__main__':
solve()
| import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(eval(input()))
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print((k.join(list(map(str, lst)))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np # cumsum
# from bisect import bisect_left, bisect_right
def solve():
N, K = MI()
A = LI()
for i in range(K-1, N-1):
b = A[i-K+1]
f = A[i+1]
if f > b:
print('Yes')
else:
print('No')
if __name__ == '__main__':
solve()
| p02602 |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
point=1
for i in range(K):
point*=A[i]
point_=point
for i in range(K,N):
point_*=A[i]
point_//=A[i-K]
if point_>point:
print('Yes')
else:
print('No')
point=point_ | 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 solve(ns, k):
n = len(ns)
tot = 1
for i in range(k):
tot *= ns[i]
res = []
pre = tot
for i in range(k, n):
tot /= ns[i - k]
tot *= ns[i]
if tot > pre:
res.append(True)
else:
res.append(False)
pre = tot
return res
assert solve([96, 98, 95, 100, 20], 3) == [True, False]
assert solve([1001, 869120, 1001], 2) == [False]
assert solve([3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5, 8, 9, 7, 9], 7) == [True, True, False, True, True, False, True, True]
n, k = list(map(int, input().split()))
ns = list(map(int, input().split()))
res = solve(ns, k)
for item in res:
print('Yes' if item else 'No')
| def solve(ns, k):
n = len(ns)
tot = 1
for i in range(k):
tot += ns[i]
res = []
pre = tot
for i in range(k, n):
a = ns[i - k]
b = ns[i]
if a > b:
# tot = tot / a * b
tot = tot - 1
elif a < b:
tot = tot + 1
else:
pass
if tot > pre:
res.append(True)
else:
res.append(False)
pre = tot
return res
assert solve([1001, 869120, 1001], 2) == [False]
assert solve([96, 98, 95, 100, 20], 3) == [True, False]
assert solve([3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5, 8, 9, 7, 9], 7) == [True, True, False, True, True, False, True, True]
n, k = list(map(int, input().split()))
ns = list(map(int, input().split()))
res = solve(ns, k)
for item in res:
print('Yes' if item else 'No')
| p02602 |
import functools
import operator
n, k = list(map(int, input().split()))
a = [int(s) for s in input().split()]
vals = []
for i in range(k - 1, n):
vals.append(functools.reduce(operator.mul, a[i - k + 1:i + 1]))
for i in range(n - k):
if vals[i + 1] > vals[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(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()))
hyouten = 1
for i in range(K):
hyouten *= A[i]
for i in range(K, N):
hyouten2 = hyouten // A[i-K] * A[i]
if hyouten2 > hyouten:
print("Yes")
else:
print("No")
hyouten = hyouten2 | 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()))
ans = [0] * (N)
temp = [0] * (N)
temp[0] = A[0]
for i in range(1, N):
temp[i] = temp[i - 1] * A[i]
ans[0] = A[0]
for i in range(N):
ans[i] = temp[i]
if i >= K:
ans[i] /= temp[i - K]
for i in range(K, N):
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] > A[i - K]:
print('Yes')
else:
print('No')
| p02602 |
#!/usr/bin/env python3
import collections as cl
import sys
def II():
return int(sys.stdin.readline())
def MI():
return list(map(int, sys.stdin.readline().split()))
def LI():
return list(map(int, sys.stdin.readline().split()))
def main():
n, k = MI()
scores = LI()
score_now = 1
for i in range(k):
score_now *= scores[i]
for i in range(k, n):
next_score = score_now * (scores[i] / scores[i - k])
print(("Yes" if next_score > score_now else "No"))
main()
| #!/usr/bin/env python3
import collections as cl
import sys
def II():
return int(sys.stdin.readline())
def MI():
return list(map(int, sys.stdin.readline().split()))
def LI():
return list(map(int, sys.stdin.readline().split()))
def main():
n, k = MI()
scores = LI()
score_now = 1
for i in range(k, n):
next_score = scores[i] / scores[i - k]
print(("Yes" if next_score > 1 else "No"))
main()
| p02602 |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
a=1
for i in range(K):
a=a*A[i]
for j in range(N-K):
b=a*A[K+j]//A[j]
if (a < b ):
print("Yes")
a=b
continue
else:
print("No")
a=b
continue
| 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("No")
continue
else:
print("Yes")
continue
| p02602 |
N, K = list(map(int, input().split()))
score = list(map(int, input().split()))
add = []
sc = 1
for i in score:
sc *= i
add.append(sc)
pre = 0
for i in range(K - 1, N):
if i == K - 1:
cur = add[i]
else:
cur = add[i] // add[i - K]
print(("Yes" if cur > pre else "No"))
pre = cur
| N, K = list(map(int, input().split()))
score = list(map(int, input().split()))
add = []
sc = 1
for i in range(K):
sc *= score[i]
add.append(sc)
for i in range(K, N):
sc = sc // score[i-K]
sc *= score[i]
add.append(sc)
pre = 0
for num, val in enumerate(add):
if num != 0:
print(("Yes" if val > pre else "No"))
pre = val | p02602 |
from collections import deque
N, K = list(map(int, input().split()))
score = list(map(int, input().split()))
add = deque()
sc = 1
for i in range(K):
sc *= score[i]
add.append(sc)
for i in range(K, N):
sc = sc // score[i-K]
sc *= score[i]
add.append(sc)
pre = 0
for num, val in enumerate(add):
if num != 0:
print(("Yes" if val > pre else "No"))
pre = val | N, K = list(map(int, input().split()))
score = list(map(int, input().split()))
for i in range(K, N):
print(("Yes" if score[i - K] < score[i] else "No"))
| p02602 |
n,k=list(map(int, input().split()))
A=list(map(int, input().split()))
for gakki in range(k+1,n+1):
pre = A[gakki-k-1:gakki-1]
#pre_ = 1
#for p in pre:
#pre_ *= p
k_gakki = A[gakki-k:gakki]
#k_gakki_ = 1
#for ga in k_gakki:
#k_gakki_ *= ga
#if pre_ < k_gakki_:
if pre[0] < k_gakki[-1]:
print('Yes')
else:
print('No') | n,k=list(map(int, input().split()))
A=list(map(int, input().split()))
for gakki in range(k+1,n+1):
#pre = A[gakki-k-1:gakki-1]
pre = A[gakki-k-1]
#pre_ = 1
#for p in pre:
#pre_ *= p
#k_gakki = A[gakki-k:gakki]
k_gakki = A[gakki-1]
#print(k_gakki)
#k_gakki_ = 1
#for ga in k_gakki:
#k_gakki_ *= ga
#if pre_ < k_gakki_:
if pre < k_gakki:
print('Yes')
else:
print('No') | p02602 |
n,k = list(map(int,input().split()))
arr = list(map(int,input().split()))
brr = []
prod = 1
for i in range(k):
prod*=arr[i]
for i in range(k,n):
prev = prod
prod = prod//arr[i-k]*arr[i]
if prod>prev:
print('Yes')
else:
print('No')
| 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 collections import deque
from functools import reduce
N, K = [int(n) for n in input().split()]
scores = [int(n) for n in input().split()]
d = deque(maxlen=200001)
for i, score in enumerate(scores, start=1):
if i < K:
d.append(score)
elif i == K:
d.append(score)
pre_e = reduce(lambda x, y: x*y, d)
d.popleft()
else:
d.append(score)
e = reduce(lambda x, y: x*y, d)
if e > pre_e:
print('Yes')
else:
print('No')
pre_e = e
d.popleft()
| N, K = [int(n) for n in input().split()]
scores = [int(n) for n in input().split()]
min_pointer = 0
max_pointer = K
for i, score in enumerate(scores, start=1):
if i > K:
if scores[max_pointer] > scores[min_pointer]:
print('Yes')
else:
print('No')
min_pointer += 1
max_pointer += 1 | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split())) # (N,)
score_i = 1
for a_i in A[:K]:
score_i *= a_i
for i in range(K, N):
new_score_i = A[i] * score_i // A[i - K]
if score_i < new_score_i:
print('Yes')
else:
print('No')
score_i = new_score_i
| N, K = list(map(int, input().split()))
A = list(map(int, input().split())) # (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()))
before=1
for i in range(K):
before*=A[i]
point=1
for i in range(N-K):
point=before
point//=A[i]
point*=A[i+K]
print(("Yes" if point>before else "No"))
before=point | N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
for i in range(N-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()))
prev = 1
for i in range(K):
prev *= A[i]
for i in range(K, N):
next = prev // A[i-K] * A[i]
print(('Yes' if next > prev else 'No'))
prev = next
| import sys
input = sys.stdin.readline
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 |
import sys
input=sys.stdin.readline
def mult(x, y):
z = 0
while y > 0:
if y % 2 == 1: z = z + x
x = x << 1
y = y >> 1
return z
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=[]
p=1
for i in range(n):
p=mult(p,a[i])
if i>=k-1:
b.append(p)
p=p//a[i-k+1]
for i in range(1,len(b)):
if b[i]>b[i-1]:
print('Yes')
else:
print('No')
| import sys
input=sys.stdin.readline
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(k,n):
if a[i]>a[i-k]:
print('Yes')
else:
print('No')
| p02602 |
N, K = list(map(int, input().split(' ')))
A = tuple(map(int, input().split(' ')))
mul = 1
for i in range(K):
mul *= A[i]
pre = mul
for i in range(K, N):
mul = pre
mul //= A[i - K]
mul *= A[i]
if mul > pre:
print('Yes')
else:
print('No')
pre = mul
| N, K = list(map(int, input().split(' ')))
A = tuple(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()))
ans=[0]*(N-K)
tmp=1
before_score=0
for i in range(0,N):
tmp*=A[i]
if i>=K-1:
if i>=K:
print(('Yes' if before_score<tmp else 'No'))
before_score=tmp
tmp//=A[i-K+1]
| N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
tmp=1
before_score=0
for i in range(K,N):
if i>=K-1:
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 = []
tmp = 1
for i in range(n):
tmp *= a[i]
if i >= k:
tmp //= a[i-k]
if i >= k-1:
b.append(tmp)
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()))
B = []
def product(array):
a = 1
for k in array:
a *= k
return a
for i in range(N-K+1):
B.append(product(A[i:i+K]))
count = 0
for b in B:
if count == 0:
b_old = b
else:
if b > b_old:
print('Yes')
else:
print('No')
b_old = b
count += 1 | 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()))
sum_A = [0]*N
sum_A_k = 1
for i in range(K):
sum_A_k = sum_A_k*A[i]
sum_A[K-1] = sum_A_k
for i in range(N-K):
sum_A[K+i] = sum_A[K-1+i]*A[K+i]/A[i]
if sum_A[K+i] > sum_A[K-1+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[K+i]/A[i] > 1:
print('Yes')
else:
print('No')
# sum_A = [0]*N
# sum_A_k = 1
# for i in range(K):
# sum_A_k = sum_A_k*A[i]
# sum_A[K-1] = sum_A_k
# for i in range(N-K):
# sum_A[K+i] = sum_A[K-1+i]*A[K+i]/A[i]
# if sum_A[K+i] > sum_A[K-1+i]:
# print('Yes')
# else:
# print('No') | p02602 |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
scores=[]
for i in range(N-K+1):
score=1
for j in range(i,i+K):
score*=A[j]
scores.append(score)
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()))
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()))
hyoten = 1
for idx, a in enumerate(A):
if idx < K:
hyoten *= a
else:
next_hyoten = hyoten * a / A[idx - K]
if next_hyoten <= hyoten:
print('No')
else:
print('Yes')
hyoten = next_hyoten | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for idx, a in enumerate(A):
if idx < K:
continue
else:
if a <= A[idx - K]:
print('No')
else:
print('Yes') | p02602 |
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') | N,K = list(map(int, input().split()))
A = [0] + list(map(int, input().split()))
for i in range(K+1, N+1):
if A[i-K] >= A[i]:
print('No')
else:
print('Yes') | p02602 |
# -*- coding: utf-8 -*-
"""
Created on Sat Jul 25 17:57:31 2020
@author: Paras
"""
n,k = list(map(int, input().split()))
marks = list(map(int, input().split()))
score_curr = 1
for i in range(k):
score_curr*=marks[i]
f = marks[0]
score_prev = score_curr
j = 0
for i in range(k,n):
score_curr = (score_prev//f)*marks[i]
if score_curr>score_prev:
print("Yes")
else:
print("No")
score_prev = score_curr
j+=1
f = marks[j] | # -*- coding: utf-8 -*-
"""
Created on Sat Jul 25 17:57:31 2020
@author: Paras
"""
n,k = list(map(int, input().split()))
marks = list(map(int, input().split()))
i = 0
j = i+k
while j<n:
if marks[j]>marks[i]:
print("Yes")
else:
print("No")
i+=1
j+=1 | p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
#print(a)
prev = 0
now = 1
for i in range(n - (k - 1)):
# print(i)#
if i ==0:
for j in a[i: k + i]:
# print(j)#
now *= j
elif i >= 1:
# print(a[i - 1], a[k+i-1]) #
# print(prev,now)#
now = (prev / a[i - 1]) * a[k+i-1]
# print(prev,now)#
if prev >= now:
print("No")
else:
print("Yes")
prev = now
now = 1
# print(prev,now)# | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
#print(a)
for i in range(n - (k - 1)):
if i >=1:
if a[i - 1] < a[k+i-1]:
print("Yes")
else:
print("No") | p02602 |
n, k = list(map(int, input().split()))
aa = tuple(map(int, input().split()))
s = 1
ps = 1
for i in range(n):
s *= aa[i]
if i >= k:
s //= aa[i - k]
if ps < s:
print('Yes')
else:
print('No')
ps = s
| n, k = list(map(int, input().split()))
aa = tuple(map(int, input().split()))
for i in range(k, n):
if aa[i - k] < aa[i]:
print('Yes')
else:
print('No')
| p02602 |
N,K=list(map(int,input().split()))
*A,=list(map(int,input().split()))
for i in range(0,N-K):
x = 1
y = 1
for j in range(K):
x*=A[i+j]
y*=A[i+j+1]
if (y<=x):
print('No')
else:
print('Yes') | N,K=list(map(int,input().split()))
*A,=list(map(int,input().split()))
for i in range(0,N-K):
print(('Yes' if 1<A[i+K]/A[i] else 'No')) | p02602 |
import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def MI():return map(int,input().split())
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RA():return map(int,open(0).read().split())
def GI(V,E,ls=None,Directed=False,index=1):
org_inp=[];g=[[] for i in range(V)]
FromStdin=True if ls==None else False
for i in range(E):
if FromStdin:
inp=LI()
org_inp.append(inp)
else:
inp=ls[i]
if len(inp)==2:
a,b=inp;c=1
else:
a,b,c=inp
if index==1:a-=1;b-=1
aa=(a,c);bb=(b,c);g[a].append(bb)
if not Directed:g[b].append(aa)
return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
#h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
mp=[boundary]*(w+2);found={}
for i in R(h):
s=input()
for char in search:
if char in s:
found[char]=((i+1)*(w+2)+s.index(char)+1)
mp_def[char]=mp_def[replacement_of_found]
mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
mp+=[boundary]*(w+2)
return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
rt=[0]
for i in ls:rt+=[rt[-1]+i]
return rt
def bit_combination(n,base=2):
rt=[]
for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
return rt
def gcd(x,y):
if y==0:return x
if x%y==0:return y
while x%y!=0:x,y=y,x%y
return y
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
if show_flg:print(*inp,end=end)
mo=10**9+7
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
l_alp=string.ascii_lowercase
#sys.setrecursionlimit(10**7)
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()
########################################################################################################################################################################
show_flg=False
show_flg=True
ans=0
n,k=LI()
a=LI()
for i in range(n-k):
if a[i]<a[i+k]:
Yn(1)
else:
Yn(0)
#show(n,m)
| n,k,*a=list(map(int,open(0).read().split()))
for i in range(n-k):print(('YNeos'[a[i+k]<=a[i]::2])) | p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
score = 1
for j in range(k):
score *= a[j]
for i in range(n - k):
score2 = score / a[i] * a[k + i]
if score2 > score:
print("Yes")
else:
print("No")
score = score2
| 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 = [ int(v) for v in input().split(" ") ]
points = [ int(v) for v in input().split(" ") ]
tmp = None
results = []
for i in range(K, N+1):
next_score = 1
if tmp == None:
for p in points[i-K:i]:
next_score *= p
else:
next_score = tmp / points[i-K-1] * points[i-1]
tmp = next_score
results.append(next_score)
#print(results)
for i in range(1, len(results)):
if results[i] > results[i-1]:
print("Yes")
else:
print("No") | N, K = [ int(v) for v in input().split(" ") ]
points = [ int(v) for v in input().split(" ") ]
for i in range(K+1, N+1):
if points[i-K-1] < points[i-1]:
print("Yes")
else:
print("No")
| p02602 |
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left, bisect_right #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')
N, K = map(int, input().split())
A = list(map(int, input().split()))
B = [0]*(N-K+1)
val = 1
for a in A[:K]:
val *= a
B[0] = val
for i in range(1, N-K+1):
B[i] = B[i-1]
B[i] //= A[i-1]
B[i] *= A[i+K-1]
for bi, bip in zip(B[:-1], B[1:]):
if bi < bip:
print('Yes')
else:
print('No')
| #import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left, bisect_right #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')
N, K = 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()))
t = 0
for i in range(n-k+1):
t_2 = 0
if i == 0:
for j in range(k):
t += a[j+i]
continue
for j in range(k):
t_2 += a[j+i]
if t_2>t:
print("Yes")
else:
print("No")
t = t_2
| n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(n-k):
if a[i+k] > a[i]:
print("Yes")
else:
print("No")
| p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = []
tmp = 1
#最初のK番目まで
for i in range(k):
tmp *= a[i]
ans.append(tmp)
for j in range(k,n):
tmp *= a[j]
tmp //= a[j-k]
ans.append(tmp)
for t in range(n-k):
if ans[t+1] > ans[t]:
print("Yes")
else:
print("No") | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = []
for i in range(k,n):
ans.append(a[i] - a[i-k])
for j in ans:
if j > 0:
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[k-1-i]
for i in range(k, n):
total = tmp * a[i] / a[i - k]
if total > tmp:
print('Yes')
else:
print('No')
tmp = total
| 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()))
P = 1
for i in range(K):
P = P*A[i]
st = 0
la = K
for i in range(N-K):
P2 = (P/A[st])*A[la]
if P2 > P:
print('Yes')
else:
print('No')
st += 1
la += 1
P = P2 | [N, K] = list(map(int, input().split()))
A = list(map(int, input().split()))
st = 0
la = K
for i in range(N-K):
if A[la] > A[st]:
print('Yes')
else:
print('No')
st += 1
la += 1
| p02602 |
import itertools
import operator
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
cumpro = list(itertools.accumulate(a, func=operator.mul))
j = 0
for i in range(k,n):
if j==0:
last = cumpro[i-1]
now = cumpro[i]//cumpro[j]
else:
now,last = cumpro[i]//cumpro[j],now
print((['No','Yes'][last<now]))
j+=1 | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
j = 0
for i in range(k,n):
print((['No','Yes'][a[j]<a[i]]))
j+=1 | p02602 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
t=1
for i in range(k):
t=t*a[i]
for i in range(n-k):
s=(t//a[i])*a[i+k]
if s>t:
print("Yes")
else:
print("No")
t=s | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(n-k):
if a[i+k]>a[i]:
print("Yes")
else:
print("No") | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
a = 1
for i in range(N):
if i < K:
a *= A[i]
else:
old = a
a //= A[i - K]
a *= A[i]
ans = 'No'
if a > old:
ans = 'Yes'
print(ans) | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(N - K):
ans = 'No'
if A[i] < A[i + K]:
ans = 'Yes'
print(ans) | p02602 |
n,k=list(map(int, input().split()))
a=list(map(int, input().split()))
cnt = 0
tmp = 1
for i in range(n):
if cnt < k:
tmp = tmp * a[i]
cnt += 1
else:
tmp2 = tmp / a[i-k] * a[i]
if tmp < tmp2:
print('Yes')
else:
print('No')
tmp = tmp2
#print(tmp) | n,k=list(map(int, input().split()))
a=list(map(int, input().split()))
for i in range(n):
if i >= k:
if a[i-k] < a[i]:
#print(a[i])
print('Yes')
else:
print('No') | p02602 |
N, K = list(map(int,input().split()))
A = list(map(int,input().split()))
b = 1
for j in range(K):
b *= A[j]
for i in range(1, N-K+1):
a = b // A[i-1]
a *= A[i+K - 1]
print(('Yes' if a > b else 'No'))
b = a
| N, K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(1, N-K+1):
print(('Yes' if A[i - 1] < A[i+K - 1] else 'No'))
| p02602 |
import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
lcm = lambda x, y: (x * y) // math.gcd(x, y)
MOD = 10 ** 9 + 7
MAX = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, K = il()
A = il()
ret = [1] * N
ret[0] = A[0]
for n in range(1, N):
ret[n] *= A[n] * ret[n - 1]
if n >= K:
ret[n] //= A[n - K]
for k in range(K, N):
if ret[k - 1] < ret[k]:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
lcm = lambda x, y: (x * y) // math.gcd(x, y)
MOD = 10 ** 9 + 7
MAX = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, K = il()
A = il()
tmp = 0
for k in range(K, N + 1):
ret = 1
for a in A[k - K:k]:
ret *= a
if tmp != 0 and tmp < ret:
print('Yes')
elif tmp != 0 and tmp >= ret:
print('No')
tmp = ret
if __name__ == '__main__':
main()
| p02602 |
n,k=list(map(int,input().split()))
a = list(map(int, input().split()))
for i in range(k,n):
thescore=a[i]
lastsemester=a[i-1]
for j in range(1,k):
thescore*=a[i-j]
lastsemester*=a[i-1-j]
if thescore>lastsemester:
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 collections import deque
n,k = list(map(int,input().split()))
l = list(map(int,input().split()))
product = 1
for i in range(k):
product *= l[i]
que = deque(l[:k])
for i in range(n-k):
previous = product
product //= que.popleft()
product *= l[k+i]
if product <= previous:
print('No')
else:
print('Yes')
que.append(l[k+i]) | from collections import deque
n,k = list(map(int,input().split()))
l = list(map(int,input().split()))
que = deque(l[:k])
for i in range(n-k):
p = que.popleft()
que.append(l[k+i])
if p < l[k+i]:
print('Yes')
else:
print('No') | p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
s = [1] * (n - k + 1)
for i in range(k):
s[0] *= a[i]
for i in range(1, n - k + 1):
s[i] = int(s[i - 1] / a[i - 1] * a[k + i - 1])
for i in range(n - k):
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(1, n - k + 1):
print(('Yes' if 1 < a[k + i - 1] / a[i - 1] else 'No')) | p02602 |
N , K = list(map(int, input().split()))
A = list(map(int, input().split()))
x = 1
for a in A[:K]:
x *= a
for i in range(K, N):
xx = x // A[i-K] * A[i]
if xx > x:
print('Yes')
else:
print('No')
x = xx | N , K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(K, N):
x = A[i] / A[i-K]
if x > 1:
print('Yes')
else:
print('No') | p02602 |
n, k = list(map(int, input().split()))
a_list = list(map(int, input().split()))
prev = 1
for i in range(n - k + 1):
score = 1
for j in range(k):
score *= a_list[i + j]
if i != 0:
if prev < score:
print("Yes")
else:
print("No")
prev = score
| n, k = list(map(int, input().split()))
a_list = list(map(int, input().split()))
for i in range(n - k):
if a_list[i] < a_list[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(N - K):
list_a = list(A[i:i+K])
list_b = list(A[i+1:i+K+1])
if list_a[0] < list_b[-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 |
def solve():
N, K = list(map(int,input().split()))
A = list(map(int,input().split()))
now = 1
for i in range(K):
now *= A[i]
prev = now
for i in range(K,N):
now //= A[i-K]
now *= A[i]
if now > prev:
print('Yes')
else:
print('No')
prev = now
if __name__ == '__main__':
solve() | def solve():
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')
if __name__ == '__main__':
solve() | p02602 |
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(eval(input()))
def F(): return float(eval(input()))
def SS(): return eval(input())
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()
def resolve():
N, K = LI()
A = LI()
rate = 1
for i in range(K):
rate *= A[i]
for i in range(K, N):
rate_old = rate
rate *= A[i]
rate //= A[i-K]
if rate_old < rate:
print('Yes')
else:
print('No')
if __name__ == '__main__':
resolve()
| import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(eval(input()))
def F(): return float(eval(input()))
def SS(): return eval(input())
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()
def resolve():
N, K = LI()
A = LI()
for i in range(K, N):
if A[i-K] < A[i]:
print('Yes')
else:
print('No')
if __name__ == '__main__':
resolve()
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
mul = 1
for i in range(k):
mul *= a[i]
pre = mul
ans = []
for i in range(k, n):
mul *= a[i]
mul //= a[i-k]
if pre < mul:
ans.append("Yes")
else:
ans.append("No")
pre = mul
print(("\n".join(ans))) | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = []
for i in range(k, n):
if a[i-k] < a[i]:
ans.append("Yes")
else:
ans.append("No")
print(("\n".join(ans))) | p02602 |
from sys import stdin, stdout
import heapq
import cProfile
from collections import Counter, defaultdict, deque
from functools import reduce
import math
import string
def get_int():
return int(stdin.readline().strip())
def get_tuple():
return list(map(int, stdin.readline().split()))
def get_list():
return list(map(int, stdin.readline().split()))
n,k = get_tuple()
ls = get_list()
i = 0
prod = 1
j = 0
start = ls[j]
while i<k:
prod *= ls[i]
i += 1
while i<n:
oldprod = prod
prod = int(prod/ls[j])
prod *= ls[i]
if oldprod>=prod:
print("No")
else:
print("Yes")
i += 1
j += 1
| from sys import stdin, stdout
import heapq
import cProfile
from collections import Counter, defaultdict, deque
from functools import reduce
import math
import string
def get_int():
return int(stdin.readline().strip())
def get_tuple():
return list(map(int, stdin.readline().split()))
def get_list():
return list(map(int, stdin.readline().split()))
n,k = get_tuple()
ls = get_list()
j = 0
i = k
while i<n:
if ls[j]>=ls[i]:
print("No")
else:
print("Yes")
i += 1
j += 1
| p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
r = 1
pre = 0
for i, a in enumerate(A):
i += 1
if i > K:
r = r // A[i-K-1]
r *= a
if i > K:
print(("Yes" if r > pre else "No"))
pre = r | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i, a in enumerate(A):
if i+1 > K:
print(("Yes" if a > A[i-K] else "No")) | p02602 |
import os
import sys
from io import BytesIO, IOBase
# from collections import defaultdict as dd
# from collections import deque as dq
# import itertools as it
# from math import sqrt, log, log2
# from fractions import Fraction
def main():
t = 1
for _ in range(t):
# n = int(input)
n, k = list(map(int, input().split()))
nums = list(map(int, input().split()))
prod = 1
for i in range(k):
prod *= nums[i]
prev = prod
start = 0
for ind in range(k, n):
new = prev * nums[ind] / nums[start]
if new > prev:
print("Yes")
else:
print("No")
start += 1
prev = new
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
main() | import os
import sys
from io import BytesIO, IOBase
def main():
t = 1
for _ in range(t):
# n = int(input)
n, k = list(map(int, input().split()))
nums = list(map(int, input().split()))
start = 0
for ind in range(k, n):
if nums[ind] > nums[start]:
print("Yes")
else:
print("No")
start += 1
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
main()
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
previous_score = 1
for i in range(k):
previous_score *= a[i]
for j in range(k, n):
score = previous_score * a[j] / a[j-k]
if previous_score < score:
print('Yes')
else:
print('No')
previous_score = score | 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 = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
score = 1
tmp = 0
for i in range(K):
score *= A[i]
for j in range(N-K):
tmp = score
score = score * A[j+K] / A[j]
if score > tmp:
print("Yes")
else:
print("No")
| N,K = [int(x) for x in input().split()]
A = [int(x) for x in 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 = list(map(int,input().split()))
a=1
for i in range(N):
if i>= K:
prev = a
cur = a * A[i] // A[i-K]
if prev >= cur:
print('No')
else :
print('Yes')
a//=A[i-K]
a*=A[i]
| N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(N):
if i>= K:
prev = A[i-K]
cur = A[i]
if prev >= cur:
print('No')
else :
print('Yes')
| p02602 |
def main():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
sums = []
amount = 1
for i in range(0, k):
amount = amount * a[i]
sums.append(amount)
for i in range(1, n-k+1):
sums.append(sums[i-1]/a[i-1]*a[i+k-1])
if sums[i-1] < sums[i]:
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(0, n-k):
if a[i] < a[k+i]:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
| p02602 |
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(k-1, n):
if i == k-1:
continue
else:
if A[i] > A[i-k]:
print("Yes")
else:
print("No")
#print(A[i], A[i-k]) | n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
now = 1000
for i in range(k, n):
#print(A[i], A[i-k])
if A[i] > A[i-k]:
print("Yes")
else:
print("No") | p02602 |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
dictS={}
dictS[0]=1
for n in range (1,N):
if n<K:
# S.append(A[n]*S[-1])
dictS[n]=A[n]*dictS[n-1]
else:
# S.append(A[n]*S[-1]/A[n-K])
dictS[n]=A[n]*dictS[n-1]/A[n-K]
if n>=K:
if dictS[n]>dictS[n-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()))
s1=1
for i in range(k):
s1*=a[i]
s2=1
for i in range(n-k):
s2=s1*a[i+k]//a[i]
if s2>s1:
print("Yes")
else:
print("No")
s1=s2 | 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 = [int(i) for i in input().split()]
s = 1
for i in range(k): s *= a[i]
for i in range(k,n):
tmp = s
s //= a[i-k]
s *= a[i]
if tmp < s: ans = "Yes"
else: ans = "No"
print(ans) | n,k = list(map(int,input().split()))
a = [int(i) for i in input().split()]
for i in range(k,n):
if a[i-k] < a[i]: ans = "Yes"
else: ans = "No"
print(ans) | p02602 |
#c
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
num_list = []
for i in range(n-k+1):
num = 1
for j in range(i,i+k):
num *= a[j]
num_list.append(num)
for i in range(len(num_list)-1):
if num_list[i] < num_list[i+1]:
print("Yes")
else:
print("No") | #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()))
Hyoten = [0] * (N-K+1)
for i in range(K,N+1):
if i == K:
Hyoten[i-K] = 1
for j in range(i-K,i):
Hyoten[i-K] *= A[j]
else:
s_val = A[i-K-1]
Hyoten[i-K] = Hyoten[i-K-1] / s_val * A[i-1]
for i in range(0,N-K+1):
if i == 0:
pre_Hyoten = Hyoten[i]
else:
if pre_Hyoten < Hyoten[i]:
print("Yes")
else:
print("No")
pre_Hyoten = Hyoten[i]
| N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(K+1,N+1):
if A[i-K-1] < A[i-1]:
print("Yes")
else:
print("No") | p02602 |
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
points = []
p = 1
for i in range(k):
p *= a[i]
points.append(p)
for i in range(n-k):
p = p * a[i+k] // a[i]
points.append(p)
for p,n in zip(points, points[1:]):
if p < n:
print('Yes')
else:
print('No') | n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
for p,n in zip(a, a[k:]):
if p < n:
print('Yes')
else:
print('No') | p02602 |
N, K = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a2 = [1]
for i in a:a2.append(a2[-1]*i)
score_dict = {K:a2[K]}
for i in range(K+1, N+1):
score_dict[i] = a2[i]//a2[i-K]
if score_dict[i] > score_dict[i-1]:
print('Yes')
else:
print('No') | N, K = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
K_value = 1
for i in range(K):
K_value *= a[i]
score_dict = {K-1:K_value}
for i in range(K, N):
score_dict[i] = (score_dict[i-1] * a[i]) // a[i-K]
if score_dict[i] > score_dict[i-1]:
print('Yes')
else:
print('No')
| p02602 |
N, K = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
K_value = 1
for i in range(K):
K_value *= a[i]
score_dict = {K-1:K_value}
for i in range(K, N):
score_dict[i] = (score_dict[i-1] * a[i]) // a[i-K]
if score_dict[i] > score_dict[i-1]:
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()))
a = list(map(int, input().split()))
sm=1
sm_lst=[]
for i in range(n):
sm*=a[i]
if i>=k:
sm//=a[i-k]
if sm > sm_lst[i-1]:
print("Yes")
else:
print("No")
sm_lst.append(sm)
| 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()))
h=[]
for i in range(n-k+1):
l=1
for j in range(k):
l*=A[k+i-1-j]
h.append(l)
for i in range(n-k):
if h[i]<h[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 |
from functools import reduce
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
score = [0] * (n+1)
for i in range(k, n+1):
score[i] = reduce(lambda x, y: x*y, a[i-k:i], 1)
if i == k:
continue
print(('Yes' if score[i-1] < score[i] else 'No'))
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(k, n+1):
if i == k:
continue
print(('Yes' if a[i-k-1] < a[i-1] else 'No'))
| p02602 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
score = [1 for _ in range(N)]
for i in range(K-1,N):
for j in range(K):
score[i] *= A[i-j]
for k in range(K-1,N-1):
if score[k] < score[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-1,N-1):
if A[i+1-K] < A[i+1]:
print("Yes")
else:
print("No") | p02602 |
from functools import reduce
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for k in range(N-K):
score1 = reduce(lambda x,y: x*y, A[k:K+k])
score2 = reduce(lambda x, y: x*y, A[k+1:K+k+1])
if score1 < score2:
print("Yes")
else:
print("No") | from functools import reduce
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for k in range(N-K):
score1 = A[k]
score2 = A[K+k]
if score1 < score2:
print("Yes")
else:
print("No") | p02602 |
#m-solutions2020 c
import sys,math,collections,itertools
input = sys.stdin.readline
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
ans = 1
for i in range(K):
ans *= A[i]
pre = ans
for i in range(K,N):
now = pre * A[i]//A[i-K]
if now > pre:
print('Yes')
else:
print('No')
pre = now
| #m-solutions2020 c
import sys
input = sys.stdin.readline
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(K,N):
if A[i]>A[i-K]:
print('Yes')
else:
print('No')
| p02602 |
# import functools
# import operator
# prod = functools.partial(functools.reduce, operator.mul)
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
score = [1 for _ in range(N)]
for i in range(K):
for j in range(i+1):
score[j] *= A[i]
# print(score)
# pre_score = prod(A[:K])
for i in range(K, N):
for x in range(K):
score[i-x] *= A[i]
# score = prod(A[i-K+1:i+1])
# print(score[i-K+1] , score[i-K])
if score[i-K+1] > score[i-K]:
print('Yes')
else:
print('No')
# pre_score = score
# print(score) | 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()))
prod = 1
for i in range(k-1):
prod *= a[i]
j = 0
for i in range(k-1,n-1):
prod *= a[i]
if prod < (prod//a[j]) * a[i+1]:
print("Yes")
else:
print("No")
j += 1
#print(prod, prod//a[j] * a[i+1])
| n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
prod = 1
# for i in range(k-1):
# prod *= a[i]
j = 0
for i in range(k,n):
if a[i] > a[j]:
print("Yes")
else:
print("No")
j += 1
#print(prod, prod//a[j] * a[i+1])
| p02602 |
n,k = list(map(int, input().split(" ")))
a = list(map(int, input().split(" ")))
grade_k = 1
for i in range(k):
grade_k = grade_k * a[i]
for i in range(k, n):
if i==k:
grade_im1 = grade_k
grade_i = grade_im1 / a[i-k] * a[i]
#print(grade_im1, grade_i)
if grade_im1 < grade_i:
print("Yes")
else:
print("No")
grade_im1 = grade_i
| n,k = list(map(int, input().split(" ")))
#a = list(map(int, input().split(" ")))
a = []
for i, a_i in enumerate(input().split(" ")):
a_i = int(a_i)
a.append(a_i)
if i<k:
continue
#print(a[i-k], a_i)
if a[i-k] < 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.