Codeforces Round #667 (Div. 3) A~D

链接: Codeforces Round #667 (Div. 3).

CF 1409 A~C

A - Yet Another Two Integers Problem

You are given two integers 𝑎 and 𝑏.In one move, you can choose some integer 𝑘 from 1 to 10 and add it to 𝑎 or subtract it from 𝑎. In other words, you choose an integer 𝑘∈[1;10] and perform 𝑎:=𝑎+𝑘. You may use different values of 𝑘 in different moves.
Your task is to find the minimum number of moves required to obtain 𝑏 from 𝑎.
You have to answer 𝑡 independent test cases.

Input

The first line of the input contains one integer 𝑡 (1≤𝑡≤2⋅10⁴) — the number of test cases. Then 𝑡 test cases follow.
The only line of the test case contains two integers 𝑎 and 𝑏 (1≤𝑎,𝑏≤10⁹).

Output

For each test case, print the answer: the minimum number of moves required to obtain 𝑏 from 𝑎.

Input

6
5 5
13 42
18 4
1337 420
123456789 1000000000
100500 9000

Output

0
3
2
92
87654322
9150

题意

给定a，b两个数，每次操作为a+k（1<= k <= 10），求最小操作数，从a到b。

求最小操作数，每次k取最大10，就是（a-