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:
def resolve():
    '''
    code here
    '''
    X = int(input())
    
    X = X//100

    if X < 6:
        res = 8
    elif X < 8:
        res = 7
    elif X < 10:
        res = 6
    elif X < 12:
        res = 5
    elif X < 14:
        res = 4
    elif X < 16:
        res = 3
    elif X < 18:
        res = 2
    else:
        res = 1
    print(res)

if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
X = int(input())

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

print(ans)

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:
import math
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())
kyu = 8

for i in range(8):
    if 400 <= X and X <= 599:
        break
    else:
        kyu = kyu - 1
        X = X -200
print(kyu)

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

Solution code:
l=[400,600,800,1000,1200,1400,1600,1800]
n=int(input())
ind=0
for i in l:
    if(i<=n):
        ind+=1
print(8-(ind-1))

Submission status: Accepted

Solution code:
x = int(input())
key = x // 100
if key == 4 or key == 5:
    print(8)
elif key == 6 or key == 7:
    print(7)
elif key == 8 or key == 9:
    print(6)
elif key == 10 or key == 11:
    print(5)
elif key == 12 or key == 13:
    print(4)
elif key == 14 or key == 15:
    print(3)
elif key == 16 or key == 17:
    print(2)
else:
    print(1)

Submission status: Accepted

Solution code:
def rank(X):
    if X >= 1800:
        return 1
    if X >= 1600:
        return 2
    if X >= 1400:
        return 3
    if X >= 1200:
        return 4
    if X >= 1000:
        return 5
    if X >= 800:
        return 6
    if X >= 600:
        return 7
    if X >= 400:
        return 8


X = int(input())
ans = rank(X)
print(ans)

Submission status: Accepted

Solution code:
x = int(input())

thres = [600, 800, 1000, 1200, 1400, 1600, 1800, 2000]

for i in range(len(thres)):
    if x < thres[i]:
        print(8 - i)
        quit()

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
#input = sys.stdin.readline  #文字列では使わない

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

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

Submission status: Accepted

Solution code:
x = int(open(0).read().rstrip())

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

Submission status: Accepted

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

resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())
for i in range(8):
    if X >= 1800 - 200 * i:
        print(1 + i)
        exit()

Submission status: Accepted

Solution code:
from sys import stdin,stdout
n=int(stdin.readline())
#map(int,stdin.readline().split())
if 400<=n<=599:print(8)
if 600<=n<=799:print(7)
if 800<=n<=999:print(6)
if 1000<=n<=1199:print(5)
if 1200<=n<=1399:print(4)
if 1400<=n<=1599:print(3)
if 1600<=n<=1799:print(2)
if 1800<=n<=1999:print(1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

j = 8
for i in range(599, 2000, 200):
    if n <= i:
        print(j)
        break
    else:
        j -= 1

Submission status: Accepted

Solution code:
X = int(input())

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

Solution code:
def solve():

    n=int(input())
    t=n//200
    print(10-t)
solve()

Submission status: Accepted

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

Submission status: Accepted

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

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:
import os
import heapq
import sys
import math
import operator
from collections import defaultdict
from io import BytesIO, IOBase


"""def gcd(a,b):
    if b==0:
        return a
    else:
        return gcd(b,a%b)"""

"""def pw(a,b):
    result=1
    while(b>0):
        if(b%2==1): result*=a
        a*=a
        b//=2
    return result"""



def inpt():
    return [int(k) for k in input().split()]


def main():
    n=int(input())
    kyu=8
    for i in range(400,1900,200):
        c=i+199
        if(i<=n<=c):
            print(kyu)
            exit()
        kyu-=1




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")

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())
for i in range(8):
    if X >= 400+i*200 and X < 600+i*200:
        print(8-i)
        break

Submission status: Accepted

Solution code:
import bisect
a=int(input())
n=[400,600,800,1000,1200,1400,1600,1800,2000]

m=bisect.bisect_right(n,a)
bisect.insort_right(n,a)
print(8-(m-1))

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

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:
## necessary imports
import sys
input = sys.stdin.readline
# from math import ceil, floor, factorial;

def ceil(x):
    if x != int(x):
        x = int(x) + 1;
    return x;
    
# swap_array function
def swaparr(arr, a,b):
    temp = arr[a];
    arr[a] = arr[b];
    arr[b] = temp

## gcd function
def gcd(a,b):
    if b == 0:
        return a
    return gcd(b, a % b);

## nCr function efficient using Binomial Cofficient
def nCr(n, k): 
    if(k > n - k): 
        k = n - k 
    res = 1
    for i in range(k): 
        res = res * (n - i) 
        res = res / (i + 1) 
    return int(res) 

## upper bound function code -- such that e in a[:i] e < x;
def upper_bound(a, x, lo=0, hi = None):
    if hi == None:
        hi = len(a);
    while lo < hi:
        mid = (lo+hi)//2
        if a[mid] < x:
            lo = mid+1
        else:
            hi = mid
    return lo

