代码

#include<iostream>
#include<cstdio>
#include<cctype>

#include<string>
#include<cstring>

#include<cmath>
#include<ctime>
#include<cstdlib>
#include<iomanip>
#include<algorithm>

#include<stack>
#include<queue>
#include<list>
#include<vector>
#include<deque>
#include<map>
#include<set>

#include<bitset>

int N = 100000000;

using namespace std;

typedef unsigned __int128 ulll;
typedef unsigned long long ull;

ulll normal_pow()
{
    ulll res = 3;
    for(int i = 1 ; i <= N ; i++)
    {
        res *= res;
    }
    return res;
}

ulll q_pow()//m为底数，n为指数
{
    ull m = 3;
    ulll res = 1;
    while(N)
    {
        if(N & 1)
        {
            res *= m;
        }
        m *= m;
        N >>= 1; // == n /= 2
    }
    return res;
}

int main()
{
    normal_pow();
    return 0;
}

评测结果