Problem:


Score : 100 points

Problem Statement

Takahashi is a member of a programming competition site, ButCoder.

Each member of ButCoder is assigned two values: Inner Rating and Displayed Rating.

The Displayed Rating of a member is equal to their Inner Rating if the member has participated in 10 or more contests. Otherwise, the Displayed Rating will be their Inner Rating minus 100 \times (10 - K) when the member has participated in K contests.

Takahashi has participated in N contests, and his Displayed Rating is R. Find his Inner Rating.

Constraints

All values in input are integers.

1 \leq N \leq 100

0 \leq R \leq 4111

Input

Input is given from Standard Input in the following format:

N R

Output

Print his Inner Rating.

Sample Input 1

2 2919

Sample Output 1

3719

Takahashi has participated in 2 contests, which is less than 10, so his Displayed Rating is his Inner Rating minus 100 \times (10 - 2) = 800.

Thus, Takahashi's Inner Rating is 2919 + 800 = 3719.

Sample Input 2

22 3051

Sample Output 2

3051



Sample input:
2 2919


Sample output:
3719

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
    n, r = map(int, input().split(" "))
    print(r+100*(10-min(10,n)))
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

from  collections import defaultdict
import bisect
def main():
    N, R = MI()
    if N >= 10:
        print(R)
    else:
        print(R + 1000 - 100 * N)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

rate = max(r+100*(10-n),r)

print(rate)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ri = lambda S: [int(v) for v in S.split()]
def rii(): return ri(input())

N, R = rii()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A
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 = map(int, input().split())
 
# min()でまとめて書ける
print(R + 100 * (10-min(10, N)))

Submission status: Accepted

Solution code:
N, R = map(int, input().split())
 
# max()でまとめて書ける
print(R + 100*max(0, 10-N))

Submission status: Accepted

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

# max()でまとめて書ける
print(max(R, 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(1000-100*n+r)

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

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

Submission status: Accepted

Solution code:
import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())


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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

Submission status: Accepted

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

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

N, R = map(int, sys.stdin.readline().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:
    print(R)
else:
    print(R+100*(10-N))

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  #空白あり
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし


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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n = N
r = R

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

print(o)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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())
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())
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
# Your code here!

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

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, R = list(map(int, input().rstrip().split()))
D = R
if N < 10:
    v = 100 * (10 - N)
    # R = X - v
    D = R + v

print(D)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

print(ans)

Submission status: Accepted

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

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

IR=100*(10-N)+R

print(R if N>=10 else IR)

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(str(b))
else:
  print(str(b+100*(10-a)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
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:
    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:
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
# ABC156
# A Biginner
# Nが参加回数　Rは表示レーティング　内部レーティングを求める
n, r = map(int, input().split())
if n >= 10:
    print(r)
else:
    x = r + (100 * (10 - n))
    print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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:

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())
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:
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:
    K = 10
else:
    K = N

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

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

if '__main__' == __name__:
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Beginner
def getInnerRating(N, R):
    return R + (100 * (10 - min(10, N)))

N, R = map(int, input().split())
ans = getInnerRating(N, R)
print(ans)

Submission status: Accepted

Solution code:
import sys

N, R = map(int, sys.stdin.buffer.read().split())
rate = R

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

print(rate)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,r=map(int,input().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(100 * (10 - 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:
def solve():
    N,R = [int(i) for i in input().split()]
    if N >= 10:
        print(R)
    else:
        print(R+100*(10-N))

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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


def main():
    solve()


if __name__ == '__main__':
    main()

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)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#template
def inputlist(): return [int(j) for j in input().split()]
def listinput(): return input().split()
#template
N,R = inputlist()
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 + (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 =map(int,input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n,r = inpm()
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:
    Inner_Rate=R
else:
    Inner_Rate=R+100*(10-N)

print(Inner_Rate)

Submission status: Accepted

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

Submission status: Accepted

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

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

def main():

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

    if N >= 10:
        ans = R

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, r = map(int, input().split())
print(r + max(0, 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
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')


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


def main():

    sys.setrecursionlimit(10 ** 6)

    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(f'{solve(N, R)}')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#l = list(map(int, input().split()))

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

elif n >= 10:
    print(r)

Submission status: Accepted

Solution code:
# abc156_a.py
# https://atcoder.jp/contests/abc156/tasks/abc156_a

# A - Beginner /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# 高橋君はプログラミングコンテストサイト「ButCoder」の会員です。
# ButCoder の会員には 2つのレーティング 内部レーティング と 表示レーティング が割り当てられています。
# 表示レーティングは、その会員のコンテスト参加回数が 10以上のときは内部レーティングに等しく、そうでないときは、
# 会員のコンテスト参加回数を K として、内部レーティングから 100×(10−K)を引いたものになります。
# 高橋君のコンテスト参加回数が Nで表示レーティングが Rであるとき、高橋君の内部レーティングを求めてください。

# 制約
#     入力は全て整数である
#     1≤N≤100
#     0≤R≤4111

# 入力
# 入力は以下の形式で標準入力から与えられる。
# N R

# 出力

# 高橋君の内部レーティングを出力せよ。

# 入力例 1
# 2 2919

# 出力例 1
# 3719

# コンテスト参加回数が 10より少ない 2 であるため、内部レーティングから 100×(10−2)=800を
# 引いたものが高橋君の表示レーティングになっています。
# よって高橋君の内部レーティングは 2919+800=3719となります。

# 入力例 2
# 22 3051

# 出力例 2
# 3051


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    # N = int(lines[0])
    N, R = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

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

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['2 2919']
        lines_export = [3719]
    if pattern == 2:
        lines_input = ['22 3051']
        lines_export = [3051]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def beginner():
    # 入力
    N, R = map(int, input().split())
    # 処理
    if N >= 10:
        return R
    else:
        return R + 100 * (10 - N)

result = beginner()
print(result)

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

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

Submission status: Accepted

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

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