幂运算

    技术2022-07-10  120

    #include <iostream> using namespace std; long long pow(long long x, int n) { if (n == 0) return 1; if (n == 1) return x; if (n % 2 == 0) return pow(x * x, n /2); else return pow(x * x, n / 2) * x; } int main() { int n; long long x; cin >> x; cin >> n; long long res = pow(x, n); cout << res << endl; return 0; }
    Processed: 0.014, SQL: 9