Problem:


Score : 100 points

Problem Statement

Takahashi is a member of a programming competition site, ButCoder.

Each member of ButCoder is assigned two values: Inner Rating and Displayed Rating.

The Displayed Rating of a member is equal to their Inner Rating if the member has participated in 10 or more contests. Otherwise, the Displayed Rating will be their Inner Rating minus 100 \times (10 - K) when the member has participated in K contests.

Takahashi has participated in N contests, and his Displayed Rating is R. Find his Inner Rating.

Constraints

All values in input are integers.

1 \leq N \leq 100

0 \leq R \leq 4111

Input

Input is given from Standard Input in the following format:

N R

Output

Print his Inner Rating.

Sample Input 1

2 2919

Sample Output 1

3719

Takahashi has participated in 2 contests, which is less than 10, so his Displayed Rating is his Inner Rating minus 100 \times (10 - 2) = 800.

Thus, Takahashi's Inner Rating is 2919 + 800 = 3719.

Sample Input 2

22 3051

Sample Output 2

3051



Sample input:
2 2919


Sample output:
3719

Submission status: Accepted

Solution code:
import sys

n = list(map(int, input().split()))

if n[0]>9:
  print(n[1])
  sys.exit()
  
print(n[1] + 100*(10-n[0]))

Submission status: Accepted

Solution code:
n,r=map(int,input().split())

if n>=10:
    print(r)
else:
    print(r+1000-(100*n))

Submission status: Accepted

Solution code:
N,R=list(map(int,input().split()))

if N>=10:
    print(R)
else:
    print(R+(100*(10-N)))

Submission status: Accepted

Solution code:
n,r=map(int,input().split())

if n>=10:
  print(r)

else:
  print(r+(100*(10-n)))

Submission status: Accepted

Solution code:
N, R= map(int, input().split())
if N>=10:
    print(R)
else:
    print(R+100*(10-N))

Submission status: Accepted

Solution code:
N,R=list(map(int, input().split()))

if N<10:
    print(R+100*(10-N))
else:
    print(R)

Submission status: Accepted

Solution code:
n,r=map(int,input().split())
print(max(0,10-n)*100+r)

Submission status: Accepted

Solution code:
N,R=map(int,input().split())
if N>=10:
    print(R)
else:
    ans=R+100*(10-N)
    print(ans)

Submission status: Accepted

Solution code:
n,r = map(int,input().split())

print(r if n>=10 else 100*(10-n)+r)

Submission status: Accepted

Solution code:
# coding: utf-8
n,r = map(int, input().split())
if n >= 10:
    print(r)
else:
    print(r + 100*(10-n))

Submission status: Accepted

Solution code:
N,R = map(int,input().split())
if N > 9:
  print(R)
else:
  print(R + 100*(10-N))

Submission status: Accepted

Solution code:
N,R=map(int,input().split())
if N<10:
    print(R+100*(10-N))
else:
    print(R)

Submission status: Accepted

Solution code:
n,r = map(int,input().split())
if n<10:
  print(r+(100*(10-n)))
else:
  print(r)

Submission status: Accepted

Solution code:
n,r=map(int,input().split())
naibu=0
if n>=10:
  naibu=r
else:
  naibu=r+100*(10-n)
print(naibu)

Submission status: Accepted

Solution code:
n,r = list(map(int,input().split()))
if n <10:
    print(r+(10-n)*100)
else:
    print(r)

Submission status: Accepted

Solution code:
#coding:utf-8

n,k = map(int,input().split())

if(n < 10):
  k = k + 100 * (10 - n)
  
print("{}".format(k))

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if 10 <= N:
    print(R)
else:
    print((100 * (10 - N)) + R)

Submission status: Accepted

Solution code:
A = input()
b,c = (A.split(' '))
d = int(b)
e = int(c)
f = e - d * 100 + 1000

if 0 < d < 11:
    print(f)
else:
    print(e)

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
print(r) if n >= 10 else print(r + 100*(10-n))

Submission status: Accepted

Solution code:
a=input()
(n,m)=a.split(" ")
n=int(n)
m=int(m)
if n>=10:
    print(m)
else:
    print(m+100*(10-n))

