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: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input()) # n=1
def inpm(): return map(int,input().split()) # x=1,y=2
def inpl(): return list(map(int, input().split())) # a=[1,2,3,4,5,...,n]
def inpls(): return list(input().split())  # a=['1','2','3',...,'n']
def inplm(n): return list(int(input()) for _ in range(n)) # x=[] 複数行
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)] # [[1,1,1,1],[2,2,2,2],[3,3,3,3]] 
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)]) # [[1,1,1,1],[2,2,2,2],[3,3,3,3]] 


def main():
    n,r = inpm()
    if n >= 10:
        print(r)
    else:
        print(r+100*(10-n))
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    N,K=MI()
    if N>=10:
        print(K)
    else:
        print(K+100*(10-N))
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())

Submission status: Accepted

Solution code:
"""
じょえちゃんねる
高評価・チャンネル登録よろしくお願いします！
https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
"""
n, r = map(int, input().split())
if n >= 10:
    print(r)
else:
    print(r + 100 * (10 - n))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

def input():
	return stdin.readline()[:-1]

def intput():
	return int(input().rstrip())

def sinput():
	return input().rstrip().split()

def intsput():
	return map(int, sinput())

def main():
	n, r = intsput()
	if n >= 10:
		print(r)
	else:
		print(r+(100*(10-n)))



if __name__ == '__main__':
	main()

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法でnは？？

n,r=mii()

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

Submission status: Accepted

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

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do(): 
    n,r=INTM()
    print(r+(10-min(10,n))*100)
if __name__ == '__main__':
    do()

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


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

    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    R = int(next(tokens))  # type: int
    solve(N, R)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))

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

N,R = LI()

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

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353


N, R = list(map(int, sys.stdin.buffer.readline().split()))

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

Submission status: Accepted

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

k = max(100 * (10 - n), 0)

print(r+k)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    n,r= LI()
    if n >= 10:
        print(r)
    else:
        print(r+100*(10-n))
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
n=int(input())
print(math.ceil(n/2))

Submission status: Runtime Error

Solution code:
n = int(input())
X = list(map(int, input().split()))
x_min = min(X)
x_max = max(X)

min_val = 10**6 + 1

for i in range(x_min, x_max + 1):
    min_val = min(min_val, sum(map(lambda x: (x-i)**2, X)))

print(min_val)

Submission status: Runtime Error

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

#define     fast()              ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
#define     ll                  long long int
#define     test()              ll t; cin>>t; while(t--) 
#define     lp0(i,begin,end)    for(ll i=begin;i<end;i++)
#define     lp1(i,begin,end)    for(ll i=begin;i<=end;i++)
#define     rlp(i,begin,end)    for(ll i=end;i>=begin;i--)
#define     prec(n)             fixed<<setprecision(n)
#define     initial(a,i)        memset(a,i,sizeof(a))
#define     pb                  push_back
#define     PI                  3.1415926535897932384626433832795
#define     MOD                 1000000007
#define     F                   first
#define     S                   second
#define     all(a)              (a).begin(),(a).end()
#define     BPC(x)              __builtin_popcountll(x)
#define     gcd(a,b)            __gcd(a,b)

ll gcd(ll a,ll b) {if (a==0) return b;return gcd(b%a,a);}

ll power(ll x,ll n)
{
    ll result = 1;
    while (n)
    {
        if (n & 1)
            result = result * x;
        n = n / 2;
        x = x * x;
    }
    return result;
}


// Solution Function
void solution(ll compte)
{
    // cout<<compte<<"\n";
    ll n,m;
    cin>>n>>m;
    ll x =10;
    ll mn1 =min(x,n);
    cout<<(m+(100*(10-mn1)) )<<"\n";
}
// Driver Function
int main()
{
    ll compte = 1;
    //test()
    //{
        solution(compte);
        compte++;
    //}
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
R = int(input())
if 0 <= R <= 4111:
    if 10 <= N <= 100:
        print(R)
    else:
        K = 100 * (10 - N)
        M = R + K
        print(M)

Submission status: Runtime Error

Solution code:
N = int(input())
R = int(input())
if 0 <= R <= 4111:
    if 1<= N < 10:
        K = 100 * (10 - N)
        M = R + K
        print(M)
    if 10 <= N <= 100:
        print(R)

Submission status: Runtime Error

Solution code:
N = int(input())
R = int(input())
if 10 < N <= 100:
    if 0 <= R <= 4111:
        print(R)
if 1<= N < 10:
    if 0 <= R <= 4111:
        K = 100 * (10 - N)
        M = R + K
        print(M)

Submission status: Runtime Error

Solution code:
N = int(input())
R = int(input())
if 10 < N <= 100 and 0 <= R <= 4111:
    print(R)
if 1<= N < 10 and 0 <= R <= 4111:
    K = 100 * (10 - N)
    M = R + K
    print(M)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: 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().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 r + 100 * (10 - n)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import numpy as np
 
N = input()
X = list(map(int, input().split()))
ans=9999999
for P in range(max(X)):
  sum = np.sum(map(lambda x: (x-P)**2, X))
    
  if sum <= ans:
    ans = sum
    
print(ans)

Submission status: Runtime Error

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

print(ans+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,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().split())
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-100*(10-k))

