【UvaOJ】【基础题目】【Maths - Misc】 846 - Steps

最新推荐文章于 2025-09-26 02:30:24 发布

原创最新推荐文章于 2025-09-26 02:30:24 发布 · 420 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#UvaOJ #算法入门经典

算法入门经典同时被 2 个专栏收录

20 篇文章

订阅专栏

uva oj

9 篇文章

订阅专栏

本文探讨了在给定条件下，从一个位置到另一个位置所需的最少步骤数，涉及步长变化和路径优化。

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 $\le$ x $\le$ y < 2³¹. For each test case, print a line giving the minimum number of steps to get from xto y.

Sample Input

Sample Output

3
3
4

__________________________________-

代码：

#include<stdio.h>
int main(){
	//freopen("file.in", "r", stdin);
	int T = 0;
	scanf_s("%d", &T);
	while (T--){
		int x, y;
		scanf_s("%d%d", &x, &y);
		int dis = y - x;
		int d = 0, count = 0;
		while (dis>0){
			dis -= ++d;
			count++;
			if (dis>0){
				dis -= d;
				count++;
			}
		}
		printf("%d\n", count);
	}
	return 0;
}