快速幂
模板,如果看不懂就自己模拟一遍试试,模拟过后就清楚了;
/**n的m次方**/
int pows(int n, int m)
{
int t = 1;
while(m)
{
if(m%2 != 0)
{
t = (t*n);
m--;
}
n = (n*n);
m /= 2;
}
return t;
}
/**n的m次方对x取余**/
int pows(int n, int m)
{
int t = 1;
while(m)
{
if(m%2 != 0)
{
t = (t*n)%x;
m--;
}
n = (n*n)%x;
m /= 2;
}
return t;
}