#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007 
#define PI 3.14159265359
#define pb push_back
#define mp make_pair
#define MP ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define IG cin.ignore(numeric_limits<streamsize>::max(),'\n');
#define ll long long int
#define ull unsigned long long int
#define N 1378
#define maxn 1000001
#define FP ff.open("output.txt")
#define FR ff.open("input.txt")
#define valid(a,b) if(a>=1 && a<row-1 && b>=1 && b<col-1)
fstream ff;
ll a, q, b, c, d, k, h, e, f, t, m, n, i, j, x, y, tcase = 0, l, r;
string s1, s2, s;
int A[100][100];
void process(){
}
int main(){
	long double a,b;
	cin>>a>>b;
	printf("%.10Lf",(1-b/a)*100);

	return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
template <typename T>
bool PN(T x){ if (x <= 1) return false; if (x == 2) return true; for (int i = 2; i < sqrt(x) + 1; i++) if (x % i == 0) return false; return true;}
const ll MOD = 1e9+7;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
long long Comb(int n, int i){long long ans = 1; if(i>n || i < 0) return 0; if(i == 0 || i == n) return 1; else {for(int j = 1; j <= i; ++j){ans *=(n+1-j); ans /= j; ans %= MOD;} }return ans;}
template<typename T> T gcd(T a, T b){if(b == 0) return a;else return gcd(b, a%b);}
template<typename T> T lcm(T a, T b){if(b > a) swap(a, b); T g = gcd(a, b);return a / g * b;}

ll ans = 0;

void judge(ll a, ll b, ll c) {
  if(a == b && b == c) ans ++; 
  else if(a == b || b == c || c == a) ans += 3; 
  else  ans += 6;
}

void solve() {
  int a, b;
  cin >> a >> b;
  cout <<((double)a-(double)b)/double(a)*100 << endl;
}

int main(void){
  solve();
  return 0;
}
