문제1151--Steps

### 1151: Steps

실행시간 제한: 1 Sec  메모리사용 제한: 128 MB
제출: 44  통과: 23
[제출] [채점기록] [묻고답하기]

#### 문제 설명

One steps through integer points of the straight line. The length of a step must be non-negative and can be by one bigger than, equal to, or by one smaller than the length of the previous step.
What is the minimum number of steps in order to get from x to y? The length of the first and the last step must be 1.

Input consists of a line containing n, the number of test cases. For each test case, a line follows with two integers: 0 ≤ x ≤ y < 231. For each test case, print a line giving the minimum number of steps to get from x to y.

#### 입력 설명

Input consists of a line containing n, the number of test cases. For each test case, a line follows with two integers: 0 ≤ x ≤ y < 231.

#### 출력 설명

For each test case, print a line giving the minimum number of steps to get from x to y.

#### 입력 예시 Copy

3
45 48
45 49
45 50

#### 출력 예시 Copy

3
3
4