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 = [int(i) for i in input().split()]
res = r if n >= 10 else r + 100*(10-n)
print(res)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- 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:
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:
inputs = input().split()
n = int(inputs[0])
r = int(inputs[1])
if n >= 10:
  print(r)
else:
  print((100*(10-n))+r)

Submission status: Accepted

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

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

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

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def _ia(): return [int(x) for x in sys.stdin.readline().strip().split()]


n, r = _ia()
s = 100*(10-n)
if s<0: print(r)
else: print(r+s)

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()
b = int(a[0])
c = int(a[1])

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

Submission status: Accepted

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

x = 0

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

Submission status: Accepted

Solution code:
#python3

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:
#!/usr/bin/env python3
import sys


def solve(N: int, R: int):
    if 10 <= N:
        return R
    else:
        return 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
    print(solve(N, R))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(rat)

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

if __name__ == '__main__':
        resolve()

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 = input()
arr = [int(i) for i in N.split(' ')]
k = 0
result = 0
if arr[0]<10:
	k = 100 * (10-arr[0])
	result = arr[1] + k
else:
	result = arr[1]
print(result)

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline


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

    else:
        print(r)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
[N,R] = [int(s) for s in sys.stdin.read().split()] #リスト作成
print(R+100*max(0,10-N))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n,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= 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("{}".format(R+100*(10-N)))
else:
  print("{}".format(R))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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


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

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

Submission status: Accepted

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

print(nm[1])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#A - Beginner

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

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

Submission status: Accepted

Solution code:
n, r = [int(each) for each in 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>9:
    print(k)
else:
    print(k+1000-100*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=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(str(r))
else:
  print(r+(100*(10-n)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

NR=np.array(input().split(),dtype=np.int32)

N=NR[0]
R=NR[1]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def begginer(k, x):
    print(x + 100 * (10 - min(10, k)))

if __name__ == "__main__":
    import sys
    in_str = []
    for line in sys.stdin:
        in_str.append(line)
    k, x = [int(_) for _ in in_str[0].split(' ')]
    begginer(k, x)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
def input():
  return sys.stdin.readline()[:-1]


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 = lambda: stdin.readline()[:-1]
    N, R = map(int, input().split())

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


main()

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

Submission status: Accepted

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

print(rate)

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

Submission status: Accepted

Solution code:
import sys

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

if __name__ == '__main__':
    N, R = map(int, sys.stdin.readline().strip().split(" "))
    solve(N, R)

Submission status: Accepted

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

print(rating)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


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


def read_str():
    return input()


def main():
    N, R = read_int_list()
    if N >= 10:
      R == N 
    else:
      R = 100 * (10 - N) + R
    print(R)


main()

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

n,r = (int(i) for i in input().split())

if n >=10:
    print(r)
    sys.exit()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# vim:fenc=utf-8 ff=unix


def solv(N, R):
    if N >= 10:
        return R
    else:
        # R = ans - 100 * (10 - N)
        # ans = R + 100 * (10 - N)
        return R + 100 * (10-N)


if __name__ == "__main__":

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == '__main__' :
    main()

Submission status: Accepted

Solution code:
def Main(N, R):
    if N >= 10:
        return R
    else:
        return R + 100*(10-N)

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

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(R + 100 * (10 - min(10, N)))

Submission status: Accepted

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

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:

def main():
    N,R=map(int,open(0).read().split())
    L=0
    if N<10:
        L=100*(10-N)+R
        
    else:
        L=R

    print(L)
main()

Submission status: Accepted

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

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

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:
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:
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
from fractions import gcd
from copy import deepcopy
import math
import queue
#import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
sys.setrecursionlimit(1000000) 
  
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

def factorial(i):
    if i == 1:
        return 1
    else:
        return i*factorial(i-1)
 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[py] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)




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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
import itertools
import statistics
#n = int(input())
#n, d = list(input().split())
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:
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:
def main(n,r):
    if n >= 10:
        return r
    else:
        return r + (100 * (10 - n))

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n, r = map(int, input().split())

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

def main():
    tmp = input().replace('\n','').split(' ')
    n = int(tmp[0])
    r = int(tmp[1])
    if n >= 10:
        print(r)
    else:
        res = r + 100 * (10-n)
        print(res)
if __name__ == '__main__':
    input = sys.stdin.readline
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import socket

hostnames = ['N551J', 'F551C', 'X553M']
input_file = 'a1.in'
if socket.gethostname() in hostnames:
    sys.stdin = open(input_file)


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


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


def read_str_list():
    return input().split()


def read_str():
    return input()


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


def main():
    res = solve()
    print(res)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
# AtCoder 156回
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 = map(int,input().split())

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

print(IR)

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:
#from collections import Counter
#= int(input())
#= map(int, input().split())
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:
    res = r + (100 * (10 - n))
else:
    res = r

print(res)

Submission status: Accepted

Solution code:
from collections import *
from itertools import *
from bisect import *
import copy

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

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

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

ans = R+100*(10-N)
if N>=10:
    print(R)
else:
    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())
r = 100 * (10 - N)
if N >= 10 :
    print(R)
else :
    print(R + 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 10 <= n:
    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
from io import StringIO
import unittest

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

    if n>=10:
        print(str(r))
        return

    print(str(r+100*(10-n)))

    return

resolve()

Submission status: Accepted

Solution code:
#!python3

iim = lambda: map(int, input().rstrip().split())

def resolve():
    N, R = iim()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if N<10:
    print(int(r+1000-100*N))
else:
    print(r)

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
# from fractions import gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    N, R = MAP()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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