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: Runtime Error

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

for _ in range(k):
    if b <= a:
        b = 2 * b
        continue
    if c <= b:
        c = 2 * c
        continue
    print('Yes')
    sys.exit()
    
if (a < b) & (b < c):
    print('Yes')
    sys.exit()
print('No')

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input().split())
K = int(input())

for i in range(K):
    if B <= A:
       
        B *= 2
        
    elif C <= B:
       
        C *= 2
        
    else:
       
        C *= 2
        
if A < B and B < C:
    print('Yes')
    
else:
    print('No')

Submission status: Runtime Error

Solution code:
function Main(input){
    const score = Number(input);
    let from = 600;
    let kyu = 8;
    while(true){
        if(score < from){
            console.log(kyu);
            return;
        }
        from += 200;
        kyu--;
    }
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));

Submission status: Runtime Error

Solution code:
X = 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: Runtime Error

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: Runtime Error

Solution code:
x = 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: Runtime Error

Solution code:
x=input()
if 400<=x 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: Runtime Error

Solution code:
point = int(input())

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

Submission status: Runtime Error

Solution code:
N = int(input())

if N >= 400 and N <= 599:
    pirint(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)

Submission status: Runtime Error

Solution code:
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: Runtime Error

Solution code:
score = [1999,1799,1599,1399,1199,999,799,599]
ranks = [   1,   2,   3,   4,   5,  6,  7,  8]

x = int(input())
i = 0

while(x <= score[i]):
      i += 1

print(ranks[i-1])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
score = [1999,1799,1599,1399,1199,999,799,599]

x = int(input())
i = 0

while(x <= score[i]):
      i += 1

print(i)

Submission status: Runtime Error

Solution code:
N = int(input())

if N <= 599:
    pirint(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)

Submission status: Runtime Error

Solution code:
x = int(input())
ran = list(range(400,2000,200))
pointer = 0
while x >= ran[pointer]:
    pointer += 1
print(9-pointer)

Submission status: Runtime Error

Solution code:
s = int(input()) 
 
if 400 <= s < 500:
  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")
else  1800 <= s <1999:
  print("1")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())

if N <= 599:
    pirint(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)
elif N >= 1800 and N <= 1999:
    print(1)

Submission status: Runtime Error

Solution code:
X = input()
a = 2000 / X
if a >= 2000/599:
  print(8)
elif a >= 2000/799:
  print(7)
elif a >= 2000/999:
  print(6)
elif a >= 2000/1199:
  print(5)
elif a >= 2000/1399:
  print(4)
elif a >= 2000/1599:
  print(3)
elif a >= 2000/1799:
  print(2)
elif a >= 2000/1999:
  print(1)

Submission status: Runtime Error

Solution code:
s = int(input()) 
 
if 400 < s < 500:
  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")
else  1800 < s <1999:
  print("1")

Submission status: Runtime Error

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 <= 99:
    ans = 6
elif 1000 <= N and N <= 1199:
    ans = 5
elif 1200 <= N and N <= 1399:
    ans = 4
elif 1400 <= N and N <= 1599:
    ans = 3
elif 1600 <= N and N <= 1799:
    ans = 2
elif 1800 <= N and N <= 1999:
    ans = 1


print(ans)



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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
	a=int(input())

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

Submission status: Runtime Error

Solution code:
X=int(input())

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

Submission status: Runtime Error

