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: Wrong Answer

Solution code:
N,R = list(map(int,input().split()))  
if N >= 10:
    print("{}".format(100 - (10 - N)))
else:
    print(R)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
  n, r = map(int,input().split())
  ans = r + 1000 - 100*n
  print(ans)
main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
N,R = map(int, input().split())
if N < 10:
	R = R - 100 * (10 - N )
     
print(R)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
s = stdin.readline().rstrip().split()
n, r = int(s[0]), int(s[1])
print(r+100*(10-n))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# print('input >>')
N, R = map(int,(input().split()))

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

# print('-----output-----')
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a = input().split()
print(int(a[1]) + 100*(10-int(a[0])))

Submission status: Wrong Answer

Solution code:
a=input().split()
nm=[]
for i in range(2):
  b=int(a[i])
  nm.append(b)
if nm[0]<9:
  nm[1]+=(100*(10-nm[0]))

print(nm[1])

Submission status: Wrong Answer

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

if n < 10:
  a = 100 * (10 - 2)
else:
  a = 0
print(display_rating + a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import copy
from copy import deepcopy
import sys
import fractions
import numpy as np
from functools import reduce
import statistics
import heapq

# input = sys.stdin.readline
# sys.setrecursionlimit(10**6)

# ===FUNCTION===

def getInputInt():
    inputNum = int(input())
    return inputNum


def getInputListInt():
    outputData = []
    inputData = input().split()
    outputData = [int(n) for n in inputData]

    return outputData


def getSomeInputInt(n):
    outputDataList = []
    for i in range(n):
        inputData = int(input())
        outputDataList.append(inputData)

    return outputDataList


def getSomeInputListInt(n):
    inputDataList = []
    outputDataList = []
    for i in range(n):
        inputData = input().split()
        inputDataList = [int(n) for n in inputData]
        outputDataList.append(inputDataList)

    return outputDataList


# ===CODE===

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
def main():
    N,R = map(int,input().split())
    if N >= 10:
        print(R)
        return
    else:
        print(R-(100*(10-N)))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
def main():
    N,R = map(int,input().split())
    if N >= 10:
        print(R)
        return
    else:
        print(100*(10-N))



if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if n >= 10:
    print(r)

else:
    in_r = 100 * (10-n)
    print(in_r)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
N,R = [int(x) for x in stdin.readline().rstrip().split()]
print(R + (100*(10-N)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,r=map(int,input().split())
if n<10:
    r+=800
print(r)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
 
stdin = sys.stdin
inf = 2 << 60
mod = 1000000008
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

n, r = na()

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

Submission status: Wrong Answer

Solution code:
n,r = [int(x) for x in input().split()]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!python3.4
# -*- coding: utf-8 -*-
# abc156/abc156_a
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    N, R = i2nn()
    if N < 10:
        print(R - 100 * (10 - N))
    else:
        print(R)
    return

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = R

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

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
N,R = [int(x) for x in stdin.readline().rstrip().split()]
print(R - (100*(10-N)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# ABC156a


def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)
    # 再帰関数を使わない限りPypyで出すこと

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Time Limit Exceeded

Solution code:
N,K = map(int,input().split())
for i in range(1,10**10):
    if K**i <= N < K**(i+1):
        print(i+1)
        break

Submission status: Time Limit Exceeded

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

ans = 0
count = 1

while(True):
  if K**count <= N < K**(count+1):
    ans = count
    break

  count += 1

print(ans+1)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if N >= 10:
    naibu = hyoji
else:
    naibu = hyoji + (100 * (10 - N))

print(naibu)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
# N回参加、表示レーティングR
if N >= 10:
  rate = R
else:
  rate = R + 100 * (10 - N)
print(rate)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

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:
import os, sys, re, math

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

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

Submission status: Accepted

Solution code:
k, n = list(map(int, input().split(' ')))
print(n + 100 * (10 - min(10, k)))

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())
print(r + 100 * max(0, (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:
from __future__ import division, print_function
 
import os,sys
from io import BytesIO, IOBase
import math
 
if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip
 
 
def ii():  return int(input())
def si():  return input()
def mi():  return map(int,input().strip().split(" "))
def msi(): return map(str,input().strip().split(" "))
def li():  return list(mi())
 
def dmain():
    sys.setrecursionlimit(1000000)
    threading.stack_size(1024000)
    thread = threading.Thread(target=main)
    thread.start()
    
#from collections import deque, Counter, OrderedDict,defaultdict
#from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace
#from math import log,sqrt,factorial,cos,tan,sin,radians
#from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
#from decimal import *
#import threading
#from itertools import permutations
#Copy 2D list  m = [x[:] for x in mark] .. Avoid Using Deepcopy
 
abc='abcdefghijklmnopqrstuvwxyz'
abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod=1000000007
#mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]
def getKey(item): return item[1] 
def sort2(l):return sorted(l, key=getKey,reverse=True)
def d2(n,m,num):return [[num for x in range(m)] for y in range(n)]
def isPowerOfTwo (x): return (x and (not(x & (x - 1))) )
def decimalToBinary(n): return bin(n).replace("0b","")
def ntl(n):return [int(i) for i in str(n)]
def ncr(n,r): return factorial(n)//(factorial(r)*factorial(max(n-r,1)))
 
def ceil(x,y):
    if x%y==0:
        return x//y
    else:
        return x//y+1
 
def powerMod(x,y,p):
    res = 1
    x %= p
    while y > 0:
        if y&1:
            res = (res*x)%p
        y = y>>1
        x = (x*x)%p
    return res
 
def gcd(x, y):
    while y:
        x, y = y, x % y
    return x
    
def isPrime(n) : # Check Prime Number or not 
    if (n <= 1) : return False
    if (n <= 3) : return True
    if (n % 2 == 0 or n % 3 == 0) : return False
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
    return True
 
 
 
def read():
    sys.stdin  = open('input.txt', 'r')  
    sys.stdout = open('output.txt', 'w') 
 
 
def main():
    
              
    #for _ in range(ii()):
    n, r = map(int, input().split())
    if n >= 10:
        print(r)
    else:
        print(100 * (10 - n) + r)
    
    
    
    
 
# region fastio
# template taken from https://github.com/cheran-senthil/PyRival/blob/master/templates/template.py
 
BUFSIZE = 8192
 
 
class FastIO(IOBase):
    newlines = 0
 
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
 
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
 
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
 
 
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
 
 
def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()
 
 
if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
 
input = lambda: sys.stdin.readline().rstrip("\r\n")
 
# endregion
 
 
if __name__ == "__main__":
    #read()
    main()
    #dmain()
 
# Comment Read()

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:
l,n=map(int,input().split())
if l<=10:
    p=100*(10-l)
    print(p+n)
else:
    print(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:
#!/usr/bin/env python3
n,r=map(int,input().split())
ans=r
if n>=10:
    print(r)
else:
    print(r+100*(10-n))

Submission status: Accepted

Solution code:
from sys import stdin
input = lambda: stdin.readline().rstrip()
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+100*(10-N))
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())

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:
m = input("")
list = m.split(" ")
if eval(list[0])<10:
    print(eval(list[1])+100*(10-eval(list[0])))
if eval(list[0])>=10:
    print(eval(list[1]))

Submission status: Accepted

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

Submission status: Accepted

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


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

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

print(r)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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