#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;

double Round(double x, int d) {
    int mul = 1;
    while (d--) {
        mul *= 10;
    }
    x *= mul;
    if (x >= 0) {
        return floor(x + 0.5) / mul;
    } else {
        return ceil(x - 0.5) / mul;
    }
}

int main() {
    int A, B;
    cin >> A >> B;
    cout << (double)(A - B) / A * 100 << "\n";
    return 0;
}

/**
     Failing doesn’t give you a reason to give up,
     as long as you believe.
                                  - Seventh Hokage
                                   (COPIED TEXT FROM BABUMOSHAI)
**/

#include <bits/stdc++.h>
#include <algorithm>
#include <string>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp> 
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define vi             vector<ll> 
#define mi             map<ll,ll>
#define pi             pair<ll,ll>
#define si             set<ll>
#define endl            "\n"
#define ins             insert 
#define hell             1000000007
#define PI              3.1415926535897932384
#define ll              long long 
#define f               first
#define s              second
#define pb             push_back
#define pp             pop_back
#define dash()         cout<<"--------"<<endl
#define fr(n)          for(ll i=0;i<n;i++)
#define FAST           ios_base::sync_with_stdio(false); cin.tie(NULL);
#define narak             998244353 
#define decimal(n)  std::cout << std::fixed;std::cout << std::setprecision(n);
#define make make_pair
#define mem0(a)         memset(a,0,sizeof(a))
#define mem1(a)         memset(a,-1,sizeof(a))
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))  
#define REVERSE(v) reverse(ALL(v))
#define maxc(v) max_element(all(v))
#define minc(v) min_element(all(v))
#define GCD(m,n) __gcd(m,n)
#define LCM(m,n) m*(n/GCD(m,n))
#define sz(a) (ll)a.size()
#define loop(i,a,b) for(ll i=a;i<=b;i++)

// for debugging

#define see(x)         cout<<#x<<" = "<<x<<endl
#define see2(x,y)      cout<<#x<<" = "<<x<<"::"<<#y<<" = "<<y<<endl


//std::ifstream in("input.txt");
//std::ofstream out("output.txt");





void solve()
{
    double x,y;
    cin>>x>>y;
    cout<<(100.0*(x-y)/x)<<endl;
}
int main() 
{ 
   decimal(15);
   FAST;
   //build();
   ll t;
   t=1;
   //cin>>t;  
   while(t--)
   solve();
   return 0;
}