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

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

N, R = MAP()

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

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

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 pin(type=int):
    return map(type,input().split())
    
#どっかで最悪計算量の入力データを用意する関数を作ろう？
"""
"""

#solution:
def dfs_search_2Dgrid(h,w):
    #if h,wが迷路の外->Noneを返す
    #if もう通った点->None
    #通った点のリスト？に記録
    #二次元グリッドなので4方向に進もうとしてみよう
    pass
#input
N,R=pin()
ans=0
k=10-N
k=0 if k<0 else k

print(R+100*k)

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

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

Submission status: Accepted

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

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

ans = 0

if a >= 10:
    ans = b

else:
    ans = b + 100*(10-a)

print(ans)

Submission status: Accepted

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

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

print(score)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Solution code:
import numpy as np

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def input_int():
    return map(int, input().split())

def one_int():
    return int(input())

def one_str():
    return input()

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

N,R = input_int()

ans = 0
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, raw_input().split())

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

print r

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline

n, r = [int(item) for item 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())

X = 10-N

if X > 0:
	print(R+100*X)
else:
	print(R)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import heapq
import copy
import numpy as np
from collections import deque

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

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

print(ret)

Submission status: Accepted

Solution code:
n, r = map(int,input().split())
if n >= 10:
    print(r)
else:
    print(str(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:
import sys
stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(R + (100 * (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,K = list(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 = 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())

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

print(str(IR))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(x)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n,r = map(int,input().split())
x = 100*(10-n)
if n<10:
    print(r+x)
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:
#S,T = input().split()
N, R= map(int,input().split())
#U = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#coding:utf-8

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num_attend, rate = map(int, input().split())

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

Submission status: Accepted

Solution code:

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


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)


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

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

    print(res)



main()

Submission status: Accepted

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

if __name__ == "__main__":
    resolve()

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    print(solve())

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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


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

print(ans)

Submission status: Accepted

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

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

print(str(R + ans))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


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


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

print(R)

Submission status: Accepted

Solution code:
if __name__=="__main__":
    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())
if n<10:
    ans=r+100*(10-n)
else:
    ans=r
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def read():
    N, R = list(map(int, input().strip().split()))
    return N, R

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

if __name__ == '__main__':
    inputs = read()
    print("{}".format(solve(*inputs)))

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# coding:utf-8

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

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

Submission status: Accepted

Solution code:

def resolve():
    # N = int(input())
    # S = input()
    N, R = map(int, input().split())
    # A = list(map(int, input().split()))

    # P = []
    # S = []
    # for i in range(N):
    #     pp, ss = map(int, input().split())
    #     P.append(pp)
    #     S.append(ss)

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

    print(R)

resolve()

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

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

# Check out my Youtube channel! https://www.youtube.com/channel/UCMOKVyAbTZOpKikTrX5dy_A

Submission status: Accepted

Solution code:
# Code for A - Beginner
# Use input() to fetch data from STDIN
[r, n] = [int(x) for x in input().split()]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, R = [int(i) for i in 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())
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:
#!/usr/bin/env python3

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:

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:
d = input().split(" ")
n = int(d[0])
r = int(d[1])
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+100*(10-n))
else:
    print(k)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# A
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)
    exit()
print(R + (10 - N) * 100)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    n, r = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

if N > 10:
    K = 10
else:
    K = N

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

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:
import sys
sys.setrecursionlimit(10 ** 7)

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n,r = map(lambda x: int(x), 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(100*(10-n)+r)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
import queue
import copy


#X = str(input()).split()
#a = [int(x) for x in input().split()]


NR = str(input()).split()
N = int(NR[0])
R = int(NR[1])
if(N>=10):
  ans = R
else:
  ans = R+100*(10-N)


print(ans)

Submission status: Accepted

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

print(inputs[1] if 10 <= inputs[0] else inputs[1] +100*(10-inputs[0]))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
import sys
import numpy as np

#n=int(sys.stdin.readline())
n,r=map(int,sys.stdin.readline().split())
#a=np.array([sys.stdin.readline().split() for i in range(n)],np.int64)

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

input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]

IN=lambda : map(int, input().split())
mod=1000000007

#+++++

def main():
	n,r = IN()
	ret = r + (100 * (10 - min(10, n)))
	
	print(ret)
	
	
#+++++
isTest=False

def pa(v):
	if isTest:
		print(v)
		
def input_clipboard():
	import clipboard
	input_text=clipboard.get()
	input_l=input_text.splitlines()
	for l in input_l:
		yield l

if __name__ == "__main__":
	if sys.platform =='ios':
		if input_method==input_methods[0]:
			ic=input_clipboard()
			input = lambda : ic.__next__()
		elif input_method==input_methods[1]:
			sys.stdin=open('inputFile.txt')
		else:
			pass
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Feb 22 20:51:06 2020

@author: H_Hoshigi
"""

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
#sys.setrecursionlimit(150000)


def solve(N: int, R: int):
    if N>10:
        print(R)
        return
    else:
        print(R+100*(10-N))
        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:
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().strip().split(' '))
print(R+100*max(0,10-N))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip() 

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

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