Submission status: Runtime Error

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

if N < 10:
  a = 100*(10-N) + K
  print(a)
  
elif N >= 10:
  print(K)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
import math
N=int(input())
C=list(map(int,input().split()))
ave = sum(C) / len(C)
X=math.floor(ave)
Y=X+1
Xsum,Ysum=0,0
for i in range(len(C)):
  Xsum += (C[i]-X)**2
  Ysum += (C[i]-Y)**2
print(min([Xsum,Ysum]))

Submission status: Runtime Error

Solution code:
import math
N=int(input())
C=list(map(int,input().split()))
ave = sum(C) / len(C)
X=math.floor(ave)
Y=X+1
Xsum,Ysum=0,0
for i in range(len(C)):
  Xsum+=(C[i]-X)^2
  Ysum+=(C[i]-Y)^2
print(min([Xsum,Ysum]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,R = int(input())
ans = 0
if N < 10:
  ans = R
else:
  ans = R + 100 * (10-N)
print(ans)
"""
  内部-X = 表示R
  内部 = 表示R + X
"""

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

if n >= 10 :
  pint(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 + (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:
import math as mt
n,k=map(int,input().split())
print(mt.ceil(mt.log(n,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:
N,R=map(int,input().split())
print(R if N>=10 else R+(100*(10-K)))

Submission status: Runtime Error

Solution code:
N=int(input())
X=list(map(int,input().split()))
ans = 100000000
for j in range(1,max(X)+1):
  res = 0
  for i in range(N):
    res += (X[i]-j)**2
  ans=min(ans,res)
print(ans)

Submission status: Runtime Error

Solution code:
import math
N = int(input())
X = list(map(int,input().split()))
med = int(sum(X)/N + 0.5)
c = 0
for i in range(N):
  c += (X[i] - med)**2
print(c)

Submission status: Runtime Error

Solution code:
n,k = map(int, input().split())
res = 0
a = 0
while res == 0:
    if k**(a-1) < n and n <= k**a:
        ans = a
        res += 1
        break
    a += 1
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
number, base = map(int, input().split())
result_list = []
while number / base > 0:
  mod = number % base
  result_list.append(str(mod))
  number = number // base

result_list.reverse()
result = "".join(result_list)
print(len(result))

Submission status: Runtime Error

Solution code:
number, base = map(int, input().split())
result_list = []
while number / base > 0:
  mod = number % base
  result_list.append(str(mod))
  number = number // base

result_list.reverse()
result = "".join(result_list)
print(result)

Submission status: Runtime Error

Solution code:
count, outrate = input().split()
if count >= 10:
  result = outrate
  print(result)
else:
  result = outrate + 100 * (10 - count)
  print(result)

Submission status: Runtime Error

Solution code:
count, outrate = input().split()
if count >= 10:
  result = outrate
  print(inrate)
else:
  result = outrate + 100 * (10 - count)
  print(result)

Submission status: Runtime Error

Solution code:
n = int(input())
x = list(map(int,input().split()))
j = max(x)
m = 0
y = True

for i in range(n):
    if x[0] != x[i]:
        y = False

if y:
    print(0)
    exit(0)

for p in range(j):
    c = 0
    z = 0
    for i in range(n):
        z = x[i] - p
        c = c + (z * z)
    
    if m == 0:
        m = c
    else:
        if m > c:
            m = c

print(m)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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:
from decimal import Decimal, ROUND_HALF_UP
N = int(input())
X = [int(i) for i in input().split()]

ans = 0
X_mean = Decimal(str(sum(X) / N))
X_mean = X_mean.quantize(Decimal('0'), rounding=ROUND_HALF_UP)

for i in range(N):
    ans += (X[i] - X_mean) ** 2

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n, r = map(itn, 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+100*(10-N))
else:
    print(R)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

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

ans = math.ceil(math.log(n)/math.log(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-K))

Submission status: Runtime Error

Solution code:
N,R=map(int,input().split())
if N>=10:
  print('R')
else:
  print('{}'.format(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,k=map(int,input().split())
sum=0
while n>=1:
  n=n/k
  sum+=1
  
print (sum)

Submission status: Runtime Error

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

if N%2==1:
    N=int(((N-1)/2)+1)
    print(N)
else:
    N=int(N/2)
    print(N)
    
N,R=input().split()

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

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

Submission status: Runtime Error

Solution code:
n = int(input())
x = input().split(' ')

p = 0
ans = []
while p <= int(x[n-1]):
  e = 0
  for i in range(n):
    e += (int(x[i])-p)**2
  ans.append(e)
  p+=1
print(min(ans))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

while n  >= k: 
    n = n // k
    t += 1
    
print(t+1)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#A
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, nput().split())
print(r if n>10 else r+100*(10-n))