#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>

using namespace std;

int main()
{
    // input
    long long t, N;
    cin >> t >> N;

    // for (int i = 1; i <= 100; i++)
    // {
    //     cout << i << " " << (100 + t) / 100.0 * i << endl;
    // }

    cout << (long long)(100.0 / t * N + 0.99) + N - 1 << endl;
}
#include "bits/stdc++.h"
using namespace std;
#define int long long 
#define FOR(n) for(int i=0;i<n;i++)
#define rep(i,j,n) for(int i=j;i<n;i++)
#define pb push_back
#define ppb pop_back()
#define mod 1000000007
#define all(v) v.begin(),v.end()
#define every(a,n) a,a+n
#define mp make_pair
#define F first
#define S second
#define max(a, b) (a < b ? b : a)
#define min(a, b) ((a > b) ? b : a)
#define tez ios_base::sync_with_stdio(false);cin.tie(NULL);
#define all_st for(auto it=st.begin();it!=st.end();it++)
#define mp_x unordered_map<int,int>x
#define endl "\n"
#define sz(x) (int)x.size()

void solve()
{
    double a,b;
    cin>>a>>b;
    if(a==0){
        cout<<0;
        return;
    }
    else{
        cout<<(double)(a/100)*(double)b;
    }
}

signed main()
{   
    tez
    int test_case=1;
    //cin>>test_case;
    for(int i=1;i<=test_case;i++)
    {
    solve();
    }
}