Problem:


Score: 100 points

Problem Statement

M-kun is a competitor in AtCoder, whose highest rating is X.

In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:

From 400 through 599: 8-kyu

From 600 through 799: 7-kyu

From 800 through 999: 6-kyu

From 1000 through 1199: 5-kyu

From 1200 through 1399: 4-kyu

From 1400 through 1599: 3-kyu

From 1600 through 1799: 2-kyu

From 1800 through 1999: 1-kyu

What kyu does M-kun have?

Constraints

400 \leq X \leq 1999

X is an integer.

Input

Input is given from Standard Input in the following format:

X

Output

Print the kyu M-kun has, as an integer.
For example, if he has 8-kyu, print 8.

Sample Input 1

725

Sample Output 1

7

M-kun's highest rating is 725, which corresponds to 7-kyu.

Thus, 7 is the correct output.

Sample Input 2

1600

Sample Output 2

2

M-kun's highest rating is 1600, which corresponds to 2-kyu.

Thus, 2 is the correct output.



Sample input:
725


Sample output:
7

Submission status: Runtime Error

Solution code:
import numpy as np

n, k = 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):
  z = np.prod(a[i:i+k])
  lis[i] = z
for i in range(n - k):
  if lis[i] < lis[i + 1]:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
import numpy as np

n, k = 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):
  z = np.prod(a[i:i+k])
  lis[i] = z
print(lis)
for i in range(n - k):
  if lis[i] < lis[i + 1]:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
k = int(input())
i = 0

if k > 1:
  for t in range(1, k):
    if a<b*2*t and b*2*t<c*2*(k-t):
      i += 1
    elif a<b and b<c*2*k:
      i += 1
    elif a<b*2*k and b*2*k<C:
      i += 1
    else:
      i += 0
    t += 1
elif k == 1:
  if a<b*2 and b*2<c:
    i = 1
  elif a<b and b<c*2:
    i = 1
  else:
    i = 0
  
if i > 0:
  print('Yes')
elif i == 0:
  print('No')

Submission status: Runtime Error

Solution code:
import numpy as np
tmp=[int(i) for i in input().split(' ')]
tmp_s=np.array([int(i) for i in input().split(' ')])
score=np.zeros(tmp[0]-tmp[1]+1)
for i in range(tmp[0]-tmp[1]+1):
  if i==0:
    score[0]=np.prod(tmp_s[:tmp[1]])
  else:
    if tmp_s[i-1]==0:
      score[i]=np.prod(tmp_s[i:i+tmp[1]])
    else:
      score[i]=tmp_s[i+tmp[1]-1]*score[i-1]/tmp_s[i-1]
    if score[i-1]<score[i]:
      print('Yes')
    else:
      print('No')

Submission status: Runtime Error

Solution code:
import numpy as np
tmp=[int(i) for i in input().split(' ')]
tmp_s=np.array([int(i) for i in input().split(' ')])
score=np.zeros(tmp[0]-tmp[1]+1)
for i in range(tmp[0]-tmp[1]+1):
  if i==0:
    score[0]=np.prod(tmp_s[:tmp[1]])
  else:
    if tmp_s[i-1]==0:
      score[0]=np.prod(tmp_s[i:i+tmp[1]])
    else:
      score[i]=tmp_s[i+tmp[1]-1]*score[i-1]/tmp_s[i-1]
    if score[i-1]<score[i]:
      print('Yes')
    else:
      print('No')

Submission status: Runtime Error

