跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F0493. Problem E - Steps

  • ID: 499
  • 传统题
  • 1000ms
  • 128MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:待分级
  • 上传者:
  • 待分类
  • 整理状态
  • 难度待定
  • 难度
  • 共享题库
  • 高校与竞赛共享题
  • 英文题面
  • 题目来源
  • 题面语言

Problem E - Steps

题目描述

Problem E - Steps

One steps through integer points of the straight line. The length of a step must be nonnegative 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 < 2^31. For each test case, print a line giving the minimum number of steps to get from x to y.

样例 1

输入

3
45 48
45 49
45 50

输出

3
3
4

题目来源:fps-zhblue-waterloo-000129.xml;FPS 共享题包,题包内第 5 题。保留原作者与原赛事署名。