快速幂

#include<iostream>
#define ll long long

using namespace std;

ll quickmod(ll m,ll n) //m的n次方
{
    ll temp = m;
    ll ans=1;
    while(n>0)
    {
        if(n&1)
            ans*=temp;
        temp*=temp;
        n=n>>1;
    }
    return ans;
}
int main()
{
    //cout<<quickmod(2, 10000)<<endl;
    return 0;
}