Solution code:
def population(n):
    if n == 0:
        return 0
    if n % 2 == 0:
        return population(n // 2)
    return 1 + population(n // 2)

N = int(input())
X = [0] * N
Y = [0] * N
P = [0] * N
for i in range(N):
    X[i], Y[i], P[i] = map(int, input().split())

ans = [10**10] * (N + 1)
for i in range(1 << (2 * N)):
    K = population(i)
    if K > N:
        continue
    cost = 0
    for j in range(N):
        if i & (1 << j) or i & (1 << (j + N)):
            continue
        cost2 = min(abs(X[j]), abs(Y[j]))
        for l in range(2 * N):
            if (i & (1 << l)) == 0:
                #print('cont', i)
                continue
            if l < N:
                #print('x')
                cost2 = min(cost2, abs(X[l] - X[j]))
            else:
                #print('y')
                cost2 = min(cost2, abs(Y[l - N] - Y[j]))
        cost += cost2 * P[j]
    ans[K] = min(ans[K], cost)
    #print(K, cost)
for i in range(N + 1):
    print(ans[i])

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split()))

for i in range(n):
    if a[0]<a[i]:
        up=True
        nin=a[0]
        break
    elif a[0]>a[i]:
        up=False
        break
    if i==n-1:
        print(1000)
        exit()

total=1000