Solution code:
"""
    こんにちは。これはクシャルです
    
    Author : thekushalghosh (クシャル)
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time,itertools
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################
    
def solve():
    n = inp(a)
    q = 2199 - n
    q = q // 200
    print(q,"-kyu",sep = "")
    
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)

def counter_elements(a):
    q = dict()
    for i in range(len(a)):
        if a[i] not in q:
            q[a[i]] = 0
        q[a[i]] = q[a[i]] + 1
    return(q)

def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97],1
    return(q)
 
def factors(n):
    q = []
    for i in range(1,int(n ** 0.5) + 1):
        if n % i == 0: q.append(i); q.append(n // i)
    return(list(sorted(list(set(q)))))
 
def prime_factors(n):
    q = []
    while n % 2 == 0: q.append(2); n = n // 2
    for i in range(3,int(n ** 0.5) + 1,2):
        while n % i == 0: q.append(i); n = n // i
    if n > 2: q.append(n)
    return(list(sorted(q)))

def transpose(a):
    n,m = len(a),len(a[0])
    b = [[0] * n for i in range(m)]
    for i in range(m): 
        for j in range(n): 
            b[i][j] = a[j][i]
    return(b)

#-----------------------------------------------------------------------#
        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
/*jai_ganeshdeva*/

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pu push  //  adds the value to the last of the queue 
#define lld long long int
#define ins insert /// used in set to insert the values 
#define adv advance  /// used to increment the iterator
#define mp make_pair
#define fi first
#define se second
#define all(c) c.begin(),c.end()
#define PI 3.1415926
#define INF (lld)1e18
#define vl  vector<long long int >
#define vpll vector< pair<lld ,lld> >
#define vvl vector<vector<lld> > 
#define pll pair <lld,lld>
#define modA(cccc,bbbb ,p) (((cccc+bbbb)%p+p)%p)
#define modS(cccc,bbbb ,p) (((cccc-bbbb)%p+p)%p)
#define modM(cccc,bbbb ,p) ((((cccc%p)*(bbbb%p))%p+p)%p)

long long int modp(lld a,lld p,lld n)
{
    lld d[100];
    lld i,j,k,l;
    if(n==0) return 1;
    for(i=0;n>=1;i++)
    {
        d[i]=n%2;
        n/=2;
    }
    l=i;
    long long int e=1;
    if(d[0]==1) e*=(a%p);
    for(i=1;i<l;i++)
    {
        a*=a;
        a=a%p;
        if(d[i]==1) 
        {
            e*=a;
            e=e%p;
        }
    }
    return e%p;
}
lld modInverse(lld n, lld p) 
{ 
    return modp(n, p, p-2); 
}

// lld fac[500005]; 

// void getfac(lld p)
// {
//     fac[0] = 1; 
//     for (lld i=1 ; i<=500005; i++) 
//         fac[i] = fac[i-1]*i%p; 
// }    

// long long int nCrmodp(lld n, lld r,lld p) 
// { 
//    // Base case 
//    if (r==0) 
//       return 1; 
     
//     return (fac[n]* modInverse(fac[r], p) % p * 
//             modInverse(fac[n-r], p) % p) % p; 
// }

// bool sorter(lld a, lld b)
// {
//     vector<lld> v2;
//     vector<lld> w;
//     // cout<<"A == " <<a<<"  B== "<<b;
//     while(a>=1)
//     {
//         v2.pb(a%10);
//         a/=10;
//     }
//     while(b>=1)
//     {
//         w.pb(b%10);
//         b/=10;
//     }   
       
//     reverse(all(v2));
//     reverse(all(w));
//     lld l1 = v2.size();
//     lld l2 = w.size();
//     lld  l = (l1*l2)/__gcd(l1,l2);
//     // cout<<l1<< " "<<l2<< " "<<l<< " ";
//     for(int i=0;i<l;i++)
//     {
//         if(v2[i%l1]!=w[i%l2])
//         {
//             // cout<< "   "<< (v2[i%l1] > w[i%l2])<<"\n";
//             return v2[i%l1] > w[i%l2];
//         }
//     }
//     // printf("false\n");
//     return false;
// }


lld p1=1e8 + 7,p2=998244353;
lld l,r,mid,ans;
lld n,i,j,k,g,m;
lld x,y,n1,n2,h,z,c;
lld aa=1;
lld ss=1;


void solve()
{
    cin>>n;
    x = n/200;
    cout<<10-x;
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    lld t=1;
    
    // cin>>t;
    // cout<<t;
     // getfac(p1);
    //check the value by which modulo is to be taken
    // lld ans=0;
    // precompute();
    for(int i=0;i<t;i++)
    {
        // cout<<"Case #"<<i+1<<": ";
        solve();
        cout<<"\n";
    }
    return 0;
}

Submission status: Runtime Error

Solution code:
x = int(input())

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

print(str(int(ans)))

Submission status: Runtime Error

Solution code:
x = int(input())

if 400 <= x and x <= 599:
    return 8
elif 600 <= x and x <= 799:
    return 7
elif 800 <= x and x <= 999:
    return 6
elif 1000 <= x and x <= 1199:
    return 5
elif 1200 <= x and x <= 1399:
    return 4
elif 1400 <= x and x <= 1599:
    return 3
elif 1600 <= x and x <= 1799:
    return 2
else:
    return 1

Submission status: Runtime Error

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

resolve()

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
ans = 0
A = sorted(A, reverse = True)
for i in range(N-1):
  print(A[i])
  ans += A[i]
print(ans)

Submission status: Runtime Error

Solution code:
X = int(input())
for key, value in enumerate(rate_sec):
    if X < value:
        print(8-key)
        break

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

Solution code:
from sys import stdin

def main():
    h = [int(x) for x in stdin.readline().rstrip().split()]
    kyu = 8
    if 600 <= h and h < 800:
        kyu = 7
    if 800 <= h and h < 1000:
        kyu = 6
    if 1000 <= h and h < 1200:
        kyu = 5
    if 1200 <= h and h < 1400:
        kyu = 4
    if 1400 <= h and h < 1600:
        kyu = 3
    if 1600 <= h and h < 1800:
        kyu = 2
    if 1800 <= h and h < 2000:
        kyu = 1
    print(kyu)
    
if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
N=int(imput())
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: Runtime Error

Solution code:
n = int(input()):
if n <= 599:
    print(8)
    exit()

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

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

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

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

if n <= 1599:
    print(3)
    exit()

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

if n <= 1999:
    print(1)
    exit()

Submission status: Runtime Error

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:
  rint('3')
elif 1600 <= x <= 1799:
  print('2')
else:
  print('1')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from itertools import product
import numpy as np

x = int(input())

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

Submission status: Runtime Error

Solution code:
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: Runtime Error

Solution code:
X = int(input())
K =[400,600,800,1000,1200,1400,1600,1800]
for k in range(8):
    if K[k]<=X and K[k+1]>X:
        print(8-k)
        exit()

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;

int main(){
	cin.tie(0),ios::sync_with_stdio(false);
	vector<int>v={8,8,7,7,6,6,5,5,4,4,3,3,2,2,1,1};
	int x; cin>>x;
	cout<<v.at(x/100-4)<<"\n"s;
}

Submission status: Runtime Error

Solution code:
/*jai_ganeshdeva*/

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pu push  //  adds the value to the last of the queue 
#define lld long long int
#define ins insert /// used in set to insert the values 
#define adv advance  /// used to increment the iterator
#define mp make_pair
#define fi first
#define se second
#define all(c) c.begin(),c.end()
#define PI 3.1415926
#define INF (lld)1e18
#define vl  vector<long long int >
#define vpll vector< pair<lld ,lld> >
#define vvl vector<vector<lld> > 
#define pll pair <lld,lld>
#define modA(cccc,bbbb ,p) (((cccc+bbbb)%p+p)%p)
#define modS(cccc,bbbb ,p) (((cccc-bbbb)%p+p)%p)
#define modM(cccc,bbbb ,p) ((((cccc%p)*(bbbb%p))%p+p)%p)

long long int modp(lld a,lld p,lld n)
{
    lld d[100];
    lld i,j,k,l;
    if(n==0) return 1;
    for(i=0;n>=1;i++)
    {
        d[i]=n%2;
        n/=2;
    }
    l=i;
    long long int e=1;
    if(d[0]==1) e*=(a%p);
    for(i=1;i<l;i++)
    {
        a*=a;
        a=a%p;
        if(d[i]==1) 
        {
            e*=a;
            e=e%p;
        }
    }
    return e%p;
}
lld modInverse(lld n, lld p) 
{ 
    return modp(n, p, p-2); 
}

// lld fac[500005]; 

// void getfac(lld p)
// {
//     fac[0] = 1; 
//     for (lld i=1 ; i<=500005; i++) 
//         fac[i] = fac[i-1]*i%p; 
// }    

// long long int nCrmodp(lld n, lld r,lld p) 
// { 
//    // Base case 
//    if (r==0) 
//       return 1; 
     
//     return (fac[n]* modInverse(fac[r], p) % p * 
//             modInverse(fac[n-r], p) % p) % p; 
// }

// bool sorter(lld a, lld b)
// {
//     vector<lld> v2;
//     vector<lld> w;
//     // cout<<"A == " <<a<<"  B== "<<b;
//     while(a>=1)
//     {
//         v2.pb(a%10);
//         a/=10;
//     }
//     while(b>=1)
//     {
//         w.pb(b%10);
//         b/=10;
//     }   
       
//     reverse(all(v2));
//     reverse(all(w));
//     lld l1 = v2.size();
//     lld l2 = w.size();
//     lld  l = (l1*l2)/__gcd(l1,l2);
//     // cout<<l1<< " "<<l2<< " "<<l<< " ";
//     for(int i=0;i<l;i++)
//     {
//         if(v2[i%l1]!=w[i%l2])
//         {
//             // cout<< "   "<< (v2[i%l1] > w[i%l2])<<"\n";
//             return v2[i%l1] > w[i%l2];
//         }
//     }
//     // printf("false\n");
//     return false;
// }


lld p1=1e8 + 7,p2=998244353;
lld l,r,mid,ans;
lld n,i,j,k,g,m;
lld x,y,n1,n2,h,z,c;
lld aa=1;
lld ss=1;
bool twoPartsExistsDyn(vector<lld>& arr, int n)
{
    int totalSum = 0, i;
    for(i=0; i<n; i++)
        totalSum += arr[i];
    // if sum is odd then does not exist.
    if( (totalSum & 1) != 0)
        return false;
    // Sum of each part.
    int partSum = totalSum/2;
    // latest compilers allows variable length arrays.
    // Else declare the array on heap
    bool partArr[partSum+1][n+1];
    // initialize top row as true
    for (i = 0; i <= n; i++)
        partArr[0][i] = true;
    // initialize first column as false (except part[0][0])
    for (i = 1; i <= partSum; i++)
        partArr[i][0] = false;
    // Fill the partition table in botton up manner
    for (i = 1; i <= partSum; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            partArr[i][j] = partArr[i][j-1];
            if (i >= arr[j-1])
                partArr[i][j] = partArr[i][j] || partArr[i - arr[j-1]][j-1];
        }
    }
    return partArr[partSum][n];
}

void solve()
{
    cin>>n;
    x = n/200;
    cout<<10-x;
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    lld t=1;
    
    // cin>>t;
    // cout<<t;
     // getfac(p1);
    //check the value by which modulo is to be taken
    // lld ans=0;
    // precompute();
    for(int i=0;i<t;i++)
    {
        // cout<<"Case #"<<i+1<<": ";
        solve();
        cout<<"\n";
    }
    return 0;
}

Submission status: Runtime Error

Solution code:
X = int(input())

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

print(result)

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <set>

using namespace std;

#define pb push_back
#define mp make_pair
#define x first
#define y second

typedef long long ll;

const ll INF = 1e9+5;
const ll MOD = 1e9+7;

int main() {
	int x;
	cin >>x;
	cout <<8-(x-400)/200;
	return 0;
}

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
int main(void){
    int n;cin>>n;
    cout<<10-n/200<<endl;
    return 0;
}