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: Wrong Answer

Solution code:
import sys
read = sys.stdin.readline
import time
import math
import itertools as it
def inpl():
    return list(map(int, input().split()))
st = time.perf_counter()
# ------------------------------

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

print(ans)



# ------------------------------
ed = time.perf_counter()
print('time:', ed-st, file=sys.stderr)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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 7


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

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

Solution code:
N = int(input().strip())

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: Wrong Answer

Solution code:
n = int(input())
if n <= 599:
    print(8)
elif n <= 899:
    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: Wrong Answer

Solution code:
a = int(input())

if 400<= a and 500>=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: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import os
import heapq
import sys
import math
import bisect
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 power(x, p,m):
    res = 1
    while p:
        if p & 1:
            res = (res * x) % m
        x = (x * x) % m
        p >>= 1
    return res
def inar():
    return [int(k) for k in input().split()]


# def bubbleSort(arr,b):
#     n = len(arr)
#     for i in range(n):
#         for j in range(0, n - i - 1):
#             if arr[j] > arr[j + 1] and b[j]!=b[j+1]:
#                 arr[j], arr[j + 1] = arr[j + 1], arr[j]
#                 b[j],b[j+1]=b[j+1],b[j]
def lcm(num1,num2):
    return (num1*num2)//gcd(num1,num2)

def main():
    #for _ in range(int(input())):
    n=int(input())
    # n,k=map(int,input().split())
    # arr=inar()
    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)
    else:
        print(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: Wrong Answer

Solution code:
# m-solutions2020_a.py
# https://atcoder.jp/contests/m-solutions2020 : A

global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    X = int(lines[0])

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

    return [ret]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['']
        lines_export = ['']
    if pattern == 2:
        lines_input = ['']
        lines_export = ['']
    if pattern == 3:
        lines_input = ['']
        lines_export = ['']
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    if mode > 0:
        print(f'lines_input=[{lines_input}]')
        print(f'lines_export=[{lines_export}]')
        print(f'lines_result=[{lines_result}]')
        if lines_result == lines_export:
            print('OK')
        else:
            print('NG')
    finished = time.time()
    duration = finished - started
    print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

    l = [6,8,10,12,14,16,18]

    for i, v in enumerate(l):
        if X < v *100:
            print(8-i)
            exit()
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())
print(f"{10 - x // 200}-kyu")

Submission status: Wrong Answer

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: Wrong Answer

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


def kyu(x):
    if x <= 599:
        return 8
    elif x <= 799:
        return 7
    elif x <= 999:
        return 6
    elif x <= 1199:
        return 5
    elif x <= 1399:
        return 3
    elif x <= 1599:
        return 3
    elif x <= 1799:
        return 2
    else:
        return 1


def main():
    x = int(input())
    k = kyu(x)
    print(k)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def rating(X):
    if X <= 599: return 8
    if X <= 799: return 7
    if X <= 999: return 6
    if X <= 1199: return 5
    if X <= 1399: return 4
    if X <= 1599: return 3
    if X <= 1799: return 2
    if X <= 1999: return 8

    assert(False)


X = int(input())
print(rating(X))

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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)
if 1200 <= N <= 1399:
    print(4)
elif 1400 <= N <= 1599:
    print(3)
elif 1600 <= N <= 1799:
    print(2)
else:
    print(1)

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
# input()
# int(input())
# map(int, input().split())
# list(map(int, input().split()))
# list(map(int, list(input()))) # スペースがない数字リストを読み込み
import math
import fractions
import sys
import bisect
import heapq  # 優先度付きキュー(最小値取り出し)
import collections
from collections import Counter
from collections import deque
import pprint
import itertools

sr = lambda: input()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""


def factorization(n):
    arr = []
    temp = n
    if n == 1:
        return arr

    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


# a^n
def power(a, n, mod):
    x = 1
    while n:
        if n & 1:
            x *= a % mod
        n >>= 1
        a *= a % mod
    return x % mod


# n*(n-1)*...*(l+1)*l
def kaijo(n, l, mod):
    if n == 0:
        return 1
    a = n
    tmp = n - 1
    while (tmp >= l):
        a = a * tmp % mod
        tmp -= 1
    return a

# Union Find
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# 約数生成
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)

    divisors.sort()
    return divisors


inf = 10 ** 18
mod = 10 ** 9 + 7

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

Submission status: Wrong Answer

Solution code:
x = int(input())

if x < 600:
    print(8)
