ZOJ-1871

不算难想的一题，从两头步长为1的时候开始走，每步的步长都加1，直到两端相遇，然后统计步数肯定就是最小步数

#include<stdio.h>

int main()
{
	int x, y;
	while (scanf("%d %d", &x, &y) != EOF)
	{
		int d = y - x;
		int res = 0, sum = 0, step = 1, first = 1;
		while (sum < d)
		{
			sum += first ? step : step++;
			first = !first;
			res++;
		}
		printf("%d\n", res);
	}
	return 0;
}