#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define rreps(i, n, s) for (int i = s; i >= n; i--)

using ll = long long;
using namespace std;
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int MOD = 1000000007;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    long double a, b;
    cin >> a >> b;
    long double res = 100 * (a - b) / a;
    cout << fixed << setprecision(5) << res << endl;

    return 0;
}
#include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
using namespace std;
void solve(){
	float a, b; cin >> a >> b ;
	vector<float>arr;
	arr.push_back(a);arr.push_back(b);
	sort(arr.begin(),arr.end());
	cout << 100-((arr[0]*100)/arr[1]) << "\n";
	return;
}

int main(){
	solve();	
}