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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

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=[int(i) for i 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())

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,K = map(int,input().split())
N += 1
ans = 1
for i in range(1000000): 
	if K**(ans) < N:
		ans += 1
	else:
		print(ans)
		break

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:
n,r = (int(x) for x 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())
ans = n
if n < 10:
    ans = r + 100*(10-n)
print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N, R = map(int, input().split())
if N < 10:
    print(N + R)
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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, R = MAP()

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

Submission status: Wrong Answer

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

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:
import sys
stdin = sys.stdin

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


n,r = na()

print(r-max(0,100*(10-n)))

Submission status: Wrong Answer

Solution code:
N,K = map(int,input().split())
for i in range(1,10):
    if K**i <= N < K**(i+1):
        print(i+1)
        break

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
#--Beginner
#1行1列
number, rate = map(int, input().split())

if (number < 10):
  print(rate+(100*(10-number)))
elif (number <= 10):
  print(rate)

Submission status: Wrong Answer

Solution code:
N,K=[int(s) for s in input().split()]
if N<10:
  print(K-(10-N)*100)
else:
  print(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:
inp=list(map(int,input().strip().split()))[:2]
n,r=inp[0],inp[1]
if(n < 9):
  print(100*(10-n)+r)
else:
  print(r)

Submission status: Wrong Answer

Solution code:
inp=list(map(int,input().strip().split()))[:2]
n,r=inp[0],inp[1]
if(n < 9):
  print(100*(10-r))
else:
  print(r)

Submission status: Wrong Answer

Solution code:
from sys import stdin

N, R = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: 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:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

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: 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)
  
elif N < 10 :
  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:
import sys

n, r = map(int, sys.stdin.readline().split())

def main():
    i = r + 100 * (10 - n)
    print(i)

if __name__ ==  '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = input().split()
print(n)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n, r = [int(i) for i 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(N+(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:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/B-Digits.py
#
# 1<= n <= 10**9
# 2<= k <= 10
#

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

digits = int(1)

for digit in range(1, 30):  # 2**29 < 10**9 < 2**<30 なので最高でも30桁
    if k ** digit <= n:
        digits = digits + 1
    else:
        break

print(digits)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N,R= map(int,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())
if N > 9:
    print(R)
else:
    print(R-10*(10-N))

Submission status: Wrong Answer

Solution code:
def solve():
  n, r = list(map(int, input().split()))
  if n > 10:
    print(r + 100 * (10 - n))
    return
  
  print(r)
  return
 
if __name__ == "__main__":
  solve()

Submission status: Wrong Answer

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

if __name__ == "__main__":
  solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,a=map(int,input().split())
p=1000000007
def prmd(n,i):#nPiをpで割ったときの余り．
    P=1
    for j in range(i):
        P=(P*(n-j))%p
    return (P)
def bin(N):#Nの２進数を表したときの桁数．
    t=0
    while N>0:
        N=N//2
        t=t+1
    return (t)
def blis(m):#Nの２進数を表す．
    lists=[]
    for i in range(bin(m)):
        lists.append(m%2)
        m=m//2
        if m==0:
            break
    return (lists)
def modu(a,m,q):#a**mを素数qで割ったときの余り．素数と書いたのはフェルマーの小定理を考慮している．
    t=a%q
    lista=[]
    for i in range(bin(m)):
        lista.append(t)
        t=(t**2)%q
    listb=[]
    for j in range(bin(m)):
        listb.append(lista[j]*blis(m)[j])
    s=1
    for k in range(bin(m)):
        if listb[k]>0:
            s=(s*listb[k])%q
    return (s)
def comd(A,B):#(X*Y)%pはACBをpで割った余を表す．
    B=min(B,A-B)
    X=prmd(A,B)
    Y=modu(prmd(B,B),p-2,p)
    return ((X*Y)%p)
if n-2<a:
    print (comd(2*n-1,n-1))
else:
    listm=[]
    v=1
    for i in range(a+1):
        listm.append(v)
        v=(v*(n-i)*modu(i+1,p-2,p))%p
    w=0
    k=modu(n,p-2,p)
    for j in range(a+1):
        w=(w+listm[j]**2*(n-j)*k)%p
    print (w)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,a=map(int,input().split())
p=1000000007
def prmd(n,i):#nPiをpで割ったときの余り．
    P=1
    for j in range(i):
        P=(P*(n-j))%p
    return (P)
def bin(N):#Nの２進数を表したときの桁数．
    t=0
    while N>0:
        N=N//2
        t=t+1
    return (t)
def blis(m):#Nの２進数を表す．
    lists=[]
    for i in range(bin(m)):
        lists.append(m%2)
        m=m//2
        if m==0:
            break
    return (lists)
def modu(a,m,q):#a**mを素数qで割ったときの余り．素数と書いたのはフェルマーの小定理を考慮している．
    t=a%q
    lista=[]
    for i in range(bin(m)):
        lista.append(t)
        t=(t**2)%q
    listb=[]
    for j in range(bin(m)):
        listb.append(lista[j]*blis(m)[j])
    s=1
    for k in range(bin(m)):
        if listb[k]>0:
            s=(s*listb[k])%q
    return (s)
X=prmd(2*n-1,n-1)
Y=modu(prmd(n-1,n-1),p-2,p)#(X*Y)%pは2n-1Cn-1をpで割った余を表す．
if n-1<a:
    print ((X*Y)%p)
else:
    u=0
    for i in range(a+1):
        u=u+prmd(n,i)*prmd(n-1,n-1-i)*modu(prmd(i,i),p-2,p)*modu(prmd(n-1-i,n-1-i),p-2,p)
        u=u%p
    print (u)

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

print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,*a=map(int,open(0).read().split());k=10**9+7
c=(1<<n)%k-1
for l in a:
	X=Y=j=Z=1;d=k-2
	for i in range(l):X=X*(n-i)%k
	while j<=l:Y=Y*j%k;j+=1
	while d>0:Z=Z*Y%k if d&1==1 else Z;Y=Y*Y%k;d>>=1
	c-=X*Z%k
print(c%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())

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

Submission status: Wrong Answer

Solution code:
N,*X=map(int,open(0).read().split());print(sum(map(lambda x:(round(sum(X)/N)-x)**2,X)))

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:
data = input().split()
if int(data[0]) > 10:
  ans = data[1]
else:
  ans = int(data[1]) - 100 * (10 - int(data[0]))
 
print(ans)

Submission status: Wrong Answer

Solution code:
data = input().split()
if int(data[0]) > 10:
  ans = data[1]
else:
  ans = 100 * (10 - int(data[0]))
 
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

y = k
cnt = 1
while n >= k:
    k *= y
    cnt += 1
print(cnt)

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, k = map(int, input().split())
e=1
while pow(k, e) <= n:
  e+=1
print(e)

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:
def main():

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

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

Submission status: Wrong Answer

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

if N > 9:
  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 + 800)
else:
    print(r)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if n < 10:
	print(r)
else:
  print(r + 800)

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:
def contest(N, R):
    if(N > 10):
        return R
    else:
        return R + 100 * (10-N)

if __name__ == "__main__":
    N, R = map(int, input().split())

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())
print(n, r) 

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = R - 100 * max((10 - N), 0)
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 = 2
X = [1,4]

ans = []
count = 0

for i in range(1,N+1):
    number = 0
    count = 0
    for j in X:
        number = number + ((j-i)**2)
        count = count + 1
        if N == count:
            ans.append(number)

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
from sys import stdin

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

num = n
sum_k = k

while sum_k <= n:
    sum_k= sum_k * k

print(len(str(sum_k)))

Submission status: Wrong Answer

Solution code:
deta = input().split()
n = deta[0]
r = deta[1]
if int(n)>=10:
    print(r)
else:
    rate = 100*(10-int(n))
    print(rate)

Submission status: Wrong Answer

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

N = int(N)
R = int(R)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
s=str(input())
if s== 'AAA' or s=='BBB':
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

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

N, R = [int(x) for x in 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())
print(r if n >= 10 else 100*(10-n))

Submission status: Wrong Answer

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

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

if N >= 10:
    print(R + N)

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(result)

Submission status: Wrong Answer

Solution code:
i = input().split()
N = int(i[0])
R = int(i[1])

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

print(result)

Submission status: Wrong Answer

Solution code:
i = input().split()
N = int(i[0])
R = int(i[1])

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

print(result)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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))
  print(ans)
