#include <iostream>
#include <vector>
#include <utility>
#include<algorithm>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <random>
#include <tuple>
#include <set>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;

int main(){
  ll t,n;
  cin >> t;
  cin >> n;
  ll ans = n-1+(100*n)/t;
  if((100*n)%t != 0){
    ans ++;
  }
  cout << ans << endl;
  return 0;
}
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include <cfenv>
#include <cmath>

using namespace std;

int main() {
	double t, N;
	cin >> t >> N;

	double A = ceil(N * 100 / t);

	double B = floor(t * (A - 1.0) / 100);
	
	long long C = (long long)A + (long long)B;

	cout << C << endl;

	return 0;
}