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:
n,a,b = map(int,input().split())
s=0
 
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n
 
    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]
 
    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot
 
    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])
 
    return result
 
s=(2**n)-cmb(n,a)-cmb(n,b)-1
 
print(s%(10**9+7))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
tmp = list(input())

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

for i in range(len(s)):
    s[i] = s[i] - n
    s[i] = s[i] * s[i]
ans = 0
for i in range(len(s)):
    ans += s[i]

print(ans)

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:
def resolve():
    N = int(input())
    x_list = list(map(int, input().split()))

    x_min = min(x_list)
    x_max = max(x_list)
    hp_min = None

    for i in range(x_min, x_max+1):
        tmp_hp = 0
        for j in x_list:
            tmp_hp += (j - i)**2
        if (hp_min is None) or (tmp_hp < hp_min):
            hp_min = tmp_hp

    print(hp_min)

if __name__ == "__main__":
    resolve()

Submission status: Runtime Error

Solution code:
l = list(map(int, input().split()))
N = l[0]
R = l[1]
if N >= 10:
    print(R)

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

Submission status: Runtime Error

Solution code:
l = list(map(int, input().split()))
N = l[0]
R = l[1]
if N >= 10:
    print(R)

else:
    printint((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):
    x = 1; y = 1
    for i in range(r):
        x *= n-i
        y *= r-i
    return x*pow(y, MOD-2, MOD)

print(pow(2, n, MOD)-1 -comb(n, a) -comb(n, b))

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
n,r = int(input()),int(input()) #コンテストの参加回数と表示レーティング

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

Submission status: Runtime Error

Solution code:
n,r = int(input()),int(input) #コンテストの参加回数と表示レーティング

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
from collections import deque
N = int(input())
graph = [deque([]) for _ in range(N)]
has = []
stack = []
for i in range(N):
  u,k,* v = [int(x) for x in input().split()]
  v.sort()
  for j in v:
    graph[u-1].append(j)
time = 0
arrive_time = [-1]*N

def dfs(x):
  stack.append(x)#探索スタート地点を「探索候補スタック」に積む
  while stack:#stackが空になるまで
    v = stack.pop()
    has.append(v)#探索済みリストに取り出した地点を格納（ここが現在地点）    
    for i in graph[v-1]:
      if i in has:
        continue
      elif i in stack:
        continue
      else:
        stack.append(i)
  print(*has)
dfs(1)

Submission status: Runtime Error

Solution code:
N=int(input())

X=list(map(int, input().split()))

X.sort()
i=X[0]

min=100000000000000000
while i < X[-1]:
    power=0
    for j in range(len(X)):
        power=power+(X[j]-i)**2

    if power<=min:
        min=power

    i=i+1


print(min)

Submission status: Runtime Error

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

elif N<0:
  print("error")
  
else:
  print(R)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

def comb(N, x):
    numerator = 1
    for i in range(N-x+1, N+1):
        numerator = numerator * i % mod
    denominator = 1
    for j in range(1, x+1):
        denominator = denominator * j % mod
    d = pow(denominator, mod-2, mod)
    return numerator * d

a = comb(n, a)
b = comb(n, b)

print((pow(2, n, mod) -1 -a -b) % mod)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import os

def main():

    N,K = (int(x) for x in input().split())
    count = 0

    while(N > 0):
        N = N // K
 
        count += 1

    print(count)

if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
n, m = list(map(int, input().split()))
res = ['*'] * n
is_ok = True
for _ in range(m):
    s, c = list(map(int, input().split()))
    s -= 1
    if res[s] != '*':
        if res[s] != str(c):
            is_ok = False
            break
    res[s] = str(c)
# print(is_ok, res)
# print(res)
if not is_ok:
    print(-1)
elif n == 3 and res[0] == '0':
    # print('p1')
    print(-1)
elif n == 2 and res[0] == '0':
    # print('p2')
    print(-1)
else:
    for i in range(len(res)):
        if res[i] == '*':
            res[i] = '0'

    res_s = ''.join(res)
    # res_s = res[0] + res[1] + res[2]
    print(int(res_s))

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split(' '))
#K進数で表そう
l = []
while N >= K:
    a = N % K
    N = N // K
    l.append(a)


print(len(l) + 1)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;

int main()
{
    int n;
    int r;
    scanf("%d %d", &n, &r);
    if (n >= 10)
    {
        printf("%d\n", r);
    }
    else
    {
        printf("%d\n", r + 100 * (10 - n));
    }
}

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
in_rating = 0
N = int(input())
K = int(input())

if n >= 10:
  in_rating = K
  print(K)
