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

import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        # for line in sys.stdin:
        #     lines.append(line)
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    (n, r) = [int(e) for e in lines[0].split(" ")]

    return (n, r)


def solve(n, r):
    
    inner_r = r 
    if n < 10:
       inner_r = r + 100 * (10 - n)
    

    result = inner_r 
        
    return result
    


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Submission status: Accepted

Solution code:
inpl = lambda: list(map(int,input().split()))
N, R = inpl()
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:
# -*- coding: utf-8 -*-

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


out = r + 100 * (10-n)

if n >= 10:
  out = r

print(out)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#solve
def solve():
    n, r = LI()
    if n >= 10:
        print(r)
    else:
        print(r + 100 * (10 - n))
    return


#main
if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Fri Jan 24 14:37:00 2020

@author: matsui
"""

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:
NR = input().split()

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

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

Submission status: Accepted

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

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:
#!/usr/bin/env python
from collections import deque, defaultdict
import bisect


def comb(a, b):
    result = 1
    for i in range(b):
        result *= (a - i) / (i + 1)
    return result


def main():
    #N = list(input().strip())
    N, R = map(int, input().split())

    penalty = max([0, 100 * (10 - N)])

    print(R + penalty)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

Solution code:
from sys import stdin

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

def main(N, R):
  innerRate = 0
  if N >= 10:
    innerRate = R
  else:
    innerRate = R + 100 * (10 - N)
  return innerRate

print(main(N, R))

Submission status: Accepted

Solution code:
import numpy as np

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

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

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
if N <10:
    Num = 10- N
    late = 100*Num
    internal_late = R+late
    print(internal_late)
elif N >=10:
    internal_late = R
    print(internal_late)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if k <= 10:
  print(n+100*(10-k))
else:
  print(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:
from sys import stdin
s = stdin.readline().rstrip().split()
n, r = int(s[0]), int(s[1])

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

Submission status: Accepted

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

if nr[0] < 10 :
    print(nr[1]+100*(10-nr[0]))
else:
    print(nr[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:
  ans = r + 100*(10-n)
  print(ans)
else:
  print(r)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    B = list(map(int, input().split()))
    # # [1,2,3]
    N = B[0]
    R = B[1]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

inrate = 0

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

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 表示レーティング

n, r = list(map(int, input().split()))
inner_rating = 0

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

print(inner_rating)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(R)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
n, r = [int(x) for x in stdin.readline().rstrip().split()]

#print(n, r)

rate = r

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

print(rate)

Submission status: Accepted

Solution code:
def inner_rate(num_participate, outer_rate):
    if(num_participate >= 10):
        return outer_rate
    else:
        return outer_rate + 100 * (10 - num_participate)

if __name__ == '__main__':
  num_participate, outer_rate = input().split()
  num_participate = int(num_participate)
  outer_rate = int(outer_rate)
  
  print(inner_rate(num_participate, outer_rate))

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

Submission status: Accepted

Solution code:

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

res = 0
if n >= 10:
    res = r

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

print(res)

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:
a = input().split()
a=[int(i) for i in a]
n,r=a[0],a[1]
if n>=10:
    b=r
else:
    b=r+1000-100*n
print(b)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(solve())

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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 = (int(i) for i in 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:
#!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: Accepted

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

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

Submission status: Accepted

Solution code:
# 入力が10**5とかになったときに100ms程度早い
import sys
read = sys.stdin.readline


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_matrix(H):
    '''
    H is number of rows
    '''
    return [list(map(int, read().split())) for _ in range(H)]


def read_map(H):
    '''
    H is number of rows
    文字列で与えられた盤面を読み取る用
    '''
    return [read()[:-1] for _ in range(H)]


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H, n_cols):
    '''
    H is number of rows
    n_cols is number of cols

    A列、B列が与えられるようなとき
    '''
    ret = [[] for _ in range(n_cols)]
    for _ in range(H):
        tmp = list(map(int, read().split()))
        for col in range(n_cols):
            ret[col].append(tmp[col])

    return ret


N, R = read_ints()

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

solve()

Submission status: Accepted

Solution code:
# coding:utf-8

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

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
# じょえチャンネル
# 高評価・チャンネル登録宜しくお願いします！
# https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ

import sys
from fractions import gcd
from itertools import groupby as gb
from itertools import permutations as perm
from itertools import combinations as comb
from collections import Counter as C
from collections import defaultdict as dd
sys.setrecursionlimit(10**5)
def y(f):
    if f:
        print('Yes')
    else:
        print('No')
def Y(f):
    if f:
        print('YES')
    else:
        print('NO')
def Z(f):
    if f:
        print('Yay!')
    else:
        print(':(')
def ispow(n):
    if int(n**.5)**2==n:
        return True
    return False

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

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    s = input().split(" ")
    n = int(s[0])
    r = int(s[1])
    if n >= 10:
        print(r)
    else:
        print(100 * (10 - n) + 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:
N, R = [int(x) for x in input().split()]

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
num=[int(w) for w in input().split()]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


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

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
k,n = map(int,input().split())
if k >= 10:
    print(n)
else:
    print(n+100*(10-k))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
inp = input()
N = inp.split()[0]
R = inp.split()[1]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
import itertools


n, r = map(int, input().split())
# p = list(map(int, input().split()))
# s = input().split()
# S = [int(input()) for i in range(int(n))]
i =0
if n < 10:
    i= 100*(10 -n)

print(r+i)

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:
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
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 < 10:
    print(r + (100 * (10 - n)))
else:
    print(r)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if n >= 10:
  print(r)

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

Submission status: Accepted

Solution code:
def main():
  n, r = map(int,input().split())
  n = min(n, 10)
  ans = r + 1000 - 100*n
  print(ans)
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(100*(10-N)+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 = [int(_) for _ in input().split()]
ans = 0
if N >= 10:
    ans = 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((100*(10-N))+R)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
number_list = [int(i) for i in input().split()]

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

Submission status: Accepted

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


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

Submission status: Accepted

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

ans = 0

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

point = 0

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

print(point)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    N, R = map(int,input().split())
    if N >= 10:
        print(R)
    elif N < 10:
        print(R + 100 * (10 - N))

if __name__ == "__main__":
    main()

Submission status: Accepted

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

rate = 0

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

print(rate)

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:
line = input().split(" ")
N, R = int(line[0]), int(line[1])

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# %%
stdin = open(0)

# %%
N,R = map(int, stdin.read().split())
if N >= 10:
    answer = R
else:
    answer = R + 100 * (10-N)

# %%
print(answer)

# %%

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

ir = 0

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

print(ir)

Submission status: Accepted

Solution code:


if __name__ == "__main__":
    N, R = map(int, input().split())

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

Submission status: Accepted

Solution code:
n, r = map(int, open(0).read().split())

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