快速幂

 1 #include<iostream>
 2 #define ll long long
 3 
 4 using namespace std;
 5 
 6 ll quickmod(ll m,ll n) //m的n次方
 7 {
 8     ll temp = m;
 9     ll ans=1;
10     while(n>0)
11     {
12         if(n&1)
13             ans*=temp;
14         temp*=m;
15         n=n>>1;
16     }
17     return ans;
18 }
19 int main()
20 {
21     //cout<<quickmod(2, 10000)<<endl;
22     return 0;
23 }