Submission status: Accepted

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

if N < 10:
    print(R + (100 * (10- N)))
else:
    print(R)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())

print((100 * (10 - N)+R if N < 10 else R))

Submission status: Accepted

Solution code:
N, R = map(int, input().split())

if 10 <= N:
    print(R)
else:
    print(R + 100 * (10 - N))

Submission status: Accepted

Solution code:
N,R = map(int,input().split())

if(N<10):
  print(R+100*(10-N))
else:
  print(R)

Submission status: Accepted

Solution code:
N, R = map(int,input().split())
print(R+100*max(0,10-N))

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
if n >= 10:
    print(k)
else :
    print(k+100*(10-n))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N, R = map(int, input().split())

if N >= 10:
    print(R)
else:
    print(R + 100*(10 - N))

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

n,r=na()
if n>=10:
    print(r)
else:
    print(r+100*(10-n))

Submission status: Accepted

Solution code:
N,R=map(int,input().split())
if N >= 10:
	print(R)
else:
	print(R+100*(10-N))

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if N < 10:
  print(R + 100 * (10 - N))
else:
  print(R)

Submission status: Accepted

Solution code:
k, r = map(int, input().split())
if k >= 10:
    print(r)
else:
    print(r + 100*(10-k))

Submission status: Accepted

Solution code:
s = input().split()

N = int(s[0])
R = int(s[1])

if N < 10:
  ans = R + 100 *(10 - N)
else:
  ans = R

print(ans)

Submission status: Accepted

Solution code:
n, r = map(int, input().split())

if n >= 10:
  print(r)
else:
  print(r + 100*(10-n))

Submission status: Accepted

Solution code:
n,r = list(map(int,input().split()))

if n>=10:
    print(r)
else:
    t = 100*(10-n)
    print(r+t)

Submission status: Accepted

Solution code:
def main():
    n, r = map(int, input().split())

    print(r if n >= 10 else r + 100*(10-n))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect


def LI(): return [int(x) for x in sys.stdin.readline().split()]


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


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


def solve():
    n, r = LI()
    if n <= 10:
        ans = r + (100*(10-n))
    else:
        ans = r
    print(ans)
    return


# Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
a, b = map(int, input().split(" "))
print([b,b+(100*(10-a))][a<10])

Submission status: Accepted

Solution code:
n, r = map(int,input().split())
if n >= 10:
    print(r)
else:
    print(r+100*(10-n))

Submission status: Accepted

Solution code:
N, R = map(int, input('').split(' '))
if(N < 10):
    print(R + (100 * (10 - N)))
else:
    print(R)

Submission status: Accepted

Solution code:
n = list(map(int, input().split()))
if n[0] < 11:
    num = n[1] + (100*(10 - n[0]))
    print(num)
    exit(0)
print(n[-1])

Submission status: Accepted

Solution code:
N, R = [int(_) for _ in input().split()]
if N < 10:
    print(R+100*(10-N))
else:
    print(R)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())

if N < 10:
    print(R + 100 * (10 - N))
else:
    print(R)

Submission status: Accepted

Solution code:
n, r = map(int, input().split())

print(r if n >= 10 else r + 100 * (10 - n))

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
if n < 10:
    ans = r + (100 * (10-n))
else:
    ans = r
print(ans)

Submission status: Accepted

Solution code:
n,r = map(int,input().split())
print(r + max(10-n,0)*100)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a >= 10:
  print(b)
else :
  print(b + ((10-a)*100))

Submission status: Accepted

Solution code:
N,R=map(int,input().split())

print (max(0,100*(10-N))+R)

Submission status: Accepted

Solution code:
n,r=map(int,input().split())
if n<=10:
    print(r+100*(10-n))
else:
    print(r)

Submission status: Accepted

Solution code:
N,R = map(int,input().split())
if N >= 10:
    print(R)
else:
    print(R + (100 * (10 - N)))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a > 9:
    print(b)
else:
    b = b + 100*(10 - a)
    print(b)

Submission status: Accepted

Solution code:
list = input().rstrip().split(" ")
time = int(list[0])
hyoji = int(list[1])
if time >= 10:
  naibu = hyoji
else:
  naibu = hyoji + 100 * (10 - time)
