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

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

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

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

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

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

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

Solution (Python):


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


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

Solution (Python):
N, R = map(int, raw_input().split())

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

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
import math
from fractions import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    vn = vk = vn_k = 1
    for i in range(1, n+1):
        vn = vn * i % modp
        if i == k:
            vk = vn
        if i == n-k:
            vn_k = vn
    return vn * get_inv(vk, modp) * get_inv(vn_k, modp) % modp

def comb_from_list(n, k, modp, fs, invs):   
    return fs[n] * invs[n-k] * invs[k] % modp



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

main()

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

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

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

Solution (Python):
"""
じょえチャンネルおもしろいよ～～～
https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
"""

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

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

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




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

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

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

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
N, R = map(int, input().split())
if N >= 10: print(R)
else: print(R + 100 * (10 - N))

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

Solution (Python):

import sys


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

    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    R = int(next(tokens))  
    solve(N, R)

if __name__ == '__main__':
    main()

Solution (Python):

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

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

inner = b + max((10 - a),0)*100

print(inner)

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

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

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

Solution (Python):

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

ans=R+100*(10-min(N,10))

print(ans)

Solution (Python):


import sys
sys.setrecursionlimit(300000)


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

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    R = int(next(tokens))  
    solve(N, R)

if __name__ == '__main__':
    main()

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

Solution (Python):
[n,r] = [int(i) for i in input().split()]
if n >= 10:
    print(r)
else:
    print(r + 100*(10-n))

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

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

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

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


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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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

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

Solution (Python):

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

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

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

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

Solution (Python):
def examA():
    N, R = LI()
    ans = R+100*max(0,(10-N))
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examA()

"""

"""

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

if n >= 10:
    n = 10

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

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

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

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

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

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

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

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

Solution (Python):
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
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 [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  n,r=LI()
  if 10<=n:
    return r
  return r+100*(10-n)


print(main())

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

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

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

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

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

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

Solution (Python):
import sys
from operator import itemgetter
from collections import deque, Counter
from itertools import permutations, combinations
from heapq import heapify, heappop, heappush
from bisect import bisect, bisect_left

def solve():
    input = sys.stdin.readline
    N, R = map(int, input().split())
    if N < 10: R += 100 * (10 - N)
    print(R)

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
import sys

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

n,r = nm()

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

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""


n,r = m()

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

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

Solution (Python):
def main():
    N, R = map( int, input().split())
    if N >= 10:
        print(R)
        return
    print(R+100*(10-N))
if __name__ == '__main__':
    main()

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

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy


from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input()) 
def inpm(): return map(int,input().split()) 
def inpl(): return list(map(int, input().split())) 
def inpls(): return list(input().split())  
def inplm(n): return list(int(input()) for _ in range(n)) 
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)] 
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)]) 


def main():
    n,r = inpm()
    if n >= 10:
        print(r)
    else:
        print(r+100*(10-n))
    
if __name__ == "__main__":
    main()

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    N,K=MI()
    if N>=10:
        print(K)
    else:
        print(K+100*(10-N))
if __name__ == '__main__':
    main()

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
"""
じょえちゃんねる
高評価・チャンネル登録よろしくお願いします！
https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
"""
n, r = map(int, input().split())
if n >= 10:
    print(r)
else:
    print(r + 100 * (10 - n))

Solution (Python):
n,r=[int(i) for i in input().split()]
print(r if n>=10 else r+100*(10-n))

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

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

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

Solution (Python):
from sys import stdin

def input():
	return stdin.readline()[:-1]

def intput():
	return int(input().rstrip())

def sinput():
	return input().rstrip().split()

def intsput():
	return map(int, sinput())

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



if __name__ == '__main__':
	main()

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

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

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


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

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

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


main()

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]





n,r=mii()

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, R = MAP()

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do(): 
    n,r=INTM()
    print(r+(10-min(10,n))*100)
if __name__ == '__main__':
    do()

Solution (Python):

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

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

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

Solution (Python):
N, R = map(int, input().split())
print(R + 100 * (10 - min(N, 10)))

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

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

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

Solution (Python):

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

Solution (Python):
import sys

stdin = sys.stdin

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

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

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

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

Solution (Python):

import sys
INF = float("inf")


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

    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    R = int(next(tokens))  
    solve(N, R)


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))



N,R = LI()

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

Solution (Python):
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7



N, R = list(map(int, sys.stdin.buffer.readline().split()))

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

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

k = max(100 * (10 - n), 0)

print(r+k)

Solution (Python):
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

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

Solution (Python):

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:
        print(r)
    else:
        print(r+100*(10-n))
    return


if __name__ == "__main__":
    solve()

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