← 返回题目
题库练习 Jumping Jack
← 上一题 下一题 →

A7780 | Jumping Jack

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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$ .

输入格式

The input data consists of only one integer $x$ ( $-10^{9}<=x<=10^{9}$ ).

输出格式

Output the minimal number of jumps that Jack requires to reach $x$ .

输入输出样例

输入 #1
2
输出 #1
3
输入 #2
6
输出 #2
3
输入 #3
0
输出 #3
0
C++ 编辑器
输入
输出