print(naibu)

Submission status: Accepted

Solution code:
N, R = map(int,input().split())

print(R + 100 * max(10 - N, 0))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3 ## -*- python -*-

t = input().split()
n = int(t[0])
r = int(t[1])

a = r
if n < 10:
    a += (1000-100*n)
print(a)

Submission status: Accepted

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

def main():
    N, R = map(int, input().split())

    if N >= 10:
        print(R)
    else:
        print(R + (100 * (10 - N)))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n,r=map(int,input().split())

ans=0
if n<10:
  ans=r+100*(10-n)
else:
  ans=r
print(ans)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if N < 10:
  R += 100*(10-N)
print(R)

Submission status: Accepted

Solution code:
N, R = input().split()
N = int(N)
R = int(R)

if N < 10:
    print(R + 100*(10-N))
else:
    print(R)

Submission status: Accepted

Solution code:
nr = list(map(int, input().split(' ')))
n = nr[0]
r = nr[1]

if n >= 10:
    print(r)
else:
    print(r + (100 * (10 - n)))

Submission status: Accepted

Solution code:
N, R = map(int, input().split())

print(R if N >= 10 else R + (100 * (10 - N)))

Submission status: Accepted

Solution code:
a=input().split()
N,R=int(a[0]),int(a[1])

if(N>=10):
  print(R)
else:
  print(R+100*(10-N))

Submission status: Accepted

Solution code:
N,R = map(int, input().split())

print(R+100*(10-N) if N<10 else R)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())

if N >= 10:
    print(R)
else:
    #R = I - 100 * (10-N) 
    I = R + 100 * (10-N)
    print(I)

Submission status: Accepted

Solution code:
n,r = (int(x) for x in input().split())     
if n < 10:
    print(r + 100 * (10 - n))
else:
    print(r)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if N > 10:
  print(R)
else :
  print(100 * (10 - N) + R)

Submission status: Accepted

Solution code:
n, r = map(int,input().split())

diff = 0
if n < 10:
  diff = 100 * ( 10 - n )

print( r + diff )

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
if n < 10:
    x = r + (100*(10-n))
else:
    x = r

print(x)

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
if n<10:
    print(r+(100*(10-n)))
else:
    print(r)

Submission status: Accepted

Solution code:
N,R = map(int,input().split())

ans=R

if N>9:
    print(ans)
else:
    ans=ans+100*(10-N)
    print(ans)

Submission status: Accepted

Solution code:
def main():
    N, R = map(int, input().split())
    print(R if 10 <= N else R + 100 * (10 - N))
    return


main()

Submission status: Accepted

Solution code:
inputStr = input()
inputList = inputStr.split(' ')
n = int(inputList[0])
r = int(inputList[1])

if n >= 10:
    print(int(r))
else:
    a = 100*(10-n)
    print(int(r+a))

Submission status: Accepted

Solution code:
n,r=map(int,input().split())
print(r+1000-100*n if n<=10 else r)

Submission status: Accepted

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

if N >= 10:
    print(R)
else:
    print(R + 100 * (10 - N))

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if N >= 10:
    print(R)
else:
    print(100 * (10 - N) + R)

Submission status: Accepted

Solution code:
n, r = map(int, input().split(" "))
if n < 10:
    result = r + 100*(10-n)
else:
    result = r

print(result)

Submission status: Accepted

Solution code:
#2020-03-14 21:06

N, R = map(int, input().split())

if N >= 10:
    ans = R
else:
    ans = R + 100*(10-N)

print(ans)

Submission status: Accepted

Solution code:
def main():

    N, R = map(int, input().split())
    if N >= 10: return R
    else: return R + 100 * (10 - N)

if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
print(r + 100 * max(0, 10- n))

Submission status: Accepted

Solution code:
N, R = map(int, input().split())

print(R if N>=10 else R + 100*(10-N))

Submission status: Accepted

Solution code:
n,r = map(int, input().split())

if n>= 10:
  print (r)
else:
  print (r+100*(10-n))

Submission status: Accepted

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


def solve(N: int, R: int):
    if N >= 10:
        print(R)
    else:
        print(R + 100 * (10 - N))


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    R = int(next(tokens))  # type: int
    solve(N, R)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if (N>=10):
    print(R)
