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

Submission status: Accepted

Solution code:
from collections import defaultdict
from collections import deque
from string import ascii_uppercase
import sys, bisect, math, heapq

stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()

N, R = read_int()

def solve():
    ans = 0
    if N >= 10:
        return R
    return R + 100 * (10 - N)

if __name__ == "__main__":
    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:
def solve(n,r):

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A , B = map(int,input().split())
if A <= 10:
    A_1 = 100*(10-A)
else:
    A_1 = 0

print(B+A_1)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

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

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
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:
        rating = R
    else:
        rating = R + 100 * (10 - N)
    print(rating)

main()

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

from collections import deque, defaultdict
import itertools as ite
import sys
import math
from decimal import *

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

N, R = map(int, raw_input().split())
print R + 100 * max(0, 10 - N)

Submission status: Accepted

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

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

print(I)

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

A()

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

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

Submission status: Accepted

Solution code:
# 2020/02/22
# AtCoder Beginner Contest 156 - A

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

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

# Output
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,y = map(int,input().split())

if x >= 10:
    print(y)
else:
    print(y+100*(10-x))

Submission status: Accepted

Solution code:
import sys
# import math
# import decimal
# import queue
# import bisect
# import heapq
# import time
# import itertools

mod = int(1e9+7)
INF = 1<<29

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

if __name__=='__main__':
    main()

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

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

print(out)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

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

ans = 0

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = [int(str) for str in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

N,R = nums()
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:
    a=100*(10-N)
    ans=a+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:
x,y = map(int,input().split(" "))
if x >= 10:
    print(y)
elif x < 10:
    print(y + 100*(10-x))

Submission status: Accepted

Solution code:
# ABC 156 A
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nms = lambda: map(str, input().split())
nl = lambda: list(map(int, input().split()))
n,r=nm()
if n>=10:
    print(r)
elif n<10:
    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 = 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())

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

Submission status: Accepted

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

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:
import sys

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

if N >= 11:
    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:
#A

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
#from fractions import gcd
#mod = 10 ** 9 + 7
#N = int(input())
#a = list(map(int,input().split()))
#a,b,c = map(int,input().split())
#ans = [0] * N
#math.ceilで切り上げ
#dp = [[0] * 4 for i in range(3)] #2次元配列初期化
#dp = [[[0] * 2 for i in range(3)] for j in range(5)]
#(ord('A'))でASCII出力 Aは65
import math
import string

def intinput():
    return int(input())

def listintinput():
    return list(map(int,input().split()))

def splitintinput():
    return map(int,input().split())

n,r = splitintinput()

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

if n < 10:
    n1 = 100*(10-n)
    print(n1+r)
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:
    print(R)
else:
    print(R + 1000 - 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:
# coding: utf-8

n,r = map(int, raw_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:
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, k = [int(i) for i in input().split()]

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n,r=[int(k) for k in input().strip().split(" ")]
print(r + max(0,(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:
def main():
    N, R = map(int, input().split(' '))

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

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


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

Submission status: Accepted

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

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

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

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 = 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())                            # 1行2列

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

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

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, R):
    if N >= 10:
        return R
    return R + (100 *(10-N))


def main():
    N, R = read_int_n()
    print(slv(N, R))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

print(output)

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)

import math

import logging

logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)

# from collections import defaultdict
# d = defaultdict(list)

# from itertools import combinations
# comb = combinations(range(N), 2)

# 累積和
# from itertools import accumulate
# _list = list(accumulate(a_list)


def resolve():
    # S = [x for x in sys.stdin.readline().split()][0]  # 文字列 一つ
    # N = [int(x) for x in sys.stdin.readline().split()][0]  # int 一つ
    N, R = [int(x) for x in sys.stdin.readline().split()]  # 複数int
    # h_list = [int(x) for x in sys.stdin.readline().split()]  # 複数int

    # grid = [list(sys.stdin.readline().split()[0]) for _ in range(N)]  # 文字列grid
    # v_list = [int(sys.stdin.readline().split()[0]) for _ in range(N)]
    # grid = [[int(x) for x in sys.stdin.readline().split()]
    #         for _ in range(N)]  # int grid

    logger.debug('{}'.format([]))

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


if __name__ == "__main__":
    resolve()

# AtCoder Unit Test で自動生成できる, 最後のunittest.main は消す
# python -m unittest template/template.py で実行できる
# pypy3 -m unittest template/template.py で実行できる

import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """2 2919"""
        output = """3719"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """22 3051"""
        output = """3051"""
        self.assertIO(input, output)

Submission status: Accepted

Solution code:
import sys
import math
import fractions
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(10**7)

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

Submission status: Accepted

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

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

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

    print(ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import numpy as np
# import scipy as sp
# import sys
# input = sys.stdin.readline
# print(a,b,c,sep="") # 半角スペースなしで出力(abc)
# n=int(input())  #数値入力 「N」だけの入力のとき
# a,b=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
# a=list(map(int, input().split()))  #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき
# a=[int(input()) for _ in range (n)]  #リスト入力  改行でa1 ... anのとき
# s=[list(map(str,list(input()))) for i in range(h)]  # 文字列の二次元配列入力
# s = [list(map(int, input().split())) for i in range(n)] # 数値の二次元配列入力
# a = b[:], a = [x[:] for x in b] # deepcopy
# chr(ord('a') + 1) # chrのインクリメント
# s.sort(key=lambda x: x[1], reverse=False) # 2番目の要素で昇順にソート（Trueなら降順）
#　

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

Submission status: Accepted

Solution code:
def main():
    from sys import stdin, setrecursionlimit
    #setrecursionlimit(10**9)
    #r = input()
    #n = int(input())
    #a, b = map(int, input().split())
    #s, y = input().split()
    #a = input().split()
    #a = [int(input()) for i in range(n)]
    #a = list(map(int, input().split()))
    #a = [list(map(int, input().split())) for i in range(n)]
    #a = [int(s) - 1 for s in input().split()]
    #l=[int(input()) for _ in range(int(input()))]
    #res = 0

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

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n,r = map(int,input().split())
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:
# coding: utf-8


def solve(*args: str) -> str:
    n, r = map(int, args[0].split())
    if n < 10:
        r = r + 100*(10-n)
    return str(r)


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

def main(N, R):

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


if __name__ == "__main__":

    answer = main(N, R)
    print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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())
ans = r if n >= 10 else 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:
def main():
    n, k = map(int, input().split())

    ans = 0

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

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

Submission status: Accepted

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

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:
import sys

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

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

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

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

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

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

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