#include<iostream>
using namespace std;
int N = 10000;//N 为取模数
long long fastPower(long long base,long long power)
{
long long result = 1;
while(power>0)
{
if(power & 1 ) //等同于power%2==1;
{
result = result * base % N;
}
power >>= 1; //等同于power /= 2;
base =( base * base ) % N;
}
return result;
}
int main()
{
long long int base,power;
cin>>base>>power;
cout<<fastPower(base,power);
}
快速幂(模板)
最新推荐文章于 2024-10-09 10:07:13 发布