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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
[n, r] = map(int, input().rstrip().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:
a = list(map(int,input().split()))

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

Submission status: Wrong Answer

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

main()

Submission status: Wrong Answer

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

main()

Submission status: Wrong Answer

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

main()

Submission status: Wrong Answer

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

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def f(n, r):
  if n < 9:
    return r
  else:
    return 100 * (10 - n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
P = 10**9+7

ans = 1
nCl = 1
n1Cl = 1
for l in range(1,min(k+1,n)):
    nCl = nCl*(n+1-l)*pow(l,P-2,P)%P
    n1Cl = n1Cl*(n-l)*pow(l,P-2,P)%P
    ans = (ans+nCl*n1Cl)%P

print(ans)

Submission status: Wrong Answer

Solution code:
def check_trial(n):
  num = n.split()
  if int(num[0]) > 10:
    return True
  else:
    return False
def in_rating(n, result):
  if result:
    num = n.split()
    out_rating = int(num[1]) + 100*int(num[0])
    return out_rating
  else:
    num = n.split()
    out_rating = int(num[1]) + 100*(10-int(num[0]))
    return out_rating
def main():
  n=input()
  result = check_trial(n)
  print(in_rating(n, result))
main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
NandK = input()
NandK = NandK.split(' ')
N = int(NandK[0])
K = int(NandK[1])
if N >= 10:
    print(K)
else:
    print(100 * (10 - K))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

i = list(map(int, input().split()))
N = i[0]
R = i[1]

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
i = input()
print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

    if N < 10:
        print(R)
    else:
        R = R + 100 * (10 - N)
        print(R)
 
if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

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

    if N < 10:
        print(R)
    else:
        R = R - 100 * (10 - N)
        print(R)
 
if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

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

    if N >= 10:
        print(R)
    else:
        R = R - 100 * (10 - N)
        print(R)
 
if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

Solution code:
N, R = list(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*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

from functools import reduce
table_size = 510000
# table_size = 5100000
mod = 10**9+7


# Combination の計算を最適化する必要がある?
# def nCr(n, r):
#     numerator = reduce(lambda x, y: x * y % mod, range(n, n - r, -1), 1)
#     denominator = reduce(lambda x, y: x * y % mod, range(1, r + 1), 1)
#     return numerator * pow(denominator, mod-2, mod) % mod

class Combination:
    def __init__(self):
        self.fac = [None for _ in range(table_size)]
        self.finv = [None for _ in range(table_size)]
        self.inv = [None for _ in range(table_size)]

        self.fac[0] = self.fac[1] = 1
        self.finv[0] = self.finv[1] = 1
        self.inv[1] = 1

        for i in range(2, table_size):
            self.fac[i] = self.fac[i - 1] * i % mod
            self.inv[i] = mod - self.inv[mod % i] * (mod // i) % mod
            self.finv[i] = self.finv[i - 1] * self.inv[i] % mod

    def nCr(self, n, r):
        if n < r:
            return 0
        if n < 0 or r < 0:
            return 0

        return self.fac[n] * (self.finv[r] * self.finv[n - r] % mod) % mod


n, k = map(int, input().split())
# n, k = 3, 2  # Expected: 10
# n, k = 200000, 1000000000  # Expected: 607923868
# n, k = 15, 6  # Expected: 22583772

c = Combination()

# この分岐がよくわかっていない
if n < k:
    print(c.nCr(2 * n - 1, n))
else:
    total = 0
    for i in range(k + 1):
        total += c.nCr(n - 1, i) * c.nCr(n, i)
        total %= mod

    print(total)

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

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# int
# A = list(map(int, input().split()))
# string
# S = input().split()

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

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

Submission status: Wrong Answer

Solution code:
# int
# A = list(map(int, input().split()))
# string
# S = input().split()

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

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
n,k = map(int,stdin.readline().rstrip().split())
if n >= 10:
    print(k)
else:
    print(n*100+k)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(rate)

Submission status: Wrong Answer

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

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

print(rate)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import *

input = stdin.readline
lmi = lambda: list(map(int, input().split()))
mi = lambda: map(int, input().split())
si = lambda: input().strip('\n')
ssi = lambda: input().strip('\n').split()


n, r = mi()
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(10-R/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, 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 (100 * (10 - N)))

Submission status: Wrong Answer

Solution code:
N, R = map(int,input().split())
if N >= 10:
	print(N)
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,K=map(int, input().split()) 
for i in range(9000):
    if K**i<=N<K**(i+1):
        print(i+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input().split()

K = int(s[0])
N = int(s[1])

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

c = a*b

if c % 2 ==0:
  print("Even")
else:
  print("Odd")

Submission status: Wrong Answer

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

c = a*b

if c % 2 ==0:
  print ("Even")
else:
  print("Odd")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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())
print(type(N), N, R)

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

Submission status: Wrong Answer

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

N = i[0]
R = i[1]

if N<= 10 :
  I = R

elif N >10 :
  I = R + 100*(10-N)

print(I)

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
inp=input().split()

n=int(inp[0])
r=int(inp[1])

if n<10: print(r)

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

Submission status: Wrong Answer

Solution code:
InputValue = input().split(' ')

print(InputValue[0])

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

if 0<=R<=4111 and 1<=N<=100:
    if N>=10:
        IR = R
        print(IR,end='\n')
    elif N<10:
        IR = R + 100*(10-N)
        print(IR,end='\n')

Submission status: Wrong Answer

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

print(L)

Submission status: Wrong Answer

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

print(L)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

i = 0
while n > 0:
    n = n - k**i
    if n < 0:
        break
    i += 1

print(i)

Submission status: Wrong Answer

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

def calc(n, k):
  i = 1
  tmp = n
  while (tmp > k):
    tmp = tmp - k**i
    i += 1
    return i

print(str(calc(n,k)))

Submission status: Wrong Answer

Solution code:
n,r = map(int,input().split())
if 10<=n :
  print(r)
elif 1<= n <10:
  print(r+100*(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,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:
x,y=map(int,input().split())
z=100*(10-x)
a=y+z
print(a)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def resolve():
    n = int(input())
    x = list(map(int, input().split()))
    x.sort()
    xx = [0 for i in range(n)]
    for i,j in enumerate(x):
        xx[i] = j**2
    minp = 100
    p = 0
    for i in range(max(x)):
        k = i*(n*i - 2*sum(x))
        if k < minp:
            minp = k
            p = i
    print(sum(xx)-2*p*sum(x)+n*(p**2))

Submission status: Wrong Answer

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

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

print(inside)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = 2
R = 2919
if N<=10:
  R = 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())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import fractions

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors

def ValueToBits(x,digit):
    res = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        res[i]=now%2
        now = now >> 1
    return res

def BitsToValue(arr):
    n = len(arr)
    ans = 0
    for i in range(n):
        ans+= arr[i] * 2**i
    return ans

def ValueToArray10(x, digit):
    ans = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        ans[digit-i-1] = now%10
        now = now //10
    return ans

def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p
'''
p = 10 ** 9 + 7
N = 10 ** 6 + 2
fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用

for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)
    
def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p
'''


#a = list(map(int, input().split()))

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def calc(n, r):
  if n >= 10:
    return n
  else:
    return n - 100*(10-r)

print(str(calc(n, r)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

Solution code:
from sys import stdin


def get_result(data):
    N, R = data
    return int(R + 100 * (10 - N))

if __name__ == '__main__':
    data = list(map(int, stdin.readline().split(' ')))
    result = get_result(data)
    print(result)

Submission status: Wrong Answer

Solution code:
NK = input().split()

N = int(NK[0])
K = int(NK[1])

ans = 1
while True:
    if N > K**ans:
        ans += 1
    else:
        break
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,K = map(int, input().split())
counter = 0
K_ = 1
i=True
while i==True:
  K_ = K_ * K
  if N < K_:
    print(counter)
    i=False
  counter += 1

Submission status: Wrong Answer

Solution code:
from sys import stdin


def get_result(data):
    print(data)
    N, R = data
    return int(N + 100 * (10 - R))

if __name__ == '__main__':
    data = list(map(int, stdin.readline().split(' ')))
    result = get_result(data)
    print(result)

Submission status: Wrong Answer

Solution code:
N,K = map(int, input().split())
counter = 0
K_ = 1
i=True
while i==True:
  K_ = K_ * K
  if K < K_:
    print(counter)
    i=False
  counter += 1

Submission status: Wrong Answer

Solution code:
N,R=(int(i)for i 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:
    a = 100 * (10 - n)
    b = r - a
    if b >=0:
        print(b)
    else:
        print(0)
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:
input = input().split(" ")
if int(input[0]) < 10:
  c = 10 - int(input[0])
  r = 100 * int(c)
  res = int(input[1]) + int(r)
  print(res)
elif int(input[0]) > 10:
  print(input[1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

if N < 10:
  A = 100*(10-N)
  
  print(R-A)
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:
from sys import stdin,stdout
Pi = lambda x: stdout.write(str(x) + '\n')
S = lambda x: x*(x+1) // 2
R = lambda:stdin.readline()
Ri = lambda x:map(int,x.split())

def main():  	
	for x in stdin:
		a,b =  Ri(x)
		if a<10:a = 10 - a
		else:a = 10
		Pi(b+(100*a))
				
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

      print(R + A)

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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:
N,K = [int(i) for i in input().split()]
print(K-(100*(10-N)))

Submission status: Wrong Answer

Solution code:
from sys import stdin,stdout
Pi = lambda x: stdout.write(str(x) + '\n')
S = lambda x: x*(x+1) // 2
R = lambda:stdin.readline()
Ri = lambda x:map(int,x.split())

def main():  	
	for x in stdin:
		a,b =  Ri(x)
		if a<10:a = 10 - a
		Pi(b+(100*a))
				
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
#!python3.4
# -*- coding: utf-8 -*-
# abc156/abc156_a
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    N, R = i2nn()
    if N < 10:
        r = R - 100 * (10 - N)
        print(r if r > 0 else 0)
    else:
        print(R)
    return

main()

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:
i = input().split()
n = int(i[0])
r = int(i[1])

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