## prime factorization
def primefs(n):
    ## if n == 1    ## calculating primes
    primes = {}
    while(n%2 == 0 and n > 0):
        primes[2] = primes.get(2, 0) + 1
        n = n//2
    for i in range(3, int(n**0.5)+2, 2):
        while(n%i == 0 and n > 0):
            primes[i] = primes.get(i, 0) + 1
            n = n//i
    if n > 2:
        primes[n] = primes.get(n, 0) + 1
    ## prime factoriazation of n is stored in dictionary
    ## primes and can be accesed. O(sqrt n)
    return primes

## MODULAR EXPONENTIATION FUNCTION
def power(x, y, p): 
    res = 1
    x = x % p  
    if (x == 0) : 
        return 0
    while (y > 0) : 
        if ((y & 1) == 1) : 
            res = (res * x) % p 
        y = y >> 1      
        x = (x * x) % p 
    return res 

## DISJOINT SET UNINON FUNCTIONS
def swap(a,b):
    temp = a
    a = b
    b = temp
    return a,b

# find function with path compression included (recursive)
# def find(x, link):
#     if link[x] == x:
#         return x
#     link[x] = find(link[x], link);
#     return link[x];

# find function with path compression (ITERATIVE)
def find(x, link):
    p = x;
    while( p != link[p]):
        p = link[p];
    
    while( x != p):
        nex = link[x];
        link[x] = p;
        x = nex;
    return p;


# the union function which makes union(x,y)
# of two nodes x and y
def union(x, y, link, size):
    x = find(x, link)
    y = find(y, link)
    if size[x] < size[y]:
        x,y = swap(x,y)
    if x != y:
        size[x] += size[y]
        link[y] = x

## returns an array of boolean if primes or not USING SIEVE OF ERATOSTHANES
def sieve(n): 
    prime = [True for i in range(n+1)] 
    p = 2
    while (p * p <= n): 
        if (prime[p] == True): 
            for i in range(p * p, n+1, p):
                prime[i] = False
        p += 1
    return prime

#### PRIME FACTORIZATION IN O(log n) using Sieve ####
MAXN = int(1e5 + 5)
def spf_sieve():
    spf[1] = 1;
    for i in range(2, MAXN):
        spf[i] = i;
    for i in range(4, MAXN, 2):
        spf[i] = 2;
    for i in range(3, ceil(MAXN ** 0.5), 2):
        if spf[i] == i:
            for j in range(i*i, MAXN, i):
                if spf[j] == j:
                    spf[j] = i;
    ## function for storing smallest prime factors (spf) in the array

################## un-comment below 2 lines when using factorization #################
# spf = [0 for i in range(MAXN)]
# spf_sieve();
def factoriazation(x):
    ret = {};
    while x != 1:
        ret[spf[x]] = ret.get(spf[x], 0) + 1;
        x = x//spf[x]
    return ret
    ## this function is useful for multiple queries only, o/w use
    ## primefs function above. complexity O(log n)

## taking integer array input
def int_array():
    return list(map(int, input().strip().split()))
## taking string array input
def str_array():
    return input().strip().split();

#defining a couple constants
MOD = int(1e9)+7;
CMOD = 998244353;
INF = float('inf'); NINF = -float('inf');

################### ---------------- TEMPLATE ENDS HERE ---------------- ###################

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);

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:
X = int(input())
ans = (599 - X) // 200 + 8
print(ans)

Submission status: Accepted

Solution code:
X = int(input())
if 400 <= X and 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

print(ans)

Submission status: Accepted

Solution code:
x = int(input())

bounds = [
    400,
    600,
    800,
    1000,
    1200,
    1400,
    1600,
    1800,
    2000
]
bounds.reverse()

for i, b in enumerate(bounds):
    if x >= b:
        print(i)
        break

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

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

print(kyu)

Submission status: Accepted

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

Submission status: Accepted

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)
else: #x >= 1800 and x <= 1999:
    print(1)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
x=int(input())
ans=0
for i in range(8):
    if x<600+200*i:
        ans=8-i
        break
print(ans)

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

Solution code:
import sys
import math
sys.setrecursionlimit(int(1e6))

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

Solution code:
#a
x=int(input())
x=x/100
if x<12:
    if x<8:
        if x<6:
            a=8
        else:
            a=7
    else:
        if x<10:
            a=6
        else:
            a=5
else:
    if x<16:
        if x<14:
            a=4
        else:
            a=3
    else:
        if x<18:
            a=2
        else:
            a=1
        
print(a)

Submission status: Accepted

Solution code:
x = int(input())

ans = 1
if x <= 1799: ans = 2
if x <= 1599: ans = 3
if x <= 1399: ans = 4
if x <= 1199: ans = 5
if x <= 999: ans = 6
if x <= 799: ans = 7
if x <= 599: ans = 8

print( ans )

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)
elif X < 2000:
    print(1)

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:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools


#sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#INF = V * 10001
#A = [int(i) for i in input().split()]
#AB = [list(map(int, input().split())) for _ in range(K)]

