POJ2590: Steps

DescriptionOne 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. inputInput consists of a line containing n, the number of test cases. outputFor 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. sample Input345 4845 4945 50 Sample Output334 // pure regular water question [cpp] # include <iostream> # include <cmath> using namespace std; int main () {int x, y, n; cin> n; while (n --) {cin> x> y; cout <(int) (sqrt (y-x) * 2-1e-9) <endl;} return 0 ;}