else:
    print(R+100*(10-N))

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if N < 10:
    minus = 100*(10-N)
    print(R + minus)
else:
    print(R)

Submission status: Accepted

Solution code:

N, R = map(int, input(). split())

def solver(n, r):
    if n >= 10:
        return r
    else:
        return r + ( 100 * (10 - n))
    
print(solver(N, R))

Submission status: Accepted

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

if n >= 10:
    print(r)
else:
    print(r + (100*(10 - n)))

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if N <= 10:
  print(R + 100 * (10 - N))
else:
  print(R)

Submission status: Accepted

Solution code:
n,r=map(int,input().split())

if n>=10:
  print(r)
else:
  print(r+100*(10-n))

Submission status: Accepted

Solution code:
n,r=map(int,input().split())
if 1<=n<=10:
  print(r+100*(10-n))

else:

  print(r)

Submission status: Accepted

Solution code:
# input
N, R = map(int, input().split())

# output
ans = R
if N < 10:
    ans += 100*(10-N)
print(ans)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if N >= 10:
    rating = R
else:
    rating = R + 100 * (10 - N)
print(rating)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
print(R + (100 * (10 - N)) if N < 10 else R)

Submission status: Accepted

Solution code:
# import math
# import bisect
# import heapq
# from collections import deque
# import numpy as np

# n, m = map(int, input().split())
n,r = map(int,input().split())

ans = r
if n < 10:
    ans = r + 100 * (10 - n)
print(ans)

Submission status: Accepted

Solution code:
N,R = map(int,input().split())
if N >= 10:
  rat = R
else:
  rat = R + 100*(10-N)
print(int(rat))

Submission status: Accepted

Solution code:
N,R = map(int,input().split())

if N > 9:
  print(R)
else:
  print(R +1000 -100*N)

Submission status: Accepted

Solution code:
n, r= map(int,input().split())
if n < 10:
  print(r + (100 * (10 - n)))
else:
  print(r)

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
if n >= 10:
  print(r)
else:
  print(100 * (10 - n) + r)

Submission status: Accepted

Solution code:
def main():
    n,r = map(int, input().split())
    
    if n >= 10:
        print(r)
    else:
        print(r+100*(10-n))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
print(r if n >= 10 else r + 100*(10-n))

Submission status: Accepted

Solution code:
n,r = map(int, input().split())
if n >= 10:
	print(r)
else:
	print(r + (100*(10-n)))

Submission status: Accepted

Solution code:
n,r=(int (x) for x in input().split())
if n<10:
    print(r+100*(10-n))
else:
    print(r)

Submission status: Accepted

Solution code:
# n = int(input())
# A = list(map(int, input().split()))
n, r = map(int, input().split())
if 10 <= n:
    print(r)
else:
    tmp = 100*(10-n)
    print(tmp+r)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if N >= 10:
  print(R)
else:
  print(R+100*(10-N))

Submission status: Accepted

Solution code:
N, R = map(int, input().split())


if N >= 10:
    print(R)
else:
    print(R+((10-N)*100))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n, r = map(int, input().split())

if n >= 10:
    print(r)
else:
    print(int(r+(100*(10-n))))

Submission status: Accepted

Solution code:
N = list(input().split())

n = int(N[0])

r = int(N[1])

if(n>=10):
    print(r)
else:
    print(r+100*(10-n))

Submission status: Accepted

Solution code:
n,r=map(int,input().split())
if n>=10:
    print(r)
else:
    print(r+(10-n)*100)

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
if n >= 10:
  print(r)
else:
  print(r + (100*(10-n)))

Submission status: Accepted

Solution code:
N,R = map(int,input().split())

if(N>=10):
  print(R)
else:
  print(R+100*(10-N))

Submission status: Accepted

Solution code:
n, r = list(map(int, input().split(' ')))

if n >= 10:
    print(r)
else:
    print(r + 100 * (10 - n))

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
 
if n < 10:
	print(r + 100*(10-n))
else:
    print(r)

Submission status: Accepted

Solution code:
n, r = map(int, input().split())

if n >= 10:
  print(r)
