快速幂

#include <iostream>#include <cstdio>using namespace std;long long QuickPow(int x,int y)//x表示底数，y表示幂级数{    long long ans=1;    long long tem=x;    while(y>0)    {        if(y&1)ans*=tem;          //y%2        y>>=1;          //y/=2        tem*=tem;     }    return ans;}int main(){    int n,m;    scanf("%d%d",&n,&m);    printf("%I64d",QuickPow(n,m));    return 0;}

仅代表个人观点，欢迎交流探讨，勿喷~~~

PhotoBy:WLOP

http://weibo.com/wlop