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

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

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:

data = list(map(int, input().split()))
k = data[0]
r = data[1]

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

Submission status: Accepted

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

Submission status: Accepted

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

#100×(10−K)

from collections import defaultdict

(n, r) = [int(s) for s in input().split()]

ans = 0

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(rate)

Submission status: Accepted

Solution code:
line = input().rstrip().split(' ')
n = int(line[0])
k = int(line[1])

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

Submission status: Accepted

Solution code:
N, I=input().split()
ans=I

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

Submission status: Accepted

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

Submission status: Accepted

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


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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def strr():
 a=raw_input()
 return a
def sstrr():
 a=raw_input().split()
 return a
def intt():
 a=int(raw_input())
 return a
def iintt():
 a=[int(s) for s in raw_input().split()]
 return a
def nestt(t):
 a=[raw_input().split() for s in range(t)] 
 return a

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

Submission status: Accepted

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

import sys


def main():
    input = sys.stdin.readline
    N, R = map(int, input().split())
    if N >= 10:
        rate = R
    else:
        rate = R + 100 * (10 - N)
    print(rate)


if __name__ == "__main__":
    main()

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

def main():

    input = stdin.readline

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

ans = ''

if 10 <= n :

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

print(ans)

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

Submission status: Accepted

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

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

print(n)

Submission status: Accepted

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

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

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


result = calculate(N,R)
print(result)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input().split(" ")

N=int(s[0])
R=int(s[1])

ans=R

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = list(map(int, input().split()))
count, rate = n[0], n[1]

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

print(rate)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def I(): return int(input())
def MI(): return map(int, input().split())
def LMI(): return list(map(int, input().split()))


N, R = MI()
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:
input_line = input()
NR = input_line.split(" ")

N = int(NR[0])
R = int(NR[1])
result = 0

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

print(result)

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

Submission status: Accepted

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

Submission status: Accepted

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

if n >= 10:
    print(r)

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

Submission status: Accepted

Solution code:
first_line = [int(x) for x in input().split(" ")]

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

Submission status: Accepted

Solution code:
[N,R] = list(map(int,input().split()))
if N>=10:
    I=R  #内部レーティング
    
else:
    I=R+100*(10-N)
print(I)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
list=input().split()
if int(list[0])>=10:
  print(int(list[1]))

else:
  print(int(list[1])+100*(10-int(list[0])))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

a=max(0,10-X)
print(Y+100*a)

Submission status: Accepted

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

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:
# ABC156 A

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 = [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 + 1000 - 100 * n)

Submission status: Accepted

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

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

print(rate)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    n,r=MI()
    if n>=10:ans=r
    else:ans=r+1000-100*n
    print(ans)
    
main()

Submission status: Accepted

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

if N >= 10:
    print("{}".format(R))
else:
    print("{}".format(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:
# coding: utf-8
# Your code here!

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
#S = str(input())
N, R = map(int, input().split())

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

Submission status: Accepted

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

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

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

print(R)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
raw_input = input()
l = raw_input.split()
N = int(l[0])
R = int(l[1])

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

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    in_tmp = [int(i) for i in input().split(" ")]
    N = in_tmp[0]
    R = in_tmp[1]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    R = int(next(tokens))  # type: int
    solve(N, R)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

def main():
  n, r = map(int, input().strip().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())
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):
    R = R + 100 * (10 - N)
else:
    pass

print("%d" % 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=list(map(int, input().split()))
K=10-n[0]
if n[0]>=10:
    print(n[1])
else:print(n[1]+100*K)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = input().split(" ")
if int(inp[0]) >= 10:
  print(int(inp[1]))
else:
  print(int(inp[1]) + 100 * (10 - int(inp[0])))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A  >= 10:
    print(B)
elif 0 <= A <= 9:
    B = B + (100 * (10 -A))
    print(B)

Submission status: Accepted

Solution code:
N,R = list(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+1000-100*N)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, R = map(int, input().split())			# "5 7" -> ["5", "7"] -> 5, 7 => N=5,K=7

ans=R

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

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

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

    
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: 	A
# CreatedDate:  2020-02-22 21:00:25 +0900
# LastModified: 2020-02-22 21:05:21 +0900
#


import os
import sys
import numpy as np


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def calc(k, R):
    if k < 10:
        return R + 100 * (10 - k)
    return R

if __name__ == '__main__':
    k, R = map(int, input().split())
    print(calc(k, 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 = list(map(int,input().split()))
ans = 0
if(n < 10):
    ans = r+100*(10-n)
if(n >= 10):
    ans = r
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
time_line = input().rstrip().split(" ")
time_a = int(time_line[0])
time_b = int(time_line[1])

if time_a<10:
    hosei=(10-time_a)*100
    
else:
    hosei=0

kekka=time_b+hosei
print(kekka)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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("{}".format(r+100*(10-n)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
import sys

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

Submission status: Accepted

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

ans = R

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

print(ans)

Submission status: Accepted

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

if N >= 10:
    print(R)
else:
    K = 100*(10-N)
    print("{}".format(R+K))

Submission status: Accepted

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

print(R)

Submission status: Accepted

Solution code:
from collections import Counter
import sys

sys.setrecursionlimit(10 ** 6)

mod = 1000000007
inf = int(1e18)

dx = [0, 1, 0, -1]
dy = [1, 0, -1, 0]


def inverse(a):
    return pow(a, mod - 2, mod)


def usearch(x, a):
    lft = 0
    rgt = len(a) + 1
    while rgt - lft > 1:
        mid = (rgt + lft) // 2
        if a[mid] <= x:
            lft = mid
        else:
            rgt = mid
    return lft


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

main()

Submission status: Accepted

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

Submission status: Accepted

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

print(X)

Submission status: Accepted

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

N = int(N)
R = int(R)

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

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