else:
  print(r + (100 * (10 - n)))

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
if n < 10:
    print(r+100*(10-n))
else:
    print(r)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if 10 > N:
    print(R+100 * (10-N))
    exit()
print(R)

Submission status: Accepted

Solution code:
n, r = list(map(int, input().split()))
if n >= 10:
  print(r)
else:
  print(r+100*(10-n))

Submission status: Accepted

Solution code:
def contest(N, R):
    if(N > 10):
        return R
    else:
        return R + 100 * (10-N)

if __name__ == "__main__":
    N, R = map(int, input().split())
    print(contest(N, R))

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
print(r if n > 9 else r + 100 * (10 - n))

Submission status: Accepted

Solution code:
def main():
    n,r = map(int, input().split())

    if n >= 10:
        print(r)
    else:
        print(r+100*(10-n))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N, R = map(int,input().split())


if N >= 10:
    print(R)
else:
    print(R+100*(10-N))

Submission status: Accepted

Solution code:
n,r=map(int,input().split())
if(n<10):
  print(r+100*(10-n))
  
else:
  print(r)

Submission status: Accepted

Solution code:
N, R = map(int,input().split())
if N<10:
    output=  R + 100* (10-N)
else:
    output = R
print(output)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(1000000)
input = lambda: sys.stdin.readline().rstrip()

N, R = map(int, input().split())
if N >= 10:
    print(R)
else:
    print(R + 100 * (10 - N))

Submission status: Accepted

Solution code:
n, r = map(int, input().split())

ans = 0
if n >= 10:
  ans = r
else:
  ans = r + (100 * (10 - n))

print(ans)

Submission status: Accepted

Solution code:
n,r = map(int,input().split())
if(n>=10):
  print(r)
else:
  print(r+100*(10-n))

Submission status: Accepted

Solution code:
a, m = map(int, input().split()) 
if a >=10:
  print(m)
else:
  out = m + 100 *(10-a)
  if out <= 1:
    print(1)
  else:
    print(out)

Submission status: Accepted

Solution code:
n,r = map(int,input().split())
if n >= 10:
  print(r)
else:
  print(r + 100 *(10 - n))

Submission status: Accepted

Solution code:
n,r = list(map(int,input().split()))
if n >= 10:
  print(r)
else:
  print(r + (100 * (10-n)))

Submission status: Accepted

Solution code:
N, R = list(map(int, input().split()))

ans = R + 100 * max((10 - N), 0)
print(ans)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if N <= 9:
  R += 100 * (10 - N)
print(R)

Submission status: Accepted

Solution code:
n,r = input().split()
n = int(n)
r = int(r)
if n < 10:
  r = r + 100 * (10 - n)
print(r)

Submission status: Accepted

Solution code:
n,r = (map(int, input().split()))  
if n >= 10:
  print(r)
else:
  print(r+100*(10-n))

Submission status: Accepted

Solution code:
N,R = list(map(int,input().split()))

if N >= 10:
  print(R)
else:
  print(100*(10-N)+R)

Submission status: Accepted

Solution code:
n, r = map(int,input().split())
print(r+100*(10-n) if n < 10 else r)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if N>10:
    print(R)
else:
    print(R+100*(10-N))

Submission status: Accepted

Solution code:
def main():
    K = 0
    N, R = [int(_) for _ in input().split()]
    if N >= 10:
        K = R
    else:
        K = R + 100 * (10 - N) 
    print(K)
main()

Submission status: Accepted

Solution code:
N, R = map(int, input().split())

if N >= 10:
    ans = R
else:
    ans = R + 100 * (10 - N)

print(ans)

Submission status: Accepted

Solution code:
S = input().split(' ')
N, R = map(int, S)
if N < 10:
  R = R + 100 * (10 - N)
print(R)

Submission status: Accepted

Solution code:
from sys import stdin

n,r=map(int,input().split())

if n < 10:
    print(r + 100 * (10-n))
else:
    print(r)

Submission status: Accepted

Solution code:
deta = input().split()
n = deta[0]
r = deta[1]
if int(n)>=10:
    print(r)
else:
    rate = 100*(10-int(n))+int(r)
    print(rate)

