快速幂模板

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <map>
#include <set>
#include <queue>
using namespace std;
#define lowbit(x) (x&(-x))
#define max(x,y) (x>y?x:y)
#define min(x,y) (x<y?x:y)
#define MAX 100000000000000000
#define MOD 1000000007
#define pi acos(-1.0)
#define ei exp(1)
#define PI 3.141592653589793238462
#define INF 0x3f3f3f3f3f
#define mem(a) (memset(a,0,sizeof(a)))
typedef long long ll;
ll gcd(ll a,ll b){
    return b?gcd(b,a%b):a;
}
bool cmp(int x,int y)
{
    return x>y;
}
const int N=100005;
const int mod=1e9+7;
ll qpow(int x,int n)
{
    ll ans=1;
    while(n){
        if(n&1)  // n & 1 等价于 (n % 2) == 1
            ans*=x;
        x*=x;
        n>>=1;// n >>= 1 等价于 n /= 2
    }
    return ans;
}
int main()
{
    std::ios::sync_with_stdio(false);
    ll a,n;
    while(cin>>a>>n){
        cout<<qpow(a,n)<<endl;
    }
    return 0;
}