快速幂算法

#include <iostream>using namespace std;int pow(int a, int b){int r = 1;while (b){if (b & 1)r *= a;a *= a;b >>= 1;}re...

陌陌623

131人浏览 · 2020-02-05 19:35:58

陌陌623 · 2020-02-05 19:35:58 发布

#include <iostream>
using namespace std;
int pow(int a, int b)
{
    int r = 1;
    while (b)
    {
        if (b & 1)
            r *= a;
        a *= a;
        b >>= 1;
    }
    return r;
}
int main()
{
    int n;
    cin >> n;
    cout << pow(2, n);
    return 0;
}