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:
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)
else: print(1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(x):
    x -= 400
    return 8 - x / 200

assert solve(400) == 8
assert solve(401) == 8
assert solve(599) == 8
assert solve(1599) == 3
assert solve(1800) == 1
assert solve(1999) == 1

x = int(raw_input())
print solve(x)

Submission status: Accepted

Solution code:
x = int(input())
# = list(map(int, input().split()))
# = map(int, input().split())
ans = 10 - x // 200
print(ans)

Submission status: Accepted

Solution code:
def main():
    import sys
    sys.setrecursionlimit(10**6)
    input = sys.stdin.readline
    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:
n = int(input())
if 400<=n<=599:
    print(8)
elif 600 <= n <= 799:
    print(7)
elif 800 <= n <= 999:
    print(6)
elif 1000 <= n <= 1199:
    print(5)
elif 1200 <= n <= 1399:
    print(4)
elif 1400 <= n <= 1599:
    print(3)
elif 1600 <= n <= 1799:
    print(2)
elif 1800 <= n <= 1999:
    print(1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_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 ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X = INT()

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

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

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)

Submission status: Accepted

Solution code:
X = int(input())

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

x = k()
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: Accepted

Solution code:
x = int(input())
s = 400
c = 0
while not s <= x < s+200:
    s+=200
    c += 1
print(8-c)

Submission status: Accepted

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)
else:
  print (1)

Submission status: Accepted

