Hust oj 1071 Jumping Jack（贪心）

Jumping Jack

Time Limit: 1000 MS Memory Limit: 65536 K Total Submit: 195(55 users) Total Accepted: 65(42 users) Rating:  Special Judge: No

Description

Jack is working on his jumping skills recently. Currently he's located at point zero of the number line. He would like to get to the point x. In order to train, he has decided that he'll first jump by only one unit, and each subsequent jump will be exactly one longer than the previous one. He can go either left or right with each jump. He wonders how many jumps he needs to reach x.

Input

For each test case: The input data consists of only one integer x ( - 10^9 <= x <= 10^9). Process to the end of file.

Output

For each test case: Output the minimal number of jumps that Jack requires to reach x.

Sample Input

2 6 0

Sample Output

3 3 0 想要用的步数最少，肯定就是往一个方向走到头，然后画图发现从（end - start） % 2 = 0处便可以往回走 #include<cstdio> #include<cmath> #include<algorithm> #include<iostream> using namespace std; int x; int main() { while(~scanf("%d",&x)) { int sum = 0; int re = fabs(x); int ans = 0; if(x == 0) { cout<<0<<endl; continue; } for(int i=1;i<=1e9;i++) { sum += i; int y = fabs(sum - re); if(y % 2 == 0 && sum >= re) { ans = i; break; } } printf("%d\n",ans); } }