class Solution {

public:

    int reachNumber(int target) {

        target = abs(target);

        long n = ceil(0.5*(sqrt(+8.0*target)-1.0));

        long sum = n*(n+)/;

        if(sum==target) return n;

        long d = sum - target;

        if((d&) == ) return n;

        return n + ((n&) ?  : );

    }

};

class Solution {

public:

    int reachNumber(int target) {

        target = abs(target);

        int res = , sum = ;

        while(sum<target || (sum-target)%==)

        {

            res++;

            sum += res;

        }

        return res;

    }

};

class Solution {

public:

    int reachNumber(int target) {

        int n = ceil((sqrt(+8.0*abs(target))-)/), d = n*(n+)*0.5-abs(target);

        return n + (d%)*(n%+);

    }

};