Submission status: Accepted

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

n,r = list(map(int,input().split()))

if n >= 10:
    print(r)
else:
    print(r+(100 * (10-n)))

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
print( r+100*max(0, 10-n) )

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
if n < 10:
    print(r+100*(10-n))
else:
    print(r)

Submission status: Accepted

Solution code:
N,R = map(int,input().split())

if (N >= 10):
    print(R)
else:
    print(R+100*(10-N))

Submission status: Accepted

Solution code:
n,r = map(int,input().split())
if n >= 10:
    print(r)
else:
    print(r + 100 * (10 - n))

Submission status: Accepted

Solution code:
def main():
    n, r = map(int, input().split())
    if n >= 10:
        print(r)
    else:
        print(r+(100*(10-n)))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
b=a[0]
c=a[1]
if b<10:
	print((c+(10-b)*100))
else:
	print(c)

Submission status: Accepted

Solution code:
n,r = (int(num) for num in input().split())
if n < 10:
  r +=  100 * (10 - n)
print(r)

Submission status: Accepted

Solution code:
# A - Beginner
n,r=list(map(int,input().split()))
if n>=10:
    print(r)
else:
    print(r+100*(10-n))

Submission status: Accepted

Solution code:
n,r=map(int,input().split())
if n<10:
    print(r+(10-n)*100)
else:
    print(r)

Submission status: Accepted

Solution code:
n,r=map(int, input().split())
if n <10:
  print(r+100*(10-n))
else:
  print(r)

Submission status: Accepted

Solution code:
N,R = map(int,input().split(" "))
if N >= 10:
    ans = R
else:
    ans = R+100*(10-N)
print(ans)

Submission status: Accepted

Solution code:
N,R = map(int,input().split())

if N>=10 :
    print(R)
else:
    print(int(R+100*(10-N)))

Submission status: Accepted

Solution code:
def solve():
    N, M = map(int, input().split())
    ans = 0
    if N < 10:
        ans = M + 100* (10-N)
    else:
        ans = M
    return ans

print(solve())

Submission status: Accepted

Solution code:
from sys import stdin
import math

n, r = [int(x) for x in stdin.readline().rstrip().split()]

result = 0
if n < 10:
    result = r + 1000 - 100 * n
else:
    result = r

print(result)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if N >= 10:
    print(R)
else:
    print(R + (100 * (10 - N)))

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if N >= 10:
    print(R)
else:
    print(100 * (10 - N) + R)

Submission status: Accepted

Solution code:
n,r = map(int,input().split())

if n>=10:
    print(r)
else:
    r += 100*(10-n)
    print(r)

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
if(n>=10):
  print(m)
else:
  print(m+100*(10-n))

Submission status: Accepted

Solution code:
n, r = map(int, input().split())

if n<10:
    kasan = 100 * (10-n)
    print(r+kasan)

else:
    print(r)

Submission status: Accepted

Solution code:
N,R = input().split()

N = int(N)
R = int(R)

if N >= 10:
    print(R)
else:
    print(R + 100*(10-N))

Submission status: Accepted

Solution code:
x,y = map(int,input().split())
if x >= 10:
	print(y)  
else:
	print(y+(100*(10-x)))

Submission status: Accepted

Solution code:
n,r = map(int,input().split())
if n>=10:
  print(r)
else:
  print(r+(100*(10-n)))

Submission status: Accepted

Solution code:
N,R=map(int,input().split())
print(R+(100*(10-N) if N<10 else 0))

Submission status: Accepted

Solution code:
N,R=map(int, input().split())
print(R if N>=10 else R+100*(10-N))

Submission status: Accepted

Solution code:
inp = input().split()
N = int(inp[0])
R = int(inp[1])
#print(N)
if N >= 10:
  print(R)
else:
  col = R + 100*(10-N)
  print(col)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
print(R + 100 * (10 - N)) if N < 10 else print(R)

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n,r = LI()

    return r + max(0,100*(10-n))


print(main())

Submission status: Accepted

Solution code:
num, rate = map(int,input().split())
minus = 100*(10 - num)

if num <= 10:
    print(minus + rate)
else:
    print(rate)

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
N = i[0]
R = i[1]

