对于xy的快速幂
#include<iostream>
using namespace std;
const int mod=1000; //对1000取余
int quick_pow(int base,int power)
{
int result=1;
while(power>0)
{
if(power%2==1)
//if(power&1)
{
result=result*base%mod;
}
power=power/2;
//power>>=1;
base=(base*base)%mod;
}
return result;
}
int main()
{
int x,n=0;
cin>>x>>n;
cout<<quick_pow(x,n)<<endl;
}