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: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
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 LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    x = I()
    print(8-((x//200)-2))
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
def main():
    X = int(input())

    a = X // 200
    print(10 - a)


if __name__ == '__main__':
    main()

# import sys
# input = sys.stdin.readline
# 
# sys.setrecursionlimit(10 ** 7)
# 
# (int(x)-1 for x in input().split())
# rstrip()
#
# def binary_search(*, ok, ng, func):
#     while abs(ok - ng) > 1:
#         mid = (ok + ng) // 2
#         if func(mid):
#             ok = mid
#         else:
#             ng = mid
#     return ok

Submission status: Accepted

Solution code:
n = int(input())
print(8-(n-400)//200)

Submission status: Accepted

Solution code:
X=int(input())
ans=10
print(ans-X//200)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  #空白あり
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし

X = I()
if X < 600:
    print(8)
else:
    print(10-X//200)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline

x, = map(int, readline().split())

x //= 200
print(10-x)

Submission status: Accepted

Solution code:
n=int(input())
n=(n-400)//200
print(8-n)

Submission status: Accepted

Solution code:
x = int(input())
x = x//200

print(10-x)

Submission status: Accepted

Solution code:
n = int(input())
print(int(10-n//200))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache

#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')
AZ = "abcdefghijklmnopqrstuvwxyz"

#############
# Functions #
#############

######INPUT######
def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]

######OUTPUT######
def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()

#####Shorten#####
def DD(arg): return defaultdict(arg)

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n): return kaijo_memo[n]
  if(len(kaijo_memo) == 0): kaijo_memo.append(1)
  while(len(kaijo_memo) <= n): kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n): return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0): gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n): gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if n == r: return 1
  if n < r or r < 0: return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1: arr.append([temp, 1])
  if arr==[]: arr.append([n, 1])
  return arr

#####MakeDivisors######
def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors

#####MakePrimes######
def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum

#####GCD#####
def gcd(a, b):
    while b: a, b = b, a % b
    return a

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#####BitCount#####
def count_bit(n):
  count = 0
  while n:
    n &= n-1
    count += 1
  return count

#####ChangeBase#####
def base_10_to_n(X, n):
  if X//n: return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))

def base_10_to_n_without_0(X, n):
  X -= 1
  if X//n: return base_10_to_n_without_0(X//n, n)+[X%n]
  return [X%n]

#####IntLog#####
def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count

#############
# Main Code #
#############
X = I()
print(10-X//200)

Submission status: Accepted

Solution code:
x = int(input())

k = x//200-1


print(9-k)

Submission status: Accepted

Solution code:
#

import sys
input=sys.stdin.readline

def main():
    X=int(input())
    X-=400
    X//=200
    print(8-X)
    
    
    
if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
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(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def TUPLE(): return tuple(map(int, input().split()))
def ZIP(n): return 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

X = INT()
n = X//200

print(10-n)

Submission status: Accepted

Solution code:
a=int(input())
k=a//200
print(10-k)

Submission status: Accepted

Solution code:
x = int(input())
print(10 - (x // 200))

Submission status: Accepted

Solution code:
n = int(input())
a = n//200
print(10-a)

Submission status: Accepted

Solution code:
x = int(input())
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: Accepted

Solution code:
N = int(input())

print(10 - N // 200)

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline

x=int(input())
y=(x-400)//200
print(8-y)

Submission status: Accepted

Solution code:
x = int(input())
print(10 - x // 200)

Submission status: Accepted

Solution code:
x=int(input())
print(10-(x//200))

Submission status: Accepted

Solution code:
N = int(input())

K = N//200

print(10 - K)

Submission status: Accepted

Solution code:
X = int(input())

t = X // 200

print(10 - t)

Submission status: Accepted

Solution code:
X=int(input())
print(10-(X//200))

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
	return list(map(int,input().split()))
def m(): #複数文字
	return map(int,input().split())
def onem(): #Nとかの取得
	return int(input())
def s(x): #圧縮
	a = []
	if len(x) == 0:
		return []
	aa = x[0]
	su = 1
	for i in range(len(x)-1):
		if aa != x[i+1]:
			a.append([aa,su])
			aa = x[i+1]
			su = 1
		else:
			su += 1
	a.append([aa,su])
	return a
def jo(x): #listをスペースごとに分ける
	return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
	return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
	ll = 0
	rr = r
	while True:
		mid = (ll+rr)//2

	if rr == mid:
		return ll
	if (ここに評価入れる):
		rr = mid
	else:
		ll = mid+1
"""

n = onem()

po = n//200

print(10-po)

Submission status: Accepted

Solution code:
X = int(input())
a = 10-(X//200)
print(a)

Submission status: Accepted

Solution code:
i=int(input())
print(10-i//200)

Submission status: Accepted

Solution code:
from collections import deque
import math

def Next(): return input()
def NextInt(): return int(Next())
def NextInts(): return map(int,input().split())
def Nexts(): return map(str,input().split())
def NextIntList(): return list(map(int,input().split()))
def RowInts(n): return [input() for i in range(n)]

n = int(input())
n //= 200

print(10-n)

Submission status: Accepted

Solution code:
X = int(input())
a = (X - 400) // 200
print(8 - a)

Submission status: Accepted

Solution code:
def main():
    X = int( input())
    print(10 - X//200)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X=[1800,1600,1400,1200,1000,800,600,400]
N=int(input())
for i in range(8):
  if N>=X[i]:
    print(i+1)
    break

Submission status: Accepted

Solution code:
X=int(input())
Y=X//200
print(10-Y)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


def readstr():
    return input().strip()


def readint():
    return int(input())


def readnums():
    return map(int, input().split())


def readstrs():
    return input().split()


def main():
    X = readint()
    print(10 - X // 200)


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
n,k =map(int,input().split())
a=[int(x ) for x in input().split()]
for i in range(k,n):
    if a[i-k]>a[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(n):
    if i>=k:
       if a[i]>a[i-k]: 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(n):
        if i>=k:
          if a[i]>a[i-k]: print('Yes')
          else: print('No')

Submission status: Runtime Error

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

cnt = 0
while b <= a:
    cnt += 1
    b *= 2
while c <= b:
    cnt += 1
    c *= 2
if cnt <= K:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
1 print(10 - int(input()) // 200)

Submission status: Runtime Error

Solution code:
a = input()

if a>=400 and a<600:print(8)
elif a>=600 and a<800:print(7)
elif a>=800 and a<1000:print(6)
elif a>=1000 and a<1200:print(5)
elif a>=1200 and a<1400:print(4)
elif a>=1400 and a<1600:print(3)
elif a>=1600 and a<1800:print(2)
elif a>=1800 and a<2000:print(1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print([8,7,6,5,4,3,2,1][(input()-400) // 200 ])

Submission status: Runtime Error

Solution code:
x = int(input())
if (x < 400) or (2000 <= x):
  break
elif(400 <= x < 600):
  print(8)
elif(600 <= x < 800):
  print(7)
elif(800 <= x < 1000):
  print(6)
elif(1000 <= x < 1200):
  print(5)
elif(1200 <= x < 1400):
  print(4)
elif(1400 <= x < 1600):
  print(3)
elif(1600 <= x < 1800):
  print(2)
elif(1800 <= x < 2000):
  print(1)

Submission status: Runtime Error

Solution code:
# cook your dish here
n,k=input().split()
n=int(n)
k=int(k)
l=list(map(int,input().split()))
for j in range(n):
    if l[k+j]>l[j]:
        print("Yes")
    else:
        print("No")
    if k+j==n-1:
        break

Submission status: Runtime Error

Solution code:
red, green, blue = map(int, input().split())
k = int(input())
success = 0
for cnt in range(k+1):
    if red >= green:
        green *= 2
    elif red >= blue:
        blue *= 2
    elif green >= blue:
        blue *= 2
    else:
        success = 1
        break
if success == 1:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
#include<stdio.h>
#include <math.h> 
int main() 
{
	int t;
	scanf("%d",&t);
	if(t>400&&t<599)
		printf("8");
	if(t>600&&t<799)
		printf("7");
	if(t>800&&t<999)
		printf("6");
	if(t>1000&&t<1199)
		printf("5");
	if(t>1200&&t<1399)
		printf("4");
	if(t>1400&&t<1599)
		printf("3");
	if(t>1600&&t<1799)
		printf("2");
	if(t>1800&&t<1999)
		printf("1");
	
	
	
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X = int(input())

cnt = 1

a = X - 400 / 200
for i in range(.7):
    if  7 <= a < 8:
        print(cnt)
    else:
        cnt += 1

Submission status: Runtime Error

Solution code:
X = int(input())
if x < 600:
  print("8級")
elif x <800:
  print("7級")
elif x <1000:
  print("6級")
elif x <1200:
  print("5級")
elif x <1400:
  print("4級")
elif x <1600:
  print("3級")
elif x <1800:
  print("2級")
elif x <2000:
  print("1級")

Submission status: Runtime Error

Solution code:
if __name__ == '__main__':
    N = int(input())
    l = []
    S = []; X = []; Y = []; P = []
    ans = 0
    for _ in range(N):
        x,y,p = map(int,input().split())
        s = p * min(abs(x),abs(y))
        ans += s
        S.append(s)
        X.append(x); Y.append(y); P.append(p)
    print(ans)
    l_S = []
    for i in range(N*2):
        if i < N:
            x = X[i]
            S_temp = []
            temp = 0
            for j in range(N):
                m = min(S[j],P[j] * (abs(X[j]-x)))
                S_temp.append(m)
                temp += m
            if ans > temp:
                 ans = temp
        else:
            y = Y[i-N]
            S_temp = []
            temp = 0
            for j in range(N):
                m = min(S[j],P[j] * (abs(Y[j]-y)))
                S_temp.append(m)
                temp += m
            if ans > temp:
                 ans = temp
        l_S.append(S_temp)
    print(ans)
    memo = [n for n in range(2 * N)]
    l_S0 = l_S
    for _ in range(N-1):
        if ans == 0:
          print(0)
          continue
        l_S1 = []
        newMemo = []
        for j in range(len(l_S0)):
            for k in range(memo[j]+1, N * 2):
                l = l_S[k]
                l0 = l_S0[j]
                S_temp = []
                temp = 0
                for h in range(N):
                    m = min(l[h],l0[h])
                    S_temp.append(m)
                    temp += m
                if ans > temp:
                     ans = temp
                l_S1.append(S_temp)
                newMemo.append(k)
        memo = newMemo
        l_S0 = l_S1
        print(ans)

Submission status: Runtime Error

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

cnt = 1
result = []
AA = len(A[K-1:])

rresult = []
for i in range(AA):
    result_a = 1
    result = A[i:i+K]
    for t in result:
        result_a *= t
    rresult.append(result_a)

for t in range(len(rresult)):
    if t == 0:
        continue
    else:
        if rresult[t] > rresult[t-1]:
            print("Yes")
        else:
            print("No")

Submission status: Runtime Error

Solution code:
n = int(input())
stocks = [int(x) for x in input().split()]
mymoney = 1000
mystock = 0

for i in range(0,len(stocks)-1):     # コメントアウト部分はデバッグ用コード
      #print(stocks[i],stocks[i+1],end=":")
      if stocks[i] < stocks[i+1]:    # 明日の方が株価が高くなる場合は、今日のうちに株を買えるだけ買う
            #print("buying",end=" ")
            mystock = mymoney//stocks[i]
            mymoney = mymoney%stocks[i]
      elif stocks[i] >= stocks[i+1]:  # 明日の方が株価が安くなる場合には、今日のうちに手持ちの株を売却
            #print("selling",end=" ")
            mymoney += mystock*stocks[i]
            mystock = 0
      #print(mymoney,mystock)

i += 1
mymoney += mystock * stocks[i]      # 最終日に手持ちの株をすべて売却して現金化
mystock = 0

print(mymoney)

Submission status: Runtime Error

Solution code:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define ll long long
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))
#define INF ((1LL<<62)-(1LL<<31))
#define max(p,q)((p)>(q)?(p):(q))
#define min(p,q)((p)<(q)?(p):(q))
#define bit(n,m)(((n)>>(m))&1)
int upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}
int downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}
void sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}
void sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}
ll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}
//#define MOD 998244353
#define MOD 1000000007
#define invp(a,p)pom(a,p-2,p)
 
ll n;
int main(){
	scanf("%lld",&n);
	printf("%lld",10-n/200);
}

Submission status: Runtime Error

Solution code:
ist=[]
starting = 400
for I in range(400,2001):
    list.append(starting)
    starting += 1
n=int(input(""))
for I in list:
    if(n>=400 and n<=599):
        print("8")
        break
    elif(n>=600 and n<=799):
        print("7")
        break
    elif(n>=800 and n<=999):
        print("6")
        break
    elif(n>=1000 and n<=1199):
        print("5")
        break
    elif(n>=1200 and n<=1399):
        print("4")
        break
    elif(n>=1400 and n<=1599):
        print("3")
        break
    elif(n>=1600 and n<=1799):
        print("2")
        break
    elif(n>=1800 and n<=1999):
        print("1")
        break

Submission status: Runtime Error

Solution code:
n = input()
print(10 - n // 200)

Submission status: Runtime Error

Solution code:
import java.util.*;
import java.io.*;

public class A {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int x = in.nextInt();
		System.out.println((2199-x)/200);
	}
}

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define endl '\n'

int main(){
	ios_base::sync_with_stdio(false);
	int n;
	cin >> n;

	int a = n / 200 - 1;
	a = 9 - a;

	cout << a << endl;
	return 0;
}

Submission status: Runtime Error

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

money = 1000
for i in range(n-1):
    if a[i] < a[i+1]:
        money += (a[i+1]-a[i])*(money//a[i])
print(money)

Submission status: Runtime Error

Solution code:
x = int(input())
if 400 <= x < 600:
    print(8)
elif 600 <= x < 800:
    print(7)
elif 800 <= x < 1000:
    print(6)
elif 1000 <= x < 1200:
    print(5)
elif 1200 <= x < 1400:
    print(4)
elif 1400 <= x < 1600:
    print(3)
elif 1600 <= x < 1800:
    print(2)
elif 1800 <= x < 2000:
    print(1)
x = int(input())
if 400 <= x < 600:
    prtint(8)
elif 600 <= x < 800:
    print(7)
elif 800 <= x < 1000:
    print(6)
elif 1000 <= x < 1200:
    print(5)
elif 1200 <= x < 1400:
    print(4)
elif 1400 <= x < 1600:
    print(3)
elif 1600 <= x < 1800:
    print(2)
elif 1800 <= x < 2000:
    print(1)

Submission status: Runtime Error

Solution code:
x = int(input())
if 400 <= x < 600:
    prtint(8)
elif 600 <= x < 800:
    print(7)
elif 800 <= x < 1000:
    print(6)
elif 1000 <= x < 1200:
    print(5)
elif 1200 <= x < 1400:
    print(4)
elif 1400 <= x < 1600:
    print(3)
elif 1600 <= x < 1800:
    print(2)
elif 1800 <= x < 2000:
    print(1)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x = int(input())
if 400 =< x =< 599:
  print("8")
elif x =< 799:
  print("7")
elif x=< 999:
  print("6")
elif x=< 1199:
  print("5")
elif x=< 1399:
  print("4")
elif x=< 1599:
  print("3")
elif x=< 1799:
  print("2")
elif x=< 1999:
  print("1")

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
kane = 1000
kabu = 0
for i in range(0, n - 1):
    if a[i] > a[i + 1]:
        kane += a[i] * kabu
        kabu = 0
    if a[i] < a[i + 1]:
        kabu = kane // a[i]
        kane %= a[i]
kane += a[n - 1] * kabu
print(kane)

Submission status: Runtime Error

Solution code:
rate = imput()

di = rate // 200

print(10 - di)

Submission status: Runtime Error

Solution code:
print(8-int((input()-400)/200))

Submission status: Runtime Error

Solution code:
print(8-int((X-400)/200))

Submission status: Runtime Error

Solution code:
input_line = input()
input2 = input_line.rstrip().split(" ")
a,b,c = [int(i) for i in input2]
count = 0
max_num = int(input())
while count<=max_num:
  if a >= b:
    b*=2
    count += 1
  else:
    break
 

while count<max_num:
  if b >= c:
    c =2*c
    count += 1
  else:
    break
    
print(a,b,c)
if a<b<c:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X = int(input())

if X in range(400,600):
  print(8)
elif X in range(600,800)
  print(7)
elif X in range(800,1000)
  print(6)
elif X in range(1000,1200)
  print(5)
elif X in range(1200,1400)
  print(4)
elif X in range(1400,1600)
  print(3)
elif X in range(1600,1800)
  print(2)
elif X in range(1800,1900)
  print(1)

Submission status: Runtime Error

Solution code:
N= int(input())
A = list(map(int,input().split()))
A.insert(0,A[0])
A.append(0)
 
money = 1000
previous_tendency = "remain"
current_tendency = "remain"
count = 1

 
for n in range(1,len(A)-1):
    if A[n] < A[n+1]:
        current_tendency = "up"
    elif A[n] > A[n+1]:
        current_tendency = "down"
    else:
        current_tendency = "remain"
        
    if previous_tendency != "down" and current_tendency != "up":
        #print(money,n,"chance",A[n],min(A[count:n+1]),previous_tendency, current_tendency)
        money += (money//min(A[count:n+1]))*(A[n]-min(A[count:n+1]))
        #print(A[count:n+1],money)
        count = n + 1
        previous_tendency = "remain"
    #print(A[n],max_price,min_price,previous_tendency,current_tendency)
    
    if current_tendency != "remain":
      previous_tendency = current_tendency
print(money)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X=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:
X=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)
else:
  print()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
if n < 600:
    ans = 8
elif  n < 800:
    ans = 7
elif n < 1000:
    ans = 6
elif n < 1200:
    ans = 5
elif  n < 1400:
    ans = 4
elif  n < 1600:
    ans = 3
elif  n < 1800:
    ans = 2
else:
    ans = 1
print(str(ans) + '-kyu')
n = int(input())
if n < 600:
    ans = 8
elif  n < 800:
    ans = 7
elif n < 1000:
    ans = 6
elif n < 1200:
    ans = 5
elif  n < 1400:
    ans = 4
elif  n < 1600:
    ans = 3
elif  n < 1800:
    ans = 2
else:
    ans = 1
print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
if n < 600:
  ans = 8
else if n < 800:
  ans = 7
else if n < 1000:
  ans = 6
else if n < 1200:
  ans = 5
else if n < 1400:
  ans = 4
else if n < 1600:
  ans = 3
else if n < 1800:
  ans = 2
else :
  ans = 1
print(str(ans) + '-kyu')

Submission status: Runtime Error

Solution code:
X = int(input())

if 400 <= X < 600:
    print(8)
elif 600 <= x < 800:
    print(7)
elif 800 <= x < 1000:
    print(6)
elif 1000 <= x < 1200:
    print(5)
elif 1200 <= x < 1400:
    print(4)
elif 1400 <= x < 1600:
    print(3)
elif 1600 <= x < 1800:
    print(2)
elif 1800 <= x < 2000:
    print(1)

Submission status: Runtime Error

Solution code:
MI = lambda :(map(int,input().split()))
x = II()
if x>1799:
	print(1)
elif x>1599:
	print(2)
elif x>1399:
	print(3)
elif x>1199:
	print(4)
elif x>999:
	print(5)
elif x>799:
	print(6)
elif x>599:
	print(7)
else:
	print(8)

Submission status: Runtime Error

Solution code:
n,k = 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")