for i in range(1,n-1):
    if up:
        if a[i-1]<=a[i] and a[i]>a[i+1]:
            total+=(total//nin)*(a[i]-nin)
            up=False
    else:
        if a[i-1]>=a[i] and a[i]<a[i+1]:
            nin=a[i]
            up=True
if nin<a[n-1]:
    total+=(total//nin)*(a[n-1]-nin)
print(total)

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
k=int(input())
for i in range(k+1):
    if a>b:
        b=b*2
    else:
        if b>c:
            c=c*2
        else:
            break

if a<b<c:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input().split())
K= int(input()) 
 
 
if (B**K+1>A)&(C>B):
  print("Yes")
elif (B**(K)>A)&(C>B**2) :
  print("Yes")
elif (B**(K-1)>A)&(C>B**3) :
  print("Yes")
elif (B**(K-2)>A)&(C>B**4) :
  print("Yes")
elif (B**(K-3)>A)&(C>B**5) :
  print("Yes")
elif (B**(K-4)>A)&(C>B**6) :
  print("Yes")
elif (B**(K-5)>A)&(C>B**7) :
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

Solution code:
import numpy as np

n, k = map(int,input().split())
a = list(map(int,input().split()))

for i in range(n-k):
    a_i = np.prod(a[i:k+i])
    a_i2 = np.prod(a[i+1:k+i+1])

    if a_i < a_i2:
        print('Yes')
    else:
        print('No')

        a.pop(0)

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
a=list(map(int,input().split()))

l=[]
for i in range(n-k+1):
    total=1
    for j in range(0+i,k+i):
        total*=a[j]
    l.append(total)

for i in range(n-k):
    if l[i]<l[i+1]:
        print('Yes')
    else:
        print('No')

Submission status: Runtime Error

Solution code:
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=I()

Dx=[defaultdict(list)for i in range(4)]
Dy=[defaultdict(list)for i in range(4)]
Np=[defaultdict(list)for i in range(4)]
Nm=[defaultdict(list)for i in range(4)]

C=dict(zip('RULD',range(4)))
'''
Dx=defaultdict(list)
Dy=defaultdict(list)
Lx=defaultdict(list)
Ly=defaultdict(list)
Ux=defaultdict(list)
Uy=defaultdict(list)
Rx=defaultdict(list)
Ry=defaultdict(list)
Dx=defaultdict(list)
Dy=defaultdict(list)
'''
for i in range(n):
    x,y,q=input().split()
    x,y=map(int,[x,y])
    d=C[q]
    Dx[d][x].append(y)
    Dy[d][y].append(x)
    
    Np[d][y].append(x)
    Nm[d][x].append(y)
    show(x,y,d,q)

    show(Dx)
    show(Dy)

Submission status: Runtime Error

Solution code:
R,G,B = map(int,input().split())
K = int(input())

if R < G < B:
  print("Yes")
  
for i in range(K):
  if R > G:
    G*=2
  elif G > B:
    B*=2
  elif R > B:
    B*=2
  elif R == G == B:
    B *= 2
  elif R == G:
    G *= 2
  elif G == B:
    B *= 2
  else:
    pass
if R < G < B:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
n=int(input())
count = 0

L=list(range(400,2000,200))
val=len(L)
count=0
for i in range(val-1):
    if L[i]<=n<L[i+1]:
        ans=8-count
        break
    else:
        count+=1
print(ans)

Submission status: Runtime Error

Solution code:
x = int(input())
for i in range(2,10):
    if i <= x/200 < i+1:
        print(10-i):

Submission status: Runtime Error

Solution code:
x = int(input())
	for i in range(2,10):
	    if i <= x/200 < i+1:
    	    print(10-i)

Submission status: Runtime Error

Solution code:
n,m=map(int,input().split())
A = list(map(int, input().split()))
B=[]
tot=1
for x in range(m):
    tot*=A[x]
temp=tot
for x in range(m,n):
    tot=tot // A[x-m]
    tot= tot * A[x]
    if(tot>temp):
        print("Yes")
    print("No")
    temp=tot

Submission status: Runtime Error

Solution code:
from functools import reduce
import operator

NK = list(map(int, input().split(' ')))
N = NK[0]
K = NK[1]
A_list = list(map(int, input().split(' ')))
score_list = []

for g in range(K, N+1):
    score = reduce(operator.mul, A_list[g-K: g])
    score_list.append(score)

for i in range(len(score_list) - 1):
    if (score_list[i] < score_list[i+1]):
        print('Yes')
    else:
        print('No')

Submission status: Runtime Error

Solution code:
N,  K= 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')

Submission status: Runtime Error

Solution code:
#for _ in range(int(input())):
def zeroPad(numberString, zeros, left = True):
    """Return the string with zeros added to the left or right."""
    for i in range(zeros):
        if left:
            numberString = '0' + numberString
        else:
            numberString = numberString + '0'
    return numberString
def karatsubaMultiplication(x ,y):
    """Multiply two integers using Karatsuba's algorithm."""
    #convert to strings for easy access to digits
    x = str(x)
    y = str(y)
    #base case for recursion
    if len(x) == 1 and len(y) == 1:
        return int(x) * int(y)
    if len(x) < len(y):
        x = zeroPad(x, len(y) - len(x))
    elif len(y) < len(x):
        y = zeroPad(y, len(x) - len(y))
    n = len(x)
    j = n//2
    #for odd digit integers
    if (n % 2) != 0:
        j += 1    
    BZeroPadding = n - j
    AZeroPadding = BZeroPadding * 2
    a = int(x[:j])
    b = int(x[j:])
    c = int(y[:j])
    d = int(y[j:])
    #recursively calculate
    ac = karatsubaMultiplication(a, c)
    bd = karatsubaMultiplication(b, d)
    k = karatsubaMultiplication(a + b, c + d)
    A = int(zeroPad(str(ac), AZeroPadding, False))
    B = int(zeroPad(str(k - ac - bd), BZeroPadding, False))
    return A + B + bd
n,k=map(int,input().split())
x=[int(x) for x in input().split()]
ans=[1]*n
ans[0]=x[0]
for i in range(1,k):
  ans[i]=ans[i-1]*x[i]
c=0
for i in range(k,n):
  ans[i]=karatsubaMultiplication(ans[i-1],x[i])/x[c]
  if ans[i]>ans[i-1]:
    print('Yes')
  else:print('No')
  c+=1

Submission status: Runtime Error

Solution code:
n,m=map(int,input().split())
A = list(map(int, input().split()))
B=[]
tot=1
for x in range(m):
    tot*=A[x]
temp=tot
for x in range(m,n):
    tot=tot//A[x-m]
    temp1=tot*A[x]
    if(temp1>temp):
        print("Yes")
    print("No")
    temp=tot

Submission status: Runtime Error

Solution code:
X=int(input())

if x<400:
    print(8)
elif 400<=X<=599:
    print(8)
elif 600<=X<=799:
    print(7)
elif 800<=X<=999:
    prnit(6)
elif 1000<=X<=1199:
    print(5)
elif 1200<=X<=1399:
    print(4)
elif 1400<=X<=1599:
    print(3)
elif 1600<=X<=1799:
    print(2)
elif 1800<=X<=1999:
    print(1)
else:
    print(1)

Submission status: Runtime Error

Solution code:
n,m=map(int,input().split())
A = list(map(int, input().split()))
B=[]
tot=1
for x in range(m):
    tot*=A[x]
temp=tot
for x in range(m,n):
    tot=int(tot/A[x-m])
    tot=tot*A[x]
    if(tot>temp):
        print("Yes")
    print("No")
    temp=tot

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))