elif 600 <= x < 800:
    print(7)
elif 800 <= x < 1000:
    print(6)
elif 600 <= x < 800:
    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: Wrong Answer

Solution code:
x=int(input())
a=1800
b=1999
for i in range(7):
  if a<=x<=b:
    break
  else:
    a-=200
    b-=200
print(1+i)

Submission status: Wrong Answer

Solution code:
x=int(input())
if 400<=x<599:
    print(8)
elif 600<=x<799:
    print(7)
elif 800<=x<999:
    print(6)
elif 800<=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: Wrong Answer

Solution code:
from sys import exit

X = int(input())

if X <= 599:
    print(8)
    exit()

if X <= 799:
    print(7)
    exit()

if X <= 999:
    print(6)
    exit()

if X <= 1199:
    print(5)
    exit()

if X <= 1399:
    print(4)
    exit()

if X <= 1599:
    print(5)
    exit()

if X <= 1799:
    print(2)
    exit()

print(1)

Submission status: Wrong Answer

Solution code:
n = int(input())

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)

Submission status: Wrong Answer

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: Wrong Answer

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 <= 1099:
    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: Wrong Answer

Solution code:
n = int(input())
if (400 <= n <= 599):
    print(8)
elif n <= 899:
    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: Wrong Answer

Solution code:
from collections import defaultdict,deque
import math
def gcd(a,b):
    return b if not a%b else gcd(b,a%b)
def lcm(a,b):
    return (a*b)//gcd(a,b)

def main():
    n = int(input())
    if(n>=1800):
        print(1)
    elif(n>=1600):
        print(2)
    elif(n>=1400):
        print(3)
    elif(n>=1200):
        print(4)
    elif(n>=1000):
        print(5)
    elif(n>=800):
        print(6)
    elif(n>=600):
        print(7)
    elif(n>=1600):
        print(8)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys, math
import io, os
#data = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
from bisect import bisect_left as bl, bisect_right as br, insort
from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter
#from itertools import permutations,combinations
def data(): return sys.stdin.readline().strip()
def mdata(): return list(map(int, data().split()))
def outl(var) : sys.stdout.write('\n'.join(map(str, var))+'\n')
def out(var) : sys.stdout.write(str(var)+'\n')
#from decimal import Decimal
from fractions import Fraction
#sys.setrecursionlimit(100000)
INF = float('inf')
mod = int(1e9)+7



x=int(data())
out(8-(x-399)//200)

Submission status: Wrong Answer

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(6)

Submission status: Wrong Answer

Solution code:
import heapq
t = 1
def max(a,b):
	if a > b:
		return a
	return b
while t > 0:
	t -= 1
	# n,k,q = map(int,input().split())
	# v = []
	# l = []
	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 <= 1699:
		print("2")
	elif x <= 1999:
		print("1")
	
	# v = list(map(int,input().strip().split()))[0:n]
	# for i in range(q):
	# 	p = int(input().strip())
	# 	v.append(p)
	# for i in range(n):
	# 	l.append(0)
	# for i in v:
	# 	l[i-1] += 1
	# for i in range(n):
	# 	if(l[i] <= q-k):
	# 		print("No")
	# 	else:
	# 		print("Yes")

Submission status: Wrong Answer

Solution code:
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))

x = int(input())
ans = 1
if x < 1800:
    ans = 2
if x < 1600:
    ans = 3
if x < 1400:
    ans = 4
if x < 1200:
    ans = 5
if x < 1000:
    ans = 6
if x < 800:
    ans = 7
if x < 599:
    ans = 8
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
n=8
for i in range(600, 2000, 200):
    if x < i:
        print(n)
        exit()
    else:
        n-=1

Submission status: Wrong Answer

Solution code:
import math
import sys
import collections
import bisect
readline = sys.stdin.readline


def main():
    x = int(readline().rstrip())
    li = [400, 600, 800, 1000, 1200, 1400, 1600, 1800]
    for i in range(8):
        if li[i] > x:
            print(9 - i)
            break


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d = {
    range(400, 600): 8,
    range(600, 800): 7,
    range(800, 800): 6,
    range(1000, 1200): 5,
    range(1200, 1400): 4,
    range(1400, 1600): 3,
    range(1600, 1800): 2,
    range(1800, 2000): 1,
}
x = int(input())
for k, v in d.items():
    if x in k:
        print(v)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
