#include <iostream>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <algorithm>


using ll = long long;
#define fast_io                                                                                                                \
    ios::sync_with_stdio(false);                                                                                               \
    cin.tie(0)

using namespace std;
int dx[4] = { 0,0,1,-1 };
int dy[4] = { 1,-1,0,0 };

void solve(ll ttt) {
	ll n,t;
	cin >>t>>n;
	ll ans;
	
	ll time = n * 100 / t + ((n * 100) % t > 0);
	ans = time * (100 + t) / 100 - 1;
	
	cout << ans << endl;

}

int main(void)
{
	ll ttt = 0; 
	//cin >> t; for (ll i = 1; i <= t; i++) {solve(i);}
	solve(ttt);
	return 0;
}


#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define F first
#define S second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define debug(a) cout << #a << " = " << a << " ";

template<typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template<typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

const int  MOD=1000000007;
const int N=100005;

void solve(){
    ll a,b,c,d;
    cin>>a>>b>>c>>d;
    ll A=a*d-b*c;
    cout<<A;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    long int t=1;
    // cin>>t;                     // DON'T FORGET IT. ^^^  
    for(long int tt=1;tt<=t;tt++){
        solve();
    }
    cerr << "Time : " << 1000 * ((double) clock()) / (double) CLOCKS_PER_SEC << "ms\n";
    return 0;
}