#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vc = vector<T>;
template<class T> using vvc = vc<vc<T>>;
template<class T> using vvvc = vc<vvc<T>>;
template<class T> using vvvvc = vvc<vvc<T>>;
template<class T> using PQ = priority_queue<T>;
template<class T> using invPQ = priority_queue<T, vector<T>, greater<T>>;
using IP = pair<int, int>;
using LP = pair<ll, ll>;
#define all(x) begin(x), end(x)
#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)
#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); i++)
#define repr(i, n) for (int i = (n) - 1; (i) >= 0; i--)
#define rep3r(i, m, n) for (int i = (n) - 1; (i) >= (int)(m); i--)
template<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int t, N;
    cin >> t >> N;

    auto isok = [&] (ll x) -> bool {
        if (x - (x+1)*100/(100+t) < N) return true;
        else return false;
    };
    
    ll ok = 0, ng = 1000000000000;
    while (abs(ok - ng) > 1) {
        ll mid = (ok + ng) / 2;
        if (isok(mid)) ok = mid;
        else ng = mid;
    }

    if ((ng+1)*100/(100+t) * (100+t)/100 == ng) cout << ok << endl;
    else cout << ng << endl;
}
#ifndef DEBUG
    #define NDEBUG
#endif
#include <bits/stdc++.h>
#define def(v) int &v = e[i].v
#define cls(a) memset (a, 0, sizeof (a))
#define mset(a, b) memset (a, b, sizeof (a))
#define go(i,e,u,...) for (int i = (u), ##__VA_ARGS__; i; i = e[i].nt)
#define fir(i,a,b,...) for (int i = (a), ##__VA_ARGS__; i <= (b); ++i)
#define firr(i,a,b,...) for (int i = (a), ##__VA_ARGS__; i >= (b); --i)
#ifdef DEBUG
    #define debug(format,...) (void)(fprintf (stderr, "debug in %d: " format "\n", __LINE__, ##__VA_ARGS__))
    #define dbug(x) (void)(std::cerr << #x " = " << (x) << std::endl)
#else
    #define debug(...) (void)0
    #define dbug(...) (void)0
#endif
typedef long long LL;
template<class T>
bool rei (T& x) {
    bool f = true;
    int ch;
    for (ch = getchar (); !isdigit (ch); ch = getchar ()) {
        if (ch == EOF) return false;
        f = ch != '-';
    }
    x = 0;
    if (f) do x = x * 10 + (ch & 15); while (isdigit (ch = getchar ()));
    else do x = x * 10 - (ch & 15); while (isdigit (ch = getchar ()));
    return true;
}
template<class T1, class T2> T1& cmax (T1& a, const T2& b) {return a < b ? a = b : a;}
template<class T1, class T2> T1& cmin (T1& a, const T2& b) {return a > b ? a = b : a;}
using namespace std;
signed main () {
    LL t, n; rei (t), rei (n);
    printf ("%lld\n", (100 * n + t - 1) / t + n - 1);
    return 0;
}