if 400 >= 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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
X=int(input())
li=[400,600,800,100,1200,1400,1600,1800,2000]
li2=[8,7,6,5,4,3,2,1,0]
for i in range(8):
    if li[i]<=X and X<li[i+1]:
        print(li2[i])
        exit()

Submission status: Wrong Answer

Solution code:
x = int(input())

if 400 <= x < 600:
    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: Wrong Answer

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

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

    print(10 - X // 200)

Submission status: Wrong Answer

Solution code:
X = int(input())
if X < 699:
    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: Wrong Answer

Solution code:
x = int(input())
for i in range(3, 10):
    if i * 200 > x:
        print(11 - i)
        exit()

Submission status: Wrong Answer

Solution code:
## for use in beginner level questions where speed is key
## and also for single test case code
## mastercopy for x,y,z

import sys
import heapq, functools, collections
import random
from collections import Counter, defaultdict

# read line as a string
# strr = input()

# read line as an integer
k = int(input())

# read one line and parse each word as a string
# lst = input().split()

# read one line and parse each word as an integer
# arr = list(map(int,input().split()))

print((2200-k)//200)

Submission status: Wrong Answer

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

Submission status: Time Limit Exceeded

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

import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

N = int(readline())
XYP = [list(map(int, readline().split())) for _ in range(N)]

x_cost = [[0 for _ in range(N)] for _ in range(1 << N)]
y_cost = [[0 for _ in range(N)] for _ in range(1 << N)]

for bit in range(1 << N):
    for i in range(N):
        x_cost[bit][i] = abs(XYP[i][0])
        y_cost[bit][i] = abs(XYP[i][1])

        for k in range(N):
            if bit & (1 << k):
                x_cost[bit][i] = min(x_cost[bit][i], abs(XYP[i][0] - XYP[k][0]))
                y_cost[bit][i] = min(y_cost[bit][i], abs(XYP[i][1] - XYP[k][1]))

ans = [sys.maxsize for _ in range(N + 1)]

for bit in range(1 << N):
    cnt = bin(bit).count('1')
    bit_ = bit
    while bit_ >= 0:
        bit_ &= bit
        cost = 0
        for k in range(N):
            cost += 1 * XYP[k][2] * min(x_cost[bit_][k], y_cost[bit - bit_][k])
        ans[cnt] = min(ans[cnt], cost)

        bit_ -= 1
for i in range(N + 1):
    print(ans[i])

Submission status: Time Limit Exceeded

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

import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

N = int(readline())
XYP = [list(map(int, readline().split())) for _ in range(N)]

x_cost = [[0 for _ in range(N)] for _ in range(1 << N)]
y_cost = [[0 for _ in range(N)] for _ in range(1 << N)]

for bit in range(1 << N):
    for i in range(N):
        x_cost[bit][i] = abs(XYP[i][0])
        y_cost[bit][i] = abs(XYP[i][1])

        for k in range(N):
            if bit & (1 << k):
                x_cost[bit][i] = min(x_cost[bit][i], abs(XYP[i][0] - XYP[k][0]))
                y_cost[bit][i] = min(y_cost[bit][i], abs(XYP[i][1] - XYP[k][1]))

ans = [sys.maxsize for _ in range(N + 1)]

for bit in range(1 << N):
    cnt = bin(bit).count('1')
    for i in range(bit, -1, -1):
        i &= bit
        cost = 0
        for k in range(N):
            if ~(bit & (1 << k)):
                cost += 1 * XYP[k][2] * min(x_cost[i][k], y_cost[bit - i][k])
        ans[cnt] = min(ans[cnt], cost)

for i in range(N + 1):
    print(ans[i])

Submission status: Time Limit Exceeded

Solution code:
x = int(input())
ans = 8
max = 599
min = 400
while True:
  if min <= x < max:
    print(ans)
    break
  else:
    max += 200
    min += 200
    ans -= 1

Submission status: Accepted

Solution code:
# coding:UTF-8
import sys
from math import factorial

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

a = int(input())    # 数字

for i in range(8):
    M = 2000 - 200 * i
    m = 1800 - 200 * i
    if m <= a < M:
        print(i + 1)

Submission status: Accepted

Solution code:
print((2199-int(input()))//200)

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)
elif 1800 <= x < 2000:
    print(1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
X = int(a)

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:
from sys import stdin

input = stdin.readline


def solve():
    X = int(input())
    check = (X - 400)//200
    print(8 - check)


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
def rating(n):
	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)
	elif(n < 2000):
		print(1)
a = int(input())
rating(a)

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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