//Stephen Siena
//CSE 40872 - Problem 20
//November 6, 2009

#include<iostream>

using namespace std;

void minSteps(int);

int main(){

  int x, y;

  while(1){
    cin >> x;
    if (cin.eof())
      break;
    cin >> y;
    int dist = y-x;

    minSteps(dist);
  }

  return 0;
}

void minSteps(int target){

  int i = 1;
  int dist = 0;
  int nSteps = 0;

  if (target == 0){
    cout << "0" << endl;
    return;
  }

  while(1){

    dist += i;
    nSteps++;
    if (dist >= target){
      cout << nSteps << endl;
      break;
    }

    dist += i;
    nSteps++;
    if (dist >= target){
      cout << nSteps << endl;
      break;
    }

    i++;
   
  }
  return;
}