X = int(input())
ans = 8

X= X-400

while True:
  X -= 200
  if(X<0):
    break
  else:
    ans-=1


print(ans)

Submission status: Accepted

Solution code:
n=int(input())

if n>=400 and n<600:
    print(8)

elif n>=600 and n<800:
    print(7)

elif n>=800 and n<1000:
    print(6)

elif n>=1000 and n<1200:
    print(5)

elif n>=1200 and n<1400:
    print(4)

elif n>=1400 and n<1600:
    print(3)

elif n>=1600 and n<1800:
    print(2)

else:
    print(1)

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:
x = int(input())
if x >= 400 and x < 600:
  print("8")
elif x >= 600 and x < 800:
  print("7")
elif x >= 800 and x < 1000:
  print("6")
elif x >= 1000 and x < 1200:
  print("5")
elif x >= 1200 and x < 1400:
  print("4")
elif x >= 1400 and x < 1600:
  print("3")
elif x >= 1600 and x < 1800:
  print("2")
elif x >= 1800 and x < 2000:
  print("1")

Submission status: Accepted

Solution code:
x = int(input())
reat = [400, 600, 800, 1000, 1200, 1400, 1600, 1800, 100000]

for i in range(9):
    if x < reat[i]:
        print(9 - i)
        exit()

Submission status: Accepted

Solution code:
x = int(input())

def main():
    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")       

main()

Submission status: Accepted

Solution code:
X = int(input())
K = [2000 - i * 200 for i in range(9)]
for i, k in enumerate(K):
  if X >= k:
    print(i)
    break

Submission status: Accepted

Solution code:
import sys
from math import ceil
def input(): return sys.stdin.readline().strip()


def main():
    x = int(input())
    val = 11 - x / 200
    if val == int(val):
        print(int(val) - 1)
    else:
        print(int(val))

if __name__ == "__main__":
    main()

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

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
elif x < 2000:
	ans = 1

print(ans)

Submission status: Accepted

Solution code:
x = int(input())
left_score = x - 400

print(8 - left_score // 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:
# -*- coding: utf-8 -*-
# 標準入力を取得
X = int(input())

# 求解処理
ans = int()
if X <= 599:
    ans = 8
elif X <= 799:
    ans = 7
elif X <= 999:
    ans = 6
elif X <= 1199:
    ans = 5
elif X <= 1399:
    ans = 4
elif X <= 1599:
    ans = 3
elif X <= 1799:
    ans = 2
elif X <= 1999:
    ans = 1

# 結果出力
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
@author: H_Hoshigi
"""
def main():
    X = int(input())

    kyu = int()
    if X <= 599:
        kyu = 8
    elif X <= 799:
        kyu = 7
    elif X <= 999:
        kyu = 6
    elif X <= 1199:
        kyu = 5
    elif X <= 1399:
        kyu = 4
    elif X <= 1599:
        kyu = 3
    elif X <= 1799:
        kyu = 2
    else:
        kyu = 1
    print(kyu)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
X = int(input())

compare_rate = 1800
rank = 1
for i in range(10):
    if X >= compare_rate:
        break
    compare_rate -= 200
    rank += 1

print(rank)

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:
X=int(input())
for i in range(8):
    if 400+200*i<=X<=400+200*i+199:
        print(8-i)

Submission status: Accepted

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

Submission status: Accepted

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

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:
N = int(input())
if 400 <= N and N <= 599:
    print(8)
elif 600 <= N and N <= 799:
    print(7)
elif 800 <= N and N <= 999:
    print(6)
elif 1000 <= N and N <= 1199:
    print(5)
elif 1200 <= N and N <= 1399:
    print(4)
elif 1400 <= N and N <= 1599:
    print(3)
elif 1600 <= N and N <= 1799:
    print(2)
elif 1800 <= N and N <= 1999:
    print(1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

ans = (9 - (x - 200) // 200 )

print(ans)

Submission status: Accepted

Solution code:
ma = lambda :map(int,input().split())
ni = lambda:int(input())
yn = lambda fl:print("Yes") if fl else print("No")
import collections
import math
import itertools
import heapq as hq
x = ni()
if 400<=x < 600:
    r=8
if 600<=x < 800:
    r=7
if 800<=x < 1000:
    r=6
if 1000<=x < 1200:
    r=5
if 1200<=x < 1400:
    r=4
if 1400<=x < 1600:
    r=3
if 1600<=x < 1800:
    r=2
if 1800<=x < 2000:
    r=1
print(r)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import collections as cl
import sys


def II():
    return int(sys.stdin.readline())


def MI():
    return map(int, sys.stdin.readline().split())


def LI():
    return list(map(int, sys.stdin.readline().split()))


def main():
    N = II()

    kyu = 9

    N -= 400

    while N >= 0:
        N -= 200
        kyu -= 1

    print(kyu)


main()

Submission status: Accepted

Solution code:
x = int(input())

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