func_code_string: #include <bits/stdc++.h>   using namespace std;   using ld = long double;   using vi = vector<int>;   using vll = vector<long long int>;   using vd = vector<double>;   using vvi = vector<vi>;   int ctoi(char c) { return c -  0 ; }   int slen(string s) { return s.length(); }   int vsize(vi a) { return (int)a.size(); }   int in() {     int x;     cin >> x;     return x;   }   long long int n;   void kmin(long long int n, long long int m) {     long long int val = n / m;     n = n - (val * m);     long long int val1 = (m - n) * (val - 1) * (val) / 2;     long long int val2 = n * val * (val + 1) / 2;     long long int val3 = val1 + val2;     cout << val3 <<    ;   }   void kmax(long long int n, long long int m) {     n = n - (m - 1);     long long int val = n * (n - 1) / 2;     cout << val;     cout << endl;   }   const int M = 1000000;   long long int prime(long long int x) {     for (long long int i = 2; i * i <= x; i++) {       if (x % i == 0) return i;     }     return x;   }   vector<pair<long long int, long long int> > v;   set<long long int> s;   bool check(long long int x) {     for (int i = 1; i < n; i++) {       if (v[i].first % x != 0 && v[i].second % x != 0) {         return 0;       }     }     return 1;   }   void get_prime(long long int x) {     if (x % 2 == 0) s.insert(2);     while (x % 2 == 0) x = x / 2;     for (int i = 3; i <= sqrt(x); i += 2) {       if (x % i == 0) {         s.insert(i);         while (x % i == 0) x = x / i;       }     }     if (x > 2) {       s.insert(x);     }   }   vll ar[1000000];   set<long long int> cycle;   vll path;   bool vis[1000000];   int isp(int x) {     if (x < 2) return 0;     for (int i = 2; i * i <= x; i++)       if (x % i == 0) return 0;     return 1;   }   void dfs(int n, int m, int x, int y, bool visited[105][105]) {     if (x >= n || y >= m || x < 0 || y < 0 || visited[x][y]) return;     visited[x][y] = true;     cout << x + 1 <<     << y + 1 <<   n ;     for (int i = 0; i < n; i++) dfs(n, m, i, y, visited);     for (int i = 0; i < m; i++) dfs(n, m, x, i, visited);   }   void solve() {     long long int n, m, ans;     cin >> n >> m;     if (n == m) {       cout << 0;       return;     }     long long int diff = (abs)(n - m);     long long int i = 1;     while (true) {       ans = i * (i + 1) / 2;       if (diff == ans) {         ans = i;         break;       }       if (diff < ans) {         if (ans % 2 == diff % 2) {           ans = i;           break;         }       }       i++;     }     cout << ans;   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     ;     long long int t = 1;     cin >> t;     while (t--) {       solve();       cout <<   n ;     }     return 0;   }   