t = int(input())
for _ in range(t):
a,b = map(int,input().split())
x = abs(b-a)
count = (x//10)
if x%10 >=1 and x%10 <= 9:
count += 1
print(count)#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
// bool sortbysec(const pair<int,int> &a,
// const pair<int,int> &b)
// {
// return (a.first < b.first);
// }
int main(){
ll t,n,m,ans=0,d=INT_MAX,ch=0,mi=0,ma=0;
string s="",sv="",an;
cin>>t;
// char c;
//t=1;
priority_queue<ll> q;
vector<pair<ll,ll>> ve;
while(t--){
cin>>n>>m;
d=abs(m-n);
if(d%10==0)
cout<<d/10<<endl;
else
cout<<d/10+1<<endl;
}
return 0;
}Health of a person | Divisibility |
A. Movement | Numbers in a matrix |
Sequences | Split houses |
Divisible | Three primes |
Coprimes | Cost of balloons |
One String No Trouble | Help Jarvis! |
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |