快速幂题解：

#include<bits/stdc++.h>
using namespace std;
long long quickpow(long long a,long long b){
	long long ans=1,base=a,p=b;
	while(p){
		if(p%2)ans*=base;
		if(ans>1e9||base>1e9){
			cout<<-1;
			exit(0);
		} 
		base*=base;
		p/=2;
	}
	return ans;
}
int main(){
	long long a,b;
	cin>>a>>b;
	cout<<quickpow(a,b);
	return 0;
}