#include <iostream>
using namespace std;
typedef long long ll;
ll mod = 10;
ll qpow(ll a, ll n)
{
ll re = 1;
while(n)
{
if(n & 1)
re = (re * a) % mod;
n >>= 1;
a = (a * a) % mod;
}
return re % mod;
}
int main(){
ll a, n;
while(cin>>a>>n){
cout<<qpow(a, n)<<endl;
}
return 0;
}
注解1、快速幂取模模板题代码#include <iostream>using namespace std;typedef long long ll;ll mod = 10;ll qpow(ll a, ll n){ ll re = 1; while(n) { if(n & 1) re = (...