#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

double A,B;

double f(double x){
  return (x-A)*(x-B);
}

const int L=1e5;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin>>A>>B;
  if(A>B) swap(A,B);

  double diff=B-A;
  diff/=L;

  vector<double> D(L);
  rep(i,L) D[i]=abs(f(A+diff*i));

  double ans=0;
  for(int i=0;i<L;i++) ans+=D[i]*diff;
  cout<<fixed<<setprecision(10)<<ans<<endl;

  return 0;
}