else:
  in_rating = K + 100(100-K)

Submission status: Runtime Error

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

N = int[0]
R = int[1]

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

Submission status: Runtime Error

Solution code:
import numpy as np

n = int(input())
x = np.array(list(map(int,input().split())))
# x = np.array(x)
r = np.full(100, 100 * n)

for p in range(100):
    r[p] = np.sum((x - p + 1)**2)
print(np.min(r))

Submission status: Runtime Error

Solution code:
a = [int(i) for i in a.split()]
# N:参加回数　R:表示レーティング
N = a[0]
R = a[1]

# X:内部レーティング
#R = X - 100 * (10 - N)
if N >= 10:
    print(R)
else:
    print(R + 100 * (10 - N))

Submission status: Runtime Error

Solution code:
ink= input().split()
ink=[int(i) for i in ink]
in1=ink[0]
in2=ink[1]
in3=ink[2]

def nibun(a,e,h):
    #a=int(input("何乗？"))
    b=2#何進法でもできるようにする予定だった
    c=[]
    d=0
    while d==0:
        for i in range(999):
            if b**i<=a and a<b**(i+1):
                c.append(1)
                d=i

    a=a-b**d
    for x in range(d-1,-1,-1):
        if b**(x)<=a:
            a=a-(b**x)
            c.append(1)
        else:
            c.append(0)
        d=d-1
    #print(c)

    #e=int(input("何を？"))
    f=1
    g=0
    #h=int(input("mod?"))#mod
    j=1
    for i in range(len(c)-1,-1,-1):
        j=e
        if c[i]==1:
            for x in range(g):
                j=j*j%h
            f=f*j%h
        g=g+1
    return f
f=nibun(in1,2,10**9+7)

def extgcd(a,b):
    r = [1,0,a]
    w = [0,1,b]
    while w[2]!=1:
        q = r[2]//w[2]
        r2 = w
        w2 = [r[0]-q*w[0],r[1]-q*w[1],r[2]-q*w[2]]
        r = r2
        w = w2
    #[x,y]
    return [w[0],w[1]]

# aの逆元(mod m)を求める。(aとmは互いに素であることが前提)
def mod_inv(a,m):
    x = extgcd(a,m)[0]
    return (m+x%m)%m

def extgcd(a,b):
    r = [1,0,a]
    w = [0,1,b]
    while w[2]!=1:
        q = r[2]//w[2]
        r2 = w
        w2 = [r[0]-q*w[0],r[1]-q*w[1],r[2]-q*w[2]]
        r = r2
        w = w2
    #[x,y]
    return [w[0],w[1]]

# aの逆元(mod m)を求める。(aとmは互いに素であることが前提)
def mod_inv(a,m):
    x = extgcd(a,m)[0]
    return (m+x%m)%m

######################################################
p=10**6

#pは素数とする

#fact[i] : i! modp (0<= i <p) O(p)
fact = [1]
k = 1
for i in range(1,p):
    k = k*i%p
    fact.append(k)


#n! = a p^eとしたときのeを求める (O(logp n)
def mod_e(n,p):
    res = 0
    while n >= p:
        res += n//p
        n = n//p
    return res

