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

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

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

Submission status: Accepted

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

print(rate(n,r))

Submission status: Accepted

Solution code:
#print(input())
N, DR = map(int, input().split())
# DR = IR - 100 * (10 - N)
# IR + 100 * (10 - N) = IR

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

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

Submission status: Accepted

Solution code:

import sys

# 再起回数上限変更
sys.setrecursionlimit(1000000)

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

if N >= 10:
    print(R)
    sys.exit()

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 = 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 = [int(s) for s in input().split()]

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

Submission status: Accepted

Solution code:
#--Beginner
#1行1列
number, rate = map(int, input().split())

if (number < 10):
  print(rate+(100*(10-number)))
elif (number >= 10):
  print(rate)

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
rate=0

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

print(rate)

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 = 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,K=[int(s) for s in input().split()]
if N<10:
  print(K+(10-N)*100)
else:
  print(K)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp=list(map(int,input().strip().split()))[:2]
n,r=inp[0],inp[1]
if(n <= 9):
  print(100*(10-n)+r)
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 = (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())
print(R if N>10 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)
else:
    print()
    print(r+100*(10-n))

Submission status: Accepted

Solution code:
N, R = map(int, raw_input() .split())
if N >= 10:
    print R
else:
    print 100*(10 - N) + 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,raw_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())
if N >= 10:
    I = R
else:
    I = R + 100 * (10 - N)
print(I)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math

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

Submission status: Accepted

Solution code:
#template
from collections import Counter
def inputlist(): return [int(j) for j in input().split()]
#template
N,R = inputlist()
if N < 10:
    R += 100*(10-N)
print(R)

Submission status: Accepted

Solution code:
class Beginner:
    def check_ten(self, N):
        if N >= 10:
            return True
        else:
            return False
    def calculate_rate(self, N, ten_or_not, open_rate):
        if ten_or_not:
            return open_rate
        else:
            return open_rate + 100*(10 -N)
if __name__ == "__main__":
    N, R = map(int, input().split())
    b = Beginner()
    result_1 = b.check_ten(N)
    result_2 = b.calculate_rate(N, result_1, R)
    print(str(result_2))

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

ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
1 <= N < 100
0 <= R < 4111

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

else:
    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:
from sys import stdin

N, R = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

# N, R =2, 2919

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
import sys
import heapq
import bisect
import math
import itertools
import string
import queue
import copy
import time
# import numpy as np
from fractions import gcd

sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7

def inp(): return int(sys.stdin.readline())
 
def inp_list(): return list(map(int, sys.stdin.readline().split()))

def lcm(x, y): return (x * y) // gcd(x, y)


N, R = inp_list()
I = 0
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:
  print(R + (100 * (10 - N)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
	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+100*max(10-n,0))

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  n, r = map(int, readline().split())
  if n>=10:
    print(r)
  else:
    print(r+100*(10-n))
  
  
if __name__ == '__main__':
  main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
import fractions
def main():
  n,r = map(int,input().split())
  print((100 * (10 - n)) + r if n < 10 else r)
  
if __name__ == '__main__':
  main()

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

Submission status: Accepted

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

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

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:
#Beginner
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:
    n2=100*(10-N)
    R2 = R+n2
    
elif N >= 10:
    R2 = R
    
print(R2)

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

Submission status: Accepted

Solution code:
import sys

n, r = map(int, sys.stdin.readline().split())

def main():
    i = r + 100 * max(10 - n, 0)
    print(i)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if int(n[0]) >= 10:
  print(n[1])
else:
  print(100 * (10 - int(n[0])) + int(n[1]))

Submission status: Accepted

Solution code:
n, r = [int(i) for i in 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 + (100*(10-N)))
else:
    print(R)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def get():
    return list(map(int, input().split()))


a = get()
if a[0] < 10:
    print(a[1]+100*(10 - a[0]))
else:
    print(a[1])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

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

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

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

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, 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>9:
    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:
# -*- coding: utf-8 -*-

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

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+(10**3-100*n))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

print(Ans)

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

ans = r + 100 * (10 - min(10, n))
print(ans)

Submission status: Accepted

Solution code:
# problem A
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:
n, r = [int(i) for i in input().split(" ")]
print(r if n >= 10 else 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 + (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 N >= 10:
  print(R)
else:
  print(R+1000-100*N)

Submission status: Accepted

Solution code:
input=input().split()
N=int(input[0])
R=int(input[1])
gap=max(0,100*(10-N))
real=R+gap
print(real)

Submission status: Accepted

Solution code:
N ,R = map(int, input().split())
if N >=10:
  print(R)
  
else:
  r = 100*(10 - N)
  R = R + r
  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:
x  = [int(x) for x in input().split()]

if x[0] >= 10:
	print(x[1])
else:
	print(x[1]+(100*(10-x[0])))

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

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

Submission status: Accepted

Solution code:
# 初期入力
N,R = (int(x) for x in input().split(" "))

# 内部レーティング計算、１０回以上と以下で場合分け
if 10 <= N:
    naibu = R
else:
    naibu = R + 100*(10 - N)
print(naibu)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

# print(n)
# print(r)

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

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

Submission status: Accepted

Solution code:
N, R = [int(i) for i in input().rstrip().split(' ')]
print(R) if N >= 10 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))
    print(ans)
else:
    print(R)

Submission status: Accepted

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

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 solve():
  n, r = list(map(int, input().split()))
  if n < 10:
    print(r + 100 * (10 - n))
    return
  
  print(r)
  return
 
if __name__ == "__main__":
  solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


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))  # 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:
NR=list(map(int,input().strip().split()))
N=NR[0]
R=NR[1]

if N>=10:
    score=R
elif N<10:
    score=R+(100*(10-N))

print(score)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

n = int(data[0])
r = int(data[1])

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

print(ans)

Submission status: Accepted

Solution code:
S = input()
H = S.split()

N = int(H[0])
R = int(H[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+(100*(10-n))))

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    n, r = map(int, input().split())

    k = max([0, 10 - n])

    print(r + 100 * k)

Submission status: Accepted

Solution code:
N, R = (int(x) for x in 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
else:
  ans=R+(100*(10-N))
print(ans)

Submission status: Accepted

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

if n > 10:
  n = 10

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

Submission status: Accepted

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

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

print(rate)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(answer)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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