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 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:
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:
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import reduce
import math
import itertools
import heapq
#import numpy as np
import bisect
import sys
#import sympy
sys.setrecursionlimit(10**6)


def bfs(s, n, node):
    # 頂点が探索済みかどうかのチェック配列
    check = [False for _ in range(n)]
    check[s] = True
    # 次見る頂点を格納するキュー
    queue = deque([s])
    visited_num = 1

    # 問題固有の配列
    #color_check=[[True for _ in range(l)] for _ in range(n)]
    color = [-1 for _ in range(n)]
    color[s] = 0

    while visited_num < n:
        # グラフが全連結ではない場合
        if len(queue) == 0:
            # 空配列を返す
            # 現状までの計算済み配列を返してもいいと思う
            return color

        now_vertex = queue.popleft()
        # インデックスがない場合は
        for next_vertex in node[now_vertex]:

            if check[next_vertex] == True:
                continue

            queue.append(next_vertex)
            check[next_vertex] = True

            # 問題固有の計算
            color[next_vertex] = color[now_vertex]+1
            visited_num += 1

    return color


mod = 10**9+7
# n=int(input())
# n,m=list(map(int,input().split()))
# a=list(map(int,input().split()))
def ceil(x, y): return (x+y-1)//y
def input_list(): return list(map(int, input().split()))


