快速幂

#include<bits/stdc++.h>
using namespace std;

int quickM(int a,int b)
{
	if(b==1) return a;
	
	int result=a;
	int count=1;
	do
	{		
		if(count<<1<b)
		{
			result=result*result; 
			count=count<<1;
		}		 
		else
		{
			result*=a;
			count++;
		}		
	}while(count<b);
	return result;
}

int main()
{
	cout<<quickM(5,5);
	return 0; 
}