s = (1000, 0, 0)
mmax = 1000

q = []
q.append(s)
while len(q) > 0:
    m,k,d = q.pop()
    if d == N-1:
        m += k*A[d]
        if mmax < m:
            mmax = m
    else:
        q.append((m,k,d+1))
        if m > A[d]:
            x = m // A[d]
            nm = m-x*A[d]
            nk = k+x
            q.append((nm,nk,d+1))
        if k > 0:
            nm = m+k*A[d]
            q.append((nm, 0, d+1))
            x = nm // A[d]
            if x > 0:
                q.append((nm - x*A[d], x, d+1))
print(mmax)

Submission status: Runtime Error

Solution code:
X=int(input())

if 400<=X<=599:
    print(8)
elif 600<=X<=799:
    print(6)
elif 800<=X<=999:
    prnit(6)
elif 1000<=X<=1199:
    print(5)
elif 1200<=X<=1399:
    print(4)
elif 1400<=X<=1599:
    print(3)
elif 1600<=X<=1799:
    print(2)
elif 1800<=X<=1999:
    print(1)

Submission status: Runtime Error

Solution code:
n,m=map(int,input().split())
A = list(map(int, input().split()))
B=[]
tot=1
for x in range(m):
    tot*=A[x]
temp=tot
for x in range(m,n):
    tot=tot/A[x-m]
    tot=tot*A[x]
    if(tot>temp):
        print("Yes")
    print("No")
    temp=tot

Submission status: Runtime Error

Solution code:
import sys
a = list(map(int,input().split()))
n = int(input())

for x in range(n):
    if a[2] < a[1]:
        a[2] = a[2]*2
    elif a[0] > a[1]:
        a[1] = a[1]*2
    if a[0] < a[1] < a[2]:
        print("Yes")
        sys.exit()

print("No")

Submission status: Runtime Error

Solution code:
from copy import deepcopy
n,k=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]

Submission status: Runtime Error

Solution code:
X=int(input())

if 400<=X<=599:
    print(8)
elif 600<=X<=799:
    print(7)
elif 800<=X<=999:
    prnit(6)
elif 1000<=X<=1199:
    print(5)
elif 1200<=X<=1399:
    print(4)
elif 1400<=X<=1599:
    print(3)
elif 1600<=X<=1799:
    print(2)
elif 1800<=X<=1999:
    print(1)

Submission status: Runtime Error

Solution code:
x=int(input())
  if (x>=400 and x<=599):
    print("8")
  elif (x>=600 and x<=799):
    print("7")
  elif (x>=800 and x<=999):
    print("6")
  elif (x>=1000 and x<=1199):
    print("5")
  elif (x>=1200 and x<=1399):
    print("4")
  elif (x>=1400 and x<=1599):
    print("3")
  elif (x>=1600 and x<=1799):
    print("2")
  elif (x>=1800 and x<=1999):
    print("1")

Submission status: Runtime Error

Solution code:
mylist = []
x = 0
while x <= 1:
  val = input()
  x = x + 1
  if val:
    mylist.append(val)
  else:
    break
 


