Untitled

mail@pastecode.io avatarunknown
plain_text
a month ago
329 B
2
Indexable
Never
double myPow(double x, int n) {
    if (n == 0) return 1;
    long long _n = abs(n); 
    double left = 1;
    while (_n != 1)
    {
        if (_n % 2 != 0)
        {
            _n -= 1;
            left *= x;
        }
        x *= x;
        _n /= 2;
    }
    if (n < 0)
        return 1 / (x * left);
    return x * left;
}