if N >= 10:
    insc = R
else:
    insc = R + 100*(10-N)

print(insc)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
x = 100*(10 - N)

if N >= 10:
  print(R)
else:
  print(R + x)

Submission status: Accepted

Solution code:
n,r=map(int,input().split())
if 10<=n:
  print(r)
else:
  print(r+100*(10-n))

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
if n >= 10:
    print(r)
    exit()
print(r + (100*(10-n)))

Submission status: Accepted

Solution code:
n, r = map(int, input().split())

if n >= 10:
    naibu = r
else:
    naibu = r + 100*(10 - n)

print(int(naibu))

Submission status: Accepted

Solution code:
n,r=map(int, input().split())
if n < 10:
  print(r + 100 * (10-n))
else:
  print(r)

Submission status: Accepted

Solution code:
n,r=map(int,input().split())
print(r+100*max(10-n,0))

Submission status: Accepted

Solution code:
n, r = map(int, input().split())

if n >= 10:
    print(r)
else:
    ans = r + 100 * (10 - n)
    print(ans)

Submission status: Accepted

Solution code:
def resolve():
    n, r = map(int, input().split())
    if n >= 10:
        ans = r
    else:
        ans = r + 100*(10-n)
    print(ans)
resolve()

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
print(R + 100 * (10 - N) if N < 10 else R)

Submission status: Accepted

Solution code:
N,R=list(map(int,input().split()))
 
if N>=10:
  print(R)
else:
  print(R+100*(10-N))

Submission status: Accepted

Solution code:
N, R = map(int, input().split(' '))
if N < 10:
    print(R + 100 * (10 - N))
else:
    print(R)

Submission status: Accepted

Solution code:
n,r = map(int, input().split())

if n < 10:
  print(r + 100 * (10 - n))
else:
  print(r)

Submission status: Accepted

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

N, R = [int(x) for x in input().split()]

if N >= 10:
    print(R)
else:
    print(R + 100 * (10 - N))

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
if n < 10:
    r += 100 * (10 - n)
print(r)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())

print(R + (0 if N > 10 else (100 * (10 - N))))

Submission status: Accepted

Solution code:
N,R=map(int,input().split())

if N >= 10:
    X = R
else:
    X = R + 100 * (10 - N)

print(X)

Submission status: Accepted

Solution code:
# coding: utf-8

n, r = map(int, input().split())

if n >= 10:
    inner_r = r
else:
    inner_r = r + 100 * (10 - n)
print(inner_r)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if N >= 10:
    print(R)
else:
    aws = R + 100*(10-N)
    print(aws)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())

if N >= 10:
  rating = R
else:
  rating = R + 100 *  (10 - N)
  
print(rating)

Submission status: Accepted

Solution code:
n, r = map(int, input().split())

if n >= 10 :
    rate = r

elif n < 10 :
    k = n
    rate = r + 100 * (10 - k)

print(int(rate))

Submission status: Accepted

Solution code:
import os

n, r = map(int, input().split())

if n >= 10 :
    rate = r

elif n < 10 :
    k = n
    rate = r + 100 * (10 - k)

print(int(rate))

Submission status: Accepted

Solution code:
N,R = map(int,input().split())

if N>=10:
    print(R)
else:
    print(R+1000-100*N)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
result = R if N > 10 else R + 100 * (10 - N)
print(result)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if N < 10:
  R += 100 * (10 - N)
print(R)

Submission status: Accepted

Solution code:
n,r=map(int,input().split())
if n<10:
    print(r+(10-n)*100)
else :
    print(r)

Submission status: Accepted

Solution code:
N,R = map(int, input().split())
if N < 10:
    print(R + 100*(10-N))
else:
    print(R)

Submission status: Accepted

Solution code:
_input = input()
number = _input.split()
N = int(number[0])
R = int(number[1])
if N<10:
  R += 100 * (10-N)
print(R)

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
n = 10 if n > 10 else n
print(r + 100*(10-n))

Submission status: Accepted

Solution code:
n,r=map(int, input().split())
if n >= 10:
  print(r)
else:
  print(r+100*(10-n))

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
res = R if N>=10 else R+100*(10-N)
print(res)