a = mylist[0].split( )
A = int(a[0])
B = int(a[1])
C = int(a[2])
K = int(mylist[1])
r = A
g = B 
b = C



for k in range(K):
    if r > b and r > g:
        if r > b:
            b = b * 2
        elif r > g:
            g = g * 2
        elif g > b:
            b = b * 2
    elif g > r:
        g = g * 2
    elif b == g or b == r:
        b = b * 2
    elif b > g and g == r:
        g = g * 2


if b > g and g > r:
    print("yes")
else:
    print("no")

Submission status: Runtime Error

Solution code:
X=int(input())

if 0<=X<=399:
    print(9)
elif 400<=X<=599:
    print(8)
elif 600<=X<=799:
    print(7)
elif 800<=X<=999:
    prnit(6)
elif 1000<=X<=1199:
    print(5)
elif 1200<=X<=1399:
    print(4)
elif 1400<=X<=1599:
    print(3)
elif 1600<=X<=1799:
    print(2)
elif 1800<=X<=1999:
    print(1)
else:
    print(0)

Submission status: Runtime Error

Solution code:
mylist = []
x = 0
while x <= 1:
  val = input()
  x = x + 1
  if val:
    mylist.append(val)
  else:
    break
 


a = mylist[0].split( )
A = int(a[0])
B = int(a[1])
C = int(a[2])
K = int(mylist[1])
r = A
g = B 
b = C



for k in range(K):
    if r > b and r > g:
        if r > b:
            b = b * 2
        elif r > g:
            g = g * 2
        elif g > b:
            b = b * 2
    elif g > r:
        g = g * 2
    elif b == g or b == r:
        b = b * 2
    elif b > g and g == r
        g = g * 2


if b > g and g > r:
    print("yes")
else:
    print("no")

Submission status: Runtime Error

Solution code:
A,B,C = map(int, input().split())
K = int(input())
D = B
E = C
i1 = 0
i2 = 0
while(D<A):
    D = D*2
    i1 +=1
while(E<A):
    E = E*2
    i2 +=1
if K >= i1+i2:
    print("Yes")
else:
    print("No") 
print(i1)
print(i2)
print(D)
print(E)

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input().split())
K= int(input()) 
 
 
if (B**K>A)&(C>B):
  print("Yes")
elif (B**(K-1)>A)&(C>B**1) :
  print("Yes")
elif (B**(K-2)>A)&(C>B**2) :
  print("Yes")
elif (B**(K-3)>A)&(C>B**3) :
  print("Yes")
elif (B**(K-4)>A)&(C>B**4) :
  print("Yes")
elif (B**(K-5)>A)&(C>B**5) :
  print("Yes")
elif (B**(K-6)>A)&(C>B**6) :
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

Solution code:
A,B,C = map(int,input().split())
K = int(input())
for i in range(K):
    if C<=B:
        C*=2
    elif B<A and C>B:
        B*=2
if B>A and C>B:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input().split())
K= int(input()) 
 
 
if (B**K>A)&(C>B):
  print("Yes")
elif (B**(K-1)>A)&(C>B**1) :
  print("Yes")
elif (B**(K-2)>A)&(C>B**2) :
  print("Yes")
elif (B**(K-3)>A)&(C>B**3) :
  print("Yes")
elif (B**(K-4)>A)&(C>B**4) :
  print("Yes")
elif (B**(K-5)>A)&(C>B**5) :
  print("Yes")
elif (B**(K-6)>A)&(C>B**6) :
  print("Yes")
elif (B>A)&(C>B**7) :
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

Solution code:
#3

n, k = map(lambda x: int(x), input().split())
list_a =  list(map(lambda x: int(x), input().split()))
list_score = []

for i in range(n):
    if i < k - 1:
        continue
#     print(i-k, i+1)
    list_score.append(sum(list_a[i-k+1:i+1]))
# print(list_score)

