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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

for i in range(1, N):
  if N/(K**i) < 1:
    print(i)
    break

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b = input()

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <typeinfo>
#include <math.h>

using namespace std;
using ll = long long;

int main() {
	ll n, r;
	cin >> n >> r;
	if (n < 10)
		cout << r - 100 * (10 - n) << endl;
	else
		cout << r << endl;
}

Submission status: Runtime Error

Solution code:
def strr():
 a=raw_input()
 return a
def sstrr():
 a=raw_input().split()
 return a
def intt():
 a=int(raw_input())
 return a
def iintt():
 a=[int(s) for s in raw_input().split()]
 return a
def nestt(t):
 a=[raw_input().split() for s in range(t)] 
 return a

nr=iintt()
n=nr[0]
r=nr[1]
a
if n>=10:
 a=r
else:
 a=r+100*(10-n)
print a

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
if(a <= 10):
    b = 100 * (10 - a) + b
# 出力
print("{}".form

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
if(a <= 10):
    b = 100 * (10 - a) + b
# 出力
print("{}

Submission status: Runtime Error

Solution code:
//#pragma GCC optimize("O3")
//#pragma GCC target("avx")

#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

// Types
using ll = long long int;
using str = string;
template <class T> using u_set = unordered_set<T>;
template <class K, class V> using u_map = unordered_map<K, V>;
template <class V> using graph = u_map<V, u_set<V>>;

namespace io {
// Input
using IS = istream;
IS &in(IS &);
IS &in(IS &i) { return i; }
template <class T, class... Ts> IS &in(IS &i, T &a, Ts &... as) {
  return in(i >> a, as...);
}
template <class V> IS &operator>>(IS &i, vector<V> &a) {
  for_each(a.begin(), a.end(), [&i](auto &e) { i >> e; });
  return i;
}
template <class F, class S> IS &operator>>(IS &i, pair<F, S> &p) {
  return in(i, p.first, p.second);
}
template <class... Ts, size_t... I>
IS &tuple_in(IS &i, tuple<Ts...> &t, index_sequence<I...>) {
  return in(i, get<I>(t)...);
}
template <class... Ts> IS &operator>>(IS &i, tuple<Ts...> &t) {
  return tuple_in(i, t, make_index_sequence<sizeof...(Ts)>());
}
// Output
using OS = ostream;
OS &out(OS &o) { return o << endl; }
template <class T> OS &out(OS &o, T const &a) { return o << a << endl; }
template <class T, class... Ts> OS &out(OS &o, T const &a, Ts const &... as) {
  return out(o << a << " ", as...);
}
template <class F, class S> OS &operator<<(OS &o, pair<F, S> const &p) {
  return o << p.first << ":" << p.second;
}
template <class... Ts> OS &args_out(OS &o, Ts const &... ts);
OS &args_out(OS &o) { return o; }
template <class T> OS &args_out(OS &o, T const &t) { return o << t; }
template <class T0, class T1, class... Ts>
OS &args_out(OS &o, T0 const &t0, T1 const &t1, Ts const &... ts) {
  return args_out(o << t0 << ",", t1, ts...);
}
template <class... Ts, size_t... I>
OS &tuple_out(OS &o, tuple<Ts...> const &t, index_sequence<I...>) {
  return args_out(o, get<I>(t)...);
}
template <class... Ts> OS &operator<<(OS &o, tuple<Ts...> const &t) {
  return tuple_out(o << "(", t, make_index_sequence<sizeof...(Ts)>()) << ")";
}
template <
    class C,
    class T = typename iterator_traits<typename C::iterator>::value_type,
    typename enable_if<!is_same<C, str>::value, nullptr_t>::type = nullptr>
OS &operator<<(OS &o, C const &a) {
  return a.empty() ? (o << "[]") : ([&o, &a]() -> OS & {
    o << "[" << *a.begin();
    for_each(next(a.begin()), a.end(), [&o](auto const &e) { o << "," << e; });
    return o << "]";
  }());
}
} // namespace io
auto input = [](auto &... a) { io::in(cin, a...); };
auto print = [](auto const &... a) { io::out(cout, a...); };
#ifdef JUMPAKU_DEBUG
auto dump = [](auto const &... a) { io::out(cerr, a...); };
#else
auto dump = [](auto const &...) {};
#endif

// Hash
namespace hashcode {
template <class... Ts> uint64_t hash_args(uint64_t h, Ts const &... ts);
uint64_t hash_args(uint64_t h) { return h; }
template <class T, class... Ts>
uint64_t hash_args(uint64_t h, T const &t, Ts const &... ts) {
  constexpr hash<T> hasher;
  return hash_args(((h << 19) - h) ^ hasher(t), ts...);
}
template <class... Ts, size_t... I>
uint64_t hash_tuple(tuple<Ts...> const &t, index_sequence<I...>) {
  return hash_args(17, get<I>(t)...);
}
} // namespace hashcode
namespace std {
template <class... Ts> struct hash<tuple<Ts...>> {
  size_t operator()(tuple<Ts...> const &t) const {
    uint64_t h = hashcode::hash_tuple(t, index_sequence_for<Ts...>());
    return h ^ (h >> 32);
  }
};
} // namespace std

// Range
namespace ranges {
template <class T, class Itr> struct iterator_base {
  using difference_type = ll;
  using value_type = T;
  using pointer = T *;
  using reference = T &;
  using iterator_category = random_access_iterator_tag;
  ll i;
  iterator_base(ll const &i = 0) : i(i) {}
  bool operator==(Itr const &itr) const { return i == itr.i; }
  bool operator!=(Itr const &itr) const { return i != itr.i; }
  ll operator-(Itr const &itr) const { return i - itr.i; }
  Itr operator++(int) { return with(i++); }
  Itr operator--(int) { return with(i--); }
  Itr operator+(ll const &n) const { return with(i + n); }
  Itr operator-(ll const &n) const { return with(i - n); }
  Itr &operator+=(ll const &n) {
    i += n;
    return self();
  }
  Itr &operator-=(ll const &n) { return self() += (-n); }
  Itr &operator++() { return self() += 1; }
  Itr &operator--() { return self() -= 1; }

protected:
  virtual Itr with(ll i) const = 0;
  virtual Itr &self() = 0;
};
template <class T> struct seq_base {
  ll const b;
  ll const e;
  seq_base(ll b, ll e) : b(b), e(e) {}
  ll size() const { return e - b; }
  bool empty() const { return size() == 0; }
};
template <class T> struct seq : seq_base<T> {
  struct iterator : iterator_base<T, iterator> {
    seq<T> const &s;
    iterator(seq<T> const &s, ll const &i)
        : iterator_base<T, iterator>(i), s(s) {}
    iterator with(ll i) const override { return iterator(s, i); }
    iterator &self() override { return *this; }
    T operator*() const { return s[this->i]; }
    iterator &operator=(iterator const &itr) {
      this->i = itr.i;
      return *this;
    }
  };
  function<T(ll)> const f;
  seq(ll b, ll e, function<T(ll)> const &f) : seq_base<T>(b, e), f(f) {}
  iterator begin() const { return iterator(*this, 0); }
  iterator end() const { return iterator(*this, this->size()); }
  T operator[](ll i) const { return f(i + this->b); }
};
struct range : seq_base<ll> {
  struct iterator : iterator_base<ll, iterator> {
    iterator(ll const &i) : iterator_base<ll, iterator>(i) {}
    iterator with(ll i) const override { return iterator(i); }
    iterator &self() override { return *this; }
    ll operator*() const { return i; }
  };
  range(ll n) : range(0LL, n) {}
  range(ll b, ll e) : seq_base<ll>(b, e) {}
  iterator begin() const { return iterator(b); }
  iterator end() const { return iterator(e); }
  ll operator[](ll i) const { return i + b; }
};
} // namespace ranges
using range = ranges::range;
range::iterator end(ll i) { return range::iterator(i); }
range::iterator begin(ll i) { return range::iterator(i); }
template <class F> auto seq(ll b, ll e, F const &f) {
  using T = decltype(f(declval<ll>()));
  return ranges::seq<T>(b, e, f);
}
template <class F> auto seq(ll n, F const &f) { return seq(0, n, f); }
template <class T = ll> vector<T> vec(size_t n, T const &init = T()) {
  return vector<T>(n, init);
}

ll gcd(ll p, ll q) { return (q == 0) ? p : gcd(q, p % q); }
ll lcm(ll p, ll q) { return p / gcd(q, p) * q; }

// MOD
ll pow(ll a, ll n, ll m) {
  if (n == 0)
    return 1;
  if (n & 1)
    return ((a % m) * pow(a, n - 1, m)) % m;
  auto b = pow(a, n / 2, m);
  return (b * b) % m;
}
ll inv(ll a, ll p) { return pow(a, p - 2, p); }
template <ll N, ll M> struct Factrial {
  Factrial() {
    fact[0] = 1;
    for (int i = 1; i <= N; ++i)
      fact[i] = (fact[i - 1] * i) % M;
    finv[N] = inv(fact[N], M);
    for (int i = N; i > 0; --i)
      finv[i - 1] = (finv[i] * i) % M;
  }
  array<ll, N + 1> fact;
  array<ll, N + 1> finv;
  ll comb(ll n, ll m) const {
    if (m < 0 || n < m)
      return 0LL;
    return (fact[n] * ((finv[m] * finv[n - m]) % M)) % M;
  }
};

constexpr ll MOD = 1e9 + 7;

void solve() {
  ll N, R;
  input(N, R);
  print((N >= 10) ? R : (R + +100 * (10 - N)));
}
int main() {
  ll t = 1;
  /** input(t); /**/
  for (auto &&i : range(t)) {
    solve();
  }
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(R)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from decimal import Decimal
from scipy.special import comb
input = sys.stdin.readline


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

    else:
        print(r)


if __name__ == '__main__':
    main()

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:
a, b, c = map(int, input().split())
if (a == b and b != c) or (b == c and c != a) or (c == a and a != b):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
n,r = input()
n,r = input().split()
n = min(10,int(n))
r = int(r)
r = 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:


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """2 2919"""
        output = """3719"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """22 3051"""
        output = """3051"""
        self.assertIO(input, output)


def resolve():
    N,R=map(int,input().split())
    print(R+max(0,10-N)*100)

if __name__ == "__main__":
    resolve()

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

Submission status: Runtime Error

Solution code:
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int r = sc.nextInt();
		if (n >= 10) {
			System.out.println(r);
		} else {
			System.out.println(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:
#include<bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(0)
#define loop(i, a, b) for(lli i=a; i<b; i++)
#define loopb(i, a, b) for(lli i=a; i>=b; i--)
#define pb push_back
#define umap unordered_map
typedef long long int lli;
typedef pair<lli, lli> pii;
typedef vector<lli> vll;
typedef pair<lli, pii> ppi;
typedef tree<lli, null_type, less<lli>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
// use to avoid collision
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
// for pair in unordered_map
struct hash_pair {
    static uint64_t splitmix64(uint64_t x) {
    // http://xorshift.di.unimi.it/splitmix64.c
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
    }
    template <class T1, class T2>
    size_t operator()(const pair<T1, T2>& p) const{
        auto hash1 = hash<T1>{}(p.first);
        auto hash2 = hash<T2>{}(p.second);
        uint64_t x = hash1 ^ hash2;
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
lli M = 1e9 + 7;
lli power(lli x, lli y){
    lli res = 1;
    x = x%M ;
    while (y > 0) {
        if (y & 1)
            res = (res*x)%M ;
        y = y>>1;
        x = (x*x)%M;
    }
    return res%M;
}
lli solve(){
    lli n, r;
    cin>>n>>r;
    if(n >= 10)
        cout<<r<<"\n";
    else
        cout<<r + 100*(10-n)<<"\n";
    return 0;
 }
int main(){
    fastio;
    lli t;
    // cin>>t;
    t = 1;
    while(t>0){
        t--;
        solve();
    }
    return 0;
}

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 - 2n))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
INF=int(float('inf'))

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

Submission status: Runtime Error

Solution code:
/*Made by Shivam Solanki*/
#include<bits/stdc++.h> 
using namespace std;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define ll long long int
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<pii> vp;
typedef vector<pll> vpll;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
typedef set<int> sii;
typedef set<ll> sll;
typedef priority_queue<int> pq;
typedef unordered_map<int,int> umii;
typedef unordered_map<ll,ll> umll;
typedef queue<int> qii;
#define rep(i,k,n) for (int i = k; i < n; ++i) 
#define repr(i,k,n) for (int i = n; i>=k; --i)
#define repll(i,k,n) for (ll i = k; i < n; ++i) 
#define repllr(i,k,n) for (ll i = n; i >= k; --i) 
#define pb push_back
#define mp make_pair
#define gcd __gcd
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
const int INF = 1e9+5;
const int MOD = 1e9+7;
 
void solve(){
    int n,r;
    cin>>n>>r;
    cout<<((100*max(10-n,0))+r)<<'\n';
} 
  
int main(){
    // #ifndef ONLINE_JUDGE  
        // freopen("input.txt", "r", stdin); 
        // freopen("output.txt", "w", stdout); 
    // #endif 
    // fastio;
    int t=1;
    // cin>>t;
    while(t--)
        solve();
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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