整数快速幂

求a^m

/**
输出啊a^m % 1e9+7的值
*/

//递归的方法 
/*
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;

typedef long long ll;
const ll mod = 1e9+7;

ll quick_power(ll a,ll m){
	if( m==0 )
		return 1;
	return m%2==0? quick_power((a*a)%mod,m/2)%mod : (quick_power((a*a)%mod,m/2)*a)%mod;
}

int main(){
	
	ll a,m;
	scanf("%I64d %I64d",&a,&m);
	ll ans = quick_power(a,m);
	printf("%I64d\n",ans);
	
	return 0;
}
*/

//非递归的方法，因为尾递归可以转化为循环来解决
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;

typedef long long int ll;
const ll mod = 1e9+7;

int main(){
	
	ll a,m;
	scanf("%I64d %I64d",&a,&m);
	ll ans = 1;
	while( m ){
		if( m%2 )
			ans = (ans*a)%mod;
		a = (a*a)%mod;
		m /= 2;
	}
	printf("%I64d\n",ans);
	return 0;
} 

思考：矩阵快速幂如何实现？