score_before = list_score[0]
for score in list_score[1:]:
    if score_before < score:
        print('Yes')
        score_before = score
        continue
    print('No')
    score_before = score

Submission status: Runtime Error

Solution code:
X=int(input())
if X>=1800:
  print(1)
elif X>=1600:
  print(2)
elif X>=1400:
  print(3) 
elif X>=1200:
  print(4)
elif X>=1000:
  print(5)
elif X>=800:
  print(6)
elif X>=600:
  print(7)
else:
  print(8)

elif X>=1600:
  print(2)

Submission status: Runtime Error

Solution code:
mylist = []
x = 0
while x <= 1:
  val = input()
  x = x + 1
  if val:
    mylist.append(val)
  else:
    break
 


a = mylist[0].split( )
A = int(a[0])
B = int(a[1])
C = int(a[2])
K = int(mylist[1])
r = A
g = B 
b = C



for k in range(K):
    if r > b and r > g:
        if r > b:
            b = b * 2
        elif r > g:
            g = g * 2
        elif g > b:
            b = b * 2
    elif g > r:
        g = g * 2


if b > g and g > r:
    print("yes")
else:
    print("no")

Submission status: Runtime Error

Solution code:
x=int(integer)
  if 400<=x and x<=599:
    print("8")
  elif 600<=x and x<=799:
    print("7")
  elif 800<=x and x<=999:
    print("6")
  elif 1000<=x and x<=1199:
    print("5")
  elif 1200<=x and x<=1399:
    print("4")
  elif 1400<=x and x<=1599:
    print("3")
  elif 1600<=x and x<=1799:
    print("2")
  elif 1800<=x and x<=1999:
    print("1")

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input().split())
K= int(input()) 
 
 
if (B**K>A)&(C>B):
  print("Yes")
elif (B**(K-1)>A)&(C>B**1) :
  print("Yes")
elif (B**(K-2)>A)&(C>B**2) :
  print("Yes")
elif (B**(K-3)>A)&(C>B**3) :
  print("Yes")
elif (B**(K-4)>A)&(C>B**4) :
  print("Yes")
elif (B**(K-5)>A)&(C>B**5) :
  print("Yes")
elif (B**(K-6)>A)&(C>B**6) :
  print("Yes")
elif (B**(K-7)>A)&(C>B**7) :
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
k=int(input())
for i in range(k):
    if a>b:
        b=b*2
        if b>c:
            c=c*2


if a<b and b<c:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
i = list(map(int, input().split()))
limit = int(input())
k = 0
while not i[0] < i[1] < i[2]:
    if i[2] <= i[1]:
        i[2] *= 2
        k += 1
    if k == limit:
        break
    if i[1] <= i[0]:
        i[1] *= 2
        k += 1
    if k == limit:
        break
if k <= limit and i[0] < i[1] < i[2]:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
x=int(integer)
  if 400<=x<=599:
    print("8")
  elif 600<=x<=799:
    print("7")
  elif 800<=x<=999:
    print("6")
  elif 1000<=x<=1199:
    print("5")
  elif 1200<=x<=1399:
    print("4")
  elif 1400<=x<=1599:
    print("3")
  elif 1600<=x<=1799:
    print("2")
  elif 1800<=x<=1999:
    print("1")

Submission status: Runtime Error

Solution code:
i = list(map(int, input().split()))
limit = int(input())
k = 0
while not i[0] < i[1] < i[2]:
    if i[2] < i[1]:
        i[2] *= 2
        k += 1
    if k == limit:
        break
    if i[1] < i[0]:
        i[1] *= 2
        k += 1
    if k == limit:
        break
if k <= limit and i[0] < i[1] < i[2]:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import numpy as np

n, k = map(int, input().split())
ai = list(map(int, input().split()))

ei = []

for i in range(k,n+1):
    ei.append(np.prod(ai[i-k:i]))


