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: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n, k = list(map(int, input().split(' ')))
print(n - 100 * (10 - min(10, k) * 2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = list(map(int,input().split()))
ans = []
if len(set(x)) == 1:
    print(0)
else: 
    for p in range(min(x), max(x)):
        meter = 0
        for xi in x:
            meter += pow((xi-p),2)
        ans.append(meter)
    print(min(ans))

Submission status: Wrong Answer

Solution code:
def E(N,R):
    while int(N)==N and int(R)==R:
        if 1<= N <= 100 and 0<= R <= 4111:
            if N > 10:
                print(R)
            else:
                K = 100 * (10 - N)
                print(R+K)
        break

Submission status: Wrong Answer

Solution code:
def E(N,R):
    while int(N)==N and int(R)==R:
        while 1<= N <= 100 and 0<= R <= 4111:
            if N > 10:
                print(R)
            else:
                K = 100 * (10 - N)
                print(R+K)

Submission status: Wrong Answer

Solution code:
def E(N,R):
    if int(N)==N and int(R)==R:
        if 1<= N <= 100 and 0<= R <= 4111:
            if N > 10:
                print(R)
            else:
                K = 100 * (10 - N)
                print(R+K)
        else:
            print('please input right numbers')
    else:
        print('please input an integer')

Submission status: Wrong Answer

Solution code:
def E(N,R):
    if int(N)==N and int(R)==R:
        if 1<= N <= 100 and 0<= R <= 4111:
            if N > 10:
                print(R)
            else:
                K = 100 * (10 - N)
                print(R+K)

Submission status: Wrong Answer

Solution code:
class E():
    def ee(N,R):
        if int(N)==N and int(R)==R:
            if 1<= N <= 100 and 0<= R <= 4111:
                if N > 10:
                    print(R)
                else:
                    K = 100 * (10 - N)
                    print(R+K)
            else:
                print('please input right numbers')
        else:
            print('please input an integer')

Submission status: Wrong Answer

Solution code:
class E():
    def ee(N,R):
        if int(N)==N and int(R)==R:
            if 1<= N <= 100 and 0<= R <= 4111:
                if N > 10:
                    M =R
                    print(M)
                else:
                    K = 100 * (10 - N)
                    M = R + K
                    print(M)
            else:
                print('please input right numbers')
        else:
            print('please input an integer')

Submission status: Wrong Answer

Solution code:
def E(N,R):
    if int(N)==N and int(R)==R:
        if 1<= N <= 100 and 0<= R <= 4111:
            if N > 10:
                M =R
                print(M)
            else:
                K = 100 * (10 - N)
                M = R + K
                print(M)

Submission status: Wrong Answer

Solution code:
def E(N,R):
    if int(N)/N == 1 and int(R)/R == 1:
        if 1<= N <= 100 and 0<= R <= 4111:
            if N > 10:
                M =R
                print(M)
            else:
                K = 100 * (10 - N)
                M = R + K
                print(M)
        else:
            print('please input right numbers')
    else:
        print('please input an integer')

Submission status: Wrong Answer

Solution code:
def E(N,R):
    if 1<= N <= 100 and 0<= R <= 4111:
        if N > 10:
            M =R
            print(M)
        else:
            K = 100 * (10 - N)
            M = R + K
            print(M)
    else:
        print('please input right numbers')

Submission status: Wrong Answer

Solution code:
def E(N,R):
    if 1<= N <= 100 and 0<= R <= 4111:
        K = 100*(10-N)
        if K < 0:
            M =R
            print(M)
        else:
            M = R + K
            print(M)
    else:
        print('please input right numbers')

Submission status: Wrong Answer

Solution code:
def E(N,R):
    if 1<= N <= 100 and 0<= R <= 4111:
        K = 100*(10-N)
        if K < 0:
            M =R
            print(M)
        else:
            M = R +K
            print(M)
    else:
        print('please input right numbers')

Submission status: Wrong Answer

Solution code:
def E(N,R):
    K = 100*(10-N)
    if K < 0:
        M =R
        print(M)
    else:
        M = R +K
        print(M)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
ans=0
while n>k:
  n/=n
  n=int(n)
  ans+=1

print(ans+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

Solution code:

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

stdin = sys.stdin

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

n, r = na()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
c, d = map(int, input().split())

print(d + 100 * (10-c))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
mod = 1e9+7
def add(a, b):
    c = a + b
    if c >= mod:
        c -= mod
    return c

def main():
    N, R = [int(x) for x in raw_input().split()]
    
    if N >= 10:
      return R
    else:
      return R - ((10 - N) * 100)
    
    

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print((lambda x:int(x[1])-max(0,100*(10-int(x[0]))))(input().split()))

Submission status: Wrong Answer

Solution code:
print((lambda x:int(x[0])-max(0,100*(10-int(x[1]))))(input().split()))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N,K=map(int,input().split())
A=0
while N>=K**A:
    A=A+1

print(A)

Submission status: Wrong Answer

Solution code:
N,K=map(int,input().split())
A=0
while N>=K**A:
    A=A+1

print(A)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(10**10):
  if n <= k**(i+1) -1:
    print(i+1)
    exit()

Submission status: Wrong Answer

Solution code:
n,r = map(int, raw_input().split(' '))
def f(n,r):
  if n >= 10:
    return r
  else:
    return r - 100 * (10 - n)
print f(n,r)

Submission status: Wrong Answer

Solution code:
n,r = map(int, raw_input().split(' '))
def f(n,r):
  if n < 10:
    return r
  else:
    return r - 100 * (10 - n)
print f(n,r)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import queue
from collections import defaultdict
 
def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):#階乗
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):#コンビネーション
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def printQueue(q):
	r=qb
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)
def dq():
	return queue.deque()
class UnionFind():
	def __init__(self, n):
		self.n = n
		self.parents = [-1]*n

	def find(self, x): # root
		if self.parents[x]<0:
			return x
		else:
			self.parents[x] = self.find(self.parents[x])
			return self.parents[x]

	def union(self,x,y):
		x = self.find(x)
		y = self.find(y)

		if x==y:
			return

		if self.parents[x]>self.parents[y]:
			x,y = y,x

		self.parents[x]+=self.parents[y]
		self.parents[y]=x

	def size(self,x):
		return -1*self.parents[self.find(x)]

	def same(self,x,y):
		return self.find(x)==self.find(y)

	def members(self,x): # much time
		root = self.find(x)
		return [i for i in range(self.n) if self.find(i)==root]

	def roots(self):
		return [i for i,x in enumerate(self.parents) if x<0]

	def group_count(self):
		return len(self.roots())

	def all_group_members(self):
		return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
	x = 1
	zero = "0"*n
	ans = []
	ans.append([0]*n)
	for i in range(2**n-1):
		ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
		x+=1
	return ans;
def arrsSum(a1,a2):
	for i in range(len(a1)):
		a1[i]+=a2[i]
	return a1

n,r = readInts()
k=n

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
for i in range(1,30):
    if n >= k**(i-1) and n < k**i:
        print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n,r = [int(i) for i in readline().split()]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import collections
import itertools as it
import math
#import numpy as np
 
#  = input()
#  = int(input())
#  = map(int, input().split())
#  = list(map(int, input().split()))
#  = [int(input()) for i in range(N)]
#
# c = collections.Counter()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
i=0


while n>=k**i:

    i+=1

else:
    print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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