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: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N, R = int(input())

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N,K = map(int,input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
n,m=map(int,input().split())
a=[]
for i in range(0,m):
    num=int(input())
    a.append(num)
    n-=a[i]
if n<=0:
    print(-1)
else:
    print(n)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n, k = map(int, input().split())
c = 0
while(n != 0):
  n //= k
  c += 1
print(c)

Submission status: Runtime Error

Solution code:
import sys
sys.stdin = open('input.txt', 'r') 
sys.stdout = open('output.txt', 'w')

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
a=list(map(int,input().split()))
s=[]
for i in range(101):
  m=0  
  for j in range(0,len(a)):
    m+=(a[j]-i)**2
  s.append(m)
print(min(s))

Submission status: Runtime Error

Solution code:
N=int(input())
a=list(map(int,input().split()))
s=[]
for i in range(max(a)):
  m=0  
  for j in range(0,len(a)):
    m+=(a[j]-i)**2
  s.append(m)
print(min(s))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
I() = input()
II() = int(input())
MII() = map(int, input().split())
LMII() = list(map(int, input().split()))

n, r = MII()
print(r+100*max((10-k), 0))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n, a, b = map(int, input().split())
mod = 10 ** 9 + 7


def comb(n, r):
    res = 1
    for i in range(1, r+1):
        res = res*(n-i+1) % mod
        res = res*pow(i, mod-2, mod) % mod
    return res


ans = (pow(2, n, mod) - comb(n, a)) % mod - comb(n, b) % mod
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
k = int(input())
if n>=10:
    print("k")
else:
    print("k+(100*(10-n))")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
k = int(input())
if n>=10:
  print(k)
else:
  print(k-(100*(10-n)))

Submission status: Runtime Error

Solution code:
n = int(input())
k = int(input())
if n>=10:
  print(k)
else:
  print(k-(100*(10-n))

Submission status: Runtime Error

Solution code:
n = int(input())
k = (input())
if n>=10:
  print(k)
else:
  print(k-(100*(10-n))

Submission status: Runtime Error

Solution code:
n, k = map(int,input().split())
know = 1
for i in range(n):
    if (n+0.5)//know == 0:
        print(i)
        break
    else:
        know *= k

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
def main():
  N=int(input())
  X=list(map(int,input().split()))
  x_mean=math.ceil(sum(X)/len(X))
  sumX=0
  for i in range(len(X)):
    sumX=sumX+(X[i]-x_mean)**2
  print(sumX)

if __name__ == '__main__':
	main()

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
c=0
if a>b:
while a//b>=b:  
  a=a//b
  c+=1
print(c+2)
else:
    print(len(a))

Submission status: Runtime Error

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

#nums = input().split(' ') #参加回数
#R = input() #%表示レーティング%
N, R = map(int, input().split())

#N = nums[0]
#R= nums[1]

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

print(ans)

Submission status: Runtime Error

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

N = input() #参加回数
R = input() #%表示レーティング%

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

print(ans)

Submission status: Runtime Error

Solution code:
import sys
input=sys.stdin.buffer.readline
#from collections import defaultdict
#d = defaultdict(int)
#import fractions
#import math
#import collections
#from collections import deque
#from bisect import bisect_left
#N = int(input())
#A = list(map(int,input().split()))
#S = list(input())
#S.remove("\n")
#N,M = map(int,input().split())
#S,T = map(str,input().split())
#A = [int(input()) for _ in range(N)]
#S = [input() for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]
#import itertools
N,R = map(int,input().split())
if N >= 10:
    print(R)
else:
    print(R+100*(10-K))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for _ in range(j)] for _ in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from itertools import accumulate #list(accumulate(A))

def pow_r_mod(x, n, mod=10**9+7):
    # 計算量 : log N
    if n == 0:
        return 1
    K = 1
    while n > 1:
        if n % 2 != 0:
            K *= x
        x *= x
        x %= mod
        n //= 2
    return (K * x) % mod

def  mod_pow(a:int, b:int, mod:int)->int:
    if b % 2 == 0:
        return (mod_pow(a, b//2, mod) ** 2) % mod
    elif b == 1:
        return a % mod
    else:
        return ((mod_pow(a, b//2, mod) ** 2) * a) % mod

m, a, b = mi()

P = 10**9+7
N = 2*(10**5)+1
inv_t = [0]+[1]
for i in range(2, N):
  inv_t += [inv_t[P % i] * (P - int(P / i)) % P]

mca = mcb = 1

for i in range(1, a+1):
    mca *= (m-i+1) * inv_t[i]
    mca %= P

for i in range(1, b+1):
    mcb *= (m-i+1) * inv_t[i]
    mcb %= P

#print((pow_r_mod(2, m)-1-mca-mcb) % P)
print((mod_pow(2, m, P)-1-mca-mcb) % P)

Submission status: Runtime Error

Solution code:
n=int(input())
x=[]
a=100000
for i in range(0,n):
    i=int(input())
    x.append(i)
for i in range(x[0],x[n-1]+1):
    h=0
    for j in range(n):
        h+=(x[j]-i)**2
    if h<a:
        a=h
print(a)

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
import math
print(1+math.floor(math.log(n,k)))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
X=list(map(int,input().split()))
def D(x,a):
	ans=0
	for i in range(len(a)):
		ans+=(x-a[i])**2
	return ans
for i in range(0,101):
	if D(i,X)<D(i+1,X):
		print(D(i,X))
		break

Submission status: Runtime Error

Solution code:
n,k = map(int,input().split())
import math
print(int(math.log(n,k))+1)

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
count=1
for i in range(1,100):
    if a/(b**i)>=1:
        count+=1
    else:
        break
print(count)

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
count=1
for i in range(1,100):
    if a/(b**i)>1:
        count+=1
    else:
        break
print(count)

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
i=1
while a//b>=b:
    a=a//b
    i+=1
if i != 1:
    i+=1
print(i)

Submission status: Runtime Error

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

MaxX = max(X)
MinX = min(X)

ListP = []

for i in range(MinX, MaxX):
    P = 0
    for j in range(N):
        P += (X[j]-i)**2
    
    ListP.append(P)

print(min(ListP))

Submission status: Runtime Error

Solution code:
N,K=map(int,input().split())
hey=N
ans=2
while hey//K >= K:
    ans += 1
    hey = hey//K
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
r = int(input())

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

Submission status: Runtime Error

Solution code:
n = int(input())
r = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
R = int(input())

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

Submission status: Runtime Error

Solution code:
def get():
    return list(map(int, input().split()))


a = get()
if a[0] < 10:
    print(a[1]+100(10 - a[0]))
else:
    print(a[1])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

while True:
    n =n//k
    A+=1
    if n//k==0:
        break
print(A)

Submission status: Runtime Error

Solution code:
N = int(input())
R = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

k = round(sum(l) / n)
ans = 0
for i in l:
    ans += (k - i) ** 2

print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
R = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x, y = gets.split(" ").map(&:to_i)
def rating_try(x, y)
  if x < 10
     y+(100*(10-x))
  else
     y
  end
end
puts rating_try(x, y)

Submission status: Runtime Error

Solution code:
x, y = gets.split.map(&:to_i)
def rating_try(x, y)
  if x < 10
     y+(100*(10-x))
  else
     y
  end
end
puts rating_try(x, y)

Submission status: Runtime Error

Solution code:
N = int(input())
R = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;

int main(void) {
    int n, r;
    cin >> n >> r;
    int ans;
    if (n >= 10) {
        cout << r << endl;
        return 0;
    }
    cout << r + 100 * (10 - n) << endl;
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,a,b=map(int,input().split());k=10**9+7;c=(1<<n)%k-1;X=Y=1
for i in range(b):X=X*(n-i)%k;Y=Y*(i+1)%k;c-=X*pow(Y,k-2,k)if i+1in(a,b)else 0
print(c%k)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(ans)

Submission status: Runtime Error

Solution code:
#coding:utf-8

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

if(n < 10):
  k = k + 100 * (10 - n)
  
print("{}".format(k))

Submission status: Runtime Error

Solution code:
A = input()
b,c = (A.split(' '))
d = int(b)
e = int(c)
f = e - 100d + 1000

if 0 < d < 11:
    print(f)
else:
    print(e)

Submission status: Runtime Error

Solution code:
A = input()
a,b = (A.split' ')
c = int(a)
d = int(b)
if 0 < c < 11:
   print('d')
else:
   print('d+1000-100c')

Submission status: Runtime Error

Solution code:
A = input()
a,b = int((A.split' '))
if 0 < a < 11:
   print('b')
else:
   print('b+1000-100a')

Submission status: Runtime Error

Solution code:
A = input()
a,b = int(A.split' ')
if 0 < a < 11:
   print('b')
else:
   print('b+1000-100a')

Submission status: Runtime Error

Solution code:
A = imput()
a,b = int(A.split' ')
if 0 < a < 11:
   print('b')
else:
   print('b+1000-100a')

Submission status: Runtime Error

Solution code:
A = imput()
a,b = (A.split' ')
if 0 < a < 11:
   print('b')
else:
   print('b+1000-100a')

Submission status: Runtime Error

Solution code:
A = input()
a,b = (A.split' ')
if 0 < a < 11:
   print('b')
else:
   print('b+1000-100a')

Submission status: Runtime Error

Solution code:
A = input()
a,b = int(A.split' ')
if  0 < a < 11:
   print(b)
else:
   print(b - 100a + 1000)

Submission status: Runtime Error

Solution code:
N = int(input())
R = int(input())

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

Submission status: Runtime Error

Solution code:
N = int(input())
R = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ave = round(sum(a) / len(a))

ans = 0
for i in a:
  ans += (i - ave)**2
  
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,r=int(input())
ans=0
if n<10:
  ans=r+r*(10-n)
else:
  ans=r
ptinr(ans)

Submission status: Runtime Error

Solution code:
import numpy as np

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

max_base = [30, 22, 16, 15, 14, 13, 12, 11, 10]
base = np.array([i for i in range(max_base[K-2])])

print(base)

base = K**base

print(base)
target = np.array([N]*max_base[K-2])

print(target)
index = np.where(base <= target, 1, 0)

print(index)
print(np.sum(index))

Submission status: Runtime Error

Solution code:
n,k = map(int, input().split())
cnt=0
while n!=0:
    n=n//k
    cnt+=1
print(cnt)

Submission status: Runtime Error

Solution code:
N,K = map(int, input().split())
sum = 0
while N!=0:
    N = N//K
    sum+=1
print(sum)

Submission status: Runtime Error

Solution code:
n = int(input())
r = int(input())

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

Submission status: Runtime Error

Solution code:
n,k = map(int, input().split())
cnt=0
while n!=0:
    n=n//k
    cnt+=1
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
X=list(map(int,input().split(" ")))
P=X[0]
L=X[N-1]
sum1=0
for i in range(N):
  sum1+=(X[i]-P)*(X[i]-P)
sum2=0
for i in range(N):
  sum2+=(X[i]-P-1)*(X[i]-P-1)
while sum1>=sum2:
  P+=1
  sum1=0
  sum2=0
  for i in range(N):
    sum1+=(X[i]-P)*(X[i]-P)
  for i in range(N):
    sum2+=(X[i]-P-1)*(X[i]-P-1)
print(sum1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(ans)

Submission status: Runtime Error

Solution code:
from sys import stdin
n,k=map(int,input().split())
c=0
while n > 0:
    c += 1
    n//=k
print(c)

Submission status: Runtime Error

Solution code:
from sys import stdin
n,k=list(map(int,input().split()))
c=0
while n > 0:
    c += 1
    n//=k
print(c)

Submission status: Runtime Error

Solution code:
from sys import stdin
n,k=list(map(int,input().split()))
c=1
while True:
    n//=k
    if n == 0
        break
    else:
        c+=1

print(c)

Submission status: Runtime Error

Solution code:
from sys import stdin

n = input()
r = input()

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

Submission status: Runtime Error

Solution code:
from sys import stdin

n = int(input())
r = int(input())

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

Submission status: Runtime Error

Solution code:
from sys import stdin

n = int(input())
r = int(input())

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

print(a)

Submission status: Runtime Error

Solution code:
from sys import stdin

n = int(input())
r = int(input())

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

print(n)

Submission status: Runtime Error

Solution code:
from sys import stdin

n = int(input())
r = int(input())

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

print(n)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
x,y = map(int,input().split())
print(math.ceil(x/y))

Submission status: Runtime Error

Solution code:
N,R = input()

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
inp = input().split()
N = int(inp[0])
K = int(inp[1])
S = 0
while N > 0:
	N = math.floor(N / K)
	S += 1

print(S)

Submission status: Runtime Error

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

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

print(insc)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(R')

Submission status: Runtime Error

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

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

print(R')

Submission status: Runtime Error

Solution code:
import numpy as np
def comb_mod(n, a, m):
  if a > n:
    return 0
  a = min(a, n-a+1)
  # tbl = [[0]*(a+1) for _ in range(2)]
  tbl = np.zeros((2, a+1), dtype=np.int64)
  tbl[0][0] = 1
  tbl[1][0] = 1
  # for i in tqdm(range(n)):
  for i in range(n):
    # tbl[i%2][0] = 1
    tbl[i%2][1:] = (tbl[(i+1)%2][1:] + tbl[(i+1)%2][:-1]) % m
    # for k in range(min(i+1, len(tbl[i%2]))):
    #   if i == k:
    #     tbl[i%2][k] = 1
    #   elif i < k:
    #     tbl[i%2][k] = 0
    #   elif k == 0:
    #     tbl[i%2][k] = 1
    #   else:
    #     tbl[i%2][k] = (tbl[(i-1)%2][k-1] + tbl[(i-1)%2][k]) % m
  return tbl[(n-1)%2][a]

n, a, b = map(int, input().split(' '))
c = 0
for i in range(1, n+1):
  if i == a or i == b:
    continue
  c += comb_mod(n, i, 1000000007)
print(c)

Submission status: Runtime Error

Solution code:
_input = input()
number = _input.split()
N = number[0]
R = number[1]
if N<10:
  R += 100 * (10-N)
print(R)

Submission status: Runtime Error

Solution code:
import os
import sys
import numpy 

if _name_=='__main__':
  _input = input()
  _input = _input.split()
  N = _input[0]
  R = _input[1]
  if N<10:
    R -= 100 * (10-N)
  print(R)

Submission status: Runtime Error

Solution code:
count = 0       #初期値を0とするcount変数を作る.
n,k = map(int,input().split())      #整数とn進数を入力する。

while True:         #nをkで割った商が0になるまでcountに1を足し続ける。
    count = count +1
    n, amari = divmod(n,k)
    if n == 0:
        break

print(count)

Submission status: Runtime Error

Solution code:
n,k = map(int,input())
lis = []
ing_total = 1

while n / k == 0:
    if n > k：
        lis.append(int(n % k))
        ing_total += 1
    else:
        if n >= 10:
            ing_total = 2
        else:
            ing_total = 1

print(ing_total)

Submission status: Runtime Error

Solution code:

e = input()
R = input()

if int(e) >= 10:
     print(R)
else :
     K = 100 * (10 - int(e))
     print(K)

Submission status: Runtime Error

Solution code:
 N = input()
 R = input()
 if N >= 10:
     print(R)
 else :
     K = 100 * (10 - int(N))
     print(K)

Submission status: Runtime Error

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

ans = 1000000000
for p in range(1,101):
  sum =0
  for x in X:
    sum += (p-x)**2
    
  ans = min(ans,sum)
  
print(ans)

Submission status: Runtime Error

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

print(b + max(0, 10 -a))

Submission status: Runtime Error

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

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

print(ans)

Submission status: Runtime Error

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

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

print(ans)

Submission status: Runtime Error

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

if(N>=10):
  ans = R
else:
  ans = R + 100×(10−K)

print(ans)

Submission status: Runtime Error

Solution code:
import math
 
i = input().split()
N = int(i[0])
K = int(i[1])
result = 0
 
result = math.log(N, K)
result = 1 + int(result)

 
print(result)

Submission status: Runtime Error

Solution code:
import math

i = input().split()
N = int(i[0])
K = int(i[1])
result = 0

result = math.log(N, K)
if int(result) != result:
  result = 1 + int(result)
else:
  result = int(result)

print(result)

Submission status: Runtime Error

Solution code:
print(R-100*(10-N))

Submission status: Runtime Error

Solution code:
N=int(input())
R=int(input())
if N>=10:
  i=R
else:
  i=R+100*(10-N)
print(i)