Solution code:
N = int(input().strip())
print(10-N//200)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque, defaultdict
#deque(l), pop(), append(x), popleft(), appendleft(x)
#q.rotate(n)で → にn回ローテート
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations,product#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
from functools import reduce,lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("## ",*x,file=sys.stderr)
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def binr(x): return bin(x)[2:]
def bitcount(x): #xは64bit整数
    x= x - ((x >> 1) & 0x5555555555555555)
    x= (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x= (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f 
    x+= (x >> 8); x+= (x >> 16); x+= (x >> 32) 
    return x & 0x7f

def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reverse=True)  #二個目の要素で降順並び替え

    N = int(input())
    #N, K = map(int, input().split())
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列


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




if __name__ == "__main__":
    main()

Submission status: Accepted

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)
else:
    print(1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

print(10-x//200)

Submission status: Accepted

Solution code:
X = int(input())

print(10-int(X/200))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

def main():
    X = int(input())
    ans = 10 - X // 200
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
x = int(input())
for i in range(8):
  if x in range(400 + i * 200, 600 + i * 200):
    print(8 - i)
    break

Submission status: Accepted

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)
else:
    print(1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input()) - 400
ans = 8
while X - 200 >= 0:
    ans = ans - 1
    X = X - 200
print(ans)

Submission status: Accepted

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)

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

X = i()
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: Accepted

Solution code:
from math import gcd

from math import factorial as f

from math import ceil, floor, sqrt
import math

import bisect
import re
import heapq

from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(map(int, input().split()))

yes = "Yes"
no = "No"


def main():
    x = ii()
    print(10 - (x // 200))


main()

Submission status: Accepted

Solution code:
X=int(input())

count=10-X//200

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    X = int(input())
    if 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)
    else:
        print(1)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator import itemgetter
from heapq import heapify,heappop,heappush
from queue import Queue,LifoQueue,PriorityQueue
from copy import deepcopy
from time import time
import string
import sys
sys.setrecursionlimit(10 ** 7)
def input() : return sys.stdin.readline().strip()
def INT()   : return int(input())
def MAP()   : return map(int,input().split())
def LIST()  : return list(MAP())

x = INT()

if x < 600:
    ans = 8
elif x < 800:
    ans = 7
elif x < 1000:
    ans = 6
elif x < 1200:
    ans = 5
elif x < 1400:
    ans = 4
elif x < 1600:
    ans = 3
elif x < 1800:
    ans = 2
else:
    ans = 1

print(ans)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

X = int(input())
X //= 200

print(10-X)

Submission status: Accepted

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

x = int(input())
if 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)
else:
    print(1)

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest


def resolve():
    n = int(input())

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


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """725"""
        output = """7"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """1600"""
        output = """2"""
        self.assertIO(input, output)


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    X = int(readline())

    if X < 600:
        ans = 8
    elif X < 800:
        ans = 7
    elif X < 1000:
        ans = 6
    elif X < 1200:
        ans = 5
    elif X < 1400:
        ans = 4
    elif X < 1600:
        ans = 3
    elif X < 1800:
        ans = 2
    else:
        ans = 1

    print(ans)

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

tmp = (X - 400) // 200
print(8 - tmp)

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)
else:
  print(1)

Submission status: Accepted

Solution code:
x=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print(10 - n // 200)

Submission status: Accepted

Solution code:
# A = [int(i) for i in input().split()]
X = int(input())
print(8 - (X - 400) // 200)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

result = 10 - (X // 200) 

print(result)

Submission status: Accepted

Solution code:
X = int(input())
X = 2000 - (X+1)
X //= 200
print(X + 1)

Submission status: Accepted

Solution code:
X = int(input())

if 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)
else:
    print(1)

Submission status: Accepted

Solution code:
x = int(input())

if 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)
else: print("pya")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A
n = int(input())

print(10 - n//200)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Solution code:
x = int(input())
ans = 8 - (x - 400) // 200
if ans < 1:
    ans = 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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)
elif x >= 400:
    print(8)

Submission status: Accepted

Solution code:
X = int(input())

if 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)
else:
  print(1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

print(10-n//200)

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:
a=int(input())
print(str(10-a//200))

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

    if 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)
    else:
        print(1)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
X = int(input())

if 400 <= 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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    X=ii()

    ans = 0
    for i in range(2,10):
        if i*200 <= X <= (i+1)*200-1:
            ans = 8-i+2
    
    print(ans)




if __name__ == "__main__":
    main()

Submission status: Accepted

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

if N < 600:
    print(8)
elif N < 800:
    print(7)
elif N < 1000:
    print(6)
elif N < 1200:
    print(5)
elif N < 1400:
    print(4)
elif N < 1600:
    print(3)
elif N < 1800:
    print(2)
else:
    print(1)

Submission status: Accepted

Solution code:
N = int(input())

if (N < 600):
    print(8)
elif (N < 800):
    print(7)
elif (N < 1000):
    print(6)
elif (N < 1200):
    print(5)
elif (N < 1400):
    print(4)
elif (N < 1600):
    print(3)
elif (N < 1800):
    print(2)
else:
    print(1)

Submission status: Accepted

Solution code:
X = int(input())
rank = 1
base = 1800

for i in range(100):
    if X >= base:
        print(rank)
        break
    else:
        base -= 200
        rank += 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
(N, ) = [int(n) for n in input().split()]

print(10 - N // 200)

Submission status: Accepted

Solution code:
x = int(input())

for i, j in zip(range(4, 19, 2), range(8, 0, -1)):
    if i * 100 <= x <= (i + 2) * 100 - 1:
        print(j)
        exit()

Submission status: Accepted

Solution code:
x = int(input())

print(8 - (x-400) // 200)

Submission status: Accepted

Solution code:
X = int(input())
print((1999-X) // 200 + 1)

Submission status: Accepted

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

Submission status: Accepted

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

import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline

# 再起回数上限変更
# sys.setrecursionlimit(1000000)

x = int(input())
if 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)
else:
    print(1)

Submission status: Accepted

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

X = int(readline())

res = 0
if X < 600:
    res = 8
elif X < 800:
    res = 7
elif X <1000:
    res = 6
elif X < 1200:
    res = 5
elif X < 1400:
    res = 4
elif X < 1600:
    res = 3
elif X < 1800:
    res = 2
elif X < 2000:
    res = 1

print(res)

Submission status: Accepted

Solution code:
X = int(input())
Y = X//200
if Y<=2:
    print(8)
else:
    print(10-Y)

Submission status: Accepted

Solution code:
X = int(input())
#S = str(input())
#A, B = map(int, input().split())
#C = list(map(int, input().split()))

L = [600, 800, 1000, 1200, 1400, 1600, 1800]
for i in range(7):
  if L[i] > X:
    print(8 - i)
    quit()
  

print(1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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)

Submission status: Accepted

Solution code:
X = int(input())
t = max(0, (X-400)//200)
print(8 - t)

Submission status: Accepted

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