for i in range(n-k):
    if ei[i] < ei[i+1]:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
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

Submission status: Runtime Error

Solution code:
mylist = []
x = 0
while x <= 1:
  val = input()
  x = x + 1
  if val:
    mylist.append(val)
  else:
    break
 


a = mylist[0].split( )
A = int(a[0])
B = int(a[1])
C = int(a[2])
K = int(mylist[1])
r = A
g = B 
b = C



for k in range(K):
    if r > b:
        b = b * 2
    elif r > g:
        g = g * 2
    elif g > b:
        b = b * 2

if b > g and g > r:
    print("yes")
else:
    print("no")

Submission status: Runtime Error

Solution code:
import functools
import operator
n,k=map(int,input().split())
a=list(map(int,input().split()))
a1=a[k-1:]
result = functools.reduce(operator.mul, a1)
for i in range(n-k):
    if result<result/a[i]*a[i+k]:
        print('Yes')
    else:
        print('No')
    result=result/a[i]*a[i+k]

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
k = int(input())

for i in range(k-1):
  if b < a:
    b = b * 2
  elif c < b:
    c = c * 2
  else:
    pass

if (a < b) & (b < c):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
N,K = map(int,input().split())
A = list(map(int, input().split()))
sum = 0
last = 0
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 = 0
  sw = 0

Submission status: Runtime Error

Solution code:
import numpy as np

def main():
    N, K = (int(x) for x in input().split(" "))
    A = [int(x) for x in input().split(" ")]
    lastest_score = np.array(A[0:K]).prod()
    for i in range(1, N-K+1):
        current_score = np.array(A[i:i+K]).prod()
        if lastest_score < current_score:
            print("Yes")
        else:
            print("No")
        lastest_score = current_score


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
A=list(map(int,input().split()))
cc=1
for j in range(k):
  cc*=A[j]

for i in range(k,n):
  pp=A[i]*cc//A[i-k]
  if pp>cc:print('Yes')
  else:print('No')
  
  cc=pp

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input().split())
K= int(input()) 
 
 
for i in range(K):
  B=B*2
if (B>A)&(C>B):
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input().split())
K= int(input()) 
 
 
for i in range(K):
  B=B*2
  if (B>A)&(C>B):
    print("Yes")
  else :
    print("No")

Submission status: Runtime Error

Solution code:
def main():
  a,b,c = map(lambda x: int(x), input().split())
  k = int(input())
 
  for _ in range(k):
      if b <= a:
          b = 2 * b
          continue
      if c <= b:
          c = 2 * c
          continue
      print('Yes')
      return
 
  if (a < b) & (b < c):
      print('Yes')
      return
  print('No')
 
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input().split())
K= int(input()) 
 
 
for i in range(1,K+1):
  B=B*2
  if (B>A)&(C>B):
    print("Yes")
  else :
    print("No")

Submission status: Runtime Error

Solution code:
import sys
 
def main():
  a,b,c = map(lambda x: int(x), input().split())
  k = int(input())
 
  for _ in range(k):
      if b <= a:
          b = 2 * b
          continue
      if c <= b:
          c = 2 * c
          continue
      print('Yes')
      return
 
  if (a < b) & (b < c):
      print('Yes')
      return
  print('No')
 
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
N, K = list(map(int, input().strip().split()))
A = list(map(int, input().strip().split()))

import numpy as np

Base = np.prod(A[:K])
for n in range(N-K):
  Tgt_i = np.prod(A[n:K+n])
  Tgt_i1 = np.prod(A[n+1:K+n+1])
  if Tgt_i < Tgt_i1:
    print('Yes')
  else:
    print('No')

Submission status: Runtime Error

Solution code:
x=inport()
if 400<=x<=599:
  print(8)
elif 600<=x<=799:
  print(7)
elif 800<=x<=999:
  print(6)
elif 1000<=x<=1199:
  print(5)
elif 1200<=x<=1399:
  print(4)