def buy(buy_cost, sell_cost, money):
    return money % buy_cost+(money//buy_cost)*sell_cost


n = int(input())


print(10-n//200)

Submission status: Accepted

Solution code:
x = int(input())
r = 8
s = 400

for i in range(8):
    e = s + 200
    if s <= x < e:
        print(r)
        exit()
    r-=1
    s+=200

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sat Jul 25 20:53:51 2020

@author: naoki
"""

X = int(input())
a = (X-400)//200

print(8-a)

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:
def rank(x):
  if  400<=x<600:
    return 8
  elif  600<=x<800:
    return 7
  elif  800<=x<1000:
    return 6
  elif  1000<=x<1200:
    return 5
  elif  1000<=x<1400:
    return 4
  elif  1400<=x<1600:
    return 3
  elif  1600<=x<1800:
    return 2
  elif  1800<=x<2000:
    return 1

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
import math
x = int(input())
print(int(10-math.floor(x/200)))

Submission status: Accepted

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

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)
elif X>=1800 and X<=1999:
    print(1)

Submission status: Accepted

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

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())
if 400 <= x <= 599:
    print(8)
elif 600 <= x <= 799:
    print(7)
elif 800 <= x <= 999:
    print(6)
elif 100 <= 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>=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: Accepted

Solution code:
# coding: utf-8
# Your code here!
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)
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 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())

for i in range(8):
  if x//200 == i+2:
    print(8-i)

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:
import bisect
import copy
import heapq
import sys
import itertools
import math
from functools import lru_cache
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7 

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


def main():
    N = int(input())
    T = [400, 600, 800, 1000, 1200, 1400, 1600, 1800]
    i = bisect.bisect_right(T, N)
    print(9 - i)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/bin/python3

import os
import sys
from collections import *
from queue import *
import math
def main():
	n = int(input())
	if n>=400 and n<= 599:
		print(8)
	elif n>=600 and n<= 799:
		print(7) 
	elif n>=800 and n<= 999:
		print(6)
	elif n>=1000 and n<= 1199:
		print(5)
	elif n>=1200 and n<= 1399:
		print(4)
	elif n>=1400 and n<= 1599:
		print(3)
	elif n>=1600 and n<= 1799:
		print(2)
	else:
		print(1)


if __name__ == '__main__':
	#sys.stdin = open("input","r")
	#sys.stdout = open("output","w")
	main()

Submission status: Accepted

Solution code:
kyu = int(input())

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

Submission status: Accepted

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

X=int(input())

400 <= X <=1999

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:
# @uthor : Kaleab Asfaw
import sys

input = sys.stdin.readline

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


n = int(input())
print(main(n))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# atcoder 
# Türkler var mı?
# Herkese memnün oldum
import sys

iimr = lambda: map(int, sys.stdin.readline().rstrip().split())
readline = sys.stdin.buffer.readline
#sys.setrecursionlimit(10 ** 8)


def 関数(n):
	pas = 200 
	mon_min = 400
	toit = 1999
	kyuu = 8
	
	x = (n - 400) // 200
	return kyuu - x		 

def çözmek():
	N = int(input())
	print(関数(N)) 



if __name__ == "__main__":
    çözmek()

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

print(rate)

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:
# -*- coding: utf-8 -*-
n = int(input())

n //= 200
print(10 - n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

Lst = list(range(400,2200,200))
L = sorted(Lst,reverse=True)

for i in range(len(L)):
    if L[i] <= N < L[i]+200:
        ans = i

print(str(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


x = int(input())
ans = -((x+1)//200 + int((x+1)%200!=0))+11
print(ans)

Submission status: Accepted

Solution code:
x = int(input())
ans = 8
low = 400
for s in range(400, 2000):
  if s == low+200:
    low = s
    ans -= 1
  if x == s:
    break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

X = int(input())

devided = int(X/200)
rank = 10 - devided

print(rank)

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)
elif X>=1800 and X<=1999:
    print(1)

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')
elif X>=1800 and X<=1999:
    print('1')

Submission status: Accepted

Solution code:
from math import sqrt,ceil,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())


# for _ in range(ii()):

x=[599,799,999,1199,1399,1599,1799,1999]

n=ii()
for i in range(8):
    if n<=x[i]:
        print(8-i)
        break

Submission status: Accepted

Solution code:
def Next(): return input()
def NextInt(): return int(Next())

X = NextInt()

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');
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:
a = list(map(int, input().split()))
if a[0] <= 599:
  print(8)
elif a[0] <= 799:
  print(7)
elif a[0] <= 999:
  print(6)
elif a[0] <= 1199:
  print(5)
elif a[0] <= 1399:
  print(4)
elif a[0] <= 1599:
  print(3)
elif a[0] <= 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 400 <= a and a <= 599:
    print(8)
elif 600 <= a and a <= 799:
    print(7)

elif 800 <=  a and a <= 999:
    print(6)
elif 1000 <= a and a <= 1199:
    print(5)

elif 1200 <= a and a <= 1399:
    print(4)
elif 1400 <= a and a <= 1599:
    print(3)
elif 1600 <= a and a <= 1799:
    print(2)

elif 1800 <= a and a <= 1999:
    print(1)

Submission status: Accepted

Solution code:
#rating

a = int(input())

if a >= 400 and a < 600:
    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)
elif a < 2000:
    print(1)

Submission status: Accepted

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

import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union
# import time
# import math, cmath
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import _heapify_max, _heappop_max, _siftdown_max
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import Fraction               # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)



def main():
    Num = Union[int, float]
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input():  return sys.stdin.readline().rstrip()
    def ii():     return int(input())
    def isp():    return input().split()
    def mi():     return map(int, input().split())
    def mi_0():   return map(lambda x: int(x)-1, input().split())
    def lmi():    return list(map(int, input().split()))
    def lmi_0():  return list(map(lambda x: int(x)-1, input().split()))
    def li():     return list(input())
    def debug(x): print(x, file=sys.stderr)
    # def _heappush_max(h, item): h.append(item); _siftdown_max(h, 0, len(h)-1)
    
    
    x = ii()
    print(10 - x // 200)


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

Submission status: Accepted

Solution code:
x=int(input())
a=int(x/100)
if a%2==0:
	b=a+1
else:
	b=a-1
y=(a+b)//4
print(10-y)

Submission status: Accepted

Solution code:
import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def MI():return map(int,input().split())
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RA():return map(int,open(0).read().split())
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:
            a,b=inp;c=1
        else:
            a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
    #h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
    mp=[boundary]*(w+2);found={}
    for i in R(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

mo=10**9+7
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
l_alp=string.ascii_lowercase
#sys.setrecursionlimit(10**7)
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()

########################################################################################################################################################################

show_flg=False
show_flg=True

ans=0

n=I()

ans=10-n//200
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__' :
	main()

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

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)

Submission status: Accepted

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

Submission status: Accepted

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:
    ans = 4
elif 1400 <= x <= 1599:
    ans = 3
elif 1600 <= x <= 1799:
    ans = 2
else:
    ans = 1
print(ans)

Submission status: Accepted

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

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

if X >=400 and 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 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=200
N=int(input())
if 2*n<=N<3*n:
  print(8)
elif 3*n<=N<4*n:
  print(7)
elif 4*n<=N<5*n:
  print(6)
elif 5*n<=N<6*n:
  print(5)
elif 6*n<=N<7*n:
  print(4)
elif 7*n<=N<8*n:
  print(3)
elif 8*n<=N<9*n:
  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:
x = int(input())

for i, n in enumerate(range(4, 19, 2)):
    r = 8 - i
    hi = n * 100 + 199
    low = n*100
    if low <= x <= hi:
        print(r)
        exit()

Submission status: Accepted

Solution code:
x = int(input())

ans = 0
# 400 以上 599 以下：8 級
if 400 <= x <= 599:
    ans = 8
# 600 以上 799 以下：7 級
elif 600 <= x <= 799:
    ans = 7
# 800 以上 999 以下：6 級
elif 800 <= x <= 999:
    ans = 6
# 1000 以上 1199 以下：5 級
elif 1000 <= x <= 1199:
    ans = 5
# 1200 以上 1399 以下：4 級
elif 1200 <= x <= 1399:
    ans = 4
# 1400 以上 1599 以下：3 級
elif 1400 <= x <= 1599:
    ans = 3
# 1600 以上 1799 以下：2 級
elif 1600 <= x <= 1799:
    ans = 2
# 1800 以上 1999 以下：1 級
elif 1800 <= x <= 1999:
    ans = 1
    
print(ans)

Submission status: Accepted

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

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:
    ans = 4
elif 1400 <= X <= 1599:
    ans = 3
elif 1600 <= X <= 1799:
    ans = 2
elif 1800 <= X <= 1999:
    ans = 1

print(ans)

Submission status: Accepted

Solution code:
X = int(input())

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