else:
  print(r)

Submission status: Wrong Answer

Solution code:
print("")

Submission status: Wrong Answer

Solution code:
N, R = map(int, input().split(' '))
if N < 9:
    L =  R+100*(10-N)
    print('{}'.format(L))

else:
    print('{}'.format(R))

Submission status: Wrong Answer

Solution code:
N, R = map(int, input().split(' '))
if N < 9:
    L =  R+100*(10-N)
    print('{}, {}'.format(N, L))

else:
    print('{}, {}'.format(N, R))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

A = int(0)


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

print(A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import string


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


def nCr(n, r):
    return math.factorial(n)//math.factorial(n-r)*math.factorial(r)


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

Submission status: Wrong Answer

Solution code:
n, k = map(int,input().split())
 
mod7 = 10 ** 9 + 7
 
 
def power(a, b, mod):
    p = 1
    q = a
    while b != 0:
        if b % 2 == 1:
            p = (p * q) % mod
        q = (q * q) % mod
        b = b // 2
    return p
 
 
def fact(n, mod):
    p = 1
    for i in range(1, n + 1):
        p = (p * i) % mod
    return p
 
 
def combi(n, a, mod):
    if a == 0:
        return 1
    else:
        inv_af = power(fact(a, mod), mod - 2, mod)
        p = 1
        for i in range(a):
            p = (p * (n - i)) % mod
        return inv_af * p % mod
 
 
def blank(n, b, mod):
    inv_n = power(n, mod - 2, mod)
    Ans = combi(n, b, mod) ** 2 % mod
    Ans = (Ans * (n-b) * inv_n) % mod
    return Ans
 
 
def solve(n, k):
    global mod7
    Answer = 0
    if k < n - 1:
        for i in range(k + 1):
            Answer = (Answer + blank(n, i, mod7)) % mod7
 
    else:
        Answer = combi(2 * n - 1, n - 1, mod7)
    return Answer
 
 
print(solve(n, k))

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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