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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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:
import sys;input=lambda:sys.stdin.readline().rstrip();aint=lambda:int(input());ints=lambda:list(map(int,input().split()))
import math;floor,ceil=math.floor,math.ceil
from collections import deque
Yes=lambda b:print('Yes')if b else print('No');YES=lambda b:print('YES')if b else print('NO')
is_even=lambda x:True if x%2==0 else False

def main():
  n,r = ints()
  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())
inside = 0

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

print(inside)

Submission status: Accepted

Solution code:
import math
N, R = map(int, input().split())
S = 0
if N>9:
     S = R
else:

    S = R + 100*(10-N)

print(S)

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())
print(r + max(1000 - 100 * n, 0))

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/evn python3

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

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

Submission status: Accepted

Solution code:
import sys
N, R = map(int, sys.stdin.readline().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=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(100*(10-n)+r if n<11 else r)

Submission status: Accepted

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

if n>=10:
  print(r)
  exit()
  
print(r+1000-100*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=[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(100*(10-N)+R)

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

Submission status: Accepted

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

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

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

if __name__ == '__main__':
	main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

#結果の表示
print(rating)

Submission status: Accepted

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

N = min(10,N)

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.buffer.readline
#from collections import defaultdict
#d = defaultdict(int)
#import fractions
#import math
#import collections
#from collections import deque
#from bisect import bisect_left
#N = int(input())
#A = list(map(int,input().split()))
#S = list(input())
#S.remove("\n")
#N,M = map(int,input().split())
#S,T = map(str,input().split())
#A = [int(input()) for _ in range(N)]
#S = [input() for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]
#import itertools
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>9:
  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)
else:
    print(r+(100*(10-n)))

Submission status: Accepted

Solution code:

url = "https://atcoder.jp//contests/abc156/tasks/abc156_a"

def main():
    n, r = list(map(int, input().split()))
    print(r) if n >= 10 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:
    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:
import numpy as np

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

N, R = rl()

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

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

Submission status: Accepted

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

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

print(In)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)

# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def nlist(n, v):
    if not n:
        return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def yesno(v):
    print(["Yes", "No"][not v])


# エントリーポイント
def main():
    N, R = input([int, 2])
    print(R if 10 <= N else R + (100 * (10 - N)))


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Submission status: Accepted

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

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

def main():
    N, R = map(int, open(0).read().split())
    
    if N >= 10:
        print(R)
    else:
        print(R + 100 * (10 - N))


main()

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:
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=(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):
    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+1000-100*N)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, r = list (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 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())

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

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

Submission status: Accepted

Solution code:
#設定
import sys
input = sys.stdin.buffer.readline

#ライブラリインポート
from collections import defaultdict

con = 10 ** 9 + 7
#入力受け取り
def getlist():
	return list(map(int, input().split()))

#処理内容
def main():
	N, R = getlist()
	if N >= 10:
		print(R)
	else:
		print(R + (10 - N) * 100)
	


if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
INT_MAX=10**18+7
x=10**9+7
def INPUT():return list(int(i) for i in input().split())
def LIST_1D_ARRAY(n):return [0 for _ in range(n)]
def LIST_2D_ARRAY(m,n):return [[0 for _ in range(n)]for _ in range(m)]
GETA=123
###############################################################################
n,r=INPUT()
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 SHORTCUTS
N, K = map(int,input().split())
N ,A,B = map(int,input().split())
string = str(input())
arr = list(map(int,input().split()))
N = int(input())
'''
n , m = map(int,input().split())
if n>=10:
	print(m)
else:
	m = m + (100*(10-n))
	print(m)

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 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 = tuple(int(n) for n in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

print(x)

Submission status: Accepted

Solution code:
def solve():
    if n>=10:
        return r
    else:
        return r+100*(10-n)


n, r = [int(i) for i in input().split(" ")]
print(solve())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def f(n, r):
    if n >= 10:
        print(r)
    else:
        print(r + 100 * (10 - n))

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

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

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().strip().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 + (10 - min(n, 10)) * 100

print(ans)

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

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

Submission status: Accepted

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

if a[0] >= 10:
  print(a[1])
else:
  print(a[1] + 100 * (10 - a[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:
#A

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

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

Submission status: Accepted

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

print(eq)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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, groupby
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, R = MAP()

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

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n, r = list(map(int, readline().split()))
    if n >= 10:
        print(r)
    else:
        print(r + 100 * (10 - n))


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

if N < 10:
  R += 100 * (10- N)
  print(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:
n,r=map(int,input().split())
if n>=10:
  x=r
else:
  x=r+100*(10-n)
print(str(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]=[int(item)for item in input().split()]
print(max(R, 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:
K, R = map(int, input().split())
ans = 0
 
if K >= 10:
  ans = R
else:
  ans = R + 100*(10 - K)
 
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
[N,R]=[int(item)for item 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)
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())

ans = 0

if N >= 10:
    ans = R
else:
    ans = 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*N+1000)

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

Submission status: Accepted

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

Submission status: Accepted

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

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, K = map(int,input().split())
print(K + 100*max(10-N,0))

Submission status: Accepted

Solution code:
x = input()
count = int(x.split()[0])
num = int(x.split()[1])

if count < 10:
    num = num + (100 * (10 - count))
else:
    num

print(num)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
# int(input()) # 入力が1つ
n, r = map(int, input().split()) # 入力が複数
# [int(i) for i in input().split()] # 配列で数字

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

Submission status: Accepted

Solution code:
#ABC156 - Virtual
sel='A'
#A
if sel=='A':
    N,R=map(int,input().split())
    if N>=10:
        print(R)
    else:
        print(R+100*(10-N))
#B
if sel=='B':
    N,K=map(int,input().split())
    cnt=0
    while N>0:
        N//=K
        cnt+=1
    print(cnt)

#C
if sel=='C':
    def ceilT(a,b): #ceil(a/b)
        return (a+b-1)//b

    N=int(input())
    X=[int(i) for i in input().split()]
    p=ceilT(sum(X),N)
    ans=sum((x-p)**2 for x in X)
    p-=1
    ans=min(ans,sum((x-p)**2 for x in X))
    print(ans)

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+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()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()


n,r = na()

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

Submission status: Accepted

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

Submission status: Accepted

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

internal_rating = lambda R, K: max(R, R + 100 * (10 - K))

answer = internal_rating(R, N)

print(answer)

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