elif 1400<=x<=1599:
  print(3)
elif 1600<=x<=1799:
  print(2)
else:
  print(1)

Submission status: Runtime Error

Solution code:
import sys

def main():
  a,b,c = map(lambda x: int(x), input().split())
  k = int(input())

  for _ in range(k):
      if b <= a:
          b = 2 * b
          continue
      if c <= b:
          c = 2 * c
          continue
      print('Yes')
      sys.exit()

  if (a < b) & (b < c):
      print('Yes')
      sys.exit()
  print('No')

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
k = int(input())

for i in range(k):
    if a >= b:
        b = b*2
    else:
        c = c*2


if a < b and b < c:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import sys
a,b,c = map(lambda x: int(x), input().split())
k = int(input())

for _ in range(k):
    if b <= a:
        b = 2 * b
        continue
    if c <= b:
        c = 2 * c
        continue
    print('Yes')
    quit()
    
if (a < b) & (b < c):
    print('Yes')
    quit()
print('No')

Submission status: Runtime Error

Solution code:
import sys
a,b,c = map(lambda x: int(x), input().split())
k = int(input())

for _ in range(k):
    if b <= a:
        b = 2 * b
        continue
    if c <= b:
        c = 2 * c
        continue
    print('Yes')
    sys.exit()
    
if (a < b) & (b < c):
    print('Yes')
    sys.exit()
print('No')

Submission status: Runtime Error

Solution code:
score = [1800,1600,1400,1200,1000, 800, 600, 400]
ranks = [   1,   2,   3,   4,   5,   6,   7,   8]

x = int(input())
i = 0

while(x <= score[i]):
      i += 1

print(ranks[i])

Submission status: Runtime Error

Solution code:
score = [1800,1600,1400,1200,1000, 800, 600, 400]
ranks = [   1,   2,   3,   4,   5,   6,   7,   8]

x = int(input())
i = 0

while(x <= score[i]):
      print(x,score[i])
      i += 1

print(ranks[i])

Submission status: Runtime Error

Solution code:
R,G,B=map(int,input().split())
K=int(input())
#print(R,G,B,K)

for i in range(K):
  #print(R,G,B,K)
  if(B<=G):
    B*=2
    continue
  if(G<=R):
    G*=2
    continue
#print(R,G,B,K)
if(R<G and G<B):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
n=int(input())
if n>=400 and n<=599:
	print("8")
elif n>=600 and n<=799:
	print("7")
elif n>=800 and n<=999:
	print("6")
elif n>=1000 and n<=1199:
	print("5')
elif n>=1200 and n<=1399:
	print("4")
elif n>=1400 and n<=1599:
    print("3")
elif n>=1600 and n<=1799:
    print("2")
elif n>=1800 and n<=1999:
	print("1")

Submission status: Runtime Error

Solution code:
card=input().split()
k=int(input())
arr=[]
for i in range(len(card)):
    res=int(card[i])*2
    arr.append(res)
if arr[0]<arr[1]<arr[2]:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
n=int(input())
if n>400 and n<=599:
	print("8")
elif n>600 and n<=799:
	print("7")
elif n>800 and n<=999:
	print("6")
elif n>1000 and n<=1199:
	print("5')
elif n>1200 and n<=1399:
	print("4")
elif n>1400 and n<=1599:
    print("3")
elif n>1600 and n<=1799:
    print("2")
elif n>1800 and n<=1999:
	print("1")

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
k=int(input())
count=0
while(b<=a):
    b*=2
    count+=1
while(c<=b):
    c*=2
    count+=1
if count<=k:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
n,k = map(int,input().split())
a = list(map(int,input().split()))
pre = 1

for i in a[:k]:
    pre *= i
    
for i in range(k,n):
    now = pre * a[i] // a[i-k]
    
    if pre < now:
        print("Yes")
    
    else:
        print("No")
        
    pre = now