#include <bits/stdc++.h>
#define int int64_t

using namespace std;

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    double a,b;
    cin>>a>>b;
    double res=b/a*100;
    res=100-res;
    cout<<fixed<<setprecision(18)<<res;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x,y;
unordered_map<ll,ll> k;//h[y]表示将x变成y需要的步数
ll dfs(ll z)
{
    if(z<=x) return x-z;
    if(k.count(z)) return k[z];
    ll re=z-x;
    if(z%2==0) re=min(re,dfs(z/2)+1);  //二倍优先
    else re=min(re,min(dfs(z+1),dfs(z-1))+1);
   return k[z]=re;
}
int main()
{
    cin>>x>>y;
    //倒着逆推
    cout<<dfs(y);
    return 0;
}