#n! = a p^eとしたときのa mod pを求める  (O(logp n)
def mod_fact(n,p):
    if n==0:
        return 1


    res = mod_fact(n//p,p)

    if n//p %2 != 0:
        return res*(p-fact[n%p])%p
    return res*fact[n%p]%p

######################################################

#nCk mod p
def mod_comb(n,k,p):
    if n < 0 or k < 0 or n<k:
        return 0
    e1 = mod_e(n,p)
    e2 = mod_e(k,p)
    e3 = mod_e(n-k,p)
    #pで割り切れる場合
    if e1 > e2 + e3:
        return 0

    #pで割り切れない場合
    a1 = mod_fact(n,p)
    a2 = mod_fact(k,p)
    a3 = mod_fact(n-k,p)
    return a1 * mod_inv(a2*a3%p,p) %p

p =10**9+7

#fact[i] : i! modp (0<= i <p) O(p)
#上だとO(p)なのでnまでにして O(n)にする
fact = [1]
k = 1
for i in range(1,10**5+1):
    k = k*i%p
    fact.append(k)

#10000C4000 mod 10**9+7

j=mod_comb(in1,in2,p)
k=mod_comb(in1,in3,p)
x=(f-1-j-k)
print(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
int(num),int(val) = input().split(" ")

if num < 10:
	print val + 100*(10-num)
else:
	print val

Submission status: Runtime Error

Solution code:
num = raw_input()
val = raw_input()

if int(num) < 10:
	rate = int(val) + 100*(10 - int(num))
	print	rate
else:
	rate = int(val)
	print	rate

Submission status: Runtime Error

Solution code:
def main():
	num = raw_input()
	val = raw_input()

	if int(num) < 10:
		rate = int(val) + 100*(10 - int(num))
	else:
  		rate = int(val)
	print rate
if __name__ == "__main__":
	main()

Submission status: Runtime Error

Solution code:
def main():
	num = raw_input()
	val = raw_input()

	if int(num) < 10:
		rate = val + 100*(10-num)
	else:
  		rate = int(val)
	print rate
if __name__ == "__main__":
	main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, R = [int(x) for x in input()]

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N, R = [int(x) for x in input()]

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

Submission status: Runtime Error

Solution code:
22 3051

Submission status: Runtime Error

Solution code:
N,R=input().split()
N=int(N)
R=int(R)
if 1<=N<=9:
    R_exhibit=R-100*(10-N)
    print(R_exhibit)
elif N>=10:
    R_exibit=R
    print(R_exhibit)

Submission status: Runtime Error

Solution code:
N, R = map(int, input().split())
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 = map(int,input().split())

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

Submission status: Runtime Error

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

min_energy = None

for p in range(x[-1]):
    energy = 0
    for x_i in x:
        energy += (x_i - p) ** 2
    if min_energy is None:
        min_energy = energy
    else:
        min_energy = min(energy, min_energy)

print(min_energy)

Submission status: Runtime Error

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

min_energy = None

for p in range(x[-1]):
    energy = 0
    for x_i in x:
        energy += (x_i - p) ** 2
    if min_energy is None:
        min_energy = energy
    else:
        min_energy = min(energy, min_energy)

print(min_energy)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l=[int(x) for x in input().split()]
N=l[0]
R=l[1]

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

Submission status: Runtime Error

Solution code:
l=[int(x) for x in input().split()]
N=l[0]
R=l[1]
ans = 0

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

Submission status: Runtime Error

Solution code:
l=[int(x) for x in input().split()]
N=l[0]
R=l[1]
ans = 0

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N = input()
R = input()
ans = 0

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

Submission status: Runtime Error

Solution code:
[n, r] = map(int, input().rstrip().split(' '))

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

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

Submission status: Runtime Error

Solution code:
#156D
p=7+10**9
def comb(n,r):
  bunshi = 1
  for i in range(n-r+1, n+1):
    bunshi =bunshi * i % p
  bunbo = 1
  for i in range(1, r+1):
    bunbo = bunbo * i % p
  return bunshi * pow(bunbo, p-2, p)
n,a,b=map(int,input().split())
s=-1+pow(2,n,p)-comb(n,a)-comb(n,b)
print(s%p)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python

import pysnooper


def pow(m, n):
    if n == 0:
        return 1
    elif n % 2 == 0:
        return (pow(m, int(n / 2)) ** 2) % mod
    elif n % 2 == 1:
        return (pow(m, int((n - 1) * 0.5)) ** 2 * m) % mod


# @pysnooper.snoop()
def conb(n, a):
    mod1 = 1
    mod2 = 1
    for i in range(a):
        mod1 *= n - i
        mod1 %= mod
        mod2 *= i + 1
        mod2 %= mod
    mod2 = pow(mod2, mod - 2)
    return (mod1 * mod2) % mod


n, a, b = (int(val) for val in input().split())


ans = 1
noa = 1
nob = 1
mod = 1000000007
ans = pow(2, n) - 1 - conb(n, a) - conb(n, b)
ans %= mod
print(ans)

Submission status: Runtime Error

Solution code:
#AtCodr ABC156-A

N, R = input().rstrip().split(' ')
N = int(N)
R = int(R)

if N <= 9:
    rate = R+22 3051(10-N)*100
    print(rate)
else:
    print(R)

Submission status: Runtime Error

Solution code:
x,y = map(int,input().split())	

if x<10:
  r=y+100(10-x)
else:
  r=y
  
print(r)

Submission status: Runtime Error

Solution code:
x,y = map(int,input().split())	

if x<11:
  r=y+100(10-x)
else:
  r=y
  
print(r)

Submission status: Runtime Error

Solution code:
x,y = map(int,input().split())	

if x<11:
  r=y-100(10-x)
else:
  r=y
  
print(r)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b=int(input().split())
if a>9:
    print('b')
else
    print(b-(100＊(10-b))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b=int(input())
if a>10:
    print('b')
else
    print(b-(100＊(10-b))

Submission status: Runtime Error

Solution code:

num_line=input().rstrip().split(" ")
num=int(num_line[0])
a=int(num_line[1])
b=int(num_line[2])

allcase=pow(2,num,1000000007)-1
#print(allcase)

abunshi=1
for i in range(num-a+1,num+1):
    abunshi*=i
#print(abunshi)

abumbo=1
for i in range(1,a+1):
    abumbo*=i
#print(abumbo)

abumbo=pow(abumbo,1000000005,1000000007)
#print(abumbo)

aminus=abunshi*abumbo%1000000007
#print(aminus)

bbunshi=1
for i in range(num-b+1,num+1):
    bbunshi*=i
#print(bbunshi)

bbumbo=1
for i in range(1,b+1):
    bbumbo*=i
#print(bbumbo)

bbumbo=pow(bbumbo,1000000005,1000000007)
#print(bbumbo)

bminus=bbunshi*bbumbo%1000000007
#print(bminus)

print(allcase-aminus-bminus)

Submission status: Runtime Error

Solution code:
import numpy
n = int(input())
x = [int(i) for i in input().split()]
min_x = round(sum(x) / n)
ans = sum([(min_x - i)**2 for i in x])
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input(""))
R = 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 (R)
else :
  print (R+100*(10-K))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import math
def main():
    N, K = map(int, input().split())
    if K ==1:
        print(N+1)
    elif N % K == 0:
        print(math.ceil(math.log(N,K))+1)
    else:
        print(math.ceil(math.log(N,K)))


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import math
def main():
    N, K = map(int, input().split())
    if N % K == 0:
        print(math.ceil(math.log(N,K))+1)
    else:
        print(math.ceil(math.log(N,K)))


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
N = int(input())
x = list(map(int, input().split()))
 
n = len(x)
 
sum_a = 0
sum_b = 0
 
for xi in x:
  sum_a += xi * xi
  sum_b += xi
  
ans = sum_a - (sum_b*sum_b)/n
min_ans = 10**9
if ans < min_ans:
    ans = min_ans
 
print(int(ans+0.5))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,r=map(int,input().split())
if N >= 1 and N < 10:
  return R+100*(10-n)
else:
  return R

Submission status: Runtime Error

Solution code:
if N >= 1 and N < 10:
  return R+100*(10-n)
else:
  return R

Submission status: Runtime Error

Solution code:
if N >= 1 and N < 10:
  print(R+100*(10-n))
else:
  print(R)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def rating(N,R)
 if N>=10:
    return R
 else:
  return R-100*N

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

def main(lines):
  n, r = lines[0].split()
    if n >= 10:
      print(r)
    else:
      print(r + 100*(10-n))
    return
    
if __name__ == '__main__':
    lines = []
    for l in sys.stdin:
        lines.append(l.rstrip('\r\n'))
    main(lines)

Submission status: Runtime Error

Solution code:
import sys

def main(lines):
	n, r = lines[0].split()
    if n >= 10:
      print(r)
    else:
      print(r + 100*(10-n))
    return
    
if __name__ == '__main__':
    lines = []
    for l in sys.stdin:
        lines.append(l.rstrip('\r\n'))
    main(lines)

Submission status: Runtime Error

Solution code:
import sys

def main(lines):
	n, r = lines[0].split()
    if n >= 10:
      print(r)
    else:
      print(n + 100*(10-n))
    return
    
if __name__ == '__main__':
    lines = []
    for l in sys.stdin:
        lines.append(l.rstrip('\r\n'))
    main(lines)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import numpy as np
n=int(input())
x=np.fromstring(input(),int,sep=' ')
p=0
hoge=np.inf
for i in range(1,np.max(x)+1):
    sux=sum((x-i)**2)
    if sux<hoge:
        p=i
        hoge=sux
print(hoge)

Submission status: Runtime Error

Solution code:
import numpy as np
n=int(input())
x=np.fromstring(input(),int,sep=' ')
print(x)
p=0
hoge=np.inf
for i in range(1,np.max(x)+1):
    sux=sum((x-i)**2)
    if sux<hoge:
        p=i
        hoge=sux
print(hoge)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,r = map(int,input().split())
if n == 0:
  print(0)
elif n >= 10:
  print(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:
  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())
X = list(map(int, input().split()))

m = min(X)
M = max(X)

min_val = 100 * 100 * 100 * 100
for p in range(m, M+1):
    score = 0
    for x in X:
         score += (x-p)*(x-p)
    if score < min_val: min_val = score
print(min_val)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = input()
R = input()
A = N * (10-N) + R 
print(A)

Submission status: Runtime Error

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

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