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:
#!/usr/bin/env python3
import sys


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


# 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:
    dif = 100*(10-n)
    print(r+dif)

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())
under_R = 100 * (10 - N)

if N < 10:
    print(under_R + R)
else:
    print(R)

Submission status: Accepted

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

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

print(R + (100 * (10 - min(10, N))))

Submission status: Accepted

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

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

Submission status: Accepted

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

print(L)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

N, R = list(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())
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)
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:
  ans = r + 100 * (10-n)
else:
  ans = r
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

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, a = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
#l = list(map(int,input().split()))

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

if n<10:
    m+=100*(10-n)

print(m)

Submission status: Accepted

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

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:
  print(str(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+1000-100*n)

Submission status: Accepted

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

N = inpt[0]
R = inpt[1]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a < 10:
    b = b + (100 * (10 - a))

print(b)

Submission status: Accepted

Solution code:
input = input()

arr = input.split(" ")
N = int(arr[0])
R = int(arr[1])

I = R

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

print(I)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import collections as col
input=sys.stdin.readline

def mainA():
	N,R=map(int,input().split())
	#N=input().rstrip()
	#N=int(input())
	#vA=list(map(int,input().split()))
	
	if N >= 10:
		res = R
	else:
		res = R + 100*(10-N)
	
	print(res)

def mainB():
	N,K=map(int,input().split())
	#N=input().rstrip()
	#N=int(input())
	#vA=list(map(int,input().split()))
	
	res = 0
	while N:
		N //= K
		res += 1
	
	print(res)

def mainC():
	#N,K=map(int,input().split())
	N=input().rstrip()
	#N=int(input())
	vA=list(map(int,input().split()))
	
	res = float("inf")
	for i in range(1, 101):
		t = sum((x-i)**2 for x in vA)
		res = min(res, t)
	
	print(res)


mainA()
#mainB()
#mainC()

Submission status: Accepted

Solution code:
# coding:utf-8
 
def main():
    sanka, rate = map(int, input().split())
    
    if sanka < 10:
        print(100 * (10 - sanka) + rate)
        
    else:
        print(rate)
  
    return 0 
 
if __name__ == '__main__':
  main()

Submission status: Accepted

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

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:
s=input("")
l=s.split()
N=int(l[0])
R=int(l[1])
if N>=10:
    I=R
else:
    I=R+100*(10-N)
print(I)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
if 0<=x<10 :
    z=100*(10-x)
    a=y+z
elif 10<=x :
    a=y
print(a)

Submission status: Accepted

Solution code:
# coding: utf-8


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

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

    return 0


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

print(Rate)



#print('N=', N, 'R=', R)

Submission status: Accepted

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


if N >= 10:
    print(R)
else:
    print(R+(100 * (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:
a, b = map(int, input().split())
if(a <= 10):
    b = 100 * (10 - a) + b
# 出力
print("{}".format(b))

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = input().split(" ")
n=int(n)
r=int(r)
if n<10:
    print((100*(10-n))+r)
else:
    print(r)

Submission status: Accepted

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

if n[0]<10 :
  print(100*(10-n[0])+n[1])

else:
  print(n[1])

Submission status: Accepted

Solution code:
def main():
    t = input().split()
    n,r = int(t[0]),int(t[1])
    k = 0
    if n<10 :
        k = r+100*(10-n)
    else:
        k = r
    print(k)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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:
    a = 100 * (10 - N)
else:
    a = 0
print(R + a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
print(R + max(0, 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:
    r += (10 -n) * 100

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:
data = input()
times, rate = data.split()
times = int(times)
rate = int(rate)

if times < 10:
  rate += 100*(10-times)
  
print(rate)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(inside)

Submission status: Accepted

Solution code:
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:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce
import pprint
sys.setrecursionlimit(10 ** 9)


INF = 10 ** 13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
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)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007



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


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:
strings = input().split(' ')
N = int(strings[0])
R = int(strings[1])
 
if N < 10:
  print(R + 100*(10-N))
else:
  print(R)

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

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


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


# 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 = input().split()
if int(n[0]) >= 10:
  print(n[1])
else:
  print(int(n[1]) + 100*(10-int(n[0])))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

f = sys.stdin
N, R = map(int, f.readline().split(' '))

I = R

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

print(I)

Submission status: Accepted

Solution code:
NR=list(map(int,input().split()))
if NR[0]>=10:
    inR=NR[1]
    print(inR)
else:
    inR=int(NR[1]+100*(10-NR[0]))
    print(inR)

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:
# coding: utf-8
# Your code here!
N,R=map(int,input().split())

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

Submission status: Accepted

Solution code:
from sys import stdin

N, R = stdin.readline().rstrip().split()
N = int(N)
R = int(R)
if N < 10:
	print(R + 100 * (10 - N))
	
else:
	print(R)

Submission status: Accepted

Solution code:
s = input().split() #s_1 s_2を分割して取得し、sに値を入れる
n = int(s[0])
r = int(s[1])

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

Submission status: Accepted

Solution code:
s = input().split()
n, r = int(s[0]), int(s[1])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
a,b=map(int, input().split())
if a >= 10:
  x = b
else:
  x = b+100*(10-a)
print(x)

Submission status: Accepted

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

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(100*(10-N) + R)
else:
  print(R)

Submission status: Accepted

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

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:
n,r=map(int,input().split())

kai=min(10,n)

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

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:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

N,R = inpl()

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

Submission status: Accepted

Solution code:
# coding: utf-8

number = input().split(" ")
N = int(number[0])
R = int(number[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:
	r = 100 * (10 - n) + r
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=[int(e) for e in input().split(' ')]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import fractions

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors

def ValueToBits(x,digit):
    res = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        res[i]=now%2
        now = now >> 1
    return res

def BitsToValue(arr):
    n = len(arr)
    ans = 0
    for i in range(n):
        ans+= arr[i] * 2**i
    return ans

def ValueToArray10(x, digit):
    ans = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        ans[digit-i-1] = now%10
        now = now //10
    return ans

def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p
'''
p = 10 ** 9 + 7
N = 10 ** 6 + 2
fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用

for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)
    
def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p
'''


#a = list(map(int, input().split()))

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
b = input()
a = b.split(" ")
N, R = (int(x) for x in b.split(" "))
if N>= 10:
  I = R
  print(I)
else:
  I = R + 100*(10-N)
  print(I)

Submission status: Accepted

Solution code:
from sys import stdin

def main():
    N, R = [int (x) for x in stdin.readline().rstrip().split()]
    result = R if N > 10 else R + (100 * (10 - N))
    print(result)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
nums=[int(i) for i in input().split()]
if nums[0]<=9:
    print(nums[1]+100*(10-nums[0]))
else:
    print(nums[1])

Submission status: Accepted

Solution code:
N, R = map(int, input().rstrip().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:
    Inner = R
else:
    Inner = R+ (100 * (10-N))
print(Inner)

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  >= 10:
    c = b
elif a < 10:
    c = b + 100*(10-a)

print(c)

Submission status: Accepted

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

def calc(n, r):
  if n >= 10:
    return r
  else:
    return r + 100*(10-n)

print(calc(n, r))

Submission status: Accepted

Solution code:
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from functools import *
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def Golf():
    *a,=map(int,open(0))
def S_():
    return input()
def IS():
    return input().split()
def LS():
    return [i for i in input().split()]
def I():
    return int(input())
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 StoI():
    return [ord(i)-97 for i in input()]
def ItoS(nn):
    return chr(nn+97)
def LtoS(ls):
    return ''.join([chr(i+97) for i in ls])
def GI(V,E,Directed=False,index=0):
    org_inp=[]
    g=[[] for i in range(n)]
    for i in range(E):
        inp=LI()
        org_inp.append(inp)
        if index==0:
            inp[0]-=1
            inp[1]-=1
        if len(inp)==2:
            a,b=inp
            g[a].append(b)
            if not Directed:
                g[b].append(a)
        elif len(inp)==3:
            a,b,c=inp
            aa=(inp[0],inp[2])
            bb=(inp[1],inp[2])
            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}):
#h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0}) # sample usage
    mp=[1]*(w+2)
    found={}
    for i in range(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+=[1]+[mp_def[j] for j in s]+[1]
    mp+=[1]*(w+2)
    return h+2,w+2,mp,found
def bit_combination(k,n=2):
    rt=[]
    for tb in range(n**k):
        s=[tb//(n**bt)%n for bt in range(k)]
        rt+=[s]
    return rt
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['YES','NO']
Yn=['Yes','No']

mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
#ts=time.time()
#sys.setrecursionlimit(10**7)
input=lambda: sys.stdin.readline().rstrip()
 
def ran_input():
    import random
    n=random.randint(4,16)
    rmin,rmax=1,10
    a=[random.randint(rmin,rmax) for _ in range(n)]
    return n,a

class Comb:
    def __init__(self,n,mo=10**9+7):
        self.fac=[0]*(n+1)
        self.inv=[1]*(n+1)
        self.fac[0]=1
        self.fact(n)
        for i in range(1,n+1):
            self.fac[i]=i*self.fac[i-1]%mo
            self.inv[n]*=i
            self.inv[n]%=mo
        self.inv[n]=pow(self.inv[n],mo-2,mo)
        for i in range(1,n):
            self.inv[n-i]=self.inv[n-i+1]*(n-i+1)%mo
        return
    
    def fact(self,n):
        return self.fac[n]
        
    def invf(self,n):
        return self.inv[n]

    def comb(self,x,y):
        if y<0 or y>x:
            return 0
        return self.fac[x]*self.inv[x-y]*self.inv[y]%mo


show_flg=False
show_flg=True

ans=0

n,r=LI()
if n<10:
    r+=100*(10-n)
print(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:
n, r = map(int, input().split())

print(r) if n >= 10 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,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:
a,b =map(int, input().split())
if a<10:a=10-a
else:a=0
print(b+ (a*100))

Submission status: Accepted

Solution code:
attend, rate = input().split(' ')
 
if int(attend) >= 10:
  print(rate)
else:
  print(int(rate) + 100 * (10 - int(attend)))

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:
n, p = map(int, input().split())
print(p if n > 10 else p + 100 * (10 - n))

Submission status: Accepted

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

Submission status: Accepted

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

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

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((100*(10-N))+R)
else:
    print(R)

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
t = 0
if n < 10:
    t = 100 * (10 - n)
print(t+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())
n = max(0, 10 - N)
A = R + 100 * (n)
print(A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin


def get_result(data):
    N, R = data
    if N < 10:
        return R + 100 * (10 - N)
    
    return R

if __name__ == '__main__':
    data = list(map(int, stdin.readline().split(' ')))
    result = get_result(data)
    print(result)

Submission status: Accepted

Solution code:
def main():
    inp = input()
    arr = inp.split(" ")
    print(rate(int(arr[0]), int(arr[1])))


def rate(n, er):
    if (n < 10):
        return er + (100 * (10 - n))
    else:
        return er


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import collections
import itertools as it
import math
import numpy as np

# A = input()
# A = int(input())
# A = map(int, input().split())
# A = list(map(int, input().split()))
# A = [int(input()) for i in range(N)]
#
# c = collections.Counter()

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

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

Submission status: Accepted

Solution code:
input = input().split(" ")
if int(input[0]) < 10:
  c = 10 - int(input[0])
  r = 100 * int(c)
  res = int(input[1]) + int(r)
  print(res)
elif int(input[0]) >= 10:
  print(input[1])

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if a < 10:
  i = 100 * (10 - a)
  s = b + i
  print(s)
  
else:
  print(b)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = [int(i) for i in input().split()]
a = n[0]
b = n[1]
if a < 10:
  b += (10-a)*100
print(b)

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 = input().split()
if int(n) >= 10:
  h = int(r)
else:
  h = int(r) + (100 * (10-int(n)))
print(h)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import sys
from collections import deque as deq

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:
    r  = r + 100*(10-n)
    print(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(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:
    a = 100 * (10 - n)
    b = r + a
    if b >=0:
        print(b)
    else:
        print(0)
else:
    print(r)

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,k=map(int,input().split())
if n<10:
  c=100*(10-n)
  ans=k-c
  if ans<0:
    print(0)
    exit()
  else:
    print(k+c)
else:
  print(k)

Submission status: Accepted

Solution code:
N,R = [int(x) for x in input().split()]
print(R + 100 * max((10 - N),0))

Submission status: Accepted

Solution code:
#input = sys.stdin.readline
def inpl(): return list(map(int, input().split()))
N, R = inpl()

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

Submission status: Accepted

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

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

print(n_rate)