题库练习 Yet Another Two Integers Problem
← 上一题 下一题 →

A13693 | Yet Another Two Integers Problem

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

You are given two integers $a$ and $b$ .

In one move, you can choose some integer $k$ from $1$ to $10$ and add it to $a$ or subtract it from $a$ . In other words, you choose an integer $k \in [1; 10]$ and perform $a := a + k$ or $a := a - k$ . You may use different values of $k$ in different moves.

Your task is to find the minimum number of moves required to obtain $b$ from $a$ .

You have to answer $t$ independent test cases.

输入格式

The first line of the input contains one integer $t$ ( $1 \le t \le 2 \cdot 10^4$ ) — the number of test cases. Then $t$ test cases follow.

The only line of the test case contains two integers $a$ and $b$ ( $1 \le a, b \le 10^9$ ).

输出格式

For each test case, print the answer: the minimum number of moves required to obtain $b$ from $a$ .

输入输出样例

输入 #1
6
5 5
13 42
18 4
1337 420
123456789 1000000000
100500 9000
输出 #1
0
3
2
92
87654322
9150
C++ 编辑器
输入
输出