#include <bits/stdc++.h>
#define ll long long
#define int long long
#define arr(a) new int[a]
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define dbV(arr) cout << #arr << "=[ "; \
for(auto i:arr) cout << i << " "; cout << "]\n";
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define repF(i,a,n) for(int i = (a); i <= (n); ++i)
#define repB(i,a,n) for(int i = (a); i >= (n); --i)
#define test(t) int t;cin>>t;while(t--)
#define inp(a) int a;cin>>a;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define umii unordered_map<int,int>
#define umll unordered_map<ll,ll>
#define mii map<int,int>
#define mll map<ll,ll>
#define seti set<int>
#define setl set<ll>
#define pb push_back
#define F first
#define S second
#define MOD 1000000007
#define all(z) z.begin(),z.end()
using namespace std;

void printArray(int a[],int n)
{
	rep(i,n)
	cout<<a[i]<<" ";
	cout<<"\n";
}

void printVec(vi v)
{
	int s = v.size();
	rep(i,s)
	cout<<v[i]<<" ";
	cout<<"\n";
}
void printBool(bool b)
{
 	if(b) cout<<"YES\n";
 	else cout<<"NO\n";
}
signed main()
{
 	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	cout.tie(NULL);
	int t,n;cin>>t>>n;
	int ans = ceil((100.0*n)/(t + 0.0)) + n - 1;
	cout<<ans;
 return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define loopi(n) for(ll i=0;i<n;i++) 
#define loopj(n) for(ll j=0;j<n;j++)
#define loopk(n) for(ll k=0;k<n;k++)
#define loopnode(v) for(ll i : v)
#define mod7 1000000007
#define mod9 1000000009
#define mod8 100000000
#define modl 998244353
#define pb push_back
#define mp make_pair
#define fst first
#define scnd second
typedef long long ll;
typedef long double ld;
typedef std::vector<ll> vecl;
typedef std::vector<bool> vecb;
typedef std::vector<long double> vecd;
typedef std::vector<string> vecstr;
typedef std::vector<char> vecch;
typedef std::vector< pair<ll,ll> >  vecpair;
typedef unordered_map<ll,ll> umap;
typedef unordered_map<long double,int> umapd;
typedef unordered_map<string,ll> umapstr;
typedef unordered_map<char,ll> umapc;
typedef set< ll,greater<ll>  > st;
typedef priority_queue<ll> q_max;
typedef priority_queue<ll,vector<ll>,greater<ll> > q_min;
typedef map<ll,ll> mapl; 



int main()
{	

	ll t,N;cin>>t>>N;
	if((N*100)%t == 0)
	cout<<((N*100)/t) + N -1;
	else cout<<((N*100)/t) + N;

	return 0;
		
}
