#include<bits/stdc++.h>
#define ll long long int
#define pii pair<int,int>
#define F first
#define S second
#define mod 1000000007
using namespace std;

ll add(ll a,ll b){ return ((a%mod)+(b%mod))%mod; }
ll mul(ll a,ll b){ return ((a%mod)*(b%mod))%mod; }
ll sub(ll a,ll b){ ll curr=((a%mod)-(b%mod))%mod; if(curr<0) curr+=mod; return curr; }

ll power(ll a,ll b){
	if(b==0) return 1;
	if(b==1) return a;
	ll res=power(a,b/2);
	res=mul(res,res);
	if(b%2) res=mul(res,a);
	return res;
}
void solve(){
	double a,b; cin>>a>>b;
	double ans=(100.0*a-100.0*b)/a;
	cout << ans <<endl;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int t=1; ///cin>>t;
    while(t--){
    	solve();
	}
}




#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
#define INF 1e9
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define all(x) (x).begin(),(x).end()
 
int main() {
    int A,B;
    cin >> A >> B;
    double ans;
    ans = 100.0 * (A - B) / A;
    cout << ans << endl;
}