You are remaining on the OX-hub at point 0 and you need to move to an integer point x>0. You can take a few leaps. Assume you're at present at point (y might be negative) and hop for the k-th time. You can: either leap to the point y+k
Correct answer will be upvoted else Multiple Downvoted. Computer science.
You are remaining on the OX-hub at point 0 and you need to move to an integer point x>0.
You can take a few leaps. Assume you're at present at point (y might be negative) and hop for the k-th time. You can:
either leap to the point y+k
or on the other hand leap to the point y−1.
What is the base number of hops you want to arrive at the point x?
Input
The main line contains a solitary integer t (1≤t≤1000) — the number of experiments.
The solitary line of each experiment contains the single integer x (1≤x≤106) — the objective point.
Output
For each experiment, print the single integer — the base number of leaps to arrive at x. It very well may be demonstrated that we can arrive at any integer point x.
Step by step
Solved in 4 steps with 1 images
