快速幂模板

 

#include <bits/stdc++.h>

typedef long long ll;

using namespace std;
ll mod = 1000000007;
ll kuaisu(ll a,ll b)
{
    a = a % mod;
    ll s = 1;
    while(b)
    {
        if(b & 1) s = (s * a) % mod;
        b >>= 1;
        a = (a * a) % mod;
    }
    return s;
}
int main()
{
    ll n;
    while(cin >> n)
    {
        ll t = kuaisu(2,n);
        cout << t << endl;
    }
    return 0;
}